Home
last modified time | relevance | path

Searched refs:linked_list (Results 1 – 25 of 885) sorted by relevance

12345678910>>...36

/dports/net-p2p/uhub/uhub-a8ee6e7/src/util/
H A Dlist.h23 struct linked_list struct
38 extern struct linked_list* list_create(); argument
39 extern void list_destroy(struct linked_list*);
49 extern void list_append_list(struct linked_list* list, struct linked_list* other);
56 extern size_t list_size(struct linked_list* list);
59 extern void* list_get_first(struct linked_list*);
60 extern void* list_get_last(struct linked_list*);
61 extern void* list_get_next(struct linked_list*);
62 extern void* list_get_prev(struct linked_list*);
64 extern struct node* list_get_first_node(struct linked_list*);
[all …]
H A Dlist.c22 struct linked_list* list_create() in list_create()
24 struct linked_list* list = NULL; in list_create()
25 list = (struct linked_list*) hub_malloc_zero(sizeof(struct linked_list)); in list_create()
32 void list_destroy(struct linked_list* list) in list_destroy()
60 memset(list, 0, sizeof(struct linked_list)); in list_clear()
88 void list_append_list(struct linked_list* list, struct linked_list* other) in list_append_list()
175 size_t list_size(struct linked_list* list) in list_size()
197 void* list_get_first(struct linked_list* list) in list_get_first()
215 void* list_get_last(struct linked_list* list) in list_get_last()
234 void* list_get_next(struct linked_list* list) in list_get_next()
[all …]
/dports/benchmarks/flowgrind/flowgrind-flowgrind-0.8.2/src/
H A Dfg_list.h46 struct linked_list { struct
61 int fg_list_init(struct linked_list * const list); argument
71 const struct list_node* fg_list_front(struct linked_list * const list);
81 const struct list_node* fg_list_back(struct linked_list * const list);
93 int fg_list_remove(struct linked_list * const list, const void * const data);
105 int fg_list_push_front(struct linked_list * const list, void * const data);
117 void* fg_list_pop_front(struct linked_list * const list);
129 int fg_list_push_back(struct linked_list * const list, void * const data);
141 void* fg_list_pop_back(struct linked_list * const list);
149 size_t fg_list_size(struct linked_list * const list);
[all …]
H A Dfg_list.c34 int fg_list_init(struct linked_list * const list) in fg_list_init()
49 const struct list_node* fg_list_front(struct linked_list * const list) in fg_list_front()
57 const struct list_node* fg_list_back(struct linked_list * const list) in fg_list_back()
65 int fg_list_remove(struct linked_list * const list, const void * const data) in fg_list_remove()
123 int fg_list_push_front(struct linked_list * const list, void * const data) in fg_list_push_front()
144 void* fg_list_pop_front(struct linked_list * const list) in fg_list_pop_front()
167 int fg_list_push_back(struct linked_list * const list, void * const data) in fg_list_push_back()
188 void* fg_list_pop_back(struct linked_list * const list) in fg_list_pop_back()
211 size_t fg_list_size(struct linked_list * const list) in fg_list_size()
219 int fg_list_clear(struct linked_list * const list) in fg_list_clear()
/dports/devel/gnucflow/cflow-1.6/src/
H A Dlinked-list.c19 static struct linked_list *
20 deref_linked_list(struct linked_list **plist) in deref_linked_list()
23 struct linked_list *list = xmalloc(sizeof(*list)); in deref_linked_list()
32 struct linked_list *
35 struct linked_list *list = xmalloc(sizeof(*list)); in linked_list_create()
78 linked_list_destroy(struct linked_list **plist) in linked_list_destroy()
81 struct linked_list *list = *plist; in linked_list_destroy()
116 linked_list_iterate(struct linked_list **plist, in linked_list_iterate()
119 struct linked_list *list; in linked_list_iterate()
138 data_in_list(void *data, struct linked_list *list) in data_in_list()
[all …]
H A Dcflow.h54 struct linked_list *list;
60 struct linked_list { struct
117 struct linked_list *ref_line; /* Referenced in */
130 struct linked_list *caller; /* List of callers */
131 struct linked_list *callee; /* List of callees */
194 void linked_list_destroy(struct linked_list **plist);
195 void linked_list_append(struct linked_list **plist, void *data);
197 void linked_list_iterate(struct linked_list **plist,
199 void linked_list_unlink(struct linked_list *list,
201 size_t linked_list_size(struct linked_list *list);
[all …]
/dports/security/pkcs11-tools/pkcs11-tools-2.5.0/.gnulib/modules/
H A Dlinked-list-unportable-tests2 tests/test-asyncsafe-linked_list-weak.sh
3 tests/test-asyncsafe-linked_list-weak.c
4 tests/test-asyncsafe-linked_list-strong.sh
5 tests/test-asyncsafe-linked_list-strong.c
23 test-asyncsafe-linked_list-weak.sh \
24 test-asyncsafe-linked_list-strong.sh
26 test-asyncsafe-linked_list-weak.sh \
27 test-asyncsafe-linked_list-strong.sh
29 test-asyncsafe-linked_list-weak \
30 test-asyncsafe-linked_list-strong
/dports/games/abuse_sdl/abuse-0.8/src/imlib/
H A Dlinked.cpp21 linked_list::linked_list() in linked_list() function in linked_list
32 linked_list::~linked_list() in ~linked_list()
50 int linked_list::unlink(linked_node *p) in unlink()
77 void linked_list::add_end(class linked_node *p) in add_end()
94 void linked_list::add_front(class linked_node *p) in add_front()
/dports/sysutils/cdrkit/cdrkit-1.1.11/libparanoia/
H A Dp_block.h39 typedef struct linked_list { struct
49 } linked_list; argument
56 struct linked_list *list;
60 extern linked_list *new_list(void *(*newp) (void),
62 extern linked_element *new_elem(linked_list *list);
63 extern linked_element *add_elem(linked_list *list, void *elem);
64 extern void free_list(linked_list *list, int free_ptr); /* unlink or free */
67 extern linked_list *copy_list(linked_list *list); /* shallow; doesn't copy */
156 linked_list *cache; /* our data as read from the cdrom */
158 linked_list *fragments; /* fragments of blocks that have been */
/dports/sysutils/cdrdao/cdrdao-1.2.4/paranoia/
H A Dp_block.h25 typedef struct linked_list{ struct
35 } linked_list; argument
42 struct linked_list *list;
46 extern linked_list *new_list(void *(*new)(void),void (*free)(void *));
47 extern linked_element *new_elem(linked_list *list);
48 extern linked_element *add_elem(linked_list *list,void *elem);
49 extern void free_list(linked_list *list,int free_ptr); /* unlink or free */
52 extern linked_list *copy_list(linked_list *list); /* shallow; doesn't copy
139 linked_list *cache; /* our data as read from the cdrom */
141 linked_list *fragments; /* fragments of blocks that have been 'verified' */
/dports/audio/cdparanoia/cdparanoia-III-alpha9.8/paranoia/
H A Dp_block.h25 typedef struct linked_list{ struct
35 } linked_list; argument
42 struct linked_list *list;
46 extern linked_list *new_list(void *(*new)(void),void (*free)(void *));
47 extern linked_element *new_elem(linked_list *list);
48 extern linked_element *add_elem(linked_list *list,void *elem);
49 extern void free_list(linked_list *list,int free_ptr); /* unlink or free */
52 extern linked_list *copy_list(linked_list *list); /* shallow; doesn't copy
139 linked_list *cache; /* our data as read from the cdrom */
141 linked_list *fragments; /* fragments of blocks that have been 'verified' */
/dports/sysutils/genisoimage/cdrkit-1.1.11/libparanoia/
H A Dp_block.h39 typedef struct linked_list { struct
49 } linked_list; argument
56 struct linked_list *list;
60 extern linked_list *new_list(void *(*newp) (void),
62 extern linked_element *new_elem(linked_list *list);
63 extern linked_element *add_elem(linked_list *list, void *elem);
64 extern void free_list(linked_list *list, int free_ptr); /* unlink or free */
67 extern linked_list *copy_list(linked_list *list); /* shallow; doesn't copy */
156 linked_list *cache; /* our data as read from the cdrom */
158 linked_list *fragments; /* fragments of blocks that have been */
/dports/devel/sunpromake/schily-2021-09-18/libparanoia/
H A Dp_block.h29 typedef struct linked_list { struct
39 } linked_list; argument
46 struct linked_list *list;
50 extern linked_list *new_list __PR((void *(*newp) (void),
52 extern linked_element *new_elem __PR((linked_list * list));
53 extern linked_element *add_elem __PR((linked_list * list, void *elem));
54 extern void free_list __PR((linked_list * list, int free_ptr)); /* unlink or free */
57 extern linked_list *copy_list __PR((linked_list * list)); /* shallow; doesn't copy */
160 linked_list *cache; /* our data as read from the cdrom */
162 linked_list *fragments; /* fragments of blocks that have been */
/dports/devel/smake/schily-2021-09-18/libparanoia/
H A Dp_block.h29 typedef struct linked_list { struct
39 } linked_list; typedef
46 struct linked_list *list;
50 extern linked_list *new_list __PR((void *(*newp) (void),
52 extern linked_element *new_elem __PR((linked_list * list));
53 extern linked_element *add_elem __PR((linked_list * list, void *elem));
54 extern void free_list __PR((linked_list * list, int free_ptr)); /* unlink or free */
57 extern linked_list *copy_list __PR((linked_list * list)); /* shallow; doesn't copy */
160 linked_list *cache; /* our data as read from the cdrom */
162 linked_list *fragments; /* fragments of blocks that have been */
/dports/devel/schilybase/schily-2021-09-18/libparanoia/
H A Dp_block.h29 typedef struct linked_list { struct
39 } linked_list; argument
46 struct linked_list *list;
50 extern linked_list *new_list __PR((void *(*newp) (void),
52 extern linked_element *new_elem __PR((linked_list * list));
53 extern linked_element *add_elem __PR((linked_list * list, void *elem));
54 extern void free_list __PR((linked_list * list, int free_ptr)); /* unlink or free */
57 extern linked_list *copy_list __PR((linked_list * list)); /* shallow; doesn't copy */
160 linked_list *cache; /* our data as read from the cdrom */
162 linked_list *fragments; /* fragments of blocks that have been */
/dports/net/rscsi/schily-2021-09-18/libparanoia/
H A Dp_block.h29 typedef struct linked_list { struct
39 } linked_list; argument
46 struct linked_list *list;
50 extern linked_list *new_list __PR((void *(*newp) (void),
52 extern linked_element *new_elem __PR((linked_list * list));
53 extern linked_element *add_elem __PR((linked_list * list, void *elem));
54 extern void free_list __PR((linked_list * list, int free_ptr)); /* unlink or free */
57 extern linked_list *copy_list __PR((linked_list * list)); /* shallow; doesn't copy */
160 linked_list *cache; /* our data as read from the cdrom */
162 linked_list *fragments; /* fragments of blocks that have been */
/dports/archivers/star/schily-2021-09-18/libparanoia/
H A Dp_block.h29 typedef struct linked_list { struct
39 } linked_list; argument
46 struct linked_list *list;
50 extern linked_list *new_list __PR((void *(*newp) (void),
52 extern linked_element *new_elem __PR((linked_list * list));
53 extern linked_element *add_elem __PR((linked_list * list, void *elem));
54 extern void free_list __PR((linked_list * list, int free_ptr)); /* unlink or free */
57 extern linked_list *copy_list __PR((linked_list * list)); /* shallow; doesn't copy */
160 linked_list *cache; /* our data as read from the cdrom */
162 linked_list *fragments; /* fragments of blocks that have been */
/dports/sysutils/cdrtools/schily-2021-09-18/libparanoia/
H A Dp_block.h29 typedef struct linked_list { struct
39 } linked_list; argument
46 struct linked_list *list;
50 extern linked_list *new_list __PR((void *(*newp) (void),
52 extern linked_element *new_elem __PR((linked_list * list));
53 extern linked_element *add_elem __PR((linked_list * list, void *elem));
54 extern void free_list __PR((linked_list * list, int free_ptr)); /* unlink or free */
57 extern linked_list *copy_list __PR((linked_list * list)); /* shallow; doesn't copy */
160 linked_list *cache; /* our data as read from the cdrom */
162 linked_list *fragments; /* fragments of blocks that have been */
/dports/editors/ved/schily-2021-09-18/libparanoia/
H A Dp_block.h29 typedef struct linked_list { struct
39 } linked_list; argument
46 struct linked_list *list;
50 extern linked_list *new_list __PR((void *(*newp) (void),
52 extern linked_element *new_elem __PR((linked_list * list));
53 extern linked_element *add_elem __PR((linked_list * list, void *elem));
54 extern void free_list __PR((linked_list * list, int free_ptr)); /* unlink or free */
57 extern linked_list *copy_list __PR((linked_list * list)); /* shallow; doesn't copy */
160 linked_list *cache; /* our data as read from the cdrom */
162 linked_list *fragments; /* fragments of blocks that have been */
/dports/devel/sccs/schily-2021-09-18/libparanoia/
H A Dp_block.h29 typedef struct linked_list { struct
39 } linked_list; argument
46 struct linked_list *list;
50 extern linked_list *new_list __PR((void *(*newp) (void),
52 extern linked_element *new_elem __PR((linked_list * list));
53 extern linked_element *add_elem __PR((linked_list * list, void *elem));
54 extern void free_list __PR((linked_list * list, int free_ptr)); /* unlink or free */
57 extern linked_list *copy_list __PR((linked_list * list)); /* shallow; doesn't copy */
160 linked_list *cache; /* our data as read from the cdrom */
162 linked_list *fragments; /* fragments of blocks that have been */
/dports/sysutils/schilyutils/schily-2021-09-18/libparanoia/
H A Dp_block.h29 typedef struct linked_list { struct
39 } linked_list; argument
46 struct linked_list *list;
50 extern linked_list *new_list __PR((void *(*newp) (void),
52 extern linked_element *new_elem __PR((linked_list * list));
53 extern linked_element *add_elem __PR((linked_list * list, void *elem));
54 extern void free_list __PR((linked_list * list, int free_ptr)); /* unlink or free */
57 extern linked_list *copy_list __PR((linked_list * list)); /* shallow; doesn't copy */
160 linked_list *cache; /* our data as read from the cdrom */
162 linked_list *fragments; /* fragments of blocks that have been */
/dports/net-p2p/uhub/uhub-a8ee6e7/src/core/
H A Dauth.h30 struct linked_list* users; /* Known users. See enum user_status */
31 struct linked_list* cids; /* Known CIDs */
32 struct linked_list* networks; /* IP ranges, used for banning */
33 …struct linked_list* nat_override; /* IPs inside these ranges can provide their false IP. Use wit…
34 struct linked_list* users_banned; /* Users permanently banned */
35 struct linked_list* users_denied; /* bad nickname */
/dports/devel/jwasm/JWasm-f0a2fdd/src/
H A Dmemalloc.c71 struct linked_list { struct
72 struct linked_list *next; argument
74 static struct linked_list *pBase; /* start list of 512 kB blocks; to be moved to ModuleInfo.g */
170 struct linked_list *pNext = pBase->next; in MemFini()
190 …currfree = ( size <= ( BLKSIZE - sizeof( struct linked_list ) ) ? BLKSIZE - sizeof( struct linked_… in LclAlloc()
191 BLKALLOC( pCurr, currfree + sizeof( struct linked_list ) ); in LclAlloc()
196 ((struct linked_list *)pCurr)->next = pBase; in LclAlloc()
197 pBase = (struct linked_list *)pCurr; in LclAlloc()
198 pCurr += sizeof( struct linked_list ); in LclAlloc()
/dports/net-p2p/libtorrent-rasterbar/libtorrent-rasterbar-1.2.14/test/
H A Dtest_linked_list.cpp46 void compare(linked_list<test_node> const& list, int* array, int size) in compare()
64 linked_list<test_node> list; in TORRENT_TEST()
78 linked_list<test_node> list; in TORRENT_TEST()
93 linked_list<test_node> list; in TORRENT_TEST()
111 linked_list<test_node> list; in TORRENT_TEST()
129 linked_list<test_node> list; in TORRENT_TEST()
145 linked_list<test_node> list; in TORRENT_TEST()
163 linked_list<test_node> list; in TORRENT_TEST()
185 linked_list<test_node> list; in TORRENT_TEST()
/dports/net-p2p/py-libtorrent-rasterbar/libtorrent-1.2.13/test/
H A Dtest_linked_list.cpp46 void compare(linked_list<test_node> const& list, int* array, int size) in compare()
64 linked_list<test_node> list; in TORRENT_TEST()
78 linked_list<test_node> list; in TORRENT_TEST()
93 linked_list<test_node> list; in TORRENT_TEST()
111 linked_list<test_node> list; in TORRENT_TEST()
129 linked_list<test_node> list; in TORRENT_TEST()
145 linked_list<test_node> list; in TORRENT_TEST()
163 linked_list<test_node> list; in TORRENT_TEST()
185 linked_list<test_node> list; in TORRENT_TEST()

12345678910>>...36