*/
if ( pre_size < MIN_MEMBLOCK_SIZE )
list_del ( &pre->list );
- /* Zero allocated memory, for calloc() */
- memset ( block, 0, size );
DBG ( "Allocated [%p,%p)\n", block,
( ( ( void * ) block ) + size ) );
return block;
realloc ( ptr, 0 );
}
+/**
+ * Allocate cleared memory
+ *
+ * @v size Requested size
+ * @ret ptr Allocated memory
+ *
+ * Allocate memory as per malloc(), and zero it.
+ */
+void * _calloc ( size_t size ) {
+ void *data;
+
+ data = malloc ( size );
+ if ( data )
+ memset ( data, 0, size );
+ return data;
+}
+
/**
* Add memory to allocation pool
*
extern int system ( const char *command );
extern long int random ( void );
+extern void * _calloc ( size_t len );
+
/**
* Allocate cleared memory
*
*
* Allocate memory as per malloc(), and zero it.
*
- * Note that malloc() and calloc() are identical, in the interests of
- * reducing code size. Callers should not, however, rely on malloc()
- * clearing memory, since this behaviour may change in future.
+ * This is implemented as a static inline, with the body of the
+ * function in _calloc(), since in most cases @c nmemb will be 1 and
+ * doing the multiply is just wasteful.
*/
static inline void * calloc ( size_t nmemb, size_t size ) {
- return malloc ( nmemb * size );
+ return _calloc ( nmemb * size );
}
#endif /* STDLIB_H */