Home
last modified time | relevance | path

Searched refs:list (Results 101 - 125 of 14041) sorted by relevance

12345678910>>...562

/third_party/node/test/parallel/
H A Dtest-stream2-objects.js30 const list = [];
32 list.push(chunk);
36 callback(list);
42 function fromArray(list) {
45 list.forEach(function(chunk) {
70 r.pipe(toArray(common.mustCall(function(list) {
71 assert.deepStrictEqual(list, [
89 const list = [{ one: '1' }, { two: '2' }];
91 const item = list.shift();
95 r.pipe(toArray(common.mustCall(function(list) {
[all...]
/kernel/linux/linux-5.10/tools/vm/
H A Dpage_owner_sort.c27 static struct block_list *list; variable
65 len == list[list_size-1].len && in add_list()
66 memcmp(buf, list[list_size-1].txt, len) == 0) { in add_list()
67 list[list_size-1].num++; in add_list()
74 list[list_size].txt = malloc(len+1); in add_list()
75 list[list_size].len = len; in add_list()
76 list[list_size].num = 1; in add_list()
77 memcpy(list[list_size].txt, buf, len); in add_list()
78 list[list_size].txt[len] = 0; in add_list()
113 list in main()
[all...]
/kernel/linux/linux-6.6/drivers/gpu/host1x/
H A Dintr.c14 static void host1x_intr_add_fence_to_list(struct host1x_fence_list *list, in host1x_intr_add_fence_to_list() argument
19 list_for_each_entry_reverse(fence_in_list, &list->list, list) { in host1x_intr_add_fence_to_list()
21 /* Fence in list is before us, we can insert here */ in host1x_intr_add_fence_to_list()
22 list_add(&fence->list, &fence_in_list->list); in host1x_intr_add_fence_to_list()
27 /* Add as first in list */ in host1x_intr_add_fence_to_list()
28 list_add(&fence->list, &list in host1x_intr_add_fence_to_list()
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/amd/amdgpu/
H A Damdgpu_bo_list.h54 void amdgpu_bo_list_get_list(struct amdgpu_bo_list *list,
56 void amdgpu_bo_list_put(struct amdgpu_bo_list *list);
64 struct amdgpu_bo_list **list);
67 amdgpu_bo_list_array_entry(struct amdgpu_bo_list *list, unsigned index) in amdgpu_bo_list_array_entry() argument
69 struct amdgpu_bo_list_entry *array = (void *)&list[1]; in amdgpu_bo_list_array_entry()
74 #define amdgpu_bo_list_for_each_entry(e, list) \
75 for (e = amdgpu_bo_list_array_entry(list, 0); \
76 e != amdgpu_bo_list_array_entry(list, (list)->num_entries); \
79 #define amdgpu_bo_list_for_each_userptr_entry(e, list) \
[all...]
/kernel/linux/linux-5.10/drivers/pnp/isapnp/
H A Dcompat.c33 struct list_head *list; in pnp_find_dev() local
35 list = pnp_global.next; in pnp_find_dev()
37 list = from->global_list.next; in pnp_find_dev()
39 while (list != &pnp_global) { in pnp_find_dev()
40 struct pnp_dev *dev = global_to_pnp_dev(list); in pnp_find_dev()
45 list = list->next; in pnp_find_dev()
48 struct list_head *list; in pnp_find_dev() local
50 list = card->devices.next; in pnp_find_dev()
52 list in pnp_find_dev()
[all...]
/kernel/linux/linux-6.6/drivers/pnp/isapnp/
H A Dcompat.c33 struct list_head *list; in pnp_find_dev() local
35 list = pnp_global.next; in pnp_find_dev()
37 list = from->global_list.next; in pnp_find_dev()
39 while (list != &pnp_global) { in pnp_find_dev()
40 struct pnp_dev *dev = global_to_pnp_dev(list); in pnp_find_dev()
45 list = list->next; in pnp_find_dev()
48 struct list_head *list; in pnp_find_dev() local
50 list = card->devices.next; in pnp_find_dev()
52 list in pnp_find_dev()
[all...]
/third_party/elfutils/libelf/
H A Delf_nextscn.c44 Elf_ScnList *list; in elf_nextscn() local
59 list = &elf->state.elf32.scns; in elf_nextscn()
61 list = &elf->state.elf64.scns; in elf_nextscn()
63 scn = &list->data[0]; in elf_nextscn()
66 list = scn->list; in elf_nextscn()
68 if (scn + 1 < &list->data[list->cnt]) in elf_nextscn()
70 else if (scn + 1 == &list->data[list in elf_nextscn()
[all...]
/third_party/libinput/src/
H A Dutil-list.h34 * This list data structure is a verbatim copy from wayland-util.h from the
39 * Doubly linked list implementation. This struct is used for both the list
40 * nodes and the list head. Use like this:
45 * struct list list_of_bars; // the list head
49 * struct list link; // links between the bars
60 struct list { struct
61 struct list *prev;
62 struct list *nex
[all...]
/third_party/python/Lib/test/
H A Dtest_genericalias.py91 generic_types = [type, tuple, list, dict, set, frozenset, enumerate,
150 for t in tuple, list, dict, set, frozenset, defaultdict, deque:
168 t = list[int]
177 class C(list[int]):
179 self.assertEqual(C.__bases__, (list,))
188 t = list[int]
193 class MyList(list):
201 class MyList(list):
203 self.assertEqual(repr(list[str]), 'list[st
[all...]
H A Dtest_iter.py134 # Cannot assert type equality because dict iterators unpickle as list
138 self.assertEqual(list(it), seq)
147 self.assertEqual(list(it), seq[1:])
151 self.check_iterator(iter(range(10)), list(range(10)))
155 seq = list(range(10))
162 self.check_for_loop(iter(range(10)), list(range(10)))
164 # Test several independent iterators over the same list
174 # Test triple list comprehension using iterators
181 # Test triple list comprehension without iterators
189 self.check_for_loop(IteratingSequenceClass(10), list(rang
[all...]
/kernel/linux/linux-6.6/net/netfilter/
H A Dnf_conncount.c21 #include <linux/list.h>
51 struct nf_conncount_list list; member
85 static void conn_free(struct nf_conncount_list *list, in conn_free() argument
88 lockdep_assert_held(&list->list_lock); in conn_free()
90 list->count--; in conn_free()
97 find_or_evict(struct net *net, struct nf_conncount_list *list, in find_or_evict() argument
118 conn_free(list, conn); in find_or_evict()
126 struct nf_conncount_list *list, in __nf_conncount_add()
135 if (time_is_after_eq_jiffies((unsigned long)list->last_gc)) in __nf_conncount_add()
139 list_for_each_entry_safe(conn, conn_n, &list in __nf_conncount_add()
125 __nf_conncount_add(struct net *net, struct nf_conncount_list *list, const struct nf_conntrack_tuple *tuple, const struct nf_conntrack_zone *zone) __nf_conncount_add() argument
201 nf_conncount_add(struct net *net, struct nf_conncount_list *list, const struct nf_conntrack_tuple *tuple, const struct nf_conntrack_zone *zone) nf_conncount_add() argument
217 nf_conncount_list_init(struct nf_conncount_list *list) nf_conncount_list_init() argument
227 nf_conncount_gc_list(struct net *net, struct nf_conncount_list *list) nf_conncount_gc_list() argument
561 nf_conncount_cache_free(struct nf_conncount_list *list) nf_conncount_cache_free() argument
[all...]
/test/xts/acts/hiviewdfx/hiappeventtest/hiappeventndktest/entry/src/main/cpp/
H A Dhiappeventndk.cpp46 ParamList list = OH_HiAppEvent_CreateParamList(); in OHHiAppEventWrite() local
48 OH_HiAppEvent_AddInt32Param(list, "int32_key", num); in OHHiAppEventWrite()
50 OH_HiAppEvent_AddInt32ArrayParam(list, "int32_arr_key", numArray, sizeof(numArray) / sizeof(numArray[0])); in OHHiAppEventWrite()
51 int ret = OH_HiAppEvent_Write("domain", "name", BEHAVIOR, list); in OHHiAppEventWrite()
59 ParamList list = OH_HiAppEvent_CreateParamList(); in OHHiAppEventConfigure() local
61 OH_HiAppEvent_AddInt32Param(list, "int32_key", num); in OHHiAppEventConfigure()
75 ParamList list = OH_HiAppEvent_CreateParamList(); in OHHiAppEventAddBoolParam() local
76 OH_HiAppEvent_AddBoolParam(list, "bool_key", true); in OHHiAppEventAddBoolParam()
77 int ret = OH_HiAppEvent_Write("domain", "name", BEHAVIOR, list); in OHHiAppEventAddBoolParam()
85 ParamList list in OHHiAppEventAddBoolArrayParam() local
96 ParamList list = OH_HiAppEvent_CreateParamList(); OHHiAppEventAddInt8Param() local
107 ParamList list = OH_HiAppEvent_CreateParamList(); OHHiAppEventAddInt8ArrayParam() local
118 ParamList list = OH_HiAppEvent_CreateParamList(); OHHiAppEventAddInt16Param() local
129 ParamList list = OH_HiAppEvent_CreateParamList(); OHHiAppEventAddInt16ArrayParam() local
140 ParamList list = OH_HiAppEvent_CreateParamList(); OHHiAppEventAddInt32Param() local
151 ParamList list = OH_HiAppEvent_CreateParamList(); OHHiAppEventAddInt32ArrayParam() local
162 ParamList list = OH_HiAppEvent_CreateParamList(); OHHiAppEventAddInt64Param() local
173 ParamList list = OH_HiAppEvent_CreateParamList(); OHHiAppEventAddInt64ArrayParam() local
184 ParamList list = OH_HiAppEvent_CreateParamList(); OHHiAppEventAddFloatParam() local
195 ParamList list = OH_HiAppEvent_CreateParamList(); OHHiAppEventAddFloatArrayParam() local
206 ParamList list = OH_HiAppEvent_CreateParamList(); OHHiAppEventAddDoubleParam() local
217 ParamList list = OH_HiAppEvent_CreateParamList(); OHHiAppEventAddDoubleArrayParam() local
228 ParamList list = OH_HiAppEvent_CreateParamList(); OHHiAppEventAddStringParam() local
239 ParamList list = OH_HiAppEvent_CreateParamList(); OHHiAppEventAddStringArrayParam() local
252 ParamList list = OH_HiAppEvent_CreateParamList(); OHHiAppEventCreateParamList() local
[all...]
/third_party/protobuf/java/core/src/main/java/com/google/protobuf/
H A DExtensionSchemaFull.java10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
103 List<Double> list = new ArrayList<Double>(); in parseExtension()
104 reader.readDoubleList(list); in parseExtension()
105 value = list; in parseExtension()
110 List<Float> list = new ArrayList<Float>(); in parseExtension()
111 reader.readFloatList(list); in parseExtension()
112 value = list; in parseExtension()
117 List<Long> list = new ArrayList<Long>(); in parseExtension()
118 reader.readInt64List(list); in parseExtension()
[all...]
H A DExtensionSchemaLite.java10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
86 List<Double> list = new ArrayList<Double>(); in parseExtension()
87 reader.readDoubleList(list); in parseExtension()
88 value = list; in parseExtension()
93 List<Float> list = new ArrayList<Float>(); in parseExtension()
94 reader.readFloatList(list); in parseExtension()
95 value = list; in parseExtension()
100 List<Long> list = new ArrayList<Long>(); in parseExtension()
101 reader.readInt64List(list); in parseExtension()
[all...]
/third_party/skia/third_party/externals/freetype/src/base/
H A Dftutil.c5 * FreeType utility file for memory and list management (body).
238 #define FT_COMPONENT list
243 FT_List_Find( FT_List list, in FT_EXPORT_DEF()
249 if ( !list ) in FT_EXPORT_DEF()
252 cur = list->head; in FT_EXPORT_DEF()
268 FT_List_Add( FT_List list, in FT_List_Add() argument
274 if ( !list || !node ) in FT_List_Add()
277 before = list->tail; in FT_List_Add()
285 list->head = node; in FT_List_Add()
287 list in FT_List_Add()
294 FT_List_Insert( FT_List list, FT_ListNode node ) FT_List_Insert() argument
320 FT_List_Remove( FT_List list, FT_ListNode node ) FT_List_Remove() argument
347 FT_List_Up( FT_List list, FT_ListNode node ) FT_List_Up() argument
412 FT_List_Finalize( FT_List list, FT_List_Destructor destroy, FT_Memory memory, void* user ) FT_List_Finalize() argument
[all...]
/test/xts/device_attest/services/core/utils/
H A Dattest_utils_list.c25 int32_t CreateList(List *list) in CreateList() argument
27 if (list == NULL) { in CreateList()
30 list->head = NULL; in CreateList()
34 int32_t AddListNode(List *list, void *data) in AddListNode() argument
36 if (list == NULL || data == NULL) { in AddListNode()
39 ListNode* head = list->head; in AddListNode()
60 if (list->head == NULL) { in AddListNode()
61 list->head = node; in AddListNode()
68 int32_t GetListSize(List *list) in GetListSize() argument
70 if (list in GetListSize()
82 ReleaseList(List *list) ReleaseList() argument
[all...]
/test/xts/device_attest_lite/services/core/utils/
H A Dattest_utils_list.c25 int32_t CreateList(List *list) in CreateList() argument
27 if (list == NULL) { in CreateList()
30 list->head = NULL; in CreateList()
34 int32_t AddListNode(List *list, void *data) in AddListNode() argument
36 if (list == NULL || data == NULL) { in AddListNode()
39 ListNode* head = list->head; in AddListNode()
60 if (list->head == NULL) { in AddListNode()
61 list->head = node; in AddListNode()
68 int32_t GetListSize(List *list) in GetListSize() argument
70 if (list in GetListSize()
82 ReleaseList(List *list) ReleaseList() argument
[all...]
/third_party/curl/lib/
H A Dslist.c35 /* returns last node in linked list */
36 static struct curl_slist *slist_get_last(struct curl_slist *list) in slist_get_last() argument
41 if(!list) in slist_get_last()
45 item = list; in slist_get_last()
53 * Curl_slist_append_nodup() appends a string to the linked list. Rather than
61 struct curl_slist *Curl_slist_append_nodup(struct curl_slist *list, char *data) in Curl_slist_append_nodup() argument
75 /* if this is the first item, then new_item *is* the list */ in Curl_slist_append_nodup()
76 if(!list) in Curl_slist_append_nodup()
79 last = slist_get_last(list); in Curl_slist_append_nodup()
81 return list; in Curl_slist_append_nodup()
91 curl_slist_append(struct curl_slist *list, const char *data) curl_slist_append() argument
131 curl_slist_free_all(struct curl_slist *list) curl_slist_free_all() argument
[all...]
/test/xts/acts/arkui/ace_c_arkui_test/entry/src/main/cpp/accessibility/
H A Dlist_accessibilitylevel_test.cpp22 NAPI_START(list, ARKUI_NODE_LIST); in TestListAccessibilityLevel001()
26 auto ret = nodeAPI->setAttribute(list, NODE_ACCESSIBILITY_MODE, &valueItem); in TestListAccessibilityLevel001()
28 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_ACCESSIBILITY_MODE)->value[PARAM_0].i32, accessibilityLevel); in TestListAccessibilityLevel001()
34 NAPI_START(list, ARKUI_NODE_LIST); in TestListAccessibilityLevel002()
38 auto ret = nodeAPI->setAttribute(list, NODE_ACCESSIBILITY_MODE, &valueItem); in TestListAccessibilityLevel002()
40 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_ACCESSIBILITY_MODE)->value[PARAM_0].i32, accessibilityLevel); in TestListAccessibilityLevel002()
46 NAPI_START(list, ARKUI_NODE_LIST); in TestListAccessibilityLevel003()
50 auto ret = nodeAPI->setAttribute(list, NODE_ACCESSIBILITY_MODE, &valueItem); in TestListAccessibilityLevel003()
52 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_ACCESSIBILITY_MODE)->value[PARAM_0].i32, accessibilityLevel); in TestListAccessibilityLevel003()
58 NAPI_START(list, ARKUI_NODE_LIS in TestListAccessibilityLevel004()
[all...]
/test/xts/acts/arkui/ace_c_arkui_test/entry/src/main/cpp/list/
H A Dlist_shadow_test.cpp22 NAPI_START(list, ARKUI_NODE_LIST); in TestListShadow001()
26 auto ret = nodeAPI->setAttribute(list, NODE_SHADOW, &valueItem); in TestListShadow001()
28 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_SHADOW)->value[PARAM_0].i32, shadow); in TestListShadow001()
34 NAPI_START(list, ARKUI_NODE_LIST); in TestListShadow002()
38 auto ret = nodeAPI->setAttribute(list, NODE_SHADOW, &valueItem); in TestListShadow002()
40 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_SHADOW)->value[PARAM_0].i32, shadow); in TestListShadow002()
46 NAPI_START(list, ARKUI_NODE_LIST); in TestListShadow003()
50 auto ret = nodeAPI->setAttribute(list, NODE_SHADOW, &valueItem); in TestListShadow003()
52 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_SHADOW)->value[PARAM_0].i32, shadow); in TestListShadow003()
58 NAPI_START(list, ARKUI_NODE_LIS in TestListShadow004()
[all...]
H A Dlist_bordercolor_test.cpp22 NAPI_START(list, ARKUI_NODE_LIST); in TestListBorderColor001()
26 auto ret = nodeAPI->setAttribute(list, NODE_BORDER_COLOR, &valueItem); in TestListBorderColor001()
28 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_BORDER_COLOR)->value[PARAM_0].u32, borderColor); in TestListBorderColor001()
29 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_BORDER_COLOR)->value[PARAM_1].u32, borderColor); in TestListBorderColor001()
30 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_BORDER_COLOR)->value[PARAM_2].u32, borderColor); in TestListBorderColor001()
31 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_BORDER_COLOR)->value[PARAM_3].u32, borderColor); in TestListBorderColor001()
37 NAPI_START(list, ARKUI_NODE_LIST); in TestListBorderColor002()
45 auto ret = nodeAPI->setAttribute(list, NODE_BORDER_COLOR, &valueItem); in TestListBorderColor002()
47 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_BORDER_COLOR)->value[PARAM_0].u32, borderColorUp); in TestListBorderColor002()
48 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_BORDER_COLO in TestListBorderColor002()
[all...]
/third_party/protobuf/java/compatibility_tests/v2.5.0/tests/src/main/java/com/google/protobuf/test/
H A DUnmodifiableLazyStringListTest.java10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
56 UnmodifiableLazyStringList list = new UnmodifiableLazyStringList(rawList); in testReadOnlyMethods()
57 assertEquals(3, list.size()); in testReadOnlyMethods()
58 assertSame(STRING_A, list.get(0)); in testReadOnlyMethods()
59 assertSame(STRING_B, list.get(1)); in testReadOnlyMethods()
60 assertSame(STRING_C, list.get(2)); in testReadOnlyMethods()
61 assertEquals(BYTE_STRING_A, list.getByteString(0)); in testReadOnlyMethods()
62 assertEquals(BYTE_STRING_B, list.getByteString(1)); in testReadOnlyMethods()
63 assertEquals(BYTE_STRING_C, list in testReadOnlyMethods()
[all...]
/third_party/ffmpeg/libavcodec/
H A Dh264_parse.c34 int list, i, j; in ff_h264_pred_weight_table() local
56 for (list = 0; list < 2; list++) { in ff_h264_pred_weight_table()
57 pwt->luma_weight_flag[list] = 0; in ff_h264_pred_weight_table()
58 pwt->chroma_weight_flag[list] = 0; in ff_h264_pred_weight_table()
59 for (i = 0; i < ref_count[list]; i++) { in ff_h264_pred_weight_table()
64 pwt->luma_weight[i][list][0] = get_se_golomb(gb); in ff_h264_pred_weight_table()
65 pwt->luma_weight[i][list][1] = get_se_golomb(gb); in ff_h264_pred_weight_table()
66 if ((int8_t)pwt->luma_weight[i][list][ in ff_h264_pred_weight_table()
[all...]
/kernel/linux/linux-6.6/include/linux/
H A Dlist.h14 * Circular doubly linked list implementation.
30 * @list: list_head structure to be initialized.
32 * Initializes the list_head to point to itself. If it is a list header,
33 * the result is an empty list.
35 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
37 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD()
38 WRITE_ONCE(list->prev, list); in INIT_LIST_HEAD()
50 * Performs the full set of list corruptio
296 list_move(struct list_head *list, struct list_head *head) list_move() argument
307 list_move_tail(struct list_head *list, struct list_head *head) list_move_tail() argument
342 list_is_first(const struct list_head *list, const struct list_head *head) list_is_first() argument
352 list_is_last(const struct list_head *list, const struct list_head *head) list_is_last() argument
362 list_is_head(const struct list_head *list, const struct list_head *head) list_is_head() argument
434 list_rotate_to_front(struct list_head *list, struct list_head *head) list_rotate_to_front() argument
454 __list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) __list_cut_position() argument
480 list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) list_cut_position() argument
507 list_cut_before(struct list_head *list, struct list_head *head, struct list_head *entry) list_cut_before() argument
523 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) __list_splice() argument
542 list_splice(const struct list_head *list, struct list_head *head) list_splice() argument
554 list_splice_tail(struct list_head *list, struct list_head *head) list_splice_tail() argument
568 list_splice_init(struct list_head *list, struct list_head *head) list_splice_init() argument
585 list_splice_tail_init(struct list_head *list, struct list_head *head) list_splice_tail_init() argument
[all...]
/kernel/linux/linux-5.10/fs/xfs/scrub/
H A Dbitmap.c32 INIT_LIST_HEAD(&bmr->list); in xbitmap_set()
35 list_add_tail(&bmr->list, &bitmap->list); in xbitmap_set()
49 list_del(&bmr->list); in xbitmap_destroy()
59 INIT_LIST_HEAD(&bitmap->list); in xbitmap_init()
72 ap = container_of(a, struct xbitmap_range, list); in xbitmap_range_cmp()
73 bp = container_of(b, struct xbitmap_range, list); in xbitmap_range_cmp()
90 * @bitmap as the list of blocks that are not accounted for, which we assume
112 if (list_empty(&bitmap->list) || list_empty(&sub->list)) in xbitmap_disunion()
[all...]

Completed in 11 milliseconds

12345678910>>...562