aboutsummaryrefslogtreecommitdiffstats
BranchCommit messageAuthorAge
drm-debug-qxl[debug] shutdown logGerd Hoffmann2 years
drm-misc-fixesdrm/amdgpu: fix missing dma_fence_put in error pathChristian König2 years
drm-misc-nextdrm/bochs: Use PCI_DEVICE() macroJorge Maidana2 years
drm-misc-next-fixesdrm/scheduler: Fix lockup in drm_sched_entity_kill()Dmitry Osipenko2 years
drm-qemu-fixesdrm/amdgpu: fix missing dma_fence_put in error pathChristian König2 years
drm-qemu-nextdrm/virtio: Add the hotplug_mode_update property for rescanning of modesVivek Kasireddy2 years
drm-qemu-next-fixesdrm/scheduler: Fix lockup in drm_sched_entity_kill()Dmitry Osipenko2 years
drm-qxl[debug] log qxl pin count inconsistenciesGerd Hoffmann2 years
drm-udmabufudmabuf: add sanity checkGerd Hoffmann2 years
drm-udmabuf-fixudmabuf: add sanity checkGerd Hoffmann2 years
drm-virtio-bootfbdetect VIRTIO_GPU_F_BOOTFBGerd Hoffmann2 years
host-phys-bitsRevert "arm64: dma: Drop cache invalidation from arch_dma_prep_coherent()"Will Deacon2 years
masterMerge tag 'arm64-fixes' of git://git.kernel.org/pub/scm/linux/kernel/git/arm6...Linus Torvalds2 years
pcie-hotplugpciehp: fast unplug for virtual machinesGerd Hoffmann2 years
radeonfb-logging[debug] log monitor probingGerd Hoffmann2 years
vfio-usb-reset[debug] reset msgGerd Hoffmann2 years
 
