/third_party/python/Tools/peg_generator/pegen/ |
H A D | grammar.py | 27 def visit(self, node: Any, *args: Any, **kwargs: Any) -> Any: member in GrammarVisitor 38 self.visit(item, *args, **kwargs) 40 self.visit(value, *args, **kwargs)
|
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_ops/ |
H A D | RewriteStructSamplers.cpp | 117 bool visitBinary(Visit visit, TIntermBinary *node) override 341 bool visitDeclaration(Visit visit, TIntermDeclaration *decl) override 395 bool visitBinary(Visit visit, TIntermBinary *node) override
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUPerfHintAnalysis.cpp | 104 AMDGPUPerfHintAnalysis::FuncInfo *visit(const Function &F); 206 AMDGPUPerfHintAnalysis::FuncInfo *AMDGPUPerfHint::visit(const Function &F) { in visit() function in AMDGPUPerfHint 268 const AMDGPUPerfHintAnalysis::FuncInfo *Info = visit(F); in runOnFunction()
|
/third_party/skia/experimental/sktext/include/ |
H A D | Text.h | 203 this->visit(unicodeText, drawableText.get(), positionType, blocks); in prepareToDraw() 225 void visit(Visitor* visitor) const; 233 void visit(UnicodeText* unicodeText, Visitor* visitor, PositionType positionType, SkSpan<size_t> chunks) const;
|
/third_party/libbpf/src/ |
H A D | btf.c | 5079 int btf_type_visit_type_ids(struct btf_type *t, type_id_visit_fn visit, void *ctx) argument 5100 return visit(&t->type, ctx); 5105 err = visit(&a->type, ctx); 5106 err = err ?: visit(&a->index_type, ctx); 5115 err = visit(&m->type, ctx); 5125 err = visit(&t->type, ctx); 5129 err = visit(&m->type, ctx); 5140 err = visit(&m->type, ctx); 5152 int btf_type_visit_str_offs(struct btf_type *t, str_off_visit_fn visit, void *ctx) argument 5156 err = visit( 5209 btf_ext_visit_type_ids(struct btf_ext *btf_ext, type_id_visit_fn visit, void *ctx) global() argument 5240 btf_ext_visit_str_offs(struct btf_ext *btf_ext, str_off_visit_fn visit, void *ctx) global() argument [all...] |
/third_party/libabigail/src/ |
H A D | abg-comparison.cc | 2066 /// and visiting its children nodes too. So one can visit a node 2095 /// diff_node_visitor::visit() method is invoked with it's 'pre' 2096 /// argument set to true. Then if the diff_node_visitor::visit() 2102 /// visited) the diff_node_visitor::visit() method is invoked with 2127 if (!already_visited && !v.visit(this, /*pre=*/true)) in traverse() 2156 if (!v.visit(this, /*pref=*/false)) in traverse() 10861 if (!v.visit(this, true)) in traverse() 11135 /// @param d the diff node to visit. 11153 /// @param p the corpus_diff node to visit. 11172 diff_node_visitor::visit(dif function in abigail::comparison::diff_node_visitor 11179 diff_node_visitor::visit(distinct_diff* dif, bool pre) visit() function in abigail::comparison::diff_node_visitor 11191 diff_node_visitor::visit(var_diff* dif, bool pre) visit() function in abigail::comparison::diff_node_visitor 11203 diff_node_visitor::visit(pointer_diff* dif, bool pre) visit() function in abigail::comparison::diff_node_visitor 11215 diff_node_visitor::visit(reference_diff* dif, bool pre) visit() function in abigail::comparison::diff_node_visitor 11227 diff_node_visitor::visit(qualified_type_diff* dif, bool pre) visit() function in abigail::comparison::diff_node_visitor 11239 diff_node_visitor::visit(enum_diff* dif, bool pre) visit() function in abigail::comparison::diff_node_visitor 11251 diff_node_visitor::visit(class_diff* dif, bool pre) visit() function in abigail::comparison::diff_node_visitor 11263 diff_node_visitor::visit(base_diff* dif, bool pre) visit() function in abigail::comparison::diff_node_visitor 11275 diff_node_visitor::visit(scope_diff* dif, bool pre) visit() function in abigail::comparison::diff_node_visitor 11287 diff_node_visitor::visit(function_decl_diff* dif, bool pre) visit() function in abigail::comparison::diff_node_visitor 11299 diff_node_visitor::visit(type_decl_diff* dif, bool pre) visit() function in abigail::comparison::diff_node_visitor 11311 diff_node_visitor::visit(typedef_diff* dif, bool pre) visit() function in abigail::comparison::diff_node_visitor 11323 diff_node_visitor::visit(translation_unit_diff* dif, bool pre) visit() function in abigail::comparison::diff_node_visitor 11335 diff_node_visitor::visit(corpus_diff*, bool) visit() function in abigail::comparison::diff_node_visitor 11800 visit(diff* d, bool pre) visit() function 11828 visit(corpus_diff* d, bool pre) visit() function 12150 visit(diff*, bool) visit() function 12154 visit(corpus_diff*, bool) visit() function 12165 visit(corpus_diff*, bool) visit() function 12169 visit(diff* d, bool) visit() function [all...] |
/third_party/icu/tools/cldr/cldr-to-icu/src/main/java/org/unicode/icu/tool/cldrtoicu/ |
H A D | FilteredData.java | 55 visitor.visit(filteredValue); in visitFiltered()
|
/third_party/libunwind/libunwind/src/coredump/ |
H A D | _UCD_internal.h | 106 int _UCD_elf_visit_notes(uint8_t *segment, size_t segment_size, note_visitor_t visit, void *arg);
|
/third_party/jinja2/ |
H A D | meta.py | 53 codegen.visit(ast)
|
/third_party/node/deps/v8/third_party/jinja2/ |
H A D | meta.py | 49 codegen.visit(ast)
|
/third_party/node/tools/inspector_protocol/jinja2/ |
H A D | meta.py | 56 codegen.visit(ast)
|
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_ops/d3d/ |
H A D | WrapSwitchStatementsInBlocks.cpp | 45 bool visitSwitch(Visit visit, TIntermSwitch *node) override;
|
/third_party/skia/src/core/ |
H A D | SkBigPicture.cpp | 72 fRecord->visit(i, visitor); in approximateOpCount()
|
/third_party/skia/third_party/externals/jinja2/ |
H A D | meta.py | 49 codegen.visit(ast)
|
/third_party/skia/src/sksl/analysis/ |
H A D | SkSLProgramVisitor.h | 21 * Utility class to visit every element, statement, and expression in an SkSL program IR. 26 * intercept elements of interest. They can then invoke the base class's function to visit all 30 * The visit functions return a bool that determines how the default implementation recurses. Once 31 * any visit call returns true, the default behavior stops recursing and propagates true up the 70 bool visit(const Program& program);
|
/third_party/rust/crates/bindgen/bindgen/ir/ |
H A D | module.rs | 85 cursor.visit(|cursor| { in parse()
|
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_util/ |
H A D | RunAtTheEndOfShader.cpp | 45 bool visitBranch(Visit visit, TIntermBranch *node) override
|
/third_party/mesa3d/src/compiler/glsl/ |
H A D | ir_set_program_inouts.cpp | 60 virtual ir_visitor_status visit(ir_dereference_variable *); 186 ir_set_program_inouts_visitor::visit(ir_dereference_variable *ir) in visit() function in ir_set_program_inouts_visitor 358 * visit i and then continue with the parent. in visit_enter() 374 * that accesses shader inputs. So manually visit i and then in visit_enter() 388 /* The expression is something we don't recognize. Just visit its in visit_enter()
|
H A D | lower_tess_level.cpp | 65 virtual ir_visitor_status visit(ir_variable *); 103 lower_tess_level_visitor::visit(ir_variable *ir) in visit() function in lower_tess_level_visitor 416 * instruction, we need to visit it afterwards to make sure it in visit_leave() 429 * instruction it's going to visit next, we need to visit in visit_leave()
|
H A D | lower_precision.cpp | 112 virtual ir_visitor_status visit(ir_constant *ir); 113 virtual ir_visitor_status visit(ir_dereference_variable *ir); 329 find_lowerable_rvalues_visitor::visit(ir_constant *ir) in visit() function in __anon7193::find_lowerable_rvalues_visitor 342 find_lowerable_rvalues_visitor::visit(ir_dereference_variable *ir) in visit() function in __anon7193::find_lowerable_rvalues_visitor 987 virtual ir_visitor_status visit(ir_variable *var); 1032 lower_variables_visitor::visit(ir_variable *var) in visit() function in __anon7193::lower_variables_visitor
|
/third_party/node/deps/npm/test/fixtures/ |
H A D | mock-npm.js | 21 const updateSymlinks = (obj, visit) => { 26 obj[key] = updateSymlinks(value, visit)
|
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/ |
H A D | EdgeWriter.java | 72 public void visit(SimpleEdge e) { in visit() method in EdgeWriter 175 public void visit(SimpleEdge edge) { in visit() method in EdgeWriter.AnyPathVisitor
|
/third_party/python/Modules/ |
H A D | _queuemodule.c | 68 simplequeue_traverse(simplequeueobject *self, visitproc visit, void *arg) in simplequeue_traverse() argument 335 queue_traverse(PyObject *m, visitproc visit, void *arg) in queue_traverse() argument
|
/third_party/node/deps/v8/src/builtins/ |
H A D | builtins-array.cc | 679 V8_WARN_UNUSED_RESULT bool visit(uint32_t i, Handle<Object> elm) { in visit() function in v8::internal::__anon14076::ArrayConcatVisitor 688 // break out, and caller will throw. !visit would imply that in visit() 735 // If the initial length estimate was off (see special case in visit()), in increase_index_offset() 1057 if (!visitor->visit(i, element_value)) return false; in IterateElementsSlow() 1125 if (!visitor->visit(j, element_value)) return false; in IterateElements() 1135 if (!visitor->visit(j, element_value)) return false; in IterateElements() 1163 if (!visitor->visit(j, element_value)) return false; in IterateElements() 1174 if (!visitor->visit(j, element_value)) return false; in IterateElements() 1200 if (!visitor->visit(index, element)) return false; in IterateElements() 1216 if (!visitor->visit(inde in IterateElements() [all...] |
/third_party/python/Lib/ |
H A D | ast.py | 398 which is forwarded by the `visit` method. 404 class name of the node. So a `TryFinally` node visit function would 406 the `visit` method. If no visitor function exists for a node 414 def visit(self, node): member in NodeVisitor 426 self.visit(item) 428 self.visit(value) 485 node = YourTransformer().visit(node) 494 value = self.visit(value) 503 new_node = self.visit(old_value) 809 super().visit(nod 814 def visit(self, node): global() member in _Unparser [all...] |