| /external/ltp/tools/pounder21/ |
| proclist.c | 1 /* Manage a list of processes. */
25 void add_to_proclist(struct proclist_t *list, struct proclist_item_t *item)
29 if (list->head == NULL) {
31 list->head = item;
35 curr = list->head;
44 void remove_from_proclist(struct proclist_t *list, struct proclist_item_t *item)
48 if (list->head == NULL) {
52 if (list->head == item) {
53 list->head = item->next;
58 prev = list->head
[all...] |
| /external/r8/src/test/examples/throwing/ |
| RenamedClass.java | 12 import java.util.List;
19 public List list = new ArrayList(); field in class:RenamedClass
21 public List getList() {
22 if (list == null) { // always false
25 return list;
28 public void setList(List list) {
29 if (list == null) {
32 this.list = list
[all...] |
| /external/libcxx/test/std/containers/sequences/list/list.modifiers/ |
| 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)));
|
| 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/std/containers/sequences/list/list.ops/ |
| 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)));
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| 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)));
|
| 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)));
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
| 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)));
|
| 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)));
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.modifiers/ |
| 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)));
|
| 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)));
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.ops/ |
| 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/mesa3d/src/gallium/auxiliary/util/ |
| 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)
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[i++])
217 unsigned *list; member in struct:__anon27589
218 } list[] = { local
[all...] |
| /libcore/ojluni/src/main/java/sun/security/jca/ |
| Providers.java | 32 * Collection of methods to get and set provider list. Also includes
33 * special code for the provider list during JAR verification.
47 // current system-wide provider list
52 // set providerList to empty list first in case initialization somehow
129 * Start JAR verification. This sets a special provider list for
137 // return the old thread-local provider list, usually null
145 // restore old thread-local provider list
150 * Return the current ProviderList. If the thread-local list is set,
151 * it is returned. Otherwise, the system wide list is returned.
154 ProviderList list = getThreadProviderList() local
179 ProviderList list; local
[all...] |
| /dalvik/dx/junit-tests/com/android/dx/util/ |
| IntListTest.java | 24 IntList list = new IntList(sz); local
26 list.add(i * 2);
29 boolean contains = list.contains(i);
36 assertFalse(label(sz, -1), list.contains(-1));
37 assertFalse(label(sz, sz * 2), list.contains(sz * 2));
42 IntList list = new IntList(2); local
44 list.add(9);
45 list.add(12);
47 assertTrue(list.contains(9));
48 assertTrue(list.contains(12))
52 IntList list = new IntList(2); local
[all...] |
| /external/curl/lib/ |
| slist.c | 33 /* returns last node in linked list */
34 static struct curl_slist *slist_get_last(struct curl_slist *list)
39 if(!list)
43 item = list;
51 * Curl_slist_append_nodup() appends a string to the linked list. Rather than
59 struct curl_slist *Curl_slist_append_nodup(struct curl_slist *list, char *data)
73 /* if this is the first item, then new_item *is* the list */
74 if(!list)
77 last = slist_get_last(list);
79 return list;
[all...] |
| /external/dagger2/compiler/src/it/functional-tests/src/main/java/test/ |
| BoundedGenericModule.java | 23 import java.util.List;
41 ArrayList<String> list = new ArrayList<>(); local
42 list.add("arrayListOfString");
43 return list;
48 LinkedList<String> list = new LinkedList<>(); local
49 list.add("linkedListOfString");
50 return list;
55 LinkedList<CharSequence> list = new LinkedList<>(); local
56 list.add("linkedListOfCharSeq");
57 return list;
63 LinkedList<Comparable<String>> list = new LinkedList<>(); local
70 LinkedList<Integer> list = new LinkedList<>(); local
[all...] |
| /external/kmod/testsuite/ |
| test-list.c | 27 static int len(struct kmod_list *list)
31 kmod_list_foreach(l, list)
39 struct kmod_list *list = NULL, *last; local
45 list = kmod_list_append(list, v[i]);
46 assert_return(len(list) == N, EXIT_FAILURE);
48 last = kmod_list_last(list);
54 .description = "test for the last element of a list");
59 struct kmod_list *list = NULL, *l, *p; local
64 l = kmod_list_prev(list, list)
88 struct kmod_list *list = NULL, *l; local
114 struct kmod_list *list = NULL, *l; local
173 struct kmod_list *list = NULL, *l; local
207 struct kmod_list *list = NULL, *l; local
[all...] |
| /system/bt/osi/include/ |
| list.h | 33 // |data| represents the list item currently being iterated, |context| is a
38 // Returns a new, empty list. Returns NULL if not enough memory could be
39 // allocated for the list structure. The returned list must be freed with
41 // list element is removed from the list. It can be used to release resources
42 // held by the list element, e.g. memory or file descriptor. |callback| may
46 // Frees the list. This function accepts NULL as an argument, in which case it
48 void list_free(list_t* list);
50 // Returns true if |list| is empty (has no elements), false otherwise
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/ |
| ListExtensions.cs | 14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
47 public static bool add( this IList list, object value )
49 int count = list.Count;
50 list.Add( value );
51 return list.Count == count + 1;
55 public static void add<T>( this ICollection<T> list, T value )
57 list.Add( value );
61 public static void add<T>( this List<T> list, T value
[all...] |
| /frameworks/support/v7/recyclerview/tests/src/android/support/v7/widget/ |
| GapWorkerTest.java | 84 ArrayList<GapWorker.Task> list = new ArrayList<>(); local
85 list.add(new GapWorker.Task());
86 list.add(new GapWorker.Task());
87 list.add(new GapWorker.Task());
89 list.get(0).view = null;
90 list.get(1).view = new RecyclerView(getContext());
91 list.get(2).view = null;
93 Collections.sort(list, GapWorker.sTaskComparator);
95 assertNotNull(list.get(0).view);
96 assertNull(list.get(1).view)
101 ArrayList<GapWorker.Task> list = new ArrayList<>(); local
119 ArrayList<GapWorker.Task> list = new ArrayList<>(); local
142 ArrayList<GapWorker.Task> list = new ArrayList<>(); local
[all...] |
| /hardware/intel/common/libmix/mix_vbp/viddec_fw/fw/parser/ |
| viddec_pm_tags.c | 9 The current list has all the buffers which contribute to this particular workload. So we walkthrough the
10 list and throw buf done for all the buffers which were consumed. This can be deduced from total bytes we
11 in list which represents the bytes that were used for this acces unit.
21 frame_start_found: Indicates we saw the beggining of frame in current list of ES buffers(which represent current acces unit).
37 This function generates contribution tags current workload by walking through list of consumed buffers.
38 If frame is done(ignore_partial is false) we generate continue tags for the last item in list(if its not completely consumed).
45 viddec_pm_utils_list_t *list = &(cxt->list); local
47 if(list->num_items != 0)
52 while((num_items < list->num_items) && (list->data[num_items].edpos <= (uint32_t)list->total_bytes)
88 viddec_pm_utils_list_t *list = &(cxt->list); local
129 viddec_pm_utils_list_t *list = &(cxt->list); local
214 viddec_pm_utils_list_t *list = &(cxt->list); local
250 viddec_pm_utils_list_t *list = &(cxt->list); local
280 viddec_pm_utils_list_t *list; local
[all...] |
| /external/javassist/src/main/javassist/compiler/ast/ |
| ASTList.java | 21 * A linked list.
53 * Returns the car part of the list.
62 * Returns the cdr part of the list.
77 ASTList list = this; local
78 while (list != null) {
80 ASTree a = list.left;
82 list = list.right;
90 * Returns the number of the elements in this list.
96 public static int length(ASTList list) {
116 ASTList list = this; local
151 ASTList list = a; local
[all...] |
| /bionic/libc/upstream-netbsd/lib/libc/include/isc/ |
| list.h | 1 /* $NetBSD: list.h,v 1.5 2009/04/12 17:07:16 christos Exp $ */
24 #define LIST(type) struct { type *head, *tail; }
25 #define INIT_LIST(list) \
26 do { (list).head = NULL; (list).tail = NULL; } while (/*CONSTCOND*/0)
39 #define HEAD(list) ((list).head)
40 #define TAIL(list) ((list).tail)
41 #define EMPTY(list) ((list).head == NULL
[all...] |
| /external/skia/src/core/ |
| SkTMultiMap.h | 38 ValueList* list = fHash.find(key); local
39 if (list) {
41 // linked list, and it will contain the value of the first element.
42 ValueList* newEntry = new ValueList(list->fValue);
43 newEntry->fNext = list->fNext;
46 list->fNext = newEntry;
47 list->fValue = value;
56 ValueList* list = fHash.find(key); local
59 SkASSERT(list);
61 while (list->fValue != value)
83 ValueList* list = fHash.find(key); local
92 ValueList* list = fHash.find(key); local
153 ValueList* list = fHash.find(key); local
[all...] |
