Lines Matching refs:elements
402 /* Now we can free the elements and the entry in order
426 /* Now we can free the elements and the entry in order
793 /* There was one more bucket, see if it has any elements in it
1095 vector->elements = (pANTLR3_VECTOR_ELEMENT)ANTLR3_MALLOC((size_t)(sizeof(ANTLR3_VECTOR_ELEMENT) * initialSize));
1099 vector->elements = vector->internal;
1102 if (vector->elements == NULL)
1146 if (vector->elements[entry].freeptr != NULL)
1148 vector->elements[entry].freeptr(vector->elements[entry].element);
1150 vector->elements[entry].freeptr = NULL;
1151 vector->elements[entry].element = NULL;
1171 if (vector->elements[entry].freeptr != NULL)
1173 vector->elements[entry].freeptr(vector->elements[entry].element);
1175 vector->elements[entry].freeptr = NULL;
1176 vector->elements[entry].element = NULL;
1185 ANTLR3_FREE(vector->elements);
1187 vector->elements = NULL;
1206 if (vector->elements[entry].freeptr != NULL)
1208 vector->elements[entry].freeptr(vector->elements[entry].element);
1209 vector->elements[entry].freeptr = NULL;
1217 vector->elements[entry].element = NULL;
1223 ANTLR3_MEMMOVE(vector->elements + entry, vector->elements + entry + 1, sizeof(ANTLR3_VECTOR_ELEMENT) * (vector->count - entry - 1));
1237 return vector->elements[entry].element;
1264 element = vector->elements[entry].element;
1271 vector->elements[entry].element = NULL;
1272 vector->elements[entry].freeptr = NULL;
1278 ANTLR3_MEMMOVE(vector->elements + entry, vector->elements + entry + 1, sizeof(ANTLR3_VECTOR_ELEMENT) * (vector->count - entry - 1));
1306 // past the built in vector elements or were already past that
1313 vector->elements = (pANTLR3_VECTOR_ELEMENT)ANTLR3_REALLOC(vector->elements, (sizeof(ANTLR3_VECTOR_ELEMENT)* newSize));
1322 vector->elements = (pANTLR3_VECTOR_ELEMENT)ANTLR3_MALLOC((sizeof(ANTLR3_VECTOR_ELEMENT)* newSize));
1323 ANTLR3_MEMCPY(vector->elements, vector->internal, ANTLR3_VECTOR_INTERNAL_SIZE * sizeof(ANTLR3_VECTOR_ELEMENT));
1343 vector->elements[vector->count].element = element;
1344 vector->elements[vector->count].freeptr = freeptr;
1370 && vector->elements[entry].freeptr != NULL // And the existing element has a free pointer
1373 vector->elements[entry].freeptr(vector->elements[entry].element);
1378 vector->elements[entry].freeptr = freeptr;
1379 vector->elements[entry].element = element;
1408 tempEntry = vector->elements[entry1].element;
1409 freeptr = vector->elements[entry1].freeptr;
1413 vector->elements[entry1].freeptr = vector->elements[entry2].freeptr;
1414 vector->elements[entry1].element = vector->elements[entry2].element;
1416 vector->elements[entry2].freeptr = freeptr;
1417 vector->elements[entry2].element = tempEntry;
1566 // which in turn will cause any elements it holds that also have a free
1608 // to triple check. We just free up the elements if they were
1613 ANTLR3_FREE(check->elements);
1614 check->elements = NULL;
1682 vector->elements = vector->internal;
1694 * coding without conditional elements should allow branch
1988 /* We want to be able to traverse the stored elements in the order that they were
