| /external/skia/src/gpu/ccpr/ |
| GrCCPRAtlas.h | 42 class Node;
51 std::unique_ptr<Node> fTopNode;
|
| /external/snakeyaml/src/test/java/examples/jodatime/ |
| JodaTimeImplicitContructor.java | 23 import org.yaml.snakeyaml.nodes.Node;
35 public Object construct(Node node) {
36 Date date = (Date) super.construct(node);
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue171/ |
| CustomRepresenter.java | 18 import org.yaml.snakeyaml.nodes.Node;
29 public Node representData(Object data) {
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/nodes/ |
| ScalarNodeTest.java | 27 Node node = new ScalarNode(new Tag("str"), "text", null, null, '>'); local
28 assertEquals(NodeId.scalar, node.getNodeId());
32 Node node = new ScalarNode(new Tag("str"), "text", null, null, '>'); local
33 assertTrue(node.toString().contains("ScalarNode"));
34 assertTrue(node.toString().contains("tag="));
35 assertTrue(node.toString().contains("value="));
|
| /external/v8/src/builtins/ |
| builtins-generator.cc | 29 Node* receiver = Parameter(0);
30 Node* value = Parameter(1);
31 Node* context = Parameter(4);
32 Node* closed = SmiConstant(JSGeneratorObject::kGeneratorClosed);
37 Node* receiver_instance_type = LoadInstanceType(receiver);
43 Node* receiver_continuation =
53 Node* result = CallStub(CodeFactory::ResumeGenerator(isolate()), context,
73 Node* result = nullptr;
|
| /external/v8/src/compiler/ |
| control-builders.h | 9 #include "src/compiler/node.h"
33 Node* the_hole() const { return builder_->jsgraph()->TheHoleConstant(); }
48 void If(Node* condition, BranchHint hint = BranchHint::kNone);
79 // node and variable markers.
80 void ExitLoop(Node** extra_value_to_rename = nullptr);
83 void BreakUnless(Node* condition);
84 void BreakWhen(Node* condition);
106 void BeginLabel(int index, Node* condition);
141 void BreakWhen(Node* condition, BranchHint = BranchHint::kNone);
142 void BreakUnless(Node* condition, BranchHint hint = BranchHint::kNone)
[all...] |
| loop-peeling.h | 21 // Maps {node} to its corresponding copy in the peeled iteration, if
22 // the node was part of the body of the loop. Returns {node} otherwise.
23 Node* map(Node* node);
|
| simplified-lowering.cc | 17 #include "src/compiler/node-matchers.h"
18 #include "src/compiler/node-properties.h"
47 // During this phase, the usage information for a node determines the best
162 void ReplaceEffectControlUses(Node* node, Node* effect, Node* control) {
163 for (Edge edge : node->use_edges()) {
175 void ChangeToPureOp(Node* node, const Operator* new_op)
336 Node* node = current.node; local
358 Node* node = queue_.front(); local
565 Node* node = queue_.front(); local
585 Node* node = *i; local
597 Node* node = *i; local
621 Node* node = use_node->InputAt(index); local
2802 Node* node; member in struct:v8::internal::compiler::RepresentationSelector::NodeState
[all...] |
| js-inlining-heuristic.cc | 9 #include "src/compiler/node-matchers.h"
24 int CollectFunctions(Node* node, Handle<JSFunction>* functions,
27 HeapObjectMatcher m(node);
33 int const value_input_count = m.node()->op()->ValueInputCount();
36 HeapObjectMatcher m(node->InputAt(n));
70 Reduction JSInliningHeuristic::Reduce(Node* node) {
71 if (!IrOpcode::IsInlineeOpcode(node->opcode())) return NoChange();
73 // Check if we already saw that {node} before, and if so, just skip it
177 Node* const node = candidate.node; local
271 Node* node = calls[i]; local
[all...] |
| /libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
| NodeListImpl.java | 21 import org.w3c.dom.Node;
46 void add(NodeImpl node) {
47 children.add(node);
54 public Node item(int index) {
|
| NotationImpl.java | 19 import org.w3c.dom.Node;
52 return Node.NOTATION_NODE;
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64ISelDAGToDAG.cpp | 60 void Select(SDNode *Node) override;
208 /// isIntImmediate - This method tests to see if the node is a constant
224 // isOpcWithIntImmediate - This method tests to see if the node is a specific
314 /// getShiftTypeForNode - Translate a shift node to the corresponding
364 /// getExtendTypeForNode - Translate an extend node to the corresponding
557 MachineSDNode *Node = CurDAG->getMachineNode(TargetOpcode::EXTRACT_SUBREG,
559 return SDValue(Node, 0);
768 MachineSDNode *Node = CurDAG->getMachineNode(
770 return SDValue(Node, 0);
773 /// \brief Check if the given SHL node (\p N), can be used to form a
[all...] |
| /external/v8/src/compiler/x87/ |
| instruction-selector-x87.cc | 7 #include "src/compiler/node-matchers.h"
8 #include "src/compiler/node-properties.h"
20 InstructionOperand UseByteRegister(Node* node) {
22 return UseFixed(node, edx);
25 InstructionOperand DefineAsByteRegister(Node* node) {
27 return DefineAsRegister(node);
30 bool CanBeMemoryOperand(InstructionCode opcode, Node* node, Node* input
1551 Node* const node = value->InputAt(0); local
[all...] |
| /external/swiftshader/third_party/subzero/src/ |
| IceCfg.cpp | 88 for (CfgNode *Node : getNodes()) {
91 InstCount += Node->getPhis().size();
92 for (Inst &I : Node->getInsts()) {
108 auto *Node = CfgNode::create(this, LabelIndex);
109 Nodes.push_back(Node);
110 return Node;
184 for (CfgNode *Node : Nodes) {
185 const std::string NodeAsmName = Node->getAsmName();
188 Node->profileExecutionCount(GlobalInits->back());
277 for (auto *Node : Nodes)
[all...] |
| /external/testng/src/main/java/org/testng/xml/dom/ |
| DomUtil.java | 10 import org.w3c.dom.Node;
38 Node item1 = nodes.item(i);
43 public void process(Node node) {
44 Element e = (Element) node;
50 public void process(Node node) {
52 populateTest(xmlTest, node);
57 public void process(Node node) {
[all...] |
| /frameworks/compile/mclinker/unittests/ |
| GraphTest.cpp | 39 ListDigraph::Node* u1 = graph.addNode();
40 ListDigraph::Node* u2 = graph.addNode();
41 ListDigraph::Node* u3 = graph.addNode();
58 ListDigraph::Node* head = NULL;
86 ListDigraph::Node* u1 = graph.addNode();
87 ListDigraph::Node* u2 = graph.addNode();
88 ListDigraph::Node* u3 = graph.addNode();
105 ListDigraph::Node* head = NULL;
133 ListDigraph::Node* u1 = graph.addNode();
134 ListDigraph::Node* u2 = graph.addNode()
316 Digraph::Node node = graph.addNode(); local
[all...] |
| /external/clang/include/clang/ASTMatchers/ |
| ASTMatchFinder.h | 177 /// \brief Calls the registered callbacks on all matches on the given \p Node.
179 /// Note that there can be multiple matches on a single node, for
183 template <typename T> void match(const T &Node, ASTContext &Context) {
184 match(clang::ast_type_traits::DynTypedNode::create(Node), Context);
186 void match(const clang::ast_type_traits::DynTypedNode &Node,
224 /// \brief Returns the results of matching \p Matcher on \p Node.
227 /// \p Matcher on \p Node and returns the collected results.
236 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context);
240 match(MatcherT Matcher, const ast_type_traits::DynTypedNode &Node,
251 /// Returns \c NULL if there is no match, or if the matching node cannot b
[all...] |
| /external/google-breakpad/src/testing/gtest/test/ |
| gtest_xml_test_utils.py | 37 from xml.dom import minidom, Node
53 Asserts that actual_node (a DOM node object) is equivalent to
54 expected_node (another DOM node object), in that either both of
70 if expected_node.nodeType == Node.CDATA_SECTION_NODE:
71 self.assertEquals(Node.CDATA_SECTION_NODE, actual_node.nodeType)
75 self.assertEquals(Node.ELEMENT_NODE, actual_node.nodeType)
76 self.assertEquals(Node.ELEMENT_NODE, expected_node.nodeType)
123 attributes are encountered, or if any other type of node is encountered.
128 if child.nodeType == Node.ELEMENT_NODE:
134 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE]
[all...] |
| /external/googletest/googletest/test/ |
| gtest_xml_test_utils.py | 37 from xml.dom import minidom, Node
53 Asserts that actual_node (a DOM node object) is equivalent to
54 expected_node (another DOM node object), in that either both of
70 if expected_node.nodeType == Node.CDATA_SECTION_NODE:
71 self.assertEquals(Node.CDATA_SECTION_NODE, actual_node.nodeType)
75 self.assertEquals(Node.ELEMENT_NODE, actual_node.nodeType)
76 self.assertEquals(Node.ELEMENT_NODE, expected_node.nodeType)
127 attributes are encountered, or if any other type of node is encountered.
132 if child.nodeType == Node.ELEMENT_NODE:
138 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE]
[all...] |
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| DefaultNodeCreator.java | 35 * Default node creator.
40 @Override public Iterable<Node> getNodes(Iterable<Binding<?>> bindings) {
41 List<Node> nodes = Lists.newArrayList();
53 extends DefaultBindingTargetVisitor<Object, Collection<Node>> {
55 /** Returns a new interface node for the given {@link Binding}. */
61 * Returns a new implementation node for the given binding.
63 * @param binding binding for the node to create
64 * @param members members to add to the node
65 * @return implementation node for the given binding
74 * Returns a new instance node for the given {@link Binding}
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| StringTrieBuilder.java | 89 // because it makes registerNode() return the input node
133 * Makes sure that there is only one unique node registered that is
135 * @param newNode Input node. The builder takes ownership.
137 * an equivalent node if newNode is a duplicate.
139 private final Node registerNode(Node newNode) {
144 Node oldNode=nodes.get(newNode);
149 // registered node, then get() failed to find that and we will leak newNode.
158 * Avoids creating a node if the value is a duplicate.
166 Node oldNode=nodes.get(lookupFinalValueNode)
302 ValueNode node=builder.createSuffixNode(s, start, sValue); local
560 Node node=equal.get(start); local
808 ValueNode node=registerFinalValue(sValue); local
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| StringTrieBuilder.java | 91 // because it makes registerNode() return the input node
135 * Makes sure that there is only one unique node registered that is
137 * @param newNode Input node. The builder takes ownership.
139 * an equivalent node if newNode is a duplicate.
141 private final Node registerNode(Node newNode) {
146 Node oldNode=nodes.get(newNode);
151 // registered node, then get() failed to find that and we will leak newNode.
160 * Avoids creating a node if the value is a duplicate.
168 Node oldNode=nodes.get(lookupFinalValueNode)
304 ValueNode node=builder.createSuffixNode(s, start, sValue); local
562 Node node=equal.get(start); local
810 ValueNode node=registerFinalValue(sValue); local
[all...] |
| /external/llvm/lib/Target/Mips/ |
| MipsISelDAGToDAG.cpp | 197 void MipsDAGToDAGISel::Select(SDNode *Node) {
198 unsigned Opcode = Node->getOpcode();
200 // Dump information about the Node being selected
201 DEBUG(errs() << "Selecting: "; Node->dump(CurDAG); errs() << "\n");
203 // If we have a custom node, we already have selected!
204 if (Node->isMachineOpcode()) {
205 DEBUG(errs() << "== "; Node->dump(CurDAG); errs() << "\n");
206 Node->setNodeId(-1);
210 // See if subclasses can handle this node.
211 if (trySelect(Node))
[all...] |
| /external/protobuf/gtest/test/ |
| gtest_xml_test_utils.py | 37 from xml.dom import minidom, Node
53 Asserts that actual_node (a DOM node object) is equivalent to
54 expected_node (another DOM node object), in that either both of
69 if expected_node.nodeType == Node.CDATA_SECTION_NODE:
70 self.assertEquals(Node.CDATA_SECTION_NODE, actual_node.nodeType)
74 self.assertEquals(Node.ELEMENT_NODE, actual_node.nodeType)
75 self.assertEquals(Node.ELEMENT_NODE, expected_node.nodeType)
122 attributes are encountered, or if any other type of node is encountered.
127 if child.nodeType == Node.ELEMENT_NODE:
133 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE]
[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...] |
