-/* -*- mode: c; c-basic-offset: 4; indent-tabs-mode: nil; -*-
- * vim:expandtab:shiftwidth=4:tabstop=4:
+/*
+ * GPL HEADER START
+ *
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License version 2 only,
+ * as published by the Free Software Foundation.
*
- * Copyright (c) 2004 Cluster File Systems, Inc.
+ * 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 version 2 for more details (a copy is included
+ * in the LICENSE file that accompanied this code).
*
- * This file is part of Lustre, http://www.lustre.org.
+ * You should have received a copy of the GNU General Public License
+ * version 2 along with this program; If not, see
+ * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
*
- * Lustre is free software; you can redistribute it and/or modify it under
- * the terms of version 2 of the GNU General Public License as published by
- * the Free Software Foundation. Lustre 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. You should have received a
- * copy of the GNU General Public License along with Lustre; if not, write
- * to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139,
- * USA.
+ * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
+ * CA 95054 USA or visit www.sun.com if you need additional information or
+ * have any questions.
+ *
+ * GPL HEADER END
+ */
+/*
+ * Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved.
+ * Use is subject to license terms.
+ */
+/*
+ * This file is part of Lustre, http://www.lustre.org/
+ * Lustre is a trademark of Sun Microsystems, Inc.
+ *
+ * libcfs/libcfs/winnt/winnt-curproc.c
*
* Impletion of winnt curproc routines.
*/
#include <libcfs/libcfs.h>
-
/*
* Implementation of cfs_curproc API (see portals/include/libcfs/curproc.h)
* for Linux kernel.
*/
-cfs_task_t this_task =
- { 0, 0, 0, 0, 0, 0, 0,
- 0, 0, 0, 0, 1, 0, 0, 0, 0,
- "sysetm\0" };
+cfs_task_t this_task =
+ { /* umask */ 0,/* blocked*/0, /* pid */ 0, /* pgrp */ 0,
+ /* uid,euid,suid,fsuid */ 0, 0, 0, 0,
+ /* gid_t gid,egid,sgid,fsgid */ 0, 0, 0, 0,
+ /* ngroups*/ 1, /*cgroups*/ 0, /*groups*/ 0,
+ /* group_info */ NULL,
+ /* cap_effective, cap_inheritable, cap_permitted */ 0, 0, 0,
+ /* comm */"sysetm\0",
+ /* journal_info */ NULL
+ };
uid_t cfs_curproc_uid(void)
return this_task.comm;
}
-cfs_kernel_cap_t cfs_curproc_cap_get(void)
+void cfs_cap_raise(cfs_cap_t cap)
+{
+ this_task.cap_effective |= (1 << cap);
+}
+
+void cfs_cap_lower(cfs_cap_t cap)
{
- return this_task.cap_effective;
+ this_task.cap_effective &= ~(1 << cap);
}
-void cfs_curproc_cap_set(cfs_kernel_cap_t cap)
+int cfs_cap_raised(cfs_cap_t cap)
{
- this_task.cap_effective = cap;
+ return this_task.cap_effective & (1 << cap);
+}
+
+cfs_cap_t cfs_curproc_cap_pack(void) {
+ return this_task.cap_effective;
}
+void cfs_curproc_cap_unpack(cfs_cap_t cap) {
+ this_task.cap_effective = cap;
+}
+
+int cfs_capable(cfs_cap_t cap)
+{
+ return TRUE;
+}
/*
* Implementation of linux task management routines
/* global of the task manager structure */
-TASK_MAN TaskMan;
+TASK_MAN cfs_win_task_manger;
+/* global idr context */
+struct idr_context * cfs_win_task_slot_idp = NULL;
/*
* task slot routiens
{
PTASK_SLOT task = NULL;
- if (TaskMan.slab) {
- task = cfs_mem_cache_alloc(TaskMan.slab, 0);
+ if (cfs_win_task_manger.slab) {
+ task = cfs_mem_cache_alloc(cfs_win_task_manger.slab, 0);
} else {
task = cfs_alloc(sizeof(TASK_SLOT), 0);
}
memset(task, 0, sizeof(TASK_SLOT));
task->Magic = TASKSLT_MAGIC;
task->task = this_task;
- task->task.pid = (pid_t)PsGetCurrentThreadId();
cfs_init_event(&task->Event, TRUE, FALSE);
}
-
void
cleanup_task_slot(PTASK_SLOT task)
{
- if (TaskMan.slab) {
- cfs_mem_cache_free(TaskMan.slab, task);
+ if (task->task.pid) {
+ cfs_idr_remove(cfs_win_task_slot_idp, task->task.pid);
+ }
+
+ if (cfs_win_task_manger.slab) {
+ cfs_mem_cache_free(cfs_win_task_manger.slab, task);
} else {
cfs_free(task);
}
PLIST_ENTRY ListEntry = NULL;
PTASK_SLOT TaskSlot = NULL;
- spin_lock(&(TaskMan.Lock));
+ cfs_spin_lock(&(cfs_win_task_manger.Lock));
- ListEntry = TaskMan.TaskList.Flink;
-
- while (ListEntry != (&(TaskMan.TaskList))) {
+ ListEntry = cfs_win_task_manger.TaskList.Flink;
+ while (ListEntry != (&(cfs_win_task_manger.TaskList))) {
TaskSlot = CONTAINING_RECORD(ListEntry, TASK_SLOT, Link);
if (TaskSlot->Pid == ProcessId && TaskSlot->Tid == ThreadId) {
- if (Create) {
-/*
- DbgPrint("task_manager_notify: Pid=%xh Tid %xh resued (TaskSlot->Tet = %xh)...\n",
- ProcessId, ThreadId, TaskSlot->Tet);
-*/
- } else {
+ if (!Create) {
/* remove the taskslot */
RemoveEntryList(&(TaskSlot->Link));
- TaskMan.NumOfTasks--;
+ cfs_win_task_manger.NumOfTasks--;
/* now free the task slot */
cleanup_task_slot(TaskSlot);
ListEntry = ListEntry->Flink;
}
- spin_unlock(&(TaskMan.Lock));
+ cfs_spin_unlock(&(cfs_win_task_manger.Lock));
}
int
NTSTATUS status;
/* initialize the content and magic */
- memset(&TaskMan, 0, sizeof(TASK_MAN));
- TaskMan.Magic = TASKMAN_MAGIC;
+ memset(&cfs_win_task_manger, 0, sizeof(TASK_MAN));
+ cfs_win_task_manger.Magic = TASKMAN_MAGIC;
/* initialize the spinlock protection */
- spin_lock_init(&TaskMan.Lock);
+ cfs_spin_lock_init(&cfs_win_task_manger.Lock);
/* create slab memory cache */
- TaskMan.slab = cfs_mem_cache_create(
+ cfs_win_task_manger.slab = cfs_mem_cache_create(
"TSLT", sizeof(TASK_SLOT), 0, 0);
/* intialize the list header */
- InitializeListHead(&(TaskMan.TaskList));
+ InitializeListHead(&(cfs_win_task_manger.TaskList));
+
+ cfs_win_task_slot_idp = cfs_idr_init();
+ if (!cfs_win_task_slot_idp) {
+ return -ENOMEM;
+ }
/* set the thread creation/destruction notify routine */
status = PsSetCreateThreadNotifyRoutine(task_manager_notify);
if (!NT_SUCCESS(status)) {
cfs_enter_debugger();
+ /* remove idr context */
+ if (cfs_win_task_slot_idp) {
+ cfs_idr_exit(cfs_win_task_slot_idp);
+ cfs_win_task_slot_idp = NULL;
+ }
+ return cfs_error_code(status);
}
return 0;
PLIST_ENTRY ListEntry = NULL;
PTASK_SLOT TaskSlot = NULL;
- /* we must stay in system since we succeed to register the
- CreateThreadNotifyRoutine: task_manager_notify */
- cfs_enter_debugger();
+ /* remove ThreadNotifyRoutine: task_manager_notify */
+ PsRemoveCreateThreadNotifyRoutine(task_manager_notify);
+ /* remove idr context */
+ if (cfs_win_task_slot_idp) {
+ cfs_idr_exit(cfs_win_task_slot_idp);
+ cfs_win_task_slot_idp = NULL;
+ }
/* cleanup all the taskslots attached to the list */
- spin_lock(&(TaskMan.Lock));
+ cfs_spin_lock(&(cfs_win_task_manger.Lock));
- while (!IsListEmpty(&(TaskMan.TaskList))) {
+ while (!IsListEmpty(&(cfs_win_task_manger.TaskList))) {
- ListEntry = TaskMan.TaskList.Flink;
+ ListEntry = cfs_win_task_manger.TaskList.Flink;
TaskSlot = CONTAINING_RECORD(ListEntry, TASK_SLOT, Link);
RemoveEntryList(ListEntry);
cleanup_task_slot(TaskSlot);
}
- spin_unlock(&TaskMan.Lock);
+ cfs_spin_unlock(&cfs_win_task_manger.Lock);
/* destroy the taskslot cache slab */
- cfs_mem_cache_destroy(TaskMan.slab);
- memset(&TaskMan, 0, sizeof(TASK_MAN));
+ cfs_mem_cache_destroy(cfs_win_task_manger.slab);
+ memset(&cfs_win_task_manger, 0, sizeof(TASK_MAN));
}
PLIST_ENTRY ListEntry = NULL;
PTASK_SLOT TaskSlot = NULL;
- spin_lock(&(TaskMan.Lock));
+ cfs_spin_lock(&(cfs_win_task_manger.Lock));
- ListEntry = TaskMan.TaskList.Flink;
-
- while (ListEntry != (&(TaskMan.TaskList))) {
+ ListEntry = cfs_win_task_manger.TaskList.Flink;
+ while (ListEntry != (&(cfs_win_task_manger.TaskList))) {
TaskSlot = CONTAINING_RECORD(ListEntry, TASK_SLOT, Link);
-
if (TaskSlot->Pid == Pid && TaskSlot->Tid == Tid) {
if (TaskSlot->Tet != Tet) {
-/*
- DbgPrint("cfs_current: Pid=%xh Tid %xh Tet = %xh resued (TaskSlot->Tet = %xh)...\n",
- Pid, Tid, Tet, TaskSlot->Tet);
-*/
//
// The old thread was already exit. This must be a
// new thread which get the same Tid to the previous.
} else {
- if ((ULONG)TaskSlot->Pid > (ULONG)Pid) {
+ if (TaskSlot->Pid > Pid) {
TaskSlot = NULL;
break;
- } else if ((ULONG)TaskSlot->Pid == (ULONG)Pid) {
- if ((ULONG)TaskSlot->Tid > (ULONG)Tid) {
+ } else if (TaskSlot->Pid == Pid) {
+ if (TaskSlot->Tid > Tid) {
TaskSlot = NULL;
break;
}
}
-
TaskSlot = NULL;
}
if (!TaskSlot) {
+ /* allocate new task slot */
TaskSlot = alloc_task_slot();
-
if (!TaskSlot) {
cfs_enter_debugger();
goto errorout;
}
+ /* set task slot IDs */
init_task_slot(TaskSlot);
-
TaskSlot->Pid = Pid;
TaskSlot->Tid = Tid;
TaskSlot->Tet = Tet;
+ TaskSlot->task.pid = (pid_t)cfs_idr_get_new(cfs_win_task_slot_idp, Tet);
- if (ListEntry == (&(TaskMan.TaskList))) {
+ if (ListEntry == (&(cfs_win_task_manger.TaskList))) {
//
// Empty case or the biggest case, put it to the tail.
//
- InsertTailList(&(TaskMan.TaskList), &(TaskSlot->Link));
+ InsertTailList(&(cfs_win_task_manger.TaskList), &(TaskSlot->Link));
} else {
//
// Get a slot and smaller than it's tid, put it just before.
InsertHeadList(ListEntry->Blink, &(TaskSlot->Link));
}
- TaskMan.NumOfTasks++;
+ cfs_win_task_manger.NumOfTasks++;
}
//
{
PTASK_SLOT Prev = NULL, Curr = NULL;
- ListEntry = TaskMan.TaskList.Flink;
+ ListEntry = cfs_win_task_manger.TaskList.Flink;
- while (ListEntry != (&(TaskMan.TaskList))) {
+ while (ListEntry != (&(cfs_win_task_manger.TaskList))) {
Curr = CONTAINING_RECORD(ListEntry, TASK_SLOT, Link);
ListEntry = ListEntry->Flink;
if (Prev) {
- if ((ULONG)Prev->Pid > (ULONG)Curr->Pid) {
+ if (Prev->Pid > Curr->Pid) {
cfs_enter_debugger();
- } else if ((ULONG)Prev->Pid == (ULONG)Curr->Pid) {
- if ((ULONG)Prev->Tid > (ULONG)Curr->Tid) {
+ } else if (Prev->Pid == Curr->Pid) {
+ if (Prev->Tid > Curr->Tid) {
cfs_enter_debugger();
}
}
errorout:
- spin_unlock(&(TaskMan.Lock));
+ cfs_spin_unlock(&(cfs_win_task_manger.Lock));
if (!TaskSlot) {
cfs_enter_debugger();
return (&(TaskSlot->task));
}
-int
-schedule_timeout(int64_t time)
+/* deschedule for a bit... */
+void
+cfs_pause(cfs_duration_t ticks)
+{
+ cfs_schedule_timeout_and_set_state(CFS_TASK_UNINTERRUPTIBLE, ticks);
+}
+
+void
+cfs_schedule_timeout_and_set_state(cfs_task_state_t state, int64_t time)
{
cfs_task_t * task = cfs_current();
PTASK_SLOT slot = NULL;
if (!task) {
cfs_enter_debugger();
- return 0;
+ return;
}
slot = CONTAINING_RECORD(task, TASK_SLOT, task);
cfs_assert(slot->Magic == TASKSLT_MAGIC);
- if (time == MAX_SCHEDULE_TIMEOUT) {
+ if (time == CFS_MAX_SCHEDULE_TIMEOUT) {
time = 0;
}
- return (cfs_wait_event(&(slot->Event), time) != 0);
+ cfs_wait_event_internal(&(slot->Event), time);
}
-int
-schedule()
+void
+cfs_schedule()
{
- return schedule_timeout(0);
+ cfs_schedule_timeout_and_set_state(CFS_TASK_UNINTERRUPTIBLE, 0);
}
int
}
void
-sleep_on(
- cfs_waitq_t *waitq
- )
+sleep_on(cfs_waitq_t *waitq)
{
cfs_waitlink_t link;
EXPORT_SYMBOL(cfs_curproc_groups_nr);
EXPORT_SYMBOL(cfs_curproc_groups_dump);
EXPORT_SYMBOL(cfs_curproc_is_in_groups);
-EXPORT_SYMBOL(cfs_curproc_cap_get);
-EXPORT_SYMBOL(cfs_curproc_cap_set);
+EXPORT_SYMBOL(cfs_cap_raise);
+EXPORT_SYMBOL(cfs_cap_lower);
+EXPORT_SYMBOL(cfs_cap_raised);
+EXPORT_SYMBOL(cfs_curproc_cap_pack);
+EXPORT_SYMBOL(cfs_curproc_cap_unpack);
+EXPORT_SYMBOL(cfs_capable);
git://git.whamcloud.com / fs / lustre-release.git / blobdiff