| /external/chromium-trace/catapult/telemetry/third_party/modulegraph/modulegraph_tests/testpkg-regr6/ |
| D | module.py | 4 list(1)
5 + list(2)
6 + list(2)
7 + list(2)
8 + list(2)
9 + list(2)
10 + list(2)
11 + list(2)
12 + list(2)
13 + list(2)
[all …]
|
| /external/v8/test/cctest/ |
| D | test-list.cc | 59 List<int, ZeroingAllocationPolicy> list(4); in TEST() local
60 list.Add(1); in TEST()
61 list.Add(2); in TEST()
62 list.Add(3); in TEST()
63 list.Add(4); in TEST()
66 list.Add(list[0]); in TEST()
67 CHECK_EQ(1, list[4]); in TEST()
73 List<int, ZeroingAllocationPolicy> list(4); in TEST() local
74 list.Add(0); in TEST()
75 list.Add(1); in TEST()
[all …]
|
| /external/smali/util/src/test/java/org/jf/util/ |
| D | LinearSearchTest.java | 44 List<Integer> list = Lists.newArrayList(0, 1, 3, 4); in testLinearSearch() local
46 doTest(list, 5, 10); in testLinearSearch()
47 doTest(list, 5, 4); in testLinearSearch()
48 doTest(list, 5, 3); in testLinearSearch()
49 doTest(list, 5, 2); in testLinearSearch()
50 doTest(list, 5, 1); in testLinearSearch()
51 doTest(list, 5, 0); in testLinearSearch()
53 doTest(list, 4, 10); in testLinearSearch()
54 doTest(list, 4, 4); in testLinearSearch()
55 doTest(list, 4, 3); in testLinearSearch()
[all …]
|
| /external/chromium-trace/catapult/third_party/vinn/third_party/parse5/test/fixtures/ |
| D | formatting_element_list_test.js | 12 var list = new FormattingElementList(treeAdapter);
14 list.insertMarker();
15 assert.strictEqual(list.length, 1);
16 assert.strictEqual(list.entries[0].type, FormattingElementList.MARKER_ENTRY);
18 list.insertMarker();
19 assert.strictEqual(list.length, 2);
20 assert.strictEqual(list.entries[1].type, FormattingElementList.MARKER_ENTRY);
24 var list = new FormattingElementList(treeAdapter),
30 list.pushElement(element1, element1Token);
31 assert.strictEqual(list.length, 1);
[all …]
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/ |
| D | ListExtensions.cs | 47 public static bool add( this IList list, object value ) in add() argument
49 int count = list.Count; in add()
50 list.Add( value ); in add()
51 return list.Count == count + 1; in add()
55 public static void add<T>( this ICollection<T> list, T value ) in add() argument
57 list.Add( value ); in add()
61 public static void add<T>( this List<T> list, T value ) in add() argument
63 list.Add( value ); in add()
67 public static void add( this IList list, int index, object value ) in add() argument
69 list.Insert( index, value ); in add()
[all …]
|
| /external/jetty/src/java/org/eclipse/jetty/util/ |
| D | LazyList.java | 77 public static Object add(Object list, Object item) in add() argument
79 if (list==null) in add()
91 if (list instanceof List) in add()
93 ((List<Object>)list).add(item); in add()
94 return list; in add()
98 l.add(list); in add()
111 public static Object add(Object list, int index, Object item) in add() argument
113 if (list==null) in add()
124 if (list instanceof List) in add()
126 ((List<Object>)list).add(index,item); in add()
[all …]
|
| /external/dbus/bus/ |
| D | expirelist.c | 49 BusExpireList *list; in bus_expire_list_new() local
51 list = dbus_new0 (BusExpireList, 1); in bus_expire_list_new()
52 if (list == NULL) in bus_expire_list_new()
55 list->expire_func = expire_func; in bus_expire_list_new()
56 list->data = data; in bus_expire_list_new()
57 list->loop = loop; in bus_expire_list_new()
58 list->expire_after = expire_after; in bus_expire_list_new()
60 list->timeout = _dbus_timeout_new (100, /* irrelevant */ in bus_expire_list_new()
62 list, NULL); in bus_expire_list_new()
63 if (list->timeout == NULL) in bus_expire_list_new()
[all …]
|
| /external/google-breakpad/src/third_party/libdisasm/swig/ |
| D | libdisasm.i | 124 x86_op_list *list = (x86_op_list *) in x86_op_list_new() local
126 list->count = 0; in x86_op_list_new()
127 return list; in x86_op_list_new()
130 void x86_op_list_free(x86_op_list *list) { in x86_op_list_free() argument
133 node = list->head; in x86_op_list_free()
141 free( list ); in x86_op_list_free()
144 x86_op_list_node * x86_op_list_first(x86_op_list *list) { in x86_op_list_first() argument
145 return list->head; in x86_op_list_first()
148 x86_op_list_node * x86_op_list_last(x86_op_list *list) { in x86_op_list_last() argument
149 return list->tail; in x86_op_list_last()
[all …]
|
| /external/e2fsprogs/e2fsck/ |
| D | profile_helpers.c | 43 char **list; member
51 static errcode_t init_list(struct profile_string_list *list) in init_list() argument
53 list->num = 0; in init_list()
54 list->max = 10; in init_list()
55 list->list = malloc(list->max * sizeof(char *)); in init_list()
56 if (list->list == 0) in init_list()
58 list->list[0] = 0; in init_list()
66 static void end_list(struct profile_string_list *list, char ***ret_list) in end_list() argument
70 if (list == 0) in end_list()
74 *ret_list = list->list; in end_list()
[all …]
|
| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| D | ListsTest.java | 106 ArrayList<Integer> list = Lists.newArrayList(); in testNewArrayListEmpty() local
107 assertEquals(Collections.emptyList(), list); in testNewArrayListEmpty() local
111 ArrayList<Integer> list = Lists.newArrayListWithCapacity(0); in testNewArrayListWithCapacity() local
112 assertEquals(Collections.emptyList(), list); in testNewArrayListWithCapacity() local
127 ArrayList<Integer> list = Lists.newArrayListWithExpectedSize(0); in testNewArrayListWithExpectedSize() local
128 assertEquals(Collections.emptyList(), list); in testNewArrayListWithExpectedSize() local
143 ArrayList<Integer> list = Lists.newArrayList(0, 1, 1); in testNewArrayListVarArgs() local
144 assertEquals(SOME_COLLECTION, list); in testNewArrayListVarArgs()
157 ArrayList<Integer> list = Lists.newArrayList(SOME_COLLECTION); in testNewArrayListFromCollection() local
158 assertEquals(SOME_COLLECTION, list); in testNewArrayListFromCollection()
[all …]
|
| /external/curl/lib/ |
| D | llist.c | 46 struct curl_llist *list; in Curl_llist_alloc() local
48 list = malloc(sizeof(struct curl_llist)); in Curl_llist_alloc()
49 if(!list) in Curl_llist_alloc()
52 llist_init(list, dtor); in Curl_llist_alloc()
54 return list; in Curl_llist_alloc()
69 Curl_llist_insert_next(struct curl_llist *list, struct curl_llist_element *e, in Curl_llist_insert_next() argument
77 if(list->size == 0) { in Curl_llist_insert_next()
78 list->head = ne; in Curl_llist_insert_next()
79 list->head->prev = NULL; in Curl_llist_insert_next()
80 list->head->next = NULL; in Curl_llist_insert_next()
[all …]
|
| /external/freetype/src/cache/ |
| D | ftcmru.c | 169 FTC_MruList_Init( FTC_MruList list, in FTC_MruList_Init() argument
175 list->num_nodes = 0; in FTC_MruList_Init()
176 list->max_nodes = max_nodes; in FTC_MruList_Init()
177 list->nodes = NULL; in FTC_MruList_Init()
178 list->clazz = *clazz; in FTC_MruList_Init()
179 list->data = data; in FTC_MruList_Init()
180 list->memory = memory; in FTC_MruList_Init()
185 FTC_MruList_Reset( FTC_MruList list ) in FTC_MruList_Reset() argument
187 while ( list->nodes ) in FTC_MruList_Reset()
188 FTC_MruList_Remove( list, list->nodes ); in FTC_MruList_Reset()
[all …]
|
| /external/llvm/test/Feature/ |
| D | recursivetype.ll | 6 ; typedef struct list {
7 ; struct list *Next;
9 ; } list;
12 ; void InsertIntoListTail(list **L, int Data) {
15 ; *L = (list*)malloc(sizeof(list));
20 ; // Recursive list search fn
21 ; list *FindData(list *L, int Data) {
28 ; list *MyList = 0;
40 %list = type { %list*, i32 }
44 define void @InsertIntoListTail(%list** %L, i32 %Data) {
[all …]
|
| /external/dbus/dbus/ |
| D | dbus-list.c | 39 _DBUS_DEFINE_GLOBAL_LOCK (list);
59 _DBUS_LOCK (list); in alloc_link()
67 _DBUS_UNLOCK (list); in alloc_link()
76 _DBUS_UNLOCK (list); in alloc_link()
88 _DBUS_UNLOCK (list); in alloc_link()
96 _DBUS_LOCK (list); in free_link()
103 _DBUS_UNLOCK (list); in free_link()
107 link_before (DBusList **list, in link_before() argument
111 if (*list == NULL) in link_before()
115 *list = link; in link_before()
[all …]
|
| D | dbus-list.h | 40 dbus_bool_t _dbus_list_append (DBusList **list,
42 dbus_bool_t _dbus_list_prepend (DBusList **list,
44 dbus_bool_t _dbus_list_insert_before (DBusList **list,
47 dbus_bool_t _dbus_list_insert_after (DBusList **list,
50 void _dbus_list_insert_before_link (DBusList **list,
53 void _dbus_list_insert_after_link (DBusList **list,
56 dbus_bool_t _dbus_list_remove (DBusList **list,
58 dbus_bool_t _dbus_list_remove_last (DBusList **list,
60 void _dbus_list_remove_link (DBusList **list,
62 DBusList* _dbus_list_find_last (DBusList **list,
[all …]
|
| /external/selinux/libsepol/cil/src/ |
| D | cil_list.c | 47 void cil_list_init(struct cil_list **list, enum cil_flavor flavor) in cil_list_init() argument
53 *list = new_list; in cil_list_init()
56 void cil_list_destroy(struct cil_list **list, unsigned destroy_data) in cil_list_destroy() argument
58 if (*list == NULL) { in cil_list_destroy()
62 struct cil_list_item *item = (*list)->head; in cil_list_destroy()
75 free(*list); in cil_list_destroy()
76 *list = NULL; in cil_list_destroy()
98 void cil_list_append(struct cil_list *list, enum cil_flavor flavor, void *data) in cil_list_append() argument
102 if (list == NULL) { in cil_list_append()
110 if (list->tail == NULL) { in cil_list_append()
[all …]
|
| /external/libdrm/ |
| D | xf86drmSL.c | 102 SkipListPtr list; in drmSLCreate() local
105 list = drmMalloc(sizeof(*list)); in drmSLCreate()
106 if (!list) return NULL; in drmSLCreate()
107 list->magic = SL_LIST_MAGIC; in drmSLCreate()
108 list->level = 0; in drmSLCreate()
109 list->head = SLCreateEntry(SL_MAX_LEVEL, 0, NULL); in drmSLCreate()
110 list->count = 0; in drmSLCreate()
112 for (i = 0; i <= SL_MAX_LEVEL; i++) list->head->forward[i] = NULL; in drmSLCreate()
114 return list; in drmSLCreate()
119 SkipListPtr list = (SkipListPtr)l; in drmSLDestroy() local
[all …]
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| D | u_simple_list.h | 59 #define insert_at_head(list, elem) \ argument
61 (elem)->prev = list; \
62 (elem)->next = (list)->next; \
63 (list)->next->prev = elem; \
64 (list)->next = elem; \
73 #define insert_at_tail(list, elem) \ argument
75 (elem)->next = list; \
76 (elem)->prev = (list)->prev; \
77 (list)->prev->next = elem; \
78 (list)->prev = elem; \
[all …]
|
| D | u_caps.c | 40 util_check_caps_out(struct pipe_screen *screen, const unsigned *list, int *out) in util_check_caps_out() argument
45 for (i = 0; list[i];) { in util_check_caps_out()
46 switch(list[i++]) { in util_check_caps_out()
48 if (!screen->get_param(screen, list[i++])) { in util_check_caps_out()
54 tmpi = screen->get_param(screen, list[i++]); in util_check_caps_out()
55 if (tmpi < (int)list[i++]) { in util_check_caps_out()
61 tmpf = screen->get_paramf(screen, list[i++]); in util_check_caps_out()
62 if (tmpf < (float)list[i++]) { in util_check_caps_out()
69 list[i++], in util_check_caps_out()
78 tmpi = screen->get_shader_param(screen, list[i] >> 24, list[i] & ((1 << 24) - 1)); in util_check_caps_out()
[all …]
|
| /external/mesa3d/src/mesa/main/ |
| D | simple_list.h | 66 #define insert_at_head(list, elem) \ argument
68 (elem)->prev = list; \
69 (elem)->next = (list)->next; \
70 (list)->next->prev = elem; \
71 (list)->next = elem; \
80 #define insert_at_tail(list, elem) \ argument
82 (elem)->next = list; \
83 (elem)->prev = (list)->prev; \
84 (list)->prev->next = elem; \
85 (list)->prev = elem; \
[all …]
|
| /external/webrtc/webrtc/base/ |
| D | network_unittest.cc | 56 const NetworkManager::NetworkList& list, in MergeNetworkList() argument
59 network_manager.MergeNetworkList(list, changed, &stats); in MergeNetworkList()
70 NetworkManager::NetworkList list; in GetNetworks() local
71 network_manager.CreateNetworks(include_ignored, &list); in GetNetworks()
72 return list; in GetNetworks()
112 struct ifaddrs* AddIpv6Address(struct ifaddrs* list, in AddIpv6Address() argument
124 if_addr->ifa_next = list; in AddIpv6Address()
129 void ReleaseIfAddrs(struct ifaddrs* list) { in ReleaseIfAddrs() argument
130 struct ifaddrs* if_addr = list; in ReleaseIfAddrs()
269 NetworkManager::NetworkList list; in TEST_F() local
[all …]
|
| /external/protobuf/java/src/test/java/com/google/protobuf/ |
| D | LazyStringArrayListTest.java | 54 LazyStringArrayList list = new LazyStringArrayList(); in testJustStrings() local
55 list.add(STRING_A); in testJustStrings()
56 list.add(STRING_B); in testJustStrings()
57 list.add(STRING_C); in testJustStrings()
59 assertEquals(3, list.size()); in testJustStrings()
60 assertSame(STRING_A, list.get(0)); in testJustStrings()
61 assertSame(STRING_B, list.get(1)); in testJustStrings()
62 assertSame(STRING_C, list.get(2)); in testJustStrings()
64 list.set(1, STRING_C); in testJustStrings()
65 assertSame(STRING_C, list.get(1)); in testJustStrings()
[all …]
|
| /external/wpa_supplicant_8/src/utils/ |
| D | list.h | 22 static inline void dl_list_init(struct dl_list *list) in dl_list_init() argument
24 list->next = list; in dl_list_init()
25 list->prev = list; in dl_list_init()
28 static inline void dl_list_add(struct dl_list *list, struct dl_list *item) in dl_list_add() argument
30 item->next = list->next; in dl_list_add()
31 item->prev = list; in dl_list_add()
32 list->next->prev = item; in dl_list_add()
33 list->next = item; in dl_list_add()
36 static inline void dl_list_add_tail(struct dl_list *list, struct dl_list *item) in dl_list_add_tail() argument
38 dl_list_add(list->prev, item); in dl_list_add_tail()
[all …]
|
| /external/icu/icu4c/source/common/ |
| D | ulist.c | 33 static void ulist_addFirstItem(UList *list, UListNode *newItem);
61 static void ulist_addFirstItem(UList *list, UListNode *newItem) { in ulist_addFirstItem() argument
64 list->head = newItem; in ulist_addFirstItem()
65 list->tail = newItem; in ulist_addFirstItem()
66 list->currentIndex = 0; in ulist_addFirstItem()
69 U_CAPI void U_EXPORT2 ulist_addItemEndList(UList *list, const void *data, UBool forceDelete, UError… in ulist_addItemEndList() argument
72 if (U_FAILURE(*status) || list == NULL || data == NULL) { in ulist_addItemEndList()
84 if (list->size == 0) { in ulist_addItemEndList()
85 ulist_addFirstItem(list, newItem); in ulist_addItemEndList()
88 newItem->previous = list->tail; in ulist_addItemEndList()
[all …]
|
| /external/skia/src/core/ |
| D | SkTMultiMap.h | 39 ValueList* list = fHash.find(key); in insert() local
40 if (list) { in insert()
43 ValueList* newEntry = new ValueList(list->fValue); in insert()
44 newEntry->fNext = list->fNext; in insert()
47 list->fNext = newEntry; in insert()
48 list->fValue = value; in insert()
57 ValueList* list = fHash.find(key); in remove() local
60 SkASSERT(list); in remove()
62 while (list->fValue != value) { in remove()
63 prev = list; in remove()
[all …]
|