| /nrf52832-nimble/rt-thread/components/net/uip/uip/ |
| H A D | uip-neighbor.c | 49 #define ENTRIES UIP_NEIGHBOR_CONF_ENTRIES macro
51 #define ENTRIES 8 macro
59 static struct neighbor_entry entries[ENTRIES]; variable
67 for(i = 0; i < ENTRIES; ++i) { in uip_neighbor_init()
68 entries[i].time = MAX_TIME; in uip_neighbor_init()
77 for(i = 0; i < ENTRIES; ++i) { in uip_neighbor_periodic()
78 if(entries[i].time < MAX_TIME) { in uip_neighbor_periodic()
79 entries[i].time++; in uip_neighbor_periodic()
97 for(i = 0; i < ENTRIES; ++i) { in uip_neighbor_add()
98 if(entries[i].time == MAX_TIME) { in uip_neighbor_add()
[all …]
|
| /nrf52832-nimble/packages/NimBLE-latest/nimble/host/test/src/ |
| H A D | ble_gatt_find_s_test.c | 33 uint16_t inc_handle; /* 0 indicates no more entries. */
75 struct ble_gatt_find_s_test_entry *entries) in ble_gatt_find_s_test_misc_verify_incs() argument
79 for (i = 0; entries[i].inc_handle != 0; i++) { in ble_gatt_find_s_test_misc_verify_incs()
81 entries[i].start_handle); in ble_gatt_find_s_test_misc_verify_incs()
83 entries[i].end_handle); in ble_gatt_find_s_test_misc_verify_incs()
85 entries[i].uuid) == 0); in ble_gatt_find_s_test_misc_verify_incs()
94 uint16_t conn_handle, struct ble_gatt_find_s_test_entry *entries) in ble_gatt_find_s_test_misc_rx_read_type() argument
105 for (i = 0; entries[i].inc_handle != 0; i++) { in ble_gatt_find_s_test_misc_rx_read_type()
110 if (entries[i].uuid->type != BLE_UUID_TYPE_16) { in ble_gatt_find_s_test_misc_rx_read_type()
121 put_le16(buf + off, entries[i].inc_handle); in ble_gatt_find_s_test_misc_rx_read_type()
[all …]
|
| H A D | ble_gatt_disc_s_test.c | 91 /* Can't fit any more entries. */ in ble_gatt_disc_s_test_misc_rx_all_rsp_once()
98 /* Can't fit any more entries. */ in ble_gatt_disc_s_test_misc_rx_all_rsp_once()
165 /* Can't fit any more entries. */ in ble_gatt_disc_s_test_misc_rx_uuid_rsp_once()
345 /*** 128-bit service; two entries. */ in TEST_CASE()
352 /*** 128-bit service; five entries. */ in TEST_CASE()
375 /*** 16-bit service; two entries. */ in TEST_CASE()
382 /*** 16-bit service; five entries. */ in TEST_CASE()
|
| H A D | ble_hs_test_util_hci.c | 528 struct ble_hs_test_util_hci_num_completed_pkts_entry *entries) in ble_hs_test_util_hci_rx_num_completed_pkts_event() argument
536 /* Count number of entries. */ in ble_hs_test_util_hci_rx_num_completed_pkts_event()
538 for (entry = entries; entry->handle_id != 0; entry++) { in ble_hs_test_util_hci_rx_num_completed_pkts_event()
548 put_le16(buf + off, entries[i].handle_id); in ble_hs_test_util_hci_rx_num_completed_pkts_event()
552 put_le16(buf + off, entries[i].num_pkts); in ble_hs_test_util_hci_rx_num_completed_pkts_event()
|
| /nrf52832-nimble/rt-thread/components/net/uip/doc/html/ |
| H A D | a00197.html | 69 …049 <span class="preprocessor"></span><span class="preprocessor">#define ENTRIES UIP_NEIGHBOR_CONF…
71 …tml#5f2e1fcf0055d20ce17664b1027bb9eb">00051</a> <span class="preprocessor">#define ENTRIES 8</span>
79 …word">struct </span>neighbor_entry entries[<a class="code" href="a00131.html#5f2e1fcf0055d20ce1766…
87 …= 0; i < <a class="code" href="a00131.html#5f2e1fcf0055d20ce17664b1027bb9eb">ENTRIES</a>; ++i) {
88 <a name="l00068"></a>00068 entries[i].time = <a class="code" href="a00131.html#5320d4457a472d88…
97 …= 0; i < <a class="code" href="a00131.html#5f2e1fcf0055d20ce17664b1027bb9eb">ENTRIES</a>; ++i) {
98 <a name="l00078"></a>00078 <span class="keywordflow">if</span>(entries[i].time < <a class="c…
99 <a name="l00079"></a>00079 entries[i].time++;
117 …= 0; i < <a class="code" href="a00131.html#5f2e1fcf0055d20ce17664b1027bb9eb">ENTRIES</a>; ++i) {
118 <a name="l00098"></a>00098 <span class="keywordflow">if</span>(entries[i].time == <a class="cod…
[all …]
|
| /nrf52832-nimble/rt-thread/components/dfs/filesystems/jffs2/cyg/compress/src/ |
| H A D | algorithm.txt | 99 in all those entries that start with that symbol's bits. For example, if the
105 entries as needed. The idea is that most of the time the symbol will be short
119 more time filling in duplicate symbol entries than you do actually decoding.
146 Let's make the first table three bits long (eight entries):
181 So what we have here are three tables with a total of 20 entries that had to
182 be constructed. That's compared to 64 entries for a single table. Or
183 compared to 16 entries for a Huffman tree (six two entry tables and one four
|
| H A D | inftrees.c | 47 unsigned used; /* code entries in table used */
50 unsigned fill; /* index for replicating entries */
88 This routine assumes, but does not check, that all of the entries in
155 fill the table with replicated entries.
168 used keeps track of how many table entries have been allocated from the
208 used = 1U << root; /* use root table entries */
215 /* process all codes and make table entries */
296 drops back to the root table to fill in any remaining entries there.
|
| /nrf52832-nimble/packages/NimBLE-latest/nimble/host/src/ |
| H A D | ble_store_util.c | 103 * Deletes all entries from the store that are attached to the specified peer
104 * address. This function deletes security entries and CCCD records.
106 * @param peer_id_addr Entries with this peer address get deleted.
142 * Deletes all entries from the store that match the specified key.
145 * @param key Entries matching this key get deleted.
|
| /nrf52832-nimble/rt-thread/tools/kconfig-frontends/libs/parser/ |
| H A D | list.h | 76 * Insert a new entry between two known consecutive entries.
79 * the prev/next entries already!
105 * Delete a list entry by making the prev/next entries
109 * the prev/next entries already!
|
| /nrf52832-nimble/rt-thread/tools/kconfig-frontends/docs/ |
| H A D | kconfig-language.txt | 24 Menu entries
27 Most entries define a config option; all other entries help to organize
149 entries. Default value of "visible" is true.
171 This declares a list of default entries which can be used when
248 All entries within the "menu" ... "endmenu" block become a submenu of
279 The configuration file describes a series of menu entries, where every
358 selected, a tristate choice also allows any number of config entries
367 then you may define the same choice (ie. with the same entries) in another
397 to all enclosed menu entries.
|
| /nrf52832-nimble/rt-thread/components/net/lwip-2.0.2/src/core/ipv4/ |
| H A D | etharp.c | 143 * Free a complete queue of etharp entries
168 /** Clean up ARP table entries */
193 * Clears expired entries in the ARP table.
196 * in order to expire entries in the ARP table.
204 /* remove expired entries from the ARP table */ in etharp_tmr()
219 /* clean up entries that have just been expired */ in etharp_tmr()
246 * In all cases, attempt to create new entries from an empty entry. If no
247 * empty entries are available and ETHARP_FLAG_TRY_HARD flag is set, recycle
248 * old entries. Heuristic choose the least important entry for recycling.
282 * until 5 matches, or all entries are searched for. in etharp_find_entry()
[all …]
|
| /nrf52832-nimble/rt-thread/components/net/lwip-2.1.0/src/core/ipv4/ |
| H A D | etharp.c | 142 * Free a complete queue of etharp entries
166 /** Clean up ARP table entries */
191 * Clears expired entries in the ARP table.
194 * in order to expire entries in the ARP table.
202 /* remove expired entries from the ARP table */ in etharp_tmr()
217 /* clean up entries that have just been expired */ in etharp_tmr()
244 * In all cases, attempt to create new entries from an empty entry. If no
245 * empty entries are available and ETHARP_FLAG_TRY_HARD flag is set, recycle
246 * old entries. Heuristic choose the least important entry for recycling.
280 * until 5 matches, or all entries are searched for. in etharp_find_entry()
[all …]
|
| /nrf52832-nimble/rt-thread/components/net/lwip-1.4.1/test/unit/etharp/ |
| H A D | test_etharp.c | 27 /* call etharp_tmr often enough to have all entries cleaned */ in etharp_remove_all()
158 /* fill ARP-table with dynamic entries */ in START_TEST()
190 /* fill ARP-table with dynamic entries */ in START_TEST()
233 /* check that static entries don't time out */ in START_TEST()
|
| /nrf52832-nimble/rt-thread/components/net/lwip-2.0.2/src/core/ |
| H A D | dns.c | 411 /* Dynamic: copy entries from DNS_LOCAL_HOSTLIST_INIT to list */ in dns_init_local()
440 * @return the number of entries in the local host-list
520 * Remove all entries from the local host-list for a specific hostname
523 * @param hostname hostname for which entries shall be removed from the local
525 * @param addr address for which entries shall be removed from the local host-list
526 * @return the number of removed entries
916 * entries for the given hostname. If there are any, their found callback will
1004 * - send out query for new entries
1005 * - retry old pending entries on timeout (also with different servers)
1006 * - remove completed entries from the table if their TTL has expired
[all …]
|
| /nrf52832-nimble/rt-thread/components/net/lwip-2.1.0/test/unit/etharp/ |
| H A D | test_etharp.c | 29 /* call etharp_tmr often enough to have all entries cleaned */ in etharp_remove_all()
162 /* fill ARP-table with dynamic entries */ in START_TEST()
197 /* fill ARP-table with dynamic entries */ in START_TEST()
243 /* check that static entries don't time out */ in START_TEST()
|
| /nrf52832-nimble/rt-thread/components/net/lwip-2.0.2/test/unit/etharp/ |
| H A D | test_etharp.c | 28 /* call etharp_tmr often enough to have all entries cleaned */ in etharp_remove_all()
159 /* fill ARP-table with dynamic entries */ in START_TEST()
194 /* fill ARP-table with dynamic entries */ in START_TEST()
240 /* check that static entries don't time out */ in START_TEST()
|
| /nrf52832-nimble/rt-thread/components/net/lwip-1.4.1/src/netif/ |
| H A D | etharp.c | 150 * Free a complete queue of etharp entries
175 /** Clean up ARP table entries */
200 * Clears expired entries in the ARP table.
203 * in order to expire entries in the ARP table.
211 /* remove expired entries from the ARP table */ in etharp_tmr()
226 /* clean up entries that have just been expired */ in etharp_tmr()
254 * In all cases, attempt to create new entries from an empty entry. If no
255 * empty entries are available and ETHARP_FLAG_TRY_HARD flag is set, recycle
256 * old entries. Heuristic choose the least important entry for recycling.
288 * until 5 matches, or all entries are searched for. in etharp_find_entry()
[all …]
|
| /nrf52832-nimble/rt-thread/components/net/lwip-2.1.0/src/core/ |
| H A D | dns.c | 408 /* Dynamic: copy entries from DNS_LOCAL_HOSTLIST_INIT to list */ in dns_init_local()
437 * @return the number of entries in the local host-list
517 * Remove all entries from the local host-list for a specific hostname
520 * @param hostname hostname for which entries shall be removed from the local
522 * @param addr address for which entries shall be removed from the local host-list
523 * @return the number of removed entries
935 * entries for the given hostname. If there are any, their found callback will
1040 * - send out query for new entries
1041 * - retry old pending entries on timeout (also with different servers)
1042 * - remove completed entries from the table if their TTL has expired
[all …]
|
| /nrf52832-nimble/rt-thread/components/net/lwip-1.4.1/src/core/ |
| H A D | dns.c | 318 /* Dynamic: copy entries from DNS_LOCAL_HOSTLIST_INIT to list */ in dns_init_local()
370 /** Remove all entries from the local host-list for a specific hostname
373 * @param hostname hostname for which entries shall be removed from the local
375 * @param addr address for which entries shall be removed from the local host-list
376 * @return the number of removed entries
629 * - send out query for new entries
630 * - retry old pending entries on timeout (also with different servers)
631 * - remove completed entries from the table if their TTL has expired
715 * Call dns_check_entry for each entry in dns_table - check all entries.
888 LWIP_DEBUGF(DNS_DEBUG, ("dns_enqueue: \"%s\": DNS entries table is full\n", name)); in dns_enqueue()
|
| /nrf52832-nimble/rt-thread/components/dfs/filesystems/uffs/src/uffs/ |
| H A D | uffs_mtb.c | 50 static struct uffs_MountTableEntrySt *m_head = NULL; // list of mounted entries
51 static struct uffs_MountTableEntrySt *m_free_head = NULL; // list of unmounted entries
53 /** Return mounted entries header */
59 /** Return unmounted entries header */
|
| /nrf52832-nimble/packages/NimBLE-latest/nimble/drivers/nrf52/src/ |
| H A D | ble_hw.c | 41 /* We use this to keep track of which entries are set to valid addresses */
50 /* The NRF51 supports up to 16 IRK entries */
60 /* Current number of IRK entries */
467 * allowable entries in the HW. Configuration options may limit this.
|
| /nrf52832-nimble/packages/NimBLE-latest/nimble/drivers/nrf51/src/ |
| H A D | ble_hw.c | 35 /* We use this to keep track of which entries are set to valid addresses */
44 /* The NRF51 supports up to 16 IRK entries */
54 /* Current number of IRK entries */
457 * allowable entries in the HW. Configuration options may limit this.
|
| /nrf52832-nimble/rt-thread/components/dfs/filesystems/uffs/src/inc/uffs/ |
| H A D | uffs_find.h | 51 int step; //!< step: 0 - working on dir entries,
52 // 1 - working on file entries,
|
| /nrf52832-nimble/packages/NimBLE-latest/nimble/controller/src/ |
| H A D | ble_ll_whitelist.c | 83 /* Set the number of entries to 0 */ in ble_ll_whitelist_clear()
99 * entries allowed by the controller.
194 /* Check if we have any open entries */ in ble_ll_whitelist_add()
|
| /nrf52832-nimble/rt-thread/components/net/lwip-2.1.0/src/netif/ |
| H A D | bridgeif.c | 55 * and FDB entries)
56 …r a bridge MAC address 00-01-02-03-04-05, 2 bridge ports, 1024 FDB entries + 16 static MAC entries:
71 * - compact static FDB entries (instead of walking the whole array)
73 * - add FDB change callback (when learning or dropping auto-learned entries)
201 /* first check for static entries */ in bridgeif_find_dst_ports()
|