/external/llvm/lib/Target/Mips/ |
H A D | Mips16ISelDAGToDAG.cpp | 191 // If the first operand is a FI, get the TargetFI Node 242 std::pair<bool, SDNode*> Mips16DAGToDAGISel::selectNode(SDNode *Node) { argument 243 unsigned Opcode = Node->getOpcode(); 244 SDLoc DL(Node); 250 EVT NodeTy = Node->getValueType(0); 258 SDValue InFlag = Node->getOperand(2), CmpLHS; 275 SDValue LHS = Node->getOperand(0); 276 SDValue RHS = Node->getOperand(1); 286 SDNode *Result = CurDAG->SelectNodeTo(Node, MOp, VT, MVT::Glue, LHS, 295 std::pair<SDNode*, SDNode*> LoHi = selectMULT(Node, MultOp [all...] |
H A D | MipsISelDAGToDAG.cpp | 177 SDNode* MipsDAGToDAGISel::Select(SDNode *Node) { argument 178 unsigned Opcode = Node->getOpcode(); 180 // Dump information about the Node being selected 181 DEBUG(errs() << "Selecting: "; Node->dump(CurDAG); errs() << "\n"); 184 if (Node->isMachineOpcode()) { 185 DEBUG(errs() << "== "; Node->dump(CurDAG); errs() << "\n"); 186 Node->setNodeId(-1); 191 std::pair<bool, SDNode*> Ret = selectNode(Node); 207 cast<MemSDNode>(Node)->getMemoryVT().getSizeInBits() / 8 <= 208 cast<MemSDNode>(Node) [all...] |
H A D | MipsOptimizePICCall.cpp | 56 MachineDomTreeNode *Node; member in class:__anon26054::MBBInfo 161 MBBInfo::MBBInfo(MachineDomTreeNode *N) : Node(N), HTScope(nullptr) {} 163 const MachineDomTreeNode *MBBInfo::getNode() const { return Node; } 200 const MachineDomTreeNode *Node = MBBI.getNode(); local 201 const std::vector<MachineDomTreeNode *> &Children = Node->getChildren();
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | LoopRotation.cpp | 533 DomTreeNode *Node = HeaderChildren[I]; local 534 BasicBlock *BB = Node->getBlock(); 542 if (Node->getIDom()->getBlock() != NearestDom) {
|
H A D | EarlyCSE.cpp | 343 CurrentGeneration(cg), ChildGeneration(cg), Node(n), 352 DomTreeNode *node() { return Node; } 370 DomTreeNode *Node; member in class:__anon26278::EarlyCSE::StackNode 377 bool processNode(DomTreeNode *Node); 400 bool EarlyCSE::processNode(DomTreeNode *Node) { argument 401 BasicBlock *BB = Node->getBlock();
|
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_graph.cpp | 41 reinterpret_cast<Node *>(it->get())->cut(); 44 void Graph::insert(Node *node) 87 Graph::Node::Node(void *priv) : data(priv), function in class:nv50_ir::Graph::Node 95 void Graph::Node::attach(Node *node, Edge::Type kind) 129 bool Graph::Node::detach(Graph::Node *node) 144 void Graph::Node::cut() 158 Graph::Edge::Edge(Node *or [all...] |
/external/smack/src/org/jivesoftware/smackx/pubsub/ |
H A D | Node.java | 50 abstract public class Node
class 67 Node(Connection connection, String nodeName)
method in class:Node
|
/external/chromium_org/net/spdy/ |
H A D | spdy_priority_forest.h | 114 struct Node { struct in class:net::SpdyPriorityForest 115 Node() : type(ROOT_NODE), flags(0), child() { function in struct:net::SpdyPriorityForest::Node 127 typedef base::hash_map<NodeId, Node> NodeMap; 129 // Constants for the Node.flags bitset: 144 const Node* FindNode(NodeId node_id) const; 146 NodeMap all_nodes_; // maps from node IDs to Node objects 173 Node* new_node = &all_nodes_[node_id]; 186 Node* parent = &all_nodes_[parent_id]; 191 Node* new_node = &all_nodes_[node_id]; 203 const Node [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkTLList.h | 34 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/chromium_org/v8/src/ |
H A D | effects.h | 235 explicit NestedEffectsBase(Zone* zone) : node_(new(zone) Node(zone)) {} 246 for (Node* node = node_; node != NULL; node = node->previous) { 257 void push() { node_ = new(node_->zone) Node(node_->zone, node_); } 263 for (Node* node = node_; node != NULL; node = node->previous) { 271 for (Node* node = node_; node != NULL; node = node->previous) { 280 struct Node: ZoneObject { struct in class:v8::internal::NestedEffectsBase 283 Node* previous; 284 explicit Node(Zone* zone, Node* previous = NULL) function in struct:v8::internal::NestedEffectsBase::Node 288 explicit NestedEffectsBase(Node* nod [all...] |
/external/clang/lib/Serialization/ |
H A D | ModuleManager.cpp | 428 static ChildIteratorType child_begin(NodeType *Node) { argument 429 return Node->Imports.begin(); 432 static ChildIteratorType child_end(NodeType *Node) { argument 433 return Node->Imports.end();
|
/external/clang/lib/StaticAnalyzer/Core/ |
H A D | CoreEngine.cpp | 220 ExplodedNode *Node = WU.getNode(); local 222 dispatchWorkItem(Node, Node->getLocation(), WU); 497 ExplodedNode *Node = G->getNode(Loc, State, false, &IsNew); local 500 Node->addPredecessor(Pred, *G); // Link 'Node' with its predecessor. 503 G->addRoot(Node); // 'Node' has no predecessor. Make it a root. 506 // Only add 'Node' to the worklist if it was freshly generated. 507 if (IsNew) WList->enqueue(Node); 568 ExplodedNode *Node = G->getNode(Loc, N->getState(), false, &isNew); local [all...] |
/external/deqp/modules/gles31/functional/ |
H A D | es31fProgramInterfaceQueryTests.cpp | 173 class Node class in namespace:deqp::gles31::Functional::__anon20287::ResourceDefinition 194 typedef de::SharedPtr<const Node, de::DefaultDeleter<const Node>, false> SharedPtr; 196 Node (NodeType type, const SharedPtr& enclosingNode) : m_type(type), m_enclosingNode(enclosingNode) { DE_ASSERT(type < TYPE_LAST); } function in class:deqp::gles31::Functional::__anon20287::ResourceDefinition::Node 197 virtual ~Node (void) { } 199 inline const Node* getEnclosingNode (void) const { return m_enclosingNode.get(); } 207 class Program : public Node 211 : Node (TYPE_PROGRAM, SharedPtr()) 219 class Shader : public Node 223 : Node (TYPE_SHADE [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | LinkedListMultimap.java | 111 private static final class Node<K, V> { class in class:LinkedListMultimap 114 Node<K, V> next; // the next node (with any key) 115 Node<K, V> previous; // the previous node (with any key) 116 Node<K, V> nextSibling; // the next node with the same key 117 Node<K, V> previousSibling; // the previous node with the same key 119 Node(@Nullable K key, @Nullable V value) { method in class:LinkedListMultimap.Node 129 private transient Node<K, V> head; // the head for all keys 130 private transient Node<K, V> tail; // the tail for all keys 132 private transient Map<K, Node<K, V>> keyToKeyHead; // the head for a given key 133 private transient Map<K, Node< 189 addNode( @ullable K key, @Nullable V value, @Nullable Node<K, V> nextSibling) argument 897 createEntry(final Node<K, V> node) argument [all...] |
H A D | TreeMultiset.java | 129 this.rootReference = new Reference<Node<E>>(); 132 private TreeMultiset(GeneralRange<E> range, Reference<Node<E>> root) { 145 private transient final Reference<Node<E>> rootReference; 167 Node<E> root = rootReference.get(); 173 Node<E> root = rootReference.get(); 182 Node<E> node = BstOperations.seek(comparator(), rootReference.get(), e); 194 BstMutationRule<E, Node<E>> mutationRule = BstMutationRule.createRule( 197 <E, Node<E>>singleRebalancePolicy(distinctAggregate()), 199 BstMutationResult<E, Node<E>> mutationResult = 205 Node< 370 private static final class Node<E> extends BstNode<E, Node<E>> implements Serializable { class in class:TreeMultiset 374 private Node(E key, int elemCount, @Nullable Node<E> left, method in class:TreeMultiset.Node 388 private Node(E key, int elemCount) { method in class:TreeMultiset.Node [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | LinkedListMultimap.java | 107 private static final class Node<K, V> { class in class:LinkedListMultimap 110 Node<K, V> next; // the next node (with any key) 111 Node<K, V> previous; // the previous node (with any key) 112 Node<K, V> nextSibling; // the next node with the same key 113 Node<K, V> previousSibling; // the previous node with the same key 115 Node(@Nullable K key, @Nullable V value) { method in class:LinkedListMultimap.Node 125 private transient Node<K, V> head; // the head for all keys 126 private transient Node<K, V> tail; // the tail for all keys 128 private transient Map<K, Node<K, V>> keyToKeyHead; // the head for a given key 129 private transient Map<K, Node< 185 addNode( @ullable K key, @Nullable V value, @Nullable Node<K, V> nextSibling) argument 893 createEntry(final Node<K, V> node) argument [all...] |
H A D | TreeMultiset.java | 125 this.rootReference = new Reference<Node<E>>(); 128 private TreeMultiset(GeneralRange<E> range, Reference<Node<E>> root) { 141 private transient final Reference<Node<E>> rootReference; 163 Node<E> root = rootReference.get(); 169 Node<E> root = rootReference.get(); 178 Node<E> node = BstOperations.seek(comparator(), rootReference.get(), e); 190 BstMutationRule<E, Node<E>> mutationRule = BstMutationRule.createRule( 193 <E, Node<E>>singleRebalancePolicy(distinctAggregate()), 195 BstMutationResult<E, Node<E>> mutationResult = 201 Node< 366 private static final class Node<E> extends BstNode<E, Node<E>> implements Serializable { class in class:TreeMultiset 370 private Node(E key, int elemCount, @Nullable Node<E> left, method in class:TreeMultiset.Node 384 private Node(E key, int elemCount) { method in class:TreeMultiset.Node [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | IntervalMap.h | 221 /// @param Other Node elements are copied from. 325 /// @param Node Array of pointers to sibling nodes. 330 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes, argument 337 int d = Node[n]->adjustFromLeftSib(CurSize[n], *Node[m], CurSize[m], 355 int d = Node[m]->adjustFromLeftSib(CurSize[m], *Node[n], CurSize[n], 744 /// @param Node Subtree to insert. 746 void insert(unsigned i, unsigned Size, NodeRef Node, KeyT Stop) { 750 subtree(i) = Node; [all...] |
/external/llvm/include/llvm/Analysis/ |
H A D | LazyCallGraph.h | 105 class Node; 107 typedef SmallVector<PointerUnion<Function *, Node *>, 4> NodeVectorT; 108 typedef SmallVectorImpl<PointerUnion<Function *, Node *>> NodeVectorImplT; 118 std::forward_iterator_tag, Node> { 120 friend class LazyCallGraph::Node; 145 if (I->is<Node *>()) 146 return *I->get<Node *>(); 149 Node &ChildN = G->get(*F); 160 class Node { class in class:llvm::LazyCallGraph 177 Node(LazyCallGrap [all...] |
H A D | RegionInfo.h | 138 inline raw_ostream &operator<<(raw_ostream &OS, const RegionNode &Node); 747 /// @brief Clear the Node Cache for all Regions. 756 inline raw_ostream &operator<<(raw_ostream &OS, const RegionNode &Node) { argument 757 if (Node.isSubRegion()) 758 return OS << Node.getNodeAs<Region>()->getNameStr(); 760 return OS << Node.getNodeAs<BasicBlock>()->getName();
|
/external/llvm/lib/Analysis/ |
H A D | LazyCallGraph.cpp | 25 SmallVectorImpl<PointerUnion<Function *, LazyCallGraph::Node *>> &Callees, 56 LazyCallGraph::Node::Node(LazyCallGraph &G, Function &F) function in class:LazyCallGraph::Node 78 void LazyCallGraph::Node::insertEdgeInternal(Function &Callee) { 79 if (Node *N = G->lookup(Callee)) 86 void LazyCallGraph::Node::insertEdgeInternal(Node &CalleeN) { 91 void LazyCallGraph::Node::removeEdgeInternal(Function &Callee) { 129 SCCEntryNodes.push_back(&Entry.get<Node *>()->getFunction()); 159 void LazyCallGraph::SCC::insert(Node [all...] |
/external/llvm/lib/CodeGen/ |
H A D | MachineCSE.cpp | 100 void ExitScopeIfDone(MachineDomTreeNode *Node, 102 bool PerformCSE(MachineDomTreeNode *Node); 609 MachineCSE::ExitScopeIfDone(MachineDomTreeNode *Node, argument 611 if (OpenChildren[Node]) 615 ExitScope(Node->getBlock()); 618 while (MachineDomTreeNode *Parent = Node->getIDom()) { 623 Node = Parent; 627 bool MachineCSE::PerformCSE(MachineDomTreeNode *Node) { argument 635 WorkList.push_back(Node); 637 Node 651 MachineDomTreeNode *Node = Scopes[i]; local [all...] |
/external/llvm/lib/IR/ |
H A D | AutoUpgrade.cpp | 274 MDNode *Node = MDNode::get(C, Elts); local 284 SI->setMetadata(M->getMDKindID("nontemporal"), Node);
|
H A D | Module.cpp | 324 void Module::addModuleFlag(MDNode *Node) { argument 325 assert(Node->getNumOperands() == 3 && 327 assert(isa<ConstantInt>(Node->getOperand(0)) && 328 isa<MDString>(Node->getOperand(1)) && 330 getOrInsertModuleFlagsMetadata()->addOperand(Node);
|
/external/llvm/lib/Target/AArch64/ |
H A D | AArch64ConditionalCompares.cpp | 790 MachineDomTreeNode *Node = DomTree->getNode(Removed[i]); local 791 assert(Node != HeadNode && "Cannot erase the head node"); 792 assert(Node->getIDom() == HeadNode && "CmpBB should be dominated by Head"); 793 while (Node->getNumChildren()) 794 DomTree->changeImmediateDominator(Node->getChildren().back(), HeadNode);
|