Home
last modified time | relevance | path

Searched refs:many (Results 1 – 25 of 179) sorted by relevance

12345678

/f-stack/freebsd/netgraph/
H A Dng_one2many.c75 struct ng_one2many_link many[NG_ONE2MANY_MAX_LINKS]; member
226 link = &priv->many[linkNum]; in ng_one2many_newhook()
335 link = &priv->many[linkNum]; in ng_one2many_rcvmsg()
432 &priv->one : &priv->many[linkNum]; in ng_one2many_rcvdata()
447 dst = &priv->many[priv->activeMany[priv->nextMany]]; in ng_one2many_rcvdata()
452 dst = &priv->many[priv->activeMany[0]]; in ng_one2many_rcvdata()
461 mdst = &priv->many[priv->activeMany[i]]; in ng_one2many_rcvdata()
476 dst = &priv->many[priv->activeMany[0]]; in ng_one2many_rcvdata()
531 priv->many[linkNum].hook = NULL; in ng_one2many_disconnect()
562 if (priv->many[linkNum].hook != NULL in ng_one2many_update_many()
/f-stack/app/nginx-1.16.1/src/stream/
H A Dngx_stream_upstream_least_conn_module.c104 ngx_uint_t i, n, p, many; in ngx_stream_upstream_get_least_conn_peer() local
127 many = 0; in ngx_stream_upstream_get_least_conn_peer()
167 many = 0; in ngx_stream_upstream_get_least_conn_peer()
171 many = 1; in ngx_stream_upstream_get_least_conn_peer()
182 if (many) { in ngx_stream_upstream_get_least_conn_peer()
/f-stack/app/nginx-1.16.1/src/http/modules/
H A Dngx_http_upstream_least_conn_module.c107 ngx_uint_t i, n, p, many; in ngx_http_upstream_get_least_conn_peer() local
131 many = 0; in ngx_http_upstream_get_least_conn_peer()
171 many = 0; in ngx_http_upstream_get_least_conn_peer()
175 many = 1; in ngx_http_upstream_get_least_conn_peer()
186 if (many) { in ngx_http_upstream_get_least_conn_peer()
/f-stack/tools/libxo/tests/gettext/
H A Dstrerror.pot141 msgid "Too many open files in system"
145 msgid "Too many open files"
173 msgid "Too many links"
303 msgid "Too many references: can't splice"
315 msgid "Too many levels of symbolic links"
343 msgid "Too many processes"
347 msgid "Too many users"
363 msgid "Too many levels of remote in path"
/f-stack/freebsd/contrib/dev/ath/ath_hal/ar9300/
H A Deeprom.diff91 + ath_hal_printf(ah, "%s: called: address=%d, many=%d, is_wifi=%d\n",
94 + many,
97 if (((address) < 0) || ((address + many) > 0x400)) {
104 + ath_hal_printf(ah, "%s: address=%d, many=%d\n", __func__, address, many);
106 for (it = 0; it < many; it++) {
H A Dar9300eep.h701 …L ar9300_calibration_data_read_flash(struct ath_hal *ah, long address, u_int8_t *buffer, int many);
702 … ar9300_calibration_data_read_eeprom(struct ath_hal *ah, long address, u_int8_t *buffer, int many);
703 …tion_data_read_otp(struct ath_hal *ah, long address, u_int8_t *buffer, int many, HAL_BOOL is_wifi);
704 …AL_BOOL ar9300_calibration_data_read(struct ath_hal *ah, long address, u_int8_t *buffer, int many);
707 …OL ar9300_calibration_data_read_array(struct ath_hal *ah, int address, u_int8_t *buffer, int many);
/f-stack/tools/libxo/tests/gettext/po/pig_latin/
H A Dstrerror.po141 msgid "Too many open files in system"
145 msgid "Too many open files"
173 msgid "Too many links"
298 msgid "Too many references: can't splice"
310 msgid "Too many levels of symbolic links"
336 msgid "Too many processes"
340 msgid "Too many users"
355 msgid "Too many levels of remote in path"
/f-stack/freebsd/contrib/zlib/doc/
H A Dalgorithm.txt68 input less than the length of longest code. It gets that many bits from the
70 code is that many bits or less and how many, and if it is, it will tell
74 How many bits to make the first lookup is a tradeoff between the time it
79 codes are replicated many times in such a table. What inflate() does is
109 symbols, you could have as many levels of lookups as is efficient. For
117 You may wonder: why not just have one lookup table for how ever many bits the
157 Each entry is what the bits decode as and how many bits that is, i.e. how
158 many bits to gobble. Or the entry points to another table, with the number of
/f-stack/freebsd/contrib/device-tree/Bindings/i2c/
H A Di2c-arb-gpio-challenge.txt6 In many cases using GPIOs to arbitrate is not needed and a design can use
51 - wait-retry-us: we'll attempt another claim after this many microseconds.
53 - wait-free-us: we'll give up after this many microseconds. Default is 50000 us.
/f-stack/freebsd/contrib/device-tree/Bindings/usb/
H A Dgr-udc.txt25 only for as many endpoints as the array contains.
31 only for as many endpoints as the array contains.
/f-stack/freebsd/contrib/device-tree/Bindings/clock/
H A Dsprd,sc9860-clk.txt27 parents are in, since each clk node would represent many clocks
29 relationship (i.e. how many parents and which are the parents)
/f-stack/dpdk/doc/guides/rawdevs/
H A Dntb.rst8 separate hosts so that they can communicate with each other. Thus, many
136 Based on this ring layout, enqueue reads rx_tail to get how many free
139 And dequeue reads tx_tail to get how many packets are arrived, and
H A Difpga.rst12 flexibility. That means one FPGA Device Bit Stream is divided into many Parts
96 Each FPGA can provide many channels to PR AFU by software, each channels
/f-stack/dpdk/
H A DREADME2 It supports many processor architectures and both FreeBSD and Linux.
/f-stack/freebsd/contrib/device-tree/Bindings/sound/
H A Dmt6358.txt14 - mediatek,dmic-mode : Indicates how many data pins are used to transmit two
H A Darndale.txt14 Arndale Boards has many audio daughter cards, one of them is
/f-stack/freebsd/contrib/device-tree/Bindings/
H A Dcommon-properties.txt71 by all of its devices. The driver needs to know how many devices the
72 daisy-chain comprises to determine the amount of data exchanged, how many
H A Dwriting-bindings.rst8 every rule, there are exceptions and bindings have many gray areas.
57 - DO define properties in terms of constraints. How many entries? What are
/f-stack/dpdk/drivers/net/
H A Dmeson.build60 std_deps += ['bus_pci'] # very many PMDs depend on PCI, so make std
/f-stack/freebsd/contrib/device-tree/Bindings/ata/
H A Dcavium-compact-flash.txt10 Compatibility with many Cavium evaluation boards.
/f-stack/freebsd/contrib/device-tree/Bindings/gpio/
H A Dgpio-atlas7.txt7 - gpio-banks : How many gpio banks on this controller
/f-stack/freebsd/contrib/device-tree/Bindings/regmap/
H A Dregmap.txt18 of the CPU and a byteswap for MMIO registers (e.g. many Broadcom MIPS
/f-stack/freebsd/contrib/device-tree/Bindings/dma/
H A Dqcom_hidma_mgmt.txt31 - max-write-transactions: This value is how many times a write burst is
34 - max-read-transactions: This value is how many times a read burst is
/f-stack/freebsd/contrib/device-tree/Bindings/bus/
H A Dmoxtet.txt17 - reg : Should be position on the Moxtet bus (how many Moxtet
/f-stack/freebsd/contrib/device-tree/Bindings/interrupt-controller/
H A Dbrcm,bcm3380-l2-intc.txt3 This interrupt controller shows up in various forms on many BCM338x/BCM63xx

12345678