nc3internal.h#71  hEntrytable;
nc_hashmap.c#65  hEntrytable = hm->table;
#68  hm->table = (hEntry*)calloc(sizeof(hEntry), hm->size);
#73    if (table[size].flags == ACTIVE) {
#74      NC_dim *elem = ncap->value[table[size].data-1];
#75      NC_hashmapAddDim(ncaptable[size].data-1, elem->name->cp);
#76      assert(NC_hashmapGetDim(ncapelem->name->cp) == table[size].data-1);
#80  free(table);
#90  hEntrytable = hm->table;
#93  hm->table = (hEntry*)calloc(sizeof(hEntry), (size_t)hm->size);
#98    if (table[size].flags == ACTIVE) {
#99      NC_var *elem = ncap->value[table[size].data-1];
#100      NC_hashmapAddVar(ncaptable[size].data-1, elem->name->cp);
#101      assert(NC_hashmapGetVar(ncapelem->name->cp) == table[size].data-1);
#105  free(table);
#121  hm->table = (hEntry*)calloc(sizeof(hEntry), (size_t)startsize);
#145      if (hash->table[index].flags & ACTIVE)
#147 hEntry entry = hash->table[index];
#152   hash->table[index].data = data+1;
#158 hash->table[index].flags |= ACTIVE;
#159 hash->table[index].data = data+1;
#160 hash->table[index].key = key;
#192      if (hash->table[index].flags & ACTIVE)
#194 hEntry entry = hash->table[index];
#199   hash->table[index].data = data+1;
#205 hash->table[index].flags |= ACTIVE;
#206 hash->table[index].data = data+1;
#207 hash->table[index].key = key;
#233    if (hash->table[index].data > 0)
#235      hEntry entry = hash->table[index];
#240 if (hash->table[index].flags & ACTIVE)
#242   hash->table[index].flags &= ~ACTIVE;
#244   return hash->table[index].data-1;
#270    if (hash->table[index].data > 0)
#272      hEntry entry = hash->table[index];
#277 if (hash->table[index].flags & ACTIVE)
#279   hash->table[index].flags &= ~ACTIVE;
#281   return hash->table[index].data-1;
#310      hEntry entry = hash->table[index];
#344      hEntry entry = hash->table[index];
#372    free(hash->table);
ncdispatch.h#196   struct NC_DispatchtableNCncp);
#200     struct NC_DispatchtableNCncp);
nchashmap.c#38  hm->table = (NClist**)malloc(hm->alloc*sizeof(NClist*));
#39  if(!hm->table) {free(hm); return NULL;}
#40  memset((void*)hm->table,0,hm->alloc*sizeof(NClist*));
#50 if(hm->table[i] != NULLnclistfree(hm->table[i]);
#52    free(hm->table);
#69    seq = hm->table[offset];
#70    if(seq == NULL) {seq = nclistnew(); hm->table[offset] = seq;}
#93    seq = hm->table[offset];
#94    if(seq == NULL) {seq = nclistnew(); hm->table[offset] = seq;}
#117    seq = hm->table[offset];
#126     if(nclistlength(seq) == 0) {nclistfree(seq); hm->table[offset] = NULL;}
#152    seq = hm->table[offset];
#170 NClistseq = hm->table[i];
#196      NClistseq = hm->table[i];
nchashmap.h#25  NClist** table;
ncpdispatch.c#44   struct NC_DispatchtableNCnc)
#110     struct NC_DispatchtableNCnc)


HyperKWIC - Version 7.20DA executed at 11:37 on 27 Oct 2017 | Polyhedron Solutions - INTERNAL USE | COMMERCIAL (Any O/S) SN 4AKIed