/nrf52832-nimble/rt-thread/include/ |
H A D | rtservice.h | 49 l->next = l->prev = l; in rt_list_init() 60 l->next->prev = n; in rt_list_insert_after() 61 n->next = l->next; in rt_list_insert_after() 63 l->next = n; in rt_list_insert_after() 75 l->prev->next = n; in rt_list_insert_before() 79 n->next = l; in rt_list_insert_before() 88 n->next->prev = n->prev; in rt_list_remove() 89 n->prev->next = n->next; in rt_list_remove() 91 n->next = n->prev = n; in rt_list_remove() 100 return l->next == l; in rt_list_isempty() [all …]
|
/nrf52832-nimble/rt-thread/components/finsh/ |
H A D | finsh_heap.c | 19 struct finsh_block_header* next; local 44 free_list->next = NULL; in finsh_heap_init() 63 header = header->next) ; in finsh_heap_allocate() 72 header = header->next) ; in finsh_heap_allocate() 83 header->next = NULL; in finsh_heap_allocate() 134 header = header->next; in finsh_heap_gc() 163 header->next = node; in finsh_block_insert() 170 for (node = *list; node; node = node->next) in finsh_block_insert() 172 if (node->next > header) break; in finsh_block_insert() 174 if (node->next == NULL) break; in finsh_block_insert() [all …]
|
H A D | cmd.c | 135 node = node->next; in list_get_next() 160 rt_list_t *next = (rt_list_t*)RT_NULL; in list_thread() local 178 next = list_get_next(next, &find_arg); in list_thread() 245 while (next != (rt_list_t*)RT_NULL); in list_thread() 257 for (node = list->next; node != list; node = node->next) in show_wait_queue() 262 if (node->next != list) in show_wait_queue() 273 rt_list_t *next = (rt_list_t*)RT_NULL; in list_sem() local 287 next = list_get_next(next, &find_arg); in list_sem() 326 while (next != (rt_list_t*)RT_NULL); in list_sem() 340 rt_list_t *next = (rt_list_t*)RT_NULL; in list_event() local [all …]
|
/nrf52832-nimble/rt-thread/tools/kconfig-frontends/libs/parser/ |
H A D | list.h | 24 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() 79 * the prev/next entries already! 83 struct list_head *next) in __list_add() argument 85 next->prev = _new; in __list_add() [all …]
|
/nrf52832-nimble/rt-thread/components/net/lwip-1.4.1/src/core/snmp/ |
H A D | asn1_enc.c | 198 p = p->next; in snmp_asn1_enc_type() 239 /* next octet in next pbuf */ in snmp_asn1_enc_length() 240 p = p->next; in snmp_asn1_enc_length() 246 /* next octet in same pbuf */ in snmp_asn1_enc_length() 265 /* next octet in next pbuf */ in snmp_asn1_enc_length() 266 p = p->next; in snmp_asn1_enc_length() 273 /* next octet in same pbuf */ in snmp_asn1_enc_length() 290 p = p->next; in snmp_asn1_enc_length() 331 /* next octet in next pbuf */ in snmp_asn1_enc_u32t() 332 p = p->next; in snmp_asn1_enc_u32t() [all …]
|
H A D | asn1_dec.c | 69 p = p->next; in snmp_asn1_dec_type() 125 /* next octet in next pbuf */ in snmp_asn1_dec_length() 126 p = p->next; in snmp_asn1_dec_length() 133 /* next octet in same pbuf */ in snmp_asn1_dec_length() 160 /* next octet in next pbuf */ in snmp_asn1_dec_length() 161 p = p->next; in snmp_asn1_dec_length() 167 /* next octet in same pbuf */ in snmp_asn1_dec_length() 186 /* next octet in next pbuf */ in snmp_asn1_dec_length() 187 p = p->next; in snmp_asn1_dec_length() 194 /* next octet in same pbuf */ in snmp_asn1_dec_length() [all …]
|
/nrf52832-nimble/rt-thread/components/net/lwip-2.1.0/src/core/ |
H A D | mem.c | 350 /** index (-> ram[next]) of the next struct */ 351 mem_size_t next; member 484 LWIP_ASSERT("plug_holes: mem->next <= MEM_SIZE_ALIGNED", mem->next <= MEM_SIZE_ALIGNED); in plug_holes() 486 nmem = ptr_to_mem(mem->next); in plug_holes() 488 /* if mem->next is unused and not end of ram, combine mem and mem->next */ in plug_holes() 492 mem->next = nmem->next; in plug_holes() 493 if (nmem->next != MEM_SIZE_ALIGNED) { in plug_holes() 494 ptr_to_mem(nmem->next)->prev = mem_to_ptr(mem); in plug_holes() 505 pmem->next = mem->next; in plug_holes() 506 if (mem->next != MEM_SIZE_ALIGNED) { in plug_holes() [all …]
|
H A D | tcp_in.c | 192 /* TCP header fits into first pbuf, options don't - data is in the next pbuf */ 193 /* there must be a next pbuf, due to hdrlen_bytes sanity check above */ 194 LWIP_ASSERT("p->next != NULL", p->next != NULL); 203 /* options continue in the next pbuf: set p to zero length and hide the 204 options in the next pbuf (adjusting p->tot_len) */ 208 if (opt2len > p->next->len) { 210 …UGF(TCP_INPUT_DEBUG, ("tcp_input: options overflow second pbuf (%"U16_F" bytes)\n", p->next->len)); 216 tcphdr_opt2 = (u8_t *)p->next->payload; 218 /* advance p->next to point after the options, and manually 219 adjust p->tot_len to keep it consistent with the changed p->next */ [all …]
|
/nrf52832-nimble/rt-thread/components/net/lwip-1.4.1/src/core/ |
H A D | mem.c | 157 /** index (-> ram[next]) of the next struct */ 158 mem_size_t next; member 246 LWIP_ASSERT("plug_holes: mem->next <= MEM_SIZE_ALIGNED", mem->next <= MEM_SIZE_ALIGNED); in plug_holes() 248 nmem = (struct mem *)(void *)&ram[mem->next]; in plug_holes() 250 /* if mem->next is unused and not end of ram, combine mem and mem->next */ in plug_holes() 254 mem->next = nmem->next; in plug_holes() 255 ((struct mem *)(void *)&ram[nmem->next])->prev = (mem_size_t)((u8_t *)mem - ram); in plug_holes() 265 pmem->next = mem->next; in plug_holes() 266 ((struct mem *)(void *)&ram[mem->next])->prev = (mem_size_t)((u8_t *)pmem - ram); in plug_holes() 285 mem->next = MEM_SIZE_ALIGNED; in mem_init() [all …]
|
H A D | tcp_in.c | 170 for(pcb = tcp_active_pcbs; pcb != NULL; pcb = pcb->next) { in tcp_input() 182 LWIP_ASSERT("tcp_input: pcb->next != pcb (before cache)", pcb->next != pcb); in tcp_input() 184 prev->next = pcb->next; in tcp_input() 185 pcb->next = tcp_active_pcbs; in tcp_input() 188 LWIP_ASSERT("tcp_input: pcb->next != pcb (after cache)", pcb->next != pcb); in tcp_input() 197 for(pcb = tcp_tw_pcbs; pcb != NULL; pcb = pcb->next) { in tcp_input() 216 for(lpcb = tcp_listen_pcbs.listen_pcbs; lpcb != NULL; lpcb = lpcb->next) { in tcp_input() 250 ((struct tcp_pcb_listen *)prev)->next = lpcb->next; in tcp_input() 252 lpcb->next = tcp_listen_pcbs.listen_pcbs; in tcp_input() 280 inseg.next = NULL; in tcp_input() [all …]
|
H A D | pbuf.c | 25 * pbuf of a packet has a ->next field other than NULL, more packets 29 * loop end condition (tot_len == p->len), NOT (next == NULL). 127 for (pcb = tcp_active_pcbs; NULL != pcb; pcb = pcb->next) { in pbuf_free_ooseq() 246 p->next = NULL; in pbuf_alloc() 266 /* remember first pbuf for linkage in next iteration */ in pbuf_alloc() 282 q->next = NULL; in pbuf_alloc() 284 r->next = q; in pbuf_alloc() 285 /* set total length of this pbuf and next in chain */ in pbuf_alloc() 299 /* remember this pbuf for linkage in next iteration */ in pbuf_alloc() 303 /*r->next = NULL;*/ in pbuf_alloc() [all …]
|
H A D | timers.c | 276 timeout->next = NULL; in sys_timeout_debug() 293 timeout->next = next_timeout; in sys_timeout_debug() 296 for(t = next_timeout; t != NULL; t = t->next) { in sys_timeout_debug() 298 if (t->next == NULL || t->next->time > timeout->time) { in sys_timeout_debug() 299 if (t->next != NULL) { in sys_timeout_debug() 300 t->next->time -= timeout->time; in sys_timeout_debug() 302 timeout->next = t->next; in sys_timeout_debug() 303 t->next = timeout; in sys_timeout_debug() 329 for (t = next_timeout, prev_t = NULL; t != NULL; prev_t = t, t = t->next) { in sys_untimeout() 334 next_timeout = t->next; in sys_untimeout() [all …]
|
/nrf52832-nimble/rt-thread/components/net/lwip-2.0.2/src/core/ |
H A D | tcp_in.c | 174 /* TCP header fits into first pbuf, options don't - data is in the next pbuf */ 175 /* there must be a next pbuf, due to hdrlen_bytes sanity check above */ 176 LWIP_ASSERT("p->next != NULL", p->next != NULL); 185 /* options continue in the next pbuf: set p to zero length and hide the 186 options in the next pbuf (adjusting p->tot_len) */ 190 if (opt2len > p->next->len) { 192 …UGF(TCP_INPUT_DEBUG, ("tcp_input: options overflow second pbuf (%"U16_F" bytes)\n", p->next->len)); 198 tcphdr_opt2 = (u8_t*)p->next->payload; 200 /* advance p->next to point after the options, and manually 201 adjust p->tot_len to keep it consistent with the changed p->next */ [all …]
|
H A D | mem.c | 265 /** index (-> ram[next]) of the next struct */ 266 mem_size_t next; member 354 LWIP_ASSERT("plug_holes: mem->next <= MEM_SIZE_ALIGNED", mem->next <= MEM_SIZE_ALIGNED); in plug_holes() 356 nmem = (struct mem *)(void *)&ram[mem->next]; in plug_holes() 358 /* if mem->next is unused and not end of ram, combine mem and mem->next */ in plug_holes() 362 mem->next = nmem->next; in plug_holes() 363 ((struct mem *)(void *)&ram[nmem->next])->prev = (mem_size_t)((u8_t *)mem - ram); in plug_holes() 373 pmem->next = mem->next; in plug_holes() 374 ((struct mem *)(void *)&ram[mem->next])->prev = (mem_size_t)((u8_t *)pmem - ram); in plug_holes() 393 mem->next = MEM_SIZE_ALIGNED; in mem_init() [all …]
|
H A D | timeouts.c | 224 timeout->next = NULL; in sys_timeout_debug() 241 timeout->next = next_timeout; in sys_timeout_debug() 244 for (t = next_timeout; t != NULL; t = t->next) { in sys_timeout_debug() 246 if (t->next == NULL || t->next->time > timeout->time) { in sys_timeout_debug() 247 if (t->next != NULL) { in sys_timeout_debug() 248 t->next->time -= timeout->time; in sys_timeout_debug() 256 timeout->next = t->next; in sys_timeout_debug() 257 t->next = timeout; in sys_timeout_debug() 281 for (t = next_timeout, prev_t = NULL; t != NULL; prev_t = t, t = t->next) { in sys_untimeout() 286 next_timeout = t->next; in sys_untimeout() [all …]
|
H A D | pbuf.c | 30 * pbuf of a packet has a ->next field other than NULL, more packets 34 * loop end condition (tot_len == p->len), NOT (next == NULL). 170 for (pcb = tcp_active_pcbs; NULL != pcb; pcb = pcb->next) { in pbuf_free_ooseq() 292 p->next = NULL; in pbuf_alloc() 312 /* remember first pbuf for linkage in next iteration */ in pbuf_alloc() 328 q->next = NULL; in pbuf_alloc() 330 r->next = q; in pbuf_alloc() 331 /* set total length of this pbuf and next in chain */ in pbuf_alloc() 345 /* remember this pbuf for linkage in next iteration */ in pbuf_alloc() 349 /*r->next = NULL;*/ in pbuf_alloc() [all …]
|
/nrf52832-nimble/rt-thread/components/lwp/ |
H A D | lwp_memheap.c | 32 #define MEMITEM_SIZE(item) ((rt_uint32_t)item->next - (rt_uint32_t)item - RT_MEMHEAP_SIZE) 64 item->next = RT_NULL; in rt_lwp_memheap_init() 76 item->next = RT_NULL; in rt_lwp_memheap_init() 81 item->next = (struct rt_lwp_memheap_item *) in rt_lwp_memheap_init() 83 item->prev = item->next; in rt_lwp_memheap_init() 97 item = item->next; in rt_lwp_memheap_init() 101 item->next = (struct rt_lwp_memheap_item *)start_addr; in rt_lwp_memheap_init() 154 /* move to next free memory block */ in rt_lwp_memheap_alloc() 176 header_ptr->next, in rt_lwp_memheap_alloc() 188 new_ptr->next = header_ptr->next; in rt_lwp_memheap_alloc() [all …]
|
/nrf52832-nimble/rt-thread/src/ |
H A D | mem.c | 105 rt_size_t next, prev; member 166 nmem = (struct heap_mem *)&heap_ptr[mem->next]; in plug_holes() 171 /* if mem->next is unused and not end of heap_ptr, in plug_holes() 172 * combine mem and mem->next in plug_holes() 178 mem->next = nmem->next; in plug_holes() 179 ((struct heap_mem *)&heap_ptr[nmem->next])->prev = (rt_uint8_t *)mem - heap_ptr; in plug_holes() 191 pmem->next = mem->next; in plug_holes() 192 ((struct heap_mem *)&heap_ptr[mem->next])->prev = (rt_uint8_t *)pmem - heap_ptr; in plug_holes() 236 mem->next = mem_size_aligned + SIZEOF_STRUCT_MEM; in rt_system_heap_init() 244 heap_end = (struct heap_mem *)&heap_ptr[mem->next]; in rt_system_heap_init() [all …]
|
H A D | memheap.c | 37 #define MEMITEM_SIZE(item) ((rt_ubase_t)item->next - (rt_ubase_t)item - RT_MEMHEAP_SIZE) 71 item->next = RT_NULL; in rt_memheap_init() 83 item->next = RT_NULL; in rt_memheap_init() 88 item->next = (struct rt_memheap_item *) in rt_memheap_init() 90 item->prev = item->next; in rt_memheap_init() 104 item = item->next; in rt_memheap_init() 108 item->next = (struct rt_memheap_item *)start_addr; in rt_memheap_init() 177 /* move to next free memory block */ in rt_memheap_alloc() 199 header_ptr->next, in rt_memheap_alloc() 211 new_ptr->next = header_ptr->next; in rt_memheap_alloc() [all …]
|
/nrf52832-nimble/rt-thread/components/dfs/filesystems/uffs/src/uffs/ |
H A D | uffs_mtb.c | 79 for (work = m_head; work; work = work->next) { in uffs_RegisterMountTable() 84 for (work = m_free_head; work; work = work->next) { in uffs_RegisterMountTable() 93 mtb->next = m_free_head; in uffs_RegisterMountTable() 114 for (work = m_head; work; work = work->next) { in uffs_UnRegisterMountTable() 119 for (work = m_free_head; work; work = work->next) { in uffs_UnRegisterMountTable() 122 if (work->next) in uffs_UnRegisterMountTable() 123 work->next->prev = work->prev; in uffs_UnRegisterMountTable() 125 work->prev->next = work->next; in uffs_UnRegisterMountTable() 127 m_free_head = work->next; in uffs_UnRegisterMountTable() 140 for (work = head; work; work = work->next) { in uffs_GetMountTableByMountPoint() [all …]
|
/nrf52832-nimble/rt-thread/components/dfs/filesystems/jffs2/kernel/linux/ |
H A D | list.h | 58 struct list_head *next; member 71 (_list_)->next = (_list_)->prev = (_list_); \ 80 struct list_head *next = afterthisent->next; in list_add() local 81 newent->next = next; in list_add() 83 afterthisent->next = newent; in list_add() 84 next->prev = newent; in list_add() 93 newent->next = beforethisent; in list_add_tail() 95 prev->next = newent; in list_add_tail() 102 ent->prev->next = ent->next; in list_del() 103 ent->next->prev = ent->prev; in list_del() [all …]
|
/nrf52832-nimble/packages/NimBLE-latest/apps/blecent/src/ |
H A D | peer.c | 66 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() 232 * descriptors in the next characteristic. in peer_dsc_disced() 259 next_chr = SLIST_NEXT(chr, next); in chr_end_handle() 280 SLIST_FOREACH(chr, &svc->chrs, next) { in peer_chr_find_prev() [all …]
|
/nrf52832-nimble/packages/NimBLE-latest/nimble/host/mesh/include/mesh/ |
H A D | slist.h | 29 struct _snode *next; member 71 * where to start searching for the next entry from. If NULL, it starts from 139 * @brief Provide the primitive to peek the next container 237 * @brief Peek the next node from current node, node is not NULL 241 * @param node A pointer on the node where to peek the next node 243 * @return a pointer on the next node (or NULL if none) 247 return node->next; in sys_slist_peek_next_no_check() 251 * @brief Peek the next node from current node 253 * @param node A pointer on the node where to peek the next node 255 * @return a pointer on the next node (or NULL if none) [all …]
|
/nrf52832-nimble/rt-thread/tools/kconfig-frontends/utils/ |
H A D | gettext.c | 43 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 …]
|
/nrf52832-nimble/rt-thread/components/drivers/sensors/ |
H A D | sensor.cpp | 24 this->next = this->prev = NULL; in SensorBase() 97 sensor->prev = sensor->next = sensor; in registerSensor() 101 sensor_list->prev->next = sensor; in registerSensor() 105 sensor->next = sensor_list; in registerSensor() 117 sensor->next->prev = sensor->prev; in unregisterSensor() 118 sensor->prev->next = sensor->next; in unregisterSensor() 123 if (sensor->next == sensor) sensor_list = NULL; /* empty list */ in unregisterSensor() 124 else sensor_list = sensor->next; in unregisterSensor() 128 sensor->next = sensor->prev = sensor; in unregisterSensor() 144 sensor = sensor->next; in getDefaultSensor()
|