/external/mesa3d/src/gallium/tools/trace/ |
H A D | model.py | 43 class Node: class in inherits: 56 class Literal(Node): 65 class NamedConstant(Node): 74 class Array(Node): 83 class Struct(Node): 93 class Pointer(Node):
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_graph.h | 31 #define ITER_NODE(x) reinterpret_cast<Graph::Node *>((x).get()) 38 class Node; 53 Edge(Node *dst, Node *src, Type kind); 56 inline Node *getOrigin() const { return origin; } 57 inline Node *getTarget() const { return target; } 63 Node *origin; 64 Node *target; 93 inline Node *getNode() const { assert(e); return d ? 105 class Node class in class:nv50_ir::Graph [all...] |
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_graph.h | 31 #define ITER_NODE(x) reinterpret_cast<Graph::Node *>((x).get()) 38 class Node; 53 Edge(Node *dst, Node *src, Type kind); 56 inline Node *getOrigin() const { return origin; } 57 inline Node *getTarget() const { return target; } 63 Node *origin; 64 Node *target; 93 inline Node *getNode() const { assert(e); return d ? 105 class Node class in class:nv50_ir::Graph [all...] |
/external/v8/src/ |
H A D | global-handles.cc | 44 class GlobalHandles::Node { class in class:v8::internal::GlobalHandles 57 static Node* FromLocation(Object** location) { 58 ASSERT(OFFSET_OF(Node, object_) == 0); 59 return reinterpret_cast<Node*>(location); 62 Node() {} function in class:v8::internal::GlobalHandles::Node 65 ~Node() { 78 void Initialize(int index, Node** first_free) { 175 Node* next_free() { 179 void set_next_free(Node* value) { 213 if (state_ != Node [all...] |
H A D | splay-tree.h | 107 class Node { class in class:v8::internal::SplayTree 109 Node(const Key& key, const Value& value) function in class:v8::internal::SplayTree::Node 124 Node* left() { return left_; } 125 Node* right() { return right_; } 132 Node* left_; 133 Node* right_; 140 explicit Locator(Node* node) : node_(node) { } 145 inline void bind(Node* node) { node_ = node; } 148 Node* node_; 164 void InsertInternal(int cmp, Node* nod [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkPictureStateTree.h | 27 struct Node; 37 Node* fNode; 83 Iterator(const SkTDArray<void*>& draws, SkCanvas* canvas, Node* root); 91 Node* fCurrentNode; 94 SkTDArray<Node*> fNodes; 118 Node* fRoot; 122 Node* fLastRestoredNode; 131 struct Node { struct in class:SkPictureStateTree 132 Node* fParent;
|
H A D | SkRTree.h | 94 struct Node; 101 Node* subtree; 110 struct Node { struct in class:SkRTree 153 Branch* insert(Node* root, Branch* branch, uint16_t level = 0); 155 int chooseSubtree(Node* root, Branch* branch); 156 SkIRect computeBounds(Node* n); 158 void search(Node* root, const SkIRect query, SkTDArray<void*>* results) const; 174 int validateSubtree(Node* root, SkIRect bounds, bool isRoot = false); 188 Node* allocateNode(uint16_t level);
|
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
H A D | pagemap.h | 219 struct Node { struct in class:TCMalloc_PageMap3 220 Node* ptrs[INTERIOR_LENGTH]; 228 Node* root_; // Root of radix tree 231 Node* NewNode() { 232 Node* result = reinterpret_cast<Node*>((*allocator_)(sizeof(Node))); 277 Node* n = NewNode(); 287 root_->ptrs[i1]->ptrs[i2] = reinterpret_cast<Node*>(leaf);
|
/external/chromium_org/v8/src/ |
H A D | splay-tree.h | 123 class Node { class in class:v8::internal::SplayTree 125 Node(const Key& key, const Value& value) function in class:v8::internal::SplayTree::Node 145 Node* left() { return left_; } 146 Node* right() { return right_; } 153 Node* left_; 154 Node* right_; 161 explicit Locator(Node* node) : node_(node) { } 166 inline void bind(Node* node) { node_ = node; } 169 Node* node_; 185 void InsertInternal(int cmp, Node* nod [all...] |
H A D | global-handles.cc | 50 class GlobalHandles::Node { class in class:v8::internal::GlobalHandles 63 static Node* FromLocation(Object** location) { 64 ASSERT(OFFSET_OF(Node, object_) == 0); 65 return reinterpret_cast<Node*>(location); 68 Node() { function in class:v8::internal::GlobalHandles::Node 69 ASSERT(OFFSET_OF(Node, class_id_) == Internals::kNodeClassIdOffset); 70 ASSERT(OFFSET_OF(Node, flags_) == Internals::kNodeFlagsOffset); 83 ~Node() { 97 void Initialize(int index, Node** first_free) { 223 Node* next_fre [all...] |
/external/clang/lib/Analysis/ |
H A D | CallGraph.cpp | 146 CallGraphNode *Node = getOrInsertNode(D); local 149 CGBuilder builder(this, Node); 161 CallGraphNode *&Node = FunctionMap[F]; local 162 if (Node) 163 return Node; 165 Node = new CallGraphNode(F); 168 Root->addCallee(Node, this); 169 return Node; 225 static std::string getNodeLabel(const CallGraphNode *Node, argument 227 if (CG->getRoot() == Node) { [all...] |
/external/doclava/src/com/google/doclava/ |
H A D | NavTree.java | 29 List<Node> children = new ArrayList<Node>(); 33 Node node = new Node("Reference", dir + refPrefix + "packages.html", children, null); 133 private static Node makePackageNode(PackageInfo pkg) { 134 List<Node> children = new ArrayList<Node>(); 142 return new Node(pkg.name(), pkg.htmlPage(), children, pkg.getSince()); 145 private static void addClassNodes(List<Node> parent, String label, ClassInfo[] classes) { 146 List<Node> childre 159 private static class Node { class in class:NavTree 165 Node(String label, String link, List<Node> children, String since) { method in class:NavTree.Node [all...] |
/external/llvm/include/llvm/Analysis/ |
H A D | DominanceFrontier.h | 79 void addToFrontier(iterator I, BasicBlock *Node) { argument 81 I->second.insert(Node); 84 void removeFromFrontier(iterator I, BasicBlock *Node) { argument 86 assert(I->second.count(Node) && "Node is not in DominanceFrontier of BB"); 87 I->second.erase(Node); 100 BasicBlock *Node = *I++; local 102 if (tmpSet.erase(Node) == 0) 103 // Node is in DS1 but not in DS2. 125 BasicBlock *Node local [all...] |
/external/llvm/lib/Analysis/ |
H A D | DominanceFrontier.cpp | 30 : currentBB(B), parentBB(P), Node(N), parentNode(PN) {} 33 const DomTreeNode *Node; member in class:__anon21057::DFCalculateWorkObject 42 const DomTreeNode *Node) { 43 BasicBlock *BB = Node->getBlock(); 49 workList.push_back(DFCalculateWorkObject(BB, NULL, Node, NULL)); 56 const DomTreeNode *currentNode = currentW->Node; 59 assert (currentNode && "Invalid work object. Missing current Node"); 69 // Does Node immediately dominate this successor? 76 // Loop through and visit the nodes that Node immediately dominates (Node' 41 calculate(const DominatorTree &DT, const DomTreeNode *Node) argument [all...] |
H A D | RegionPrinter.cpp | 41 std::string getNodeLabel(RegionNode *Node, RegionNode *Graph) { argument 43 if (!Node->isSubRegion()) { 44 BasicBlock *BB = Node->getNodeAs<BasicBlock>(); 68 std::string getNodeLabel(RegionNode *Node, RegionInfo *G) { argument 69 return DOTGraphTraits<RegionNode*>::getNodeLabel(Node, 127 O.indent(2 * (depth + 1)) << "Node"
|
/external/llvm/lib/Analysis/IPA/ |
H A D | CallGraph.cpp | 115 CallGraphNode *Node = getOrInsertFunction(F); local 119 ExternalCallingNode->addCalledFunction(CallSite(), Node); local 126 Root = Node; // Found a main, keep track of it! 132 ExternalCallingNode->addCalledFunction(CallSite(), Node); local 137 Node->addCalledFunction(CallSite(), CallsExternalNode); 148 Node->addCalledFunction(CS, CallsExternalNode); 150 Node->addCalledFunction(CS, getOrInsertFunction(Callee));
|
/external/llvm/lib/CodeGen/ |
H A D | LiveRangeCalc.cpp | 296 MachineDomTreeNode *Node = I->DomNode; local 298 if (!Node) 300 MachineBasicBlock *MBB = Node->getBlock(); 301 MachineDomTreeNode *IDom = Node->getIDom(); 361 LOP = LiveOutPair(VNI, Node);
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | SDNodeDbgValue.h | 41 SDNode *Node; // valid for expressions member in struct:llvm::SDDbgValue::__anon21189::__anon21190 58 u.s.Node = N; 84 SDNode *getSDNode() { assert (kind==SDNODE); return u.s.Node; }
|
/external/llvm/lib/IR/ |
H A D | AutoUpgrade.cpp | 199 MDNode *Node = MDNode::get(C, Elts); local 209 SI->setMetadata(M->getMDKindID("nontemporal"), Node);
|
/external/openfst/src/include/fst/extensions/pdt/ |
H A D | collection.h | 40 struct Node { // Trie node struct in class:fst::Collection 44 Node() : node_id(kNoNodeId), element(T()) {} function in struct:fst::Collection::Node 45 Node(I i, const T &t) : node_id(i), element(t) {} function in struct:fst::Collection::Node 47 bool operator==(const Node& n) const { 53 size_t operator()(const Node &n) const { 58 typedef CompactHashBiTable<I, Node, NodeHash> NodeTable; 62 SetIterator(I id, Node node, NodeTable *node_table) 77 Node node_; // Iterator set node 88 Node node(node_id, set[i]); 99 return SetIterator(kNoNodeId, Node(kNoNodeI [all...] |
/external/skia/src/core/ |
H A D | SkPictureStateTree.h | 27 struct Node; 37 Node* fNode; 83 Iterator(const SkTDArray<void*>& draws, SkCanvas* canvas, Node* root); 91 Node* fCurrentNode; 94 SkTDArray<Node*> fNodes; 118 Node* fRoot; 122 Node* fLastRestoredNode; 131 struct Node { struct in class:SkPictureStateTree 132 Node* fParent;
|
H A D | SkRTree.h | 94 struct Node; 101 Node* subtree; 110 struct Node { struct in class:SkRTree 153 Branch* insert(Node* root, Branch* branch, uint16_t level = 0); 155 int chooseSubtree(Node* root, Branch* branch); 156 SkIRect computeBounds(Node* n); 158 void search(Node* root, const SkIRect query, SkTDArray<void*>* results) const; 174 int validateSubtree(Node* root, SkIRect bounds, bool isRoot = false); 188 Node* allocateNode(uint16_t level);
|
/external/chromium_org/third_party/WebKit/Source/core/platform/ |
H A D | PODRedBlackTree.h | 99 class Node; 125 : m_arena(PODFreeListArena<Node>::create()) 136 explicit PODRedBlackTree(PassRefPtr<PODFreeListArena<Node> > arena) 165 m_arena = PODFreeListArena<Node>::create(); 168 void initIfNeeded(PODFreeListArena<Node>* arena) 177 Node* node = m_arena->template allocateObject<T>(data); 185 Node* node = treeSearch(data); 251 // The base Node class which is stored in the tree. Nodes are only 254 class Node { class in class:WebCore::PODRedBlackTree 255 WTF_MAKE_NONCOPYABLE(Node); 258 explicit Node(const T& data) function in class:WebCore::PODRedBlackTree::Node [all...] |
/external/llvm/include/llvm/Support/ |
H A D | YAMLParser.h | 29 // yaml::Node *n = di->getRoot(); 59 class Node; 95 void printError(Node *N, const Twine &Msg); 108 class Node { class in namespace:llvm::yaml 119 Node(unsigned int Type, OwningPtr<Document>&, StringRef Anchor); 131 Node *parseBlockNode(); 156 virtual ~Node() {} 167 class NullNode : public Node { 169 NullNode(OwningPtr<Document> &D) : Node(NK_Null, D, StringRef()) {} 171 static inline bool classof(const Node * [all...] |
/external/chromium_org/third_party/WebKit/Source/web/ |
H A D | WebNode.cpp | 48 #include "core/dom/Node.h" 182 // The listenerWrapper is only referenced by the actual Node. Once it goes 240 const Node* coreNode = constUnwrap<Node>(); 256 const Node* coreNode = constUnwrap<Node>(); 260 WebNode::WebNode(const PassRefPtr<Node>& node) 265 WebNode& WebNode::operator=(const PassRefPtr<Node>& node) 271 WebNode::operator PassRefPtr<Node>() const
|