Training courses

Kernel and Embedded Linux

Bootlin training courses

Embedded Linux, kernel,
Yocto Project, Buildroot, real-time,
graphics, boot time, debugging...

Bootlin logo

Elixir Cross Referencer

/*	$NetBSD: sched.h,v 1.12 2018/10/23 03:56:47 riastradh Exp $	*/

/*-
 * Copyright (c) 2013 The NetBSD Foundation, Inc.
 * All rights reserved.
 *
 * This code is derived from software contributed to The NetBSD Foundation
 * by Taylor R. Campbell.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */

#ifndef _LINUX_SCHED_H_
#define _LINUX_SCHED_H_

#include <sys/param.h>
#include <sys/kernel.h>
#include <sys/proc.h>

#include <asm/param.h>
#include <asm/barrier.h>
#include <asm/processor.h>
#include <linux/errno.h>

#define	TASK_COMM_LEN	MAXCOMLEN

#define	MAX_SCHEDULE_TIMEOUT	(INT_MAX/2)	/* paranoia */

#define	current	curproc

static inline pid_t
task_pid_nr(struct proc *p)
{
	return p->p_pid;
}

static inline long
schedule_timeout_uninterruptible(long timeout)
{
	long remain;
	int start, end;

	if (cold) {
		unsigned us;
		if (hz <= 1000) {
			unsigned ms = hztoms(MIN(timeout, mstohz(INT_MAX)));
			us = MIN(ms, INT_MAX/1000)*1000;
		} else if (hz <= 1000000) {
			us = MIN(timeout, (INT_MAX/1000000)/hz)*hz*1000000;
		} else {
			us = timeout/(1000000/hz);
		}
		DELAY(us);
		return 0;
	}

	start = hardclock_ticks;
	/* Caller is expected to loop anyway, so no harm in truncating.  */
	(void)kpause("loonix", false /*!intr*/, MIN(timeout, INT_MAX), NULL);
	end = hardclock_ticks;

	remain = timeout - (end - start);
	return remain > 0 ? remain : 0;
}

static inline void
cond_resched(void)
{

	if (curcpu()->ci_schedstate.spc_flags & SPCF_SHOULDYIELD)
		preempt();
}

#endif  /* _LINUX_SCHED_H_ */