WebSVN – HelenOS-historic – Diff – /kernel/trunk/generic/src/proc/task.c


/*
 * Copyright (C) 2001-2004 Jakub Jermar
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - 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.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * 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.
 */
 
/**
 * @file    task.c
 * @brief   Task management.
 */
 
#include <main/uinit.h>
#include <proc/thread.h>
#include <proc/task.h>
#include <proc/uarg.h>
#include <mm/as.h>
#include <mm/slab.h>
#include <synch/spinlock.h>
#include <arch.h>
#include <panic.h>
#include <adt/btree.h>
#include <adt/list.h>
#include <ipc/ipc.h>
#include <security/cap.h>
#include <memstr.h>
#include <print.h>
#include <elf.h>
#include <syscall/copy.h>
 
#ifndef LOADED_PROG_STACK_PAGES_NO
#define LOADED_PROG_STACK_PAGES_NO 1
#endif
 
SPINLOCK_INITIALIZE(tasks_lock);
btree_t tasks_btree;
static task_id_t task_counter = 0;
 
/** Initialize tasks
 *
 * Initialize kernel tasks support.
 *
 */
void task_init(void)
{
    TASK = NULL;
    btree_create(&tasks_btree);
}
 
 
/** Create new task
 *
 * Create new task with no threads.
 *
 * @param as Task's address space.
 * @param name Symbolic name.
 *
 * @return New task's structure
 *
 */
task_t *task_create(as_t *as, char *name)
{
    ipl_t ipl;
    task_t *ta;
    int i;
   
    ta = (task_t *) malloc(sizeof(task_t), 0);
 
    task_create_arch(ta);
 
    spinlock_initialize(&ta->lock, "task_ta_lock");
    list_initialize(&ta->th_head);
    ta->as = as;
    ta->name = name;
 
    ta->capabilities = 0;
   
    ipc_answerbox_init(&ta->answerbox);
    for (i=0; i < IPC_MAX_PHONES;i++)
        ipc_phone_init(&ta->phones[i]);
    if (ipc_phone_0)
        ipc_phone_connect(&ta->phones[0], ipc_phone_0);
    atomic_set(&ta->active_calls, 0);
 
    mutex_initialize(&ta->futexes_lock);
    btree_create(&ta->futexes);
   
    ipl = interrupts_disable();
    spinlock_lock(&tasks_lock);
 
    ta->taskid = ++task_counter;
    btree_insert(&tasks_btree, (btree_key_t) ta->taskid, (void *) ta, NULL);
 
    spinlock_unlock(&tasks_lock);
    interrupts_restore(ipl);
 
    return ta;
}
 
/** Create new task with 1 thread and run it
 *
 * @param program_addr Address of program executable image.
 * @param name Program name.
 *
 * @return Task of the running program or NULL on error.
 */
task_t * task_run_program(void *program_addr, char *name)
{
    as_t *as;
    as_area_t *a;
    int rc;
    thread_t *t;
    task_t *task;
    uspace_arg_t *kernel_uarg;
 
    as = as_create(0);
    ASSERT(as);
 
    rc = elf_load((elf_header_t *) program_addr, as);
    if (rc != EE_OK) {
        as_free(as);
        return NULL;
    }
   
    kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
    kernel_uarg->uspace_entry = (void *) ((elf_header_t *) program_addr)->e_entry;
    kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;
    kernel_uarg->uspace_thread_function = NULL;
    kernel_uarg->uspace_thread_arg = NULL;
    kernel_uarg->uspace_uarg = NULL;
   
    task = task_create(as, name);
    ASSERT(task);
 
    /*
     * Create the data as_area.
     */
    a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE | AS_AREA_CACHEABLE,
        LOADED_PROG_STACK_PAGES_NO*PAGE_SIZE,
        USTACK_ADDRESS, AS_AREA_ATTR_NONE, &anon_backend, NULL);
 
    t = thread_create(uinit, kernel_uarg, task, 0, "uinit");
    ASSERT(t);
    thread_ready(t);
   
    return task;
}
 
