Searched refs:Node (Results 326 - 350 of 1945) sorted by relevance

<<11121314151617181920>>

/external/v8/src/builtins/
H A Dbuiltins-number.cc23 void BitwiseOp(std::function<Node*(Node* lhs, Node* rhs)> body) {
24 Node* left = Parameter(0);
25 Node* right = Parameter(1);
26 Node* context = Parameter(2);
28 Node* lhs_value = TruncateTaggedToWord32(context, left);
29 Node* rhs_value = TruncateTaggedToWord32(context, right);
30 Node* value = body(lhs_value, rhs_value);
31 Node* resul
[all...]
/external/tensorflow/tensorflow/compiler/jit/
H A Dencapsulate_subgraphs_pass.cc59 bool AreAllParentsConst(const Node& n,
60 const gtl::FlatSet<const Node*>& runtime_const_nodes) {
82 const std::vector<std::pair<const Node*, Node*>>& src_arg_pairs) {
83 gtl::FlatSet<const Node*> guaranteed_const_nodes;
84 std::vector<const Node*> srcs;
90 /*leave=*/[&guaranteed_const_nodes](const Node* n) {
109 NodeSlot(const Node* node, int slot)
111 NodeSlot(const Node* node, int slot, DataType dtype)
114 const Node* nod
80 MarkGuaranteedConstants( const Graph& graph, const std::vector<std::pair<const Node*, Node*>>& src_arg_pairs) argument
652 RecordArg( const Edge* edge, const std::unordered_map<const Node*, Node*>& node_images, std::vector<std::pair<const Node*, Node*>>* src_arg_pairs) argument
686 RecordResult( const Edge* edge, const std::unordered_map<const Node*, Node*>& node_images) argument
752 AddHostComputes( const string& subgraph_name, const std::unordered_map<const Node*, Node*>& node_images) argument
983 BuildParallelCheckOp( const std::unordered_map<const Node*, Node*>& node_images, Graph* graph_out) argument
1046 AddFunctionCallNode( const std::unordered_map<const Node*, Node*>& node_images, bool parallel_checking, Graph* graph_out) argument
1100 AddSendFromHostNode( const std::unordered_map<const Node*, Node*>& node_images, const string& subgraph_name, const string& oc_subgraph_name, OutsideCompilationSubgraph* oc_subgraph, Graph* graph_out) argument
1143 AddOutsideCompilationHostIONodes( const string& subgraph_name, const std::unordered_map<const Node*, Node*>& node_images, Graph* graph_out) argument
1204 CopySubgraphNodes( std::unordered_map<const Node*, Node*>* node_images) argument
1221 CopySubgraphEdges( const std::unordered_map<const Node*, Node*>& node_images, std::vector<std::pair<const Node*, Node*>>* src_arg_pairs) argument
1357 CopyNodesToOutputGraph( bool parallel_checking, Graph* graph_out, std::unordered_map<const Node*, Node*>* node_images) argument
1388 AddFunctionCallNodes( const std::unordered_map<const Node*, Node*>& node_images, bool parallel_checking, Graph* graph_out) argument
1398 AddOutsideCompilationHostIONodes( const std::unordered_map<const Node*, Node*>& node_images, Graph* graph_out) argument
1410 FindOutputImageOfEdgeSrc( const string& src_func_id, const string& src_outside_compilation_id, const string& dst_func_id, const string& dst_outside_compilation_id, const std::unordered_map<const Node*, Node*>& node_images, const Node* original_src_node, Node** src_image) argument
1458 FindOutputImageOfEdgeDst( const string& src_func_id, const string& src_outside_compilation_id, const string& dst_func_id, const string& dst_outside_compilation_id, const std::unordered_map<const Node*, Node*>& node_images, const Node* original_dst_node, Node** dst_image) argument
1506 CopyEdgeToOutputGraph( const Edge* edge, const string& src_func_id, const string& src_outside_compilation_id, const string& dst_func_id, const string& dst_outside_compilation_id, const std::unordered_map<const Node*, Node*>& node_images, bool parallel_checking, Graph* graph_out, std::unordered_set<std::pair<NodeSlot, NodeSlot>, NodeSlot::PairHasher>* edges_added) argument
1567 AddEdgesToOutputGraph( const std::unordered_map<const Node*, Node*>& node_images, bool parallel_checking, Graph* graph_out) argument
1800 MakePrunedGraphCopyAndInline( const Graph& graph, const std::vector<Node*>& sink_nodes, std::unique_ptr<Graph>* pruned_graph, std::unordered_map<const Node*, Node*>* node_images, FunctionLibraryDefinition* library) argument
1862 MakeGraphForOutsideCompilationSends( const Graph& graph, std::unique_ptr<Graph>* pruned_graph, ShapeRefiner* shape_refiner, std::unordered_map<const Node*, Node*>* node_images, FunctionLibraryDefinition* library) argument
[all...]
/external/apache-xml/src/main/java/org/apache/xml/utils/
H A DTreeWalker.java29 import org.w3c.dom.Node;
148 * @param pos Node in the tree where to start traversal
152 public void traverse(Node pos) throws org.xml.sax.SAXException
167 * @param pos Node in the tree where to start traversal
171 public void traverseFragment(Node pos) throws org.xml.sax.SAXException
173 Node top = pos;
179 Node nextNode = pos.getFirstChild();
218 * @param pos Node in the tree where to start traversal
219 * @param top Node in the tree where to end traversal
223 public void traverse(Node po
[all...]
/external/tensorflow/tensorflow/core/kernels/
H A Dsdca_ops_test.cc52 Node* Var(Graph* const g, const int n) {
57 std::vector<Node*> VarVector(Graph* const g, const int nodes,
59 std::vector<Node*> result;
67 Node* Zeros(Graph* const g, const TensorShape& shape) {
73 Node* Zeros(Graph* const g, const int n) { return Zeros(g, TensorShape({n})); }
75 Node* Ones(Graph* const g, const int n) {
81 Node* SparseIndices(Graph* const g, const int sparse_features_per_group) {
87 Node* SparseExampleIndices(Graph* const g, const int sparse_features_per_group,
95 Node* SparseFeatureIndices(Graph* const g, const int sparse_features_per_group,
104 Node* RandomZeroOrOn
[all...]
/external/v8/src/compiler/
H A Dbranch-elimination.cc28 Reduction BranchElimination::Reduce(Node* node) {
57 Reduction BranchElimination::ReduceBranch(Node* node) {
58 Node* condition = node->InputAt(0);
59 Node* control_input = NodeProperties::GetControlInput(node, 0);
66 for (Node* const use : node->uses()) {
84 Reduction BranchElimination::ReduceDeoptimizeConditional(Node* node) {
89 Node* condition = NodeProperties::GetValueInput(node, 0);
90 Node* frame_state = NodeProperties::GetValueInput(node, 1);
91 Node* effect = NodeProperties::GetEffectInput(node);
92 Node* contro
[all...]
H A Dschedule.h21 class Node;
25 typedef ZoneVector<Node*> NodeVector;
81 typedef Node* value_type;
84 Node* NodeAt(size_t index) { return nodes_[index]; }
102 void AddNode(Node* node);
113 Node* control_input() const { return control_input_; }
114 void set_control_input(Node* control_input);
165 Node* control_input_; // Input value for control.
188 BasicBlock* block(Node* node) const;
190 bool IsScheduled(Node* nod
[all...]
H A Dinstruction-selector-impl.h40 InstructionOperand DefineAsRegister(Node* node) {
46 InstructionOperand DefineSameAsFirst(Node* node) {
52 InstructionOperand DefineAsFixed(Node* node, Register reg) {
58 InstructionOperand DefineAsFixed(Node* node, FPRegType reg) {
64 InstructionOperand DefineAsConstant(Node* node) {
68 InstructionOperand DefineAsConstant(Node* node, Constant constant) {
75 InstructionOperand DefineAsLocation(Node* node, LinkageLocation location) {
79 InstructionOperand DefineAsDualLocation(Node* node,
87 InstructionOperand Use(Node* node) {
93 InstructionOperand UseAnyAtEnd(Node* nod
[all...]
H A Dtyped-optimization.cc32 Reduction TypedOptimization::Reduce(Node* node) {
48 Node* replacement =
53 Node* replacement = jsgraph()->Constant(factory()->minus_zero_value());
57 Node* replacement = jsgraph()->NaNConstant();
61 Node* replacement = jsgraph()->NullConstant();
66 Node* replacement = jsgraph()->Constant(upper->Min());
70 Node* replacement = jsgraph()->UndefinedConstant();
117 Reduction TypedOptimization::ReduceCheckHeapObject(Node* node) {
118 Node* const input = NodeProperties::GetValueInput(node, 0);
127 Reduction TypedOptimization::ReduceCheckMaps(Node* nod
[all...]
H A Djs-native-context-specialization.cc78 Reduction JSNativeContextSpecialization::Reduce(Node* node) {
112 Reduction JSNativeContextSpecialization::ReduceJSAdd(Node* node) {
128 Node* value = jsgraph()->HeapConstant(result);
137 Node* node) {
139 Node* constructor = NodeProperties::GetValueInput(node, 0);
155 Node* value = jsgraph()->Constant(function_prototype);
171 Reduction JSNativeContextSpecialization::ReduceJSInstanceOf(Node* node) {
173 Node* object = NodeProperties::GetValueInput(node, 0);
174 Node* constructor = NodeProperties::GetValueInput(node, 1);
175 Node* contex
[all...]
H A Ddead-code-elimination.cc25 Reduction DeadCodeElimination::Reduce(Node* node) {
42 Reduction DeadCodeElimination::ReduceEnd(Node* node) {
44 Node::Inputs inputs = node->inputs();
48 Node* const input = inputs[i];
67 Reduction DeadCodeElimination::ReduceLoopOrMerge(Node* node) {
69 Node::Inputs inputs = node->inputs();
79 Node* const input = inputs[i];
85 for (Node* const use : node->uses()) {
99 for (Node* const use : node->uses()) {
117 for (Node* cons
[all...]
H A Djs-typed-lowering.cc31 JSBinopReduction(JSTypedLowering* lowering, Node* node)
119 Node* left_input = graph()->NewNode(simplified()->CheckReceiver(), left(),
133 Node* right_input = graph()->NewNode(simplified()->CheckReceiver(),
145 Node* left_input = graph()->NewNode(simplified()->CheckString(), left(),
151 Node* right_input = graph()->NewNode(simplified()->CheckString(), right(),
163 Node* left_input = graph()->NewNode(
169 Node* right_input =
186 Node* left_input = nullptr;
187 Node* right_input = nullptr;
217 Node*
[all...]
H A Dcommon-node-cache.cc14 Node** CommonNodeCache::FindExternalConstant(ExternalReference value) {
19 Node** CommonNodeCache::FindHeapConstant(Handle<HeapObject> value) {
24 void CommonNodeCache::GetCachedNodes(ZoneVector<Node*>* nodes) {
H A Dcontrol-flow-optimizer.cc31 Node* node = queue_.front();
46 void ControlFlowOptimizer::Enqueue(Node* node) {
54 void ControlFlowOptimizer::VisitNode(Node* node) {
63 void ControlFlowOptimizer::VisitBranch(Node* node) {
70 bool ControlFlowOptimizer::TryBuildSwitch(Node* node) {
73 Node* branch = node;
75 Node* cond = NodeProperties::GetValueInput(branch, 0);
78 Node* index = m.left().node();
84 Node* if_false;
85 Node* if_tru
[all...]
H A Dgraph-trimmer.h33 Node* const node = *begin++;
40 V8_INLINE bool IsLive(Node* const node) { return is_live_.Get(node); }
41 V8_INLINE void MarkAsLive(Node* const node) {
/external/javaparser/javaparser-symbol-solver-core/src/main/java/com/github/javaparser/symbolsolver/javaparser/
H A DNavigator.java20 import com.github.javaparser.ast.Node;
43 * @deprecated use Node.getParentNode
46 public static Node getParentNode(Node node) {
50 public static Node requireParentNode(Node node) {
73 for (Node n : td.getMembers()) {
138 public static Optional<NameExpr> findNameExpression(Node node, String name) {
142 public static Optional<SimpleName> findSimpleName(Node node, String name) {
147 public static Optional<MethodCallExpr> findMethodCall(Node nod
[all...]
/external/clang/lib/AST/
H A DStmtViz.cpp35 static std::string getNodeLabel(const Stmt* Node, const Stmt* Graph) { argument
41 if (Node)
42 Out << Node->getStmtClassName();
/external/javaparser/javaparser-core/src/main/java/com/github/javaparser/printer/lexicalpreservation/changes/
H A DChange.java3 import com.github.javaparser.ast.Node;
9 * This represent a change happened to a specific Node.
13 default boolean evaluate(CsmConditional csmConditional, Node node) {
28 Object getValue(ObservableProperty property, Node node);
H A DListRemovalChange.java3 import com.github.javaparser.ast.Node;
20 public Object getValue(ObservableProperty property, Node node) {
22 NodeList<Node> nodeList = new NodeList<>();
/external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ast/nodeTypes/
H A DNodeWithThrowable.java5 import com.github.javaparser.ast.Node;
23 throwType.setParentNode((Node) this);
34 ((Node) this).tryAddImportToParentCompilationUnit(clazz);
/external/oj-libjdwp/make/src/classes/build/tools/jdwpgen/
H A DNode.java32 abstract class Node { class
35 List<Node> components;
38 Node parent = null;
46 void set(String kind, List<Node> components, int lineno) {
53 for (Iterator<Node> it = components.iterator(); it.hasNext();) {
54 Node node = it.next();
66 for (Node node : components) {
73 for (Node node : components) {
78 void constrainComponent(Context ctx, Node node) {
124 for (Node nod
[all...]
H A DRootNode.java33 void constrainComponent(Context ctx, Node node) {
45 for (Node node : components) {
48 for (Node node : components) {
/external/apache-xml/src/main/java/org/apache/xml/serializer/
H A DTreeWalker.java31 import org.w3c.dom.Node;
132 * @param pos Node in the tree where to start traversal
136 public void traverse(Node pos) throws org.xml.sax.SAXException
141 Node top = pos;
147 Node nextNode = pos.getFirstChild();
187 * @param pos Node in the tree where to start traversal
188 * @param top Node in the tree where to end traversal
192 public void traverse(Node pos, Node top) throws org.xml.sax.SAXException
201 Node nextNod
[all...]
/external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/
H A DPosition.java24 import com.github.javaparser.ast.Node;
35 public static final Position ABSOLUTE_START = new Position(Node.ABSOLUTE_BEGIN_LINE, -1);
36 public static final Position ABSOLUTE_END = new Position(Node.ABSOLUTE_END_LINE, -1);
45 if (line < Node.ABSOLUTE_END_LINE) {
90 if (position.line == Node.ABSOLUTE_BEGIN_LINE) return true;
102 if (position.line == Node.ABSOLUTE_END_LINE) return true;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
H A DANTLRNodeMapElement.h45 + (id) newANTLRNodeMapElementWithIndex:(id)anIndex Node:(id<ANTLRTree>)aNode;
47 - (id) initWithAnIndex:(id)anIndex Node:(id)aNode;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
H A DANTLRNodeMapElement.h45 + (id) newANTLRNodeMapElementWithIndex:(id)anIndex Node:(id<ANTLRTree>)aNode;
47 - (id) initWithAnIndex:(id)anIndex Node:(id)aNode;

Completed in 402 milliseconds

<<11121314151617181920>>