Home
last modified time | relevance | path

Searched refs:list (Results 376 - 400 of 14421) sorted by relevance

1...<<11121314151617181920>>...577

/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...]
/third_party/gn/src/gn/
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/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...]
H A Dparse-events.h8 #include <linux/list.h>
87 /** @list: The term list the term is a part of. */
88 struct list_head list; member
144 /* The list parsed events are placed on. */
145 struct list_head list; member
187 int parse_events__modifier_event(struct list_head *list, char *str, bool add);
188 int parse_events__modifier_group(struct list_head *list, char *event_mod);
189 int parse_events_name(struct list_head *list, const char *name);
190 int parse_events_add_tracepoint(struct list_head *list, in
[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...]
/test/xts/acts/arkui/ace_c_arkui_test/entry/src/main/cpp/list/
H A Dlist_listdirection_test.cpp22 NAPI_START(list, ARKUI_NODE_LIST); in TestListListDirection001()
29 NAPI_START(list, ARKUI_NODE_LIST); in TestListListDirection002()
33 auto ret = nodeAPI->setAttribute(list, NODE_LIST_DIRECTION, &valueItem); in TestListListDirection002()
35 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_LIST_DIRECTION)->value[PARAM_0].i32, listDirection); in TestListListDirection002()
41 NAPI_START(list, ARKUI_NODE_LIST); in TestListListDirection003()
45 auto ret = nodeAPI->setAttribute(list, NODE_LIST_DIRECTION, &valueItem); in TestListListDirection003()
53 NAPI_START(list, ARKUI_NODE_LIST); in TestListListDirection004()
57 auto ret = nodeAPI->setAttribute(list, NODE_LIST_DIRECTION, &valueItem); in TestListListDirection004()
/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()
/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...]
/kernel/linux/linux-5.10/drivers/soc/ti/
H A Dknav_qmss.h133 struct list_head list; member
145 struct list_head list; member
190 * @list: instance in the device's region list
191 * @pools: list of descriptor pools in the region
202 struct list_head list; member
217 * @list: list head
218 * @region_inst: instance in the region's pool list
230 struct list_head list; member
286 struct list_head list; global() member
335 struct list_head list; global() member
[all...]
/kernel/linux/linux-5.10/sound/pci/ctxfi/
H A Dctvmem.c44 entry = list_entry(pos, struct ct_vm_block, list); in get_vm_block()
52 /* Move the vm node from unused list to used list directly */ in get_vm_block()
53 list_move(&entry->list, &vm->used); in get_vm_block()
65 list_add(&block->list, &vm->used); in get_vm_block()
83 list_del(&block->list); in put_vm_block()
87 entry = list_entry(pos, struct ct_vm_block, list); in put_vm_block()
92 list_add_tail(&block->list, &vm->unused); in put_vm_block()
100 __list_add(&block->list, pos->prev, pos); in put_vm_block()
105 pos = &entry->list; in put_vm_block()
[all...]
/kernel/linux/linux-6.6/drivers/soc/ti/
H A Dknav_qmss.h133 struct list_head list; member
145 struct list_head list; member
190 * @list: instance in the device's region list
191 * @pools: list of descriptor pools in the region
202 struct list_head list; member
217 * @list: list head
218 * @region_inst: instance in the region's pool list
230 struct list_head list; member
286 struct list_head list; global() member
335 struct list_head list; global() member
[all...]
/kernel/linux/linux-6.6/sound/pci/ctxfi/
H A Dctvmem.c44 entry = list_entry(pos, struct ct_vm_block, list); in get_vm_block()
52 /* Move the vm node from unused list to used list directly */ in get_vm_block()
53 list_move(&entry->list, &vm->used); in get_vm_block()
65 list_add(&block->list, &vm->used); in get_vm_block()
83 list_del(&block->list); in put_vm_block()
87 entry = list_entry(pos, struct ct_vm_block, list); in put_vm_block()
92 list_add_tail(&block->list, &vm->unused); in put_vm_block()
100 __list_add(&block->list, pos->prev, pos); in put_vm_block()
105 pos = &entry->list; in put_vm_block()
[all...]
/third_party/cups-filters/filter/foomatic-rip/
H A Dutil.h106 /* 'paths' is a colon seperated list of paths (like $PATH)
176 /* Doubly linked list of void pointers */
188 void list_free(list_t *list);
190 size_t list_item_count(list_t *list);
192 list_t * list_copy(list_t *list);
194 void list_prepend(list_t *list, void *data);
195 void list_append(list_t *list, void *data);
196 void list_remove(list_t *list, listitem_t *item);
198 listitem_t * list_get(list_t *list, int idx);
202 - with whitespace (i.e. it is in the next list entr
[all...]
/third_party/icu/icu4c/source/common/
H A Dlocaleprioritylist.cpp115 list = new LocaleAndWeightArray(); in LocalePriorityList()
116 if (list == nullptr) { in LocalePriorityList()
161 if (list != nullptr) { in ~LocalePriorityList()
163 delete list->array[i].locale; in ~LocalePriorityList()
165 delete list; in ~LocalePriorityList()
171 return list->array[i].locale; in localeAt()
175 if (list == nullptr) { return nullptr; } in orphanLocaleAt()
176 LocaleAndWeight &lw = list->array[i]; in orphanLocaleAt()
194 LocaleAndWeight &lw = list->array[index]; in add()
214 if (listLength == list in add()
[all...]
/third_party/node/deps/icu-small/source/common/
H A Dlocaleprioritylist.cpp115 list = new LocaleAndWeightArray(); in LocalePriorityList()
116 if (list == nullptr) { in LocalePriorityList()
161 if (list != nullptr) { in ~LocalePriorityList()
163 delete list->array[i].locale; in ~LocalePriorityList()
165 delete list; in ~LocalePriorityList()
171 return list->array[i].locale; in localeAt()
175 if (list == nullptr) { return nullptr; } in orphanLocaleAt()
176 LocaleAndWeight &lw = list->array[i]; in orphanLocaleAt()
194 LocaleAndWeight &lw = list->array[index]; in add()
214 if (listLength == list in add()
[all...]

Completed in 14 milliseconds

1...<<11121314151617181920>>...577