Searched refs:best_node (Results 1 – 5 of 5) sorted by relevance
228 signed best_node = -1; in lcra_get_best_spill_node() local242 best_node = i; in lcra_get_best_spill_node()246 return best_node; in lcra_get_best_spill_node()
1290 gpir_node *best_node = NULL; in try_node() local1304 if (node->sched.dist < best_node->sched.dist) in try_node()1312 if (score == INT_MIN && !best_node && in try_node()1320 best_node = node; in try_node()1327 best_node = node; in try_node()1332 if (best_node) { in try_node()1333 gpir_debug("scheduling %d (score = %d)%s\n", best_node->index, in try_node()1334 best_score, best_node->sched.max_node ? " (max)" : ""); in try_node()1335 ASSERTED int score = schedule_try_node(ctx, best_node, false); in try_node()
1688 const Node *best_node = storage_->GetNode(best_node_index); in Insert() local1705 uint32_t next_array_buffer_size = 1u << best_node->log2_num_children(); in Insert()1706 Next *cur_next = storage_->GetMutableNextArray(best_node->next_index(), in Insert()1726 storage_->GetMutableNode(storage_->GetNodeIndex(best_node)); in Insert()1782 const Node *best_node = storage_->GetNode(best_node_index); in Find() local1783 if (key_offset >= 0 && best_node->is_leaf() && in Find()1784 !strcmp(key + key_offset, storage_->GetSuffix(best_node->next_index()))) { in Find()1785 uint32_t vidx = best_node->next_index() + in Find()1786 strlen(storage_->GetSuffix(best_node->next_index())) + 1; in Find()1868 const Node *best_node = trie_.storage_->GetNode(node_index); in Reset() local[all …]
992 unsigned int best_node = -1; in ra_get_best_spill_node() local1015 best_node = n; in ra_get_best_spill_node()1019 return best_node; in ra_get_best_spill_node()
731 int best_node = best_path[1]; in TrellisQuantizeBlock() local733 NODE(n, best_node).prev = best_path[2]; // force best-prev for terminal in TrellisQuantizeBlock()736 const Node* const node = &NODE(n, best_node); in TrellisQuantizeBlock()741 best_node = node->prev; in TrellisQuantizeBlock()