| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/analysis/ |
| D | DepthFirstAdapter.java | 6 import com.google.clearsilver.jsilver.syntax.node.*; 10 public void inStart(Start node) in inStart() argument 12 defaultIn(node); in inStart() 15 public void outStart(Start node) in outStart() argument 17 defaultOut(node); in outStart() 20 public void defaultIn(@SuppressWarnings("unused") Node node) in defaultIn() argument 25 public void defaultOut(@SuppressWarnings("unused") Node node) in defaultOut() argument 31 public void caseStart(Start node) in caseStart() argument 33 inStart(node); in caseStart() 34 node.getPCommand().apply(this); in caseStart() [all …]
|
| D | ReversedDepthFirstAdapter.java | 6 import com.google.clearsilver.jsilver.syntax.node.*; 10 public void inStart(Start node) in inStart() argument 12 defaultIn(node); in inStart() 15 public void outStart(Start node) in outStart() argument 17 defaultOut(node); in outStart() 20 public void defaultIn(@SuppressWarnings("unused") Node node) in defaultIn() argument 25 public void defaultOut(@SuppressWarnings("unused") Node node) in defaultOut() argument 31 public void caseStart(Start node) in caseStart() argument 33 inStart(node); in caseStart() 34 node.getEOF().apply(this); in caseStart() [all …]
|
| D | AnalysisAdapter.java | 6 import com.google.clearsilver.jsilver.syntax.node.*; 10 private Hashtable<Node,Object> in; 11 private Hashtable<Node,Object> out; 13 public Object getIn(Node node) in getIn() argument 20 return this.in.get(node); in getIn() 23 public void setIn(Node node, Object o) in setIn() argument 27 this.in = new Hashtable<Node,Object>(1); in setIn() 32 this.in.put(node, o); in setIn() 36 this.in.remove(node); in setIn() 40 public Object getOut(Node node) in getOut() argument [all …]
|
| D | Analysis.java | 5 import com.google.clearsilver.jsilver.syntax.node.*; 9 Object getIn(Node node); in getIn() argument 10 void setIn(Node node, Object o); in setIn() argument 11 Object getOut(Node node); in getOut() argument 12 void setOut(Node node, Object o); in setOut() argument 14 void caseStart(Start node); in caseStart() argument 15 void caseAMultipleCommand(AMultipleCommand node); in caseAMultipleCommand() argument 16 void caseACommentCommand(ACommentCommand node); in caseACommentCommand() argument 17 void caseADataCommand(ADataCommand node); in caseADataCommand() argument 18 void caseAVarCommand(AVarCommand node); in caseAVarCommand() argument [all …]
|
| /external/tensorflow/tensorflow/core/grappler/ |
| D | op_types.cc | 30 bool IsAdd(const NodeDef& node) { in IsAdd() argument 31 if (node.op() == "AddV2") { in IsAdd() 34 if (node.op() == "Add") { in IsAdd() 35 DataType type = node.attr().at("T").type(); in IsAdd() 41 bool IsAddN(const NodeDef& node) { return node.op() == "AddN"; } in IsAddN() argument 43 bool IsAll(const NodeDef& node) { return node.op() == "All"; } in IsAll() argument 45 bool IsAngle(const NodeDef& node) { return node.op() == "Angle"; } in IsAngle() argument 47 bool IsAny(const NodeDef& node) { return node.op() == "Any"; } in IsAny() argument 49 bool IsAnyDiv(const NodeDef& node) { in IsAnyDiv() argument 50 return node.op() == "RealDiv" || node.op() == "Div" || node.op() == "Xdivy" || in IsAnyDiv() [all …]
|
| D | op_types.h | 25 bool IsAdd(const NodeDef& node); 26 bool IsAddN(const NodeDef& node); 27 bool IsAll(const NodeDef& node); 28 bool IsAngle(const NodeDef& node); 29 bool IsAny(const NodeDef& node); 30 bool IsAnyDiv(const NodeDef& node); 31 bool IsAnyBatchMatMul(const NodeDef& node); 32 bool IsAnyMatMul(const NodeDef& node); 33 bool IsAnyMax(const NodeDef& node); 34 bool IsAnyMaxPool(const NodeDef& node); [all …]
|
| /external/tensorflow/tensorflow/python/autograph/converters/ |
| D | return_statements.py | 66 def visit_Return(self, node): argument 68 return node 70 def _postprocess_statement(self, node): argument 71 # If the node definitely returns (e.g. it's a with statement with a 73 if anno.getanno(node, STMT_DEFINITELY_RETURNS, default=False): 80 if (isinstance(node, gast.If) 81 and anno.getanno(node, BODY_DEFINITELY_RETURNS, default=False)): 82 return node, node.orelse 83 elif (isinstance(node, gast.If) 84 and anno.getanno(node, ORELSE_DEFINITELY_RETURNS, default=False)): [all …]
|
| /external/ComputeLibrary/arm_compute/graph/backends/ |
| D | ValidateHelpers.h | 55 /** Validates a ArgMinMax layer node 59 * @param[in] node Node to validate 64 Status validate_arg_min_max_layer(ArgMinMaxLayerNode &node) in validate_arg_min_max_layer() argument 66 …UTE_LOG_GRAPH_VERBOSE("Validating ArgMinMaxLayer node with ID : " << node.id() << " and Name: " <<… in validate_arg_min_max_layer() 67 ARM_COMPUTE_RETURN_ERROR_ON(node.num_inputs() != 1); in validate_arg_min_max_layer() 68 ARM_COMPUTE_RETURN_ERROR_ON(node.num_outputs() != 1); in validate_arg_min_max_layer() 71 arm_compute::ITensorInfo *input = detail::get_backing_tensor_info(node.input(0)); in validate_arg_min_max_layer() 72 arm_compute::ITensorInfo *output = get_backing_tensor_info(node.output(0)); in validate_arg_min_max_layer() 75 return ArgMinMaxLayer::validate(input, node.axis(), output, node.reduction_operation()); in validate_arg_min_max_layer() 78 /** Validates a Bounding Box Transform layer node [all …]
|
| /external/tensorflow/tensorflow/core/graph/ |
| D | testlib.h | 40 // Adds a node in "g" producing a constant "tensor". 41 Node* Constant(Graph* g, const Tensor& tensor); 42 Node* Constant(Graph* g, const Tensor& tensor, const string& name); 44 // Adds a node in "g" producing a constant "tensor" on the host. 45 // The given node which, unlike the regular Constant above, always 49 Node* HostConstant(Graph* g, const Tensor& tensor); 50 Node* HostConstant(Graph* g, const Tensor& tensor, const string& name); 53 Node* Var(Graph* g, const DataType dtype, const TensorShape& shape); 54 Node* Var(Graph* g, const DataType dtype, const TensorShape& shape, 57 // Adds an assign node in "g" which assigns "val" into "var". [all …]
|
| /external/cronet/buildtools/third_party/libc++abi/trunk/src/demangle/ |
| D | ItaniumNodes.def | 9 // Define the demangler's node names 11 #ifndef NODE 12 #error Define NODE to handle nodes 15 NODE(NodeArrayNode) 16 NODE(DotSuffix) 17 NODE(VendorExtQualType) 18 NODE(QualType) 19 NODE(ConversionOperatorType) 20 NODE(PostfixQualifiedType) 21 NODE(ElaboratedTypeSpefType) [all …]
|
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javasymbolsolver_0_6_0/src/java-symbol-solver-core/com/github/javaparser/symbolsolver/javaparsermodel/ |
| D | DefaultVisitorAdapter.java | 17 public Type visit(CompilationUnit node, Boolean aBoolean) { in visit() argument 18 throw new UnsupportedOperationException(node.getClass().getCanonicalName()); in visit() 22 public Type visit(PackageDeclaration node, Boolean aBoolean) { in visit() argument 23 throw new UnsupportedOperationException(node.getClass().getCanonicalName()); in visit() 27 public Type visit(TypeParameter node, Boolean aBoolean) { in visit() argument 28 throw new UnsupportedOperationException(node.getClass().getCanonicalName()); in visit() 32 public Type visit(LineComment node, Boolean aBoolean) { in visit() argument 33 throw new UnsupportedOperationException(node.getClass().getCanonicalName()); in visit() 37 public Type visit(BlockComment node, Boolean aBoolean) { in visit() argument 38 throw new UnsupportedOperationException(node.getClass().getCanonicalName()); in visit() [all …]
|
| /external/apache-velocity-engine/velocity-engine-core/src/main/java/org/apache/velocity/runtime/parser/node/ |
| D | ParserVisitor.java | 1 package org.apache.velocity.runtime.parser.node; 33 * @param node 35 * @return The object rendered by this node. 37 Object visit(SimpleNode node, Object data); in visit() argument 40 * @param node 42 * @return The object rendered by this node. 45 Object visit(ASTprocess node, Object data); in visit() argument 48 * @param node 50 * @return The object rendered by this node. 52 Object visit(ASTText node, Object data); in visit() argument [all …]
|
| /external/javaparser/javaparser-symbol-solver-core/src/main/java/com/github/javaparser/symbolsolver/javaparsermodel/ |
| D | DefaultVisitorAdapter.java | 17 public ResolvedType visit(CompilationUnit node, Boolean aBoolean) { in visit() argument 18 throw new UnsupportedOperationException(node.getClass().getCanonicalName()); in visit() 22 public ResolvedType visit(PackageDeclaration node, Boolean aBoolean) { in visit() argument 23 throw new UnsupportedOperationException(node.getClass().getCanonicalName()); in visit() 27 public ResolvedType visit(TypeParameter node, Boolean aBoolean) { in visit() argument 28 throw new UnsupportedOperationException(node.getClass().getCanonicalName()); in visit() 32 public ResolvedType visit(LineComment node, Boolean aBoolean) { in visit() argument 33 throw new UnsupportedOperationException(node.getClass().getCanonicalName()); in visit() 37 public ResolvedType visit(BlockComment node, Boolean aBoolean) { in visit() argument 38 throw new UnsupportedOperationException(node.getClass().getCanonicalName()); in visit() [all …]
|
| /external/python/cpython3/Lib/ |
| D | ast.py | 36 Parse the source into an AST node. 56 Safely evaluate an expression node or a string containing a Python 57 expression. The string or node provided may only consist of the following 65 def _raise_malformed_node(node): argument 66 msg = "malformed node or string" 67 if lno := getattr(node, 'lineno', None): 69 raise ValueError(msg + f': {node!r}') 70 def _convert_num(node): argument 71 if not isinstance(node, Constant) or type(node.value) not in (int, float, complex): 72 _raise_malformed_node(node) [all …]
|
| /external/tensorflow/tensorflow/python/autograph/pyct/static_analysis/ |
| D | activity.py | 75 params: WeakValueDictionary[qual_names.QN, ast.Node], function arguments 76 visible in this scope, mapped to the function node that defines them. 205 # a weak reference to mark the connection between a symbol node and the 206 # function node whose argument that symbol is. 223 self.node = None 232 the node. This class will ignore nodes have not been 251 innermost = context.stack[-1].node 252 parent = context.stack[-2].node 258 def _node_sets_self_attribute(self, node): argument 259 if anno.hasanno(node, anno.Basic.QN): [all …]
|
| /external/tensorflow/tensorflow/python/autograph/pyct/ |
| D | cfg.py | 18 node is associated with exactly one AST node, but not all AST nodes may have 49 class Node(object): class 50 """A node in the CFG. 57 holds for all nodes: "child in node.next" iff "node in child.prev". 60 next: FrozenSet[Node, ...], the nodes that follow this node, in control flow 62 prev: FrozenSet[Node, ...], the nodes that precede this node, in reverse 64 ast_node: ast.AST, the AST node corresponding to this CFG node 96 The CFG maintains an index to allow looking up a CFG node by the AST node to 108 like for-else loops. A node is considered successor of a statement if there 109 is an edge from a node that is lexically a child of that statement to a node [all …]
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| D | generic_layout_optimizer_transposer.cc | 73 inline bool AttrDataFormatMatch(const utils::MutableNodeView& node, in AttrDataFormatMatch() argument 76 const auto* attr = node.GetAttr(kAttrDataFormat); in AttrDataFormatMatch() 84 inline bool AttrDataFormatMatch(const utils::MutableNodeView& node, in AttrDataFormatMatch() argument 87 return AttrDataFormatMatch(node, src_data_format, &missing); in AttrDataFormatMatch() 90 bool IsNonFloatingConv2D(const utils::MutableNodeView& node) { in IsNonFloatingConv2D() argument 91 if (IsConv2D(*node.node()) || IsConv2DBackpropInput(*node.node())) { in IsNonFloatingConv2D() 92 const auto* attr = node.GetAttr(kAttrT); in IsNonFloatingConv2D() 102 bool IsComparisonOp(const NodeDef& node) { in IsComparisonOp() argument 103 bool is_compare = IsApproximateEqual(node) || IsEqual(node) || in IsComparisonOp() 104 IsGreater(node) || IsGreaterEqual(node) || IsLess(node) || in IsComparisonOp() [all …]
|
| /external/ComputeLibrary/arm_compute/graph/ |
| D | GraphBuilder.h | 45 /** Adds a Const node to the graph 47 * @param[in] g Graph to add the node to 48 * @param[in] params Common node parameters 49 * @param[in] desc Tensor descriptor of the node 50 * @param[in] accessor (Optional) Accessor of the const node data 52 * @return Node ID of the created node, EmptyNodeID in case of error 55 /** Adds an input layer node to the graph 57 * @param[in] g Graph to add the node to 58 * @param[in] params Common node parameters 60 * @param[in] accessor (Optional) Accessor of the input node data [all …]
|
| /external/yapf/yapf/yapflib/ |
| D | split_penalty.py | 60 tree: the top-level pytree node to annotate with penalties. 71 def Visit(self, node): argument 72 if not hasattr(node, 'is_pseudo'): # Ignore pseudo tokens. 73 super(_SplitPenaltyAssigner, self).Visit(node) 75 def Visit_import_as_names(self, node): # pyline: disable=invalid-name argument 77 self.DefaultNodeVisit(node) 79 for child in node.children: 85 def Visit_classdef(self, node): # pylint: disable=invalid-name argument 89 _SetUnbreakable(node.children[1]) 90 if len(node.children) > 4: [all …]
|
| /external/apache-velocity-engine/velocity-engine-core/src/main/java/org/apache/velocity/runtime/visitor/ |
| D | BaseVisitor.java | 23 import org.apache.velocity.runtime.parser.node.*; 29 * For each AST node, this class will provide 61 …* @see org.apache.velocity.runtime.parser.node.ParserVisitor#visit(org.apache.velocity.runtime.par… 64 public Object visit(SimpleNode node, Object data) in visit() argument 66 data = node.childrenAccept(this, data); in visit() 71 …* @see org.apache.velocity.runtime.parser.node.ParserVisitor#visit(org.apache.velocity.runtime.par… 74 public Object visit(ASTprocess node, Object data) in visit() argument 76 data = node.childrenAccept(this, data); in visit() 81 …* @see org.apache.velocity.runtime.parser.node.ParserVisitor#visit(org.apache.velocity.runtime.par… 84 public Object visit(ASTExpression node, Object data) in visit() argument [all …]
|
| /external/clang/lib/AST/ |
| D | StmtPrinter.cpp | 96 void VisitStmt(Stmt *Node) LLVM_ATTRIBUTE_UNUSED { in VisitStmt() argument 99 void VisitExpr(Expr *Node) LLVM_ATTRIBUTE_UNUSED { in VisitExpr() argument 102 void VisitCXXNamedCastExpr(CXXNamedCastExpr *Node); 106 void Visit##CLASS(CLASS *Node); 117 void StmtPrinter::PrintRawCompoundStmt(CompoundStmt *Node) { in PrintRawCompoundStmt() argument 119 for (auto *I : Node->body()) in PrintRawCompoundStmt() 134 void StmtPrinter::VisitNullStmt(NullStmt *Node) { in VisitNullStmt() argument 138 void StmtPrinter::VisitDeclStmt(DeclStmt *Node) { in VisitDeclStmt() argument 140 PrintRawDeclStmt(Node); in VisitDeclStmt() 144 void StmtPrinter::VisitCompoundStmt(CompoundStmt *Node) { in VisitCompoundStmt() argument [all …]
|
| /external/python/cpython2/Lib/compiler/ |
| D | pycodegen.py | 150 def visitDict(self, node): argument 153 def visitGlobal(self, node): argument 154 for name in node.names: 157 def visitFunction(self, node): argument 158 self.names.add(node.name) 160 def visitLambda(self, node): argument 163 def visitImport(self, node): argument 164 for name, alias in node.names: 167 def visitFrom(self, node): argument 168 for name, alias in node.names: [all …]
|
| /external/dtc/ |
| D | livetree.c | 88 struct node *build_node(struct property *proplist, struct node *children, in build_node() 91 struct node *new = xmalloc(sizeof(*new)); in build_node() 92 struct node *child; in build_node() 107 struct node *build_node_delete(struct srcpos *srcpos) in build_node_delete() 109 struct node *new = xmalloc(sizeof(*new)); in build_node_delete() 119 struct node *name_node(struct node *node, char *name) in name_node() argument 121 assert(node->name == NULL); in name_node() 123 node->name = name; in name_node() 125 return node; in name_node() 128 struct node *omit_node_if_unused(struct node *node) in omit_node_if_unused() argument [all …]
|
| /external/tensorflow/tensorflow/python/autograph/pyct/common_transformers/ |
| D | anf.py | 60 - The type of the parent node, checked with isinstance, 62 - The type of the child node, also checked with isinstance. 87 # The algorithm is a postorder recursive tree walk. Any given node A may, in 99 # `test` can be prepended to the `if` node, but assignments produced by 157 def _do_transform_node(self, node): argument 160 'temp_name = expr', temp_name=temp_name, expr=node)[0] 165 def _ensure_node_in_anf(self, parent, field, node): argument 166 """Puts `node` in A-normal form, by replacing it with a variable if needed. 173 parent: An AST node, the parent of `node`. 174 field: The field name under which `node` is the child of `parent`. [all …]
|
| /external/one-true-awk/ |
| D | proto.h | 27 extern int constnode(Node *); 28 extern char *strnode(Node *); 29 extern Node *notnull(Node *); 44 extern void penter(Node *); 45 extern void freetr(Node *); 50 extern void cfoll(fa *, Node *); 51 extern int first(Node *); 52 extern void follow(Node *); 58 extern Node *reparse(const char *); 59 extern Node *regexp(void); [all …]
|