Home
last modified time | relevance | path

Searched refs:NodeTy (Results 1 – 25 of 394) sorted by relevance

12345678910>>...16

/dports/devel/py-keystone-engine/keystone-engine-0.9.1-3/src/llvm/include/llvm/ADT/
H A Dilist_node.h20 template<typename NodeTy>
27 template<typename NodeTy>
31 NodeTy *Prev;
33 NodeTy *getPrev() { return Prev; }
39 template<typename NodeTy>
47 template<typename NodeTy>
53 NodeTy *Next;
63 return ilist_iterator<NodeTy>(static_cast<NodeTy *>(this));
67 return ilist_iterator<const NodeTy>(static_cast<const NodeTy *>(this));
94 NodeTy *getPrevNode() {
[all …]
H A Dilist.h57 static NodeTy *getPrev(NodeTy *N) { return N->getPrev(); } in getPrev()
58 static NodeTy *getNext(NodeTy *N) { return N->getNext(); } in getNext()
78 static NodeTy *createSentinel() { return new NodeTy(); } in createSentinel()
91 static NodeTy *ensureHead(NodeTy *&Head) { in ensureHead()
129 static void noteHead(NodeTy *, NodeTy *) {} in noteHead()
148 static void noteHead(NodeTy *, NodeTy *) {} in noteHead()
159 static NodeTy *createNode(const NodeTy &V) { return new NodeTy(V); } in createNode()
692 NodeTy *getPrevNode(NodeTy &N) const {
699 const NodeTy *getPrevNode(const NodeTy &N) const {
704 NodeTy *getNextNode(NodeTy &N) const {
[all …]
/dports/devel/llbuild/swift-llbuild-swift-DEVELOPMENT-SNAPSHOT-2017-12-10-a/include/llvm/ADT/
H A Dilist.h57 static NodeTy *getPrev(NodeTy *N) { return N->getPrev(); } in getPrev()
58 static NodeTy *getNext(NodeTy *N) { return N->getNext(); } in getNext()
62 static void setPrev(NodeTy *N, NodeTy *Prev) { N->setPrev(Prev); } in setPrev()
63 static void setNext(NodeTy *N, NodeTy *Next) { N->setNext(Next); } in setNext()
78 static NodeTy *createSentinel() { return new NodeTy(); } in createSentinel()
91 static NodeTy *ensureHead(NodeTy *&Head) { in ensureHead()
102 static void noteHead(NodeTy *NewHead, NodeTy *Sentinel) { in noteHead()
112 static NodeTy *createNode(const NodeTy &V) { return new NodeTy(V); } in createNode()
312 template<typename NodeTy, typename Traits=ilist_traits<NodeTy> >
330 static bool op_less(NodeTy &L, NodeTy &R) { return L < R; }
[all …]
H A Dilist_node.h20 template<typename NodeTy>
25 template<typename NodeTy>
28 NodeTy *Prev;
30 NodeTy *getPrev() { return Prev; }
36 template<typename NodeTy>
42 template<typename NodeTy>
46 NodeTy *Next;
58 NodeTy *getPrevNode() {
59 NodeTy *Prev = this->getPrev();
80 NodeTy *getNextNode() {
[all …]
/dports/security/clamav-lts/clamav-0.103.5/libclamav/c++/llvm/include/llvm/ADT/
H A Dilist.h55 static NodeTy *getPrev(NodeTy *N) { return N->getPrev(); } in getPrev()
56 static NodeTy *getNext(NodeTy *N) { return N->getNext(); } in getNext()
60 static void setPrev(NodeTy *N, NodeTy *Prev) { N->setPrev(Prev); } in setPrev()
61 static void setNext(NodeTy *N, NodeTy *Next) { N->setNext(Next); } in setNext()
76 static NodeTy *createSentinel() { return new NodeTy(); } in createSentinel()
89 static NodeTy *ensureHead(NodeTy *&Head) { in ensureHead()
100 static void noteHead(NodeTy *NewHead, NodeTy *Sentinel) { in noteHead()
110 static NodeTy *createNode(const NodeTy &V) { return new NodeTy(V); } in createNode()
310 template<typename NodeTy, typename Traits=ilist_traits<NodeTy> >
328 static bool op_less(NodeTy &L, NodeTy &R) { return L < R; }
[all …]
H A Dilist_node.h20 template<typename NodeTy>
25 template<typename NodeTy>
28 NodeTy *Prev;
30 NodeTy *getPrev() { return Prev; }
36 template<typename NodeTy>
42 template<typename NodeTy>
46 NodeTy *Next;
58 NodeTy *getPrevNode() {
59 NodeTy *Prev = this->getPrev();
80 NodeTy *getNextNode() {
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h60 std::conditional_t<IsPostDom, Inverse<NodeTy *>, NodeTy *>;
105 DominatorTreeBase<NodeTy, IsPostDom> &DT;
108 const SmallPtrSetImpl<NodeTy *> *LiveInBlocks;
109 const SmallPtrSetImpl<NodeTy *> *DefBlocks;
118 template <class NodeTy, bool IsPostDom>
130 template <class NodeTy, bool IsPostDom>
132 SmallVectorImpl<NodeTy *> &IDFBlocks) { in calculate()
151 for (NodeTy *BB : *DefBlocks) in calculate()
173 NodeTy *BB = Node->getBlock(); in calculate()
176 auto DoWork = [&](NodeTy *Succ) { in calculate()
[all …]
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h60 std::conditional_t<IsPostDom, Inverse<NodeTy *>, NodeTy *>;
105 DominatorTreeBase<NodeTy, IsPostDom> &DT;
108 const SmallPtrSetImpl<NodeTy *> *LiveInBlocks;
109 const SmallPtrSetImpl<NodeTy *> *DefBlocks;
118 template <class NodeTy, bool IsPostDom>
130 template <class NodeTy, bool IsPostDom>
132 SmallVectorImpl<NodeTy *> &IDFBlocks) { in calculate()
151 for (NodeTy *BB : *DefBlocks) in calculate()
173 NodeTy *BB = Node->getBlock(); in calculate()
176 auto DoWork = [&](NodeTy *Succ) { in calculate()
[all …]
/dports/devel/llvm10/llvm-10.0.1.src/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h60 typename std::conditional<IsPostDom, Inverse<NodeTy *>, NodeTy *>::type;
105 DominatorTreeBase<NodeTy, IsPostDom> &DT;
108 const SmallPtrSetImpl<NodeTy *> *LiveInBlocks;
109 const SmallPtrSetImpl<NodeTy *> *DefBlocks;
118 template <class NodeTy, bool IsPostDom>
130 template <class NodeTy, bool IsPostDom>
132 SmallVectorImpl<NodeTy *> &PHIBlocks) { in calculate()
147 for (NodeTy *BB : *DefBlocks) { in calculate()
173 NodeTy *BB = Node->getBlock(); in calculate()
176 auto DoWork = [&](NodeTy *Succ) { in calculate()
[all …]
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h60 std::conditional_t<IsPostDom, Inverse<NodeTy *>, NodeTy *>;
105 DominatorTreeBase<NodeTy, IsPostDom> &DT;
108 const SmallPtrSetImpl<NodeTy *> *LiveInBlocks;
109 const SmallPtrSetImpl<NodeTy *> *DefBlocks;
118 template <class NodeTy, bool IsPostDom>
130 template <class NodeTy, bool IsPostDom>
132 SmallVectorImpl<NodeTy *> &IDFBlocks) { in calculate()
151 for (NodeTy *BB : *DefBlocks) in calculate()
173 NodeTy *BB = Node->getBlock(); in calculate()
176 auto DoWork = [&](NodeTy *Succ) { in calculate()
[all …]
/dports/graphics/llvm-mesa/llvm-13.0.1.src/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h60 std::conditional_t<IsPostDom, Inverse<NodeTy *>, NodeTy *>;
105 DominatorTreeBase<NodeTy, IsPostDom> &DT;
108 const SmallPtrSetImpl<NodeTy *> *LiveInBlocks;
109 const SmallPtrSetImpl<NodeTy *> *DefBlocks;
118 template <class NodeTy, bool IsPostDom>
130 template <class NodeTy, bool IsPostDom>
132 SmallVectorImpl<NodeTy *> &IDFBlocks) { in calculate()
151 for (NodeTy *BB : *DefBlocks) in calculate()
173 NodeTy *BB = Node->getBlock(); in calculate()
176 auto DoWork = [&](NodeTy *Succ) { in calculate()
[all …]
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h60 std::conditional_t<IsPostDom, Inverse<NodeTy *>, NodeTy *>;
105 DominatorTreeBase<NodeTy, IsPostDom> &DT;
108 const SmallPtrSetImpl<NodeTy *> *LiveInBlocks;
109 const SmallPtrSetImpl<NodeTy *> *DefBlocks;
118 template <class NodeTy, bool IsPostDom>
130 template <class NodeTy, bool IsPostDom>
132 SmallVectorImpl<NodeTy *> &IDFBlocks) { in calculate()
151 for (NodeTy *BB : *DefBlocks) in calculate()
173 NodeTy *BB = Node->getBlock(); in calculate()
176 auto DoWork = [&](NodeTy *Succ) { in calculate()
[all …]
/dports/devel/llvm11/llvm-11.0.1.src/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h60 std::conditional_t<IsPostDom, Inverse<NodeTy *>, NodeTy *>;
105 DominatorTreeBase<NodeTy, IsPostDom> &DT;
108 const SmallPtrSetImpl<NodeTy *> *LiveInBlocks;
109 const SmallPtrSetImpl<NodeTy *> *DefBlocks;
118 template <class NodeTy, bool IsPostDom>
130 template <class NodeTy, bool IsPostDom>
132 SmallVectorImpl<NodeTy *> &IDFBlocks) { in calculate()
151 for (NodeTy *BB : *DefBlocks) in calculate()
173 NodeTy *BB = Node->getBlock(); in calculate()
176 auto DoWork = [&](NodeTy *Succ) { in calculate()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h60 typename std::conditional<IsPostDom, Inverse<NodeTy *>, NodeTy *>::type;
105 DominatorTreeBase<NodeTy, IsPostDom> &DT;
108 const SmallPtrSetImpl<NodeTy *> *LiveInBlocks;
109 const SmallPtrSetImpl<NodeTy *> *DefBlocks;
118 template <class NodeTy, bool IsPostDom>
130 template <class NodeTy, bool IsPostDom>
132 SmallVectorImpl<NodeTy *> &PHIBlocks) { in calculate()
147 for (NodeTy *BB : *DefBlocks) { in calculate()
173 NodeTy *BB = Node->getBlock(); in calculate()
176 auto DoWork = [&](NodeTy *Succ) { in calculate()
[all …]
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h60 std::conditional_t<IsPostDom, Inverse<NodeTy *>, NodeTy *>;
105 DominatorTreeBase<NodeTy, IsPostDom> &DT;
108 const SmallPtrSetImpl<NodeTy *> *LiveInBlocks;
109 const SmallPtrSetImpl<NodeTy *> *DefBlocks;
118 template <class NodeTy, bool IsPostDom>
130 template <class NodeTy, bool IsPostDom>
132 SmallVectorImpl<NodeTy *> &IDFBlocks) { in calculate()
151 for (NodeTy *BB : *DefBlocks) in calculate()
173 NodeTy *BB = Node->getBlock(); in calculate()
176 auto DoWork = [&](NodeTy *Succ) { in calculate()
[all …]
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h60 std::conditional_t<IsPostDom, Inverse<NodeTy *>, NodeTy *>;
105 DominatorTreeBase<NodeTy, IsPostDom> &DT;
108 const SmallPtrSetImpl<NodeTy *> *LiveInBlocks;
109 const SmallPtrSetImpl<NodeTy *> *DefBlocks;
118 template <class NodeTy, bool IsPostDom>
130 template <class NodeTy, bool IsPostDom>
132 SmallVectorImpl<NodeTy *> &IDFBlocks) { in calculate()
151 for (NodeTy *BB : *DefBlocks) in calculate()
173 NodeTy *BB = Node->getBlock(); in calculate()
176 auto DoWork = [&](NodeTy *Succ) { in calculate()
[all …]
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h60 std::conditional_t<IsPostDom, Inverse<NodeTy *>, NodeTy *>;
105 DominatorTreeBase<NodeTy, IsPostDom> &DT;
108 const SmallPtrSetImpl<NodeTy *> *LiveInBlocks;
109 const SmallPtrSetImpl<NodeTy *> *DefBlocks;
118 template <class NodeTy, bool IsPostDom>
130 template <class NodeTy, bool IsPostDom>
132 SmallVectorImpl<NodeTy *> &IDFBlocks) { in calculate()
151 for (NodeTy *BB : *DefBlocks) in calculate()
173 NodeTy *BB = Node->getBlock(); in calculate()
176 auto DoWork = [&](NodeTy *Succ) { in calculate()
[all …]
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h60 std::conditional_t<IsPostDom, Inverse<NodeTy *>, NodeTy *>;
105 DominatorTreeBase<NodeTy, IsPostDom> &DT;
108 const SmallPtrSetImpl<NodeTy *> *LiveInBlocks;
109 const SmallPtrSetImpl<NodeTy *> *DefBlocks;
118 template <class NodeTy, bool IsPostDom>
130 template <class NodeTy, bool IsPostDom>
132 SmallVectorImpl<NodeTy *> &IDFBlocks) { in calculate()
151 for (NodeTy *BB : *DefBlocks) in calculate()
173 NodeTy *BB = Node->getBlock(); in calculate()
176 auto DoWork = [&](NodeTy *Succ) { in calculate()
[all …]
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h60 typename std::conditional<IsPostDom, Inverse<NodeTy *>, NodeTy *>::type;
105 DominatorTreeBase<NodeTy, IsPostDom> &DT;
108 const SmallPtrSetImpl<NodeTy *> *LiveInBlocks;
109 const SmallPtrSetImpl<NodeTy *> *DefBlocks;
118 template <class NodeTy, bool IsPostDom>
130 template <class NodeTy, bool IsPostDom>
132 SmallVectorImpl<NodeTy *> &PHIBlocks) { in calculate()
147 for (NodeTy *BB : *DefBlocks) { in calculate()
173 NodeTy *BB = Node->getBlock(); in calculate()
176 auto DoWork = [&](NodeTy *Succ) { in calculate()
[all …]
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h60 std::conditional_t<IsPostDom, Inverse<NodeTy *>, NodeTy *>;
105 DominatorTreeBase<NodeTy, IsPostDom> &DT;
108 const SmallPtrSetImpl<NodeTy *> *LiveInBlocks;
109 const SmallPtrSetImpl<NodeTy *> *DefBlocks;
118 template <class NodeTy, bool IsPostDom>
130 template <class NodeTy, bool IsPostDom>
132 SmallVectorImpl<NodeTy *> &IDFBlocks) { in calculate()
151 for (NodeTy *BB : *DefBlocks) in calculate()
173 NodeTy *BB = Node->getBlock(); in calculate()
176 auto DoWork = [&](NodeTy *Succ) { in calculate()
[all …]
/dports/devel/llvm90/llvm-9.0.1.src/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h60 typename std::conditional<IsPostDom, Inverse<NodeTy *>, NodeTy *>::type;
105 DominatorTreeBase<NodeTy, IsPostDom> &DT;
108 const SmallPtrSetImpl<NodeTy *> *LiveInBlocks;
109 const SmallPtrSetImpl<NodeTy *> *DefBlocks;
118 template <class NodeTy, bool IsPostDom>
130 template <class NodeTy, bool IsPostDom>
132 SmallVectorImpl<NodeTy *> &PHIBlocks) { in calculate()
147 for (NodeTy *BB : *DefBlocks) { in calculate()
173 NodeTy *BB = Node->getBlock(); in calculate()
176 auto DoWork = [&](NodeTy *Succ) { in calculate()
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/SPIRV-Tools/src/source/opt/
H A Dtree_iterator.h37 template <typename NodeTy>
39 static_assert(!std::is_pointer<NodeTy>::value &&
40 !std::is_reference<NodeTy>::value,
49 using NodePtr = NodeTy*;
53 using reference = NodeTy&;
54 using value_type = NodeTy;
131 template <typename NodeTy>
133 static_assert(!std::is_pointer<NodeTy>::value &&
143 using NodePtr = NodeTy*;
147 using reference = NodeTy&;
[all …]
/dports/devel/intel-graphics-compiler/SPIRV-Tools/source/opt/
H A Dtree_iterator.h37 template <typename NodeTy>
39 static_assert(!std::is_pointer<NodeTy>::value &&
40 !std::is_reference<NodeTy>::value,
49 using NodePtr = NodeTy*;
53 using reference = NodeTy&;
54 using value_type = NodeTy;
131 template <typename NodeTy>
133 static_assert(!std::is_pointer<NodeTy>::value &&
143 using NodePtr = NodeTy*;
147 using reference = NodeTy&;
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dtree_iterator.h37 template <typename NodeTy>
39 static_assert(!std::is_pointer<NodeTy>::value &&
40 !std::is_reference<NodeTy>::value,
49 using NodePtr = NodeTy*;
53 using reference = NodeTy&;
54 using value_type = NodeTy;
131 template <typename NodeTy>
133 static_assert(!std::is_pointer<NodeTy>::value &&
143 using NodePtr = NodeTy*;
147 using reference = NodeTy&;
[all …]
/dports/emulators/mess/mame-mame0226/3rdparty/bgfx/3rdparty/spirv-tools/source/opt/
H A Dtree_iterator.h37 template <typename NodeTy>
39 static_assert(!std::is_pointer<NodeTy>::value &&
40 !std::is_reference<NodeTy>::value,
49 using NodePtr = NodeTy*;
53 using reference = NodeTy&;
54 using value_type = NodeTy;
131 template <typename NodeTy>
133 static_assert(!std::is_pointer<NodeTy>::value &&
143 using NodePtr = NodeTy*;
147 using reference = NodeTy&;
[all …]

12345678910>>...16