4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21 * CA 95054 USA or visit www.sun.com if you need additional information or
27 * Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2012, Intel Corporation.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
36 * libcfs/libcfs/winnt/winnt-curproc.c
38 * Impletion of winnt curproc routines.
41 #define DEBUG_SUBSYSTEM S_LNET
43 #include <libcfs/libcfs.h>
46 * Implementation of cfs_curproc API (see portals/include/libcfs/curproc.h)
50 cfs_task_t this_task =
51 { /* umask */ 0,/* blocked*/0, /* pid */ 0, /* pgrp */ 0,
52 /* uid,euid,suid,fsuid */ 0, 0, 0, 0,
53 /* gid_t gid,egid,sgid,fsgid */ 0, 0, 0, 0,
54 /* ngroups*/ 1, /*cgroups*/ 0, /*groups*/ 0,
55 /* group_info */ NULL,
56 /* cap_effective, cap_inheritable, cap_permitted */ 0, 0, 0,
58 /* journal_info */ NULL
62 uid_t current_uid(void)
67 gid_t current_gid(void)
72 uid_t current_fsuid(void)
74 return this_task.fsuid;
77 gid_t current_fsgid(void)
79 return this_task.fsgid;
82 pid_t current_pid(void)
84 return cfs_current()->pid;
87 mode_t current_umask(void)
89 return this_task.umask;
92 char *current_comm(void)
94 return this_task.comm;
97 void cfs_cap_raise(cfs_cap_t cap)
99 this_task.cap_effective |= (1 << cap);
102 void cfs_cap_lower(cfs_cap_t cap)
104 this_task.cap_effective &= ~(1 << cap);
107 int cfs_cap_raised(cfs_cap_t cap)
109 return this_task.cap_effective & (1 << cap);
112 cfs_cap_t cfs_curproc_cap_pack(void) {
113 return this_task.cap_effective;
116 void cfs_curproc_cap_unpack(cfs_cap_t cap) {
117 this_task.cap_effective = cap;
120 int cfs_capable(cfs_cap_t cap)
126 * Implementation of linux task management routines
130 /* global of the task manager structure */
132 TASK_MAN cfs_win_task_manger;
134 /* global idr context */
135 struct idr_context * cfs_win_task_slot_idp = NULL;
141 PTASK_SLOT alloc_task_slot()
143 if (cfs_win_task_manger.slab)
144 return kmem_cache_alloc(cfs_win_task_manger.slab, 0);
146 return kmalloc(sizeof(TASK_SLOT), 0);
150 init_task_slot(PTASK_SLOT task)
152 memset(task, 0, sizeof(TASK_SLOT));
153 task->Magic = TASKSLT_MAGIC;
154 task->task = this_task;
155 cfs_init_event(&task->Event, TRUE, FALSE);
158 void cleanup_task_slot(PTASK_SLOT task)
161 cfs_idr_remove(cfs_win_task_slot_idp, task->task.pid);
163 if (cfs_win_task_manger.slab)
164 kmem_cache_free(cfs_win_task_manger.slab, task);
170 * task manager related routines
180 PLIST_ENTRY ListEntry = NULL;
181 PTASK_SLOT TaskSlot = NULL;
183 spin_lock(&(cfs_win_task_manger.Lock));
185 ListEntry = cfs_win_task_manger.TaskList.Flink;
186 while (ListEntry != (&(cfs_win_task_manger.TaskList))) {
188 TaskSlot = CONTAINING_RECORD(ListEntry, TASK_SLOT, Link);
190 if (TaskSlot->Pid == ProcessId && TaskSlot->Tid == ThreadId) {
193 /* remove the taskslot */
194 RemoveEntryList(&(TaskSlot->Link));
195 cfs_win_task_manger.NumOfTasks--;
197 /* now free the task slot */
198 cleanup_task_slot(TaskSlot);
202 ListEntry = ListEntry->Flink;
205 spin_unlock(&(cfs_win_task_manger.Lock));
213 /* initialize the content and magic */
214 memset(&cfs_win_task_manger, 0, sizeof(TASK_MAN));
215 cfs_win_task_manger.Magic = TASKMAN_MAGIC;
217 /* initialize the spinlock protection */
218 spin_lock_init(&cfs_win_task_manger.Lock);
220 /* create slab memory cache */
221 cfs_win_task_manger.slab = kmem_cache_create("TSLT", sizeof(TASK_SLOT),
224 /* intialize the list header */
225 InitializeListHead(&(cfs_win_task_manger.TaskList));
227 cfs_win_task_slot_idp = cfs_idr_init();
228 if (!cfs_win_task_slot_idp) {
232 /* set the thread creation/destruction notify routine */
233 status = PsSetCreateThreadNotifyRoutine(task_manager_notify);
235 if (!NT_SUCCESS(status)) {
236 cfs_enter_debugger();
237 /* remove idr context */
238 if (cfs_win_task_slot_idp) {
239 cfs_idr_exit(cfs_win_task_slot_idp);
240 cfs_win_task_slot_idp = NULL;
242 return cfs_error_code(status);
249 cleanup_task_manager()
251 PLIST_ENTRY ListEntry = NULL;
252 PTASK_SLOT TaskSlot = NULL;
254 /* remove ThreadNotifyRoutine: task_manager_notify */
255 PsRemoveCreateThreadNotifyRoutine(task_manager_notify);
257 /* remove idr context */
258 if (cfs_win_task_slot_idp) {
259 cfs_idr_exit(cfs_win_task_slot_idp);
260 cfs_win_task_slot_idp = NULL;
263 /* cleanup all the taskslots attached to the list */
264 spin_lock(&(cfs_win_task_manger.Lock));
266 while (!IsListEmpty(&(cfs_win_task_manger.TaskList))) {
268 ListEntry = cfs_win_task_manger.TaskList.Flink;
269 TaskSlot = CONTAINING_RECORD(ListEntry, TASK_SLOT, Link);
271 RemoveEntryList(ListEntry);
272 cleanup_task_slot(TaskSlot);
275 spin_unlock(&cfs_win_task_manger.Lock);
277 /* destroy the taskslot cache slab */
278 kmem_cache_destroy(cfs_win_task_manger.slab);
279 memset(&cfs_win_task_manger, 0, sizeof(TASK_MAN));
284 * schedule routines (task slot list)
291 HANDLE Pid = PsGetCurrentProcessId();
292 HANDLE Tid = PsGetCurrentThreadId();
293 PETHREAD Tet = PsGetCurrentThread();
295 PLIST_ENTRY ListEntry = NULL;
296 PTASK_SLOT TaskSlot = NULL;
298 spin_lock(&(cfs_win_task_manger.Lock));
300 ListEntry = cfs_win_task_manger.TaskList.Flink;
301 while (ListEntry != (&(cfs_win_task_manger.TaskList))) {
303 TaskSlot = CONTAINING_RECORD(ListEntry, TASK_SLOT, Link);
304 if (TaskSlot->Pid == Pid && TaskSlot->Tid == Tid) {
305 if (TaskSlot->Tet != Tet) {
308 // The old thread was already exit. This must be a
309 // new thread which get the same Tid to the previous.
318 if (TaskSlot->Pid > Pid) {
321 } else if (TaskSlot->Pid == Pid) {
322 if (TaskSlot->Tid > Tid) {
330 ListEntry = ListEntry->Flink;
335 /* allocate new task slot */
336 TaskSlot = alloc_task_slot();
338 cfs_enter_debugger();
342 /* set task slot IDs */
343 init_task_slot(TaskSlot);
347 TaskSlot->task.pid = (pid_t)cfs_idr_get_new(cfs_win_task_slot_idp, Tet);
349 if (ListEntry == (&(cfs_win_task_manger.TaskList))) {
351 // Empty case or the biggest case, put it to the tail.
353 InsertTailList(&(cfs_win_task_manger.TaskList), &(TaskSlot->Link));
356 // Get a slot and smaller than it's tid, put it just before.
358 InsertHeadList(ListEntry->Blink, &(TaskSlot->Link));
361 cfs_win_task_manger.NumOfTasks++;
365 // To Check whether he task structures are arranged in the expected order ?
369 PTASK_SLOT Prev = NULL, Curr = NULL;
371 ListEntry = cfs_win_task_manger.TaskList.Flink;
373 while (ListEntry != (&(cfs_win_task_manger.TaskList))) {
375 Curr = CONTAINING_RECORD(ListEntry, TASK_SLOT, Link);
376 ListEntry = ListEntry->Flink;
379 if (Prev->Pid > Curr->Pid) {
380 cfs_enter_debugger();
381 } else if (Prev->Pid == Curr->Pid) {
382 if (Prev->Tid > Curr->Tid) {
383 cfs_enter_debugger();
394 spin_unlock(&(cfs_win_task_manger.Lock));
397 cfs_enter_debugger();
401 return (&(TaskSlot->task));
404 /* deschedule for a bit... */
406 cfs_pause(cfs_duration_t ticks)
408 cfs_schedule_timeout_and_set_state(CFS_TASK_UNINTERRUPTIBLE, ticks);
412 cfs_schedule_timeout_and_set_state(cfs_task_state_t state, int64_t time)
414 cfs_task_t * task = cfs_current();
415 PTASK_SLOT slot = NULL;
418 cfs_enter_debugger();
422 slot = CONTAINING_RECORD(task, TASK_SLOT, task);
423 cfs_assert(slot->Magic == TASKSLT_MAGIC);
425 if (time == CFS_MAX_SCHEDULE_TIMEOUT) {
429 cfs_wait_event_internal(&(slot->Event), time);
435 cfs_schedule_timeout_and_set_state(CFS_TASK_UNINTERRUPTIBLE, 0);
443 PTASK_SLOT slot = NULL;
446 cfs_enter_debugger();
450 slot = CONTAINING_RECORD(task, TASK_SLOT, task);
451 cfs_assert(slot->Magic == TASKSLT_MAGIC);
453 cfs_wake_event(&(slot->Event));
459 sleep_on(cfs_waitq_t *waitq)
463 cfs_waitlink_init(&link);
464 cfs_waitq_add(waitq, &link);
465 cfs_waitq_wait(&link, CFS_TASK_INTERRUPTIBLE);
466 cfs_waitq_del(waitq, &link);
469 EXPORT_SYMBOL(current_uid);
470 EXPORT_SYMBOL(current_pid);
471 EXPORT_SYMBOL(current_gid);
472 EXPORT_SYMBOL(current_fsuid);
473 EXPORT_SYMBOL(current_fsgid);
474 EXPORT_SYMBOL(current_umask);
475 EXPORT_SYMBOL(current_comm);
476 EXPORT_SYMBOL(cfs_cap_raise);
477 EXPORT_SYMBOL(cfs_cap_lower);
478 EXPORT_SYMBOL(cfs_cap_raised);
479 EXPORT_SYMBOL(cfs_curproc_cap_pack);
480 EXPORT_SYMBOL(cfs_curproc_cap_unpack);
481 EXPORT_SYMBOL(cfs_capable);