1#!/bin/sh 2# trigger a bug that would make parallel sort use 100% of one or more 3# CPU while blocked on output. 4 5# Copyright (C) 2010-2023 Free Software Foundation, Inc. 6 7# This program is free software: you can redistribute it and/or modify 8# it under the terms of the GNU General Public License as published by 9# the Free Software Foundation, either version 3 of the License, or 10# (at your option) any later version. 11 12# This program is distributed in the hope that it will be useful, 13# but WITHOUT ANY WARRANTY; without even the implied warranty of 14# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15# GNU General Public License for more details. 16 17# You should have received a copy of the GNU General Public License 18# along with this program. If not, see <https://www.gnu.org/licenses/>. 19 20. "${srcdir=.}/tests/init.sh"; path_prepend_ ./src 21print_ver_ sort 22 23# This isn't terribly expensive, but it must not be run under heavy load. 24# Since the "very expensive" tests are already run only with -j1, adding 25# this test to the list ensures it still gets _some_ (albeit minimal) 26# coverage while not causing false-positive failures in day to day runs. 27very_expensive_ 28 29grep '^#define HAVE_PTHREAD_T 1' "$CONFIG_HEADER" > /dev/null || 30 skip_ 'requires pthreads' 31 32# Terminate any background processes 33cleanup_() { kill $pid 2>/dev/null && wait $pid; } 34 35seq 100000 > in || framework_failure_ 36mkfifo_or_skip_ fifo 37 38# Arrange for sort to require 8.0+ seconds of wall-clock time, 39# while actually using far less than 1 second of CPU time. 40(for i in $(seq 80); do read line; echo $i; sleep .1; done 41 cat > /dev/null) < fifo & pid=$! 42 43# However, under heavy load, it can easily take more than 44# one second of CPU time, so set a permissive limit: 45ulimit -t 7 46sort --parallel=2 in > fifo || fail=1 47 48Exit $fail 49