Home
last modified time | relevance | path

Searched refs:list (Results 51 - 75 of 5937) sorted by relevance

12345678910>>...238

/third_party/protobuf/java/core/src/test/java/com/google/protobuf/
H A DUnmodifiableLazyStringListTest.java10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
55 UnmodifiableLazyStringList list = new UnmodifiableLazyStringList(rawList); in testReadOnlyMethods()
56 assertEquals(3, list.size()); in testReadOnlyMethods()
57 assertSame(STRING_A, list.get(0)); in testReadOnlyMethods()
58 assertSame(STRING_B, list.get(1)); in testReadOnlyMethods()
59 assertSame(STRING_C, list.get(2)); in testReadOnlyMethods()
60 assertEquals(BYTE_STRING_A, list.getByteString(0)); in testReadOnlyMethods()
61 assertEquals(BYTE_STRING_B, list.getByteString(1)); in testReadOnlyMethods()
62 assertEquals(BYTE_STRING_C, list in testReadOnlyMethods()
[all...]
/third_party/skia/third_party/externals/spirv-tools/test/util/
H A Dilist_test.cpp46 // traverse the list from begin() to end(). This implicitly test the
50 TestList list; in TEST() local
53 list.push_back(&nodes[i]); in TEST()
57 for (auto& i : list) output.push_back(i.data_); in TEST()
62 // Returns a list containing the values 0 to n-1 using the first n elements of
63 // nodes to build the list.
65 TestList list; in BuildList() local
68 list.push_back(&nodes[i]); in BuildList()
70 return list; in BuildList()
76 TestList list in TEST() local
83 TestList list = BuildList(nodes, 10); TEST() local
90 TestList list = BuildList(nodes, 10); TEST() local
97 TestList list = BuildList(nodes, 10); TEST() local
104 TestList list = BuildList(nodes, 10); TEST() local
114 const TestList list = BuildList(nodes, 10); TEST() local
124 TestList list; TEST() local
136 TestList list = BuildList(nodes, 5); TEST() local
151 TestList list = BuildList(nodes, 5); TEST() local
166 TestList list = BuildList(nodes, 6); TEST() local
179 TestList list = BuildList(nodes, 6); TEST() local
192 TestList list = BuildList(nodes, 6); TEST() local
205 TestList list = BuildList(nodes, 6); TEST() local
218 TestList list = BuildList(nodes, 6); TEST() local
231 TestList list = BuildList(nodes, 6); TEST() local
244 TestList list = BuildList(nodes, 6); TEST() local
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/util/
H A Dilist_test.cpp46 // traverse the list from begin() to end(). This implicitly test the
50 TestList list; in TEST() local
53 list.push_back(&nodes[i]); in TEST()
57 for (auto& i : list) output.push_back(i.data_); in TEST()
62 // Returns a list containing the values 0 to n-1 using the first n elements of
63 // nodes to build the list.
65 TestList list; in BuildList() local
68 list.push_back(&nodes[i]); in BuildList()
70 return list; in BuildList()
76 TestList list in TEST() local
83 TestList list = BuildList(nodes, 10); TEST() local
90 TestList list = BuildList(nodes, 10); TEST() local
97 TestList list = BuildList(nodes, 10); TEST() local
104 TestList list = BuildList(nodes, 10); TEST() local
114 const TestList list = BuildList(nodes, 10); TEST() local
124 TestList list; TEST() local
136 TestList list = BuildList(nodes, 5); TEST() local
151 TestList list = BuildList(nodes, 5); TEST() local
166 TestList list = BuildList(nodes, 6); TEST() local
179 TestList list = BuildList(nodes, 6); TEST() local
192 TestList list = BuildList(nodes, 6); TEST() local
205 TestList list = BuildList(nodes, 6); TEST() local
218 TestList list = BuildList(nodes, 6); TEST() local
231 TestList list = BuildList(nodes, 6); TEST() local
244 TestList list = BuildList(nodes, 6); TEST() local
[all...]
/third_party/spirv-tools/test/util/
H A Dilist_test.cpp46 // traverse the list from begin() to end(). This implicitly test the
50 TestList list; in TEST() local
53 list.push_back(&nodes[i]); in TEST()
57 for (auto& i : list) output.push_back(i.data_); in TEST()
62 // Returns a list containing the values 0 to n-1 using the first n elements of
63 // nodes to build the list.
65 TestList list; in BuildList() local
68 list.push_back(&nodes[i]); in BuildList()
70 return list; in BuildList()
76 TestList list in TEST() local
83 TestList list = BuildList(nodes, 10); TEST() local
90 TestList list = BuildList(nodes, 10); TEST() local
97 TestList list = BuildList(nodes, 10); TEST() local
104 TestList list = BuildList(nodes, 10); TEST() local
114 const TestList list = BuildList(nodes, 10); TEST() local
124 TestList list; TEST() local
136 TestList list = BuildList(nodes, 5); TEST() local
151 TestList list = BuildList(nodes, 5); TEST() local
166 TestList list = BuildList(nodes, 6); TEST() local
179 TestList list = BuildList(nodes, 6); TEST() local
192 TestList list = BuildList(nodes, 6); TEST() local
205 TestList list = BuildList(nodes, 6); TEST() local
218 TestList list = BuildList(nodes, 6); TEST() local
231 TestList list = BuildList(nodes, 6); TEST() local
244 TestList list = BuildList(nodes, 6); TEST() local
[all...]
/third_party/toybox/lib/
H A Dllist.c1 /* llist.c - Linked list functions
3 * Linked list structures have a next pointer as their first element.
26 // Call a function (such as free()) on each element of a linked list.
27 void llist_traverse(void *list, void (*using)(void *node)) in llist_traverse() argument
29 void *old = list; in llist_traverse()
31 while (list) { in llist_traverse()
32 void *pop = llist_pop(&list); in llist_traverse()
35 // End doubly linked list too. in llist_traverse()
36 if (old == list) break; in llist_traverse()
40 // Return the first item from the list, advancin
42 llist_pop(void *list) llist_pop() argument
55 dlist_pop(void *list) dlist_pop() argument
71 dlist_lpop(void *list) dlist_lpop() argument
85 dlist_add_nomalloc(struct double_list **list, struct double_list *new) dlist_add_nomalloc() argument
97 dlist_add(struct double_list **list, char *data) dlist_add() argument
108 dlist_terminate(void *list) dlist_terminate() argument
[all...]
/third_party/curl/src/
H A Dslist_wc.c35 * slist_wc_append() appends a string to the linked list. This function can be
38 struct slist_wc *slist_wc_append(struct slist_wc *list, in slist_wc_append() argument
46 if(!list) { in slist_wc_append()
47 list = malloc(sizeof(struct slist_wc)); in slist_wc_append()
49 if(!list) { in slist_wc_append()
54 list->first = new_item; in slist_wc_append()
55 list->last = new_item; in slist_wc_append()
56 return list; in slist_wc_append()
59 list->last->next = new_item; in slist_wc_append()
60 list in slist_wc_append()
65 slist_wc_free_all(struct slist_wc *list) slist_wc_free_all() argument
[all...]
/third_party/mesa3d/src/compiler/glsl/
H A Dlist.h25 * \file list.h
26 * \brief Doubly-linked list abstract container type.
28 * Each doubly-linked list has a sentinel head and tail node. These nodes
33 * A list is empty if either the head sentinel's \c next pointer points to the
36 * list structure.
38 * Do note that this means that the list nodes will contain pointers into the
39 * list structure itself and as a result you may not \c realloc() an \c
76 * This creates a sort of degenerate list that is occasionally useful.
81 * Insert a node in the list after the current node
86 * Insert another list i
351 exec_list_make_empty(struct exec_list *list) exec_list_make_empty() argument
360 exec_list_is_empty(const struct exec_list *list) exec_list_is_empty() argument
376 exec_list_is_singular(const struct exec_list *list) exec_list_is_singular() argument
383 exec_list_get_head_const(const struct exec_list *list) exec_list_get_head_const() argument
389 exec_list_get_head(struct exec_list *list) exec_list_get_head() argument
395 exec_list_get_head_raw_const(const struct exec_list *list) exec_list_get_head_raw_const() argument
401 exec_list_get_head_raw(struct exec_list *list) exec_list_get_head_raw() argument
407 exec_list_get_tail_const(const struct exec_list *list) exec_list_get_tail_const() argument
413 exec_list_get_tail(struct exec_list *list) exec_list_get_tail() argument
419 exec_list_get_tail_raw_const(const struct exec_list *list) exec_list_get_tail_raw_const() argument
425 exec_list_get_tail_raw(struct exec_list *list) exec_list_get_tail_raw() argument
431 exec_list_length(const struct exec_list *list) exec_list_length() argument
444 exec_list_push_head(struct exec_list *list, struct exec_node *n) exec_list_push_head() argument
454 exec_list_push_tail(struct exec_list *list, struct exec_node *n) exec_list_push_tail() argument
464 exec_list_push_degenerate_list_at_head(struct exec_list *list, struct exec_node *n) exec_list_push_degenerate_list_at_head() argument
475 exec_list_pop_head(struct exec_list *list) exec_list_pop_head() argument
485 exec_list_move_nodes_to(struct exec_list *list, struct exec_list *target) exec_list_move_nodes_to() argument
503 exec_list_append(struct exec_list *list, struct exec_list *source) exec_list_append() argument
539 exec_list_prepend(struct exec_list *list, struct exec_list *source) exec_list_prepend() argument
561 exec_list_validate(const struct exec_list *list) exec_list_validate() argument
[all...]
/foundation/communication/bluetooth_service/services/bluetooth/stack/platform/include/
H A Ddl_list.h26 // Double linked list.
35 * @param list DL_LIST pointer.
38 static inline void DL_ListInit(DL_LIST *list) in DL_ListInit() argument
40 list->pstNext = list; in DL_ListInit()
41 list->pstPrev = list; in DL_ListInit()
47 * @param list DL_LIST pointer.
51 static inline void DL_ListAdd(DL_LIST *list, DL_LIST *node) in DL_ListAdd() argument
53 node->pstNext = list in DL_ListAdd()
66 DL_ListTailInsert(DL_LIST *list, DL_LIST *node) DL_ListTailInsert() argument
78 DL_ListHeadInsert(DL_LIST *list, DL_LIST *node) DL_ListHeadInsert() argument
104 DL_ListEmpty(DL_LIST *list) DL_ListEmpty() argument
[all...]
/drivers/hdf_core/framework/test/unittest/osal/
H A Dosal_list_test.c30 struct DListHead list; member
81 DLIST_FOR_EACH_ENTRY(pos, head, OsalTestEventHandle, list) { in OsalTestList()
96 DListHeadInit(&g_handleArr[i].list); in TestListAddTail()
97 DListInsertTail(&g_handleArr[i].list, &g_handleMng.list); in TestListAddTail()
111 DListHeadInit(&mng1.list); in TestListMerge()
115 DListHeadInit(&list1[i].list); in TestListMerge()
116 DListInsertTail(&list1[i].list, &mng1.list); in TestListMerge()
118 OsalTestList(&mng1.list); in TestListMerge()
[all...]
/third_party/ffmpeg/libavcodec/
H A Dcbs_sei.c74 int ff_cbs_sei_list_add(SEIRawMessageList *list) in ff_cbs_sei_list_add() argument
77 int old_count = list->nb_messages_allocated; in ff_cbs_sei_list_add()
79 av_assert0(list->nb_messages <= old_count); in ff_cbs_sei_list_add()
80 if (list->nb_messages + 1 > old_count) { in ff_cbs_sei_list_add()
83 ptr = av_realloc_array(list->messages, in ff_cbs_sei_list_add()
84 new_count, sizeof(*list->messages)); in ff_cbs_sei_list_add()
88 list->messages = ptr; in ff_cbs_sei_list_add()
89 list->nb_messages_allocated = new_count; in ff_cbs_sei_list_add()
92 memset(list->messages + old_count, 0, in ff_cbs_sei_list_add()
93 (new_count - old_count) * sizeof(*list in ff_cbs_sei_list_add()
99 ff_cbs_sei_free_message_list(SEIRawMessageList *list) ff_cbs_sei_free_message_list() argument
218 cbs_sei_get_message_list(CodedBitstreamContext *ctx, CodedBitstreamUnit *unit, SEIRawMessageList **list) cbs_sei_get_message_list() argument
256 SEIRawMessageList *list; ff_cbs_sei_add_message() local
307 SEIRawMessageList *list; ff_cbs_sei_find_message() local
330 cbs_sei_delete_message(SEIRawMessageList *list, int position) cbs_sei_delete_message() argument
358 SEIRawMessageList *list; ff_cbs_sei_delete_message_type() local
[all...]
/test/xts/acts/arkui/ace_c_arkui_test/entry/src/main/cpp/list/
H A Dlist_clip_test.cpp22 NAPI_START(list, ARKUI_NODE_LIST); in TestListClip001()
26 auto ret = nodeAPI->setAttribute(list, NODE_CLIP, &valueItem); in TestListClip001()
29 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_CLIP)->value[PARAM_0].i32, clip); in TestListClip001()
35 NAPI_START(list, ARKUI_NODE_LIST); in TestListClip002()
39 auto ret = nodeAPI->setAttribute(list, NODE_CLIP, &valueItem); in TestListClip002()
41 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_CLIP)->value[PARAM_0].i32, clip); in TestListClip002()
47 NAPI_START(list, ARKUI_NODE_LIST); in TestListClip003()
51 auto ret = nodeAPI->setAttribute(list, NODE_CLIP, &valueItem); in TestListClip003()
53 ASSERT_NE(nodeAPI->getAttribute(list, NODE_CLIP)->value[PARAM_0].i32, clip); in TestListClip003()
59 NAPI_START(list, ARKUI_NODE_LIS in TestListClip004()
[all...]
H A Dlist_borderradius_test.cpp22 NAPI_START(list, ARKUI_NODE_LIST); in TestListBorderRadius001()
26 auto ret = nodeAPI->setAttribute(list, NODE_BORDER_RADIUS, &valueItem); in TestListBorderRadius001()
28 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_BORDER_RADIUS)->value[PARAM_0].f32, borderRadius); in TestListBorderRadius001()
29 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_BORDER_RADIUS)->value[PARAM_1].f32, borderRadius); in TestListBorderRadius001()
30 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_BORDER_RADIUS)->value[PARAM_2].f32, borderRadius); in TestListBorderRadius001()
31 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_BORDER_RADIUS)->value[PARAM_3].f32, borderRadius); in TestListBorderRadius001()
37 NAPI_START(list, ARKUI_NODE_LIST); in TestListBorderRadius002()
45 auto ret = nodeAPI->setAttribute(list, NODE_BORDER_RADIUS, &valueItem); in TestListBorderRadius002()
47 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_BORDER_RADIUS)->value[PARAM_0].f32, borderRadiusUp); in TestListBorderRadius002()
48 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_BORDER_RADIU in TestListBorderRadius002()
[all...]
H A Dlist_borderwidth_test.cpp22 NAPI_START(list, ARKUI_NODE_LIST); in TestListBorderWidth001()
26 auto ret = nodeAPI->setAttribute(list, NODE_BORDER_WIDTH, &valueItem); in TestListBorderWidth001()
28 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_BORDER_WIDTH)->value[PARAM_0].f32, borderWidth); in TestListBorderWidth001()
29 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_BORDER_WIDTH)->value[PARAM_1].f32, borderWidth); in TestListBorderWidth001()
30 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_BORDER_WIDTH)->value[PARAM_2].f32, borderWidth); in TestListBorderWidth001()
31 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_BORDER_WIDTH)->value[PARAM_3].f32, borderWidth); in TestListBorderWidth001()
37 NAPI_START(list, ARKUI_NODE_LIST); in TestListBorderWidth002()
45 auto ret = nodeAPI->setAttribute(list, NODE_BORDER_WIDTH, &valueItem); in TestListBorderWidth002()
47 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_BORDER_WIDTH)->value[PARAM_0].f32, borderWidthUp); in TestListBorderWidth002()
48 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_BORDER_WIDT in TestListBorderWidth002()
[all...]
H A Dlist_rotate_test.cpp22 NAPI_START(list, ARKUI_NODE_LIST); in TestListRotate001()
31 auto ret = nodeAPI->setAttribute(list, NODE_ROTATE, &valueItem); in TestListRotate001()
34 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_ROTATE)->value[PARAM_0].f32, rotateX); in TestListRotate001()
35 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_ROTATE)->value[PARAM_1].f32, rotateY); in TestListRotate001()
36 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_ROTATE)->value[PARAM_2].f32, rotateZ); in TestListRotate001()
37 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_ROTATE)->value[PARAM_3].f32, angle); in TestListRotate001()
38 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_ROTATE)->value[PARAM_4].f32, perspective); in TestListRotate001()
44 NAPI_START(list, ARKUI_NODE_LIST); in TestListRotate002()
61 NAPI_START(list, ARKUI_NODE_LIST); in TestListRotate003()
70 auto ret = nodeAPI->setAttribute(list, NODE_ROTAT in TestListRotate003()
[all...]
H A Dlist_lineargradient_test.cpp21 NAPI_START(list, ARKUI_NODE_LIST); in TestListLinearGradient001()
32 auto ret = nodeAPI->setAttribute(list, NODE_LINEAR_GRADIENT, &valueItem); in TestListLinearGradient001()
35 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_LINEAR_GRADIENT)->value[PARAM_0].f32, SIZE_180); in TestListLinearGradient001()
36 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_LINEAR_GRADIENT)->value[PARAM_1].i32, direction); in TestListLinearGradient001()
37 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_LINEAR_GRADIENT)->value[PARAM_2].i32, repeating); in TestListLinearGradient001()
43 NAPI_START(list, ARKUI_NODE_LIST); in TestListLinearGradient002()
54 auto ret = nodeAPI->setAttribute(list, NODE_LINEAR_GRADIENT, &valueItem); in TestListLinearGradient002()
57 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_LINEAR_GRADIENT)->value[PARAM_0].f32, SIZE_180); in TestListLinearGradient002()
58 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_LINEAR_GRADIENT)->value[PARAM_1].i32, direction); in TestListLinearGradient002()
59 ASSERT_EQ(nodeAPI->getAttribute(list, NODE_LINEAR_GRADIEN in TestListLinearGradient002()
[all...]
/third_party/libcoap/include/coap3/
H A Dcoap_utlist_internal.h9 notice, this list of conditions and the following disclaimer.
40 * Either way, the pointer to the head of the list must be initialized to NULL.
48 * struct item *list = NULL:
53 * DL_APPEND(list, item);
81 * namely, we always reassign our tmp variable to the list head if we need
86 #define UTLIST_SV(elt,list) _tmp = (char*)(list); {char **_alias = (char**)&(list); *_alias = (elt); }
87 #define UTLIST_NEXT(elt,list,next) ((char*)((list)
[all...]
/third_party/mesa3d/src/gallium/drivers/r300/compiler/
H A Dradeon_list.c45 void rc_list_add(struct rc_list ** list, struct rc_list * new_value) in rc_list_add() argument
49 if (*list == NULL) { in rc_list_add()
50 *list = new_value; in rc_list_add()
54 for (temp = *list; temp->Next; temp = temp->Next); in rc_list_add()
60 void rc_list_remove(struct rc_list ** list, struct rc_list * rm_value) in rc_list_remove() argument
62 if (*list == rm_value) { in rc_list_remove()
63 *list = rm_value->Next; in rc_list_remove()
73 unsigned int rc_list_count(struct rc_list * list) in rc_list_count() argument
76 while (list) { in rc_list_count()
78 list in rc_list_count()
83 rc_list_print(struct rc_list * list) rc_list_print() argument
[all...]
/foundation/communication/dsoftbus/core/authentication/src/
H A Dauth_session_key.c43 static void RemoveOldKey(SessionKeyList *list) in RemoveOldKey() argument
47 LIST_FOR_EACH_ENTRY(item, (const ListNode *)list, SessionKeyItem, node) { in RemoveOldKey()
56 LIST_FOR_EACH_ENTRY(item, (const ListNode *)list, SessionKeyItem, node) { in RemoveOldKey()
73 void InitSessionKeyList(SessionKeyList *list) in InitSessionKeyList() argument
75 AUTH_CHECK_AND_RETURN_LOGE(list != NULL, AUTH_FSM, "list is NULL"); in InitSessionKeyList()
76 ListInit(list); in InitSessionKeyList()
109 bool CheckSessionKeyListExistType(const SessionKeyList *list, AuthLinkType type) in CheckSessionKeyListExistType() argument
111 CHECK_NULL_PTR_RETURN_VALUE(list, false); in CheckSessionKeyListExistType()
113 LIST_FOR_EACH_ENTRY(item, list, SessionKeyIte in CheckSessionKeyListExistType()
121 CheckSessionKeyListHasOldKey(const SessionKeyList *list, AuthLinkType type) CheckSessionKeyListHasOldKey() argument
133 ClearOldKey(const SessionKeyList *list, AuthLinkType type) ClearOldKey() argument
163 DestroySessionKeyList(SessionKeyList *list) DestroySessionKeyList() argument
175 HasSessionKey(const SessionKeyList *list) HasSessionKey() argument
181 GetSessionKeyTypeByIndex(const SessionKeyList *list, int32_t index) GetSessionKeyTypeByIndex() argument
204 GetLatestAvailableSessionKeyTime(const SessionKeyList *list, AuthLinkType type) GetLatestAvailableSessionKeyTime() argument
232 SetSessionKeyAvailable(SessionKeyList *list, int32_t index) SetSessionKeyAvailable() argument
250 AddSessionKey(SessionKeyList *list, int32_t index, const SessionKey *key, AuthLinkType type, bool isOldKey) AddSessionKey() argument
280 GetLatestSessionKey(const SessionKeyList *list, AuthLinkType type, int32_t *index, SessionKey *key) GetLatestSessionKey() argument
322 SetSessionKeyAuthLinkType(const SessionKeyList *list, int32_t index, AuthLinkType type) SetSessionKeyAuthLinkType() argument
345 GetSessionKeyByIndex(const SessionKeyList *list, int32_t index, AuthLinkType type, SessionKey *key) GetSessionKeyByIndex() argument
371 RemoveSessionkeyByIndex(SessionKeyList *list, int32_t index, AuthLinkType type) RemoveSessionkeyByIndex() argument
397 ClearSessionkeyByAuthLinkType(int64_t authId, SessionKeyList *list, AuthLinkType type) ClearSessionkeyByAuthLinkType() argument
418 EncryptData(const SessionKeyList *list, AuthLinkType type, const InDataInfo *inDataInfo, uint8_t *outData, uint32_t *outLen) EncryptData() argument
452 DecryptData(const SessionKeyList *list, AuthLinkType type, const InDataInfo *inDataInfo, uint8_t *outData, uint32_t *outLen) DecryptData() argument
484 EncryptInner(const SessionKeyList *list, AuthLinkType type, const InDataInfo *inDataInfo, uint8_t **outData, uint32_t *outLen) EncryptInner() argument
508 DecryptInner(const SessionKeyList *list, AuthLinkType type, const InDataInfo *inDataInfo, uint8_t **outData, uint32_t *outLen) DecryptInner() argument
533 DumpSessionkeyList(const SessionKeyList *list) DumpSessionkeyList() argument
[all...]
/third_party/pcre2/pcre2/src/
H A Dpcre2_auto_possess.c17 this list of conditions and the following disclaimer.
20 notice, this list of conditions and the following disclaimer in the
303 * Fill the character property list *
307 possessification, and if so, fills a list with its properties.
314 list points to output list
315 list[0] will be filled with the opcode
316 list[1] will be non-zero if this opcode
318 list[2..7] depends on the opcode
326 uint32_t *list) in get_chr_property_list()
325 get_chr_property_list(PCRE2_SPTR code, BOOL utf, BOOL ucp, const uint8_t *fcc, uint32_t *list) get_chr_property_list() argument
540 uint32_t list[8]; compare_opcodes() local
1137 uint32_t list[8]; auto_possessify() local
[all...]
/foundation/graphic/graphic_2d/rosen/test/render_service/render_service_profiler/unittest/
H A Drs_profiler_command_test.cpp42 ArgList list { args }; in HWTEST_F()
44 EXPECT_EQ(list.Uint32(0), 123); in HWTEST_F()
45 EXPECT_EQ(list.Int32(1), -5); in HWTEST_F()
46 EXPECT_EQ(list.Uint64(2), 45738957893); in HWTEST_F()
47 EXPECT_EQ(list.Int64(3), 837983); in HWTEST_F()
48 EXPECT_EQ(list.Fp32(4), 1.5f); in HWTEST_F()
49 EXPECT_EQ(list.Fp64(5), 678.789); in HWTEST_F()
50 EXPECT_EQ(list.String(6), "qwe"); in HWTEST_F()
51 EXPECT_EQ(list.Count(), 7); in HWTEST_F()
52 EXPECT_TRUE(list in HWTEST_F()
[all...]
/third_party/toybox/toys/posix/
H A Dtail.c59 struct line_list *list = ptr; in dump_chunk() local
61 xwrite(1, list->data, list->len); in dump_chunk()
62 free(list); in dump_chunk()
70 struct line_list *list = 0, *temp; in try_lseek() local
98 temp->next = list; in try_lseek()
99 list = temp; in try_lseek()
102 offset = list->len; in try_lseek()
108 else if (list->data[offset] == '\n' && !++lines) { in try_lseek()
110 list in try_lseek()
146 struct line_list *list = 0, *new; do_tail() local
[all...]
/third_party/NuttX/fs/inode/
H A Dfs_files.c16 * notice, this list of conditions and the following disclaimer.
18 * notice, this list of conditions and the following disclaimer in
125 static void _files_semtake(struct filelist *list) in _files_semtake() argument
129 while (sem_wait(&list->fl_sem) != 0) in _files_semtake()
143 #define _files_semgive(list) (void)sem_post(&list->fl_sem)
147 struct filelist *list = sched_getfiles(); in file_hold() local
148 if (!list) in file_hold()
153 _files_semtake(list); in file_hold()
159 _files_semgive(list); in file_hold()
164 struct filelist *list = sched_getfiles(); file_release() local
262 files_initlist(struct filelist *list) files_initlist() argument
279 files_releaselist(struct filelist *list) files_releaselist() argument
319 struct filelist *list = NULL; file_dup2() local
424 struct filelist *list = NULL; files_allocate() local
472 struct filelist *list = NULL; files_close_internal() local
547 struct filelist *list = NULL; files_release() local
566 struct filelist *list = NULL; files_get_openfile() local
585 struct filelist *list = NULL; alloc_fd() local
650 struct filelist *list = sched_getfiles(); files_refer() local
[all...]
/third_party/node/test/parallel/
H A Dtest-stream2-readable-from-list.js39 let list = [ Buffer.from('foog'),
43 list = bufferListFromArray(list);
46 util.inspect([ list ], { compact: false }),
56 let ret = fromList(6, { buffer: list, length: 16 });
60 ret = fromList(2, { buffer: list, length: 10 });
64 ret = fromList(2, { buffer: list, length: 8 });
68 ret = fromList(100, { buffer: list, length: 6 });
72 assert.deepStrictEqual(list, new BufferList());
77 let list
[all...]
/third_party/typescript/tests/baselines/reference/
H A DgenericFunctionInference1.js6 declare function list<T>(a: T): T[];
10 const f00 = pipe(list);
11 const f01 = pipe(list, box);
12 const f02 = pipe(box, list);
13 const f03 = pipe(x => list(x), box);
14 const f04 = pipe(list, x => box(x));
15 const f05 = pipe(x => list(x), x => box(x))
16 const f06 = pipe(list, pipe(box));
17 const f07 = pipe(x => list(x), pipe(box));
18 const f08 = pipe(x => list(
[all...]
/foundation/communication/dsoftbus/core/authentication/include/
H A Dauth_session_key.h47 void InitSessionKeyList(SessionKeyList *list);
48 void DestroySessionKeyList(SessionKeyList *list);
51 uint64_t GetLatestAvailableSessionKeyTime(const SessionKeyList *list, AuthLinkType type);
52 bool HasSessionKey(const SessionKeyList *list);
53 AuthLinkType GetSessionKeyTypeByIndex(const SessionKeyList *list, int32_t index);
54 int32_t AddSessionKey(SessionKeyList *list, int32_t index, const SessionKey *key, AuthLinkType type,
56 int32_t SetSessionKeyAvailable(SessionKeyList *list, int32_t index);
57 int32_t GetLatestSessionKey(const SessionKeyList *list, AuthLinkType type, int32_t *index, SessionKey *key);
58 int32_t GetSessionKeyByIndex(const SessionKeyList *list, int32_t index, AuthLinkType type, SessionKey *key);
59 int32_t SetSessionKeyAuthLinkType(const SessionKeyList *list, int32_
[all...]

Completed in 12 milliseconds

12345678910>>...238