| /nrf52832-nimble/nordic/nrfx/soc/ |
| H A D | nrfx_atomic.h | 64 * @brief Function for storing a value to an atomic object and returning its previous value.
69 * @return Previous value stored in the atomic object.
85 * and returning its previous value.
90 * @return Previous value stored in the atomic object.
107 * and returning its previous value.
112 * @return Previous value stored in the atomic object.
129 * and returning its previous value.
134 * @return Previous value stored in the atomic object.
151 * and returning its previous value.
156 * @return Previous value stored in the atomic object.
[all …]
|
| /nrf52832-nimble/packages/NimBLE-latest/nimble/host/mesh/src/ |
| H A D | atomic.h | 56 * @return Previous value of @a target.
72 * @return Previous value of @a target.
88 * @return Previous value of @a target.
104 * @return Previous value of @a target.
133 * the previous value of @a target.
138 * @return Previous value of @a target.
145 * writes value into *ptr, and returns the previous contents of *ptr. in atomic_set()
154 * This routine atomically sets @a target to zero and returns its previous
159 * @return Previous value of @a target.
177 * @return Previous value of @a target.
[all …]
|
| H A D | net.h | 127 u16_t frnd; /* Previous Friend's address */
183 /* Previous Friend of this LPN */
|
| /nrf52832-nimble/nordic/nrfx/templates/ |
| H A D | nrfx_glue.h | 169 * @brief Macro for storing a value to an atomic object and returning its previous value.
174 * @return Previous value of the atomic object.
179 …* @brief Macro for running a bitwise OR operation on an atomic object and returning its previous v…
184 * @return Previous value of the atomic object.
190 * and returning its previous value.
195 * @return Previous value of the atomic object.
201 * and returning its previous value.
206 * @return Previous value of the atomic object.
212 * and returning its previous value.
217 * @return Previous value of the atomic object.
[all …]
|
| /nrf52832-nimble/rt-thread/components/net/lwip-2.1.0/src/core/ipv4/ |
| H A D | ip4_frag.c | 160 * @param prev the previous datagram in the linked list
252 /* older than the previous oldest */ in ip_reass_remove_oldest_datagram()
285 /* No matching previous fragment found, allocate a new reassdata struct */ in ip_reass_enqueue_new_datagram()
389 /* fragment overlaps with previous or following, throw away */ in ip_reass_chain_frag_into_datagram_and_validate()
396 * and the previous fragment */ in ip_reass_chain_frag_into_datagram_and_validate()
423 * and the previous fragment */ in ip_reass_chain_frag_into_datagram_and_validate()
446 LWIP_ASSERT("no previous fragment, this must be the first fragment!", in ip_reass_chain_frag_into_datagram_and_validate()
553 * remembering the previous in the queue for later dequeueing. */ in ip4_reass()
559 LWIP_DEBUGF(IP_REASS_DEBUG, ("ip4_reass: matching previous fragment ID=%"X16_F"\n", in ip4_reass()
651 /* find the previous entry in the linked list */ in ip4_reass()
|
| /nrf52832-nimble/rt-thread/components/dfs/filesystems/jffs2/cyg/compress/src/ |
| H A D | deflate.h | 105 int last_flush; /* value of flush param for previous deflate call */
154 IPos prev_match; /* previous match */
155 int match_available; /* set if previous match exists */
161 /* Length of the best match at previous step. Matches not greater than this
186 /* Use a faster search when the previous match is longer than this */
|
| H A D | algorithm.txt | 6 pointer to the previous string, in the form of a pair (distance,
8 to 258 bytes. When a string does not occur anywhere in the previous
40 previous match is truncated to a length of one (thus producing a single
|
| H A D | deflate.c | 18 * string matches are performed only when the previous match ends. So it
25 * A previous version of this file used a more sophisticated algorithm
168 * previous key instead of complete recalculation each time.
174 * Insert string str in the dictionary and set match_head to the previous head
176 * the previous length of the hash chain.
556 int old_flush; /* value of flush param for previous deflate call */
1614 /* If there was a match at the previous step and the current
1615 * match is not better, output the previous match:
1645 /* If there was no match at the previous position, output a
1647 * is longer, truncate the previous match to a single literal.
[all …]
|
| /nrf52832-nimble/rt-thread/components/net/lwip-2.0.2/src/core/ipv4/ |
| H A D | ip4_frag.c | 156 * @param prev the previous datagram in the linked list
248 /* older than the previous oldest */ in ip_reass_remove_oldest_datagram()
281 /* No matching previous fragment found, allocate a new reassdata struct */ in ip_reass_enqueue_new_datagram()
373 /* fragment overlaps with previous or following, throw away */ in ip_reass_chain_frag_into_datagram_and_validate()
396 * and the previous fragment */ in ip_reass_chain_frag_into_datagram_and_validate()
419 LWIP_ASSERT("no previous fragment, this must be the first fragment!", in ip_reass_chain_frag_into_datagram_and_validate()
525 * remembering the previous in the queue for later dequeueing. */ in ip4_reass()
531 LWIP_DEBUGF(IP_REASS_DEBUG, ("ip4_reass: matching previous fragment ID=%"X16_F"\n", in ip4_reass()
606 /* find the previous entry in the linked list */ in ip4_reass()
|
| /nrf52832-nimble/rt-thread/components/net/lwip-1.4.1/src/core/ipv4/ |
| H A D | ip_frag.c | 154 * @param prev the previous datagram in the linked list
244 /* older than the previous oldest */ in ip_reass_remove_oldest_datagram()
272 /* No matching previous fragment found, allocate a new reassdata struct */ in ip_reass_enqueue_new_datagram()
365 /* fragment overlaps with previous or following, throw away */ in ip_reass_chain_frag_into_datagram_and_validate()
388 * and the previous fragment */ in ip_reass_chain_frag_into_datagram_and_validate()
411 LWIP_ASSERT("no previous fragment, this must be the first fragment!", in ip_reass_chain_frag_into_datagram_and_validate()
519 * remembering the previous in the queue for later dequeueing. */ in ip_reass()
525 LWIP_DEBUGF(IP_REASS_DEBUG, ("ip_reass: matching previous fragment ID=%"X16_F"\n", in ip_reass()
|
| /nrf52832-nimble/rt-thread/components/dfs/filesystems/jffs2/cyg/compress/tests/ |
| H A D | zlib1.c | 106 "Code or any previous Modifications. When Covered Code is\n"
111 " previous Modifications.\n"
114 " Original Code or previous Modifications.\n"
|
| /nrf52832-nimble/rt-thread/components/dfs/filesystems/jffs2/cyg/crc/ |
| H A D | crc.h | 78 // previous CRC calculation
88 // Ethernet FCS algorithm, but accumulate the result from a previous
|
| /nrf52832-nimble/packages/NimBLE-latest/apps/blemesh_models_example_1/src/ |
| H A D | main.c | 198 u8_t previous; member
370 if (state->previous != state->current && in gen_onoff_set_unack()
373 state->previous, in gen_onoff_set_unack()
375 state->previous = state->current; in gen_onoff_set_unack()
|
| /nrf52832-nimble/rt-thread/components/net/lwip-2.1.0/src/include/lwip/priv/ |
| H A D | sockets_priv.h | 75 /** data that was left from the previous read */
159 /** Pointer to the previous waiting task */
|
| /nrf52832-nimble/nordic/nrfx/drivers/include/ |
| H A D | nrfx_pdm.h | 164 * @retval NRFX_ERROR_BUSY If a previous start/stop operation is in progress.
176 * @retval NRFX_ERROR_BUSY If a previous start/stop operation is in progress.
|
| H A D | nrfx_i2s.h | 138 * the previous time the data handler signaled such need.
139 * This means that data corruption occurred (the previous
|
| /nrf52832-nimble/rt-thread/tools/kconfig-frontends/libs/lxdialog/ |
| H A D | textbox.c | 172 case 'K': /* Previous line */ in dialog_textbox()
182 case 'B': /* Previous page */ in dialog_textbox()
351 /* Clear 'residue' of previous line */ in print_line()
|
| /nrf52832-nimble/rt-thread/components/net/lwip-2.1.0/doc/ |
| H A D | ppp.txt | 477 from previous lwIP version is pretty easy:
479 * Previous PPP API used an integer to identify PPP sessions, we are now
490 * Previous PPP API used CamelCase, we are now using snake_case.
492 * Previous PPP API mixed PPPoS and PPPoE calls, this isn't the case anymore,
|
| /nrf52832-nimble/rt-thread/components/net/lwip-2.0.2/doc/ |
| H A D | ppp.txt | 477 from previous lwIP version is pretty easy:
479 * Previous PPP API used an integer to identify PPP sessions, we are now
490 * Previous PPP API used CamelCase, we are now using snake_case.
492 * Previous PPP API mixed PPPoS and PPPoE calls, this isn't the case anymore,
|
| /nrf52832-nimble/rt-thread/components/finsh/ |
| H A D | finsh_heap.c | 239 /* find out the previous header */ in finsh_block_merge()
249 /* merge to previous node */ in finsh_block_merge()
|
| /nrf52832-nimble/rt-thread/components/net/sal_socket/impl/ |
| H A D | af_inet_lwip.c | 48 /** data that was left from the previous read */
50 /** offset in the data that was left from the previous read */
|
| /nrf52832-nimble/rt-thread/components/dfs/filesystems/uffs/src/inc/uffs/ |
| H A D | uffs_buf.h | 64 struct uffs_BufSt *prev; //!< link to previous buffer
66 struct uffs_BufSt *prev_dirty; //!< link to previous dirty buffer
|
| /nrf52832-nimble/rt-thread/components/net/lwip-2.0.2/src/core/ipv6/ |
| H A D | ip6_frag.c | 234 /* older than the previous oldest */ in ip6_reass_remove_oldest_datagram()
292 * remembering the previous in the queue for later dequeueing. */ in ip6_reass()
409 /* fragment overlaps with previous, throw away */ in ip6_reass()
442 * and the previous fragment */ in ip6_reass()
465 LWIP_ASSERT("no previous fragment, this must be the first fragment!", in ip6_reass()
|
| /nrf52832-nimble/rt-thread/components/net/lwip-2.1.0/src/core/ipv6/ |
| H A D | ip6_frag.c | 247 /* older than the previous oldest */ in ip6_reass_remove_oldest_datagram()
317 * remembering the previous in the queue for later dequeueing. */ in ip6_reass()
444 /* fragment overlaps with previous, throw away */ in ip6_reass()
474 * and the previous fragment */ in ip6_reass()
497 LWIP_ASSERT("no previous fragment, this must be the first fragment!", in ip6_reass()
|
| /nrf52832-nimble/rt-thread/components/dfs/filesystems/jffs2/kernel/linux/ |
| H A D | rbtree.h | 43 /* Find logical next and previous nodes in a tree */
|