Linux cpanel.rrshost.in 5.15.0-25-generic #25-Ubuntu SMP Wed Mar 30 15:54:22 UTC 2022 x86_64
Apache
: 109.123.238.221 | : 172.70.80.110
128 Domain
8.2.28
aev999
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
HASH IDENTIFIER
README
+ Create Folder
+ Create File
/
usr /
src /
linux-headers-5.15.0-25 /
include /
linux /
[ HOME SHELL ]
Name
Size
Permission
Action
amba
[ DIR ]
drwxr-xr-x
atomic
[ DIR ]
drwxr-xr-x
avf
[ DIR ]
drwxr-xr-x
bcma
[ DIR ]
drwxr-xr-x
byteorder
[ DIR ]
drwxr-xr-x
can
[ DIR ]
drwxr-xr-x
ceph
[ DIR ]
drwxr-xr-x
clk
[ DIR ]
drwxr-xr-x
crush
[ DIR ]
drwxr-xr-x
decompress
[ DIR ]
drwxr-xr-x
device
[ DIR ]
drwxr-xr-x
dma
[ DIR ]
drwxr-xr-x
dsa
[ DIR ]
drwxr-xr-x
extcon
[ DIR ]
drwxr-xr-x
firmware
[ DIR ]
drwxr-xr-x
fpga
[ DIR ]
drwxr-xr-x
fsl
[ DIR ]
drwxr-xr-x
gpio
[ DIR ]
drwxr-xr-x
greybus
[ DIR ]
drwxr-xr-x
hsi
[ DIR ]
drwxr-xr-x
i3c
[ DIR ]
drwxr-xr-x
iio
[ DIR ]
drwxr-xr-x
input
[ DIR ]
drwxr-xr-x
irqchip
[ DIR ]
drwxr-xr-x
isdn
[ DIR ]
drwxr-xr-x
lockd
[ DIR ]
drwxr-xr-x
mailbox
[ DIR ]
drwxr-xr-x
mdio
[ DIR ]
drwxr-xr-x
mfd
[ DIR ]
drwxr-xr-x
mlx4
[ DIR ]
drwxr-xr-x
mlx5
[ DIR ]
drwxr-xr-x
mmc
[ DIR ]
drwxr-xr-x
mtd
[ DIR ]
drwxr-xr-x
mux
[ DIR ]
drwxr-xr-x
net
[ DIR ]
drwxr-xr-x
netfilter
[ DIR ]
drwxr-xr-x
netfilter_arp
[ DIR ]
drwxr-xr-x
netfilter_bridge
[ DIR ]
drwxr-xr-x
netfilter_ipv4
[ DIR ]
drwxr-xr-x
netfilter_ipv6
[ DIR ]
drwxr-xr-x
pcs
[ DIR ]
drwxr-xr-x
perf
[ DIR ]
drwxr-xr-x
phy
[ DIR ]
drwxr-xr-x
pinctrl
[ DIR ]
drwxr-xr-x
platform_data
[ DIR ]
drwxr-xr-x
power
[ DIR ]
drwxr-xr-x
qed
[ DIR ]
drwxr-xr-x
raid
[ DIR ]
drwxr-xr-x
regulator
[ DIR ]
drwxr-xr-x
remoteproc
[ DIR ]
drwxr-xr-x
reset
[ DIR ]
drwxr-xr-x
rpmsg
[ DIR ]
drwxr-xr-x
rtc
[ DIR ]
drwxr-xr-x
sched
[ DIR ]
drwxr-xr-x
soc
[ DIR ]
drwxr-xr-x
soundwire
[ DIR ]
drwxr-xr-x
spi
[ DIR ]
drwxr-xr-x
ssb
[ DIR ]
drwxr-xr-x
sunrpc
[ DIR ]
drwxr-xr-x
surface_aggregator
[ DIR ]
drwxr-xr-x
ulpi
[ DIR ]
drwxr-xr-x
unaligned
[ DIR ]
drwxr-xr-x
usb
[ DIR ]
drwxr-xr-x
8250_pci.h
1.01
KB
-rw-r--r--
a.out.h
354
B
-rw-r--r--
acct.h
2.49
KB
-rw-r--r--
acpi.h
39.5
KB
-rw-r--r--
acpi_dma.h
3.08
KB
-rw-r--r--
acpi_iort.h
2.27
KB
-rw-r--r--
acpi_mdio.h
631
B
-rw-r--r--
acpi_pmtmr.h
674
B
-rw-r--r--
acpi_viot.h
389
B
-rw-r--r--
adb.h
1.79
KB
-rw-r--r--
adfs_fs.h
574
B
-rw-r--r--
adreno-smmu-priv.h
2.74
KB
-rw-r--r--
adxl.h
310
B
-rw-r--r--
aer.h
1.78
KB
-rw-r--r--
agp_backend.h
3.45
KB
-rw-r--r--
agpgart.h
3.79
KB
-rw-r--r--
ahci-remap.h
607
B
-rw-r--r--
ahci_platform.h
1.54
KB
-rw-r--r--
aio.h
651
B
-rw-r--r--
alarmtimer.h
1.94
KB
-rw-r--r--
alcor_pci.h
8.83
KB
-rw-r--r--
align.h
552
B
-rw-r--r--
altera_jtaguart.h
379
B
-rw-r--r--
altera_uart.h
397
B
-rw-r--r--
amd-iommu.h
6.18
KB
-rw-r--r--
anon_inodes.h
670
B
-rw-r--r--
apm-emulation.h
1.56
KB
-rw-r--r--
apm_bios.h
2.25
KB
-rw-r--r--
apple-gmux.h
918
B
-rw-r--r--
apple_bl.h
498
B
-rw-r--r--
arch_topology.h
2.49
KB
-rw-r--r--
arm-cci.h
1.36
KB
-rw-r--r--
arm-smccc.h
17.7
KB
-rw-r--r--
arm_ffa.h
7.36
KB
-rw-r--r--
arm_sdei.h
2.51
KB
-rw-r--r--
armada-37xx-rwtm-mailbox.h
431
B
-rw-r--r--
ascii85.h
555
B
-rw-r--r--
asn1.h
1.79
KB
-rw-r--r--
asn1_ber_bytecode.h
2.52
KB
-rw-r--r--
asn1_decoder.h
468
B
-rw-r--r--
asn1_encoder.h
1006
B
-rw-r--r--
assoc_array.h
2.88
KB
-rw-r--r--
assoc_array_priv.h
5.3
KB
-rw-r--r--
async.h
4.26
KB
-rw-r--r--
async_tx.h
6.7
KB
-rw-r--r--
ata.h
32.52
KB
-rw-r--r--
ata_platform.h
749
B
-rw-r--r--
atalk.h
4.48
KB
-rw-r--r--
ath9k_platform.h
1.44
KB
-rw-r--r--
atm.h
287
B
-rw-r--r--
atm_tcp.h
511
B
-rw-r--r--
atmdev.h
9.99
KB
-rw-r--r--
atmel-isc-media.h
2.07
KB
-rw-r--r--
atmel-mci.h
1.4
KB
-rw-r--r--
atmel-ssc.h
9.74
KB
-rw-r--r--
atmel_pdc.h
1.26
KB
-rw-r--r--
atomic.h
2.58
KB
-rw-r--r--
attribute_container.h
2.74
KB
-rw-r--r--
audit.h
19.45
KB
-rw-r--r--
auto_dev-ioctl.h
296
B
-rw-r--r--
auto_fs.h
278
B
-rw-r--r--
auxiliary_bus.h
2.48
KB
-rw-r--r--
auxvec.h
304
B
-rw-r--r--
average.h
2.42
KB
-rw-r--r--
backing-dev-defs.h
8.55
KB
-rw-r--r--
backing-dev.h
11.81
KB
-rw-r--r--
backlight.h
13.13
KB
-rw-r--r--
badblocks.h
2.14
KB
-rw-r--r--
balloon_compaction.h
6.59
KB
-rw-r--r--
bcd.h
559
B
-rw-r--r--
bch.h
2.1
KB
-rw-r--r--
bcm47xx_nvram.h
1.01
KB
-rw-r--r--
bcm47xx_sprom.h
616
B
-rw-r--r--
bcm47xx_wdt.h
555
B
-rw-r--r--
bcm963xx_nvram.h
2.96
KB
-rw-r--r--
bcm963xx_tag.h
3.6
KB
-rw-r--r--
binfmts.h
4.48
KB
-rw-r--r--
bio.h
19.64
KB
-rw-r--r--
bit_spinlock.h
2.3
KB
-rw-r--r--
bitfield.h
4.75
KB
-rw-r--r--
bitmap.h
21.62
KB
-rw-r--r--
bitops.h
8.53
KB
-rw-r--r--
bitrev.h
2.53
KB
-rw-r--r--
bits.h
1.35
KB
-rw-r--r--
blk-cgroup.h
21.4
KB
-rw-r--r--
blk-crypto.h
4.02
KB
-rw-r--r--
blk-mq-pci.h
269
B
-rw-r--r--
blk-mq-rdma.h
273
B
-rw-r--r--
blk-mq-virtio.h
293
B
-rw-r--r--
blk-mq.h
19.37
KB
-rw-r--r--
blk-pm.h
708
B
-rw-r--r--
blk_types.h
15.42
KB
-rw-r--r--
blkdev.h
56.35
KB
-rw-r--r--
blkpg.h
436
B
-rw-r--r--
blktrace_api.h
3.77
KB
-rw-r--r--
blockgroup_lock.h
810
B
-rw-r--r--
bma150.h
1.26
KB
-rw-r--r--
bootconfig.h
8.51
KB
-rw-r--r--
bootmem_info.h
1.61
KB
-rw-r--r--
bottom_half.h
974
B
-rw-r--r--
bpf-cgroup.h
18.52
KB
-rw-r--r--
bpf-netns.h
1.52
KB
-rw-r--r--
bpf.h
69.46
KB
-rw-r--r--
bpf_lirc.h
698
B
-rw-r--r--
bpf_local_storage.h
5.23
KB
-rw-r--r--
bpf_lsm.h
1.42
KB
-rw-r--r--
bpf_trace.h
166
B
-rw-r--r--
bpf_types.h
5.41
KB
-rw-r--r--
bpf_verifier.h
18.45
KB
-rw-r--r--
bpfilter.h
791
B
-rw-r--r--
bpfptr.h
1.83
KB
-rw-r--r--
brcmphy.h
13.67
KB
-rw-r--r--
bsearch.h
624
B
-rw-r--r--
bsg-lib.h
1.72
KB
-rw-r--r--
bsg.h
492
B
-rw-r--r--
btf.h
7.26
KB
-rw-r--r--
btf_ids.h
5.32
KB
-rw-r--r--
btree-128.h
2.67
KB
-rw-r--r--
btree-type.h
3.9
KB
-rw-r--r--
btree.h
6.84
KB
-rw-r--r--
btrfs.h
145
B
-rw-r--r--
buffer_head.h
13.54
KB
-rw-r--r--
bug.h
2.17
KB
-rw-r--r--
build-salt.h
375
B
-rw-r--r--
build_bug.h
2.76
KB
-rw-r--r--
buildid.h
561
B
-rw-r--r--
bvec.h
6.17
KB
-rw-r--r--
c2port.h
1.35
KB
-rw-r--r--
cache.h
2.55
KB
-rw-r--r--
cacheinfo.h
3.75
KB
-rw-r--r--
capability.h
8.29
KB
-rw-r--r--
cb710.h
5.36
KB
-rw-r--r--
cc_platform.h
2.32
KB
-rw-r--r--
cciss_ioctl.h
1.03
KB
-rw-r--r--
ccp.h
18.14
KB
-rw-r--r--
cdev.h
845
B
-rw-r--r--
cdrom.h
8.98
KB
-rw-r--r--
cfag12864b.h
1.47
KB
-rw-r--r--
cfi.h
1.13
KB
-rw-r--r--
cgroup-defs.h
24.1
KB
-rw-r--r--
cgroup.h
28.19
KB
-rw-r--r--
cgroup_rdma.h
1.18
KB
-rw-r--r--
cgroup_subsys.h
1.23
KB
-rw-r--r--
circ_buf.h
1.09
KB
-rw-r--r--
cleancache.h
3.89
KB
-rw-r--r--
clk-provider.h
56.38
KB
-rw-r--r--
clk.h
29.59
KB
-rw-r--r--
clkdev.h
1.29
KB
-rw-r--r--
clockchips.h
7.27
KB
-rw-r--r--
clocksource.h
9.57
KB
-rw-r--r--
clocksource_ids.h
247
B
-rw-r--r--
cm4000_cs.h
199
B
-rw-r--r--
cma.h
1.59
KB
-rw-r--r--
cn_proc.h
1.85
KB
-rw-r--r--
cnt32_to_63.h
3.46
KB
-rw-r--r--
coda.h
2.16
KB
-rw-r--r--
compaction.h
7.15
KB
-rw-r--r--
compat.h
31.35
KB
-rw-r--r--
compiler-clang.h
2.27
KB
-rw-r--r--
compiler-gcc.h
4.44
KB
-rw-r--r--
compiler-intel.h
949
B
-rw-r--r--
compiler-version.h
517
B
-rw-r--r--
compiler.h
7.78
KB
-rw-r--r--
compiler_attributes.h
12.15
KB
-rw-r--r--
compiler_types.h
10.46
KB
-rw-r--r--
completion.h
4
KB
-rw-r--r--
component.h
4.07
KB
-rw-r--r--
configfs.h
8.48
KB
-rw-r--r--
connector.h
3.83
KB
-rw-r--r--
console.h
7.28
KB
-rw-r--r--
console_struct.h
7.08
KB
-rw-r--r--
consolemap.h
1.05
KB
-rw-r--r--
const.h
421
B
-rw-r--r--
container.h
610
B
-rw-r--r--
context_tracking.h
3.28
KB
-rw-r--r--
context_tracking_state.h
1.58
KB
-rw-r--r--
cookie.h
1.22
KB
-rw-r--r--
cordic.h
2.08
KB
-rw-r--r--
coredump.h
1.23
KB
-rw-r--r--
coresight-pmu.h
1.32
KB
-rw-r--r--
coresight-stm.h
152
B
-rw-r--r--
coresight.h
17.81
KB
-rw-r--r--
count_zeros.h
1.42
KB
-rw-r--r--
counter.h
15.13
KB
-rw-r--r--
counter_enum.h
1.43
KB
-rw-r--r--
cper.h
16.41
KB
-rw-r--r--
cpu.h
7.31
KB
-rw-r--r--
cpu_cooling.h
1.86
KB
-rw-r--r--
cpu_pm.h
2.38
KB
-rw-r--r--
cpu_rmap.h
1.68
KB
-rw-r--r--
cpufeature.h
1.71
KB
-rw-r--r--
cpufreq.h
32.57
KB
-rw-r--r--
cpuhotplug.h
16.47
KB
-rw-r--r--
cpuidle.h
10.27
KB
-rw-r--r--
cpuidle_haltpoll.h
312
B
-rw-r--r--
cpumask.h
28.61
KB
-rw-r--r--
cpuset.h
7.34
KB
-rw-r--r--
crash_core.h
3.38
KB
-rw-r--r--
crash_dump.h
4.05
KB
-rw-r--r--
crc-ccitt.h
609
B
-rw-r--r--
crc-itu-t.h
531
B
-rw-r--r--
crc-t10dif.h
453
B
-rw-r--r--
crc16.h
540
B
-rw-r--r--
crc32.h
2.83
KB
-rw-r--r--
crc32c.h
331
B
-rw-r--r--
crc32poly.h
610
B
-rw-r--r--
crc4.h
192
B
-rw-r--r--
crc64.h
280
B
-rw-r--r--
crc7.h
316
B
-rw-r--r--
crc8.h
3.66
KB
-rw-r--r--
cred.h
12.48
KB
-rw-r--r--
crypto.h
27.08
KB
-rw-r--r--
cs5535.h
6.13
KB
-rw-r--r--
ctype.h
1.87
KB
-rw-r--r--
cuda.h
613
B
-rw-r--r--
damon.h
10.35
KB
-rw-r--r--
dasd_mod.h
204
B
-rw-r--r--
davinci_emac.h
1.05
KB
-rw-r--r--
dax.h
6.56
KB
-rw-r--r--
dca.h
1.88
KB
-rw-r--r--
dcache.h
18.63
KB
-rw-r--r--
dccp.h
10.73
KB
-rw-r--r--
debug_locks.h
1.59
KB
-rw-r--r--
debugfs.h
11.22
KB
-rw-r--r--
debugobjects.h
3.99
KB
-rw-r--r--
delay.h
2.43
KB
-rw-r--r--
delayacct.h
5.45
KB
-rw-r--r--
delayed_call.h
709
B
-rw-r--r--
dev_printk.h
9.05
KB
-rw-r--r--
devcoredump.h
2.21
KB
-rw-r--r--
devfreq-event.h
5.95
KB
-rw-r--r--
devfreq.h
13.98
KB
-rw-r--r--
devfreq_cooling.h
2.7
KB
-rw-r--r--
device-mapper.h
18.92
KB
-rw-r--r--
device.h
32.89
KB
-rw-r--r--
device_cgroup.h
1.57
KB
-rw-r--r--
devm-helpers.h
2.68
KB
-rw-r--r--
devpts_fs.h
1.13
KB
-rw-r--r--
dfl.h
2.38
KB
-rw-r--r--
digsig.h
1.18
KB
-rw-r--r--
dim.h
9.13
KB
-rw-r--r--
dio.h
10.76
KB
-rw-r--r--
dirent.h
215
B
-rw-r--r--
dlm.h
5.86
KB
-rw-r--r--
dlm_plock.h
532
B
-rw-r--r--
dm-bufio.h
4.88
KB
-rw-r--r--
dm-dirty-log.h
3.94
KB
-rw-r--r--
dm-io.h
1.93
KB
-rw-r--r--
dm-kcopyd.h
2.94
KB
-rw-r--r--
dm-region-hash.h
3.11
KB
-rw-r--r--
dm9000.h
987
B
-rw-r--r--
dma-buf-map.h
8.12
KB
-rw-r--r--
dma-buf.h
20.47
KB
-rw-r--r--
dma-direct.h
3.59
KB
-rw-r--r--
dma-direction.h
407
B
-rw-r--r--
dma-fence-array.h
2.14
KB
-rw-r--r--
dma-fence-chain.h
3.07
KB
-rw-r--r--
dma-fence.h
20.25
KB
-rw-r--r--
dma-heap.h
1.58
KB
-rw-r--r--
dma-iommu.h
2.21
KB
-rw-r--r--
dma-map-ops.h
12.73
KB
-rw-r--r--
dma-mapping.h
19.81
KB
-rw-r--r--
dma-resv.h
9.05
KB
-rw-r--r--
dmaengine.h
53.53
KB
-rw-r--r--
dmapool.h
1.79
KB
-rw-r--r--
dmar.h
7.74
KB
-rw-r--r--
dmi.h
4.27
KB
-rw-r--r--
dnotify.h
1.02
KB
-rw-r--r--
dns_resolver.h
1.36
KB
-rw-r--r--
dqblk_qtree.h
2.19
KB
-rw-r--r--
dqblk_v1.h
327
B
-rw-r--r--
dqblk_v2.h
406
B
-rw-r--r--
drbd.h
10.07
KB
-rw-r--r--
drbd_genl.h
21.49
KB
-rw-r--r--
drbd_genl_api.h
1.77
KB
-rw-r--r--
drbd_limits.h
7.82
KB
-rw-r--r--
ds2782_battery.h
158
B
-rw-r--r--
dtlk.h
3.5
KB
-rw-r--r--
dtpm.h
1.64
KB
-rw-r--r--
dw_apb_timer.h
1.53
KB
-rw-r--r--
dynamic_debug.h
6.6
KB
-rw-r--r--
dynamic_queue_limits.h
3.72
KB
-rw-r--r--
earlycpio.h
359
B
-rw-r--r--
ecryptfs.h
3.82
KB
-rw-r--r--
edac.h
19.46
KB
-rw-r--r--
edd.h
1.05
KB
-rw-r--r--
eeprom_93cx6.h
2.31
KB
-rw-r--r--
eeprom_93xx46.h
1.04
KB
-rw-r--r--
efi-bgrt.h
644
B
-rw-r--r--
efi.h
42.25
KB
-rw-r--r--
efi_embedded_fw.h
1.04
KB
-rw-r--r--
efs_vh.h
1.55
KB
-rw-r--r--
eisa.h
2.96
KB
-rw-r--r--
elevator.h
5.52
KB
-rw-r--r--
elf-fdpic.h
1.98
KB
-rw-r--r--
elf-randomize.h
583
B
-rw-r--r--
elf.h
2.96
KB
-rw-r--r--
elfcore-compat.h
1.27
KB
-rw-r--r--
elfcore.h
4.11
KB
-rw-r--r--
elfnote-lto.h
314
B
-rw-r--r--
elfnote.h
3.54
KB
-rw-r--r--
enclosure.h
4.02
KB
-rw-r--r--
energy_model.h
8.17
KB
-rw-r--r--
entry-common.h
16.95
KB
-rw-r--r--
entry-kvm.h
2.75
KB
-rw-r--r--
err.h
1.49
KB
-rw-r--r--
errname.h
283
B
-rw-r--r--
errno.h
1.45
KB
-rw-r--r--
error-injection.h
607
B
-rw-r--r--
errqueue.h
524
B
-rw-r--r--
errseq.h
382
B
-rw-r--r--
etherdevice.h
16.41
KB
-rw-r--r--
ethtool.h
31.72
KB
-rw-r--r--
ethtool_netlink.h
1.98
KB
-rw-r--r--
eventfd.h
2.1
KB
-rw-r--r--
eventpoll.h
2.4
KB
-rw-r--r--
evm.h
3.42
KB
-rw-r--r--
export.h
5.24
KB
-rw-r--r--
exportfs.h
8.25
KB
-rw-r--r--
ext2_fs.h
967
B
-rw-r--r--
extable.h
1.28
KB
-rw-r--r--
extcon-provider.h
3.83
KB
-rw-r--r--
extcon.h
10.17
KB
-rw-r--r--
f2fs_fs.h
19
KB
-rw-r--r--
f75375s.h
541
B
-rw-r--r--
falloc.h
1.59
KB
-rw-r--r--
fanotify.h
3.85
KB
-rw-r--r--
fault-inject-usercopy.h
496
B
-rw-r--r--
fault-inject.h
1.93
KB
-rw-r--r--
fb.h
27.83
KB
-rw-r--r--
fbcon.h
1.88
KB
-rw-r--r--
fcdevice.h
774
B
-rw-r--r--
fcntl.h
1.66
KB
-rw-r--r--
fd.h
490
B
-rw-r--r--
fddidevice.h
833
B
-rw-r--r--
fdtable.h
3.58
KB
-rw-r--r--
fec.h
463
B
-rw-r--r--
fiemap.h
713
B
-rw-r--r--
file.h
2.89
KB
-rw-r--r--
fileattr.h
1.91
KB
-rw-r--r--
filter.h
42.08
KB
-rw-r--r--
fips.h
303
B
-rw-r--r--
firewire.h
13.4
KB
-rw-r--r--
firmware-map.h
959
B
-rw-r--r--
firmware.h
3.27
KB
-rw-r--r--
fixp-arith.h
4.19
KB
-rw-r--r--
flat.h
2.57
KB
-rw-r--r--
flex_proportions.h
2.81
KB
-rw-r--r--
font.h
1.67
KB
-rw-r--r--
fortify-string.h
9.11
KB
-rw-r--r--
freelist.h
3.8
KB
-rw-r--r--
freezer.h
8.98
KB
-rw-r--r--
frontswap.h
3.04
KB
-rw-r--r--
fs.h
120.45
KB
-rw-r--r--
fs_context.h
8.68
KB
-rw-r--r--
fs_enet_pd.h
3.38
KB
-rw-r--r--
fs_parser.h
4.44
KB
-rw-r--r--
fs_pin.h
539
B
-rw-r--r--
fs_stack.h
811
B
-rw-r--r--
fs_struct.h
1.04
KB
-rw-r--r--
fs_types.h
2.02
KB
-rw-r--r--
fs_uart_pd.h
1.49
KB
-rw-r--r--
fscache-cache.h
18.58
KB
-rw-r--r--
fscache.h
29.59
KB
-rw-r--r--
fscrypt.h
29.89
KB
-rw-r--r--
fsi-occ.h
681
B
-rw-r--r--
fsi-sbefifo.h
629
B
-rw-r--r--
fsi.h
2.26
KB
-rw-r--r--
fsl-diu-fb.h
3.87
KB
-rw-r--r--
fsl_devices.h
4.16
KB
-rw-r--r--
fsl_hypervisor.h
2.76
KB
-rw-r--r--
fsl_ifc.h
24.48
KB
-rw-r--r--
fsldma.h
202
B
-rw-r--r--
fsnotify.h
8.85
KB
-rw-r--r--
fsnotify_backend.h
22.93
KB
-rw-r--r--
fsverity.h
6.75
KB
-rw-r--r--
ftrace.h
34.75
KB
-rw-r--r--
ftrace_irq.h
884
B
-rw-r--r--
futex.h
2.44
KB
-rw-r--r--
fwnode.h
6.8
KB
-rw-r--r--
fwnode_mdio.h
858
B
-rw-r--r--
gameport.h
5.42
KB
-rw-r--r--
gcd.h
193
B
-rw-r--r--
genalloc.h
7.68
KB
-rw-r--r--
generic-radix-tree.h
6.35
KB
-rw-r--r--
genetlink.h
589
B
-rw-r--r--
genhd.h
9.23
KB
-rw-r--r--
genl_magic_func.h
11.53
KB
-rw-r--r--
genl_magic_struct.h
7.61
KB
-rw-r--r--
getcpu.h
641
B
-rw-r--r--
gfp.h
26.01
KB
-rw-r--r--
glob.h
256
B
-rw-r--r--
gnss.h
1.56
KB
-rw-r--r--
goldfish.h
762
B
-rw-r--r--
gpio-pxa.h
571
B
-rw-r--r--
gpio.h
5.3
KB
-rw-r--r--
gpio_keys.h
1.74
KB
-rw-r--r--
greybus.h
4.14
KB
-rw-r--r--
hardirq.h
3.43
KB
-rw-r--r--
hash.h
3
KB
-rw-r--r--
hashtable.h
6.67
KB
-rw-r--r--
hdlc.h
3.19
KB
-rw-r--r--
hdlcdrv.h
6.32
KB
-rw-r--r--
hdmi.h
12.41
KB
-rw-r--r--
hid-debug.h
1.42
KB
-rw-r--r--
hid-roccat.h
484
B
-rw-r--r--
hid-sensor-hub.h
8.97
KB
-rw-r--r--
hid-sensor-ids.h
7.44
KB
-rw-r--r--
hid.h
37.67
KB
-rw-r--r--
hidden.h
966
B
-rw-r--r--
hiddev.h
1.42
KB
-rw-r--r--
hidraw.h
1.12
KB
-rw-r--r--
highmem-internal.h
5.06
KB
-rw-r--r--
highmem.h
8.95
KB
-rw-r--r--
highuid.h
3.12
KB
-rw-r--r--
hil.h
18.42
KB
-rw-r--r--
hil_mlc.h
5.13
KB
-rw-r--r--
hippidevice.h
1.03
KB
-rw-r--r--
hmm.h
4.07
KB
-rw-r--r--
host1x.h
10.74
KB
-rw-r--r--
hp_sdc.h
14.02
KB
-rw-r--r--
hpet.h
2.55
KB
-rw-r--r--
hrtimer.h
16.01
KB
-rw-r--r--
hrtimer_defs.h
660
B
-rw-r--r--
htcpld.h
617
B
-rw-r--r--
huge_mm.h
13.27
KB
-rw-r--r--
hugetlb.h
29.09
KB
-rw-r--r--
hugetlb_cgroup.h
7.07
KB
-rw-r--r--
hugetlb_inline.h
374
B
-rw-r--r--
hw_breakpoint.h
4.15
KB
-rw-r--r--
hw_random.h
2.24
KB
-rw-r--r--
hwmon-sysfs.h
2.77
KB
-rw-r--r--
hwmon-vid.h
862
B
-rw-r--r--
hwmon.h
14.78
KB
-rw-r--r--
hwspinlock.h
15.64
KB
-rw-r--r--
hyperv.h
47.93
KB
-rw-r--r--
hypervisor.h
608
B
-rw-r--r--
i2c-algo-bit.h
1.4
KB
-rw-r--r--
i2c-algo-pca.h
2.89
KB
-rw-r--r--
i2c-algo-pcf.h
1.21
KB
-rw-r--r--
i2c-dev.h
371
B
-rw-r--r--
i2c-mux.h
1.63
KB
-rw-r--r--
i2c-smbus.h
1.73
KB
-rw-r--r--
i2c.h
37.74
KB
-rw-r--r--
i8042.h
1.99
KB
-rw-r--r--
i8253.h
809
B
-rw-r--r--
icmp.h
1
KB
-rw-r--r--
icmpv6.h
2.7
KB
-rw-r--r--
idle_inject.h
932
B
-rw-r--r--
idr.h
9.58
KB
-rw-r--r--
ieee80211.h
123.96
KB
-rw-r--r--
ieee802154.h
11.12
KB
-rw-r--r--
if_arp.h
1.63
KB
-rw-r--r--
if_bridge.h
4.9
KB
-rw-r--r--
if_eql.h
1.07
KB
-rw-r--r--
if_ether.h
1.26
KB
-rw-r--r--
if_fddi.h
3.24
KB
-rw-r--r--
if_hsr.h
586
B
-rw-r--r--
if_link.h
592
B
-rw-r--r--
if_ltalk.h
188
B
-rw-r--r--
if_macvlan.h
2.69
KB
-rw-r--r--
if_phonet.h
319
B
-rw-r--r--
if_pppol2tp.h
516
B
-rw-r--r--
if_pppox.h
2.84
KB
-rw-r--r--
if_rmnet.h
2.04
KB
-rw-r--r--
if_tap.h
2.21
KB
-rw-r--r--
if_team.h
7.84
KB
-rw-r--r--
if_tun.h
1.55
KB
-rw-r--r--
if_tunnel.h
409
B
-rw-r--r--
if_vlan.h
20.37
KB
-rw-r--r--
igmp.h
4.33
KB
-rw-r--r--
ihex.h
2.15
KB
-rw-r--r--
ima.h
5.7
KB
-rw-r--r--
imx-media.h
605
B
-rw-r--r--
in.h
2.29
KB
-rw-r--r--
in6.h
1.63
KB
-rw-r--r--
indirect_call_wrapper.h
2.23
KB
-rw-r--r--
inet.h
2.64
KB
-rw-r--r--
inet_diag.h
2.74
KB
-rw-r--r--
inetdevice.h
8.87
KB
-rw-r--r--
init.h
11.39
KB
-rw-r--r--
init_ohci1394_dma.h
196
B
-rw-r--r--
init_syscalls.h
1.01
KB
-rw-r--r--
init_task.h
1.3
KB
-rw-r--r--
initrd.h
1.02
KB
-rw-r--r--
inotify.h
713
B
-rw-r--r--
input.h
19.88
KB
-rw-r--r--
instrumentation.h
1.93
KB
-rw-r--r--
instrumented.h
3.6
KB
-rw-r--r--
integrity.h
1.15
KB
-rw-r--r--
intel-iommu.h
27.48
KB
-rw-r--r--
intel-ish-client-if.h
3.97
KB
-rw-r--r--
intel-svm.h
1.54
KB
-rw-r--r--
intel_rapl.h
4.14
KB
-rw-r--r--
intel_th.h
2.44
KB
-rw-r--r--
interconnect-provider.h
5.51
KB
-rw-r--r--
interconnect.h
2.88
KB
-rw-r--r--
interrupt.h
23.81
KB
-rw-r--r--
interval_tree.h
831
B
-rw-r--r--
interval_tree_generic.h
6.7
KB
-rw-r--r--
io-64-nonatomic-hi-lo.h
2.41
KB
-rw-r--r--
io-64-nonatomic-lo-hi.h
2.41
KB
-rw-r--r--
io-mapping.h
4.65
KB
-rw-r--r--
io-pgtable.h
8.39
KB
-rw-r--r--
io.h
5.02
KB
-rw-r--r--
io_uring.h
902
B
-rw-r--r--
ioam6.h
226
B
-rw-r--r--
ioam6_genl.h
266
B
-rw-r--r--
ioam6_iptunnel.h
285
B
-rw-r--r--
ioasid.h
2.07
KB
-rw-r--r--
iocontext.h
4.59
KB
-rw-r--r--
iomap.h
11.67
KB
-rw-r--r--
iommu-helper.h
1.12
KB
-rw-r--r--
iommu.h
34.04
KB
-rw-r--r--
iopoll.h
7.58
KB
-rw-r--r--
ioport.h
12.16
KB
-rw-r--r--
ioprio.h
1.74
KB
-rw-r--r--
iova.h
6.15
KB
-rw-r--r--
ip.h
1
KB
-rw-r--r--
ipack.h
8.69
KB
-rw-r--r--
ipc.h
613
B
-rw-r--r--
ipc_namespace.h
4.98
KB
-rw-r--r--
ipmi.h
10.88
KB
-rw-r--r--
ipmi_smi.h
7.98
KB
-rw-r--r--
ipv6.h
8.67
KB
-rw-r--r--
ipv6_route.h
372
B
-rw-r--r--
irq.h
41.58
KB
-rw-r--r--
irq_poll.h
575
B
-rw-r--r--
irq_sim.h
789
B
-rw-r--r--
irq_work.h
1.79
KB
-rw-r--r--
irqbypass.h
3.45
KB
-rw-r--r--
irqchip.h
2.33
KB
-rw-r--r--
irqdesc.h
7.75
KB
-rw-r--r--
irqdomain.h
19.98
KB
-rw-r--r--
irqflags.h
7.7
KB
-rw-r--r--
irqhandler.h
300
B
-rw-r--r--
irqnr.h
856
B
-rw-r--r--
irqreturn.h
503
B
-rw-r--r--
isa.h
2.12
KB
-rw-r--r--
isapnp.h
2.88
KB
-rw-r--r--
iscsi_boot_sysfs.h
3.71
KB
-rw-r--r--
iscsi_ibft.h
847
B
-rw-r--r--
iversion.h
12.37
KB
-rw-r--r--
jbd2.h
51.42
KB
-rw-r--r--
jhash.h
4.56
KB
-rw-r--r--
jiffies.h
15.07
KB
-rw-r--r--
journal-head.h
2.91
KB
-rw-r--r--
joystick.h
437
B
-rw-r--r--
jump_label.h
16.04
KB
-rw-r--r--
jump_label_ratelimit.h
2.77
KB
-rw-r--r--
jz4740-adc.h
1023
B
-rw-r--r--
jz4780-nemc.h
976
B
-rw-r--r--
kallsyms.h
4.5
KB
-rw-r--r--
kasan-checks.h
1.46
KB
-rw-r--r--
kasan-tags.h
487
B
-rw-r--r--
kasan.h
13.31
KB
-rw-r--r--
kbd_diacr.h
198
B
-rw-r--r--
kbd_kern.h
3.6
KB
-rw-r--r--
kbuild.h
380
B
-rw-r--r--
kconfig.h
2.63
KB
-rw-r--r--
kcore.h
891
B
-rw-r--r--
kcov.h
2.41
KB
-rw-r--r--
kcsan-checks.h
15.86
KB
-rw-r--r--
kcsan.h
1.88
KB
-rw-r--r--
kdb.h
7.33
KB
-rw-r--r--
kdebug.h
487
B
-rw-r--r--
kdev_t.h
1.8
KB
-rw-r--r--
kern_levels.h
1.57
KB
-rw-r--r--
kernel-page-flags.h
528
B
-rw-r--r--
kernel.h
17.14
KB
-rw-r--r--
kernel_read_file.h
1.64
KB
-rw-r--r--
kernel_stat.h
2.97
KB
-rw-r--r--
kernelcapi.h
1.45
KB
-rw-r--r--
kernfs.h
18.11
KB
-rw-r--r--
kexec.h
11.37
KB
-rw-r--r--
key-type.h
6.53
KB
-rw-r--r--
key.h
15.75
KB
-rw-r--r--
keyboard.h
665
B
-rw-r--r--
keyctl.h
1.25
KB
-rw-r--r--
keyslot-manager.h
3.78
KB
-rw-r--r--
kfence.h
8
KB
-rw-r--r--
kfifo.h
26.18
KB
-rw-r--r--
kgdb.h
12.05
KB
-rw-r--r--
khugepaged.h
2.74
KB
-rw-r--r--
klist.h
1.88
KB
-rw-r--r--
kmemleak.h
3.27
KB
-rw-r--r--
kmod.h
1.02
KB
-rw-r--r--
kmsg_dump.h
2.71
KB
-rw-r--r--
kobj_map.h
545
B
-rw-r--r--
kobject.h
7.69
KB
-rw-r--r--
kobject_ns.h
1.9
KB
-rw-r--r--
kprobes.h
13.95
KB
-rw-r--r--
kref.h
3.08
KB
-rw-r--r--
ks0108.h
970
B
-rw-r--r--
ks8842.h
632
B
-rw-r--r--
ks8851_mll.h
472
B
-rw-r--r--
ksm.h
2.47
KB
-rw-r--r--
kstrtox.h
6.59
KB
-rw-r--r--
kthread.h
6.9
KB
-rw-r--r--
ktime.h
5.38
KB
-rw-r--r--
kvm_dirty_ring.h
2.73
KB
-rw-r--r--
kvm_host.h
58.09
KB
-rw-r--r--
kvm_irqfd.h
2
KB
-rw-r--r--
kvm_para.h
402
B
-rw-r--r--
kvm_types.h
2.17
KB
-rw-r--r--
l2tp.h
261
B
-rw-r--r--
lantiq.h
365
B
-rw-r--r--
lapb.h
1.71
KB
-rw-r--r--
latencytop.h
1.16
KB
-rw-r--r--
lcd.h
3.78
KB
-rw-r--r--
lcm.h
275
B
-rw-r--r--
led-class-flash.h
6.74
KB
-rw-r--r--
led-class-multicolor.h
3.26
KB
-rw-r--r--
led-lm3530.h
3.7
KB
-rw-r--r--
leds-bd2802.h
476
B
-rw-r--r--
leds-lp3944.h
950
B
-rw-r--r--
leds-lp3952.h
2.35
KB
-rw-r--r--
leds-pca9532.h
866
B
-rw-r--r--
leds-regulator.h
1.14
KB
-rw-r--r--
leds-ti-lmu-common.h
1.12
KB
-rw-r--r--
leds.h
18.26
KB
-rw-r--r--
libata.h
66.97
KB
-rw-r--r--
libfdt.h
202
B
-rw-r--r--
libfdt_env.h
491
B
-rw-r--r--
libgcc.h
463
B
-rw-r--r--
libnvdimm.h
10.38
KB
-rw-r--r--
libps2.h
1.89
KB
-rw-r--r--
license.h
418
B
-rw-r--r--
limits.h
715
B
-rw-r--r--
linear_range.h
1.72
KB
-rw-r--r--
linkage.h
9.57
KB
-rw-r--r--
linkmode.h
2.5
KB
-rw-r--r--
linux_logo.h
1.91
KB
-rw-r--r--
lis3lv02d.h
5
KB
-rw-r--r--
list.h
29.78
KB
-rw-r--r--
list_bl.h
4.79
KB
-rw-r--r--
list_lru.h
7.29
KB
-rw-r--r--
list_nulls.h
4.22
KB
-rw-r--r--
list_sort.h
374
B
-rw-r--r--
litex.h
2.06
KB
-rw-r--r--
livepatch.h
8.22
KB
-rw-r--r--
llc.h
749
B
-rw-r--r--
llist.h
9.06
KB
-rw-r--r--
local_lock.h
1.33
KB
-rw-r--r--
local_lock_internal.h
3.42
KB
-rw-r--r--
lockdep.h
21.34
KB
-rw-r--r--
lockdep_types.h
5.18
KB
-rw-r--r--
lockref.h
1.5
KB
-rw-r--r--
log2.h
6.22
KB
-rw-r--r--
logic_iomem.h
2.07
KB
-rw-r--r--
logic_pio.h
3.23
KB
-rw-r--r--
lp.h
2.76
KB
-rw-r--r--
lru_cache.h
11.83
KB
-rw-r--r--
lsm_audit.h
2.81
KB
-rw-r--r--
lsm_hook_defs.h
20.89
KB
-rw-r--r--
lsm_hooks.h
74.39
KB
-rw-r--r--
lz4.h
26.44
KB
-rw-r--r--
lzo.h
1.55
KB
-rw-r--r--
mISDNdsp.h
1.19
KB
-rw-r--r--
mISDNhw.h
5.39
KB
-rw-r--r--
mISDNif.h
14.89
KB
-rw-r--r--
mailbox_client.h
1.71
KB
-rw-r--r--
mailbox_controller.h
5.67
KB
-rw-r--r--
maple.h
2.71
KB
-rw-r--r--
marvell_phy.h
1.69
KB
-rw-r--r--
math.h
5.06
KB
-rw-r--r--
math64.h
7.48
KB
-rw-r--r--
mbcache.h
1.57
KB
-rw-r--r--
mbus.h
3.09
KB
-rw-r--r--
mc146818rtc.h
4.46
KB
-rw-r--r--
mc6821.h
1.18
KB
-rw-r--r--
mcb.h
3.72
KB
-rw-r--r--
mdev.h
5.94
KB
-rw-r--r--
mdio-bitbang.h
1.31
KB
-rw-r--r--
mdio-gpio.h
177
B
-rw-r--r--
mdio-mux.h
1021
B
-rw-r--r--
mdio.h
12.42
KB
-rw-r--r--
mei_cl_bus.h
3.75
KB
-rw-r--r--
mem_encrypt.h
885
B
-rw-r--r--
memblock.h
20.08
KB
-rw-r--r--
memcontrol.h
43.18
KB
-rw-r--r--
memfd.h
365
B
-rw-r--r--
memory.h
5.99
KB
-rw-r--r--
memory_hotplug.h
11.42
KB
-rw-r--r--
mempolicy.h
7.37
KB
-rw-r--r--
mempool.h
3.35
KB
-rw-r--r--
memregion.h
403
B
-rw-r--r--
memremap.h
5.97
KB
-rw-r--r--
memstick.h
9.6
KB
-rw-r--r--
mhi.h
26.04
KB
-rw-r--r--
micrel_phy.h
1.85
KB
-rw-r--r--
microchipphy.h
2.65
KB
-rw-r--r--
migrate.h
5.41
KB
-rw-r--r--
migrate_mode.h
758
B
-rw-r--r--
mii.h
16.33
KB
-rw-r--r--
mii_timestamper.h
3.57
KB
-rw-r--r--
min_heap.h
3.3
KB
-rw-r--r--
minmax.h
4.02
KB
-rw-r--r--
misc_cgroup.h
2.95
KB
-rw-r--r--
miscdevice.h
3.2
KB
-rw-r--r--
mm.h
104.32
KB
-rw-r--r--
mm_inline.h
2.92
KB
-rw-r--r--
mm_types.h
25.06
KB
-rw-r--r--
mm_types_task.h
2.5
KB
-rw-r--r--
mman.h
3.91
KB
-rw-r--r--
mmap_lock.h
4.25
KB
-rw-r--r--
mmdebug.h
2.25
KB
-rw-r--r--
mmiotrace.h
3.05
KB
-rw-r--r--
mmu_context.h
855
B
-rw-r--r--
mmu_notifier.h
24.64
KB
-rw-r--r--
mmzone.h
46.64
KB
-rw-r--r--
mnt_namespace.h
697
B
-rw-r--r--
mod_devicetable.h
23.42
KB
-rw-r--r--
module.h
23.58
KB
-rw-r--r--
module_signature.h
1.22
KB
-rw-r--r--
moduleloader.h
3.1
KB
-rw-r--r--
moduleparam.h
22.34
KB
-rw-r--r--
most.h
12.2
KB
-rw-r--r--
mount.h
3.93
KB
-rw-r--r--
moxtet.h
2.36
KB
-rw-r--r--
mpage.h
737
B
-rw-r--r--
mpi.h
8.41
KB
-rw-r--r--
mpls.h
394
B
-rw-r--r--
mpls_iptunnel.h
178
B
-rw-r--r--
mroute.h
1.97
KB
-rw-r--r--
mroute6.h
2.41
KB
-rw-r--r--
mroute_base.h
12.17
KB
-rw-r--r--
msdos_fs.h
273
B
-rw-r--r--
msdos_partition.h
1.62
KB
-rw-r--r--
msg.h
395
B
-rw-r--r--
msi.h
15.36
KB
-rw-r--r--
mtio.h
1.29
KB
-rw-r--r--
mutex.h
6.65
KB
-rw-r--r--
mv643xx.h
51.05
KB
-rw-r--r--
mv643xx_eth.h
1.95
KB
-rw-r--r--
mv643xx_i2c.h
335
B
-rw-r--r--
mvebu-pmsu.h
520
B
-rw-r--r--
mxm-wmi.h
399
B
-rw-r--r--
namei.h
3.85
KB
-rw-r--r--
nd.h
5.55
KB
-rw-r--r--
ndctl.h
674
B
-rw-r--r--
net.h
11.43
KB
-rw-r--r--
netdev_features.h
10.75
KB
-rw-r--r--
netdevice.h
167.19
KB
-rw-r--r--
netfilter.h
13.47
KB
-rw-r--r--
netfilter_bridge.h
2.08
KB
-rw-r--r--
netfilter_defs.h
486
B
-rw-r--r--
netfilter_ingress.h
1.44
KB
-rw-r--r--
netfilter_ipv4.h
1.05
KB
-rw-r--r--
netfilter_ipv6.h
5.85
KB
-rw-r--r--
netfs.h
7.93
KB
-rw-r--r--
netlink.h
7.88
KB
-rw-r--r--
netpoll.h
2.4
KB
-rw-r--r--
nfs.h
1.31
KB
-rw-r--r--
nfs3.h
260
B
-rw-r--r--
nfs4.h
18.95
KB
-rw-r--r--
nfs_fs.h
17.83
KB
-rw-r--r--
nfs_fs_i.h
308
B
-rw-r--r--
nfs_fs_sb.h
10.05
KB
-rw-r--r--
nfs_iostat.h
4.18
KB
-rw-r--r--
nfs_page.h
6.75
KB
-rw-r--r--
nfs_ssc.h
2.01
KB
-rw-r--r--
nfs_xdr.h
42.12
KB
-rw-r--r--
nfsacl.h
1.4
KB
-rw-r--r--
nitro_enclaves.h
267
B
-rw-r--r--
nl802154.h
3.85
KB
-rw-r--r--
nls.h
3.08
KB
-rw-r--r--
nmi.h
6.72
KB
-rw-r--r--
node.h
4.67
KB
-rw-r--r--
nodemask.h
16.99
KB
-rw-r--r--
nospec.h
2.16
KB
-rw-r--r--
notifier.h
7.84
KB
-rw-r--r--
ns_common.h
283
B
-rw-r--r--
nsc_gpio.h
1.42
KB
-rw-r--r--
nsproxy.h
3.09
KB
-rw-r--r--
ntb.h
52.43
KB
-rw-r--r--
ntb_transport.h
3.8
KB
-rw-r--r--
nubus.h
5.54
KB
-rw-r--r--
numa.h
1.25
KB
-rw-r--r--
nvme-fc-driver.h
45.86
KB
-rw-r--r--
nvme-fc.h
9.72
KB
-rw-r--r--
nvme-rdma.h
2.04
KB
-rw-r--r--
nvme-tcp.h
4.4
KB
-rw-r--r--
nvme.h
37.72
KB
-rw-r--r--
nvmem-consumer.h
6.78
KB
-rw-r--r--
nvmem-provider.h
4.72
KB
-rw-r--r--
nvram.h
3.47
KB
-rw-r--r--
objagg.h
1.99
KB
-rw-r--r--
objtool.h
4.35
KB
-rw-r--r--
of.h
43.24
KB
-rw-r--r--
of_address.h
4.17
KB
-rw-r--r--
of_clk.h
819
B
-rw-r--r--
of_device.h
2.93
KB
-rw-r--r--
of_dma.h
2.3
KB
-rw-r--r--
of_fdt.h
3.65
KB
-rw-r--r--
of_gpio.h
4.07
KB
-rw-r--r--
of_graph.h
3.55
KB
-rw-r--r--
of_iommu.h
505
B
-rw-r--r--
of_irq.h
3.75
KB
-rw-r--r--
of_mdio.h
3.51
KB
-rw-r--r--
of_net.h
824
B
-rw-r--r--
of_pci.h
915
B
-rw-r--r--
of_pdt.h
1.14
KB
-rw-r--r--
of_platform.h
3.88
KB
-rw-r--r--
of_reserved_mem.h
2.24
KB
-rw-r--r--
oid_registry.h
5.63
KB
-rw-r--r--
olpc-ec.h
1.95
KB
-rw-r--r--
omap-dma.h
9.79
KB
-rw-r--r--
omap-gpmc.h
2.64
KB
-rw-r--r--
omap-iommu.h
880
B
-rw-r--r--
omap-mailbox.h
689
B
-rw-r--r--
omapfb.h
576
B
-rw-r--r--
once.h
1.87
KB
-rw-r--r--
once_lite.h
677
B
-rw-r--r--
oom.h
3.26
KB
-rw-r--r--
openvswitch.h
403
B
-rw-r--r--
osq_lock.h
1.04
KB
-rw-r--r--
overflow.h
6.42
KB
-rw-r--r--
packing.h
1.76
KB
-rw-r--r--
padata.h
6.12
KB
-rw-r--r--
page-flags-layout.h
3.21
KB
-rw-r--r--
page-flags.h
28
KB
-rw-r--r--
page-isolation.h
1.64
KB
-rw-r--r--
page_counter.h
2.3
KB
-rw-r--r--
page_ext.h
1.83
KB
-rw-r--r--
page_idle.h
2.61
KB
-rw-r--r--
page_owner.h
2.31
KB
-rw-r--r--
page_ref.h
4.95
KB
-rw-r--r--
page_reporting.h
895
B
-rw-r--r--
pageblock-flags.h
2.31
KB
-rw-r--r--
pagemap.h
31.48
KB
-rw-r--r--
pagevec.h
2.04
KB
-rw-r--r--
pagewalk.h
4.07
KB
-rw-r--r--
panic.h
2.69
KB
-rw-r--r--
panic_notifier.h
296
B
-rw-r--r--
parman.h
2.87
KB
-rw-r--r--
parport.h
19.09
KB
-rw-r--r--
parport_pc.h
6.56
KB
-rw-r--r--
parser.h
1.17
KB
-rw-r--r--
part_stat.h
2.38
KB
-rw-r--r--
pata_arasan_cf_data.h
1.22
KB
-rw-r--r--
patchkey.h
757
B
-rw-r--r--
path.h
572
B
-rw-r--r--
pch_dma.h
408
B
-rw-r--r--
pci-acpi.h
3.85
KB
-rw-r--r--
pci-ats.h
1.76
KB
-rw-r--r--
pci-dma-compat.h
3.66
KB
-rw-r--r--
pci-ecam.h
3.2
KB
-rw-r--r--
pci-ep-cfs.h
956
B
-rw-r--r--
pci-epc.h
9.47
KB
-rw-r--r--
pci-epf.h
7.06
KB
-rw-r--r--
pci-p2pdma.h
3.95
KB
-rw-r--r--
pci.h
89.14
KB
-rw-r--r--
pci_hotplug.h
4.35
KB
-rw-r--r--
pci_ids.h
120.69
KB
-rw-r--r--
pcs-lynx.h
425
B
-rw-r--r--
pda_power.h
1005
B
-rw-r--r--
pe.h
16.17
KB
-rw-r--r--
percpu-defs.h
18.12
KB
-rw-r--r--
percpu-refcount.h
10.84
KB
-rw-r--r--
percpu-rwsem.h
4.16
KB
-rw-r--r--
percpu.h
4.65
KB
-rw-r--r--
percpu_counter.h
4.39
KB
-rw-r--r--
perf_event.h
46.38
KB
-rw-r--r--
perf_regs.h
1.05
KB
-rw-r--r--
personality.h
393
B
-rw-r--r--
pfn.h
666
B
-rw-r--r--
pfn_t.h
3.21
KB
-rw-r--r--
pgtable.h
43.89
KB
-rw-r--r--
phonet.h
537
B
-rw-r--r--
phy.h
57.75
KB
-rw-r--r--
phy_fixed.h
1.77
KB
-rw-r--r--
phy_led_triggers.h
1.01
KB
-rw-r--r--
phylink.h
19.37
KB
-rw-r--r--
pid.h
6.29
KB
-rw-r--r--
pid_namespace.h
2.08
KB
-rw-r--r--
pim.h
2.67
KB
-rw-r--r--
pipe_fs_i.h
8.68
KB
-rw-r--r--
pkeys.h
990
B
-rw-r--r--
pktcdvd.h
5.87
KB
-rw-r--r--
pl320-ipc.h
209
B
-rw-r--r--
platform_device.h
12.21
KB
-rw-r--r--
platform_profile.h
1.12
KB
-rw-r--r--
pldmfw.h
4.76
KB
-rw-r--r--
plist.h
8.66
KB
-rw-r--r--
pm-trace.h
940
B
-rw-r--r--
pm.h
32.64
KB
-rw-r--r--
pm_clock.h
2.58
KB
-rw-r--r--
pm_domain.h
13.18
KB
-rw-r--r--
pm_opp.h
15.1
KB
-rw-r--r--
pm_qos.h
10.41
KB
-rw-r--r--
pm_runtime.h
18.5
KB
-rw-r--r--
pm_wakeirq.h
1.31
KB
-rw-r--r--
pm_wakeup.h
6.28
KB
-rw-r--r--
pmbus.h
2.48
KB
-rw-r--r--
pmu.h
2.44
KB
-rw-r--r--
pnfs_osd_xdr.h
9.27
KB
-rw-r--r--
pnp.h
14.9
KB
-rw-r--r--
poison.h
2.48
KB
-rw-r--r--
poll.h
4.07
KB
-rw-r--r--
posix-clock.h
3.91
KB
-rw-r--r--
posix-timers.h
7.01
KB
-rw-r--r--
posix_acl.h
3.27
KB
-rw-r--r--
posix_acl_xattr.h
1.75
KB
-rw-r--r--
power_supply.h
17.74
KB
-rw-r--r--
powercap.h
11.98
KB
-rw-r--r--
ppp-comp.h
2.95
KB
-rw-r--r--
ppp_channel.h
2.99
KB
-rw-r--r--
ppp_defs.h
305
B
-rw-r--r--
pps_kernel.h
2.9
KB
-rw-r--r--
pr.h
566
B
-rw-r--r--
prandom.h
3.75
KB
-rw-r--r--
preempt.h
11.99
KB
-rw-r--r--
prefetch.h
1.7
KB
-rw-r--r--
prime_numbers.h
1.35
KB
-rw-r--r--
printk.h
22.19
KB
-rw-r--r--
prmt.h
143
B
-rw-r--r--
proc_fs.h
8.35
KB
-rw-r--r--
proc_ns.h
2.57
KB
-rw-r--r--
processor.h
1.84
KB
-rw-r--r--
profile.h
2.65
KB
-rw-r--r--
projid.h
2.22
KB
-rw-r--r--
property.h
17.28
KB
-rw-r--r--
pruss_driver.h
1.27
KB
-rw-r--r--
psci.h
1.52
KB
-rw-r--r--
pseudo_fs.h
355
B
-rw-r--r--
psi.h
1.56
KB
-rw-r--r--
psi_types.h
4.31
KB
-rw-r--r--
psp-sev.h
17.76
KB
-rw-r--r--
psp-tee.h
2.65
KB
-rw-r--r--
pstore.h
7.63
KB
-rw-r--r--
pstore_blk.h
1.53
KB
-rw-r--r--
pstore_ram.h
3.82
KB
-rw-r--r--
pstore_zone.h
2.28
KB
-rw-r--r--
ptdump.h
567
B
-rw-r--r--
pti.h
240
B
-rw-r--r--
ptp_classify.h
4.35
KB
-rw-r--r--
ptp_clock_kernel.h
12.2
KB
-rw-r--r--
ptp_kvm.h
430
B
-rw-r--r--
ptp_pch.h
623
B
-rw-r--r--
ptr_ring.h
16.29
KB
-rw-r--r--
ptrace.h
14.92
KB
-rw-r--r--
purgatory.h
590
B
-rw-r--r--
pvclock_gtod.h
548
B
-rw-r--r--
pwm.h
16.37
KB
-rw-r--r--
pwm_backlight.h
722
B
-rw-r--r--
pxa168_eth.h
728
B
-rw-r--r--
pxa2xx_ssp.h
11.13
KB
-rw-r--r--
qcom-geni-se.h
13.74
KB
-rw-r--r--
qcom_scm.h
3.81
KB
-rw-r--r--
qnx6_fs.h
3.27
KB
-rw-r--r--
quota.h
18.67
KB
-rw-r--r--
quotaops.h
10.28
KB
-rw-r--r--
radix-tree.h
15.63
KB
-rw-r--r--
raid_class.h
2.1
KB
-rw-r--r--
ramfs.h
695
B
-rw-r--r--
random.h
4.12
KB
-rw-r--r--
randomize_kstack.h
1.92
KB
-rw-r--r--
range.h
775
B
-rw-r--r--
ras.h
1.02
KB
-rw-r--r--
ratelimit.h
1.72
KB
-rw-r--r--
ratelimit_types.h
1.14
KB
-rw-r--r--
rational.h
639
B
-rw-r--r--
rbtree.h
8.93
KB
-rw-r--r--
rbtree_augmented.h
9.53
KB
-rw-r--r--
rbtree_latch.h
6.66
KB
-rw-r--r--
rbtree_types.h
946
B
-rw-r--r--
rcu_node_tree.h
3.73
KB
-rw-r--r--
rcu_segcblist.h
10.03
KB
-rw-r--r--
rcu_sync.h
1.46
KB
-rw-r--r--
rculist.h
28.56
KB
-rw-r--r--
rculist_bl.h
3.29
KB
-rw-r--r--
rculist_nulls.h
6.57
KB
-rw-r--r--
rcupdate.h
36.33
KB
-rw-r--r--
rcupdate_trace.h
3.08
KB
-rw-r--r--
rcupdate_wait.h
1.73
KB
-rw-r--r--
rcutiny.h
3.32
KB
-rw-r--r--
rcutree.h
2.34
KB
-rw-r--r--
rcuwait.h
1.84
KB
-rw-r--r--
reboot-mode.h
600
B
-rw-r--r--
reboot.h
2.18
KB
-rw-r--r--
reciprocal_div.h
3.28
KB
-rw-r--r--
refcount.h
12.02
KB
-rw-r--r--
regmap.h
62.95
KB
-rw-r--r--
regset.h
11.35
KB
-rw-r--r--
relay.h
8.47
KB
-rw-r--r--
remoteproc.h
24.77
KB
-rw-r--r--
resctrl.h
6.5
KB
-rw-r--r--
reset-controller.h
3.57
KB
-rw-r--r--
reset.h
30.24
KB
-rw-r--r--
resource.h
339
B
-rw-r--r--
resource_ext.h
2.08
KB
-rw-r--r--
restart_block.h
1.11
KB
-rw-r--r--
rfkill.h
10.52
KB
-rw-r--r--
rhashtable-types.h
3.45
KB
-rw-r--r--
rhashtable.h
37.59
KB
-rw-r--r--
ring_buffer.h
7.43
KB
-rw-r--r--
rio.h
19.02
KB
-rw-r--r--
rio_drv.h
14.32
KB
-rw-r--r--
rio_ids.h
1.08
KB
-rw-r--r--
rio_regs.h
19.07
KB
-rw-r--r--
rmap.h
8.96
KB
-rw-r--r--
rmi.h
12.04
KB
-rw-r--r--
rndis.h
16.86
KB
-rw-r--r--
rodata_test.h
394
B
-rw-r--r--
root_dev.h
619
B
-rw-r--r--
rpmsg.h
8.4
KB
-rw-r--r--
rslib.h
3.67
KB
-rw-r--r--
rtc.h
8.65
KB
-rw-r--r--
rtmutex.h
2.97
KB
-rw-r--r--
rtnetlink.h
4.46
KB
-rw-r--r--
rtsx_common.h
890
B
-rw-r--r--
rtsx_pci.h
39.82
KB
-rw-r--r--
rtsx_usb.h
15.42
KB
-rw-r--r--
rwbase_rt.h
876
B
-rw-r--r--
rwlock.h
4.55
KB
-rw-r--r--
rwlock_api_smp.h
7.65
KB
-rw-r--r--
rwlock_rt.h
2.98
KB
-rw-r--r--
rwlock_types.h
1.77
KB
-rw-r--r--
rwsem.h
7.32
KB
-rw-r--r--
s3c_adc_battery.h
923
B
-rw-r--r--
sbitmap.h
16.9
KB
-rw-r--r--
scatterlist.h
17.56
KB
-rw-r--r--
scc.h
2.84
KB
-rw-r--r--
sched.h
64.44
KB
-rw-r--r--
sched_clock.h
1.44
KB
-rw-r--r--
scmi_protocol.h
26.03
KB
-rw-r--r--
scpi_protocol.h
2.67
KB
-rw-r--r--
screen_info.h
191
B
-rw-r--r--
scs.h
1.83
KB
-rw-r--r--
sctp.h
22.88
KB
-rw-r--r--
scx200.h
1.82
KB
-rw-r--r--
scx200_gpio.h
2.38
KB
-rw-r--r--
sdb.h
4.17
KB
-rw-r--r--
seccomp.h
3.45
KB
-rw-r--r--
secretmem.h
1.17
KB
-rw-r--r--
securebits.h
239
B
-rw-r--r--
security.h
58.64
KB
-rw-r--r--
sed-opal.h
1.66
KB
-rw-r--r--
seg6.h
121
B
-rw-r--r--
seg6_genl.h
136
B
-rw-r--r--
seg6_hmac.h
136
B
-rw-r--r--
seg6_iptunnel.h
148
B
-rw-r--r--
seg6_local.h
100
B
-rw-r--r--
selection.h
1.81
KB
-rw-r--r--
sem.h
599
B
-rw-r--r--
semaphore.h
1.35
KB
-rw-r--r--
seq_buf.h
3.94
KB
-rw-r--r--
seq_file.h
8.75
KB
-rw-r--r--
seq_file_net.h
730
B
-rw-r--r--
seqlock.h
38.18
KB
-rw-r--r--
seqno-fence.h
3.57
KB
-rw-r--r--
serdev.h
9.82
KB
-rw-r--r--
serial.h
630
B
-rw-r--r--
serial_8250.h
6.57
KB
-rw-r--r--
serial_bcm63xx.h
4.73
KB
-rw-r--r--
serial_core.h
17.65
KB
-rw-r--r--
serial_max3100.h
1.19
KB
-rw-r--r--
serial_s3c.h
9.42
KB
-rw-r--r--
serial_sci.h
1.6
KB
-rw-r--r--
serio.h
4.28
KB
-rw-r--r--
set_memory.h
1.66
KB
-rw-r--r--
sfp.h
15.87
KB
-rw-r--r--
sh_clk.h
5.96
KB
-rw-r--r--
sh_dma.h
3.47
KB
-rw-r--r--
sh_eth.h
369
B
-rw-r--r--
sh_intc.h
3.42
KB
-rw-r--r--
sh_timer.h
172
B
-rw-r--r--
shdma-base.h
4.27
KB
-rw-r--r--
shm.h
968
B
-rw-r--r--
shmem_fs.h
5.81
KB
-rw-r--r--
shrinker.h
3.25
KB
-rw-r--r--
signal.h
13.56
KB
-rw-r--r--
signal_types.h
1.68
KB
-rw-r--r--
signalfd.h
817
B
-rw-r--r--
siox.h
2.26
KB
-rw-r--r--
siphash.h
4.53
KB
-rw-r--r--
sizes.h
1.27
KB
-rw-r--r--
skb_array.h
5.18
KB
-rw-r--r--
skbuff.h
133.77
KB
-rw-r--r--
skmsg.h
13.29
KB
-rw-r--r--
slab.h
22.32
KB
-rw-r--r--
slab_def.h
3.02
KB
-rw-r--r--
slimbus.h
6.93
KB
-rw-r--r--
slub_def.h
6.22
KB
-rw-r--r--
sm501-regs.h
11.62
KB
-rw-r--r--
sm501.h
4.02
KB
-rw-r--r--
smc911x.h
294
B
-rw-r--r--
smc91x.h
1.57
KB
-rw-r--r--
smp.h
7.63
KB
-rw-r--r--
smp_types.h
1.35
KB
-rw-r--r--
smpboot.h
1.68
KB
-rw-r--r--
smsc911x.h
1.63
KB
-rw-r--r--
smscphy.h
1.25
KB
-rw-r--r--
sock_diag.h
2.31
KB
-rw-r--r--
socket.h
15.04
KB
-rw-r--r--
sockptr.h
2.23
KB
-rw-r--r--
sonet.h
469
B
-rw-r--r--
sony-laptop.h
1.41
KB
-rw-r--r--
sonypi.h
1.71
KB
-rw-r--r--
sort.h
346
B
-rw-r--r--
sound.h
685
B
-rw-r--r--
soundcard.h
1.59
KB
-rw-r--r--
spinlock.h
14.07
KB
-rw-r--r--
spinlock_api_smp.h
5.47
KB
-rw-r--r--
spinlock_api_up.h
3.31
KB
-rw-r--r--
spinlock_rt.h
4.11
KB
-rw-r--r--
spinlock_types.h
1.78
KB
-rw-r--r--
spinlock_types_raw.h
1.69
KB
-rw-r--r--
spinlock_types_up.h
726
B
-rw-r--r--
spinlock_up.h
2.16
KB
-rw-r--r--
splice.h
3.24
KB
-rw-r--r--
spmi.h
5.59
KB
-rw-r--r--
sram.h
844
B
-rw-r--r--
srcu.h
6.93
KB
-rw-r--r--
srcutiny.h
2.75
KB
-rw-r--r--
srcutree.h
4.8
KB
-rw-r--r--
ssbi.h
726
B
-rw-r--r--
stackdepot.h
768
B
-rw-r--r--
stackleak.h
902
B
-rw-r--r--
stackprotector.h
361
B
-rw-r--r--
stacktrace.h
3.89
KB
-rw-r--r--
start_kernel.h
415
B
-rw-r--r--
stat.h
1.33
KB
-rw-r--r--
statfs.h
1.78
KB
-rw-r--r--
static_call.h
10.17
KB
-rw-r--r--
static_call_types.h
2.74
KB
-rw-r--r--
static_key.h
30
B
-rw-r--r--
stdarg.h
313
B
-rw-r--r--
stddef.h
827
B
-rw-r--r--
stm.h
4.34
KB
-rw-r--r--
stmmac.h
6.75
KB
-rw-r--r--
stmp3xxx_rtc_wdt.h
331
B
-rw-r--r--
stmp_device.h
412
B
-rw-r--r--
stop_machine.h
4.41
KB
-rw-r--r--
string.h
8.66
KB
-rw-r--r--
string_helpers.h
2.69
KB
-rw-r--r--
stringhash.h
2.65
KB
-rw-r--r--
stringify.h
341
B
-rw-r--r--
sungem_phy.h
3.94
KB
-rw-r--r--
sunserialcore.h
1.08
KB
-rw-r--r--
sunxi-rsb.h
2.89
KB
-rw-r--r--
superhyway.h
2.81
KB
-rw-r--r--
surface_acpi_notify.h
1.07
KB
-rw-r--r--
suspend.h
20.02
KB
-rw-r--r--
svga.h
3.75
KB
-rw-r--r--
sw842.h
328
B
-rw-r--r--
swab.h
569
B
-rw-r--r--
swait.h
9.45
KB
-rw-r--r--
swap.h
23.51
KB
-rw-r--r--
swap_cgroup.h
971
B
-rw-r--r--
swap_slots.h
841
B
-rw-r--r--
swapfile.h
556
B
-rw-r--r--
swapops.h
9.61
KB
-rw-r--r--
swiotlb.h
5.33
KB
-rw-r--r--
switchtec.h
10.9
KB
-rw-r--r--
sxgbe_platform.h
1.23
KB
-rw-r--r--
sync_core.h
581
B
-rw-r--r--
sync_file.h
1.57
KB
-rw-r--r--
synclink.h
989
B
-rw-r--r--
sys.h
960
B
-rw-r--r--
sys_soc.h
1.26
KB
-rw-r--r--
syscall_user_dispatch.h
930
B
-rw-r--r--
syscalls.h
55.31
KB
-rw-r--r--
syscore_ops.h
633
B
-rw-r--r--
sysctl.h
7.73
KB
-rw-r--r--
sysfb.h
2.39
KB
-rw-r--r--
sysfs.h
17.64
KB
-rw-r--r--
syslog.h
1.24
KB
-rw-r--r--
sysrq.h
1.96
KB
-rw-r--r--
sysv_fs.h
9.03
KB
-rw-r--r--
t10-pi.h
1.5
KB
-rw-r--r--
task_io_accounting.h
1.13
KB
-rw-r--r--
task_io_accounting_ops.h
2.55
KB
-rw-r--r--
task_work.h
854
B
-rw-r--r--
taskstats_kern.h
957
B
-rw-r--r--
tboot.h
3.33
KB
-rw-r--r--
tc.h
3.45
KB
-rw-r--r--
tca6416_keypad.h
701
B
-rw-r--r--
tcp.h
17.13
KB
-rw-r--r--
tee_drv.h
18.35
KB
-rw-r--r--
textsearch.h
4.73
KB
-rw-r--r--
textsearch_fsm.h
1.19
KB
-rw-r--r--
tfrc.h
1.68
KB
-rw-r--r--
thermal.h
15.41
KB
-rw-r--r--
thread_info.h
6.51
KB
-rw-r--r--
threads.h
1.28
KB
-rw-r--r--
thunderbolt.h
20.78
KB
-rw-r--r--
ti-emif-sram.h
5.15
KB
-rw-r--r--
ti_wilink_st.h
13.46
KB
-rw-r--r--
tick.h
9.74
KB
-rw-r--r--
tifm.h
4.66
KB
-rw-r--r--
timb_dma.h
1.17
KB
-rw-r--r--
timb_gpio.h
717
B
-rw-r--r--
time.h
3.14
KB
-rw-r--r--
time32.h
1.75
KB
-rw-r--r--
time64.h
4.49
KB
-rw-r--r--
time_namespace.h
3.82
KB
-rw-r--r--
timecounter.h
4.14
KB
-rw-r--r--
timekeeper_internal.h
5.33
KB
-rw-r--r--
timekeeping.h
7.61
KB
-rw-r--r--
timer.h
7.35
KB
-rw-r--r--
timerfd.h
508
B
-rw-r--r--
timeriomem-rng.h
432
B
-rw-r--r--
timerqueue.h
1.39
KB
-rw-r--r--
timex.h
6.41
KB
-rw-r--r--
tnum.h
3.39
KB
-rw-r--r--
topology.h
5.25
KB
-rw-r--r--
torture.h
4.2
KB
-rw-r--r--
toshiba.h
460
B
-rw-r--r--
tpm.h
10.98
KB
-rw-r--r--
tpm_command.h
847
B
-rw-r--r--
tpm_eventlog.h
6.54
KB
-rw-r--r--
trace.h
1.65
KB
-rw-r--r--
trace_clock.h
667
B
-rw-r--r--
trace_events.h
27.51
KB
-rw-r--r--
trace_recursion.h
5.63
KB
-rw-r--r--
trace_seq.h
3.92
KB
-rw-r--r--
tracefs.h
1018
B
-rw-r--r--
tracehook.h
7.97
KB
-rw-r--r--
tracepoint-defs.h
2.34
KB
-rw-r--r--
tracepoint.h
18.16
KB
-rw-r--r--
transport_class.h
2.51
KB
-rw-r--r--
ts-nbus.h
532
B
-rw-r--r--
tsacct_kern.h
1.2
KB
-rw-r--r--
tty.h
14.52
KB
-rw-r--r--
tty_buffer.h
1.28
KB
-rw-r--r--
tty_driver.h
15.69
KB
-rw-r--r--
tty_flip.h
1.74
KB
-rw-r--r--
tty_ldisc.h
8.46
KB
-rw-r--r--
tty_port.h
7.24
KB
-rw-r--r--
typecheck.h
782
B
-rw-r--r--
types.h
5.64
KB
-rw-r--r--
u64_stats_sync.h
5.69
KB
-rw-r--r--
uacce.h
3.74
KB
-rw-r--r--
uaccess.h
12.93
KB
-rw-r--r--
ucb1400.h
4.12
KB
-rw-r--r--
ucs2_string.h
662
B
-rw-r--r--
udp.h
4.53
KB
-rw-r--r--
uidgid.h
4.07
KB
-rw-r--r--
uio.h
9.01
KB
-rw-r--r--
uio_driver.h
4.71
KB
-rw-r--r--
umh.h
1.79
KB
-rw-r--r--
unicode.h
1.02
KB
-rw-r--r--
units.h
2.59
KB
-rw-r--r--
uprobes.h
6
KB
-rw-r--r--
usb.h
77.55
KB
-rw-r--r--
usb_usual.h
3.58
KB
-rw-r--r--
usbdevice_fs.h
2.18
KB
-rw-r--r--
user-return-notifier.h
1.18
KB
-rw-r--r--
user.h
22
B
-rw-r--r--
user_namespace.h
6.03
KB
-rw-r--r--
userfaultfd_k.h
6.44
KB
-rw-r--r--
usermode_driver.h
515
B
-rw-r--r--
util_macros.h
1.17
KB
-rw-r--r--
uts.h
388
B
-rw-r--r--
utsname.h
1.78
KB
-rw-r--r--
uuid.h
2.34
KB
-rw-r--r--
vbox_utils.h
1.75
KB
-rw-r--r--
vdpa.h
14.02
KB
-rw-r--r--
verification.h
1.77
KB
-rw-r--r--
vermagic.h
1.28
KB
-rw-r--r--
vexpress.h
297
B
-rw-r--r--
vfio.h
8.21
KB
-rw-r--r--
vfio_pci_core.h
7.46
KB
-rw-r--r--
vfs.h
116
B
-rw-r--r--
vga_switcheroo.h
8.62
KB
-rw-r--r--
vgaarb.h
3.88
KB
-rw-r--r--
vhost_iotlb.h
1.34
KB
-rw-r--r--
via-core.h
6.57
KB
-rw-r--r--
via-gpio.h
310
B
-rw-r--r--
via.h
932
B
-rw-r--r--
via_i2c.h
844
B
-rw-r--r--
videodev2.h
2.7
KB
-rw-r--r--
virtio.h
6.7
KB
-rw-r--r--
virtio_byteorder.h
1.46
KB
-rw-r--r--
virtio_caif.h
513
B
-rw-r--r--
virtio_config.h
16.26
KB
-rw-r--r--
virtio_console.h
1.93
KB
-rw-r--r--
virtio_dma_buf.h
1.12
KB
-rw-r--r--
virtio_net.h
5.38
KB
-rw-r--r--
virtio_pci_modern.h
3.25
KB
-rw-r--r--
virtio_ring.h
2.95
KB
-rw-r--r--
virtio_vsock.h
4.79
KB
-rw-r--r--
visorbus.h
12.23
KB
-rw-r--r--
vlynq.h
3.22
KB
-rw-r--r--
vm_event_item.h
3.46
KB
-rw-r--r--
vmacache.h
722
B
-rw-r--r--
vmalloc.h
8.61
KB
-rw-r--r--
vme.h
5.66
KB
-rw-r--r--
vmpressure.h
1.68
KB
-rw-r--r--
vmstat.h
14.76
KB
-rw-r--r--
vmw_vmci_api.h
2.88
KB
-rw-r--r--
vmw_vmci_defs.h
27.5
KB
-rw-r--r--
vringh.h
8.62
KB
-rw-r--r--
vt.h
611
B
-rw-r--r--
vt_buffer.h
1.49
KB
-rw-r--r--
vt_kern.h
5.31
KB
-rw-r--r--
vtime.h
4.6
KB
-rw-r--r--
w1-gpio.h
493
B
-rw-r--r--
w1.h
8.93
KB
-rw-r--r--
wait.h
41.93
KB
-rw-r--r--
wait_bit.h
11.2
KB
-rw-r--r--
watch_queue.h
3.82
KB
-rw-r--r--
watchdog.h
8.21
KB
-rw-r--r--
win_minmax.h
832
B
-rw-r--r--
wireless.h
1.4
KB
-rw-r--r--
wkup_m3_ipc.h
1.75
KB
-rw-r--r--
wl12xx.h
810
B
-rw-r--r--
wm97xx.h
10.59
KB
-rw-r--r--
wmi.h
1.56
KB
-rw-r--r--
workqueue.h
21.38
KB
-rw-r--r--
writeback.h
12.83
KB
-rw-r--r--
ww_mutex.h
13.11
KB
-rw-r--r--
wwan.h
5.13
KB
-rw-r--r--
xarray.h
56.17
KB
-rw-r--r--
xattr.h
3.97
KB
-rw-r--r--
xxhash.h
8.27
KB
-rw-r--r--
xz.h
11.16
KB
-rw-r--r--
yam.h
2.18
KB
-rw-r--r--
z2_battery.h
299
B
-rw-r--r--
zconf.h
1.73
KB
-rw-r--r--
zlib.h
28.11
KB
-rw-r--r--
zorro.h
3.57
KB
-rw-r--r--
zpool.h
3.24
KB
-rw-r--r--
zsmalloc.h
1.63
KB
-rw-r--r--
zstd.h
48.58
KB
-rw-r--r--
zutil.h
2.73
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : xarray.h
/* SPDX-License-Identifier: GPL-2.0+ */ #ifndef _LINUX_XARRAY_H #define _LINUX_XARRAY_H /* * eXtensible Arrays * Copyright (c) 2017 Microsoft Corporation * Author: Matthew Wilcox <willy@infradead.org> * * See Documentation/core-api/xarray.rst for how to use the XArray. */ #include <linux/bug.h> #include <linux/compiler.h> #include <linux/gfp.h> #include <linux/kconfig.h> #include <linux/kernel.h> #include <linux/rcupdate.h> #include <linux/spinlock.h> #include <linux/types.h> /* * The bottom two bits of the entry determine how the XArray interprets * the contents: * * 00: Pointer entry * 10: Internal entry * x1: Value entry or tagged pointer * * Attempting to store internal entries in the XArray is a bug. * * Most internal entries are pointers to the next node in the tree. * The following internal entries have a special meaning: * * 0-62: Sibling entries * 256: Retry entry * 257: Zero entry * * Errors are also represented as internal entries, but use the negative * space (-4094 to -2). They're never stored in the slots array; only * returned by the normal API. */ #define BITS_PER_XA_VALUE (BITS_PER_LONG - 1) /** * xa_mk_value() - Create an XArray entry from an integer. * @v: Value to store in XArray. * * Context: Any context. * Return: An entry suitable for storing in the XArray. */ static inline void *xa_mk_value(unsigned long v) { WARN_ON((long)v < 0); return (void *)((v << 1) | 1); } /** * xa_to_value() - Get value stored in an XArray entry. * @entry: XArray entry. * * Context: Any context. * Return: The value stored in the XArray entry. */ static inline unsigned long xa_to_value(const void *entry) { return (unsigned long)entry >> 1; } /** * xa_is_value() - Determine if an entry is a value. * @entry: XArray entry. * * Context: Any context. * Return: True if the entry is a value, false if it is a pointer. */ static inline bool xa_is_value(const void *entry) { return (unsigned long)entry & 1; } /** * xa_tag_pointer() - Create an XArray entry for a tagged pointer. * @p: Plain pointer. * @tag: Tag value (0, 1 or 3). * * If the user of the XArray prefers, they can tag their pointers instead * of storing value entries. Three tags are available (0, 1 and 3). * These are distinct from the xa_mark_t as they are not replicated up * through the array and cannot be searched for. * * Context: Any context. * Return: An XArray entry. */ static inline void *xa_tag_pointer(void *p, unsigned long tag) { return (void *)((unsigned long)p | tag); } /** * xa_untag_pointer() - Turn an XArray entry into a plain pointer. * @entry: XArray entry. * * If you have stored a tagged pointer in the XArray, call this function * to get the untagged version of the pointer. * * Context: Any context. * Return: A pointer. */ static inline void *xa_untag_pointer(void *entry) { return (void *)((unsigned long)entry & ~3UL); } /** * xa_pointer_tag() - Get the tag stored in an XArray entry. * @entry: XArray entry. * * If you have stored a tagged pointer in the XArray, call this function * to get the tag of that pointer. * * Context: Any context. * Return: A tag. */ static inline unsigned int xa_pointer_tag(void *entry) { return (unsigned long)entry & 3UL; } /* * xa_mk_internal() - Create an internal entry. * @v: Value to turn into an internal entry. * * Internal entries are used for a number of purposes. Entries 0-255 are * used for sibling entries (only 0-62 are used by the current code). 256 * is used for the retry entry. 257 is used for the reserved / zero entry. * Negative internal entries are used to represent errnos. Node pointers * are also tagged as internal entries in some situations. * * Context: Any context. * Return: An XArray internal entry corresponding to this value. */ static inline void *xa_mk_internal(unsigned long v) { return (void *)((v << 2) | 2); } /* * xa_to_internal() - Extract the value from an internal entry. * @entry: XArray entry. * * Context: Any context. * Return: The value which was stored in the internal entry. */ static inline unsigned long xa_to_internal(const void *entry) { return (unsigned long)entry >> 2; } /* * xa_is_internal() - Is the entry an internal entry? * @entry: XArray entry. * * Context: Any context. * Return: %true if the entry is an internal entry. */ static inline bool xa_is_internal(const void *entry) { return ((unsigned long)entry & 3) == 2; } #define XA_ZERO_ENTRY xa_mk_internal(257) /** * xa_is_zero() - Is the entry a zero entry? * @entry: Entry retrieved from the XArray * * The normal API will return NULL as the contents of a slot containing * a zero entry. You can only see zero entries by using the advanced API. * * Return: %true if the entry is a zero entry. */ static inline bool xa_is_zero(const void *entry) { return unlikely(entry == XA_ZERO_ENTRY); } /** * xa_is_err() - Report whether an XArray operation returned an error * @entry: Result from calling an XArray function * * If an XArray operation cannot complete an operation, it will return * a special value indicating an error. This function tells you * whether an error occurred; xa_err() tells you which error occurred. * * Context: Any context. * Return: %true if the entry indicates an error. */ static inline bool xa_is_err(const void *entry) { return unlikely(xa_is_internal(entry) && entry >= xa_mk_internal(-MAX_ERRNO)); } /** * xa_err() - Turn an XArray result into an errno. * @entry: Result from calling an XArray function. * * If an XArray operation cannot complete an operation, it will return * a special pointer value which encodes an errno. This function extracts * the errno from the pointer value, or returns 0 if the pointer does not * represent an errno. * * Context: Any context. * Return: A negative errno or 0. */ static inline int xa_err(void *entry) { /* xa_to_internal() would not do sign extension. */ if (xa_is_err(entry)) return (long)entry >> 2; return 0; } /** * struct xa_limit - Represents a range of IDs. * @min: The lowest ID to allocate (inclusive). * @max: The maximum ID to allocate (inclusive). * * This structure is used either directly or via the XA_LIMIT() macro * to communicate the range of IDs that are valid for allocation. * Three common ranges are predefined for you: * * xa_limit_32b - [0 - UINT_MAX] * * xa_limit_31b - [0 - INT_MAX] * * xa_limit_16b - [0 - USHRT_MAX] */ struct xa_limit { u32 max; u32 min; }; #define XA_LIMIT(_min, _max) (struct xa_limit) { .min = _min, .max = _max } #define xa_limit_32b XA_LIMIT(0, UINT_MAX) #define xa_limit_31b XA_LIMIT(0, INT_MAX) #define xa_limit_16b XA_LIMIT(0, USHRT_MAX) typedef unsigned __bitwise xa_mark_t; #define XA_MARK_0 ((__force xa_mark_t)0U) #define XA_MARK_1 ((__force xa_mark_t)1U) #define XA_MARK_2 ((__force xa_mark_t)2U) #define XA_PRESENT ((__force xa_mark_t)8U) #define XA_MARK_MAX XA_MARK_2 #define XA_FREE_MARK XA_MARK_0 enum xa_lock_type { XA_LOCK_IRQ = 1, XA_LOCK_BH = 2, }; /* * Values for xa_flags. The radix tree stores its GFP flags in the xa_flags, * and we remain compatible with that. */ #define XA_FLAGS_LOCK_IRQ ((__force gfp_t)XA_LOCK_IRQ) #define XA_FLAGS_LOCK_BH ((__force gfp_t)XA_LOCK_BH) #define XA_FLAGS_TRACK_FREE ((__force gfp_t)4U) #define XA_FLAGS_ZERO_BUSY ((__force gfp_t)8U) #define XA_FLAGS_ALLOC_WRAPPED ((__force gfp_t)16U) #define XA_FLAGS_ACCOUNT ((__force gfp_t)32U) #define XA_FLAGS_MARK(mark) ((__force gfp_t)((1U << __GFP_BITS_SHIFT) << \ (__force unsigned)(mark))) /* ALLOC is for a normal 0-based alloc. ALLOC1 is for an 1-based alloc */ #define XA_FLAGS_ALLOC (XA_FLAGS_TRACK_FREE | XA_FLAGS_MARK(XA_FREE_MARK)) #define XA_FLAGS_ALLOC1 (XA_FLAGS_TRACK_FREE | XA_FLAGS_ZERO_BUSY) /** * struct xarray - The anchor of the XArray. * @xa_lock: Lock that protects the contents of the XArray. * * To use the xarray, define it statically or embed it in your data structure. * It is a very small data structure, so it does not usually make sense to * allocate it separately and keep a pointer to it in your data structure. * * You may use the xa_lock to protect your own data structures as well. */ /* * If all of the entries in the array are NULL, @xa_head is a NULL pointer. * If the only non-NULL entry in the array is at index 0, @xa_head is that * entry. If any other entry in the array is non-NULL, @xa_head points * to an @xa_node. */ struct xarray { spinlock_t xa_lock; /* private: The rest of the data structure is not to be used directly. */ gfp_t xa_flags; void __rcu * xa_head; }; #define XARRAY_INIT(name, flags) { \ .xa_lock = __SPIN_LOCK_UNLOCKED(name.xa_lock), \ .xa_flags = flags, \ .xa_head = NULL, \ } /** * DEFINE_XARRAY_FLAGS() - Define an XArray with custom flags. * @name: A string that names your XArray. * @flags: XA_FLAG values. * * This is intended for file scope definitions of XArrays. It declares * and initialises an empty XArray with the chosen name and flags. It is * equivalent to calling xa_init_flags() on the array, but it does the * initialisation at compiletime instead of runtime. */ #define DEFINE_XARRAY_FLAGS(name, flags) \ struct xarray name = XARRAY_INIT(name, flags) /** * DEFINE_XARRAY() - Define an XArray. * @name: A string that names your XArray. * * This is intended for file scope definitions of XArrays. It declares * and initialises an empty XArray with the chosen name. It is equivalent * to calling xa_init() on the array, but it does the initialisation at * compiletime instead of runtime. */ #define DEFINE_XARRAY(name) DEFINE_XARRAY_FLAGS(name, 0) /** * DEFINE_XARRAY_ALLOC() - Define an XArray which allocates IDs starting at 0. * @name: A string that names your XArray. * * This is intended for file scope definitions of allocating XArrays. * See also DEFINE_XARRAY(). */ #define DEFINE_XARRAY_ALLOC(name) DEFINE_XARRAY_FLAGS(name, XA_FLAGS_ALLOC) /** * DEFINE_XARRAY_ALLOC1() - Define an XArray which allocates IDs starting at 1. * @name: A string that names your XArray. * * This is intended for file scope definitions of allocating XArrays. * See also DEFINE_XARRAY(). */ #define DEFINE_XARRAY_ALLOC1(name) DEFINE_XARRAY_FLAGS(name, XA_FLAGS_ALLOC1) void *xa_load(struct xarray *, unsigned long index); void *xa_store(struct xarray *, unsigned long index, void *entry, gfp_t); void *xa_erase(struct xarray *, unsigned long index); void *xa_store_range(struct xarray *, unsigned long first, unsigned long last, void *entry, gfp_t); bool xa_get_mark(struct xarray *, unsigned long index, xa_mark_t); void xa_set_mark(struct xarray *, unsigned long index, xa_mark_t); void xa_clear_mark(struct xarray *, unsigned long index, xa_mark_t); void *xa_find(struct xarray *xa, unsigned long *index, unsigned long max, xa_mark_t) __attribute__((nonnull(2))); void *xa_find_after(struct xarray *xa, unsigned long *index, unsigned long max, xa_mark_t) __attribute__((nonnull(2))); unsigned int xa_extract(struct xarray *, void **dst, unsigned long start, unsigned long max, unsigned int n, xa_mark_t); void xa_destroy(struct xarray *); /** * xa_init_flags() - Initialise an empty XArray with flags. * @xa: XArray. * @flags: XA_FLAG values. * * If you need to initialise an XArray with special flags (eg you need * to take the lock from interrupt context), use this function instead * of xa_init(). * * Context: Any context. */ static inline void xa_init_flags(struct xarray *xa, gfp_t flags) { spin_lock_init(&xa->xa_lock); xa->xa_flags = flags; xa->xa_head = NULL; } /** * xa_init() - Initialise an empty XArray. * @xa: XArray. * * An empty XArray is full of NULL entries. * * Context: Any context. */ static inline void xa_init(struct xarray *xa) { xa_init_flags(xa, 0); } /** * xa_empty() - Determine if an array has any present entries. * @xa: XArray. * * Context: Any context. * Return: %true if the array contains only NULL pointers. */ static inline bool xa_empty(const struct xarray *xa) { return xa->xa_head == NULL; } /** * xa_marked() - Inquire whether any entry in this array has a mark set * @xa: Array * @mark: Mark value * * Context: Any context. * Return: %true if any entry has this mark set. */ static inline bool xa_marked(const struct xarray *xa, xa_mark_t mark) { return xa->xa_flags & XA_FLAGS_MARK(mark); } /** * xa_for_each_range() - Iterate over a portion of an XArray. * @xa: XArray. * @index: Index of @entry. * @entry: Entry retrieved from array. * @start: First index to retrieve from array. * @last: Last index to retrieve from array. * * During the iteration, @entry will have the value of the entry stored * in @xa at @index. You may modify @index during the iteration if you * want to skip or reprocess indices. It is safe to modify the array * during the iteration. At the end of the iteration, @entry will be set * to NULL and @index will have a value less than or equal to max. * * xa_for_each_range() is O(n.log(n)) while xas_for_each() is O(n). You have * to handle your own locking with xas_for_each(), and if you have to unlock * after each iteration, it will also end up being O(n.log(n)). * xa_for_each_range() will spin if it hits a retry entry; if you intend to * see retry entries, you should use the xas_for_each() iterator instead. * The xas_for_each() iterator will expand into more inline code than * xa_for_each_range(). * * Context: Any context. Takes and releases the RCU lock. */ #define xa_for_each_range(xa, index, entry, start, last) \ for (index = start, \ entry = xa_find(xa, &index, last, XA_PRESENT); \ entry; \ entry = xa_find_after(xa, &index, last, XA_PRESENT)) /** * xa_for_each_start() - Iterate over a portion of an XArray. * @xa: XArray. * @index: Index of @entry. * @entry: Entry retrieved from array. * @start: First index to retrieve from array. * * During the iteration, @entry will have the value of the entry stored * in @xa at @index. You may modify @index during the iteration if you * want to skip or reprocess indices. It is safe to modify the array * during the iteration. At the end of the iteration, @entry will be set * to NULL and @index will have a value less than or equal to max. * * xa_for_each_start() is O(n.log(n)) while xas_for_each() is O(n). You have * to handle your own locking with xas_for_each(), and if you have to unlock * after each iteration, it will also end up being O(n.log(n)). * xa_for_each_start() will spin if it hits a retry entry; if you intend to * see retry entries, you should use the xas_for_each() iterator instead. * The xas_for_each() iterator will expand into more inline code than * xa_for_each_start(). * * Context: Any context. Takes and releases the RCU lock. */ #define xa_for_each_start(xa, index, entry, start) \ xa_for_each_range(xa, index, entry, start, ULONG_MAX) /** * xa_for_each() - Iterate over present entries in an XArray. * @xa: XArray. * @index: Index of @entry. * @entry: Entry retrieved from array. * * During the iteration, @entry will have the value of the entry stored * in @xa at @index. You may modify @index during the iteration if you want * to skip or reprocess indices. It is safe to modify the array during the * iteration. At the end of the iteration, @entry will be set to NULL and * @index will have a value less than or equal to max. * * xa_for_each() is O(n.log(n)) while xas_for_each() is O(n). You have * to handle your own locking with xas_for_each(), and if you have to unlock * after each iteration, it will also end up being O(n.log(n)). xa_for_each() * will spin if it hits a retry entry; if you intend to see retry entries, * you should use the xas_for_each() iterator instead. The xas_for_each() * iterator will expand into more inline code than xa_for_each(). * * Context: Any context. Takes and releases the RCU lock. */ #define xa_for_each(xa, index, entry) \ xa_for_each_start(xa, index, entry, 0) /** * xa_for_each_marked() - Iterate over marked entries in an XArray. * @xa: XArray. * @index: Index of @entry. * @entry: Entry retrieved from array. * @filter: Selection criterion. * * During the iteration, @entry will have the value of the entry stored * in @xa at @index. The iteration will skip all entries in the array * which do not match @filter. You may modify @index during the iteration * if you want to skip or reprocess indices. It is safe to modify the array * during the iteration. At the end of the iteration, @entry will be set to * NULL and @index will have a value less than or equal to max. * * xa_for_each_marked() is O(n.log(n)) while xas_for_each_marked() is O(n). * You have to handle your own locking with xas_for_each(), and if you have * to unlock after each iteration, it will also end up being O(n.log(n)). * xa_for_each_marked() will spin if it hits a retry entry; if you intend to * see retry entries, you should use the xas_for_each_marked() iterator * instead. The xas_for_each_marked() iterator will expand into more inline * code than xa_for_each_marked(). * * Context: Any context. Takes and releases the RCU lock. */ #define xa_for_each_marked(xa, index, entry, filter) \ for (index = 0, entry = xa_find(xa, &index, ULONG_MAX, filter); \ entry; entry = xa_find_after(xa, &index, ULONG_MAX, filter)) #define xa_trylock(xa) spin_trylock(&(xa)->xa_lock) #define xa_lock(xa) spin_lock(&(xa)->xa_lock) #define xa_unlock(xa) spin_unlock(&(xa)->xa_lock) #define xa_lock_bh(xa) spin_lock_bh(&(xa)->xa_lock) #define xa_unlock_bh(xa) spin_unlock_bh(&(xa)->xa_lock) #define xa_lock_irq(xa) spin_lock_irq(&(xa)->xa_lock) #define xa_unlock_irq(xa) spin_unlock_irq(&(xa)->xa_lock) #define xa_lock_irqsave(xa, flags) \ spin_lock_irqsave(&(xa)->xa_lock, flags) #define xa_unlock_irqrestore(xa, flags) \ spin_unlock_irqrestore(&(xa)->xa_lock, flags) #define xa_lock_nested(xa, subclass) \ spin_lock_nested(&(xa)->xa_lock, subclass) #define xa_lock_bh_nested(xa, subclass) \ spin_lock_bh_nested(&(xa)->xa_lock, subclass) #define xa_lock_irq_nested(xa, subclass) \ spin_lock_irq_nested(&(xa)->xa_lock, subclass) #define xa_lock_irqsave_nested(xa, flags, subclass) \ spin_lock_irqsave_nested(&(xa)->xa_lock, flags, subclass) /* * Versions of the normal API which require the caller to hold the * xa_lock. If the GFP flags allow it, they will drop the lock to * allocate memory, then reacquire it afterwards. These functions * may also re-enable interrupts if the XArray flags indicate the * locking should be interrupt safe. */ void *__xa_erase(struct xarray *, unsigned long index); void *__xa_store(struct xarray *, unsigned long index, void *entry, gfp_t); void *__xa_cmpxchg(struct xarray *, unsigned long index, void *old, void *entry, gfp_t); int __must_check __xa_insert(struct xarray *, unsigned long index, void *entry, gfp_t); int __must_check __xa_alloc(struct xarray *, u32 *id, void *entry, struct xa_limit, gfp_t); int __must_check __xa_alloc_cyclic(struct xarray *, u32 *id, void *entry, struct xa_limit, u32 *next, gfp_t); void __xa_set_mark(struct xarray *, unsigned long index, xa_mark_t); void __xa_clear_mark(struct xarray *, unsigned long index, xa_mark_t); /** * xa_store_bh() - Store this entry in the XArray. * @xa: XArray. * @index: Index into array. * @entry: New entry. * @gfp: Memory allocation flags. * * This function is like calling xa_store() except it disables softirqs * while holding the array lock. * * Context: Any context. Takes and releases the xa_lock while * disabling softirqs. * Return: The old entry at this index or xa_err() if an error happened. */ static inline void *xa_store_bh(struct xarray *xa, unsigned long index, void *entry, gfp_t gfp) { void *curr; xa_lock_bh(xa); curr = __xa_store(xa, index, entry, gfp); xa_unlock_bh(xa); return curr; } /** * xa_store_irq() - Store this entry in the XArray. * @xa: XArray. * @index: Index into array. * @entry: New entry. * @gfp: Memory allocation flags. * * This function is like calling xa_store() except it disables interrupts * while holding the array lock. * * Context: Process context. Takes and releases the xa_lock while * disabling interrupts. * Return: The old entry at this index or xa_err() if an error happened. */ static inline void *xa_store_irq(struct xarray *xa, unsigned long index, void *entry, gfp_t gfp) { void *curr; xa_lock_irq(xa); curr = __xa_store(xa, index, entry, gfp); xa_unlock_irq(xa); return curr; } /** * xa_erase_bh() - Erase this entry from the XArray. * @xa: XArray. * @index: Index of entry. * * After this function returns, loading from @index will return %NULL. * If the index is part of a multi-index entry, all indices will be erased * and none of the entries will be part of a multi-index entry. * * Context: Any context. Takes and releases the xa_lock while * disabling softirqs. * Return: The entry which used to be at this index. */ static inline void *xa_erase_bh(struct xarray *xa, unsigned long index) { void *entry; xa_lock_bh(xa); entry = __xa_erase(xa, index); xa_unlock_bh(xa); return entry; } /** * xa_erase_irq() - Erase this entry from the XArray. * @xa: XArray. * @index: Index of entry. * * After this function returns, loading from @index will return %NULL. * If the index is part of a multi-index entry, all indices will be erased * and none of the entries will be part of a multi-index entry. * * Context: Process context. Takes and releases the xa_lock while * disabling interrupts. * Return: The entry which used to be at this index. */ static inline void *xa_erase_irq(struct xarray *xa, unsigned long index) { void *entry; xa_lock_irq(xa); entry = __xa_erase(xa, index); xa_unlock_irq(xa); return entry; } /** * xa_cmpxchg() - Conditionally replace an entry in the XArray. * @xa: XArray. * @index: Index into array. * @old: Old value to test against. * @entry: New value to place in array. * @gfp: Memory allocation flags. * * If the entry at @index is the same as @old, replace it with @entry. * If the return value is equal to @old, then the exchange was successful. * * Context: Any context. Takes and releases the xa_lock. May sleep * if the @gfp flags permit. * Return: The old value at this index or xa_err() if an error happened. */ static inline void *xa_cmpxchg(struct xarray *xa, unsigned long index, void *old, void *entry, gfp_t gfp) { void *curr; xa_lock(xa); curr = __xa_cmpxchg(xa, index, old, entry, gfp); xa_unlock(xa); return curr; } /** * xa_cmpxchg_bh() - Conditionally replace an entry in the XArray. * @xa: XArray. * @index: Index into array. * @old: Old value to test against. * @entry: New value to place in array. * @gfp: Memory allocation flags. * * This function is like calling xa_cmpxchg() except it disables softirqs * while holding the array lock. * * Context: Any context. Takes and releases the xa_lock while * disabling softirqs. May sleep if the @gfp flags permit. * Return: The old value at this index or xa_err() if an error happened. */ static inline void *xa_cmpxchg_bh(struct xarray *xa, unsigned long index, void *old, void *entry, gfp_t gfp) { void *curr; xa_lock_bh(xa); curr = __xa_cmpxchg(xa, index, old, entry, gfp); xa_unlock_bh(xa); return curr; } /** * xa_cmpxchg_irq() - Conditionally replace an entry in the XArray. * @xa: XArray. * @index: Index into array. * @old: Old value to test against. * @entry: New value to place in array. * @gfp: Memory allocation flags. * * This function is like calling xa_cmpxchg() except it disables interrupts * while holding the array lock. * * Context: Process context. Takes and releases the xa_lock while * disabling interrupts. May sleep if the @gfp flags permit. * Return: The old value at this index or xa_err() if an error happened. */ static inline void *xa_cmpxchg_irq(struct xarray *xa, unsigned long index, void *old, void *entry, gfp_t gfp) { void *curr; xa_lock_irq(xa); curr = __xa_cmpxchg(xa, index, old, entry, gfp); xa_unlock_irq(xa); return curr; } /** * xa_insert() - Store this entry in the XArray unless another entry is * already present. * @xa: XArray. * @index: Index into array. * @entry: New entry. * @gfp: Memory allocation flags. * * Inserting a NULL entry will store a reserved entry (like xa_reserve()) * if no entry is present. Inserting will fail if a reserved entry is * present, even though loading from this index will return NULL. * * Context: Any context. Takes and releases the xa_lock. May sleep if * the @gfp flags permit. * Return: 0 if the store succeeded. -EBUSY if another entry was present. * -ENOMEM if memory could not be allocated. */ static inline int __must_check xa_insert(struct xarray *xa, unsigned long index, void *entry, gfp_t gfp) { int err; xa_lock(xa); err = __xa_insert(xa, index, entry, gfp); xa_unlock(xa); return err; } /** * xa_insert_bh() - Store this entry in the XArray unless another entry is * already present. * @xa: XArray. * @index: Index into array. * @entry: New entry. * @gfp: Memory allocation flags. * * Inserting a NULL entry will store a reserved entry (like xa_reserve()) * if no entry is present. Inserting will fail if a reserved entry is * present, even though loading from this index will return NULL. * * Context: Any context. Takes and releases the xa_lock while * disabling softirqs. May sleep if the @gfp flags permit. * Return: 0 if the store succeeded. -EBUSY if another entry was present. * -ENOMEM if memory could not be allocated. */ static inline int __must_check xa_insert_bh(struct xarray *xa, unsigned long index, void *entry, gfp_t gfp) { int err; xa_lock_bh(xa); err = __xa_insert(xa, index, entry, gfp); xa_unlock_bh(xa); return err; } /** * xa_insert_irq() - Store this entry in the XArray unless another entry is * already present. * @xa: XArray. * @index: Index into array. * @entry: New entry. * @gfp: Memory allocation flags. * * Inserting a NULL entry will store a reserved entry (like xa_reserve()) * if no entry is present. Inserting will fail if a reserved entry is * present, even though loading from this index will return NULL. * * Context: Process context. Takes and releases the xa_lock while * disabling interrupts. May sleep if the @gfp flags permit. * Return: 0 if the store succeeded. -EBUSY if another entry was present. * -ENOMEM if memory could not be allocated. */ static inline int __must_check xa_insert_irq(struct xarray *xa, unsigned long index, void *entry, gfp_t gfp) { int err; xa_lock_irq(xa); err = __xa_insert(xa, index, entry, gfp); xa_unlock_irq(xa); return err; } /** * xa_alloc() - Find somewhere to store this entry in the XArray. * @xa: XArray. * @id: Pointer to ID. * @entry: New entry. * @limit: Range of ID to allocate. * @gfp: Memory allocation flags. * * Finds an empty entry in @xa between @limit.min and @limit.max, * stores the index into the @id pointer, then stores the entry at * that index. A concurrent lookup will not see an uninitialised @id. * * Context: Any context. Takes and releases the xa_lock. May sleep if * the @gfp flags permit. * Return: 0 on success, -ENOMEM if memory could not be allocated or * -EBUSY if there are no free entries in @limit. */ static inline __must_check int xa_alloc(struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, gfp_t gfp) { int err; xa_lock(xa); err = __xa_alloc(xa, id, entry, limit, gfp); xa_unlock(xa); return err; } /** * xa_alloc_bh() - Find somewhere to store this entry in the XArray. * @xa: XArray. * @id: Pointer to ID. * @entry: New entry. * @limit: Range of ID to allocate. * @gfp: Memory allocation flags. * * Finds an empty entry in @xa between @limit.min and @limit.max, * stores the index into the @id pointer, then stores the entry at * that index. A concurrent lookup will not see an uninitialised @id. * * Context: Any context. Takes and releases the xa_lock while * disabling softirqs. May sleep if the @gfp flags permit. * Return: 0 on success, -ENOMEM if memory could not be allocated or * -EBUSY if there are no free entries in @limit. */ static inline int __must_check xa_alloc_bh(struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, gfp_t gfp) { int err; xa_lock_bh(xa); err = __xa_alloc(xa, id, entry, limit, gfp); xa_unlock_bh(xa); return err; } /** * xa_alloc_irq() - Find somewhere to store this entry in the XArray. * @xa: XArray. * @id: Pointer to ID. * @entry: New entry. * @limit: Range of ID to allocate. * @gfp: Memory allocation flags. * * Finds an empty entry in @xa between @limit.min and @limit.max, * stores the index into the @id pointer, then stores the entry at * that index. A concurrent lookup will not see an uninitialised @id. * * Context: Process context. Takes and releases the xa_lock while * disabling interrupts. May sleep if the @gfp flags permit. * Return: 0 on success, -ENOMEM if memory could not be allocated or * -EBUSY if there are no free entries in @limit. */ static inline int __must_check xa_alloc_irq(struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, gfp_t gfp) { int err; xa_lock_irq(xa); err = __xa_alloc(xa, id, entry, limit, gfp); xa_unlock_irq(xa); return err; } /** * xa_alloc_cyclic() - Find somewhere to store this entry in the XArray. * @xa: XArray. * @id: Pointer to ID. * @entry: New entry. * @limit: Range of allocated ID. * @next: Pointer to next ID to allocate. * @gfp: Memory allocation flags. * * Finds an empty entry in @xa between @limit.min and @limit.max, * stores the index into the @id pointer, then stores the entry at * that index. A concurrent lookup will not see an uninitialised @id. * The search for an empty entry will start at @next and will wrap * around if necessary. * * Context: Any context. Takes and releases the xa_lock. May sleep if * the @gfp flags permit. * Return: 0 if the allocation succeeded without wrapping. 1 if the * allocation succeeded after wrapping, -ENOMEM if memory could not be * allocated or -EBUSY if there are no free entries in @limit. */ static inline int xa_alloc_cyclic(struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, u32 *next, gfp_t gfp) { int err; xa_lock(xa); err = __xa_alloc_cyclic(xa, id, entry, limit, next, gfp); xa_unlock(xa); return err; } /** * xa_alloc_cyclic_bh() - Find somewhere to store this entry in the XArray. * @xa: XArray. * @id: Pointer to ID. * @entry: New entry. * @limit: Range of allocated ID. * @next: Pointer to next ID to allocate. * @gfp: Memory allocation flags. * * Finds an empty entry in @xa between @limit.min and @limit.max, * stores the index into the @id pointer, then stores the entry at * that index. A concurrent lookup will not see an uninitialised @id. * The search for an empty entry will start at @next and will wrap * around if necessary. * * Context: Any context. Takes and releases the xa_lock while * disabling softirqs. May sleep if the @gfp flags permit. * Return: 0 if the allocation succeeded without wrapping. 1 if the * allocation succeeded after wrapping, -ENOMEM if memory could not be * allocated or -EBUSY if there are no free entries in @limit. */ static inline int xa_alloc_cyclic_bh(struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, u32 *next, gfp_t gfp) { int err; xa_lock_bh(xa); err = __xa_alloc_cyclic(xa, id, entry, limit, next, gfp); xa_unlock_bh(xa); return err; } /** * xa_alloc_cyclic_irq() - Find somewhere to store this entry in the XArray. * @xa: XArray. * @id: Pointer to ID. * @entry: New entry. * @limit: Range of allocated ID. * @next: Pointer to next ID to allocate. * @gfp: Memory allocation flags. * * Finds an empty entry in @xa between @limit.min and @limit.max, * stores the index into the @id pointer, then stores the entry at * that index. A concurrent lookup will not see an uninitialised @id. * The search for an empty entry will start at @next and will wrap * around if necessary. * * Context: Process context. Takes and releases the xa_lock while * disabling interrupts. May sleep if the @gfp flags permit. * Return: 0 if the allocation succeeded without wrapping. 1 if the * allocation succeeded after wrapping, -ENOMEM if memory could not be * allocated or -EBUSY if there are no free entries in @limit. */ static inline int xa_alloc_cyclic_irq(struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, u32 *next, gfp_t gfp) { int err; xa_lock_irq(xa); err = __xa_alloc_cyclic(xa, id, entry, limit, next, gfp); xa_unlock_irq(xa); return err; } /** * xa_reserve() - Reserve this index in the XArray. * @xa: XArray. * @index: Index into array. * @gfp: Memory allocation flags. * * Ensures there is somewhere to store an entry at @index in the array. * If there is already something stored at @index, this function does * nothing. If there was nothing there, the entry is marked as reserved. * Loading from a reserved entry returns a %NULL pointer. * * If you do not use the entry that you have reserved, call xa_release() * or xa_erase() to free any unnecessary memory. * * Context: Any context. Takes and releases the xa_lock. * May sleep if the @gfp flags permit. * Return: 0 if the reservation succeeded or -ENOMEM if it failed. */ static inline __must_check int xa_reserve(struct xarray *xa, unsigned long index, gfp_t gfp) { return xa_err(xa_cmpxchg(xa, index, NULL, XA_ZERO_ENTRY, gfp)); } /** * xa_reserve_bh() - Reserve this index in the XArray. * @xa: XArray. * @index: Index into array. * @gfp: Memory allocation flags. * * A softirq-disabling version of xa_reserve(). * * Context: Any context. Takes and releases the xa_lock while * disabling softirqs. * Return: 0 if the reservation succeeded or -ENOMEM if it failed. */ static inline __must_check int xa_reserve_bh(struct xarray *xa, unsigned long index, gfp_t gfp) { return xa_err(xa_cmpxchg_bh(xa, index, NULL, XA_ZERO_ENTRY, gfp)); } /** * xa_reserve_irq() - Reserve this index in the XArray. * @xa: XArray. * @index: Index into array. * @gfp: Memory allocation flags. * * An interrupt-disabling version of xa_reserve(). * * Context: Process context. Takes and releases the xa_lock while * disabling interrupts. * Return: 0 if the reservation succeeded or -ENOMEM if it failed. */ static inline __must_check int xa_reserve_irq(struct xarray *xa, unsigned long index, gfp_t gfp) { return xa_err(xa_cmpxchg_irq(xa, index, NULL, XA_ZERO_ENTRY, gfp)); } /** * xa_release() - Release a reserved entry. * @xa: XArray. * @index: Index of entry. * * After calling xa_reserve(), you can call this function to release the * reservation. If the entry at @index has been stored to, this function * will do nothing. */ static inline void xa_release(struct xarray *xa, unsigned long index) { xa_cmpxchg(xa, index, XA_ZERO_ENTRY, NULL, 0); } /* Everything below here is the Advanced API. Proceed with caution. */ /* * The xarray is constructed out of a set of 'chunks' of pointers. Choosing * the best chunk size requires some tradeoffs. A power of two recommends * itself so that we can walk the tree based purely on shifts and masks. * Generally, the larger the better; as the number of slots per level of the * tree increases, the less tall the tree needs to be. But that needs to be * balanced against the memory consumption of each node. On a 64-bit system, * xa_node is currently 576 bytes, and we get 7 of them per 4kB page. If we * doubled the number of slots per node, we'd get only 3 nodes per 4kB page. */ #ifndef XA_CHUNK_SHIFT #define XA_CHUNK_SHIFT (CONFIG_BASE_SMALL ? 4 : 6) #endif #define XA_CHUNK_SIZE (1UL << XA_CHUNK_SHIFT) #define XA_CHUNK_MASK (XA_CHUNK_SIZE - 1) #define XA_MAX_MARKS 3 #define XA_MARK_LONGS DIV_ROUND_UP(XA_CHUNK_SIZE, BITS_PER_LONG) /* * @count is the count of every non-NULL element in the ->slots array * whether that is a value entry, a retry entry, a user pointer, * a sibling entry or a pointer to the next level of the tree. * @nr_values is the count of every element in ->slots which is * either a value entry or a sibling of a value entry. */ struct xa_node { unsigned char shift; /* Bits remaining in each slot */ unsigned char offset; /* Slot offset in parent */ unsigned char count; /* Total entry count */ unsigned char nr_values; /* Value entry count */ struct xa_node __rcu *parent; /* NULL at top of tree */ struct xarray *array; /* The array we belong to */ union { struct list_head private_list; /* For tree user */ struct rcu_head rcu_head; /* Used when freeing node */ }; void __rcu *slots[XA_CHUNK_SIZE]; union { unsigned long tags[XA_MAX_MARKS][XA_MARK_LONGS]; unsigned long marks[XA_MAX_MARKS][XA_MARK_LONGS]; }; }; void xa_dump(const struct xarray *); void xa_dump_node(const struct xa_node *); #ifdef XA_DEBUG #define XA_BUG_ON(xa, x) do { \ if (x) { \ xa_dump(xa); \ BUG(); \ } \ } while (0) #define XA_NODE_BUG_ON(node, x) do { \ if (x) { \ if (node) xa_dump_node(node); \ BUG(); \ } \ } while (0) #else #define XA_BUG_ON(xa, x) do { } while (0) #define XA_NODE_BUG_ON(node, x) do { } while (0) #endif /* Private */ static inline void *xa_head(const struct xarray *xa) { return rcu_dereference_check(xa->xa_head, lockdep_is_held(&xa->xa_lock)); } /* Private */ static inline void *xa_head_locked(const struct xarray *xa) { return rcu_dereference_protected(xa->xa_head, lockdep_is_held(&xa->xa_lock)); } /* Private */ static inline void *xa_entry(const struct xarray *xa, const struct xa_node *node, unsigned int offset) { XA_NODE_BUG_ON(node, offset >= XA_CHUNK_SIZE); return rcu_dereference_check(node->slots[offset], lockdep_is_held(&xa->xa_lock)); } /* Private */ static inline void *xa_entry_locked(const struct xarray *xa, const struct xa_node *node, unsigned int offset) { XA_NODE_BUG_ON(node, offset >= XA_CHUNK_SIZE); return rcu_dereference_protected(node->slots[offset], lockdep_is_held(&xa->xa_lock)); } /* Private */ static inline struct xa_node *xa_parent(const struct xarray *xa, const struct xa_node *node) { return rcu_dereference_check(node->parent, lockdep_is_held(&xa->xa_lock)); } /* Private */ static inline struct xa_node *xa_parent_locked(const struct xarray *xa, const struct xa_node *node) { return rcu_dereference_protected(node->parent, lockdep_is_held(&xa->xa_lock)); } /* Private */ static inline void *xa_mk_node(const struct xa_node *node) { return (void *)((unsigned long)node | 2); } /* Private */ static inline struct xa_node *xa_to_node(const void *entry) { return (struct xa_node *)((unsigned long)entry - 2); } /* Private */ static inline bool xa_is_node(const void *entry) { return xa_is_internal(entry) && (unsigned long)entry > 4096; } /* Private */ static inline void *xa_mk_sibling(unsigned int offset) { return xa_mk_internal(offset); } /* Private */ static inline unsigned long xa_to_sibling(const void *entry) { return xa_to_internal(entry); } /** * xa_is_sibling() - Is the entry a sibling entry? * @entry: Entry retrieved from the XArray * * Return: %true if the entry is a sibling entry. */ static inline bool xa_is_sibling(const void *entry) { return IS_ENABLED(CONFIG_XARRAY_MULTI) && xa_is_internal(entry) && (entry < xa_mk_sibling(XA_CHUNK_SIZE - 1)); } #define XA_RETRY_ENTRY xa_mk_internal(256) /** * xa_is_retry() - Is the entry a retry entry? * @entry: Entry retrieved from the XArray * * Return: %true if the entry is a retry entry. */ static inline bool xa_is_retry(const void *entry) { return unlikely(entry == XA_RETRY_ENTRY); } /** * xa_is_advanced() - Is the entry only permitted for the advanced API? * @entry: Entry to be stored in the XArray. * * Return: %true if the entry cannot be stored by the normal API. */ static inline bool xa_is_advanced(const void *entry) { return xa_is_internal(entry) && (entry <= XA_RETRY_ENTRY); } /** * typedef xa_update_node_t - A callback function from the XArray. * @node: The node which is being processed * * This function is called every time the XArray updates the count of * present and value entries in a node. It allows advanced users to * maintain the private_list in the node. * * Context: The xa_lock is held and interrupts may be disabled. * Implementations should not drop the xa_lock, nor re-enable * interrupts. */ typedef void (*xa_update_node_t)(struct xa_node *node); void xa_delete_node(struct xa_node *, xa_update_node_t); /* * The xa_state is opaque to its users. It contains various different pieces * of state involved in the current operation on the XArray. It should be * declared on the stack and passed between the various internal routines. * The various elements in it should not be accessed directly, but only * through the provided accessor functions. The below documentation is for * the benefit of those working on the code, not for users of the XArray. * * @xa_node usually points to the xa_node containing the slot we're operating * on (and @xa_offset is the offset in the slots array). If there is a * single entry in the array at index 0, there are no allocated xa_nodes to * point to, and so we store %NULL in @xa_node. @xa_node is set to * the value %XAS_RESTART if the xa_state is not walked to the correct * position in the tree of nodes for this operation. If an error occurs * during an operation, it is set to an %XAS_ERROR value. If we run off the * end of the allocated nodes, it is set to %XAS_BOUNDS. */ struct xa_state { struct xarray *xa; unsigned long xa_index; unsigned char xa_shift; unsigned char xa_sibs; unsigned char xa_offset; unsigned char xa_pad; /* Helps gcc generate better code */ struct xa_node *xa_node; struct xa_node *xa_alloc; xa_update_node_t xa_update; }; /* * We encode errnos in the xas->xa_node. If an error has happened, we need to * drop the lock to fix it, and once we've done so the xa_state is invalid. */ #define XA_ERROR(errno) ((struct xa_node *)(((unsigned long)errno << 2) | 2UL)) #define XAS_BOUNDS ((struct xa_node *)1UL) #define XAS_RESTART ((struct xa_node *)3UL) #define __XA_STATE(array, index, shift, sibs) { \ .xa = array, \ .xa_index = index, \ .xa_shift = shift, \ .xa_sibs = sibs, \ .xa_offset = 0, \ .xa_pad = 0, \ .xa_node = XAS_RESTART, \ .xa_alloc = NULL, \ .xa_update = NULL \ } /** * XA_STATE() - Declare an XArray operation state. * @name: Name of this operation state (usually xas). * @array: Array to operate on. * @index: Initial index of interest. * * Declare and initialise an xa_state on the stack. */ #define XA_STATE(name, array, index) \ struct xa_state name = __XA_STATE(array, index, 0, 0) /** * XA_STATE_ORDER() - Declare an XArray operation state. * @name: Name of this operation state (usually xas). * @array: Array to operate on. * @index: Initial index of interest. * @order: Order of entry. * * Declare and initialise an xa_state on the stack. This variant of * XA_STATE() allows you to specify the 'order' of the element you * want to operate on.` */ #define XA_STATE_ORDER(name, array, index, order) \ struct xa_state name = __XA_STATE(array, \ (index >> order) << order, \ order - (order % XA_CHUNK_SHIFT), \ (1U << (order % XA_CHUNK_SHIFT)) - 1) #define xas_marked(xas, mark) xa_marked((xas)->xa, (mark)) #define xas_trylock(xas) xa_trylock((xas)->xa) #define xas_lock(xas) xa_lock((xas)->xa) #define xas_unlock(xas) xa_unlock((xas)->xa) #define xas_lock_bh(xas) xa_lock_bh((xas)->xa) #define xas_unlock_bh(xas) xa_unlock_bh((xas)->xa) #define xas_lock_irq(xas) xa_lock_irq((xas)->xa) #define xas_unlock_irq(xas) xa_unlock_irq((xas)->xa) #define xas_lock_irqsave(xas, flags) \ xa_lock_irqsave((xas)->xa, flags) #define xas_unlock_irqrestore(xas, flags) \ xa_unlock_irqrestore((xas)->xa, flags) /** * xas_error() - Return an errno stored in the xa_state. * @xas: XArray operation state. * * Return: 0 if no error has been noted. A negative errno if one has. */ static inline int xas_error(const struct xa_state *xas) { return xa_err(xas->xa_node); } /** * xas_set_err() - Note an error in the xa_state. * @xas: XArray operation state. * @err: Negative error number. * * Only call this function with a negative @err; zero or positive errors * will probably not behave the way you think they should. If you want * to clear the error from an xa_state, use xas_reset(). */ static inline void xas_set_err(struct xa_state *xas, long err) { xas->xa_node = XA_ERROR(err); } /** * xas_invalid() - Is the xas in a retry or error state? * @xas: XArray operation state. * * Return: %true if the xas cannot be used for operations. */ static inline bool xas_invalid(const struct xa_state *xas) { return (unsigned long)xas->xa_node & 3; } /** * xas_valid() - Is the xas a valid cursor into the array? * @xas: XArray operation state. * * Return: %true if the xas can be used for operations. */ static inline bool xas_valid(const struct xa_state *xas) { return !xas_invalid(xas); } /** * xas_is_node() - Does the xas point to a node? * @xas: XArray operation state. * * Return: %true if the xas currently references a node. */ static inline bool xas_is_node(const struct xa_state *xas) { return xas_valid(xas) && xas->xa_node; } /* True if the pointer is something other than a node */ static inline bool xas_not_node(struct xa_node *node) { return ((unsigned long)node & 3) || !node; } /* True if the node represents RESTART or an error */ static inline bool xas_frozen(struct xa_node *node) { return (unsigned long)node & 2; } /* True if the node represents head-of-tree, RESTART or BOUNDS */ static inline bool xas_top(struct xa_node *node) { return node <= XAS_RESTART; } /** * xas_reset() - Reset an XArray operation state. * @xas: XArray operation state. * * Resets the error or walk state of the @xas so future walks of the * array will start from the root. Use this if you have dropped the * xarray lock and want to reuse the xa_state. * * Context: Any context. */ static inline void xas_reset(struct xa_state *xas) { xas->xa_node = XAS_RESTART; } /** * xas_retry() - Retry the operation if appropriate. * @xas: XArray operation state. * @entry: Entry from xarray. * * The advanced functions may sometimes return an internal entry, such as * a retry entry or a zero entry. This function sets up the @xas to restart * the walk from the head of the array if needed. * * Context: Any context. * Return: true if the operation needs to be retried. */ static inline bool xas_retry(struct xa_state *xas, const void *entry) { if (xa_is_zero(entry)) return true; if (!xa_is_retry(entry)) return false; xas_reset(xas); return true; } void *xas_load(struct xa_state *); void *xas_store(struct xa_state *, void *entry); void *xas_find(struct xa_state *, unsigned long max); void *xas_find_conflict(struct xa_state *); bool xas_get_mark(const struct xa_state *, xa_mark_t); void xas_set_mark(const struct xa_state *, xa_mark_t); void xas_clear_mark(const struct xa_state *, xa_mark_t); void *xas_find_marked(struct xa_state *, unsigned long max, xa_mark_t); void xas_init_marks(const struct xa_state *); bool xas_nomem(struct xa_state *, gfp_t); void xas_pause(struct xa_state *); void xas_create_range(struct xa_state *); #ifdef CONFIG_XARRAY_MULTI int xa_get_order(struct xarray *, unsigned long index); void xas_split(struct xa_state *, void *entry, unsigned int order); void xas_split_alloc(struct xa_state *, void *entry, unsigned int order, gfp_t); #else static inline int xa_get_order(struct xarray *xa, unsigned long index) { return 0; } static inline void xas_split(struct xa_state *xas, void *entry, unsigned int order) { xas_store(xas, entry); } static inline void xas_split_alloc(struct xa_state *xas, void *entry, unsigned int order, gfp_t gfp) { } #endif /** * xas_reload() - Refetch an entry from the xarray. * @xas: XArray operation state. * * Use this function to check that a previously loaded entry still has * the same value. This is useful for the lockless pagecache lookup where * we walk the array with only the RCU lock to protect us, lock the page, * then check that the page hasn't moved since we looked it up. * * The caller guarantees that @xas is still valid. If it may be in an * error or restart state, call xas_load() instead. * * Return: The entry at this location in the xarray. */ static inline void *xas_reload(struct xa_state *xas) { struct xa_node *node = xas->xa_node; void *entry; char offset; if (!node) return xa_head(xas->xa); if (IS_ENABLED(CONFIG_XARRAY_MULTI)) { offset = (xas->xa_index >> node->shift) & XA_CHUNK_MASK; entry = xa_entry(xas->xa, node, offset); if (!xa_is_sibling(entry)) return entry; offset = xa_to_sibling(entry); } else { offset = xas->xa_offset; } return xa_entry(xas->xa, node, offset); } /** * xas_set() - Set up XArray operation state for a different index. * @xas: XArray operation state. * @index: New index into the XArray. * * Move the operation state to refer to a different index. This will * have the effect of starting a walk from the top; see xas_next() * to move to an adjacent index. */ static inline void xas_set(struct xa_state *xas, unsigned long index) { xas->xa_index = index; xas->xa_node = XAS_RESTART; } /** * xas_set_order() - Set up XArray operation state for a multislot entry. * @xas: XArray operation state. * @index: Target of the operation. * @order: Entry occupies 2^@order indices. */ static inline void xas_set_order(struct xa_state *xas, unsigned long index, unsigned int order) { #ifdef CONFIG_XARRAY_MULTI xas->xa_index = order < BITS_PER_LONG ? (index >> order) << order : 0; xas->xa_shift = order - (order % XA_CHUNK_SHIFT); xas->xa_sibs = (1 << (order % XA_CHUNK_SHIFT)) - 1; xas->xa_node = XAS_RESTART; #else BUG_ON(order > 0); xas_set(xas, index); #endif } /** * xas_set_update() - Set up XArray operation state for a callback. * @xas: XArray operation state. * @update: Function to call when updating a node. * * The XArray can notify a caller after it has updated an xa_node. * This is advanced functionality and is only needed by the page cache. */ static inline void xas_set_update(struct xa_state *xas, xa_update_node_t update) { xas->xa_update = update; } /** * xas_next_entry() - Advance iterator to next present entry. * @xas: XArray operation state. * @max: Highest index to return. * * xas_next_entry() is an inline function to optimise xarray traversal for * speed. It is equivalent to calling xas_find(), and will call xas_find() * for all the hard cases. * * Return: The next present entry after the one currently referred to by @xas. */ static inline void *xas_next_entry(struct xa_state *xas, unsigned long max) { struct xa_node *node = xas->xa_node; void *entry; if (unlikely(xas_not_node(node) || node->shift || xas->xa_offset != (xas->xa_index & XA_CHUNK_MASK))) return xas_find(xas, max); do { if (unlikely(xas->xa_index >= max)) return xas_find(xas, max); if (unlikely(xas->xa_offset == XA_CHUNK_MASK)) return xas_find(xas, max); entry = xa_entry(xas->xa, node, xas->xa_offset + 1); if (unlikely(xa_is_internal(entry))) return xas_find(xas, max); xas->xa_offset++; xas->xa_index++; } while (!entry); return entry; } /* Private */ static inline unsigned int xas_find_chunk(struct xa_state *xas, bool advance, xa_mark_t mark) { unsigned long *addr = xas->xa_node->marks[(__force unsigned)mark]; unsigned int offset = xas->xa_offset; if (advance) offset++; if (XA_CHUNK_SIZE == BITS_PER_LONG) { if (offset < XA_CHUNK_SIZE) { unsigned long data = *addr & (~0UL << offset); if (data) return __ffs(data); } return XA_CHUNK_SIZE; } return find_next_bit(addr, XA_CHUNK_SIZE, offset); } /** * xas_next_marked() - Advance iterator to next marked entry. * @xas: XArray operation state. * @max: Highest index to return. * @mark: Mark to search for. * * xas_next_marked() is an inline function to optimise xarray traversal for * speed. It is equivalent to calling xas_find_marked(), and will call * xas_find_marked() for all the hard cases. * * Return: The next marked entry after the one currently referred to by @xas. */ static inline void *xas_next_marked(struct xa_state *xas, unsigned long max, xa_mark_t mark) { struct xa_node *node = xas->xa_node; void *entry; unsigned int offset; if (unlikely(xas_not_node(node) || node->shift)) return xas_find_marked(xas, max, mark); offset = xas_find_chunk(xas, true, mark); xas->xa_offset = offset; xas->xa_index = (xas->xa_index & ~XA_CHUNK_MASK) + offset; if (xas->xa_index > max) return NULL; if (offset == XA_CHUNK_SIZE) return xas_find_marked(xas, max, mark); entry = xa_entry(xas->xa, node, offset); if (!entry) return xas_find_marked(xas, max, mark); return entry; } /* * If iterating while holding a lock, drop the lock and reschedule * every %XA_CHECK_SCHED loops. */ enum { XA_CHECK_SCHED = 4096, }; /** * xas_for_each() - Iterate over a range of an XArray. * @xas: XArray operation state. * @entry: Entry retrieved from the array. * @max: Maximum index to retrieve from array. * * The loop body will be executed for each entry present in the xarray * between the current xas position and @max. @entry will be set to * the entry retrieved from the xarray. It is safe to delete entries * from the array in the loop body. You should hold either the RCU lock * or the xa_lock while iterating. If you need to drop the lock, call * xas_pause() first. */ #define xas_for_each(xas, entry, max) \ for (entry = xas_find(xas, max); entry; \ entry = xas_next_entry(xas, max)) /** * xas_for_each_marked() - Iterate over a range of an XArray. * @xas: XArray operation state. * @entry: Entry retrieved from the array. * @max: Maximum index to retrieve from array. * @mark: Mark to search for. * * The loop body will be executed for each marked entry in the xarray * between the current xas position and @max. @entry will be set to * the entry retrieved from the xarray. It is safe to delete entries * from the array in the loop body. You should hold either the RCU lock * or the xa_lock while iterating. If you need to drop the lock, call * xas_pause() first. */ #define xas_for_each_marked(xas, entry, max, mark) \ for (entry = xas_find_marked(xas, max, mark); entry; \ entry = xas_next_marked(xas, max, mark)) /** * xas_for_each_conflict() - Iterate over a range of an XArray. * @xas: XArray operation state. * @entry: Entry retrieved from the array. * * The loop body will be executed for each entry in the XArray that * lies within the range specified by @xas. If the loop terminates * normally, @entry will be %NULL. The user may break out of the loop, * which will leave @entry set to the conflicting entry. The caller * may also call xa_set_err() to exit the loop while setting an error * to record the reason. */ #define xas_for_each_conflict(xas, entry) \ while ((entry = xas_find_conflict(xas))) void *__xas_next(struct xa_state *); void *__xas_prev(struct xa_state *); /** * xas_prev() - Move iterator to previous index. * @xas: XArray operation state. * * If the @xas was in an error state, it will remain in an error state * and this function will return %NULL. If the @xas has never been walked, * it will have the effect of calling xas_load(). Otherwise one will be * subtracted from the index and the state will be walked to the correct * location in the array for the next operation. * * If the iterator was referencing index 0, this function wraps * around to %ULONG_MAX. * * Return: The entry at the new index. This may be %NULL or an internal * entry. */ static inline void *xas_prev(struct xa_state *xas) { struct xa_node *node = xas->xa_node; if (unlikely(xas_not_node(node) || node->shift || xas->xa_offset == 0)) return __xas_prev(xas); xas->xa_index--; xas->xa_offset--; return xa_entry(xas->xa, node, xas->xa_offset); } /** * xas_next() - Move state to next index. * @xas: XArray operation state. * * If the @xas was in an error state, it will remain in an error state * and this function will return %NULL. If the @xas has never been walked, * it will have the effect of calling xas_load(). Otherwise one will be * added to the index and the state will be walked to the correct * location in the array for the next operation. * * If the iterator was referencing index %ULONG_MAX, this function wraps * around to 0. * * Return: The entry at the new index. This may be %NULL or an internal * entry. */ static inline void *xas_next(struct xa_state *xas) { struct xa_node *node = xas->xa_node; if (unlikely(xas_not_node(node) || node->shift || xas->xa_offset == XA_CHUNK_MASK)) return __xas_next(xas); xas->xa_index++; xas->xa_offset++; return xa_entry(xas->xa, node, xas->xa_offset); } #endif /* _LINUX_XARRAY_H */
Close