Searched refs:Node (Results 376 - 400 of 1945) sorted by relevance

<<11121314151617181920>>

/external/javaparser/javaparser-symbol-solver-core/src/main/java/com/github/javaparser/symbolsolver/javaparsermodel/declarators/
H A DNoSymbolDeclarator.java19 import com.github.javaparser.ast.Node;
29 public class NoSymbolDeclarator<N extends Node> extends AbstractSymbolDeclarator<N> {
/external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ast/nodeTypes/
H A DNodeWithType.java25 import com.github.javaparser.ast.Node;
60 ((Node) this).tryAddImportToParentCompilationUnit(typeClass);
/external/libmojo/mojo/edk/system/ports/
H A Dport_ref.h16 class Node;
30 friend class Node;
/external/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGPrinter.cpp43 static unsigned numEdgeDestLabels(const void *Node) { argument
44 return ((const SDNode *) Node)->getNumValues();
47 static std::string getEdgeDestLabel(const void *Node, unsigned i) { argument
48 return ((const SDNode *) Node)->getValueType(i).getEVTString();
52 static std::string getEdgeSourceLabel(const void *Node, EdgeIter I) { argument
53 return itostr(I - SDNodeIterator::begin((const SDNode *) Node));
60 static bool edgeTargetsEdgeSource(const void *Node, EdgeIter I) { argument
65 /// called to determine which outgoing edge of Node is the target of this
68 static EdgeIter getEdgeTarget(const void *Node, EdgeIter I) { argument
83 static std::string getNodeIdentifierLabel(const SDNode *Node, argument
98 getEdgeAttributes(const void *Node, EdgeIter EI, const SelectionDAG *Graph) argument
110 getSimpleNodeLabel(const SDNode *Node, const SelectionDAG *G) argument
144 getNodeLabel(const SDNode *Node, const SelectionDAG *G) argument
[all...]
/external/skia/experimental/sksg/
H A DSkSGGeometryNode.h25 class GeometryNode : public Node {
44 typedef Node INHERITED;
/external/skqp/experimental/sksg/
H A DSkSGGeometryNode.h25 class GeometryNode : public Node {
44 typedef Node INHERITED;
/external/snakeyaml/src/test/java/examples/jodatime/
H A DJodaTimeImplicitContructor.java23 import org.yaml.snakeyaml.nodes.Node;
35 public Object construct(Node node) {
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue171/
H A DCustomRepresenter.java18 import org.yaml.snakeyaml.nodes.Node;
29 public Node representData(Object data) {
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/nodes/
H A DScalarNodeTest.java27 Node node = new ScalarNode(new Tag("str"), "text", null, null, '>');
32 Node node = new ScalarNode(new Tag("str"), "text", null, null, '>');
/external/tensorflow/tensorflow/core/common_runtime/
H A Dparallel_concat_optimizer.cc45 gtl::InlinedVector<Node*, 2> matches;
46 for (Node* n : g->op_nodes()) {
51 for (Node* n : matches) {
73 Node* start;
80 std::vector<Node*> control_nodes;
88 Node* update;
103 for (Node* s : control_nodes) {
106 Node* identity_node;
H A Dplacer.h88 void AssignAndLog(int assigned_device, Node* node) const;
89 void LogDeviceAssignment(const Node* node) const;
/external/tensorflow/tensorflow/core/graph/
H A Dcontrol_flow.cc31 std::vector<const Node*> parent_nodes;
34 Node* src_node = g->source_node();
40 std::deque<Node*> ready;
43 Node* curr_node = ready.front();
46 const Node* frame = curr_info.frame;
47 const Node* parent = curr_info.parent_frame;
59 Node* out = out_edge->dst();
62 const Node* out_parent = out_info->parent_frame;
H A Dsubgraph.h74 typedef std::unordered_map<StringPiece, Node*, StringPieceHasher> NameIndex;
86 NameIndex* name_index, std::vector<Node*>* fetch_nodes);
/external/v8/src/builtins/
H A Dbuiltins-generator.cc29 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/
H A Dcontrol-builders.h33 Node* the_hole() const { return builder_->jsgraph()->TheHoleConstant(); }
48 void If(Node* condition, BranchHint hint = BranchHint::kNone);
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);
H A Dsimplified-lowering.cc162 void ReplaceEffectControlUses(Node* node, Node* effect, Node* control) {
175 void ChangeToPureOp(Node* node, const Operator* new_op) {
180 Node* control = NodeProperties::GetControlInput(node);
181 Node* effect = NodeProperties::GetEffectInput(node);
196 void SetAndCheckInput(Node* node, int index, UseInfo use_info) {
323 Node* input = current.node->InputAt(current.input_index);
336 Node* node = current.node;
347 for (Node* cons
[all...]
H A Djs-inlining-heuristic.cc24 int CollectFunctions(Node* node, Handle<JSFunction>* functions,
70 Reduction JSInliningHeuristic::Reduce(Node* node) {
78 Node* callee = node->InputAt(0);
112 for (Node* frame_state = NodeProperties::GetFrameStateInput(node);
177 Node* const node = candidate.node;
193 Node* calls[kMaxCallPolymorphism + 1];
194 Node* if_successes[kMaxCallPolymorphism];
195 Node* callee = NodeProperties::GetValueInput(node, 0);
196 Node* fallthrough_control = NodeProperties::GetControlInput(node);
200 Node** input
[all...]
/external/v8/src/profiler/
H A Dunbound-queue.h35 struct Node;
37 Node* first_;
38 base::AtomicWord divider_; // Node*
39 base::AtomicWord last_; // Node*
/external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ast/visitor/
H A DEqualsVisitor.java106 public class EqualsVisitor implements GenericVisitor<Boolean, Node> {
110 public static boolean equals(final Node n1, final Node n2) {
122 private boolean commonNodeEquality(Node n1, Node n2) {
129 private <T extends Node> boolean nodesEquals(final List<T> nodes1, final List<T> nodes2) {
146 private <T extends Node> boolean nodeEquals(final T n1, final T n2) {
172 @Override public Boolean visit(final CompilationUnit n1, final Node arg) {
194 @Override public Boolean visit(final PackageDeclaration n1, final Node arg) {
208 @Override public Boolean visit(final ImportDeclaration n1, final Node ar
[all...]
/external/llvm/lib/Target/AArch64/
H A DAArch64ISelDAGToDAG.cpp60 void Select(SDNode *Node) override;
557 MachineSDNode *Node = CurDAG->getMachineNode(TargetOpcode::EXTRACT_SUBREG, local
559 return SDValue(Node, 0);
768 MachineSDNode *Node = CurDAG->getMachineNode( local
770 return SDValue(Node, 0);
825 const SDNode *Node = N.getNode(); local
826 for (SDNode *UI : Node->uses()) {
909 const SDNode *Node = N.getNode(); local
910 for (SDNode *UI : Node->uses()) {
1941 for (SDNode *Node
2555 Select(SDNode *Node) argument
[all...]
/external/v8/src/compiler/x87/
H A Dinstruction-selector-x87.cc20 InstructionOperand UseByteRegister(Node* node) {
25 InstructionOperand DefineAsByteRegister(Node* node) {
30 bool CanBeMemoryOperand(InstructionCode opcode, Node* node, Node* input,
62 bool CanBeImmediate(Node* node) {
87 AddressingMode GenerateMemoryOperandInputs(Node* index, int scale, Node* base,
88 Node* displacement_node,
150 AddressingMode GetEffectiveAddressMemoryOperand(Node* node,
166 bool CanBeBetterLeftOperand(Node* nod
[all...]
/external/swiftshader/third_party/subzero/src/
H A DIceCfg.cpp88 for (CfgNode *Node : getNodes()) {
91 InstCount += Node->getPhis().size();
92 for (Inst &I : Node->getInsts()) {
108 auto *Node = CfgNode::create(this, LabelIndex); local
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
309 CfgNode *Node = Nodes[Index]; local
490 getRandomPostOrder(CfgNode *Node, BitVector &ToVisit, Ice::NodeList &PostOrder, Ice::RandomNumberGenerator *RNG) argument
706 auto *Node = Nodes[NodeIndex]; local
783 auto *Node = NodeStack.back(); local
[all...]
/external/tensorflow/tensorflow/compiler/tf2xla/
H A Dfunctionalize_control_flow.cc48 Node* enter;
56 Node* merge = nullptr;
57 Node* switch_node = nullptr;
58 Node* next_iteration = nullptr;
59 Node* exit = nullptr;
75 Node* loop_cond = nullptr;
78 std::unordered_set<Node*> nodes;
85 bool operator()(const Node* lhs, const Node* rhs) const {
100 [](string* output, const Node* nod
[all...]
/external/testng/src/main/java/org/testng/xml/dom/
H A DDomUtil.java10 import org.w3c.dom.Node;
38 Node item1 = nodes.item(i);
43 public void process(Node node) {
50 public void process(Node node) {
57 public void process(Node node) {
61 Node item3 = item2Children.item(k);
78 // Node item2 = item1Children.item(j);
89 // Node item3 = item2Children.item(k);
107 // Node node = tests.item(i);
113 void process(Node nod
[all...]
/external/tensorflow/tensorflow/core/util/
H A Dequal_graph_def_test.cc35 Node* Input(const GraphDefBuilder::Options& opts) {
39 Node* Alternate(const GraphDefBuilder::Options& opts) {
43 Node* Combine(ops::NodeOut a, ops::NodeOut b,
108 Node* a = Input(e_.opts().WithName("A"));
109 Node* b = Input(e_.opts().WithName("B"));
119 Node* a = Input(e_.opts().WithName("A"));
120 Node* b = Input(e_.opts().WithName("B"));
131 EXPECT_EQ("Node named 'A' has op 'Alternate' that is not expected 'Input'",
145 EXPECT_EQ("Node named 'A' has device '/cpu:1' that is not expected '/cpu:0'",
150 Node*
[all...]

Completed in 1446 milliseconds

<<11121314151617181920>>