TagDownloadAuthorAge
v6.1-rc8linux-6.1-rc8.tar.gz  Linus Torvalds2 years
v5.17linux-5.17.tar.gz  Linus Torvalds3 years
v5.16linux-5.16.tar.gz  Linus Torvalds3 years
v5.15linux-5.15.tar.gz  Linus Torvalds3 years
v5.15-rc6linux-5.15-rc6.tar.gz  Linus Torvalds3 years
v5.12-rc7linux-5.12-rc7.tar.gz  Linus Torvalds4 years
v5.11linux-5.11.tar.gz  Linus Torvalds4 years
v5.11-rc7linux-5.11-rc7.tar.gz  Linus Torvalds4 years
v5.10-rc6linux-5.10-rc6.tar.gz  Linus Torvalds4 years
v5.10-rc2linux-5.10-rc2.tar.gz  Linus Torvalds4 years
v5.9-rc4linux-5.9-rc4.tar.gz  Linus Torvalds4 years
v5.9-rc3linux-5.9-rc3.tar.gz  Linus Torvalds4 years
v5.8linux-5.8.tar.gz  Linus Torvalds5 years
v5.6-rc3linux-5.6-rc3.tar.gz  Linus Torvalds5 years
v5.6-rc2linux-5.6-rc2.tar.gz  Linus Torvalds5 years
v5.6-rc1linux-5.6-rc1.tar.gz  Linus Torvalds5 years
v5.5linux-5.5.tar.gz  Linus Torvalds5 years
v5.5-rc6linux-5.5-rc6.tar.gz  Linus Torvalds5 years
v5.5-rc5linux-5.5-rc5.tar.gz  Linus Torvalds5 years
v5.5-rc2linux-5.5-rc2.tar.gz  Linus Torvalds5 years
v5.4linux-5.4.tar.gz  Linus Torvalds5 years
v5.4-rc4linux-5.4-rc4.tar.gz  Linus Torvalds5 years
v5.4-rc3linux-5.4-rc3.tar.gz  Linus Torvalds5 years
v5.3-rc8linux-5.3-rc8.tar.gz  Linus Torvalds5 years
v5.3-rc6linux-5.3-rc6.tar.gz  Linus Torvalds6 years
v5.3-rc5linux-5.3-rc5.tar.gz  Linus Torvalds6 years
v5.3-rc4linux-5.3-rc4.tar.gz  Linus Torvalds6 years
v5.3-rc3linux-5.3-rc3.tar.gz  Linus Torvalds6 years
v5.2-rc6linux-5.2-rc6.tar.gz  Linus Torvalds6 years
v5.2-rc3linux-5.2-rc3.tar.gz  Linus Torvalds6 years
v5.2-rc1linux-5.2-rc1.tar.gz  Linus Torvalds6 years
v5.1-rc4linux-5.1-rc4.tar.gz  Linus Torvalds6 years
v5.1-rc2linux-5.1-rc2.tar.gz  Linus Torvalds6 years
v5.1-rc1linux-5.1-rc1.tar.gz  Linus Torvalds6 years
v5.0linux-5.0.tar.gz  Linus Torvalds6 years
v5.0-rc8linux-5.0-rc8.tar.gz  Linus Torvalds6 years
v5.0-rc7linux-5.0-rc7.tar.gz  Linus Torvalds6 years
v5.0-rc4linux-5.0-rc4.tar.gz  Linus Torvalds6 years
v5.0-rc3linux-5.0-rc3.tar.gz  Linus Torvalds6 years
v5.0-rc1linux-5.0-rc1.tar.gz  Linus Torvalds6 years
v4.19-rc6linux-4.19-rc6.tar.gz  Greg Kroah-Hartman6 years
v4.19-rc4linux-4.19-rc4.tar.gz  Linus Torvalds6 years
v4.19-rc3linux-4.19-rc3.tar.gz  Linus Torvalds6 years
v4.19-rc2linux-4.19-rc2.tar.gz  Linus Torvalds6 years
v4.19-rc1linux-4.19-rc1.tar.gz  Linus Torvalds7 years
v4.18linux-4.18.tar.gz  Linus Torvalds7 years
v4.18-rc8linux-4.18-rc8.tar.gz  Linus Torvalds7 years
v4.18-rc3linux-4.18-rc3.tar.gz  Linus Torvalds7 years
v4.17linux-4.17.tar.gz  Linus Torvalds7 years
v4.17-rc7linux-4.17-rc7.tar.gz  Linus Torvalds7 years
v4.17-rc6linux-4.17-rc6.tar.gz  Linus Torvalds7 years
v4.17-rc2linux-4.17-rc2.tar.gz  Linus Torvalds7 years
v4.17-rc1linux-4.17-rc1.tar.gz  Linus Torvalds7 years
v4.16linux-4.16.tar.gz  Linus Torvalds7 years
v4.16-rc5linux-4.16-rc5.tar.gz  Linus Torvalds7 years
v4.16-rc4linux-4.16-rc4.tar.gz  Linus Torvalds7 years
v4.16-rc3linux-4.16-rc3.tar.gz  Linus Torvalds7 years
v4.16-rc2linux-4.16-rc2.tar.gz  Linus Torvalds7 years
v4.14-rc6linux-4.14-rc6.tar.gz  Linus Torvalds7 years
v4.13.3linux-4.13.3.tar.gz  Greg Kroah-Hartman7 years
v4.13.2linux-4.13.2.tar.gz  Greg Kroah-Hartman7 years
v4.13linux-4.13.tar.gz  Linus Torvalds7 years
v4.13-rc6linux-4.13-rc6.tar.gz  Linus Torvalds8 years
v4.12linux-4.12.tar.gz  Linus Torvalds8 years
v4.12-rc7linux-4.12-rc7.tar.gz  Linus Torvalds8 years
v4.12-rc6linux-4.12-rc6.tar.gz  Linus Torvalds8 years
v4.12-rc5linux-4.12-rc5.tar.gz  Linus Torvalds8 years
v4.12-rc3linux-4.12-rc3.tar.gz  Linus Torvalds8 years
v4.12-rc2linux-4.12-rc2.tar.gz  Linus Torvalds8 years
v4.12-rc1linux-4.12-rc1.tar.gz  Linus Torvalds8 years
v4.11-rc2linux-4.11-rc2.tar.gz  Linus Torvalds8 years
v4.11-rc1linux-4.11-rc1.tar.gz  Linus Torvalds8 years
v4.10linux-4.10.tar.gz  Linus Torvalds8 years
v4.10-rc7linux-4.10-rc7.tar.gz  Linus Torvalds8 years
v4.10-rc6linux-4.10-rc6.tar.gz  Linus Torvalds8 years
squashed-v1linux-squashed-v1.tar.gz  Gerd Hoffmann8 years
v4.10-rc5linux-4.10-rc5.tar.gz  Linus Torvalds8 years
drm-qemu-20170110linux-drm-qemu-20170110.tar.gz  Gerd Hoffmann8 years
v4.10-rc3linux-4.10-rc3.tar.gz  Linus Torvalds8 years
v4.10-rc2linux-4.10-rc2.tar.gz  Linus Torvalds8 years
v4.9-rc8linux-4.9-rc8.tar.gz  Linus Torvalds8 years
v4.9-rc7linux-4.9-rc7.tar.gz  Linus Torvalds8 years
drm-qemu-20161121linux-drm-qemu-20161121.tar.gz  Gerd Hoffmann8 years
v4.9-rc6linux-4.9-rc6.tar.gz  Linus Torvalds8 years
v4.9-rc5linux-4.9-rc5.tar.gz  Linus Torvalds8 years
v4.9-rc4linux-4.9-rc4.tar.gz  Linus Torvalds8 years
v4.9-rc3linux-4.9-rc3.tar.gz  Linus Torvalds8 years
v4.9-rc2linux-4.9-rc2.tar.gz  Linus Torvalds8 years
v4.9-rc1linux-4.9-rc1.tar.gz  Linus Torvalds8 years
v4.8linux-4.8.tar.gz  Linus Torvalds8 years
v4.8-rc8linux-4.8-rc8.tar.gz  Linus Torvalds8 years
v4.7.5linux-4.7.5.tar.gz  Greg Kroah-Hartman8 years
drm-qemu-20160921linux-drm-qemu-20160921.tar.gz  Gerd Hoffmann8 years
v4.8-rc7linux-4.8-rc7.tar.gz  Linus Torvalds8 years
v4.8-rc6linux-4.8-rc6.tar.gz  Linus Torvalds8 years
v4.8-rc5linux-4.8-rc5.tar.gz  Linus Torvalds8 years
v4.8-rc1linux-4.8-rc1.tar.gz  Linus Torvalds9 years
v4.7linux-4.7.tar.gz  Linus Torvalds9 years
v4.7-rc7linux-4.7-rc7.tar.gz  Linus Torvalds9 years
v4.7-rc6linux-4.7-rc6.tar.gz  Linus Torvalds9 years
v4.7-rc4linux-4.7-rc4.tar.gz  Linus Torvalds9 years
v4.7-rc3linux-4.7-rc3.tar.gz  Linus Torvalds9 years
v4.7-rc2linux-4.7-rc2.tar.gz  Linus Torvalds9 years
v4.7-rc1linux-4.7-rc1.tar.gz  Linus Torvalds9 years
v4.6linux-4.6.tar.gz  Linus Torvalds9 years
v4.6-rc7linux-4.6-rc7.tar.gz  Linus Torvalds9 years
v4.6-rc5linux-4.6-rc5.tar.gz  Linus Torvalds9 years
v4.6-rc4linux-4.6-rc4.tar.gz  Linus Torvalds9 years
v4.6-rc1linux-4.6-rc1.tar.gz  Linus Torvalds9 years
v4.5linux-4.5.tar.gz  Linus Torvalds9 years
v4.5-rc7linux-4.5-rc7.tar.gz  Linus Torvalds9 years
v4.5-rc6linux-4.5-rc6.tar.gz  Linus Torvalds9 years
v4.5-rc5linux-4.5-rc5.tar.gz  Linus Torvalds9 years
v4.5-rc4linux-4.5-rc4.tar.gz  Linus Torvalds9 years
v4.5-rc2linux-4.5-rc2.tar.gz  Linus Torvalds9 years
v4.5-rc1linux-4.5-rc1.tar.gz  Linus Torvalds9 years
v4.4-rc4linux-4.4-rc4.tar.gz  Linus Torvalds9 years
v4.4-rc3linux-4.4-rc3.tar.gz  Linus Torvalds9 years
v4.4-rc2linux-4.4-rc2.tar.gz  Linus Torvalds9 years
v4.4-rc1linux-4.4-rc1.tar.gz  Linus Torvalds9 years
v4.3linux-4.3.tar.gz  Linus Torvalds9 years
v4.3-rc7linux-4.3-rc7.tar.gz  Linus Torvalds9 years
v4.3-rc6linux-4.3-rc6.tar.gz  Linus Torvalds9 years
v4.3-rc5linux-4.3-rc5.tar.gz  Linus Torvalds9 years
v4.3-rc4linux-4.3-rc4.tar.gz  Linus Torvalds9 years
v4.3-rc3linux-4.3-rc3.tar.gz  Linus Torvalds9 years
v4.3-rc2linux-4.3-rc2.tar.gz  Linus Torvalds9 years
v4.3-rc1linux-4.3-rc1.tar.gz  Linus Torvalds9 years
v4.2linux-4.2.tar.gz  Linus Torvalds9 years
v4.2-rc8linux-4.2-rc8.tar.gz  Linus Torvalds10 years
v4.2-rc7linux-4.2-rc7.tar.gz  Linus Torvalds10 years
v4.2-rc2linux-4.2-rc2.tar.gz  Linus Torvalds10 years
v4.2-rc1linux-4.2-rc1.tar.gz  Linus Torvalds10 years
v4.1linux-4.1.tar.gz  Linus Torvalds10 years
v4.1-rc8linux-4.1-rc8.tar.gz  Linus Torvalds10 years
v4.1-rc7linux-4.1-rc7.tar.gz  Linus Torvalds10 years
v4.1-rc6linux-4.1-rc6.tar.gz  Linus Torvalds10 years
v4.1-rc5linux-4.1-rc5.tar.gz  Linus Torvalds10 years
v4.1-rc4linux-4.1-rc4.tar.gz  Linus Torvalds10 years
v4.1-rc3linux-4.1-rc3.tar.gz  Linus Torvalds10 years
v4.1-rc2linux-4.1-rc2.tar.gz  Linus Torvalds10 years
v4.1-rc1linux-4.1-rc1.tar.gz  Linus Torvalds10 years
v4.0linux-4.0.tar.gz  Linus Torvalds10 years
v4.0-rc7linux-4.0-rc7.tar.gz  Linus Torvalds10 years
v4.0-rc6linux-4.0-rc6.tar.gz  Linus Torvalds10 years
v4.0-rc5linux-4.0-rc5.tar.gz  Linus Torvalds10 years
v4.0-rc4linux-4.0-rc4.tar.gz  Linus Torvalds10 years
v4.0-rc3linux-4.0-rc3.tar.gz  Linus Torvalds10 years
v4.0-rc2linux-4.0-rc2.tar.gz  Linus Torvalds10 years
v4.0-rc1linux-4.0-rc1.tar.gz  Linus Torvalds10 years
v3.19linux-3.19.tar.gz  Linus Torvalds10 years
v3.19-rc5linux-3.19-rc5.tar.gz  Linus Torvalds10 years
v3.19-rc4linux-3.19-rc4.tar.gz  Linus Torvalds10 years
v3.19-rc3linux-3.19-rc3.tar.gz  Linus Torvalds10 years
v3.19-rc2linux-3.19-rc2.tar.gz  Linus Torvalds10 years
v3.18linux-3.18.tar.gz  Linus Torvalds10 years
v3.18-rc7linux-3.18-rc7.tar.gz  Linus Torvalds10 years
v3.18-rc5linux-3.18-rc5.tar.gz  Linus Torvalds10 years
v3.18-rc4linux-3.18-rc4.tar.gz  Linus Torvalds10 years
v3.18-rc3linux-3.18-rc3.tar.gz  Linus Torvalds10 years
v3.18-rc2linux-3.18-rc2.tar.gz  Linus Torvalds10 years
v3.17linux-3.17.tar.gz  Linus Torvalds10 years
v3.17-rc7linux-3.17-rc7.tar.gz  Linus Torvalds10 years
v3.17-rc6linux-3.17-rc6.tar.gz  Linus Torvalds10 years
v3.17-rc5linux-3.17-rc5.tar.gz  Linus Torvalds10 years
v3.17-rc4linux-3.17-rc4.tar.gz  Linus Torvalds10 years
v3.17-rc3linux-3.17-rc3.tar.gz  Linus Torvalds10 years
v3.16-rc6linux-3.16-rc6.tar.gz  Linus Torvalds11 years
v3.16-rc5linux-3.16-rc5.tar.gz  Linus Torvalds11 years
v3.16-rc3linux-3.16-rc3.tar.gz  Linus Torvalds11 years
v3.15-rc8linux-3.15-rc8.tar.gz  Linus Torvalds11 years
v3.15-rc7linux-3.15-rc7.tar.gz  Linus Torvalds11 years
v3.15-rc6linux-3.15-rc6.tar.gz  Linus Torvalds11 years
v3.15-rc5linux-3.15-rc5.tar.gz  Linus Torvalds11 years
v3.15-rc4linux-3.15-rc4.tar.gz  Linus Torvalds11 years
v3.15-rc1linux-3.15-rc1.tar.gz  Linus Torvalds11 years
v3.14linux-3.14.tar.gz  Linus Torvalds11 years
v3.14-rc8linux-3.14-rc8.tar.gz  Linus Torvalds11 years
v3.14-rc7linux-3.14-rc7.tar.gz  Linus Torvalds11 years
v3.6-rc7linux-3.6-rc7.tar.gz  Linus Torvalds12 years
v3.6-rc6linux-3.6-rc6.tar.gz  Linus Torvalds12 years
v3.6-rc5linux-3.6-rc5.tar.gz  Linus Torvalds12 years
v3.6-rc4linux-3.6-rc4.tar.gz  Linus Torvalds12 years
v3.6-rc3linux-3.6-rc3.tar.gz  Linus Torvalds13 years
v3.6-rc2linux-3.6-rc2.tar.gz  Linus Torvalds13 years
v3.6-rc1linux-3.6-rc1.tar.gz  Linus Torvalds13 years
v3.5linux-3.5.tar.gz  Linus Torvalds13 years
v3.5-rc7linux-3.5-rc7.tar.gz  Linus Torvalds13 years
v3.5-rc6linux-3.5-rc6.tar.gz  Linus Torvalds13 years
v3.5-rc5linux-3.5-rc5.tar.gz  Linus Torvalds13 years
v3.5-rc4linux-3.5-rc4.tar.gz  Linus Torvalds13 years
v3.5-rc3linux-3.5-rc3.tar.gz  Linus Torvalds13 years
v3.5-rc2linux-3.5-rc2.tar.gz  Linus Torvalds13 years
v3.5-rc1linux-3.5-rc1.tar.gz  Linus Torvalds13 years
v3.4linux-3.4.tar.gz  Linus Torvalds13 years
v3.4-rc7linux-3.4-rc7.tar.gz  Linus Torvalds13 years
v3.4-rc6linux-3.4-rc6.tar.gz  Linus Torvalds13 years
v3.4-rc5linux-3.4-rc5.tar.gz  Linus Torvalds13 years
v3.4-rc4linux-3.4-rc4.tar.gz  Linus Torvalds13 years
v3.4-rc3linux-3.4-rc3.tar.gz  Linus Torvalds13 years
v3.4-rc2linux-3.4-rc2.tar.gz  Linus Torvalds13 years
v3.4-rc1linux-3.4-rc1.tar.gz  Linus Torvalds13 years
v3.3linux-3.3.tar.gz  Linus Torvalds13 years
v3.3-rc7linux-3.3-rc7.tar.gz  Linus Torvalds13 years
v3.3-rc6linux-3.3-rc6.tar.gz  Linus Torvalds13 years
v3.3-rc5linux-3.3-rc5.tar.gz  Linus Torvalds13 years
v3.3-rc4linux-3.3-rc4.tar.gz  Linus Torvalds13 years
v3.3-rc3linux-3.3-rc3.tar.gz  Linus Torvalds13 years
v3.3-rc2linux-3.3-rc2.tar.gz  Linus Torvalds13 years
v3.3-rc1linux-3.3-rc1.tar.gz  Linus Torvalds13 years
v3.2linux-3.2.tar.gz  Linus Torvalds13 years
v3.2-rc7linux-3.2-rc7.tar.gz  Linus Torvalds13 years
v3.2-rc6linux-3.2-rc6.tar.gz  Linus Torvalds13 years
v3.2-rc5linux-3.2-rc5.tar.gz  Linus Torvalds13 years
v3.2-rc4linux-3.2-rc4.tar.gz  Linus Torvalds13 years
v3.2-rc3linux-3.2-rc3.tar.gz  Linus Torvalds13 years
v3.2-rc2linux-3.2-rc2.tar.gz  Linus Torvalds13 years
v3.2-rc1linux-3.2-rc1.tar.gz  Linus Torvalds13 years
v3.1linux-3.1.tar.gz  Linus Torvalds13 years
v3.1-rc10linux-3.1-rc10.tar.gz  Linus Torvalds13 years
v3.1-rc9linux-3.1-rc9.tar.gz  Linus Torvalds13 years
v3.1-rc8linux-3.1-rc8.tar.gz  Linus Torvalds13 years
v3.1-rc7linux-3.1-rc7.tar.gz  Linus Torvalds13 years
v3.1-rc6linux-3.1-rc6.tar.gz  Linus Torvalds13 years
v3.1-rc5linux-3.1-rc5.tar.gz  Linus Torvalds13 years
v3.1-rc4linux-3.1-rc4.tar.gz  Linus Torvalds14 years
v3.1-rc3linux-3.1-rc3.tar.gz  Linus Torvalds14 years
v3.1-rc2linux-3.1-rc2.tar.gz  Linus Torvalds14 years
v3.1-rc1linux-3.1-rc1.tar.gz  Linus Torvalds14 years
v3.0linux-3.0.tar.gz  Linus Torvalds14 years
v3.0-rc7linux-3.0-rc7.tar.gz  Linus Torvalds14 years
v3.0-rc6linux-3.0-rc6.tar.gz  Linus Torvalds14 years
v3.0-rc5linux-3.0-rc5.tar.gz  Linus Torvalds14 years
v3.0-rc4linux-3.0-rc4.tar.gz  Linus Torvalds14 years
v3.0-rc3linux-3.0-rc3.tar.gz  Linus Torvalds14 years
v3.0-rc2linux-3.0-rc2.tar.gz  Linus Torvalds14 years
v3.0-rc1linux-3.0-rc1.tar.gz  Linus Torvalds14 years
v2.6.39linux-2.6.39.tar.gz  Linus Torvalds14 years
v2.6.39-rc7linux-2.6.39-rc7.tar.gz  Linus Torvalds14 years
v2.6.39-rc6linux-2.6.39-rc6.tar.gz  Linus Torvalds14 years
v2.6.39-rc5linux-2.6.39-rc5.tar.gz  Linus Torvalds14 years
v2.6.39-rc4linux-2.6.39-rc4.tar.gz  Linus Torvalds14 years
v2.6.39-rc3linux-2.6.39-rc3.tar.gz  Linus Torvalds14 years
v2.6.39-rc2linux-2.6.39-rc2.tar.gz  Linus Torvalds14 years
v2.6.39-rc1linux-2.6.39-rc1.tar.gz  Linus Torvalds14 years
v2.6.38linux-2.6.38.tar.gz  Linus Torvalds14 years
v2.6.38-rc8linux-2.6.38-rc8.tar.gz  Linus Torvalds14 years
v2.6.38-rc7linux-2.6.38-rc7.tar.gz  Linus Torvalds14 years
v2.6.38-rc6linux-2.6.38-rc6.tar.gz  Linus Torvalds14 years
v2.6.38-rc5linux-2.6.38-rc5.tar.gz  Linus Torvalds14 years
v2.6.38-rc4linux-2.6.38-rc4.tar.gz  Linus Torvalds14 years
v2.6.38-rc3linux-2.6.38-rc3.tar.gz  Linus Torvalds14 years
v2.6.38-rc2linux-2.6.38-rc2.tar.gz  Linus Torvalds14 years
v2.6.38-rc1linux-2.6.38-rc1.tar.gz  Linus Torvalds14 years
v2.6.37linux-2.6.37.tar.gz  Linus Torvalds14 years
v2.6.37-rc8linux-2.6.37-rc8.tar.gz  Linus Torvalds14 years
v2.6.37-rc7linux-2.6.37-rc7.tar.gz  Linus Torvalds14 years
v2.6.37-rc6linux-2.6.37-rc6.tar.gz  Linus Torvalds14 years
v2.6.37-rc5linux-2.6.37-rc5.tar.gz  Linus Torvalds14 years
v2.6.37-rc4linux-2.6.37-rc4.tar.gz  Linus Torvalds14 years
v2.6.37-rc3linux-2.6.37-rc3.tar.gz  Linus Torvalds14 years
v2.6.37-rc2linux-2.6.37-rc2.tar.gz  Linus Torvalds14 years
v2.6.37-rc1linux-2.6.37-rc1.tar.gz  Linus Torvalds14 years
v2.6.36linux-2.6.36.tar.gz  Linus Torvalds14 years
v2.6.36-rc8linux-2.6.36-rc8.tar.gz  Linus Torvalds14 years
v2.6.36-rc7linux-2.6.36-rc7.tar.gz  Linus Torvalds14 years
v2.6.36-rc6linux-2.6.36-rc6.tar.gz  Linus Torvalds14 years
v2.6.36-rc5linux-2.6.36-rc5.tar.gz  Linus Torvalds14 years
v2.6.36-rc4linux-2.6.36-rc4.tar.gz  Linus Torvalds14 years
v2.6.36-rc3linux-2.6.36-rc3.tar.gz  Linus Torvalds15 years
v2.6.36-rc2linux-2.6.36-rc2.tar.gz  Linus Torvalds15 years
v2.6.36-rc1linux-2.6.36-rc1.tar.gz  Linus Torvalds15 years
v2.6.35linux-2.6.35.tar.gz  Linus Torvalds15 years
v2.6.35-rc6linux-2.6.35-rc6.tar.gz  Linus Torvalds15 years
v2.6.35-rc5linux-2.6.35-rc5.tar.gz  Linus Torvalds15 years
v2.6.35-rc4linux-2.6.35-rc4.tar.gz  Linus Torvalds15 years
v2.6.35-rc3linux-2.6.35-rc3.tar.gz  Linus Torvalds15 years
v2.6.35-rc2linux-2.6.35-rc2.tar.gz  Linus Torvalds15 years
v2.6.35-rc1linux-2.6.35-rc1.tar.gz  Linus Torvalds15 years
v2.6.34linux-2.6.34.tar.gz  Linus Torvalds15 years
v2.6.34-rc7linux-2.6.34-rc7.tar.gz  Linus Torvalds15 years
v2.6.34-rc6linux-2.6.34-rc6.tar.gz  Linus Torvalds15 years
v2.6.34-rc5linux-2.6.34-rc5.tar.gz  Linus Torvalds15 years
v2.6.34-rc4linux-2.6.34-rc4.tar.gz  Linus Torvalds15 years
v2.6.34-rc3linux-2.6.34-rc3.tar.gz  Linus Torvalds15 years
v2.6.34-rc2linux-2.6.34-rc2.tar.gz  Linus Torvalds15 years
v2.6.34-rc1linux-2.6.34-rc1.tar.gz  Linus Torvalds15 years
v2.6.33linux-2.6.33.tar.gz  Linus Torvalds15 years
v2.6.33-rc8linux-2.6.33-rc8.tar.gz  Linus Torvalds15 years
v2.6.33-rc7linux-2.6.33-rc7.tar.gz  Linus Torvalds15 years
v2.6.33-rc6linux-2.6.33-rc6.tar.gz  Linus Torvalds15 years
v2.6.33-rc5linux-2.6.33-rc5.tar.gz  Linus Torvalds15 years
v2.6.33-rc4linux-2.6.33-rc4.tar.gz  Linus Torvalds15 years
v2.6.33-rc3linux-2.6.33-rc3.tar.gz  Linus Torvalds15 years
v2.6.33-rc2linux-2.6.33-rc2.tar.gz  Linus Torvalds15 years
v2.6.33-rc1linux-2.6.33-rc1.tar.gz  Linus Torvalds15 years
v2.6.32linux-2.6.32.tar.gz  Linus Torvalds15 years
v2.6.32-rc8linux-2.6.32-rc8.tar.gz  Linus Torvalds15 years
v2.6.32-rc7linux-2.6.32-rc7.tar.gz  Linus Torvalds15 years
v2.6.32-rc6linux-2.6.32-rc6.tar.gz  Linus Torvalds15 years
v2.6.32-rc5linux-2.6.32-rc5.tar.gz  Linus Torvalds15 years
v2.6.32-rc4linux-2.6.32-rc4.tar.gz  Linus Torvalds15 years
v2.6.32-rc3linux-2.6.32-rc3.tar.gz  Linus Torvalds15 years
v2.6.32-rc1linux-2.6.32-rc1.tar.gz  Linus Torvalds15 years
v2.6.32-rc2linux-2.6.32-rc2.tar.gz  Linus Torvalds15 years
v2.6.31linux-2.6.31.tar.gz  Linus Torvalds15 years
v2.6.31-rc9linux-2.6.31-rc9.tar.gz  Linus Torvalds15 years
v2.6.31-rc8linux-2.6.31-rc8.tar.gz  Linus Torvalds16 years
v2.6.31-rc7linux-2.6.31-rc7.tar.gz  Linus Torvalds16 years
v2.6.31-rc6linux-2.6.31-rc6.tar.gz  Linus Torvalds16 years
v2.6.31-rc5linux-2.6.31-rc5.tar.gz  Linus Torvalds16 years
v2.6.31-rc4linux-2.6.31-rc4.tar.gz  Linus Torvalds16 years
v2.6.31-rc3linux-2.6.31-rc3.tar.gz  Linus Torvalds16 years
v2.6.31-rc2linux-2.6.31-rc2.tar.gz  Linus Torvalds16 years
v2.6.31-rc1linux-2.6.31-rc1.tar.gz  Linus Torvalds16 years
v2.6.30linux-2.6.30.tar.gz  Linus Torvalds16 years
v2.6.30-rc8linux-2.6.30-rc8.tar.gz  Linus Torvalds16 years
v2.6.30-rc7linux-2.6.30-rc7.tar.gz  Linus Torvalds16 years
v2.6.30-rc6linux-2.6.30-rc6.tar.gz  Linus Torvalds16 years
v2.6.30-rc5linux-2.6.30-rc5.tar.gz  Linus Torvalds16 years
v2.6.30-rc4linux-2.6.30-rc4.tar.gz  Linus Torvalds16 years
v2.6.30-rc3linux-2.6.30-rc3.tar.gz  Linus Torvalds16 years
v2.6.30-rc2linux-2.6.30-rc2.tar.gz  Linus Torvalds16 years
v2.6.30-rc1linux-2.6.30-rc1.tar.gz  Linus Torvalds16 years
v2.6.29linux-2.6.29.tar.gz  Linus Torvalds16 years
v2.6.29-rc8linux-2.6.29-rc8.tar.gz  Linus Torvalds16 years
v2.6.29-rc7linux-2.6.29-rc7.tar.gz  Linus Torvalds16 years
v2.6.29-rc6linux-2.6.29-rc6.tar.gz  Linus Torvalds16 years
v2.6.29-rc5linux-2.6.29-rc5.tar.gz  Linus Torvalds16 years
v2.6.29-rc4linux-2.6.29-rc4.tar.gz  Linus Torvalds16 years
v2.6.29-rc3linux-2.6.29-rc3.tar.gz  Linus Torvalds16 years
v2.6.29-rc2linux-2.6.29-rc2.tar.gz  Linus Torvalds16 years
v2.6.29-rc1linux-2.6.29-rc1.tar.gz  Linus Torvalds16 years
v2.6.28linux-2.6.28.tar.gz  Linus Torvalds16 years
v2.6.28-rc9linux-2.6.28-rc9.tar.gz  Linus Torvalds16 years
v2.6.28-rc8linux-2.6.28-rc8.tar.gz  Linus Torvalds16 years
v2.6.28-rc7linux-2.6.28-rc7.tar.gz  Linus Torvalds16 years
v2.6.28-rc6linux-2.6.28-rc6.tar.gz  Linus Torvalds16 years
v2.6.28-rc5linux-2.6.28-rc5.tar.gz  Linus Torvalds16 years
v2.6.28-rc4linux-2.6.28-rc4.tar.gz  Linus Torvalds16 years
v2.6.28-rc3linux-2.6.28-rc3.tar.gz  Linus Torvalds16 years
v2.6.28-rc2linux-2.6.28-rc2.tar.gz  Linus Torvalds16 years
v2.6.28-rc1linux-2.6.28-rc1.tar.gz  Linus Torvalds16 years
v2.6.27linux-2.6.27.tar.gz  Linus Torvalds16 years
v2.6.27-rc9linux-2.6.27-rc9.tar.gz  Linus Torvalds16 years
v2.6.27-rc8linux-2.6.27-rc8.tar.gz  Linus Torvalds16 years
v2.6.27-rc7linux-2.6.27-rc7.tar.gz  Linus Torvalds16 years
v2.6.27-rc6linux-2.6.27-rc6.tar.gz  Linus Torvalds16 years
v2.6.27-rc5linux-2.6.27-rc5.tar.gz  Linus Torvalds17 years
v2.6.27-rc4linux-2.6.27-rc4.tar.gz  Linus Torvalds17 years
v2.6.27-rc3linux-2.6.27-rc3.tar.gz  Linus Torvalds17 years
v2.6.27-rc2linux-2.6.27-rc2.tar.gz  Linus Torvalds17 years
v2.6.27-rc1linux-2.6.27-rc1.tar.gz  Linus Torvalds17 years
v2.6.26linux-2.6.26.tar.gz  Linus Torvalds17 years
v2.6.26-rc9linux-2.6.26-rc9.tar.gz  Linus Torvalds17 years
v2.6.26-rc8linux-2.6.26-rc8.tar.gz  Linus Torvalds17 years
v2.6.26-rc7linux-2.6.26-rc7.tar.gz  Linus Torvalds17 years
v2.6.26-rc6linux-2.6.26-rc6.tar.gz  Linus Torvalds17 years
v2.6.26-rc5linux-2.6.26-rc5.tar.gz  Linus Torvalds17 years
v2.6.26-rc4linux-2.6.26-rc4.tar.gz  Linus Torvalds17 years
v2.6.26-rc3linux-2.6.26-rc3.tar.gz  Linus Torvalds17 years
v2.6.26-rc2linux-2.6.26-rc2.tar.gz  Linus Torvalds17 years
v2.6.26-rc1linux-2.6.26-rc1.tar.gz  Linus Torvalds17 years
v2.6.25linux-2.6.25.tar.gz  Linus Torvalds17 years
v2.6.25-rc9linux-2.6.25-rc9.tar.gz  Linus Torvalds17 years
v2.6.25-rc8linux-2.6.25-rc8.tar.gz  Linus Torvalds17 years
v2.6.25-rc7linux-2.6.25-rc7.tar.gz  Linus Torvalds17 years
v2.6.25-rc6linux-2.6.25-rc6.tar.gz  Linus Torvalds17 years
v2.6.25-rc5linux-2.6.25-rc5.tar.gz  Linus Torvalds17 years
v2.6.25-rc4linux-2.6.25-rc4.tar.gz  Linus Torvalds17 years
v2.6.25-rc3linux-2.6.25-rc3.tar.gz  Linus Torvalds17 years
v2.6.25-rc2linux-2.6.25-rc2.tar.gz  Linus Torvalds17 years
v2.6.25-rc1linux-2.6.25-rc1.tar.gz  Linus Torvalds17 years
v2.6.24linux-2.6.24.tar.gz  Linus Torvalds17 years
v2.6.24-rc8linux-2.6.24-rc8.tar.gz  Linus Torvalds17 years
v2.6.24-rc7linux-2.6.24-rc7.tar.gz  Linus Torvalds17 years
v2.6.24-rc6linux-2.6.24-rc6.tar.gz  Linus Torvalds17 years
v2.6.24-rc5linux-2.6.24-rc5.tar.gz  Linus Torvalds17 years
v2.6.24-rc4linux-2.6.24-rc4.tar.gz  Linus Torvalds17 years
v2.6.24-rc3linux-2.6.24-rc3.tar.gz  Linus Torvalds17 years
v2.6.24-rc2linux-2.6.24-rc2.tar.gz  Linus Torvalds17 years
v2.6.24-rc1linux-2.6.24-rc1.tar.gz  Linus Torvalds17 years
v2.6.23linux-2.6.23.tar.gz  Linus Torvalds17 years
v2.6.23-rc9linux-2.6.23-rc9.tar.gz  Linus Torvalds17 years
v2.6.23-rc8linux-2.6.23-rc8.tar.gz  Linus Torvalds17 years
v2.6.23-rc7linux-2.6.23-rc7.tar.gz  Linus Torvalds17 years
v2.6.23-rc6linux-2.6.23-rc6.tar.gz  Linus Torvalds17 years
v2.6.23-rc5linux-2.6.23-rc5.tar.gz  Linus Torvalds18 years
v2.6.23-rc4linux-2.6.23-rc4.tar.gz  Linus Torvalds18 years
v2.6.23-rc3linux-2.6.23-rc3.tar.gz  Linus Torvalds18 years
v2.6.23-rc2linux-2.6.23-rc2.tar.gz  Linus Torvalds18 years
v2.6.23-rc1linux-2.6.23-rc1.tar.gz  Linus Torvalds18 years
v2.6.22linux-2.6.22.tar.gz  Linus Torvalds18 years
v2.6.22-rc7linux-2.6.22-rc7.tar.gz  Linus Torvalds18 years
v2.6.22-rc6linux-2.6.22-rc6.tar.gz  Linus Torvalds18 years
v2.6.22-rc5linux-2.6.22-rc5.tar.gz  Linus Torvalds18 years
v2.6.22-rc4linux-2.6.22-rc4.tar.gz  Linus Torvalds18 years
v2.6.22-rc3linux-2.6.22-rc3.tar.gz  Linus Torvalds18 years
v2.6.22-rc2linux-2.6.22-rc2.tar.gz  Linus Torvalds18 years
v2.6.22-rc1linux-2.6.22-rc1.tar.gz  Linus Torvalds18 years
v2.6.21linux-2.6.21.tar.gz  Linus Torvalds18 years
v2.6.21-rc7linux-2.6.21-rc7.tar.gz  Linus Torvalds18 years
v2.6.21-rc6linux-2.6.21-rc6.tar.gz  Linus Torvalds18 years
v2.6.21-rc5linux-2.6.21-rc5.tar.gz  Linus Torvalds18 years
v2.6.21-rc4linux-2.6.21-rc4.tar.gz  Linus Torvalds18 years
v2.6.21-rc3linux-2.6.21-rc3.tar.gz  Linus Torvalds18 years
v2.6.21-rc2linux-2.6.21-rc2.tar.gz  Linus Torvalds18 years
v2.6.21-rc1linux-2.6.21-rc1.tar.gz  Linus Torvalds18 years
v2.6.20linux-2.6.20.tar.gz  Linus Torvalds18 years
v2.6.20-rc7linux-2.6.20-rc7.tar.gz  Linus Torvalds18 years
v2.6.20-rc6linux-2.6.20-rc6.tar.gz  Linus Torvalds18 years
v2.6.20-rc5linux-2.6.20-rc5.tar.gz  Linus Torvalds18 years
v2.6.20-rc4linux-2.6.20-rc4.tar.gz  Linus Torvalds18 years
v2.6.20-rc3linux-2.6.20-rc3.tar.gz  Linus Torvalds18 years
v2.6.20-rc2linux-2.6.20-rc2.tar.gz  Linus Torvalds18 years
v2.6.20-rc1linux-2.6.20-rc1.tar.gz  Linus Torvalds18 years
v2.6.19linux-2.6.19.tar.gz  Linus Torvalds18 years
v2.6.19-rc6linux-2.6.19-rc6.tar.gz  Linus Torvalds18 years
v2.6.19-rc5linux-2.6.19-rc5.tar.gz  Linus Torvalds18 years
v2.6.19-rc4linux-2.6.19-rc4.tar.gz  Linus Torvalds18 years
v2.6.19-rc3linux-2.6.19-rc3.tar.gz  Linus Torvalds18 years
v2.6.19-rc2linux-2.6.19-rc2.tar.gz  Linus Torvalds18 years
v2.6.19-rc1linux-2.6.19-rc1.tar.gz  Linus Torvalds18 years
v2.6.18linux-2.6.18.tar.gz  Linus Torvalds18 years
v2.6.18-rc7linux-2.6.18-rc7.tar.gz  Linus Torvalds18 years
v2.6.18-rc6linux-2.6.18-rc6.tar.gz  Linus Torvalds18 years
v2.6.18-rc5linux-2.6.18-rc5.tar.gz  Linus Torvalds19 years
v2.6.18-rc4linux-2.6.18-rc4.tar.gz  Linus Torvalds19 years
v2.6.18-rc3linux-2.6.18-rc3.tar.gz  Linus Torvalds19 years
v2.6.18-rc2linux-2.6.18-rc2.tar.gz  Linus Torvalds19 years
v2.6.18-rc1linux-2.6.18-rc1.tar.gz  Linus Torvalds19 years
v2.6.17linux-2.6.17.tar.gz  Linus Torvalds19 years
v2.6.17-rc6linux-2.6.17-rc6.tar.gz  Linus Torvalds19 years
v2.6.17-rc5linux-2.6.17-rc5.tar.gz  Linus Torvalds19 years
v2.6.17-rc4linux-2.6.17-rc4.tar.gz  Linus Torvalds19 years
v2.6.17-rc3linux-2.6.17-rc3.tar.gz  Linus Torvalds19 years
v2.6.17-rc2linux-2.6.17-rc2.tar.gz  Linus Torvalds19 years
v2.6.17-rc1linux-2.6.17-rc1.tar.gz  Linus Torvalds19 years
v2.6.16linux-2.6.16.tar.gz  Linus Torvalds19 years
v2.6.16-rc6linux-2.6.16-rc6.tar.gz  Linus Torvalds19 years
v2.6.16-rc5linux-2.6.16-rc5.tar.gz  Linus Torvalds19 years
v2.6.16-rc4linux-2.6.16-rc4.tar.gz  Linus Torvalds19 years
v2.6.16-rc3linux-2.6.16-rc3.tar.gz  Linus Torvalds19 years
v2.6.16-rc2linux-2.6.16-rc2.tar.gz  Linus Torvalds19 years
v2.6.16-rc1linux-2.6.16-rc1.tar.gz  Linus Torvalds19 years
v2.6.15linux-2.6.15.tar.gz  Linus Torvalds19 years
v2.6.15-rc7linux-2.6.15-rc7.tar.gz  Linus Torvalds19 years
v2.6.15-rc6linux-2.6.15-rc6.tar.gz  Linus Torvalds19 years
v2.6.15-rc5linux-2.6.15-rc5.tar.gz  Linus Torvalds19 years
v2.6.15-rc4linux-2.6.15-rc4.tar.gz  Linus Torvalds19 years
v2.6.15-rc3linux-2.6.15-rc3.tar.gz  Linus Torvalds19 years
v2.6.15-rc2linux-2.6.15-rc2.tar.gz  Linus Torvalds19 years
v2.6.15-rc1linux-2.6.15-rc1.tar.gz  Linus Torvalds19 years
v2.6.14linux-2.6.14.tar.gz  Linus Torvalds19 years
v2.6.14-rc5linux-2.6.14-rc5.tar.gz  Linus Torvalds19 years
v2.6.14-rc4linux-2.6.14-rc4.tar.gz  Linus Torvalds19 years
v2.6.14-rc3linux-2.6.14-rc3.tar.gz  Linus Torvalds19 years
v2.6.14-rc2linux-2.6.14-rc2.tar.gz  Linus Torvalds19 years
v2.6.14-rc1linux-2.6.14-rc1.tar.gz  Linus Torvalds19 years
v2.6.13linux-2.6.13.tar.gz  Linus Torvalds20 years
v2.6.13-rc7linux-2.6.13-rc7.tar.gz  Linus Torvalds20 years
v2.6.13-rc6linux-2.6.13-rc6.tar.gz  Linus Torvalds20 years
v2.6.13-rc5linux-2.6.13-rc5.tar.gz  Linus Torvalds20 years
v2.6.13-rc4linux-2.6.13-rc4.tar.gz  Linus Torvalds20 years
v2.6.12linux-2.6.12.tar.gz  
v2.6.12-rc2linux-2.6.12-rc2.tar.gz  
v2.6.12-rc3linux-2.6.12-rc3.tar.gz  
v2.6.12-rc4linux-2.6.12-rc4.tar.gz  
v2.6.12-rc5linux-2.6.12-rc5.tar.gz  
v2.6.12-rc6linux-2.6.12-rc6.tar.gz  
v2.6.13-rc1linux-2.6.13-rc1.tar.gz  
v2.6.13-rc2linux-2.6.13-rc2.tar.gz  
v2.6.13-rc3linux-2.6.13-rc3.tar.gz  
generated by cgit (git 2.34.1) at 2025-02-25 19:25:45 +0000
="hl opt">) { list_del(&q->list); if (q->nsops > 1) sma->complex_count--; } /** check_restart(sma, q) * @sma: semaphore array * @q: the operation that just completed * * update_queue is O(N^2) when it restarts scanning the whole queue of * waiting operations. Therefore this function checks if the restart is * really necessary. It is called after a previously waiting operation * modified the array. * Note that wait-for-zero operations are handled without restart. */ static int check_restart(struct sem_array *sma, struct sem_queue *q) { /* pending complex alter operations are too difficult to analyse */ if (!list_empty(&sma->pending_alter)) return 1; /* we were a sleeping complex operation. Too difficult */ if (q->nsops > 1) return 1; /* It is impossible that someone waits for the new value: * - complex operations always restart. * - wait-for-zero are handled seperately. * - q is a previously sleeping simple operation that * altered the array. It must be a decrement, because * simple increments never sleep. * - If there are older (higher priority) decrements * in the queue, then they have observed the original * semval value and couldn't proceed. The operation * decremented to value - thus they won't proceed either. */ return 0; } /** * wake_const_ops(sma, semnum, pt) - Wake up non-alter tasks * @sma: semaphore array. * @semnum: semaphore that was modified. * @pt: list head for the tasks that must be woken up. * * wake_const_ops must be called after a semaphore in a semaphore array * was set to 0. If complex const operations are pending, wake_const_ops must * be called with semnum = -1, as well as with the number of each modified * semaphore. * The tasks that must be woken up are added to @pt. The return code * is stored in q->pid. * The function returns 1 if at least one operation was completed successfully. */ static int wake_const_ops(struct sem_array *sma, int semnum, struct list_head *pt) { struct sem_queue *q; struct list_head *walk; struct list_head *pending_list; int semop_completed = 0; if (semnum == -1) pending_list = &sma->pending_const; else pending_list = &sma->sem_base[semnum].pending_const; walk = pending_list->next; while (walk != pending_list) { int error; q = container_of(walk, struct sem_queue, list); walk = walk->next; error = perform_atomic_semop(sma, q->sops, q->nsops, q->undo, q->pid); if (error <= 0) { /* operation completed, remove from queue & wakeup */ unlink_queue(sma, q); wake_up_sem_queue_prepare(pt, q, error); if (error == 0) semop_completed = 1; } } return semop_completed; } /** * do_smart_wakeup_zero(sma, sops, nsops, pt) - wakeup all wait for zero tasks * @sma: semaphore array * @sops: operations that were performed * @nsops: number of operations * @pt: list head of the tasks that must be woken up. * * do_smart_wakeup_zero() checks all required queue for wait-for-zero * operations, based on the actual changes that were performed on the * semaphore array. * The function returns 1 if at least one operation was completed successfully. */ static int do_smart_wakeup_zero(struct sem_array *sma, struct sembuf *sops, int nsops, struct list_head *pt) { int i; int semop_completed = 0; int got_zero = 0; /* first: the per-semaphore queues, if known */ if (sops) { for (i = 0; i < nsops; i++) { int num = sops[i].sem_num; if (sma->sem_base[num].semval == 0) { got_zero = 1; semop_completed |= wake_const_ops(sma, num, pt); } } } else { /* * No sops means modified semaphores not known. * Assume all were changed. */ for (i = 0; i < sma->sem_nsems; i++) { if (sma->sem_base[i].semval == 0) { got_zero = 1; semop_completed |= wake_const_ops(sma, i, pt); } } } /* * If one of the modified semaphores got 0, * then check the global queue, too. */ if (got_zero) semop_completed |= wake_const_ops(sma, -1, pt); return semop_completed; } /** * update_queue(sma, semnum): Look for tasks that can be completed. * @sma: semaphore array. * @semnum: semaphore that was modified. * @pt: list head for the tasks that must be woken up. * * update_queue must be called after a semaphore in a semaphore array * was modified. If multiple semaphores were modified, update_queue must * be called with semnum = -1, as well as with the number of each modified * semaphore. * The tasks that must be woken up are added to @pt. The return code * is stored in q->pid. * The function internally checks if const operations can now succeed. * * The function return 1 if at least one semop was completed successfully. */ static int update_queue(struct sem_array *sma, int semnum, struct list_head *pt) { struct sem_queue *q; struct list_head *walk; struct list_head *pending_list; int semop_completed = 0; if (semnum == -1) pending_list = &sma->pending_alter; else pending_list = &sma->sem_base[semnum].pending_alter; again: walk = pending_list->next; while (walk != pending_list) { int error, restart; q = container_of(walk, struct sem_queue, list); walk = walk->next; /* If we are scanning the single sop, per-semaphore list of * one semaphore and that semaphore is 0, then it is not * necessary to scan further: simple increments * that affect only one entry succeed immediately and cannot * be in the per semaphore pending queue, and decrements * cannot be successful if the value is already 0. */ if (semnum != -1 && sma->sem_base[semnum].semval == 0) break; error = perform_atomic_semop(sma, q->sops, q->nsops, q->undo, q->pid); /* Does q->sleeper still need to sleep? */ if (error > 0) continue; unlink_queue(sma, q); if (error) { restart = 0; } else { semop_completed = 1; do_smart_wakeup_zero(sma, q->sops, q->nsops, pt); restart = check_restart(sma, q); } wake_up_sem_queue_prepare(pt, q, error); if (restart) goto again; } return semop_completed; } /** * set_semotime(sma, sops) - set sem_otime * @sma: semaphore array * @sops: operations that modified the array, may be NULL * * sem_otime is replicated to avoid cache line trashing. * This function sets one instance to the current time. */ static void set_semotime(struct sem_array *sma, struct sembuf *sops) { if (sops == NULL) { sma->sem_base[0].sem_otime = get_seconds(); } else { sma->sem_base[sops[0].sem_num].sem_otime = get_seconds(); } } /** * do_smart_update(sma, sops, nsops, otime, pt) - optimized update_queue * @sma: semaphore array * @sops: operations that were performed * @nsops: number of operations * @otime: force setting otime * @pt: list head of the tasks that must be woken up. * * do_smart_update() does the required calls to update_queue and wakeup_zero, * based on the actual changes that were performed on the semaphore array. * Note that the function does not do the actual wake-up: the caller is * responsible for calling wake_up_sem_queue_do(@pt). * It is safe to perform this call after dropping all locks. */ static void do_smart_update(struct sem_array *sma, struct sembuf *sops, int nsops, int otime, struct list_head *pt) { int i; otime |= do_smart_wakeup_zero(sma, sops, nsops, pt); if (!list_empty(&sma->pending_alter)) { /* semaphore array uses the global queue - just process it. */ otime |= update_queue(sma, -1, pt); } else { if (!sops) { /* * No sops, thus the modified semaphores are not * known. Check all. */ for (i = 0; i < sma->sem_nsems; i++) otime |= update_queue(sma, i, pt); } else { /* * Check the semaphores that were increased: * - No complex ops, thus all sleeping ops are * decrease. * - if we decreased the value, then any sleeping * semaphore ops wont be able to run: If the * previous value was too small, then the new * value will be too small, too. */ for (i = 0; i < nsops; i++) { if (sops[i].sem_op > 0) { otime |= update_queue(sma, sops[i].sem_num, pt); } } } } if (otime) set_semotime(sma, sops); } /* The following counts are associated to each semaphore: * semncnt number of tasks waiting on semval being nonzero * semzcnt number of tasks waiting on semval being zero * This model assumes that a task waits on exactly one semaphore. * Since semaphore operations are to be performed atomically, tasks actually * wait on a whole sequence of semaphores simultaneously. * The counts we return here are a rough approximation, but still * warrant that semncnt+semzcnt>0 if the task is on the pending queue. */ static int count_semncnt (struct sem_array * sma, ushort semnum) { int semncnt; struct sem_queue * q; semncnt = 0; list_for_each_entry(q, &sma->sem_base[semnum].pending_alter, list) { struct sembuf * sops = q->sops; BUG_ON(sops->sem_num != semnum); if ((sops->sem_op < 0) && !(sops->sem_flg & IPC_NOWAIT)) semncnt++; } list_for_each_entry(q, &sma->pending_alter, list) { struct sembuf * sops = q->sops; int nsops = q->nsops; int i; for (i = 0; i < nsops; i++) if (sops[i].sem_num == semnum && (sops[i].sem_op < 0) && !(sops[i].sem_flg & IPC_NOWAIT)) semncnt++; } return semncnt; } static int count_semzcnt (struct sem_array * sma, ushort semnum) { int semzcnt; struct sem_queue * q; semzcnt = 0; list_for_each_entry(q, &sma->sem_base[semnum].pending_const, list) { struct sembuf * sops = q->sops; BUG_ON(sops->sem_num != semnum); if ((sops->sem_op == 0) && !(sops->sem_flg & IPC_NOWAIT)) semzcnt++; } list_for_each_entry(q, &sma->pending_const, list) { struct sembuf * sops = q->sops; int nsops = q->nsops; int i; for (i = 0; i < nsops; i++) if (sops[i].sem_num == semnum && (sops[i].sem_op == 0) && !(sops[i].sem_flg & IPC_NOWAIT)) semzcnt++; } return semzcnt; } /* Free a semaphore set. freeary() is called with sem_ids.rwsem locked * as a writer and the spinlock for this semaphore set hold. sem_ids.rwsem * remains locked on exit. */ static void freeary(struct ipc_namespace *ns, struct kern_ipc_perm *ipcp) { struct sem_undo *un, *tu; struct sem_queue *q, *tq; struct sem_array *sma = container_of(ipcp, struct sem_array, sem_perm); struct list_head tasks; int i; /* Free the existing undo structures for this semaphore set. */ ipc_assert_locked_object(&sma->sem_perm); list_for_each_entry_safe(un, tu, &sma->list_id, list_id) { list_del(&un->list_id); spin_lock(&un->ulp->lock); un->semid = -1; list_del_rcu(&un->list_proc); spin_unlock(&un->ulp->lock); kfree_rcu(un, rcu); } /* Wake up all pending processes and let them fail with EIDRM. */ INIT_LIST_HEAD(&tasks); list_for_each_entry_safe(q, tq, &sma->pending_const, list) { unlink_queue(sma, q); wake_up_sem_queue_prepare(&tasks, q, -EIDRM); } list_for_each_entry_safe(q, tq, &sma->pending_alter, list) { unlink_queue(sma, q); wake_up_sem_queue_prepare(&tasks, q, -EIDRM); } for (i = 0; i < sma->sem_nsems; i++) { struct sem *sem = sma->sem_base + i; list_for_each_entry_safe(q, tq, &sem->pending_const, list) { unlink_queue(sma, q); wake_up_sem_queue_prepare(&tasks, q, -EIDRM); } list_for_each_entry_safe(q, tq, &sem->pending_alter, list) { unlink_queue(sma, q); wake_up_sem_queue_prepare(&tasks, q, -EIDRM); } } /* Remove the semaphore set from the IDR */ sem_rmid(ns, sma); sem_unlock(sma, -1); rcu_read_unlock(); wake_up_sem_queue_do(&tasks); ns->used_sems -= sma->sem_nsems; ipc_rcu_putref(sma, sem_rcu_free); } static unsigned long copy_semid_to_user(void __user *buf, struct semid64_ds *in, int version) { switch(version) { case IPC_64: return copy_to_user(buf, in, sizeof(*in)); case IPC_OLD: { struct semid_ds out; memset(&out, 0, sizeof(out)); ipc64_perm_to_ipc_perm(&in->sem_perm, &out.sem_perm); out.sem_otime = in->sem_otime; out.sem_ctime = in->sem_ctime; out.sem_nsems = in->sem_nsems; return copy_to_user(buf, &out, sizeof(out)); } default: return -EINVAL; } } static time_t get_semotime(struct sem_array *sma) { int i; time_t res; res = sma->sem_base[0].sem_otime; for (i = 1; i < sma->sem_nsems; i++) { time_t to = sma->sem_base[i].sem_otime; if (to > res) res = to; } return res; } static int semctl_nolock(struct ipc_namespace *ns, int semid, int cmd, int version, void __user *p) { int err; struct sem_array *sma; switch(cmd) { case IPC_INFO: case SEM_INFO: { struct seminfo seminfo; int max_id; err = security_sem_semctl(NULL, cmd); if (err) return err; memset(&seminfo,0,sizeof(seminfo)); seminfo.semmni = ns->sc_semmni; seminfo.semmns = ns->sc_semmns; seminfo.semmsl = ns->sc_semmsl; seminfo.semopm = ns->sc_semopm; seminfo.semvmx = SEMVMX; seminfo.semmnu = SEMMNU; seminfo.semmap = SEMMAP; seminfo.semume = SEMUME; down_read(&sem_ids(ns).rwsem); if (cmd == SEM_INFO) { seminfo.semusz = sem_ids(ns).in_use; seminfo.semaem = ns->used_sems; } else { seminfo.semusz = SEMUSZ; seminfo.semaem = SEMAEM; } max_id = ipc_get_maxid(&sem_ids(ns)); up_read(&sem_ids(ns).rwsem); if (copy_to_user(p, &seminfo, sizeof(struct seminfo))) return -EFAULT; return (max_id < 0) ? 0: max_id; } case IPC_STAT: case SEM_STAT: { struct semid64_ds tbuf; int id = 0; memset(&tbuf, 0, sizeof(tbuf)); rcu_read_lock(); if (cmd == SEM_STAT) { sma = sem_obtain_object(ns, semid); if (IS_ERR(sma)) { err = PTR_ERR(sma); goto out_unlock; } id = sma->sem_perm.id; } else { sma = sem_obtain_object_check(ns, semid); if (IS_ERR(sma)) { err = PTR_ERR(sma); goto out_unlock; } } err = -EACCES; if (ipcperms(ns, &sma->sem_perm, S_IRUGO)) goto out_unlock; err = security_sem_semctl(sma, cmd); if (err) goto out_unlock; kernel_to_ipc64_perm(&sma->sem_perm, &tbuf.sem_perm); tbuf.sem_otime = get_semotime(sma); tbuf.sem_ctime = sma->sem_ctime; tbuf.sem_nsems = sma->sem_nsems; rcu_read_unlock(); if (copy_semid_to_user(p, &tbuf, version)) return -EFAULT; return id; } default: return -EINVAL; } out_unlock: rcu_read_unlock(); return err; } static int semctl_setval(struct ipc_namespace *ns, int semid, int semnum, unsigned long arg) { struct sem_undo *un; struct sem_array *sma; struct sem* curr; int err; struct list_head tasks; int val; #if defined(CONFIG_64BIT) && defined(__BIG_ENDIAN) /* big-endian 64bit */ val = arg >> 32; #else /* 32bit or little-endian 64bit */ val = arg; #endif if (val > SEMVMX || val < 0) return -ERANGE; INIT_LIST_HEAD(&tasks); rcu_read_lock(); sma = sem_obtain_object_check(ns, semid); if (IS_ERR(sma)) { rcu_read_unlock(); return PTR_ERR(sma); } if (semnum < 0 || semnum >= sma->sem_nsems) { rcu_read_unlock(); return -EINVAL; } if (ipcperms(ns, &sma->sem_perm, S_IWUGO)) { rcu_read_unlock(); return -EACCES; } err = security_sem_semctl(sma, SETVAL); if (err) { rcu_read_unlock(); return -EACCES; } sem_lock(sma, NULL, -1); if (sma->sem_perm.deleted) { sem_unlock(sma, -1); rcu_read_unlock(); return -EIDRM; } curr = &sma->sem_base[semnum]; ipc_assert_locked_object(&sma->sem_perm); list_for_each_entry(un, &sma->list_id, list_id) un->semadj[semnum] = 0; curr->semval = val; curr->sempid = task_tgid_vnr(current); sma->sem_ctime = get_seconds(); /* maybe some queued-up processes were waiting for this */ do_smart_update(sma, NULL, 0, 0, &tasks); sem_unlock(sma, -1); rcu_read_unlock(); wake_up_sem_queue_do(&tasks); return 0; } static int semctl_main(struct ipc_namespace *ns, int semid, int semnum, int cmd, void __user *p) { struct sem_array *sma; struct sem* curr; int err, nsems; ushort fast_sem_io[SEMMSL_FAST]; ushort* sem_io = fast_sem_io; struct list_head tasks; INIT_LIST_HEAD(&tasks); rcu_read_lock(); sma = sem_obtain_object_check(ns, semid); if (IS_ERR(sma)) { rcu_read_unlock(); return PTR_ERR(sma); } nsems = sma->sem_nsems; err = -EACCES; if (ipcperms(ns, &sma->sem_perm, cmd == SETALL ? S_IWUGO : S_IRUGO)) goto out_rcu_wakeup; err = security_sem_semctl(sma, cmd); if (err) goto out_rcu_wakeup; err = -EACCES; switch (cmd) { case GETALL: { ushort __user *array = p; int i; sem_lock(sma, NULL, -1); if (sma->sem_perm.deleted) { err = -EIDRM; goto out_unlock; } if(nsems > SEMMSL_FAST) { if (!ipc_rcu_getref(sma)) { err = -EIDRM; goto out_unlock; } sem_unlock(sma, -1); rcu_read_unlock(); sem_io = ipc_alloc(sizeof(ushort)*nsems); if(sem_io == NULL) { ipc_rcu_putref(sma, ipc_rcu_free); return -ENOMEM; } rcu_read_lock(); sem_lock_and_putref(sma); if (sma->sem_perm.deleted) { err = -EIDRM; goto out_unlock; } } for (i = 0; i < sma->sem_nsems; i++) sem_io[i] = sma->sem_base[i].semval; sem_unlock(sma, -1); rcu_read_unlock(); err = 0; if(copy_to_user(array, sem_io, nsems*sizeof(ushort))) err = -EFAULT; goto out_free; } case SETALL: { int i; struct sem_undo *un; if (!ipc_rcu_getref(sma)) { err = -EIDRM; goto out_rcu_wakeup; } rcu_read_unlock(); if(nsems > SEMMSL_FAST) { sem_io = ipc_alloc(sizeof(ushort)*nsems); if(sem_io == NULL) { ipc_rcu_putref(sma, ipc_rcu_free); return -ENOMEM; } } if (copy_from_user (sem_io, p, nsems*sizeof(ushort))) { ipc_rcu_putref(sma, ipc_rcu_free); err = -EFAULT; goto out_free; } for (i = 0; i < nsems; i++) { if (sem_io[i] > SEMVMX) { ipc_rcu_putref(sma, ipc_rcu_free); err = -ERANGE; goto out_free; } } rcu_read_lock(); sem_lock_and_putref(sma); if (sma->sem_perm.deleted) { err = -EIDRM; goto out_unlock; } for (i = 0; i < nsems; i++) sma->sem_base[i].semval = sem_io[i]; ipc_assert_locked_object(&sma->sem_perm); list_for_each_entry(un, &sma->list_id, list_id) { for (i = 0; i < nsems; i++) un->semadj[i] = 0; } sma->sem_ctime = get_seconds(); /* maybe some queued-up processes were waiting for this */ do_smart_update(sma, NULL, 0, 0, &tasks); err = 0; goto out_unlock; } /* GETVAL, GETPID, GETNCTN, GETZCNT: fall-through */ } err = -EINVAL; if (semnum < 0 || semnum >= nsems) goto out_rcu_wakeup; sem_lock(sma, NULL, -1); if (sma->sem_perm.deleted) { err = -EIDRM; goto out_unlock; } curr = &sma->sem_base[semnum]; switch (cmd) { case GETVAL: err = curr->semval; goto out_unlock; case GETPID: err = curr->sempid; goto out_unlock; case GETNCNT: err = count_semncnt(sma,semnum); goto out_unlock; case GETZCNT: err = count_semzcnt(sma,semnum); goto out_unlock; } out_unlock: sem_unlock(sma, -1); out_rcu_wakeup: rcu_read_unlock(); wake_up_sem_queue_do(&tasks); out_free: if(sem_io != fast_sem_io) ipc_free(sem_io, sizeof(ushort)*nsems); return err; } static inline unsigned long copy_semid_from_user(struct semid64_ds *out, void __user *buf, int version) { switch(version) { case IPC_64: if (copy_from_user(out, buf, sizeof(*out))) return -EFAULT; return 0; case IPC_OLD: { struct semid_ds tbuf_old; if(copy_from_user(&tbuf_old, buf, sizeof(tbuf_old))) return -EFAULT; out->sem_perm.uid = tbuf_old.sem_perm.uid; out->sem_perm.gid = tbuf_old.sem_perm.gid; out->sem_perm.mode = tbuf_old.sem_perm.mode; return 0; } default: return -EINVAL; } } /* * This function handles some semctl commands which require the rwsem * to be held in write mode. * NOTE: no locks must be held, the rwsem is taken inside this function. */ static int semctl_down(struct ipc_namespace *ns, int semid, int cmd, int version, void __user *p) { struct sem_array *sma; int err; struct semid64_ds semid64; struct kern_ipc_perm *ipcp; if(cmd == IPC_SET) { if (copy_semid_from_user(&semid64, p, version)) return -EFAULT; } down_write(&sem_ids(ns).rwsem); rcu_read_lock(); ipcp = ipcctl_pre_down_nolock(ns, &sem_ids(ns), semid, cmd, &semid64.sem_perm, 0); if (IS_ERR(ipcp)) { err = PTR_ERR(ipcp); goto out_unlock1; } sma = container_of(ipcp, struct sem_array, sem_perm); err = security_sem_semctl(sma, cmd); if (err) goto out_unlock1; switch (cmd) { case IPC_RMID: sem_lock(sma, NULL, -1); /* freeary unlocks the ipc object and rcu */ freeary(ns, ipcp); goto out_up; case IPC_SET: sem_lock(sma, NULL, -1); err = ipc_update_perm(&semid64.sem_perm, ipcp); if (err) goto out_unlock0; sma->sem_ctime = get_seconds(); break; default: err = -EINVAL; goto out_unlock1; } out_unlock0: sem_unlock(sma, -1); out_unlock1: rcu_read_unlock(); out_up: up_write(&sem_ids(ns).rwsem); return err; } SYSCALL_DEFINE4(semctl, int, semid, int, semnum, int, cmd, unsigned long, arg) { int version; struct ipc_namespace *ns; void __user *p = (void __user *)arg; if (semid < 0) return -EINVAL; version = ipc_parse_version(&cmd); ns = current->nsproxy->ipc_ns; switch(cmd) { case IPC_INFO: case SEM_INFO: case IPC_STAT: case SEM_STAT: return semctl_nolock(ns, semid, cmd, version, p); case GETALL: case GETVAL: case GETPID: case GETNCNT: case GETZCNT: case SETALL: return semctl_main(ns, semid, semnum, cmd, p); case SETVAL: return semctl_setval(ns, semid, semnum, arg); case IPC_RMID: case IPC_SET: return semctl_down(ns, semid, cmd, version, p); default: return -EINVAL; } } /* If the task doesn't already have a undo_list, then allocate one * here. We guarantee there is only one thread using this undo list, * and current is THE ONE * * If this allocation and assignment succeeds, but later * portions of this code fail, there is no need to free the sem_undo_list. * Just let it stay associated with the task, and it'll be freed later * at exit time. * * This can block, so callers must hold no locks. */ static inline int get_undo_list(struct sem_undo_list **undo_listp) { struct sem_undo_list *undo_list; undo_list = current->sysvsem.undo_list; if (!undo_list) { undo_list = kzalloc(sizeof(*undo_list), GFP_KERNEL); if (undo_list == NULL) return -ENOMEM; spin_lock_init(&undo_list->lock); atomic_set(&undo_list->refcnt, 1); INIT_LIST_HEAD(&undo_list->list_proc); current->sysvsem.undo_list = undo_list; } *undo_listp = undo_list; return 0; } static struct sem_undo *__lookup_undo(struct sem_undo_list *ulp, int semid) { struct sem_undo *un; list_for_each_entry_rcu(un, &ulp->list_proc, list_proc) { if (un->semid == semid) return un; } return NULL; } static struct sem_undo *lookup_undo(struct sem_undo_list *ulp, int semid) { struct sem_undo *un; assert_spin_locked(&ulp->lock); un = __lookup_undo(ulp, semid); if (un) { list_del_rcu(&un->list_proc); list_add_rcu(&un->list_proc, &ulp->list_proc); } return un; } /** * find_alloc_undo - Lookup (and if not present create) undo array * @ns: namespace * @semid: semaphore array id * * The function looks up (and if not present creates) the undo structure. * The size of the undo structure depends on the size of the semaphore * array, thus the alloc path is not that straightforward. * Lifetime-rules: sem_undo is rcu-protected, on success, the function * performs a rcu_read_lock(). */ static struct sem_undo *find_alloc_undo(struct ipc_namespace *ns, int semid) { struct sem_array *sma; struct sem_undo_list *ulp; struct sem_undo *un, *new; int nsems, error; error = get_undo_list(&ulp); if (error) return ERR_PTR(error); rcu_read_lock(); spin_lock(&ulp->lock); un = lookup_undo(ulp, semid); spin_unlock(&ulp->lock); if (likely(un!=NULL)) goto out; /* no undo structure around - allocate one. */ /* step 1: figure out the size of the semaphore array */ sma = sem_obtain_object_check(ns, semid); if (IS_ERR(sma)) { rcu_read_unlock(); return ERR_CAST(sma); } nsems = sma->sem_nsems; if (!ipc_rcu_getref(sma)) { rcu_read_unlock(); un = ERR_PTR(-EIDRM); goto out; } rcu_read_unlock(); /* step 2: allocate new undo structure */ new = kzalloc(sizeof(struct sem_undo) + sizeof(short)*nsems, GFP_KERNEL); if (!new) { ipc_rcu_putref(sma, ipc_rcu_free); return ERR_PTR(-ENOMEM); } /* step 3: Acquire the lock on semaphore array */ rcu_read_lock(); sem_lock_and_putref(sma); if (sma->sem_perm.deleted) { sem_unlock(sma, -1); rcu_read_unlock(); kfree(new); un = ERR_PTR(-EIDRM); goto out; } spin_lock(&ulp->lock); /* * step 4: check for races: did someone else allocate the undo struct? */ un = lookup_undo(ulp, semid); if (un) { kfree(new); goto success; } /* step 5: initialize & link new undo structure */ new->semadj = (short *) &new[1]; new->ulp = ulp; new->semid = semid; assert_spin_locked(&ulp->lock); list_add_rcu(&new->list_proc, &ulp->list_proc); ipc_assert_locked_object(&sma->sem_perm); list_add(&new->list_id, &sma->list_id); un = new; success: spin_unlock(&ulp->lock); sem_unlock(sma, -1); out: return un; } /** * get_queue_result - Retrieve the result code from sem_queue * @q: Pointer to queue structure * * Retrieve the return code from the pending queue. If IN_WAKEUP is found in * q->status, then we must loop until the value is replaced with the final * value: This may happen if a task is woken up by an unrelated event (e.g. * signal) and in parallel the task is woken up by another task because it got * the requested semaphores. * * The function can be called with or without holding the semaphore spinlock. */ static int get_queue_result(struct sem_queue *q) { int error; error = q->status; while (unlikely(error == IN_WAKEUP)) { cpu_relax(); error = q->status; } return error; } SYSCALL_DEFINE4(semtimedop, int, semid, struct sembuf __user *, tsops, unsigned, nsops, const struct timespec __user *, timeout) { int error = -EINVAL; struct sem_array *sma; struct sembuf fast_sops[SEMOPM_FAST]; struct sembuf* sops = fast_sops, *sop; struct sem_undo *un; int undos = 0, alter = 0, max, locknum; struct sem_queue queue; unsigned long jiffies_left = 0; struct ipc_namespace *ns; struct list_head tasks; ns = current->nsproxy->ipc_ns; if (nsops < 1 || semid < 0) return -EINVAL; if (nsops > ns->sc_semopm) return -E2BIG; if(nsops > SEMOPM_FAST) { sops = kmalloc(sizeof(*sops)*nsops,GFP_KERNEL); if(sops==NULL) return -ENOMEM; } if (copy_from_user (sops, tsops, nsops * sizeof(*tsops))) { error=-EFAULT; goto out_free; } if (timeout) { struct timespec _timeout; if (copy_from_user(&_timeout, timeout, sizeof(*timeout))) { error = -EFAULT; goto out_free; } if (_timeout.tv_sec < 0 || _timeout.tv_nsec < 0 || _timeout.tv_nsec >= 1000000000L) { error = -EINVAL; goto out_free; } jiffies_left = timespec_to_jiffies(&_timeout); } max = 0; for (sop = sops; sop < sops + nsops; sop++) { if (sop->sem_num >= max) max = sop->sem_num; if (sop->sem_flg & SEM_UNDO) undos = 1; if (sop->sem_op != 0) alter = 1; } INIT_LIST_HEAD(&tasks); if (undos) { /* On success, find_alloc_undo takes the rcu_read_lock */ un = find_alloc_undo(ns, semid); if (IS_ERR(un)) { error = PTR_ERR(un); goto out_free; } } else { un = NULL; rcu_read_lock(); } sma = sem_obtain_object_check(ns, semid); if (IS_ERR(sma)) { rcu_read_unlock(); error = PTR_ERR(sma); goto out_free; } error = -EFBIG; if (max >= sma->sem_nsems) goto out_rcu_wakeup; error = -EACCES; if (ipcperms(ns, &sma->sem_perm, alter ? S_IWUGO : S_IRUGO)) goto out_rcu_wakeup; error = security_sem_semop(sma, sops, nsops, alter); if (error) goto out_rcu_wakeup; error = -EIDRM; locknum = sem_lock(sma, sops, nsops); if (sma->sem_perm.deleted) goto out_unlock_free; /* * semid identifiers are not unique - find_alloc_undo may have * allocated an undo structure, it was invalidated by an RMID * and now a new array with received the same id. Check and fail. * This case can be detected checking un->semid. The existence of * "un" itself is guaranteed by rcu. */ if (un && un->semid == -1) goto out_unlock_free; error = perform_atomic_semop(sma, sops, nsops, un, task_tgid_vnr(current)); if (error == 0) { /* If the operation was successful, then do * the required updates. */ if (alter) do_smart_update(sma, sops, nsops, 1, &tasks); else set_semotime(sma, sops); } if (error <= 0) goto out_unlock_free; /* We need to sleep on this operation, so we put the current * task into the pending queue and go to sleep. */ queue.sops = sops; queue.nsops = nsops; queue.undo = un; queue.pid = task_tgid_vnr(current); queue.alter = alter; if (nsops == 1) { struct sem *curr; curr = &sma->sem_base[sops->sem_num]; if (alter) { if (sma->complex_count) { list_add_tail(&queue.list, &sma->pending_alter); } else { list_add_tail(&queue.list, &curr->pending_alter); } } else { list_add_tail(&queue.list, &curr->pending_const); } } else { if (!sma->complex_count) merge_queues(sma); if (alter) list_add_tail(&queue.list, &sma->pending_alter); else list_add_tail(&queue.list, &sma->pending_const); sma->complex_count++; } queue.status = -EINTR; queue.sleeper = current; sleep_again: current->state = TASK_INTERRUPTIBLE; sem_unlock(sma, locknum); rcu_read_unlock(); if (timeout) jiffies_left = schedule_timeout(jiffies_left); else schedule(); error = get_queue_result(&queue); if (error != -EINTR) { /* fast path: update_queue already obtained all requested * resources. * Perform a smp_mb(): User space could assume that semop() * is a memory barrier: Without the mb(), the cpu could * speculatively read in user space stale data that was * overwritten by the previous owner of the semaphore. */ smp_mb(); goto out_free; } rcu_read_lock(); sma = sem_obtain_lock(ns, semid, sops, nsops, &locknum); /* * Wait until it's guaranteed that no wakeup_sem_queue_do() is ongoing. */ error = get_queue_result(&queue); /* * Array removed? If yes, leave without sem_unlock(). */ if (IS_ERR(sma)) { rcu_read_unlock(); goto out_free; } /* * If queue.status != -EINTR we are woken up by another process. * Leave without unlink_queue(), but with sem_unlock(). */ if (error != -EINTR) { goto out_unlock_free; } /* * If an interrupt occurred we have to clean up the queue */ if (timeout && jiffies_left == 0) error = -EAGAIN; /* * If the wakeup was spurious, just retry */ if (error == -EINTR && !signal_pending(current)) goto sleep_again; unlink_queue(sma, &queue); out_unlock_free: sem_unlock(sma, locknum); out_rcu_wakeup: rcu_read_unlock(); wake_up_sem_queue_do(&tasks); out_free: if(sops != fast_sops) kfree(sops); return error; } SYSCALL_DEFINE3(semop, int, semid, struct sembuf __user *, tsops, unsigned, nsops) { return sys_semtimedop(semid, tsops, nsops, NULL); } /* If CLONE_SYSVSEM is set, establish sharing of SEM_UNDO state between * parent and child tasks. */ int copy_semundo(unsigned long clone_flags, struct task_struct *tsk) { struct sem_undo_list *undo_list; int error; if (clone_flags & CLONE_SYSVSEM) { error = get_undo_list(&undo_list); if (error) return error; atomic_inc(&undo_list->refcnt); tsk->sysvsem.undo_list = undo_list; } else tsk->sysvsem.undo_list = NULL; return 0; } /* * add semadj values to semaphores, free undo structures. * undo structures are not freed when semaphore arrays are destroyed * so some of them may be out of date. * IMPLEMENTATION NOTE: There is some confusion over whether the * set of adjustments that needs to be done should be done in an atomic * manner or not. That is, if we are attempting to decrement the semval * should we queue up and wait until we can do so legally? * The original implementation attempted to do this (queue and wait). * The current implementation does not do so. The POSIX standard * and SVID should be consulted to determine what behavior is mandated. */ void exit_sem(struct task_struct *tsk) { struct sem_undo_list *ulp; ulp = tsk->sysvsem.undo_list; if (!ulp) return; tsk->sysvsem.undo_list = NULL; if (!atomic_dec_and_test(&ulp->refcnt)) return; for (;;) { struct sem_array *sma; struct sem_undo *un; struct list_head tasks; int semid, i; rcu_read_lock(); un = list_entry_rcu(ulp->list_proc.next, struct sem_undo, list_proc); if (&un->list_proc == &ulp->list_proc) semid = -1; else semid = un->semid; if (semid == -1) { rcu_read_unlock(); break; } sma = sem_obtain_object_check(tsk->nsproxy->ipc_ns, un->semid); /* exit_sem raced with IPC_RMID, nothing to do */ if (IS_ERR(sma)) { rcu_read_unlock(); continue; } sem_lock(sma, NULL, -1); /* exit_sem raced with IPC_RMID, nothing to do */ if (sma->sem_perm.deleted) { sem_unlock(sma, -1); rcu_read_unlock(); continue; } un = __lookup_undo(ulp, semid); if (un == NULL) { /* exit_sem raced with IPC_RMID+semget() that created * exactly the same semid. Nothing to do. */ sem_unlock(sma, -1); rcu_read_unlock(); continue; } /* remove un from the linked lists */ ipc_assert_locked_object(&sma->sem_perm); list_del(&un->list_id); spin_lock(&ulp->lock); list_del_rcu(&un->list_proc); spin_unlock(&ulp->lock); /* perform adjustments registered in un */ for (i = 0; i < sma->sem_nsems; i++) { struct sem * semaphore = &sma->sem_base[i]; if (un->semadj[i]) { semaphore->semval += un->semadj[i]; /* * Range checks of the new semaphore value, * not defined by sus: * - Some unices ignore the undo entirely * (e.g. HP UX 11i 11.22, Tru64 V5.1) * - some cap the value (e.g. FreeBSD caps * at 0, but doesn't enforce SEMVMX) * * Linux caps the semaphore value, both at 0 * and at SEMVMX. * * Manfred <manfred@colorfullife.com> */ if (semaphore->semval < 0) semaphore->semval = 0; if (semaphore->semval > SEMVMX) semaphore->semval = SEMVMX; semaphore->sempid = task_tgid_vnr(current); } } /* maybe some queued-up processes were waiting for this */ INIT_LIST_HEAD(&tasks); do_smart_update(sma, NULL, 0, 1, &tasks); sem_unlock(sma, -1); rcu_read_unlock(); wake_up_sem_queue_do(&tasks); kfree_rcu(un, rcu); } kfree(ulp); } #ifdef CONFIG_PROC_FS static int sysvipc_sem_proc_show(struct seq_file *s, void *it) { struct user_namespace *user_ns = seq_user_ns(s); struct sem_array *sma = it; time_t sem_otime; /* * The proc interface isn't aware of sem_lock(), it calls * ipc_lock_object() directly (in sysvipc_find_ipc). * In order to stay compatible with sem_lock(), we must wait until * all simple semop() calls have left their critical regions. */ sem_wait_array(sma); sem_otime = get_semotime(sma); return seq_printf(s, "%10d %10d %4o %10u %5u %5u %5u %5u %10lu %10lu\n", sma->sem_perm.key, sma->sem_perm.id, sma->sem_perm.mode, sma->sem_nsems, from_kuid_munged(user_ns, sma->sem_perm.uid), from_kgid_munged(user_ns, sma->sem_perm.gid), from_kuid_munged(user_ns, sma->sem_perm.cuid), from_kgid_munged(user_ns, sma->sem_perm.cgid), sem_otime, sma->sem_ctime); } #endif
generated by cgit (git 2.34.1) at 2025-02-25 19:25:45 +0000