/kernel/linux/linux-5.10/include/linux/ |
H A D | padata.h | 19 #include <linux/list.h> 28 * @list: List entry, to attach to the padata lists. 37 struct list_head list; member 49 * @list: List head. 53 struct list_head list; member 117 * @list: List entry in padata_instance list. 123 struct list_head list; member
|
/kernel/linux/linux-5.10/tools/objtool/ |
H A D | check.h | 40 struct list_head list; member 93 list_for_each_entry(insn, &file->insn_list, list) 97 insn && &insn->list != &file->insn_list && \ 99 insn = list_next_entry(insn, list))
|
/kernel/linux/linux-5.10/fs/nfs_common/ |
H A D | grace.c | 34 if (list_empty(&lm->list)) in locks_start_grace() 35 list_add(&lm->list, grace_list); in locks_start_grace() 58 list_del_init(&lm->list); in locks_end_grace() 73 list_for_each_entry(lm, grace_list, list) { in __state_in_grace()
|
/kernel/linux/linux-6.6/fs/nfs_common/ |
H A D | grace.c | 35 if (list_empty(&lm->list)) in locks_start_grace() 36 list_add(&lm->list, grace_list); in locks_start_grace() 58 list_del_init(&lm->list); in locks_end_grace() 73 list_for_each_entry(lm, grace_list, list) { in __state_in_grace()
|
/kernel/linux/linux-6.6/include/linux/ |
H A D | padata.h | 19 #include <linux/list.h> 28 * @list: List entry, to attach to the padata lists. 37 struct list_head list; member 49 * @list: List head. 53 struct list_head list; member 117 * @list: List entry in padata_instance list. 123 struct list_head list; member
|
/kernel/linux/linux-6.6/drivers/infiniband/hw/mlx5/ |
H A D | doorbell.c | 15 * copyright notice, this list of conditions and the following 19 * copyright notice, this list of conditions and the following 41 struct list_head list; member 56 list_for_each_entry(page, &context->db_page_list, list) in mlx5_ib_db_map_user() 79 list_add(&page->list, &context->db_page_list); in mlx5_ib_db_map_user() 98 list_del(&db->u.user_page->list); in mlx5_ib_db_unmap_user()
|
/kernel/linux/linux-6.6/drivers/infiniband/hw/mlx4/ |
H A D | doorbell.c | 15 * copyright notice, this list of conditions and the following 19 * copyright notice, this list of conditions and the following 39 struct list_head list; member 55 list_for_each_entry(page, &context->db_page_list, list) in mlx4_ib_db_map_user() 75 list_add(&page->list, &context->db_page_list); in mlx4_ib_db_map_user() 94 list_del(&db->u.user_page->list); in mlx4_ib_db_unmap_user()
|
/kernel/linux/linux-6.6/drivers/md/bcache/ |
H A D | journal.h | 12 * Journal entries contain a list of keys, ordered by the time they were 84 struct list_head list; member 179 void bch_journal_mark(struct cache_set *c, struct list_head *list); 181 int bch_journal_read(struct cache_set *c, struct list_head *list); 182 int bch_journal_replay(struct cache_set *c, struct list_head *list);
|
/kernel/linux/linux-6.6/net/vmw_vsock/ |
H A D | af_vsock_tap.c | 25 list_add_rcu(&vt->list, &vsock_tap_all); in vsock_add_tap() 39 list_for_each_entry(tmp, &vsock_tap_all, list) { in vsock_remove_tap() 41 list_del_rcu(&vt->list); in vsock_remove_tap() 85 list_for_each_entry_rcu(tmp, &vsock_tap_all, list) { in __vsock_deliver_tap()
|
/third_party/ffmpeg/compat/windows/ |
H A D | makedef | 120 list="" 122 list="${list}"' 129 echo "${list}" | sort | uniq | tail -n +2
|
/third_party/gn/src/gn/ |
H A D | bundle_data_target_generator.cc | 39 if (target_->action_values().outputs().list().size() != 1) { in DoRun() 71 CHECK(outputs.list().size() == value->list_value().size()); in FillOutputs() 72 for (size_t i = 0; i < outputs.list().size(); i++) { in FillOutputs() 73 if (!EnsureSubstitutionIsInBundleDir(outputs.list()[i], in FillOutputs()
|
/third_party/node/deps/icu-small/source/tools/genrb/ |
H A D | filterrb.h | 7 #include <list> 31 const std::list<std::string>& pieces() const; 34 std::list<std::string> fPath; 68 * Implementation of PathFilter for a list of inclusion/exclusion rules. 73 * For example, given this list of filter rules: 165 std::list<std::string>::const_iterator it,
|
/third_party/icu/icu4c/source/tools/genrb/ |
H A D | filterrb.h | 7 #include <list> 31 const std::list<std::string>& pieces() const; 34 std::list<std::string> fPath; 68 * Implementation of PathFilter for a list of inclusion/exclusion rules. 73 * For example, given this list of filter rules: 165 std::list<std::string>::const_iterator it,
|
/third_party/node/deps/v8/src/runtime/ |
H A D | runtime-intl.cc | 24 #include "src/objects/js-list-format-inl.h" 25 #include "src/objects/js-list-format.h" 40 Handle<FixedArray> list = args.at<FixedArray>(1); in RUNTIME_FUNCTION() local 42 isolate, JSListFormat::FormatList(isolate, list_format, list)); in RUNTIME_FUNCTION() 50 Handle<FixedArray> list = args.at<FixedArray>(1); in RUNTIME_FUNCTION() local 52 isolate, JSListFormat::FormatListToParts(isolate, list_format, list)); in RUNTIME_FUNCTION()
|
/third_party/skia/third_party/externals/icu/source/tools/genrb/ |
H A D | filterrb.h | 7 #include <list> 31 const std::list<std::string>& pieces() const; 34 std::list<std::string> fPath; 68 * Implementation of PathFilter for a list of inclusion/exclusion rules. 73 * For example, given this list of filter rules: 165 std::list<std::string>::const_iterator it,
|
/third_party/typescript/tests/baselines/reference/ |
H A D | recursiveTypesUsedAsFunctionParameters.js | 39 var list: List<string>; 42 var r = foo5(list); 65 var list;
67 var r = foo5(list);
|
/third_party/python/Lib/idlelib/ |
H A D | window.py | 24 list = [] 31 list.append((title, key, window)) 32 list.sort() 33 for title, key, window in list:
|
/device/soc/rockchip/common/sdk_linux/kernel/power/ |
H A D | snapshot.c | 29 #include <linux/list.h> 160 * During image restoration, for storing the PBE list and the image data, we can 249 static inline void free_list_of_pages(struct linked_page *list, int clear_page_nosave) in free_list_of_pages() argument 251 while (list) { in free_list_of_pages() 252 struct linked_page *lp = list->next; in free_list_of_pages() 254 free_image_page(list, clear_page_nosave); in free_list_of_pages() 255 list = lp; in free_list_of_pages() 261 * a linked list of pages called 'the chain'. 312 * objects. The main list's elements are of type struct zone_bitmap 314 * object there is a list o 361 struct list_head list; global() member 370 struct list_head list; /* Link Zones together */ global() member 414 alloc_rtree_node(gfp_t gfp_mask, int safe_needed, struct chain_allocator *ca, struct list_head *list) alloc_rtree_node() argument 575 free_mem_extents(struct list_head *list) free_mem_extents() argument 593 create_mem_extents(struct list_head *list, gfp_t gfp_mask) create_mem_extents() argument 916 struct list_head list; global() member [all...] |
/kernel/linux/linux-5.10/kernel/power/ |
H A D | snapshot.c | 29 #include <linux/list.h> 147 * During image restoration, for storing the PBE list and the image data, we can 234 static inline void free_list_of_pages(struct linked_page *list, in free_list_of_pages() argument 237 while (list) { in free_list_of_pages() 238 struct linked_page *lp = list->next; in free_list_of_pages() 240 free_image_page(list, clear_page_nosave); in free_list_of_pages() 241 list = lp; in free_list_of_pages() 247 * a linked list of pages called 'the chain'. 299 * objects. The main list's elements are of type struct zone_bitmap 301 * object there is a list o 348 struct list_head list; global() member 357 struct list_head list; /* Link Zones together */ global() member 401 alloc_rtree_node(gfp_t gfp_mask, int safe_needed, struct chain_allocator *ca, struct list_head *list) alloc_rtree_node() argument 569 free_mem_extents(struct list_head *list) free_mem_extents() argument 586 create_mem_extents(struct list_head *list, gfp_t gfp_mask) create_mem_extents() argument 906 struct list_head list; global() member [all...] |
/kernel/linux/linux-6.6/drivers/misc/mei/ |
H A D | client.c | 27 INIT_LIST_HEAD(&me_cl->list); in mei_me_cl_init() 77 * __mei_me_cl_del - delete me client from the list and decrease 90 list_del_init(&me_cl->list); in __mei_me_cl_del() 95 * mei_me_cl_del - delete me client from the list and decrease 109 * mei_me_cl_add - add me client to the list 117 list_add(&me_cl->list, &dev->me_clients); in mei_me_cl_add() 140 list_for_each_entry(me_cl, &dev->me_clients, list) { in __mei_me_cl_by_uuid() 189 list_for_each_entry(__me_cl, &dev->me_clients, list) { in mei_me_cl_by_id() 220 list_for_each_entry(me_cl, &dev->me_clients, list) { in __mei_me_cl_by_uuid_id() 308 list_for_each_entry_safe(me_cl, next, &dev->me_clients, list) in mei_me_cl_rm_all() [all...] |
/kernel/linux/linux-6.6/kernel/power/ |
H A D | snapshot.c | 29 #include <linux/list.h> 181 * During image restoration, for storing the PBE list and the image data, we can 268 static inline void free_list_of_pages(struct linked_page *list, in free_list_of_pages() argument 271 while (list) { in free_list_of_pages() 272 struct linked_page *lp = list->next; in free_list_of_pages() 274 free_image_page(list, clear_page_nosave); in free_list_of_pages() 275 list = lp; in free_list_of_pages() 281 * a linked list of pages called 'the chain'. 333 * objects. The main list's elements are of type struct zone_bitmap 335 * object there is a list o 382 struct list_head list; global() member 391 struct list_head list; /* Link Zones together */ global() member 440 alloc_rtree_node(gfp_t gfp_mask, int safe_needed, struct chain_allocator *ca, struct list_head *list) alloc_rtree_node() argument 609 free_mem_extents(struct list_head *list) free_mem_extents() argument 626 create_mem_extents(struct list_head *list, gfp_t gfp_mask) create_mem_extents() argument 954 struct list_head list; global() member [all...] |
/kernel/linux/linux-5.10/virt/kvm/ |
H A D | eventfd.c | 20 #include <linux/list.h> 80 list_for_each_entry_rcu(irqfd, &resampler->list, resampler_link) in irqfd_resampler_ack() 97 if (list_empty(&resampler->list)) { in irqfd_resampler_shutdown() 154 return list_empty(&irqfd->list) ? false : true; in irqfd_is_active() 167 list_del_init(&irqfd->list); in irqfd_deactivate() 303 INIT_LIST_HEAD(&irqfd->list); in kvm_irqfd_assign() 354 INIT_LIST_HEAD(&resampler->list); in kvm_irqfd_assign() 365 list_add_rcu(&irqfd->resampler_link, &irqfd->resampler->list); in kvm_irqfd_assign() 381 list_for_each_entry(tmp, &kvm->irqfds.items, list) { in kvm_irqfd_assign() 393 list_add_tail(&irqfd->list, in kvm_irqfd_assign() 658 struct list_head list; global() member [all...] |
/kernel/linux/linux-5.10/scripts/genksyms/ |
H A D | genksyms.c | 57 static void print_list(FILE * f, struct string_list *list); 492 static void print_node(FILE * f, struct string_list *list) in print_node() argument 494 if (symbol_types[list->tag].n) { in print_node() 495 putc(symbol_types[list->tag].n, f); in print_node() 498 fputs(list->string, f); in print_node() 501 static void print_list(FILE * f, struct string_list *list) in print_list() argument 507 if (list == NULL) { in print_list() 512 tmp = list; in print_list() 520 (*tmp2--) = list; in print_list() 521 while ((list in print_list() 532 struct string_list *list = sym->defn; expand_and_crc_sym() local [all...] |
/kernel/linux/linux-6.6/scripts/genksyms/ |
H A D | genksyms.c | 57 static void print_list(FILE * f, struct string_list *list); 492 static void print_node(FILE * f, struct string_list *list) in print_node() argument 494 if (symbol_types[list->tag].n) { in print_node() 495 putc(symbol_types[list->tag].n, f); in print_node() 498 fputs(list->string, f); in print_node() 501 static void print_list(FILE * f, struct string_list *list) in print_list() argument 507 if (list == NULL) { in print_list() 512 tmp = list; in print_list() 520 (*tmp2--) = list; in print_list() 521 while ((list in print_list() 532 struct string_list *list = sym->defn; expand_and_crc_sym() local [all...] |
/kernel/linux/linux-6.6/virt/kvm/ |
H A D | eventfd.c | 20 #include <linux/list.h> 62 list_for_each_entry_srcu(irqfd, &resampler->list, resampler_link, in irqfd_resampler_notify() 102 if (list_empty(&resampler->list)) { in irqfd_resampler_shutdown() 163 return list_empty(&irqfd->list) ? false : true; in irqfd_is_active() 176 list_del_init(&irqfd->list); in irqfd_deactivate() 324 INIT_LIST_HEAD(&irqfd->list); in kvm_irqfd_assign() 375 INIT_LIST_HEAD(&resampler->list); in kvm_irqfd_assign() 386 list_add_rcu(&irqfd->resampler_link, &irqfd->resampler->list); in kvm_irqfd_assign() 402 list_for_each_entry(tmp, &kvm->irqfds.items, list) { in kvm_irqfd_assign() 414 list_add_tail(&irqfd->list, in kvm_irqfd_assign() 710 struct list_head list; global() member [all...] |