| /kernel/liteos_m/arch/risc-v/nuclei/gcc/nmsis/Core/Include/ |
| D | core_compatiable.h | 4 * SPDX-License-Identifier: Apache-2.0
10 * www.apache.org/licenses/LICENSE-2.0
32 * \brief A few functions that compatiable with ARM CMSIS-Core.
35 * Here we provided a few functions that compatiable with ARM CMSIS-Core,
42 /** \brief Data Synchronization Barrier, compatiable with ARM */
45 /** \brief Data Memory Barrier, compatiable with ARM */
71 #define __SSAT(val, sat) __RV_SCLIP32((val), (sat-1))
76 const int32_t max = (int32_t)((1U << (sat - 1U)) - 1U);
77 const int32_t min = -1 - max ;
101 const uint32_t max = ((1U << sat) - 1U);
[all …]
|
| /kernel/linux/linux-6.6/net/x25/ |
| D | x25_facilities.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later
15 * apr/14/05 Shaun Pereira - Allow fast select with no restriction
28 * x25_parse_facilities - Parse facilities from skb into the facilities structs
36 * -1 - Parsing error, caller should drop call and clean up
37 * 0 - Parse OK, this skb has no facilities
38 * >0 - Parse OK, returns the length of the facilities header
55 dte_facs->calling_len = 0; in x25_parse_facilities()
56 dte_facs->called_len = 0; in x25_parse_facilities()
57 memset(dte_facs->called_ae, '\0', sizeof(dte_facs->called_ae)); in x25_parse_facilities()
58 memset(dte_facs->calling_ae, '\0', sizeof(dte_facs->calling_ae)); in x25_parse_facilities()
[all …]
|
| /kernel/linux/linux-5.10/net/x25/ |
| D | x25_facilities.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later
15 * apr/14/05 Shaun Pereira - Allow fast select with no restriction
28 * x25_parse_facilities - Parse facilities from skb into the facilities structs
36 * -1 - Parsing error, caller should drop call and clean up
37 * 0 - Parse OK, this skb has no facilities
38 * >0 - Parse OK, returns the length of the facilities header
55 dte_facs->calling_len = 0; in x25_parse_facilities()
56 dte_facs->called_len = 0; in x25_parse_facilities()
57 memset(dte_facs->called_ae, '\0', sizeof(dte_facs->called_ae)); in x25_parse_facilities()
58 memset(dte_facs->calling_ae, '\0', sizeof(dte_facs->calling_ae)); in x25_parse_facilities()
[all …]
|
| /kernel/linux/linux-6.6/drivers/usb/typec/mux/ |
| D | nb7vpq904m.c | 1 // SPDX-License-Identifier: GPL-2.0+
3 * OnSemi NB7VPQ904M Type-C driver
75 struct mutex lock; /* protect non-concurrent retimer & switch */
98 regmap_update_bits(nb7->regmap, EQ_SETTING_REG(channel), in nb7vpq904m_set_channel()
100 regmap_update_bits(nb7->regmap, OUTPUT_COMPRESSION_AND_POL_REG(channel), in nb7vpq904m_set_channel()
102 regmap_update_bits(nb7->regmap, FLAT_GAIN_REG(channel), in nb7vpq904m_set_channel()
104 regmap_update_bits(nb7->regmap, LOSS_MATCH_REG(channel), in nb7vpq904m_set_channel()
110 bool reverse = (nb7->orientation == TYPEC_ORIENTATION_REVERSE); in nb7vpq904m_set() local
112 switch (nb7->mode) { in nb7vpq904m_set()
114 regmap_write(nb7->regmap, GEN_DEV_SET_REG, in nb7vpq904m_set()
[all …]
|
| /kernel/linux/linux-6.6/Documentation/filesystems/ |
| D | xfs-online-fsck-design.rst | 1 .. SPDX-License-Identifier: GPL-2.0
8 Heading 3 uses "----"
25 - To help kernel distributors understand exactly what the XFS online fsck
28 - To help people reading the code to familiarize themselves with the relevant
31 - To help developers maintaining the system by capturing the reasons
59 - Provide a hierarchy of names through which application programs can associate
60 arbitrary blobs of data for any length of time,
62 - Virtualize physical storage media across those names, and
64 - Retrieve the named data blobs at any time.
66 - Examine resource usage.
[all …]
|
| /kernel/linux/linux-5.10/Documentation/userspace-api/media/v4l/ |
| D | vidioc-decoder-cmd.rst | 1 .. SPDX-License-Identifier: GFDL-1.1-no-invariants-or-later
13 VIDIOC_DECODER_CMD - VIDIOC_TRY_DECODER_CMD - Execute an decoder command
38 These ioctls control an audio/video (usually MPEG-) decoder.
55 command to the decoder, and all buffered data is discarded. Applies to both
68 .. flat-table:: struct v4l2_decoder_cmd
69 :header-rows: 0
70 :stub-columns: 0
73 * - __u32
74 - ``cmd``
75 -
[all …]
|
| /kernel/linux/linux-6.6/Documentation/userspace-api/media/v4l/ |
| D | vidioc-decoder-cmd.rst | 1 .. SPDX-License-Identifier: GFDL-1.1-no-invariants-or-later
13 VIDIOC_DECODER_CMD - VIDIOC_TRY_DECODER_CMD - Execute an decoder command
38 These ioctls control an audio/video (usually MPEG-) decoder.
55 command to the decoder, and all buffered data is discarded. Applies to both
68 .. flat-table:: struct v4l2_decoder_cmd
69 :header-rows: 0
70 :stub-columns: 0
73 * - __u32
74 - ``cmd``
75 -
[all …]
|
| /kernel/linux/linux-6.6/Documentation/devicetree/bindings/media/i2c/ |
| D | maxim,max9286.yaml | 1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
4 ---
6 $schema: http://devicetree.org/meta-schemas/core.yaml#
11 - Jacopo Mondi <jacopo+renesas@jmondi.org>
12 - Kieran Bingham <kieran.bingham+renesas@ideasonboard.com>
13 - Laurent Pinchart <laurent.pinchart+renesas@ideasonboard.com>
14 - Niklas Söderlund <niklas.soderlund+renesas@ragnatech.se>
17 The MAX9286 deserializer receives video data on up to 4 Gigabit Multimedia
18 Serial Links (GMSL) and outputs them on a CSI-2 D-PHY port using up to 4 data
21 In addition to video data, the GMSL links carry a bidirectional control
[all …]
|
| /kernel/linux/linux-5.10/Documentation/livepatch/ |
| D | system-state.rst | 22 - store data needed to manipulate and restore the system state
24 - define compatibility between livepatches using a change id
44 - *id*
46 - Non-zero number used to identify the affected system state.
48 - *version*
50 - Number describing the variant of the system state change that
55 - *klp_get_state(patch, id)*
57 - Get struct klp_state associated with the given livepatch
60 - *klp_get_prev_state(id)*
62 - Get struct klp_state associated with the given feature id and
[all …]
|
| /kernel/linux/linux-6.6/Documentation/livepatch/ |
| D | system-state.rst | 22 - store data needed to manipulate and restore the system state
24 - define compatibility between livepatches using a change id
44 - *id*
46 - Non-zero number used to identify the affected system state.
48 - *version*
50 - Number describing the variant of the system state change that
55 - klp_get_state()
57 - Get struct klp_state associated with the given livepatch
60 - klp_get_prev_state()
62 - Get struct klp_state associated with the given feature id and
[all …]
|
| /kernel/linux/linux-6.6/Documentation/devicetree/bindings/soc/fsl/cpm_qe/ |
| D | fsl,cpm1-scc-qmc.yaml | 1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
3 ---
4 $id: http://devicetree.org/schemas/soc/fsl/cpm_qe/fsl,cpm1-scc-qmc.yaml#
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
10 - Herve Codina <herve.codina@bootlin.com>
19 - enum:
20 - fsl,mpc885-scc-qmc
21 - fsl,mpc866-scc-qmc
22 - const: fsl,cpm1-scc-qmc
26 - description: SCC (Serial communication controller) register base
[all …]
|
| /kernel/linux/linux-5.10/Documentation/core-api/irq/ |
| D | irq-domain.rst | 9 that each one gets assigned non-overlapping allocations of Linux
24 For this reason we need a mechanism to separate controller-local
28 irq numbers, but they don't provide any support for reverse mapping of
29 the controller-local IRQ (hwirq) number into the Linux IRQ number
35 reverse mapping scheme.
39 be easily extended to support other IRQ topology data sources.
67 callbacks) then it can be directly obtained from irq_data->hwirq.
72 There are several mechanisms available for reverse mapping from hwirq
74 Which reverse map type should be used depends on the use case. Each
75 of the reverse map types are described below:
[all …]
|
| /kernel/linux/linux-6.6/drivers/parport/ |
| D | ieee1284_ops.c | 1 // SPDX-License-Identifier: GPL-2.0
2 /* IEEE-1284 operations for parport.
5 * they are used by the low-level drivers. If they have a special way
7 * the function pointers in port->ops); if not, they can just use these
31 * One-way data transfer functions. *
43 struct pardevice *dev = port->physport->cad; in parport_ieee1284_write_compat()
47 if (port->irq != PARPORT_IRQ_NONE) { in parport_ieee1284_write_compat()
52 port->physport->ieee1284.phase = IEEE1284_PH_FWD_DATA; in parport_ieee1284_write_compat()
56 unsigned long expire = jiffies + dev->timeout; in parport_ieee1284_write_compat()
112 pr_debug("%s: Timed out\n", port->name); in parport_ieee1284_write_compat()
[all …]
|
| /kernel/linux/linux-5.10/drivers/parport/ |
| D | ieee1284_ops.c | 1 // SPDX-License-Identifier: GPL-2.0
2 /* IEEE-1284 operations for parport.
5 * they are used by the low-level drivers. If they have a special way
7 * the function pointers in port->ops); if not, they can just use these
31 * One-way data transfer functions. *
43 struct pardevice *dev = port->physport->cad; in parport_ieee1284_write_compat()
47 if (port->irq != PARPORT_IRQ_NONE) { in parport_ieee1284_write_compat()
52 port->physport->ieee1284.phase = IEEE1284_PH_FWD_DATA; in parport_ieee1284_write_compat()
56 unsigned long expire = jiffies + dev->timeout; in parport_ieee1284_write_compat()
112 pr_debug("%s: Timed out\n", port->name); in parport_ieee1284_write_compat()
[all …]
|
| /kernel/linux/linux-5.10/drivers/md/bcache/ |
| D | closure.c | 1 // SPDX-License-Identifier: GPL-2.0
24 if (cl->fn && !(flags & CLOSURE_DESTRUCTOR)) { in closure_put_after_sub()
25 atomic_set(&cl->remaining, in closure_put_after_sub()
29 struct closure *parent = cl->parent; in closure_put_after_sub()
30 closure_fn *destructor = cl->fn; in closure_put_after_sub()
46 closure_put_after_sub(cl, atomic_sub_return(v, &cl->remaining)); in closure_sub()
50 * closure_put - decrement a closure's refcount
54 closure_put_after_sub(cl, atomic_dec_return(&cl->remaining)); in closure_put()
58 * closure_wake_up - wake up all closures on a wait list, without memory barrier
64 struct llist_node *reverse = NULL; in __closure_wake_up() local
[all …]
|
| /kernel/linux/linux-6.6/drivers/md/bcache/ |
| D | closure.c | 1 // SPDX-License-Identifier: GPL-2.0
30 if (cl->fn && !(flags & CLOSURE_DESTRUCTOR)) { in closure_put_after_sub()
31 atomic_set(&cl->remaining, in closure_put_after_sub()
35 struct closure *parent = cl->parent; in closure_put_after_sub()
36 closure_fn *destructor = cl->fn; in closure_put_after_sub()
52 closure_put_after_sub(cl, atomic_sub_return(v, &cl->remaining)); in closure_sub()
56 * closure_put - decrement a closure's refcount
60 closure_put_after_sub(cl, atomic_dec_return(&cl->remaining)); in closure_put()
64 * closure_wake_up - wake up all closures on a wait list, without memory barrier
70 struct llist_node *reverse = NULL; in __closure_wake_up() local
[all …]
|
| /kernel/linux/linux-6.6/Documentation/core-api/irq/ |
| D | irq-domain.rst | 9 that each one gets assigned non-overlapping allocations of Linux
24 For this reason we need a mechanism to separate controller-local
28 irq numbers, but they don't provide any support for reverse mapping of
29 the controller-local IRQ (hwirq) number into the Linux IRQ number
35 reverse mapping scheme.
39 be easily extended to support other IRQ topology data sources.
61 - irq_resolve_mapping() returns a pointer to the irq_desc structure
64 - irq_find_mapping() returns a Linux IRQ number for a given domain and
66 - irq_linear_revmap() is now identical to irq_find_mapping(), and is
68 - generic_handle_domain_irq() handles an interrupt described by a
[all …]
|
| /kernel/linux/linux-6.6/include/linux/ |
| D | crc8.h | 12 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
40 * crc8_populate_lsb - fill crc table for given polynomial in regular bit order.
53 * - lsb first: poly = 10101011(1) = 0xAB
58 * crc8_populate_msb - fill crc table for given polynomial in reverse bit order.
64 * reverse bit order (msb first). Polynomials in CRC algorithms are typically
71 * - msb first: poly = (1)11010101 = 0xD5
76 * crc8() - calculate a crc8 over the given input data.
79 * @pdata: pointer to data buffer.
80 * @nbytes: number of bytes in data buffer.
88 * discontiguous blocks of data. When generating the CRC the
[all …]
|
| /kernel/linux/linux-5.10/include/linux/ |
| D | crc8.h | 12 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
40 * crc8_populate_lsb - fill crc table for given polynomial in regular bit order.
53 * - lsb first: poly = 10101011(1) = 0xAB
58 * crc8_populate_msb - fill crc table for given polynomial in reverse bit order.
64 * reverse bit order (msb first). Polynomials in CRC algorithms are typically
71 * - msb first: poly = (1)11010101 = 0xD5
76 * crc8() - calculate a crc8 over the given input data.
79 * @pdata: pointer to data buffer.
80 * @nbytes: number of bytes in data buffer.
88 * discontiguous blocks of data. When generating the CRC the
[all …]
|
| D | interconnect-provider.h | 1 /* SPDX-License-Identifier: GPL-2.0 */
18 * struct icc_node_data - icc node data
29 * struct icc_onecell_data - driver data for onecell interconnect providers
40 void *data);
43 * struct icc_provider - interconnect provider (controller) entity that might
53 * @xlate: provider-specific callback for mapping nodes from phandle arguments
54 * @xlate_extended: vendor-specific callback for mapping node data from phandle arguments
57 * @inter_set: whether inter-provider pairs will be configured with @set
58 * @data: pointer to private data
68 struct icc_node* (*xlate)(struct of_phandle_args *spec, void *data);
[all …]
|
| /kernel/linux/linux-6.6/drivers/media/test-drivers/vidtv/ |
| D | vidtv_s302m.c | 1 // SPDX-License-Identifier: GPL-2.0
22 #include <linux/fixp-arith.h>
50 static const u8 reverse[256] = { variable
156 while (head->next) in vidtv_s302m_access_unit_init()
157 head = head->next; in vidtv_s302m_access_unit_init()
159 head->next = au; in vidtv_s302m_access_unit_init()
167 struct vidtv_access_unit *head = e->access_units; in vidtv_s302m_access_unit_destroy()
172 head = head->next; in vidtv_s302m_access_unit_destroy()
176 e->access_units = NULL; in vidtv_s302m_access_unit_destroy()
184 if (e->sync && e->sync->is_video_encoder) { in vidtv_s302m_alloc_au()
[all …]
|
| /kernel/linux/linux-5.10/drivers/media/test-drivers/vidtv/ |
| D | vidtv_s302m.c | 1 // SPDX-License-Identifier: GPL-2.0
22 #include <linux/fixp-arith.h>
50 static const u8 reverse[256] = { variable
156 while (head->next) in vidtv_s302m_access_unit_init()
157 head = head->next; in vidtv_s302m_access_unit_init()
159 head->next = au; in vidtv_s302m_access_unit_init()
167 struct vidtv_access_unit *head = e->access_units; in vidtv_s302m_access_unit_destroy()
172 head = head->next; in vidtv_s302m_access_unit_destroy()
176 e->access_units = NULL; in vidtv_s302m_access_unit_destroy()
184 if (e->sync && e->sync->is_video_encoder) { in vidtv_s302m_alloc_au()
[all …]
|
| /kernel/linux/linux-6.6/fs/xfs/libxfs/ |
| D | xfs_rmap_btree.c | 1 // SPDX-License-Identifier: GPL-2.0
28 * Reverse map btree.
30 * This is a per-ag tree used to track the owner(s) of a given extent. With
32 * from classic XFS. Owner records for data extents are inserted when the
48 * reverse lookups will be to find the owner(s) of a particular block, or to
49 * try to recover tree and file data from corrupt primary metadata.
56 return xfs_rmapbt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_rmapbt_dup_cursor()
57 cur->bc_ag.agbp, cur->bc_ag.pag); in xfs_rmapbt_dup_cursor()
66 struct xfs_buf *agbp = cur->bc_ag.agbp; in xfs_rmapbt_set_root()
67 struct xfs_agf *agf = agbp->b_addr; in xfs_rmapbt_set_root()
[all …]
|
| /kernel/linux/linux-6.6/Documentation/driver-api/usb/ |
| D | anchors.rst | 11 for them. The anchor is a data structure takes care of
20 initialise the data structure.
42 --------------------------------
45 are called in the reverse temporal order they were submitted.
46 This way no data can be reordered.
49 ----------------------------------
53 are processed in the reverse temporal order they were submitted.
60 -----------------------------------
65 ---------------------------------------
72 --------------------------
[all …]
|
| /kernel/linux/linux-5.10/Documentation/driver-api/usb/ |
| D | anchors.rst | 11 for them. The anchor is a data structure takes care of
20 initialise the data structure.
42 --------------------------------
45 are called in the reverse temporal order they were submitted.
46 This way no data can be reordered.
49 ----------------------------------
53 are processed in the reverse temporal order they were submitted.
60 -----------------------------------
65 ---------------------------------------
72 --------------------------
[all …]
|