Searched refs:list (Results 1 - 25 of 859) sorted by relevance

1234567891011>>

/asus-wl-520gu-7.0.1.45/src/router/library/libupnp-1.2.1/upnp/src/inc/
H A Dglobal.h10 // this list of conditions and the following disclaimer.
12 // this list of conditions and the following disclaimer in the documentation
54 If using PROTOTYPES, then PROTO_LIST returns the list, otherwise it
55 returns an empty list.
59 #define PROTO_LIST(list) list
61 #define PROTO_LIST(list) ()
/asus-wl-520gu-7.0.1.45/src/router/samba/source/include/
H A Ddlinklist.h3 some simple double linked list macros
25 /* hook into the front of the list */
26 #define DLIST_ADD(list, p) \
28 if (!(list)) { \
29 (list) = (p); \
32 (list)->prev = (p); \
33 (p)->next = (list); \
35 (list) = (p); \
39 /* remove an element from a list - element doesn't have to be in list
[all...]
/asus-wl-520gu-7.0.1.45/src/router/library/libupnp-1.2.1/threadutil/src/
H A DLinkedList.c10 // this list of conditions and the following disclaimer.
12 // this list of conditions and the following disclaimer in the documentation
38 LinkedList * list )
40 assert( list != NULL );
42 return FreeListFree( &list->freeNodeList, node );
49 * Creates a list node. Dynamically.
58 LinkedList * list )
63 assert( list != NULL );
65 temp = ( ListNode * ) FreeListAlloc( &list->freeNodeList );
81 * list
88 ListInit( LinkedList * list, cmp_routine cmp_func, free_function free_func ) argument
136 ListAddHead( LinkedList * list, void *item ) argument
162 ListAddTail( LinkedList * list, void *item ) argument
189 ListAddAfter( LinkedList * list, void *item, ListNode * bnode ) argument
230 ListAddBefore( LinkedList * list, void *item, ListNode * anode ) argument
272 ListDelNode( LinkedList * list, ListNode * dnode, int freeItem ) argument
319 ListDestroy( LinkedList * list, int freeItem ) argument
410 ListNext( LinkedList * list, ListNode * node ) argument
440 ListPrev( LinkedList * list, ListNode * node ) argument
473 ListFind( LinkedList * list, ListNode * start, void *item ) argument
[all...]
/asus-wl-520gu-7.0.1.45/src/router/dproxy/
H A Ddns_list.c9 dns_request_t *dns_list_add(dns_request_t *list, dns_request_t *m) argument
13 if ( dns_list_size >= MAX_LIST_SIZE && list ){ //modified by CMC 12/27/2001
14 node = list;
17 list = dns_list_remove( list, node );
21 if( !new_node) return list;
31 new_node->next = list;
35 dns_request_t *dns_list_find_by_id(dns_request_t *list, dns_request_t *m) argument
38 dns_list_print( list );
41 while( list !
51 dns_list_remove(dns_request_t *list, dns_request_t *m ) argument
75 dns_list_print(dns_request_t *list) argument
[all...]
H A Ddns_list.h4 * Add a node to the list pointed to by 'list'. Copy 'm' into that node.
5 * RETURNS: pointer to start of list
7 dns_request_t *dns_list_add(dns_request_t *list, dns_request_t *m);
9 * Scans each node in the list pointed to by 'list' and compare the id field
13 dns_request_t *dns_list_find_by_id(dns_request_t *list, dns_request_t *m);
17 dns_request_t *dns_list_remove(dns_request_t *list, dns_request_t *m );
19 * Print out the list for debuging purposes
21 void dns_list_print(dns_request_t *list);
[all...]
/asus-wl-520gu-7.0.1.45/src/linux/linux/drivers/input/
H A Dmousedev.c56 struct mousedev_list *list; member in struct:mousedev
89 struct mousedev_list *list; local
95 list = (*mousedev)->list;
96 while (list) {
104 list->dx += (value * xres - list->oldx) / size;
105 list->oldx += list->dx * size;
109 list
163 struct mousedev_list *list = file->private_data; local
170 struct mousedev_list *list = file->private_data; local
218 struct mousedev_list *list; local
253 mousedev_packet(struct mousedev_list *list, unsigned char off) argument
282 struct mousedev_list *list = file->private_data; local
343 struct mousedev_list *list = file->private_data; local
389 struct mousedev_list *list = file->private_data; local
[all...]
H A Devdev.c49 struct evdev_list *list; member in struct:evdev
66 struct evdev_list *list = evdev->list; local
68 while (list) {
70 do_gettimeofday(&list->buffer[list->head].time);
71 list->buffer[list->head].type = type;
72 list->buffer[list
87 struct evdev_list *list = file->private_data; local
94 struct evdev_list *list = file->private_data; local
123 struct evdev_list *list; local
148 struct evdev_list *list = file->private_data; local
166 struct evdev_list *list = file->private_data; local
212 struct evdev_list *list = file->private_data; local
221 struct evdev_list *list = file->private_data; local
[all...]
/asus-wl-520gu-7.0.1.45/src/router/rcamdmips/
H A Dglist.c22 * file for a list of people on the GLib Team. See the ChangeLog
23 * files for a list of changes. These files are distributed with
106 GList *list; local
119 list = g_chunk_new (GList, current_allocator->mem_chunk);
120 list->data = NULL;
126 list = current_allocator->free_lists->data;
127 current_allocator->free_lists->data = list->next;
128 list->data = NULL;
132 list = current_allocator->free_lists;
133 current_allocator->free_lists = list
144 g_list_free(GList *list) argument
157 g_list_free_1(GList *list) argument
170 g_list_append(GList *list, gpointer data) argument
193 g_list_prepend(GList *list, gpointer data) argument
216 g_list_insert(GList *list, gpointer data, gint position) argument
268 g_list_remove(GList *list, gpointer data) argument
297 g_list_remove_link(GList *list, GList *link) argument
318 g_list_copy(GList *list) argument
344 g_list_reverse(GList *list) argument
361 g_list_nth(GList *list, guint n) argument
371 g_list_nth_data(GList *list, guint n) argument
381 g_list_find(GList *list, gpointer data) argument
395 g_list_find_custom(GList *list, gpointer data, GCompareFunc func) argument
413 g_list_position(GList *list, GList *link) argument
431 g_list_index(GList *list, gpointer data) argument
449 g_list_last(GList *list) argument
461 g_list_first(GList *list) argument
473 g_list_length(GList *list) argument
488 g_list_foreach(GList *list, GFunc func, gpointer user_data) argument
501 g_list_insert_sorted(GList *list, gpointer data, GCompareFunc func) argument
555 GList list, *l, *lprev; local
586 g_list_sort(GList *list, GCompareFunc compare_func) argument
614 g_list_sort2(GList *list, GCompareFunc compare_func) argument
[all...]
H A Dglist.h22 * file for a list of people on the GLib Team. See the ChangeLog
23 * files for a list of changes. These files are distributed with
48 void g_list_free (GList *list);
49 void g_list_free_1 (GList *list);
50 GList* g_list_append (GList *list,
52 GList* g_list_prepend (GList *list,
54 GList* g_list_insert (GList *list,
57 GList* g_list_insert_sorted (GList *list,
60 GList* g_list_insert_before (GList *list,
65 GList* g_list_remove (GList *list,
[all...]
H A Dgslist.c22 * file for a list of people on the GLib Team. See the ChangeLog
23 * files for a list of changes. These files are distributed with
106 GSList *list; local
119 list = g_chunk_new (GSList, current_allocator->mem_chunk);
120 list->data = NULL;
126 list = current_allocator->free_lists->data;
127 current_allocator->free_lists->data = list->next;
128 list->data = NULL;
132 list = current_allocator->free_lists;
133 current_allocator->free_lists = list
144 g_slist_free(GSList *list) argument
157 g_slist_free_1(GSList *list) argument
170 g_slist_append(GSList *list, gpointer data) argument
192 g_slist_prepend(GSList *list, gpointer data) argument
205 g_slist_insert(GSList *list, gpointer data, gint position) argument
262 g_slist_remove(GSList *list, gpointer data) argument
294 g_slist_remove_link(GSList *list, GSList *link) argument
324 g_slist_copy(GSList *list) argument
349 g_slist_reverse(GSList *list) argument
367 g_slist_nth(GSList *list, guint n) argument
377 g_slist_nth_data(GSList *list, guint n) argument
387 g_slist_find(GSList *list, gpointer data) argument
401 g_slist_find_custom(GSList *list, gpointer data, GCompareFunc func) argument
418 g_slist_position(GSList *list, GSList *link) argument
436 g_slist_index(GSList *list, gpointer data) argument
454 g_slist_last(GSList *list) argument
466 g_slist_length(GSList *list) argument
481 g_slist_foreach(GSList *list, GFunc func, gpointer user_data) argument
493 g_slist_insert_sorted(GSList *list, gpointer data, GCompareFunc func) argument
547 GSList list, *l; local
570 g_slist_sort(GSList *list, GCompareFunc compare_func) argument
[all...]
/asus-wl-520gu-7.0.1.45/src/router/library/libupnp-1.2.1/threadutil/inc/
H A DLinkedList.h10 // this list of conditions and the following disclaimer.
12 // this list of conditions and the following disclaimer in the documentation
51 * Function for freeing list items
59 * Function for comparing list items
68 * linked list node. stores generic item and pointers to next and prev.
82 * linked list (no protection). Internal Use Only.
85 * The first item of the list is stored at node: head->next
86 * The last item of the list is stored at node: tail->prev
87 * If head->next=tail, then list is empty.
88 * To iterate through the list
[all...]
/asus-wl-520gu-7.0.1.45/src/router/library/libupnp-1.2.1/upnp/inc/
H A DLinkedList.h10 // this list of conditions and the following disclaimer.
12 // this list of conditions and the following disclaimer in the documentation
51 * Function for freeing list items
59 * Function for comparing list items
68 * linked list node. stores generic item and pointers to next and prev.
82 * linked list (no protection). Internal Use Only.
85 * The first item of the list is stored at node: head->next
86 * The last item of the list is stored at node: tail->prev
87 * If head->next=tail, then list is empty.
88 * To iterate through the list
[all...]
/asus-wl-520gu-7.0.1.45/src/router/e2fsprogs-1.40.8/e2fsck/
H A Dprofile_helpers.c8 * list of sections or relations, or accessing multiple values from a
31 * internal functions used to build up a null-terminated char ** list
35 * purposes to build up the list, which is returned in *ret_list by
38 * The publicly exported interface for freeing char** list is
43 char **list; member in struct:profile_string_list
49 * Initialize the string list abstraction.
51 static errcode_t init_list(struct profile_string_list *list) argument
53 list->num = 0;
54 list->max = 10;
55 list
66 end_list(struct profile_string_list *list, char ***ret_list) argument
88 add_to_list(struct profile_string_list *list, char *str) argument
110 is_list_member(struct profile_string_list *list, const char *str) argument
128 profile_free_list(char **list) argument
[all...]
/asus-wl-520gu-7.0.1.45/src/cfe/cfe/lib/
H A Dlib_misc.c23 * and retain this copyright notice and list of conditions
110 * lib_lookup(list,str)
112 * Look up an element on a {string,value} list.
115 * list - list to search
116 * str - string to find on the list
123 int lib_lookup(const cons_t *list,char *str) argument
125 while (list->str) {
126 if (lib_strcmp(list->str,str) == 0) return list
147 lib_findinlist(const cons_t *list,char *str) argument
179 lib_setoptions(const cons_t *list,char *str,unsigned int *flags) argument
[all...]
/asus-wl-520gu-7.0.1.45/src/router/samba/source/lib/
H A Dwins_srv.c29 and each group has a failover list of wins servers.
44 it tries registering with the first one mentioned in the list, then
63 /* The list of dead wins servers is stored in gencache.tdb. Each server is
65 separate dead list for each src address to cope with multiple interfaces
95 see if an ip is on the dead list
154 const char **list; local
162 list = lp_wins_server_list();
163 for (count=0; list && list[count]; count++)
200 return the list o
210 const char **list; local
260 wins_srv_tags_free(char **list) argument
277 const char **list; local
333 const char **list; local
[all...]
/asus-wl-520gu-7.0.1.45/src/router/samba/source/nsswitch/
H A Dwinbind_nss_aix.c51 know the name, but you can't obtain a list of those names. If anyone
72 static void *list_alloc(struct mem_list **list, size_t size) argument
86 m->next = *list;
88 if (*list) {
89 (*list)->prev = m;
91 (*list) = m;
96 static char *list_strdup(struct mem_list **list, const char *s) argument
98 char *ret = list_alloc(list, strlen(s)+1);
105 static void list_destory(struct mem_list **list) argument
108 for (m=*list;
130 fill_pwent(struct mem_list **list, struct winbindd_pw *pw) argument
159 fill_grent(struct mem_list **list, struct winbindd_gr *gr, char *gr_mem) argument
223 static struct mem_list *list; local
250 static struct mem_list *list; local
283 static struct mem_list *list; local
327 static struct mem_list *list; local
350 static struct mem_list *list; local
[all...]
/asus-wl-520gu-7.0.1.45/src/router/iproute2/reference/asm-s390/
H A Dqueue.h19 typedef queue list; typedef
62 static __inline__ void init_list(list **lhead)
67 static __inline__ void add_to_list(list **lhead,list *member)
73 static __inline__ list *remove_listhead(list **lhead)
75 list *oldhead=*lhead;
82 static __inline__ void add_to_list_tail(list **lhead,list *member)
84 list *cur
[all...]
/asus-wl-520gu-7.0.1.45/src/router/iproute2/reference/asm-s390x/
H A Dqueue.h19 typedef queue list; typedef
62 static __inline__ void init_list(list **lhead)
67 static __inline__ void add_to_list(list **lhead,list *member)
73 static __inline__ list *remove_listhead(list **lhead)
75 list *oldhead=*lhead;
82 static __inline__ void add_to_list_tail(list **lhead,list *member)
84 list *cur
[all...]
/asus-wl-520gu-7.0.1.45/src/linux/linux/include/asm-s390/
H A Dqueue.h19 typedef queue list; typedef
62 static __inline__ void init_list(list **lhead)
67 static __inline__ void add_to_list(list **lhead,list *member)
73 static __inline__ list *remove_listhead(list **lhead)
75 list *oldhead=*lhead;
82 static __inline__ void add_to_list_tail(list **lhead,list *member)
84 list *cur
[all...]
/asus-wl-520gu-7.0.1.45/src/linux/linux/include/asm-s390x/
H A Dqueue.h19 typedef queue list; typedef
62 static __inline__ void init_list(list **lhead)
67 static __inline__ void add_to_list(list **lhead,list *member)
73 static __inline__ list *remove_listhead(list **lhead)
75 list *oldhead=*lhead;
82 static __inline__ void add_to_list_tail(list **lhead,list *member)
84 list *cur
[all...]
/asus-wl-520gu-7.0.1.45/src/cfe/cfe/usb/
H A Dusbdevs.c25 * and retain this copyright notice and list of conditions
66 * The list of drivers we support. If you add more drivers,
67 * list them here.
138 usb_drvlist_t *list; local
154 list = usb_drivers;
155 while (list->udl_disp) {
156 if (((list->udl_class == dclass) || (list->udl_class == CLASS_ANY)) &&
157 ((list->udl_vendor == vendor) || (list
[all...]
/asus-wl-520gu-7.0.1.45/src/linux/linux/arch/sparc64/prom/
H A Dp1275.c261 va_list list; local
280 va_start(list, fmt);
285 (unsigned)va_arg(list, long);
289 va_arg(list, unsigned long);
292 strcpy (p, va_arg(list, char *));
297 (void) va_arg(list, char *);
299 x = va_arg(list, long);
305 q = va_arg(list, char *);
307 x = va_arg(list, long);
314 (void) va_arg(list, cha
[all...]
/asus-wl-520gu-7.0.1.45/src/router/iproute2/reference/linux/
H A Dtqueue.h17 #include <linux/list.h>
26 * - Bottom halfs are implemented as a linked list. You can have as many
35 * the list.
39 struct list_head list; /* linked list of active bh's */ member in struct:tq_struct
59 INIT_LIST_HEAD(&(_tq)->list); \
72 * To implement your own list of active bottom halfs, use the following
81 * To activate a bottom half on a list, use:
106 list_add_tail(&bh_pointer->list, bh_list);
114 * Call all "bottom halfs" on a given list
119 run_task_queue(task_queue *list) argument
[all...]
H A Dtimer.h5 #include <linux/list.h>
17 struct list_head list; member in struct:timer_list
47 timer->list.next = timer->list.prev = NULL;
52 return timer->list.next != NULL;
/asus-wl-520gu-7.0.1.45/src/linux/linux/include/linux/
H A Dtqueue.h17 #include <linux/list.h>
26 * - Bottom halfs are implemented as a linked list. You can have as many
35 * the list.
39 struct list_head list; /* linked list of active bh's */ member in struct:tq_struct
59 INIT_LIST_HEAD(&(_tq)->list); \
72 * To implement your own list of active bottom halfs, use the following
81 * To activate a bottom half on a list, use:
106 list_add_tail(&bh_pointer->list, bh_list);
114 * Call all "bottom halfs" on a given list
119 run_task_queue(task_queue *list) argument
[all...]

Completed in 279 milliseconds

1234567891011>>