/external/wpa_supplicant_8/src/utils/ |
H A D | list.h | 2 * Doubly-linked list 13 * struct dl_list - Doubly-linked list 20 static inline void dl_list_init(struct dl_list *list) argument 22 list->next = list; 23 list->prev = list; 26 static inline void dl_list_add(struct dl_list *list, struct dl_list *item) argument 28 item->next = list->next; 29 item->prev = list; 34 dl_list_add_tail(struct dl_list *list, struct dl_list *item) argument 47 dl_list_empty(struct dl_list *list) argument 52 dl_list_len(struct dl_list *list) argument [all...] |
/external/wpa_supplicant_8/wpa_supplicant/src/utils/ |
H A D | list.h | 2 * Doubly-linked list 13 * struct dl_list - Doubly-linked list 20 static inline void dl_list_init(struct dl_list *list) argument 22 list->next = list; 23 list->prev = list; 26 static inline void dl_list_add(struct dl_list *list, struct dl_list *item) argument 28 item->next = list->next; 29 item->prev = list; 34 dl_list_add_tail(struct dl_list *list, struct dl_list *item) argument 47 dl_list_empty(struct dl_list *list) argument 52 dl_list_len(struct dl_list *list) argument [all...] |
/external/bluetooth/bluedroid/osi/test/ |
H A D | list_test.cpp | 4 #include "list.h" 9 list_t *list = list_new(NULL); local 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); local 16 list_free(list); 25 list_t *list = list_new(NULL); local 26 EXPECT_TRUE(list_is_empty(list)); 27 list_free(list); 31 list_t *list local 37 list_t *list = list_new(NULL); local 45 list_t *list = list_new(NULL); local 53 list_t *list = list_new(NULL); local 63 list_t *list = list_new(NULL); local 73 list_t *list = list_new(NULL); local 85 list_t *list = list_new(NULL); local 97 list_t *list = list_new(NULL); local 111 list_t *list = list_new(NULL); local 125 list_t *list = list_new(NULL); local 138 list_t *list = list_new(NULL); local 144 list_t *list = list_new(NULL); local [all...] |
/external/chromium-trace/trace-viewer/src/ui/ |
H A D | list_view.css | 6 .x-list-view { 10 .x-list-view:focus { 14 .x-list-view * { 18 .x-list-view > .list-item { 22 .x-list-view:focus > .list-item[selected] { 28 .x-list-view > .list-item[selected] {
|
/external/chromium_org/base/containers/ |
H A D | linked_list_unittest.cc | 34 // Checks that when iterating |list| (either from head to tail, or from 37 void ExpectListContentsForDirection(const LinkedList<Node>& list, argument 40 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail()); 41 node != list.end(); 51 void ExpectListContents(const LinkedList<Node>& list, argument 56 ExpectListContentsForDirection(list, num_nodes, node_ids, true); 60 ExpectListContentsForDirection(list, num_nodes, node_ids, false); 65 LinkedList<Node> list; local 66 EXPECT_EQ(list 72 LinkedList<Node> list; local 107 LinkedList<Node> list; local 182 LinkedList<Node> list; local 219 LinkedList<Node> list; local 261 LinkedList<Node> list; local 266 LinkedList<Node> list; local 275 LinkedList<Node> list; local 297 LinkedList<Node> list; local [all...] |
/external/chromium_org/chrome/browser/sync_file_system/ |
H A D | file_change_unittest.cc | 33 void CreateList(FileChangeList* list, const FileChange (&inputs)[INPUT_SIZE]) { argument 34 list->clear(); 36 list->Update(inputs[i]); 40 void VerifyList(const FileChangeList& list, argument 42 SCOPED_TRACE(testing::Message() << "actual:" << list.DebugString()); 43 ASSERT_EQ(EXPECTED_SIZE, list.size()); 44 for (size_t i = 0; i < list.size(); ++i) { 47 << " actual:" << list.list().at(i).DebugString()); 48 EXPECT_EQ(expected[i], list 55 FileChangeList list; local 86 FileChangeList list; local [all...] |
/external/chromium_org/v8/test/cctest/ |
H A D | test-ast.cc | 7 // notice, this list of conditions and the following disclaimer. 9 // copyright notice, this list of conditions and the following 38 List<AstNode*>* list = new List<AstNode*>(0); local 39 CHECK_EQ(0, list->length()); 46 list->Add(node); 47 CHECK_EQ(1, list->length()); 48 CHECK_EQ(node, list->at(0)); 49 CHECK_EQ(node, list->last()); 53 list->Add(node); 55 CHECK_EQ(1 + kElements, list [all...] |
/external/libcxx/test/containers/sequences/list/list.cons/ |
H A D | copy.pass.cpp | 10 // <list> 12 // list(const list& c); 14 #include <list> 23 std::list<int> l(3, 2); 24 std::list<int> l2 = l; 28 std::list<int, test_allocator<int> > l(3, 2, test_allocator<int>(5)); 29 std::list<int, test_allocator<int> > l2 = l; 35 std::list<int, other_allocator<int> > l(3, 2, other_allocator<int>(5)); 36 std::list<in [all...] |
/external/chromium_org/ppapi/proxy/ |
H A D | interface_list_unittest.cc | 16 void AddPPB(InterfaceList* list, argument 18 list->AddPPB(iface_name, iface_addr, perm); 30 InterfaceList list; local 31 ASSERT_TRUE(list.GetInterfaceForPPB(PPB_CORE_INTERFACE_1_0) != NULL); 32 ASSERT_TRUE(list.GetInterfaceForPPB("FakeUnknownInterface") == NULL); 37 InterfaceList list; local 45 AddPPB(&list, dev_channel_iface_name, dev_channel_iface_addr, 47 AddPPB(&list, dev_iface_name, dev_iface_addr, PERMISSION_DEV); 51 ASSERT_TRUE(list.GetInterfaceForPPB(dev_channel_iface_name) == NULL); 52 ASSERT_TRUE(list [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
H A D | radeon_list.c | 45 void rc_list_add(struct rc_list ** list, struct rc_list * new_value) argument 49 if (*list == NULL) { 50 *list = new_value; 54 for (temp = *list; temp->Next; temp = temp->Next); 60 void rc_list_remove(struct rc_list ** list, struct rc_list * rm_value) argument 62 if (*list == rm_value) { 63 *list = rm_value->Next; 73 unsigned int rc_list_count(struct rc_list * list) argument 76 while (list) { 78 list 83 rc_list_print(struct rc_list * list) argument [all...] |
H A D | radeon_list.h | 40 void rc_list_add(struct rc_list ** list, struct rc_list * new_value); 41 void rc_list_remove(struct rc_list ** list, struct rc_list * rm_value); 42 unsigned int rc_list_count(struct rc_list * list); 43 void rc_list_print(struct rc_list * list);
|
/external/chromium_org/tools/gyp/test/win/compiler-flags/ |
H A D | force-include-files.cc | 6 std::list<std::vector<std::string> > l;
|
/external/libcxx/test/containers/sequences/list/ |
H A D | version.pass.cpp | 10 // <list> 12 #include <list>
|
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
H A D | radeon_list.c | 45 void rc_list_add(struct rc_list ** list, struct rc_list * new_value) argument 49 if (*list == NULL) { 50 *list = new_value; 54 for (temp = *list; temp->Next; temp = temp->Next); 60 void rc_list_remove(struct rc_list ** list, struct rc_list * rm_value) argument 62 if (*list == rm_value) { 63 *list = rm_value->Next; 73 unsigned int rc_list_count(struct rc_list * list) argument 76 while (list) { 78 list 83 rc_list_print(struct rc_list * list) argument [all...] |
H A D | radeon_list.h | 40 void rc_list_add(struct rc_list ** list, struct rc_list * new_value); 41 void rc_list_remove(struct rc_list ** list, struct rc_list * rm_value); 42 unsigned int rc_list_count(struct rc_list * list); 43 void rc_list_print(struct rc_list * list);
|
/external/libcxx/test/containers/sequences/list/list.modifiers/ |
H A D | push_back.pass.cpp | 10 // <list> 14 #include <list> 22 std::list<int> c; 26 assert(c == std::list<int>(a, a+5)); 30 std::list<int, min_allocator<int>> c; 34 assert((c == std::list<int, min_allocator<int>>(a, a+5)));
|
H A D | push_front.pass.cpp | 10 // <list> 14 #include <list> 22 std::list<int> c; 26 assert(c == std::list<int>(a, a+5)); 30 std::list<int, min_allocator<int>> c; 34 assert((c == std::list<int, min_allocator<int>>(a, a+5)));
|
/external/libcxx/test/containers/sequences/list/list.ops/ |
H A D | remove.pass.cpp | 10 // <list> 14 #include <list> 24 std::list<int> c(a1, a1+4); 26 assert(c == std::list<int>(a2, a2+3)); 32 std::list<int, min_allocator<int>> c(a1, a1+4); 34 assert((c == std::list<int, min_allocator<int>>(a2, a2+3)));
|
H A D | unique.pass.cpp | 10 // <list> 14 #include <list> 24 std::list<int> c(a1, a1+sizeof(a1)/sizeof(a1[0])); 26 assert(c == std::list<int>(a2, a2+4)); 32 std::list<int, min_allocator<int>> c(a1, a1+sizeof(a1)/sizeof(a1[0])); 34 assert((c == std::list<int, min_allocator<int>>(a2, a2+4)));
|
/external/chromium_org/content/browser/webui/ |
H A D | web_ui_message_handler_unittest.cc | 15 base::ListValue list; local 21 list.Append(new base::FundamentalValue(zero_value)); 22 EXPECT_TRUE(WebUIMessageHandler::ExtractIntegerValue(&list, &value)); 24 list.Clear(); 26 list.Append(new base::FundamentalValue(neg_value)); 27 EXPECT_TRUE(WebUIMessageHandler::ExtractIntegerValue(&list, &value)); 29 list.Clear(); 31 list.Append(new base::FundamentalValue(pos_value)); 32 EXPECT_TRUE(WebUIMessageHandler::ExtractIntegerValue(&list, &value)); 34 list 52 base::ListValue list; local 89 base::ListValue list; local [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
H A D | u_caps.c | 34 * Iterates over a list of caps checks as defined in u_caps.h. Should 36 * the list (TERMINATE). Should any check fail returns FALSE and set 40 util_check_caps_out(struct pipe_screen *screen, const unsigned *list, int *out) argument 45 for (i = 0; list[i];) { 46 switch(list[i++]) { 48 if (!screen->get_param(screen, list[i++])) { 54 tmpi = screen->get_param(screen, list[i++]); 55 if (tmpi < (int)list[i++]) { 61 tmpf = screen->get_paramf(screen, list[i++]); 62 if (tmpf < (float)list[ 103 util_check_caps(struct pipe_screen *screen, const unsigned *list) argument 219 unsigned *list; member in struct:__anon13769 220 } list[] = { local [all...] |
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_caps.c | 34 * Iterates over a list of caps checks as defined in u_caps.h. Should 36 * the list (TERMINATE). Should any check fail returns FALSE and set 40 util_check_caps_out(struct pipe_screen *screen, const unsigned *list, int *out) argument 45 for (i = 0; list[i];) { 46 switch(list[i++]) { 48 if (!screen->get_param(screen, list[i++])) { 54 tmpi = screen->get_param(screen, list[i++]); 55 if (tmpi < (int)list[i++]) { 61 tmpf = screen->get_paramf(screen, list[i++]); 62 if (tmpf < (float)list[ 103 util_check_caps(struct pipe_screen *screen, const unsigned *list) argument 219 unsigned *list; member in struct:__anon27180 220 } list[] = { local [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkTMultiMap.h | 39 ValueList* list = fHash.find(key); local 40 if (list) { 42 // linked list, and it will contain the value of the first element. 43 ValueList* newEntry = SkNEW_ARGS(ValueList, (list->fValue)); 44 newEntry->fNext = list->fNext; 47 list->fNext = newEntry; 48 list->fValue = value; 57 ValueList* list = fHash.find(key); local 60 SkASSERT(list); 62 while (list 84 ValueList* list = fHash.find(key); local 93 ValueList* list = fHash.find(key); local [all...] |
/external/skia/src/gpu/ |
H A D | GrTMultiMap.h | 39 ValueList* list = fHash.find(key); local 40 if (NULL != list) { 42 // linked list, and it will contain the value of the first element. 43 ValueList* newEntry = SkNEW_ARGS(ValueList, (list->fValue)); 44 newEntry->fNext = list->fNext; 47 list->fNext = newEntry; 48 list->fValue = value; 57 ValueList* list = fHash.find(key); local 60 SkASSERT(NULL != list); 62 while (list 84 ValueList* list = fHash.find(key); local 93 ValueList* list = fHash.find(key); local [all...] |
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
H A D | parse-events.y | 11 #include <linux/list.h> 25 #define ALLOC_LIST(list) \ 27 list = malloc(sizeof(*list)); \ 28 ABORT_ON(!list); \ 29 INIT_LIST_HEAD(list); \ 32 static inc_group_count(struct list_head *list, 36 if (!list_is_last(list->next, list)) 98 parse_events_update_lists($1, &data->list); [all...] |