| /Zephyr-Core-3.7.0/tests/bluetooth/qualification/ |
| D | ICS_Zephyr_Bluetooth_Controller_nrf52840dk_nrf52840.pts | 8 <item>
11 </item>
12 <item>
15 </item>
19 <item>
22 </item>
23 <item>
26 </item>
30 <item>
33 </item>
[all …]
|
| D | ICS_Zephyr_Bluetooth_Host.pts | 8 <item>
11 </item>
12 <item>
15 </item>
16 <item>
19 </item>
20 <item>
23 </item>
24 <item>
27 </item>
[all …]
|
| D | ICS_Zephyr_Bluetooth_Controller_nrf52dk_nrf52832.pts | 8 <item>
11 </item>
12 <item>
15 </item>
19 <item>
22 </item>
23 <item>
26 </item>
30 <item>
33 </item>
[all …]
|
| D | ICS_Zephyr_Bluetooth_Controller_nrf52833dk_nrf52833.pts | 8 <item>
11 </item>
12 <item>
15 </item>
19 <item>
22 </item>
23 <item>
26 </item>
30 <item>
33 </item>
[all …]
|
| /Zephyr-Core-3.7.0/tests/lib/p4workq/src/ |
| D | main.c | 24 struct k_p4wq_work item; member
35 static void stress_handler(struct k_p4wq_work *item);
37 static void stress_sub(struct test_item *item) in stress_sub() argument
43 item->item.priority = sys_rand32_get() % (K_LOWEST_THREAD_PRIO - 1); in stress_sub()
44 item->item.deadline = sys_rand32_get() % k_ms_to_cyc_ceil32(2); in stress_sub()
45 item->item.handler = stress_handler; in stress_sub()
46 item->running = false; in stress_sub()
47 item->active = true; in stress_sub()
49 k_p4wq_submit(&wq, &item->item); in stress_sub()
52 static void stress_handler(struct k_p4wq_work *item) in stress_handler() argument
[all …]
|
| /Zephyr-Core-3.7.0/include/zephyr/usb/class/ |
| D | hid.h | 70 /** HID Main item type */
72 /** HID Global item type */
74 /** HID Local item type */
77 /** HID Input item tag */
79 /** HID Output item tag */
81 /** HID Collection item tag */
83 /** HID Feature item tag */
85 /** HID End Collection item tag */
88 /** HID Usage Page item tag */
90 /** HID Logical Minimum item tag */
[all …]
|
| /Zephyr-Core-3.7.0/doc/kernel/services/threads/ |
| D | workqueue.rst | 11 work items in a first in, first out manner. Each work item is processed by
12 calling the function specified by the work item. A workqueue is typically
28 between each submitted work item, to prevent a cooperative workqueue from
40 caller need not be concerned that an item may be processing when the
46 * The ability to wait until a work item has completed or a queue has been
48 * Finer control of behavior when scheduling a delayable work item,
50 item is scheduled again.
51 * Safe handling of work item resubmission when the item is being processed
60 Work Item Lifecycle
63 Any number of **work items** can be defined. Each work item is referenced
[all …]
|
| /Zephyr-Core-3.7.0/doc/kernel/services/data_passing/ |
| D | message_queues.rst | 24 * A **data item size**, measured in bytes.
31 A data item can be **sent** to a message queue by a thread or an ISR.
32 The data item pointed at by the sending thread is copied to a waiting thread,
33 if one exists; otherwise the item is copied to the message queue's ring buffer,
35 *must* equal the message queue's data item size.
37 If a thread attempts to send a data item when the ring buffer is full,
43 A data item can be **received** from a message queue by a thread.
44 The data item is copied to the area specified by the receiving thread;
45 the size of the receiving area *must* equal the message queue's data item size.
47 If a thread attempts to receive a data item when the ring buffer is empty,
[all …]
|
| D | fifos.rst | 28 the first word of an item for use as a pointer to the next data item in
29 the queue. Consequently, a data item that holds N bytes of application
37 data queues. Any attempt to re-add a FIFO data item to a queue before
41 A data item may be **added** to a FIFO by a thread or an ISR.
42 The item is given directly to a waiting thread, if one exists;
43 otherwise the item is added to the FIFO's queue.
46 A data item may be **removed** from a FIFO by a thread. If the FIFO's queue
47 is empty a thread may choose to wait for a data item to be given.
49 When a data item is added, it is given to the highest priority thread
53 The kernel does allow an ISR to remove an item from a FIFO, however
[all …]
|
| D | lifos.rst | 28 the first word of an item for use as a pointer to the next data item in the
29 queue. Consequently, a data item that holds N bytes of application data
37 data queues. Any attempt to re-add a LIFO data item to a queue before
41 A data item may be **added** to a LIFO by a thread or an ISR.
42 The item is given directly to a waiting thread, if one exists;
43 otherwise the item is added to the LIFO's queue.
46 A data item may be **removed** from a LIFO by a thread. If the LIFO's queue
47 is empty a thread may choose to wait for a data item to be given.
49 When a data item is added, it is given to the highest priority thread
53 The kernel does allow an ISR to remove an item from a LIFO, however
[all …]
|
| /Zephyr-Core-3.7.0/lib/os/ |
| D | mpsc_pbuf.c | 118 static inline bool is_valid(union mpsc_pbuf_generic *item) in is_valid() argument
120 return item->hdr.valid; in is_valid()
123 static inline bool is_invalid(union mpsc_pbuf_generic *item) in is_invalid() argument
125 return !item->hdr.valid && !item->hdr.busy; in is_invalid()
140 static inline uint32_t get_skip(union mpsc_pbuf_generic *item) in get_skip() argument
142 if (item->hdr.busy && !item->hdr.valid) { in get_skip()
143 return item->skip.len; in get_skip()
180 union mpsc_pbuf_generic *item; in drop_item_locked() local
183 item = (union mpsc_pbuf_generic *)&buffer->buf[buffer->rd_idx]; in drop_item_locked()
184 skip_wlen = get_skip(item); in drop_item_locked()
[all …]
|
| D | p4wq.c | 19 static void set_prio(struct k_thread *th, struct k_p4wq_work *item) in set_prio() argument
22 th->base.prio = item->priority; in set_prio()
23 th->base.prio_deadline = item->deadline; in set_prio()
116 /* Must be called to regain ownership of the work item */
218 void k_p4wq_submit(struct k_p4wq *queue, struct k_p4wq_work *item) in k_p4wq_submit() argument
226 item->deadline += k_cycle_get_32(); in k_p4wq_submit()
229 if (item->thread == _current) { in k_p4wq_submit()
230 sys_dlist_remove(&item->dlnode); in k_p4wq_submit()
232 item->thread = NULL; in k_p4wq_submit()
234 k_sem_init(&item->done_sem, 0, 1); in k_p4wq_submit()
[all …]
|
| /Zephyr-Core-3.7.0/scripts/ci/ |
| D | version_mgr.py | 55 def handle_compat(item): argument
57 if isinstance(item, str):
58 item_compat['version'] = item
62 item_compat = item
68 for item in data:
69 item_compat = handle_compat(item)
120 found = list(filter(lambda item: (isinstance(item, dict) and
121 item.get('version') == version) or item == version, data))
130 item = {}
131 item['version'] = version
[all …]
|
| /Zephyr-Core-3.7.0/tests/kernel/workq/work_queue/ |
| D | README.txt | 37 - Running test item 1
41 - Running test item 2
45 - Running test item 3
46 - Running test item 4
47 - Running test item 5
48 - Running test item 6
69 - Running delayed test item 1
70 - Running delayed test item 2
71 - Running delayed test item 3
72 - Running delayed test item 4
[all …]
|
| /Zephyr-Core-3.7.0/subsys/shell/ |
| D | shell_history.c | 12 * new string. When new item is added then first it is compared if it is not
14 * buffer to store the new item, oldest one is removed until there is a room.
21 * chunks (when ring buffer wraps). To ensure that item is in a single chunk,
22 * item includes padding. If continues area for new item cannot be allocated
25 * If item does not fit at the end of the ring buffer padding is added: *
27 * | header | "history item" | | padding |
31 * If item fits in the ring buffer available space then there is no padding:
33 * | | header | "history item" | |
37 * As an optimization, the added padding is attributed to the preceding item
38 * instead of the current item. This way the padding will be freed one item
[all …]
|
| /Zephyr-Core-3.7.0/scripts/kconfig/ |
| D | guiconfig.py | 100 an item will jump to it. Item values can be toggled directly within the dialog.\
124 # The Label that shows the menu path of the selected item
134 # We can't use Node objects directly as Treeview item IDs, so we use their
215 # Select the first item and focus the Treeview, so that keyboard controls
581 item = node.item
583 values=item.name if item.__class__ is Symbol_ else "")
659 # If a selected/focused item is detached and later reattached, it stays
690 if node.list and not isinstance(node.item, Symbol):
691 if _tree.item(id(node), "open"):
713 if node.list and isinstance(node.item, Symbol):
[all …]
|
| /Zephyr-Core-3.7.0/tests/bluetooth/host/keys/bt_keys_store/src/ |
| D | main.c | 42 * - Key reference points to a valid item
43 * - Item ID is set to 0
56 /* Add custom item to the keys pool */ in ZTEST()
76 * - Key reference points to a valid item
77 * - Item ID is set to 0
90 /* Add custom item to the keys pool */ in ZTEST()
109 * - Key reference points to a valid item
110 * - Item ID isn't set to 0
123 /* Add custom item to the keys pool */ in ZTEST()
143 * - Key reference points to a valid item
[all …]
|
| /Zephyr-Core-3.7.0/drivers/clock_control/ |
| D | clock_control_renesas_cpg_mssr.c | 76 struct cpg_clk_info_table *item; in rcar_cpg_find_clk_info_by_module_id() local
81 item = bsearch((void *)uintptr_id, table, table_size, sizeof(*item), in rcar_cpg_find_clk_info_by_module_id()
83 if (!item) { in rcar_cpg_find_clk_info_by_module_id()
87 return item; in rcar_cpg_find_clk_info_by_module_id()
354 struct cpg_clk_info_table *item = data->clk_info_table[domain]; in rcar_cpg_build_clock_relationship() local
356 for (idx = 0; idx < data->clk_info_table_size[domain]; idx++, item++) { in rcar_cpg_build_clock_relationship()
360 if (prev_mod_id >= item->module) { in rcar_cpg_build_clock_relationship()
364 dev->name, item->domain, item->module); in rcar_cpg_build_clock_relationship()
368 prev_mod_id = item->module; in rcar_cpg_build_clock_relationship()
370 if (item->parent_id == RCAR_CPG_NONE) { in rcar_cpg_build_clock_relationship()
[all …]
|
| /Zephyr-Core-3.7.0/doc/connectivity/bluetooth/api/mesh/ |
| D | core.rst | 77 the change needs to be stored persistently, the stack schedules a work item.
78 The delay between scheduling the work item and submitting it to the workqueue
80 storing of data is scheduled, it can not be rescheduled until the work item is
84 item is submitted to the workqueue without the delay. If the work item was
87 The Replay Protection List uses the same work item to store RPL entries. If
92 :kconfig:option:`CONFIG_BT_MESH_RPL_STORE_TIMEOUT`, and the work item was
93 scheduled by the Replay Protection List, the work item will be rescheduled.
95 When the work item is running, the stack will store all pending configuration,
98 Work item execution context
102 context from which the work item is executed. This option is enabled by
[all …]
|
| /Zephyr-Core-3.7.0/include/zephyr/sys/ |
| D | p4wq.h | 22 * @brief P4 Queue Work Item
24 * User-populated struct representing a single work item. The
169 * @brief Submit work item to a P4 queue
171 * Submits the specified work item to the queue. The caller must have
181 * @note This call is a scheduling point, so if the submitted item (or
187 * @param item P4 work item to be submitted
189 void k_p4wq_submit(struct k_p4wq *queue, struct k_p4wq_work *item);
192 * @brief Cancel submitted P4 work item
194 * Cancels a previously-submitted work item and removes it from the
195 * queue. Returns true if the item was found in the queue and
[all …]
|
| D | ring_buffer.h | 89 * @brief Define and initialize an "item based" ring buffer.
91 * This macro establishes an "item based" ring buffer. Each data item is
113 * @brief Define and initialize an "item based" ring buffer.
125 * @brief Define and initialize a power-of-2 sized "item based" ring buffer.
127 * This macro establishes an "item based" ring buffer by specifying its
169 * @brief Initialize an "item based" ring buffer.
174 * Each data item is an array of 32-bit words (from zero to 1020 bytes in
224 * @brief Determine free space in an "item based" ring buffer.
272 * Ring buffer instance should not mix byte access and item access
300 * Ring buffer instance should not mix byte access and item access
[all …]
|
| /Zephyr-Core-3.7.0/tests/bluetooth/host/keys/bt_keys_clear/src/ |
| D | test_suite_bt_settings.c | 40 * - Key reference points to a valid item
41 * - Item ID is set to 0
55 /* Add custom item to the keys pool */ in ZTEST()
66 /* Ensure that item doesn't exist in the keys pool after calling bt_keys_clear() */ in ZTEST()
78 * - Key reference points to a valid item
79 * - Item ID isn't set to 0
93 /* Add custom item to the keys pool */ in ZTEST()
104 /* Ensure that item doesn't exist in the keys pool after calling bt_keys_clear() */ in ZTEST()
|
| D | main.c | 35 * - Key reference points to a valid item
54 /* Add custom item to the keys pool */ in ZTEST()
58 /* Ensure that item exists in the keys pool */ in ZTEST()
70 /* Ensure that item doesn't exist in the keys pool after calling bt_keys_clear() */ in ZTEST()
81 * - Key reference points to a valid item
100 /* Add custom item to the keys pool */ in ZTEST()
104 /* Ensure that item exists in the keys pool */ in ZTEST()
118 /* Ensure that item doesn't exist in the keys pool after calling bt_keys_clear() */ in ZTEST()
|
| /Zephyr-Core-3.7.0/tests/kernel/fifo/fifo_usage/src/ |
| D | main.c | 21 * Test Thread enters an item into fifo2, starts a Child Thread and
22 * extract an item from fifo1 once the item is there. The Child Thread
23 * will extract an item from fifo2 once the item is there and enter
24 * an item to fifo1. The flow of control goes from Test Thread to
176 * @details test Thread enters an item into fifo2, starts a Child Thread and
177 * extract an item from fifo1 once the item is there. The Child Thread
178 * will extract an item from fifo2 once the item is there and enter
179 * an item to fifo1. The flow of control goes from Test Thread to
193 /* Put item into fifo */ in ZTEST()
196 /* Get item from fifo */ in ZTEST()
[all …]
|
| /Zephyr-Core-3.7.0/include/zephyr/drivers/i3c/ |
| D | ibi.h | 151 * @brief Queue an IBI work item for future processing.
153 * This queues up an IBI work item in the IBI workqueue
160 * @param ibi_work Pointer to the IBI work item struct.
162 * @retval 0 If work item is successfully queued.
164 * store IBI work item.
179 * @retval 0 If work item is successfully queued.
181 * store IBI work item.
195 * @retval 0 If work item is successfully queued.
197 * store IBI work item.
211 * @retval 0 If work item is successfully queued.
[all …]
|
