Searched defs:list (Results 1 - 25 of 115) sorted by relevance

12345

/device/google/marlin/dataservices/datatop/src/
H A Ddatatop_linked_list.c8 notice, this list of conditions and the following disclaimer.
10 copyright notice, this list of conditions and the following
34 * Holds function which adds to or creates a linked list
36 * Datapoints are stored in linked list for ability to
38 * and deletion of memory for linked list nodes.
48 * @brief Adds a node to the beginning of a linked list.
51 * @param list The list that is added to.
52 * @return Updated linked list struct.
55 struct dtop_linked_list *list)
54 dtop_add_linked_list(void *data, struct dtop_linked_list *list) argument
[all...]
/device/linaro/bootloader/edk2/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/sorcerer/lib/
H A Dsorlist.c41 /* Iterate over a list of elements; returns ptr to a new element
42 * in list upon every call and NULL when no more are left.
50 * The cursor must be initialized to point to the list to iterate over.
54 slist_iterate(SList *list, SList **cursor) argument
56 slist_iterate(list, cursor)
57 SList *list, **cursor;
62 if ( list==NULL || cursor == NULL || *cursor==NULL ) return NULL;
63 if ( list== *cursor ) { *cursor = (*cursor)->next; }
70 * add an element to a list.
72 * Any non-empty list ha
78 slist_add( SList **list, void *e ) argument
109 slist_free(SList *list) argument
[all...]
/device/google/contexthub/firmware/os/inc/
H A Dlist.h27 #define list_iterate(list, cur_link, tmp_link) \
28 for ((cur_link) = (list)->next, \
30 (cur_link) != NULL && (cur_link) != (list); \
33 #define DECLARE_LIST(list) \
34 link_t list = { .prev = &list, .next = &list }
36 static inline void list_init(struct link_t *list) argument
38 list->prev = list
41 list_add_tail(struct link_t *list, struct link_t *item) argument
59 list_is_empty(struct link_t *list) argument
[all...]
/device/google/marlin/camera/QCamera2/stack/common/
H A Dcam_queue.h7 * notice, this list of conditions and the following disclaimer.
9 * copyright notice, this list of conditions and the following
37 struct cam_list list; member in struct:__anon548
50 cam_list_init(&queue->head.list);
67 cam_list_add_tail_node(&node->list, &queue->head.list);
82 head = &queue->head.list;
85 node = member_of(pos, cam_node_t, list);
86 cam_list_del_node(&node->list);
106 head = &queue->head.list;
[all...]
/device/google/marlin/camera/QCamera2/util/
H A DQCameraQueue.h7 * notice, this list of conditions and the following disclaimer.
9 * copyright notice, this list of conditions and the following
65 struct cam_list list; member in struct:qcamera::QCameraQueue::__anon1247
/device/huawei/angler/camera/QCamera2/stack/common/
H A Dcam_queue.h7 * notice, this list of conditions and the following disclaimer.
9 * copyright notice, this list of conditions and the following
33 struct cam_list list; member in struct:__anon1439
46 cam_list_init(&queue->head.list);
63 cam_list_add_tail_node(&node->list, &queue->head.list);
78 head = &queue->head.list;
81 node = member_of(pos, cam_node_t, list);
82 cam_list_del_node(&node->list);
102 head = &queue->head.list;
[all...]
/device/huawei/angler/camera/QCamera2/util/
H A DQCameraQueue.h7 * notice, this list of conditions and the following disclaimer.
9 * copyright notice, this list of conditions and the following
61 struct cam_list list; member in struct:qcamera::QCameraQueue::__anon1808
/device/lge/bullhead/camera/QCamera2/stack/common/
H A Dcam_queue.h7 * notice, this list of conditions and the following disclaimer.
9 * copyright notice, this list of conditions and the following
33 struct cam_list list; member in struct:__anon1991
46 cam_list_init(&queue->head.list);
63 cam_list_add_tail_node(&node->list, &queue->head.list);
78 head = &queue->head.list;
81 node = member_of(pos, cam_node_t, list);
82 cam_list_del_node(&node->list);
102 head = &queue->head.list;
[all...]
/device/lge/bullhead/camera/QCamera2/util/
H A DQCameraQueue.h7 * notice, this list of conditions and the following disclaimer.
9 * copyright notice, this list of conditions and the following
61 struct cam_list list; member in struct:qcamera::QCameraQueue::__anon2360
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/
H A D_weakref.c18 PyWeakReference **list = GET_WEAKREFS_LISTPTR(object); local
20 result = PyInt_FromSsize_t(_PyWeakref_GetWeakrefCount(*list));
30 "getweakrefs(object) -- return a list of all weak reference objects\n"
39 PyWeakReference **list = GET_WEAKREFS_LISTPTR(object); local
40 Py_ssize_t count = _PyWeakref_GetWeakrefCount(*list);
44 PyWeakReference *current = *list;
H A D_bisectmodule.c9 internal_bisect_right(PyObject *list, PyObject *item, Py_ssize_t lo, Py_ssize_t hi) argument
19 hi = PySequence_Size(list);
28 litem = PySequence_GetItem(list, mid);
46 PyObject *list, *item; local
53 keywords, &list, &item, &lo, &hi))
55 index = internal_bisect_right(list, item, lo, hi);
65 Return the index where to insert item x in list a, assuming a is sorted.\n\
68 a[i:] have e > x. So if x already appears in the list, i points just\n\
77 PyObject *list, *item, *result; local
84 keywords, &list,
115 internal_bisect_left(PyObject *list, PyObject *item, Py_ssize_t lo, Py_ssize_t hi) argument
152 PyObject *list, *item; local
182 PyObject *list, *item, *result; local
[all...]
H A Dxxsubtype.c19 /* spamlist -- a list subtype */
22 PyListObject list; member in struct:__anon2834
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/
H A D_weakref.c18 PyWeakReference **list = GET_WEAKREFS_LISTPTR(object); local
20 result = PyInt_FromSsize_t(_PyWeakref_GetWeakrefCount(*list));
30 "getweakrefs(object) -- return a list of all weak reference objects\n"
39 PyWeakReference **list = GET_WEAKREFS_LISTPTR(object); local
40 Py_ssize_t count = _PyWeakref_GetWeakrefCount(*list);
44 PyWeakReference *current = *list;
H A D_bisectmodule.c9 internal_bisect_right(PyObject *list, PyObject *item, Py_ssize_t lo, Py_ssize_t hi) argument
19 hi = PySequence_Size(list);
25 litem = PySequence_GetItem(list, mid);
43 PyObject *list, *item; local
50 keywords, &list, &item, &lo, &hi))
52 index = internal_bisect_right(list, item, lo, hi);
61 Return the index where to insert item x in list a, assuming a is sorted.\n\
64 a[i:] have e > x. So if x already appears in the list, i points just\n\
73 PyObject *list, *item, *result; local
80 keywords, &list,
110 internal_bisect_left(PyObject *list, PyObject *item, Py_ssize_t lo, Py_ssize_t hi) argument
144 PyObject *list, *item; local
174 PyObject *list, *item, *result; local
[all...]
/device/linaro/bootloader/edk2/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/h/
H A Dslist.cpp35 /* Iterate over a list of elements; returns ptr to a new element
36 * in list upon every call and NULL when no more are left.
44 * The cursor must be initialized to point to the list to iterate over.
58 /* add an element to end of list. */
63 require(e!=NULL, "slist_add: attempting to add NULL list element");
66 require(p!=NULL, "add: cannot alloc new list node");
72 else /* find end of list */
84 if ( head==NULL ) return; /* empty list */
93 to_ast(SList list) argument
/device/google/marlin/common/
H A Dutils.mk22 # $(call find-word-in-list,w,wlist)
23 # finds an exact match of word w in word list wlist
28 # search word w in list wl, if found match m, return stripped word w
31 define find-word-in-list
40 # $(call match-word-in-list,w,wlist)
41 # does an exact match of word w in word list wlist
48 define match-word-in-list
51 $(call match-word,$(call find-word-in-list,$(1),$(2)),$(strip $(1))), \
61 # if find-word-in-list returns not empty
70 $(if $(call match-word-in-list,
[all...]
/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/h/
H A Dslist.cpp36 /* Iterate over a list of elements; returns ptr to a new element
37 * in list upon every call and NULL when no more are left.
45 * The cursor must be initialized to point to the list to iterate over.
59 /* add an element to end of list. */
64 require(e!=NULL, "slist_add: attempting to add NULL list element");
67 require(p!=NULL, "add: cannot alloc new list node");
73 else /* find end of list */
85 if ( head==NULL ) return; /* empty list */
94 to_ast(SList list) argument
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Objects/stringlib/
H A Dsplit.h10 /* Overallocate the initial list to reduce the number of reallocs for small
28 if (PyList_Append(list, sub)) { \
41 PyList_SET_ITEM(list, count, sub); \
43 if (PyList_Append(list, sub)) { \
53 /* Always force the list to the expected size. */
54 #define FIX_PREALLOC_SIZE(list) Py_SIZE(list) = count
62 PyObject *list = PyList_New(PREALLOC_SIZE(maxcount)); local
65 if (list == NULL)
78 /* No whitespace in str_obj, so just use it as list[
111 PyObject *list = PyList_New(PREALLOC_SIZE(maxcount)); local
154 PyObject *list, *sub; local
201 PyObject *list = PyList_New(PREALLOC_SIZE(maxcount)); local
252 PyObject *list = PyList_New(PREALLOC_SIZE(maxcount)); local
296 PyObject *list, *sub; local
353 PyObject *list = PyList_New(0); local
[all...]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Demo/pdist/
H A Drrcs.py33 print " list # list filename if valid"
85 def list(x, copts, fn): function
152 'list': ('', list),
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Objects/stringlib/
H A Dsplit.h10 /* Overallocate the initial list to reduce the number of reallocs for small
28 if (PyList_Append(list, sub)) { \
41 PyList_SET_ITEM(list, count, sub); \
43 if (PyList_Append(list, sub)) { \
53 /* Always force the list to the expected size. */
54 #define FIX_PREALLOC_SIZE(list) Py_SIZE(list) = count
62 PyObject *list = PyList_New(PREALLOC_SIZE(maxcount)); local
65 if (list == NULL)
78 /* No whitespace in str_obj, so just use it as list[
111 PyObject *list = PyList_New(PREALLOC_SIZE(maxcount)); local
154 PyObject *list, *sub; local
201 PyObject *list = PyList_New(PREALLOC_SIZE(maxcount)); local
252 PyObject *list = PyList_New(PREALLOC_SIZE(maxcount)); local
296 PyObject *list, *sub; local
353 PyObject *list = PyList_New(0); local
[all...]
/device/linaro/bootloader/edk2/BaseTools/Source/Python/GenPatchPcdTable/
H A DGenPatchPcdTable.py46 @return a list which element hold (PcdName, Offset, SectionName)
114 @return a list which element hold (PcdName, Offset, SectionName)
169 def generatePcdTable(list, pcdpath):
177 for pcditem in list:
199 list = parsePcdInfoFromMapFile(options.mapfile, options.efifile) variable
200 if list != None:
202 generatePcdTable(list, options.outfile)
204 generatePcdTable(list, options.mapfile.replace('.map', '.BinaryPcdTable.txt'))
/device/linaro/bootloader/edk2/StdLib/Include/sys/
H A Dcallout.h15 * notice, this list of conditions and the following disclaimer.
17 * notice, this list of conditions and the following disclaimer in the
49 * notice, this list of conditions and the following disclaimer.
51 * notice, this list of conditions and the following disclaimer in the
79 struct callout_circq *list; member in union:callout_circq::__anon9468
84 struct callout_circq *list; member in union:callout_circq::__anon9469
89 #define cq_next_l cq_next.list
90 #define cq_prev_l cq_prev.list
/device/linaro/bootloader/edk2/AppPkg/Applications/Lua/src/
H A Dlstring.c77 while (p) { /* for each node in the list */
99 int tag, unsigned int h, GCObject **list) {
103 ts = &luaC_newobj(L, tag, totalsize, list, 0)->ts;
118 GCObject **list; /* (pointer to) list where it will be inserted */ local
123 list = &tb->hash[lmod(h, tb->size)];
124 s = createstrobj(L, str, l, LUA_TSHRSTR, h, list);
98 createstrobj(lua_State *L, const char *str, size_t l, int tag, unsigned int h, GCObject **list) argument
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/
H A Dpoplib.py46 LIST [msg] list(msg = None)
136 list = []; octets = 0
143 list.append(line)
145 return resp, list, octets
205 def list(self, which=None): member in class:POP3
301 """Return message digest (unique id) list.
305 the list ['response', ['mesgnum uid', ...], octets]
336 msg = "getaddrinfo returns an empty list"
409 a.list()
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/_sqlite/
H A Drow.c143 PyObject* list; local
146 list = PyList_New(0);
147 if (!list) {
153 if (PyList_Append(list, PyTuple_GET_ITEM(PyTuple_GET_ITEM(self->description, i), 0)) != 0) {
154 Py_DECREF(list);
159 return list;

Completed in 505 milliseconds

12345