| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/representer/ |
| BaseRepresenter.java | 30 import org.yaml.snakeyaml.nodes.Node;
51 protected final Map<Object, Node> representedObjects = new IdentityHashMap<Object, Node>() {
54 public Node put(Object key, Node value) {
63 public Node represent(Object data) {
64 Node node = representData(data); local
67 return node;
70 protected final Node representData(Object data)
74 Node node = representedObjects.get(objectToRepresent); local
80 Node node = nullRepresenter.representData(null); local
84 Node node; local
115 Node node = new ScalarNode(tag, value, null, null, style); local
129 SequenceNode node = new SequenceNode(tag, value, flowStyle); local
151 MappingNode node = new MappingNode(tag, value, flowStyle); local
[all...] |
| /external/r8/src/main/java/com/android/tools/r8/ir/conversion/ |
| CallGraph.java | 34 * Each node in the graph contain the methods called and the calling methods. For virtual and
39 * The directional edges are represented as sets of nodes in each node (called methods and callees).
48 private class Node {
55 private final Set<Node> callees = new LinkedHashSet<>();
58 private final Set<Node> callers = new LinkedHashSet<>();
60 private Node(DexEncodedMethod method) {
68 private void addCallee(Node method) {
72 private void addCaller(Node method) {
114 for (Node call : callees) {
122 for (Node caller : callers)
153 Node node = graph.ensureMethodNode(method); local
[all...] |
| /external/v8/src/compiler/ |
| redundancy-elimination.cc | 7 #include "src/compiler/node-properties.h"
18 Reduction RedundancyElimination::Reduce(Node* node) {
19 if (node_checks_.Get(node)) return NoChange();
20 switch (node->opcode()) {
41 return ReduceCheckNode(node);
46 return TryReuseBoundsCheckForFirstInput(node);
48 return ReduceEffectPhi(node);
52 return ReduceStart(node);
54 return ReduceOtherNode(node);
[all...] |
| ast-graph-builder.cc | 16 #include "src/compiler/node-matchers.h"
17 #include "src/compiler/node-properties.h"
44 // Plug a node into this expression context. Call this function in tail
46 virtual void ProduceValue(Expression* expr, Node* value) = 0;
48 // Unplugs a node from this expression context. Call this to retrieve the
50 virtual Node* ConsumeValue() = 0;
81 void ProduceValue(Expression* expr, Node* value) final;
82 Node* ConsumeValue() final;
92 void ProduceValue(Expression* expr, Node* value) final;
93 Node* ConsumeValue() final
323 Node* node = NewNode(op, graph()->start()); local
335 Node* node = NewNode(op, graph()->start()); local
345 Node* node = graph()->NewNode( local
434 Node* node = NewNode(javascript()->StackCheck()); local
2103 Node* node = NewNode(javascript()->StackCheck()); local
2276 Node* node = NewNode(op, receiver); local
2289 Node* node = NewNode(op, parameter); local
2594 Node* node = NewNode(op, object, key); local
2602 Node* node = NewNode(op, object); local
2612 Node* node = NewNode(op, object, key, value); local
2624 Node* node = NewNode(op, object, value); local
2634 Node* node = NewNode(op, object, value); local
2643 Node* node = NewNode(op); local
2652 Node* node = NewNode(op, value); local
2867 Node* node = NewNode(common()->Checkpoint()); local
[all...] |
| simd-scalar-lowering.cc | 8 #include "src/compiler/node-matchers.h"
9 #include "src/compiler/node-properties.h"
11 #include "src/compiler/node.h"
47 if (top.input_index == top.node->InputCount()) {
50 state_.Set(top.node, State::kVisited);
51 LowerNode(top.node);
54 Node* input = top.node->InputAt(top.input_index++);
56 SetLoweredType(input, top.node);
86 void SimdScalarLowering::SetLoweredType(Node* node, Node* output)
[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
1700 Node* const node = value->InputAt(0); local
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| InstrEmitter.cpp | 45 unsigned InstrEmitter::CountResults(SDNode *Node) {
46 unsigned N = Node->getNumValues();
47 while (N && Node->getValueType(N - 1) == MVT::Glue)
49 if (N && Node->getValueType(N - 1) == MVT::Other)
61 static unsigned countOperands(SDNode *Node, unsigned NumExpUses,
63 unsigned N = Node->getNumOperands();
64 while (N && Node->getOperand(N - 1).getValueType() == MVT::Glue)
66 if (N && Node->getOperand(N - 1).getValueType() == MVT::Other)
72 if (isa<RegisterMaskSDNode>(Node->getOperand(I - 1)))
74 if (RegisterSDNode *RN = dyn_cast<RegisterSDNode>(Node->getOperand(I - 1))
[all...] |
| LegalizeDAG.cpp | 64 /// reference to it in order to update as necessary on node deletion.
84 void LegalizeOp(SDNode *Node);
89 void LegalizeLoadOps(SDNode *Node);
90 void LegalizeStoreOps(SDNode *Node);
112 SDValue ExpandLibCall(RTLIB::Libcall LC, SDNode *Node, bool isSigned);
117 SDNode *Node, bool isSigned);
118 SDValue ExpandFPLibCall(SDNode *Node, RTLIB::Libcall Call_F32,
122 SDValue ExpandIntLibCall(SDNode *Node, bool isSigned,
128 void ExpandDivRemLibCall(SDNode *Node, SmallVectorImpl<SDValue> &Results);
129 void ExpandSinCosLibCall(SDNode *Node, SmallVectorImpl<SDValue> &Results)
[all...] |
| /external/swiftshader/third_party/subzero/src/ |
| IceLiveness.h | 14 /// The node-specific information tracked for each Variable includes whether it
72 Variable *getVariable(SizeT LiveIndex, const CfgNode *Node) const;
79 SizeT getNumVarsInNode(const CfgNode *Node) const {
80 return NumGlobals + Nodes[Node->getIndex()].NumLocals;
82 SizeT &getNumNonDeadPhis(const CfgNode *Node) {
83 return Nodes[Node->getIndex()].NumNonDeadPhis;
85 LivenessBV &getLiveIn(const CfgNode *Node) {
86 SizeT Index = Node->getIndex();
90 LivenessBV &getLiveOut(const CfgNode *Node) {
91 SizeT Index = Node->getIndex()
[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...] |
| /device/linaro/bootloader/edk2/MdePkg/Include/Library/ |
| DevicePathLib.h | 31 @retval FALSE The length of any node node in the DevicePath is less
35 @retval FALSE If PcdMaximumDevicePathNodeCount is not zero, the node
46 Returns the Type field of a device path node.
48 Returns the Type field of the device path node specified by Node.
50 If Node is NULL, then ASSERT().
52 @param Node A pointer to a device path node data structure.
54 @return The Type field of the device path node specified by Node.
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/serializer/dom3/ |
| DOMLocatorImpl.java | 25 import org.w3c.dom.Node;
57 /** related data node*/
58 private final Node fRelatedNode;
113 DOMLocatorImpl (int lineNumber, int columnNumber, int byteoffset, Node relatedData, String uri ){
121 } // DOMLocatorImpl (int lineNumber, int columnNumber, int offset, Node errorNode, String uri )
123 DOMLocatorImpl (int lineNumber, int columnNumber, int byteoffset, Node relatedData, String uri, int utf16Offset ){
130 } // DOMLocatorImpl (int lineNumber, int columnNumber, int offset, Node errorNode, String uri )
158 public Node getRelatedNode(){
|
| /libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
| hc_attrinsertbefore1.java | 31 * Appends a text node to an attribute and checks if the value of
61 Node testNode;
66 Node retval;
67 Node firstChild;
68 Node lastChild;
69 Node refChild = null;
|
| hc_attrinsertbefore2.java | 31 * Prepends a text node to an attribute and checks if the value of
61 Node testNode;
66 Node retval;
67 Node lastChild;
68 Node firstChild;
69 Node refChild;
|
| hc_nodeinsertbeforerefchildnull.java | 33 * node "newChild" at the end of the list of children.
40 * node of the list should be "newChild".
69 Node employeeNode;
71 Node refChild = null;
73 Node newChild;
74 Node child;
76 Node insertedNode;
|
| hc_nodereplacechild.java | 32 * the node "oldChild" with the node "newChild".
35 * a newly created Element node. Check the first position
66 Node employeeNode;
68 Node oldChild;
69 Node newChild;
70 Node child;
72 Node replacedNode;
|
| nodeappendchildchildexists.java | 67 Node childNode;
68 Node newChild;
69 Node lchild;
70 Node fchild;
73 Node appendedChild;
|
| nodeappendchildnomodificationallowederr.java | 33 * if the node is readonly.
70 Node genderNode;
71 Node entRef;
72 Node entElement;
73 Node createdNode;
74 Node appendedNode;
|
| nodeinsertbeforerefchildnull.java | 33 * node "newChild" at the end of the list of children.
40 * node of the list should be "newChild".
69 Node employeeNode;
71 Node refChild = null;
73 Node newChild;
74 Node child;
76 Node insertedNode;
|
| nodereplacechild.java | 32 * the node "oldChild" with the node "newChild".
35 * a newly created Element node. Check the first position
66 Node employeeNode;
68 Node oldChild;
69 Node newChild;
70 Node child;
72 Node replacedNode;
|
| nodereplacechildnomodificationallowederr.java | 33 * if the node is readonly.
71 Node genderNode;
72 Node entRef;
73 Node entElement;
74 Node createdNode;
75 Node replacedChild;
|
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
| AllocatorList.h | 30 struct Node : ilist_node<Node> {
31 Node(Node &&) = delete;
32 Node(const Node &) = delete;
33 Node &operator=(Node &&) = delete;
34 Node &operator=(const Node &) = delete
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
| AllocatorList.h | 30 struct Node : ilist_node<Node> {
31 Node(Node &&) = delete;
32 Node(const Node &) = delete;
33 Node &operator=(Node &&) = delete;
34 Node &operator=(const Node &) = delete
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| AllocatorList.h | 30 struct Node : ilist_node<Node> {
31 Node(Node &&) = delete;
32 Node(const Node &) = delete;
33 Node &operator=(Node &&) = delete;
34 Node &operator=(const Node &) = delete
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| AllocatorList.h | 30 struct Node : ilist_node<Node> {
31 Node(Node &&) = delete;
32 Node(const Node &) = delete;
33 Node &operator=(Node &&) = delete;
34 Node &operator=(const Node &) = delete
[all...] |
