| /external/libchrome/sandbox/linux/bpf_dsl/ |
| codegen.cc | 52 const CodeGen::Node CodeGen::kNullNode;
60 CodeGen::Program CodeGen::Compile(CodeGen::Node head) {
64 CodeGen::Node CodeGen::MakeInstruction(uint16_t code,
66 Node jt,
67 Node jf) {
71 CodeGen::Node* node = &res.first->second; local
73 *node = AppendInstruction(code, k, jt, jf);
75 return *node;
78 CodeGen::Node CodeGen::AppendInstruction(uint16_t code
[all...] |
| /external/v8/test/unittests/compiler/ |
| value-numbering-reducer-unittest.cc | 8 #include "src/compiler/node.h"
34 Reduction Reduce(Node* node) { return reducer_.Reduce(node); }
45 Node* na = graph()->NewNode(&kOp0);
46 Node* nb = graph()->NewNode(&kOp0);
47 Node* n1 = graph()->NewNode(&kOp1, na);
48 Node* n2 = graph()->NewNode(&kOp1, nb);
55 Node* n0 = graph()->NewNode(&kOp0);
56 Node* n1 = graph()->NewNode(&kOp1, n0)
[all...] |
| scheduler-unittest.cc | 10 #include "src/compiler/node.h"
644 Node* p1 = graph()->NewNode(common()->Parameter(0), graph()->start());
645 Node* ret = graph()->NewNode(common()->Return(), p1, graph()->start(),
656 Node* CreateDiamond(Graph* graph, CommonOperatorBuilder* common, Node* cond) {
657 Node* tv = graph->NewNode(common->Int32Constant(6));
658 Node* fv = graph->NewNode(common->Int32Constant(7));
659 Node* br = graph->NewNode(common->Branch(), cond, graph->start());
660 Node* t = graph->NewNode(common->IfTrue(), br);
661 Node* f = graph->NewNode(common->IfFalse(), br)
[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...] |
| /external/v8/src/compiler/ppc/ |
| instruction-selector-ppc.cc | 7 #include "src/compiler/node-matchers.h"
8 #include "src/compiler/node-properties.h"
32 InstructionOperand UseOperand(Node* node, ImmediateMode mode) {
33 if (CanBeImmediate(node, mode)) {
34 return UseImmediate(node);
36 return UseRegister(node);
39 bool CanBeImmediate(Node* node, ImmediateMode mode) {
41 if (node->opcode() == IrOpcode::kInt32Constant
1437 Node* const node = value->InputAt(0); local
[all...] |
| /external/opencv3/samples/winrt/ImageManipulations/MediaExtensions/Common/ |
| LinkList.h | 50 struct Node
52 Node *prev;
53 Node *next;
56 Node() : prev(nullptr), next(nullptr)
60 Node(T item) : prev(nullptr), next(nullptr)
91 const Node *pNode;
93 POSITION(Node *p) : pNode(p)
99 Node m_anchor; // Anchor node for the linked list.
102 Node* Front() cons
[all...] |
| /external/v8/src/compiler/ |
| loop-peeling.cc | 8 #include "src/compiler/node.h"
9 #include "src/compiler/node-marker.h"
10 #include "src/compiler/node-properties.h"
105 // Maps a node to its index in the {pairs} vector.
113 Node* map(Node* node) {
114 if (node_map.Get(node) == 0) return node;
115 return pairs->at(node_map.Get(node));
[all...] |
| wasm-compiler.cc | 23 #include "src/compiler/node-matchers.h"
61 void MergeControlToEnd(JSGraph* jsgraph, Node* node) {
64 NodeProperties::MergeControlToEnd(g, jsgraph->common(), node);
66 g->SetEnd(g->NewNode(jsgraph->common()->End(1), node));
108 // Add a check that traps if {node} is equal to {val}.
109 Node* TrapIfEq32(TrapReason reason, Node* node, int32_t val) {
110 Int32Matcher m(node);
217 Node* node = graph()->NewNode( local
1669 Node* node = graph()->NewNode(op, addr, jsgraph()->Int32Constant(0), *effect_, local
1682 Node* node = graph()->NewNode(op, addr, jsgraph()->Int32Constant(0), val, local
[all...] |
| js-native-context-specialization.cc | 15 #include "src/compiler/node-matchers.h"
39 Reduction JSNativeContextSpecialization::Reduce(Node* node) {
40 switch (node->opcode()) {
42 return ReduceJSLoadNamed(node);
44 return ReduceJSStoreNamed(node);
46 return ReduceJSLoadProperty(node);
48 return ReduceJSStoreProperty(node);
57 Node* node, Node* value, MapHandleList const& receiver_maps
[all...] |
| liveness-analyzer.h | 9 #include "src/compiler/node.h"
17 class Node;
23 void ClearNonLiveFrameStateSlots(Node* frame_state, BitVector* liveness);
25 Node* replacement, size_t local_count,
37 Node* ClearNonLiveStateValues(Node* frame_state, BitVector* liveness);
42 // Node that replaces dead values.
43 Node* replacement_node_;
86 void Checkpoint(Node* node) { entries_.push_back(Entry(node));
95 Node* node() const { function in class:v8::internal::compiler::LivenessAnalyzerBlock::Entry
[all...] |
| control-equivalence.cc | 6 #include "src/compiler/node-properties.h"
17 void ControlEquivalence::Run(Node* exit) {
29 void ControlEquivalence::VisitPre(Node* node) {
30 TRACE("CEQ: Pre-visit of #%d:%s\n", node->id(), node->op()->mnemonic());
33 SetNumber(node, NewDFSNumber());
34 TRACE(" Assigned DFS number is %zu\n", GetNumber(node));
38 void ControlEquivalence::VisitMid(Node* node, DFSDirection direction)
99 Node* node = entry.node; local
182 Node* node = queue.front(); local
[all...] |
| node-matchers.h | 12 #include "src/compiler/node.h"
21 explicit NodeMatcher(Node* node) : node_(node) {}
23 Node* node() const { return node_; } function in struct:v8::internal::compiler::NodeMatcher
24 const Operator* op() const { return node()->op(); }
25 IrOpcode::Value opcode() const { return node()->opcode(); }
30 Node* InputAt(int index) const { return node()->InputAt(index);
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| DOM2Helper.java | 33 import org.w3c.dom.Node;
51 * Check node to see if it was created by a DOM implementation
56 * @param node The node to be tested.
58 * @throws TransformerException if the node is not one which this
60 * the node is compatable.
63 public void checkNode(Node node) throws TransformerException
66 // if(!(node instanceof org.apache.xerces.dom.NodeImpl))
67 // throw new TransformerException(XSLMessages.createXPATHMessage(XPATHErrorResources.ER_XERCES_CANNOT_HANDLE_NODES, new Object[]{((Object)node).getClass()})); //"DOM2Helper can not handle nodes of type
[all...] |
| /external/llvm/include/llvm/Support/ |
| YAMLParser.h | 29 // yaml::Node *n = di->getRoot();
58 class Node;
93 void printError(Node *N, const Twine &Msg);
103 class Node {
117 Node(unsigned int Type, std::unique_ptr<Document> &, StringRef Anchor,
120 /// \brief Get the value of the anchor attached to this node. If it does not
128 /// \brief Get the verbatium tag for a given Node. This performs tag resoluton
138 Node *parseBlockNode();
163 ~Node() = default;
176 class NullNode final : public Node {
[all...] |
| /external/v8/test/cctest/compiler/ |
| test-run-stubs.cc | 37 Node* start = graph.NewNode(common.Start(6));
39 Node* receiverParam = graph.NewNode(common.Parameter(1), start);
40 Node* nameParam = graph.NewNode(common.Parameter(2), start);
41 Node* slotParam = graph.NewNode(common.Parameter(3), start);
42 Node* vectorParam = graph.NewNode(common.Parameter(4), start);
43 Node* theCode = graph.NewNode(common.HeapConstant(code));
44 Node* dummyContext = graph.NewNode(common.NumberConstant(0.0));
45 Node* call =
48 Node* ret = graph.NewNode(common.Return(), call, call, start);
49 Node* end = graph.NewNode(common.End(1), ret)
[all...] |
| /libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
| DocumentImpl.java | 32 import org.w3c.dom.Node;
69 * <p>Attaching user data directly to the corresponding node would cost a
70 * field per node. Under the assumption that user data is rarely needed, we
119 * Returns a shallow copy of the given node. If the node is an element node,
122 * @param node a node belonging to any document or DOM implementation.
125 * responsibility to notify user data handlers of the returned node.
126 * @return a new node whose document is this document and whose DO
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| RegionIterator.h | 53 PointerIntPair<NodeType*, 2, ItMode> Node;
58 // advanceRegionSucc - A region node has only one successor. It reaches end
61 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!");
62 Node.setInt(ItRgEnd);
65 NodeType* getNode() const{ return Node.getPointer(); }
68 bool isRegionMode() const { return Node.getInt() != ItBB; }
81 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!");
95 inline RNSuccIterator(NodeType* node)
96 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB)
[all...] |
| /external/testng/src/main/java/org/testng/internal/ |
| Graph.java | 22 private Map<T, Node<T>> m_nodes = Maps.newLinkedHashMap();
25 // A map of nodes that are not the predecessors of any node
28 private Map<T, Node<T>> m_independentNodes = null;
31 ppp("ADDING NODE " + tm + " " + tm.hashCode());
32 m_nodes.put(tm, new Node<>(tm));
36 public Set<T> getPredecessors(T node) {
37 return findNode(node).getPredecessors().keySet();
44 private Node<T> findNode(T object) {
49 Node<T> node = findNode(tm) local
135 Node<T> node = findNodeWithNoPredecessors(nodes2); local
166 m_independentNodes.put(node.getObject(), node); local
212 Node<T> node = findNode(o); local
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/mock/ |
| MockXmlNode.java | 22 import org.w3c.dom.Node;
30 * A mock XML node with only a minimal set of information.
32 public class MockXmlNode implements Node {
44 // namespace stuff only set in the root node
49 * Constructs a node from a given children list.
51 * @param namespace The namespace of the node or null if none
52 * @param localName The XML local node name.
53 * @param node_type One of Node.xxx_NODE constants, e.g. Node.ELEMENT_NODE
66 * Constructs an attribute node
99 MockXmlNode node = mAttributes.addAttribute(namespaceURI, localName, value); local
[all...] |
| /external/jetty/src/java/org/eclipse/jetty/webapp/ |
| FragmentDescriptor.java | 70 XmlParser.Node root = getRoot();
71 XmlParser.Node nameNode = root.get("name");
84 XmlParser.Node root = getRoot();
86 XmlParser.Node ordering = root.get("ordering");
97 public void processBefores (XmlParser.Node ordering)
100 XmlParser.Node before = ordering.get("before");
105 XmlParser.Node node = null; local
109 if (!(o instanceof XmlParser.Node)) continue;
110 node = (XmlParser.Node) o
131 XmlParser.Node node = null; local
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedQueue.java | 84 * interior node deletion (to support remove(Object)). For
95 * - There is exactly one (last) Node with a null next reference,
96 * which is CASed when enqueueing. This last Node can be
102 * reference of a Node to null atomically removes it from the
105 * head to advance. A dequeued Node may remain in use
110 * from a predecessor dequeued Node. That would cause two problems:
113 * a Node was tenured while live, which generational GCs have a
118 * linking a Node that has just been dequeued to itself. Such a
126 * to be two or more steps away from the first/last node.
131 * CASing a Node's item reference to null atomically removes th
162 Node<E> node = new Node<E>(); local
[all...] |
| /external/llvm/lib/Analysis/ |
| IteratedDominanceFrontier.cpp | 38 if (DomTreeNode *Node = DT.getNode(BB))
39 PQ.push(std::make_pair(Node, DomLevels.lookup(Node)));
62 DomTreeNode *Node = Worklist.pop_back_val();
63 BasicBlock *BB = Node->getBlock();
70 if (SuccNode->getIDom() == Node)
89 for (auto DomChild : *Node) {
|
| /libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
| hc_nodereplacechildnewchildexists.java | 63 Node employeeNode;
65 Node oldChild = null;
67 Node newChild = null;
69 Node child;
71 Node childNode;
81 Node replacedChild;
86 childList = ((Element) /*Node */employeeNode).getElementsByTagName("*");
92 childNode = (Node) childList.item(indexN10094);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/bin_search_tree_/ |
| node_iterators.hpp | 51 bin_search_tree_const_node_it_<Node, Const_Iterator, Iterator, _Alloc>
53 /// Const node iterator.
54 template<typename Node,
63 Node>::other::pointer
83 typedef typename Node::metadata_type metadata_type;
105 /// Returns the __const node iterator associated with the left node.
110 /// Returns the __const node iterator associated with the right node.
129 bin_search_tree_node_it_<Node, Const_Iterator, Iterator, _Alloc
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/bin_search_tree_/ |
| node_iterators.hpp | 51 bin_search_tree_const_node_it_<Node, Const_Iterator, Iterator, _Alloc>
53 /// Const node iterator.
54 template<typename Node,
63 Node>::other::pointer
83 typedef typename Node::metadata_type metadata_type;
105 /// Returns the __const node iterator associated with the left node.
110 /// Returns the __const node iterator associated with the right node.
129 bin_search_tree_node_it_<Node, Const_Iterator, Iterator, _Alloc
[all...] |
