Searched defs:Node (Results 176 - 200 of 302) sorted by relevance

1234567891011>>

/external/llvm/lib/Transforms/Utils/
H A DCloneFunction.cpp167 static void AddOperand(MDNode *Node, Value *Operand) { argument
169 for (unsigned i = 0; i < Node->getNumOperands(); i++) {
170 Operands.push_back(Node->getOperand(i));
173 MDNode *NewNode = MDNode::get(Node->getContext(), Operands);
174 Node->replaceAllUsesWith(NewNode);
H A DLoopSimplify.cpp440 // eliminate the PHI Node.
695 DomTreeNode *Node = DT->getNode(ExitingBlock); local
697 Node->getChildren();
700 DT->changeImmediateDominator(Child, Node->getIDom());
H A DPromoteMemoryToRegister.cpp584 DomTreeNode *Node = Worklist.pop_back_val(); local
585 unsigned ChildLevel = DomLevels[Node] + 1;
586 for (DomTreeNode::iterator CI = Node->begin(), CE = Node->end();
863 if (DomTreeNode *Node = DT.getNode(*I))
864 PQ.push(std::make_pair(Node, DomLevels[Node]));
885 DomTreeNode *Node = Worklist.pop_back_val(); local
886 BasicBlock *BB = Node->getBlock();
894 if (SuccNode->getIDom() == Node)
[all...]
/external/skia/src/core/
H A DSkTLList.h34 struct Node { struct in class:SkTLList
36 SK_DECLARE_INTERNAL_LLIST_INTERFACE(Node);
39 typedef SkTInternalLList<Node> NodeList;
55 Node* node = iter.init(fList, Iter::kHead_IterStart);
62 block->fNodes[i].~Node();
71 Node* node = this->createNode();
80 Node* node = this->createNode();
89 Node* node = this->createNode();
98 Node* node = this->createNode();
128 Node* nod
[all...]
/external/apache-xml/src/main/java/org/apache/xml/serializer/
H A DToHTMLStream.java2054 final Node m_Root;
2067 m_Root = new Node();
2078 m_Root = new Node();
2100 Node node = m_Root;
2104 Node nextNode =
2115 Node newNode = new Node();
2164 Node node = m_Root;
2233 private class Node class in class:ToHTMLStream.Trie
2237 * Constructor, creates a Node[ALPHA_SIZ
2239 Node() method in class:ToHTMLStream.Trie.Node
[all...]
/external/chromium_org/third_party/jinja2/
H A Dnodes.py107 class Node(with_metaclass(NodeType, object)): class in inherits:with_metaclass(NodeType, object
172 if isinstance(n, Node):
174 elif isinstance(item, Node):
246 class Stmt(Node):
251 class Helper(Node):
256 class Template(Node):
257 """Node that represents a template. This must be the outermost node that
307 """Node for filter sections."""
350 class Expr(Node):
/external/chromium_org/third_party/skia/src/gpu/
H A DGrRedBlackTree.h144 struct Node { struct in class:GrRedBlackTree
148 Node* fParent;
149 Node* fChildren[2];
152 void rotateRight(Node* n);
153 void rotateLeft(Node* n);
155 static Node* SuccessorNode(Node* x);
156 static Node* PredecessorNode(Node* x);
158 void deleteAtNode(Node*
[all...]
/external/chromium_org/tools/gyp/pylib/gyp/
H A Dinput.py10 from compiler.ast import Node namespace
/external/clang/lib/ASTMatchers/
H A DASTMatchFinder.cpp57 ast_type_traits::DynTypedNode Node; member in struct:clang::ast_matchers::internal::__anon17765::MatchKey
61 return std::tie(MatcherID, Node, BoundNodes) <
62 std::tie(Other.MatcherID, Other.Node, Other.BoundNodes);
238 // Sets 'Matched' to true if 'Matcher' matches 'Node' and:
244 bool match(const T &Node) { argument
250 if (Matcher->matches(ast_type_traits::DynTypedNode::create(Node), Finder,
258 if (Matcher->matches(ast_type_traits::DynTypedNode::create(Node), Finder,
268 // Traverses the subtree rooted at 'Node'; returns true if the
271 bool traverse(const T &Node) { argument
274 if (!match(Node))
370 memoizedMatchesRecursively(const ast_type_traits::DynTypedNode &Node, const DynTypedMatcher &Matcher, BoundNodesTreeBuilder *Builder, int MaxDepth, TraversalKind Traversal, BindKind Bind) argument
401 matchesRecursively(const ast_type_traits::DynTypedNode &Node, const DynTypedMatcher &Matcher, BoundNodesTreeBuilder *Builder, int MaxDepth, TraversalKind Traversal, BindKind Bind) argument
450 match(const ast_type_traits::DynTypedNode& Node) argument
464 match(const T &Node) argument
491 memoizedMatchesAncestorOfRecursively( const ast_type_traits::DynTypedNode &Node, const DynTypedMatcher &Matcher, BoundNodesTreeBuilder *Builder, AncestorMatchMode MatchMode) argument
830 match(const clang::ast_type_traits::DynTypedNode &Node, ASTContext &Context) argument
[all...]
/external/doclava/src/com/google/doclava/
H A DPageMetadata.java37 import org.w3c.dom.Node;
53 * Includes a Node class that represents the metadata and lets it attach
55 * Node also includes methods for rendering the node tree to a json file
74 public PageMetadata(File source, String dest, List<Node> taglist) {
96 public static void WriteList(List<Node> rootTypeNodesList) {
99 Node pageMeta = new Node.Builder().setLabel("TOP").setChildren(rootTypeNodesList).build();
115 * Node for supported metadata fields and methods for accessing values.
124 Data hdf, List<Node> tagList) {
138 Node pageMet
560 public static class Node { class in class:PageMetadata
574 private Node(Builder builder) { method in class:PageMetadata.Node
[all...]
H A DSampleCode.java75 * @return A root Node for the project containing its metadata and tree structure.
77 public Node setSamplesTOC(boolean offlineMode) {
78 List<Node> filelist = new ArrayList<Node>();
91 Node rootNode = writeSampleIndexCs(hdf, f,
92 new Node.Builder().setLabel(mProjectDir).setLink(link).setChildren(filelist).build(),false);
105 List<Node> filelist = new ArrayList<Node>();
126 //Write root _index.jd to out and add metadata to Node.
128 new Node
574 public static class Node { class in class:SampleCode
581 private Node(Builder builder) { method in class:SampleCode.Node
[all...]
/external/llvm/include/llvm/ADT/
H A DFoldingSet.h130 /// Node - This class is used to maintain the singly linked bucket list in
133 class Node { class in class:llvm::FoldingSetImpl
140 Node() : NextInFoldingSetBucket(nullptr) {} function in class:llvm::FoldingSetImpl::Node
152 bool RemoveNode(Node *N);
154 /// GetOrInsertNode - If there is an existing simple Node exactly
157 Node *GetOrInsertNode(Node *N);
162 Node *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos);
167 void InsertNode(Node *N, void *InsertPos);
171 void InsertNode(Node *
[all...]
/external/llvm/include/llvm/Support/
H A DGenericDomTree.h58 // DomTreeNodeBase - Dominator Tree Node
152 const DomTreeNodeBase<NodeT> *Node) {
153 if (Node->getBlock())
154 Node->getBlock()->printAsOperand(o, false);
158 o << " {" << Node->getDFSNumIn() << "," << Node->getDFSNumOut() << "}";
537 DomTreeNodeBase<NodeT> *Node = getNode(BB); local
538 assert(Node && "Removing node that isn't in dominator tree.");
539 assert(Node->getChildren().empty() && "Node i
151 operator <<(raw_ostream &o, const DomTreeNodeBase<NodeT> *Node) argument
627 const DomTreeNodeBase<NodeT> *Node = WorkStack.back().first; local
[all...]
/external/llvm/lib/CodeGen/AsmPrinter/
H A DDwarfUnit.cpp44 DwarfUnit::DwarfUnit(unsigned UID, dwarf::Tag UnitTag, DICompileUnit Node, argument
46 : UniqueID(UID), CUNode(Node), UnitDie(UnitTag), DebugInfoOffset(0), Asm(A),
54 DwarfCompileUnit::DwarfCompileUnit(unsigned UID, DICompileUnit Node, argument
57 : DwarfUnit(UID, dwarf::DW_TAG_compile_unit, Node, A, DW, DWU) {
58 insertDIE(Node, &getUnitDie());
/external/llvm/lib/CodeGen/
H A DEarlyIfConversion.cpp636 MachineDomTreeNode *Node = DomTree->getNode(Removed[i]); local
637 assert(Node != HeadNode && "Cannot erase the head node");
638 while (Node->getNumChildren()) {
639 assert(Node->getBlock() == IfConv.Tail && "Unexpected children");
640 DomTree->changeImmediateDominator(Node->getChildren().back(), HeadNode);
/external/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeDAG.cpp75 void LegalizeOp(SDNode *Node);
79 void LegalizeLoadOps(SDNode *Node);
80 void LegalizeStoreOps(SDNode *Node);
102 SDValue ExpandLibCall(RTLIB::Libcall LC, SDNode *Node, bool isSigned);
107 SDNode *Node, bool isSigned);
108 SDValue ExpandFPLibCall(SDNode *Node, RTLIB::Libcall Call_F32,
112 SDValue ExpandIntLibCall(SDNode *Node, bool isSigned,
118 void ExpandDivRemLibCall(SDNode *Node, SmallVectorImpl<SDValue> &Results);
119 void ExpandSinCosLibCall(SDNode *Node, SmallVectorImpl<SDValue> &Results);
122 SDValue ExpandBUILD_VECTOR(SDNode *Node);
708 LegalizeStoreOps(SDNode *Node) argument
[all...]
H A DLegalizeTypes.cpp217 "Node should be ready if on worklist!");
319 assert(N->getNodeId() == ReadyToProcess && "Node ID recalculated?");
331 "Node morphing changed the number of results!");
350 assert(N->getNodeId() == ReadyToProcess && "Node ID recalculated?");
358 // This node has two options: it can either be a new node or its Node ID
645 assert(E && "Node not replaced?");
661 // Node updates can mean pretty much anything. It is possible that an
712 "Node morphing changed the number of results!");
741 assert(!OpEntry.getNode() && "Node is already promoted!");
752 assert(!OpEntry.getNode() && "Node i
1034 ExpandChainLibCall(RTLIB::Libcall LC, SDNode *Node, bool isSigned) argument
[all...]
/external/llvm/lib/IR/
H A DMetadata.cpp578 void Instruction::setMetadata(StringRef Kind, MDNode *Node) { argument
579 if (!Node && !hasMetadata()) return;
580 setMetadata(getContext().getMDKindID(Kind), Node); local
633 /// Node is null.
634 void Instruction::setMetadata(unsigned KindID, MDNode *Node) { argument
635 if (!Node && !hasMetadata()) return;
639 DbgLoc = DebugLoc::getFromDILocation(Node);
644 if (Node) {
654 P.second = Node;
660 Info.push_back(std::make_pair(KindID, Node));
[all...]
/external/llvm/lib/Target/Mips/
H A DMipsSEISelDAGToDAG.cpp234 SDNode *Node) const {
242 SDValue LHS = Node->getOperand(0), RHS = Node->getOperand(1);
248 return CurDAG->SelectNodeTo(Node, MOp, VT, MVT::Glue, LHS,
274 // If the first operand is a FI, get the TargetFI Node
414 BuildVectorSDNode *Node = dyn_cast<BuildVectorSDNode>(N);
416 if (!Node)
423 if (!Node->isConstantSplat(SplatValue, SplatUndef, SplatBitSize,
631 std::pair<bool, SDNode*> MipsSEDAGToDAGISel::selectNode(SDNode *Node) { argument
632 unsigned Opcode = Node
[all...]
/external/llvm/lib/Transforms/IPO/
H A DFunctionAttrs.cpp332 ArgumentGraphNode &Node = ArgumentMap[A]; local
333 Node.Definition = A;
334 SyntheticRoot.Uses.push_back(&Node);
335 return &Node;
583 ArgumentGraphNode *Node = AG[A]; local
586 Node->Uses.push_back(AG[*UI]);
639 ArgumentGraphNode *Node = *I; local
640 if (Node->Uses.empty()) {
641 if (!Node->Definition->hasNoCaptureAttr())
/external/llvm/lib/Transforms/Instrumentation/
H A DDebugIR.cpp130 NamedMDNode *Node = M->getNamedMetadata("llvm.dbg.cu"); local
131 if (Node)
132 M->eraseNamedMetadata(Node);
/external/skia/src/gpu/
H A DGrRedBlackTree.h144 struct Node { struct in class:GrRedBlackTree
148 Node* fParent;
149 Node* fChildren[2];
152 void rotateRight(Node* n);
153 void rotateLeft(Node* n);
155 static Node* SuccessorNode(Node* x);
156 static Node* PredecessorNode(Node* x);
158 void deleteAtNode(Node*
[all...]
/external/chromium_org/courgette/
H A Dadjustment_method.cc134 struct Node { struct in namespace:courgette
135 Node(LabelInfo* in_edge, Node* prev) function in struct:courgette::Node
141 Node* prev_; // Node at shorter length.
144 typedef std::map<LabelInfo*, Node*> Edges;
147 std::list<Node*> edges_in_frequency_order;
157 static std::string ToString(Node* node) {
159 for (Node* n = node; n->prev_; n = n->prev_)
182 bool operator()(Node*
[all...]
/external/chromium_org/third_party/WebKit/Source/wtf/
H A DLinkedHashSet.h145 typedef LinkedHashSetNode<Value, Allocator> Node; typedef in class:WTF::LinkedHashSet
150 typedef HashTable<Node, Node, IdentityExtractor,
254 Node* anchor() { return reinterpret_cast<Node*>(&m_anchor); }
255 const Node* anchor() const { return reinterpret_cast<const Node*>(&m_anchor); }
256 Node* firstNode() { return reinterpret_cast<Node*>(m_anchor.m_next); }
257 const Node* firstNod
272 typedef LinkedHashSetNode<Value, Allocator> Node; typedef in struct:WTF::LinkedHashSetTranslator
299 typedef LinkedHashSetNode<Value, Allocator> Node; typedef in struct:WTF::LinkedHashSetTraits
330 typedef typename LinkedHashSetType::Node Node; typedef in class:WTF::LinkedHashSetIterator
372 typedef typename LinkedHashSetType::Node Node; typedef in class:WTF::LinkedHashSetConstIterator
444 typedef typename LinkedHashSetType::Node Node; typedef in class:WTF::LinkedHashSetReverseIterator
464 typedef typename LinkedHashSetType::Node Node; typedef in class:WTF::LinkedHashSetConstReverseIterator
[all...]
H A DListHashSet.h82 typedef ListHashSetNode<ValueArg, Allocator> Node; typedef in class:WTF::ListHashSet
83 typedef HashTraits<Node*> NodeTraits;
87 typedef HashTable<Node*, Node*, IdentityExtractor, NodeHash, NodeTraits, NodeTraits, typename Allocator::TableAllocator> ImplType;
88 typedef HashTableIterator<Node*, Node*, IdentityExtractor, NodeHash, NodeTraits, NodeTraits, typename Allocator::TableAllocator> ImplTypeIterator;
89 typedef HashTableConstIterator<Node*, Node*, IdentityExtractor, NodeHash, NodeTraits, NodeTraits, typename Allocator::TableAllocator> ImplTypeConstIterator;
111 HashTableAddResult(Node* storedValue, bool isNewEntry) : storedValue(storedValue), isNewEntry(isNewEntry) { }
112 Node* storedValu
250 typedef ListHashSetNode<ValueArg, ListHashSetAllocator> Node; typedef in struct:WTF::ListHashSetAllocator
440 typedef typename Set::Node Node; typedef in class:WTF::ListHashSetIterator
480 typedef typename Set::Node Node; typedef in class:WTF::ListHashSetConstIterator
548 typedef typename Set::Node Node; typedef in class:WTF::ListHashSetReverseIterator
587 typedef typename Set::Node Node; typedef in class:WTF::ListHashSetConstReverseIterator
[all...]

Completed in 513 milliseconds

1234567891011>>