Home
last modified time | relevance | path

Searched refs:NextNode (Results 1 - 25 of 112) sorted by relevance

12345

/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dremove_duplicates_pass.cpp55 i = i->NextNode(); in RemoveDuplicateCapabilities()
80 i = i->NextNode(); in RemoveDuplicatesExtInstImports()
104 for (auto* i = &*context()->types_values_begin(); i; i = i->NextNode()) { in RemoveDuplicateTypes()
201 i = i->NextNode(); in RemoveDuplicateDecorations()
H A Dbasic_block.h269 Instruction* next_instruction = inst->NextNode(); in WhileEachInst()
321 Instruction* next_instruction = inst->NextNode(); in WhileEachPhiInst()
H A Dfunction.cpp98 Instruction* next_instruction = di->NextNode(); in WhileEachInst()
196 Instruction* next_instruction = di->NextNode(); in ForEachDebugInstructionsInHeader()
H A Ddominator_analysis.cpp71 while ((current = current->NextNode())) { in Dominates()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dremove_duplicates_pass.cpp55 i = i->NextNode(); in RemoveDuplicateCapabilities()
80 i = i->NextNode(); in RemoveDuplicatesExtInstImports()
104 for (auto* i = &*context()->types_values_begin(); i; i = i->NextNode()) { in RemoveDuplicateTypes()
201 i = i->NextNode(); in RemoveDuplicateDecorations()
H A Dbasic_block.h269 Instruction* next_instruction = inst->NextNode(); in WhileEachInst()
321 Instruction* next_instruction = inst->NextNode(); in WhileEachPhiInst()
H A Dfunction.cpp98 Instruction* next_instruction = di->NextNode(); in WhileEachInst()
196 Instruction* next_instruction = di->NextNode(); in ForEachDebugInstructionsInHeader()
H A Ddominator_analysis.cpp71 while ((current = current->NextNode())) { in Dominates()
/third_party/spirv-tools/source/opt/
H A Dremove_duplicates_pass.cpp52 i = i->NextNode(); in RemoveDuplicateCapabilities()
76 i = i->NextNode(); in RemoveDuplicatesExtInstImports()
100 for (auto* i = &*context()->types_values_begin(); i; i = i->NextNode()) { in RemoveDuplicateTypes()
198 i = i->NextNode(); in RemoveDuplicateDecorations()
H A Dfold_spec_constant_op_and_composite_pass.cpp189 for (Instruction* i = last_type_value->NextNode(); i != nullptr; in FoldWithInstructionFolder()
190 i = last_type_value->NextNode()) { in FoldWithInstructionFolder()
195 insert_pos = insert_pos->NextNode(); in FoldWithInstructionFolder()
H A Dbasic_block.h269 Instruction* next_instruction = inst->NextNode(); in WhileEachInst()
321 Instruction* next_instruction = inst->NextNode(); in WhileEachPhiInst()
H A Dfunction.cpp96 Instruction* next_instruction = di->NextNode(); in WhileEachInst()
194 Instruction* next_instruction = di->NextNode(); in ForEachDebugInstructionsInHeader()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DMachineOutliner.cpp385 SuffixTreeNode *NextNode = Active.Node->Children[FirstChar]; in extend() local
387 unsigned SubstringLen = NextNode->size(); in extend()
396 Active.Node = NextNode; in extend()
405 if (Str[NextNode->StartIdx + Active.Len] == LastChar) { in extend()
433 insertInternalNode(Active.Node, NextNode->StartIdx, in extend()
434 NextNode->StartIdx + Active.Len - 1, FirstChar); in extend()
442 NextNode->StartIdx += Active.Len; in extend()
443 SplitNode->Children[Str[NextNode->StartIdx]] = NextNode; in extend()
/third_party/skia/third_party/externals/spirv-tools/source/util/
H A Dilist.h45 // allows NextNode and PreviousNode to return pointers to Node, and casting will
278 return sentinel_.NextNode() == nullptr; in empty()
290 NodeType* node = sentinel_.NextNode(); in front()
304 NodeType* node = sentinel_.NextNode(); in front()
H A Dilist_node.h50 inline NodeType* NextNode() const;
161 inline NodeType* IntrusiveNodeBase<NodeType>::NextNode() const { in NextNode() function in spvtools::utils::IntrusiveNodeBase
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/util/
H A Dilist.h45 // allows NextNode and PreviousNode to return pointers to Node, and casting will
278 return sentinel_.NextNode() == nullptr; in empty()
290 NodeType* node = sentinel_.NextNode(); in front()
304 NodeType* node = sentinel_.NextNode(); in front()
H A Dilist_node.h50 inline NodeType* NextNode() const;
161 inline NodeType* IntrusiveNodeBase<NodeType>::NextNode() const { in NextNode() function in spvtools::utils::IntrusiveNodeBase
/third_party/spirv-tools/source/util/
H A Dilist.h45 // allows NextNode and PreviousNode to return pointers to Node, and casting will
278 return sentinel_.NextNode() == nullptr; in empty()
290 NodeType* node = sentinel_.NextNode(); in front()
304 NodeType* node = sentinel_.NextNode(); in front()
H A Dilist_node.h50 inline NodeType* NextNode() const;
161 inline NodeType* IntrusiveNodeBase<NodeType>::NextNode() const { in NextNode() function in spvtools::utils::IntrusiveNodeBase
/third_party/skia/third_party/externals/spirv-tools/source/fuzz/
H A Dfuzzer_pass_outline_functions.cpp146 non_phi_or_var_inst = non_phi_or_var_inst->NextNode(); in MaybeGetEntryBlockSuitableForOutlining()
179 split_before = split_before->NextNode(); in MaybeGetExitBlockSuitableForOutlining()
H A Dfuzzer_pass_inline_functions.cpp70 function_call_instruction->NextNode()), in Apply()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/
H A Dfuzzer_pass_outline_functions.cpp146 non_phi_or_var_inst = non_phi_or_var_inst->NextNode(); in MaybeGetEntryBlockSuitableForOutlining()
179 split_before = split_before->NextNode(); in MaybeGetExitBlockSuitableForOutlining()
H A Dfuzzer_pass_inline_functions.cpp70 function_call_instruction->NextNode()), in Apply()
/third_party/spirv-tools/source/fuzz/
H A Dfuzzer_pass_outline_functions.cpp146 non_phi_or_var_inst = non_phi_or_var_inst->NextNode(); in MaybeGetEntryBlockSuitableForOutlining()
179 split_before = split_before->NextNode(); in MaybeGetExitBlockSuitableForOutlining()
H A Dfuzzer_pass_inline_functions.cpp70 function_call_instruction->NextNode()), in Apply()

Completed in 16 milliseconds

12345