/external/libcxx/test/containers/associative/ |
H A D | tree_remove.pass.cpp | 20 struct Node struct 22 Node* __left_; 23 Node* __right_; 24 Node* __parent_; 27 Node() : __left_(), __right_(), __parent_(), __is_black_() {} function in struct:Node 36 Node root; 37 Node b; 38 Node c; 39 Node d; 40 Node [all...] |
H A D | tree_balance_after_insert.pass.cpp | 20 struct Node struct 22 Node* __left_; 23 Node* __right_; 24 Node* __parent_; 27 Node() : __left_(), __right_(), __parent_(), __is_black_() {} function in struct:Node 34 Node root; 35 Node a; 36 Node b; 37 Node c; 38 Node [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | InstrEmitter.h | 42 void EmitCopyFromReg(SDNode *Node, unsigned ResNo, 49 unsigned getDstOfOnlyCopyToRegUse(SDNode *Node, 52 void CreateVirtualRegisters(SDNode *Node, 92 void EmitSubregNode(SDNode *Node, DenseMap<SDValue, unsigned> &VRBaseMap, 99 void EmitCopyToRegClassNode(SDNode *Node, 104 void EmitRegSequence(SDNode *Node, DenseMap<SDValue, unsigned> &VRBaseMap, 110 static unsigned CountResults(SDNode *Node); 119 void EmitNode(SDNode *Node, bool IsClone, bool IsCloned, argument 121 if (Node->isMachineOpcode()) 122 EmitMachineNode(Node, IsClon [all...] |
H A D | ScheduleDAGSDNodes.h | 55 static bool isPassiveNode(SDNode *Node) { argument 56 if (isa<ConstantSDNode>(Node)) return true; 57 if (isa<ConstantFPSDNode>(Node)) return true; 58 if (isa<RegisterSDNode>(Node)) return true; 59 if (isa<RegisterMaskSDNode>(Node)) return true; 60 if (isa<GlobalAddressSDNode>(Node)) return true; 61 if (isa<BasicBlockSDNode>(Node)) return true; 62 if (isa<FrameIndexSDNode>(Node)) return true; 63 if (isa<ConstantPoolSDNode>(Node)) return true; 64 if (isa<TargetIndexSDNode>(Node)) retur 135 const SDNode *Node; member in class:llvm::ScheduleDAGSDNodes::RegDefIter [all...] |
/external/llvm/lib/Target/AArch64/ |
H A D | AArch64CleanupLocalDynamicTLSPass.cpp | 52 // Visit the dominator subtree rooted at Node in pre-order. 57 bool VisitNode(MachineDomTreeNode *Node, unsigned TLSBaseAddrReg) { argument 58 MachineBasicBlock *BB = Node->getBlock(); 83 for (MachineDomTreeNode *N : *Node) {
|
/external/llvm/lib/Transforms/Utils/ |
H A D | LowerExpectIntrinsic.cpp | 130 MDNode *Node; local 135 Node = MDB.createBranchWeights(LikelyBranchWeight, UnlikelyBranchWeight); 137 Node = MDB.createBranchWeights(UnlikelyBranchWeight, LikelyBranchWeight); 139 BI->setMetadata(LLVMContext::MD_prof, Node);
|
/external/protobuf/gtest/test/ |
H A D | gtest_xml_output_unittest.py | 39 from xml.dom import minidom, Node namespace
|
/external/skia/src/core/ |
H A D | SkQuadTree.h | 85 struct Node { struct in class:SkQuadTree 86 Node() { function in struct:SkQuadTree::Node 94 Node* fChildren[kChildCount]; 95 SK_DECLARE_INTERNAL_SLIST_ADAPTER(Node, fChildren[0]); 99 SkTObjectPool<Node> fNodePool; 100 Node* fRoot; 104 void insert(Node* node, Entry* entry); 105 void split(Node* node); 106 void search(Node* node, const SkIRect& query, SkTDArray<void*>* results) const; 107 void clear(Node* nod [all...] |
/external/valgrind/main/memcheck/tests/ |
H A D | leak-cases.c | 46 } Node; typedef in typeref:struct:_Node 48 Node* mk(Node* next) 52 Node* x = malloc(2 * sizeof(Node)); 58 Node* p1; 59 Node* p2; 60 Node* p3; 61 Node* p4; 62 Node* p [all...] |
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
H A D | RecognitionException.cs | 221 public object Node { property in class:Antlr.Runtime.RecognitionException
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
H A D | RecognitionException.cs | 256 public object Node property in class:Antlr.Runtime.RecognitionException
|
/external/chromium_org/base/containers/ |
H A D | linked_list_unittest.cc | 12 class Node : public LinkNode<Node> { class in namespace:base::__anon2210 14 explicit Node(int id) : id_(id) {} function in class:base::__anon2210::Node 37 void ExpectListContentsForDirection(const LinkedList<Node>& list, 40 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail()); 51 void ExpectListContents(const LinkedList<Node>& list, 65 LinkedList<Node> list; 72 LinkedList<Node> list; 75 Node n1(1); 85 Node n [all...] |
/external/chromium_org/remoting/webapp/js_proto/ |
H A D | dom_proto.js | 87 Node.prototype.getAttribute = function(name) { }; 90 Node.prototype.value; 93 Node.prototype.style; 80 Node.prototype.getAttribute = function(name) { }; class
|
/external/chromium_org/testing/gtest/test/ |
H A D | gtest_xml_output_unittest.py | 41 from xml.dom import minidom, Node namespace
|
/external/chromium_org/third_party/bintrees/bintrees/ |
H A D | avltree.py | 40 class Node(object): class in inherits:object 149 return Node(key, value)
|
/external/chromium_org/third_party/mesa/src/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/yasm/source/patched-yasm/tools/python-yasm/pyxelator/ |
H A D | node.py | 14 class Node(list): class in inherits:list 28 if isinstance(item,Node): 39 if isinstance(item,Node): 45 if isinstance(val,Node): 60 if not isinstance(other,Node): 89 if isinstance(x,Node): 101 if isinstance( i, Node ): 110 if isinstance( i, Node ): 121 if isinstance(item,Node): 137 if isinstance(item,Node) [all...] |
/external/chromium_org/tools/gyp/tools/ |
H A D | pretty_vcproj.py | 21 from xml.dom.minidom import Node namespace 62 if node.nodeType == Node.TEXT_NODE: 152 if sub_node.nodeType == Node.TEXT_NODE: 224 if child2.nodeType == Node.TEXT_NODE: 298 # First thing we need to do is find the Configuration Node and merge them
|
/external/chromium_org/ui/gfx/geometry/ |
H A D | r_tree_base.h | 57 // height of a leaf Node (a Node containing only Records) is 0, a leaf's 59 // Node will be the same height. 83 // This Node's bounding rectangle. 86 // A weak pointer to our parent Node in the RTree. The root node will have a 111 class GFX_EXPORT Node : public NodeBase { class in class:gfx::RTreeBase 113 // Constructs an empty Node with |level_| of 0. 114 Node(); 115 virtual ~Node(); 123 // Constructs a new Node tha [all...] |
/external/clang/include/clang/ASTMatchers/ |
H A D | ASTMatchFinder.h | 153 /// \brief Calls the registered callbacks on all matches on the given \p Node. 159 template <typename T> void match(const T &Node, ASTContext &Context) { argument 160 match(clang::ast_type_traits::DynTypedNode::create(Node), Context); 162 void match(const clang::ast_type_traits::DynTypedNode &Node, 186 /// \brief Returns the results of matching \p Matcher on \p Node. 189 /// \p Matcher on \p Node and returns the collected results. 198 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context); 202 match(MatcherT Matcher, const ast_type_traits::DynTypedNode &Node, 214 /// Node, Context)); 222 if (NodeT *Node 240 match(MatcherT Matcher, const ast_type_traits::DynTypedNode &Node, ASTContext &Context) argument 251 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context) argument [all...] |
/external/clang/lib/Frontend/ |
H A D | DependencyGraph.cpp | 41 const FileEntry *Node); 93 const FileEntry *Node) { 94 OS << "header_" << Node->getUID(); 92 writeNodeReference(raw_ostream &OS, const FileEntry *Node) argument
|
/external/clang/test/SemaCXX/ |
H A D | arrow-operator.cpp | 31 class Node { public: Point Location(){ Point p; return p; } }; class in namespace:rdar8875304 35 Node** node1;
|
/external/gtest/test/ |
H A D | gtest_xml_output_unittest.py | 41 from xml.dom import minidom, Node namespace
|
/external/llvm/include/llvm/Analysis/ |
H A D | CFGPrinter.h | 34 static std::string getSimpleNodeLabel(const BasicBlock *Node, argument 36 if (!Node->getName().empty()) 37 return Node->getName().str(); 42 Node->printAsOperand(OS, false); 46 static std::string getCompleteNodeLabel(const BasicBlock *Node, argument 52 if (Node->getName().empty()) { 53 Node->printAsOperand(OS, false); 57 OS << *Node; local 91 std::string getNodeLabel(const BasicBlock *Node, argument 94 return getSimpleNodeLabel(Node, Grap 99 getEdgeSourceLabel(const BasicBlock *Node, succ_const_iterator I) argument [all...] |
/external/llvm/lib/CodeGen/ |
H A D | ScheduleDAGPrinter.cpp | 43 static bool isNodeHidden(const SUnit *Node) { argument 44 return (Node->NumPreds > 10 || Node->NumSuccs > 10); 47 static bool hasNodeAddressLabel(const SUnit *Node, argument 54 static std::string getEdgeAttributes(const SUnit *Node, argument 65 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph);
|