Home
last modified time | relevance | path

Searched refs:list (Results 326 - 350 of 13887) sorted by relevance

1...<<11121314151617181920>>...556

/third_party/gn/src/gn/
H A Dcommand_format.cc46 R"(gn format [--dump-tree] (--stdin | <list of build_files...>)
63 Prints the list of files that would be reformatted but does not write
129 // Format a list of values using the given style.
166 // Sort a list on the RHS if the LHS is one of the following:
177 // Sort contiguous import() function calls in the given ordered list of
211 // Format a list of values using the given style.
216 const std::vector<std::unique_ptr<PARSENODE>>& list,
229 bool ListWillBeMultiline(const std::vector<std::unique_ptr<PARSENODE>>& list,
416 const ListNode* list = node->AsList(); in SortIfApplicable()
417 if (list) in SortIfApplicable()
957 Sequence(SequenceStyle style, const std::vector<std::unique_ptr<PARSENODE>>& list, const ParseNode* end, bool force_multiline) Sequence() argument
1047 const auto& list = func_call->args()->contents(); FunctionCall() local
1212 ListWillBeMultiline( const std::vector<std::unique_ptr<PARSENODE>>& list, const ParseNode* end) ListWillBeMultiline() argument
[all...]
H A Dsubstitution_writer.cc46 sources to every entry in the outputs list, producing the cross product of
53 If no placeholders are found, the outputs or args list will be treated as a
54 static list of literal file names that do not depend on the sources.
179 void SubstitutionWriter::GetListAsSourceFiles(const SubstitutionList& list,
181 for (const auto& pattern : list.list()) {
196 const SubstitutionList& list,
199 GetListAsSourceFiles(list, &output_as_sources);
251 const SubstitutionList& list,
254 for (const auto& item : list
[all...]
H A Dsubstitution_writer.h71 // like actions where the outputs are explicit, but the list is stored as
73 static void GetListAsSourceFiles(const SubstitutionList& list,
76 const SubstitutionList& list,
103 // Applies the substitution list to a source, APPENDING the result to the
105 // apply to multiple files and create a list. The result can either be
111 const SubstitutionList& list,
116 const SubstitutionList& list,
121 const SubstitutionList& list,
125 // Like ApplyListToSource but applies the list to all sources and replaces
131 const SubstitutionList& list,
[all...]
/kernel/linux/linux-6.6/net/netfilter/
H A Dnft_connlimit.c17 struct nf_conncount_list *list; member
46 if (nf_conncount_add(nft_net(pkt), priv->list, tuple_ptr, zone)) { in nft_connlimit_do_eval()
51 count = priv->list->count; in nft_connlimit_do_eval()
80 priv->list = kmalloc(sizeof(*priv->list), GFP_KERNEL_ACCOUNT); in nft_connlimit_do_init()
81 if (!priv->list) in nft_connlimit_do_init()
84 nf_conncount_list_init(priv->list); in nft_connlimit_do_init()
94 kfree(priv->list); in nft_connlimit_do_init()
103 nf_conncount_cache_free(priv->list); in nft_connlimit_do_destroy()
104 kfree(priv->list); in nft_connlimit_do_destroy()
[all...]
/third_party/node/deps/v8/src/heap/
H A Darray-buffer-sweeper.cc36 void ArrayBufferList::Append(ArrayBufferList* list) { in Append() argument
39 head_ = list->head_; in Append()
40 tail_ = list->tail_; in Append()
41 } else if (list->head_) { in Append()
42 DCHECK_NOT_NULL(list->tail_); in Append()
43 tail_->set_next(list->head_); in Append()
44 tail_ = list->tail_; in Append()
46 DCHECK_NULL(list->tail_); in Append()
49 bytes_ += list->ApproximateBytes(); in Append()
50 *list in Append()
207 ReleaseAll(ArrayBufferList* list) ReleaseAll() argument
296 SweepListFull( ArrayBufferList* list) SweepListFull() argument
[all...]
/kernel/linux/linux-5.10/security/smack/
H A Dsmackfs.c198 * smk_set_access - add a rule to the rule list or replace an old rule
200 * @rule_list: the list of rules
201 * @rule_lock: the rule list lock
203 * Looks through the current subject/object/access list for
225 list_for_each_entry_rcu(sp, rule_list, list) { in smk_set_access()
246 list_add_rcu(&sp->list, rule_list); in smk_set_access()
430 * @rule_list: the list of rules to write to
431 * @rule_lock: lock for the rule list
528 * Core logic for smackfs seq list operations.
534 struct list_head *list; in smk_seq_start() local
551 struct list_head *list = v; smk_seq_next() local
619 struct list_head *list = v; load_seq_show() local
767 struct list_head *list = v; cipso_seq_show() local
974 struct list_head *list = v; cipso2_seq_show() local
1057 struct list_head *list = v; net4addr_seq_show() local
1323 struct list_head *list = v; net6addr_seq_show() local
1888 struct list_head *list = v; onlycap_seq_show() local
1956 smk_parse_label_list(char *data, struct list_head *list) smk_parse_label_list() argument
1985 smk_destroy_label_list(struct list_head *list) smk_destroy_label_list() argument
2228 struct list_head *list = v; load_self_seq_show() local
2357 struct list_head *list = v; load2_seq_show() local
2436 struct list_head *list = v; load_self2_seq_show() local
2707 struct list_head *list = v; relabel_self_seq_show() local
[all...]
/kernel/linux/linux-6.6/security/smack/
H A Dsmackfs.c199 * smk_set_access - add a rule to the rule list or replace an old rule
201 * @rule_list: the list of rules
202 * @rule_lock: the rule list lock
204 * Looks through the current subject/object/access list for
226 list_for_each_entry_rcu(sp, rule_list, list) { in smk_set_access()
247 list_add_rcu(&sp->list, rule_list); in smk_set_access()
431 * @rule_list: the list of rules to write to
432 * @rule_lock: lock for the rule list
529 * Core logic for smackfs seq list operations.
535 struct list_head *list; in smk_seq_start() local
552 struct list_head *list = v; smk_seq_next() local
620 struct list_head *list = v; load_seq_show() local
768 struct list_head *list = v; cipso_seq_show() local
986 struct list_head *list = v; cipso2_seq_show() local
1069 struct list_head *list = v; net4addr_seq_show() local
1334 struct list_head *list = v; net6addr_seq_show() local
1899 struct list_head *list = v; onlycap_seq_show() local
1967 smk_parse_label_list(char *data, struct list_head *list) smk_parse_label_list() argument
1996 smk_destroy_label_list(struct list_head *list) smk_destroy_label_list() argument
2239 struct list_head *list = v; load_self_seq_show() local
2369 struct list_head *list = v; load2_seq_show() local
2448 struct list_head *list = v; load_self2_seq_show() local
2719 struct list_head *list = v; relabel_self_seq_show() local
[all...]
/third_party/vk-gl-cts/external/openglcts/modules/gles31/
H A Des31cLayoutBindingTests.cpp306 virtual bool setBindingPoints(StringVector list, glw::GLint bindingPoint) const in setBindingPoints() argument
310 StringIntMap locations = getUniformLocations(list); in setBindingPoints()
1316 StringVector list; in binding_basic_default() local
1319 list.push_back(u + "_block"); in binding_basic_default()
1321 list.push_back(getDefaultUniformName()); in binding_basic_default()
1323 StringIntMap bindingPoints = program->getBindingPoints(list); in binding_basic_default()
1325 passed &= bindingPoints.size() == list.size() && (bindingPoints[u] == 0); in binding_basic_default()
1364 StringVector list; in binding_basic_explicit() local
1367 list.push_back(s + "_block"); in binding_basic_explicit()
1369 list in binding_basic_explicit()
1409 StringVector list; binding_basic_multiple() local
1508 StringVector list; binding_integer_constant() local
1550 StringVector list; binding_integer_constant() local
1600 StringVector list; binding_array_size() local
1661 StringVector list; binding_array_implicit() local
1735 StringVector list; binding_array_multiple() local
1788 StringVector list; binding_api_update() local
2381 StringVector list; binding_array_size() local
2449 StringVector list; binding_examples_many_bindings() local
2487 StringVector list; binding_examples_many_bindings() local
2673 StringVector list; binding_examples_one_binding() local
2710 StringVector list; binding_examples_one_binding() local
2980 setBindingPoints(StringVector list, glw::GLint bindingPoint) const setBindingPoints() argument
3172 setBindingPoints(StringVector list, glw::GLint bindingPoint) const setBindingPoints() argument
[all...]
/kernel/linux/linux-5.10/scripts/dtc/libfdt/
H A Dfdt_ro.c725 const char *list, *end; in fdt_stringlist_count() local
728 list = fdt_getprop(fdt, nodeoffset, property, &length); in fdt_stringlist_count()
729 if (!list) in fdt_stringlist_count()
732 end = list + length; in fdt_stringlist_count()
734 while (list < end) { in fdt_stringlist_count()
735 length = strnlen(list, end - list) + 1; in fdt_stringlist_count()
738 if (list + length > end) in fdt_stringlist_count()
741 list += length; in fdt_stringlist_count()
752 const char *list, *en in fdt_stringlist_search() local
782 const char *list, *end; fdt_stringlist_get() local
[all...]
/kernel/linux/linux-5.10/net/netfilter/ipvs/
H A Dip_vs_lblcr.c43 #include <linux/list.h>
87 struct list_head list; /* list link */ member
95 struct list_head list; /* destination list */ member
105 list_for_each_entry(e, &set->list, list) { in ip_vs_dest_set_insert()
118 list_add_rcu(&e->list, &set->list); in ip_vs_dest_set_insert()
138 list_for_each_entry(e, &set->list, lis in ip_vs_dest_set_erase()
259 struct hlist_node list; global() member
[all...]
/kernel/linux/linux-6.6/scripts/dtc/libfdt/
H A Dfdt_ro.c725 const char *list, *end; in fdt_stringlist_count() local
728 list = fdt_getprop(fdt, nodeoffset, property, &length); in fdt_stringlist_count()
729 if (!list) in fdt_stringlist_count()
732 end = list + length; in fdt_stringlist_count()
734 while (list < end) { in fdt_stringlist_count()
735 length = strnlen(list, end - list) + 1; in fdt_stringlist_count()
738 if (list + length > end) in fdt_stringlist_count()
741 list += length; in fdt_stringlist_count()
752 const char *list, *en in fdt_stringlist_search() local
782 const char *list, *end; fdt_stringlist_get() local
[all...]
/kernel/linux/linux-6.6/net/netfilter/ipvs/
H A Dip_vs_lblcr.c43 #include <linux/list.h>
87 struct list_head list; /* list link */ member
95 struct list_head list; /* destination list */ member
105 list_for_each_entry(e, &set->list, list) { in ip_vs_dest_set_insert()
118 list_add_rcu(&e->list, &set->list); in ip_vs_dest_set_insert()
138 list_for_each_entry(e, &set->list, lis in ip_vs_dest_set_erase()
259 struct hlist_node list; global() member
[all...]
/kernel/linux/linux-5.10/arch/sh/kernel/
H A Dunwinder.c13 #include <linux/list.h>
33 .list = {
43 * "unwinder_list" is a linked-list of all available unwinders, sorted
52 .next = &stack_reader.list,
53 .prev = &stack_reader.list,
73 best = list_entry(unwinder_list.next, struct unwinder, list); in select_unwinder()
90 o = list_entry(tmp, struct unwinder, list); in unwinder_enqueue()
97 list_add(&ops->list, entry); in unwinder_enqueue()
106 * Install the new stack unwinder on the unwinder list, which is sorted
154 list_del(&curr_unwinder->list); in unwind_stack()
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/amd/amdgpu/
H A Damdgpu_csa.c70 struct list_head list; in amdgpu_map_static_csa() local
75 INIT_LIST_HEAD(&list); in amdgpu_map_static_csa()
80 list_add(&csa_tv.head, &list); in amdgpu_map_static_csa()
81 amdgpu_vm_get_pd_bo(vm, &list, &pd); in amdgpu_map_static_csa()
83 r = ttm_eu_reserve_buffers(&ticket, &list, true, NULL); in amdgpu_map_static_csa()
91 ttm_eu_backoff_reservation(&ticket, &list); in amdgpu_map_static_csa()
103 ttm_eu_backoff_reservation(&ticket, &list); in amdgpu_map_static_csa()
107 ttm_eu_backoff_reservation(&ticket, &list); in amdgpu_map_static_csa()
/kernel/linux/linux-6.6/arch/sh/kernel/
H A Dunwinder.c13 #include <linux/list.h>
33 .list = {
43 * "unwinder_list" is a linked-list of all available unwinders, sorted
52 .next = &stack_reader.list,
53 .prev = &stack_reader.list,
73 best = list_entry(unwinder_list.next, struct unwinder, list); in select_unwinder()
90 o = list_entry(tmp, struct unwinder, list); in unwinder_enqueue()
97 list_add(&ops->list, entry); in unwinder_enqueue()
106 * Install the new stack unwinder on the unwinder list, which is sorted
154 list_del(&curr_unwinder->list); in unwind_stack()
[all...]
/third_party/curl/tests/unit/
H A Dunit1654.c60 fail_unless(asi->list.size == 4, "wrong number of entries");
66 fail_unless(asi->list.size == 5, "wrong number of entries");
71 fail_unless(asi->list.size == 6, "wrong number of entries");
78 fail_unless(asi->list.size == 8, "wrong number of entries");
84 fail_unless(asi->list.size == 9, "wrong number of entries");
91 fail_unless(asi->list.size == 10, "wrong number of entries");
98 fail_unless(asi->list.size == 12, "wrong number of entries");
104 fail_unless(asi->list.size == 10, "wrong number of entries");
/third_party/ninja/src/
H A Dstring_piece_util.cc41 string JoinStringPiece(const vector<StringPiece>& list, char sep) { in JoinStringPiece() argument
42 if (list.empty()) { in JoinStringPiece()
49 size_t cap = list.size() - 1; in JoinStringPiece()
50 for (size_t i = 0; i < list.size(); ++i) { in JoinStringPiece()
51 cap += list[i].len_; in JoinStringPiece()
56 for (size_t i = 0; i < list.size(); ++i) { in JoinStringPiece()
60 ret.append(list[i].str_, list[i].len_); in JoinStringPiece()
/kernel/linux/linux-6.6/tools/perf/util/
H A Dparse-events.c163 list_for_each_entry(term, head_terms, list) in get_config_str()
188 * @config_terms: the list of terms that may contain a raw term.
195 list_for_each_entry(term, config_terms, list) { in fix_raw()
225 __add_event(struct list_head *list, int *idx, in __add_event() argument
276 if (list) in __add_event()
277 list_add_tail(&evsel->core.node, list); in __add_event()
286 return __add_event(/*list=*/NULL, &idx, attr, /*init_attr=*/false, name, in parse_events__add_event()
291 static int add_event(struct list_head *list, int *idx, in add_event() argument
295 return __add_event(list, idx, attr, /*init_attr*/true, name, metric_id, in add_event()
300 static int add_event_tool(struct list_head *list, in argument
443 parse_events_add_cache(struct list_head *list, int *idx, const char *name, struct parse_events_state *parse_state, struct list_head *head_config) parse_events_add_cache() argument
520 add_tracepoint(struct list_head *list, int *idx, const char *sys_name, const char *evt_name, struct parse_events_error *err, struct list_head *head_config, void *loc_) add_tracepoint() argument
545 add_tracepoint_multi_event(struct list_head *list, int *idx, const char *sys_name, const char *evt_name, struct parse_events_error *err, struct list_head *head_config, YYLTYPE *loc) add_tracepoint_multi_event() argument
593 add_tracepoint_event(struct list_head *list, int *idx, const char *sys_name, const char *evt_name, struct parse_events_error *err, struct list_head *head_config, YYLTYPE *loc) add_tracepoint_event() argument
605 add_tracepoint_multi_sys(struct list_head *list, int *idx, const char *sys_name, const char *evt_name, struct parse_events_error *err, struct list_head *head_config, YYLTYPE *loc) add_tracepoint_multi_sys() argument
680 parse_events_add_breakpoint(struct parse_events_state *parse_state, struct list_head *list, u64 addr, char *type, u64 len, struct list_head *head_config __maybe_unused) parse_events_add_breakpoint() argument
1251 parse_events_add_tracepoint(struct list_head *list, int *idx, const char *sys, const char *event, struct parse_events_error *err, struct list_head *head_config, void *loc_) parse_events_add_tracepoint() argument
1284 __parse_events_add_numeric(struct parse_events_state *parse_state, struct list_head *list, struct perf_pmu *pmu, u32 type, u32 extended_type, u64 config, struct list_head *head_config) __parse_events_add_numeric() argument
1320 parse_events_add_numeric(struct parse_events_state *parse_state, struct list_head *list, u32 type, u64 config, struct list_head *head_config, bool wildcard) parse_events_add_numeric() argument
1351 parse_events_add_tool(struct parse_events_state *parse_state, struct list_head *list, int tool_event) parse_events_add_tool() argument
1370 parse_events_add_pmu(struct parse_events_state *parse_state, struct list_head *list, const char *name, struct list_head *head_config, bool auto_merge_stats, void *loc_) parse_events_add_pmu() argument
1491 struct list_head *list = NULL; parse_events_multi_pmu_add() local
1574 parse_events__modifier_group(struct list_head *list, char *event_mod) parse_events__modifier_group() argument
1580 parse_events__set_leader(char *name, struct list_head *list) parse_events__set_leader() argument
1746 parse_events__modifier_event(struct list_head *list, char *str, bool add) parse_events__modifier_event() argument
1786 parse_events_name(struct list_head *list, const char *name) parse_events_name() argument
1982 parse_events__sort_events_and_fix_groups(struct list_head *list) parse_events__sort_events_and_fix_groups() argument
[all...]
H A Dordered-events.c4 #include <linux/list.h>
30 list_add(&new->list, &oe->events); in queue_event()
36 * last event might point to some random place in the list as it's in queue_event()
42 p = last->list.next; in queue_event()
44 list_add_tail(&new->list, &oe->events); in queue_event()
48 last = list_entry(p, struct ordered_event, list); in queue_event()
50 list_add_tail(&new->list, &last->list); in queue_event()
53 p = last->list.prev; in queue_event()
55 list_add(&new->list, in queue_event()
[all...]
/third_party/libdrm/freedreno/
H A Dfreedreno_bo_cache.c42 list_inithead(&cache->cache_bucket[i].list); in add_bucket()
93 while (!LIST_IS_EMPTY(&bucket->list)) { in fd_bo_cache_cleanup()
94 bo = LIST_ENTRY(struct fd_bo, bucket->list.next, list); in fd_bo_cache_cleanup()
101 list_del(&bo->list); in fd_bo_cache_cleanup()
142 * NOTE that intel takes ALLOC_FOR_RENDER bo's from the list tail in find_in_bucket()
146 if (!LIST_IS_EMPTY(&bucket->list)) { in find_in_bucket()
147 bo = LIST_ENTRY(struct fd_bo, bucket->list.next, list); in find_in_bucket()
150 list_del(&bo->list); in find_in_bucket()
[all...]
/kernel/linux/linux-5.10/drivers/md/bcache/
H A Djournal.c35 static int journal_read_bucket(struct cache *ca, struct list_head *list, in journal_read_bucket() argument
104 * Nodes in 'list' are in linear increasing order of in journal_read_bucket()
113 * in list is expired and useless, remove it from in journal_read_bucket()
114 * this list. Otherwise, j is a condidate jset for in journal_read_bucket()
117 while (!list_empty(list)) { in journal_read_bucket()
118 i = list_first_entry(list, in journal_read_bucket()
119 struct journal_replay, list); in journal_read_bucket()
122 list_del(&i->list); in journal_read_bucket()
126 /* iterate list in reverse order (from latest jset) */ in journal_read_bucket()
127 list_for_each_entry_reverse(i, list, lis in journal_read_bucket()
171 bch_journal_read(struct cache_set *c, struct list_head *list) bch_journal_read() argument
294 bch_journal_mark(struct cache_set *c, struct list_head *list) bch_journal_mark() argument
350 bch_journal_replay(struct cache_set *s, struct list_head *list) bch_journal_replay() argument
762 struct bio_list list; global() variable
764 bio_list_init(&list); global() variable
[all...]
/kernel/linux/linux-6.6/drivers/md/bcache/
H A Djournal.c35 static int journal_read_bucket(struct cache *ca, struct list_head *list, in journal_read_bucket() argument
102 * Nodes in 'list' are in linear increasing order of in journal_read_bucket()
111 * in list is expired and useless, remove it from in journal_read_bucket()
112 * this list. Otherwise, j is a candidate jset for in journal_read_bucket()
115 while (!list_empty(list)) { in journal_read_bucket()
116 i = list_first_entry(list, in journal_read_bucket()
117 struct journal_replay, list); in journal_read_bucket()
120 list_del(&i->list); in journal_read_bucket()
124 /* iterate list in reverse order (from latest jset) */ in journal_read_bucket()
125 list_for_each_entry_reverse(i, list, lis in journal_read_bucket()
170 bch_journal_read(struct cache_set *c, struct list_head *list) bch_journal_read() argument
293 bch_journal_mark(struct cache_set *c, struct list_head *list) bch_journal_mark() argument
349 bch_journal_replay(struct cache_set *s, struct list_head *list) bch_journal_replay() argument
759 struct bio_list list; global() variable
761 bio_list_init(&list); global() variable
[all...]
/kernel/linux/linux-5.10/tools/perf/util/
H A Dordered-events.c4 #include <linux/list.h>
30 list_add(&new->list, &oe->events); in queue_event()
36 * last event might point to some random place in the list as it's in queue_event()
42 p = last->list.next; in queue_event()
44 list_add_tail(&new->list, &oe->events); in queue_event()
48 last = list_entry(p, struct ordered_event, list); in queue_event()
50 list_add_tail(&new->list, &last->list); in queue_event()
53 p = last->list.prev; in queue_event()
55 list_add(&new->list, in queue_event()
[all...]
/kernel/linux/linux-5.10/drivers/net/ethernet/mellanox/mlx4/
H A Dintf.c16 * copyright notice, this list of conditions and the following
20 * copyright notice, this list of conditions and the following
42 struct list_head list; member
65 list_add_tail(&dev_ctx->list, &priv->ctx_list); in mlx4_add_device()
78 list_for_each_entry(dev_ctx, &priv->ctx_list, list) in mlx4_remove_device()
81 list_del(&dev_ctx->list); in mlx4_remove_device()
99 list_add_tail(&intf->list, &intf_list); in mlx4_register_interface()
124 list_del(&intf->list); in mlx4_unregister_interface()
159 list_for_each_entry_safe(dev_ctx, temp_dev_ctx, &priv->ctx_list, list) { in mlx4_do_bond()
162 list_del(&dev_ctx->list); in mlx4_do_bond()
[all...]
/kernel/linux/linux-5.10/drivers/s390/char/
H A Draw3270.h99 struct list_head list; /* list head for request queueing. */ member
123 return list_empty(&rq->list); in raw3270_request_final()
150 struct list_head list; member
195 struct list_head list; member
209 struct list_head list; member
223 list_for_each_entry(cs, free_list, list) { in alloc_string()
233 list_del(&cs->list); in alloc_string()
235 INIT_LIST_HEAD(&cs->list); in alloc_string()
248 /* Find out the left neighbour in free memory list in free_string()
[all...]

Completed in 22 milliseconds

1...<<11121314151617181920>>...556