Lines Matching +defs:val +defs:entry
544 * Allocate the transition table. The first entry for each
3195 printf("testing count %d: val %d, min %d, max %d\n",
3834 printf("testing count %d: val %d, min %d, max %d\n",
4390 printf("testing count %d: val %d, min %d, max %d\n",
6508 * Get the unique entry from the hash table. The entry is created if
6519 xmlExpNodePtr entry;
6691 entry = xmlExpNewNode(ctxt, type);
6692 if (entry == NULL)
6694 entry->key = kbase;
6696 entry->exp_str = name;
6697 entry->c_max = 1;
6699 entry->exp_min = min;
6700 entry->exp_max = max;
6701 entry->exp_left = left;
6703 entry->info |= XML_EXP_NILABLE;
6705 entry->c_max = -1;
6707 entry->c_max = max * entry->exp_left->c_max;
6709 entry->exp_left = left;
6710 entry->exp_right = right;
6713 entry->info |= XML_EXP_NILABLE;
6714 if ((entry->exp_left->c_max == -1) ||
6715 (entry->exp_right->c_max == -1))
6716 entry->c_max = -1;
6717 else if (entry->exp_left->c_max > entry->exp_right->c_max)
6718 entry->c_max = entry->exp_left->c_max;
6720 entry->c_max = entry->exp_right->c_max;
6723 entry->info |= XML_EXP_NILABLE;
6724 if ((entry->exp_left->c_max == -1) ||
6725 (entry->exp_right->c_max == -1))
6726 entry->c_max = -1;
6728 entry->c_max = entry->exp_left->c_max + entry->exp_right->c_max;
6731 entry->ref = 1;
6733 entry->next = ctxt->table[key];
6735 ctxt->table[key] = entry;
6738 return(entry);
7842 const xmlChar *val;
7863 val = xmlDictLookup(ctxt->dict, BAD_CAST base, ctxt->cur - base);
7864 if (val == NULL)
7866 ret = xmlExpHashGetEntry(ctxt, XML_EXP_ATOM, NULL, NULL, val, 0, 0);