| /kernel/linux/linux-5.10/fs/nfs/blocklayout/ |
| D | extent_tree.c | 26 ext_tree_prev(struct pnfs_block_extent *be) in ext_tree_prev() argument
28 struct rb_node *node = rb_prev(&be->be_node); in ext_tree_prev()
33 ext_tree_next(struct pnfs_block_extent *be) in ext_tree_next() argument
35 struct rb_node *node = rb_next(&be->be_node); in ext_tree_next()
40 ext_f_end(struct pnfs_block_extent *be) in ext_f_end() argument
42 return be->be_f_offset + be->be_length; in ext_f_end()
49 struct pnfs_block_extent *be = NULL; in __ext_tree_search() local
52 be = ext_node(node); in __ext_tree_search()
53 if (start < be->be_f_offset) in __ext_tree_search()
55 else if (start >= ext_f_end(be)) in __ext_tree_search()
[all …]
|
| /kernel/linux/linux-4.19/fs/nfs/blocklayout/ |
| D | extent_tree.c | 26 ext_tree_prev(struct pnfs_block_extent *be) in ext_tree_prev() argument
28 struct rb_node *node = rb_prev(&be->be_node); in ext_tree_prev()
33 ext_tree_next(struct pnfs_block_extent *be) in ext_tree_next() argument
35 struct rb_node *node = rb_next(&be->be_node); in ext_tree_next()
40 ext_f_end(struct pnfs_block_extent *be) in ext_f_end() argument
42 return be->be_f_offset + be->be_length; in ext_f_end()
49 struct pnfs_block_extent *be = NULL; in __ext_tree_search() local
52 be = ext_node(node); in __ext_tree_search()
53 if (start < be->be_f_offset) in __ext_tree_search()
55 else if (start >= ext_f_end(be)) in __ext_tree_search()
[all …]
|
| /kernel/linux/linux-5.10/drivers/hwmon/ |
| D | Kconfig | 23 This support can also be built as a module. If so, the module
24 will be called hwmon.
51 This driver can also be built as a module. If so, the module
52 will be called abx500-temp.
61 chip can be found on Abit uGuru featuring motherboards (most modern
66 This driver can also be built as a module. If so, the module
67 will be called abituguru.
76 uGuru chip can be found on recent Abit motherboards (since end
80 This driver can also be built as a module. If so, the module
81 will be called abituguru3.
[all …]
|
| /kernel/linux/linux-4.19/drivers/hwmon/ |
| D | Kconfig | 22 This support can also be built as a module. If so, the module
23 will be called hwmon.
49 This driver can also be built as a module. If so, the module
50 will be called abx500-temp.
59 chip can be found on Abit uGuru featuring motherboards (most modern
64 This driver can also be built as a module. If so, the module
65 will be called abituguru.
74 uGuru chip can be found on recent Abit motherboards (since end
78 This driver can also be built as a module. If so, the module
79 will be called abituguru3.
[all …]
|
| /kernel/linux/linux-4.19/drivers/i2c/busses/ |
| D | Kconfig | 15 If you say yes to this option, support will be included for the SMB
20 This driver can also be built as a module. If so, the module
21 will be called i2c-ali1535.
27 If you say yes to this option, support will be included for the SMB
32 This driver can also be built as a module. If so, the module
33 will be called i2c-ali1563.
39 If you say yes to this option, support will be included for the
42 This driver can also be built as a module. If so, the module
43 will be called i2c-ali15x3.
49 If you say yes to this option, support will be included for the AMD
[all …]
|
| /kernel/linux/linux-4.19/drivers/rtc/ |
| D | Kconfig | 19 be allowed to plug one or more RTCs to your system. You will
28 If you say yes here, the system time (wall clock) will be set using
37 The RTC device that will be used to (re)initialize the system
43 The driver for this RTC device must be loaded before late_initcall
44 functions run, so it must usually be statically linked.
46 This clock should be battery-backed, so that it reads the correct
51 be useful to reinitialize system time when resuming from system
59 If you say yes here, the system time (wall clock) will be stored
107 Other RTCs will not be available through that API.
122 can be accessed as /dev/rtc, which is a name
[all …]
|
| /kernel/linux/linux-5.10/drivers/hwmon/pmbus/ |
| D | Kconfig | 12 This driver can also be built as a module. If so, the module will
13 be called pmbus_core.
26 This driver can also be built as a module. If so, the module will
27 be called pmbus.
37 This driver can also be built as a module. If so, the module will
38 be called adm1266.
47 This driver can also be built as a module. If so, the module will
48 be called adm1275.
56 This driver can also be built as a module. If so, the module will
57 be called bel-pfe.
[all …]
|
| /kernel/linux/linux-5.10/drivers/rtc/ |
| D | Kconfig | 20 be allowed to plug one or more RTCs to your system. You will
29 If you say yes here, the system time (wall clock) will be set using
38 The RTC device that will be used to (re)initialize the system
44 This clock should be battery-backed, so that it reads the correct
49 be useful to reinitialize system time when resuming from system
57 If you say yes here, the system time (wall clock) will be stored
105 Other RTCs will not be available through that API.
120 can be accessed as /dev/rtc, which is a name
142 RTC test driver. It's a software RTC which can be
149 This driver can also be built as a module. If so, the module
[all …]
|
| /kernel/linux/linux-5.10/drivers/i2c/busses/ |
| D | Kconfig | 16 If you say yes to this option, support will be included for the SMB
21 This driver can also be built as a module. If so, the module
22 will be called i2c-ali1535.
28 If you say yes to this option, support will be included for the SMB
33 This driver can also be built as a module. If so, the module
34 will be called i2c-ali1563.
40 If you say yes to this option, support will be included for the
43 This driver can also be built as a module. If so, the module
44 will be called i2c-ali15x3.
50 If you say yes to this option, support will be included for the AMD
[all …]
|
| /kernel/linux/linux-5.10/tools/perf/util/ |
| D | genelf_debug.c | 46 buffer_ext_dump(struct buffer_ext *be, const char *msg) in buffer_ext_dump() argument
50 for (i = 0 ; i < be->cur_pos; i++) in buffer_ext_dump()
51 warnx("%4zu 0x%02x", i, (((char *)be->data)[i]) & 0xff); in buffer_ext_dump()
55 buffer_ext_add(struct buffer_ext *be, void *addr, size_t sz) in buffer_ext_add() argument
58 size_t be_sz = be->max_sz; in buffer_ext_add()
61 if ((be->cur_pos + sz) < be_sz) { in buffer_ext_add()
62 memcpy(be->data + be->cur_pos, addr, sz); in buffer_ext_add()
63 be->cur_pos += sz; in buffer_ext_add()
72 tmp = realloc(be->data, be_sz); in buffer_ext_add()
76 be->data = tmp; in buffer_ext_add()
[all …]
|
| /kernel/linux/linux-4.19/tools/perf/util/ |
| D | genelf_debug.c | 48 buffer_ext_dump(struct buffer_ext *be, const char *msg) in buffer_ext_dump() argument
52 for (i = 0 ; i < be->cur_pos; i++) in buffer_ext_dump()
53 warnx("%4zu 0x%02x", i, (((char *)be->data)[i]) & 0xff); in buffer_ext_dump()
57 buffer_ext_add(struct buffer_ext *be, void *addr, size_t sz) in buffer_ext_add() argument
60 size_t be_sz = be->max_sz; in buffer_ext_add()
63 if ((be->cur_pos + sz) < be_sz) { in buffer_ext_add()
64 memcpy(be->data + be->cur_pos, addr, sz); in buffer_ext_add()
65 be->cur_pos += sz; in buffer_ext_add()
74 tmp = realloc(be->data, be_sz); in buffer_ext_add()
78 be->data = tmp; in buffer_ext_add()
[all …]
|
| /kernel/linux/linux-4.19/drivers/iio/adc/ |
| D | Kconfig | 23 To compile this driver as a module, choose M here: the module will be
34 module will be called ad7291.
46 module will be called ad7298.
59 module will be called ad7476.
70 To compile this driver as a module, choose M here: the module will be
81 To compile this driver as a module, choose M here: the module will be
93 module will be called AD7793.
105 module will be called ad7887.
117 module will be called ad7923.
130 To compile this driver as a module, choose M here: the module will be
[all …]
|
| /kernel/linux/linux-5.10/drivers/iio/adc/ |
| D | Kconfig | 39 To compile this driver as a module, choose M here: the module will be
52 module will be called ad7192.
64 To compile this driver as a module, choose M here: the module will be
75 module will be called ad7291.
85 module will be called ad7292.
97 module will be called ad7298.
113 module will be called ad7476.
129 module will be called ad7606_parallel.
140 module will be called ad7606_spi.
151 To compile this driver as a module, choose M here: the module will be
[all …]
|
| /kernel/linux/linux-4.19/drivers/hwmon/pmbus/ |
| D | Kconfig | 12 This driver can also be built as a module. If so, the module will
13 be called pmbus_core.
26 This driver can also be built as a module. If so, the module will
27 be called pmbus.
37 This driver can also be built as a module. If so, the module will
38 be called adm1275.
47 This driver can also be built as a module. If so, the module will
48 be called ibm-cffps.
57 This driver can also be built as a module. If so, the module will
58 be called ir35521.
[all …]
|
| /kernel/linux/linux-5.10/Documentation/filesystems/caching/ |
| D | netfs-api.rst | 59 This first two fields should be filled in before registration, and the third
60 will be filled in by the registration function; any other fields should just be
68 entire in-cache hierarchy for this netfs will be scrapped and begun
71 (3) The cookie representing the primary index will be allocated according to
105 (1) Any index containing non-index objects should be restricted to a single
106 cache. Any such objects created within an index will be created in the
107 first cache only. The cache in which an index is created can be
110 (2) The entry data must be atomically journallable, so it is limited to about
111 400 bytes at present. At least 400 bytes will be available.
113 (3) The depth of the index tree should be judged with care as the search
[all …]
|
| D | backend-api.rst | 7 The FS-Cache system provides an API by which actual caches can be supplied to
17 To start off, a cache definition must be initialised and registered for each
21 The cache definition (struct fscache_cache) should be initialised by calling::
39 The cache should then be registered with FS-Cache by passing a pointer to the
46 Two extra arguments should also be supplied:
49 master index in this cache. Netfs primary index entries will be created
53 * "tagname" which, if given, should be a text string naming this cache. If
54 this is NULL, the identifier will be used instead. For CacheFS, the
55 identifier is set to name the underlying block device and the tag can be
59 is already in use. 0 will be returned on success.
[all …]
|
| /kernel/linux/linux-4.19/Documentation/security/keys/ |
| D | core.rst | 6 user mappings, and similar to be cached in the kernel for the use of
13 The key service can be configured on by enabling:
46 * Each key is of a defined "type". Types must be registered inside the
48 can be added or used. Userspace programs cannot define new types directly.
51 number of operations that can be performed on a key of that type.
53 Should a type be removed from the system, all the keys of that type will
54 be invalidated.
56 * Each key has a description. This should be a printable string. The key
62 whether a kernel service will be able to find the key.
64 * Each key can be set to expire at a specific time by the key type's
[all …]
|
| /kernel/linux/linux-5.10/Documentation/security/keys/ |
| D | core.rst | 6 user mappings, and similar to be cached in the kernel for the use of
13 The key service can be configured on by enabling:
46 * Each key is of a defined "type". Types must be registered inside the
48 can be added or used. Userspace programs cannot define new types directly.
51 number of operations that can be performed on a key of that type.
53 Should a type be removed from the system, all the keys of that type will
54 be invalidated.
56 * Each key has a description. This should be a printable string. The key
62 whether a kernel service will be able to find the key.
64 * Each key can be set to expire at a specific time by the key type's
[all …]
|
| /kernel/linux/linux-4.19/Documentation/networking/ |
| D | rxrpc.txt | 6 that can be used to perform RxRPC remote operations. This is done over sockets
67 manage security on the client end. The server end must of necessity be
99 endpoint, thus allowing the endpoints to be shared, even to the same
103 to multiple services. A service may be considered the RxRPC equivalent of
106 (*) Client-originating packets are marked, thus a transport endpoint can be
110 (*) Up to a billion connections may be supported concurrently between one
123 billion calls, but only up to four calls may be in progress on a
143 connection lapse before the client, the security will be renegotiated if
152 been received but may yet be discarded and re-requested. The sender may
162 (*) An call may be aborted by either end at any time up to its completion.
[all …]
|
| /kernel/linux/linux-4.19/Documentation/filesystems/caching/ |
| D | backend-api.txt | 5 The FS-Cache system provides an API by which actual caches can be supplied to
16 To start off, a cache definition must be initialised and registered for each
20 The cache definition (struct fscache_cache) should be initialised by calling:
38 The cache should then be registered with FS-Cache by passing a pointer to the
45 Two extra arguments should also be supplied:
48 master index in this cache. Netfs primary index entries will be created
52 (*) "tagname" which, if given, should be a text string naming this cache. If
53 this is NULL, the identifier will be used instead. For CacheFS, the
54 identifier is set to name the underlying block device and the tag can be
58 is already in use. 0 will be returned on success.
[all …]
|
| D | netfs-api.txt | 58 This first two fields should be filled in before registration, and the third
59 will be filled in by the registration function; any other fields should just be
67 entire in-cache hierarchy for this netfs will be scrapped and begun
70 (3) The cookie representing the primary index will be allocated according to
105 (1) Any index containing non-index objects should be restricted to a single
106 cache. Any such objects created within an index will be created in the
107 first cache only. The cache in which an index is created can be
110 (2) The entry data must be atomically journallable, so it is limited to about
111 400 bytes at present. At least 400 bytes will be available.
113 (3) The depth of the index tree should be judged with care as the search
[all …]
|
| /kernel/linux/linux-5.10/net/sched/ |
| D | Kconfig | 17 is a FIFO (first come, first served). If you say Y here, you will be
19 then be attached to different network devices. This is useful for
23 This code is considered to be experimental.
37 If you say Y here and to "/proc file system" below, you will be able
63 module will be called sch_cbq.
77 module will be called sch_htb.
86 module will be called sch_hfsc.
100 module will be called sch_atm.
109 module will be called sch_prio.
118 module will be called sch_multiq.
[all …]
|
| /kernel/linux/linux-4.19/drivers/nvmem/ |
| D | Kconfig | 9 This driver can also be built as a module. If so, the module
10 will be called nvmem_core.
24 This driver can also be built as a module. If so, the module
25 will be called nvmem-imx-iim.
36 This driver can also be built as a module. If so, the module
37 will be called nvmem-imx-ocotp.
47 will be called nvmem_lpc18xx_eeprom.
57 will be called nvmem_lpc18xx_otp.
68 This driver can also be built as a module. If so, the module
69 will be called nvmem-mxs-ocotp.
[all …]
|
| /kernel/linux/linux-5.10/Documentation/networking/ |
| D | rxrpc.rst | 8 that can be used to perform RxRPC remote operations. This is done over sockets
68 manage security on the client end. The server end must of necessity be
99 endpoint, thus allowing the endpoints to be shared, even to the same
103 to multiple services. A service may be considered the RxRPC equivalent of
106 (#) Client-originating packets are marked, thus a transport endpoint can be
110 (#) Up to a billion connections may be supported concurrently between one
123 billion calls, but only up to four calls may be in progress on a
143 connection lapse before the client, the security will be renegotiated if
152 been received but may yet be discarded and re-requested. The sender may
162 (#) An call may be aborted by either end at any time up to its completion.
[all …]
|
| /kernel/linux/linux-5.10/fs/btrfs/ |
| D | ref-verify.c | 27 * be used to verify the extent tree is consistent as these should all match
45 * were called with since it could be different from ref_root. We also store
76 struct block_entry *be) in insert_block_entry() argument
85 if (entry->bytenr > be->bytenr) in insert_block_entry()
87 else if (entry->bytenr < be->bytenr) in insert_block_entry()
93 rb_link_node(&be->node, parent_node, p); in insert_block_entry()
94 rb_insert_color(&be->node, root); in insert_block_entry()
232 static void free_block_entry(struct block_entry *be) in free_block_entry() argument
239 while ((n = rb_first(&be->roots))) { in free_block_entry()
241 rb_erase(&re->node, &be->roots); in free_block_entry()
[all …]
|