Home
last modified time | relevance | path

Searched refs:list (Results 301 - 325 of 14041) sorted by relevance

1...<<11121314151617181920>>...562

/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DUnicodeSetStringSpan.java396 // Use offset list to try all possibilities. in spanWithStrings()
606 // Use offset list to try all possibilities. in spanContainedAndCount()
665 // Use offset list to try all possibilities. in spanBack()
1008 * Stores offsets rather than indexes to simplify the code and use the same list
1019 * each indicating whether the corresponding offset is in the list,
1021 * This avoids inserting into a sorted list of offsets (or absolute indexes)
1022 * and physically moving part of the list.
1030 * the list could be stored as bit flags in a single integer.
1031 * Rather than handling a circular buffer with a start list index,
1036 private int[] list; field in UnicodeSetStringSpan.OffsetList
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/
H A DUnicodeSetStringSpan.java393 // Use offset list to try all possibilities. in spanWithStrings()
603 // Use offset list to try all possibilities. in spanContainedAndCount()
662 // Use offset list to try all possibilities. in spanBack()
1005 * Stores offsets rather than indexes to simplify the code and use the same list
1016 * each indicating whether the corresponding offset is in the list,
1018 * This avoids inserting into a sorted list of offsets (or absolute indexes)
1019 * and physically moving part of the list.
1027 * the list could be stored as bit flags in a single integer.
1028 * Rather than handling a circular buffer with a start list index,
1033 private int[] list; field in UnicodeSetStringSpan.OffsetList
[all...]
/kernel/linux/linux-5.10/drivers/reset/
H A Dreset-ti-syscon.c173 const __be32 *list; in ti_syscon_reset_probe() local
185 list = of_get_property(np, "ti,reset-bits", &size); in ti_syscon_reset_probe()
186 if (!list || (size / sizeof(*list)) % 7 != 0) { in ti_syscon_reset_probe()
191 nr_controls = (size / sizeof(*list)) / 7; in ti_syscon_reset_probe()
198 controls[i].assert_offset = be32_to_cpup(list++); in ti_syscon_reset_probe()
199 controls[i].assert_bit = be32_to_cpup(list++); in ti_syscon_reset_probe()
200 controls[i].deassert_offset = be32_to_cpup(list++); in ti_syscon_reset_probe()
201 controls[i].deassert_bit = be32_to_cpup(list++); in ti_syscon_reset_probe()
202 controls[i].status_offset = be32_to_cpup(list in ti_syscon_reset_probe()
[all...]
/kernel/linux/linux-6.6/drivers/reset/
H A Dreset-ti-syscon.c165 const __be32 *list; in ti_syscon_reset_probe() local
177 list = of_get_property(np, "ti,reset-bits", &size); in ti_syscon_reset_probe()
178 if (!list || (size / sizeof(*list)) % 7 != 0) { in ti_syscon_reset_probe()
183 nr_controls = (size / sizeof(*list)) / 7; in ti_syscon_reset_probe()
190 controls[i].assert_offset = be32_to_cpup(list++); in ti_syscon_reset_probe()
191 controls[i].assert_bit = be32_to_cpup(list++); in ti_syscon_reset_probe()
192 controls[i].deassert_offset = be32_to_cpup(list++); in ti_syscon_reset_probe()
193 controls[i].deassert_bit = be32_to_cpup(list++); in ti_syscon_reset_probe()
194 controls[i].status_offset = be32_to_cpup(list in ti_syscon_reset_probe()
[all...]
/kernel/linux/linux-6.6/drivers/s390/char/
H A Dsclp_con.c57 list_del(&buffer->list); in sclp_conbuf_callback()
64 struct sclp_buffer, list); in sclp_conbuf_callback()
85 list_add_tail(&sclp_conbuf->list, &sclp_con_outqueue); in sclp_conbuf_emit()
92 list); in sclp_conbuf_emit()
137 struct list_head *list; in sclp_console_drop_buffer() local
143 list = sclp_con_outqueue.next; in sclp_console_drop_buffer()
146 list = list->next; in sclp_console_drop_buffer()
147 if (list == &sclp_con_outqueue) in sclp_console_drop_buffer()
149 list_del(list); in sclp_console_drop_buffer()
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DUnicodeSet.java134 * complete list of supported property patterns, see the User's Guide
312 * For example, White_Space has 10 ranges, list length 21.
316 /** Max list [0, 1, 2, ..., max code point, HIGH] */
329 private int len; // length used; list may be longer to minimize reallocs
330 private int[] list; // MUST be terminated with HIGH field in UnicodeSet
344 * representation from the inversion list.
363 list = new int[INITIAL_CAPACITY]; in UnicodeSet()
364 list[0] = HIGH; in UnicodeSet()
399 list = new int[pairs.length + 1]; // don't allocate extra space, because it is likely that this is a fixed set. in UnicodeSet()
400 len = list in UnicodeSet()
[all...]
/kernel/linux/linux-5.10/crypto/
H A Dalgapi.c14 #include <linux/list.h>
93 * This function adds a spawn to the list secondary_spawns which
108 spawn = list_first_entry_or_null(stack, struct crypto_spawn, list); in crypto_more_spawns()
112 n = list_prev_entry(spawn, list); in crypto_more_spawns()
113 list_move(&spawn->list, secondary_spawns); in crypto_more_spawns()
115 if (list_is_last(&n->list, stack)) in crypto_more_spawns()
118 n = list_next_entry(n, list); in crypto_more_spawns()
126 struct list_head *list) in crypto_remove_instance()
138 list_move(&inst->alg.cra_list, list); in crypto_remove_instance()
139 hlist_del(&inst->list); in crypto_remove_instance()
125 crypto_remove_instance(struct crypto_instance *inst, struct list_head *list) crypto_remove_instance() argument
151 crypto_remove_spawns(struct crypto_alg *alg, struct list_head *list, struct crypto_alg *nalg) crypto_remove_spawns() argument
393 crypto_remove_final(struct list_head *list) crypto_remove_final() argument
447 crypto_remove_alg(struct crypto_alg *alg, struct list_head *list) crypto_remove_alg() argument
555 struct hlist_head *list; crypto_unregister_template() local
[all...]
/kernel/linux/linux-5.10/drivers/isdn/mISDN/
H A Dtimerdev.c37 struct list_head list; member
67 struct list_head *list = &dev->pending; in mISDN_close() local
74 while (!list_empty(list)) { in mISDN_close()
75 timer = list_first_entry(list, struct mISDNtimer, list); in mISDN_close()
80 list_del(&timer->list); in mISDN_close()
85 list_for_each_entry_safe(timer, next, &dev->expired, list) { in mISDN_close()
96 struct list_head *list = &dev->expired; in mISDN_read() local
108 while (list_empty(list) && (dev->work == 0)) { in mISDN_read()
113 !list_empty(list))); in mISDN_read()
[all...]
/kernel/linux/linux-5.10/drivers/net/ethernet/mellanox/mlxsw/
H A Dspectrum_matchall.c18 list_for_each_entry(mall_entry, &block->mall.list, list) in mlxsw_sp_mall_entry_find()
162 if (list_empty(&block->mall.list)) in mlxsw_sp_mall_prio_update()
166 list_for_each_entry(mall_entry, &block->mall.list, list) { in mlxsw_sp_mall_prio_update()
267 list_for_each_entry(binding, &block->binding_list, list) { in mlxsw_sp_mall_replace()
279 list_add_tail(&mall_entry->list, &block->mall.list); in mlxsw_sp_mall_replace()
285 list) in mlxsw_sp_mall_replace()
304 list_del(&mall_entry->list); in mlxsw_sp_mall_destroy()
[all...]
/kernel/linux/linux-6.6/drivers/net/ethernet/mellanox/mlx5/core/lib/
H A Ddevcom.c5 #include <linux/list.h>
11 /* protect device list */
13 /* protect component list */
20 struct list_head list; member
37 struct list_head list; member
47 list_for_each_entry(iter, &devcom_dev_list, list) in devcom_dev_exists()
86 list_add_tail(&devc->list, &devcom_dev_list); in mlx5_devcom_register_device()
98 list_del(&devc->list); in mlx5_devcom_dev_release()
156 list_add_tail(&devcom->list, &comp->comp_dev_list_head); in devcom_alloc_comp_dev()
168 list_del(&devcom->list); in devcom_free_comp_dev()
[all...]
/kernel/linux/linux-6.6/drivers/isdn/mISDN/
H A Dtimerdev.c37 struct list_head list; member
67 struct list_head *list = &dev->pending; in mISDN_close() local
74 while (!list_empty(list)) { in mISDN_close()
75 timer = list_first_entry(list, struct mISDNtimer, list); in mISDN_close()
80 list_del(&timer->list); in mISDN_close()
85 list_for_each_entry_safe(timer, next, &dev->expired, list) { in mISDN_close()
96 struct list_head *list = &dev->expired; in mISDN_read() local
108 while (list_empty(list) && (dev->work == 0)) { in mISDN_read()
113 !list_empty(list))); in mISDN_read()
[all...]
/kernel/liteos_a/testsuites/unittest/security/reugid/smoke/
H A Dreugid_test_001.cpp8 * 1. Redistributions of source code must retain the above copyright notice, this list of
11 * 2. Redistributions in binary form must reproduce the above copyright notice, this list
38 static int Child1(int *list, int listSize) in Child1() argument
79 ICUNIT_ASSERT_EQUAL(getList[i], list[i], getList[i]); in Child1()
100 int list[500]; in Child() local
130 list[0] = 1000; // 1000: preset value of list[0] in Child()
131 list[1] = 2000; // 2000: preset value of list[1] in Child()
132 list[ in Child()
[all...]
/third_party/ltp/tools/sparse/sparse-src/
H A Dptrlist.h8 * Generic pointer list manipulation code.
14 #define CHECK_TYPE(head,ptr) (void)(&(ptr) == &(head)->list[0])
15 #define PTRLIST_TYPE(head) __typeof__((head)->list[0])
16 #define VRFY_PTR_LIST(head) (void)(sizeof((head)->list[0]))
26 type *list[LIST_NODE_NR]; \
59 #define add_ptr_list(list, ptr) ({ \
60 struct ptr_list** head = (struct ptr_list**)(list); \
61 CHECK_TYPE(*(list),ptr); \
64 #define add_ptr_list_tag(list, ptr, tag) ({ \
65 struct ptr_list** head = (struct ptr_list**)(list); \
[all...]
/third_party/python/Lib/test/
H A Dtest_cgi.py100 def first_elts(list):
101 return [p[0] for p in list]
103 def first_second_elts(list):
104 return [(p[0], p[1][0]) for p in list]
114 result[k] = isinstance(v, list) and form.getlist(k) or v.value
165 self.assertEqual(list(fs), list(fs.keys()))
166 fs.list.append(namedtuple('MockFieldStorage', 'name')('fieldvalue'))
286 self.assertEqual(len(fs.list), 4)
291 for x in range(len(fs.list))
[all...]
/third_party/curl/tests/libtest/
H A Dlib1959.c32 struct curl_slist *list = NULL; in test() local
52 list = curl_slist_append(list, "Content-Type: application/json"); in test()
53 if(!list) in test()
59 curl_slist_append(list, "X-Xxx-Content-Sha256: " in test()
62 test_setopt(curl, CURLOPT_HTTPHEADER, list); in test()
69 curl_slist_free_all(list); in test()
H A Dlib1956.c32 struct curl_slist *list = NULL; in test() local
52 list = curl_slist_append(list, "Content-Type: application/json"); in test()
53 if(!list) in test()
59 curl_slist_append(list, "X-Xxx-Content-Sha256: " in test()
61 test_setopt(curl, CURLOPT_HTTPHEADER, list); in test()
68 curl_slist_free_all(list); in test()
H A Dlib1957.c32 struct curl_slist *list = NULL; in test() local
52 list = curl_slist_append(list, "Content-Type: application/json"); in test()
53 if(!list) in test()
59 curl_slist_append(list, "X-Xxx-Content-Sha256: arbitrary"); in test()
60 test_setopt(curl, CURLOPT_HTTPHEADER, list); in test()
67 curl_slist_free_all(list); in test()
H A Dlib1958.c32 struct curl_slist *list = NULL; in test() local
52 list = curl_slist_append(list, "Content-Type: application/json"); in test()
53 if(!list) in test()
59 curl_slist_append(list, "X-Xxx-Content-Sha256: \tarbitrary "); in test()
60 test_setopt(curl, CURLOPT_HTTPHEADER, list); in test()
67 curl_slist_free_all(list); in test()
/third_party/skia/third_party/externals/freetype/include/freetype/
H A Dftlist.h5 * Generic list support for FreeType (specification).
21 * This file implements functions relative to list processing. Its data
55 * This section contains various definitions related to list processing
83 * Find the list node for a given listed object.
86 * list ::
87 * A pointer to the parent list.
95 FT_List_Find( FT_List list,
105 * Append an element to the end of a list.
108 * list ::
109 * A pointer to the parent list
[all...]
/third_party/mesa3d/src/gallium/drivers/lima/ir/gp/
H A Dreduce_scheduler.c108 list_for_each_entry(gpir_node, node, ready_list, list) { in schedule_insert_ready_list()
119 insert_pos = &node->list; in schedule_insert_ready_list()
126 list_del(&insert_node->list); in schedule_insert_ready_list()
127 list_addtail(&insert_node->list, insert_pos); in schedule_insert_ready_list()
135 gpir_node *node = list_first_entry(ready_list, gpir_node, list); in schedule_ready_list()
136 list_del(&node->list); in schedule_ready_list()
138 /* schedule the node to the block node list */ in schedule_ready_list()
139 list_add(&node->list, &block->node_list); in schedule_ready_list()
172 list_for_each_entry(gpir_node, node, &node_list, list) { in schedule_block()
183 list_for_each_entry_safe(gpir_node, node, &node_list, list) { in schedule_block()
[all...]
/third_party/skia/src/core/
H A DSkTInternalLList.h15 * placed in the private section of any class that will be stored in a double linked list.
19 /* back pointer to the owning list - for debugging */ \
25 * This class implements a templated internal doubly linked list data structure.
101 * Inserts a new list entry before an existing list entry. The new entry must not already be
102 * a member of this or any other list. If existingEntry is NULL then the new entry is added
130 * Inserts a new list entry after an existing list entry. The new entry must not already be
131 * a member of this or any other list. If existingEntry is NULL then the new entry is added
158 void concat(SkTInternalLList&& list) { in concat() argument
202 init(const SkTInternalLList& list, IterStart startLoc) init() argument
[all...]
/third_party/python/Lib/
H A Dxdrlib.py116 def pack_list(self, list, pack_item):
117 for item in list:
122 def pack_farray(self, n, list, pack_item):
123 if len(list) != n:
125 for item in list:
128 def pack_array(self, list, pack_item):
129 n = len(list)
131 self.pack_farray(n, list, pack_item)
226 list = []
233 list
[all...]
/third_party/ffmpeg/libavcodec/
H A Dh264_refs.c141 int cur_poc, list; in h264_initialise_ref_list() local
149 for (list = 0; list < 2; list++) { in h264_initialise_ref_list()
150 len = add_sorted(sorted, h->short_ref, h->short_ref_count, cur_poc, 1 ^ list); in h264_initialise_ref_list()
151 len += add_sorted(sorted + len, h->short_ref, h->short_ref_count, cur_poc, 0 ^ list); in h264_initialise_ref_list()
154 len = build_def_list(sl->ref_list[list], FF_ARRAY_ELEMS(sl->ref_list[0]), in h264_initialise_ref_list()
156 len += build_def_list(sl->ref_list[list] + len, in h264_initialise_ref_list()
161 if (len < sl->ref_count[list]) in h264_initialise_ref_list()
162 memset(&sl->ref_list[list][le in h264_initialise_ref_list()
275 int list, i, j; h264_fill_mbaff_ref_list() local
300 int list, index, pic_structure; ff_h264_build_ref_list() local
424 int list, index; ff_h264_decode_ref_pic_list_reordering() local
[all...]
/kernel/linux/linux-6.6/fs/notify/
H A Dnotification.c24 #include <linux/list.h>
60 * from the list by a different CPU than the one freeing the event. in fsnotify_destroy_event()
62 if (!list_empty(&event->list)) { in fsnotify_destroy_event()
64 WARN_ON(!list_empty(&event->list)); in fsnotify_destroy_event()
89 struct list_head *list = &group->notification_list; in fsnotify_insert_event() local
104 if (!list_empty(&group->overflow_event->list)) { in fsnotify_insert_event()
112 if (!list_empty(list) && merge) { in fsnotify_insert_event()
122 list_add_tail(&event->list, list); in fsnotify_insert_event()
137 * We need to init list hea in fsnotify_remove_queued_event()
[all...]
/third_party/mesa3d/src/freedreno/drm/
H A Dfreedreno_bo_cache.c40 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(bucket->list.next, struct fd_bo, list); in fd_bo_cache_cleanup()
101 list_del(&bo->list); in fd_bo_cache_cleanup()
136 * NOTE that intel takes ALLOC_FOR_RENDER bo's from the list tail in find_in_bucket()
140 list_for_each_entry (struct fd_bo, entry, &bucket->list, list) { in find_in_bucket()
145 list_delinit(&bo->list); in find_in_bucket()
207 list_addtail(&bo->list, in fd_bo_cache_free()
[all...]

Completed in 18 milliseconds

1...<<11121314151617181920>>...562