Home
last modified time | relevance | path

Searched refs:list (Results 26 - 50 of 13888) sorted by relevance

12345678910>>...556

/kernel/linux/linux-5.10/tools/firewire/
H A Dlist.h2 struct list { struct
3 struct list *next, *prev;
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
29 list_append(struct list *list, struct list *new_link) list_append() argument
35 list_prepend(struct list *list, struct list *new_link) list_prepend() argument
[all...]
/kernel/linux/linux-6.6/tools/firewire/
H A Dlist.h2 struct list { struct
3 struct list *next, *prev;
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
29 list_append(struct list *list, struct list *new_link) list_append() argument
35 list_prepend(struct list *list, struct list *new_link) list_prepend() argument
[all...]
/third_party/icu/icu4c/source/common/
H A Dulist.cpp34 static void ulist_addFirstItem(UList *list, UListNode *newItem);
58 * Function called by addItemEndList or addItemBeginList when the first item is added to the list.
61 static void ulist_addFirstItem(UList *list, UListNode *newItem) { in ulist_addFirstItem() argument
64 list->head = newItem; in ulist_addFirstItem()
65 list->tail = newItem; in ulist_addFirstItem()
68 static void ulist_removeItem(UList *list, UListNode *p) { in ulist_removeItem() argument
70 // p is the list head. in ulist_removeItem()
71 list->head = p->next; in ulist_removeItem()
76 // p is the list tail. in ulist_removeItem()
77 list in ulist_removeItem()
91 ulist_addItemEndList(UList *list, const void *data, UBool forceDelete, UErrorCode *status) ulist_addItemEndList() argument
124 ulist_addItemBeginList(UList *list, const void *data, UBool forceDelete, UErrorCode *status) ulist_addItemBeginList() argument
157 ulist_containsString(const UList *list, const char *data, int32_t length) ulist_containsString() argument
171 ulist_removeString(UList *list, const char *data) ulist_removeString() argument
185 ulist_getNext(UList *list) ulist_getNext() argument
198 ulist_getListSize(const UList *list) ulist_getListSize() argument
206 ulist_resetList(UList *list) ulist_resetList() argument
212 ulist_deleteList(UList *list) ulist_deleteList() argument
[all...]
/third_party/node/deps/icu-small/source/common/
H A Dulist.cpp34 static void ulist_addFirstItem(UList *list, UListNode *newItem);
58 * Function called by addItemEndList or addItemBeginList when the first item is added to the list.
61 static void ulist_addFirstItem(UList *list, UListNode *newItem) { in ulist_addFirstItem() argument
64 list->head = newItem; in ulist_addFirstItem()
65 list->tail = newItem; in ulist_addFirstItem()
68 static void ulist_removeItem(UList *list, UListNode *p) { in ulist_removeItem() argument
70 // p is the list head. in ulist_removeItem()
71 list->head = p->next; in ulist_removeItem()
76 // p is the list tail. in ulist_removeItem()
77 list in ulist_removeItem()
91 ulist_addItemEndList(UList *list, const void *data, UBool forceDelete, UErrorCode *status) ulist_addItemEndList() argument
124 ulist_addItemBeginList(UList *list, const void *data, UBool forceDelete, UErrorCode *status) ulist_addItemBeginList() argument
157 ulist_containsString(const UList *list, const char *data, int32_t length) ulist_containsString() argument
171 ulist_removeString(UList *list, const char *data) ulist_removeString() argument
185 ulist_getNext(UList *list) ulist_getNext() argument
198 ulist_getListSize(const UList *list) ulist_getListSize() argument
206 ulist_resetList(UList *list) ulist_resetList() argument
212 ulist_deleteList(UList *list) ulist_deleteList() argument
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Dulist.cpp34 static void ulist_addFirstItem(UList *list, UListNode *newItem);
58 * Function called by addItemEndList or addItemBeginList when the first item is added to the list.
61 static void ulist_addFirstItem(UList *list, UListNode *newItem) { in ulist_addFirstItem() argument
64 list->head = newItem; in ulist_addFirstItem()
65 list->tail = newItem; in ulist_addFirstItem()
68 static void ulist_removeItem(UList *list, UListNode *p) { in ulist_removeItem() argument
70 // p is the list head. in ulist_removeItem()
71 list->head = p->next; in ulist_removeItem()
76 // p is the list tail. in ulist_removeItem()
77 list in ulist_removeItem()
91 ulist_addItemEndList(UList *list, const void *data, UBool forceDelete, UErrorCode *status) ulist_addItemEndList() argument
124 ulist_addItemBeginList(UList *list, const void *data, UBool forceDelete, UErrorCode *status) ulist_addItemBeginList() argument
157 ulist_containsString(const UList *list, const char *data, int32_t length) ulist_containsString() argument
171 ulist_removeString(UList *list, const char *data) ulist_removeString() argument
185 ulist_getNext(UList *list) ulist_getNext() argument
198 ulist_getListSize(const UList *list) ulist_getListSize() argument
206 ulist_resetList(UList *list) ulist_resetList() argument
212 ulist_deleteList(UList *list) ulist_deleteList() argument
[all...]
/kernel/linux/linux-6.6/tools/perf/util/
H A Dparse-events.y35 struct list_head *list;
37 list = malloc(sizeof(*list));
38 if (!list)
41 INIT_LIST_HEAD(list);
42 return list;
139 parse_events_update_lists($1, &parse_state->list);
145 struct list_head *list = $1;
149 parse_events_update_lists(group, list);
150 $$ = list;
[all...]
/kernel/liteos_m/utils/
H A Dlos_list.h8 * 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
33 * @defgroup los_list Doubly linked list
50 * Structure of a node in a doubly linked list.
59 * @brief Initialize a doubly linked list.
62 * This API is used to initialize a doubly linked list.
68 * @param list [IN] Node in a doubly linked list.
75 LITE_OS_SEC_ALW_INLINE STATIC_INLINE VOID LOS_ListInit(LOS_DL_LIST *list) in LOS_ListInit() argument
77 list in LOS_ListInit()
122 LOS_ListAdd(LOS_DL_LIST *list, LOS_DL_LIST *node) LOS_ListAdd() argument
149 LOS_ListTailInsert(LOS_DL_LIST *list, LOS_DL_LIST *node) LOS_ListTailInsert() argument
173 LOS_ListHeadInsert(LOS_DL_LIST *list, LOS_DL_LIST *node) LOS_ListHeadInsert() argument
351 LOS_ListDelInit(LOS_DL_LIST *list) LOS_ListDelInit() argument
[all...]
/third_party/selinux/libsepol/cil/src/
H A Dcil_list.c8 * this list of conditions and the following disclaimer.
11 * this list of conditions and the following disclaimer in the documentation
47 void cil_list_init(struct cil_list **list, enum cil_flavor flavor) in cil_list_init() argument
53 *list = new_list; in cil_list_init()
56 void cil_list_destroy(struct cil_list **list, unsigned destroy_data) in cil_list_destroy() argument
60 if (*list == NULL) { in cil_list_destroy()
64 item = (*list)->head; in cil_list_destroy()
76 free(*list); in cil_list_destroy()
77 *list = NULL; in cil_list_destroy()
99 void cil_list_append(struct cil_list *list, enu argument
121 cil_list_prepend(struct cil_list *list, enum cil_flavor flavor, void *data) cil_list_prepend() argument
143 cil_list_insert(struct cil_list *list, struct cil_list_item *curr, enum cil_flavor flavor, void *data) cil_list_insert() argument
172 cil_list_append_item(struct cil_list *list, struct cil_list_item *item) cil_list_append_item() argument
199 cil_list_prepend_item(struct cil_list *list, struct cil_list_item *item) cil_list_prepend_item() argument
225 cil_list_remove(struct cil_list *list, enum cil_flavor flavor, void *data, unsigned destroy_data) cil_list_remove() argument
251 cil_list_contains(struct cil_list *list, void *data) cil_list_contains() argument
[all...]
/third_party/libinput/src/
H A Dutil-list.c32 #include "util-list.h"
35 list_init(struct list *list) in list_init() argument
37 list->prev = list; in list_init()
38 list->next = list; in list_init()
42 list_insert(struct list *list, struct list *el argument
56 list_append(struct list *list, struct list *elm) list_append() argument
82 list_empty(const struct list *list) list_empty() argument
[all...]
/third_party/skia/tests/
H A DLListTest.cpp25 static void check_list(const SkTInternalLList<ListElement>& list, in check_list() argument
32 REPORTER_ASSERT(reporter, empty == list.isEmpty()); in check_list()
34 list.validate(); in check_list()
35 REPORTER_ASSERT(reporter, numElements == list.countEntries()); in check_list()
36 REPORTER_ASSERT(reporter, in0 == list.isInList(&elements[0])); in check_list()
37 REPORTER_ASSERT(reporter, in1 == list.isInList(&elements[1])); in check_list()
38 REPORTER_ASSERT(reporter, in2 == list.isInList(&elements[2])); in check_list()
39 REPORTER_ASSERT(reporter, in3 == list.isInList(&elements[3])); in check_list()
44 SkTInternalLList<ListElement> list; in DEF_TEST() local
52 // list shoul in DEF_TEST()
[all...]
/third_party/curl/lib/
H A Dllist.c50 * Inserts a new list element after the given one 'e'. If the given existing
51 * entry is NULL and the list already has elements, the new one will be
52 * inserted first in the list.
59 Curl_llist_insert_next(struct Curl_llist *list, struct Curl_llist_element *e, in Curl_llist_insert_next() argument
64 if(list->size == 0) { in Curl_llist_insert_next()
65 list->head = ne; in Curl_llist_insert_next()
66 list->head->prev = NULL; in Curl_llist_insert_next()
67 list->head->next = NULL; in Curl_llist_insert_next()
68 list->tail = ne; in Curl_llist_insert_next()
71 /* if 'e' is NULL here, we insert the new element first in the list */ in Curl_llist_insert_next()
95 Curl_llist_remove(struct Curl_llist *list, struct Curl_llist_element *e, void *user) Curl_llist_remove() argument
134 Curl_llist_destroy(struct Curl_llist *list, void *user) Curl_llist_destroy() argument
143 Curl_llist_count(struct Curl_llist *list) Curl_llist_count() argument
[all...]
/third_party/protobuf/java/core/src/main/java/com/google/protobuf/
H A DListFieldSchema.java10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
39 * Utility class that aids in properly manipulating list fields for either the lite or full runtime.
75 List<?> list = (List<?>) UnsafeUtil.getObject(message, offset); in makeImmutableListAt()
77 if (list instanceof LazyStringList) { in makeImmutableListAt()
78 immutable = ((LazyStringList) list).getUnmodifiableView(); in makeImmutableListAt()
79 } else if (UNMODIFIABLE_LIST_CLASS.isAssignableFrom(list.getClass())) { in makeImmutableListAt()
82 } else if (list instanceof PrimitiveNonBoxingCollection && list instanceof ProtobufList) { in makeImmutableListAt()
83 if (((ProtobufList<?>) list) in makeImmutableListAt()
[all...]
/third_party/protobuf/java/compatibility_tests/v2.5.0/tests/src/main/java/com/google/protobuf/test/
H A DLazyStringArrayListTest.java10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
55 LazyStringArrayList list = new LazyStringArrayList(); in testJustStrings()
56 list.add(STRING_A); in testJustStrings()
57 list.add(STRING_B); in testJustStrings()
58 list.add(STRING_C); in testJustStrings()
60 assertEquals(3, list.size()); in testJustStrings()
61 assertSame(STRING_A, list.get(0)); in testJustStrings()
62 assertSame(STRING_B, list.get(1)); in testJustStrings()
63 assertSame(STRING_C, list in testJustStrings()
[all...]
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/utils/
H A Dlist.h2 * Doubly-linked list
13 * struct dl_list - Doubly-linked list
22 static inline void dl_list_init(struct dl_list *list) in dl_list_init() argument
24 list->next = list; in dl_list_init()
25 list->prev = list; in dl_list_init()
28 static inline void dl_list_add(struct dl_list *list, struct dl_list *item) in dl_list_add() argument
30 item->next = list->next; in dl_list_add()
31 item->prev = list; in dl_list_add()
36 dl_list_add_tail(struct dl_list *list, struct dl_list *item) dl_list_add_tail() argument
49 dl_list_empty(struct dl_list *list) dl_list_empty() argument
54 dl_list_len(struct dl_list *list) dl_list_len() argument
[all...]
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/utils/
H A Dlist.h2 * Doubly-linked list
13 * struct dl_list - Doubly-linked list
22 static inline void dl_list_init(struct dl_list *list) in dl_list_init() argument
24 list->next = list; in dl_list_init()
25 list->prev = list; in dl_list_init()
28 static inline void dl_list_add(struct dl_list *list, struct dl_list *item) in dl_list_add() argument
30 item->next = list->next; in dl_list_add()
31 item->prev = list; in dl_list_add()
36 dl_list_add_tail(struct dl_list *list, struct dl_list *item) dl_list_add_tail() argument
49 dl_list_empty(const struct dl_list *list) dl_list_empty() argument
54 dl_list_len(const struct dl_list *list) dl_list_len() argument
[all...]
/third_party/libdrm/
H A Dxf86drmSL.c1 /* xf86drmSL.c -- Skip list support
30 * This file contains a straightforward skip list implementation.n
103 SkipListPtr list; in drmSLCreate() local
106 list = drmMalloc(sizeof(*list)); in drmSLCreate()
107 if (!list) return NULL; in drmSLCreate()
108 list->magic = SL_LIST_MAGIC; in drmSLCreate()
109 list->level = 0; in drmSLCreate()
110 list->head = SLCreateEntry(SL_MAX_LEVEL, 0, NULL); in drmSLCreate()
111 list in drmSLCreate()
120 SkipListPtr list = (SkipListPtr)l; drmSLDestroy() local
140 SkipListPtr list = (SkipListPtr)l; SLLocate() local
157 SkipListPtr list = (SkipListPtr)l; drmSLInsert() local
190 SkipListPtr list = (SkipListPtr)l; drmSLDelete() local
217 SkipListPtr list = (SkipListPtr)l; drmSLLookup() local
235 SkipListPtr list = (SkipListPtr)l; drmSLLookupNeighbors() local
259 SkipListPtr list = (SkipListPtr)l; drmSLNext() local
278 SkipListPtr list = (SkipListPtr)l; drmSLFirst() local
289 SkipListPtr list = (SkipListPtr)l; drmSLDump() local
[all...]
/third_party/skia/third_party/externals/freetype/src/cache/
H A Dftcmru.c168 FTC_MruList_Init( FTC_MruList list, in FTC_MruList_Init() argument
174 list->num_nodes = 0; in FTC_MruList_Init()
175 list->max_nodes = max_nodes; in FTC_MruList_Init()
176 list->nodes = NULL; in FTC_MruList_Init()
177 list->clazz = *clazz; in FTC_MruList_Init()
178 list->data = data; in FTC_MruList_Init()
179 list->memory = memory; in FTC_MruList_Init()
184 FTC_MruList_Reset( FTC_MruList list ) in FTC_MruList_Reset()
186 while ( list->nodes ) in FTC_MruList_Reset()
187 FTC_MruList_Remove( list, lis in FTC_MruList_Reset()
307 FTC_MruList_Remove( FTC_MruList list, FTC_MruNode node ) FTC_MruList_Remove() argument
326 FTC_MruList_RemoveSelection( FTC_MruList list, FTC_MruNode_CompareFunc selection, FT_Pointer key ) FTC_MruList_RemoveSelection() argument
[all...]
/kernel/linux/linux-6.6/io_uring/
H A Dslist.h15 #define wq_list_empty(list) (READ_ONCE((list)->first) == NULL)
17 #define INIT_WQ_LIST(list) do { \
18 (list)->first = NULL; \
23 struct io_wq_work_list *list) in wq_list_add_after()
30 list->last = node; in wq_list_add_after()
34 struct io_wq_work_list *list) in wq_list_add_tail()
37 if (!list->first) { in wq_list_add_tail()
38 list->last = node; in wq_list_add_tail()
39 WRITE_ONCE(list in wq_list_add_tail()
21 wq_list_add_after(struct io_wq_work_node *node, struct io_wq_work_node *pos, struct io_wq_work_list *list) wq_list_add_after() argument
33 wq_list_add_tail(struct io_wq_work_node *node, struct io_wq_work_list *list) wq_list_add_tail() argument
46 wq_list_add_head(struct io_wq_work_node *node, struct io_wq_work_list *list) wq_list_add_head() argument
55 wq_list_cut(struct io_wq_work_list *list, struct io_wq_work_node *last, struct io_wq_work_node *prev) wq_list_cut() argument
70 __wq_list_splice(struct io_wq_work_list *list, struct io_wq_work_node *to) __wq_list_splice() argument
78 wq_list_splice(struct io_wq_work_list *list, struct io_wq_work_node *to) wq_list_splice() argument
95 wq_list_del(struct io_wq_work_list *list, struct io_wq_work_node *node, struct io_wq_work_node *prev) wq_list_del() argument
[all...]
/kernel/linux/linux-5.10/drivers/net/wireless/quantenna/qtnfmac/
H A Dutil.c7 void qtnf_sta_list_init(struct qtnf_sta_list *list) in qtnf_sta_list_init() argument
9 if (unlikely(!list)) in qtnf_sta_list_init()
12 INIT_LIST_HEAD(&list->head); in qtnf_sta_list_init()
13 atomic_set(&list->size, 0); in qtnf_sta_list_init()
16 struct qtnf_sta_node *qtnf_sta_list_lookup(struct qtnf_sta_list *list, in qtnf_sta_list_lookup() argument
24 list_for_each_entry(node, &list->head, list) { in qtnf_sta_list_lookup()
32 struct qtnf_sta_node *qtnf_sta_list_lookup_index(struct qtnf_sta_list *list, in qtnf_sta_list_lookup_index() argument
37 if (qtnf_sta_list_size(list) <= index) in qtnf_sta_list_lookup_index()
40 list_for_each_entry(node, &list in qtnf_sta_list_lookup_index()
51 struct qtnf_sta_list *list = &vif->sta_list; qtnf_sta_list_add() local
77 struct qtnf_sta_list *list = &vif->sta_list; qtnf_sta_list_del() local
94 qtnf_sta_list_free(struct qtnf_sta_list *list) qtnf_sta_list_free() argument
[all...]
/kernel/linux/linux-6.6/drivers/net/wireless/quantenna/qtnfmac/
H A Dutil.c7 void qtnf_sta_list_init(struct qtnf_sta_list *list) in qtnf_sta_list_init() argument
9 if (unlikely(!list)) in qtnf_sta_list_init()
12 INIT_LIST_HEAD(&list->head); in qtnf_sta_list_init()
13 atomic_set(&list->size, 0); in qtnf_sta_list_init()
16 struct qtnf_sta_node *qtnf_sta_list_lookup(struct qtnf_sta_list *list, in qtnf_sta_list_lookup() argument
24 list_for_each_entry(node, &list->head, list) { in qtnf_sta_list_lookup()
32 struct qtnf_sta_node *qtnf_sta_list_lookup_index(struct qtnf_sta_list *list, in qtnf_sta_list_lookup_index() argument
37 if (qtnf_sta_list_size(list) <= index) in qtnf_sta_list_lookup_index()
40 list_for_each_entry(node, &list in qtnf_sta_list_lookup_index()
51 struct qtnf_sta_list *list = &vif->sta_list; qtnf_sta_list_add() local
77 struct qtnf_sta_list *list = &vif->sta_list; qtnf_sta_list_del() local
94 qtnf_sta_list_free(struct qtnf_sta_list *list) qtnf_sta_list_free() argument
[all...]
/third_party/python/Lib/test/
H A Dtest_itertools.py23 return list(zip(*args))
62 return list(islice(seq, n))
95 l = list(islice(it, stop))
128 self.assertEqual(list(accumulate(range(10))), # one positional arg
130 self.assertEqual(list(accumulate(iterable=range(10))), # kw arg
134 list(accumulate(map(typ, range(10)))),
135 list(map(typ, [0, 1, 3, 6, 10, 15, 21, 28, 36, 45])))
136 self.assertEqual(list(accumulate('abc')), ['a', 'ab', 'abc']) # works with non-numeric
137 self.assertEqual(list(accumulate([])), []) # empty iterable
138 self.assertEqual(list(accumulat
[all...]
/third_party/libdrm/tests/
H A Ddrmsl.c1 /* drmsl.c -- Skip list test
30 * This file contains a straightforward skip list implementation.n
47 static void print(void* list) in print() argument
52 if (drmSLFirst(list, &key, &value)) { in print()
55 } while (drmSLNext(list, &key, &value)); in print()
61 void *list; in do_time() local
71 list = drmSLCreate(); in do_time()
76 drmSLInsert(list, keys[i], NULL); in do_time()
80 if (drmSLFirst(list, &key, &value)) { in do_time()
86 } while (drmSLNext(list, in do_time()
109 print_neighbors(void *list, unsigned long key, unsigned long expected_prev, unsigned long expected_next) print_neighbors() argument
138 void* list; main() local
[all...]
/third_party/python/Objects/stringlib/
H A Dsplit.h7 /* Overallocate the initial list to reduce the number of reallocs for small
25 if (PyList_Append(list, sub)) { \
38 PyList_SET_ITEM(list, count, sub); \
40 if (PyList_Append(list, sub)) { \
50 /* Always force the list to the expected size. */
51 #define FIX_PREALLOC_SIZE(list) Py_SET_SIZE(list, count)
59 PyObject *list = PyList_New(PREALLOC_SIZE(maxcount)); in split_whitespace() local
62 if (list == NULL) in split_whitespace()
75 /* No whitespace in str_obj, so just use it as list[ in split_whitespace()
108 PyObject *list = PyList_New(PREALLOC_SIZE(maxcount)); split_char() local
151 PyObject *list, *sub; split() local
198 PyObject *list = PyList_New(PREALLOC_SIZE(maxcount)); rsplit_whitespace() local
249 PyObject *list = PyList_New(PREALLOC_SIZE(maxcount)); rsplit_char() local
293 PyObject *list, *sub; rsplit() local
350 PyObject *list = PyList_New(0); splitlines() local
[all...]
/third_party/ninja/src/
H A Dstring_piece_util_test.cc24 vector<StringPiece> list = SplitStringPiece(input, ':'); in TEST() local
26 EXPECT_EQ(list.size(), 3); in TEST()
28 EXPECT_EQ(list[0], "a"); in TEST()
29 EXPECT_EQ(list[1], "b"); in TEST()
30 EXPECT_EQ(list[2], "c"); in TEST()
35 vector<StringPiece> list = SplitStringPiece(empty, ':'); in TEST() local
37 EXPECT_EQ(list.size(), 1); in TEST()
39 EXPECT_EQ(list[0], ""); in TEST()
44 vector<StringPiece> list = SplitStringPiece(one, ':'); in TEST() local
46 EXPECT_EQ(list in TEST()
53 vector<StringPiece> list = SplitStringPiece(sep_only, ':'); TEST() local
63 vector<StringPiece> list = SplitStringPiece(sep, ':'); TEST() local
78 vector<StringPiece> list = SplitStringPiece(input, ':'); TEST() local
86 vector<StringPiece> list = SplitStringPiece(empty, ':'); TEST() local
106 vector<StringPiece> list = SplitStringPiece(sep, ':'); TEST() local
[all...]
/kernel/linux/linux-5.10/drivers/clk/samsung/
H A Dclk.c95 /* register a list of aliases */
97 const struct samsung_clock_alias *list, in samsung_clk_register_alias()
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 o
96 samsung_clk_register_alias(struct samsung_clk_provider *ctx, const struct samsung_clock_alias *list, unsigned int nr_clk) samsung_clk_register_alias() argument
126 samsung_clk_register_fixed_rate(struct samsung_clk_provider *ctx, const struct samsung_fixed_rate_clock *list, unsigned int nr_clk) samsung_clk_register_fixed_rate() argument
156 samsung_clk_register_fixed_factor(struct samsung_clk_provider *ctx, const struct samsung_fixed_factor_clock *list, unsigned int nr_clk) samsung_clk_register_fixed_factor() argument
176 samsung_clk_register_mux(struct samsung_clk_provider *ctx, const struct samsung_mux_clock *list, unsigned int nr_clk) samsung_clk_register_mux() argument
199 samsung_clk_register_div(struct samsung_clk_provider *ctx, const struct samsung_div_clock *list, unsigned int nr_clk) samsung_clk_register_div() argument
229 samsung_clk_register_gate(struct samsung_clk_provider *ctx, const struct samsung_gate_clock *list, unsigned int nr_clk) samsung_clk_register_gate() argument
[all...]

Completed in 9 milliseconds

12345678910>>...556