| /external/skia/src/sksl/ |
| SkSLCFGGenerator.h | 23 struct Node {
29 Node(Kind kind, bool constantPropagation, std::unique_ptr<Expression>* expression,
66 // if false, this node should not be subject to constant propagation. This happens with
69 // one "x" node, replacing it with a constant would break the assignment and we suppress
88 bool tryRemoveExpression(std::vector<BasicBlock::Node>::iterator* iter);
96 bool tryRemoveExpressionBefore(std::vector<BasicBlock::Node>::iterator* iter, Expression* e);
103 bool tryRemoveLValueBefore(std::vector<BasicBlock::Node>::iterator* iter, Expression* lvalue);
106 * Attempts to inserts a new expression before the node pointed to by iter. If the
110 bool tryInsertExpression(std::vector<BasicBlock::Node>::iterator* iter,
113 std::vector<Node> fNodes
[all...] |
| /external/skqp/src/sksl/ |
| SkSLCFGGenerator.h | 23 struct Node {
29 Node(Kind kind, bool constantPropagation, std::unique_ptr<Expression>* expression,
66 // if false, this node should not be subject to constant propagation. This happens with
69 // one "x" node, replacing it with a constant would break the assignment and we suppress
88 bool tryRemoveExpression(std::vector<BasicBlock::Node>::iterator* iter);
96 bool tryRemoveExpressionBefore(std::vector<BasicBlock::Node>::iterator* iter, Expression* e);
103 bool tryRemoveLValueBefore(std::vector<BasicBlock::Node>::iterator* iter, Expression* lvalue);
106 * Attempts to inserts a new expression before the node pointed to by iter. If the
110 bool tryInsertExpression(std::vector<BasicBlock::Node>::iterator* iter,
113 std::vector<Node> fNodes
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| DepthFirstIterator.h | 14 // * Normal depth-first iteration - visit a node and then all of its children.
20 // * Normal depth-first iteration - visit a node and then all of its children.
76 // First element is node pointer, second is the 'next child' to visit
80 inline df_iterator(NodeType *Node) {
81 this->Visited.insert(Node);
82 VisitStack.push_back(std::make_pair(PointerIntTy(Node, 0),
83 GT::child_begin(Node)));
88 inline df_iterator(NodeType *Node, SetType &S)
90 if (!S.count(Node)) {
91 VisitStack.push_back(std::make_pair(PointerIntTy(Node, 0),
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| DominanceFrontier.h | 46 /// dominators, this will always be a single block (the entry node).
79 void addToFrontier(iterator I, BasicBlock *Node) {
81 I->second.insert(Node);
84 void removeFromFrontier(iterator I, BasicBlock *Node) {
86 assert(I->second.count(Node) && "Node is not in DominanceFrontier of BB");
87 I->second.erase(Node);
100 BasicBlock *Node = *I++;
102 if (tmpSet.erase(Node) == 0)
103 // Node is in DS1 but not in DS2
[all...] |
| RegionIterator.h | 50 PointerIntPair<NodeType*, 2, enum ItMode> Node;
55 // advanceRegionSucc - A region node has only one successor. It reaches end
58 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!");
59 Node.setInt(ItRgEnd);
62 NodeType* getNode() const{ return Node.getPointer(); }
65 bool isRegionMode() const { return Node.getInt() != ItBB; }
78 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!");
92 inline RNSuccIterator(NodeType* node)
93 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB)
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Analysis/IPA/ |
| CallGraph.cpp | 30 // Root is root of the call graph, or the external node if a 'main' function
35 // ExternalCallingNode - This node has edges to all external functions and
39 // CallsExternalNode - This node has edges to it from all functions making
62 // If we didn't find a main function, use the external call graph node
101 // main cannot be found, the external node.
111 // addToCallGraph - Add a function to the call graph, and link the node to all
115 CallGraphNode *Node = getOrInsertFunction(F);
119 ExternalCallingNode->addCalledFunction(CallSite(), Node);
126 Root = Node; // Found a main, keep track of it!
136 ExternalCallingNode->addCalledFunction(CallSite(), Node);
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| ScheduleDAGInstrs.h | 59 const MachineDomTreeNode *Node = MDT.getNode(Header);
60 const MachineBasicBlock *MBB = Node->getBlock();
63 VisitRegion(Node, MBB, Loop, LoopLiveIns);
67 void VisitRegion(const MachineDomTreeNode *Node,
88 const std::vector<MachineDomTreeNode*> &Children = Node->getChildren();
181 /// ComputeLatency - Compute node latency.
|
| SpillPlacement.cpp | 12 // Each edge bundle corresponds to a node in a Hopfield network. Constraints on
13 // basic blocks are weighted by the block frequency and added to become the node
26 // when a node is updated. It is guaranteed to converge to a local minimum.
60 /// Node - Each edge bundle corresponds to a Hopfield node.
62 /// The node contains precomputed frequency data that only depends on the CFG,
65 /// The node Value is positive when the variable should be in a register. The
69 struct SpillPlacement::Node {
81 /// Value - Output value of this node computed from the Bias and links.
95 /// preferReg - Return true when this node prefers to be in a register
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| SDNodeDbgValue.h | 27 /// SDDbgValue - Holds the information from a dbg_value node through SDISel.
41 SDNode *Node; // valid for expressions
58 u.s.Node = N;
84 SDNode *getSDNode() { assert (kind==SDNODE); return u.s.Node; }
101 // Returns the SDNodeOrder. This is the order of the preceding node in the
|
| /external/v8/src/builtins/ |
| builtins-internal.cc | 62 typedef compiler::Node Node;
66 Node* object = assembler.Parameter(Descriptor::kObject);
69 Node* source = assembler.LoadObjectField(object, JSObject::kElementsOffset);
72 Node* length = assembler.TaggedToParameter(
86 Node* target = assembler.AllocateFixedArray(kind, length, mode);
95 Node* target = assembler.AllocateFixedArray(kind, length, mode,
107 typedef compiler::Node Node;
111 Node* object = assembler.Parameter(Descriptor::kObject)
[all...] |
| /external/v8/src/ic/ |
| accessor-assembler.h | 21 typedef compiler::Node Node;
43 void TryProbeStubCache(StubCache* stub_cache, Node* receiver, Node* name,
47 Node* StubCachePrimaryOffsetForTesting(Node* name, Node* map) {
50 Node* StubCacheSecondaryOffsetForTesting(Node* name, Node* map)
[all...] |
| /external/v8/src/ |
| splay-tree.h | 60 // true if a node was inserted, otherwise false. If found the locator
65 // otherwise false. If the node is found the locator is enabled and
83 // Move the node from one key to another.
86 // Remove the node with the given key from the tree.
94 // Perform the splay operation for the given key. Moves the node with
95 // the given key to the top of the tree. If no node has the given
96 // key, the last node on the search path is moved to the top of the
100 class Node {
102 Node(const Key& key, const Value& value)
122 Node* left() { return left_;
[all...] |
| /external/zopfli/src/zopfli/ |
| katajainen.c | 30 typedef struct Node Node;
35 struct Node {
37 Node* tail; /* Previous node(s) of this chain, or 0 if none. */
46 Node* nodes; /* The pool. */
47 Node* next; /* Pointer to a possibly free node in the pool. */
52 Initializes a chain node with the given values and marks it as in use.
54 static void InitNode(size_t weight, int count, Node* tail, Node* node)
77 Node* node; local
164 Node* node; local
[all...] |
| /frameworks/minikin/tools/ |
| mk_hyb_file.py | 53 class Node:
133 self.root = Node()
188 new_node = Node()
201 for node in node_list:
202 succ = sorted([ch_map[c] + edge_start for c in node.succ.keys()])
218 node.ix = ix
219 self.node_map[ix] = node
234 node = result[ix]
235 node.bfs_ix = ix
237 for c, next in node.succ.items()
[all...] |
| /frameworks/rs/ |
| rsScriptGroup.cpp | 54 ScriptGroup::Node::Node(Script *s) {
60 ScriptGroup::Node * ScriptGroup::findNode(Script *s) const {
63 Node *n = mNodes[ct];
74 bool ScriptGroup::calcOrderRecurse(Node *n, int depth) {
83 Node *nt = NULL;
99 bool operator() (const ScriptGroup::Node* lhs,
100 const ScriptGroup::Node* rhs) {
111 Node *n = findNode(k->mScript);
114 n = new Node(k->mScript)
[all...] |
| /frameworks/support/emoji/core/src/main/java/androidx/emoji/text/ |
| MetadataRepo.java | 43 * The default children size of the root node.
59 * Empty root node of the trie.
61 private final Node mRootNode;
77 mRootNode = new Node(DEFAULT_ROOT_SIZE);
91 mRootNode = new Node(DEFAULT_ROOT_SIZE);
168 Node getRootNode() {
204 * Trie node that holds mapping from emoji codepoint(s) to EmojiMetadata. A single codepoint
205 * emoji is represented by a child of the root node.
210 static class Node {
211 private final SparseArray<Node> mChildren
231 Node node = get(data.getCodepointAt(start)); local
234 mChildren.put(data.getCodepointAt(start), node); local
[all...] |
| /libcore/ojluni/src/main/java/java/util/stream/ |
| Node.java | 38 * <p>A {@code Node} contains a fixed number of elements, which can be accessed
40 * {@link #asArray}, or {@link #copyInto} methods. A {@code Node} may have zero
41 * or more child {@code Node}s; if it has no children (accessed via
44 * <em>internal</em> node. The size of an internal node is the sum of sizes of
48 * <p>A {@code Node} typically does not store the elements directly, but instead
51 * {@code Node}s. Commonly {@code Node}s are formed into a tree whose shape
53 * contained in the leaf nodes. The use of {@code Node} within the stream
61 public interface Node<T>
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/data/ |
| PathMatcher.java | 26 private Node mRoot = new Node();
29 mRoot = new Node();
34 Node current = mRoot;
44 Node current = mRoot;
46 Node next = current.getChild(segments[i]);
72 private static class Node {
73 private HashMap<String, Node> mMap;
76 Node addChild(String segment) {
78 mMap = new HashMap<String, Node>();
80 Node node = mMap.get(segment); local
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/util/ |
| ProfileData.java | 37 private static class Node {
38 public int id; // this is the name of this node, mapped from mNameToId
39 public Node parent;
41 public ArrayList<Node> children;
42 public Node(Node parent, int id) {
48 private Node mRoot;
55 mRoot = new Node(null, -1); // The id of the root node is unused.
60 mRoot = new Node(null, -1)
80 Node node = mRoot; local
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| BreadthFirstIterator.h | 57 // First element is the node reference, second is the next child to visit.
68 inline bf_iterator(NodeRef Node) {
69 this->Visited.insert(Node);
72 // Also, insert a dummy node as marker.
73 VisitQueue.push(QueueElement(Node, None));
82 NodeRef Node = H.first;
86 ChildIt.emplace(GT::child_begin(Node));
87 while (*ChildIt != GT::child_end(Node)) {
130 // time so that you can actually call methods on the node, because the
|
| SCCIterator.h | 15 /// The SCC iterator has the important property that if a node in SCC S1 has an
16 /// edge to a node in SCC S2, then it visits S1 *after* S2.
53 NodeRef Node; ///< The current node pointer.
55 unsigned MinVisited; ///< Minimum uplink value of all children of Node.
57 StackElement(NodeRef Node, const ChildItTy &Child, unsigned Min)
58 : Node(Node), NextChild(Child), MinVisited(Min) {}
61 return Node == Other.Node &
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| DominanceFrontierImpl.h | 35 : currentBB(B), parentBB(P), Node(N), parentNode(PN) {}
38 const DomTreeNodeT *Node;
52 BlockT *Node) {
54 assert(I->second.count(Node) && "Node is not in DominanceFrontier of BB");
55 I->second.erase(Node);
60 BlockT *Node) {
62 assert(I->second.count(Node) && "Node is not in DominanceFrontier of BB");
63 I->second.erase(Node);
[all...] |
| RegionIterator.h | 59 PointerIntPair<NodeRef, 2, ItMode> Node;
64 // advanceRegionSucc - A region node has only one successor. It reaches end
67 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!");
68 Node.setInt(ItRgEnd);
71 NodeRef getNode() const { return Node.getPointer(); }
74 bool isRegionMode() const { return Node.getInt() != ItBB; }
87 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!");
101 inline RNSuccIterator(NodeRef node)
102 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| Registry.h | 50 class node;
56 friend class node;
57 static node *Head, *Tail;
60 /// Node in linked list of entries.
62 class node { class in class:llvm::Registry
66 node *Next;
70 node(const entry &V) : Next(nullptr), Val(V) {} function in class:llvm::Registry::node
73 /// Add a node to the Registry: this is the interface between the plugin and
77 /// add a node to the executable's registry. Therefore it's not defined here
80 static void add_node(node *N)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| AllocatorList.h | 36 struct Node : ilist_node<Node> {
37 Node(Node &&) = delete;
38 Node(const Node &) = delete;
39 Node &operator=(Node &&) = delete;
40 Node &operator=(const Node &) = delete
[all...] |
