| /external/curl/lib/ |
| llist.c | 48 * Inserts a new list element after the given one 'e'. If the given existing
49 * entry is NULL and the list already has elements, the new one will be
50 * inserted first in the list.
57 Curl_llist_insert_next(struct curl_llist *list, struct curl_llist_element *e,
62 if(list->size == 0) {
63 list->head = ne;
64 list->head->prev = NULL;
65 list->head->next = NULL;
66 list->tail = ne;
69 /* if 'e' is NULL here, we insert the new element first in the list */
[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...] |
| /packages/apps/CellBroadcastReceiver/tests/unit/src/com/android/cellbroadcastreceiver/ |
| CellBroadcastChannelManagerTest.java | 62 ArrayList<CellBroadcastChannelRange> list = CellBroadcastChannelManager.getInstance() local
65 assertEquals(12, list.get(0).mStartId);
66 assertEquals(12, list.get(0).mEndId);
67 assertEquals(AlertType.ETWS_EARTHQUAKE, list.get(0).mAlertType);
68 assertEquals(CellBroadcastChannelRange.LEVEL_EMERGENCY, list.get(0).mEmergencyLevel);
70 assertEquals(456, list.get(1).mStartId);
71 assertEquals(456, list.get(1).mEndId);
72 assertEquals(AlertType.ETWS_TSUNAMI, list.get(1).mAlertType);
73 assertEquals(CellBroadcastChannelRange.LEVEL_EMERGENCY, list.get(1).mEmergencyLevel);
75 assertEquals(0xAC00, list.get(2).mStartId)
[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...] |
| /hardware/qcom/gps/msm8909w_3100/core/data-items/common/ |
| ClientIndex.h | 7 * notice, this list of conditions and the following disclaimer.
9 * copyright notice, this list of conditions and the following
32 #include <list>
53 void getSubscribedList (CT client, std :: list <DIT> & out);
57 void remove (const std :: list <DIT> & r, std :: list <CT> & out);
59 void remove (CT client, const std :: list <DIT> & r, std :: list <DIT> & out);
61 void add (CT client, const std :: list <DIT> & l, std :: list <DIT> & out)
[all...] |
| /dalvik/dx/src/com/android/dx/rop/cst/ |
| CstArray.java | 25 /** {@code non-null;} the actual list of contents */
26 private final List list; field in class:CstArray
31 * @param list {@code non-null;} the actual list of contents
33 public CstArray(List list) {
34 if (list == null) {
35 throw new NullPointerException("list == null");
38 list.throwIfMutable()
[all...] |
| /external/freetype/src/cache/ |
| ftcmru.c | 169 FTC_MruList_Init( FTC_MruList list,
175 list->num_nodes = 0;
176 list->max_nodes = max_nodes;
177 list->nodes = NULL;
178 list->clazz = *clazz;
179 list->data = data;
180 list->memory = memory;
185 FTC_MruList_Reset( FTC_MruList list )
187 while ( list->nodes )
188 FTC_MruList_Remove( list, list->nodes )
[all...] |
| /external/libdrm/ |
| xf86drmSL.c | 1 /* xf86drmSL.c -- Skip list support
30 * This file contains a straightforward skip list implementation.n
102 SkipListPtr list; local
105 list = drmMalloc(sizeof(*list));
106 if (!list) return NULL;
107 list->magic = SL_LIST_MAGIC;
108 list->level = 0;
109 list->head = SLCreateEntry(SL_MAX_LEVEL, 0, NULL);
110 list->count = 0
119 SkipListPtr list = (SkipListPtr)l; local
139 SkipListPtr list = (SkipListPtr)l; local
156 SkipListPtr list = (SkipListPtr)l; local
189 SkipListPtr list = (SkipListPtr)l; local
216 SkipListPtr list = (SkipListPtr)l; local
234 SkipListPtr list = (SkipListPtr)l; local
258 SkipListPtr list = (SkipListPtr)l; local
277 SkipListPtr list = (SkipListPtr)l; local
288 SkipListPtr list = (SkipListPtr)l; local
[all...] |
| /external/ltp/tools/pounder21/src/time_tests/ |
| inconsistency-check.c | 46 struct timespec list[CALLS_PER_LOOP]; local
56 if (clock_gettime(clock_type, &list[0])) {
61 clock_gettime(clock_type, &list[0]);
62 now = then = list[0].tv_sec;
69 /* Fill list */
71 clock_gettime(clock_type, &list[i]);
75 if (!in_order(list[i], list[i + 1]))
84 printf("%lu:%lu\n", list[i].tv_sec,
85 list[i].tv_nsec)
[all...] |
| /external/mockito/src/test/java/org/mockitousage/verification/ |
| VerificationOnMultipleMocksUsingMatchersTest.java | 13 import java.util.List;
24 List<Object> list = Mockito.mock(List.class); local
27 list.add("test");
28 list.add(1, "test two");
33 verify(list).add(anyObject());
34 verify(list).add(anyInt(), eq("test two"));
39 verifyNoMoreInteractions(list, map);
44 List<String> list = mock(List.class) local
[all...] |
| /frameworks/base/core/java/android/hardware/camera2/utils/ |
| ListUtils.java | 19 import java.util.List;
22 * Various assortment of list utilities.
24 * <p>Using a {@code null} list is supported and will almost always return the default value
29 /** Return {@code} true if the {@code list} contains the {@code needle}. */
30 public static <T> boolean listContains(List<T> list, T needle) {
31 if (list == null) {
34 return list.contains(needle);
39 * Return {@code true} if the {@code list} is only a single element equal to
42 public static <T> boolean listElementsEqualTo(List<T> list, T single)
[all...] |
| /libcore/luni/src/test/java/libcore/java/util/ |
| ArraysTest.java | 28 int[] list = new int[3]; local
29 list[0] = 0;
30 list[1] = 1;
31 list[2] = 2;
33 Arrays.setAll(list, x -> x + 1);
34 assertEquals(1, list[0]);
35 assertEquals(2, list[1]);
36 assertEquals(3, list[2]);
39 Arrays.setAll(list, null);
55 int[] list = new int[3] local
82 long[] list = new long[3]; local
109 long[] list = new long[3]; local
136 double[] list = new double[3]; local
163 double[] list = new double[3]; local
246 int[] list = new int[1000]; local
280 int[] list = new int[1000]; local
321 long[] list = new long[1000]; local
355 long[] list = new long[1000]; local
396 double[] list = new double[1000]; local
434 double[] list = new double[1000]; local
[all...] |
| /external/hamcrest/hamcrest-library/src/test/java/org/hamcrest/collection/ |
| IsCollectionWithSizeTest.java | 9 import java.util.List;
28 Collection<Object> list = asList(null, null); local
29 assertMatches("correct size", hasSize(equalTo(2)), list);
30 assertMismatchDescription("collection size was <2>", hasSize(equalTo(3)), list);
34 Collection<String> list = asList("a", "b"); local
35 assertMatches("correct size", hasSize(equalTo(2)), list);
36 assertMismatchDescription("collection size was <2>", hasSize(equalTo(3)), list);
40 Collection<?> list = asList("a", "b"); local
41 assertMatches("correct size", hasSize(equalTo(2)), list);
42 assertMismatchDescription("collection size was <2>", hasSize(equalTo(3)), list);
46 List<Object> list = asList(null, null); local
52 List<String> list = asList("a", "b"); local
58 List<?> list = asList("a", "b"); local
[all...] |
| /external/syslinux/core/thread/ |
| semaphore.c | 7 sem->list.next = sem->list.prev = &sem->list;
43 /* Add to the end of the wakeup list */
44 block.list.prev = sem->list.prev;
45 block.list.next = &sem->list;
46 sem->list.prev = &block.list;
[all...] |
| /external/kmod/libkmod/ |
| libkmod-list.c | 26 * SECTION:libkmod-list
27 * @short_description: general purpose list
38 static inline void list_node_append(struct list_node *list,
41 if (list == NULL) {
46 node->prev = list->prev;
47 list->prev->next = node;
48 list->prev = node;
49 node->next = list;
63 static inline void list_node_insert_after(struct list_node *list,
66 if (list == NULL)
[all...] |
| /external/syslinux/com32/lib/syslinux/ |
| zonelist.c | 33 * hold memory maps. A zonelist is a sorted linked list of memory
45 * Create an empty syslinux_memmap list.
73 * Add an item to a syslinux_memmap list, potentially overwriting
76 int syslinux_add_memmap(struct syslinux_memmap **list,
86 syslinux_dump_memmap(*list);
95 mpp = list;
152 syslinux_dump_memmap(*list);
162 enum syslinux_memmap_types syslinux_memmap_type(struct syslinux_memmap *list,
169 while (list->type != SMT_END) {
170 llast = list->next->start - 1
[all...] |
| /hardware/qcom/gps/msm8909w_3100/core/observer/ |
| IOsObserver.h | 7 * notice, this list of conditions and the following disclaimer.
9 * copyright notice, this list of conditions and the following
33 #include <list>
65 inline virtual void notify (const std::list <IDataItemCore *> & /*dlist*/) {}
70 const std :: list <DataItemId> & /*l*/,
75 const std :: list <DataItemId> & /*l*/,
80 const std :: list <DataItemId> & /*l*/,
85 const std :: list <DataItemId> & /*l*/,
|
| /external/v8/tools/clang/value_cleanup/tests/ |
| list-value-append-expected.cc | 27 base::ListValue list; local
28 list.AppendBoolean(1 == 0);
29 list.AppendBoolean(true);
30 list.AppendInteger(static_cast<unsigned char>(1.0));
31 list.AppendDouble(double{3});
32 list.AppendString("abc");
34 list.Append(ReturnsUniquePtr());
36 list.Append(thing.ToValue());
38 list.Append(std::move(unique_ptr_var));
42 base::ListValue list; local
[all...] |
| list-value-append-original.cc | 27 base::ListValue list; local
28 list.Append(new base::FundamentalValue(1 == 0));
29 list.Append(new base::FundamentalValue(true));
30 list.Append(new base::FundamentalValue(static_cast<unsigned char>(1.0)));
31 list.Append(new base::FundamentalValue(double{3}));
32 list.Append(new base::StringValue("abc"));
34 list.Append(ReturnsUniquePtr().release());
36 list.Append(thing.ToValue().release());
38 list.Append(unique_ptr_var.release());
42 base::ListValue list; local
[all...] |
| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| ListsTest.java | 36 import java.util.List;
72 private static final List<Integer> SOME_LIST
75 private static final List<Integer> SOME_SEQUENTIAL_LIST
78 private static final List<String> SOME_STRING_LIST
95 List<Character> chars = Lists.charactersOf(builder);
106 ArrayList<Integer> list = Lists.newArrayList(); local
107 assertEquals(Collections.emptyList(), list); local
111 ArrayList<Integer> list = Lists.newArrayListWithCapacity(0); local
112 assertEquals(Collections.emptyList(), list); local
127 ArrayList<Integer> list = Lists.newArrayListWithExpectedSize(0) local
128 assertEquals(Collections.emptyList(), list); local
143 ArrayList<Integer> list = Lists.newArrayList(0, 1, 1); local
157 ArrayList<Integer> list = Lists.newArrayList(SOME_COLLECTION); local
162 ArrayList<Integer> list = Lists.newArrayList(SOME_ITERABLE); local
167 ArrayList<Integer> list = Lists.newArrayList(SOME_COLLECTION.iterator()); local
172 LinkedList<Integer> list = Lists.newLinkedList(); local
173 assertEquals(Collections.emptyList(), list); local
177 LinkedList<Integer> list = Lists.newLinkedList(SOME_COLLECTION); local
182 LinkedList<Integer> list = Lists.newLinkedList(SOME_ITERABLE); local
227 List<String> list = Lists.asList("foo", new String[0]); local
244 List<String> list = Lists.asList("foo", "bar", new String[] { "baz" }); local
305 private static <E> List<E> list(E... elements) { method in class:ListsTest
359 List<String> list = Collections.nCopies(10000, "foo"); local
367 List<String> list = Lists.transform(SOME_LIST, SOME_FUNCTION); local
372 List<String> list = Lists.transform(SOME_SEQUENTIAL_LIST, SOME_FUNCTION); local
378 List<String> list = Lists.transform(fromList, SOME_FUNCTION); local
384 List<String> list = Lists.transform(fromList, SOME_FUNCTION); local
402 assertEquals(Collections.emptyList(), list); local
439 List<String> list = Lists.transform(SOME_LIST, SOME_FUNCTION); local
444 List<String> list = Lists.transform(SOME_SEQUENTIAL_LIST, SOME_FUNCTION); local
450 List<String> list = Lists.transform(fromList, SOME_FUNCTION); local
456 List<String> list = Lists.transform(fromList, SOME_FUNCTION); local
516 List<String> list = Lists.transform(fromList, SOME_FUNCTION); local
522 List<String> list = Lists.transform(fromList, SOME_FUNCTION); local
609 List<Integer> list = asList(1, 2, 3); local
633 List<Integer> list = asList(1, 2, 3); local
[all...] |
| /external/icu/icu4c/source/common/ |
| ulist.cpp | 34 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) {
64 list->head = newItem;
65 list->tail = newItem;
68 static void ulist_removeItem(UList *list, UListNode *p) {
70 // p is the list head.
71 list->head = p->next;
76 // p is the list tail.
77 list->tail = p->previous
[all...] |
| /external/libchrome/base/trace_event/ |
| memory_infra_background_whitelist.h | 24 // The whitelist is replaced with the given list for tests. The last element of
25 // the list must be nullptr.
26 void BASE_EXPORT SetDumpProviderWhitelistForTesting(const char* const* list);
28 SetAllocatorDumpNameWhitelistForTesting(const char* const* list);
|
| /external/libcxx/test/std/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.insert.iter.cons/ |
| container.pass.cpp | 17 #include <list>
29 test(std::list<int>());
|
| /external/smali/util/src/main/java/org/jf/util/ |
| LinearSearch.java | 10 * notice, this list of conditions and the following disclaimer.
12 * copyright notice, this list of conditions and the following disclaimer
35 import java.util.List;
39 * Performs a linear search in a sorted list for key, starting at initialGuess
41 * @param list The sorted list to search
48 public static <T> int linearSearch(List<? extends T> list, Comparator<T> comparator, T key, int initialGuess) {
50 if (guess >= list.size()) {
51 guess = list.size()-1
[all...] |
