Home
last modified time | relevance | path

Searched refs:use (Results 26 - 50 of 1216) sorted by relevance

12345678910>>...49

/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dfix_storage_class.cpp4 // you may not use this file except in compliance with the License.
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()
39 use.first, in Process()
44 PropagateType(use.first, inst->type_id(), use.second, &seen); in Process()
69 inst, [&uses](Instruction* use) { uses.push_back(use); }); in PropagateStorageClass()
70 for (Instruction* use in PropagateStorageClass()
[all...]
H A Dsimplification_pass.cpp4 // you may not use this file except in compliance with the License.
56 // only instructions whose inputs do not necessarily dominate the use, we keep in SimplifyFunction()
86 Instruction* use) { in SimplifyFunction()
87 if (process_phis.count(use) && in_work_list.insert(use).second) { in SimplifyFunction()
88 work_list.push_back(use); in SimplifyFunction()
132 inst, [&work_list, &in_work_list](Instruction* use) { in SimplifyFunction()
133 if (!use->IsDecoration() && use->opcode() != SpvOpName && in SimplifyFunction()
134 in_work_list.insert(use) in SimplifyFunction()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dfix_storage_class.cpp4 // you may not use this file except in compliance with the License.
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()
39 use.first, in Process()
44 PropagateType(use.first, inst->type_id(), use.second, &seen); in Process()
69 inst, [&uses](Instruction* use) { uses.push_back(use); }); in PropagateStorageClass()
70 for (Instruction* use in PropagateStorageClass()
[all...]
H A Dsimplification_pass.cpp4 // you may not use this file except in compliance with the License.
56 // only instructions whose inputs do not necessarily dominate the use, we keep in SimplifyFunction()
86 Instruction* use) { in SimplifyFunction()
87 if (process_phis.count(use) && in_work_list.insert(use).second) { in SimplifyFunction()
88 work_list.push_back(use); in SimplifyFunction()
132 inst, [&work_list, &in_work_list](Instruction* use) { in SimplifyFunction()
133 if (!use->IsDecoration() && use->opcode() != SpvOpName && in SimplifyFunction()
134 in_work_list.insert(use) in SimplifyFunction()
[all...]
/third_party/spirv-tools/source/opt/
H A Dfix_storage_class.cpp4 // you may not use this file except in compliance with the License.
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()
39 use.first, in Process()
44 PropagateType(use.first, inst->type_id(), use.second, &seen); in Process()
69 inst, [&uses](Instruction* use) { uses.push_back(use); }); in PropagateStorageClass()
70 for (Instruction* use in PropagateStorageClass()
[all...]
H A Dsimplification_pass.cpp4 // you may not use this file except in compliance with the License.
55 // only instructions whose inputs do not necessarily dominate the use, we keep in SimplifyFunction()
85 Instruction* use) { in SimplifyFunction()
86 if (process_phis.count(use) && in_work_list.insert(use).second) { in SimplifyFunction()
87 work_list.push_back(use); in SimplifyFunction()
131 inst, [&work_list, &in_work_list](Instruction* use) { in SimplifyFunction()
132 if (!use->IsDecoration() && use->opcode() != spv::Op::OpName && in SimplifyFunction()
133 in_work_list.insert(use) in SimplifyFunction()
[all...]
/third_party/typescript/tests/baselines/reference/
H A DcontextualTypingOfTooShortOverloads.js3 var use: Overload; variable
4 use((req, res) => {});
12 app.use((err: any, req, res, next) => { return; });
16 use: IRouterHandler<this> & IRouterMatcher<this>;
55 var use; variable
56 use(function (req, res) { });
59 app.use(function (err, req, res, next) { return; });
H A DcapturedLetConstInLoop9_ES6.js35 declare function use(a: any);
85 use(x);
86 use(z);
87 use(x1);
88 use(z1);
203 use(x);
204 use(z);
205 use(x1);
206 use(z1);
H A DletConstMatchingParameterNames.js4 declare function use(a: any);
12 use(parent);
13 use(parent2);
25 use(parent);
26 use(parent2);
H A DshorthandPropertyAssignmentInES6Module.js10 declare function use(a: any): void;
14 use(x);
15 use(foo);
18 "use strict";
23 "use strict";
28 use(existingModule_1.x);
29 use(missingModule_1.foo);
H A DargumentsAsPropertyName.js7 declare function use(s: any);
11 use(myType.arguments[i]);
14 [1, 2, 3].forEach(function(j) { use(x); })
21 use(myType.arguments[i]);
24 [1, 2, 3].forEach(function (j) { use(x); });
H A DcapturedLetConstInLoop9.js35 declare function use(a: any);
86 use(x);
87 use(z);
88 use(x1);
89 use(z1);
239 use(x);
240 use(z);
241 use(x1);
242 use(z1);
H A DpathMappingBasedModuleResolution7_node.js7 declare function use(x: string);
8 use(x.toFixed());
9 use(y.toFixed());
32 "use strict";
36 "use strict";
44 "use strict";
48 use(file2_1.x.toFixed());
49 use(module3_1.y.toFixed());
/third_party/node/deps/v8/src/compiler/
H A Ddead-code-elimination.cc129 for (Node* const use : node->uses()) { in ReduceLoopOrMerge()
130 if (NodeProperties::IsPhi(use)) { in ReduceLoopOrMerge()
131 DCHECK_EQ(inputs.count() + 1, use->InputCount()); in ReduceLoopOrMerge()
132 use->ReplaceInput(live_input_count, use->InputAt(i)); in ReduceLoopOrMerge()
144 for (Node* const use : node->uses()) { in ReduceLoopOrMerge()
145 if (NodeProperties::IsPhi(use)) { in ReduceLoopOrMerge()
146 Replace(use, use->InputAt(0)); in ReduceLoopOrMerge()
147 } else if (use in ReduceLoopOrMerge()
[all...]
H A Dcontrol-equivalence.cc119 if (entry.use != node->use_edges().end()) { in RunUndirectedDFS()
128 if (entry.use != node->use_edges().end()) { in RunUndirectedDFS()
129 Edge edge = *entry.use; in RunUndirectedDFS()
130 Node* use = edge.from(); in RunUndirectedDFS() local
131 ++(entry.use); in RunUndirectedDFS()
133 // Visit next control use. in RunUndirectedDFS()
134 if (!Participates(use)) continue; in RunUndirectedDFS()
135 if (GetData(use)->visited) continue; in RunUndirectedDFS()
136 if (GetData(use)->on_stack) { in RunUndirectedDFS()
137 // Found backedge if use i in RunUndirectedDFS()
194 Node::UseEdges::iterator use = node->use_edges().begin(); DFSPush() local
[all...]
H A Dall-nodes.cc45 for (Node* use : reachable[i]->uses()) { in Mark()
46 if (use == nullptr || use->id() >= graph->NodeCount()) { in Mark()
49 if (!is_reachable_[use->id()]) { in Mark()
50 is_reachable_[use->id()] = true; in Mark()
51 reachable.push_back(use); in Mark()
H A Dloop-analysis.cc276 for (Node* use : node->uses()) { in SetLoopMarkForLoopHeader()
277 if (NodeProperties::IsPhi(use)) { in SetLoopMarkForLoopHeader()
278 SetLoopMark(use, loop_num); in SetLoopMarkForLoopHeader()
284 if (use->opcode() == IrOpcode::kLoopExit) { in SetLoopMarkForLoopHeader()
285 SetLoopMark(use, loop_num); in SetLoopMarkForLoopHeader()
286 for (Node* exit_use : use->uses()) { in SetLoopMarkForLoopHeader()
332 Node* use = edge.from(); in PropagateForward() local
333 if (!IsBackedge(use, edge.index())) { in PropagateForward()
334 if (PropagateForwardMarks(node, use)) Queue(use); in PropagateForward()
350 IsBackedge(Node* use, int index) IsBackedge() argument
[all...]
/third_party/mesa3d/src/compiler/nir/
H A Dnir_move_vec_src_uses_to_dest.c7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
127 nir_foreach_use_safe(use, vec->src[i].src.ssa) { in move_vec_src_uses_to_dest_block()
128 if (use->parent_instr == &vec->instr) in move_vec_src_uses_to_dest_block()
131 /* We need to dominate the use if we are going to rewrite it */ in move_vec_src_uses_to_dest_block()
132 if (!ssa_def_dominates_instr(&vec->dest.dest.ssa, use->parent_instr)) in move_vec_src_uses_to_dest_block()
136 if (use->parent_instr->type != nir_instr_type_alu) in move_vec_src_uses_to_dest_block()
139 assert(use->is_ssa); in move_vec_src_uses_to_dest_block()
141 nir_alu_instr *use_alu = nir_instr_as_alu(use->parent_instr); in move_vec_src_uses_to_dest_block()
144 nir_alu_src *use_alu_src = exec_node_data(nir_alu_src, use, src); in move_vec_src_uses_to_dest_block()
162 /* At this point, we have determined that the given use ca in move_vec_src_uses_to_dest_block()
[all...]
/third_party/mesa3d/src/freedreno/ir3/
H A Dir3_cf.c7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
91 foreach_ssa_use (use, conv_src) { in all_uses_safe_conv()
93 if (!is_safe_conv(use, src_type, &new_opc)) in all_uses_safe_conv()
109 * shifts the use to a simple mov.
114 foreach_ssa_use (use, src) { in rewrite_src_uses()
115 assert(use->opc == OPC_MOV); in rewrite_src_uses()
118 use->srcs[0]->flags |= IR3_REG_HALF; in rewrite_src_uses()
120 use->srcs[0]->flags &= ~IR3_REG_HALF; in rewrite_src_uses()
123 use->cat1.src_type = use in rewrite_src_uses()
[all...]
/third_party/node/test/parallel/
H A Dtest-repl.js6 // without limitation the rights to use, copy, modify, merge, publish,
22 'use strict';
244 send: '(function() { "use strict"; return 0755; })()',
253 send: '(function(a, a, b) { "use strict"; return a + b + c; })()',
262 send: '(function() { "use strict"; with (this) {} })()',
271 send: '(function() { "use strict"; var x; delete x; })()',
280 send: '(function() { "use strict"; eval = 17; })()',
289 send: '(function() { "use strict"; if (true) function f() { } })()',
405 // This makes sure that we don't crash when we use an inherited property as
820 'SyntaxError: Cannot use impor
[all...]
/third_party/skia/third_party/externals/tint/src/reader/wgsl/
H A Dparser_impl.cc4 // you may not use this file except in compliance with the License.
270 const std::string& use) { in add_error()
273 if (!use.empty()) { in add_error()
274 msg << " for " << use; in add_error() local
296 diag::System::Reader, "use of deprecated language feature: " + msg, in deprecated()
511 const char* use = "let declaration"; in global_constant_decl() local
513 auto decl = expect_variable_ident_decl(use, /* allow_inferred = */ true); in global_constant_decl()
585 const char* use = "sampled texture type"; in texture_sampler_types() local
587 auto subtype = expect_lt_gt_block(use, [&] { return expect_type(use); }); in texture_sampler_types()
268 add_error(const Source& source, const std::string& err, const std::string& use) add_error() argument
596 const char* use = "multisampled texture type"; texture_sampler_types() local
608 const char* use = "storage texture type"; texture_sampler_types() local
784 expect_image_storage_type( const std::string& use) expect_image_storage_type() argument
896 expect_variable_ident_decl( const std::string& use, bool allow_inferred) expect_variable_ident_decl() argument
927 expect_access(const std::string& use) expect_access() argument
949 auto* use = "variable declaration"; variable_qualifier() local
981 const char* use = "type alias"; type_alias() local
1094 expect_type(const std::string& use) expect_type() argument
1104 const char* use = "ptr declaration"; expect_type_decl_pointer() local
1145 const char* use = "atomic declaration"; expect_type_decl_atomic() local
1162 const char* use = "vector"; expect_type_decl_vector() local
1175 const char* use = "array declaration"; expect_type_decl_array() local
1220 const char* use = "matrix"; expect_type_decl_matrix() local
1239 expect_storage_class( const std::string& use) expect_storage_class() argument
1384 const char* use = "function declaration"; function_header() local
1910 const char* use = "case statement"; switch_body() local
[all...]
/third_party/mesa3d/src/asahi/compiler/
H A Dagx_optimizer.c7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
35 * Every use of a def is visited before the def.
145 agx_optimizer_fmov_rev(agx_instr *I, agx_instr *use) in agx_optimizer_fmov_rev() argument
147 if (!agx_is_fmov(use)) return false; in agx_optimizer_fmov_rev()
148 if (use->src[0].neg || use->src[0].abs) return false; in agx_optimizer_fmov_rev()
151 I->saturate |= use->saturate; in agx_optimizer_fmov_rev()
152 I->dest[0] = use->dest[0]; in agx_optimizer_fmov_rev()
234 agx_instr *use = uses[I->dest[0].value]; in agx_optimizer_backward() local
236 if (!use || BITSET_TES in agx_optimizer_backward()
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/reduce/
H A Dstructured_loop_to_selection_reduction_opportunity.cpp4 // you may not use this file except in compliance with the License.
190 // it into OpBranchConditional. We use "true" as the condition, and make in ChangeLoopToSelection()
225 opt::Instruction* use, in FixNonDominatedIdUses()
228 if (context_->get_instr_block(use) == nullptr) { in FixNonDominatedIdUses()
231 // If a use is not appropriately dominated by its definition, in FixNonDominatedIdUses()
232 // replace the use with an OpUndef, unless the definition is an in FixNonDominatedIdUses()
235 if (!DefinitionSufficientlyDominatesUse(&def, use, index, block)) { in FixNonDominatedIdUses()
241 use->SetOperand( in FixNonDominatedIdUses()
251 use->SetOperand( in FixNonDominatedIdUses()
259 use in FixNonDominatedIdUses()
269 DefinitionSufficientlyDominatesUse(opt::Instruction* def, opt::Instruction* use, uint32_t use_index, opt::BasicBlock& def_block) DefinitionSufficientlyDominatesUse() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/reduce/
H A Dstructured_loop_to_selection_reduction_opportunity.cpp4 // you may not use this file except in compliance with the License.
190 // it into OpBranchConditional. We use "true" as the condition, and make in ChangeLoopToSelection()
225 opt::Instruction* use, in FixNonDominatedIdUses()
228 if (context_->get_instr_block(use) == nullptr) { in FixNonDominatedIdUses()
231 // If a use is not appropriately dominated by its definition, in FixNonDominatedIdUses()
232 // replace the use with an OpUndef, unless the definition is an in FixNonDominatedIdUses()
235 if (!DefinitionSufficientlyDominatesUse(&def, use, index, block)) { in FixNonDominatedIdUses()
241 use->SetOperand( in FixNonDominatedIdUses()
251 use->SetOperand( in FixNonDominatedIdUses()
259 use in FixNonDominatedIdUses()
269 DefinitionSufficientlyDominatesUse(opt::Instruction* def, opt::Instruction* use, uint32_t use_index, opt::BasicBlock& def_block) DefinitionSufficientlyDominatesUse() argument
[all...]
/third_party/spirv-tools/source/reduce/
H A Dstructured_loop_to_selection_reduction_opportunity.cpp4 // you may not use this file except in compliance with the License.
191 // it into OpBranchConditional. We use "true" as the condition, and make in ChangeLoopToSelection()
226 opt::Instruction* use, in FixNonDominatedIdUses()
229 if (context_->get_instr_block(use) == nullptr) { in FixNonDominatedIdUses()
232 // If a use is not appropriately dominated by its definition, in FixNonDominatedIdUses()
233 // replace the use with an OpUndef, unless the definition is an in FixNonDominatedIdUses()
236 if (!DefinitionSufficientlyDominatesUse(&def, use, index, block)) { in FixNonDominatedIdUses()
242 use->SetOperand( in FixNonDominatedIdUses()
252 use->SetOperand( in FixNonDominatedIdUses()
260 use in FixNonDominatedIdUses()
270 DefinitionSufficientlyDominatesUse(opt::Instruction* def, opt::Instruction* use, uint32_t use_index, opt::BasicBlock& def_block) DefinitionSufficientlyDominatesUse() argument
[all...]

Completed in 12 milliseconds

12345678910>>...49