| /nrf52832-nimble/rt-thread/libcpu/c-sky/common/ |
| H A D | csi_simd.h | 32 \param [in] val1 first 16-bit operands
50 \param [in] val1 first 16-bit operands
109 \param [in] x first four 8-bit summands.
111 …\return the saturated addition of the first byte of each operand in the first byte of the r…
138 \param [in] x first four 8-bit summands.
140 …\return the saturated addition of the first byte of each operand in the first byte of the r…
166 \param [in] x first four 8-bit summands.
168 …\return the addition of the first bytes from each operand, in the first byte of the return …
193 \param [in] x first four 8-bit summands.
195 …\return the addition of the first bytes from each operand, in the first byte of the return …
[all …]
|
| /nrf52832-nimble/rt-thread/components/dfs/filesystems/jffs2/cyg/compress/src/ |
| H A D | algorithm.txt | 49 the first match is already long enough.
67 inflate() sets up a first level table that covers some number of bits of
74 How many bits to make the first lookup is a tradeoff between the time it
77 be a first level table to cover all the way to the longest code. However,
80 simply to make the number of bits in the first table a variable, and then
84 of the first table is nine bits. Also the distance trees have 30 possible
85 values, and the size of the first table is six bits. Note that for each of
96 lookup table for the first, let's say, nine bits of a Huffman symbol. The
107 compression in the first place.) For the less frequent long symbols, there
127 So the number of bits for the first lookup table is a trade of the time to
[all …]
|
| /nrf52832-nimble/rt-thread/components/dfs/filesystems/jffs2/src/ |
| H A D | malloc-ecos.c | 107 * first = NULL; variable
121 first = &rnr_pool[0]; in jffs2_create_slab_caches()
134 p = first; in jffs2_alloc_raw_node_ref()
136 first = p->next_phys; in jffs2_alloc_raw_node_ref()
144 x->next_phys = first; in jffs2_free_raw_node_ref()
145 first = x; in jffs2_free_raw_node_ref()
|
| /nrf52832-nimble/packages/NimBLE-latest/nimble/controller/src/ |
| H A D | ble_ll_sched.c | 238 /* Remove first to last scheduled elements */ in ble_ll_sched_conn_reschedule()
280 /* Get first on list */ in ble_ll_sched_conn_reschedule()
388 * received on secondary adv channel. We can schedule first packet at in ble_ll_sched_master_new()
439 /* Now find first un-occupied period starting from cp */ in ble_ll_sched_master_new()
618 * received on secondary adv channel. We can schedule first packet at in ble_ll_sched_master_new()
722 * Schedules a slave connection for the first time.
740 int first; in ble_ll_sched_slave_new() local
741 first = 0; in ble_ll_sched_slave_new()
774 first = 1; in ble_ll_sched_slave_new()
811 first = 1; in ble_ll_sched_slave_new()
[all …]
|
| /nrf52832-nimble/packages/NimBLE-latest/nimble/host/mesh/include/mesh/ |
| H A D | slist.h | 213 * @brief Peek the first node from the list
215 * @param list A point on the list to peek the first node from
217 * @return A pointer on the first node of the list (or NULL if none)
307 * the pointer to the next node as the first element of a node, to @a list.
311 * @param head A pointer to the first element of the list to append
327 * @brief merge two slists, appending the second one to the first
367 * @brief Fetch and remove the first node of the given list
374 * @return A pointer to the first node of the list
389 * @brief Fetch and remove the first node of the given list
395 * @return A pointer to the first node of the list (or NULL if empty)
|
| /nrf52832-nimble/rt-thread/components/net/lwip-2.1.0/src/core/ipv6/ |
| H A D | ip6_frag.c | 159 /* The first fragment was received, send ICMP time exceeded. */ in ip6_reass_free_complete_datagram()
160 /* First, de-queue the first pbuf from r->p. */ in ip6_reass_free_complete_datagram()
189 /* First, free all received pbufs. The individual pbufs need to be released in ip6_reass_free_complete_datagram()
285 /* ip6_frag_hdr must be in the first pbuf, not chained. Checked by caller. */ in ip6_reass()
286 LWIP_ASSERT("IPv6 fragment header does not fit in first pbuf", in ip6_reass()
362 * Eventually, we will replace it when we get the first fragment in ip6_reass()
497 LWIP_ASSERT("no previous fragment, this must be the first fragment!", in ip6_reass()
500 /* this is the first fragment we ever received for this ip datagram */ in ip6_reass()
509 /* Remember IPv6 header if this is the first fragment. */ in ip6_reass()
530 /* Additional validity tests: we have received first and last fragment. */ in ip6_reass()
[all …]
|
| /nrf52832-nimble/rt-thread/components/net/lwip-2.0.2/src/core/ipv6/ |
| H A D | ip6_frag.c | 157 /* The first fragment was received, send ICMP time exceeded. */ in ip6_reass_free_complete_datagram()
158 /* First, de-queue the first pbuf from r->p. */ in ip6_reass_free_complete_datagram()
176 /* First, free all received pbufs. The individual pbufs need to be released in ip6_reass_free_complete_datagram()
272 /* ip6_frag_hdr must be in the first pbuf, not chained */ in ip6_reass()
338 * Eventually, we will replace it when we get the first fragment in ip6_reass()
465 LWIP_ASSERT("no previous fragment, this must be the first fragment!", in ip6_reass()
468 /* this is the first fragment we ever received for this ip datagram */ in ip6_reass()
477 /* Remember IPv6 header if this is the first fragment. */ in ip6_reass()
494 /* Additional validity tests: we have received first and last fragment. */ in ip6_reass()
568 /* Get the first pbuf. */ in ip6_reass()
[all …]
|
| /nrf52832-nimble/packages/NimBLE-latest/porting/nimble/src/ |
| H A D | os_mbuf.c | 377 /* If room in current mbuf, copy the first part of the data into the in os_mbuf_append()
857 os_mbuf_concat(struct os_mbuf *first, struct os_mbuf *second) in os_mbuf_concat() argument
862 /* Point 'cur' to the last buffer in the first chain. */ in os_mbuf_concat()
863 cur = first; in os_mbuf_concat()
873 /* Attach the second chain to the end of the first. */ in os_mbuf_concat()
876 /* If the first chain has a packet header, calculate the length of the in os_mbuf_concat()
879 if (OS_MBUF_IS_PKTHDR(first)) { in os_mbuf_concat()
881 OS_MBUF_PKTHDR(first)->omp_len += OS_MBUF_PKTHDR(second)->omp_len; in os_mbuf_concat()
884 OS_MBUF_PKTHDR(first)->omp_len += cur->om_len; in os_mbuf_concat()
942 * If first mbuf has no cluster, and has room for len bytes in os_mbuf_pullup()
[all …]
|
| /nrf52832-nimble/rt-thread/examples/test/ |
| H A D | device_test.c | 12 * 2011-01-01 aozima the first version.
100 rt_kprintf("the first sector failed.\r\n"); in _block_device_test()
110 /* write first sector */ in _block_device_test()
117 rt_kprintf("read the first sector success!\r\n"); in _block_device_test()
119 rt_kprintf("the first sector failed.\r\n"); in _block_device_test()
148 /* verify first sector */ in _block_device_test()
154 rt_kprintf("the first sector failed.\r\n"); in _block_device_test()
173 rt_kprintf("the first sector failed.\r\n"); in _block_device_test()
|
| /nrf52832-nimble/nordic/cmsis/include/ |
| H A D | arm_math.h | 1286 * @param[in] pSrcA points to the first input matrix structure
1300 * @param[in] pSrcA points to the first input matrix structure
1314 * @param[in] pSrcA points to the first input matrix structure
1328 * @param[in] pSrcA points to the first input matrix structure
1342 * @param[in] pSrcA points to the first input matrix structure
1357 * @param[in] pSrcA points to the first input matrix structure
1407 * @param[in] pSrcA points to the first input matrix structure
1421 * @param[in] pSrcA points to the first input matrix structure
1437 * @param[in] pSrcA points to the first input matrix structure
1453 * @param[in] pSrcA points to the first input matrix structure
[all …]
|
| /nrf52832-nimble/rt-thread/libcpu/mips/xburst/ |
| H A D | cpu.c | 21 * 2010-07-09 Bernard first version
61 * This function finds the first bit set (beginning with the least significant bit)
67 * @return return the index of the first bit set. If value is 0, then this function
|
| /nrf52832-nimble/rt-thread/components/CMSIS/Include/ |
| H A D | arm_math.h | 1441 * @param[in] *pSrcA points to the first input matrix structure
1455 * @param[in] *pSrcA points to the first input matrix structure
1469 * @param[in] *pSrcA points to the first input matrix structure
1522 * @param[in] *pSrcA points to the first input matrix structure
1536 * @param[in] *pSrcA points to the first input matrix structure
1552 * @param[in] *pSrcA points to the first input matrix structure
1568 * @param[in] *pSrcA points to the first input matrix structure
1582 * @param[in] *pSrcA points to the first input matrix structure
1597 * @param[in] *pSrcA points to the first input matrix structure
1611 * @param[in] *pSrcA points to the first input matrix structure
[all …]
|
| /nrf52832-nimble/rt-thread/components/net/lwip-2.0.2/src/core/ipv4/ |
| H A D | ip4_frag.c | 176 /* The first fragment was received, send ICMP time exceeded. */ in ip_reass_free_complete_datagram()
177 /* First, de-queue the first pbuf from r->p. */ in ip_reass_free_complete_datagram()
190 /* First, free all received pbufs. The individual pbufs need to be released in ip_reass_free_complete_datagram()
317 /* it was the first in the list */ in ip_reass_dequeue_datagram()
320 /* it wasn't the first, so it must have a valid 'prev' */ in ip_reass_dequeue_datagram()
419 LWIP_ASSERT("no previous fragment, this must be the first fragment!", in ip_reass_chain_frag_into_datagram_and_validate()
422 /* this is the first fragment we ever received for this ip datagram */ in ip_reass_chain_frag_into_datagram_and_validate()
433 /* Check if the queue starts with the first datagram */ in ip_reass_chain_frag_into_datagram_and_validate()
548 /* ipr->iphdr is not the header from the first fragment, but fraghdr is in ip4_reass()
550 * of the first fragment (for ICMP time exceeded and later, for copying in ip4_reass()
[all …]
|
| /nrf52832-nimble/rt-thread/tools/kconfig-frontends/docs/ |
| H A D | kconfig-language.txt | 69 default values are visible, only the first defined one is active.
154 or equal to the first symbol and smaller than or equal to the second
159 the indentation level, this means it ends at the first line which has
160 a smaller indentation than the first line of the help text.
237 The position of a menu entry in the tree is determined in two ways. First
255 can be made a submenu of it. First, the previous (parent) symbol must
289 The first five also start the definition of a menu entry.
354 the first choice element in the group or remain unknown if none of the
417 first glance and most of which have become idioms in several Kconfig
478 We'll first explain why this issues exists and then provide an example
[all …]
|
| /nrf52832-nimble/packages/NimBLE-latest/nimble/host/test/src/ |
| H A D | ble_store_test.c | 183 /* First two belong to first peer. */ in TEST_CASE()
219 /* Delete first peer. */ in TEST_CASE()
223 /* Ensure all traces of first peer have been removed. */ in TEST_CASE()
259 /* Ensure all traces of first peer have been removed. */ in TEST_CASE()
362 /* First two belong to first peer. */ in TEST_CASE()
|
| /nrf52832-nimble/rt-thread/components/net/lwip-2.1.0/src/core/ipv4/ |
| H A D | ip4_frag.c | 180 /* The first fragment was received, send ICMP time exceeded. */ in ip_reass_free_complete_datagram()
181 /* First, de-queue the first pbuf from r->p. */ in ip_reass_free_complete_datagram()
194 /* First, free all received pbufs. The individual pbufs need to be released in ip_reass_free_complete_datagram()
321 /* it was the first in the list */ in ip_reass_dequeue_datagram()
324 /* it wasn't the first, so it must have a valid 'prev' */ in ip_reass_dequeue_datagram()
446 LWIP_ASSERT("no previous fragment, this must be the first fragment!", in ip_reass_chain_frag_into_datagram_and_validate()
449 /* this is the first fragment we ever received for this ip datagram */ in ip_reass_chain_frag_into_datagram_and_validate()
460 /* Check if the queue starts with the first datagram */ in ip_reass_chain_frag_into_datagram_and_validate()
576 /* ipr->iphdr is not the header from the first fragment, but fraghdr is in ip4_reass()
578 * of the first fragment (for ICMP time exceeded and later, for copying in ip4_reass()
[all …]
|
| /nrf52832-nimble/rt-thread/components/net/lwip-1.4.1/src/core/ipv4/ |
| H A D | ip_frag.c | 174 /* The first fragment was received, send ICMP time exceeded. */ in ip_reass_free_complete_datagram()
175 /* First, de-queue the first pbuf from r->p. */ in ip_reass_free_complete_datagram()
188 /* First, free all received pbufs. The individual pbufs need to be released in ip_reass_free_complete_datagram()
309 /* it was the first in the list */ in ip_reass_dequeue_datagram()
312 /* it wasn't the first, so it must have a valid 'prev' */ in ip_reass_dequeue_datagram()
411 LWIP_ASSERT("no previous fragment, this must be the first fragment!", in ip_reass_chain_frag_into_datagram_and_validate()
414 /* this is the first fragment we ever received for this ip datagram */ in ip_reass_chain_frag_into_datagram_and_validate()
425 /* Check if the queue starts with the first datagram */ in ip_reass_chain_frag_into_datagram_and_validate()
543 /* ipr->iphdr is not the header from the first fragment, but fraghdr is in ip_reass()
545 * of the first fragment (for ICMP time exceeded and later, for copying in ip_reass()
[all …]
|
| /nrf52832-nimble/rt-thread/components/utilities/logtrace/ |
| H A D | log_trace.c | 8 * Bernard the first version
73 rt_uint16_t first, last; in _lg_lookup_session() local
78 first = 0; in _lg_lookup_session()
81 unsigned int i = (first + last)/2; in _lg_lookup_session()
101 first = i; in _lg_lookup_session()
103 } while (first != last-1); in _lg_lookup_session()
|
| /nrf52832-nimble/rt-thread/components/net/lwip-2.0.2/src/core/ |
| H A D | pbuf.c | 245 * is the first pbuf of a pbuf chain.
300 /* set the length of the first pbuf in the chain */ in pbuf_alloc()
312 /* remember first pbuf for linkage in next iteration */ in pbuf_alloc()
483 * Depending on the desired length, the first few pbufs in a chain might
515 /* first, step over any pbufs that should remain in the chain */ in pbuf_realloc()
689 * up to the first pbuf which has a non-zero reference count after
796 * @param p first pbuf of chain
849 /* add total length of second chain to all totals of first chain */ in pbuf_cat()
852 /* { p is last pbuf of first h chain, p->next == NULL } */ in pbuf_cat()
855 /* add total length of second chain to last pbuf total of first chain */ in pbuf_cat()
[all …]
|
| /nrf52832-nimble/rt-thread/components/drivers/rtc/ |
| H A D | rtc.c | 8 * 2012-01-29 aozima first version.
9 * 2012-04-12 aozima optimization: find rtc device only first.
22 /* NTP first sync delay time for network connect, unit: second */
136 /* first sync delay for network connect */ in ntp_sync_thread_enrty()
|
| /nrf52832-nimble/rt-thread/components/dfs/filesystems/uffs/src/uffs/ |
| H A D | uffs_public.c | 177 // if the first page is dirty, then this block is used. in uffs_IsThisBlockUsed()
201 * find first free page from 'pageFrom'
205 * \return return first free page number from 'pageFrom'
207 * \retval >=0 the first free page number
301 // First try the last page. in uffs_GetBlockFileDataLength()
357 // search from the last page ... to first page in uffs_GetFreePagesCount()
|
| /nrf52832-nimble/rt-thread/components/net/lwip-2.1.0/src/core/ |
| H A D | tcp_in.c | 187 /* all options are in the first pbuf */
192 /* TCP header fits into first pbuf, options don't - data is in the next pbuf */
199 /* determine how long the first and second parts of the options are */
246 /* Demultiplex an incoming segment. First, we check if it is destined
353 /* first try specific local IP */
743 * - first check sequence number - we skip that one in TIME_WAIT (always
800 /* First, determine if the reset is acceptable. */
1378 might involve trimming the first edge of the data. The rcv_nxt
1389 +) Finally, we check if the first segment on the ->ooseq queue
1391 rcv_nxt > ooseq->seqno, we must trim the first edge of the
[all …]
|
| /nrf52832-nimble/rt-thread/components/finsh/ |
| H A D | finsh_heap.c | 8 * 2010-03-22 Bernard first version
60 /* find the first fit block */ in finsh_heap_allocate()
69 /* find the first fit block */ in finsh_heap_allocate()
121 /* find the first fit block */ in finsh_heap_gc()
|
| /nrf52832-nimble/rt-thread/components/net/freemodbus/modbus/include/ |
| H A D | mbutils.h | 57 * \param usBitOffset The starting address of the bits to set. The first
61 * \param ucValues Thew new values for the bits. The value for the first bit
87 * \param usBitOffset The starting address of the bits to set. The first
|
| /nrf52832-nimble/rt-thread/libcpu/arm/dm36x/ |
| H A D | cpuport.c | 8 * 2011-01-13 weety first version
178 * This function finds the first bit set (beginning with the least significant bit)
184 * @return return the index of the first bit set. If value is 0, then this function
|