Home
last modified time | relevance | path

Searched full:trivial (Results 1 – 25 of 324) sorted by relevance

12345678910>>...13

/Linux-v6.6/Documentation/devicetree/bindings/rtc/
Dtrivial-rtc.yaml4 $id: http://devicetree.org/schemas/rtc/trivial-rtc.yaml#
7 title: Trivial RTCs
13 This is a list of trivial RTC devices that have simple device tree
/Linux-v6.6/include/asm-generic/
Dpgtable-nop4d.h17 * The "pgd_xxx()" functions here are trivial for a folded two-level
47 * allocating and freeing a p4d is trivial: the 1-entry p4d is
Dpgtable-nopud.h24 * The "p4d_xxx()" functions here are trivial for a folded two-level
55 * allocating and freeing a pud is trivial: the 1-entry pud is
Dpgtable-nopmd.h26 * The "pud_xxx()" functions here are trivial for a folded two-level
59 * allocating and freeing a pmd is trivial: the 1-entry pmd is
/Linux-v6.6/Documentation/devicetree/bindings/
Dtrivial-devices.yaml4 $id: http://devicetree.org/schemas/trivial-devices.yaml#
7 title: Trivial I2C and SPI devices
13 This is a list of trivial I2C and SPI devices that have simple device tree
98 # DH electronics GmbH on-board CPLD trivial SPI device
242 # Menlo on-board CPLD trivial SPI device
Dwriting-schema.rst166 make dt_binding_check DT_SCHEMA_FILES=trivial-devices.yaml
168 make dtbs_check DT_SCHEMA_FILES=trivial-devices.yaml
/Linux-v6.6/tools/testing/selftests/arm64/fp/
Dasm-utils.S131 // Trivial memory copy: copy x2 bytes, starting at address x1, to address x0.
160 // Trivial memory fill: fill x1 bytes starting at address x0 with byte w2
Dfp-pidbench.S5 // Trivial syscall overhead benchmark.
/Linux-v6.6/drivers/net/wireless/broadcom/brcm80211/brcmfmac/
Dof.c28 * the trivial map should be used. in brcmf_of_get_country_codes()
31 of_property_read_bool(np, "brcm,ccode-map-trivial"); in brcmf_of_get_country_codes()
/Linux-v6.6/fs/hfs/
Dtrans.c24 * the 'trivial' name-mangling scheme, returning the length of the
90 * using the 'trivial' name-mangling scheme, returning the length of
/Linux-v6.6/tools/testing/selftests/rcutorture/configs/rcu/
DTRIVIAL.boot1 rcutorture.torture_type=trivial
/Linux-v6.6/tools/testing/selftests/x86/
Dtrivial_program.c1 /* Trivial program to check that compilation with certain flags is working. */
Dtrivial_32bit_program.c3 * Trivial program to check that we have a valid 32-bit build environment.
Dtrivial_64bit_program.c3 * Trivial program to check that we have a valid 64-bit build environment.
/Linux-v6.6/Documentation/devicetree/bindings/net/wireless/
Dbrcm,bcm4329-fmac.yaml88 brcm,ccode-map-trivial:
90 Use a trivial mapping of ISO3166 country codes to brcmfmac firmware
/Linux-v6.6/Documentation/core-api/
Dprintk-index.rst19 Finding these changes in the sources would require non-trivial parsers.
21 is not always trivial. Various changes might be backported. Various kernel
/Linux-v6.6/arch/m68k/q40/
DREADME110 q40ints.c now contains a trivial hack for (a), (b) is more difficult
125 Unfortunately the AT->PC translation isn't quite trivial and even worse, my
/Linux-v6.6/arch/sh/include/asm/
Dio_generic.h3 * Trivial I/O routine definitions, intentionally meant to be included
/Linux-v6.6/Documentation/maintainer/
Dfeature-and-driver-maintainers.rst55 no matter how trivial. If the patch is a tree wide change and modifies
110 for any piece of code, no matter how trivial. It spreads the burden, helps
/Linux-v6.6/tools/testing/selftests/bpf/progs/
Dbtf_dump_test_case_syntax.c77 * While previous function pointers are pretty trivial (C-syntax-level
78 * trivial), the following are deciphered here for future generations:
/Linux-v6.6/drivers/staging/vc04_services/interface/vchiq_arm/
Dvchiq_cfg.h8 /* The version of VCHIQ - change with any non-trivial change */
/Linux-v6.6/arch/sh/mm/
Duncached.c11 * Legacy platforms handle trivial transitions between cached and
/Linux-v6.6/tools/include/tools/
Ddis-asm-compat.h15 * Trivial fprintf wrapper to be used as the fprintf_styled_func argument to
/Linux-v6.6/arch/m68k/include/asm/
Dpgtable_no.h17 * Trivial page table functions.
/Linux-v6.6/arch/xtensa/include/asm/
Dpgalloc.h20 * Allocating and freeing a pmd is trivial: the 1-entry pmd is

12345678910>>...13