/external/clang/test/CodeGen/ |
2002-08-19-RecursiveLocals.c | 5 struct list { struct 7 struct list *Next; 10 static struct list B; /* Forward declare static */ 11 static struct list A = { 7, &B }; 12 static struct list B = { 8, &A }; 14 extern struct list D; /* forward declare normal var */ 16 struct list C = { 7, &D }; 17 struct list D = { 8, &C };
|
2002-07-14-MiscListTests.c | 3 // Test list stuff 7 // Test opaque structure support. the list type is defined later 8 struct list; 10 struct list *PassThroughList(struct list *L) { 17 typedef struct list { struct 19 struct list *Next; 20 } list; typedef in typeref:struct:list 22 list *Data; 28 Data = (list*)malloc(12); // This is not a proper list allocatio [all...] |
/external/chromium_org/net/spdy/ |
write_blocked_list_test.cc | 17 IntWriteBlockedList list; local 18 EXPECT_FALSE(list.HasWriteBlockedStreams()); 19 list.PushBack(1, 1); 20 EXPECT_TRUE(list.HasWriteBlockedStreams()); 21 EXPECT_EQ(1, list.GetHighestPriorityWriteBlockedList()); 22 list.PushBack(1, 0); 23 EXPECT_TRUE(list.HasWriteBlockedStreams()); 24 EXPECT_EQ(0, list.GetHighestPriorityWriteBlockedList()); 28 IntWriteBlockedList list; local 29 list.PushBack(1, 4) 38 IntWriteBlockedList list; local 57 IntWriteBlockedList list; local [all...] |
/external/libcxx/test/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.insert.iter.cons/ |
container.fail.cpp | 19 #include <list> 23 std::front_insert_iterator<std::list<int> > i = std::list<int>();
|
/external/chromium_org/gpu/config/ |
gpu_blacklist.cc | 20 GpuBlacklist* list = new GpuBlacklist(); local 21 list->AddSupportedFeature("accelerated_2d_canvas", 23 list->AddSupportedFeature("gpu_compositing", 25 list->AddSupportedFeature("webgl", 27 list->AddSupportedFeature("flash_3d", 29 list->AddSupportedFeature("flash_stage3d", 31 list->AddSupportedFeature("flash_stage3d_baseline", 33 list->AddSupportedFeature("accelerated_video_decode", 35 list->AddSupportedFeature("accelerated_video_encode", 37 list->AddSupportedFeature("panel_fitting" [all...] |
/external/clang/test/Analysis/ |
kmalloc-linux.c | 16 struct test **list, *t; local 19 list = kmalloc(sizeof(*list) * 10, __GFP_ZERO); 20 if (list == NULL) 24 t = list[i]; 27 free(list); // no-warning 31 struct test **list, *t; local 34 list = kmalloc(sizeof(*list) * 10, 0); 35 if (list == NULL 46 struct test **list, *t; local [all...] |
malloc-three-arg.c | 16 struct test **list, *t; local 19 list = malloc(sizeof(*list) * 10, NULL, M_ZERO); 20 if (list == NULL) 24 t = list[i]; 27 free(list); // no-warning 31 struct test **list, *t; local 34 list = malloc(sizeof(*list) * 10, NULL, 0); 35 if (list == NULL 46 struct test **list, *t; local [all...] |
/external/chromium_org/v8/test/cctest/ |
test-list.cc | 7 // notice, this list of conditions and the following disclaimer. 9 // copyright notice, this list of conditions and the following 55 // Check that we can add (a reference to) an element of the list 58 // Add elements to the list to grow it to its capacity. 59 List<int, ZeroingAllocationPolicy> list(4); 60 list.Add(1); 61 list.Add(2); 62 list.Add(3); 63 list.Add(4) 159 List<int>* list = new List<int>(0); local [all...] |
test-ast.cc | 7 // notice, this list of conditions and the following disclaimer. 9 // copyright notice, this list of conditions and the following 37 TEST(List) { 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)) [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
u_simple_list.h | 5 * Intended to work with a list sentinal which is created as an empty 6 * list. Insert & delete are O(1). 41 * Remove an element from list. 54 * Insert an element to the list head. 56 * \param list list. 59 #define insert_at_head(list, elem) \ 61 (elem)->prev = list; \ 62 (elem)->next = (list)->next; \ 63 (list)->next->prev = elem; [all...] |
/external/chromium_org/third_party/mesa/src/src/mesa/main/ |
simple_list.h | 5 * Intended to work with a list sentinal which is created as an empty 6 * list. Insert & delete are O(1). 50 * Remove an element from list. 61 * Insert an element to the list head. 63 * \param list list. 66 #define insert_at_head(list, elem) \ 68 (elem)->prev = list; \ 69 (elem)->next = (list)->next; \ 70 (list)->next->prev = elem; [all...] |
/external/mesa3d/src/gallium/auxiliary/util/ |
u_simple_list.h | 5 * Intended to work with a list sentinal which is created as an empty 6 * list. Insert & delete are O(1). 41 * Remove an element from list. 54 * Insert an element to the list head. 56 * \param list list. 59 #define insert_at_head(list, elem) \ 61 (elem)->prev = list; \ 62 (elem)->next = (list)->next; \ 63 (list)->next->prev = elem; [all...] |
/external/mesa3d/src/mesa/main/ |
simple_list.h | 5 * Intended to work with a list sentinal which is created as an empty 6 * list. Insert & delete are O(1). 50 * Remove an element from list. 61 * Insert an element to the list head. 63 * \param list list. 66 #define insert_at_head(list, elem) \ 68 (elem)->prev = list; \ 69 (elem)->next = (list)->next; \ 70 (list)->next->prev = elem; [all...] |
/external/chromium_org/third_party/android_crazy_linker/src/src/ |
crazy_linker_search_path_list_unittest.cpp | 33 SearchPathList list; local 34 EXPECT_FALSE(list.FindFile("/foo")); 35 EXPECT_FALSE(list.FindFile("/tmp/zoo")); 36 EXPECT_FALSE(list.FindFile("/tmp/foo/bar")); 41 SearchPathList list; local 42 list.AddPaths("/tmp/foo"); 43 EXPECT_STREQ("/tmp/foo/bar", list.FindFile("bar")); 44 EXPECT_FALSE(list.FindFile("zoo")); 45 EXPECT_FALSE(list.FindFile("foo")); 50 SearchPathList list; local 60 SearchPathList list; local 68 SearchPathList list; local 80 SearchPathList list; local [all...] |
/external/bluetooth/bluedroid/osi/include/ |
list.h | 17 void list_free(list_t *list); 20 bool list_is_empty(const list_t *list); 21 size_t list_length(const list_t *list); 22 void *list_front(const list_t *list); 23 void *list_back(const list_t *list); 26 bool list_insert_after(list_t *list, list_node_t *prev_node, void *data); 27 bool list_prepend(list_t *list, void *data); 28 bool list_append(list_t *list, void *data); 29 bool list_remove(list_t *list, void *data); 30 void list_clear(list_t *list); [all...] |
/external/chromium_org/tools/clang/rewrite_scoped_refptr/tests/ |
test11-expected.cc | 16 FooList list; local 17 list.push_back(new Foo); 18 list.push_back(new Foo); 19 for (FooList::const_iterator it = list.begin(); it != list.end(); ++it) {
|
test11-original.cc | 16 FooList list; local 17 list.push_back(new Foo); 18 list.push_back(new Foo); 19 for (FooList::const_iterator it = list.begin(); it != list.end(); ++it) {
|
/external/bluetooth/bluedroid/osi/src/ |
list.c | 3 #include "list.h" 18 static list_node_t *list_free_node_(list_t *list, list_node_t *node); 20 // Returns a new, empty list. Returns NULL if not enough memory could be allocated 21 // for the list structure. The returned list must be freed with |list_free|. The 22 // |callback| specifies a function to be called whenever a list element is removed 23 // from the list. It can be used to release resources held by the list element, e.g. 27 list_t *list = (list_t *)calloc(sizeof(list_t), 1); local 28 if (list) [all...] |
/external/chromium_org/net/websockets/ |
websocket_net_log_params_test.cc | 15 base::ListValue* list = new base::ListValue(); local 16 list->Append(new base::StringValue("GET /demo HTTP/1.1")); 17 list->Append(new base::StringValue("Host: example.com")); 18 list->Append(new base::StringValue("Connection: Upgrade")); 19 list->Append(new base::StringValue("Sec-WebSocket-Key2: 12998 5 Y3 1 .P00")); 20 list->Append(new base::StringValue("Sec-WebSocket-Protocol: sample")); 21 list->Append(new base::StringValue("Upgrade: WebSocket")); 22 list->Append(new base::StringValue( 24 list->Append(new base::StringValue("Origin: http://example.com")); 25 list->Append(new base::StringValue(std::string())) [all...] |
/external/bluetooth/bluedroid/osi/test/ |
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 = list_new(NULL) 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/ |
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/components/precache/core/ |
url_list_provider.h | 8 #include <list> 15 // Interface for classes that can provide a list of URLs. 18 typedef base::Callback<void(const std::list<GURL>&)> GetURLsCallback; 20 // Runs |callback| with a list of URLs. |callback| may be run before the call
|
/external/chromium_org/base/containers/ |
linked_list_unittest.cc | 34 // Checks that when iterating |list| (either from head to tail, or from 37 void ExpectListContentsForDirection(const LinkedList<Node>& list, 40 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail()); 41 node != list.end(); 51 void ExpectListContents(const LinkedList<Node>& list, 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.end(), list.head()) 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/ |
file_change_unittest.cc | 33 void CreateList(FileChangeList* list, const FileChange (&inputs)[INPUT_SIZE]) { 34 list->clear(); 36 list->Update(inputs[i]); 40 void VerifyList(const FileChangeList& list, 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.list().at(i)) 55 FileChangeList list; local 86 FileChangeList list; local [all...] |
/external/libcxx/test/containers/sequences/list/list.cons/ |
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<int, other_allocator<int> > l2 = l [all...] |