gsoap源码分析_alist表

typedef void* ALIST_T

#define SOAP_MAXALLOCSIZE (0)   

#define SOAP_CANARY  (0xC0DE)

void *(ALIST_T *list, size_t n);
void *soap_calloc(ALIST_T *list, size_t n);
char *soap_strdup(ALIST_T *list, const char *s);

void soap_echo_alist(ALIST_T *list);

void soap_dealloc(ALIST_T *list, void *p);

源码
void* (ALIST_T *list, size_t n)
{ 
    char *p;

    if (SOAP_MAXALLOCSIZE > 0 && n > SOAP_MAXALLOCSIZE)
        return NULL;
    if (n + sizeof(short) < n)
        return NULL;

    n += sizeof(short);
    if (n + ((-(long)n) & (sizeof(void*)-1)) + sizeof(void*) + sizeof(size_t) < n)
        return NULL;
    n += (-(long)n) & (sizeof(void*)-1); /* align at 4-, 8- or 16-byte boundary by rounding up */   
    p = (char*)SOAP_MALLOC(n + sizeof(void*) + sizeof(size_t));
    if (!p)
    { 
        return NULL;
    }
    /* set a canary word to detect memory overruns and data corruption */
    *(unsigned short*)(p + n - sizeof(unsigned short)) = (unsigned short)SOAP_CANARY;
    /* keep chain of alloced cells for destruction */
    *(void**)(p + n) = *list;
    *(size_t*)(p + n + sizeof(void*)) = n;
    *list = p + n;
    PRINT_Y("[%d]List:%x", n, *list);
    
    return p;
}
void* soap_calloc(ALIST_T *list, size_t n)
{
    char *p;

    p = soap_malloc(list, n);
    if (p)
    {
        memset(p, 0, n);
    }

    return p;    
}

char *soap_strdup(ALIST_T *list, const char *s)
{ 
  char *t = NULL;
  if (s)
  { 
    size_t n = strlen(s) + 1;
    if (n > 0)
    { t = (char*)soap_malloc(list, n);
      if (t)
      { memcpy((void*)t, (const void*)s, n);
        t[n - 1] = '