| /external/trusty/lk/include/shared/lk/ |
| D | list.h | 39 #define LIST_INITIAL_VALUE(list) { &(list), &(list) } argument
42 static inline void list_initialize(struct list_node *list) in list_initialize() argument
44 list->prev = list->next = list; in list_initialize()
49 item->prev = item->next = 0; in list_clear_node()
54 if (item->prev == 0 && item->next == 0) in list_in_list()
60 static inline void list_add_head(struct list_node *list, struct list_node *item) in list_add_head() argument
62 item->next = list->next; in list_add_head()
63 item->prev = list; in list_add_head()
64 list->next->prev = item; in list_add_head()
65 list->next = item; in list_add_head()
[all …]
|
| /external/wmediumd/wmediumd/ |
| D | list.h | 1 /* SPDX-License-Identifier: GPL-2.0 */
15 #define container_of(ptr, type, member) ((type *)(void*)( (char*)ptr - offsetof(type, member)))
19 * Simple doubly linked list implementation.
25 * using the generic single-entry routines.
38 * INIT_LIST_HEAD - Initialize a list_head structure
39 * @list: list_head structure to be initialized.
41 * Initializes the list_head to point to itself. If it is a list header,
42 * the result is an empty list.
44 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
46 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD()
[all …]
|
| /external/llvm/unittests/ADT/ |
| D | ilistTest.cpp | 1 //===- llvm/unittest/ADT/APInt.cpp - APInt unit tests ---------------------===//
8 //===----------------------------------------------------------------------===//
26 ~Node() { Value = -1; } in ~Node()
30 ilist<Node> List; in TEST() local
31 List.push_back(Node(1)); in TEST()
32 EXPECT_EQ(1, List.back().Value); in TEST()
33 EXPECT_EQ(nullptr, List.getPrevNode(List.back())); in TEST()
34 EXPECT_EQ(nullptr, List.getNextNode(List.back())); in TEST()
36 List.push_back(Node(2)); in TEST()
37 EXPECT_EQ(2, List.back().Value); in TEST()
[all …]
|
| /external/kmod/libkmod/ |
| D | libkmod-list.c | 2 * libkmod - interface to kernel module operations
4 * Copyright (C) 2011-2013 ProFUSION embedded systems
23 #include "libkmod-internal.h"
26 * SECTION:libkmod-list
27 * @short_description: general purpose list
32 node->next = node; in list_node_init()
33 node->prev = node; in list_node_init()
38 static inline void list_node_append(struct list_node *list, in list_node_append() argument
41 if (list == NULL) { in list_node_append()
46 node->prev = list->prev; in list_node_append()
[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()
135 next = node->next; in x86_op_list_free()
136 /* free( node->insn ); */ 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()
[all …]
|
| /external/mesa3d/src/gallium/frontends/nine/ |
| D | nine_shader.h | 17 * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
41 struct nine_range *ranges; /* single MALLOC, but next-pointers valid */
58 uint16_t input_map[PIPE_MAX_ATTRIBS]; /* VS input -> NINE_DECLUSAGE_x */
61 bool position_t; /* out, true if VP writes pre-transformed position */
140 nine_shader_variant_get(struct nine_shader_variant *list, in nine_shader_variant_get() argument
145 while (list->key != key && list->next) in nine_shader_variant_get()
146 list = list->next; in nine_shader_variant_get()
147 if (list->key == key) { in nine_shader_variant_get()
148 *const_ranges = list->const_ranges; in nine_shader_variant_get()
149 *const_used_size = list->const_used_size; in nine_shader_variant_get()
[all …]
|
| /external/fmtlib/doc/bootstrap/ |
| D | list-group.less | 2 // List groups
3 // --------------------------------------------------
10 .list-group {
11 // No need to set list-style: none; since .list-group-item is block level
12 margin-bottom: 20px;
13 padding-left: 0; // reset padding because ul and ol
17 // Individual list items
19 // Use on `li`s or `div`s within the `.list-group` parent.
21 .list-group-item {
25 // Place the border on the list items and negative margin up for better styling
[all …]
|
| /external/freetype/src/cache/ |
| D | ftcmru.c | 7 * Copyright (C) 2003-2023 by
36 FTC_MruNode last = first->prev; in FTC_MruNode_Prepend()
51 cnode = cnode->next; in FTC_MruNode_Prepend()
57 first->prev = node; in FTC_MruNode_Prepend()
58 last->next = node; in FTC_MruNode_Prepend()
59 node->next = first; in FTC_MruNode_Prepend()
60 node->prev = last; in FTC_MruNode_Prepend()
64 node->next = node; in FTC_MruNode_Prepend()
65 node->prev = node; in FTC_MruNode_Prepend()
92 cnode = cnode->next; in FTC_MruNode_Up()
[all …]
|
| /external/selinux/libsepol/cil/src/ |
| D | cil_list.c | 8 * this list of conditions and the following disclaimer.
11 * this list of conditions and the following disclaimer in the documentation
47 void cil_list_init(struct cil_list **list, enum cil_flavor flavor) in cil_list_init() argument
50 new_list->head = NULL; in cil_list_init()
51 new_list->tail = NULL; in cil_list_init()
52 new_list->flavor = flavor; in cil_list_init()
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
60 if (*list == NULL) { in cil_list_destroy()
64 item = (*list)->head; in cil_list_destroy()
[all …]
|
| /external/libxkbcommon/src/ |
| D | util-list.c | 2 * Copyright © 2008-2011 Kristian Høgsberg
4 * Copyright © 2013-2015 Red Hat, Inc.
32 #include "util-list.h"
35 list_init(struct list *list) in list_init() argument
37 list->prev = list; in list_init()
38 list->next = list; in list_init()
42 list_insert(struct list *list, struct list *elm) in list_insert() argument
44 assert((list->next != NULL && list->prev != NULL) || in list_insert()
45 !"list->next|prev is NULL, possibly missing list_init()"); in list_insert()
46 assert(((elm->next == NULL && elm->prev == NULL) || list_empty(elm)) || in list_insert()
[all …]
|
| /external/skia/src/core/ |
| D | SkTMultiMap.h | 4 * Use of this source code is governed by a BSD-style license that can be
32 this->reset(); in ~SkTMultiMap()
39 HashTraits::OnFree(it->fValue); in reset()
40 next = it->fNext; in reset()
49 ValueList* list = fHash.find(key); in insert() local
50 if (list) { in insert()
52 // linked list, and it will contain the value of the first element. in insert()
53 ValueList* newEntry = new ValueList(list->fValue); in insert()
54 newEntry->fNext = list->fNext; in insert()
57 list->fNext = newEntry; in insert()
[all …]
|
| /external/threetenbp/src/test/java/org/threeten/bp/ |
| D | Performance.java | 2 * Copyright (c) 2007-present, Stephen Colebourne & Michael Nascimento Santos
10 * this list of conditions and the following disclaimer.
13 * this list of conditions and the following disclaimer in the documentation
16 * * Neither the name of JSR-310 nor the names of its contributors
51 import java.util.List;
82 System.out.println("-------------------------------------"); in main()
96 max = max.substring(max.length() - 12); in main()
98 min = min.substring(min.length() - 12); in main()
99 System.out.println(name + "\t" + max + "\t" + min + "\t-" + percent + "%"); in main()
106 List<LocalDateTime> ldt = setupDateTime(); in process()
[all …]
|
| /external/exfatprogs/include/ |
| D | list.h | 1 /* SPDX-License-Identifier: GPL-2.0-or-later */
7 #define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)
11 const typeof(((type *)0)->member) * __mptr = (ptr); \
12 (type *)((char *)__mptr - offsetof(type, member)); \
16 * These are non-NULL pointers that will result in page faults
18 * non-initialized list entries.
24 * Simple doubly linked list implementation.
30 * using the generic single-entry routines.
42 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
48 * This is only for internal list manipulation where we know
[all …]
|
| /external/iptables/libiptc/ |
| D | linux_list.h | 5 #define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)
8 * container_of - cast a member of a structure out to the containing structure
16 const typeof( ((type *)0)->member ) *__mptr = (ptr); \
17 (type *)( (char *)__mptr - offsetof(type,member) );})
32 /* empty define to make this work in userspace -HW */
36 * These are non-NULL pointers that will result in page faults
38 * non-initialized list entries.
44 * Simple doubly linked list implementation.
50 * using the generic single-entry routines.
63 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
[all …]
|
| /external/libnfnetlink/include/ |
| D | linux_list.h | 7 #define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)
10 * container_of - cast a member of a structure out to the containing structure
18 typeof( ((type *)0)->member ) *__mptr = (ptr); \
19 (type *)( (char *)__mptr - offsetof(type,member) );})
34 /* empty define to make this work in userspace -HW */
40 * These are non-NULL pointers that will result in page faults
42 * non-initialized list entries.
48 * Simple doubly linked list implementation.
54 * using the generic single-entry routines.
67 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
[all …]
|
| /external/mesa3d/src/compiler/glsl/ |
| D | list.h | 25 * \file list.h
26 * \brief Doubly-linked list abstract container type.
28 * Each doubly-linked list has a sentinel head and tail node. These nodes
33 * A list is empty if either the head sentinel's \c next pointer points to the
36 * list structure.
38 * Do note that this means that the list nodes will contain pointers into the
39 * list structure itself and as a result you may not \c realloc() an \c
76 * This creates a sort of degenerate list that is occasionally useful.
81 * Insert a node in the list after the current node
86 * Insert another list in the list after the current node
[all …]
|
| /external/blktrace/iowatcher/ |
| D | list.h | 2 * Copyright (C) 2012 Fusion-io. All rights reserved.
18 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
31 #define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)
35 const typeof( ((type *)0)->member ) *__mptr = (ptr); \
36 (type *)( (char *)__mptr - offsetof(type,member) );})
39 * Simple doubly linked list implementation.
45 * using the generic single-entry routines.
57 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
59 list->next = list; in INIT_LIST_HEAD()
60 list->prev = list; in INIT_LIST_HEAD()
[all …]
|
| /external/python/cpython3/Doc/c-api/ |
| D | list.rst | 5 List Objects
6 ------------
8 .. index:: pair: object; list
13 This subtype of :c:type:`PyObject` represents a Python list object.
18 This instance of :c:type:`PyTypeObject` represents the Python list type.
19 This is the same object as :class:`list` in the Python layer.
24 Return true if *p* is a list object or an instance of a subtype of the list
30 Return true if *p* is a list object, but not an instance of a subtype of
31 the list type. This function always succeeds.
36 Return a new list of length *len* on success, or ``NULL`` on failure.
[all …]
|
| /external/toybox/lib/ |
| D | llist.c | 1 /* llist.c - Linked list functions
3 * Linked list structures have a next pointer as their first element.
14 free(d->arg); in llist_free_arg()
22 free(d->data); in llist_free_double()
26 // Call a function (such as free()) on each element of a linked list.
27 void llist_traverse(void *list, void (*using)(void *node)) in llist_traverse() argument
29 void *old = list; in llist_traverse()
31 while (list) { in llist_traverse()
32 void *pop = llist_pop(&list); in llist_traverse()
35 // End doubly linked list too. in llist_traverse()
[all …]
|
| /external/e2fsprogs/tests/f_badorphan/ |
| D | expect.1 | 8 Inodes that were part of a corrupted orphan linked list found. Fix? yes
10 Inode 13 was part of the orphaned inode list. FIXED.
11 Inode 17 was part of the orphaned inode list. FIXED.
14 Inode 19 was part of the orphaned inode list. FIXED.
15 Inode 22 was part of the orphaned inode list. FIXED.
16 Inode 23 was part of the orphaned inode list. FIXED.
17 Inode 24 was part of the orphaned inode list. FIXED.
18 Inode 25 was part of the orphaned inode list. FIXED.
19 Inode 26 was part of the orphaned inode list. FIXED.
20 Inode 27 was part of the orphaned inode list. FIXED.
[all …]
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
| D | ListSubListTester.java | 8 * http://www.apache.org/licenses/LICENSE-2.0
38 import java.util.List;
43 * A generic JUnit test which tests {@code subList()} operations on a list. Can't be invoked
54 getList().subList(-1, 0); in testSubList_startNegative()
55 fail("subList(-1, 0) should throw"); in testSubList_startNegative()
89 "subList(0, size) should be equal to the original list", in testSubList_entireList()
97 List<E> subList = getList().subList(0, 1); in testSubList_subListRemoveAffectsOriginal()
99 List<E> expected = Arrays.asList(createSamplesArray()).subList(1, getNumElements()); in testSubList_subListRemoveAffectsOriginal()
106 List<E> subList = getList().subList(0, 1); in testSubList_subListClearAffectsOriginal()
108 List<E> expected = Arrays.asList(createSamplesArray()).subList(1, getNumElements()); in testSubList_subListClearAffectsOriginal()
[all …]
|
| /external/guava/android/guava-testlib/src/com/google/common/collect/testing/testers/ |
| D | ListSubListTester.java | 8 * http://www.apache.org/licenses/LICENSE-2.0
38 import java.util.List;
43 * A generic JUnit test which tests {@code subList()} operations on a list. Can't be invoked
54 getList().subList(-1, 0); in testSubList_startNegative()
55 fail("subList(-1, 0) should throw"); in testSubList_startNegative()
89 "subList(0, size) should be equal to the original list", in testSubList_entireList()
97 List<E> subList = getList().subList(0, 1); in testSubList_subListRemoveAffectsOriginal()
99 List<E> expected = Arrays.asList(createSamplesArray()).subList(1, getNumElements()); in testSubList_subListRemoveAffectsOriginal()
106 List<E> subList = getList().subList(0, 1); in testSubList_subListClearAffectsOriginal()
108 List<E> expected = Arrays.asList(createSamplesArray()).subList(1, getNumElements()); in testSubList_subListClearAffectsOriginal()
[all …]
|
| /external/ltp/testcases/realtime/include/ |
| D | list.h | 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 * list.h
23 * This code was kindly borrowed from linux/include/linux/list.h
26 * access the container of the list from the list_head struct.
35 * 2006-Oct-17: Initial version by Darren Hart
43 * These are non-NULL pointers that will result in page faults
45 * non-initialized list entries.
51 * Simple doubly linked list implementation.
57 * using the generic single-entry routines.
69 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
[all …]
|
| /external/wpa_supplicant_8/src/utils/ |
| D | list.h | 2 * Doubly-linked list
3 * Copyright (c) 2009-2019, Jouni Malinen <j@w1.fi>
13 * struct dl_list - Doubly-linked list
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()
[all …]
|
| /external/icu/icu4c/source/common/ |
| D | ulist.cpp | 5 * Copyright (C) 2009-2016, International Business Machines
34 static void ulist_addFirstItem(UList *list, UListNode *newItem);
49 newList->curr = nullptr; in ulist_createEmptyList()
50 newList->head = nullptr; in ulist_createEmptyList()
51 newList->tail = nullptr; in ulist_createEmptyList()
52 newList->size = 0; in ulist_createEmptyList()
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) { in ulist_addFirstItem() argument
62 newItem->next = nullptr; in ulist_addFirstItem()
63 newItem->previous = nullptr; in ulist_addFirstItem()
[all …]
|