Home
last modified time | relevance | path

Searched refs:in_stack (Results 1 – 3 of 3) sorted by relevance

/third_party/mesa3d/src/util/
Dregister_allocate.c543 g->tmp.in_stack = reralloc(g, g->tmp.in_stack, BITSET_WORD, bitset_count); in ra_realloc_interference_graph()
661 assert(!BITSET_TEST(g->tmp.in_stack, n)); in add_node_to_stack()
667 if (!BITSET_TEST(g->tmp.in_stack, n2) && in add_node_to_stack()
677 BITSET_SET(g->tmp.in_stack, n); in add_node_to_stack()
708 g->tmp.in_stack[i] = 0; in ra_simplify()
733 BITSET_WORD skip = g->tmp.in_stack[i] | g->tmp.reg_assigned[i]; in ra_simplify()
816 if (!BITSET_TEST(g->tmp.in_stack, n2) && in ra_find_conflicting_neighbor()
847 if (!BITSET_TEST(g->tmp.in_stack, *n2p)) { in ra_compute_available_regs()
893 BITSET_CLEAR(g->tmp.in_stack, n); in ra_select()
1034 if (BITSET_TEST(g->tmp.in_stack, n)) in ra_get_best_spill_node()
Dregister_allocate_internal.h148 BITSET_WORD *in_stack; member
/third_party/mindspore/mindspore/ccsrc/pipeline/jit/static_analysis/
Dauto_monad.cc228 bool in_stack = false; member
229 explicit State(size_t index) : index(index), lowlink(index), in_stack(false) {} in State()
244 state.in_stack = true; in Search()
253 } else if (iter->second.in_stack) { in Search()
269 found->second.in_stack = false; in Search()