/external/qemu/util/ |
H A D | notify.c | 19 void notifier_list_init(NotifierList *list) argument 21 QLIST_INIT(&list->notifiers); 24 void notifier_list_add(NotifierList *list, Notifier *notifier) argument 26 QLIST_INSERT_HEAD(&list->notifiers, notifier, node); 34 void notifier_list_notify(NotifierList *list, void *data) argument 38 QLIST_FOREACH_SAFE(notifier, &list->notifiers, node, next) { 43 void notifier_with_return_list_init(NotifierWithReturnList *list) argument 45 QLIST_INIT(&list->notifiers); 48 void notifier_with_return_list_add(NotifierWithReturnList *list, argument 51 QLIST_INSERT_HEAD(&list 59 notifier_with_return_list_notify(NotifierWithReturnList *list, void *data) argument [all...] |
/external/e2fsprogs/e2fsck/ |
H A D | profile_helpers.c | 8 * list of sections or relations, or accessing multiple values from a 31 * internal functions used to build up a null-terminated char ** list 35 * purposes to build up the list, which is returned in *ret_list by 38 * The publicly exported interface for freeing char** list is 43 char **list; member in struct:profile_string_list 49 * Initialize the string list abstraction. 51 static errcode_t init_list(struct profile_string_list *list) argument 53 list->num = 0; 54 list->max = 10; 55 list 66 end_list(struct profile_string_list *list, char ***ret_list) argument 88 add_to_list(struct profile_string_list *list, char *str) argument 110 is_list_member(struct profile_string_list *list, const char *str) argument 128 profile_free_list(char **list) argument [all...] |
/external/chromium_org/chrome/browser/resources/options/ |
H A D | password_manager_list.css | 5 #saved-passwords-list .list-inline-button { 15 html[dir='ltr'] #saved-passwords-list .list-inline-button { 19 html[dir='rtl'] #saved-passwords-list .list-inline-button { 28 #saved-passwords-list .url { 33 #saved-passwords-list .name { 38 #saved-passwords-list .password { 43 #saved-passwords-list [all...] |
/external/chromium_org/net/base/ |
H A D | address_list.cc | 20 base::ListValue* list = new base::ListValue(); local 24 list->Append(new base::StringValue(it->ToString())); 27 dict->Set("address_list", list); 51 AddressList list; local 52 list.set_canonical_name(canonical_name); 55 list.push_back(IPEndPoint(*iter, 0)); 57 return list; 63 AddressList list; local 65 list.set_canonical_name(std::string(head->ai_canonname)); 70 list 78 CopyWithPort(const AddressList& list, uint16 port) argument [all...] |
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/ |
H A D | vp9_frame_buffers.c | 16 int vp9_alloc_internal_frame_buffers(InternalFrameBufferList *list) { argument 17 assert(list != NULL); 18 vp9_free_internal_frame_buffers(list); 20 list->num_internal_frame_buffers = 22 list->int_fb = 23 (InternalFrameBuffer *)vpx_calloc(list->num_internal_frame_buffers, 24 sizeof(*list->int_fb)); 25 return (list->int_fb == NULL); 28 void vp9_free_internal_frame_buffers(InternalFrameBufferList *list) { argument 31 assert(list ! [all...] |
/external/libcxx/test/containers/sequences/list/list.modifiers/ |
H A D | insert_iter_size_value.pass.cpp | 10 // <list> 18 #include <list> 47 std::list<int> l1(a1, a1+3); 48 std::list<int>::iterator i = l1.insert(next(l1.cbegin()), 5, 4); 50 assert(l1 == std::list<int>(a2, a2+8)); 63 assert(l1 == std::list<int>(a2, a2+8)); 67 std::list<int> c1(100); 68 std::list<int> c2; 69 std::list<int>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1); 77 std::list<in [all...] |
H A D | erase_iter_db1.pass.cpp | 10 // <list> 18 #include <list> 29 std::list<int> l1(a1, a1+3); 30 std::list<int>::const_iterator i = l1.end(); 37 std::list<int, min_allocator<int>> l1(a1, a1+3); 38 std::list<int, min_allocator<int>>::const_iterator i = l1.end();
|
H A D | erase_iter_iter_db4.pass.cpp | 10 // <list> 18 #include <list> 29 std::list<int> l1(a1, a1+3); 30 std::list<int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin()); 36 std::list<int, min_allocator<int>> l1(a1, a1+3); 37 std::list<int, min_allocator<int>>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
/external/libvpx/libvpx/vp9/common/ |
H A D | vp9_frame_buffers.c | 16 int vp9_alloc_internal_frame_buffers(InternalFrameBufferList *list) { argument 17 assert(list != NULL); 18 vp9_free_internal_frame_buffers(list); 20 list->num_internal_frame_buffers = 22 list->int_fb = 23 (InternalFrameBuffer *)vpx_calloc(list->num_internal_frame_buffers, 24 sizeof(*list->int_fb)); 25 return (list->int_fb == NULL); 28 void vp9_free_internal_frame_buffers(InternalFrameBufferList *list) { argument 31 assert(list ! [all...] |
/external/chromium_org/chrome/browser/resources/print_preview/search/ |
H A D | destination_list.css | 5 .destination-list > header { 11 .destination-list .title { 18 .destination-list .action-link { 22 .destination-list > ul { 23 list-style-type: none; 28 .destination-list .throbber-container { 34 .destination-list .throbber { 39 .destination-list .no-destinations-message { 46 .destination-list > footer { 51 .destination-list [all...] |
/external/chromium_org/sync/notifier/ |
H A D | single_object_invalidation_set_unittest.cc | 62 SingleObjectInvalidationSet list; local 63 EXPECT_FALSE(list.StartsWithUnknownVersion()); 65 list.Insert(Invalidation::Init(kId, 1, "one")); 66 EXPECT_FALSE(list.StartsWithUnknownVersion()); 68 list.Insert(Invalidation::InitUnknownVersion(kId)); 69 EXPECT_TRUE(list.StartsWithUnknownVersion()); 71 list.Clear(); 72 EXPECT_FALSE(list.StartsWithUnknownVersion()); 76 SingleObjectInvalidationSet list; local 78 scoped_ptr<base::ListValue> value = list 86 SingleObjectInvalidationSet list; local 97 SingleObjectInvalidationSet list; local [all...] |
/external/chromium_org/ui/file_manager/file_manager/foreground/css/ |
H A D | list.css | 5 /* Derived from /ui/webui/resources/css/list.css. */ 7 list, 13 list. */ 16 list > *, 24 list > * { 32 list:focus > [lead], 37 list:not([disabled]) > :hover, 42 list > [selected], 47 list > .spacer, 55 list [all...] |
/external/ipsec-tools/src/racoon/ |
H A D | rsalist.h | 13 * notice, this list of conditions and the following disclaimer. 15 * notice, this list of conditions and the following disclaimer in the 55 int rsa_key_insert(struct genlist *list, struct netaddr *src, struct netaddr *dst, RSA *rsa); 56 void rsa_key_dump(struct genlist *list); 59 RSA *rsa_try_check_rsasign(vchar_t *source, vchar_t *sig, struct genlist *list); 61 unsigned long rsa_list_count(struct genlist *list); 63 int rsa_parse_file(struct genlist *list, const char *fname, enum rsa_key_type type);
|
/external/libcxx/test/containers/sequences/list/list.cons/ |
H A D | assign_initializer_list.pass.cpp | 10 // <list> 14 #include <list> 23 std::list<int> d; 26 std::list<int>::iterator i = d.begin(); 34 std::list<int, min_allocator<int>> d; 37 std::list<int, min_allocator<int>>::iterator i = d.begin();
|
H A D | default_noexcept.pass.cpp | 10 // <list> 12 // list() 17 #include <list> 34 typedef std::list<MoveOnly> C; 38 typedef std::list<MoveOnly, test_allocator<MoveOnly>> C; 42 typedef std::list<MoveOnly, other_allocator<MoveOnly>> C; 46 typedef std::list<MoveOnly, some_alloc<MoveOnly>> C;
|
H A D | initializer_list.pass.cpp | 10 // <list> 12 // list(initializer_list<value_type> il); 14 #include <list> 23 std::list<int> d = {3, 4, 5, 6}; 25 std::list<int>::iterator i = d.begin(); 33 std::list<int, min_allocator<int>> d = {3, 4, 5, 6}; 35 std::list<int, min_allocator<int>>::iterator i = d.begin();
|
H A D | move_assign_noexcept.pass.cpp | 10 // <list> 12 // list& operator=(list&& c) 19 #include <list> 36 typedef std::list<MoveOnly> C; 40 typedef std::list<MoveOnly, test_allocator<MoveOnly>> C; 44 typedef std::list<MoveOnly, other_allocator<MoveOnly>> C; 48 typedef std::list<MoveOnly, some_alloc<MoveOnly>> C;
|
H A D | move_noexcept.pass.cpp | 10 // <list> 12 // list(list&&) 17 #include <list> 34 typedef std::list<MoveOnly> C; 38 typedef std::list<MoveOnly, test_allocator<MoveOnly>> C; 42 typedef std::list<MoveOnly, other_allocator<MoveOnly>> C; 46 typedef std::list<MoveOnly, some_alloc<MoveOnly>> C;
|
H A D | op_equal_initializer_list.pass.cpp | 10 // <list> 12 // list& operator=(initializer_list<value_type> il); 14 #include <list> 22 std::list<int> d; 25 std::list<int>::iterator i = d.begin(); 33 std::list<int, min_allocator<int>> d; 36 std::list<int, min_allocator<int>>::iterator i = d.begin();
|
/external/libcxx/test/containers/sequences/list/list.ops/ |
H A D | remove_if.pass.cpp | 10 // <list> 14 #include <list> 30 std::list<int> c(a1, a1+4); 32 assert(c == std::list<int>(a2, a2+2)); 38 std::list<int, min_allocator<int>> c(a1, a1+4); 40 assert((c == std::list<int, min_allocator<int>>(a2, a2+2)));
|
H A D | reverse.pass.cpp | 10 // <list> 14 #include <list> 24 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0]))); 32 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
H A D | sort.pass.cpp | 10 // <list> 14 #include <list> 24 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0]))); 32 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
H A D | sort_comp.pass.cpp | 10 // <list> 14 #include <list> 25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 27 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0]))); 33 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 35 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
H A D | unique_pred.pass.cpp | 10 // <list> 14 #include <list> 29 std::list<int> c(a1, a1+sizeof(a1)/sizeof(a1[0])); 31 assert(c == std::list<int>(a2, a2+4)); 37 std::list<int, min_allocator<int>> c(a1, a1+sizeof(a1)/sizeof(a1[0])); 39 assert((c == std::list<int, min_allocator<int>>(a2, a2+4)));
|
/external/chromium_org/third_party/icu/source/common/ |
H A D | ulist.c | 33 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) { argument 64 list->head = newItem; 65 list->tail = newItem; 66 list->currentIndex = 0; 69 U_CAPI void U_EXPORT2 ulist_addItemEndList(UList *list, const void *data, UBool forceDelete, UErrorCode *status) { argument 72 if (U_FAILURE(*status) || list == NULL || data == NULL) { 84 if (list->size == 0) { 85 ulist_addFirstItem(list, newIte 96 ulist_addItemBeginList(UList *list, const void *data, UBool forceDelete, UErrorCode *status) argument 124 ulist_containsString(const UList *list, const char *data, int32_t length) argument 146 ulist_getNext(UList *list) argument 160 ulist_getListSize(const UList *list) argument 168 ulist_resetList(UList *list) argument 175 ulist_deleteList(UList *list) argument [all...] |