Sponsored Content
Full Discussion: malloc function
Top Forums Programming malloc function Post 27865 by rajashekaran on Monday 9th of September 2002 04:28:55 AM
Old 09-09-2002
ur reply to me

/*You are not storing 580 integers in one byte. You are walking across memory by advancing the pointer by 1 with each iteration. I am surprised that the program doesn't blow up in a more random fashion.

Come to think of it, you are allocating one byte of memory and the integer data type should take between two and four bytes of memory (depending on system). My FreeBSD machine reports 4 bytes for an integer datatype.

You really should be allocating the proper amount of memory with:


code:--------------------------------------------------------------------------------
p= (int*)malloc(sizeof(int)*580);
--------------------------------------------------------------------------------*/

/*my reply*/

since by mentioning a integer pointer and storing the integers
by incrementing the pointer value
then what is the purpose of malloc?
u can decalre it as
in t *p;
several integers can be stored by incrementing the value of p,
hence what is the diffrence between this declaration and
malloc function.
this is an basic question according to my knowledge.
please answer this.
 

10 More Discussions You Might Find Interesting

1. Programming

a problem about malloc()

1 . Thanks everyone who read the post. 2 . the programe is that : #include <stdio.h> #include <string.h> void do_it(char *p) { p = (char *) malloc(100); (void )strcpy(p,"1234"); } int main(void) { char *p; do_it(p); (void )printf("p = %s \n",p); (1 Reply)
Discussion started by: chenhao_no1
1 Replies

2. Programming

malloc

hello sir since by mentioning a integer pointer and storing the integers by incrementing the pointer value then what is the purpose of malloc? u can decalre it as in t *p; several integers can be stored by incrementing the value of p, hence what is the diffrence between this... (2 Replies)
Discussion started by: rajashekaran
2 Replies

3. Programming

When to use Malloc?

Hi! I hope this is the correct forum to post the question even if I'm a newbie... I am a C-newbie (and really on the edge to be a C-addict ;) ) and have a question. When should I use malloc? To state it differently, when should I NOT use malloc? For instance, if I have an array of... (5 Replies)
Discussion started by: Tonje
5 Replies

4. Programming

malloc()

Some one please explain me what is Dynamic memory allocation and the use of malloc() function.How do we allocate memory dynamically and also the other way? (3 Replies)
Discussion started by: rash123
3 Replies

5. Programming

Malloc implementation in C

Hey Guys I am trying to implement the malloc function for my OS class and I am having a little trouble with it. I would be really grateful if I could get some hints on this problem. So I am using a doubly-linked list as my data structure and I have to allocate memory for it (duh...). The... (1 Reply)
Discussion started by: Gambit_b
1 Replies

6. UNIX for Advanced & Expert Users

Malloc Implementation in C

Hey Guys Some of my friends have got together and we are trying to write a basic kernel similar to Linux. I am trying to implement the malloc function in C and I am using a doubly linked list as the primary data structure. I need to allocate memory for this link list (duh...) and I don't feel... (2 Replies)
Discussion started by: rbansal2
2 Replies

7. Programming

Regarding the maximum memory allocated by malloc() function on HP-UX B11.11

In a 'C' program,when I am trying to allocate memory with the help of malloc () function, it is allocating the memory up to a certain limit for e.g. in my case, it is 670 MB (approx). malloc() returns NULL if I allocate more than this amount of memory.When I tried to allocate memory in chunks of... (1 Reply)
Discussion started by: vipinsachan
1 Replies

8. Programming

malloc vs new speed

Which one is faster among malloc and new? My understanding is that since new also has to call constructors after allocating memory it must be slower than malloc. Am I correct? (1 Reply)
Discussion started by: rupeshkp728
1 Replies

9. UNIX for Dummies Questions & Answers

Help with malloc()

Good day! I'm a newbie in C. I'm trying to get an unlimited input from the user using malloc then printing the inputs after the user presses enter. My code works, but there's a warning that I don't know how to fix. Please help me. Thank you. Here's my code: #include <stdio.h> #include... (6 Replies)
Discussion started by: eracav
6 Replies

10. Programming

Malloc function returning NULL

Hi All, I am using malloc function for allocating dynamic memory. When I am using below code on Linux server its working fine, but When I am trying the same code on HP UNIX server its returning NULL. below is a fragment of code in which it is giving problem. tmp = (format_tree... (4 Replies)
Discussion started by: Taher Saifuddin
4 Replies
malloc(3)						     Library Functions Manual							 malloc(3)

Name
       malloc, free, realloc, calloc, alloca - memory allocator

Syntax
       char *malloc(size)
       unsigned size;

       free(ptr)
       void *ptr;

       char *realloc(ptr, size)
       void *ptr;
       unsigned size;

       char *calloc(nelem, elsize)
       unsigned nelem, elsize;

       char *alloca(size)
       int size;

Description
       The  and  subroutines  provide a simple general-purpose memory allocation package.  The subroutine returns a pointer to a block of at least
       size bytes beginning on a word boundary.

       The argument to is a pointer to a block previously allocated by This space is made available for further allocation, but its  contents  are
       left undisturbed.

       Needless to say, grave disorder will result if the space assigned by is overrun or if some random number is handed to

       The subroutine maintains multiple lists of free blocks according to size, allocating space from the appropriate list.  It calls to get more
       memory from the system when there is no suitable space already free.  For further information, see

       The subroutine changes the size of the block pointed to by ptr to size bytes and returns a pointer to the (possibly moved) block.  The con-
       tents will be unchanged up to the lesser of the new and old sizes.

       In  order  to  be compatible with older versions, also works if ptr points to a block freed since the last call of or Sequences of and were
       previously used to attempt storage compaction.  This procedure is no longer recommended.

       The subroutine allocates space for an array of nelem elements of size elsize.  The space is initialized to zeros.

       The subroutine allocates size bytes of space associated with the stack frame of the caller.  This temporary space is  available	for  reuse
       when  the  caller returns.  On MIPS machines, calling reclaims all available storage.  On VAX machines, the space is automatically freed on
       return.

       Each of the allocation routines returns a pointer to space suitably aligned (after possible pointer coercion) for storage of  any  type	of
       object.

Restrictions
       When returns 0, the block pointed to by ptr may be destroyed.

       Currently,  the	allocator is unsuitable for direct use in a large virtual environment where many small blocks are kept, since it keeps all
       allocated and freed blocks on a circular list.  Just before more memory is allocated, all allocated and freed blocks are referenced.

       Because the subroutine is machine dependent, its use should be avoided.

Diagnostics
       The and subroutines return a null pointer (0) if there is no available memory or if the arena has been detectably corrupted by storing out-
       side the bounds of a block.

								       RISC								 malloc(3)
All times are GMT -4. The time now is 11:24 PM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy