| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/constructor/ |
| Construct.java | 18 import org.yaml.snakeyaml.nodes.Node;
21 * Provide a way to construct a Java instance out of the composed Node. Support
23 * Node Graph)
33 * @param node
34 * composed Node
37 Object construct(Node node);
43 * @param node
44 * composed Node
47 * <code>construct(Node node)</code> for the provided Nod
[all...] |
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/nodes/ |
| NodeTuple.java | 23 private Node keyNode;
24 private Node valueNode;
26 public NodeTuple(Node keyNode, Node valueNode) {
35 * Key node.
37 public Node getKeyNode() {
42 * Value node.
46 public Node getValueNode() {
|
| AnchorNode.java | 18 public class AnchorNode extends Node {
20 private Node realNode;
22 public AnchorNode(Node realNode) {
32 public Node getRealNode() {
|
| /external/v8/src/compiler/ |
| bytecode-graph-builder.h | 37 Node* LoadAccumulator(Node* value);
39 // Get or create the node that represents the outer function closure.
40 Node* GetFunctionClosure();
42 // Get or create the node that represents the outer function context.
43 Node* GetFunctionContext();
45 // Get or create the node that represents the incoming new target value.
46 Node* GetNewTarget();
49 Node* BuildLoadObjectField(Node* object, int offset)
[all...] |
| select-lowering.h | 28 Reduction Reduce(Node* node) override;
31 typedef std::multimap<Node*, Node*, std::less<Node*>,
32 zone_allocator<std::pair<Node* const, Node*>>> Merges;
34 bool ReachableFrom(Node* const sink, Node* const source);
|
| simplified-lowering.h | 10 #include "src/compiler/node.h"
35 // representation analysis is stored in the node bounds.
36 void DoLoadBuffer(Node* node, MachineRepresentation rep,
38 void DoStoreBuffer(Node* node);
39 void DoObjectIsNumber(Node* node);
40 void DoObjectIsSmi(Node* node);
[all...] |
| js-inlining.h | 32 Reduction Reduce(Node* node) final;
36 Reduction ReduceJSCall(Node* node, Handle<JSFunction> function);
43 Node* CreateArtificialFrameState(Node* node, Node* outer_frame_state,
48 Reduction InlineCall(Node* call, Node* new_target, Node* context
[all...] |
| escape-analysis-reducer.h | 31 Reduction Reduce(Node* node) final;
34 Reduction ReduceLoad(Node* node);
35 Reduction ReduceStore(Node* node);
36 Reduction ReduceAllocate(Node* node);
37 Reduction ReduceFinishRegion(Node* node);
[all...] |
| code-stub-assembler.cc | 56 Node* CodeStubAssembler::Int32Constant(int value) {
61 Node* CodeStubAssembler::IntPtrConstant(intptr_t value) {
66 Node* CodeStubAssembler::NumberConstant(double value) {
71 Node* CodeStubAssembler::HeapConstant(Handle<HeapObject> object) {
76 Node* CodeStubAssembler::BooleanConstant(bool value) {
81 Node* CodeStubAssembler::Parameter(int value) {
86 void CodeStubAssembler::Return(Node* value) {
91 Node* CodeStubAssembler::SmiShiftBitsConstant() {
96 Node* CodeStubAssembler::SmiTag(Node* value)
[all...] |
| control-equivalence.h | 9 #include "src/compiler/node.h"
40 // Run the main algorithm starting from the {exit} control node. This causes
46 void Run(Node* exit);
49 size_t ClassOf(Node* node) {
50 DCHECK_NE(kInvalidClass, GetClass(node));
51 return GetClass(node);
62 Node* from; // Node that this bracket originates from.
63 Node* to; // Node that this bracket points to
74 Node* node; \/\/ Node that this stack entry belongs to. member in struct:v8::internal::compiler::final::DFSStackEntry
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| NodeConsumer.java | 23 import org.w3c.dom.Node;
35 * Set the node that is originating the SAX event.
37 * @param n Reference to node that originated the current event.
39 public void setOriginatingNode(Node n);
|
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/representer/ |
| Represent.java | 18 import org.yaml.snakeyaml.nodes.Node;
21 * Create a Node Graph out of the provided Native Data Structure (Java
29 * Create a Node
33 * @return Node to dump
35 Node representData(Object data);
|
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/serializer/ |
| AnchorGenerator.java | 18 import org.yaml.snakeyaml.nodes.Node;
22 String nextAnchor(Node node);
|
| /external/v8/test/unittests/compiler/ |
| interpreter-assembler-unittest.h | 32 Matcher<Node*> IsLoad(const Matcher<LoadRepresentation>& rep_matcher,
33 const Matcher<Node*>& base_matcher,
34 const Matcher<Node*>& index_matcher);
35 Matcher<Node*> IsStore(const Matcher<StoreRepresentation>& rep_matcher,
36 const Matcher<Node*>& base_matcher,
37 const Matcher<Node*>& index_matcher,
38 const Matcher<Node*>& value_matcher);
40 Matcher<Node*> IsBytecodeOperand(int offset);
41 Matcher<Node*> IsBytecodeOperandSignExtended(int offset);
42 Matcher<Node*> IsBytecodeOperandShort(int offset)
[all...] |
| /external/libchrome/sandbox/linux/bpf_dsl/ |
| codegen.h | 33 // CodeGen::Node allow, branch, dag;
58 // Node represents a node within the instruction DAG being compiled.
59 using Node = Program::size_type;
61 // kNullNode represents the "null" node; i.e., the reserved node
63 static const Node kNullNode = -1;
68 // MakeInstruction creates a node representing the specified
69 // instruction, or returns and existing equivalent node if one
73 Node MakeInstruction(uint16_t code
[all...] |
| /external/v8/test/cctest/compiler/ |
| graph-builder-tester.h | 63 parameters_(main_zone()->template NewArray<Node*>(parameter_count())) {
70 Node* Parameter(size_t index) {
81 Node* start = graph()->NewNode(common()->Start(num_parameters + 3));
86 void Return(Node* value) {
94 Node* end = graph()->NewNode(common()->End(1), return_);
98 Node* PointerConstant(void* value) {
103 Node* Int32Constant(int32_t value) {
106 Node* HeapConstant(Handle<HeapObject> object) {
110 Node* BooleanNot(Node* a) { return NewNode(simplified()->BooleanNot(), a);
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 32 /** A generic graph with edges; Each node as a single Object payload.
38 public static class Node {
40 List<Node> edges; // points at which nodes?
42 public Node(Object payload) { this.payload = payload; }
44 public void addEdge(Node n) {
45 if ( edges==null ) edges = new ArrayList<Node>();
52 /** Map from node payload to node containing it */
53 protected Map<Object,Node> nodes = new HashMap<Object,Node>();
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
| PCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node;
5 public abstract class PCommand extends Node
|
| PExpression.java | 3 package com.google.clearsilver.jsilver.syntax.node;
5 public abstract class PExpression extends Node
|
| PPosition.java | 3 package com.google.clearsilver.jsilver.syntax.node;
5 public abstract class PPosition extends Node
|
| PVariable.java | 3 package com.google.clearsilver.jsilver.syntax.node;
5 public abstract class PVariable extends Node
|
| /external/skia/include/views/ |
| SkParsePaint.h | 24 void SkPaint_Inflate(SkPaint*, const SkDOM&, const SkDOM::Node*);
|
| /frameworks/compile/mclinker/unittests/ |
| GCFactoryListTraitsTest.h | 30 * \brief Node used in the test
35 class Node : public llvm::ilist_node<Node> {
43 Node() : m_Init(0), m_Value(0) {}
45 Node(unsigned pInit) : m_Init(pInit), m_Value(pInit) {}
54 class NodeFactory : public mcld::GCFactory<Node, 0> {
56 NodeFactory() : mcld::GCFactory<Node, 0>(16) {}
58 Node* produce(unsigned pInit) {
59 Node* result = allocate();
60 new (result) Node(pInit)
[all...] |
| /libcore/luni/src/main/java/org/w3c/dom/ |
| NodeList.java | 29 * @return The node at the <code>index</code>th position in the
33 public Node item(int index);
36 * The number of nodes in the list. The range of valid child node indices
|
| /libcore/luni/src/main/java/org/w3c/dom/traversal/ |
| NodeIterator.java | 16 import org.w3c.dom.Node;
21 * governed by a particular <code>Node</code>, the results of a query, or
35 * The root node of the <code>NodeIterator</code>, as specified when it
38 public Node getRoot();
41 * This attribute determines which node types are presented via the
65 * expanded and does not expose the entity reference node itself, use
66 * the <code>whatToShow</code> flags to hide the entity reference node
70 * <code>whatToShow</code> flags to show the entity reference node and
76 * Returns the next node in the set and advances the position of the
79 * <code>nextNode()</code> returns the first node in the set
[all...] |
