HomeSort by relevance Sort by last modified time
    Searched refs:PreviousNode (Results 1 - 11 of 11) sorted by null

  /external/deqp-deps/SPIRV-Tools/source/util/
ilist_node.h 55 inline NodeType* PreviousNode() const;
167 inline NodeType* IntrusiveNodeBase<NodeType>::PreviousNode() const {
ilist.h 45 // allows NextNode and PreviousNode to return pointers to Node, and casting will
297 NodeType* node = sentinel_.PreviousNode();
311 NodeType* node = sentinel_.PreviousNode();
  /external/swiftshader/third_party/SPIRV-Tools/source/util/
ilist_node.h 55 inline NodeType* PreviousNode() const;
167 inline NodeType* IntrusiveNodeBase<NodeType>::PreviousNode() const {
ilist.h 45 // allows NextNode and PreviousNode to return pointers to Node, and casting will
297 NodeType* node = sentinel_.PreviousNode();
311 NodeType* node = sentinel_.PreviousNode();
  /external/swiftshader/third_party/SPIRV-Tools/source/opt/
licm_pass.cpp 128 Instruction* previous_node = insertion_point->PreviousNode();
if_conversion.cpp 249 if ((insertion_pos)->PreviousNode()->opcode() == SpvOpSelectionMerge) {
250 insertion_pos = insertion_pos->PreviousNode();
  /external/deqp-deps/SPIRV-Tools/source/opt/
if_conversion.cpp 249 if ((insertion_pos)->PreviousNode()->opcode() == SpvOpSelectionMerge) {
250 insertion_pos = insertion_pos->PreviousNode();
  /external/clang/lib/Format/
UnwrappedLineFormatter.cpp 745 /// Assume the current state is \p PreviousNode and has been reached with a
747 void addNextStateToQueue(unsigned Penalty, StateNode *PreviousNode,
749 if (NewLine && !Indenter->canBreak(PreviousNode->State))
751 if (!NewLine && Indenter->mustBreak(PreviousNode->State))
755 StateNode(PreviousNode->State, NewLine, PreviousNode);
    [all...]
  /external/deqp-deps/SPIRV-Tools/test/opt/
fold_test.cpp     [all...]
  /external/swiftshader/third_party/SPIRV-Tools/test/opt/
fold_test.cpp     [all...]
  /external/antlr/runtime/Delphi/Sources/Antlr3.Runtime/
Antlr.Runtime.Tree.pas     [all...]

Completed in 596 milliseconds