Lines Matching defs:table
460 * 3/ build a table state x atom for the transitions
544 * Allocate the transition table. The first entry for each
2124 * too costly, and maintining the table is like too much
3629 * @comp: the precompiled exec with a compact table
6253 xmlExpNodePtr *table;
6286 ret->table = xmlMalloc(size * sizeof(xmlExpNodePtr));
6287 if (ret->table == NULL) {
6291 memset(ret->table, 0, size * sizeof(xmlExpNodePtr));
6295 xmlFree(ret->table);
6317 if (ctxt->table != NULL)
6318 xmlFree(ctxt->table);
6357 xmlExpNodePtr next;/* the next node in the hash table or free list */
6388 * The custom hash table for unicity and canonicalization *
6464 * @table: the hash table
6466 * Get the unique entry from the hash table. The entry is created if
6621 if (ctxt->table[key] != NULL) {
6622 for (insert = ctxt->table[key]; insert != NULL;
6690 if (ctxt->table[key] != NULL)
6691 entry->next = ctxt->table[key];
6693 ctxt->table[key] = entry;
6714 /* Unlink it first from the hash table */
6716 if (ctxt->table[key] == exp) {
6717 ctxt->table[key] = exp->next;
6721 tmp = ctxt->table[key];
