• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/gperf-3.0.4/src/

Lines Matching refs:keyword

67    Note about the keyword list starting at head:
72 duplicate equivalence class remains on the linear keyword list.
75 keyword list. Search::optimize would catch this mistake.
441 /* Outputs a keyword, as a string: enclosed in double quotes, escaping
737 proper encoding for each keyword.
924 /* Prints out a table of keyword lengths, for use with the
949 KeywordExt *keyword = temp->first();
954 if (option[SWITCH] && !option[TYPE] && !keyword->_duplicate_link)
957 if (index < keyword->_hash_value && !option[SWITCH] && !option[DUP])
960 for ( ; index < keyword->_hash_value; index++)
974 printf ("%3d", keyword->_allchars_length);
978 if (keyword->_duplicate_link) // implies option[DUP]
979 for (KeywordExt *links = keyword->_duplicate_link; links; links = links->_duplicate_link)
996 /* Prints out the string pool, containing the strings of the keyword table.
1011 KeywordExt *keyword = temp->first();
1016 if (option[SWITCH] && !option[TYPE] && !keyword->_duplicate_link)
1020 index = keyword->_hash_value;
1024 output_string (keyword->_allchars, keyword->_allchars_length);
1028 if (keyword->_duplicate_link) // implies option[DUP]
1029 for (KeywordExt *links = keyword->_duplicate_link; links; links = links->_duplicate_link)
1030 if (!(links->_allchars_length == keyword->_allchars_length
1031 && memcmp (links->_allchars, keyword->_allchars,
1032 keyword->_allchars_length) == 0))
1052 KeywordExt *keyword = temp->first();
1057 if (option[SWITCH] && !option[TYPE] && !keyword->_duplicate_link)
1064 index = keyword->_hash_value;
1068 output_string (keyword->_allchars, keyword->_allchars_length);
1071 if (keyword->_duplicate_link) // implies option[DUP]
1072 for (KeywordExt *links = keyword->_duplicate_link; links; links = links->_duplicate_link)
1073 if (!(links->_allchars_length == keyword->_allchars_length
1074 && memcmp (links->_allchars, keyword->_allchars,
1075 keyword->_allchars_length) == 0))
1191 KeywordExt *keyword = temp->first();
1196 if (option[SWITCH] && !option[TYPE] && !keyword->_duplicate_link)
1202 if (index < keyword->_hash_value && !option[SWITCH] && !option[DUP])
1205 output_keyword_blank_entries (keyword->_hash_value - index, indent);
1207 index = keyword->_hash_value;
1210 keyword->_final_index = index;
1212 output_keyword_entry (keyword, index, indent);
1215 if (keyword->_duplicate_link) // implies option[DUP]
1216 for (KeywordExt *links = keyword->_duplicate_link; links; links = links->_duplicate_link)
1221 (links->_allchars_length == keyword->_allchars_length
1222 && memcmp (links->_allchars, keyword->_allchars,
1223 keyword->_allchars_length) == 0
1224 ? keyword->_final_index
1240 the smaller, contiguous range of the keyword table. */
1254 int index; /* Index into the main keyword storage array. */
1274 fprintf (stderr, "keyword = %.*s, index = %d\n",
1288 "static linked keyword = %.*s, index = %d\n",
1436 printf ("%*s/* hash value = %4d, keyword = \"%.*s\" */\n",
1573 /* Generates C code to perform the keyword lookup. */