2 * FCRON - periodic command scheduler
4 * Copyright 2000-2014 Thibault Godouet <fcron@free.fr>
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 * The GNU General Public License can also be found in the file
21 * `LICENSE' that comes with the fcron source distribution.
25 /* List of jobs waiting for an appropriate system load average to be executed.
26 * This is a wrapper for an u_list (unordered list) (see u_list.h and u_list.c),
27 * to make the rest of the code clearer and as a way to ensure the compiler can checks
28 * the type in the rest of the code (u_list extensively uses the void type) */
32 #include "lavg_list.h"
38 (lavg_list_t *) u_list_init(sizeof(lavg_t), LAVG_INITIAL_SIZE,
40 l->max_entries = LAVG_QUEUE_MAX;
45 lavg_list_add_line(lavg_list_t * list, struct cl_t * line)
47 lavg_t e = { NULL, 0 };
48 e.l_line = line; /* ANSI C does not allow us to directly replace NULL by line above */
50 return (lavg_t *) u_list_add((u_list_t *) list, (u_list_entry_t *) & e);
54 lavg_list_add(lavg_list_t * list, lavg_t * entry)
56 return (lavg_t *) u_list_add((u_list_t *) list, (u_list_entry_t *) entry);
60 lavg_list_first(lavg_list_t * list)
62 return (lavg_t *) u_list_first((u_list_t *) list);
66 lavg_list_next(lavg_list_t * list)
68 return (lavg_t *) u_list_next((u_list_t *) list);
72 lavg_list_end_iteration(lavg_list_t * list)
74 u_list_end_iteration((u_list_t *) list);
78 lavg_list_remove_cur(lavg_list_t * list)
80 u_list_remove_cur((u_list_t *) list);
84 lavg_list_destroy(lavg_list_t * list)
86 return (lavg_list_t *) u_list_destroy((u_list_t *) list);