Lines Matching refs:token
77 word_token *token;
87 token = &(word_token_array[*ptoken_index]);
88 if (token->end_node != end_node)
91 *ptoken_index = token->next_token_index;
98 if ((pq->max_cost_in_q == MAXcostdata) || (token->cost > pq->max_cost_in_q))
100 pq->max_cost_in_q = token->cost;
102 ptoken_index = &(token->next_token_index);
164 word_token* token;
169 token = &(word_token_array[token_index]);
170 token_index = token->next_token_index;
176 token = &(word_token_array[pq->word_token_list]);
177 ASSERT(pq->max_cost_in_q == token->cost);
182 /*adds a word token to the priority_q. Returns the index of the word to
189 word_token *token;
207 token = &(word_token_array[token_index]);
208 printf("WORDADD PQ token %d word %d cost %d\n", token_index, token->word, token->cost);
209 token_index = token->next_token_index;
233 token = &word_token_array[(*ptoken_index)];
235 if (token->word == token_to_add->word
236 && !compare_histories(token, token_to_add, word_token_array))
238 if (token->cost < cost_to_add)
248 token = &word_token_array[ token_index_to_add];
249 token->next_token_index = (*ptoken_index);
258 if (token->cost < cost_to_add && pplace_to_add == NULL)
263 ptoken_index = &(token->next_token_index);
268 /* add the token by inserting in the linked list */
293 token = &(word_token_array[ token_index]);
295 pq->word_token_list = token->next_token_index;
308 token = &(word_token_array[token_index]);
309 pq->max_cost_in_q = token->cost;