++large;
atomic_increment (&large);
calloc (size_t n, size_t len){  struct header *result;  size_t size = n * len;  /* Determine real implementation if not already happened.  */  if (__builtin_expect (initialized <= 0, 0))    {      if (initialized == -1)	return NULL;      me ();    }  /* If this is not the correct program just use the normal function.  */  if (not_me)    return (*callocp) (n, len);  /* Keep track of number of calls.  */  ++calls[idx_calloc];  /* Keep track of total memory consumption for `calloc'.  */  total[idx_calloc] += size;  /* Keep track of total memory requirement.  */  grand_total += size;  /* Remember the size of the request.  */  if (size < 65536)    ++histogram[size / 16];  else    ++large;  /* Total number of calls of any of the functions.  */  ++calls_total;  /* Do the real work.  */  result = (struct header *) (*mallocp) (size + sizeof (struct header));  if (result == NULL)    {      ++failed[idx_calloc];      return NULL;    }  /* Update the allocation data and write out the records if necessary.  */  update_data (result, size, 0);  /* Do what `calloc' would have done and return the buffer to the caller.  */  return memset (result + 1, '\0', size);}