Cross Reference: /external/bluetooth/bluedroid/osi/test/list

Lines Matching defs:list
4 #include "list.h"
9   list_t *list = list_new(NULL);
10   ASSERT_TRUE(list != NULL);
14   // In this test we just verify that list_free is callable with a valid list.
15   list_t *list = list_new(NULL);
16   list_free(list);
25   list_t *list = list_new(NULL);
26   EXPECT_TRUE(list_is_empty(list));
27   list_free(list);
31   list_t *list = list_new(NULL);
32   EXPECT_EQ(list_length(list), 0U);
33   list_free(list);
37   list_t *list = list_new(NULL);
38   EXPECT_TRUE(list_prepend(list, &list));
39   EXPECT_FALSE(list_is_empty(list));
40   EXPECT_EQ(list_length(list), 1U);
41   list_free(list);
45   list_t *list = list_new(NULL);
46   EXPECT_TRUE(list_append(list, &list));
47   EXPECT_FALSE(list_is_empty(list));
48   EXPECT_EQ(list_length(list), 1U);
49   list_free(list);
53   list_t *list = list_new(NULL);
54   list_append(list, &list);
55   EXPECT_TRUE(list_remove(list, &list));
56   EXPECT_TRUE(list_is_empty(list));
57   EXPECT_EQ(list_length(list),  0U);
58   list_free(list);
63   list_t *list = list_new(NULL);
64   list_append(list, &list);
65   EXPECT_FALSE(list_remove(list, &x));
66   EXPECT_FALSE(list_is_empty(list));
67   EXPECT_EQ(list_length(list), 1U);
68   list_free(list);
73   list_t *list = list_new(NULL);
76     list_append(list, &x[i]);
78   EXPECT_EQ(list_front(list), &x[0]);
80   list_free(list);
85   list_t *list = list_new(NULL);
88     list_append(list, &x[i]);
90   EXPECT_EQ(list_back(list), &x[ARRAY_SIZE(x) - 1]);
92   list_free(list);
97   list_t *list = list_new(NULL);
100     list_append(list, &x[i]);
102   list_clear(list);
103   EXPECT_TRUE(list_is_empty(list));
104   EXPECT_EQ(list_length(list), 0U);
106   list_free(list);
111   list_t *list = list_new(NULL);
114     list_append(list, &x[i]);
117   for (const list_node_t *node = list_begin(list); node != list_end(list); node = list_next(node), ++i)
120   list_free(list);
125   list_t *list = list_new(NULL);
128     list_prepend(list, &x[i]);
131   for (const list_node_t *node = list_begin(list); node != list_end(list); node = list_next(node), --i)
134   list_free(list);
138   list_t *list = list_new(NULL);
139   EXPECT_EQ(list_begin(list), list_end(list));
140   list_free(list);
144   list_t *list = list_new(NULL);
145   list_append(list, &list);
146   EXPECT_NE(list_begin(list), list_end(list));
147   EXPECT_EQ(list_next(list_begin(list)), list_end(list));
148   list_free(list);