Searched defs:Node (Results 76 - 100 of 302) sorted by relevance

1234567891011>>

/external/mesa3d/src/gallium/tools/trace/
H A Dmodel.py43 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 Dnv50_ir_graph.h31 #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 Dnv50_ir_graph.h31 #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/chromium_org/third_party/cython/src/Cython/Compiler/
H A DTreeFragment.py11 from Nodes import Node, StatListNode namespace
219 elif isinstance(code, Node):
223 raise ValueError("Unrecognized code format (accepts unicode and Node)")
/external/chromium_org/third_party/cython/src/Cython/Plex/
H A DMachines.py17 states = None # [Node]
19 initial_states = None # {(name, bol): Node}
32 s = Node()
59 class Node(object): class in inherits:object
/external/chromium_org/third_party/libaddressinput/src/cpp/src/
H A Daddress_input_helper.cc39 struct Node { struct in namespace:i18n::addressinput
40 const Node* parent;
71 const std::vector<Node>* hierarchy,
82 for (const Node* node = &hierarchy[depth].front();
141 std::vector<Node> hierarchy[kHierarchyDepth];
155 const Node* parent,
157 std::vector<Node>* hierarchy) const {
165 hierarchy[lookup_key.GetDepth()].push_back(Node());
166 Node* node = &hierarchy[lookup_key.GetDepth()].back();
/external/chromium_org/third_party/skia/src/core/
H A DSkPictureStateTree.h27 struct Node;
37 Node* fNode;
92 void init(const SkTDArray<void*>& draws, SkCanvas* canvas, Node* root);
103 Node* fCurrentNode;
106 SkTDArray<Node*> fNodes;
135 Node* fLastRestoredNode;
144 struct Node { struct in class:SkPictureStateTree
145 Node* fParent;
156 Node fRoot;
H A DSkRTree.h101 struct Node;
108 Node* subtree;
117 struct Node { struct in class:SkRTree
160 Branch* insert(Node* root, Branch* branch, uint16_t level = 0);
162 int chooseSubtree(Node* root, Branch* branch);
163 SkIRect computeBounds(Node* n);
165 void search(Node* root, const SkIRect query, SkTDArray<void*>* results) const;
181 int validateSubtree(Node* root, SkIRect bounds, bool isRoot = false) const;
196 Node* allocateNode(uint16_t level);
/external/chromium_org/third_party/tcmalloc/vendor/src/
H A Dpagemap.h219 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/tools/cr/cr/
H A Dvisitor.py146 class Node(object): class in inherits:object
/external/chromium_org/v8/src/compiler/
H A Dnode.h45 // A Node is the basic primitive of an IR graph. In addition to the members
49 // out-of-line indexed by the Node's id.
50 class Node FINAL : public GenericNode<NodeData, Node> {
52 Node(GenericGraphBase* graph, int input_count) function in class:v8::internal::compiler::FINAL
53 : GenericNode<NodeData, Node>(graph, input_count) {}
60 void CollectProjections(ZoneVector<Node*>* projections);
61 Node* FindProjection(size_t projection_index);
64 OStream& operator<<(OStream& os, const Node& n);
66 typedef GenericGraphVisit::NullNodeVisitor<NodeData, Node> NullNodeVisito
[all...]
/external/chromium_org/v8/src/
H A Dsplay-tree.h100 class Node { class in class:v8::internal::SplayTree
102 Node(const Key& key, const Value& value) function in class:v8::internal::SplayTree::Node
122 Node* left() { return left_; }
123 Node* right() { return right_; }
130 Node* left_;
131 Node* right_;
138 explicit Locator(Node* node) : node_(node) { }
143 inline void bind(Node* node) { node_ = node; }
146 Node* node_;
162 void InsertInternal(int cmp, Node* nod
[all...]
/external/chromium_org/v8/tools/
H A Drun_perf.py152 class Node(object): class in inherits:object
161 class DefaultSentinel(Node):
178 class Graph(Node):
404 elif isinstance(node, Node):
/external/clang/lib/Analysis/
H A DCallGraph.cpp140 CallGraphNode *Node = getOrInsertNode(D); local
143 CGBuilder builder(this, Node);
155 CallGraphNode *&Node = FunctionMap[F]; local
156 if (Node)
157 return Node;
159 Node = new CallGraphNode(F);
162 Root->addCallee(Node, this);
163 return Node;
219 static std::string getNodeLabel(const CallGraphNode *Node, argument
221 if (CG->getRoot() == Node) {
[all...]
/external/clang/lib/Format/
H A DTokenAnnotator.h56 const UnwrappedLineNode &Node = *I; local
62 I = Node.Children.begin(),
63 E = Node.Children.end();
/external/doclava/src/com/google/doclava/
H A DNavTree.java29 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>();
143 return new Node(pkg.name(), pkg.htmlPage(), children, pkg.getSince());
146 private static void addClassNodes(List<Node> parent, String label, ClassInfo[] classes) {
147 List<Node> childre
160 private static class Node { class in class:NavTree
166 Node(String label, String link, List<Node> children, String since) { method in class:NavTree.Node
[all...]
/external/ksoap2/ksoap2-base/src/main/java/org/ksoap2/kdom/
H A DNode.java30 public class Node { //implements XmlIO{ class
142 /** Returns the namespace of the current element. For Node
/external/llvm/include/llvm/Analysis/
H A DDominanceFrontier.h79 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 DDomPrinter.cpp34 std::string getNodeLabel(DomTreeNode *Node, DomTreeNode *Graph) { argument
36 BasicBlock *BB = Node->getBlock();
61 std::string getNodeLabel(DomTreeNode *Node, DominatorTree *G) { argument
62 return DOTGraphTraits<DomTreeNode*>::getNodeLabel(Node, G->getRootNode());
77 std::string getNodeLabel(DomTreeNode *Node, PostDominatorTree *G ) { argument
78 return DOTGraphTraits<DomTreeNode*>::getNodeLabel(Node, G->getRootNode());
H A DDominanceFrontier.cpp29 : currentBB(B), parentBB(P), Node(N), parentNode(PN) {}
32 const DomTreeNode *Node; member in class:__anon25678::DFCalculateWorkObject
41 const DomTreeNode *Node) {
42 BasicBlock *BB = Node->getBlock();
48 workList.push_back(DFCalculateWorkObject(BB, nullptr, Node, nullptr));
55 const DomTreeNode *currentNode = currentW->Node;
58 assert (currentNode && "Invalid work object. Missing current Node");
68 // Does Node immediately dominate this successor?
75 // Loop through and visit the nodes that Node immediately dominates (Node'
40 calculate(const DominatorTree &DT, const DomTreeNode *Node) argument
[all...]
H A DRegionPrinter.cpp41 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,
126 O.indent(2 * (depth + 1)) << "Node"
/external/llvm/lib/Analysis/IPA/
H A DCallGraph.cpp53 CallGraphNode *Node = getOrInsertFunction(F); local
57 ExternalCallingNode->addCalledFunction(CallSite(), Node); local
64 Root = Node; // Found a main, keep track of it!
70 ExternalCallingNode->addCalledFunction(CallSite(), Node); local
75 Node->addCalledFunction(CallSite(), CallsExternalNode);
86 Node->addCalledFunction(CS, CallsExternalNode);
88 Node->addCalledFunction(CS, getOrInsertFunction(Callee));
/external/llvm/lib/CodeGen/
H A DLiveRangeCalc.cpp290 MachineDomTreeNode *Node = I->DomNode; local
292 if (!Node)
294 MachineBasicBlock *MBB = Node->getBlock();
295 MachineDomTreeNode *IDom = Node->getIDom();
356 LOP = LiveOutPair(VNI, Node);
/external/okhttp/okhttp/src/main/java/com/squareup/okhttp/internal/spdy/
H A DHuffman.java37 private final Node root = new Node();
95 Node node = root;
138 Node terminal = new Node(sym, len);
140 Node current = root;
148 current.children[i] = new Node();
162 private static final class Node { class in class:Huffman
165 private final Node[] children;
174 Node() { method in class:Huffman.Node
186 Node(int symbol, int bits) { method in class:Huffman.Node
[all...]
/external/openfst/src/include/fst/extensions/pdt/
H A Dcollection.h40 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...]

Completed in 661 milliseconds

1234567891011>>