| /frameworks/compile/mclinker/include/mcld/ADT/ |
| TreeBase.h | 20 class NodeBase {
22 NodeBase* left;
23 NodeBase* right;
26 NodeBase() : left(NULL), right(NULL) {}
38 NodeBase* m_pNode;
43 explicit TreeIteratorBase(NodeBase* X) : m_pNode(X) {}
53 void hook(NodeBase* pNode) {
88 NodeBase* pOther) {
94 NodeBase* pOther) {
99 class Node : public NodeBase {
[all...] |
| BinTree.h | 31 explicit DFSIterator(NodeBase* X) : TreeIteratorBase(X) {
54 std::stack<NodeBase*> m_Stack;
61 explicit BFSIterator(NodeBase* X) : TreeIteratorBase(X) {
84 std::queue<NodeBase*> m_Queue;
115 explicit PolicyIteratorBase(NodeBase* X) : IteratorType(X) {}
151 explicit PolicyIterator(NodeBase* X) : Base(X) {}
240 explicit TreeIterator(NodeBase* X) : TreeIteratorBase(X) {}
272 NodeBase node;
|
| /external/llvm/lib/Target/Hexagon/ |
| RDFGraph.h | 33 // base class NodeBase which defines all members used by all possible derived
36 // functional interface, i.e. member functions. NodeBase must be a POD,
152 // NodeBase has a member "Attrs", which is the primary way of determining
316 struct NodeBase;
342 NodeBase *ptr(NodeId N) const {
346 return reinterpret_cast<NodeBase*>(Blocks[BlockN]+Offset);
348 NodeId id(const NodeBase *P) const;
349 NodeAddr<NodeBase*> New();
413 struct NodeBase {
416 NodeBase() = default
[all...] |
| RDFGraph.cpp | 50 auto NA = P.G.addr<NodeBase*>(P.Obj);
334 NodeAddr<NodeBase*> NodeAllocator::New() {
340 NodeAddr<NodeBase*> NA = { reinterpret_cast<NodeBase*>(ActiveEnd),
346 NodeId NodeAllocator::id(const NodeBase *P) const {
366 void NodeBase::append(NodeAddr<NodeBase*> NA) {
404 NodeAddr<NodeBase*> RefNode::getOwner(const DataFlowGraph &G) {
405 NodeAddr<NodeBase*> NA = G.addr<NodeBase*>(getNext())
[all...] |
| RDFDeadCode.cpp | 177 auto BA = DFG.addr<NodeBase*>(I);
|
| /device/linaro/bootloader/edk2/MdeModulePkg/Universal/RegularExpressionDxe/Oniguruma/ |
| regparse.h | 163 NodeBase base;
172 NodeBase base;
188 NodeBase base;
216 NodeBase base;
228 NodeBase base;
237 NodeBase base;
244 NodeBase base;
250 NodeBase base;
257 NodeBase base;
|
| regint.h | 685 } NodeBase;
688 NodeBase base;
|
| /external/libmojo/mojo/public/tools/bindings/pylib/mojom/parse/ |
| ast.py | 13 class NodeBase(object):
29 class NodeListBase(NodeBase):
82 class Definition(NodeBase):
89 NodeBase.__init__(self, **kwargs)
96 class Attribute(NodeBase):
177 class Import(NodeBase):
243 class Module(NodeBase):
260 class Mojom(NodeBase):
283 class Ordinal(NodeBase):
296 class Parameter(NodeBase)
[all...] |
| /frameworks/compile/mclinker/include/mcld/ |
| InputTree.h | 41 explicit PolicyIterator(NodeBase* X) : Base(X) {}
148 // FIXME: provide the iterater constructors for constant NodeBase instead of
151 const_cast<NodeBase*>(&BinaryTreeBase<Input>::m_Root.node));
238 virtual void connect(TreeIteratorBase& pFrom, NodeBase* pTo) const = 0;
247 void connect(TreeIteratorBase& pFrom, NodeBase* pTo) const {
258 void connect(TreeIteratorBase& pFrom, NodeBase* pTo) const {
|
| /frameworks/compile/mclinker/lib/Core/ |
| InputTree.cpp | 36 NodeBase* node = createNode();
|
| /external/libmojo/mojo/public/tools/bindings/pylib/mojom_tests/parse/ |
| ast_unittest.py | 27 class _TestNode(ast.NodeBase):
50 node1 = ast.NodeBase(filename="hello.mojom", lineno=123)
51 node2 = ast.NodeBase()
66 # |NodeBase|'s |__eq__()| should compare types (and a subclass's |__eq__()|
|
| /external/llvm/include/llvm/ADT/ |
| IntervalMap.h | 187 //--- IntervalMapImpl::NodeBase ---//
214 class NodeBase {
227 void copy(const NodeBase<T1, T2, M> &Other, unsigned i,
286 void transferToLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize,
297 void transferToRightSib(unsigned Size, NodeBase &Sib, unsigned SSize,
310 int adjustFromLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize, int Add) {
444 typedef NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize> LeafBase;
560 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
698 class BranchNode : public NodeBase<NodeRef, KeyT, N> {
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| IntervalMap.h | 166 //--- IntervalMapImpl::NodeBase ---//
193 class NodeBase {
206 void copy(const NodeBase<T1, T2, M> &Other, unsigned i,
265 void transferToLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize,
276 void transferToRightSib(unsigned Size, NodeBase &Sib, unsigned SSize,
289 int adjustFromLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize, int Add) {
423 typedef NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize> LeafBase;
539 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
677 class BranchNode : public NodeBase<NodeRef, KeyT, N> {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 192 //--- IntervalMapImpl::NodeBase ---//
219 class NodeBase {
232 void copy(const NodeBase<T1, T2, M> &Other, unsigned i,
291 void transferToLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize,
302 void transferToRightSib(unsigned Size, NodeBase &Sib, unsigned SSize,
315 int adjustFromLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize, int Add) {
448 typedef NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize> LeafBase;
562 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
699 class BranchNode : public NodeBase<NodeRef, KeyT, N> {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 192 //--- IntervalMapImpl::NodeBase ---//
219 class NodeBase {
232 void copy(const NodeBase<T1, T2, M> &Other, unsigned i,
291 void transferToLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize,
302 void transferToRightSib(unsigned Size, NodeBase &Sib, unsigned SSize,
315 int adjustFromLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize, int Add) {
448 typedef NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize> LeafBase;
562 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
699 class BranchNode : public NodeBase<NodeRef, KeyT, N> {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 192 //--- IntervalMapImpl::NodeBase ---//
219 class NodeBase {
232 void copy(const NodeBase<T1, T2, M> &Other, unsigned i,
291 void transferToLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize,
302 void transferToRightSib(unsigned Size, NodeBase &Sib, unsigned SSize,
315 int adjustFromLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize, int Add) {
448 typedef NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize> LeafBase;
562 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
699 class BranchNode : public NodeBase<NodeRef, KeyT, N> {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 192 //--- IntervalMapImpl::NodeBase ---//
219 class NodeBase {
232 void copy(const NodeBase<T1, T2, M> &Other, unsigned i,
291 void transferToLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize,
302 void transferToRightSib(unsigned Size, NodeBase &Sib, unsigned SSize,
315 int adjustFromLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize, int Add) {
448 typedef NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize> LeafBase;
562 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
699 class BranchNode : public NodeBase<NodeRef, KeyT, N> {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 192 //--- IntervalMapImpl::NodeBase ---//
219 class NodeBase {
232 void copy(const NodeBase<T1, T2, M> &Other, unsigned i,
291 void transferToLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize,
302 void transferToRightSib(unsigned Size, NodeBase &Sib, unsigned SSize,
315 int adjustFromLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize, int Add) {
448 typedef NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize> LeafBase;
562 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
699 class BranchNode : public NodeBase<NodeRef, KeyT, N> {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 192 //--- IntervalMapImpl::NodeBase ---//
219 class NodeBase {
232 void copy(const NodeBase<T1, T2, M> &Other, unsigned i,
291 void transferToLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize,
302 void transferToRightSib(unsigned Size, NodeBase &Sib, unsigned SSize,
315 int adjustFromLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize, int Add) {
448 typedef NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize> LeafBase;
562 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
699 class BranchNode : public NodeBase<NodeRef, KeyT, N> {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 192 //--- IntervalMapImpl::NodeBase ---//
219 class NodeBase {
232 void copy(const NodeBase<T1, T2, M> &Other, unsigned i,
291 void transferToLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize,
302 void transferToRightSib(unsigned Size, NodeBase &Sib, unsigned SSize,
315 int adjustFromLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize, int Add) {
448 typedef NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize> LeafBase;
562 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
699 class BranchNode : public NodeBase<NodeRef, KeyT, N> {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 192 //--- IntervalMapImpl::NodeBase ---//
219 class NodeBase {
232 void copy(const NodeBase<T1, T2, M> &Other, unsigned i,
291 void transferToLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize,
302 void transferToRightSib(unsigned Size, NodeBase &Sib, unsigned SSize,
315 int adjustFromLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize, int Add) {
448 typedef NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize> LeafBase;
562 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
699 class BranchNode : public NodeBase<NodeRef, KeyT, N> {
[all...] |
