Lines Matching refs:element
50 static ANTLR3_INT32 antlr3HashPut (pANTLR3_HASH_TABLE table, void * key, void * element, void (ANTLR3_CDECL *freeptr)(void *));
57 static ANTLR3_INT32 antlr3HashPutI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key, void * element, void (ANTLR3_CDECL *freeptr)(void *));
74 static ANTLR3_INT32 antlr3ListPut (pANTLR3_LIST list, ANTLR3_INTKEY key, void * element, void (ANTLR3_CDECL *freeptr)(void *));
75 static ANTLR3_INT32 antlr3ListAdd (pANTLR3_LIST list, void * element, void (ANTLR3_CDECL *freeptr)(void *));
84 static ANTLR3_BOOLEAN antlr3StackPush (pANTLR3_STACK stack, void * element, void (ANTLR3_CDECL *freeptr)(void *));
95 static ANTLR3_UINT32 antlr3VectorAdd (pANTLR3_VECTOR vector, void * element, void (ANTLR3_CDECL *freeptr)(void *));
96 static ANTLR3_UINT32 antlr3VectorSet (pANTLR3_VECTOR vector, ANTLR3_UINT32 entry, void * element, void (ANTLR3_CDECL *freeptr)(void *), ANTLR3_BOOLEAN freeExisting);
291 * We track the element prior to the one we are examining
320 entry = entry->nextEntry; /* Address of the next element in the bucket (if any) */
327 /** Remove the element in the hash table for a particular
348 * We track the element prior to the one we are exmaining
385 entry = entry->nextEntry; /* Address of the next element in the bucket (if any) */
392 /** Takes the element with the supplied key out of the list, and deletes the data
416 /** Takes the element with the supplied key out of the list, and deletes the data
440 /** Return the element pointer in the hash table for a particular
479 /** Return the element pointer in the hash table for a particular
519 /** Add the element pointer in to the table, based upon the
523 antlr3HashPutI(pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key, void * element, void (ANTLR3_CDECL *freeptr)(void *))
576 entry->data = element; /* Install the data element supplied */
590 /** Add the element pointer in to the table, based upon the
594 antlr3HashPut(pANTLR3_HASH_TABLE table, void * key, void * element, void (ANTLR3_CDECL *freeptr)(void *))
647 entry->data = element; /* Install the data element supplied */
696 * set to the next valid pointer. Hence if it is not a valid element
746 /* Return pointers are set up, so now we move the element
927 /** Add the supplied element to the list, at the next available key
929 static ANTLR3_INT32 antlr3ListAdd (pANTLR3_LIST list, void * element, void (ANTLR3_CDECL *freeptr)(void *))
934 return list->put(list, key, element, freeptr);
937 /** Remove from the list, but don't free the element, just send it back to the
958 antlr3ListPut (pANTLR3_LIST list, ANTLR3_INTKEY key, void * element, void (ANTLR3_CDECL *freeptr)(void *))
960 return list->table->putI(list->table, key, element, freeptr);
1020 // Delete the element that is currently at the top of the stack
1024 // And get the element that is the now the top of the stack (if anything)
1047 antlr3StackPush (pANTLR3_STACK stack, void * element, void (ANTLR3_CDECL *freeptr)(void *))
1049 stack->top = element;
1050 return (ANTLR3_BOOLEAN)(stack->vector->add(stack->vector, element, freeptr));
1148 vector->elements[entry].freeptr(vector->elements[entry].element);
1151 vector->elements[entry].element = NULL;
1173 vector->elements[entry].freeptr(vector->elements[entry].element);
1176 vector->elements[entry].element = NULL;
1181 // The entries are freed, so free the element allocation
1208 vector->elements[entry].freeptr(vector->elements[entry].element);
1217 vector->elements[entry].element = NULL;
1237 return vector->elements[entry].element;
1252 void * element;
1264 element = vector->elements[entry].element;
1271 vector->elements[entry].element = NULL;
1285 return element;
1293 // Need to resize the element pointers. We double the allocation
1325 // for external pointers. We don't want to take the time to calculate if a requested element
1344 static ANTLR3_UINT32 antlr3VectorAdd (pANTLR3_VECTOR vector, void * element, void (ANTLR3_CDECL *freeptr)(void *))
1360 vector->elements[vector->count].element = element;
1363 vector->count++; // One more element counted
1369 /// Replace the element at the specified entry point with the supplied
1373 antlr3VectorSet (pANTLR3_VECTOR vector, ANTLR3_UINT32 entry, void * element, void (ANTLR3_CDECL *freeptr)(void *), ANTLR3_BOOLEAN freeExisting)
1390 if ( entry < vector->count // If actually replacing an element
1391 && freeExisting // And told to free any existing element
1392 && vector->elements[entry].freeptr != NULL // And the existing element has a free pointer
1395 vector->elements[entry].freeptr(vector->elements[entry].element);
1401 vector->elements[entry].element = element;
1411 /// Replace the element at the specified entry point with the supplied
1430 tempEntry = vector->elements[entry1].element;
1436 vector->elements[entry1].element = vector->elements[entry2].element;
1439 vector->elements[entry2].element = tempEntry;
1605 // vector, we don't free the element allocations yet. We do that in a
1616 * we are going to free up any allocated element pointers. Note that we are doing this
1656 // We can now free this pool allocation as we have called free on every element in every vector
1733 * element provides an efficient way to find the highest bit
2707 // original element entry n is now located via vIndex[n].
2729 // Update our index. The element at i is now the one we wanted
2730 // to be sorted here and the element we swapped out is now the
2731 // element that was at i just before we swapped it. If you are lost now
