| /Zephyr-latest/arch/xtensa/include/ |
| D | xtensa_mpu_priv.h | 25 * @name Bit shifts and masks for MPU entry registers.
31 * Number of bits to shift for start address in MPU entry register.
33 * This is only used for aligning the value to the MPU entry register,
39 * Bit mask of start address in MPU entry register.
41 * This is only used for aligning the value to the MPU entry register,
46 /** Number of bits to shift for enable bit in MPU entry register. */
49 /** Bit mask of enable bit in MPU entry register. */
52 /** Number of bits to shift for lock bit in MPU entry register. */
55 /** Bit mask of lock bit in MPU entry register. */
58 /** Number of bits to shift for access rights in MPU entry register. */
[all …]
|
| D | xtensa_mmu_priv.h | 66 /** Construct a page table entry (PTE) */
177 * Find the PTE entry address of a given vaddr.
242 * @brief Invalidate a particular instruction TLB entry.
244 * @param entry Entry to be invalidated.
246 static ALWAYS_INLINE void xtensa_itlb_entry_invalidate(uint32_t entry) in xtensa_itlb_entry_invalidate() argument
249 : : "a" (entry)); in xtensa_itlb_entry_invalidate()
253 * @brief Synchronously invalidate of a particular instruction TLB entry.
255 * @param entry Entry to be invalidated.
257 static ALWAYS_INLINE void xtensa_itlb_entry_invalidate_sync(uint32_t entry) in xtensa_itlb_entry_invalidate_sync() argument
261 : : "a" (entry)); in xtensa_itlb_entry_invalidate_sync()
[all …]
|
| /Zephyr-latest/subsys/net/ip/ |
| D | pmtu.c | 40 struct net_pmtu_entry *entry = NULL; in get_pmtu_entry() local
52 entry = &pmtu_entries[i]; in get_pmtu_entry()
62 entry = &pmtu_entries[i]; in get_pmtu_entry()
75 return entry; in get_pmtu_entry()
80 struct net_pmtu_entry *entry = NULL; in get_free_pmtu_entry() local
91 entry = &pmtu_entries[i]; in get_free_pmtu_entry()
97 entry = &pmtu_entries[i]; in get_free_pmtu_entry()
104 return entry; in get_free_pmtu_entry()
107 static void update_pmtu_entry(struct net_pmtu_entry *entry, uint16_t mtu) in update_pmtu_entry() argument
111 if (entry->mtu != mtu) { in update_pmtu_entry()
[all …]
|
| D | route.h | 29 * @brief Next hop entry for a given route.
42 * @brief Route entry to a specific neighbor.
48 * The oldest one is the last entry in the list.
85 * @return Return route entry related to a given destination address, NULL
112 * @return Return created route entry, NULL if could not be created.
124 * @param entry Existing route entry.
128 int net_route_del(struct net_route_entry *entry);
144 * @param route Pointer to routing entry.
157 * @param entry Route entry to use.
161 struct in6_addr *net_route_get_nexthop(struct net_route_entry *entry);
[all …]
|
| D | pmtu.h | 19 /** PTMU destination cache entry */
31 /** Get PMTU entry for the given destination address
35 * @return PMTU entry if found, NULL otherwise
84 /** Update PMTU entry for the given destination address
86 * @param entry PMTU entry
92 int net_pmtu_update_entry(struct net_pmtu_entry *entry, uint16_t mtu);
94 static inline int net_pmtu_update_entry(struct net_pmtu_entry *entry, in net_pmtu_update_entry() argument
97 ARG_UNUSED(entry); in net_pmtu_update_entry()
108 * @param entry PMTU entry
111 typedef void (*net_pmtu_cb_t)(struct net_pmtu_entry *entry,
[all …]
|
| /Zephyr-latest/subsys/logging/ |
| D | log_cache.c | 16 #define LOG_CACHE_DBG_ENTRY(str, entry) \ argument
17 printk(str " entry(%p) id %p\n", entry, (void *)entry->id)
32 struct log_cache_entry *entry = config->buf; in log_cache_init() local
34 /* Ensure the cache has at least one entry */ in log_cache_init()
41 sys_slist_append(&cache->idle, &entry->node); in log_cache_init()
42 entry = (struct log_cache_entry *)((uintptr_t)entry + entry_size); in log_cache_init()
56 struct log_cache_entry *entry; in log_cache_get() local
60 SYS_SLIST_FOR_EACH_CONTAINER(&cache->active, entry, node) { in log_cache_get()
61 LOG_CACHE_DBG_ENTRY("checking", entry); in log_cache_get()
62 if (cache->cmp(entry->id, id)) { in log_cache_get()
[all …]
|
| /Zephyr-latest/lib/hash/ |
| D | hash_map_sc.c | 25 static void sys_hashmap_sc_entry_init(struct sys_hashmap_sc_entry *entry, uint64_t key, in sys_hashmap_sc_entry_init() argument
28 entry->key = key; in sys_hashmap_sc_entry_init()
29 entry->value = value; in sys_hashmap_sc_entry_init()
30 sys_dnode_init(&entry->node); in sys_hashmap_sc_entry_init()
33 static void sys_hashmap_sc_insert_entry(struct sys_hashmap *map, struct sys_hashmap_sc_entry *entry) in sys_hashmap_sc_insert_entry() argument
36 uint32_t hash = map->hash_func(&entry->key, sizeof(entry->key)); in sys_hashmap_sc_insert_entry()
38 sys_dlist_append(&buckets[hash % map->data->n_buckets], &entry->node); in sys_hashmap_sc_insert_entry()
45 struct sys_hashmap_sc_entry *entry; in sys_hashmap_sc_insert_all() local
48 entry = CONTAINER_OF(sys_dlist_get(list), struct sys_hashmap_sc_entry, node); in sys_hashmap_sc_insert_all()
49 sys_hashmap_sc_insert_entry(map, entry); in sys_hashmap_sc_insert_all()
[all …]
|
| D | hash_map_oa_lp.c | 40 struct oalp_entry *entry = NULL; in sys_hashmap_oa_lp_find() local
49 entry = &buckets[j]; in sys_hashmap_oa_lp_find()
51 switch (entry->state) { in sys_hashmap_oa_lp_find()
53 if (used_ok && entry->key == key) { in sys_hashmap_oa_lp_find()
54 return entry; in sys_hashmap_oa_lp_find()
59 return entry; in sys_hashmap_oa_lp_find()
64 return entry; in sys_hashmap_oa_lp_find()
68 __ASSERT(false, "Invalid entry state. Memory has been corrupted"); in sys_hashmap_oa_lp_find()
80 struct oalp_entry *entry = NULL; in sys_hashmap_oa_lp_insert_no_rehash() local
83 entry = sys_hashmap_oa_lp_find(map, key, true, true, true); in sys_hashmap_oa_lp_insert_no_rehash()
[all …]
|
| /Zephyr-latest/tests/bluetooth/mesh/rpl/src/ |
| D | main.c | 160 static void call_rpl_check_on(int func, int cnt, struct test_rpl_entry *entry) in call_rpl_check_on() argument
166 recv_msg.ctx.addr = entry->src; in call_rpl_check_on()
167 recv_msg.seq = entry->seq; in call_rpl_check_on()
168 recv_msg.old_iv = entry->old_iv; in call_rpl_check_on()
258 /** Test that RPL accepts and stores a valid entry that was just deleted. The entry should be
266 /* Take the first entry with old_iv == true and simulate msg reception with same src in ZTEST()
267 * address and correct IVI after the entry was deleted. in ZTEST()
269 struct test_rpl_entry *entry = &test_vector[1]; in ZTEST() local
271 zassert_true(entry->old_iv); in ZTEST()
272 entry->old_iv = false; in ZTEST()
[all …]
|
| /Zephyr-latest/doc/services/storage/fcb/ |
| D | fcb.rst | 19 Entries in the flash contain the length of the entry, the data within
20 the entry, and checksum over the entry contents.
23 request space for the next entry, space is located at the end of the
24 used area. When you start reading, the first entry served is the
25 oldest entry in flash.
35 writing entry to flash completed ok. It will skip over entries which
41 To add an entry to circular buffer:
47 - Use :c:func:`flash_area_write` to write entry contents.
49 entry by calculating the checksum.
54 - Within callback function copy in data from the entry using
[all …]
|
| /Zephyr-latest/tests/net/lib/lwm2m/observation/src/ |
| D | lwm2m_observation.c | 50 struct lwm2m_obj_path_list *entry, *tmp; in assert_path_list_order() local
61 SYS_SLIST_FOR_EACH_CONTAINER_SAFE(lwm2m_path_list, entry, tmp, node) { in assert_path_list_order()
63 if (entry->path.level > prev->path.level) { in assert_path_list_order()
68 is_after = entry->path.obj_id >= prev->path.obj_id; in assert_path_list_order()
71 entry->path.obj_id == prev->path.obj_id) { in assert_path_list_order()
73 entry->path.obj_inst_id >= prev->path.obj_inst_id; in assert_path_list_order()
77 entry->path.obj_inst_id == prev->path.obj_inst_id) { in assert_path_list_order()
78 is_after = entry->path.res_id >= prev->path.res_id; in assert_path_list_order()
83 entry->path.res_id == prev->path.res_id) { in assert_path_list_order()
85 entry->path.res_inst_id >= prev->path.res_inst_id; in assert_path_list_order()
[all …]
|
| /Zephyr-latest/subsys/net/l2/ethernet/ |
| D | arp.c | 44 static void arp_entry_cleanup(struct arp_entry *entry, bool pending) in arp_entry_cleanup() argument
46 NET_DBG("entry %p", entry); in arp_entry_cleanup()
51 while (!k_fifo_is_empty(&entry->pending_queue)) { in arp_entry_cleanup()
52 pkt = k_fifo_get(&entry->pending_queue, K_FOREVER); in arp_entry_cleanup()
60 entry->iface = NULL; in arp_entry_cleanup()
62 (void)memset(&entry->ip, 0, sizeof(struct in_addr)); in arp_entry_cleanup()
63 (void)memset(&entry->eth, 0, sizeof(struct net_eth_addr)); in arp_entry_cleanup()
71 struct arp_entry *entry; in arp_entry_find() local
73 SYS_SLIST_FOR_EACH_CONTAINER(list, entry, node) { in arp_entry_find()
76 net_sprint_ipv4_addr(&entry->ip)); in arp_entry_find()
[all …]
|
| /Zephyr-latest/subsys/net/lib/prometheus/ |
| D | collector.c | 50 STRUCT_SECTION_FOREACH(prometheus_counter, entry) { in prometheus_get_counter_metric()
51 LOG_DBG("entry->name: %s", entry->base.name); in prometheus_get_counter_metric()
53 if (strncmp(entry->base.name, name, strlen(entry->base.name)) == 0) { in prometheus_get_counter_metric()
54 LOG_DBG("Counter found %s", entry->base.name); in prometheus_get_counter_metric()
55 return entry; in prometheus_get_counter_metric()
66 STRUCT_SECTION_FOREACH(prometheus_gauge, entry) { in prometheus_get_gauge_metric()
67 LOG_DBG("entry->name: %s", entry->base.name); in prometheus_get_gauge_metric()
69 if (strncmp(entry->base.name, name, strlen(entry->base.name)) == 0) { in prometheus_get_gauge_metric()
70 LOG_DBG("Counter found %s", entry->base.name); in prometheus_get_gauge_metric()
71 return entry; in prometheus_get_gauge_metric()
[all …]
|
| /Zephyr-latest/doc/_extensions/zephyr/ |
| D | manifest_projects_table.py | 101 entry = nodes.entry()
102 entry += nodes.paragraph(text="Project")
103 row += entry
104 entry = nodes.entry()
105 entry += nodes.paragraph(text="Revision")
106 row += entry
113 entry = nodes.entry()
114 entry += nodes.paragraph(text=project.name)
115 row += entry
116 entry = nodes.entry()
[all …]
|
| /Zephyr-latest/subsys/bluetooth/mesh/ |
| D | va.h | 7 /** Virtual address entry. */
18 * @param entry Pointer to a memory where a new or updated entry will be stored, or NULL.
20 * @return STATUS_SUCCESS if entry is stored or updated, error code otherwise.
22 uint8_t bt_mesh_va_add(const uint8_t uuid[16], const struct bt_mesh_va **entry);
31 * @return STATUS_SUCCESS if entry is deleted, error code otherwise.
35 /** @brief Find virtual address entry by Label UUID.
41 * @return Pointer to a valid entry, NULL otherwise.
57 * @param idx Index of virtual address entry.
59 * @return Pointer to a valid Label UUID, or NULL if entry is not found.
63 /** @brief Get virtual address entry index by Label UUID.
[all …]
|
| D | brg_cfg_srv.c | 55 struct bt_mesh_brg_cfg_table_entry *entry) in bridging_table_status_send() argument
61 net_buf_simple_add_u8(&msg, entry->directions); in bridging_table_status_send()
62 key_idx_pack_pair(&msg, entry->net_idx1, entry->net_idx2); in bridging_table_status_send()
63 net_buf_simple_add_le16(&msg, entry->addr1); in bridging_table_status_send()
64 net_buf_simple_add_le16(&msg, entry->addr2); in bridging_table_status_send()
79 struct bt_mesh_brg_cfg_table_entry entry; in bridging_table_add() local
83 entry.directions = net_buf_simple_pull_u8(buf); in bridging_table_add()
84 key_idx_unpack_pair(buf, &entry.net_idx1, &entry.net_idx2); in bridging_table_add()
85 entry.addr1 = net_buf_simple_pull_le16(buf); in bridging_table_add()
86 entry.addr2 = net_buf_simple_pull_le16(buf); in bridging_table_add()
[all …]
|
| D | solicitation.c | 59 struct srpl_entry *entry; in srpl_entry_save() local
66 entry = srpl_find_by_addr(ssrc); in srpl_entry_save()
67 if (entry) { in srpl_entry_save()
68 if (entry->sseq >= sseq) { in srpl_entry_save()
74 entry = srpl_find_by_addr(BT_MESH_ADDR_UNASSIGNED); in srpl_entry_save()
75 if (!entry) { in srpl_entry_save()
83 entry->sseq = sseq; in srpl_entry_save()
84 entry->ssrc = ssrc; in srpl_entry_save()
86 LOG_DBG("Added: SSRC %d SSEQ %d to SRPL", entry->ssrc, entry->sseq); in srpl_entry_save()
89 atomic_set_bit(store, entry - &sol_pdu_rpl[0]); in srpl_entry_save()
[all …]
|
| D | rpl.c | 72 static void schedule_rpl_store(struct bt_mesh_rpl *entry, bool force) in schedule_rpl_store() argument
74 atomic_set_bit(store, rpl_idx(entry)); in schedule_rpl_store()
138 /* Until rpl reset is finished, entry with old_iv == false and in bt_mesh_rpl_check()
140 * reused. If such entry is reused, "store" bit will be set and in bt_mesh_rpl_check()
141 * the entry won't be removed. in bt_mesh_rpl_check()
270 struct bt_mesh_rpl *entry; in rpl_set() local
281 entry = bt_mesh_rpl_find(src); in rpl_set()
285 if (entry) { in rpl_set()
286 (void)memset(entry, 0, sizeof(*entry)); in rpl_set()
288 LOG_WRN("Unable to find RPL entry for 0x%04x", src); in rpl_set()
[all …]
|
| /Zephyr-latest/include/zephyr/stats/ |
| D | stats.h | 13 * each group consisting of a set of "entries". An entry corresponds to an
14 * individual counter. Each entry can optionally be named if the STATS_NAMES
30 * - STATS_SECT_ENTRY(): default statistic entry, 32-bits.
39 * Following the static entry declaration is the statistic names declaration.
106 * @brief Declares a 32-bit stat entry inside a group struct.
108 * @param var__ The name to assign to the entry.
113 * @brief Declares a 16-bit stat entry inside a group struct.
115 * @param var__ The name to assign to the entry.
120 * @brief Declares a 32-bit stat entry inside a group struct.
122 * @param var__ The name to assign to the entry.
[all …]
|
| /Zephyr-latest/subsys/input/ |
| D | input_double_tap.c | 35 struct double_tap_data_entry *entry = in double_tap_deferred() local
38 entry->first_tap = false; in double_tap_deferred()
45 struct double_tap_data_entry *entry; in double_tap_cb() local
62 entry = &cfg->entries[i]; in double_tap_cb()
65 if (entry->first_tap) { in double_tap_cb()
66 k_work_cancel_delayable(&entry->work); in double_tap_cb()
69 entry->first_tap = false; in double_tap_cb()
71 entry->first_tap = true; in double_tap_cb()
72 k_work_schedule(&entry->work, K_MSEC(cfg->double_tap_delay_ms)); in double_tap_cb()
87 struct double_tap_data_entry *entry = &cfg->entries[i]; in double_tap_init() local
[all …]
|
| /Zephyr-latest/arch/common/ |
| D | shared_irq.c | 22 const struct z_shared_isr_table_entry *entry; in z_shared_isr() local
25 entry = data; in z_shared_isr()
27 for (i = 0; i < entry->client_num; i++) { in z_shared_isr()
28 client = &entry->clients[i]; in z_shared_isr()
44 struct _isr_table_entry *entry; in z_isr_install() local
58 entry = &_sw_isr_table[table_idx]; in z_isr_install()
66 if (entry->isr == z_irq_spurious) { in z_isr_install()
70 entry->isr = routine; in z_isr_install()
71 entry->arg = param; in z_isr_install()
76 } else if (entry->isr != z_shared_isr) { in z_isr_install()
[all …]
|
| /Zephyr-latest/lib/posix/options/ |
| D | file_system_r.c | 21 int readdir_r(DIR *dirp, struct dirent *entry, struct dirent **result) in readdir_r() argument
31 if (entry == NULL) { in readdir_r()
47 strncpy(entry->d_name, de.name, MIN(sizeof(entry->d_name), sizeof(de.name))); in readdir_r()
48 entry->d_name[sizeof(entry->d_name) - 1] = '\0'; in readdir_r()
50 if (entry->d_name[0] == '\0') { in readdir_r()
55 *result = entry; in readdir_r()
|
| /Zephyr-latest/subsys/net/lib/wifi_credentials/ |
| D | wifi_credentials_internal.h | 12 * @brief Write entry to SSID cache.
15 * @param buf encoded settings entry
21 * @brief Clear entry in SSID cache.
28 * @brief Stores settings entry in flash.
31 * @param buf encoded settings entry
38 * @brief Deletes settings entry from flash.
46 * @brief Loads settings entry from flash.
49 * @param buf encoded settings entry
|
| /Zephyr-latest/subsys/shell/modules/kernel_service/thread/ |
| D | thread.c | 22 struct thread_entry *entry = user_data; in thread_valid_cb() local
24 if (cthread == entry->thread) { in thread_valid_cb()
25 entry->valid = true; in thread_valid_cb()
31 struct thread_entry entry = { in z_thread_is_valid() local
36 k_thread_foreach(thread_valid_cb, &entry); in z_thread_is_valid()
38 return entry.valid; in z_thread_is_valid()
|
| /Zephyr-latest/lib/os/ |
| D | thread_entry.c | 9 * @brief Thread entry
11 * This file provides the common thread entry function
26 * Common thread entry point function (used by all threads)
28 * This routine invokes the actual thread entry point function and passes
30 * if the entry point function ever returns.
35 FUNC_NORETURN void z_thread_entry(k_thread_entry_t entry, in z_thread_entry() argument
48 entry(p1, p2, p3); in z_thread_entry()
|
