attr.c#291 elem_NC_attrarray(const NC_attrarray *ncap, size_t elem) #295 if(ncap->nelems == 0 || (unsigned long) elem >= ncap->nelems) #300 return ncap->value[elem]; bytebuffer.c#103 bbSet(Bytebuffer* bb, unsigned int index, char elem) #107 bb->content[index] = elem; #112 bbAppend(Bytebuffer* bb, char elem) #120 bb->content[bb->length] = elem; #147 bbAppendn(Bytebuffer* bb, const void* elem, const unsigned int n0) #150 if(bb == NULL || elem == NULL) return bbFail(); #151 if(n == 0) {n = strlen((char*)elem);} #153 memcpy((void*)&bb->content[bb->length],(void*)elem,n); #160 bbInsert(Bytebuffer* bb, const unsigned int index, const char elem) #163 tmp[0]=elem; #168 bbInsertn(Bytebuffer* bb, const unsigned int index, const char* elem, const unsigned int n) #198 memcpy((void*)(bb->content+index),(void*)elem,n); daputil.c#325 nclistdeleteall(NClist* l, void* elem) #333 if(test==elem) { dim.c#302 elem_NC_dimarray(const NC_dimarray *ncap, size_t elem) #306 if(ncap->nelems == 0 || (unsigned long) elem >= ncap->nelems) #311 return ncap->value[elem]; list.c#85 listset(List* l, unsigned long index, void* elem) #89 l->content[index] = elem; #95 listinsert(List* l, unsigned long index, void* elem) #102 l->content[index] = elem; #108 listpush(List* l, void* elem) #112 l->content[l->length] = elem; #136 void* elem; #139 elem = l->content[i]; #142 return elem; #156 listcontains(List* l, void* elem) #160 if(elem == listget(l,i)) return 1; #167 listelemremove(List* l, void* elem) #175 if(elem == candidate) { list.h#48 EXTERNC int listelemremove(List* l, void* elem); nc3internal.h#118 elem_NC_dimarray(const NC_dimarray *ncap, size_t elem); #168 elem_NC_attrarray(const NC_attrarray *ncap, size_t elem); nc_hashmap.c#74 NC_dim *elem = ncap->value[table[size].data-1]; #75 NC_hashmapAddDim(ncap, table[size].data-1, elem->name->cp); #76 assert(NC_hashmapGetDim(ncap, elem->name->cp) == table[size].data-1); #99 NC_var *elem = ncap->value[table[size].data-1]; #100 NC_hashmapAddVar(ncap, table[size].data-1, elem->name->cp); #101 assert(NC_hashmapGetVar(ncap, elem->name->cp) == table[size].data-1); ncbytes.c#100 ncbytesset(NCbytes* bb, unsigned long index, char elem) #104 bb->content[index] = elem; #109 ncbytesappend(NCbytes* bb, char elem) #116 bb->content[bb->length] = (char)(elem & 0xFF); #137 ncbytesappendn(NCbytes* bb, const void* elem, unsigned long n) #139 if(bb == NULL || elem == NULL) return ncbytesfail(); #140 if(n == 0) {n = strlen((char*)elem);} #144 memcpy((void*)&bb->content[bb->length],(void*)elem,n); #151 ncbytesprepend(NCbytes* bb, char elem) #158 bb->content[0] = elem; ncgeny.c#1930 Symbol* elem = (Symbol*)listget(stack,i); #1931 if(strcmp((yyvsp[(3) - (3)].sym)->name,elem->name)==0) #1933 elem->name); nclist.c#85 nclistset(NClist* l, unsigned long index, void* elem) #89 l->content[index] = elem; #95 nclistinsert(NClist* l, unsigned long index, void* elem) #102 l->content[index] = elem; #108 nclistpush(NClist* l, void* elem) #112 l->content[l->length] = elem; #136 void* elem; #139 elem = l->content[i]; #142 return elem; #156 nclistcontains(NClist* l, void* elem) #160 if(elem == nclistget(l,i)) return 1; #167 nclistelemremove(NClist* l, void* elem) #175 if(elem == candidate) { nclist.h#48 EXTERNC int nclistelemremove(NClist* l, void* elem); ocbytes.c#100 ocbytesset(OCbytes* bb, size_t index, char elem) #104 bb->content[index] = elem; #109 ocbytesappend(OCbytes* bb, int elem) #116 bb->content[bb->length] = (char)elem; #134 ocbytesappendn(OCbytes* bb, const void* elem, size_t n) #136 if(bb == NULL || elem == NULL) return ocbytesfail(); #137 if(n == 0) {n = strlen((char*)elem);} #141 memcpy((void*)&bb->content[bb->length],(void*)elem,n); #148 ocbytesprepend(OCbytes* bb, char elem) #155 bb->content[0] = elem; oclist.c#85 oclistset(OClist* l, size_t index, void* elem) #89 l->content[index] = elem; #95 oclistinsert(OClist* l, size_t index, void* elem) #102 l->content[index] = elem; #108 oclistpush(OClist* l, void* elem) #112 l->content[l->length] = elem; #136 void* elem; #139 elem = l->content[i]; #142 return elem; #159 oclistcontains(OClist* l, void* elem) #163 if(elem == oclistget(l,i)) return 1; #170 oclistelemremove(OClist* l, void* elem) #178 if(elem == candidate) { oclist.h#48 EXTERNC int oclistelemremove(OClist* l, void* elem); var.c#328 elem_NC_vararray(const NC_vararray *ncap, size_t elem) #332 if(ncap->nelems == 0 || (unsigned long)elem >= ncap->nelems) #337 return ncap->value[elem];
HyperKWIC - Version 7.20DA executed at 11:37 on 27 Oct 2017 | Polyhedron Solutions - INTERNAL USE | COMMERCIAL (Any O/S) SN 4AKIed