Home
last modified time | relevance | path

Searched refs:next (Results 1 – 25 of 258) sorted by relevance

1234567891011

/hal_espressif-3.6.0/tools/kconfig/
Dlist.h24 struct list_head *next, *prev; member
49 for (pos = list_entry((head)->next, typeof(*pos), member); \
51 pos = list_entry(pos->member.next, typeof(*pos), member))
61 for (pos = list_entry((head)->next, typeof(*pos), member), \
62 n = list_entry(pos->member.next, typeof(*pos), member); \
64 pos = n, n = list_entry(n->member.next, typeof(*n), member))
72 return head->next == head; in list_empty()
83 struct list_head *next) in __list_add() argument
85 next->prev = _new; in __list_add()
86 _new->next = next; in __list_add()
[all …]
Dkxgettext.c43 goto next; in escape()
50 next: in escape()
64 struct file_line *next; member
78 self->next = NULL; in file_line__new()
86 struct message *next; member
109 self->next = NULL; in message__new()
127 m = m->next; in mesage__find()
142 fl->next = self->files; in message__add_file_line()
163 m->next = message__list; in message__add()
184 for (child = menu->list; child != NULL; child = child->next) in menu_build_message_list()
[all …]
Dmenu.c59 last_entry_ptr = &menu->next; in menu_add_entry()
78 last_entry_ptr = &current_menu->next; in menu_end_menu()
236 for (prop = sym->prop; prop; prop = prop->next) { in sym_check_prop()
295 for (menu = parent->list; menu; menu = menu->next) { in menu_finalize()
303 for (menu = parent->list; menu; menu = menu->next) { in menu_finalize()
314 for (menu = parent->list; menu; menu = menu->next) { in menu_finalize()
323 for (; prop; prop = prop->next) { in menu_finalize()
339 for (menu = parent->list; menu; menu = menu->next) in menu_finalize()
346 for (menu = parent->next; menu; menu = menu->next) { in menu_finalize()
351 goto next; in menu_finalize()
[all …]
/hal_espressif-3.6.0/components/wpa_supplicant/src/utils/
Dlist.h24 struct dl_list *next; member
30 list->next = list; in dl_list_init()
36 item->next = list->next; in dl_list_add()
38 list->next->prev = item; in dl_list_add()
39 list->next = item; in dl_list_add()
49 item->next->prev = item->prev; in dl_list_del()
50 item->prev->next = item->next; in dl_list_del()
51 item->next = NULL; in dl_list_del()
57 return list->next == list; in dl_list_empty()
64 for (item = list->next; item != list; item = item->next) in dl_list_len()
[all …]
/hal_espressif-3.6.0/components/bt/common/osi/
Dlist.c8 struct list_node_t *next; member
123 node->next = prev_node->next; in list_insert_after()
125 prev_node->next = node; in list_insert_after()
142 node->next = list->head; in list_prepend()
161 node->next = NULL; in list_append()
167 list->tail->next = node; in list_append()
184 list_node_t *next = list_free_node(list, list->head); in list_remove() local
186 list->tail = next; in list_remove()
188 list->head = next; in list_remove()
192 …or (list_node_t *prev = list->head, *node = list->head->next; node; prev = node, node = node->next) in list_remove()
[all …]
/hal_espressif-3.6.0/components/esp_event/
Desp_event.c76 SLIST_FOREACH(loop_it, &s_event_loops, next) { in esp_event_dump_prepare()
77 SLIST_FOREACH(loop_node_it, &(loop_it->loop_nodes), next) { in esp_event_dump_prepare()
78 SLIST_FOREACH(handler_it, &(loop_node_it->handlers), next) { in esp_event_dump_prepare()
82 SLIST_FOREACH(base_node_it, &(loop_node_it->base_nodes), next) { in esp_event_dump_prepare()
83 SLIST_FOREACH(handler_it, &(base_node_it->handlers), next) { in esp_event_dump_prepare()
86 SLIST_FOREACH(id_node_it, &(base_node_it->id_nodes), next) { in esp_event_dump_prepare()
87 SLIST_FOREACH(handler_it, &(id_node_it->handlers), next) { in esp_event_dump_prepare()
180 SLIST_INSERT_HEAD(handlers, handler_instance, next); in handler_instances_add()
185 SLIST_FOREACH(it, handlers, next) { in handler_instances_add()
198 SLIST_INSERT_AFTER(last, handler_instance, next); in handler_instances_add()
[all …]
Desp_event_private.c31 SLIST_FOREACH(loop_node, &(loop->loop_nodes), next) { in esp_event_is_handler_registered()
32 SLIST_FOREACH(handler, &(loop_node->handlers), next) { in esp_event_is_handler_registered()
40 SLIST_FOREACH(base_node, &(loop_node->base_nodes), next) { in esp_event_is_handler_registered()
42 SLIST_FOREACH(handler, &(base_node->handlers), next) { in esp_event_is_handler_registered()
50 SLIST_FOREACH(id_node, &(base_node->id_nodes), next) { in esp_event_is_handler_registered()
52 SLIST_FOREACH(handler, &(id_node->handlers), next) { in esp_event_is_handler_registered()
/hal_espressif-3.6.0/components/mdns/private_include/
Dmdns_private.h127 while (_q->next) { _q = _q->next; } \
128 _q->next = item; \
134 queue = queue->next; \
137 while (_q->next && _q->next != item) { \
138 _q = _q->next; \
140 if (_q->next == item) { \
141 _q->next = item->next; \
142 item->next = NULL; \
147 #define queueFree(type, queue) while (queue) { type * _q = queue; queue = queue->next; free(_q); }
226 struct mdns_parsed_question_s * next; member
[all …]
/hal_espressif-3.6.0/examples/bluetooth/esp_ble_mesh/aligenie_demo/components/vendor_model/include/
Dgenie_slist.h29 struct genie_snode *next; member
247 return node->next; in genie_slist_peek_next_no_check()
273 node->next = list->head; in genie_slist_prepend()
292 node->next = NULL; in genie_slist_append()
298 list->tail->next = node; in genie_slist_append()
321 list->tail->next = (genie_snode_t *)head; in genie_slist_append_list()
358 } else if (!prev->next) { in genie_slist_insert()
361 node->next = prev->next; in genie_slist_insert()
362 prev->next = node; in genie_slist_insert()
380 list->head = node->next; in genie_slist_get_not_empty()
[all …]
Dgenie_dlist.h33 struct genie_dnode *next; /* ptr to next node (genie_dnode_t) */ member
261 node = node->next; in genie_dlist_node_number()
324 return (node == list->tail) ? NULL : node->next; in genie_dlist_peek_next_no_check()
369 node->next = list; in genie_dlist_append()
372 list->tail->next = node; in genie_dlist_append()
389 node->next = list->head; in genie_dlist_prepend()
415 node->next = insert_point->next; in genie_dlist_insert_after()
417 insert_point->next->prev = node; in genie_dlist_insert_after()
418 insert_point->next = node; in genie_dlist_insert_after()
442 node->next = insert_point; in genie_dlist_insert_before()
[all …]
/hal_espressif-3.6.0/components/bt/esp_ble_mesh/mesh_common/include/
Dmesh_slist.h29 struct _snode *next; member
247 return node->next; in sys_slist_peek_next_no_check()
273 node->next = list->head; in sys_slist_prepend()
292 node->next = NULL; in sys_slist_append()
298 list->tail->next = node; in sys_slist_append()
321 list->tail->next = (sys_snode_t *)head; in sys_slist_append_list()
358 } else if (!prev->next) { in sys_slist_insert()
361 node->next = prev->next; in sys_slist_insert()
362 prev->next = node; in sys_slist_insert()
380 list->head = node->next; in sys_slist_get_not_empty()
[all …]
Dmesh_dlist.h34 struct _dnode *next; /* ptr to next node (sys_dnode_t) */ member
296 return (node == list->tail) ? NULL : node->next; in sys_dlist_peek_next_no_check()
341 node->next = list; in sys_dlist_append()
344 list->tail->next = node; in sys_dlist_append()
361 node->next = list->head; in sys_dlist_prepend()
388 node->next = insert_point->next; in sys_dlist_insert_after()
390 insert_point->next->prev = node; in sys_dlist_insert_after()
391 insert_point->next = node; in sys_dlist_insert_after()
416 node->next = insert_point; in sys_dlist_insert_before()
417 insert_point->prev->next = node; in sys_dlist_insert_before()
[all …]
/hal_espressif-3.6.0/components/wpa_supplicant/src/rsn_supp/
Dpmksa_cache.c62 pmksa->pmksa = entry->next; in pmksa_cache_expire()
155 pmksa->pmksa = pos->next; in pmksa_cache_add()
157 prev->next = pos->next; in pmksa_cache_add()
178 pos = pos->next; in pmksa_cache_add()
191 pos = pos->next; in pmksa_cache_add()
192 pmksa->pmksa->next = pos ? pos->next : NULL; in pmksa_cache_add()
194 pmksa->pmksa = pos->next; in pmksa_cache_add()
212 pos = pos->next; in pmksa_cache_add()
215 entry->next = pmksa->pmksa; in pmksa_cache_add()
219 entry->next = prev->next; in pmksa_cache_add()
[all …]
/hal_espressif-3.6.0/components/newlib/
Dreent_init.c54 struct _Bigint *cur, *next; in esp_reent_cleanup() local
55 next = _REENT_MP_FREELIST(r)[i]; in esp_reent_cleanup()
56 while (next) { in esp_reent_cleanup()
57 cur = next; in esp_reent_cleanup()
58 next = next->_next; in esp_reent_cleanup()
87 struct _glue* next = cur->_next; in esp_reent_cleanup() local
88 prev->_next = next; in esp_reent_cleanup()
90 cur = next; in esp_reent_cleanup()
/hal_espressif-3.6.0/components/bt/host/bluedroid/external/sbc/decoder/srce/
Dframing.c113 static INLINE OI_CHAR crc_iterate(OI_UINT8 oldcrc, OI_UINT8 next) in crc_iterate() argument
117 idx = oldcrc ^ next; in crc_iterate()
128 static INLINE OI_CHAR crc_iterate_top4(OI_UINT8 oldcrc, OI_UINT8 next) in crc_iterate_top4() argument
132 idx = (oldcrc ^ next) >> 4; in crc_iterate_top4()
145 static INLINE OI_UINT8 crc_iterate_top4(OI_UINT8 oldcrc, OI_UINT8 next) in crc_iterate_top4() argument
147 return (oldcrc << 4) ^ crc8_narrow[(oldcrc ^ next) >> 4]; in crc_iterate_top4()
151 static INLINE OI_UINT8 crc_iterate(OI_UINT8 crc, OI_UINT8 next) in crc_iterate() argument
153 crc = (crc << 4) ^ crc8_narrow[(crc ^ next) >> 4]; in crc_iterate()
154 crc = (crc << 4) ^ crc8_narrow[((crc >> 4)^next) & 0xf]; in crc_iterate()
160 static INLINE OI_UINT8 crc_iterate(OI_UINT8 crc, OI_UINT8 next) in crc_iterate() argument
[all …]
/hal_espressif-3.6.0/examples/bluetooth/nimble/ble_spp/spp_client/main/
Dpeer.c53 SLIST_FOREACH(peer, &peers, next) { in peer_find()
80 SLIST_FOREACH(dsc, &chr->dscs, next) { in peer_dsc_find_prev()
102 dsc = SLIST_NEXT(prev, next); in peer_dsc_find()
158 SLIST_INSERT_HEAD(&chr->dscs, dsc, next); in peer_dsc_add()
160 SLIST_NEXT(prev, next) = dsc; in peer_dsc_add()
177 SLIST_FOREACH(svc, &peer->svcs, next) { in peer_disc_dscs()
178 SLIST_FOREACH(chr, &svc->chrs, next) { in peer_disc_dscs()
246 next_chr = SLIST_NEXT(chr, next); in chr_end_handle()
267 SLIST_FOREACH(chr, &svc->chrs, next) { in peer_chr_find_prev()
289 chr = SLIST_NEXT(prev, next); in peer_chr_find()
[all …]
/hal_espressif-3.6.0/examples/bluetooth/nimble/blecent/main/
Dpeer.c66 SLIST_FOREACH(peer, &peers, next) { in peer_find()
93 SLIST_FOREACH(dsc, &chr->dscs, next) { in peer_dsc_find_prev()
115 dsc = SLIST_NEXT(prev, next); in peer_dsc_find()
171 SLIST_INSERT_HEAD(&chr->dscs, dsc, next); in peer_dsc_add()
173 SLIST_NEXT(prev, next) = dsc; in peer_dsc_add()
190 SLIST_FOREACH(svc, &peer->svcs, next) { in peer_disc_dscs()
191 SLIST_FOREACH(chr, &svc->chrs, next) { in peer_disc_dscs()
259 next_chr = SLIST_NEXT(chr, next); in chr_end_handle()
280 SLIST_FOREACH(chr, &svc->chrs, next) { in peer_chr_find_prev()
302 chr = SLIST_NEXT(prev, next); in peer_chr_find()
[all …]
/hal_espressif-3.6.0/examples/bluetooth/nimble/throughput_app/blecent_throughput/main/
Dpeer.c53 SLIST_FOREACH(peer, &peers, next) { in peer_find()
80 SLIST_FOREACH(dsc, &chr->dscs, next) { in peer_dsc_find_prev()
102 dsc = SLIST_NEXT(prev, next); in peer_dsc_find()
158 SLIST_INSERT_HEAD(&chr->dscs, dsc, next); in peer_dsc_add()
160 SLIST_NEXT(prev, next) = dsc; in peer_dsc_add()
177 SLIST_FOREACH(svc, &peer->svcs, next) { in peer_disc_dscs()
178 SLIST_FOREACH(chr, &svc->chrs, next) { in peer_disc_dscs()
246 next_chr = SLIST_NEXT(chr, next); in chr_end_handle()
267 SLIST_FOREACH(chr, &svc->chrs, next) { in peer_chr_find_prev()
289 chr = SLIST_NEXT(prev, next); in peer_chr_find()
[all …]
/hal_espressif-3.6.0/components/heap/
Dheap_tlsf_block_functions.h146 block_header_t* next = offset_to_block(block_to_ptr(block), in block_next() local
148 return next; in block_next()
154 block_header_t* next = block_next(block); in block_link_next() local
155 next->prev_phys_block = block; in block_link_next()
156 return next; in block_link_next()
162 block_header_t* next = block_link_next(block); in block_mark_as_free() local
163 block_set_prev_free(next); in block_mark_as_free()
169 block_header_t* next = block_next(block); in block_mark_as_used() local
170 block_set_prev_used(next); in block_mark_as_used()
/hal_espressif-3.6.0/components/nvs_flash/src/
Dintrusive_list.h178 void insert(iterator next, T* node) in insert() argument
180 if (static_cast<T*>(next) == nullptr) { in insert()
183 auto prev = next->mPrev; in insert()
188 next->mPrev = node; in insert()
189 node->mNext = next; in insert()
199 auto next = it->mNext; in erase() local
202 prev->mNext = next; in erase()
204 mFirst = next; in erase()
206 if (next) { in erase()
207 next->mPrev = prev; in erase()
/hal_espressif-3.6.0/components/esp_system/
Dtask_wdt.c58 twdt_task_t *next; member
93 for(twdt_task_t *task = twdt_config->list; task != NULL; task = task->next){ in find_task_in_twdt_list()
116 for (twdt_task_t *task = twdt_config->list; task != NULL; task = task->next){ in reset_hw_timer()
156 for (twdttask=twdt_config->list; twdttask!=NULL; twdttask=twdttask->next) { in task_wdt_isr()
283 target_task->next = NULL; in esp_task_wdt_add()
288 for (task = twdt_config->list; task->next != NULL; task = task->next){ in esp_task_wdt_add()
291 task->next = target_task; in esp_task_wdt_add()
350 twdt_config->list = target_task->next; in esp_task_wdt_delete()
354 for (prev = twdt_config->list; prev->next != target_task; prev = prev->next){ in esp_task_wdt_delete()
357 prev->next = target_task->next; in esp_task_wdt_delete()
[all …]
/hal_espressif-3.6.0/components/pthread/
Dpthread_local_storage.c39 SLIST_ENTRY(key_entry_t_) next;
51 SLIST_ENTRY(value_entry_t_) next;
72 SLIST_INSERT_HEAD(&s_keys, new_key, next); in pthread_key_create()
82 SLIST_FOREACH(result, &s_keys, next) { in find_key()
102 SLIST_REMOVE(&s_keys, entry, key_entry_t_, next); in pthread_key_delete()
139 SLIST_REMOVE_HEAD(tls, next); in pthread_local_storage_thread_deleted_callback()
199 SLIST_FOREACH(result, list, next) { in find_value()
251 SLIST_REMOVE(tls, entry, value_entry_t_, next); in pthread_setspecific()
269 SLIST_FOREACH(it, tls, next) { in pthread_setspecific()
273 SLIST_INSERT_HEAD(tls, entry, next); in pthread_setspecific()
[all …]
/hal_espressif-3.6.0/components/esp_hw_support/
Desp_async_memcpy.c71 mcp_hdl->out_streams[i].desc.next = &mcp_hdl->out_streams[i + 1].desc; in esp_async_memcpy_install()
73 mcp_hdl->in_streams[i].desc.next = &mcp_hdl->in_streams[i + 1].desc; in esp_async_memcpy_install()
75 mcp_hdl->out_streams[mcp_hdl->max_stream_num - 1].desc.next = &mcp_hdl->out_streams[0].desc; in esp_async_memcpy_install()
76 mcp_hdl->in_streams[mcp_hdl->max_stream_num - 1].desc.next = &mcp_hdl->in_streams[0].desc; in esp_async_memcpy_install()
133 desc = desc->next; // move to next descriptor in async_memcpy_prepare_receive()
147 desc = desc->next; // move to next descriptor in async_memcpy_prepare_receive()
175 desc = desc->next; // move to next descriptor in async_memcpy_prepare_transmit()
190 desc = desc->next; // move to next descriptor in async_memcpy_prepare_transmit()
206 dma_descriptor_t *next = asmcp->next_rx_desc_to_check; in async_memcpy_get_next_rx_descriptor() local
208 if (next->dw0.owner == DMA_DESCRIPTOR_BUFFER_OWNER_CPU) { in async_memcpy_get_next_rx_descriptor()
[all …]
/hal_espressif-3.6.0/components/console/
Dcommands.c36 SLIST_ENTRY(cmd_item_) next; //!< next command in the list
77 SLIST_FOREACH_SAFE(it, &s_cmd_list, next, tmp) { in esp_console_deinit()
78 SLIST_REMOVE(&s_cmd_list, it, cmd_item_, next); in esp_console_deinit()
103 SLIST_REMOVE(&s_cmd_list, item, cmd_item_, next); in esp_console_cmd_register()
129 SLIST_INSERT_HEAD(&s_cmd_list, item, next); in esp_console_cmd_register()
132 while ((it = SLIST_NEXT(last, next)) != NULL) { in esp_console_cmd_register()
135 SLIST_INSERT_AFTER(last, item, next); in esp_console_cmd_register()
147 SLIST_FOREACH(it, &s_cmd_list, next) { in esp_console_get_completion()
159 SLIST_FOREACH(it, &s_cmd_list, next) { in esp_console_get_hint()
175 SLIST_FOREACH(it, &s_cmd_list, next) { in find_command_by_name()
[all …]
/hal_espressif-3.6.0/components/mdns/
Dmdns.c172 s = s->next; in _mdns_get_service_item()
187 host = host->next; in mdns_get_host_item()
198 s = s->next; in _mdns_can_add_more_services()
277 s = s->next; in _mdns_get_service_item_instance()
741 txt = txt->next; in _mdns_append_txt_record()
1029 addr = addr->next; in _mdns_append_host_answer()
1144 q = q->next; in _mdns_dispatch_tx_packet()
1152 a = a->next; in _mdns_dispatch_tx_packet()
1160 a = a->next; in _mdns_dispatch_tx_packet()
1168 a = a->next; in _mdns_dispatch_tx_packet()
[all …]

1234567891011