/external/chromium_org/third_party/yasm/source/patched-yasm/tools/python-yasm/pyxelator/ |
H A D | ir.py | 21 class Node(genpyx.Node, node_module.Node): class in inherits:genpyx.Node, node_module.Node 26 node_module.Node.__init__( self, *args, **kw ) 46 Node.__init__(self) 51 # Node._unique_id += 1 52 # return Node._unique_id 61 if isinstance(item,Node): 74 # if isinstance(x,Node): 83 #if isinstance(x,Node) [all...] |
/external/clang/include/clang/AST/ |
H A D | DataRecursiveASTVisitor.h | 431 template <typename T> bool VisitOMPClauseList(T *Node); 2379 bool RecursiveASTVisitor<Derived>::VisitOMPClauseList(T *Node) { argument 2380 for (auto *E : Node->varlists()) {
|
H A D | RecursiveASTVisitor.h | 436 template <typename T> bool VisitOMPClauseList(T *Node); 2401 bool RecursiveASTVisitor<Derived>::VisitOMPClauseList(T *Node) { argument 2402 for (auto *E : Node->varlists()) {
|
/external/clang/lib/Format/ |
H A D | UnwrappedLineParser.cpp | 1465 const UnwrappedLineNode &Node = *I; local 1467 I = Node.Children.begin(), 1468 E = Node.Children.end();
|
/external/clang/lib/StaticAnalyzer/Core/ |
H A D | BugReporterVisitors.cpp | 172 static void addVisitorIfNecessary(const ExplodedNode *Node, const Stmt *S, argument 180 if (Optional<CallExitEnd> CEE = Node->getLocationAs<CallExitEnd>()) 183 if (Optional<StmtPoint> SP = Node->getLocationAs<StmtPoint>()) 187 Node = Node->getFirstPred(); 188 } while (Node); 191 while (Node && Node->getLocation().getAs<PostStmt>()) 192 Node = Node [all...] |
H A D | ExprEngineCallAndReturn.cpp | 62 ExplodedNode *Node = G.getNode(Loc, state, false, &isNew); local 63 Node->addPredecessor(Pred, G); 65 Engine.getWorkList()->enqueue(Node); 71 const CFGBlock*> getLastStmt(const ExplodedNode *Node) { argument 75 Node->getLocation().getLocationContext()->getCurrentStackFrame(); 79 while (Node) { 80 const ProgramPoint &PP = Node->getLocation(); 96 Node = Node->getFirstPred(); 97 CE = Node [all...] |
/external/clang/test/SemaCXX/ |
H A D | warn-thread-safety-parsing.cpp | 1371 class Node { class in namespace:PointerToMemberTest
|
/external/clang/unittests/ASTMatchers/ |
H A D | ASTMatchersTest.cpp | 2367 return AMatcher.matches(Node, Finder, Builder); 2388 Node, AMatcher, Builder, 3642 const Stmt *Node = Nodes->getNodeAs<Stmt>("node"); local 3644 for (const auto &Parent : Context->getParents(*Node)) { 4151 const T *Node = Nodes->getNodeAs<T>(Id); local 4153 match(InnerMatcher, *Node, *Context)) !=nullptr; 4202 const T *Node = Nodes->getNodeAs<T>(""); local 4203 return verify(*Nodes, *Context, Node); 4206 bool verify(const BoundNodes &Nodes, ASTContext &Context, const Stmt *Node) { argument 4209 const T *TypedNode = cast<T>(Node); 4215 verify(const BoundNodes &Nodes, ASTContext &Context, const Decl *Node) argument [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | ilist.h | 142 // ilist_iterator<Node> - Iterator for intrusive list. 277 static SimpleType getSimplifiedValue(ilist_iterator<NodeTy> &Node) { argument 278 return &*Node; 284 static SimpleType getSimplifiedValue(const ilist_iterator<NodeTy> &Node) { argument 285 return &*Node; 437 NodeTy *Node = &*IT; local 438 NodeTy *NextNode = this->getNext(Node); 439 NodeTy *PrevNode = this->getPrev(Node); 441 if (Node != Head) // Is PrevNode off the beginning of the list? 447 this->removeNodeFromList(Node); // Notif [all...] |
/external/llvm/include/llvm/CodeGen/ |
H A D | ScheduleDAG.h | 259 SDNode *Node; // Representative node. variable 286 unsigned short Latency; // Node latency. 308 unsigned Depth; // Node depth. 309 unsigned Height; // Node height. 320 : Node(node), Instr(nullptr), OrigNode(nullptr), SchedClass(nullptr), 336 : Node(nullptr), Instr(instr), OrigNode(nullptr), SchedClass(nullptr), 351 : Node(nullptr), Instr(nullptr), OrigNode(nullptr), SchedClass(nullptr), 377 Node = N; 384 return Node; 394 assert(!Node 615 SUnit *Node; member in class:llvm::SUnit::SUnitIterator [all...] |
H A D | SelectionDAG.h | 121 void add(SDDbgValue *V, const SDNode *Node, bool isParameter) { argument 125 if (Node) 126 DbgValMap[Node].push_back(V); 139 ArrayRef<SDDbgValue*> getSDDbgValues(const SDNode *Node) { argument 140 DbgValMapType::iterator I = DbgValMap.find(Node); 397 // Node creation methods.
|
/external/llvm/lib/CodeGen/ |
H A D | MachineFunction.cpp | 386 std::string getNodeLabel(const MachineBasicBlock *Node, argument 393 OSS << "BB#" << Node->getNumber(); 394 if (const BasicBlock *BB = Node->getBasicBlock()) 397 Node->print(OSS);
|
H A D | MachineLICM.cpp | 231 void ExitScopeIfDone(MachineDomTreeNode *Node, 669 void MachineLICM::ExitScopeIfDone(MachineDomTreeNode *Node, argument 672 if (OpenChildren[Node]) 676 ExitScope(Node->getBlock()); 679 while (MachineDomTreeNode *Parent = ParentMap[Node]) { 684 Node = Parent; 703 MachineDomTreeNode *Node = WorkList.pop_back_val(); local 704 assert(Node && "Null dominator tree node?"); 705 MachineBasicBlock *BB = Node->getBlock(); 717 Scopes.push_back(Node); 751 MachineDomTreeNode *Node = Scopes[i]; local [all...] |
/external/llvm/lib/IR/ |
H A D | DIBuilder.cpp | 911 MDNode *Node = MDNode::get(VMContext, Elts); local 912 DICompositeType RetTy(Node); 945 MDNode *Node = MDNode::getTemporary(VMContext, Elts); local 946 DICompositeType RetTy(Node); 992 MDNode *Node = MDNode::get(VMContext, Elts); local 993 AllGVs.push_back(Node); 994 return DIGlobalVariable(Node); 1031 MDNode *Node = MDNode::get(VMContext, Elts); local 1032 AllGVs.push_back(Node); 1033 return DIGlobalVariable(Node); 1055 MDNode *Node = MDNode::get(VMContext, Elts); local 1145 MDNode *Node = MDNode::get(VMContext, Elts); local 1193 MDNode *Node = MDNode::get(VMContext, Elts); local [all...] |
/external/llvm/lib/Target/NVPTX/ |
H A D | NVPTXISelDAGToDAG.cpp | 2374 SDNode *NVPTXDAGToDAGISel::SelectLoadParam(SDNode *Node) { argument 2375 SDValue Chain = Node->getOperand(0); 2376 SDValue Offset = Node->getOperand(2); 2377 SDValue Flag = Node->getOperand(3); 2378 SDLoc DL(Node); 2379 MemSDNode *Mem = cast<MemSDNode>(Node); 2382 switch (Node->getOpcode()) { 2396 EVT EltVT = Node->getValueType(0);
|
/external/llvm/lib/Target/R600/ |
H A D | AMDGPUISelDAGToDAG.cpp | 789 SDNode *Node = I; local 796 if (ResNode != Node) { 797 ReplaceUses(Node, ResNode);
|
/external/llvm/lib/Target/SystemZ/ |
H A D | SystemZISelDAGToDAG.cpp | 134 inline SDValue getImm(const SDNode *Node, uint64_t Imm) const { argument 135 return CurDAG->getTargetConstant(Imm, Node->getValueType(0)); 286 // If Op0 is null, then Node is a constant that can be loaded using: 290 // If Op0 is nonnull, then Node can be implemented using: 293 SDNode *splitLargeImmediate(unsigned Opcode, SDNode *Node, SDValue Op0, 328 SDNode *Select(SDNode *Node) override; 961 SDNode *SystemZDAGToDAGISel::splitLargeImmediate(unsigned Opcode, SDNode *Node, argument 964 EVT VT = Node->getValueType(0); 965 SDLoc DL(Node); 1034 SDNode *SystemZDAGToDAGISel::Select(SDNode *Node) { argument [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | StructurizeCFG.cpp | 73 DomTreeNode *Node = DT->getNode(BB); local 77 for (;Node;Node = Node->getIDom()) 78 IndexMap[Node] = ++Numbering; 85 for (;Node;Node = Node->getIDom()) 86 if (IndexMap.count(Node)) 89 IndexMap[Node] 587 changeExit(RegionNode *Node, BasicBlock *NewExit, bool IncludeDominator) argument 684 dominatesPredicates(BasicBlock *BB, RegionNode *Node) argument 696 isPredictableTrue(RegionNode *Node) argument 721 RegionNode *Node = Order.pop_back_val(); local 757 RegionNode *Node = Order.back(); local [all...] |
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | Node.cpp | 26 #include "core/dom/Node.h" 111 COMPILE_ASSERT(sizeof(Node) <= sizeof(SameSizeAsNode), Node_should_stay_small); 114 void* Node::operator new(size_t size) 120 void Node::operator delete(void* ptr) 128 typedef WillBeHeapHashSet<RawPtrWillBeWeakMember<Node> > WeakNodeSet; 136 void Node::dumpStatistics() 160 Node* node = *it; 245 printf(" Number of Attributes (non-Node and Node): %zu [%zu]\n", attributes, sizeof(Attribute)); 254 void Node 265 Node::Node(TreeScope* treeScope, ConstructionType type) function in class:blink::Node 907 commonAncestor(const Node& other, Node* (*parent)(const Node&)) argument [all...] |
H A D | Node.h | 84 typedef StaticNodeTypeList<Node> StaticNodeList; 117 #define NODE_BASE_CLASSES public GarbageCollectedFinalized<Node>, public EventTarget 120 // Node::m_nodeFlags on 64bit platforms. 121 #define NODE_BASE_CLASSES public EventTarget, public TreeShared<Node> 124 class Node : NODE_BASE_CLASSES { class in namespace:blink 125 DEFINE_EVENT_TARGET_REFCOUNTING_WILL_BE_REMOVED(TreeShared<Node>); 127 WILL_BE_USING_GARBAGE_COLLECTED_MIXIN(Node); 174 virtual ~Node(); 176 // DOM methods & attributes for Node 188 Node* previousSiblin [all...] |
/external/chromium_org/third_party/WebKit/Source/core/editing/ |
H A D | htmlediting.cpp | 68 bool isAtomicNode(const Node *node) 85 Node* nodeA = commonScope->ancestorInThisScope(a.containerNode()); 90 Node* nodeB = commonScope->ancestorInThisScope(b.containerNode()); 141 Element* lowestEditableAncestor(Node* node) 156 Node* node = p.parentAnchoredEquivalent().anchorNode(); 172 Node* node = pos.deprecatedNode(); 179 Node* node = p.deprecatedNode(); 191 Node* node = p.containerNode(); 270 Node* shadowAncestor = highestRoot->treeScope().ancestorInThisScope(editablePosition.deprecatedNode()); 291 Position lastEditablePositionBeforePositionInRoot(const Position& position, Node* highestRoo 591 enclosingNodeOfType(const Position& p, bool (*nodeIsOfType)(const Node*), EditingBoundaryCrossingRule rule) argument 613 highestEnclosingNodeOfType(const Position& p, bool (*nodeIsOfType)(const Node*), EditingBoundaryCrossingRule rule, Node* stayWithin) argument [all...] |
/external/chromium_org/third_party/cython/src/Cython/Compiler/ |
H A D | Parsing.py | 3265 from Nodes import Node namespace 3278 elif isinstance(node, Node):
|
H A D | Symtab.py | 804 from Nodes import Node namespace 805 class FakeOperand(Node):
|
/external/chromium_org/third_party/libwebp/enc/ |
H A D | quant.c | 523 } Node; typedef in typeref:struct:__anon13278 558 Node nodes[16][NUM_NODES]; 618 Node* const cur = &NODE(n, m); 698 const Node* const node = &NODE(n, best_node);
|
/external/chromium_org/third_party/sfntly/cpp/src/test/tinyxml/ |
H A D | tinyxml.h | 1699 TiXmlNode* Node() const { return ToNode(); } function in class:TiXmlHandle
|