Cross Reference: /osnet-11/usr/src/lib/gss_mechs/mech

Lines Matching defs:symbol
158  * Structure to track the list of unique states for a symbol
240     ucs2_t symbol;
373  * Start symbol parse functions.
879        * The parse was not terminated by the character class close symbol
1011      * If the symbol type happens to be a character and is a high surrogate,
1044      * If the symbol constructed is anything other than one of the anchors,
1075  * Construct a symbol, but only keep unique symbols.
1082     _ure_symtab_t *sp, symbol;
1085      * Build the next symbol so we can test to see if it is already in the
1086      * symbol table.
1088     (void) memset((char *) &symbol, '\0', sizeof(_ure_symtab_t));
1089     *consumed = _ure_compile_symbol(sym, limit, &symbol, b);
1092      * Check to see if the symbol exists.
1095          i < b->symtab_used && _ure_sym_neq(&symbol, sp); i++, sp++) ;
1099          * Free up any ranges used for the symbol.
1101         if ((symbol.type == _URE_CCLASS || symbol.type == _URE_NCCLASS) &&
1102             symbol.sym.ccl.ranges_size > 0)
1103           free((char *) symbol.sym.ccl.ranges);
1109      * Need to add the new symbol.
1123     symbol.id = b->symtab_used++;
1124     (void) memcpy((char *) &b->symtab[symbol.id], (char *) &symbol,
1127     return symbol.id;
1132  * End symbol parse functions.
1280      * Locate the symbol in the symbol table so the state can be added.
1281      * If the symbol doesn't exist, then a real problem exists.
1287      * Now find out if the state exists in the symbol's state list.
1513          * Go through the symbol table and generate the DFA state transitions
1514          * for each symbol that has collected NFA states.
1797                 tp->symbol = sp->trans[j].lhs;
1914             sym = dfa->syms + sp->trans[j].symbol;
2011             sym = dfa->syms + stp->trans[i].symbol;
2108                     sym = dfa->syms + stp->trans[i].symbol;