Searched refs:list (Results 126 - 150 of 1918) sorted by relevance

1234567891011>>

/freebsd-current/share/examples/sunrpc/dir/
H A Ddir.x23 namelist list; /* no error: return directory listing */
/freebsd-current/libexec/rc/rc.d/
H A Dzvol21 zfs list -H -o org.freebsd:swap,name -t volume |
34 zfs list -H -o org.freebsd:swap,name -t volume |
/freebsd-current/contrib/dialog/
H A Deditbox.c38 grow_list(char ***list, int *have, int want) argument
44 (*list) = dlg_realloc(char *, need, *list);
45 if ((*list) == 0) {
49 (*list)[last] = 0;
56 load_list(const char *file, char ***list, int *rows) argument
62 *list = 0;
97 (*list)[need] = blob + n;
109 (*list)[0] = dlg_strclone("");
110 (*list)[
126 free_list(char ***list, int *rows) argument
176 display_all(WINDOW *win, char **list, int show_row, int firstrow, int lastrow, int chr_offset) argument
198 size_list(char **list) argument
288 widest_line(char **list) argument
322 dlg_editbox(const char *title, char ***list, int *rows, int height, int width) argument
764 char **list; local
[all...]
/freebsd-current/tests/sys/aio/
H A Dlio_test.c9 * notice, this list of conditions and the following disclaimer.
11 * notice, this list of conditions and the following disclaimer in the
68 struct aiocb **list[2]; local
98 list[i] = calloc(ios_per_call, sizeof(struct aiocb*));
99 ATF_REQUIRE(list[i] != NULL);
110 list[i][j] = &aiocbs[i][j];
114 ATF_REQUIRE_EQ(0, lio_listio(LIO_NOWAIT, list[0], ios_per_call, &sev[0]));
115 ATF_REQUIRE_EQ(-1, lio_listio(LIO_NOWAIT, list[1], ios_per_call, &sev[1]));
129 struct aiocb *list = NULL; local
131 ATF_REQUIRE_EQ(0, lio_listio(LIO_WAIT, &list,
138 struct aiocb *list = NULL; local
150 struct aiocb *list = NULL; local
178 struct aiocb *list = NULL; local
197 struct aiocb *list = NULL; local
218 struct aiocb *list[] = {&write_cb, &read_cb, &writev_cb, &readv_cb}; local
300 struct aiocb *list[] = {&sync_cb, &mlock_cb}; local
[all...]
/freebsd-current/tools/tools/drm/radeon/mkregtable/
H A Dmkregtable.c2 * this includes inlined list.h safe for userspace.
32 * Simple doubly linked list implementation.
50 static inline void INIT_LIST_HEAD(struct list_head *list) argument
52 list->next = list;
53 list->prev = list;
59 * This is only for internal list manipulation where we know
79 * @head: list head to add it after
92 * @head: list hea
169 list_move(struct list_head *list, struct list_head *head) argument
180 list_move_tail(struct list_head *list, struct list_head *head) argument
192 list_is_last(const struct list_head *list, const struct list_head *head) argument
235 __list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) argument
262 list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) argument
276 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument
294 list_splice(const struct list_head *list, struct list_head *head) argument
306 list_splice_tail(struct list_head *list, struct list_head *head) argument
320 list_splice_init(struct list_head *list, struct list_head *head) argument
337 list_splice_tail_init(struct list_head *list, struct list_head *head) argument
552 struct list_head list; member in struct:offset
[all...]
/freebsd-current/lib/libbe/tests/
H A Dbe_create.sh10 # notice, this list of conditions and the following disclaimer.
12 # notice, this list of conditions and the following disclaimer in the
125 zfs list "${zpool}/ROOT/nonrecursive"
128 zfs list "${zpool}/ROOT/nonrecursive/usr"
137 zfs list "${zpool}/ROOT/recursive"
140 zfs list "${zpool}/ROOT/recursive/usr"
143 zfs list "${zpool}/ROOT/recursive/usr/obj"
146 zfs list "${zpool}/ROOT/recursive/usr/src"
155 zfs list "${zpool}/ROOT/depth/usr"
158 zfs list "
[all...]
/freebsd-current/contrib/ntp/libntp/lib/isc/include/isc/
H A Dutil.h187 #include <isc/list.h> /* Contractual promise. */
193 #define HEAD(list) ISC_LIST_HEAD(list)
194 #define TAIL(list) ISC_LIST_TAIL(list)
195 #define EMPTY(list) ISC_LIST_EMPTY(list)
198 #define APPEND(list, elt, link) ISC_LIST_APPEND(list, elt, link)
199 #define PREPEND(list, el
[all...]
/freebsd-current/sys/sys/
H A Deventhandler.h11 * notice, this list of conditions and the following disclaimer.
13 * notice, this list of conditions and the following disclaimer in the
62 #define _EVENTHANDLER_INVOKE(name, list, ...) do { \
66 EHL_LOCK_ASSERT((list), MA_OWNED); \
67 (list)->el_runcount++; \
68 KASSERT((list)->el_runcount > 0, \
71 TAILQ_FOREACH(_ep, &((list)->el_entries), ee_link) { \
73 EHL_UNLOCK((list)); \
78 EHL_LOCK((list)); \
81 KASSERT((list)
[all...]
/freebsd-current/usr.bin/column/
H A Dcolumn.c11 * notice, this list of conditions and the following disclaimer.
13 * notice, this list of conditions and the following disclaimer in the
61 static wchar_t **list; /* array of pointers to records */ variable
147 for (chcnt = col = 0, lp = list;; ++lp) {
181 wprintf(L"%ls", list[base]);
182 chcnt += width(list[base]);
201 for (cnt = entries, lp = list; cnt--; ++lp)
206 wchar_t **list; member in struct:_tbl
228 for (cnt = 0, lp = list; cnt < entries; ++cnt, ++lp, ++t) {
242 if ((t->list
[all...]
/freebsd-current/contrib/openbsm/bin/auditfilterd/
H A Dauditfilterd_conf.c11 * notice, this list of conditions and the following disclaimer.
13 * notice, this list of conditions and the following disclaimer in the
87 * Free all memory associated with an auditfilter_module list. Does not
92 auditfilter_module_list_free(struct auditfilter_module_list *list) argument
96 while (!(TAILQ_EMPTY(list))) {
97 am = TAILQ_FIRST(list);
98 TAILQ_REMOVE(list, am, am_list);
119 * Walk an auditfilter_module list, detaching each module. Intended to be
123 auditfilter_module_list_detach(struct auditfilter_module_list *list) argument
127 TAILQ_FOREACH(am, list, am_lis
290 auditfilterd_conf_read(const char *filename, FILE *fp, struct auditfilter_module_list *list) argument
345 auditfilterd_conf_apply(struct auditfilter_module_list *list) argument
470 struct auditfilter_module_list list; local
[all...]
/freebsd-current/lib/libc/net/
H A Dhesiod.c236 hesiod_free_list(void *context, char **list) argument
240 if (list == NULL)
242 for (p = list; *p; p++)
244 free(list);
343 * return a list of them.
350 char *dst, **list; local
390 list = malloc((ancount + 1) * sizeof(char *));
391 if (!list) {
416 list[j] = malloc((size_t)len);
417 if (!list[
493 static char **list; local
[all...]
/freebsd-current/contrib/byacc/test/
H A Derr_syntax27.y23 %start list
35 list : /* empty */ label
36 | list stat '\n'
37 | list error '\n'
H A Dquote_calc4.y13 %start list
32 list : /* empty */ label
33 | list stat '\n'
34 | list error '\n'
H A Dcalc_code_imports.y16 %start list
28 list : /* empty */ label
29 | list stat '\n'
30 | list error '\n'
H A Dcalc3.y23 %start list
35 list : /* empty */ label
36 | list stat '\n'
37 | list error '\n'
H A Dcalc2.y20 %start list
32 list : /* empty */ label
33 | list stat '\n'
34 | list error '\n'
H A Dcalc_code_all.y20 %start list
32 list : /* empty */ label
33 | list stat '\n'
34 | list error '\n'
H A Dcalc_code_default.y16 %start list
28 list : /* empty */ label
29 | list stat '\n'
30 | list error '\n'
H A Dcalc.y13 %start list
25 list : /* empty */ label
26 | list stat '\n'
27 | list error '\n'
H A Dcalc_code_top.y16 %start list
28 list : /* empty */ label
29 | list stat '\n'
30 | list error '\n'
H A Dcode_calc.y17 %start list
29 list : /* empty */ label
30 | list stat '\n'
31 | list error '\n'
H A Dcalc_code_provides.y16 %start list
28 list : /* empty */ label
29 | list stat '\n'
30 | list error '\n'
H A Dcalc_code_requires.y16 %start list
28 list : /* empty */ label
29 | list stat '\n'
30 | list error '\n'
H A Dquote_calc3.y13 %start list
32 list : /* empty */ label
33 | list stat '\n'
34 | list error '\n'
/freebsd-current/contrib/atf/atf-c/detail/
H A Dtext.h8 * notice, this list of conditions and the following disclaimer.
10 * notice, this list of conditions and the following disclaimer in the
32 #include <atf-c/detail/list.h>

Completed in 227 milliseconds

1234567891011>>