HomeSort by: relevance | last modified time | path
    Searched refs:uses (Results 1 - 25 of 198) sorted by relevancy

1 2 3 4 5 6 7 8

  /xsrc/external/mit/MesaLib/dist/src/amd/compiler/
aco_dead_code_analysis.cpp 31 * Implements an analysis pass to determine the number of uses
40 std::vector<uint16_t> uses; member in struct:aco::__anon461::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)
89 [&uses](const Definition& def) { return !def.isTemp() || uses[def.tempId()]; }))
108 ctx.uses[startpgm->definitions.back().tempId()]++
    [all...]
aco_optimizer.cpp 474 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[instr->definitions[1].tempId()]
2736 uint16_t uses = ctx.uses[instr->operands[i].tempId()]; local
3161 uint32_t uses = UINT32_MAX; local
3363 uint32_t uses = UINT32_MAX; local
    [all...]
aco_optimizer_postRA.cpp 57 std::vector<uint16_t> uses; member in struct:aco::__anon496::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[mov->definitions[0].tempId()] > 1)
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/panfrost/midgard/
mir_promote_uniforms.c 60 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
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/asahi/compiler/
agx_optimizer.c 31 * Every def is visited before any of its uses.
182 agx_instr **uses = calloc(ctx->alloc, sizeof(*uses)); local
192 if (uses[v])
195 uses[v] = I;
205 agx_instr *use = uses[I->dest[0].value];
217 free(uses);
  /xsrc/external/mit/MesaLib/dist/src/panfrost/util/
nir_mod_helpers.c 92 /* 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/fontconfig/dist/doc/
fcfreetype.fncs 34 Maps a Unicode char to a glyph index. This function uses information from
  /xsrc/external/mit/MesaLib/dist/src/panfrost/bifrost/
bi_opt_mod_props.c 267 bi_instr **uses = calloc(count, sizeof(*uses)); local
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/
nir_search_helpers.h 150 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))
nir_validate.c 47 * equivalent to the uses and defs in nir_register, but built up by the
50 struct set *uses, *if_uses, *defs; member in struct:__anon3425
56 * equivalent to the uses in nir_ssa_def, but built up by the validator.
59 struct set *uses, *if_uses; member in struct:__anon3426
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 = _mesa_pointer_set_create(reg_state)
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/freedreno/ir3/
ir3_cp_postsched.c 143 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/gallium/drivers/r600/sb/
sb_dce_cleanup.cpp 129 if (v && v->def && v->uses.size())
156 if (v->is_dead() || (remove_unused && !v->is_rel() && !v->uses.size()))
sb_valtable.cpp 226 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...]
sb_def_use.cpp 38 void def_use::process_phi(container_node *c, bool defs, bool uses) {
42 if (uses)
sb_gcm.cpp 50 init_def_count(uses, pending);
92 init_use_count(uses, pending);
191 return uses[n] == 0;
197 sblog << "td checking uses: ";
202 for (uselist::iterator I = v->uses.begin(), E = v->uses.end(); I != E; ++I) {
214 assert(uses[op] > 0);
215 if (--uses[op] == 0) {
513 return uc == uses[n];
572 if (n->parent == &pending && uc == uses[n])
    [all...]
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/r600/sb/
sb_dce_cleanup.cpp 129 if (v && v->def && v->uses.size())
156 if (v->is_dead() || (remove_unused && !v->is_rel() && !v->uses.size()))
sb_valtable.cpp 226 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...]
sb_def_use.cpp 38 void def_use::process_phi(container_node *c, bool defs, bool uses) {
42 if (uses)
sb_gcm.cpp 50 init_def_count(uses, pending);
92 init_use_count(uses, pending);
191 return uses[n] == 0;
197 sblog << "td checking uses: ";
202 for (uselist::iterator I = v->uses.begin(), E = v->uses.end(); I != E; ++I) {
214 assert(uses[op] > 0);
215 if (--uses[op] == 0) {
513 return uc == uses[n];
572 if (n->parent == &pending && uc == uses[n])
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/freedreno/computerator/examples/
test-regfile.sh 7 # 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/MesaLib/dist/src/intel/compiler/
brw_nir_analyze_ubo_ranges.c 91 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];
  /xsrc/external/mit/MesaLib.old/dist/src/intel/compiler/
brw_nir_analyze_ubo_ranges.c 91 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];
brw_fs_combine_constants.cpp 108 * The instruction generating the immediate value, if all uses are contained
117 exec_list *uses; member in struct:imm
358 imm->uses->push_tail(link(const_ctx, &inst->src[i]));
368 imm->uses = new(const_ctx) exec_list();
369 imm->uses->push_tail(link(const_ctx, &inst->src[i]));
381 /* Remove constants from the table that don't have enough uses to make them
450 foreach_list_typed(reg_link, link, link, table.imm[i].uses) {
504 "Uses: (%2d, %2d), IP: %4d to %4d, length %4d\n",
  /xsrc/external/mit/MesaLib/dist/docs/_extra/specs/
MESA_pixmap_colormap.spec 73 rendered into the pixmap may then be copied to a window (which uses the
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/codegen/
nv50_ir_lowering_nvc0.h 109 void findFirstUses(Instruction *texi, std::list<TexUse> &uses);
111 const Instruction *texi, std::list<TexUse> &uses,

Completed in 24 milliseconds

1 2 3 4 5 6 7 8