Lines Matching refs:dictionary
11 // There is a dynamically updated dictionary of 16 words, each initialized with "1".
13 // the dictionary is indexed as follows,
16 // 2, dict_location = &dictionary[hash_index]
21 // 1 : the higher 22 bits of the input word is identically to the higher bits from the dictionary (hash table indexed)
22 // 2 : the above condition (partially 22 higher bits matched) is not met, a dictionary miss condition
23 // 3 : the input word is exactly matched to the word from the dictionary (hash table index)
32 // for classes 1 and 2, the input word is used to update the dictionary after it is classified/tagged
112 leal -88(%ebp), %ebp // dictionary
117 #define dictionary %ebp
139 addl dictionary, %edx // ((char*) dictionary) + HASH_TO_DICT_BYTE_OFFSET(input_word));
159 subl dictionary, %edx // dict_location - dictionary
169 // restore %ebp as normal use (was used as dictionary)
311 subl dictionary, %eax // %eax = dict_location - dictionary
351 #define dictionary %r11
397 leaq -112(%rbp), dictionary // dictionary
417 leaq (dictionary, %rax), dict_location // ((char*) dictionary) + HASH_TO_DICT_BYTE_OFFSET(input_word));
570 subq dictionary, %rcx // dict_location - dictionary
580 subq dictionary, %rax // dict_location - dictionary