Home
last modified time | relevance | path

Searched +full:lookup +full:- +full:table (Results 1 – 25 of 1018) sorted by relevance

12345678910>>...41

/linux-6.12.1/drivers/net/wireless/broadcom/b43/
Dtables_nphy.h1 /* SPDX-License-Identifier: GPL-2.0 */
73 /* The N-PHY tables. */
78 #define B43_NTAB8(table, offset) (((table) << 10) | (offset) | B43_NTAB_8BIT) argument
79 #define B43_NTAB16(table, offset) (((table) << 10) | (offset) | B43_NTAB_16BIT) argument
80 #define B43_NTAB32(table, offset) (((table) << 10) | (offset) | B43_NTAB_32BIT) argument
82 /* Static N-PHY tables */
83 #define B43_NTAB_FRAMESTRUCT B43_NTAB32(0x0A, 0x000) /* Frame Struct Table */
85 #define B43_NTAB_FRAMELT B43_NTAB8 (0x18, 0x000) /* Frame Lookup Table */
87 #define B43_NTAB_TMAP B43_NTAB32(0x0C, 0x000) /* T Map Table */
89 #define B43_NTAB_TDTRN B43_NTAB32(0x0E, 0x000) /* TDTRN Table */
[all …]
Dtables_lpphy.h1 /* SPDX-License-Identifier: GPL-2.0 */
10 #define B43_LPTAB8(table, offset) (((table) << 10) | (offset) | B43_LPTAB_8BIT) argument
11 #define B43_LPTAB16(table, offset) (((table) << 10) | (offset) | B43_LPTAB_16BIT) argument
12 #define B43_LPTAB32(table, offset) (((table) << 10) | (offset) | B43_LPTAB_32BIT) argument
14 /* Table definitions */
15 #define B43_LPTAB_TXPWR_R2PLUS B43_LPTAB32(0x07, 0) /* TX power lookup table (rev >= 2) */
16 #define B43_LPTAB_TXPWR_R0_1 B43_LPTAB32(0xA0, 0) /* TX power lookup table (rev < 2) */
21 /* Bulk table access. Note that these functions return the bulk data in
39 const struct lpphy_tx_gain_table_entry *table);
/linux-6.12.1/drivers/net/ethernet/aquantia/atlantic/macsec/
Dmacsec_api.h1 /* SPDX-License-Identifier: GPL-2.0-only */
48 /*! Read the raw table data from the specified row of the Egress CTL
49 * Filter table, and unpack it into the fields of rec.
50 * rec - [OUT] The raw table row data will be unpacked into the fields of rec.
51 * table_index - The table row to read (max 23).
58 * specified row of the Egress CTL Filter table.
59 * rec - [IN] The bitfield values to write to the table row.
60 * table_index - The table row to write(max 23).
66 /*! Read the raw table data from the specified row of the Egress
67 * Packet Classifier table, and unpack it into the fields of rec.
[all …]
Dmacsec_struct.h1 /* SPDX-License-Identifier: GPL-2.0-only */
10 * table.
21 /*! The match mask is per-nibble. 0 means don't care, i.e. every value
43 * Classifier table.
122 /*! Mask is per-byte.
142 /*! Mask is per-byte.
151 /*! Mask is per-byte.
156 /*! Mask is per-byte.
171 /*! Mask is per-byte.
176 /*! Mask is per-byte.
[all …]
/linux-6.12.1/net/netfilter/ipvs/
Dip_vs_mh.c1 // SPDX-License-Identifier: GPL-2.0
8 /* The mh algorithm is to assign a preference list of all the lookup
9 * table positions to each destination and populate the table with
10 * the most-preferred position of destinations. Then it is to select
12 * up a the lookup table.
16 https://www.usenix.org/system/files/conference/nsdi16/nsdi16-paper-eisenbud.pdf
49 /* Available prime numbers for MH table */
53 /* For IPVS MH entry hash table */
58 #define IP_VS_MH_TAB_INDEX (CONFIG_IP_VS_MH_TAB_INDEX - 8)
63 struct ip_vs_mh_lookup *lookup; member
[all …]
/linux-6.12.1/tools/perf/pmu-events/arch/arm64/ampere/ampereonex/
Dmmu.json45 "PublicDescrition": "Data-side S1 page walk cache lookup",
48 "BriefDescription": "Data-side S1 page walk cache lookup"
51 "PublicDescrition": "Data-side S1 page walk cache refill",
54 "BriefDescription": "Data-side S1 page walk cache refill"
57 "PublicDescrition": "Data-side S2 page walk cache lookup",
60 "BriefDescription": "Data-side S2 page walk cache lookup"
63 "PublicDescrition": "Data-side S2 page walk cache refill",
66 "BriefDescription": "Data-side S2 page walk cache refill"
69 "PublicDescription": "Data-side S1 table walk fault",
72 "BriefDescription": "Data-side S1 table walk fault"
[all …]
/linux-6.12.1/net/netfilter/
Dnft_set_pipapo.h1 // SPDX-License-Identifier: GPL-2.0-only
8 /* Count of concatenated fields depends on count of 32-bit nftables registers */
18 /* Bits to be grouped together in table buckets depending on set size */
25 #define NFT_PIPAPO_GROUPS_PER_BYTE(f) (BITS_PER_BYTE / (f)->bb)
27 /* If a lookup table gets bigger than NFT_PIPAPO_LT_SIZE_HIGH, switch to the
28 * small group width, and switch to the big group width if the table gets
31 * Picking 2MiB as threshold (for a single table) avoids as much as possible
32 * crossing page boundaries on most architectures (x86-64 and MIPS huge pages,
34 * keeps performance nice in case kvmalloc() gives us non-contiguous areas.
39 #define NFT_PIPAPO_LT_SIZE_LOW NFT_PIPAPO_LT_SIZE_THRESHOLD - \
[all …]
Dnft_set_pipapo.c1 // SPDX-License-Identifier: GPL-2.0-only
5 * Copyright (c) 2019-2020 Red Hat GmbH
15 * -------
17 * Match packet bytes against entries composed of ranged or non-ranged packet
22 * --- fields --->
33 * ------------------
53 * Translate the set to a sequence of lookup tables, one per field. Each table
65 * next-field rules the current rule maps to.
69 * To match, we perform table lookups using the values of grouped packet bits,
73 * A stand-alone, reference implementation, also including notes about possible
[all …]
/linux-6.12.1/fs/squashfs/
Dexport.c1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * Squashfs - a compressed read only filesystem for Linux
14 * The export code uses an inode lookup table to map inode numbers passed in
15 * filehandles to an inode location on disk. This table is stored compressed
16 * into metadata blocks. A second index table is used to locate these. This
17 * second index table for speed of access (and because it is small) is read at
20 * The inode lookup table is used only by the export code, inode disk
22 * without an intermediate lookup for all operations except the export ops.
37 * Look-up inode number (ino) in table, returning the inode location.
41 struct squashfs_sb_info *msblk = sb->s_fs_info; in squashfs_inode_lookup()
[all …]
Dfragment.c1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * Squashfs - a compressed read only filesystem for Linux
12 * This file implements code to handle compressed fragments (tail-end packed
16 * location on disk and compressed size using a fragment lookup table.
17 * Like everything in Squashfs this fragment lookup table is itself stored
18 * compressed into metadata blocks. A second index table is used to locate
19 * these. This second index table for speed of access (and because it
32 * Look-up fragment using the fragment index table. Return the on disk
38 struct squashfs_sb_info *msblk = sb->s_fs_info; in squashfs_frag_lookup()
43 if (fragment >= msblk->fragments) in squashfs_frag_lookup()
[all …]
/linux-6.12.1/include/linux/
Dof_platform.h1 /* SPDX-License-Identifier: GPL-2.0+ */
17 * struct of_dev_auxdata - lookup table entry for device names & platform_data
23 * This lookup table allows the caller of of_platform_populate() to override
24 * the names of devices when creating devices from the device tree. The table
29 * the device name to look up a specific device, but the Linux-specific names
33 * Note: Using an auxdata lookup table should be considered a last resort when
45 /* Macro to simplify populating a lookup table */
84 const struct of_dev_auxdata *lookup,
87 const struct of_dev_auxdata *lookup,
104 return -ENODEV; in of_platform_device_destroy()
[all …]
/linux-6.12.1/Documentation/arch/powerpc/
Dassociativity.rst9 are represented as being members of a sub-grouping domain. This performance
17 Hypervisor indicates the type/form of associativity used via "ibm,architecture-vec-5 property".
18 Bit 0 of byte 5 in the "ibm,architecture-vec-5" property indicates usage of Form 0 or Form 1.
20 bit 2 of byte 5 in the "ibm,architecture-vec-5" property is used.
23 ------
27 ------
28 With Form 1 a combination of ibm,associativity-reference-points, and ibm,associativity
34 The “ibm,associativity-reference-points” property contains a list of one or more numbers
43 if they belong to the same higher-level domains. For mismatch at every higher
48 -------
[all …]
/linux-6.12.1/Documentation/filesystems/
Dsquashfs.rst1 .. SPDX-License-Identifier: GPL-2.0
7 Squashfs is a compressed read-only filesystem for Linux.
14 Squashfs is intended for general read-only filesystem use, for archival
19 Mailing list: squashfs-devel@lists.sourceforge.net
23 ----------------------
39 Tail-end packing (fragments) yes no
44 32-bit uids/gids yes no
57 -----------------
59 As squashfs is a read-only filesystem, the mksquashfs program must be used to
64 The squashfs-tools development tree is now located on kernel.org
[all …]
Dpath-lookup.rst2 Pathname lookup
5 This write-up is based on three articles published at lwn.net:
7 - <https://lwn.net/Articles/649115/> Pathname lookup in Linux
8 - <https://lwn.net/Articles/649729/> RCU-walk: faster pathname lookup in Linux
9 - <https://lwn.net/Articles/650786/> A walk among the symlinks
15 - per-directory parallel name lookup.
16 - ``openat2()`` resolution restriction flags.
18 Introduction to pathname lookup
21 The most obvious aspect of pathname lookup, which very little
27 the early parts of the analysis we will divide off symlinks - leaving
[all …]
/linux-6.12.1/Documentation/devicetree/bindings/thermal/
Dgeneric-adc-thermal.yaml1 # SPDX-License-Identifier: GPL-2.0-only OR BSD-2-Clause
3 ---
4 $id: http://devicetree.org/schemas/thermal/generic-adc-thermal.yaml#
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
10 - Laxman Dewangan <ldewangan@nvidia.com>
16 temperature using voltage-temperature lookup table.
18 $ref: thermal-sensor.yaml#
22 const: generic-adc-thermal
24 '#thermal-sensor-cells':
27 io-channels:
[all …]
/linux-6.12.1/include/uapi/linux/
Dseg6_local.h2 * SR-IPv6 implementation
34 #define SEG6_LOCAL_MAX (__SEG6_LOCAL_MAX - 1)
40 /* adjacency segment (IPv6 cross-connect) */
42 /* lookup of next seg NH in table */
44 /* decap and L2 cross-connect */
46 /* decap and IPv6 cross-connect */
48 /* decap and IPv4 cross-connect */
50 /* decap and lookup of DA in v6 table */
52 /* decap and lookup of DA in v4 table */
60 /* lookup last seg in table */
[all …]
/linux-6.12.1/tools/include/uapi/linux/
Dseg6_local.h2 * SR-IPv6 implementation
31 #define SEG6_LOCAL_MAX (__SEG6_LOCAL_MAX - 1)
37 /* adjacency segment (IPv6 cross-connect) */
39 /* lookup of next seg NH in table */
41 /* decap and L2 cross-connect */
43 /* decap and IPv6 cross-connect */
45 /* decap and IPv4 cross-connect */
47 /* decap and lookup of DA in v6 table */
49 /* decap and lookup of DA in v4 table */
57 /* lookup last seg in table */
[all …]
/linux-6.12.1/drivers/staging/media/atomisp/pci/isp/kernels/bnlm/
Dia_css_bnlm_types.h1 /* SPDX-License-Identifier: GPL-2.0 */
20 * CSS-API header file for Bayer Non-Linear Mean parameters.
25 /* Bayer Non-Linear Mean configuration
44 * that fits the first-order exp() to default exp_lut in BNLM sheet
54 /* Index for n-th maximum candidate weight for each detail group */
58 /* A lookup table for 1/sqrt(1+mu) approximation */
63 /* A lookup table for SAD normalization */
68 /* A lookup table that models a weight's dependency on textures */
73 /* A lookup table that models a weight's dependency on a pixel's radial distance */
78 /* A lookup table to control denoise power depending on a pixel's radial distance */
/linux-6.12.1/include/linux/gpio/
Dmachine.h1 /* SPDX-License-Identifier: GPL-2.0 */
22 * struct gpiod_lookup - lookup table
32 * gpiod_lookup is a lookup table for associating GPIOs to specific devices and
46 struct gpiod_lookup table[]; member
50 * struct gpiod_hog - GPIO line hog table
67 * Helper for lookup tables with just one single lookup for a device.
72 .table = { \
111 void gpiod_add_lookup_table(struct gpiod_lookup_table *table);
113 void gpiod_remove_lookup_table(struct gpiod_lookup_table *table);
118 void gpiod_add_lookup_table(struct gpiod_lookup_table *table) {} in gpiod_add_lookup_table() argument
[all …]
/linux-6.12.1/net/l3mdev/
Dl3mdev.c1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * net/l3mdev/l3mdev.c - L3 master device implementation
23 return -EINVAL; in l3mdev_check_type()
42 if (hdlr->dev_lookup) { in l3mdev_table_lookup_register()
43 res = -EBUSY; in l3mdev_table_lookup_register()
47 hdlr->dev_lookup = fn; in l3mdev_table_lookup_register()
69 if (hdlr->dev_lookup == fn) in l3mdev_table_lookup_unregister()
70 hdlr->dev_lookup = NULL; in l3mdev_table_lookup_unregister()
79 lookup_by_table_id_t lookup; in l3mdev_ifindex_lookup_by_table_id() local
81 int ifindex = -EINVAL; in l3mdev_ifindex_lookup_by_table_id()
[all …]
/linux-6.12.1/drivers/net/ethernet/microchip/vcap/
Dvcap_ag_api.h1 /* SPDX-License-Identifier: BSD-3-Clause */
6 /* This file is autogenerated by cml-utils 2023-03-13 10:16:42 +0100.
63 * Used by 802.1BR Bridge Port Extension in an E-Tag
65 * Used by 802.1BR Bridge Port Extension in an E-Tag
67 * Set for frames containing an E-TAG (802.1BR Ethertype 893f)
69 * E-Tag group bits in 802.1BR Bridge Port Extension
71 * Used by 802.1BR Bridge Port Extension in an E-Tag
73 * Used by 802.1BR Bridge Port Extension in an E-Tag
111 * Set if frame has two or more Q-tags. Independent of port VLAN awareness
114 * one or more Q-tags. Independent of port VLAN awareness
[all …]
/linux-6.12.1/drivers/media/dvb-frontends/
Dstv0900_core.c1 // SPDX-License-Identifier: GPL-2.0-or-later
47 ((temp_chip->internal->i2c_adap != i2c_adap) || in find_inode()
48 (temp_chip->internal->i2c_addr != i2c_addr))) in find_inode()
50 temp_chip = temp_chip->next_inode; in find_inode()
61 struct stv0900_inode *del_node = find_inode(internal->i2c_adap, in remove_inode()
62 internal->i2c_addr); in remove_inode()
66 stv0900_first_inode = del_node->next_inode; in remove_inode()
68 while (prev_node->next_inode != del_node) in remove_inode()
69 prev_node = prev_node->next_inode; in remove_inode()
71 if (del_node->next_inode == NULL) in remove_inode()
[all …]
/linux-6.12.1/drivers/net/ethernet/netronome/nfp/nfpcore/
Dnfp_hwinfo.c1 // SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
2 /* Copyright (C) 2015-2017 Netronome Systems, Inc. */
4 /* Parse the hwinfo table that the ARM firmware builds in the ARM scratch SRAM
35 /* The Hardware Info Table defines the properties of the system.
37 * HWInfo v1 Table (fixed size)
39 * 0x0000: u32 version Hardware Info Table version (1.0)
40 * 0x0004: u32 size Total size of the table, including
42 * 0x0008: u32 jumptab Offset of key/value table
43 * 0x000c: u32 keys Total number of keys in the key/value table
44 * NNNNNN: Key/value jump table and string data
[all …]
/linux-6.12.1/Documentation/networking/devlink/
Ddevlink-dpipe.rst1 .. SPDX-License-Identifier: GPL-2.0
12 ``devlink-dpipe`` provides a standardized way to provide visibility into the
34 Level Path Compression trie (LPC-trie) in hardware.
45 The ``devlink-dpipe`` interface closes this gap. The hardware's pipeline is
46 modeled as a graph of match/action tables. Each table represents a specific
50 configuration, but the ``devlink-dpipe`` interface uses it for visibility
52 ``devlink-dpipe`` should change according to the changes done by the
58 different priorities and different lookup keys. On the other hand hardware
59 TCAM regions have a predefined lookup key. Offloading the TC filter rules
74 the packet. A ``table`` describes hardware blocks. An ``entry`` describes
[all …]
/linux-6.12.1/drivers/gpu/drm/
Ddrm_color_mgmt.c42 * Blob property to set the degamma lookup table (LUT) mapping pixel data
50 * linear/pass-thru gamma table should be used. This is generally the
51 * driver boot-up state too. Drivers can access this blob through
55 * Unsinged range property to give the size of the lookup table to be set
58 * publish the largest size, and sub-sample smaller sized LUTs (e.g. for
59 * split-gamma modes) appropriately.
63 * pixel data after the lookup through the degamma LUT and before the
64 * lookup through the gamma LUT. The data is interpreted as a struct
68 * unit/pass-thru matrix should be used. This is generally the driver
69 * boot-up state too. Drivers can access the blob for the color conversion
[all …]

12345678910>>...41