Home
last modified time | relevance | path

Searched full:list (Results 1 – 25 of 10124) sorted by relevance

12345678910>>...405

/OK3568_Linux_fs/kernel/drivers/gpu/arm/mali400/mali/common/
H A Dmali_osk_list.h50 /** @brief Initialize a list to be a head of an empty list
51 * @param exp the list to initialize. */
54 /** @brief Define a list variable, which is uninitialized.
55 * @param exp the name of the variable that the list will be defined as. */
58 /** @brief Define a list variable, which is initialized.
59 * @param exp the name of the variable that the list will be defined as. */
62 /** @brief Initialize a list element.
64 * All list elements must be initialized before use.
66 * Do not use on any list element that is present in a list without using
67 * _mali_osk_list_del first, otherwise this will break the list.
[all …]
/OK3568_Linux_fs/kernel/tools/perf/util/
H A Dparse-events.y31 struct list_head *list; in alloc_list() local
33 list = malloc(sizeof(*list)); in alloc_list()
34 if (!list) in alloc_list()
37 INIT_LIST_HEAD(list); in alloc_list()
38 return list; in alloc_list()
52 static void inc_group_count(struct list_head *list, in inc_group_count() argument
56 if (!list_is_last(list->next, list)) in inc_group_count()
148 parse_events_update_lists($1, &parse_state->list);
154 struct list_head *list = $1; variable
158 parse_events_update_lists(group, list);
[all …]
/OK3568_Linux_fs/kernel/drivers/clk/rockchip/
H A Dclk.c447 struct rockchip_pll_clock *list, in rockchip_clk_register_plls() argument
453 for (idx = 0; idx < nr_pll; idx++, list++) { in rockchip_clk_register_plls()
454 clk = rockchip_clk_register_pll(ctx, list->type, list->name, in rockchip_clk_register_plls()
455 list->parent_names, list->num_parents, in rockchip_clk_register_plls()
456 list->con_offset, grf_lock_offset, in rockchip_clk_register_plls()
457 list->lock_shift, list->mode_offset, in rockchip_clk_register_plls()
458 list->mode_shift, list->rate_table, in rockchip_clk_register_plls()
459 list->flags, list->pll_flags); in rockchip_clk_register_plls()
462 list->name); in rockchip_clk_register_plls()
466 rockchip_clk_add_lookup(ctx, clk, list->id); in rockchip_clk_register_plls()
[all …]
/OK3568_Linux_fs/kernel/lib/
H A Dlist-test.c3 * KUnit test for the Kernel Linked-list structures.
10 #include <linux/list.h>
14 struct list_head list; member
19 /* Test the different ways of initialising a list. */ in list_test_list_init()
49 LIST_HEAD(list); in list_test_list_add()
51 list_add(&a, &list); in list_test_list_add()
52 list_add(&b, &list); in list_test_list_add()
54 /* should be [list] -> b -> a */ in list_test_list_add()
55 KUNIT_EXPECT_PTR_EQ(test, list.next, &b); in list_test_list_add()
56 KUNIT_EXPECT_PTR_EQ(test, b.prev, &list); in list_test_list_add()
[all …]
/OK3568_Linux_fs/external/xserver/include/
H A Dlist.h32 * @file Classic doubly-link circular list implementation.
33 * For real usage examples of the linked list, see the file test/list.c
36 * We need to keep a list of struct foo in the parent struct bar, i.e. what
45 * We need one list head in bar and a list element in all list_of_foos (both are of
60 * Now we initialize the list head:
66 * Then we create the first element and add it to this list:
72 * Repeat the above for each element you want to add to the list. Deleting
78 * list again.
80 * Looping through the list requires a 'struct foo' as iterator and the
101 * The linkage struct for list nodes. This struct must be part of your
[all …]
/OK3568_Linux_fs/kernel/include/linux/
H A Dlist.h12 * Simple doubly linked list implementation.
28 * @list: list_head structure to be initialized.
30 * Initializes the list_head to point to itself. If it is a list header,
31 * the result is an empty list.
33 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
35 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD()
36 list->prev = list; in INIT_LIST_HEAD()
60 * This is only for internal list manipulation where we know
79 * @head: list head to add it after
93 * @head: list head to add it before
[all …]
H A Drculist.h8 * RCU-protected list version
10 #include <linux/list.h>
16 * and compares it to the address of the list head, but neither dereferences
24 * @list: list to be initialized
27 * cleanup tasks, when readers have no access to the list being initialized.
28 * However, if the list being initialized is visible to readers, you
31 static inline void INIT_LIST_HEAD_RCU(struct list_head *list) in INIT_LIST_HEAD_RCU() argument
33 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD_RCU()
34 WRITE_ONCE(list->prev, list); in INIT_LIST_HEAD_RCU()
41 #define list_next_rcu(list) (*((struct list_head __rcu **)(&(list)->next))) argument
[all …]
H A Dllist.h5 * Lock-less NULL terminated single linked list
16 * needed. This is because llist_del_first depends on list->first->next not
19 * preempted back, the list->first is the same as before causing the cmpxchg in
35 * The list entries deleted via llist_del_all can be traversed with
36 * traversing function such as llist_for_each etc. But the list
37 * entries can not be traversed safely before deleted from the list.
42 * The basic atomic operation of this list is cmpxchg on long. On
44 * list can NOT be used in NMI handlers. So code that uses the list in
66 * init_llist_head - initialize lock-less list head
67 * @head: the head for your lock-less list
[all …]
/OK3568_Linux_fs/kernel/tools/include/linux/
H A Dlist.h11 * Simple doubly linked list implementation.
25 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
27 list->next = list; in INIT_LIST_HEAD()
28 list->prev = list; in INIT_LIST_HEAD()
34 * This is only for internal list manipulation where we know
56 * @head: list head to add it after
70 * @head: list head to add it before
81 * Delete a list entry by making the prev/next entries
84 * This is only for internal list manipulation where we know
94 * list_del - deletes entry from list.
[all …]
/OK3568_Linux_fs/external/security/librkcrypto/include/
H A Drk_list.h37 * non-initialized list entries.
63 * Simple doubly linked list implementation.
79 * @list: list_head structure to be initialized.
81 * Initializes the list_head to point to itself. If it is a list header,
82 * the result is an empty list.
84 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
86 list->next = list; in INIT_LIST_HEAD()
87 list->prev = list; in INIT_LIST_HEAD()
93 * This is only for internal list manipulation where we know
114 * @head: list head to add it after
[all …]
/OK3568_Linux_fs/u-boot/include/linux/
H A Dlist.h13 * Simple doubly linked list implementation.
31 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
33 list->next = list; in INIT_LIST_HEAD()
34 list->prev = list; in INIT_LIST_HEAD()
40 * This is only for internal list manipulation where we know
56 * @head: list head to add it after
69 * @head: list head to add it before
80 * Delete a list entry by making the prev/next entries
83 * This is only for internal list manipulation where we know
93 * list_del - deletes entry from list.
[all …]
/OK3568_Linux_fs/external/camera_engine_rkaiq/rkaiq/include/common/
H A Dlist.h1 // This list structure implementation is adapted from the list implementation
5 …ernel.org/?p=linux/kernel/git/stable/linux-2.6.25.y.git;a=blob_plain;f=include/linux/list.h;hb=HEAD
11 * Simple doubly linked list implementation.
45 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
47 list->next = list; in INIT_LIST_HEAD()
48 list->prev = list; in INIT_LIST_HEAD()
54 * This is only for internal list manipulation where we know
70 * @head: list head to add it after
85 * @head: list head to add it before
97 * Delete a list entry by making the prev/next entries
[all …]
/OK3568_Linux_fs/external/rk_pcba_test/pcba_minui/
H A Dlist.h55 * non-initialized list entries.
63 * Simple doubly linked list implementation.
77 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
79 list->next = list; in INIT_LIST_HEAD()
80 list->prev = list; in INIT_LIST_HEAD()
86 * This is only for internal list manipulation where we know
108 * @head: list head to add it after
122 * @head: list head to add it before
133 * Delete a list entry by making the prev/next entries
136 * This is only for internal list manipulation where we know
[all …]
/OK3568_Linux_fs/kernel/drivers/clk/samsung/
H A Dclk.c95 /* register a list of aliases */
97 const struct samsung_clock_alias *list, in samsung_clk_register_alias() argument
103 for (idx = 0; idx < nr_clk; idx++, list++) { in samsung_clk_register_alias()
104 if (!list->id) { in samsung_clk_register_alias()
110 clk_hw = ctx->clk_data.hws[list->id]; in samsung_clk_register_alias()
113 list->id); in samsung_clk_register_alias()
117 ret = clk_hw_register_clkdev(clk_hw, list->alias, in samsung_clk_register_alias()
118 list->dev_name); in samsung_clk_register_alias()
121 __func__, list->alias); in samsung_clk_register_alias()
125 /* register a list of fixed clocks */
[all …]
/OK3568_Linux_fs/yocto/poky/meta/recipes-devtools/binutils/binutils/
H A D0018-CVE-2022-38128-1.patch7 time taken to search the list of abbrevs converted to internal form is
17 (process_abbrev_set): Return newly allocated list. Move
22 (process_debug_info): Consolidate cached list lookup, new list
24 Free list when not cached.
42 -record_abbrev_list_for_cu (dwarf_vma start, dwarf_vma end, abbrev_list * list)
44 + abbrev_list *list, abbrev_list *free_list)
48 + list->next = abbrev_lists;
49 + abbrev_lists = list;
61 - abbrev_list * list = (abbrev_list *) xcalloc (sizeof * list, 1);
63 - list->abbrev_base = abbrev_base;
[all …]
H A D0018-CVE-2022-38128-3.patch20 (process_abbrev_set): Set list->raw and list->next.
21 (find_and_process_abbrev_set): Replace abbrev list lookup with
22 new function. Don't set list abbrev_base, abbrev_offset or next.
53 abbrev_list * list;
55 for (list = abbrev_lists; list != NULL; list = list->next)
56 - if (list->abbrev_base == abbrev_base
57 - && list->abbrev_offset == abbrev_offset)
58 + if (list->raw == raw)
59 return list;
63 abbrev_list *list = xmalloc (sizeof (*list));
[all …]
/OK3568_Linux_fs/kernel/drivers/gpu/drm/nouveau/include/nvif/
H A Dlist.h26 /* Modified by Ben Skeggs <bskeggs@redhat.com> to match kernel list APIs */
32 * @file Classic doubly-link circular list implementation.
33 * For real usage examples of the linked list, see the file test/list.c
36 * We need to keep a list of struct foo in the parent struct bar, i.e. what
45 * We need one list head in bar and a list element in all list_of_foos (both are of
60 * Now we initialize the list head:
66 * Then we create the first element and add it to this list:
72 * Repeat the above for each element you want to add to the list. Deleting
78 * list again.
80 * Looping through the list requires a 'struct foo' as iterator and the
[all …]
/OK3568_Linux_fs/kernel/tools/firewire/
H A Dlist.h2 struct list { struct
3 struct list *next, *prev; argument
7 list_init(struct list *list) in list_init() argument
9 list->next = list; in list_init()
10 list->prev = list; in list_init()
14 list_empty(struct list *list) in list_empty() argument
16 return list->next == list; in list_empty()
20 list_insert(struct list *link, struct list *new_link) in list_insert()
29 list_append(struct list *list, struct list *new_link) in list_append() argument
31 list_insert((struct list *)list, new_link); in list_append()
[all …]
/OK3568_Linux_fs/external/camera_engine_rkaiq/rkaiq/
H A DCMakeLists.txt15 list(APPEND CMAKE_MODULE_PATH "${CMAKE_CURRENT_SOURCE_DIR}/cmake")
158 list(APPEND ALGO_HANDLE_SRC aiq_core/algo_handlers/RkAiqAynrV2Handle.cpp)
163 list(APPEND ALGO_HANDLE_SRC aiq_core/algo_handlers/RkAiqAwbHandle.cpp)
164 list(APPEND ALGO_HANDLE_SRC aiq_core/algo_handlers/RkAiqCustomAwbHandle.cpp)
169 list(APPEND ALGO_HANDLE_SRC aiq_core/algo_handlers/RkAiqAwbV21Handle.cpp)
170 list(APPEND ALGO_HANDLE_SRC aiq_core/algo_handlers/RkAiqCustomAwbHandle.cpp)
175 list(APPEND ALGO_HANDLE_SRC aiq_core/algo_handlers/RkAiqAwbV32Handle.cpp)
176 list(APPEND ALGO_HANDLE_SRC aiq_core/algo_handlers/RkAiqCustomAwbHandle.cpp)
189 list(APPEND ALGO_HANDLE_SRC aiq_core/algo_handlers/RkAiqAgicHandle.cpp)
194 list(APPEND ALGO_HANDLE_SRC aiq_core/algo_handlers/RkAiqAorbHandle.cpp)
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/bits/
H A Dstl_list.h1 // List implementation -*- C++ -*-
53 * Do not attempt to use it directly. @headername{list}
79 /// Common part of a node in the %list. in _GLIBCXX_VISIBILITY()
102 /// The %list node header. in _GLIBCXX_VISIBILITY()
164 /// An actual node in the %list. in _GLIBCXX_VISIBILITY()
180 * @brief A list::iterator. in _GLIBCXX_VISIBILITY()
256 // The only member points to the %list element. in _GLIBCXX_VISIBILITY()
261 * @brief A list::const_iterator. in _GLIBCXX_VISIBILITY()
342 // The only member points to the %list element. in _GLIBCXX_VISIBILITY()
497 // This is what actually destroys the list. in _GLIBCXX_VISIBILITY()
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/bits/
H A Dstl_list.h1 // List implementation -*- C++ -*-
53 * Do not attempt to use it directly. @headername{list}
79 /// Common part of a node in the %list. in _GLIBCXX_VISIBILITY()
102 /// The %list node header. in _GLIBCXX_VISIBILITY()
164 /// An actual node in the %list. in _GLIBCXX_VISIBILITY()
180 * @brief A list::iterator. in _GLIBCXX_VISIBILITY()
256 // The only member points to the %list element. in _GLIBCXX_VISIBILITY()
261 * @brief A list::const_iterator. in _GLIBCXX_VISIBILITY()
342 // The only member points to the %list element. in _GLIBCXX_VISIBILITY()
497 // This is what actually destroys the list. in _GLIBCXX_VISIBILITY()
[all …]
/OK3568_Linux_fs/yocto/meta-openembedded/meta-oe/recipes-support/multipath-tools/files/
H A DCVE-2022-41974.patch53 - set_handler_callback(LIST+PATHS, cli_list_paths);
54 - set_handler_callback(LIST+PATHS+FMT, cli_list_paths_fmt);
55 - set_handler_callback(LIST+PATHS+RAW+FMT, cli_list_paths_raw);
56 - set_handler_callback(LIST+PATH, cli_list_path);
57 - set_handler_callback(LIST+MAPS, cli_list_maps);
58 - set_handler_callback(LIST+STATUS, cli_list_status);
59 - set_unlocked_handler_callback(LIST+DAEMON, cli_list_daemon);
60 - set_handler_callback(LIST+MAPS+STATUS, cli_list_maps_status);
61 - set_handler_callback(LIST+MAPS+STATS, cli_list_maps_stats);
62 - set_handler_callback(LIST+MAPS+FMT, cli_list_maps_fmt);
[all …]
/OK3568_Linux_fs/kernel/net/core/
H A Ddev_addr_lists.c13 #include <linux/list.h>
16 * General list handling functions
19 static int __hw_addr_create_ex(struct netdev_hw_addr_list *list, in __hw_addr_create_ex() argument
39 list_add_tail_rcu(&ha->list, &list->list); in __hw_addr_create_ex()
40 list->count++; in __hw_addr_create_ex()
45 static int __hw_addr_add_ex(struct netdev_hw_addr_list *list, in __hw_addr_add_ex() argument
55 list_for_each_entry(ha, &list->list, list) { in __hw_addr_add_ex()
76 return __hw_addr_create_ex(list, addr, addr_len, addr_type, global, in __hw_addr_add_ex()
80 static int __hw_addr_add(struct netdev_hw_addr_list *list, in __hw_addr_add() argument
84 return __hw_addr_add_ex(list, addr, addr_len, addr_type, false, false, in __hw_addr_add()
[all …]
/OK3568_Linux_fs/kernel/drivers/net/ethernet/intel/ice/
H A Dice_fltr.c10 * @h: pointer to the list head to be freed
26 * ice_fltr_add_entry_to_list - allocate and add filter entry to list
28 * @info: filter info struct that gets added to the passed in list
29 * @list: pointer to the list which contains MAC filters entry
33 struct list_head *list) in ice_fltr_add_entry_to_list() argument
44 list_add(&entry->list_entry, list); in ice_fltr_add_entry_to_list()
50 * ice_fltr_add_mac_list - add list of MAC filters
52 * @list: list of filters
55 ice_fltr_add_mac_list(struct ice_vsi *vsi, struct list_head *list) in ice_fltr_add_mac_list() argument
57 return ice_add_mac(&vsi->back->hw, list); in ice_fltr_add_mac_list()
[all …]
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/libcxx/include/
H A Dlist2 //===---------------------------- list ------------------------------------===//
15 list synopsis
21 class list
39 list()
41 explicit list(const allocator_type& a);
42 explicit list(size_type n);
43 explicit list(size_type n, const allocator_type& a); // C++14
44 list(size_type n, const value_type& value);
45 list(size_type n, const value_type& value, const allocator_type& a);
47 list(Iter first, Iter last);
[all …]

12345678910>>...405