Home
last modified time | relevance | path

Searched refs:structure (Results 1 – 25 of 157) sorted by relevance

1234567

/f-stack/dpdk/lib/librte_cmdline/
H A Dcmdline_parse_ipaddr.h48 #define TOKEN_IPADDR_INITIALIZER(structure, field) \ argument
53 offsetof(structure, field), /* offset */ \
62 #define TOKEN_IPV4_INITIALIZER(structure, field) \ argument
67 offsetof(structure, field), /* offset */ \
75 #define TOKEN_IPV6_INITIALIZER(structure, field) \ argument
80 offsetof(structure, field), /* offset */ \
88 #define TOKEN_IPNET_INITIALIZER(structure, field) \ argument
93 offsetof(structure, field), /* offset */ \
103 #define TOKEN_IPV4NET_INITIALIZER(structure, field) \ argument
108 offsetof(structure, field), /* offset */ \
[all …]
H A Dcmdline_parse_etheraddr.h28 #define TOKEN_ETHERADDR_INITIALIZER(structure, field) \ argument
33 offsetof(structure, field), /* offset */ \
H A Dcmdline_parse_portlist.h37 #define TOKEN_PORTLIST_INITIALIZER(structure, field) \ argument
42 offsetof(structure, field), /* offset */ \
H A Dcmdline_parse_num.h44 #define TOKEN_NUM_INITIALIZER(structure, field, numtype) \ argument
49 offsetof(structure, field), /* offset */ \
H A Dcmdline_parse_string.h56 #define TOKEN_STRING_INITIALIZER(structure, field, string) \ argument
61 offsetof(structure, field), /* offset */ \
/f-stack/freebsd/contrib/openzfs/config/
H A Dkernel-proc-operations.m43 dnl # The proc_ops structure was introduced to replace the use of
4 dnl # of the file_operations structure when registering proc handlers.
34 AC_MSG_CHECKING([whether proc_ops structure exists])
37 AC_DEFINE(HAVE_PROC_OPS_STRUCT, 1, [proc_ops structure exists])
H A Dkernel-fallocate.m44 dnl # structure to the file_operations structure.
H A Dkernel-shrink.m43 dnl # The super_block structure now stores a per-filesystem shrinker.
115 dnl # Shrinker adjust to use common shrink_control structure.
H A Dkernel-fst-mount.m44 dnl # in the file_system_type structure.
/f-stack/freebsd/contrib/device-tree/Bindings/clock/st/
H A Dst,flexgen.txt1 Binding for a type of flexgen structure found on certain
4 This structure includes:
8 Flexgen structure is a part of Clockgen[1].
14 | Flexgen structure |
/f-stack/dpdk/examples/cmdline/
H A Dparse_obj_list.h47 #define TOKEN_OBJ_LIST_INITIALIZER(structure, field, obj_list_ptr) \ argument
51 .offset = offsetof(structure, field), \
/f-stack/freebsd/contrib/device-tree/Bindings/pwm/
H A Dnxp,pca9685-pwm.txt13 - open-drain (bool): boolean to configure outputs with open-drain structure;
14 if omitted use totem-pole structure
/f-stack/dpdk/doc/guides/prog_guide/
H A Drcu_lib.rst19 an element from a data structure, the writers cannot return the memory
25 the data structure but does not return the associated memory to the
68 for D1. i.e. for a given data structure Dx, any point in the thread execution
103 states. This will combine all the shared data structure accesses into a
108 In these use cases, a given data structure may not be used by all the
110 use the data structure to report their quiescent state. To provide the required
112 application can create one QS variable per data structure to help it track the
113 end of grace period for each data structure. This helps keep the length of grace
197 the application. When a writer deletes an entry from a data structure, the writer:
208 However, if this resource reclamation process were to be integrated in lock-free data structure lib…
[all …]
H A Dtimer_lib.rst30 …l pending timers for a core being maintained in order of timer expiry in a skiplist data structure.
37 A timer structure contains a special field called status,
57 the expiry time of the first list entry is maintained within the per-core timer list structure itse…
58 …-bit platforms, this value can be checked without the need to take a lock on the overall structure.
H A Dtelemetry_lib.rst51 which will decide what port information should fill the ``rte_tel_data`` structure.
82 utilities API to build up the data structure with the required information.
83 The telemetry library is then responsible for formatting the data structure
90 Some data will need to be formatted in a list structure. For example, if a
H A Dflow_classify_lib.rst178 The ``rte_flow_classify_params`` structure must be initialised by the
232 The ``rte_flow_classify_table_params`` structure must be initialised by the
248 To create an ACL table the ``rte_table_acl_params`` structure must be
250 ``rte_flow_classify_table_params`` structure.
307 ``rte_eth_ntuple_filter`` structure.
327 structure populated by the ``classify_parse_ntuple_filter`` function which
H A Dring_lib.rst32 The advantages of this data structure over a linked list queue are as follows:
48 …shown in with consumer and producer head and tail pointers to objects stored in the data structure.
93 The ring structure is composed of two head and tail couples; one is used by producers and one is us…
98 and the content of ring structure is represented on the bottom of the figure.
128 The second step is to modify *ring->prod_head* in ring structure to point to the same location as p…
143 Once the object is added in the ring, ring->prod_tail in the ring structure is modified to point to…
181 The second step is to modify ring->cons_head in the ring structure to point to the same location as…
196 Finally, ring->cons_tail in the ring structure is modified to point to the same location as ring->c…
235 The second step is to modify ring->prod_head in the ring structure to point to the same location as…
H A Dmember_lib.rst17 extension and generalization of a traditional filter structure (for example
20 structure that provides a "set-summary" on whether a member belongs to a set,
29 probabilistic membership data structure that is provided by the library. A
33 (and other) applications. It is a crucial structure to address performance and
95 probabilistic data structure that answers set membership queries (test whether
203 HTSS employs a similar but simpler data structure to a traditional hash table,
221 also supports a set-summary probabilistic data structure based on HTSS which
277 The ``rte_member_create()`` function is used to create a set-summary structure, the input parameter
340 set-summary structure for multiple matches. It
356 set-summary structure for multiple matches, each key lookup returns ALL the matches (possibly more
[all …]
H A Dmbuf_lib.rst15 The rte_mbuf header structure is kept as small as possible and currently uses
24 #. Embed metadata within a single memory buffer the structure followed by a fixed size area for th…
26 #. Use separate memory buffers for the metadata structure and for the packet data.
76 The rte_pktmbuf_init() function initializes some fields in the mbuf structure that
219 in the "dynamic space", by registering some room in the mbuf structure:
222 named area in the mbuf structure,
226 named bit in the mbuf structure,
/f-stack/dpdk/doc/guides/rel_notes/
H A Drelease_17_08.rst138 * **Reorganized the symmetric crypto operation structure.**
148 * Removed AAD pointer and physical address from ``auth`` structure.
149 * Added ``aead`` structure, containing parameters for AEAD algorithms.
151 * **Reorganized the crypto operation structure.**
161 * **Reorganized the crypto symmetric session structure.**
324 ``rte_bus`` structure.
326 * Made ``rte_devargs`` structure internal device representation generic to
335 * **Reorganized the crypto symmetric session structure.**
338 structure, as described in the `New Features`_ section.
340 * **Reorganized the rte_crypto_sym_cipher_xform structure.**
[all …]
H A Drelease_2_2.rst541 * The ethdev flow director structure ``rte_eth_fdir_flow_ext`` structure was
544 * The size of the ethdev structure ``rte_eth_hash_filter_info`` is changed
548 ``rte_eth_dev_info`` structure.
558 * The mbuf structure was changed to support the unified packet type.
563 * The LPM structure is changed. The deprecated field ``mem_location`` is
567 the LPM table parameter structure.
570 parameter structure for 8-byte key and 16-byte key extendable bucket
574 buffer has been adjusted to cover the packet mbuf structure.
582 the ``virtqueue`` field is moved to the end of virtio_net structure.
585 ``virtio_net_device_ops`` structure.
[all …]
/f-stack/app/nginx-1.16.1/contrib/vim/indent/
H A Dnginx.vim8 " cindent actually works for nginx' simple file structure
/f-stack/app/redis-5.0.5/
H A DREADME.md231 structure is the same. Keep in mind that all the new developments and pull
243 A few important fields in this structure are:
251 the structure definition.
253 Another important Redis data structure is the one defining a client.
254 In the past it was called `redisClient`, now just `client`. The structure
269 The client structure defines a *connected client*:
276 As you can see in the client structure above, arguments in a command
278 structure, which defines a *Redis object*:
288 Basically this structure can represent all the basic Redis data types like
307 * `initServerConfig()` setups the default values of the `server` structure.
[all …]
/f-stack/freebsd/contrib/device-tree/Bindings/net/
H A Dmarvell-bluetooth.txt4 This documents the binding structure and common properties for serial
/f-stack/dpdk/doc/guides/rawdevs/
H A Dioat.rst126 structure parameters used by some of the rawdev APIs for IOAT rawdev
150 be NULL, or else be set to point to a structure of type
152 input ring will be returned in that structure.
158 ``rte_rawdev_configure()`` API, which takes the same structure parameters
161 output, the ``dev_private`` structure element cannot be NULL, and must
162 point to a valid ``rte_ioat_rawdev_config`` structure, containing the ring
167 the configuration structure also.

1234567