| /f-stack/app/redis-5.0.5/src/ |
| H A D | rax.c | 1260 it->key = it->key_static_string; in raxStart()
1271 if (it->key_max < it->key_len+len) { in raxIteratorAddChars()
1281 if (old == NULL) memcpy(it->key,it->key_static_string,it->key_len); in raxIteratorAddChars()
1286 memmove(it->key+it->key_len,s,len); in raxIteratorAddChars()
1339 if (it->node_cb && it->node_cb(&it->node)) in raxIteratorNextStep()
1395 if (it->node_cb && it->node_cb(&it->node)) in raxIteratorNextStep()
1418 if (!raxIteratorAddChars(it,it->node->data+it->node->size-1,1)) in raxSeekGreatest()
1551 it->node = it->rt->head; in raxSeek()
1554 it->data = raxGetData(it->node); in raxSeek()
1573 it->data = raxGetData(it->node); in raxSeek()
[all …]
|
| H A D | rax.h | 199 void raxStart(raxIterator *it, rax *rt);
200 int raxSeek(raxIterator *it, const char *op, unsigned char *ele, size_t len);
201 int raxNext(raxIterator *it);
202 int raxPrev(raxIterator *it);
203 int raxRandomWalk(raxIterator *it, size_t steps);
205 void raxStop(raxIterator *it);
206 int raxEOF(raxIterator *it);
|
| /f-stack/freebsd/kern/ |
| H A D | kern_time.c | 1148 wakeup(it); in itimer_leave()
1274 it->it_ksi.ksi_signo = it->it_sigev.sigev_signo; in kern_ktimer_create()
1276 it->it_ksi.ksi_value = it->it_sigev.sigev_value; in kern_ktimer_create()
1285 CLOCK_CALL(it->it_clockid, timer_delete, (it)); in kern_ktimer_create()
1317 it = NULL; in itimer_find()
1339 msleep(it, &it->it_mtx, PPAUSE, "itimer", 0); in kern_ktimer_delete()
1342 CLOCK_CALL(it->it_clockid, timer_delete, (it)); in kern_ktimer_delete()
1478 callout_init_mtx(&it->it_callout, &it->it_mtx, 0); in realtimer_create()
1587 it->it_overrun_last = it->it_overrun; in itimer_accept()
1652 it); in realtimer_expire()
[all …]
|
| /f-stack/app/micro_thread/ |
| H A D | mt_concurrent.cpp | 41 for (IMtActList::iterator it = req_list.begin(); it != req_list.end(); ++it) in mt_multi_netfd_poll() local
99 for (IMtActList::iterator it = req_list.begin(); it != req_list.end(); ++it) in mt_multi_newsock() local
164 for (it = req_list.begin(); it != req_list.end(); ++it) in mt_multi_open()
199 for (IMtActList::iterator it = wait_list.begin(); it != wait_list.end(); ++it) in mt_multi_open() local
239 for (IMtActList::iterator it = req_list.begin(); it != req_list.end(); ++it) in mt_multi_sendto() local
281 for (IMtActList::iterator it = wait_list.begin(); it != wait_list.end(); ++it) in mt_multi_sendto() local
322 for (IMtActList::iterator it = req_list.begin(); it != req_list.end(); ++it) in mt_multi_recvfrom() local
365 for (IMtActList::iterator it = wait_list.begin(); it != wait_list.end(); ++it) in mt_multi_recvfrom() local
429 for (IMtActList::iterator it = req_list.begin(); it != req_list.end(); ++it) in mt_msg_sendrcv() local
450 for (IMtActList::iterator it = req_list.begin(); it != req_list.end(); ++it) in mt_msg_sendrcv() local
[all …]
|
| /f-stack/dpdk/lib/librte_eal/common/ |
| H A D | eal_common_dev.c | 58 .it = it, \
617 it->bus = bus; in rte_dev_iterator_init()
618 it->cls = cls; in rte_dev_iterator_init()
660 it = ITCTX(ctx); in class_next_dev_cmp()
666 if (it->cls_str != NULL && cls != it->cls) in class_next_dev_cmp()
689 it = ITCTX(ctx); in bus_next_dev_cmp()
691 dev = it->device; in bus_next_dev_cmp()
695 if (it->bus_str != NULL && bus != it->bus) in bus_next_dev_cmp()
718 it->cls = cls; in bus_next_dev_cmp()
735 if (it->bus_str == NULL && it->cls_str == NULL) { in rte_dev_iterator_next()
[all …]
|
| /f-stack/dpdk/lib/librte_eal/include/ |
| H A D | rte_dev.h | 278 const struct rte_dev_iterator *it);
302 rte_dev_iterator_init(struct rte_dev_iterator *it, const char *str);
322 rte_dev_iterator_next(struct rte_dev_iterator *it);
324 #define RTE_DEV_FOREACH(dev, devstr, it) \ argument
325 for (rte_dev_iterator_init(it, devstr), \
326 dev = rte_dev_iterator_next(it); \
328 dev = rte_dev_iterator_next(it))
|
| /f-stack/freebsd/netgraph/bluetooth/hci/ |
| H A D | TODO | 11 it should be fine as long as Netgraph is SMP safe. Just need to
12 verify it.
16 Some code exists, but i have no idea how it should work. Will
18 it does not support QoS.
23 Host Controller flow control (not sure if it is required).
|
| /f-stack/freebsd/contrib/device-tree/Bindings/power/reset/ |
| H A D | reboot-mode.txt | 5 or ram. Then the bootloader can read it and take different
8 All mode properties are vendor specific, it is a indication to tell
14 - mode-recovery: Android Recovery mode, it is a mode to format the device or update a new image.
15 - mode-bootloader: Android fastboot mode, it's a mode to re-flash partitions on the Android based d…
16 - mode-loader: A bootloader mode, it's a mode used to download image on Rockchip platform,
|
| /f-stack/freebsd/netgraph/ |
| H A D | NOTES | 15 (or so it seems)
20 getting rid of it altogether. It doesn't seem necessary and
28 it will be ported eventually :)
31 make it a macro, then its always portable:
48 - ngctl needs to be rewritten using libnetgraph. Also it needs a
63 to do it either way!
66 it was a bad idea.
75 - Write code so it can be an LKM or built into the kernel.. this means
101 all information needed to queue such a request and deliver it later, so
102 it is now the basis of all data transfer since any transfer may need to
|
| /f-stack/freebsd/sys/ |
| H A D | timers.h | 90 #define ITIMER_LOCK(it) mtx_lock(&(it)->it_mtx) argument
91 #define ITIMER_UNLOCK(it) mtx_unlock(&(it)->it_mtx) argument
|
| /f-stack/freebsd/contrib/openzfs/module/lua/ |
| H A D | README.zfs | 25 maintenance policy, the modifications that have been made to it, and how it
46 of ways to make it more useful for the specific purpose of running channel
49 1. "Normal" Lua uses floating point for all numbers it stores, but those aren't
60 ability to do so is restricted to the root user, it's still possible to write
65 5. The Lua bytecode is not designed to be secure / safe, so it would be easy to
68 Lua source code at the ioctl level and then interpret it inside the kernel.
78 From the above, it should be clear that this is not a general-purpose Lua
80 of Lua from ZFS and make it usable by other areas of the kernel.
|
| /f-stack/freebsd/contrib/device-tree/Bindings/interrupt-controller/ |
| H A D | cdns,xtensa-pic.txt | 8 When it's 1, the first cell is the internal IRQ number.
9 When it's 2, the first cell is the IRQ number, and the second cell
10 specifies whether it's internal (0) or external (1).
12 core variants it may be mapped to different internal IRQ.
|
| /f-stack/app/redis-5.0.5/deps/linenoise/ |
| H A D | README.markdown | 47 Please test it everywhere you can and report back!
66 it will be printed to the left of the cursor. The library returns a buffer
73 to a program, or use it in an Unix pipeline, there are no limits to the
77 However sometimes it could happen that your program uses a different dynamic
79 line is freed with the same allocator it was created.
101 You can disable it using `0` as argument.
117 to the top of the history (it will be the first the user will see when
146 An example will make it more clear:
159 with `make`, run it, type `h` and press `<TAB>`.
172 For example as the user starts to type `"git remote add"`, with hints it's
[all …]
|
| /f-stack/freebsd/contrib/zstd/ |
| H A D | COPYING | 7 of this license document, but changing it is not allowed.
12 freedom to share and change it. By contrast, the GNU General Public
18 the GNU Lesser General Public License instead.) You can apply it to
25 if you want it, that you can change the software or use pieces of it
31 distribute copies of the software, or if you modify it.
67 that is to say, a work containing the Program or a portion of it,
80 source code as you receive it, in any medium, provided that you
91 of it, thus forming a work based on the Program, and copy and
104 when run, you must cause it, when started running for such
187 the Program or works based on it.
[all …]
|
| /f-stack/dpdk/license/ |
| H A D | gpl-2.0.txt | 7 of this license document, but changing it is not allowed.
12 freedom to share and change it. By contrast, the GNU General Public
18 the GNU Lesser General Public License instead.) You can apply it to
25 if you want it, that you can change the software or use pieces of it
31 distribute copies of the software, or if you modify it.
67 that is to say, a work containing the Program or a portion of it,
80 source code as you receive it, in any medium, provided that you
91 of it, thus forming a work based on the Program, and copy and
104 when run, you must cause it, when started running for such
187 the Program or works based on it.
[all …]
|
| /f-stack/freebsd/contrib/openzfs/module/os/linux/spl/ |
| H A D | THIRDPARTYLICENSE.gplv2 | 7 of this license document, but changing it is not allowed.
12 freedom to share and change it. By contrast, the GNU General Public
18 the GNU Lesser General Public License instead.) You can apply it to
25 if you want it, that you can change the software or use pieces of it
31 distribute copies of the software, or if you modify it.
67 that is to say, a work containing the Program or a portion of it,
80 source code as you receive it, in any medium, provided that you
91 of it, thus forming a work based on the Program, and copy and
104 when run, you must cause it, when started running for such
187 the Program or works based on it.
[all …]
|
| /f-stack/app/redis-5.0.5/deps/ |
| H A D | README.md | 5 …he dependencies directory but is actually part of the Redis project, since it is our private fork …
6 …l ecosystem but is developed externally from the Redis repository, so we just upgrade it as needed.
18 and Redis is able to understand if the Jemalloc version it is compiled
24 2. Substitute it with the new jemalloc source tree.
31 …onfigure` script of Jemalloc using the `--with-lg-quantum` option, setting it to the value of 3 in…
40 can see how it is implemented in the current Jemalloc source tree shipped
41 with Redis, and rewrite it according to the new Jemalloc internals, if they
48 This is never upgraded since it's part of the Redis project. If there are changes to merge from Ard…
53 …used forked versions of hiredis in a way or the other. In order to upgrade it is advised to take a…
55 1. Check with diff if hiredis API changed and what impact it could have in Redis.
[all …]
|
| /f-stack/freebsd/contrib/device-tree/Bindings/iio/adc/ |
| H A D | adi,ad7780.yaml | 46 specified, it will be asserted during driver probe. As the
47 line is active high, it should be marked GPIO_ACTIVE_HIGH.
53 the ad778x chips. If specified, it will be asserted during
54 driver probe. As the line is active low, it should be marked
61 for the ad778x chips. If specified, it will be asserted
62 during driver probe. As the line is active low, it should be
|
| H A D | adi,ad7606.yaml | 43 input channels. As the line is active high, it should be marked
50 it will be asserted during driver probe. As the line is active high,
51 it should be marked GPIO_ACTIVE_HIGH.
58 Shutdown mode. As the line is active low, it should be marked
67 As the line is active high, it should be marked GPIO_ACTIVE_HIGH.
76 is ±5V for all channels. As the line is active high, it should be marked
83 mode pins. As the line is active high, it should be marked
93 oversampling gpios to high. Otherwise, it is assumed that the pins are hardwired
|
| /f-stack/dpdk/doc/guides/prog_guide/ |
| H A D | event_timer_adapter.rst | 12 such adapter; it bridges event devices and timer mechanisms.
20 software implementations of the timer mechanism; it will query an eventdev PMD
47 it:
73 request to arm or cancel it takes effect.
75 If the application wishes to rearm the timer after it has expired, it should
131 configure an event port; it will examine the current event device
139 to control how it is done.
190 manage event timers with it.
215 Note that it is necessary to initialize the event timer state to
230 Once an event timer expires, the application may free it or rearm it as
[all …]
|
| H A D | mbuf_lib.rst | 13 A rte_mbuf struct generally carries network packet buffers, but it can actually
69 An mbuf contains a field indicating the pool that it originated from.
87 Freeing a mbuf means returning it into its original mempool.
124 On TX side, it is also possible for an application to delegate some
125 processing to the hardware if it supports it. For instance, the
162 Note that it can only work if outer L4 checksum is 0.
175 Note that it can only work if outer L4 checksum is 0.
189 Note that it can only work if outer L4 checksum is 0.
240 data offset in it refer to data in another direct buffer.
255 Finally, it is not possible to reattach an indirect buffer to the direct buffer (unless it is detac…
[all …]
|
| /f-stack/freebsd/contrib/zstd/doc/educational_decoder/ |
| H A D | README.md | 6 While it does not implement as many features as the reference decoder,
7 such as the streaming API or content checksums, it is written to be easy to
10 so it can be used to understand how complex segments could be implemented.
17 it also happens to compile into a small object file.
34 and so it must know the decompressed size in advance.
|
| /f-stack/freebsd/contrib/device-tree/Bindings/iio/proximity/ |
| H A D | devantech-srf04.yaml | 10 - Andreas Klinger <ak@it-klinger.de>
17 until it is received once again
37 This GPIO is set for about 10 us by the driver to tell the device it
59 When the device gets suspended it's switched off and when it resumes
60 it's switched on again. After some period of inactivity the driver
|
| /f-stack/freebsd/crypto/openssl/arm/ |
| H A D | sha512-armv4.S | 14 @ CRYPTOGAMS licenses depending on where you obtain it. For further
23 @ by gcc 3.4 and it spends ~72 clock cycles per byte [on single-issue
38 @ Add NEON implementation. On Cortex A8 it was measured to process
44 @ terms it's 22.6 cycles per byte, which is disappointing result.
|
| H A D | sha256-armv4.S | 14 @ CRYPTOGAMS licenses depending on where you obtain it. For further
38 @ Add NEON implementation. On Cortex A8 it was measured to process one
40 @ S4 does it in 12.5 cycles too, but it's 50% faster than integer-only
|