Home
last modified time | relevance | path

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

12345678910>>...14

/third_party/mesa3d/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
44 : current_block(program->blocks.size() - 1), uses(program->peekAllocationId()) in dce_ctx()
63 if (!is_dead(ctx.uses, instr.get())) { in process_block()
66 if (ctx.uses[op.tempId()] == 0) in process_block()
68 ctx.uses[op.tempId()]++; in process_block()
84 is_dead(const std::vector<uint16_t>& uses, Instruction* instr) in is_dead() argument
90 [&uses](const Definition& def) { return !def.isTemp() || uses[def.tempId()]; })) in is_dead()
109 ctx.uses[startpg in dead_code_analysis()
[all...]
H A Daco_optimizer_postRA.cpp60 std::vector<uint16_t> uses; member
255 /* Reduce the uses of the SCC def */ in try_apply_branch_vcc()
256 ctx.uses[instr->operands[0].tempId()]--; in try_apply_branch_vcc()
290 if (ctx.uses[instr->operands[0].tempId()] > 1) in try_optimize_scc_nocompare()
340 ctx.uses[instr->operands[0].tempId()]--; in try_optimize_scc_nocompare()
342 ctx.uses[instr->operands[0].tempId()]++; in try_optimize_scc_nocompare()
377 if (ctx.uses[instr->operands[scc_op_idx].tempId()] > 1) in try_optimize_scc_nocompare()
393 ctx.uses[instr->operands[scc_op_idx].tempId()]--; in try_optimize_scc_nocompare()
404 * v_xxx vC, vA, ... ; current instr that uses the result from the move in try_combine_dpp()
431 (!mov->definitions[0].tempId() || ctx.uses[mo in try_combine_dpp()
[all...]
H A Daco_optimizer.cpp507 std::vector<uint16_t> uses; member
1212 /* Remove superfluous s_and when the VOPC instruction uses the same exec and thus in can_eliminate_and_exec()
2068 if (!--ctx.uses[instr->definitions[0].tempId()]) { in decrease_uses()
2071 ctx.uses[op.tempId()]--; in decrease_uses()
2081 if (!ignore_uses && ctx.uses[op.tempId()] > 1) in follow_operand()
2088 if (instr->definitions[1].isTemp() && ctx.uses[instr->definitions[1].tempId()]) in follow_operand()
2102 if (instr->definitions[1].isTemp() && ctx.uses[instr->definitions[1].tempId()]) in combine_ordering_test()
2156 ctx.uses[op[0].id()]++; in combine_ordering_test()
2157 ctx.uses[op[1].id()]++; in combine_ordering_test()
2199 if (instr->definitions[1].isTemp() && ctx.uses[inst in combine_comparison_ordering()
3090 uint16_t uses = ctx.uses[instr->operands[i].tempId()]; global() local
3522 uint32_t uses = UINT32_MAX; combine_vop3p() local
3923 uint32_t uses = UINT32_MAX; combine_instruction() local
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dfix_storage_class.cpp31 std::vector<std::pair<Instruction*, uint32_t>> uses; in Process()
33 [&uses](Instruction* use, uint32_t op_idx) { in Process()
34 uses.push_back({use, op_idx}); in Process()
37 for (auto& use : uses) { in Process()
67 std::vector<Instruction*> uses; in PropagateStorageClass() local
69 inst, [&uses](Instruction* use) { uses.push_back(use); }); in PropagateStorageClass()
70 for (Instruction* use : uses) { in PropagateStorageClass()
120 std::vector<Instruction*> uses; in FixInstructionStorageClass() local
122 inst, [&uses](Instructio in FixInstructionStorageClass()
271 std::vector<std::pair<Instruction*, uint32_t>> uses; PropagateType() local
[all...]
H A Dprivate_to_local_pass.cpp140 // Update uses where the type may have changed. in MoveVariable()
206 // Update uses where the type may have changed. in UpdateUse()
224 std::vector<Instruction*> uses; in UpdateUses() local
226 id, [&uses](Instruction* use) { uses.push_back(use); }); in UpdateUses()
228 for (Instruction* use : uses) { in UpdateUses()
H A Dconvert_to_sampled_image_pass.cpp207 std::vector<Instruction*>* uses, in FindUses()
210 def_use_mgr->ForEachUser(inst, [uses, user_opcode, this](Instruction* user) { in FindUses()
212 uses->push_back(user); in FindUses()
214 FindUses(user, uses, user_opcode); in FindUses()
220 const Instruction* image, std::vector<Instruction*>* uses) const { in FindUsesOfImage()
222 def_use_mgr->ForEachUser(image, [uses, this](Instruction* user) { in FindUsesOfImage()
234 uses->push_back(user); in FindUsesOfImage()
239 FindUsesOfImage(user, uses); in FindUsesOfImage()
206 FindUses(const Instruction* inst, std::vector<Instruction*>* uses, uint32_t user_opcode) const FindUses() argument
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dfix_storage_class.cpp31 std::vector<std::pair<Instruction*, uint32_t>> uses; in Process()
33 [&uses](Instruction* use, uint32_t op_idx) { in Process()
34 uses.push_back({use, op_idx}); in Process()
37 for (auto& use : uses) { in Process()
67 std::vector<Instruction*> uses; in PropagateStorageClass() local
69 inst, [&uses](Instruction* use) { uses.push_back(use); }); in PropagateStorageClass()
70 for (Instruction* use : uses) { in PropagateStorageClass()
120 std::vector<Instruction*> uses; in FixInstructionStorageClass() local
122 inst, [&uses](Instructio in FixInstructionStorageClass()
271 std::vector<std::pair<Instruction*, uint32_t>> uses; PropagateType() local
[all...]
H A Dprivate_to_local_pass.cpp140 // Update uses where the type may have changed. in MoveVariable()
206 // Update uses where the type may have changed. in UpdateUse()
224 std::vector<Instruction*> uses; in UpdateUses() local
226 id, [&uses](Instruction* use) { uses.push_back(use); }); in UpdateUses()
228 for (Instruction* use : uses) { in UpdateUses()
H A Dconvert_to_sampled_image_pass.cpp207 std::vector<Instruction*>* uses, in FindUses()
210 def_use_mgr->ForEachUser(inst, [uses, user_opcode, this](Instruction* user) { in FindUses()
212 uses->push_back(user); in FindUses()
214 FindUses(user, uses, user_opcode); in FindUses()
220 const Instruction* image, std::vector<Instruction*>* uses) const { in FindUsesOfImage()
222 def_use_mgr->ForEachUser(image, [uses, this](Instruction* user) { in FindUsesOfImage()
234 uses->push_back(user); in FindUsesOfImage()
239 FindUsesOfImage(user, uses); in FindUsesOfImage()
206 FindUses(const Instruction* inst, std::vector<Instruction*>* uses, uint32_t user_opcode) const FindUses() argument
/third_party/spirv-tools/source/opt/
H A Dfix_storage_class.cpp31 std::vector<std::pair<Instruction*, uint32_t>> uses; in Process()
33 [&uses](Instruction* use, uint32_t op_idx) { in Process()
34 uses.push_back({use, op_idx}); in Process()
37 for (auto& use : uses) { in Process()
67 std::vector<Instruction*> uses; in PropagateStorageClass() local
69 inst, [&uses](Instruction* use) { uses.push_back(use); }); in PropagateStorageClass()
70 for (Instruction* use : uses) { in PropagateStorageClass()
120 std::vector<Instruction*> uses; in FixInstructionStorageClass() local
122 inst, [&uses](Instructio in FixInstructionStorageClass()
271 std::vector<std::pair<Instruction*, uint32_t>> uses; PropagateType() local
[all...]
/third_party/elfutils/backends/
H A Dcommon-reloc.c49 #define RELOC_TYPE(type, uses) \ in EBLHOOK()
56 #define RELOC_TYPE(type, uses) R_NAME (type),
64 #define RELOC_TYPE(type, uses) \
77 #define RELOC_TYPE(type, uses) [R_TYPE (type)] = uses,
112 uint8_t uses; in reloc_valid_use() local
123 uses = EBLHOOK(reloc_valid)[reloc]; in reloc_valid_use()
124 return type > ET_NONE && type < ET_CORE && (uses & (1 << (type - 1))); in reloc_valid_use()
/third_party/mesa3d/src/panfrost/midgard/
H A Dmir_promote_uniforms.c60 BITSET_DECLARE(uses, MAX_UBO_QWORDS);
88 BITSET_SET(res.blocks[ubo].uses, offset); in mir_analyze_ranges()
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) { in mir_pick_ubo()
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; in mir_promoteable_uniform_count() local
[all...]
/third_party/skia/third_party/externals/swiftshader/src/Reactor/
H A DOptimizer.cpp151 Uses uses = *getUses(address); // Hard copy in propagateAlloca() local
153 for(auto *store : uses) in propagateAlloca()
166 // Make sure the only store into the stack variable is this address, and that all of its other uses are loads. in propagateAlloca()
248 Uses uses = *getUses(address); // Hard copy in performScalarReplacementOfAggregates() local
250 for(auto *use : uses) in performScalarReplacementOfAggregates()
520 assert(!use->isDeleted()); // Should have been removed from uses already in replace()
590 Optimizer::Uses *uses = getUses(address); in isDead() local
591 return uses->size() == uses->stores.size(); // Dead if all uses ar in isDead()
606 auto &uses = *getUses(allocaAddress); isStaticallyIndexedArray() local
790 Optimizer::Uses *uses = (Optimizer::Uses *)operand->Ice::Operand::getExternalData(); getUses() local
800 setUses(Ice::Operand *operand, Optimizer::Uses *uses) setUses() argument
852 auto &uses = *this; erase() local
[all...]
/third_party/mesa3d/src/gallium/drivers/r600/sb/
H A Dsb_valtable.cpp226 uses.push_back(n); in add_use()
241 std::find_if(uses.begin(), uses.end(), use_node_comp(n)); in remove_use()
243 if (it != uses.end()) in remove_use()
246 uses.erase(it); in remove_use()
251 return uses.size(); in use_count()
296 uses.erase(uses.begin(), uses.end()); in delete_uses()
313 /* For all nodes that use this value test whether the operation uses anothe in no_reladdr_conflict_with()
[all...]
/third_party/mesa3d/src/asahi/compiler/
H A Dagx_optimizer.c31 * Every def is visited before any of its uses.
211 agx_instr **uses = calloc(ctx->alloc, sizeof(*uses)); in agx_optimizer_backward() local
221 if (uses[v]) in agx_optimizer_backward()
224 uses[v] = I; in agx_optimizer_backward()
234 agx_instr *use = uses[I->dest[0].value]; in agx_optimizer_backward()
246 free(uses); in agx_optimizer_backward()
/third_party/node/deps/v8/src/compiler/
H A Dstore-store-elimination.cc232 // Compute the intersection of the UnobservablesSets of all effect uses and
239 UnobservablesSet RecomputeSet(Node* node, const UnobservablesSet& uses);
313 Node* node, const UnobservablesSet& uses) { in RecomputeSet()
321 const bool is_not_observable = uses.IsUnobservable( in RecomputeSet()
329 return uses; in RecomputeSet()
333 uses.IsGCObservable(observation); in RecomputeSet()
354 return uses.Add(observation, temp_zone()); in RecomputeSet()
369 return uses.RemoveSameOffset(offset, temp_zone()); in RecomputeSet()
380 return uses.MarkGCObservable(temp_zone()); in RecomputeSet()
386 return uses; in RecomputeSet()
312 RecomputeSet( Node* node, const UnobservablesSet& uses) RecomputeSet() argument
[all...]
/third_party/skia/third_party/externals/spirv-tools/test/opt/
H A Ddef_use_test.cpp41 // Returns the number of uses of |id|.
80 // A struct for holding expected id defs and uses.
88 std::vector<IdInstsPair> uses; member
133 // Check uses. in CheckUse()
134 ASSERT_EQ(expected_defs_uses.uses.size(), actual_uses.size()); in CheckUse()
135 for (uint32_t i = 0; i < expected_defs_uses.uses.size(); ++i) { in CheckUse()
136 const auto id = expected_defs_uses.uses[i].first; in CheckUse()
137 const auto& expected_uses = expected_defs_uses.uses[i].second; in CheckUse()
140 const auto& uses = actual_uses.at(id); in CheckUse() local
142 ASSERT_EQ(expected_uses.size(), uses in CheckUse()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/opt/
H A Ddef_use_test.cpp41 // Returns the number of uses of |id|.
80 // A struct for holding expected id defs and uses.
88 std::vector<IdInstsPair> uses; member
133 // Check uses. in CheckUse()
134 ASSERT_EQ(expected_defs_uses.uses.size(), actual_uses.size()); in CheckUse()
135 for (uint32_t i = 0; i < expected_defs_uses.uses.size(); ++i) { in CheckUse()
136 const auto id = expected_defs_uses.uses[i].first; in CheckUse()
137 const auto& expected_uses = expected_defs_uses.uses[i].second; in CheckUse()
140 const auto& uses = actual_uses.at(id); in CheckUse() local
142 ASSERT_EQ(expected_uses.size(), uses in CheckUse()
[all...]
/third_party/spirv-tools/test/opt/
H A Ddef_use_test.cpp40 // Returns the number of uses of |id|.
79 // A struct for holding expected id defs and uses.
87 std::vector<IdInstsPair> uses; member
132 // Check uses. in CheckUse()
133 ASSERT_EQ(expected_defs_uses.uses.size(), actual_uses.size()); in CheckUse()
134 for (uint32_t i = 0; i < expected_defs_uses.uses.size(); ++i) { in CheckUse()
135 const auto id = expected_defs_uses.uses[i].first; in CheckUse()
136 const auto& expected_uses = expected_defs_uses.uses[i].second; in CheckUse()
139 const auto& uses = actual_uses.at(id); in CheckUse() local
141 ASSERT_EQ(expected_uses.size(), uses in CheckUse()
[all...]
/third_party/jerryscript/tools/
H A Dgen-magic-strings.py160 def calculate_magic_string_guards(defs, uses, debug=False):
164 if str_ref not in uses:
175 guards = [set(guard_tuple) for guard_tuple in uses[str_ref].keys()]
276 uses = extract_magic_string_refs(debug=args.debug)
278 extended_defs = calculate_magic_string_guards(defs, uses, debug=args.debug)
/third_party/skia/third_party/externals/spirv-tools/source/fuzz/
H A Dfuzzer_pass_apply_id_synonyms.cpp46 // Gather up all uses of |id_with_known_synonym| as a regular id, and in Apply()
47 // subsequently iterate over these uses. We use this separation because, in Apply()
50 std::vector<std::pair<opt::Instruction*, uint32_t>> uses; in Apply() local
53 [&uses](opt::Instruction* use_inst, uint32_t use_index) -> void { in Apply()
54 // We only gather up regular id uses; e.g. we do not include a use of in Apply()
57 uses.emplace_back( in Apply()
62 for (const auto& use : uses) { in Apply()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/
H A Dfuzzer_pass_apply_id_synonyms.cpp46 // Gather up all uses of |id_with_known_synonym| as a regular id, and in Apply()
47 // subsequently iterate over these uses. We use this separation because, in Apply()
50 std::vector<std::pair<opt::Instruction*, uint32_t>> uses; in Apply() local
53 [&uses](opt::Instruction* use_inst, uint32_t use_index) -> void { in Apply()
54 // We only gather up regular id uses; e.g. we do not include a use of in Apply()
57 uses.emplace_back( in Apply()
62 for (const auto& use : uses) { in Apply()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
H A DTypeMetadataUtils.cpp27 for (const Use &U : FPtr->uses()) { in findCallsAtConstantOffset()
32 // after indirect call promotion and inlining, where we may have uses in findCallsAtConstantOffset()
54 for (const Use &U : VPtr->uses()) { in findLoadCallsAtConstantOffset()
82 for (const Use &CIU : CI->uses()) { in findDevirtualizableCallsForTypeTest()
111 for (const Use &U : CI->uses()) { in findDevirtualizableCallsForTypeCheckedLoad()
/third_party/spirv-tools/source/fuzz/
H A Dfuzzer_pass_apply_id_synonyms.cpp46 // Gather up all uses of |id_with_known_synonym| as a regular id, and in Apply()
47 // subsequently iterate over these uses. We use this separation because, in Apply()
50 std::vector<std::pair<opt::Instruction*, uint32_t>> uses; in Apply() local
53 [&uses](opt::Instruction* use_inst, uint32_t use_index) -> void { in Apply()
54 // We only gather up regular id uses; e.g. we do not include a use of in Apply()
57 uses.emplace_back( in Apply()
62 for (const auto& use : uses) { in Apply()
/third_party/mesa3d/src/panfrost/bifrost/
H A Dbi_opt_mod_props.c344 bi_instr **uses = calloc(count, sizeof(*uses)); in bi_opt_mod_prop_backward() local
352 if (uses[v] && uses[v] != I) in bi_opt_mod_prop_backward()
355 uses[v] = I; in bi_opt_mod_prop_backward()
362 bi_instr *use = uses[I->dest[0].value]; in bi_opt_mod_prop_backward()
377 bi_instr *tex = uses[use->dest[0].value]; in bi_opt_mod_prop_backward()
392 free(uses); in bi_opt_mod_prop_backward()

Completed in 18 milliseconds

12345678910>>...14