pass a pointer-to-pointer, or return a pointer? Post: 302273937

10 More Discussions You Might Find Interesting

1. Programming

pointer

void main() { int a={1,2,3,4,5,6,7,8,9,10}; int *p=a; int *q=&a; cout<<q-p+1<<endl; } The output is 10, how? if we give cout<<q it will print the address, value won't print.... if we give cout<<p it will print the address, value won't print.... p has the base addr; q...

2. Programming

Regarding char Pointer

Hi, char *s="yamaha"; cout<<s<<endl; int *p; int i=10; p=&i; cout<<p<<endl; 1) For the 1st "cout" we will get "yamaha" as output. That is we are getting "content of the address" for cout<<s. 2) But for integer "cout<<p" we are getting the "address only". Please clarify how we are...

3. Programming

pointer problem

could any one tell why the following is showing segmentation fault while using **ptr but working fine using **a #include<stdio.h> ...

4. Programming

far pointer

what is far pointer in C

5. Programming

How to return void function pointer

Hello all im trying to build function that will return void function pointer what is mean is ( not working ) the main function void * myClass::getFunction(int type){ if(type==1) return &myClass::Test1; if(type==2) return &myClass::Test2; } void myClass::Test1(){...

6. Programming

matrix pointer

Can anyone tell me what the following statements do? float (*tab); tab=(float (*)) calloc(MAXCLASS, (MAXCLASS+1)*sizeof(float));

7. Programming

Pointer Arithmetic In C

I have a fundamental question on C pointer arithmetry.. Suppose i have a c string pointer already pointing to a valid location, Can I just do a charptr = charptr +1; to get to the next location, irregardless if my program is 32 or 64 bits? or should i do it this way: charptr =...

8. Programming

Pointer to pointers

Hi guys, I'm trying to understand pointers in C and made a simple example and I've problems with It. Can someone help? #include <stdio.h> #include <stdlib.h> #include <assert.h> int f1(char **str_); int main(int argc, char **argv) { char *str = NULL; f1(&str); ...

9. Programming

Pointer for 2D array seems to be 3D in C

I am struggling with the pointer to 2D-array (cf: 2D array of pointers). Can anybody help me elaborate how the pointer x moves in the memory to access the individual of y, especially the high lighted lines? I have talked to one of the curators of the forum, but I am still not quite clear. Here...

10. Programming

Segmentation fault when I pass a char pointer to a function in C.

I am passing a char* to the function "reverse" and when I execute it with gdb I get: Program received signal SIGSEGV, Segmentation fault. 0x000000000040083b in reverse (s=0x400b2b "hello") at pointersExample.c:72 72 *q = *p; Attached is the source code. I do not understand why...

LEARN ABOUT NETBSD

stack_max

STACK(9)						   BSD Kernel Developer's Manual						  STACK(9)

NAME

     STACK -- stack macros

SYNOPSIS

     #include <sys/param.h>

     type
     STACK_ALLOC(sp, size);

     type
     STACK_MAX(sp, size);

     type
     STACK_ALIGN(sp, bytes);

     type
     STACK_GROW(sp, size);

     type
     STACK_SHRINK(sp, size);

DESCRIPTION

     A stack is an area of memory with a fixed origin but with a variable size.  A stack pointer points to the most recently referenced location
     on the stack.  Initially, when the stack has a size of zero, the stack pointer points to the origin of the stack.	When data items are added
     to the stack, the stack pointer moves away from the origin.

     The STACK_ALLOC() macro returns a pointer to allocated stack space of some size.  Given the returned pointer sp and size, STACK_MAX() returns
     the maximum stack address of the allocated stack space.  The STACK_ALIGN() macro can be used to align the stack pointer sp by the specified
     amount of bytes.

     Two basic operations are common to all stacks: a data item is added (``push'') to the location pointed by sp or a data item is removed
     (``pop'') from the stack.	The stack pointer must be subsequently adjusted by the size of the data item.  The STACK_GROW() and STACK_SHRINK()
     macros adjust the stack pointer sp by given size.

     A stack may grow either up or down.  The described macros take this into account by using the __MACHINE_STACK_GROWS_UP preprocessor define.

SEE ALSO

     param(3), queue(3)

BSD
								   April 8, 2011							       BSD