Home
last modified time | relevance | path

Searched refs:worklist (Results 1 - 25 of 70) sorted by relevance

123

/third_party/skia/gn/
H A Dcompile_sksl_tests.py27 def executeWorklist(input, worklist):
28 # Invoke skslc, passing in the worklist.
29 worklist.close()
31 output = subprocess.check_output([skslc, worklist.name], stderr=subprocess.STDOUT)
39 # Delete the worklist file now that execution is complete.
40 os.remove(worklist.name)
55 worklist = tempfile.NamedTemporaryFile(suffix='.worklist', delete=False, mode='w') variable
63 # Here we loop over these inputs and convert them into a worklist file for skslc.
77 worklist
[all...]
/third_party/mesa3d/src/panfrost/midgard/
H A Dmidgard_schedule.c292 /* The worklist is the set of instructions that can be scheduled now; that is,
296 mir_initialize_worklist(BITSET_WORD *worklist, midgard_instruction **instructions, unsigned count) in mir_initialize_worklist() argument
300 BITSET_SET(worklist, i); in mir_initialize_worklist()
304 /* Update the worklist after an instruction terminates. Remove its edges from
306 * worklist */
310 BITSET_WORD *worklist, unsigned count, in mir_update_worklist()
315 * sense and means we messed up the worklist. Finally, as the purpose in mir_update_worklist()
328 * remove one dependency (`done`), adding dependents to the worklist in mir_update_worklist()
336 BITSET_SET(worklist, i); in mir_update_worklist()
344 * worklist t
309 mir_update_worklist( BITSET_WORD *worklist, unsigned count, midgard_instruction **instructions, midgard_instruction *done) mir_update_worklist() argument
655 mir_choose_instruction( midgard_instruction **instructions, uint16_t *liveness, BITSET_WORD *worklist, unsigned count, struct midgard_predicate *predicate) mir_choose_instruction() argument
793 mir_choose_bundle( midgard_instruction **instructions, uint16_t *liveness, BITSET_WORD *worklist, unsigned count, unsigned num_ldst) mir_choose_bundle() argument
841 mir_choose_alu(midgard_instruction **slot, midgard_instruction **instructions, uint16_t *liveness, BITSET_WORD *worklist, unsigned len, struct midgard_predicate *predicate, unsigned unit) mir_choose_alu() argument
931 mir_schedule_comparison( compiler_context *ctx, midgard_instruction **instructions, struct midgard_predicate *predicate, BITSET_WORD *worklist, unsigned count, unsigned cond, bool vector, unsigned *swizzle, midgard_instruction *user) mir_schedule_comparison() argument
964 mir_schedule_condition(compiler_context *ctx, struct midgard_predicate *predicate, BITSET_WORD *worklist, unsigned count, midgard_instruction **instructions, midgard_instruction *last) mir_schedule_condition() argument
1019 mir_schedule_texture( midgard_instruction **instructions, uint16_t *liveness, BITSET_WORD *worklist, unsigned len, bool is_vertex) mir_schedule_texture() argument
1049 mir_schedule_ldst( midgard_instruction **instructions, uint16_t *liveness, BITSET_WORD *worklist, unsigned len, unsigned *num_ldst) mir_schedule_ldst() argument
1089 mir_schedule_zs_write( compiler_context *ctx, struct midgard_predicate *predicate, midgard_instruction **instructions, uint16_t *liveness, BITSET_WORD *worklist, unsigned len, midgard_instruction *branch, midgard_instruction **smul, midgard_instruction **vadd, midgard_instruction **vlut, bool stencil) mir_schedule_zs_write() argument
1157 mir_schedule_alu( compiler_context *ctx, midgard_instruction **instructions, uint16_t *liveness, BITSET_WORD *worklist, unsigned len) mir_schedule_alu() argument
1437 BITSET_WORD *worklist = calloc(sz, 1); schedule_block() local
[all...]
H A Dmidgard_helper_invocations.c99 * the worklist to propagate to their predecessors */ in mir_analyze_helper_terminate()
101 struct set *worklist = _mesa_set_create(NULL, in mir_analyze_helper_terminate() local
114 _mesa_set_add(worklist, _block); in mir_analyze_helper_terminate()
118 * worklist (a subset of all the blocks) is finite. Since a block can in mir_analyze_helper_terminate()
119 * only be added to the worklist if it is not on the visited list and in mir_analyze_helper_terminate()
125 while((cur = _mesa_set_next_entry(worklist, NULL)) != NULL) { in mir_analyze_helper_terminate()
128 _mesa_set_remove(worklist, cur); in mir_analyze_helper_terminate()
134 _mesa_set_add(worklist, pred); in mir_analyze_helper_terminate()
142 _mesa_set_destroy(worklist, NULL); in mir_analyze_helper_terminate()
/third_party/glslang/StandAlone/
H A DWorklist.h63 worklist.push_back(item); in add()
70 if (worklist.empty()) in remove()
72 item = worklist.front(); in remove()
73 worklist.pop_front(); in remove()
80 return (int)worklist.size(); in size()
85 return worklist.empty(); in empty()
90 std::list<TWorkItem*> worklist; member in glslang::TWorklist
/third_party/node/deps/v8/src/torque/
H A Dinstructions.cc52 Stack<DefinitionLocation>* locations, Worklist<Block*>* worklist) const { in RecomputeDefinitionLocations()
68 Stack<DefinitionLocation>* locations, Worklist<Block*>* worklist) const { in RecomputeDefinitionLocations()
78 Stack<DefinitionLocation>* locations, Worklist<Block*>* worklist) const { in RecomputeDefinitionLocations()
88 Stack<DefinitionLocation>* locations, Worklist<Block*>* worklist) const { in RecomputeDefinitionLocations()
102 Stack<DefinitionLocation>* locations, Worklist<Block*>* worklist) const { in RecomputeDefinitionLocations()
116 Stack<DefinitionLocation>* locations, Worklist<Block*>* worklist) const { in RecomputeDefinitionLocations()
172 Stack<DefinitionLocation>* locations, Worklist<Block*>* worklist) const { in RecomputeDefinitionLocations()
235 Stack<DefinitionLocation>* locations, Worklist<Block*>* worklist) const { in RecomputeDefinitionLocations()
242 (*catch_block)->MergeInputDefinitions(*locations, worklist); in RecomputeDefinitionLocations()
328 Stack<DefinitionLocation>* locations, Worklist<Block*>* worklist) cons in RecomputeDefinitionLocations()
[all...]
H A Dearley-parser.cc191 std::vector<Item> worklist; in RunEarleyAlgorithm() local
209 worklist.push_back(Item{top_level.rule(0), 0, 0, 0}); in RunEarleyAlgorithm()
214 while (!worklist.empty()) { in RunEarleyAlgorithm()
215 auto insert_result = processed->insert(worklist.back()); in RunEarleyAlgorithm()
221 if (!is_new) item.CheckAmbiguity(worklist.back(), tokens); in RunEarleyAlgorithm()
222 worklist.pop_back(); in RunEarleyAlgorithm()
230 worklist.push_back(parent->Advance(pos, &item)); in RunEarleyAlgorithm()
258 worklist.push_back(item.Advance(pos, &*already_completed)); in RunEarleyAlgorithm()
260 worklist.push_back(Item{rule, 0, pos, pos}); in RunEarleyAlgorithm()
265 std::swap(worklist, future_item in RunEarleyAlgorithm()
[all...]
/third_party/mesa3d/src/panfrost/bifrost/
H A Dbi_liveness.c86 * worklist. We initialize a work list with the exit block. We iterate the work
96 u_worklist worklist; in bi_compute_liveness() local
97 bi_worklist_init(ctx, &worklist); in bi_compute_liveness()
109 bi_worklist_push_tail(&worklist, block); in bi_compute_liveness()
112 while (!u_worklist_is_empty(&worklist)) { in bi_compute_liveness()
114 bi_block *blk = bi_worklist_pop_tail(&worklist); in bi_compute_liveness()
121 bi_worklist_push_head(&worklist, *pred); in bi_compute_liveness()
125 u_worklist_fini(&worklist); in bi_compute_liveness()
H A Dbi_helper_invocations.c244 u_worklist worklist; in bi_analyze_helper_requirements() local
245 bi_worklist_init(ctx, &worklist); in bi_analyze_helper_requirements()
248 bi_worklist_push_tail(&worklist, block); in bi_analyze_helper_requirements()
251 while (!u_worklist_is_empty(&worklist)) { in bi_analyze_helper_requirements()
252 bi_block *blk = bi_worklist_pop_tail(&worklist); in bi_analyze_helper_requirements()
256 bi_worklist_push_head(&worklist, *pred); in bi_analyze_helper_requirements()
260 u_worklist_fini(&worklist); in bi_analyze_helper_requirements()
H A Dbi_opt_dce.c119 * worklist. We initialize a work list with the exit block. We iterate the work
127 u_worklist worklist; in bi_postra_liveness() local
128 bi_worklist_init(ctx, &worklist); in bi_postra_liveness()
133 bi_worklist_push_tail(&worklist, block); in bi_postra_liveness()
136 while (!u_worklist_is_empty(&worklist)) { in bi_postra_liveness()
138 bi_block *blk = bi_worklist_pop_tail(&worklist); in bi_postra_liveness()
145 bi_worklist_push_head(&worklist, *pred); in bi_postra_liveness()
149 u_worklist_fini(&worklist); in bi_postra_liveness()
H A Dbi_scoreboard.c282 u_worklist worklist; in bi_assign_scoreboard() local
283 bi_worklist_init(ctx, &worklist); in bi_assign_scoreboard()
294 bi_worklist_push_tail(&worklist, block); in bi_assign_scoreboard()
298 while (!u_worklist_is_empty(&worklist)) { in bi_assign_scoreboard()
300 bi_block *blk = bi_worklist_pop_head(&worklist); in bi_assign_scoreboard()
304 bi_worklist_push_tail(&worklist, succ); in bi_assign_scoreboard()
308 u_worklist_fini(&worklist); in bi_assign_scoreboard()
/third_party/mesa3d/src/asahi/compiler/
H A Dagx_liveness.c55 * worklist. We initialize a work list with the exit block. We iterate the work
63 u_worklist worklist; in agx_compute_liveness() local
64 u_worklist_init(&worklist, ctx->num_blocks, NULL); in agx_compute_liveness()
79 agx_worklist_push_head(&worklist, block); in agx_compute_liveness()
83 while(!u_worklist_is_empty(&worklist)) { in agx_compute_liveness()
85 agx_block *blk = agx_worklist_pop_head(&worklist); in agx_compute_liveness()
137 agx_worklist_push_tail(&worklist, *pred); in agx_compute_liveness()
141 u_worklist_fini(&worklist); in agx_compute_liveness()
/third_party/mesa3d/src/panfrost/bifrost/valhall/
H A Dva_mark_last.c110 u_worklist worklist; in va_analyze_scoreboard_reads() local
111 bi_worklist_init(ctx, &worklist); in va_analyze_scoreboard_reads()
114 bi_worklist_push_tail(&worklist, block); in va_analyze_scoreboard_reads()
122 while (!u_worklist_is_empty(&worklist)) { in va_analyze_scoreboard_reads()
124 bi_block *blk = bi_worklist_pop_head(&worklist); in va_analyze_scoreboard_reads()
139 bi_worklist_push_tail(&worklist, succ); in va_analyze_scoreboard_reads()
145 u_worklist_fini(&worklist); in va_analyze_scoreboard_reads()
H A Dva_insert_flow.c293 u_worklist worklist; in va_assign_scoreboard() local
294 bi_worklist_init(ctx, &worklist); in va_assign_scoreboard()
297 bi_worklist_push_tail(&worklist, block); in va_assign_scoreboard()
301 while (!u_worklist_is_empty(&worklist)) { in va_assign_scoreboard()
303 bi_block *blk = bi_worklist_pop_head(&worklist); in va_assign_scoreboard()
307 bi_worklist_push_tail(&worklist, succ); in va_assign_scoreboard()
311 u_worklist_fini(&worklist); in va_assign_scoreboard()
/third_party/mesa3d/src/compiler/nir/
H A Dnir_liveness.c51 nir_block_worklist worklist; member
55 * worklist.
69 nir_block_worklist_push_head(&state->worklist, block); in init_liveness_block()
157 nir_block_worklist_init(&state.worklist, impl->num_blocks, NULL); in nir_live_ssa_defs_impl()
160 * worklist. in nir_live_ssa_defs_impl()
167 /* We're now ready to work through the worklist and update the liveness in nir_live_ssa_defs_impl()
170 * worklist in reverse order. As long as we keep the worklist in nir_live_ssa_defs_impl()
173 while (!nir_block_worklist_is_empty(&state.worklist)) { in nir_live_ssa_defs_impl()
178 nir_block *block = nir_block_worklist_pop_head(&state.worklist); in nir_live_ssa_defs_impl()
[all...]
H A Dnir_opt_move_discards_to_top.c52 * to the given worklist
55 can_move_src(nir_src *src, void *worklist) in can_move_src() argument
85 nir_instr_worklist_push_tail(worklist, instr); in can_move_src()
87 if (!nir_foreach_src(instr, can_move_src, worklist)) { in can_move_src()
/third_party/node/deps/v8/src/heap/
H A Dmarking-worklist.cc5 #include "src/heap/marking-worklist.h"
13 #include "src/heap/marking-worklist-inl.h"
42 cw.worklist->Clear(); in Clear()
62 MarkingWorklist* worklist = new MarkingWorklist(); in CreateContextWorklists() local
63 worklists_.push_back(std::unique_ptr<MarkingWorklist>(worklist)); in CreateContextWorklists()
64 context_worklists_.push_back({context, worklist}); in CreateContextWorklists()
74 MarkingWorklist* worklist) { in PrintWorklist()
78 worklist->Iterate([&count, &total_count](HeapObject obj) { in PrintWorklist()
121 std::make_unique<MarkingWorklist::Local>(cw.worklist); in Local()
155 // This function checks the on_hold_ worklist, s in IsEmpty()
73 PrintWorklist(const char* worklist_name, MarkingWorklist* worklist) PrintWorklist() argument
[all...]
H A Dmarking-worklist-inl.h10 #include "src/heap/marking-worklist.h"
28 cw.worklist->Update(callback); in Update()
37 // The active worklist is empty. Find any other non-empty worklist and in Pop()
38 // switch the active worklist to it. in Pop()
86 Address context, MarkingWorklist::Local* worklist) { in SwitchToContext()
87 // Save the current worklist. in SwitchToContext()
89 // Switch to the new worklist. in SwitchToContext()
90 active_owner_ = worklist; in SwitchToContext()
91 active_ = std::move(*worklist); in SwitchToContext()
85 SwitchToContext( Address context, MarkingWorklist::Local* worklist) SwitchToContext() argument
[all...]
/third_party/mesa3d/src/gallium/drivers/etnaviv/
H A Detnaviv_compiler_nir_liveness.c50 nir_block_worklist worklist; member
65 nir_block_worklist_push_head(&state->worklist, block); in init_liveness_block()
159 nir_block_worklist_init(&state.worklist, impl->num_blocks, NULL); in etna_live_defs()
163 * blocks to the worklist. in etna_live_defs()
170 /* We're now ready to work through the worklist and update the liveness in etna_live_defs()
173 * worklist in reverse order. As long as we keep the worklist in etna_live_defs()
176 while (!nir_block_worklist_is_empty(&state.worklist)) { in etna_live_defs()
181 nir_block *block = nir_block_worklist_pop_head(&state.worklist); in etna_live_defs()
231 nir_block_worklist_push_tail(&state.worklist, pre in etna_live_defs()
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dcode_sink.cpp293 std::vector<uint32_t> worklist; in IntersectsPath() local
294 worklist.push_back(start); in IntersectsPath()
298 while (!worklist.empty()) { in IntersectsPath()
299 BasicBlock* bb = context()->get_instr_block(worklist.back()); in IntersectsPath()
300 worklist.pop_back(); in IntersectsPath()
310 bb->ForEachSuccessorLabel([&already_done, &worklist](uint32_t* succ_bb_id) { in IntersectsPath()
312 worklist.push_back(*succ_bb_id); in IntersectsPath()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dcode_sink.cpp293 std::vector<uint32_t> worklist; in IntersectsPath() local
294 worklist.push_back(start); in IntersectsPath()
298 while (!worklist.empty()) { in IntersectsPath()
299 BasicBlock* bb = context()->get_instr_block(worklist.back()); in IntersectsPath()
300 worklist.pop_back(); in IntersectsPath()
310 bb->ForEachSuccessorLabel([&already_done, &worklist](uint32_t* succ_bb_id) { in IntersectsPath()
312 worklist.push_back(*succ_bb_id); in IntersectsPath()
/third_party/elfio/elfio/
H A Delfio.hpp695 std::deque<segment*> worklist; variable
699 worklist.emplace_back( seg.get() );
704 for ( size_t i = 0; i < worklist.size(); ++i ) {
705 if ( i != nextSlot && worklist[i]->is_offset_initialized() &&
706 worklist[i]->get_offset() == 0 ) {
707 if ( worklist[nextSlot]->get_offset() == 0 ) {
710 std::swap( worklist[i], worklist[nextSlot] );
715 while ( !worklist.empty() ) {
716 segment* seg = worklist
781 std::vector<segment*> worklist; global() variable
[all...]
/third_party/spirv-tools/source/opt/
H A Dcode_sink.cpp296 std::vector<uint32_t> worklist; in IntersectsPath() local
297 worklist.push_back(start); in IntersectsPath()
301 while (!worklist.empty()) { in IntersectsPath()
302 BasicBlock* bb = context()->get_instr_block(worklist.back()); in IntersectsPath()
303 worklist.pop_back(); in IntersectsPath()
313 bb->ForEachSuccessorLabel([&already_done, &worklist](uint32_t* succ_bb_id) { in IntersectsPath()
315 worklist.push_back(*succ_bb_id); in IntersectsPath()
H A Dspread_volatile_semantics.cpp207 std::vector<uint32_t> worklist({var_id});
209 while (!worklist.empty()) {
210 uint32_t ptr_id = worklist.back();
211 worklist.pop_back();
213 ptr_id, [this, &worklist, &ptr_id, handle_load,
228 worklist.push_back(user->result_id());
H A Dinvocation_interlock_placement_pass.cpp243 std::deque<uint32_t> worklist;
244 worklist.insert(worklist.begin(), starting_nodes.begin(),
247 while (!worklist.empty()) {
248 uint32_t block_id = worklist.front();
249 worklist.pop_front();
252 [&inside, &previous_inside, &worklist](uint32_t next_id) {
255 worklist.push_back(next_id);
/third_party/mesa3d/src/amd/compiler/
H A Daco_live_var_analysis.cpp107 process_live_temps_per_block(Program* program, live& lives, Block* block, unsigned& worklist, in process_live_temps_per_block() argument
243 worklist = std::max(worklist, pred_idx + 1); in process_live_temps_per_block()
264 worklist = std::max(worklist, preds[i] + 1); in process_live_temps_per_block()
440 unsigned worklist = program->blocks.size(); in live_var_analysis() local
448 while (worklist) { in live_var_analysis()
449 unsigned block_idx = --worklist; in live_var_analysis()
450 process_live_temps_per_block(program, result, &program->blocks[block_idx], worklist, in live_var_analysis()

Completed in 14 milliseconds

123