/****************************************************************************
*
-** Copyright (C) 2014 Cisco and/or its affiliates. All rights reserved.
+ * Copyright (C) 2014 Cisco and/or its affiliates. All rights reserved.
* Copyright (C) 2003-2013 Sourcefire, Inc.
*
* This program is free software; you can redistribute it and/or modify
/*
* Linked List Interface
*/
-SF_LIST * sflist_new ( void );
-void sflist_init ( SF_LIST*);
-int sflist_add_tail ( SF_LIST*, NODE_DATA);
-int sflist_add_head ( SF_LIST*, NODE_DATA);
-int sflist_add_before ( SF_LIST*, SF_LNODE*, NODE_DATA);
-int sflist_add_after ( SF_LIST*, SF_LNODE*, NODE_DATA);
-NODE_DATA sflist_remove_head ( SF_LIST*);
-NODE_DATA sflist_remove_tail ( SF_LIST*);
-void sflist_remove_node (SF_LIST*, SF_LNODE*);
-int sflist_count ( SF_LIST*);
+SF_LIST * sflist_new(void);
+void sflist_init(SF_LIST*);
+int sflist_add_tail(SF_LIST*, NODE_DATA);
+int sflist_add_head(SF_LIST*, NODE_DATA);
+int sflist_add_before(SF_LIST*, SF_LNODE*, NODE_DATA);
+int sflist_add_after(SF_LIST*, SF_LNODE*, NODE_DATA);
+NODE_DATA sflist_remove_head(SF_LIST*);
+NODE_DATA sflist_remove_tail(SF_LIST*);
+void sflist_remove_node(SF_LIST*, SF_LNODE*);
+int sflist_count(SF_LIST*);
NODE_DATA sflist_first(SF_LIST*, SF_LNODE**);
NODE_DATA sflist_next(SF_LNODE**);
-void sflist_free ( SF_LIST*);
-void sflist_free_all( SF_LIST*, void (*free)(void*) );
+void sflist_free(SF_LIST*);
+void sflist_free_all(SF_LIST*, void (*free)(void*) );
void sflist_static_free_all(SF_LIST*, void(*nfree)(void *));
void sflist_static_free(SF_LIST*);
/*
* Stack Interface ( LIFO - Last in, First out )
*/
-SF_STACK *sfstack_new ( void );
-int sfstack_add( SF_STACK*, NODE_DATA);
-NODE_DATA sfstack_remove ( SF_STACK*);
-int sfstack_count ( SF_STACK*);
-void sfstack_free ( SF_STACK*);
-void sfstack_free_all( SF_STACK*, void (*free)(void*) );
+SF_STACK *sfstack_new(void);
+int sfstack_add(SF_STACK*, NODE_DATA);
+NODE_DATA sfstack_remove(SF_STACK*);
+int sfstack_count(SF_STACK*);
+void sfstack_free(SF_STACK*);
+void sfstack_free_all(SF_STACK*, void (*free)(void*) );
void sfstack_static_free_all(SF_STACK*, void (*nfree)(void *));
void sfstack_static_free(SF_STACK*);
/*
* Queue Interface ( FIFO - First in, First out )
*/
-SF_QUEUE *sfqueue_new ( void );
-int sfqueue_add( SF_QUEUE*, NODE_DATA);
-NODE_DATA sfqueue_remove ( SF_QUEUE*);
-int sfqueue_count ( SF_QUEUE*);
-void sfqueue_free ( SF_QUEUE*);
-void sfqueue_free_all( SF_QUEUE*, void (*free)(void*) );
+SF_QUEUE *sfqueue_new(void);
+int sfqueue_add(SF_QUEUE*, NODE_DATA);
+NODE_DATA sfqueue_remove(SF_QUEUE*);
+int sfqueue_count(SF_QUEUE*);
+void sfqueue_free(SF_QUEUE*);
+void sfqueue_free_all(SF_QUEUE*, void (*free)(void*) );
void sfqueue_static_free_all(SF_QUEUE*,void (*nfree)(void *));
void sfqueue_static_free(SF_QUEUE*);
* user provided array storage, perhaps from the program stack or a global.
* These are efficient, and use no memory functions.
*/
-int sfistack_init( SF_ISTACK*, unsigned * a, unsigned n );
-int sfistack_push( SF_ISTACK*, unsigned value);
-int sfistack_pop( SF_ISTACK*, unsigned * value);
+int sfistack_init(SF_ISTACK*, unsigned * a, unsigned n );
+int sfistack_push(SF_ISTACK*, unsigned value);
+int sfistack_pop( SF_ISTACK*, unsigned * value);
-int sfpstack_init( SF_PSTACK*, void ** a, unsigned n );
-int sfpstack_push( SF_PSTACK*, void * value);
-int sfpstack_pop( SF_PSTACK*, void ** value);
+int sfpstack_init(SF_PSTACK*, void ** a, unsigned n );
+int sfpstack_push(SF_PSTACK*, void * value);
+int sfpstack_pop( SF_PSTACK*, void ** value);
#endif