/*
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License version 2.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *
 * Test that the process specified by the pid argument preempt a lowest
 * priority running process, if the priority of the process specified by the
 * pid argument is set higher than that of the lowest priority running process
 * and if the specified process is ready to run.
 *
 * NO OTHER REALTIME PROCESS SHOULD RUN WHEN RUNNING THIS TEST.
 *
 * There is no portable way to get the number of CPUs but the test should work
 * for most of UNIX system (including but not limited to: Linux, Solaris, AIX,
 * HPUX, *BSD).
 * This test used shared memory.
 * Steps:
 *   1. Create a share memory segment.
 *   2. Change the policy to SCHED_FIFO and set minimum priority.
 *   3. Create NB_CPU-1 children processes which set their own priority to the
 *      higher value and use all but one processor.
 *   4. Create a child with the same priority.
 *   4. Call sched_setparam with an mean priority and the pid value of the
 *      last children.
 *   5. Check if the shared value has been changed by the child process. If
 *      not, the test fail.
 */
#include "affinity.h"

#include <errno.h>
#include <sched.h>
#include <stdio.h>
#include <signal.h>
#include <stdlib.h>
#include <sys/ipc.h>
#include <sys/shm.h>
#include <time.h>
#include <unistd.h>
#include "posixtest.h"
#include "ncpu.h"

static int nb_cpu;
static int *shmptr;
static int mean_prio;

static void child_process(void)
{
	struct sched_param param;
	time_t t1, t2;

	param.sched_priority = sched_get_priority_max(SCHED_FIFO);
	if (sched_setparam(getpid(), &param) != 0) {
		perror("An error occurs when calling sched_setparam()");
		return;
	}

	t1 = time(NULL);
	do {
		t2 = time(NULL);
	} while (difftime(t2, t1) <= 2);
}

static void test_process(void)
{
	struct sched_param param;
	time_t t1, t2;

	t1 = time(NULL);
	do {
		sched_getparam(getpid(), &param);
		(*shmptr) = param.sched_priority;
		/* if we can see that our priority has changed
		 * that means we preempted parent, so we are done */
		if ((*shmptr) == mean_prio)
			break;

		t2 = time(NULL);
		/* OS-es supporting set_affinity(), like Linux, will
		 * have only one parent and child process competing
		 * for same CPU. Since code path in parent does not
		 * block between fork() and sched_setparam(), child
		 * should run only after parent boosted its priority.
		 * Situation on other OS-es is a bit less predictable,
		 * as these will spawn ncpu-1 children, which run at max
		 * priority and could (though unlikely) preempt parent.
		 * Rather than risking deadlock, keep the sched_yield()
		 * call in loop as it is harmless. */
		sched_yield();
	} while (difftime(t2, t1) <= 2);
	pause();
}

static void kill_children(int *child_pid, int count)
{
	int i;

	for (i = 0; i < count; i++)
		kill(child_pid[i], SIGTERM);
	free(child_pid);
}

int main(void)
{
	int *child_pid, oldcount, newcount, shm_id, i;
	struct sched_param param;
	key_t key;
	int rc = set_affinity_single();
	if (rc) {
		nb_cpu = get_ncpu();
		if (nb_cpu == -1) {
			printf("Can not get the number of"
			       " CPUs of the machine.\n");
			return PTS_UNRESOLVED;
		}
	} else {
		nb_cpu = 1;
	}

	mean_prio = (sched_get_priority_min(SCHED_FIFO) +
		sched_get_priority_max(SCHED_FIFO)) / 2;
	child_pid = malloc(nb_cpu * sizeof(int));

	key = ftok("conformance/interfaces/sched_setparam/9-1.c", 1234);
	shm_id = shmget(key, sizeof(int), IPC_CREAT | 0600);
	if (shm_id < 0) {
		perror("An error occurs when calling shmget()");
		return PTS_UNRESOLVED;
	}

	shmptr = shmat(shm_id, 0, 0);
	if (shmptr == (void *)-1) {
		perror("An error occurs when calling shmat()");
		return PTS_UNRESOLVED;
	}
	*shmptr = 0;

	param.sched_priority = sched_get_priority_min(SCHED_FIFO);
	if (sched_setscheduler(getpid(), SCHED_FIFO, &param) != 0) {
		if (errno == EPERM) {
			printf("This process does not have the permission"
			       " to set its own scheduling parameter.\n"
			       "Try to launch this test as root\n");
		} else {
			perror("An error occurs when calling"
			       " sched_setscheduler()");
		}
		return PTS_UNRESOLVED;
	}

	for (i = 0; i < (nb_cpu - 1); i++) {
		child_pid[i] = fork();
		if (child_pid[i] == -1) {
			perror("An error occurs when calling fork()");
			kill_children(child_pid, i);
			return PTS_UNRESOLVED;
		} else if (child_pid[i] == 0) {

			child_process();

			printf("This code should not be executed.\n");
			return PTS_UNRESOLVED;
		}
	}

	child_pid[i] = fork();
	if (child_pid[i] == -1) {
		perror("An error occurs when calling fork()");
		kill_children(child_pid, i);
		return PTS_UNRESOLVED;
	} else if (child_pid[i] == 0) {

		test_process();

		printf("This code should not be executed.\n");
		return PTS_UNRESOLVED;
	}

	param.sched_priority = mean_prio;
	oldcount = *shmptr;
	if (sched_setparam(child_pid[i], &param) != 0) {
		perror("An error occurs when calling sched_setparam()");
		kill_children(child_pid, nb_cpu);
		return PTS_UNRESOLVED;
	}
	newcount = *shmptr;

	if (newcount == oldcount) {
		printf("The target process does not preempt"
		       " the calling process\n");
		kill_children(child_pid, nb_cpu);
		return PTS_FAIL;
	}

	printf("Test PASSED\n");
	kill_children(child_pid, nb_cpu);
	return PTS_PASS;
}
