Searched refs:uses (Results 1 - 25 of 436) sorted by relevance

1234567891011>>

/xsrc/external/mit/MesaLib/dist/src/amd/compiler/
H A Daco_dead_code_analysis.cpp31 * Implements an analysis pass to determine the number of uses
40 std::vector<uint16_t> uses; member in struct:aco::__anon9a74ab950110::dce_ctx
44 : current_block(program->blocks.size() - 1), uses(program->peekAllocationId())
63 if (!is_dead(ctx.uses, instr.get())) {
66 if (ctx.uses[op.tempId()] == 0)
68 ctx.uses[op.tempId()]++;
84 is_dead(const std::vector<uint16_t>& uses, Instruction* instr) argument
89 [&uses](const Definition& def) { return !def.isTemp() || uses[def.tempId()]; }))
108 ctx.uses[startpg
[all...]
H A Daco_optimizer.cpp474 std::vector<uint16_t> uses; member in struct:aco::opt_ctx
1611 /* Remove superfluous s_and when the VOPC instruction uses the same exec and thus
1726 if (!--ctx.uses[instr->definitions[0].tempId()]) {
1729 ctx.uses[op.tempId()]--;
1739 if (!ignore_uses && ctx.uses[op.tempId()] > 1)
1746 if (instr->definitions[1].isTemp() && ctx.uses[instr->definitions[1].tempId()])
1760 if (instr->definitions[1].isTemp() && ctx.uses[instr->definitions[1].tempId()])
1814 ctx.uses[op[0].id()]++;
1815 ctx.uses[op[1].id()]++;
1858 if (instr->definitions[1].isTemp() && ctx.uses[inst
2736 uint16_t uses = ctx.uses[instr->operands[i].tempId()]; local in function:aco::apply_sgprs
3161 uint32_t uses = UINT32_MAX; local in function:aco::combine_vop3p
3363 uint32_t uses = UINT32_MAX; local in function:aco::combine_instruction
[all...]
H A Daco_optimizer_postRA.cpp57 std::vector<uint16_t> uses; member in struct:aco::__anon8dc067450110::pr_opt_ctx
232 /* Reduce the uses of the SCC def */
233 ctx.uses[instr->operands[0].tempId()]--;
267 if (ctx.uses[instr->operands[0].tempId()] > 1)
317 ctx.uses[instr->operands[0].tempId()]--;
319 ctx.uses[instr->operands[0].tempId()]++;
354 if (ctx.uses[instr->operands[scc_op_idx].tempId()] > 1)
370 ctx.uses[instr->operands[scc_op_idx].tempId()]--;
381 * v_xxx vC, vA, ... ; current instr that uses the result from the move
405 (!mov->definitions[0].tempId() || ctx.uses[mo
[all...]
/xsrc/external/mit/MesaLib/dist/src/panfrost/midgard/
H A Dmir_promote_uniforms.c60 BITSET_DECLARE(uses, MAX_UBO_QWORDS);
88 BITSET_SET(res.blocks[ubo].uses, offset);
95 * number of uses and perhaps the control flow to estimate benefit. This is not
107 BITSET_FOREACH_SET(vec4, block->uses, MAX_UBO_QWORDS) {
134 BITSET_WORD *uses = res->blocks[i].uses;
137 unsigned last = BITSET_LAST_BIT_SIZED(uses, BITSET_WORDS(MAX_UBO_QWORDS));
142 bool used = BITSET_TEST(uses, j);
160 BITSET_WORD *uses = analysis->blocks[i].uses; local in function:mir_promoteable_uniform_count
[all...]
/xsrc/external/mit/MesaLib/dist/src/asahi/compiler/
H A Dagx_optimizer.c31 * Every def is visited before any of its uses.
182 agx_instr **uses = calloc(ctx->alloc, sizeof(*uses)); local in function:agx_optimizer_backward
192 if (uses[v])
195 uses[v] = I;
205 agx_instr *use = uses[I->dest[0].value];
217 free(uses);
/xsrc/external/mit/libxshmfence/dist/
H A DREADME.md10 1) On Linux, the library uses futexes
12 2) On other systems, the library uses posix mutexes and condition
/xsrc/external/mit/MesaLib/dist/src/panfrost/util/
H A Dnir_mod_helpers.c92 /* Check the uses. We want a single use, with the op `op` */
96 if (!list_is_singular(&dest->ssa.uses))
99 nir_src *use = list_first_entry(&dest->ssa.uses, nir_src, use_link);
/xsrc/external/mit/MesaLib/dist/src/panfrost/bifrost/
H A Dbi_opt_mod_props.c267 bi_instr **uses = calloc(count, sizeof(*uses)); local in function:bi_opt_mod_prop_backward
275 if (uses[v] && uses[v] != I)
278 uses[v] = I;
285 bi_instr *use = uses[bi_word_node(I->dest[0])];
301 free(uses);
/xsrc/external/mit/MesaLib.old/dist/src/compiler/nir/
H A Dnir_search_helpers.h150 bool zero_use = list_empty(&instr->dest.dest.ssa.uses);
155 if (!zero_if_use && list_is_singular(&instr->dest.dest.ssa.uses))
162 !list_is_singular(&instr->dest.dest.ssa.uses))
H A Dnir_validate.c47 * equivalent to the uses and defs in nir_register, but built up by the
50 struct set *uses, *if_uses, *defs; member in struct:__anon71ad082e0108
56 * equivalent to the uses in nir_ssa_def, but built up by the validator.
59 struct set *uses, *if_uses; member in struct:__anon71ad082e0208
148 _mesa_set_add(reg_state->uses, src);
194 _mesa_set_add(def_state->uses, src);
288 list_validate(&def->uses);
294 def_state->uses = _mesa_pointer_set_create(def_state);
973 list_validate(&reg->uses);
978 reg_state->uses
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/r600/sb/
H A Dsb_dce_cleanup.cpp129 if (v && v->def && v->uses.size())
156 if (v->is_dead() || (remove_unused && !v->is_rel() && !v->uses.size()))
H A Dsb_valtable.cpp226 uses.push_back(n);
241 std::find_if(uses.begin(), uses.end(), use_node_comp(n));
243 if (it != uses.end())
246 uses.erase(it);
251 return uses.size();
296 uses.erase(uses.begin(), uses.end());
313 /* For all nodes that use this value test whether the operation uses anothe
[all...]
H A Dsb_def_use.cpp38 void def_use::process_phi(container_node *c, bool defs, bool uses) { argument
42 if (uses)
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r600/sb/
H A Dsb_dce_cleanup.cpp129 if (v && v->def && v->uses.size())
156 if (v->is_dead() || (remove_unused && !v->is_rel() && !v->uses.size()))
H A Dsb_valtable.cpp226 uses.push_back(n);
241 std::find_if(uses.begin(), uses.end(), use_node_comp(n));
243 if (it != uses.end())
246 uses.erase(it);
251 return uses.size();
296 uses.erase(uses.begin(), uses.end());
313 /* For all nodes that use this value test whether the operation uses anothe
[all...]
H A Dsb_def_use.cpp38 void def_use::process_phi(container_node *c, bool defs, bool uses) { argument
42 if (uses)
/xsrc/external/mit/MesaLib/dist/src/freedreno/ir3/
H A Dir3_cp_postsched.c143 util_dynarray_init(&newdeps, mov->uses);
193 _mesa_set_remove_key(mov->uses, use);
198 * directly reading from the array, update any false-dep uses to
199 * now depend on these instructions. The only remaining uses at
/xsrc/external/mit/MesaLib/dist/src/freedreno/computerator/examples/
H A Dtest-regfile.sh7 # register footprint by introducing uses of higher and higher registers. This
25 ; busy loop to make sure it actually uses all possible waves
/xsrc/external/mit/freetype/dist/builds/dos/
H A Ddos-def.mk38 # uses a shorter (8.3) name.
/xsrc/external/mit/freetype/dist/builds/os2/
H A Dos2-def.mk38 # uses a shorter (8.3) name.
/xsrc/external/mit/freetype/dist/builds/windows/
H A Dwin32-def.mk41 # uses a shorter (8.3) name.
/xsrc/external/mit/MesaLib.old/dist/src/gallium/docs/source/cso/
H A Dvelems.rst25 Rather than attempt to specify every small nuance of behavior, Gallium uses a
27 uses less than four components, it will be padded out with the constant vector
/xsrc/external/mit/MesaLib/dist/docs/gallium/cso/
H A Dvelems.rst25 Rather than attempt to specify every small nuance of behavior, Gallium uses a
27 uses less than four components, it will be padded out with the constant vector
/xsrc/external/mit/MesaLib.old/dist/src/intel/compiler/
H A Dbrw_nir_analyze_ubo_ranges.c91 uint8_t uses[64]; member in struct:ubo_block_info
172 /* TODO: should we count uses in loops as higher benefit? */
176 info->uses[offset]++;
293 entry->benefit += info->uses[first_bit + i];
/xsrc/external/mit/MesaLib/dist/src/intel/compiler/
H A Dbrw_nir_analyze_ubo_ranges.c91 uint8_t uses[64]; member in struct:ubo_block_info
174 /* TODO: should we count uses in loops as higher benefit? */
178 info->uses[offset]++;
287 entry->benefit += info->uses[first_bit + i];

Completed in 19 milliseconds

1234567891011>>