| /external/tensorflow/tensorflow/core/graph/ |
| algorithm.h | 29 using NodeComparator = std::function<bool(const Node*, const Node*)>;
33 // Compares two node based on their ids.
35 bool operator()(const Node* n1, const Node* n2) const {
42 bool operator()(const Node* n1, const Node* n2) const {
47 // Perform a depth-first-search on g starting at the source node.
51 // sorting a node's neighbors first before visiting them.
53 extern void DFS(const Graph& g, const std::function<void(Node*)>& enter
[all...] |
| testlib.cc | 35 Node* Send(Graph* g, Node* input, const string& tensor, const string& sender,
37 Node* ret;
49 Node* Recv(Graph* g, const string& tensor, const string& type,
52 Node* ret;
66 Node* Constant(Graph* g, const Tensor& tensor) {
67 Node* ret;
75 Node* Constant(Graph* g, const Tensor& tensor, const string& name) {
76 Node* ret;
84 Node* HostConstant(Graph* g, const Tensor& tensor)
[all...] |
| /external/v8/src/compiler/ |
| simplified-lowering.h | 10 #include "src/compiler/node.h"
34 void DoMax(Node* node, Operator const* op, MachineRepresentation rep);
35 void DoMin(Node* node, Operator const* op, MachineRepresentation rep);
37 Node* node, RepresentationSelector* selector);
38 void DoJSToNumberOrNumericTruncatesToWord32(Node* node,
40 void DoShift(Node* node, Operator const* op, Type rhs_type)
[all...] |
| int64-lowering.h | 11 #include "src/compiler/node-marker.h"
38 Node* low;
39 Node* high;
48 void PushNode(Node* node);
49 void LowerNode(Node* node);
50 bool DefaultLowering(Node* node, bool low_word_only = false);
51 void LowerComparison(Node* node, const Operator* signed_op
66 Node* node; member in struct:v8::internal::compiler::Int64Lowering::NodeState
[all...] |
| typed-optimization.h | 36 Reduction Reduce(Node* node) final;
39 Reduction ReduceConvertReceiver(Node* node);
40 Reduction ReduceCheckHeapObject(Node* node);
41 Reduction ReduceCheckMaps(Node* node);
42 Reduction ReduceCheckNumber(Node* node);
[all...] |
| dead-code-elimination.h | 23 // {Type::None()} with {DeadValue}. A pure node (other than a phi) using
25 // chain, a crashing {Unreachable} node is inserted and the rest of the effect
34 // value-producing node. {DeadValue} has the runtime semantics of crashing and
48 Reduction Reduce(Node* node) final;
51 Reduction ReduceEnd(Node* node);
52 Reduction ReduceLoopOrMerge(Node* node);
53 Reduction ReduceLoopExit(Node* node)
[all...] |
| simd-scalar-lowering.h | 12 #include "src/compiler/node-marker.h"
45 Node** node = nullptr; member in struct:v8::internal::compiler::SimdScalarLowering::Replacement
51 Node* node; member in struct:v8::internal::compiler::SimdScalarLowering::NodeState
61 void LowerNode(Node* node);
62 bool DefaultLowering(Node* node);
65 void ReplaceNode(Node* old, Node** new_nodes, int count)
[all...] |
| js-create-lowering.h | 48 Reduction Reduce(Node* node) final;
51 Reduction ReduceJSCreate(Node* node);
52 Reduction ReduceJSCreateArguments(Node* node);
53 Reduction ReduceJSCreateArray(Node* node);
54 Reduction ReduceJSCreateArrayIterator(Node* node);
[all...] |
| branch-elimination.h | 11 #include "src/compiler/node-aux-data.h"
30 Reduction Reduce(Node* node) final;
34 Node* condition;
35 Node* branch;
50 bool LookupCondition(Node* condition, Node** branch, bool* is_true) const;
51 void AddCondition(Zone* zone, Node* condition, Node* branch, bool is_true,
58 Reduction ReduceBranch(Node* node)
[all...] |
| /external/v8/src/builtins/ |
| builtins-regexp-gen.h | 18 void BranchIfFastRegExp(Node* const context, Node* const object,
19 Node* const map, Label* const if_isunmodified,
53 void FastStoreLastIndex(Node* regexp, Node* value);
54 void SlowStoreLastIndex(Node* context, Node* regexp, Node* value);
55 void StoreLastIndex(Node* context, Node* regexp, Node* value
[all...] |
| builtins-iterator-gen.h | 13 using compiler::Node;
21 TNode<Object> GetIteratorMethod(Node* context, Node* object);
25 IteratorRecord GetIterator(Node* context, Node* object,
28 IteratorRecord GetIterator(Node* context, Node* object, Node* method,
37 Node* IteratorStep(Node* context, const IteratorRecord& iterator
[all...] |
| /external/clang/test/CXX/expr/expr.post/expr.ref/ |
| p3.cpp | 4 template<typename T> struct Node {
8 Node<T> n[1];
14 Node<int> n;
|
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/validator/ |
| Validator.java | 3 import com.github.javaparser.ast.Node;
6 * A validator that can be run on a node to check for semantic errors.
9 public interface Validator extends TypedValidator<Node> {
11 * @param node the node that wants to be validated
14 void accept(Node node, ProblemReporter problemReporter);
|
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_src/proper_source/com/github/javaparser/ast/ |
| TreeVisitor.java | 26 public void visitDepthFirst(Node node){
27 process(node);
28 for (Node child : node.getChildrenNodes()){
33 public abstract void process(Node node);
|
| /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() {
|
| /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/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/observer/ |
| AstObserver.java | 24 import com.github.javaparser.ast.Node;
28 * An Observer for an AST element (either a Node or a NodeList).
48 void propertyChange(Node observedNode, ObservableProperty property, Object oldValue, Object newValue);
51 * The parent of a node is changed
53 * @param observedNode node of which the parent is changed
57 void parentChange(Node observedNode, Node previousParent, Node newParent);
67 void listChange(NodeList observedNode, ListChangeType type, int index, Node nodeAddedOrRemoved);
69 void listReplacement(NodeList observedNode, int index, Node oldNode, Node newNode)
[all...] |
| AstObserverAdapter.java | 24 import com.github.javaparser.ast.Node;
30 public void propertyChange(Node observedNode, ObservableProperty property, Object oldValue, Object newValue) {
35 public void parentChange(Node observedNode, Node previousParent, Node newParent) {
40 public void listChange(NodeList observedNode, ListChangeType type, int index, Node nodeAddedOrRemoved) {
45 public void listReplacement(NodeList observedNode, int index, Node oldNode, Node newNode) {
|
| /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/src/ic/ |
| accessor-assembler.h | 21 using Node = compiler::Node;
52 void TryProbeStubCache(StubCache* stub_cache, Node* receiver, Node* name,
56 Node* StubCachePrimaryOffsetForTesting(Node* name, Node* map) {
59 Node* StubCacheSecondaryOffsetForTesting(Node* name, Node* map)
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/ |
| IListNodeTest.cpp | 19 struct Node;
26 std::is_same<compute_node_options<Node>::type,
27 compute_node_options<Node, ilist_tag<void>>::type>::value,
30 !std::is_same<compute_node_options<Node, ilist_tag<TagA>>::type,
31 compute_node_options<Node, ilist_tag<void>>::type>::value,
34 !std::is_same<compute_node_options<Node, ilist_tag<TagA>>::type,
35 compute_node_options<Node, ilist_tag<TagB>>::type>::value,
39 compute_node_options<Node, ilist_sentinel_tracking<false>>::type,
40 compute_node_options<Node, ilist_sentinel_tracking<false>,
45 compute_node_options<Node, ilist_sentinel_tracking<false>>::type
[all...] |
| /external/clang/lib/AST/ |
| StmtPrinter.cpp | 96 void VisitStmt(Stmt *Node) LLVM_ATTRIBUTE_UNUSED {
99 void VisitExpr(Expr *Node) LLVM_ATTRIBUTE_UNUSED {
102 void VisitCXXNamedCastExpr(CXXNamedCastExpr *Node);
106 void Visit##CLASS(CLASS *Node);
117 void StmtPrinter::PrintRawCompoundStmt(CompoundStmt *Node) {
119 for (auto *I : Node->body())
134 void StmtPrinter::VisitNullStmt(NullStmt *Node) {
138 void StmtPrinter::VisitDeclStmt(DeclStmt *Node) {
140 PrintRawDeclStmt(Node);
144 void StmtPrinter::VisitCompoundStmt(CompoundStmt *Node) {
[all...] |
| /external/google-fruit/include/fruit/impl/data_structures/ |
| semistatic_graph.defn.h | 33 template <typename NodeId, typename Node>
34 inline SemistaticGraph<NodeId, Node>::node_iterator::node_iterator(NodeData* itr) : itr(itr) {}
36 template <typename NodeId, typename Node>
37 inline Node& SemistaticGraph<NodeId, Node>::node_iterator::getNode() {
39 return itr->node;
42 template <typename NodeId, typename Node>
43 inline bool SemistaticGraph<NodeId, Node>::node_iterator::isTerminal() {
48 template <typename NodeId, typename Node>
49 inline void SemistaticGraph<NodeId, Node>::node_iterator::setTerminal()
[all...] |
