+ }
+ initialized = 0;
+}
+
+/**
+ * Get the list of all registered tasks.
+ *
+ * \return The task list.
+ *
+ * Each entry of the list contains an identifier which is simply a hex number.
+ * The result is dynamically allocated and must be freed by the caller.
+ */
+char *get_task_list(void)
+{
+ struct task *t, *tmp;
+ char *msg = NULL;
+
+ if (!initialized)
+ return NULL;
+ list_for_each_entry_safe(t, tmp, &pre_select_list, pre_select_node) {
+ char *tmp_msg;
+ tmp_msg = make_message("%s%p\tpre\t%s\n", msg? msg : "", t, t->status);
+ free(msg);
+ msg = tmp_msg;
+ }
+ list_for_each_entry_safe(t, tmp, &post_select_list, post_select_node) {
+ char *tmp_msg;
+// if (t->pre_select)
+// continue;
+ tmp_msg = make_message("%s%p\tpost\t%s\n", msg? msg : "", t, t->status);
+ free(msg);
+ msg = tmp_msg;
+ }
+ //PARA_DEBUG_LOG("task list:\n%s", msg);
+ return msg;
+}
+
+/**
+ * Set the select timeout to the minimal possible value.
+ *
+ * \param s Pointer to the scheduler struct.
+ *
+ * This causes the next select() call to return immediately.
+ */
+void sched_min_delay(struct sched *s)
+{
+ s->select_timeout.tv_sec = 0;
+ s->select_timeout.tv_usec = 1;
+}
+
+/**
+ * Impose an upper bound for the timeout of the next select() call.
+ *
+ * \param to Maximal allowed timeout.
+ * \param s Pointer to the scheduler struct.
+ *
+ * If the current scheduler timeout is already smaller than \a to, this
+ * function does nothing. Otherwise the timeout for the next select() call is
+ * set to the given value.
+ *
+ * \sa sched_request_timeout_ms().
+ */
+void sched_request_timeout(struct timeval *to, struct sched *s)
+{
+ if (tv_diff(&s->select_timeout, to, NULL) > 0)
+ s->select_timeout = *to;
+}