| /third_party/typescript/src/compiler/factory/ |
| D | nodeFactory.ts | 13 // Do not set an `original` pointer when updating a node. enumerator
595 const node = createBaseNode(kind); constant
610 const node = createBaseDeclaration(kind); constant
649 const node = createBaseNamedDeclaration( constant
668 const node = createBaseGenericNamedDeclaration( constant
703 const node = createBaseSignatureDeclaration( constant
724 const node = createBaseGenericNamedDeclaration( constant
743 const node = createBaseInterfaceOrClassLikeDeclaration( constant
761 const node = createBaseNamedDeclaration( constant
778 const node = createBaseBindingLikeDeclaration( constant
[all …]
|
| /third_party/mindspore/mindspore-src/source/mindspore/ccsrc/minddata/dataset/engine/opt/ |
| D | pass.cc | 126 Status IRNodePass::Visit(std::shared_ptr<BatchNode> node, bool *const modified) { in Visit()
129 Status IRNodePass::VisitAfter(std::shared_ptr<BatchNode> node, bool *const modified) { in VisitAfter()
132 Status IRNodePass::Visit(std::shared_ptr<BucketBatchByLengthNode> node, bool *const modified) { in Visit()
135 Status IRNodePass::VisitAfter(std::shared_ptr<BucketBatchByLengthNode> node, bool *const modified) { in VisitAfter()
138 Status IRNodePass::Visit(std::shared_ptr<BuildVocabNode> node, bool *const modified) { in Visit()
141 Status IRNodePass::VisitAfter(std::shared_ptr<BuildVocabNode> node, bool *const modified) { in VisitAfter()
144 Status IRNodePass::Visit(std::shared_ptr<ConcatNode> node, bool *const modified) { in Visit()
147 Status IRNodePass::VisitAfter(std::shared_ptr<ConcatNode> node, bool *const modified) { in VisitAfter()
151 Status IRNodePass::Visit(std::shared_ptr<CacheLookupNode> node, bool *const modified) { in Visit()
154 Status IRNodePass::VisitAfter(std::shared_ptr<CacheLookupNode> node, bool *const modified) { in VisitAfter()
[all …]
|
| /third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_util/ |
| D | IntermRebuild.cpp | 49 TIntermRebuild::BaseResult::BaseResult(TIntermNode &node, VisitBits visit) in BaseResult()
53 TIntermRebuild::BaseResult::BaseResult(TIntermNode *node, VisitBits visit) in BaseResult()
117 PreResult::PreResult(TIntermNode &node, VisitBits visit) : BaseResult(node, visit) {} in PreResult()
118 PreResult::PreResult(TIntermNode *node, VisitBits visit) : BaseResult(node, visit) {} in PreResult()
134 PostResult::PostResult(TIntermNode &node) : BaseResult(node, VisitBits::Neither) {} in PostResult()
135 PostResult::PostResult(TIntermNode *node) : BaseResult(node, VisitBits::Neither) {} in PostResult()
191 bool TIntermRebuild::rebuildInPlace(TIntermAggregate &node) in rebuildInPlace()
196 bool TIntermRebuild::rebuildInPlace(TIntermBlock &node) in rebuildInPlace()
201 bool TIntermRebuild::rebuildInPlace(TIntermDeclaration &node) in rebuildInPlace()
207 bool TIntermRebuild::rebuildInPlaceImpl(Node &node) in rebuildInPlaceImpl()
[all …]
|
| D | IntermNodePatternMatcher.cpp | 27 TIntermTyped *node = sequence[ii]->getAsTyped(); in ContainsMatrixNode() local
38 TIntermTyped *node = sequence[ii]->getAsTyped(); in ContainsVectorNode() local
50 bool IntermNodePatternMatcher::IsDynamicIndexingOfNonSSBOVectorOrMatrix(TIntermBinary *node) in IsDynamicIndexingOfNonSSBOVectorOrMatrix()
56 bool IntermNodePatternMatcher::IsDynamicIndexingOfVectorOrMatrix(TIntermBinary *node) in IsDynamicIndexingOfVectorOrMatrix()
63 bool IntermNodePatternMatcher::IsDynamicIndexingOfSwizzledVector(TIntermBinary *node) in IsDynamicIndexingOfSwizzledVector()
68 bool IntermNodePatternMatcher::matchInternal(TIntermBinary *node, TIntermNode *parentNode) const in matchInternal()
102 bool IntermNodePatternMatcher::match(TIntermBinary *node, TIntermNode *parentNode) const in match()
111 bool IntermNodePatternMatcher::match(TIntermBinary *node, in match()
129 bool IntermNodePatternMatcher::match(TIntermAggregate *node, TIntermNode *parentNode) const in match()
|
| /third_party/python/Lib/ |
| D | ast.py | 67 def _raise_malformed_node(node): argument
72 def _convert_num(node): argument
76 def _convert_signed_num(node): argument
84 def _convert(node): argument
113 def dump(node, annotate_fields=True, include_attributes=False, *, indent=None): argument
125 def _format(node, level=0): argument
197 def fix_missing_locations(node): argument
205 def _fix(node, lineno, col_offset, end_lineno, end_col_offset): argument
232 def increment_lineno(node, n=1): argument
255 def iter_fields(node): argument
[all …]
|
| /third_party/selinux/libsepol/cil/src/ |
| D | cil_tree.c | 44 struct cil_tree_node *cil_tree_get_next_path(struct cil_tree_node *node, char **info_kind, uint32_t… in cil_tree_get_next_path()
97 char *cil_tree_get_cil_path(struct cil_tree_node *node) in cil_tree_get_cil_path()
113 __attribute__((format (printf, 3, 4))) void cil_tree_log(struct cil_tree_node *node, enum cil_log_l… in cil_tree_log()
152 int cil_tree_subtree_has_decl(struct cil_tree_node *node) in cil_tree_subtree_has_decl()
190 void cil_tree_subtree_destroy(struct cil_tree_node *node) in cil_tree_subtree_destroy()
196 void cil_tree_children_destroy(struct cil_tree_node *node) in cil_tree_children_destroy()
215 void cil_tree_node_init(struct cil_tree_node **node) in cil_tree_node_init()
230 void cil_tree_node_destroy(struct cil_tree_node **node) in cil_tree_node_destroy()
267 static int cil_tree_walk_core(struct cil_tree_node *node, in cil_tree_walk_core()
268 int (*process_node)(struct cil_tree_node *node, uint32_t *finished, void *extra_args), in cil_tree_walk_core()
[all …]
|
| /third_party/mindspore/mindspore-src/source/mindspore/ccsrc/minddata/dataset/engine/opt/post/ |
| D | repeat_pass.cc | 35 Status RepeatPass::Visit(std::shared_ptr<RepeatNode> node, bool *const modified) { in Visit()
60 Status RepeatPass::Visit(std::shared_ptr<EpochCtrlNode> node, bool *const modified) { in Visit()
75 Status RepeatPass::Visit(std::shared_ptr<CacheMergeNode> node, bool *const modified) { in Visit()
84 Status RepeatPass::Visit(std::shared_ptr<CacheNode> node, bool *const modified) { in Visit()
94 Status RepeatPass::VisitAfter(std::shared_ptr<RepeatNode> node, bool *const modified) { in VisitAfter()
122 Status RepeatPass::VisitAfter(std::shared_ptr<EpochCtrlNode> node, bool *const modified) { in VisitAfter()
135 Status RepeatPass::VisitAfter(std::shared_ptr<DatasetNode> node, bool *const modified) { in VisitAfter()
150 Status RepeatPass::VisitAfter(std::shared_ptr<CacheNode> node, bool *const modified) { in VisitAfter()
173 Status RepeatPass::VisitAfter(std::shared_ptr<CacheMergeNode> node, bool *const modified) { in VisitAfter()
190 Status RepeatPass::VisitAfter(std::shared_ptr<CacheLookupNode> node, bool *const modified) { in VisitAfter()
[all …]
|
| /third_party/PyYAML/lib/yaml/ |
| D | constructor.py | 54 def construct_document(self, node): argument
67 def construct_object(self, node, deep=False): argument
117 def construct_scalar(self, node): argument
124 def construct_sequence(self, node, deep=False): argument
132 def construct_mapping(self, node, deep=False): argument
147 def construct_pairs(self, node, deep=False): argument
173 def construct_scalar(self, node): argument
180 def flatten_mapping(self, node): argument
215 def construct_mapping(self, node, deep=False): argument
220 def construct_yaml_null(self, node): argument
[all …]
|
| /third_party/mindspore/mindspore-src/source/mindspore/ccsrc/minddata/dataset/engine/opt/pre/ |
| D | cache_validation_pass.cc | 37 Status CacheValidationPass::Visit(std::shared_ptr<BatchNode> node, bool *const modified) { in Visit()
49 Status CacheValidationPass::Visit(std::shared_ptr<ConcatNode> node, bool *const modified) { in Visit()
61 Status CacheValidationPass::Visit(std::shared_ptr<FilterNode> node, bool *const modified) { in Visit()
73 Status CacheValidationPass::Visit(std::shared_ptr<SkipNode> node, bool *const modified) { in Visit()
85 Status CacheValidationPass::Visit(std::shared_ptr<TakeNode> node, bool *const modified) { in Visit()
97 Status CacheValidationPass::Visit(std::shared_ptr<ZipNode> node, bool *const modified) { in Visit()
109 Status CacheValidationPass::Visit(std::shared_ptr<MapNode> node, bool *const modified) { in Visit()
136 Status CacheValidationPass::Visit(std::shared_ptr<DatasetNode> node, bool *const modified) { in Visit()
153 Status CacheValidationPass::VisitAfter(std::shared_ptr<RepeatNode> node, bool *const modified) { in VisitAfter()
161 Status CacheValidationPass::VisitAfter(std::shared_ptr<TFRecordNode> node, bool *const modified) { in VisitAfter()
[all …]
|
| D | skip_pushdown_pass.cc | 38 Status SkipPushdownPass::SkipNodes::Visit(std::shared_ptr<SkipNode> node, bool *const modified) { in Visit()
47 Status SkipPushdownPass::SkipNodes::VisitAfter(std::shared_ptr<SkipNode> node, bool *const modified… in VisitAfter()
55 Status SkipPushdownPass::SkipNodes::Visit(std::shared_ptr<BatchNode> node, bool *const modified) { in Visit()
72 Status SkipPushdownPass::SkipNodes::Visit(std::shared_ptr<ProjectNode> node, bool *const modified) { in Visit()
77 Status SkipPushdownPass::SkipNodes::Visit(std::shared_ptr<RenameNode> node, bool *const modified) { in Visit()
82 Status SkipPushdownPass::SkipNodes::Visit(std::shared_ptr<MappableSourceNode> node, bool *const mod… in Visit()
101 Status SkipPushdownPass::SkipNodes::Visit(std::shared_ptr<MapNode> node, bool *const modified) { in Visit()
113 Status SkipPushdownPass::SkipNodes::Visit(std::shared_ptr<NonMappableSourceNode> node, bool *const … in Visit()
119 Status SkipPushdownPass::SkipNodes::Visit(std::shared_ptr<GeneratorNode> node, bool *const modified… in Visit()
130 Status SkipPushdownPass::SkipNodes::Visit(std::shared_ptr<DatasetNode> node, bool *const modified) { in Visit()
[all …]
|
| /third_party/skia/third_party/externals/angle2/src/compiler/translator/ |
| D | OutputTree.cpp | 67 void OutputTreeText(TInfoSinkBase &out, TIntermNode *node, const int depth) in OutputTreeText()
86 void TOutputTraverser::visitSymbol(TIntermSymbol *node) in visitSymbol()
103 bool TOutputTraverser::visitSwizzle(Visit visit, TIntermSwizzle *node) in visitSwizzle()
115 bool TOutputTraverser::visitBinary(Visit visit, TIntermBinary *node) in visitBinary()
301 bool TOutputTraverser::visitUnary(Visit visit, TIntermUnary *node) in visitUnary()
364 bool TOutputTraverser::visitFunctionDefinition(Visit visit, TIntermFunctionDefinition *node) in visitFunctionDefinition()
372 TIntermGlobalQualifierDeclaration *node) in visitGlobalQualifierDeclaration()
386 void TOutputTraverser::visitFunctionPrototype(TIntermFunctionPrototype *node) in visitFunctionPrototype()
401 bool TOutputTraverser::visitAggregate(Visit visit, TIntermAggregate *node) in visitAggregate()
479 bool TOutputTraverser::visitBlock(Visit visit, TIntermBlock *node) in visitBlock()
[all …]
|
| /third_party/mindspore/mindspore-src/source/mindspore/lite/tools/graph_kernel/converter/ |
| D | callback_impl.cc | 32 ShapeVector CallbackImpl::GetInputShape(const AnfNodePtr &node, size_t i) { return GetInputInferSha… in GetInputShape()
34 ShapeVector CallbackImpl::GetOutputShape(const AnfNodePtr &node, size_t i) { return GetOutputInferS… in GetOutputShape()
36 ShapeVector CallbackImpl::GetInputInferShape(const AnfNodePtr &node, size_t i) { in GetInputInferShape()
41 ShapeVector CallbackImpl::GetOutputInferShape(const AnfNodePtr &node, size_t i) { in GetOutputInferShape()
74 TypeId CallbackImpl::GetInputType(const AnfNodePtr &node, size_t i) { return GetInputInferType(node… in GetInputType()
76 TypeId CallbackImpl::GetOutputType(const AnfNodePtr &node, size_t i) { return GetOutputInferType(no… in GetOutputType()
78 TypeId CallbackImpl::GetInputInferType(const AnfNodePtr &node, size_t i) { in GetInputInferType()
83 TypeId CallbackImpl::GetOutputInferType(const AnfNodePtr &node, size_t i) { in GetOutputInferType()
109 std::string CallbackImpl::GetInputFormat(const AnfNodePtr &node, size_t i) { in GetInputFormat()
116 std::string CallbackImpl::GetOutputFormat(const AnfNodePtr &node, size_t i) { in GetOutputFormat()
[all …]
|
| /third_party/mindspore/mindspore-src/source/mindspore/ccsrc/pipeline/jit/pi/graph_compiler/cg/ |
| D | byte_code_generator.cc | 73 void ByteCodeGenerator::Visit_(const ir::ParameterPtr &node) { in Visit_()
124 void ByteCodeGenerator::Visit_(const ir::NaryOperationPtr &node) { in Visit_()
131 void ByteCodeGenerator::Visit_(const ir::DeleteNodePtr &node) { in Visit_()
143 void ByteCodeGenerator::Visit_(const ir::FormatNodePtr &node) { in Visit_()
150 void ByteCodeGenerator::Visit_(const ir::IsNodePtr &node) { in Visit_()
158 void ByteCodeGenerator::Visit_(const ir::ContainsNodePtr &node) { in Visit_()
166 void ByteCodeGenerator::Visit_(const ir::StoreNodePtr &node) { in Visit_()
183 void ByteCodeGenerator::Visit_(const ir::JumpNodePtr &node) { in Visit_()
195 void ByteCodeGenerator::Visit_(const ir::CompareNodePtr &node) { in Visit_()
203 void ByteCodeGenerator::Visit_(const ir::UpdateNodePtr &node) { in Visit_()
[all …]
|
| /third_party/skia/third_party/externals/jinja2/ |
| D | compiler.py | 67 def new_func(self, node, frame, **kwargs): argument
79 node, environment, name, filename, stream=None, defer_init=False, optimized=True argument
127 def __init__(self, node): argument
206 def visit_Filter(self, node): argument
210 def visit_Test(self, node): argument
214 def visit_Block(self, node): argument
228 def visit_Name(self, node): argument
236 def visit_Block(self, node): argument
356 def start_write(self, frame, node=None): argument
368 def simple_write(self, s, frame, node=None): argument
[all …]
|
| D | idtracking.py | 18 def symbols_for_node(node, parent_symbols=None): argument
37 def analyze_node(self, node, **kwargs): argument
155 def _simple_visit(self, node, **kwargs): argument
167 def visit_AssignBlock(self, node, **kwargs): argument
171 def visit_CallBlock(self, node, **kwargs): argument
175 def visit_OverlayScope(self, node, **kwargs): argument
179 def visit_For(self, node, for_branch="body", **kwargs): argument
195 def visit_With(self, node, **kwargs): argument
201 def generic_visit(self, node, *args, **kwargs): argument
213 def visit_Name(self, node, store_as_param=False, **kwargs): argument
[all …]
|
| /third_party/mindspore/mindspore-src/source/mindspore/lite/tools/converter/parser/tf/ |
| D | functionalize_control_op_pass.h | 39 static bool IsMerge(const AnfNodePtr &node) { return CheckPrimitiveType(node, prim::kPrimMerge); } in IsMerge()
40 static bool IsLoopCond(const AnfNodePtr &node) { in IsLoopCond()
43 static bool IsEnter(const AnfNodePtr &node) { in IsEnter()
46 static bool IsExit(const AnfNodePtr &node) { in IsExit()
49 …static bool IsSwitch(const AnfNodePtr &node) { return CheckPrimitiveType(node, prim::kPrimSwitch);… in IsSwitch()
50 static bool IsNextIteration(const AnfNodePtr &node) { in IsNextIteration()
53 static bool IsControlFlowOp(const AnfNodePtr &node) { in IsControlFlowOp()
|
| /third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_ops/d3d/ |
| D | RemoveSwitchFallThrough.cpp | 90 void RemoveSwitchFallThroughTraverser::visitSymbol(TIntermSymbol *node) in visitSymbol()
98 void RemoveSwitchFallThroughTraverser::visitConstantUnion(TIntermConstantUnion *node) in visitConstantUnion()
106 bool RemoveSwitchFallThroughTraverser::visitDeclaration(Visit, TIntermDeclaration *node) in visitDeclaration()
113 bool RemoveSwitchFallThroughTraverser::visitBinary(Visit, TIntermBinary *node) in visitBinary()
120 bool RemoveSwitchFallThroughTraverser::visitUnary(Visit, TIntermUnary *node) in visitUnary()
127 bool RemoveSwitchFallThroughTraverser::visitTernary(Visit, TIntermTernary *node) in visitTernary()
134 bool RemoveSwitchFallThroughTraverser::visitSwizzle(Visit, TIntermSwizzle *node) in visitSwizzle()
141 bool RemoveSwitchFallThroughTraverser::visitIfElse(Visit, TIntermIfElse *node) in visitIfElse()
148 bool RemoveSwitchFallThroughTraverser::visitSwitch(Visit, TIntermSwitch *node) in visitSwitch()
202 bool RemoveSwitchFallThroughTraverser::visitCase(Visit, TIntermCase *node) in visitCase()
[all …]
|
| /third_party/mindspore/mindspore-src/source/mindspore/ccsrc/pipeline/jit/pi/graph_capture/ |
| D | constant_info.cc | 87 static void MakeConstantFold(ValueNode *node) { in MakeConstantFold()
91 static void MakeCodeConstantInfo(ValueNode *node) { in MakeCodeConstantInfo()
117 static void MakeShapeInfoOfTensor(ValueNode *node) { in MakeShapeInfoOfTensor()
122 static void MakeDimInfoOfTensor(ValueNode *node) { in MakeDimInfoOfTensor()
130 static void MakeConstantInfoOfTensorAttr(ValueNode *node) { in MakeConstantInfoOfTensorAttr()
140 bool CheckConstantAttr(ValueNode *node) { in CheckConstantAttr()
167 bool CheckConstantGlobal(ValueNode *node) { in CheckConstantGlobal()
172 bool CheckConstantIs(ValueNode *node) { in CheckConstantIs()
185 bool MakeConstantBinary(ValueNode *node) { in MakeConstantBinary()
204 bool MakeConstantBinarySubscr(ValueNode *node) { in MakeConstantBinarySubscr()
[all …]
|
| /third_party/mindspore/mindspore-src/source/mindspore/ccsrc/pipeline/jit/pi/graph_compiler/parser/ |
| D | byte_code_parser.cc | 323 void ByteCodeParser::SaveNode(const ir::NodePtr &node) { in SaveNode()
329 ir::NodePtr node = stack_.back(); in PopStack() local
334 void ByteCodeParser::PushStack(const ir::NodePtr &node) { in PushStack()
346 for (auto &node : value) { in Parse() local
427 ir::IfNodePtr node = std::make_shared<ir::IfNode>(PopStack()); in ParseIf() local
446 ir::WhileNodePtr node = std::make_shared<ir::WhileNode>(PopStack()); in ParseWhile() local
534 ir::NodePtr node = std::make_shared<ir::UnaryOperation>(instr->GetOpCode(), PopStack()); in ParsePopTop() local
574 ir::NodePtr node = std::make_shared<ir::UnaryOperation>(instr->GetOpCode(), top); in ParseUnaryOpertion() local
586 ir::NodePtr node = std::make_shared<ir::NegativeNode>(top); in ParseUnaryNegative() local
594 ir::NodePtr node = std::make_shared<ir::NotNode>(top); in ParseUnaryNot() local
[all …]
|
| /third_party/skia/third_party/externals/angle2/src/compiler/translator/TranslatorMetalDirect/ |
| D | SeparateCompoundExpressions.cpp | 45 bool ViewBinaryChain(TOperator op, TIntermTyped &node, std::vector<TIntermTyped *> &out) in ViewBinaryChain()
69 std::vector<TIntermTyped *> ViewBinaryChain(TIntermBinary &node) in ViewBinaryChain()
88 TIntermTyped &reassociateRight(TIntermBinary &node) in reassociateRight()
114 PreResult visitBinaryPre(TIntermBinary &node) override in visitBinaryPre()
158 void pushStmt(TIntermNode &node) { getCurrStmts().push_back(&node); } in pushStmt()
160 bool isTerminalExpr(TIntermNode &node) in isTerminalExpr()
173 TIntermTyped *pullMappedExpr(TIntermTyped *node, bool allowBacktrack) in pullMappedExpr()
297 PreResult visitBlockPre(TIntermBlock &node) override in visitBlockPre()
303 PostResult visitBlockPost(TIntermBlock &node) override in visitBlockPost()
322 PreResult visitDeclarationPre(TIntermDeclaration &node) override in visitDeclarationPre()
[all …]
|
| /third_party/skia/src/xml/ |
| D | SkDOM.cpp | 17 bool SkXMLParser::parse(const SkDOM& dom, const SkDOMNode* node) { in parse()
55 const SkDOM::Node* SkDOM::getFirstChild(const Node* node, const char name[]) const { in getFirstChild() argument
69 const SkDOM::Node* SkDOM::getNextSibling(const Node* node, const char name[]) const { in getNextSibling() argument
92 const char* SkDOM::findAttr(const Node* node, const char name[]) const { in findAttr() argument
112 const SkDOM::Attr* SkDOM::getNextAttr(const Node* node, const Attr* attr) const { in getNextAttr() argument
120 const char* SkDOM::getAttrName(const Node* node, const Attr* attr) const { in getAttrName() argument
126 const char* SkDOM::getAttrValue(const Node* node, const Attr* attr) const { in getAttrValue() argument
134 SkDOM::AttrIter::AttrIter(const SkDOM&, const SkDOM::Node* node) { in AttrIter()
171 void SkDOM::walk_dom(const SkDOM& dom, const SkDOM::Node* node, SkXMLParser* parser) { in walk_dom()
197 const SkDOM::Node* SkDOM::copy(const SkDOM& dom, const SkDOM::Node* node) { in copy()
[all …]
|
| /third_party/skia/experimental/skrive/tests/ |
| D | DomTypes.cpp | 12 void check_type(skiatest::Reporter* reporter, const sk_sp<U>& node, bool expected) { in check_type()
19 auto node = sk_make_sp<skrive::Node>(); in DEF_TEST() local
29 auto node = sk_make_sp<skrive::Shape>(); in DEF_TEST() local
39 auto node = sk_make_sp<skrive::ColorPaint>(SkPaint::Style::kFill_Style); in DEF_TEST() local
51 auto node = sk_make_sp<skrive::Ellipse>(); in DEF_TEST() local
|
| /third_party/python/Lib/lib2to3/fixes/ |
| D | fix_operator.py | 43 def transform(self, node, results): argument
49 def _sequenceIncludes(self, node, results): argument
53 def _isCallable(self, node, results): argument
58 def _repeat(self, node, results): argument
62 def _irepeat(self, node, results): argument
66 def _isSequenceType(self, node, results): argument
70 def _isMappingType(self, node, results): argument
74 def _isNumberType(self, node, results): argument
77 def _handle_rename(self, node, results, name): argument
82 def _handle_type2abc(self, node, results, module, abc): argument
[all …]
|
| /third_party/lame/ACM/tinyxml/ |
| D | tinyxml.cpp | 95 TiXmlNode* node = firstChild; in ~TiXmlNode() local
109 TiXmlNode* node = firstChild; in Clear() local
124 TiXmlNode* TiXmlNode::LinkEndChild( TiXmlNode* node ) in LinkEndChild()
143 TiXmlNode* node = addThis.Clone(); in InsertEndChild() local
156 TiXmlNode* node = addThis.Clone(); in InsertBeforeChild() local
174 TiXmlNode* node = addThis.Clone(); in InsertAfterChild() local
192 TiXmlNode* node = withThis.Clone(); in ReplaceChild() local
240 TiXmlNode* node; in FirstChild() local
252 TiXmlNode* node; in LastChild() local
292 TiXmlNode* node; in NextSibling() local
[all …]
|
| /third_party/mindspore/mindspore-src/source/mindspore/python/mindspore/rewrite/sparsify/ |
| D | sparse_transformer.py | 109 def make_call(node, name="", args=None): argument
129 def transform(self, node): argument
198 def get_sparse_node(self, node, args, func, arg_types): argument
274 def visit_method(self, node): argument
282 def visit(self, node): argument
301 def visit_generic_stmt(self, node): argument
308 def visit_scalar_expr(self, node): argument
313 def visit_generic_expr(self, node): argument
321 def visit_composite_generic_expr(self, node): argument
325 def visit_partial_expr(self, node): argument
[all …]
|