Home
last modified time | relevance | path

Searched refs:work_list (Results 1 - 25 of 31) sorted by relevance

12

/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dvector_dce.cpp45 std::vector<WorkListItem> work_list; in FindLiveComponents() local
54 [&work_list, this, live_components](Instruction* current_inst) { in FindLiveComponents()
61 &work_list); in FindLiveComponents()
66 for (uint32_t i = 0; i < work_list.size(); i++) { in FindLiveComponents()
67 WorkListItem current_item = work_list[i]; in FindLiveComponents()
73 live_components, &work_list); in FindLiveComponents()
76 MarkInsertUsesAsLive(current_item, live_components, &work_list); in FindLiveComponents()
79 MarkVectorShuffleUsesAsLive(current_item, live_components, &work_list); in FindLiveComponents()
83 &work_list); in FindLiveComponents()
88 &work_list); in FindLiveComponents()
98 MarkExtractUseAsLive(const Instruction* current_inst, const utils::BitVector& live_elements, LiveComponentMap* live_components, std::vector<WorkListItem>* work_list) MarkExtractUseAsLive() argument
123 MarkInsertUsesAsLive( const VectorDCE::WorkListItem& current_item, LiveComponentMap* live_components, std::vector<VectorDCE::WorkListItem>* work_list) MarkInsertUsesAsLive() argument
170 MarkVectorShuffleUsesAsLive( const WorkListItem& current_item, VectorDCE::LiveComponentMap* live_components, std::vector<WorkListItem>* work_list) MarkVectorShuffleUsesAsLive() argument
204 MarkCompositeContructUsesAsLive( VectorDCE::WorkListItem work_item, VectorDCE::LiveComponentMap* live_components, std::vector<VectorDCE::WorkListItem>* work_list) MarkCompositeContructUsesAsLive() argument
242 MarkUsesAsLive( Instruction* current_inst, const utils::BitVector& live_elements, LiveComponentMap* live_components, std::vector<VectorDCE::WorkListItem>* work_list) MarkUsesAsLive() argument
416 AddItemToWorkListIfNeeded( WorkListItem work_item, VectorDCE::LiveComponentMap* live_components, std::vector<WorkListItem>* work_list) AddItemToWorkListIfNeeded() argument
[all...]
H A Dsimplification_pass.cpp37 std::vector<Instruction*>* work_list) { in AddNewOperands()
40 [&inst_seen, &def_use_mgr, &work_list](uint32_t* iid) { in AddNewOperands()
43 work_list->push_back(iid_inst); in AddNewOperands()
59 std::vector<Instruction*> work_list; in SimplifyFunction() local
68 [&modified, &process_phis, &work_list, &in_work_list, &inst_to_kill, in SimplifyFunction()
84 get_def_use_mgr()->ForEachUser(inst, [&work_list, &process_phis, in SimplifyFunction()
88 work_list.push_back(use); in SimplifyFunction()
92 AddNewOperands(inst, &inst_seen, &work_list); in SimplifyFunction()
118 for (size_t i = 0; i < work_list.size(); ++i) { in SimplifyFunction()
119 Instruction* inst = work_list[ in SimplifyFunction()
35 AddNewOperands( Instruction* folded_inst, std::unordered_set<Instruction*>* inst_seen, std::vector<Instruction*>* work_list) AddNewOperands() argument
[all...]
H A Dreplace_desc_array_access_using_var_index.cpp54 std::vector<Instruction*> work_list; in ReplaceVariableAccessesWithConstantElements() local
55 get_def_use_mgr()->ForEachUser(var, [&work_list](Instruction* use) { in ReplaceVariableAccessesWithConstantElements()
59 work_list.push_back(use); in ReplaceVariableAccessesWithConstantElements()
67 for (Instruction* access_chain : work_list) { in ReplaceVariableAccessesWithConstantElements()
106 std::queue<Instruction*> work_list; in CollectRecursiveUsersWithConcreteType() local
107 work_list.push(access_chain); in CollectRecursiveUsersWithConcreteType()
108 while (!work_list.empty()) { in CollectRecursiveUsersWithConcreteType()
109 auto* inst_from_work_list = work_list.front(); in CollectRecursiveUsersWithConcreteType()
110 work_list.pop(); in CollectRecursiveUsersWithConcreteType()
112 inst_from_work_list, [this, final_users, &work_list](Instructio in CollectRecursiveUsersWithConcreteType()
127 std::queue<Instruction*> work_list; CollectRequiredImageInsts() local
[all...]
H A Dvector_dce.h106 // Adds |work_item| to |work_list| if it is not already live according to
111 std::vector<WorkListItem>* work_list);
115 // added to |work_list|.
119 std::vector<WorkListItem>* work_list);
123 // they are added to |work_list| and |live_components| is updated
127 std::vector<WorkListItem>* work_list);
131 // live they are added to |work_list| and |live_components| is updated
135 std::vector<WorkListItem>* work_list);
138 // live. If anything becomes live they are added to |work_list| and
143 std::vector<WorkListItem>* work_list);
[all...]
H A Ddead_branch_elim_pass.cpp614 std::vector<uint32_t> work_list; in AddBlocksWithBackEdge() local
615 work_list.push_back(cont_id); in AddBlocksWithBackEdge()
617 while (!work_list.empty()) { in AddBlocksWithBackEdge()
618 uint32_t bb_id = work_list.back(); in AddBlocksWithBackEdge()
619 work_list.pop_back(); in AddBlocksWithBackEdge()
624 bb->ForEachSuccessorLabel([header_id, &visited, &work_list, in AddBlocksWithBackEdge()
627 work_list.push_back(*succ_label_id); in AddBlocksWithBackEdge()
H A Dir_context.cpp225 std::vector<Instruction*> work_list; in CollectNonSemanticTree()
227 work_list.push_back(inst); in CollectNonSemanticTree()
229 while (!work_list.empty()) { in CollectNonSemanticTree()
230 auto* i = work_list.back(); in CollectNonSemanticTree()
231 work_list.pop_back(); in CollectNonSemanticTree()
233 i, [&work_list, to_kill, &seen](Instruction* user) { in CollectNonSemanticTree()
235 work_list.push_back(user); in CollectNonSemanticTree()
H A Ddesc_sroa.cpp357 std::vector<Instruction*> work_list; in ReplaceLoadedValue() local
359 value->result_id(), [this, &work_list](Instruction* use) { in ReplaceLoadedValue()
365 work_list.push_back(use); in ReplaceLoadedValue()
373 for (Instruction* use : work_list) { in ReplaceLoadedValue()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dvector_dce.cpp45 std::vector<WorkListItem> work_list; in FindLiveComponents() local
54 [&work_list, this, live_components](Instruction* current_inst) { in FindLiveComponents()
61 &work_list); in FindLiveComponents()
66 for (uint32_t i = 0; i < work_list.size(); i++) { in FindLiveComponents()
67 WorkListItem current_item = work_list[i]; in FindLiveComponents()
73 live_components, &work_list); in FindLiveComponents()
76 MarkInsertUsesAsLive(current_item, live_components, &work_list); in FindLiveComponents()
79 MarkVectorShuffleUsesAsLive(current_item, live_components, &work_list); in FindLiveComponents()
83 &work_list); in FindLiveComponents()
88 &work_list); in FindLiveComponents()
98 MarkExtractUseAsLive(const Instruction* current_inst, const utils::BitVector& live_elements, LiveComponentMap* live_components, std::vector<WorkListItem>* work_list) MarkExtractUseAsLive() argument
123 MarkInsertUsesAsLive( const VectorDCE::WorkListItem& current_item, LiveComponentMap* live_components, std::vector<VectorDCE::WorkListItem>* work_list) MarkInsertUsesAsLive() argument
170 MarkVectorShuffleUsesAsLive( const WorkListItem& current_item, VectorDCE::LiveComponentMap* live_components, std::vector<WorkListItem>* work_list) MarkVectorShuffleUsesAsLive() argument
204 MarkCompositeContructUsesAsLive( VectorDCE::WorkListItem work_item, VectorDCE::LiveComponentMap* live_components, std::vector<VectorDCE::WorkListItem>* work_list) MarkCompositeContructUsesAsLive() argument
242 MarkUsesAsLive( Instruction* current_inst, const utils::BitVector& live_elements, LiveComponentMap* live_components, std::vector<VectorDCE::WorkListItem>* work_list) MarkUsesAsLive() argument
416 AddItemToWorkListIfNeeded( WorkListItem work_item, VectorDCE::LiveComponentMap* live_components, std::vector<WorkListItem>* work_list) AddItemToWorkListIfNeeded() argument
[all...]
H A Dsimplification_pass.cpp37 std::vector<Instruction*>* work_list) { in AddNewOperands()
40 [&inst_seen, &def_use_mgr, &work_list](uint32_t* iid) { in AddNewOperands()
43 work_list->push_back(iid_inst); in AddNewOperands()
59 std::vector<Instruction*> work_list; in SimplifyFunction() local
68 [&modified, &process_phis, &work_list, &in_work_list, &inst_to_kill, in SimplifyFunction()
84 get_def_use_mgr()->ForEachUser(inst, [&work_list, &process_phis, in SimplifyFunction()
88 work_list.push_back(use); in SimplifyFunction()
92 AddNewOperands(inst, &inst_seen, &work_list); in SimplifyFunction()
118 for (size_t i = 0; i < work_list.size(); ++i) { in SimplifyFunction()
119 Instruction* inst = work_list[ in SimplifyFunction()
35 AddNewOperands( Instruction* folded_inst, std::unordered_set<Instruction*>* inst_seen, std::vector<Instruction*>* work_list) AddNewOperands() argument
[all...]
H A Dreplace_desc_array_access_using_var_index.cpp54 std::vector<Instruction*> work_list; in ReplaceVariableAccessesWithConstantElements() local
55 get_def_use_mgr()->ForEachUser(var, [&work_list](Instruction* use) { in ReplaceVariableAccessesWithConstantElements()
59 work_list.push_back(use); in ReplaceVariableAccessesWithConstantElements()
67 for (Instruction* access_chain : work_list) { in ReplaceVariableAccessesWithConstantElements()
106 std::queue<Instruction*> work_list; in CollectRecursiveUsersWithConcreteType() local
107 work_list.push(access_chain); in CollectRecursiveUsersWithConcreteType()
108 while (!work_list.empty()) { in CollectRecursiveUsersWithConcreteType()
109 auto* inst_from_work_list = work_list.front(); in CollectRecursiveUsersWithConcreteType()
110 work_list.pop(); in CollectRecursiveUsersWithConcreteType()
112 inst_from_work_list, [this, final_users, &work_list](Instructio in CollectRecursiveUsersWithConcreteType()
127 std::queue<Instruction*> work_list; CollectRequiredImageInsts() local
[all...]
H A Dvector_dce.h106 // Adds |work_item| to |work_list| if it is not already live according to
111 std::vector<WorkListItem>* work_list);
115 // added to |work_list|.
119 std::vector<WorkListItem>* work_list);
123 // they are added to |work_list| and |live_components| is updated
127 std::vector<WorkListItem>* work_list);
131 // live they are added to |work_list| and |live_components| is updated
135 std::vector<WorkListItem>* work_list);
138 // live. If anything becomes live they are added to |work_list| and
143 std::vector<WorkListItem>* work_list);
[all...]
H A Ddead_branch_elim_pass.cpp614 std::vector<uint32_t> work_list; in AddBlocksWithBackEdge() local
615 work_list.push_back(cont_id); in AddBlocksWithBackEdge()
617 while (!work_list.empty()) { in AddBlocksWithBackEdge()
618 uint32_t bb_id = work_list.back(); in AddBlocksWithBackEdge()
619 work_list.pop_back(); in AddBlocksWithBackEdge()
624 bb->ForEachSuccessorLabel([header_id, &visited, &work_list, in AddBlocksWithBackEdge()
627 work_list.push_back(*succ_label_id); in AddBlocksWithBackEdge()
H A Dir_context.cpp225 std::vector<Instruction*> work_list; in CollectNonSemanticTree()
227 work_list.push_back(inst); in CollectNonSemanticTree()
229 while (!work_list.empty()) { in CollectNonSemanticTree()
230 auto* i = work_list.back(); in CollectNonSemanticTree()
231 work_list.pop_back(); in CollectNonSemanticTree()
233 i, [&work_list, to_kill, &seen](Instruction* user) { in CollectNonSemanticTree()
235 work_list.push_back(user); in CollectNonSemanticTree()
H A Ddesc_sroa.cpp358 std::vector<Instruction*> work_list; in ReplaceLoadedValue() local
360 value->result_id(), [this, &work_list](Instruction* use) { in ReplaceLoadedValue()
366 work_list.push_back(use); in ReplaceLoadedValue()
374 for (Instruction* use : work_list) { in ReplaceLoadedValue()
/third_party/spirv-tools/source/opt/
H A Dvector_dce.cpp43 std::vector<WorkListItem> work_list; in FindLiveComponents() local
52 [&work_list, this, live_components](Instruction* current_inst) { in FindLiveComponents()
59 &work_list); in FindLiveComponents()
64 for (uint32_t i = 0; i < work_list.size(); i++) { in FindLiveComponents()
65 WorkListItem current_item = work_list[i]; in FindLiveComponents()
71 live_components, &work_list); in FindLiveComponents()
74 MarkInsertUsesAsLive(current_item, live_components, &work_list); in FindLiveComponents()
77 MarkVectorShuffleUsesAsLive(current_item, live_components, &work_list); in FindLiveComponents()
81 &work_list); in FindLiveComponents()
86 &work_list); in FindLiveComponents()
96 MarkExtractUseAsLive(const Instruction* current_inst, const utils::BitVector& live_elements, LiveComponentMap* live_components, std::vector<WorkListItem>* work_list) MarkExtractUseAsLive() argument
121 MarkInsertUsesAsLive( const VectorDCE::WorkListItem& current_item, LiveComponentMap* live_components, std::vector<VectorDCE::WorkListItem>* work_list) MarkInsertUsesAsLive() argument
168 MarkVectorShuffleUsesAsLive( const WorkListItem& current_item, VectorDCE::LiveComponentMap* live_components, std::vector<WorkListItem>* work_list) MarkVectorShuffleUsesAsLive() argument
202 MarkCompositeContructUsesAsLive( VectorDCE::WorkListItem work_item, VectorDCE::LiveComponentMap* live_components, std::vector<VectorDCE::WorkListItem>* work_list) MarkCompositeContructUsesAsLive() argument
240 MarkUsesAsLive( Instruction* current_inst, const utils::BitVector& live_elements, LiveComponentMap* live_components, std::vector<VectorDCE::WorkListItem>* work_list) MarkUsesAsLive() argument
414 AddItemToWorkListIfNeeded( WorkListItem work_item, VectorDCE::LiveComponentMap* live_components, std::vector<WorkListItem>* work_list) AddItemToWorkListIfNeeded() argument
[all...]
H A Dsimplification_pass.cpp36 std::vector<Instruction*>* work_list) { in AddNewOperands()
39 [&inst_seen, &def_use_mgr, &work_list](uint32_t* iid) { in AddNewOperands()
42 work_list->push_back(iid_inst); in AddNewOperands()
58 std::vector<Instruction*> work_list; in SimplifyFunction() local
67 [&modified, &process_phis, &work_list, &in_work_list, &inst_to_kill, in SimplifyFunction()
83 get_def_use_mgr()->ForEachUser(inst, [&work_list, &process_phis, in SimplifyFunction()
87 work_list.push_back(use); in SimplifyFunction()
91 AddNewOperands(inst, &inst_seen, &work_list); in SimplifyFunction()
117 for (size_t i = 0; i < work_list.size(); ++i) { in SimplifyFunction()
118 Instruction* inst = work_list[ in SimplifyFunction()
34 AddNewOperands( Instruction* folded_inst, std::unordered_set<Instruction*>* inst_seen, std::vector<Instruction*>* work_list) AddNewOperands() argument
[all...]
H A Dreplace_desc_array_access_using_var_index.cpp53 std::vector<Instruction*> work_list; in ReplaceVariableAccessesWithConstantElements() local
54 get_def_use_mgr()->ForEachUser(var, [&work_list](Instruction* use) { in ReplaceVariableAccessesWithConstantElements()
58 work_list.push_back(use); in ReplaceVariableAccessesWithConstantElements()
66 for (Instruction* access_chain : work_list) { in ReplaceVariableAccessesWithConstantElements()
105 std::queue<Instruction*> work_list; in CollectRecursiveUsersWithConcreteType() local
106 work_list.push(access_chain); in CollectRecursiveUsersWithConcreteType()
107 while (!work_list.empty()) { in CollectRecursiveUsersWithConcreteType()
108 auto* inst_from_work_list = work_list.front(); in CollectRecursiveUsersWithConcreteType()
109 work_list.pop(); in CollectRecursiveUsersWithConcreteType()
111 inst_from_work_list, [this, final_users, &work_list](Instructio in CollectRecursiveUsersWithConcreteType()
126 std::queue<Instruction*> work_list; CollectRequiredImageAndAccessInsts() local
[all...]
H A Dvector_dce.h106 // Adds |work_item| to |work_list| if it is not already live according to
111 std::vector<WorkListItem>* work_list);
115 // added to |work_list|.
119 std::vector<WorkListItem>* work_list);
123 // they are added to |work_list| and |live_components| is updated
127 std::vector<WorkListItem>* work_list);
131 // live they are added to |work_list| and |live_components| is updated
135 std::vector<WorkListItem>* work_list);
138 // live. If anything becomes live they are added to |work_list| and
143 std::vector<WorkListItem>* work_list);
[all...]
H A Ddead_branch_elim_pass.cpp602 std::vector<uint32_t> work_list; in AddBlocksWithBackEdge() local
603 work_list.push_back(cont_id); in AddBlocksWithBackEdge()
605 while (!work_list.empty()) { in AddBlocksWithBackEdge()
606 uint32_t bb_id = work_list.back(); in AddBlocksWithBackEdge()
607 work_list.pop_back(); in AddBlocksWithBackEdge()
612 bb->ForEachSuccessorLabel([header_id, &visited, &work_list, in AddBlocksWithBackEdge()
615 work_list.push_back(*succ_label_id); in AddBlocksWithBackEdge()
/third_party/skia/third_party/externals/spirv-tools/source/
H A Dcfa.h43 /// Returns true if a block with @p id is found in the @p work_list vector
45 /// @param[in] work_list Set of blocks visited in the the depth first
50 /// @return true if the edge work_list.back().block->id() => id is a back-edge
51 static bool FindInWorkList(const std::vector<block_info>& work_list,
128 bool CFA<BB>::FindInWorkList(const std::vector<block_info>& work_list, in FindInWorkList() argument
130 for (const auto& b : work_list) { in FindInWorkList()
144 /// NOTE: work_list is the sequence of nodes from the root node to the node in DepthFirstTraversal()
146 std::vector<block_info> work_list; in DepthFirstTraversal() local
147 work_list.reserve(10); in DepthFirstTraversal()
149 work_list in DepthFirstTraversal()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/
H A Dcfa.h43 /// Returns true if a block with @p id is found in the @p work_list vector
45 /// @param[in] work_list Set of blocks visited in the the depth first
50 /// @return true if the edge work_list.back().block->id() => id is a back-edge
51 static bool FindInWorkList(const std::vector<block_info>& work_list,
128 bool CFA<BB>::FindInWorkList(const std::vector<block_info>& work_list, in FindInWorkList() argument
130 for (const auto& b : work_list) { in FindInWorkList()
144 /// NOTE: work_list is the sequence of nodes from the root node to the node in DepthFirstTraversal()
146 std::vector<block_info> work_list; in DepthFirstTraversal() local
147 work_list.reserve(10); in DepthFirstTraversal()
149 work_list in DepthFirstTraversal()
[all...]
/third_party/mesa3d/src/panfrost/util/
H A Dpan_liveness.c115 struct set *work_list = _mesa_set_create(NULL, in pan_compute_liveness() local
135 cur = _mesa_set_add(work_list, pan_exit_block(blocks)); in pan_compute_liveness()
142 _mesa_set_remove(work_list, cur); in pan_compute_liveness()
151 _mesa_set_add(work_list, pred); in pan_compute_liveness()
155 } while((cur = _mesa_set_next_entry(work_list, NULL)) != NULL); in pan_compute_liveness()
158 _mesa_set_destroy(work_list, NULL); in pan_compute_liveness()
/third_party/mesa3d/src/panfrost/midgard/
H A Dmidgard_helper_invocations.c210 struct set *work_list = _mesa_set_create(NULL, in mir_analyze_helper_requirements() local
218 struct set_entry *cur = _mesa_set_add(work_list, pan_exit_block(&ctx->blocks)); in mir_analyze_helper_requirements()
222 _mesa_set_remove(work_list, cur); in mir_analyze_helper_requirements()
228 _mesa_set_add(work_list, pred); in mir_analyze_helper_requirements()
232 } while((cur = _mesa_set_next_entry(work_list, NULL)) != NULL); in mir_analyze_helper_requirements()
235 _mesa_set_destroy(work_list, NULL); in mir_analyze_helper_requirements()
/third_party/mesa3d/src/compiler/spirv/
H A Dvtn_cfg.c518 struct list_head *work_list, in vtn_add_cfg_work_item()
527 list_addtail(&work->link, work_list); in vtn_add_cfg_work_item()
603 struct list_head *work_list, in vtn_process_block()
694 vtn_add_cfg_work_item(b, work_list, &loop->node, in vtn_process_block()
707 vtn_add_cfg_work_item(b, work_list, &loop->node, in vtn_process_block()
785 vtn_add_cfg_work_item(b, work_list, &if_stmt->node, in vtn_process_block()
793 vtn_add_cfg_work_item(b, work_list, &if_stmt->node, in vtn_process_block()
836 vtn_add_cfg_work_item(b, work_list, &cse->node, in vtn_process_block()
884 struct list_head work_list; in vtn_build_cfg() local
885 list_inithead(&work_list); in vtn_build_cfg()
517 vtn_add_cfg_work_item(struct vtn_builder *b, struct list_head *work_list, struct vtn_cf_node *cf_parent, struct list_head *cf_list, struct vtn_block *start_block) vtn_add_cfg_work_item() argument
602 vtn_process_block(struct vtn_builder *b, struct list_head *work_list, struct vtn_cf_node *cf_parent, struct list_head *cf_list, struct vtn_block *block) vtn_process_block() argument
1286 vtn_add_unstructured_block(struct vtn_builder *b, struct vtn_function *func, struct list_head *work_list, struct vtn_block *block) vtn_add_unstructured_block() argument
1301 struct list_head work_list; vtn_emit_cf_func_unstructured() local
[all...]
/third_party/spirv-tools/source/
H A Dcfa.h43 /// Returns true if a block with @p id is found in the @p work_list vector
45 /// @param[in] work_list Set of blocks visited in the depth first
50 /// @return true if the edge work_list.back().block->id() => id is a back-edge
51 static bool FindInWorkList(const std::vector<block_info>& work_list,
155 bool CFA<BB>::FindInWorkList(const std::vector<block_info>& work_list, in FindInWorkList() argument
157 for (const auto& b : work_list) { in FindInWorkList()
187 /// NOTE: work_list is the sequence of nodes from the root node to the node in DepthFirstTraversal()
189 std::vector<block_info> work_list; in DepthFirstTraversal() local
190 work_list.reserve(10); in DepthFirstTraversal()
192 work_list in DepthFirstTraversal()
[all...]

Completed in 18 milliseconds

12