| /nrf52832-nimble/packages/NimBLE-latest/nimble/host/mesh/include/mesh/ |
| H A D | slist.h | 10 * @brief Single-linked list implementation
12 * Single-linked list implementation using inline macros/functions.
13 * This API is not thread safe, and thus if a list is used across threads,
42 * @brief Provide the primitive to iterate on a list
54 * @param __sn A sys_snode_t pointer to peek each node of the list
61 * @brief Provide the primitive to iterate on a list, from a node in the list
70 * Like SYS_SLIST_FOR_EACH_NODE(), but __dn already contains a node in the list
77 * @param __sn A sys_snode_t pointer to peek each node of the list
87 * @brief Provide the primitive to safely iterate on a list
99 * @param __sn A sys_snode_t pointer to peek each node of the list
[all …]
|
| /nrf52832-nimble/rt-thread/include/ |
| H A D | rtservice.h | 38 * @brief initialize a list object
43 * @brief initialize a list
45 * @param l list to be initialized
53 * @brief insert a node after a list
55 * @param l list to insert it
68 * @brief insert a node before a list
71 * @param l list to insert it
83 * @brief remove node from list.
84 * @param n the node to remove from the list.
95 * @brief tests whether a list is empty
[all …]
|
| /nrf52832-nimble/rt-thread/components/finsh/ |
| H A D | finsh_heap.c | 31 static void finsh_block_insert(struct finsh_block_header** list, struct finsh_block_header* header);
32 static void finsh_block_remove(struct finsh_block_header** list, struct finsh_block_header* header);
34 static void finsh_block_merge(struct finsh_block_header** list, struct finsh_block_header* header);
41 /* init free and alloc list */ in finsh_heap_init()
81 /* remove from free list */ in finsh_heap_allocate()
85 /* insert to allocate list */ in finsh_heap_allocate()
103 /* remove from allocate list */ in finsh_heap_free()
106 /* insert to free list */ in finsh_heap_free()
145 * insert a block to list
147 void finsh_block_insert(struct finsh_block_header** list, struct finsh_block_header* header) in finsh_block_insert() argument
[all …]
|
| H A D | cmd.c | 21 * 2008-09-10 Bernard update the list function for finsh syscall
22 * list and sysvar list
68 rt_list_t *list; member
78 rt_list_t *list; in list_find_init() local
81 list = &info->object_list; in list_find_init()
83 p->list = list; in list_find_init()
94 rt_list_t *node, *list; in list_get_next() local
105 list = arg->list; in list_get_next()
109 node = list; in list_get_next()
122 /* The node in the list? */ in list_get_next()
[all …]
|
| /nrf52832-nimble/rt-thread/tools/kconfig-frontends/libs/lxdialog/ |
| H A D | checklist.c | 29 * Print list item
114 * Display a dialog box with a list of options that can be turned on or off
122 WINDOW *dialog, *list; in dialog_checklist() local
169 /* create new window for the list */ in dialog_checklist()
170 list = subwin(dialog, list_height, list_width, y + box_y + 1, in dialog_checklist()
173 keypad(list, TRUE); in dialog_checklist()
175 /* draw a box around the list items */ in dialog_checklist()
193 /* Print the list */ in dialog_checklist()
196 print_item(list, i, i == choice); in dialog_checklist()
205 wnoutrefresh(list); in dialog_checklist()
[all …]
|
| /nrf52832-nimble/packages/NimBLE-latest/porting/nimble/include/os/ |
| H A D | queue.h | 9 * notice, this list of conditions and the following disclaimer.
11 * notice, this list of conditions and the following disclaimer in the
44 * A singly-linked list is headed by a single forward pointer. The elements
47 * added to the list after an existing element or at the head of the list.
48 * Elements being removed from the head of the list should use the explicit
49 * macro for this purpose for optimum efficiency. A singly-linked list may
55 * head of the list and the other to the tail of the list. The elements are
58 * to the list after an existing element, at the head of the list, or at the
59 * end of the list. Elements being removed from the head of the tail queue
65 * A list is headed by a single forward pointer (or an array of forward
[all …]
|
| /nrf52832-nimble/rt-thread/tools/kconfig-frontends/libs/parser/ |
| H A D | list.h | 43 * list_for_each_entry - iterate over list of given type
45 * @head: the head for your list.
54 * list_for_each_entry_safe - iterate over list of given type safe against removal of list entry
57 * @head: the head for your list.
67 * list_empty - tests whether a list is empty
68 * @head: the list to test.
78 * This is only for internal list manipulation where we know
94 * @head: list head to add it before
105 * Delete a list entry by making the prev/next entries
108 * This is only for internal list manipulation where we know
[all …]
|
| /nrf52832-nimble/rt-thread/components/dfs/filesystems/jffs2/src/ |
| H A D | erase.c | 57 list_del(&jeb->list); in jffs2_erase_block()
58 list_add(&jeb->list, &c->erase_pending_list); in jffs2_erase_block()
87 /* Erase failed immediately. Refile it on the list */ in jffs2_erase_block()
90 list_del(&jeb->list); in jffs2_erase_block()
91 list_add(&jeb->list, &c->erase_pending_list); in jffs2_erase_block()
119 jeb = list_entry(c->erase_complete_list.next, struct jffs2_eraseblock, list); in jffs2_erase_pending_blocks()
120 list_del(&jeb->list); in jffs2_erase_pending_blocks()
130 jeb = list_entry(c->erase_pending_list.next, struct jffs2_eraseblock, list); in jffs2_erase_pending_blocks()
132 list_del(&jeb->list); in jffs2_erase_pending_blocks()
140 list_add(&jeb->list, &c->erasing_list); in jffs2_erase_pending_blocks()
[all …]
|
| H A D | compr.c | 20 /* Available compressors are on this list */
70 list_for_each_entry(this, &jffs2_compressor_list, list) { in jffs2_compress()
97 list_for_each_entry(this, &jffs2_compressor_list, list) { in jffs2_compress()
189 list_for_each_entry(this, &jffs2_compressor_list, list) { in jffs2_decompress()
232 list_for_each_entry(this, &jffs2_compressor_list, list) { in jffs2_register_compressor()
234 list_add(&comp->list, this->list.prev); in jffs2_register_compressor()
238 list_add_tail(&comp->list, &jffs2_compressor_list); in jffs2_register_compressor()
240 D2(list_for_each_entry(this, &jffs2_compressor_list, list) { in jffs2_register_compressor()
262 list_del(&comp->list); in jffs2_unregister_compressor()
264 D2(list_for_each_entry(this, &jffs2_compressor_list, list) { in jffs2_unregister_compressor()
[all …]
|
| /nrf52832-nimble/rt-thread/tools/kconfig-frontends/frontends/qconf/ |
| H A D | qconf.cc | 63 * Reads a list of integer values from the application settings.
86 * Writes a list of integer values to the application settings.
114 ConfigList* list; in updateMenu() local
121 list = listView(); in updateMenu()
123 setPixmap(promptColIdx, list->menuBackPix); in updateMenu()
134 if (list->mode == singleMode || list->mode == symbolMode) { in updateMenu()
138 if (sym && list->rootEntry == menu) in updateMenu()
140 setPixmap(promptColIdx, list->menuPix); in updateMenu()
164 if (!sym_is_changable(sym) && list->optMode == normalOpt) { in updateMenu()
175 setPixmap(promptColIdx, list->choiceYesPix); in updateMenu()
[all …]
|
| /nrf52832-nimble/rt-thread/components/dfs/filesystems/uffs/src/uffs/ |
| H A D | uffs_tree.c | 307 node->u.list.block = block; in _BuildValidTreeNode()
318 //we use node as erased node to insert to erased list in _BuildValidTreeNode()
322 node->u.list.block = block_save; in _BuildValidTreeNode()
396 node->u.list.block = bc->block; in _BuildValidTreeNode()
496 node->u.list.block = block_lt; in _BuildTreeStepOne()
516 node->u.list.block = block_lt; in _BuildTreeStepOne()
597 /** add a node into suspend list */
600 node->u.list.next = dev->tree.suspend; in uffs_TreeSuspendAdd()
601 node->u.list.prev = NULL; in uffs_TreeSuspendAdd()
604 dev->tree.suspend->u.list.prev = node; in uffs_TreeSuspendAdd()
[all …]
|
| H A D | uffs_badblock.c | 54 * and put the node to bad block list.
65 // and put it into bad block list in uffs_BadBlockProcess()
76 * \brief process bad block and put the node in 'suspend' list.
86 // and put it into bad block list in uffs_BadBlockProcessSuspend()
175 ret = uffs_FlashWritePageCombine(dev, good->u.list.block, i, buf, &newTag); in uffs_BadBlockRecover()
197 bad->u.dir.block = good->u.list.block; in uffs_BadBlockRecover()
201 bad->u.file.block = good->u.list.block; in uffs_BadBlockRecover()
205 bad->u.data.block = good->u.list.block; in uffs_BadBlockRecover()
212 dev->bad.block, good->u.list.block, type); in uffs_BadBlockRecover()
215 good->u.list.block = dev->bad.block; in uffs_BadBlockRecover()
[all …]
|
| /nrf52832-nimble/rt-thread/src/ |
| H A D | signal.c | 37 struct rt_slist_node list; member
278 if (si_prev) si_prev->list.next = si_node->list.next; in rt_signal_wait()
279 else tid->si_list = si_node->list.next; in rt_signal_wait()
288 si_node = (void *)rt_slist_entry(si_node->list.next, struct siginfo_node, list); in rt_signal_wait()
319 /* remove this sig info node from list */ in rt_thread_handle_sig()
320 if (si_node->list.next == RT_NULL) in rt_thread_handle_sig()
323 … tid->si_list = (void *)rt_slist_entry(si_node->list.next, struct siginfo_node, list); in rt_thread_handle_sig()
387 LOG_D("free signal info list"); in rt_thread_free_sig()
388 node = &(si_list->list); in rt_thread_free_sig()
391 si_node = rt_slist_entry(node, struct siginfo_node, list); in rt_thread_free_sig()
[all …]
|
| H A D | memheap.c | 48 * which is prevents block merging across list
67 /* initialize the free list header */ in rt_memheap_init()
76 /* set the free list to free list header */ in rt_memheap_init()
92 /* block list header */ in rt_memheap_init()
95 /* place the big memory block to free list */ in rt_memheap_init()
110 /* not in free list */ in rt_memheap_init()
117 ("memory heap: start addr 0x%08x, size %d, free list header 0x%08x\n", in rt_memheap_init()
157 /* search on free list */ in rt_memheap_alloc()
209 /* break down the block list */ in rt_memheap_alloc()
215 /* remove header ptr from free list */ in rt_memheap_alloc()
[all …]
|
| H A D | timer.c | 24 /* hard timer list */
36 /* soft timer list */
100 /* initialize timer list */ in _rt_timer_init()
146 rt_list_t *list; in rt_timer_dump() local
148 for (list = timer_heads[RT_TIMER_SKIP_LIST_LEVEL - 1].next; in rt_timer_dump()
149 list != &timer_heads[RT_TIMER_SKIP_LIST_LEVEL - 1]; in rt_timer_dump()
150 list = list->next) in rt_timer_dump()
152 struct rt_timer *timer = rt_list_entry(list, in rt_timer_dump()
311 /* remove timer from list */ in rt_timer_start()
332 /* insert timer to soft timer list */ in rt_timer_start()
[all …]
|
| /nrf52832-nimble/rt-thread/components/net/lwip-1.4.1/src/include/lwip/ |
| H A D | snmp_msg.h | 14 * this list of conditions and the following disclaimer.
16 * this list of conditions and the following disclaimer in the documentation
81 /* next pointer, NULL for last in list */
83 /* previous pointer, NULL for first in list */
116 /* number of variable bindings in list */
118 /* encoding varbind-list seq length length */
120 /* encoding varbind-list seq length */
248 /* index into input variable binding list */
250 /* ptr into input variable binding list */
252 /* list of variable bindings from input */
[all …]
|
| /nrf52832-nimble/rt-thread/components/drivers/can/ |
| H A D | can.c | 65 … if (hdr >= 0 && can->hdr && hdr < can->config.maxhdr && !rt_list_isempty(&can->hdr[hdr].list)) in _can_int_rx()
67 listmsg = rt_list_entry(can->hdr[hdr].list.next, struct rt_can_msg_list, hdrlist); in _can_int_rx()
68 rt_list_remove(&listmsg->list); in _can_int_rx()
81 listmsg = rt_list_entry(rx_fifo->uselist.next, struct rt_can_msg_list, list); in _can_int_rx()
82 rt_list_remove(&listmsg->list); in _can_int_rx()
107 rt_list_insert_before(&rx_fifo->freelist, &listmsg->list); in _can_int_rx()
145 tx_tosnd = rt_list_entry(tx_fifo->freelist.next, struct rt_can_sndbxinx_list, list); in _can_int_tx()
147 rt_list_remove(&tx_tosnd->list); in _can_int_tx()
156 rt_list_insert_after(&tx_fifo->freelist, &tx_tosnd->list); in _can_int_tx()
167 if (!rt_list_isempty(&tx_tosnd->list)) in _can_int_tx()
[all …]
|
| /nrf52832-nimble/rt-thread/components/drivers/include/drivers/ |
| H A D | spi.h | 244 * This function transfers a message list to the SPI device.
247 * @param message the message list to be transmitted to SPI device
249 * @return RT_NULL if transmits message list successfully,
290 * This function appends a message to the SPI message list.
292 * @param list the SPI message list header.
293 * @param message the message pointer to be appended to the message list.
295 rt_inline void rt_spi_message_append(struct rt_spi_message *list, in rt_spi_message_append() argument
298 RT_ASSERT(list != RT_NULL); in rt_spi_message_append()
302 while (list->next != RT_NULL) in rt_spi_message_append()
304 list = list->next; in rt_spi_message_append()
[all …]
|
| /nrf52832-nimble/rt-thread/components/lwp/ |
| H A D | lwp_memheap.c | 43 * which is prevents block merging across list
60 /* initialize the free list header */ in rt_lwp_memheap_init()
69 /* set the free list to free list header */ in rt_lwp_memheap_init()
85 /* block list header */ in rt_lwp_memheap_init()
88 /* place the big memory block to free list */ in rt_lwp_memheap_init()
103 /* not in free list */ in rt_lwp_memheap_init()
110 ("memory heap: start addr 0x%08x, size %d, free list header 0x%08x\n", in rt_lwp_memheap_init()
134 /* search on free list */ in rt_lwp_memheap_alloc()
186 /* break down the block list */ in rt_lwp_memheap_alloc()
192 /* remove header ptr from free list */ in rt_lwp_memheap_alloc()
[all …]
|
| /nrf52832-nimble/rt-thread/components/drivers/src/ |
| H A D | workqueue.c | 67 work = rt_list_entry(queue->work_list.next, struct rt_work, list); in _workqueue_thread_entry()
68 rt_list_remove(&(work->list)); in _workqueue_thread_entry()
91 /* initialize work list */ in rt_workqueue_create()
134 rt_list_remove(&(work->list)); in rt_workqueue_dowork()
136 rt_list_insert_after(queue->work_list.prev, &(work->list)); in rt_workqueue_dowork()
164 rt_list_remove(&(work->list)); in rt_workqueue_critical_work()
166 rt_list_insert_after(queue->work_list.prev, &(work->list)); in rt_workqueue_critical_work()
192 rt_list_remove(&(work->list)); in rt_workqueue_cancel_work()
213 rt_list_remove(&(work->list)); in rt_workqueue_cancel_work_sync()
|
| /nrf52832-nimble/rt-thread/components/dfs/filesystems/ramfs/ |
| H A D | dfs_ramfs.c | 79 for (dirent = rt_list_entry(ramfs->root.list.next, struct ramfs_dirent, list); in dfs_ramfs_lookup()
81 dirent = rt_list_entry(dirent->list.next, struct ramfs_dirent, list)) in dfs_ramfs_lookup()
233 rt_list_init(&(dirent->list)); in dfs_ramfs_open()
239 rt_list_insert_after(&(ramfs->root.list), &(dirent->list)); in dfs_ramfs_open()
318 for (dirent = rt_list_entry(dirent->list.next, struct ramfs_dirent, list); in dfs_ramfs_getdents()
320 dirent = rt_list_entry(dirent->list.next, struct ramfs_dirent, list)) in dfs_ramfs_getdents()
352 rt_list_remove(&(dirent->list)); in dfs_ramfs_unlink()
446 rt_list_init(&(ramfs->root.list)); in dfs_ramfs_create()
|
| /nrf52832-nimble/rt-thread/tools/ |
| H A D | pymenuconfig.py | 42 As with most command-line tools list of options can be obtained with '--help':
593 self.list = tk.Listbox(
600 self.list['foreground'] = 'Blue'
601 self.list['background'] = 'Gray95'
603 self.list['selectbackground'] = self.list['background']
604 self.list['selectforeground'] = self.list['foreground']
605 self.list.pack(fill=tk.BOTH, expand=1, padx=20, ipadx=2)
639 self.list['takefocus'] = 1
640 self.list.focus_set()
672 self.list.itemconfig(idx, {'bg' : self.list['foreground']})
[all …]
|
| /nrf52832-nimble/packages/NimBLE-latest/nimble/controller/src/ |
| H A D | ble_ll_resolv.c | 54 * Called to determine if a change is allowed to the resolving list at this
55 * time. We are not allowed to modify the resolving list if address translation
121 * is used to regenerate local and peers RPA's in the resolving list.
173 * Clear the resolving list
185 /* Sets total on list to 0. Clears HW resolve list */ in ble_ll_resolv_list_clr()
193 * Read the size of the resolving list. This is the total number of resolving
194 * list entries allowed by the controller.
209 * Used to determine if the device is on the resolving list.
214 * @return int 0: device is not on resolving list; otherwise the return value
215 * is the 'position' of the device in the resolving list (the index of the
[all …]
|
| /nrf52832-nimble/rt-thread/components/dfs/filesystems/jffs2/kernel/linux/ |
| H A D | list.h | 49 /* Doubly linked list implementation to replace the GPL'd one used in
106 /* Is this list empty? */
108 list_empty( struct list_head *list ) in list_empty() argument
110 return ( list->next == list ); in list_empty()
114 list which has the name _member_ in that struct type, then given the
115 address of that list in the struct, _list_, this returns the address
121 /* list_for_each - using _ent_, iterate through list _list_ */
130 * items in a list* _list_ with it's head at _head_ and link _item_
147 /* EOF list.h */
|
| /nrf52832-nimble/rt-thread/components/net/uip/doc/ |
| H A D | doxygen.sty | 15 {\begin{list}{}{
21 {\end{list}}
44 {\begin{list}{}
53 {\end{list}}
55 {\begin{list}{}{\setlength{\leftmargin}{0.5cm}}
57 {\unskip\end{list}}
|