8402f058ad
In FreeBSD thread IDs and procedure IDs have distinct number spaces. When asking for the group leader task ID in the LinuxKPI, return the procedure ID and let this resolve to the first task in the procedure having a valid LinuxKPI task structure pointer. MFC after: 1 week Sponsored by: Mellanox Technologies
149 lines
4.1 KiB
C
149 lines
4.1 KiB
C
/*-
|
|
* Copyright (c) 2010 Isilon Systems, Inc.
|
|
* Copyright (c) 2010 iX Systems, Inc.
|
|
* Copyright (c) 2010 Panasas, Inc.
|
|
* Copyright (c) 2013-2017 Mellanox Technologies, Ltd.
|
|
* All rights reserved.
|
|
*
|
|
* 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 unmodified, 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 AUTHOR ``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 AUTHOR 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.
|
|
*
|
|
* $FreeBSD$
|
|
*/
|
|
#ifndef _LINUX_SCHED_H_
|
|
#define _LINUX_SCHED_H_
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/systm.h>
|
|
#include <sys/proc.h>
|
|
#include <sys/sched.h>
|
|
#include <sys/sleepqueue.h>
|
|
|
|
#include <linux/types.h>
|
|
#include <linux/compat.h>
|
|
#include <linux/completion.h>
|
|
#include <linux/pid.h>
|
|
#include <linux/slab.h>
|
|
#include <linux/mm_types.h>
|
|
|
|
#include <asm/atomic.h>
|
|
|
|
#define MAX_SCHEDULE_TIMEOUT LONG_MAX
|
|
|
|
#define TASK_RUNNING 0
|
|
#define TASK_INTERRUPTIBLE 1
|
|
#define TASK_UNINTERRUPTIBLE 2
|
|
#define TASK_DEAD 64
|
|
#define TASK_WAKEKILL 128
|
|
#define TASK_WAKING 256
|
|
|
|
struct task_struct {
|
|
struct thread *task_thread;
|
|
struct mm_struct *mm;
|
|
linux_task_fn_t *task_fn;
|
|
void *task_data;
|
|
int task_ret;
|
|
atomic_t usage;
|
|
int state;
|
|
atomic_t kthread_flags;
|
|
pid_t pid; /* BSD thread ID */
|
|
const char *comm;
|
|
void *bsd_ioctl_data;
|
|
unsigned bsd_ioctl_len;
|
|
struct completion parked;
|
|
struct completion exited;
|
|
};
|
|
|
|
#define current ((struct task_struct *)curthread->td_lkpi_task)
|
|
|
|
#define task_pid_group_leader(task) (task)->task_thread->td_proc->p_pid
|
|
#define task_pid(task) ((task)->pid)
|
|
#define task_pid_nr(task) ((task)->pid)
|
|
#define get_pid(x) (x)
|
|
#define put_pid(x) do { } while (0)
|
|
#define current_euid() (curthread->td_ucred->cr_uid)
|
|
|
|
#define set_current_state(x) \
|
|
atomic_store_rel_int((volatile int *)¤t->state, (x))
|
|
#define __set_current_state(x) current->state = (x)
|
|
|
|
static inline void
|
|
get_task_struct(struct task_struct *task)
|
|
{
|
|
atomic_inc(&task->usage);
|
|
}
|
|
|
|
static inline void
|
|
put_task_struct(struct task_struct *task)
|
|
{
|
|
if (atomic_dec_and_test(&task->usage))
|
|
linux_free_current(task);
|
|
}
|
|
|
|
#define schedule() \
|
|
do { \
|
|
void *c; \
|
|
\
|
|
if (cold || SCHEDULER_STOPPED()) \
|
|
break; \
|
|
c = curthread; \
|
|
sleepq_lock(c); \
|
|
if (current->state == TASK_INTERRUPTIBLE || \
|
|
current->state == TASK_UNINTERRUPTIBLE) { \
|
|
sleepq_add(c, NULL, "task", SLEEPQ_SLEEP, 0); \
|
|
sleepq_wait(c, 0); \
|
|
} else { \
|
|
sleepq_release(c); \
|
|
sched_relinquish(curthread); \
|
|
} \
|
|
} while (0)
|
|
|
|
#define wake_up_process(x) \
|
|
do { \
|
|
int wakeup_swapper; \
|
|
void *c; \
|
|
\
|
|
c = (x)->task_thread; \
|
|
sleepq_lock(c); \
|
|
(x)->state = TASK_RUNNING; \
|
|
wakeup_swapper = sleepq_signal(c, SLEEPQ_SLEEP, 0, 0); \
|
|
sleepq_release(c); \
|
|
if (wakeup_swapper) \
|
|
kick_proc0(); \
|
|
} while (0)
|
|
|
|
#define cond_resched() if (!cold) sched_relinquish(curthread)
|
|
|
|
#define sched_yield() sched_relinquish(curthread)
|
|
|
|
static inline long
|
|
schedule_timeout(signed long timeout)
|
|
{
|
|
if (timeout < 0)
|
|
return 0;
|
|
|
|
pause("lstim", timeout);
|
|
|
|
return 0;
|
|
}
|
|
|
|
#endif /* _LINUX_SCHED_H_ */
|