/** Syscall for reading task ID from userspace.
 *
 * @param uspace_task_id Userspace address of 8-byte buffer where to store current task ID.
 *
 * @return 0 on success or an error code from @ref errno.h.
 */
__native sys_task_get_id(task_id_t *uspace_task_id)
{
    /*
     * No need to acquire lock on TASK because taskid
     * remains constant for the lifespan of the task.
     */
    return (__native) copy_to_uspace(uspace_task_id, &TASK->taskid, sizeof(TASK->taskid));
}
 
/** Find task structure corresponding to task ID.
 *
 * The tasks_lock must be already held by the caller of this function
 * and interrupts must be disabled.
 *
 * @param id Task ID.
 *
 * @return Task structure address or NULL if there is no such task ID.
 */
task_t *task_find_by_id(task_id_t id)
{
    btree_node_t *leaf;
   
    return (task_t *) btree_search(&tasks_btree, (btree_key_t) id, &leaf);
}
 
/** Print task list */
void task_print_list(void)
{
    link_t *cur;
    ipl_t ipl;
   
    /* Messing with thread structures, avoid deadlock */
    ipl = interrupts_disable();
    spinlock_lock(&tasks_lock);
 
    for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) {
        btree_node_t *node;
        int i;
       
        node = list_get_instance(cur, btree_node_t, leaf_link);
        for (i = 0; i < node->keys; i++) {
            task_t *t;
            int j;
 
            t = (task_t *) node->value[i];
       
            spinlock_lock(&t->lock);
            printf("%s: address=%#zX, taskid=%#llX, as=%#zX, ActiveCalls: %zd",
                t->name, t, t->taskid, t->as, atomic_get(&t->active_calls));
            for (j=0; j < IPC_MAX_PHONES; j++) {
                if (t->phones[j].callee)
                    printf(" Ph(%zd): %#zX ", j, t->phones[j].callee);
            }
            printf("\n");
            spinlock_unlock(&t->lock);
        }
    }
 
    spinlock_unlock(&tasks_lock);
    interrupts_restore(ipl);
}
 

