| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/ASTMatchers/ |
| ASTMatchers.h | 34 // where "child" is bound to the RecordDecl node of the matching child
62 /// The bound nodes are generated by calling \c bind("id") on the node matchers
69 /// \brief Returns the AST node bound to \c ID.
71 /// Returns NULL if there was no node bound to \c ID or if there is a node but
98 /// \brief If the provided matcher matches a node, binds the node to \c ID.
119 /// \brief Matches any node.
211 SourceManager.getExpansionLoc(Node.getLocStart()));
231 auto ExpansionLoc = SourceManager.getExpansionLoc(Node.getLocStart())
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/clang/include/clang/ASTMatchers/ |
| ASTMatchers.h | 34 // where "child" is bound to the RecordDecl node of the matching child
62 /// The bound nodes are generated by calling \c bind("id") on the node matchers
69 /// \brief Returns the AST node bound to \c ID.
71 /// Returns NULL if there was no node bound to \c ID or if there is a node but
98 /// \brief If the provided matcher matches a node, binds the node to \c ID.
119 /// \brief Matches any node.
211 SourceManager.getExpansionLoc(Node.getLocStart()));
231 auto ExpansionLoc = SourceManager.getExpansionLoc(Node.getLocStart())
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/clang/include/clang/ASTMatchers/ |
| ASTMatchers.h | 34 // where "child" is bound to the RecordDecl node of the matching child
62 /// The bound nodes are generated by calling \c bind("id") on the node matchers
69 /// \brief Returns the AST node bound to \c ID.
71 /// Returns NULL if there was no node bound to \c ID or if there is a node but
98 /// \brief If the provided matcher matches a node, binds the node to \c ID.
119 /// \brief Matches any node.
211 SourceManager.getExpansionLoc(Node.getLocStart()));
231 auto ExpansionLoc = SourceManager.getExpansionLoc(Node.getLocStart())
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/clang/include/clang/ASTMatchers/ |
| ASTMatchers.h | 34 // where "child" is bound to the RecordDecl node of the matching child
62 /// The bound nodes are generated by calling \c bind("id") on the node matchers
69 /// \brief Returns the AST node bound to \c ID.
71 /// Returns NULL if there was no node bound to \c ID or if there is a node but
98 /// \brief If the provided matcher matches a node, binds the node to \c ID.
119 /// \brief Matches any node.
211 SourceManager.getExpansionLoc(Node.getLocStart()));
231 auto ExpansionLoc = SourceManager.getExpansionLoc(Node.getLocStart())
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/clang/include/clang/ASTMatchers/ |
| ASTMatchers.h | 34 // where "child" is bound to the RecordDecl node of the matching child
62 /// The bound nodes are generated by calling \c bind("id") on the node matchers
69 /// \brief Returns the AST node bound to \c ID.
71 /// Returns NULL if there was no node bound to \c ID or if there is a node but
98 /// \brief If the provided matcher matches a node, binds the node to \c ID.
119 /// \brief Matches any node.
211 SourceManager.getExpansionLoc(Node.getLocStart()));
231 auto ExpansionLoc = SourceManager.getExpansionLoc(Node.getLocStart())
[all...] |
| /external/r8/src/main/java/com/android/tools/r8/utils/ |
| Timing.java | 20 private final Stack<Node> stack;
24 stack.push(new Node("Recorded timings for " + title));
27 static class Node {
30 final Stack<Node> sons = new Stack<>();
34 Node(String title) {
53 public String toString(Node top) {
59 public void report(int depth, Node top) {
74 Node n = new Node(title);
85 Node top = stack.peek()
[all...] |
| /external/v8/src/compiler/ |
| scheduler.h | 9 #include "src/compiler/node.h"
43 // Placement of a node changes during scheduling. The placement state
56 // Per-node data tracked during scheduling.
59 int unscheduled_count_; // Number of unscheduled uses of this node.
60 Placement placement_; // Whether the node is fixed, schedulable,
61 // coupled to another node, or not yet known.
70 ZoneQueue<Node*> schedule_queue_; // Worklist of schedulable nodes.
71 ZoneVector<SchedulerData> node_data_; // Per-node data for all nodes.
79 inline SchedulerData* GetData(Node* node);
[all...] |
| bytecode-graph-builder.cc | 29 int parameter_count, Node* control_dependency, Node* context);
39 Node* LookupAccumulator() const;
40 Node* LookupRegister(interpreter::Register the_register) const;
42 void BindAccumulator(Node* node,
44 void BindRegister(interpreter::Register the_register, Node* node,
47 interpreter::Register first_reg, Node* node,
501 Node* node = NewNode(op, graph()->start()); local
513 Node* node = NewNode(op, graph()->start()); local
524 Node* node = NewNode(op, graph()->start()); local
580 Node* node = NewNode(common()->Checkpoint()); local
681 Node* node = jsgraph()->ZeroConstant(); local
686 Node* node = jsgraph()->Constant(bytecode_iterator().GetImmediateOperand(0)); local
691 Node* node = local
697 Node* node = jsgraph()->UndefinedConstant(); local
702 Node* node = jsgraph()->NullConstant(); local
707 Node* node = jsgraph()->TheHoleConstant(); local
712 Node* node = jsgraph()->TrueConstant(); local
717 Node* node = jsgraph()->FalseConstant(); local
752 Node* node = local
762 Node* node = local
776 Node* node = NewNode(op, value); local
801 Node* node = NewNode(op, object, name, value, jsgraph()->Constant(flags)); local
809 Node* node = NewNode(op); local
820 Node* node = NewNode(op); local
830 Node* node = NewNode(op); local
837 Node* node = NewNode(op); local
846 Node* node = NewNode(op, value); local
983 Node* node = BuildLoadGlobal(name, feedback_slot_index, typeof_mode); local
1051 Node* node = NewNode(op, object); local
1064 Node* node = NewNode(op, object, key); local
1090 Node* node = NewNode(op, object, value); local
1118 Node* node = NewNode(op, object, key, value); local
1523 Node* node = early_reduction.replacement(); local
1538 Node* node = nullptr; local
1629 Node* node = nullptr; local
1674 Node* node = nullptr; local
1692 Node* node = nullptr; local
1706 Node* node = NewNode(simplified()->BooleanNot(), value); local
1713 Node* node = NewNode(simplified()->BooleanNot(), value); local
1718 Node* node = local
1728 Node* node = local
1742 Node* node = NewNode(javascript()->GetSuperConstructor(), local
1753 Node* node = NewNode(js_op, left, right); local
1796 Node* node = NewNode(jsgraph()->simplified()->ObjectIsUndetectable(), object); local
1894 Node* node = NewNode(javascript()->StackCheck()); local
[all...] |
| wasm-compiler.cc | 27 #include "src/compiler/node-matchers.h"
59 void MergeControlToEnd(JSGraph* jsgraph, Node* node) {
62 NodeProperties::MergeControlToEnd(g, jsgraph->common(), node);
64 g->SetEnd(g->NewNode(jsgraph->common()->End(1), node));
70 Node* BuildCallToRuntimeWithContext(Runtime::FunctionId f, JSGraph* jsgraph,
71 Node* context, Node** parameters,
72 int parameter_count, Node** effect_ptr,
73 Node* control)
98 Node* node = local
214 Node* node = graph()->NewNode(common()->TrapIf(trap_id), cond, local
231 Node* node = graph()->NewNode(common()->TrapUnless(trap_id), cond, local
3119 Node* node = graph()->NewNode(op, addr, jsgraph()->Int32Constant(0), *effect_, local
3134 Node* node = graph()->NewNode(op, addr, jsgraph()->Int32Constant(0), val, local
[all...] |
| /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/field/address/parser/ |
| SimpleNode.java | 5 public class SimpleNode extends org.apache.james.mime4j.field.address.parser.BaseNode implements Node {
6 protected Node parent;
7 protected Node[] children;
26 public void jjtSetParent(Node n) { parent = n; }
27 public Node jjtGetParent() { return parent; }
29 public void jjtAddChild(Node n, int i) {
31 children = new Node[i + 1];
33 Node c[] = new Node[i + 1];
40 public Node jjtGetChild(int i)
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/ |
| pgen_test.go | 24 a, b Node
28 Node{Class: PAUTO},
29 Node{Class: PFUNC},
33 Node{Class: PFUNC},
34 Node{Class: PAUTO},
38 Node{Class: PFUNC, Xoffset: 0},
39 Node{Class: PFUNC, Xoffset: 10},
43 Node{Class: PFUNC, Xoffset: 20},
44 Node{Class: PFUNC, Xoffset: 10},
48 Node{Class: PFUNC, Xoffset: 10}
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/ |
| pgen_test.go | 24 a, b Node
28 Node{Class: PAUTO},
29 Node{Class: PFUNC},
33 Node{Class: PFUNC},
34 Node{Class: PAUTO},
38 Node{Class: PFUNC, Xoffset: 0},
39 Node{Class: PFUNC, Xoffset: 10},
43 Node{Class: PFUNC, Xoffset: 20},
44 Node{Class: PFUNC, Xoffset: 10},
48 Node{Class: PFUNC, Xoffset: 10}
[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...] |
| /external/v8/src/ic/ |
| accessor-assembler.cc | 18 using compiler::Node;
22 Node* AccessorAssembler::TryMonomorphicCase(Node* slot, Node* vector,
23 Node* receiver_map,
36 Node* offset =
38 Node* feedback = Load(MachineType::AnyTagged(), vector,
47 Node* handler =
56 void AccessorAssembler::HandlePolymorphicCase(Node* receiver_map,
57 Node* feedback, Label* if_handler
[all...] |
| /external/clang/include/clang/ASTMatchers/ |
| ASTMatchers.h | 34 // where "child" is bound to the RecordDecl node of the matching child
63 /// The bound nodes are generated by calling \c bind("id") on the node matchers
70 /// \brief Returns the AST node bound to \c ID.
72 /// Returns NULL if there was no node bound to \c ID or if there is a node but
111 /// \brief If the provided matcher matches a node, binds the node to \c ID.
131 /// \brief Matches any node.
213 SourceManager.getExpansionLoc(Node.getLocStart()));
233 auto ExpansionLoc = SourceManager.getExpansionLoc(Node.getLocStart())
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| InstrEmitter.h | 39 /// EmitCopyFromReg - Generate machine code for an CopyFromReg node or an
41 void EmitCopyFromReg(SDNode *Node, unsigned ResNo,
47 /// node is a CopyToReg, return its destination register. Return 0 otherwise.
48 unsigned getDstOfOnlyCopyToRegUse(SDNode *Node,
51 void CreateVirtualRegisters(SDNode *Node,
58 /// of the specified node.
73 /// specifies the instruction information for the node, and IIOpNum is the
91 void EmitSubregNode(SDNode *Node, DenseMap<SDValue, unsigned> &VRBaseMap,
98 void EmitCopyToRegClassNode(SDNode *Node,
103 void EmitRegSequence(SDNode *Node, DenseMap<SDValue, unsigned> &VRBaseMap
[all...] |
| /libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
| TextImpl.java | 20 import org.w3c.dom.Node;
46 return Node.TEXT_NODE;
54 Node refNode = getNextSibling();
89 Node parent = getParentNode();
95 // ...except the current node if we have content for it
102 Node toRemove = n; // because removeChild() detaches siblings
112 * Returns the first text or CDATA node in the current sequence of text and
117 for (Node p = getPreviousSibling(); p != null; p = p.getPreviousSibling()) {
119 if (nodeType == Node.TEXT_NODE || nodeType == Node.CDATA_SECTION_NODE)
[all...] |
| InnerNodeImpl.java | 24 import org.w3c.dom.Node;
37 * <p>This class represents a Node that has a parent Node as well as
51 public Node appendChild(Node newChild) throws DOMException {
58 for (NodeImpl node : children) {
59 list.add(node);
65 public Node getFirstChild() {
69 public Node getLastChild() {
73 public Node getNextSibling()
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/jaxp/ |
| JAXPPrefixResolver.java | 22 import org.w3c.dom.Node;
77 * Given a prefix and a Context Node, get the corresponding namespace.
79 * is an attribute node.
81 * @param namespaceContext Node from which to start searching for a
87 org.w3c.dom.Node namespaceContext) {
88 Node parent = namespaceContext;
97 && (((type = parent.getNodeType()) == Node.ELEMENT_NODE)
98 || (type == Node.ENTITY_REFERENCE_NODE))) {
100 if (type == Node.ELEMENT_NODE) {
104 Node attr = nnm.item(i)
[all...] |
| /external/llvm/lib/CodeGen/ |
| ScheduleDAGPrinter.cpp | 41 static bool isNodeHidden(const SUnit *Node) {
42 return (Node->NumPreds > 10 || Node->NumSuccs > 10);
45 static std::string getNodeIdentifierLabel(const SUnit *Node,
49 OS << static_cast<const void *>(Node);
55 static std::string getEdgeAttributes(const SUnit *Node,
66 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph);
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/constructor/ |
| AbstractConstructTest.java | 20 import org.yaml.snakeyaml.nodes.Node;
30 public Object construct(Node node) {
34 Node node = new SequenceNode(Tag.SEQ, true, new ArrayList<Node>(), null, null, false); local
36 abstractConstruct.construct2ndStep(node, "");
39 assertEquals("Unexpected recursive structure for Node: <org.yaml.snakeyaml.nodes.SequenceNode (tag=tag:yaml.org,2002:seq, value=[])>", e.getMessage());
46 public Object construct(Node node) {
50 Node node = new SequenceNode(Tag.SEQ, true, new ArrayList<Node>(), null, null, false); local
[all...] |
| /libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
| hc_nodeinsertbeforedocfragment.java | 69 Node employeeNode;
71 Node refChild;
73 Node newChild1;
74 Node newChild2;
75 Node child;
77 Node appendedChild;
78 Node insertedNode;
|
| nodeinsertbeforedocfragment.java | 69 Node employeeNode;
71 Node refChild;
73 Node newChild1;
74 Node newChild2;
75 Node child;
77 Node appendedChild;
78 Node insertedNode;
|
| /libcore/luni/src/main/java/org/w3c/dom/ |
| Document.java | 22 * to create these objects. The <code>Node</code> objects created have a
27 public interface Document extends Node {
35 * <br>This provides direct access to the <code>DocumentType</code> node,
36 * child node of this <code>Document</code>. This node can be set at
38 * nodes manipulation methods, such as <code>Node.insertBefore</code>,
39 * or <code>Node.replaceChild</code>. Note, however, that while some
58 * node that is the document element of the document.
95 * Creates a <code>Text</code> node given the specified string.
96 * @param data The data for the node
[all...] |
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedDeque.java | 113 * A node contains the expected E ("item") and links to predecessor
116 * class Node<E> { volatile Node<E> prev, next; volatile E item; }
118 * A node p is considered "live" if it contains a non-null item
122 * At any time, there is precisely one "first" node with a null
124 * starting at a live node. Similarly there is precisely one
125 * "last" node terminating any chain of next references starting at
126 * a live node. The "first" and "last" nodes may or may not be live.
130 * next reference in the first or last node to a fresh node
[all...] |
