172 static Keyword aKeywordTable[] = {  variable
323 static int nKeyword = (sizeof(aKeywordTable)/sizeof(aKeywordTable[0]));
369     if( aKeywordTable[i].id==id ) break;  in findById()
371   return &aKeywordTable[i];  in findById()
382   j = aKeywordTable[i].iNext;  in reorder()
385   if( aKeywordTable[i].priority >= aKeywordTable[j].priority ) return;  in reorder()
386   aKeywordTable[i].iNext = aKeywordTable[j].iNext;  in reorder()
387   aKeywordTable[j].iNext = i+1;  in reorder()
389   reorder(&aKeywordTable[i].iNext);  in reorder()
415     if( aKeywordTable[i].mask==0 ) continue;  in main()
417       aKeywordTable[j] = aKeywordTable[i];  in main()
425     Keyword *p = &aKeywordTable[i];  in main()
437   qsort(aKeywordTable, nKeyword, sizeof(aKeywordTable[0]), keywordCompare1);  in main()
441     Keyword *p = &aKeywordTable[i];  in main()
443       Keyword *pOther = &aKeywordTable[j];  in main()
458     Keyword *p = &aKeywordTable[i];  in main()
463       pOther = &aKeywordTable[j];  in main()
474   qsort(aKeywordTable, nKeyword, sizeof(aKeywordTable[0]), keywordCompare2);  in main()
479     Keyword *p = &aKeywordTable[i];  in main()
485         Keyword *pOther = &aKeywordTable[j];  in main()
502     Keyword *p = &aKeywordTable[i];  in main()
509   qsort(aKeywordTable, nKeyword, sizeof(aKeywordTable[0]), keywordCompare3);  in main()
519       h = aKeywordTable[j].hash % i;  in main()
533     h = aKeywordTable[i].hash % bestSize;  in main()
534     aKeywordTable[i].iNext = aKWHash[h];  in main()
545     Keyword *p = &aKeywordTable[i];  in main()
602     printf(" %3d,", aKeywordTable[i].iNext);  in main()
615     printf(" %3d,", aKeywordTable[i].len+aKeywordTable[i].prefix);  in main()
629     printf(" %3d,", aKeywordTable[i].offset);  in main()
641     char *zToken = aKeywordTable[i].zTokenType;  in main()
656       printf(" %s", aKeywordTable[j-1].zOrigName);  in main()
657       j = aKeywordTable[j-1].iNext;  in main()
690            i, aKeywordTable[i].zOrigName);  in main()