Rev 1424	Rev 1460
1	/*	1	/*
2	* Copyright (C) 2001-2004 Jakub Jermar	2	* Copyright (C) 2001-2004 Jakub Jermar
3	* All rights reserved.	3	* All rights reserved.
4	*	4	*
5	* Redistribution and use in source and binary forms, with or without	5	* Redistribution and use in source and binary forms, with or without
6	* modification, are permitted provided that the following conditions	6	* modification, are permitted provided that the following conditions
7	* are met:	7	* are met:
8	*	8	*
9	* - Redistributions of source code must retain the above copyright	9	* - Redistributions of source code must retain the above copyright
10	* notice, this list of conditions and the following disclaimer.	10	* notice, this list of conditions and the following disclaimer.
11	* - Redistributions in binary form must reproduce the above copyright	11	* - Redistributions in binary form must reproduce the above copyright
12	* notice, this list of conditions and the following disclaimer in the	12	* notice, this list of conditions and the following disclaimer in the
13	* documentation and/or other materials provided with the distribution.	13	* documentation and/or other materials provided with the distribution.
14	* - The name of the author may not be used to endorse or promote products	14	* - The name of the author may not be used to endorse or promote products
15	* derived from this software without specific prior written permission.	15	* derived from this software without specific prior written permission.
16	*	16	*
17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR	17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES	18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.	19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,	20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT	21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,	22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY	23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT	24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF	25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.	26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27	*/	27	*/
28		28
29	/**	29	/**
30	* @file task.c	30	* @file task.c
31	* @brief Task management.	31	* @brief Task management.
32	*/	32	*/
33		33
34	#include <main/uinit.h>	34	#include <main/uinit.h>
35	#include <proc/thread.h>	35	#include <proc/thread.h>
36	#include <proc/task.h>	36	#include <proc/task.h>
37	#include <proc/uarg.h>	37	#include <proc/uarg.h>
38	#include <mm/as.h>	38	#include <mm/as.h>
39	#include <mm/slab.h>	39	#include <mm/slab.h>
40	#include <synch/spinlock.h>	40	#include <synch/spinlock.h>
41	#include <arch.h>	41	#include <arch.h>
42	#include <panic.h>	42	#include <panic.h>
43	#include <adt/btree.h>	43	#include <adt/btree.h>
44	#include <adt/list.h>	44	#include <adt/list.h>
45	#include <ipc/ipc.h>	45	#include <ipc/ipc.h>
46	#include <security/cap.h>	46	#include <security/cap.h>
47	#include <memstr.h>	47	#include <memstr.h>
48	#include <print.h>	48	#include <print.h>
49	#include <elf.h>	49	#include <elf.h>
50	#include <syscall/copy.h>	50	#include <syscall/copy.h>
51		51
52	#ifndef LOADED_PROG_STACK_PAGES_NO	52	#ifndef LOADED_PROG_STACK_PAGES_NO
53	#define LOADED_PROG_STACK_PAGES_NO 1	53	#define LOADED_PROG_STACK_PAGES_NO 1
54	#endif	54	#endif
55		55
56	SPINLOCK_INITIALIZE(tasks_lock);	56	SPINLOCK_INITIALIZE(tasks_lock);
57	btree_t tasks_btree;	57	btree_t tasks_btree;
58	static task_id_t task_counter = 0;	58	static task_id_t task_counter = 0;
59		59
60	/** Initialize tasks	60	/** Initialize tasks
61	*	61	*
62	* Initialize kernel tasks support.	62	* Initialize kernel tasks support.
63	*	63	*
64	*/	64	*/
65	void task_init(void)	65	void task_init(void)
66	{	66	{
67	TASK = NULL;	67	TASK = NULL;
68	btree_create(&tasks_btree);	68	btree_create(&tasks_btree);
69	}	69	}
70		70
71		71
72	/** Create new task	72	/** Create new task
73	*	73	*
74	* Create new task with no threads.	74	* Create new task with no threads.
75	*	75	*
76	* @param as Task's address space.	76	* @param as Task's address space.
77	* @param name Symbolic name.	77	* @param name Symbolic name.
78	*	78	*
79	* @return New task's structure	79	* @return New task's structure
80	*	80	*
81	*/	81	*/
82	task_t task_create(as_t as, char *name)	82	task_t task_create(as_t as, char *name)
83	{	83	{
84	ipl_t ipl;	84	ipl_t ipl;
85	task_t *ta;	85	task_t *ta;
86	int i;	86	int i;
87		87
88	ta = (task_t *) malloc(sizeof(task_t), 0);	88	ta = (task_t *) malloc(sizeof(task_t), 0);
89		89
90	task_create_arch(ta);	90	task_create_arch(ta);
91		91
92	spinlock_initialize(&ta->lock, "task_ta_lock");	92	spinlock_initialize(&ta->lock, "task_ta_lock");
93	list_initialize(&ta->th_head);	93	list_initialize(&ta->th_head);
94	ta->as = as;	94	ta->as = as;
95	ta->name = name;	95	ta->name = name;
96		96
97	ta->capabilities = 0;	97	ta->capabilities = 0;
98		98
99	ipc_answerbox_init(&ta->answerbox);	99	ipc_answerbox_init(&ta->answerbox);
100	for (i=0; i < IPC_MAX_PHONES;i++)	100	for (i=0; i < IPC_MAX_PHONES;i++)
101	ipc_phone_init(&ta->phones[i]);	101	ipc_phone_init(&ta->phones[i]);
102	if (ipc_phone_0)	102	if (ipc_phone_0)
103	ipc_phone_connect(&ta->phones[0], ipc_phone_0);	103	ipc_phone_connect(&ta->phones[0], ipc_phone_0);
104	atomic_set(&ta->active_calls, 0);	104	atomic_set(&ta->active_calls, 0);
-		105
-		106	mutex_initialize(&ta->futexes_lock);
-		107	btree_create(&ta->futexes);
105		108
106	ipl = interrupts_disable();	109	ipl = interrupts_disable();
107	spinlock_lock(&tasks_lock);	110	spinlock_lock(&tasks_lock);
108		111
109	ta->taskid = ++task_counter;	112	ta->taskid = ++task_counter;
110	btree_insert(&tasks_btree, (btree_key_t) ta->taskid, (void *) ta, NULL);	113	btree_insert(&tasks_btree, (btree_key_t) ta->taskid, (void *) ta, NULL);
111		114
112	spinlock_unlock(&tasks_lock);	115	spinlock_unlock(&tasks_lock);
113	interrupts_restore(ipl);	116	interrupts_restore(ipl);
114		117
115	return ta;	118	return ta;
116	}	119	}
117		120
118	/** Create new task with 1 thread and run it	121	/** Create new task with 1 thread and run it
119	*	122	*
120	* @param program_addr Address of program executable image.	123	* @param program_addr Address of program executable image.
121	* @param name Program name.	124	* @param name Program name.
122	*	125	*
123	* @return Task of the running program or NULL on error.	126	* @return Task of the running program or NULL on error.
124	*/	127	*/
125	task_t * task_run_program(void program_addr, char name)	128	task_t * task_run_program(void program_addr, char name)
126	{	129	{
127	as_t *as;	130	as_t *as;
128	as_area_t *a;	131	as_area_t *a;
129	int rc;	132	int rc;
130	thread_t *t;	133	thread_t *t;
131	task_t *task;	134	task_t *task;
132	uspace_arg_t *kernel_uarg;	135	uspace_arg_t *kernel_uarg;
133		136
134	as = as_create(0);	137	as = as_create(0);
135	ASSERT(as);	138	ASSERT(as);
136		139
137	rc = elf_load((elf_header_t *) program_addr, as);	140	rc = elf_load((elf_header_t *) program_addr, as);
138	if (rc != EE_OK) {	141	if (rc != EE_OK) {
139	as_free(as);	142	as_free(as);
140	return NULL;	143	return NULL;
141	}	144	}
142		145
143	kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);	146	kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
144	kernel_uarg->uspace_entry = (void ) ((elf_header_t ) program_addr)->e_entry;	147	kernel_uarg->uspace_entry = (void ) ((elf_header_t ) program_addr)->e_entry;
145	kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;	148	kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;
146	kernel_uarg->uspace_thread_function = NULL;	149	kernel_uarg->uspace_thread_function = NULL;
147	kernel_uarg->uspace_thread_arg = NULL;	150	kernel_uarg->uspace_thread_arg = NULL;
148	kernel_uarg->uspace_uarg = NULL;	151	kernel_uarg->uspace_uarg = NULL;
149		152
150	task = task_create(as, name);	153	task = task_create(as, name);
151	ASSERT(task);	154	ASSERT(task);
152		155
153	/*	156	/*
154	* Create the data as_area.	157	* Create the data as_area.
155	*/	158	*/
156	a = as_area_create(as, AS_AREA_READ \| AS_AREA_WRITE \| AS_AREA_CACHEABLE,	159	a = as_area_create(as, AS_AREA_READ \| AS_AREA_WRITE \| AS_AREA_CACHEABLE,
157	LOADED_PROG_STACK_PAGES_NO*PAGE_SIZE,	160	LOADED_PROG_STACK_PAGES_NO*PAGE_SIZE,
158	USTACK_ADDRESS, AS_AREA_ATTR_NONE, &anon_backend, NULL);	161	USTACK_ADDRESS, AS_AREA_ATTR_NONE, &anon_backend, NULL);
159		162
160	t = thread_create(uinit, kernel_uarg, task, 0, "uinit");	163	t = thread_create(uinit, kernel_uarg, task, 0, "uinit");
161	ASSERT(t);	164	ASSERT(t);
162	thread_ready(t);	165	thread_ready(t);
163		166
164	return task;	167	return task;
165	}	168	}
166		169
167	/** Syscall for reading task ID from userspace.	170	/** Syscall for reading task ID from userspace.
168	*	171	*
169	* @param uspace_task_id Userspace address of 8-byte buffer where to store current task ID.	172	* @param uspace_task_id Userspace address of 8-byte buffer where to store current task ID.
170	*	173	*
171	* @return 0 on success or an error code from @ref errno.h.	174	* @return 0 on success or an error code from @ref errno.h.
172	*/	175	*/
173	__native sys_task_get_id(task_id_t *uspace_task_id)	176	__native sys_task_get_id(task_id_t *uspace_task_id)
174	{	177	{
175	/*	178	/*
176	* No need to acquire lock on TASK because taskid	179	* No need to acquire lock on TASK because taskid
177	* remains constant for the lifespan of the task.	180	* remains constant for the lifespan of the task.
178	*/	181	*/
179	return (__native) copy_to_uspace(uspace_task_id, &TASK->taskid, sizeof(TASK->taskid));	182	return (__native) copy_to_uspace(uspace_task_id, &TASK->taskid, sizeof(TASK->taskid));
180	}	183	}
181		184
182	/** Find task structure corresponding to task ID.	185	/** Find task structure corresponding to task ID.
183	*	186	*
184	* The tasks_lock must be already held by the caller of this function	187	* The tasks_lock must be already held by the caller of this function
185	* and interrupts must be disabled.	188	* and interrupts must be disabled.
186	*	189	*
187	* @param id Task ID.	190	* @param id Task ID.
188	*	191	*
189	* @return Task structure address or NULL if there is no such task ID.	192	* @return Task structure address or NULL if there is no such task ID.
190	*/	193	*/
191	task_t *task_find_by_id(task_id_t id)	194	task_t *task_find_by_id(task_id_t id)
192	{	195	{
193	btree_node_t *leaf;	196	btree_node_t *leaf;
194		197
195	return (task_t *) btree_search(&tasks_btree, (btree_key_t) id, &leaf);	198	return (task_t *) btree_search(&tasks_btree, (btree_key_t) id, &leaf);
196	}	199	}
197		200
198	/** Print task list */	201	/** Print task list */
199	void task_print_list(void)	202	void task_print_list(void)
200	{	203	{
201	link_t *cur;	204	link_t *cur;
202	ipl_t ipl;	205	ipl_t ipl;
203		206
204	/* Messing with thread structures, avoid deadlock */	207	/* Messing with thread structures, avoid deadlock */
205	ipl = interrupts_disable();	208	ipl = interrupts_disable();
206	spinlock_lock(&tasks_lock);	209	spinlock_lock(&tasks_lock);
207		210
208	for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) {	211	for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) {
209	btree_node_t *node;	212	btree_node_t *node;
210	int i;	213	int i;
211		214
212	node = list_get_instance(cur, btree_node_t, leaf_link);	215	node = list_get_instance(cur, btree_node_t, leaf_link);
213	for (i = 0; i < node->keys; i++) {	216	for (i = 0; i < node->keys; i++) {
214	task_t *t;	217	task_t *t;
215	int j;	218	int j;
216		219
217	t = (task_t *) node->value[i];	220	t = (task_t *) node->value[i];
218		221
219	spinlock_lock(&t->lock);	222	spinlock_lock(&t->lock);
220	printf("%s: address=%#zX, taskid=%#llX, as=%#zX, ActiveCalls: %zd",	223	printf("%s: address=%#zX, taskid=%#llX, as=%#zX, ActiveCalls: %zd",
221	t->name, t, t->taskid, t->as, atomic_get(&t->active_calls));	224	t->name, t, t->taskid, t->as, atomic_get(&t->active_calls));
222	for (j=0; j < IPC_MAX_PHONES; j++) {	225	for (j=0; j < IPC_MAX_PHONES; j++) {
223	if (t->phones[j].callee)	226	if (t->phones[j].callee)
224	printf(" Ph(%zd): %#zX ", j, t->phones[j].callee);	227	printf(" Ph(%zd): %#zX ", j, t->phones[j].callee);
225	}	228	}
226	printf("\n");	229	printf("\n");
227	spinlock_unlock(&t->lock);	230	spinlock_unlock(&t->lock);
228	}	231	}
229	}	232	}
230		233
231	spinlock_unlock(&tasks_lock);	234	spinlock_unlock(&tasks_lock);
232	interrupts_restore(ipl);	235	interrupts_restore(ipl);
233	}	236	}
234		237

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/proc/task.c @ 1468 – Rev 1424 → 1460