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

12

/xsrc/external/mit/MesaLib.old/dist/src/compiler/nir/
H A Dnir_opt_dce.c43 nir_instr_worklist *worklist = (nir_instr_worklist *) _state; local in function:mark_live_cb
46 mark_and_push(worklist, src->ssa->parent_instr);
52 init_instr(nir_instr *instr, nir_instr_worklist *worklist) argument
68 mark_and_push(worklist, instr);
74 mark_and_push(worklist, instr);
80 mark_and_push(worklist, instr);
89 mark_and_push(worklist, instr);
92 mark_and_push(worklist, instr);
99 mark_and_push(worklist, instr);
108 init_block(nir_block *block, nir_instr_worklist *worklist) argument
126 nir_instr_worklist *worklist = nir_instr_worklist_create(); local in function:nir_opt_dce_impl
[all...]
H A Dnir_liveness.c49 nir_block_worklist worklist; member in struct:live_ssa_defs_state
66 * worklist.
80 nir_block_worklist_push_head(&state->worklist, block);
172 nir_block_worklist_init(&state.worklist, impl->num_blocks, NULL);
176 * blocks to the worklist.
184 /* We're now ready to work through the worklist and update the liveness
187 * worklist in reverse order. As long as we keep the worklist
190 while (!nir_block_worklist_is_empty(&state.worklist)) {
195 nir_block *block = nir_block_worklist_pop_head(&state.worklist);
[all...]
/xsrc/external/mit/MesaLib/dist/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) argument
300 BITSET_SET(worklist, i);
304 /* Update the worklist after an instruction terminates. Remove its edges from
306 * worklist */
310 BITSET_WORD *worklist, unsigned count,
315 * sense and means we messed up the worklist. Finally, as the purpose
328 * remove one dependency (`done`), adding dependents to the worklist
336 BITSET_SET(worklist, i);
344 * worklist t
309 mir_update_worklist(BITSET_WORD * worklist,unsigned count,midgard_instruction ** instructions,midgard_instruction * done) argument
655 mir_choose_instruction(midgard_instruction ** instructions,uint16_t * liveness,BITSET_WORD * worklist,unsigned count,struct midgard_predicate * predicate) argument
793 mir_choose_bundle(midgard_instruction ** instructions,uint16_t * liveness,BITSET_WORD * worklist,unsigned count,unsigned num_ldst) 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) 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) argument
964 mir_schedule_condition(compiler_context * ctx,struct midgard_predicate * predicate,BITSET_WORD * worklist,unsigned count,midgard_instruction ** instructions,midgard_instruction * last) argument
1019 mir_schedule_texture(midgard_instruction ** instructions,uint16_t * liveness,BITSET_WORD * worklist,unsigned len,bool is_vertex) argument
1049 mir_schedule_ldst(midgard_instruction ** instructions,uint16_t * liveness,BITSET_WORD * worklist,unsigned len,unsigned * num_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) argument
1157 mir_schedule_alu(compiler_context * ctx,midgard_instruction ** instructions,uint16_t * liveness,BITSET_WORD * worklist,unsigned len) argument
1437 BITSET_WORD *worklist = calloc(sz, 1); local in function:schedule_block
[all...]
H A Dmidgard_helper_invocations.c99 * the worklist to propagate to their predecessors */
101 struct set *worklist = _mesa_set_create(NULL, local in function:mir_analyze_helper_terminate
114 _mesa_set_add(worklist, _block);
118 * worklist (a subset of all the blocks) is finite. Since a block can
119 * only be added to the worklist if it is not on the visited list and
125 while((cur = _mesa_set_next_entry(worklist, NULL)) != NULL) {
128 _mesa_set_remove(worklist, cur);
134 _mesa_set_add(worklist, pred);
142 _mesa_set_destroy(worklist, NULL);
/xsrc/external/mit/MesaLib/dist/src/panfrost/bifrost/
H A Dbi_helper_invocations.c142 * the worklist to propagate to their predecessors */
144 struct set *worklist = _mesa_set_create(NULL, local in function:bi_analyze_helper_terminate
156 _mesa_set_add(worklist, block);
160 * worklist (a subset of all the blocks) is finite. Since a block can
161 * only be added to the worklist if it is not on the visited list and
167 while((cur = _mesa_set_next_entry(worklist, NULL)) != NULL) {
170 _mesa_set_remove(worklist, cur);
176 _mesa_set_add(worklist, pred);
184 _mesa_set_destroy(worklist, NULL);
H A Dbi_schedule.c30 /* Arguments common to worklist, passed by value for convenience */
40 BITSET_WORD *worklist; member in struct:bi_worklist
423 /* The worklist would track instructions without outstanding dependencies. For
440 st.worklist = calloc(BITSET_WORDS(st.count), sizeof(BITSET_WORD));
444 BITSET_SET(st.worklist, i);
456 free(st.worklist);
468 * adding dependents to the worklist where possible. */
476 BITSET_SET(st.worklist, i);
971 * we seek to maximize a cost function on a subset of the worklist satisfying a
1117 BITSET_FOREACH_SET(i, st.worklist, s
[all...]
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/etnaviv/
H A Detnaviv_compiler_nir_liveness.c50 nir_block_worklist worklist; member in struct:live_defs_state
65 nir_block_worklist_push_head(&state->worklist, block);
159 nir_block_worklist_init(&state.worklist, impl->num_blocks, NULL);
163 * blocks to the worklist.
170 /* We're now ready to work through the worklist and update the liveness
173 * worklist in reverse order. As long as we keep the worklist
176 while (!nir_block_worklist_is_empty(&state.worklist)) {
181 nir_block *block = nir_block_worklist_pop_head(&state.worklist);
231 nir_block_worklist_push_tail(&state.worklist, pre
[all...]
/xsrc/external/mit/MesaLib/dist/src/compiler/nir/
H A Dnir_liveness.c51 nir_block_worklist worklist; member in struct:live_ssa_defs_state
55 * worklist.
69 nir_block_worklist_push_head(&state->worklist, block);
157 nir_block_worklist_init(&state.worklist, impl->num_blocks, NULL);
160 * worklist.
167 /* We're now ready to work through the worklist and update the liveness
170 * worklist in reverse order. As long as we keep the worklist
173 while (!nir_block_worklist_is_empty(&state.worklist)) {
178 nir_block *block = nir_block_worklist_pop_head(&state.worklist);
[all...]
H A Dnir_opt_move_discards_to_top.c52 * to the given worklist
55 can_move_src(nir_src *src, void *worklist) argument
85 nir_instr_worklist_push_tail(worklist, instr);
87 if (!nir_foreach_src(instr, can_move_src, worklist)) {
H A Dnir_search.c651 nir_instr_worklist *worklist,
659 nir_instr_worklist_push_tail(worklist, use_src->parent_instr);
800 * that the instr may be in the worklist still, so we can't free it
866 nir_instr_worklist *worklist)
890 xform->search, xform->replace, worklist)) {
924 nir_instr_worklist *worklist = nir_instr_worklist_create(); local in function:nir_algebraic_impl
933 /* Put our instrs in the worklist such that we're popping the last instr
940 nir_instr_worklist_push_tail(worklist, instr);
945 while ((instr = nir_instr_worklist_pop_head(worklist))) {
946 /* The worklist ca
650 add_uses_to_worklist(nir_instr * instr,nir_instr_worklist * worklist,struct util_dynarray * states,const struct per_op_table * pass_op_table) argument
859 nir_algebraic_instr(nir_builder * build,nir_instr * instr,struct hash_table * range_ht,const bool * condition_flags,const struct transform ** transforms,const uint16_t * transform_counts,struct util_dynarray * states,const struct per_op_table * pass_op_table,nir_instr_worklist * worklist) argument
[all...]
H A Dnir.c1258 nir_instr_worklist *worklist = nir_instr_worklist_create(); local in function:nir_instr_free_and_dce
1260 nir_instr_dce_add_dead_ssa_srcs(worklist, instr);
1267 while ((dce_instr = nir_instr_worklist_pop_head(worklist))) {
1268 nir_instr_dce_add_dead_ssa_srcs(worklist, dce_instr);
1284 nir_instr_worklist_destroy(worklist);
/xsrc/external/mit/MesaLib/dist/src/amd/compiler/
H A Daco_live_var_analysis.cpp92 process_live_temps_per_block(Program* program, live& lives, Block* block, unsigned& worklist, argument
227 worklist = std::max(worklist, pred_idx + 1);
248 worklist = std::max(worklist, preds[i] + 1);
420 unsigned worklist = program->blocks.size(); local in function:aco::live_var_analysis
428 while (worklist) {
429 unsigned block_idx = --worklist;
430 process_live_temps_per_block(program, result, &program->blocks[block_idx], worklist,
H A Daco_insert_exec_mask.cpp55 std::set<unsigned> worklist; member in struct:aco::__anon045cfe6e0110::wqm_ctx
64 worklist.insert(i);
121 ctx.worklist.insert(ctx.defined_in[tmp.id()]);
132 ctx.worklist.insert(block_idx);
192 ctx.worklist.insert(pred_idx);
282 while (!ctx.worklist.empty()) {
283 unsigned block_index = *std::prev(ctx.worklist.end());
284 ctx.worklist.erase(std::prev(ctx.worklist.end()));
H A Daco_spill.cpp171 next_uses_per_block(spill_ctx& ctx, unsigned block_idx, uint32_t& worklist) argument
232 worklist = std::max(worklist, pred_idx + 1);
261 worklist = std::max(worklist, pred_idx + 1);
274 uint32_t worklist = ctx.program->blocks.size(); local in function:aco::__anond37687ce0110::compute_global_next_uses
275 while (worklist) {
276 unsigned block_idx = --worklist;
277 next_uses_per_block(ctx, block_idx, worklist);
/xsrc/external/mit/MesaLib/dist/src/broadcom/clif/
H A Dclif_private.h46 struct list_head worklist; member in struct:clif_dump
H A Dclif_dump.c48 list_addtail(&entry->link, &clif->worklist);
65 list_inithead(&clif->worklist);
157 /* Walks the worklist, parsing the relocs for any memory regions that might
190 &clif->worklist, link) {
286 &clif->worklist, link) {
293 &clif->worklist, link) {
399 /* Walk the worklist figuring out the locations of structs based on
/xsrc/external/mit/MesaLib.old/dist/src/broadcom/clif/
H A Dclif_private.h46 struct list_head worklist; member in struct:clif_dump
H A Dclif_dump.c48 list_addtail(&entry->link, &clif->worklist);
64 list_inithead(&clif->worklist);
154 /* Walks the worklist, parsing the relocs for any memory regions that might
187 &clif->worklist, link) {
280 &clif->worklist, link) {
287 &clif->worklist, link) {
393 /* Walk the worklist figuring out the locations of structs based on
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/lima/ir/gp/
H A Dregalloc.c48 unsigned *worklist; member in struct:regalloc_ctx
257 ctx->worklist[ctx->worklist_end++] = *conflict;
272 ctx->worklist[ctx->worklist_end++] = i;
280 push_stack(ctx, ctx->worklist[ctx->worklist_start++]);
600 ctx.worklist = ralloc_array(ctx.mem_ctx, unsigned, comp->cur_reg);
/src/sys/kern/
H A Dvfs_subr.c108 SDT_PROBE_DEFINE3(vfs, syncer, worklist, vnode__add,
112 SDT_PROBE_DEFINE4(vfs, syncer, worklist, vnode__update,
117 SDT_PROBE_DEFINE1(vfs, syncer, worklist, vnode__remove,
120 SDT_PROBE_DEFINE3(vfs, syncer, worklist, mount__add,
124 SDT_PROBE_DEFINE4(vfs, syncer, worklist, mount__update,
129 SDT_PROBE_DEFINE1(vfs, syncer, worklist, mount__remove,
724 SDT_PROBE3(vfs, syncer, worklist, vnode__add,
742 SDT_PROBE1(vfs, syncer, worklist, vnode__remove, vp);
781 SDT_PROBE3(vfs, syncer, worklist, mount__add,
795 SDT_PROBE1(vfs, syncer, worklist, mount__remov
[all...]
/xsrc/external/mit/MesaLib/dist/docs/relnotes/
H A D20.3.2.rst118 - aco: add block to worklist in mark_block_wqm()
H A D21.0.0.rst2693 - nir/search: check instr type before adding to worklist
2694 - nir/search: check for changes before adding uses to worklist
2768 - aco: add block to worklist in mark_block_wqm()
H A D21.1.0.rst485 - pan/bi: Stub worklist routines
4761 - nir/dce: replace instruction worklist with ssa def bitset
H A D19.3.0.rst351 - pan/midgard: Initialize worklist
H A D21.3.0.rst4248 - aco/spill: Change worklist to a single integer

Completed in 60 milliseconds

12