Home
last modified time | relevance | path

Searched refs:structuredOrder (Results 1 – 6 of 6) sorted by relevance

/external/deqp-deps/SPIRV-Tools/source/opt/
Daggressive_dead_code_elim_pass.cpp197 std::list<BasicBlock*>& structuredOrder) { in ComputeBlock2HeaderMaps() argument
206 for (auto bi = structuredOrder.begin(); bi != structuredOrder.end(); in ComputeBlock2HeaderMaps()
323 std::list<BasicBlock*> structuredOrder; in AggressiveDCE() local
324 cfg()->ComputeStructuredOrder(func, &*func->begin(), &structuredOrder); in AggressiveDCE()
325 ComputeBlock2HeaderMaps(structuredOrder); in AggressiveDCE()
342 for (auto bi = structuredOrder.begin(); bi != structuredOrder.end(); ++bi) { in AggressiveDCE()
496 for (auto bi = structuredOrder.begin(); bi != structuredOrder.end();) { in AggressiveDCE()
Dcommon_uniform_elim_pass.cpp338 std::list<BasicBlock*> structuredOrder; in CommonUniformLoadElimination() local
339 ComputeStructuredOrder(func, &structuredOrder); in CommonUniformLoadElimination()
351 for (auto bi = structuredOrder.begin(); bi != structuredOrder.end(); ++bi) { in CommonUniformLoadElimination()
Daggressive_dead_code_elim_pass.h112 void ComputeBlock2HeaderMaps(std::list<BasicBlock*>& structuredOrder);
/external/swiftshader/third_party/SPIRV-Tools/source/opt/
Daggressive_dead_code_elim_pass.cpp197 std::list<BasicBlock*>& structuredOrder) { in ComputeBlock2HeaderMaps() argument
206 for (auto bi = structuredOrder.begin(); bi != structuredOrder.end(); in ComputeBlock2HeaderMaps()
323 std::list<BasicBlock*> structuredOrder; in AggressiveDCE() local
324 cfg()->ComputeStructuredOrder(func, &*func->begin(), &structuredOrder); in AggressiveDCE()
325 ComputeBlock2HeaderMaps(structuredOrder); in AggressiveDCE()
342 for (auto bi = structuredOrder.begin(); bi != structuredOrder.end(); ++bi) { in AggressiveDCE()
496 for (auto bi = structuredOrder.begin(); bi != structuredOrder.end();) { in AggressiveDCE()
Dcommon_uniform_elim_pass.cpp339 std::list<BasicBlock*> structuredOrder; in CommonUniformLoadElimination() local
340 ComputeStructuredOrder(func, &structuredOrder); in CommonUniformLoadElimination()
352 for (auto bi = structuredOrder.begin(); bi != structuredOrder.end(); ++bi) { in CommonUniformLoadElimination()
Daggressive_dead_code_elim_pass.h114 void ComputeBlock2HeaderMaps(std::list<BasicBlock*>& structuredOrder);