list.h File Reference

Go to the source code of this file.

Classes
struct	list_node
struct	list

Macros
#define	TRUE   1
#define	FALSE   0

Functions
void	init_list (struct list *l, int keysize)
struct list_node *	add_elem (struct list *l, void *elem)
void	delete_node (struct list *l, struct list_node *node)
void	destroy_node (struct list *l, struct list_node *node)
int	is_empty_list (struct list *l)
int	get_list_count (struct list *l)
void *	first_elem (struct list *l)
struct list_node *	first_node (struct list *l)
void *	last_elem (struct list *l)
struct list_node *	last_node (struct list *l)
struct list_node *	xlocate_node (struct list *l, void *elem, int offset, int length)
void *	xlocate_elem (struct list *l, void *elem, int offset, int length)
struct list_node *	locate_node (struct list *l, void *elem)
void *	locate_elem (struct list *l, void *elem)
void	clear_list (struct list *l)
void	destroy_list (struct list *l)

Macro Definition Documentation

FALSE

#define FALSE   0

Definition at line 28 of file list.h.

TRUE

#define TRUE   1

cpulimit - a CPU limiter for Linux

Copyright (C) 2005-2012, by: Angelo Marletta <angelo dot marletta at gmail dot com>

This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.

Definition at line 27 of file list.h.

Function Documentation

add_elem()

struct list_node * add_elem	(	struct list *	l,
		void *	elem
	)

clear_list()

void clear_list

(

struct list *

l

)

delete_node()

void delete_node	(	struct list *	l,
		struct list_node *	node
	)

destroy_list()

void destroy_list

(

struct list *

l

)

destroy_node()

void destroy_node	(	struct list *	l,
		struct list_node *	node
	)

first_elem()

void * first_elem

(

struct list *

l

)

first_node()

struct list_node * first_node

(

struct list *

l

)

get_list_count()

int get_list_count

(

struct list *

l

)

init_list()

void init_list	(	struct list *	l,
		int	keysize
	)

is_empty_list()

int is_empty_list

(

struct list *

l

)

last_elem()

void * last_elem

(

struct list *

l

)

last_node()

struct list_node * last_node

(

struct list *

l

)

locate_elem()

void * locate_elem	(	struct list *	l,
		void *	elem
	)

locate_node()

struct list_node * locate_node	(	struct list *	l,
		void *	elem
	)

xlocate_elem()

void * xlocate_elem	(	struct list *	l,
		void *	elem,
		int	offset,
		int	length
	)

xlocate_node()

struct list_node * xlocate_node	(	struct list *	l,
		void *	elem,
		int	offset,
		int	length
	)