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 cfs_curproc_uid(void)
67 gid_t cfs_curproc_gid(void)
72 uid_t cfs_curproc_fsuid(void)
74 return this_task.fsuid;
77 gid_t cfs_curproc_fsgid(void)
79 return this_task.fsgid;
82 pid_t cfs_curproc_pid(void)
84 return cfs_current()->pid;
87 int cfs_curproc_groups_nr(void)
89 return this_task.ngroups;
92 void cfs_curproc_groups_dump(gid_t *array, int size)
94 LASSERT(size <= NGROUPS);
95 size = min_t(int, size, this_task.ngroups);
96 memcpy(array, this_task.groups, size * sizeof(__u32));
99 int cfs_curproc_is_in_groups(gid_t gid)
101 return in_group_p(gid);
104 mode_t cfs_curproc_umask(void)
106 return this_task.umask;
109 char *cfs_curproc_comm(void)
111 return this_task.comm;
114 void cfs_cap_raise(cfs_cap_t cap)
116 this_task.cap_effective |= (1 << cap);
119 void cfs_cap_lower(cfs_cap_t cap)
121 this_task.cap_effective &= ~(1 << cap);
124 int cfs_cap_raised(cfs_cap_t cap)
126 return this_task.cap_effective & (1 << cap);
129 cfs_cap_t cfs_curproc_cap_pack(void) {
130 return this_task.cap_effective;
133 void cfs_curproc_cap_unpack(cfs_cap_t cap) {
134 this_task.cap_effective = cap;
137 int cfs_capable(cfs_cap_t cap)
143 * Implementation of linux task management routines
147 /* global of the task manager structure */
149 TASK_MAN cfs_win_task_manger;
151 /* global idr context */
152 struct idr_context * cfs_win_task_slot_idp = NULL;
158 PTASK_SLOT alloc_task_slot()
160 if (cfs_win_task_manger.slab)
161 return kmem_cache_alloc(cfs_win_task_manger.slab, 0);
163 return kmalloc(sizeof(TASK_SLOT), 0);
167 init_task_slot(PTASK_SLOT task)
169 memset(task, 0, sizeof(TASK_SLOT));
170 task->Magic = TASKSLT_MAGIC;
171 task->task = this_task;
172 cfs_init_event(&task->Event, TRUE, FALSE);
175 void cleanup_task_slot(PTASK_SLOT task)
178 cfs_idr_remove(cfs_win_task_slot_idp, task->task.pid);
180 if (cfs_win_task_manger.slab)
181 kmem_cache_free(cfs_win_task_manger.slab, task);
187 * task manager related routines
197 PLIST_ENTRY ListEntry = NULL;
198 PTASK_SLOT TaskSlot = NULL;
200 spin_lock(&(cfs_win_task_manger.Lock));
202 ListEntry = cfs_win_task_manger.TaskList.Flink;
203 while (ListEntry != (&(cfs_win_task_manger.TaskList))) {
205 TaskSlot = CONTAINING_RECORD(ListEntry, TASK_SLOT, Link);
207 if (TaskSlot->Pid == ProcessId && TaskSlot->Tid == ThreadId) {
210 /* remove the taskslot */
211 RemoveEntryList(&(TaskSlot->Link));
212 cfs_win_task_manger.NumOfTasks--;
214 /* now free the task slot */
215 cleanup_task_slot(TaskSlot);
219 ListEntry = ListEntry->Flink;
222 spin_unlock(&(cfs_win_task_manger.Lock));
230 /* initialize the content and magic */
231 memset(&cfs_win_task_manger, 0, sizeof(TASK_MAN));
232 cfs_win_task_manger.Magic = TASKMAN_MAGIC;
234 /* initialize the spinlock protection */
235 spin_lock_init(&cfs_win_task_manger.Lock);
237 /* create slab memory cache */
238 cfs_win_task_manger.slab = kmem_cache_create("TSLT", sizeof(TASK_SLOT),
241 /* intialize the list header */
242 InitializeListHead(&(cfs_win_task_manger.TaskList));
244 cfs_win_task_slot_idp = cfs_idr_init();
245 if (!cfs_win_task_slot_idp) {
249 /* set the thread creation/destruction notify routine */
250 status = PsSetCreateThreadNotifyRoutine(task_manager_notify);
252 if (!NT_SUCCESS(status)) {
253 cfs_enter_debugger();
254 /* remove idr context */
255 if (cfs_win_task_slot_idp) {
256 cfs_idr_exit(cfs_win_task_slot_idp);
257 cfs_win_task_slot_idp = NULL;
259 return cfs_error_code(status);
266 cleanup_task_manager()
268 PLIST_ENTRY ListEntry = NULL;
269 PTASK_SLOT TaskSlot = NULL;
271 /* remove ThreadNotifyRoutine: task_manager_notify */
272 PsRemoveCreateThreadNotifyRoutine(task_manager_notify);
274 /* remove idr context */
275 if (cfs_win_task_slot_idp) {
276 cfs_idr_exit(cfs_win_task_slot_idp);
277 cfs_win_task_slot_idp = NULL;
280 /* cleanup all the taskslots attached to the list */
281 spin_lock(&(cfs_win_task_manger.Lock));
283 while (!IsListEmpty(&(cfs_win_task_manger.TaskList))) {
285 ListEntry = cfs_win_task_manger.TaskList.Flink;
286 TaskSlot = CONTAINING_RECORD(ListEntry, TASK_SLOT, Link);
288 RemoveEntryList(ListEntry);
289 cleanup_task_slot(TaskSlot);
292 spin_unlock(&cfs_win_task_manger.Lock);
294 /* destroy the taskslot cache slab */
295 kmem_cache_destroy(cfs_win_task_manger.slab);
296 memset(&cfs_win_task_manger, 0, sizeof(TASK_MAN));
301 * schedule routines (task slot list)
308 HANDLE Pid = PsGetCurrentProcessId();
309 HANDLE Tid = PsGetCurrentThreadId();
310 PETHREAD Tet = PsGetCurrentThread();
312 PLIST_ENTRY ListEntry = NULL;
313 PTASK_SLOT TaskSlot = NULL;
315 spin_lock(&(cfs_win_task_manger.Lock));
317 ListEntry = cfs_win_task_manger.TaskList.Flink;
318 while (ListEntry != (&(cfs_win_task_manger.TaskList))) {
320 TaskSlot = CONTAINING_RECORD(ListEntry, TASK_SLOT, Link);
321 if (TaskSlot->Pid == Pid && TaskSlot->Tid == Tid) {
322 if (TaskSlot->Tet != Tet) {
325 // The old thread was already exit. This must be a
326 // new thread which get the same Tid to the previous.
335 if (TaskSlot->Pid > Pid) {
338 } else if (TaskSlot->Pid == Pid) {
339 if (TaskSlot->Tid > Tid) {
347 ListEntry = ListEntry->Flink;
352 /* allocate new task slot */
353 TaskSlot = alloc_task_slot();
355 cfs_enter_debugger();
359 /* set task slot IDs */
360 init_task_slot(TaskSlot);
364 TaskSlot->task.pid = (pid_t)cfs_idr_get_new(cfs_win_task_slot_idp, Tet);
366 if (ListEntry == (&(cfs_win_task_manger.TaskList))) {
368 // Empty case or the biggest case, put it to the tail.
370 InsertTailList(&(cfs_win_task_manger.TaskList), &(TaskSlot->Link));
373 // Get a slot and smaller than it's tid, put it just before.
375 InsertHeadList(ListEntry->Blink, &(TaskSlot->Link));
378 cfs_win_task_manger.NumOfTasks++;
382 // To Check whether he task structures are arranged in the expected order ?
386 PTASK_SLOT Prev = NULL, Curr = NULL;
388 ListEntry = cfs_win_task_manger.TaskList.Flink;
390 while (ListEntry != (&(cfs_win_task_manger.TaskList))) {
392 Curr = CONTAINING_RECORD(ListEntry, TASK_SLOT, Link);
393 ListEntry = ListEntry->Flink;
396 if (Prev->Pid > Curr->Pid) {
397 cfs_enter_debugger();
398 } else if (Prev->Pid == Curr->Pid) {
399 if (Prev->Tid > Curr->Tid) {
400 cfs_enter_debugger();
411 spin_unlock(&(cfs_win_task_manger.Lock));
414 cfs_enter_debugger();
418 return (&(TaskSlot->task));
421 /* deschedule for a bit... */
423 cfs_pause(cfs_duration_t ticks)
425 cfs_schedule_timeout_and_set_state(CFS_TASK_UNINTERRUPTIBLE, ticks);
429 cfs_schedule_timeout_and_set_state(cfs_task_state_t state, int64_t time)
431 cfs_task_t * task = cfs_current();
432 PTASK_SLOT slot = NULL;
435 cfs_enter_debugger();
439 slot = CONTAINING_RECORD(task, TASK_SLOT, task);
440 cfs_assert(slot->Magic == TASKSLT_MAGIC);
442 if (time == CFS_MAX_SCHEDULE_TIMEOUT) {
446 cfs_wait_event_internal(&(slot->Event), time);
452 cfs_schedule_timeout_and_set_state(CFS_TASK_UNINTERRUPTIBLE, 0);
460 PTASK_SLOT slot = NULL;
463 cfs_enter_debugger();
467 slot = CONTAINING_RECORD(task, TASK_SLOT, task);
468 cfs_assert(slot->Magic == TASKSLT_MAGIC);
470 cfs_wake_event(&(slot->Event));
476 sleep_on(cfs_waitq_t *waitq)
480 cfs_waitlink_init(&link);
481 cfs_waitq_add(waitq, &link);
482 cfs_waitq_wait(&link, CFS_TASK_INTERRUPTIBLE);
483 cfs_waitq_del(waitq, &link);
486 EXPORT_SYMBOL(cfs_curproc_uid);
487 EXPORT_SYMBOL(cfs_curproc_pid);
488 EXPORT_SYMBOL(cfs_curproc_gid);
489 EXPORT_SYMBOL(cfs_curproc_fsuid);
490 EXPORT_SYMBOL(cfs_curproc_fsgid);
491 EXPORT_SYMBOL(cfs_curproc_umask);
492 EXPORT_SYMBOL(cfs_curproc_comm);
493 EXPORT_SYMBOL(cfs_curproc_groups_nr);
494 EXPORT_SYMBOL(cfs_curproc_groups_dump);
495 EXPORT_SYMBOL(cfs_curproc_is_in_groups);
496 EXPORT_SYMBOL(cfs_cap_raise);
497 EXPORT_SYMBOL(cfs_cap_lower);
498 EXPORT_SYMBOL(cfs_cap_raised);
499 EXPORT_SYMBOL(cfs_curproc_cap_pack);
500 EXPORT_SYMBOL(cfs_curproc_cap_unpack);
501 EXPORT_SYMBOL(cfs_capable);