2 * Copyright (C) 2006 Andre Noll <maan@systemlinux.org>
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation; either version 2 of the License, or
7 * (at your option) any later version.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111, USA.
19 /** \file sched.c paraslash's scheduling functions */
31 * The scheduler manages two lists of tasks. The pre_select list contains
32 * pointers to functions that are called before calling select() from the main
33 * loop. Similarly, \a post_select_list is a list of function pointers each of
34 * which is called after the select call.
36 struct list_head pre_select_list
, post_select_list
;
38 static struct timeval now_struct
;
40 struct timeval
*now
= &now_struct
;
42 static void sched_preselect(struct sched
*s
)
46 list_for_each_entry_safe(t
, tmp
, &pre_select_list
, pre_select_node
) {
48 // PARA_INFO_LOG("%s \n", t->status);
51 if (!t
->event_handler
)
58 static void sched_post_select(struct sched
*s
)
62 list_for_each_entry_safe(t
, tmp
, &post_select_list
, post_select_node
) {
64 // PARA_INFO_LOG("%s: %d\n", t->status, t->ret);
65 if (t
->ret
> 0 || !t
->event_handler
)
72 * the core function for all paraslash programs
74 * Short and sweet. It updates the global \a now pointer, calls all registered
75 * pre_select hooks which may set the timeout and add any file descriptors to
76 * the fd sets of \a s. Next, it calls para_select() and makes the result available
77 * to the registered tasks by calling their post_select hook.
79 * \return Zero if no more tasks are left in either of the two lists, negative
80 * if para_select returned an error.
84 int sched(struct sched
*s
)
87 gettimeofday(now
, NULL
);
91 s
->timeout
= s
->default_timeout
;
94 s
->select_ret
= para_select(s
->max_fileno
+ 1, &s
->rfds
,
95 &s
->wfds
, &s
->timeout
);
96 if (s
->select_ret
< 0)
98 gettimeofday(now
, NULL
);
100 if (list_empty(&pre_select_list
) && list_empty(&post_select_list
))
106 * add a task to the scheduler
108 * \param t the task to add
110 * If the pre_select pointer of \a t is not \p NULL, it is added to
111 * the pre_select list of the scheduler. Same goes for post_select.
113 * \sa task::pre_select, task::post_select
115 void register_task(struct task
*t
)
117 PARA_INFO_LOG("registering %s (%p)\n", t
->status
, t
);
119 PARA_DEBUG_LOG("pre_select: %p\n", &t
->pre_select
);
120 list_add(&t
->pre_select_node
, &pre_select_list
);
122 if (t
->post_select
) {
123 PARA_DEBUG_LOG("post_select: %p\n", &t
->pre_select
);
124 list_add(&t
->post_select_node
, &post_select_list
);
129 * remove a task from the scheduler
131 * \param t the task to remove
133 * If the pre_select pointer of \a t is not \p NULL, it is removed from
134 * the pre_select list of the scheduler. Same goes for \a post_select.
136 void unregister_task(struct task
*t
)
138 PARA_INFO_LOG("unregistering %s (%p)\n", t
->status
, t
);
140 list_del(&t
->pre_select_node
);
142 list_del(&t
->post_select_node
);
146 * initialize the paraslash scheduler
148 void init_sched(void)
150 INIT_LIST_HEAD(&pre_select_list
);
151 INIT_LIST_HEAD(&post_select_list
);
155 * unregister all tasks
157 * This will cause \a sched() to return immediately because both the
158 * \a pre_select_list and the \a post_select_list are empty.
160 void sched_shutdown(void)
162 struct task
*t
, *tmp
;
164 list_for_each_entry_safe(t
, tmp
, &pre_select_list
, pre_select_node
)
166 /* remove tasks which do not have a pre_select hook */
167 list_for_each_entry_safe(t
, tmp
, &post_select_list
, post_select_node
)
172 * get the list of all registered tasks.
174 * \return the task list
176 * Each entry of the list contains an identifier which is simply a hex number
177 * that may be used in \a kill_task() to terminate the task.
178 * The result ist dynamically allocated and must be freed by the caller.
180 char *get_task_list(void)
182 struct task
*t
, *tmp
;
184 list_for_each_entry_safe(t
, tmp
, &pre_select_list
, pre_select_node
) {
186 tmp_msg
= make_message("%s%p\tpre\t%s\n", msg
? msg
: "", t
, t
->status
);
190 list_for_each_entry_safe(t
, tmp
, &post_select_list
, post_select_node
) {
192 // if (t->pre_select)
194 tmp_msg
= make_message("%s%p\tpost\t%s\n", msg
? msg
: "", t
, t
->status
);
198 //PARA_DEBUG_LOG("task list:\n%s", msg);
203 * simulate an error for the given task
205 * \param id the task identifier
207 * Find the task identified by \a id, set the tasks' return value to
208 * \p -E_TASK_KILLED and call the event handler of the task.
210 * \return Positive on sucess, negative if \a id does not correspond to a
213 int kill_task(char *id
)
215 struct task
*t
, *tmp
;
217 list_for_each_entry_safe(t
, tmp
, &pre_select_list
, pre_select_node
) {
218 sprintf(buf
, "%p", t
);
221 t
->ret
= -E_TASK_KILLED
;
222 if (t
->event_handler
)
226 list_for_each_entry_safe(t
, tmp
, &post_select_list
, post_select_node
) {
227 sprintf(buf
, "%p", t
);
230 t
->ret
= -E_TASK_KILLED
;
231 if (t
->event_handler
)
235 return -E_NO_SUCH_TASK
;