| /third_party/protobuf/java/core/src/test/java/com/google/protobuf/ |
| H A D | ProtobufArrayListTest.java | 10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
48 private ProtobufArrayList<Integer> list; field in ProtobufArrayListTest
52 list = new ProtobufArrayList<Integer>(); in setUp()
64 list.addAll(asList(1, 2, 3, 4)); in testModificationWithIteration()
65 Iterator<Integer> iterator = list.iterator(); in testModificationWithIteration()
66 assertEquals(4, list.size()); in testModificationWithIteration()
67 assertEquals(1, (int) list.get(0)); in testModificationWithIteration()
70 list.remove(0); in testModificationWithIteration()
78 iterator = list in testModificationWithIteration()
245 assertImmutable(List<Integer> list) assertImmutable() argument
[all...] |
| H A D | IntArrayListTest.java | 10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
51 private IntArrayList list; field in IntArrayListTest
55 list = new IntArrayList(); in setUp()
67 list.addInt(3); in testMakeImmutable()
68 list.addInt(4); in testMakeImmutable()
69 list.addInt(5); in testMakeImmutable()
70 list.addInt(7); in testMakeImmutable()
71 list.makeImmutable(); in testMakeImmutable()
72 assertImmutable(list); in testMakeImmutable()
389 assertImmutable(IntList list) assertImmutable() argument
[all...] |
| H A D | BooleanArrayListTest.java | 10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
52 private BooleanArrayList list; field in BooleanArrayListTest
56 list = new BooleanArrayList(); in setUp()
68 list.addBoolean(true); in testMakeImmutable()
69 list.addBoolean(false); in testMakeImmutable()
70 list.addBoolean(true); in testMakeImmutable()
71 list.addBoolean(true); in testMakeImmutable()
72 list.makeImmutable(); in testMakeImmutable()
73 assertImmutable(list); in testMakeImmutable()
391 assertImmutable(BooleanList list) assertImmutable() argument
[all...] |
| H A D | LazyStringArrayListTest.java | 10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
58 LazyStringArrayList list = new LazyStringArrayList(); in testJustStrings()
59 list.add(STRING_A); in testJustStrings()
60 list.add(STRING_B); in testJustStrings()
61 list.add(STRING_C); in testJustStrings()
63 assertEquals(3, list.size()); in testJustStrings()
64 assertSame(STRING_A, list.get(0)); in testJustStrings()
65 assertSame(STRING_B, list.get(1)); in testJustStrings()
66 assertSame(STRING_C, list in testJustStrings()
285 assertGenericListImmutable(List<T> list, T value) assertGenericListImmutable() argument
[all...] |
| H A D | FloatArrayListTest.java | 10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
51 private FloatArrayList list; field in FloatArrayListTest
55 list = new FloatArrayList(); in setUp()
67 list.addFloat(3); in testMakeImmutable()
68 list.addFloat(4); in testMakeImmutable()
69 list.addFloat(5); in testMakeImmutable()
70 list.addFloat(7); in testMakeImmutable()
71 list.makeImmutable(); in testMakeImmutable()
72 assertImmutable(list); in testMakeImmutable()
391 assertImmutable(FloatList list) assertImmutable() argument
[all...] |
| H A D | DoubleArrayListTest.java | 10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
51 private DoubleArrayList list; field in DoubleArrayListTest
55 list = new DoubleArrayList(); in setUp()
67 list.addDouble(3); in testMakeImmutable()
68 list.addDouble(4); in testMakeImmutable()
69 list.addDouble(5); in testMakeImmutable()
70 list.addDouble(7); in testMakeImmutable()
71 list.makeImmutable(); in testMakeImmutable()
72 assertImmutable(list); in testMakeImmutable()
391 assertImmutable(DoubleList list) assertImmutable() argument
[all...] |
| H A D | LongArrayListTest.java | 10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
51 private LongArrayList list; field in LongArrayListTest
55 list = new LongArrayList(); in setUp()
67 list.addLong(3); in testMakeImmutable()
68 list.addLong(4); in testMakeImmutable()
69 list.addLong(5); in testMakeImmutable()
70 list.addLong(7); in testMakeImmutable()
71 list.makeImmutable(); in testMakeImmutable()
72 assertImmutable(list); in testMakeImmutable()
389 assertImmutable(LongList list) assertImmutable() argument
[all...] |
| /foundation/communication/dsoftbus/components/nstackx/fillp/src/public/src/ |
| H A D | skiplist.c | 34 static FILLP_INT SkiplistRandomLevel(struct SkipList *list) in SkiplistRandomLevel() argument
38 while ((list->randomLev[(list->randomIndex++) & (MAX_RANDOM_LEV - 1)]) && (k < MAX_SKIPLIST_LEVEL)) { in SkiplistRandomLevel()
49 Input : list - SkipList to be initialised
56 FILLP_INT SkiplistInit(struct SkipList *list, funcSkiplistCompair cmp) in SkiplistInit() argument
61 if (list == FILLP_NULL_PTR) { in SkiplistInit()
62 FILLP_LOGERR("list->skip_item_pool is not NULL"); in SkiplistInit()
66 list->level = 0; in SkiplistInit()
67 list->head = FILLP_NULL_PTR; in SkiplistInit()
68 list in SkiplistInit()
93 SkiplistDestroy(struct SkipList *list) SkiplistDestroy() argument
114 SkipListPopValue(struct SkipList *list) SkipListPopValue() argument
157 SkipListPopTail(struct SkipList *list) SkipListPopTail() argument
190 SkiplistInsertAtMid(struct SkipList *list, void *item, struct SkipListNode *node, FILLP_BOOL errIfConflict, FILLP_INT curMinLevel) SkiplistInsertAtMid() argument
240 SkipListInsertFirstNode(struct SkipList *list, struct SkipListNode *node) SkipListInsertFirstNode() argument
256 SkipListInsertAtTail(struct SkipList *list, struct SkipListNode *node, int curMinLevel) SkipListInsertAtTail() argument
266 SkipListInsertAtHead(struct SkipList *list, struct SkipListNode *node, int curMinLevel) SkipListInsertAtHead() argument
292 SkipListInsert(struct SkipList *list, void *item, struct SkipListNode *node, FILLP_BOOL errIfConflict) SkipListInsert() argument
354 SkiplistGetNodeNum(struct SkipList *list) SkiplistGetNodeNum() argument
[all...] |
| /foundation/communication/bluetooth_service/services/bluetooth/stack/platform/src/ |
| H A D | list.c | 16 #include "platform/include/list.h"
23 List *list; // Used in func ListGetNextNode, might de deleted in future version. member
33 static ListNode *ListGetFirstNodeInt(const List *list) in ListGetFirstNodeInt() argument
35 ASSERT(list); in ListGetFirstNodeInt()
36 if (list->len == 0) { in ListGetFirstNodeInt()
40 return DL_LIST_ENTRY(list->dlList.pstNext, ListNode, node); in ListGetFirstNodeInt()
53 NO_SANITIZE("cfi") static ListNode *ListFreeNode(List *list, ListNode *node) in ListFreeNode() argument
55 ASSERT(list); in ListFreeNode()
59 if (list->cb) { in ListFreeNode()
60 list in ListFreeNode()
68 ListClear(List *list) ListClear() argument
79 ListDelete(List *list) ListDelete() argument
89 ListGetSize(const List *list) ListGetSize() argument
95 ListAddFirst(List *list, void *data) ListAddFirst() argument
108 ListAddLast(List *list, void *data) ListAddLast() argument
121 ListForEachData(const List *list, const ListCmpFunc cmp, void *parameter) ListForEachData() argument
139 ListGetFirstNode(const List *list) ListGetFirstNode() argument
149 ListGetLastNode(const List *list) ListGetLastNode() argument
173 ListRemoveNode(List *list, void *data) ListRemoveNode() argument
189 ListRemoveFirst(List *list) ListRemoveFirst() argument
203 ListRemoveLast(List *list) ListRemoveLast() argument
217 ListIsEmpty(const List* list) ListIsEmpty() argument
[all...] |
| /third_party/node/deps/cares/src/lib/ |
| H A D | ares__slist.c | 61 ares__slist_t *list; in ares__slist_create() local
67 list = ares_malloc_zero(sizeof(*list)); in ares__slist_create()
69 if (list == NULL) { in ares__slist_create()
73 list->rand_state = rand_state; in ares__slist_create()
74 list->cmp = cmp; in ares__slist_create()
75 list->destruct = destruct; in ares__slist_create()
77 list->levels = ARES__SLIST_START_LEVELS; in ares__slist_create()
78 list->head = ares_malloc_zero(sizeof(*list in ares__slist_create()
87 ares__slist_coin_flip(ares__slist_t *list) ares__slist_coin_flip() argument
108 ares__slist_replace_destructor(ares__slist_t *list, ares__slist_destructor_t destruct) ares__slist_replace_destructor() argument
118 ares__slist_max_level(const ares__slist_t *list) ares__slist_max_level() argument
135 ares__slist_calc_level(ares__slist_t *list) ares__slist_calc_level() argument
146 ares__slist_node_push(ares__slist_t *list, ares__slist_node_t *node) ares__slist_node_push() argument
198 ares__slist_insert(ares__slist_t *list, void *val) ares__slist_insert() argument
260 ares__slist_t *list = node->parent; ares__slist_node_pop() local
286 ares__slist_t *list; ares__slist_node_claim() local
309 ares__slist_t *list; ares__slist_node_reinsert() local
321 ares__slist_node_find(ares__slist_t *list, const void *val) ares__slist_node_find() argument
380 ares__slist_node_first(ares__slist_t *list) ares__slist_node_first() argument
389 ares__slist_node_last(ares__slist_t *list) ares__slist_node_last() argument
422 ares__slist_len(const ares__slist_t *list) ares__slist_len() argument
438 ares__slist_first_val(ares__slist_t *list) ares__slist_first_val() argument
443 ares__slist_last_val(ares__slist_t *list) ares__slist_last_val() argument
465 ares__slist_destroy(ares__slist_t *list) ares__slist_destroy() argument
[all...] |
| H A D | ares__llist.c | 47 ares__llist_t *list = ares_malloc_zero(sizeof(*list)); in ares__llist_create() local
49 if (list == NULL) { in ares__llist_create()
53 list->destruct = destruct; in ares__llist_create()
55 return list; in ares__llist_create()
58 void ares__llist_replace_destructor(ares__llist_t *list, in ares__llist_replace_destructor() argument
61 if (list == NULL) { in ares__llist_replace_destructor()
65 list->destruct = destruct; in ares__llist_replace_destructor()
74 static void ares__llist_attach_at(ares__llist_t *list, in ares__llist_attach_at() argument
79 if (list in ares__llist_attach_at()
122 ares__llist_insert_at(ares__llist_t *list, ares__llist_insert_type_t type, ares__llist_node_t *at, void *val) ares__llist_insert_at() argument
145 ares__llist_insert_first(ares__llist_t *list, void *val) ares__llist_insert_first() argument
150 ares__llist_insert_last(ares__llist_t *list, void *val) ares__llist_insert_last() argument
181 ares__llist_node_first(ares__llist_t *list) ares__llist_node_first() argument
189 ares__llist_node_last(ares__llist_t *list) ares__llist_node_last() argument
222 ares__llist_len(const ares__llist_t *list) ares__llist_len() argument
238 ares__llist_first_val(ares__llist_t *list) ares__llist_first_val() argument
243 ares__llist_last_val(ares__llist_t *list) ares__llist_last_val() argument
250 ares__llist_t *list; ares__llist_node_detach() local
326 ares__llist_destroy(ares__llist_t *list) ares__llist_destroy() argument
[all...] |
| /third_party/mesa3d/src/gallium/frontends/nine/ |
| H A D | nine_shader.h | 134 nine_shader_variant_get(struct nine_shader_variant *list, in nine_shader_variant_get() argument
139 while (list->key != key && list->next) in nine_shader_variant_get()
140 list = list->next; in nine_shader_variant_get()
141 if (list->key == key) { in nine_shader_variant_get()
142 *const_ranges = list->const_ranges; in nine_shader_variant_get()
143 *const_used_size = list->const_used_size; in nine_shader_variant_get()
144 return list->cso; in nine_shader_variant_get()
150 nine_shader_variant_add(struct nine_shader_variant *list, in nine_shader_variant_add() argument
171 nine_shader_variants_free(struct nine_shader_variant *list) nine_shader_variants_free() argument
189 nine_shader_variant_so_get(struct nine_shader_variant_so *list, struct NineVertexDeclaration9 *vdecl, struct pipe_stream_output_info *so) nine_shader_variant_so_get() argument
203 nine_shader_variant_so_add(struct nine_shader_variant_so *list, struct NineVertexDeclaration9 *vdecl, struct pipe_stream_output_info *so, void *cso) nine_shader_variant_so_add() argument
229 nine_shader_variants_so_free(struct nine_shader_variant_so *list) nine_shader_variants_so_free() argument
251 nine_shader_constant_combination_key(struct nine_shader_constant_combination **list, boolean *int_slots_used, boolean *bool_slots_used, int *const_i, BOOL *const_b) nine_shader_constant_combination_key() argument
298 nine_shader_constant_combination_get(struct nine_shader_constant_combination *list, uint8_t index) nine_shader_constant_combination_get() argument
314 nine_shader_constant_combination_free(struct nine_shader_constant_combination *list) nine_shader_constant_combination_free() argument
[all...] |
| /kernel/linux/linux-5.10/tools/perf/util/ |
| H A D | parse-events.y | 31 struct list_head *list;
33 list = malloc(sizeof(*list));
34 if (!list)
37 INIT_LIST_HEAD(list);
38 return list;
52 static void inc_group_count(struct list_head *list,
56 if (!list_is_last(list->next, list))
148 parse_events_update_lists($1, &parse_state->list);
[all...] |
| /third_party/protobuf/csharp/src/Google.Protobuf.Test/Collections/ |
| H A D | RepeatedFieldTest.cs | 11 // notice, this list of conditions and the following disclaimer.
13 // copyright notice, this list of conditions and the following disclaimer
51 var list = new RepeatedField<string>(); in NullValuesRejected()
52 Assert.Throws<ArgumentNullException>(() => list.Add((string)null)); in NullValuesRejected()
53 Assert.Throws<ArgumentNullException>(() => list.Add((IEnumerable<string>)null)); in NullValuesRejected()
54 Assert.Throws<ArgumentNullException>(() => list.Add((RepeatedField<string>)null)); in NullValuesRejected()
55 Assert.Throws<ArgumentNullException>(() => list.Contains(null)); in NullValuesRejected()
56 Assert.Throws<ArgumentNullException>(() => list.IndexOf(null)); in NullValuesRejected()
62 var list = new RepeatedField<string>(); in Add_SingleItem()
63 list in Add_SingleItem()
[all...] |
| /kernel/liteos_a/apps/shell/include/ |
| H A D | shell_list.h | 8 * 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
48 * Structure of a node in a doubly linked list.
59 * This API is used to initialize a doubly linked list.
65 * @param list [IN] Node in a doubly linked list.
72 static inline void SH_ListInit(SH_List *list) in SH_ListInit() argument
74 list->pstNext = list; in SH_ListInit()
75 list in SH_ListInit()
141 SH_ListAdd(SH_List *list, SH_List *node) SH_ListAdd() argument
168 SH_ListTailInsert(SH_List *list, SH_List *node) SH_ListTailInsert() argument
196 SH_ListHeadInsert(SH_List *list, SH_List *node) SH_ListHeadInsert() argument
253 SH_ListEmpty(SH_List *list) SH_ListEmpty() argument
461 SH_ListDelInit(SH_List *list) SH_ListDelInit() argument
[all...] |
| /kernel/linux/linux-5.10/lib/ |
| H A D | list-test.c | 3 * 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...] |
| /third_party/skia/third_party/externals/dawn/src/tests/unittests/ |
| H A D | LinkedListTests.cpp | 11 #include <list>
58 // Checks that when iterating |list| (either from head to tail, or from
61 void ExpectListContentsForDirection(const LinkedList<Node>& list, in ExpectListContentsForDirection() argument
66 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail()); node != list.end(); in ExpectListContentsForDirection()
76 void ExpectListContents(const LinkedList<Node>& list, int num_nodes, const int* node_ids) { in ExpectListContents() argument
79 ExpectListContentsForDirection(list, num_nodes, node_ids, true); in ExpectListContents()
83 ExpectListContentsForDirection(list, num_nodes, node_ids, false); in ExpectListContents()
88 LinkedList<Node> list; in TEST() local
95 LinkedList<Node> list; TEST() local
130 LinkedList<Node> list; TEST() local
205 LinkedList<Node> list; TEST() local
242 LinkedList<Node> list; TEST() local
284 LinkedList<Node> list; TEST() local
289 LinkedList<Node> list; TEST() local
298 LinkedList<Node> list; TEST() local
320 LinkedList<Node> list; TEST() local
331 LinkedList<MovableNode> list; TEST() local
360 LinkedList<Node> list; TEST() local
418 LinkedList<Node> list; TEST() local
433 LinkedList<Node> list; TEST() local
[all...] |
| /device/soc/rockchip/common/sdk_linux/drivers/clk/rockchip/ |
| H A D | clk.c | 467 void rockchip_clk_register_plls(struct rockchip_clk_provider *ctx, struct rockchip_pll_clock *list, unsigned int nr_pll, in rockchip_clk_register_plls() argument
473 for (idx = 0; idx < nr_pll; idx++, list++) { in rockchip_clk_register_plls()
474 clk = rockchip_clk_register_pll(ctx, list->type, list->name, list->parent_names, list->num_parents, in rockchip_clk_register_plls()
475 list->con_offset, grf_lock_offset, list->lock_shift, list->mode_offset, in rockchip_clk_register_plls()
476 list in rockchip_clk_register_plls()
487 rockchip_clk_register_branches(struct rockchip_clk_provider *ctx, struct rockchip_clk_branch *list, unsigned int nr_clk) rockchip_clk_register_branches() argument
[all...] |
| /kernel/linux/linux-6.6/drivers/clk/rockchip/ |
| H A D | clk.c | 408 struct rockchip_pll_clock *list, in rockchip_clk_register_plls()
414 for (idx = 0; idx < nr_pll; idx++, list++) { in rockchip_clk_register_plls()
415 clk = rockchip_clk_register_pll(ctx, list->type, list->name, in rockchip_clk_register_plls()
416 list->parent_names, list->num_parents, in rockchip_clk_register_plls()
417 list->con_offset, grf_lock_offset, in rockchip_clk_register_plls()
418 list->lock_shift, list->mode_offset, in rockchip_clk_register_plls()
419 list in rockchip_clk_register_plls()
407 rockchip_clk_register_plls(struct rockchip_clk_provider *ctx, struct rockchip_pll_clock *list, unsigned int nr_pll, int grf_lock_offset) rockchip_clk_register_plls() argument
432 rockchip_clk_register_branches(struct rockchip_clk_provider *ctx, struct rockchip_clk_branch *list, unsigned int nr_clk) rockchip_clk_register_branches() argument
[all...] |
| /third_party/ltp/tools/sparse/sparse-src/ |
| H A D | ptrlist.c | 8 // Pointer list manipulation
13 // * NULL is used by {PREPARE,NEXT}_PTR_LIST() to indicate the end-of-list.
17 // (OP_PHI) use a list to store their operands, a VOID in a phi-node
18 // list must be ignored since it represents a removed operand. As
32 __ALLOCATOR(struct ptr_list, "ptr list", ptrlist);
36 // @head: the head of the list
37 // @return: the size of the list given by @head.
43 struct ptr_list *list = head; in ptr_list_size() local
45 nr += list->nr - list in ptr_list_size()
57 const struct ptr_list *list = head; ptr_list_empty() local
76 const struct ptr_list *list = head; ptr_list_multiple() local
97 struct ptr_list *list = head; first_ptr_list() local
116 struct ptr_list *list; last_ptr_list() local
133 ptr_list_nth_entry(struct ptr_list *list, unsigned int idx) ptr_list_nth_entry() argument
169 struct ptr_list *list = head; linearize_ptr_list() local
262 struct ptr_list *list = *listp; __add_ptr_list() local
316 const struct ptr_list *list = head; lookup_ptr_list_entry() local
335 delete_ptr_list_entry(struct ptr_list **list, void *entry, int count) delete_ptr_list_entry() argument
358 replace_ptr_list_entry(struct ptr_list **list, void *old_ptr, void *new_ptr, int count) replace_ptr_list_entry() argument
497 struct ptr_list *tmp, *list = *listp; __free_ptr_list() local
[all...] |
| /third_party/node/test/parallel/ |
| H A D | test-stream-buffer-list.js | 7 // Test empty buffer list.
19 function testIterator(list, count) {
23 for (const x of list) {
29 // Test buffer list with one element.
30 const list = new BufferList();
31 testIterator(list, 0);
33 list.push(buf);
34 testIterator(list, 1);
35 for (const x of list) {
39 const copy = list
[all...] |
| /third_party/alsa-lib/src/control/ |
| H A D | namehint.c | 34 char **list; member
51 static int hint_list_add(struct hint_list *list, in hint_list_add() argument
57 if (list->count + 1 >= list->allocated) { in hint_list_add()
58 char **n = realloc(list->list, (list->allocated + 10) * sizeof(char *)); in hint_list_add()
61 memset(n + list->allocated, 0, 10 * sizeof(*n)); in hint_list_add()
62 list->allocated += 10; in hint_list_add()
63 list in hint_list_add()
85 hint_list_add_custom(struct hint_list *list, const char *entry) hint_list_add_custom() argument
116 get_dev_name1(struct hint_list *list, char **res, int device, int stream) get_dev_name1() argument
170 get_dev_name(struct hint_list *list) get_dev_name() argument
237 try_config(snd_config_t *config, struct hint_list *list, const char *base, const char *name) try_config() argument
447 add_card(snd_config_t *config, snd_config_t *rw_config, struct hint_list *list, int card) add_card() argument
515 get_card_name(struct hint_list *list, int card) get_card_name() argument
533 add_software_devices(snd_config_t *config, snd_config_t *rw_config, struct hint_list *list) add_software_devices() argument
585 struct hint_list list; snd_device_name_hint() local
[all...] |
| /third_party/protobuf/csharp/compatibility_tests/v3.0.0/src/Google.Protobuf.Test/Collections/ |
| H A D | RepeatedFieldTest.cs | 11 // notice, this list of conditions and the following disclaimer.
13 // copyright notice, this list of conditions and the following disclaimer
50 var list = new RepeatedField<string>(); in NullValuesRejected()
51 Assert.Throws<ArgumentNullException>(() => list.Add((string)null)); in NullValuesRejected()
52 Assert.Throws<ArgumentNullException>(() => list.Add((IEnumerable<string>)null)); in NullValuesRejected()
53 Assert.Throws<ArgumentNullException>(() => list.Add((RepeatedField<string>)null)); in NullValuesRejected()
54 Assert.Throws<ArgumentNullException>(() => list.Contains(null)); in NullValuesRejected()
55 Assert.Throws<ArgumentNullException>(() => list.IndexOf(null)); in NullValuesRejected()
61 var list = new RepeatedField<string>(); in Add_SingleItem()
62 list in Add_SingleItem()
[all...] |
| /third_party/skia/src/core/ |
| H A D | SkTMultiMap.h | 49 ValueList* list = fHash.find(key); in insert() local
50 if (list) { in insert()
52 // linked list, and it will contain the value of the first element. in insert()
53 ValueList* newEntry = new ValueList(list->fValue); in insert()
54 newEntry->fNext = list->fNext; in insert()
57 list->fNext = newEntry; in insert()
58 list->fValue = value; in insert()
67 ValueList* list = fHash.find(key); in remove() local
73 SkASSERT(list); in remove()
75 while (list in remove()
95 ValueList* list = fHash.find(key); find() local
104 ValueList* list = fHash.find(key); find() local
116 ValueList* list = fHash.find(key); findAndRemove() local
155 ValueList* list = fHash.find(key); countForKey() local
[all...] |
| /kernel/linux/linux-5.10/drivers/clk/rockchip/ |
| H A D | clk.c | 417 struct rockchip_pll_clock *list, in rockchip_clk_register_plls()
423 for (idx = 0; idx < nr_pll; idx++, list++) { in rockchip_clk_register_plls()
424 clk = rockchip_clk_register_pll(ctx, list->type, list->name, in rockchip_clk_register_plls()
425 list->parent_names, list->num_parents, in rockchip_clk_register_plls()
426 list->con_offset, grf_lock_offset, in rockchip_clk_register_plls()
427 list->lock_shift, list->mode_offset, in rockchip_clk_register_plls()
428 list in rockchip_clk_register_plls()
416 rockchip_clk_register_plls(struct rockchip_clk_provider *ctx, struct rockchip_pll_clock *list, unsigned int nr_pll, int grf_lock_offset) rockchip_clk_register_plls() argument
441 rockchip_clk_register_branches(struct rockchip_clk_provider *ctx, struct rockchip_clk_branch *list, unsigned int nr_clk) rockchip_clk_register_branches() argument
[all...] |