| /third_party/node/deps/v8/tools/clusterfuzz/js_fuzzer/mutators/ |
| D | mutator.js | 25 visitor['enter'] = (path) => { argument
53 shouldSkip(node) { argument
57 skipMutations(node) { argument
70 insertBeforeSkip(path, node) { argument
75 insertAfterSkip(path, node) { argument
80 replaceWithSkip(path, node) { argument
85 replaceWithMultipleSkip(path, node) { argument
90 annotate(node, message) { argument
|
| D | try_catch.js | 32 function wrapTryCatch(node) { argument
40 function wrapTryCatchInFunction(node) { argument
49 function replaceNewExpression(path) { argument
64 function replaceAndSkip(path) { argument
77 callWithProb(path, fun) { argument
91 enter(path) { argument
94 exit(path) { argument
|
| D | common.js | 120 function isInForLoopCondition(path) { argument
130 function isInWhileLoop(path) { argument
136 function _availableIdentifiers(path, filter) { argument
156 function availableVariables(path) { argument
160 function availableFunctions(path) { argument
164 function randomVariable(path) { argument
168 function randomFunction(path) { argument
199 function randomArguments(path) { argument
210 function randomValue(path) { argument
238 function callRandomFunction(path, identifier, seed) { argument
[all …]
|
| /third_party/toybox/lib/ |
| D | dirtree.c | 63 char *path = parent ? dirtree_path(parent, 0) : ""; in dirtree_add_node() local
79 char *dirtree_path(struct dirtree *node, int *plen) in dirtree_path()
81 char *path; in dirtree_path() local
99 int dirtree_parentfd(struct dirtree *node) in dirtree_parentfd()
110 int (*callback)(struct dirtree *node)) in dirtree_handle_callback()
134 int dirtree_recurse(struct dirtree *node, in dirtree_recurse()
135 int (*callback)(struct dirtree *node), int dirfd, int flags) in dirtree_recurse()
144 char *path = dirtree_path(node, 0); in dirtree_recurse() local
189 struct dirtree *dirtree_flagread(char *path, int flags, in dirtree_flagread()
190 int (*callback)(struct dirtree *node)) in dirtree_flagread()
[all …]
|
| /third_party/toybox/porting/liteos_a/lib/ |
| D | dirtree.c | 71 char *path = parent ? dirtree_path(parent, 0) : ""; in dirtree_add_node() local
87 char *dirtree_path(struct dirtree *node, int *plen) in dirtree_path()
89 char *path; in dirtree_path() local
107 int dirtree_parentfd(struct dirtree *node) in dirtree_parentfd()
118 int (*callback)(struct dirtree *node)) in dirtree_handle_callback()
141 int dirtree_recurse(struct dirtree *node, in dirtree_recurse()
142 int (*callback)(struct dirtree *node), int dirfd, int flags) in dirtree_recurse()
151 char *path = dirtree_path(node, 0); in dirtree_recurse() local
196 struct dirtree *dirtree_flagread(char *path, int flags, in dirtree_flagread()
197 int (*callback)(struct dirtree *node)) in dirtree_flagread()
[all …]
|
| /third_party/selinux/libsepol/cil/src/ |
| D | cil_tree.c | 44 …cil_tree_node *cil_tree_get_next_path(struct cil_tree_node *node, char **info_kind, uint32_t *hll_… in cil_tree_get_next_path()
97 char *cil_tree_get_cil_path(struct cil_tree_node *node) in cil_tree_get_cil_path()
101 char *path; in cil_tree_get_cil_path() local
113 __attribute__((format (printf, 3, 4))) void cil_tree_log(struct cil_tree_node *node, enum cil_log_l… in cil_tree_log()
122 char *path = NULL; in cil_tree_log() local
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()
[all …]
|
| D | cil_parser.c | 76 static void create_node(struct cil_tree_node **node, struct cil_tree_node *current, uint32_t line, … in create_node()
86 static void insert_node(struct cil_tree_node *node, struct cil_tree_node *current) in insert_node()
96 …ee_node **current, uint32_t *hll_offset, uint32_t *hll_expand, struct cil_stack *stack, char *path) in add_hll_linemark()
99 struct cil_tree_node *node; in add_hll_linemark() local
193 static void add_cil_path(struct cil_tree_node **current, char *path) in add_cil_path()
195 struct cil_tree_node *node; in add_cil_path() local
220 struct cil_tree_node *node = NULL; in cil_parser() local
222 char *path = cil_strpool_add(_path); in cil_parser() local
|
| /third_party/ninja/src/ |
| D | state.cc | 96 Node* State::GetNode(StringPiece path, uint64_t slash_bits) { in GetNode()
97 Node* node = LookupNode(path); in GetNode() local
112 Node* State::SpellcheckNode(const string& path) { in SpellcheckNode()
129 void State::AddIn(Edge* edge, StringPiece path, uint64_t slash_bits) { in AddIn()
130 Node* node = GetNode(path, slash_bits); in AddIn() local
136 bool State::AddOut(Edge* edge, StringPiece path, uint64_t slash_bits) { in AddOut()
137 Node* node = GetNode(path, slash_bits); in AddOut() local
147 void State::AddValidation(Edge* edge, StringPiece path, uint64_t slash_bits) { in AddValidation()
148 Node* node = GetNode(path, slash_bits); in AddValidation() local
154 bool State::AddDefault(StringPiece path, string* err) { in AddDefault()
[all …]
|
| D | deps_log.cc | 48 bool DepsLog::OpenForWrite(const string& path, string* err) { in OpenForWrite()
60 bool DepsLog::RecordDeps(Node* node, TimeStamp mtime, in RecordDeps()
66 bool DepsLog::RecordDeps(Node* node, TimeStamp mtime, in RecordDeps()
152 LoadStatus DepsLog::Load(const string& path, State* state, string* err) { in Load()
238 Node* node = state->GetNode(subpath, 0); in Load() local
290 DepsLog::Deps* DepsLog::GetDeps(Node* node) { in GetDeps()
298 Node* DepsLog::GetFirstReverseDepsNode(Node* node) { in GetFirstReverseDepsNode()
311 bool DepsLog::Recompact(const string& path, string* err) { in Recompact()
364 bool DepsLog::IsDepsEntryLiveFor(const Node* node) { in IsDepsEntryLiveFor()
385 bool DepsLog::RecordId(Node* node) { in RecordId()
|
| /third_party/protobuf/java/util/src/main/java/com/google/protobuf/util/ |
| D | FieldMaskTree.java | 102 FieldMaskTree addFieldPath(String path) { in addFieldPath()
107 Node node = root; in addFieldPath() local
147 FieldMaskTree removeFieldPath(String path) { in removeFieldPath()
152 Node node = root; in removeFieldPath() local
193 private void getFieldPaths(Node node, String path, List<String> paths) { in getFieldPaths()
207 void intersectFieldPath(String path, FieldMaskTree output) { in intersectFieldPath()
215 Node node = root; in intersectFieldPath() local
254 Node node, in merge()
255 String path, in merge()
|
| /third_party/mesa3d/src/compiler/nir/ |
| D | nir_lower_vars_to_ssa.c | 45 nir_deref_path path; member
115 struct deref_node *node = rzalloc_size(mem_ctx, size); in deref_node_create() local
130 struct deref_node *node; in get_deref_node_for_var() local
230 struct deref_node *node = get_deref_node_recur(deref, state); in get_deref_node() local
252 foreach_deref_node_worker(struct deref_node *node, nir_deref_instr **path, in foreach_deref_node_worker()
253 void (* cb)(struct deref_node *node, in foreach_deref_node_worker()
303 foreach_deref_node_match(nir_deref_path *path, in foreach_deref_node_match()
304 void (* cb)(struct deref_node *node, in foreach_deref_node_match()
309 struct deref_node *node = get_deref_node_for_var(path->path[0]->var, state); in foreach_deref_node_match() local
319 path_may_be_aliased_node(struct deref_node *node, nir_deref_instr **path, in path_may_be_aliased_node()
[all …]
|
| D | nir_opt_find_array_copies.c | 78 struct match_node *node = rzalloc_size(state->dead_ctx, in create_match_node() local
99 struct match_node *node = create_match_node(instr->type, state); in node_for_deref() local
111 struct match_node *node = create_match_node(instr->type, state); in node_for_deref() local
142 struct match_node *node = create_match_node(instr->type, state); in node_for_deref() local
158 struct match_node *node = in node_for_wildcard() local
166 node_for_path(nir_deref_path *path, struct match_state *state) in node_for_path()
168 struct match_node *node = NULL; in node_for_path() local
176 node_for_path_with_wildcard(nir_deref_path *path, unsigned wildcard_idx, in node_for_path_with_wildcard()
179 struct match_node *node = NULL; in node_for_path_with_wildcard() local
194 _foreach_child(match_cb cb, struct match_node *node, struct match_state *state) in _foreach_child()
[all …]
|
| /third_party/wpa_supplicant/wpa_supplicant-2.9/src/utils/ |
| D | xml-utils.c | 19 xml_node_t *node; in get_node_uri_iter() local
50 xml_node_t *node; in get_node_uri() local
64 xml_node_t *root, const char *path) in get_node_iter()
67 xml_node_t *node; in get_node_iter() local
90 const char *path) in get_node()
93 xml_node_t *node; in get_node() local
107 const char *path) in get_child_node()
109 xml_node_t *node; in get_child_node() local
125 xml_node_t *node; in node_from_file() local
169 int node_to_file(struct xml_node_ctx *ctx, const char *fname, xml_node_t *node) in node_to_file()
[all …]
|
| /third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/utils/ |
| D | xml-utils.c | 19 xml_node_t *node; in get_node_uri_iter() local
50 xml_node_t *node; in get_node_uri() local
64 xml_node_t *root, const char *path) in get_node_iter()
67 xml_node_t *node; in get_node_iter() local
90 const char *path) in get_node()
93 xml_node_t *node; in get_node() local
107 const char *path) in get_child_node()
109 xml_node_t *node; in get_child_node() local
125 xml_node_t *node; in node_from_file() local
169 int node_to_file(struct xml_node_ctx *ctx, const char *fname, xml_node_t *node) in node_to_file()
[all …]
|
| /third_party/ntfs-3g/libfuse-lite/ |
| D | fuse.c | 112 struct node { struct
113 struct node *name_next; argument
114 struct node *id_next; argument
115 fuse_ino_t nodeid; argument
118 struct node *parent; argument
119 char *name;
143 fuse_ino_t nodeid; argument
259 struct node *node; in get_node_nocheck() local
270 struct node *node = get_node_nocheck(f, nodeid); in get_node() local
279 static void free_node(struct node *node) in free_node()
[all …]
|
| /third_party/libfuse/lib/ |
| D | fuse.c | 135 struct node { struct
136 struct node *name_next; argument
137 struct node *id_next; argument
138 fuse_ino_t nodeid; argument
141 struct node *parent; argument
159 struct node node; argument
391 static struct node_lru *node_lru(struct node *node) in node_lru()
410 static struct node_slab *node_to_slab(struct fuse *f, struct node *node) in node_to_slab()
450 struct list_head *node; in alloc_node() local
481 static void free_node_mem(struct fuse *f, struct node *node) in free_node_mem()
[all …]
|
| /third_party/python/Lib/ |
| D | pyclbr.py | 100 def readmodule(module, path=None): argument
112 def readmodule_ex(module, path=None): argument
122 def _readmodule(module, path, inpackage=None): argument
187 def __init__(self, module, path, file, tree, inpackage): argument
195 def visit_ClassDef(self, node): argument
220 def visit_FunctionDef(self, node, *, is_async=False): argument
230 def visit_AsyncFunctionDef(self, node): argument
233 def visit_Import(self, node): argument
248 def visit_ImportFrom(self, node): argument
269 def _create_tree(fullmodule, path, fname, source, tree, inpackage): argument
|
| /third_party/node/src/permission/ |
| D | fs_permission.cc | 36 node::permission::FSPermission::RadixTree::Node* node) { in FreeRecursivelyNode() argument
72 namespace node { namespace
76 void PrintTree(const FSPermission::RadixTree::Node* node, size_t spaces = 0) { in PrintTree()
136 const std::string path = WildcardIfDir(res); in GrantAccess() local
178 const std::string path(s); in Lookup() local
186 auto node = current_node->NextNode(path, parent_node_prefix_len); in Lookup() local
200 void FSPermission::RadixTree::Insert(const std::string& path) { in Insert()
|
| /third_party/protobuf/csharp/src/Google.Protobuf/ |
| D | FieldMaskTree.cs | 100 public FieldMaskTree AddFieldPath(string path) in AddFieldPath()
170 private void GetFieldPaths(Node node, string path, List<string> paths) in GetFieldPaths()
188 public void IntersectFieldPath(string path, FieldMaskTree output) in IntersectFieldPath()
250 Node node, in Merge()
251 string path, in Merge()
|
| /third_party/node/deps/npm/lib/commands/ |
| D | ls.js | 71 path, property
127 getChildren (node, nodeResult) { argument
142 .concat(appendExtraneousChildren({ node, seenPaths })) property
153 visit (node) { argument
181 json ? jsonOutput({ path, problems, result, rootError, seenItems }) : property
224 const isGitNode = (node) => { argument
237 const isOptional = (node) => argument
240 const isExtraneous = (node, { global }) => argument
243 const getProblems = (node, { global }) => { argument
341 const getJsonOutputItem = (node, { global, long }) => { argument
[all …]
|
| /third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/ |
| D | TrailingPathOptimizer.java | 129 Node node, AnyPath path, MutableValueGraph<Node, SimpleEdge> g, Map<Node, AnyPath> anyPaths) { in recursivelyDetachTrailingPaths() argument
178 private static boolean canTerminate(Node node, ValueGraph<Node, SimpleEdge> g) { in canTerminate() argument
186 Node node, Node end, AnyPath path, Node lastAdded, MutableValueGraph<Node, SimpleEdge> out) { in addPath() argument
|
| /third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/ |
| D | node.js | 312 path: this.path, property
412 path: this.root.sourceReference.path, property
456 isDescendantOf (node) { argument
465 getBundler (path = []) { argument
639 path: this.path, property
765 path: this.path, property
927 path: this.path, property
930 path: fsParent.path, property
998 canReplaceWith (node, ignorePeers) { argument
1038 canReplace (node, ignorePeers) { argument
[all …]
|
| /third_party/protobuf/src/google/protobuf/util/ |
| D | field_mask_util.cc | 109 const std::string& path = mask.paths(i); in ToJsonString() local
137 const Descriptor* descriptor, StringPiece path, in GetFieldDescriptors()
308 const Node* node, FieldMask* out) { in MergeToFieldMask()
325 void FieldMaskTree::AddPath(const std::string& path) { in AddPath()
331 Node* node = &root_; in AddPath() local
352 void FieldMaskTree::RemovePath(const std::string& path, in RemovePath()
365 Node* node = &root_; in RemovePath() local
411 void FieldMaskTree::IntersectPath(const std::string& path, FieldMaskTree* out) { in IntersectPath()
416 const Node* node = &root_; in IntersectPath() local
438 const Node* node, FieldMaskTree* out) { in MergeLeafNodesToTree()
[all …]
|
| /third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/ |
| D | PrefixTree.java | 155 DfaNode node = ranges.getInitial(); in prefixes() local
254 private RangeSpecification path = RangeSpecification.empty(); field in PrefixTree.TrimmingVisitor
301 DfaNode node, RangeSpecification path, DfaNode exclude, RangeTree minimal, int minLength) { in recursivelyMinimize()
340 DfaNode node, RangeSpecification path, RangeTree minimal, int minLength) { in emit()
|
| /third_party/ltp/libs/libltpnuma/ |
| D | tst_numa.c | 67 static void inc_counter(unsigned int node, struct tst_nodemap *nodes) in inc_counter()
84 int node; in tst_nodemap_count_pages() local
103 void *tst_numa_map(const char *path, size_t size) in tst_numa_map()
126 static int node_has_enough_memory(int node, size_t min_kb) in node_has_enough_memory()
128 char path[1024]; in node_has_enough_memory() local
|