Searched refs:next (Results 1 - 25 of 127) sorted by relevance

123456

/system/core/include/cutils/
H A Dlist.h28 struct listnode *next; member in struct:listnode
37 .next = &(name), \
42 for ((node) = (list)->next; (node) != (list); (node) = (node)->next)
48 for ((node) = (list)->next, (n) = (node)->next; \
50 (node) = (n), (n) = (node)->next)
54 node->next = node;
60 item->next = head;
62 head->prev->next
[all...]
/system/core/libcutils/include/cutils/
H A Dlist.h28 struct listnode *next; member in struct:listnode
37 .next = &(name), \
42 for ((node) = (list)->next; (node) != (list); (node) = (node)->next)
48 for ((node) = (list)->next, (n) = (node)->next; \
50 (node) = (n), (n) = (node)->next)
54 node->next = node;
60 item->next = head;
62 head->prev->next
[all...]
/system/core/libcutils/include_vndk/cutils/
H A Dlist.h28 struct listnode *next; member in struct:listnode
37 .next = &(name), \
42 for ((node) = (list)->next; (node) != (list); (node) = (node)->next)
48 for ((node) = (list)->next, (n) = (node)->next; \
50 (node) = (n), (n) = (node)->next)
54 node->next = node;
60 item->next = head;
62 head->prev->next
[all...]
/system/core/liblog/
H A Dconfig_read.h30 for ((transp) = node_to_item((transports)->next, \
34 ((transp) != node_to_item((transp)->node.next, \
36 (transp) = node_to_item((transp)->node.next, \
40 for ((transp) = node_to_item((transports)->next, \
42 (n) = (transp)->node.next; \
48 (n) = (transp)->node.next)
H A Dconfig_write.h30 for ((transp) = node_to_item((transports)->next, \
34 ((transp) != node_to_item((transp)->node.next, \
36 (transp) = node_to_item((transp)->node.next, \
40 for ((transp) = node_to_item((transports)->next, \
42 (n) = (transp)->node.next; \
48 (n) = (transp)->node.next)
/system/hardware/interfaces/net/netd/1.1/
H A DINetd.hal44 @callflow(next={"*"})
67 @callflow(next={"*"})
80 @callflow(next={"*"})
92 @callflow(next={"*"})
102 @callflow(next={"*"})
114 @callflow(next={"*"})
/system/core/libsparse/
H A Dbacked_block.c46 struct backed_block *next; member in struct:backed_block
62 return bb->next;
135 struct backed_block *next = bb->next; local
137 bb = next;
155 for (end = start; end && end->next; end = end->next)
166 from->data_blocks = end->next;
168 for (bb = from->data_blocks; bb; bb = bb->next) {
169 if (bb->next
[all...]
/system/sepolicy/tools/fc_sort/
H A Dfc_sort.c35 * next points to the next node in the linked list.
45 struct file_context_node *next; member in struct:file_context_node
66 * next points to the next bucket in the linked list.
70 struct file_context_bucket *next; member in struct:file_context_bucket
160 while (a_current->next && b_current) {
161 jumpto = a_current->next;
164 * and the next a node.*/
165 while (b_current && a_current->next
310 struct file_context_node *next; local
[all...]
/system/hardware/interfaces/net/netd/1.0/
H A DINetd.hal47 @callflow(next={"*"})
56 @callflow(next="createOemNetwork")
/system/tools/hidl/docs/src/parser/
H A Dutils.kt22 * Returns the next token in the iteration, without advancing the iteration.
26 val token = iter.next()
37 iter.next()
/system/bt/osi/src/
H A Dlist.cc8 struct list_node_t* next; member in struct:list_node_t
97 node->next = prev_node->next;
99 prev_node->next = node;
111 node->next = list->head;
125 node->next = NULL;
131 list->tail->next = node;
145 list_node_t* next = list_free_node_(list, list->head); local
146 if (list->tail == list->head) list->tail = next;
147 list->head = next;
177 list_node_t* next = node->next; local
208 list_node_t* next = node->next; local
[all...]
/system/extras/showslab/
H A Dshowslab.c21 struct slab_info *next; member in struct:slab_info
141 prev->next = p;
149 p->next = NULL;
163 struct slab_info *temp = list->next;
176 p->next = a;
178 a = a->next;
180 p->next = b;
182 b = b->next;
186 p->next = (a == NULL) ? b : a;
187 return list.next;
[all...]
/system/core/property_service/libpropertyinfoserializer/
H A Dspace_tokenizer.h29 auto next = std::string(); local
31 next.push_back(*it_++);
36 return next;
/system/nvram/core/tests/
H A Dgtest_stubs.cpp28 for (TestDeclarationBase* decl = tests_; decl; decl = decl->next) {
43 test_declaration->next = tests_;
/system/tools/hidl/docs/src/parser/files/
H A Dpackage.kt35 token = iter.next()
41 token = iter.next()
52 token = iter.next()
55 token = iter.next()
/system/iot/attestation/atap/test/
H A Datap_command_unittest.cpp85 uint32_t ca_request_size = *(uint32_t*)next(buf, &i, sizeof(uint32_t));
87 uint8_t* device_pubkey = next(buf, &i, ATAP_ECDH_KEY_LEN);
89 const uint8_t* iv = next(buf, &i, ATAP_GCM_IV_LEN);
90 uint32_t ciphertext_len = *(uint32_t*)next(buf, &i, sizeof(uint32_t));
94 const uint8_t* ciphertext = next(buf, &i, ciphertext_len);
96 const uint8_t* tag = next(buf, &i, ATAP_GCM_TAG_LEN);
102 *(uint32_t*)next(inner, &i, sizeof(uint32_t));
105 int32_t auth_cert_chain_size = *(int32_t*)next(inner, &i, sizeof(int32_t));
107 int32_t auth_signature_size = *(int32_t*)next(inner, &i, sizeof(int32_t));
112 const uint8_t* product_id_hash = next(inne
[all...]
H A Datap_util_unittest.cpp75 uint8_t protocol_version = *next(buf, index, 4);
77 uint32_t message_len = *(uint32_t*)next(buf, index, sizeof(uint32_t));
172 next(buf, &i, cert_chain_serialized_size(&req.auth_key_cert_chain));
175 next(buf, &i, blob_serialized_size(&req.signature));
177 uint8_t* product_id_hash = next(buf, &i, ATAP_SHA256_DIGEST_LEN);
181 next(buf, &i, blob_serialized_size(&req.RSA_pubkey));
184 next(buf, &i, blob_serialized_size(&req.ECDSA_pubkey));
187 next(buf, &i, blob_serialized_size(&req.edDSA_pubkey));
206 int32_t auth_cert_chain_len = *(int32_t*)next(buf, &i, sizeof(int32_t));
208 int32_t auth_signature_len = *(int32_t*)next(bu
[all...]
/system/bt/bta/hf_client/
H A Dbta_hf_client_at.h37 struct queued_at_cmd* next; member in struct:queued_at_cmd
/system/core/libcutils/
H A Dhashmap.cpp32 Entry* next; member in struct:Entry
121 Entry* next = entry->next; local
123 entry->next = newBuckets[index];
125 entry = next;
149 Entry* next = entry->next; local
151 entry = next;
182 entry->next = NULL;
224 // Move to next entr
321 Entry *next = entry->next; local
[all...]
/system/sepolicy/tools/sepolicy-analyze/
H A Dtypecmp.c15 for (p = type_rules, c = type_rules->next; c; p = c, c = c->next) {
49 n->next = p->next;
50 p->next = n;
115 l = l->next;
126 for (c = l2; c; c = c->next) {
205 if (!type_rules[i].next)
209 free_type_rules(type_rules[i].next);
210 type_rules[i].next
[all...]
/system/bt/btif/src/
H A Dbtif_uid.cc33 struct uid_set_node_t* next; member in struct:uid_set_node_t
51 node = node->next;
63 node = node->next;
69 node->next = set->head;
99 node = node->next;
117 node = node->next;
/system/core/libpackagelistparser/
H A Dpackagelistparser.c95 char *next; local
121 next = buf;
123 cur = strsep(&next, " \t\r\n");
125 errmsg = "Could not get next token for \"package name\"";
134 cur = strsep(&next, " \t\r\n");
136 errmsg = "Could not get next token for field \"uid\"";
157 cur = strsep(&next, " \t\r\n");
159 errmsg = "Could not get next token for field \"debuggable\"";
177 cur = strsep(&next, " \t\r\n");
179 errmsg = "Could not get next toke
[all...]
/system/update_engine/payload_consumer/
H A Dbzip_extent_writer.h37 explicit BzipExtentWriter(std::unique_ptr<ExtentWriter> next) argument
38 : next_(std::move(next)) {
/system/core/libdiskconfig/
H A Dwrite_lst.c53 item->next = (*lst);
63 temp_wr = lst->next;
72 for(; lst; lst = lst->next) {
/system/tools/hidl/docs/src/parser/elements/
H A DDocAnnotationParser.kt62 if (peekToken(iter)?.identifier == TokenGrammar.AT) iter.next()
69 token = iter.next()
75 //if doc block ends or found next annotation tag, back up and bail
91 val token = iter.next()
102 if (iter.hasNext()) this.arg = iter.next().value
108 descTokens.add(iter.next())

Completed in 431 milliseconds

123456