Lines Matching refs:tokens
50 struct token *tokens;
116 if (tokens[token].count != 0) {
122 page_cnt += tokens[token].count;
124 if (tokens[token].next == 0)
128 token = tokens[token].next;
162 if (token_free_idx) { /* unused tokens available */
164 token_free_idx = tokens[token_free_idx].next;
197 (vm_offset_t) tokens,
219 struct token *old_tokens=tokens;
220 tokens=new_loc;
258 tokens[token].count = queue->new_pages;
260 tokens[token].count = 0; /* all obsolete items are
265 tokens[token].next = 0;
269 tokens[token].prev = 0;
271 tokens[queue->token_q_tail].next = token;
272 tokens[token].prev = queue->token_q_tail;
274 if (queue->token_q_unripe == 0) { /* only ripe tokens (token
276 if (tokens[token].count > 0)
292 tokens[token].count, /* num pages on token
322 /* no ripe tokens... must move unripe pointer */
323 queue->token_q_unripe = tokens[token].next;
331 assert(tokens[token].next == 0);
333 queue->token_q_head = tokens[token].next;
335 tokens[queue->token_q_head].count += tokens[token].count;
336 tokens[queue->token_q_head].prev = 0;
338 /* currently no other tokens in the queue */
343 queue->new_pages += tokens[token].count;
354 tokens[queue->token_q_head].count, /* num pages on new
381 assert(tokens[token].next == 0);
399 new_tail = tokens[token].prev;
402 assert(tokens[new_tail].next == token);
405 tokens[new_tail].next = 0;
408 queue->new_pages += tokens[token].count;
416 tokens[queue->token_q_head].count, /* num pages on new
441 tokens[token].next = token_free_idx;
442 tokens[token].prev = 0;
457 tokens[token].next = token_free_idx;
458 tokens[token].prev = 0;
502 /* Iterate over tokens as long as there are unripe tokens. */
504 if (tokens[queue->token_q_unripe].count && num_pages)
506 tokens[queue->token_q_unripe].count -= 1;
510 if (tokens[queue->token_q_unripe].count == 0) {
511 queue->token_q_unripe = tokens[queue->token_q_unripe].next;
515 tokens[queue->token_q_head].count, /* num pages on new
529 * if there are no unripe tokens in the queue, decrement the
563 assert(queue->token_q_head && tokens[queue->token_q_head].count == 0);
565 token_idx_t new_head = tokens[queue->token_q_head].next;
566 tokens[queue->token_q_head].next = token_free_idx;
567 tokens[queue->token_q_head].prev = 0;
570 tokens[new_head].prev = 0;
584 * Delete a ripe token from the given queue. If there are no ripe tokens on
597 if (tokens[queue->token_q_head].count == 0) {
613 * tokens, remember? */
617 count = tokens[token].count;
624 while (token_to_insert_before != 0 && count > tokens[token_to_insert_before].count) {
625 count -= tokens[token_to_insert_before].count;
626 token_to_insert_before = tokens[token_to_insert_before].next;
641 tokens[token].count = count;
644 token_to_insert_after = tokens[token_to_insert_before].prev;
646 tokens[token].next = token_to_insert_before;
647 tokens[token_to_insert_before].prev = token;
649 assert(tokens[token_to_insert_before].count >= count);
650 tokens[token_to_insert_before].count -= count;
655 tokens[token].next = 0;
663 tokens[token].prev = token_to_insert_after;
664 tokens[token_to_insert_after].next = token;
667 tokens[token].prev = 0;
880 * Are there any ripe tokens on this queue? If yes,
888 if (tokens[queue->token_q_head].count != 0) {
902 tokens[queue->token_q_head].count != 0) {
903 /* no tokens or no ripe tokens */
912 * even though no tokens are ripe.
1028 tokens[queue->token_q_head].count,
1088 tokens[queue->token_q_head].count,