Searched defs:list (Results 76 - 100 of 605) sorted by relevance

1234567891011>>

/illumos-gate/usr/src/cmd/mail/
H A Dsendlist.c37 * int sendlist(reciplist *list, int letnum, int level)
40 * sendlist() will traverse the current recipient list and
58 sendlist(reciplist *list, int letnum, int level) argument
74 for (to = &(list->recip_list); to; to = to->next) {
83 * build argv list, allowing for arbitrarily long deliver lists
90 for (to = &(list->recip_list); to; to = to->next)
110 *p++ = "--"; /* extra protection: end of argument list */
112 for (to = &(list->recip_list); to; to = to->next)
H A Dsendmail.c55 reciplist list; local
58 new_reciplist(&list);
72 * Ensure no NULL names in list
79 add_recip(&list, argv[i], FALSE);
114 * Copy to list in mail entry?
438 sendlist(&list, 0, 0);
/illumos-gate/usr/src/cmd/mdb/common/modules/genunix/
H A Dlist.c30 #include <sys/list.h>
33 uintptr_t lw_head; /* address of list head */
34 size_t lw_size; /* size of list element */
35 size_t lw_offset; /* list element linkage offset */
36 void *lw_obj; /* buffer of lw_size to hold list element */
44 * Initialize a forward walk through a list.
47 * objects in the list; either or both may be NULL (defaulting to first and
51 * "list_t" and "list element" for use in error messages.
63 list_t list; local
68 element_name = "list elemen
[all...]
/illumos-gate/usr/src/cmd/filesync/
H A Dacls.c75 aclent_t *list; local
102 list = (aclent_t *) malloc(count * sizeof (*list));
103 if (list == 0)
106 /* copy the acls into the new list */
108 list[i].a_type = acls[i].a_type;
109 list[i].a_id = acls[i].a_id;
110 list[i].a_perm = acls[i].a_perm;
113 ip->f_acls = list;
173 aclent_t acls[4], *list; local
224 show_acls(int numacl, aclent_t *list) argument
[all...]
H A Dignore.c35 * ignore_pgm ..... add a rule to run a program to generate a list
68 static struct list *ign_hash(const char *, int);
74 struct list { struct
76 struct list *l_next; /* pointer to next element */
79 static struct list *expr_list; /* list of regular expressions */
80 static struct list *file_list[ HASH_SIZE ]; /* hash table of literal names */
109 { struct list *lp;
146 * to add a specific file to an ignore list
167 * to add a regular expression to an ignore list
[all...]
/illumos-gate/usr/src/cmd/format/
H A Ddefect.h34 * This file contains definitions related to the defect list.
41 * This is the structure of the header of a defect list. It is always
42 * the first sector on a track containing a defect list.
64 * This is the internal representation of a defect list. We store
67 * used to keep track of whether the list has been modified.
71 struct defect_entry *list; member in struct:defect_list
76 * This defines the number of copies of the defect list kept on the disk.
82 * These defines are the flags for the defect list.
85 #define LIST_RELOAD 0x02 /* Reload list after formatting (SCSI) */
87 /* and grown (G) list */
[all...]
H A Dmenu.c61 register char **list; local
65 * A minimum list consists of the quit command, followed
77 list = (char **)zalloc(nitems * sizeof (char *));
78 cpptr = list;
91 return (list);
95 * This routine takes a menu list created by the above routine and
99 display_menu_list(list)
100 char **list;
104 for (str = list; *str != NULL; str++)
109 * Find the "i"th enabled menu in a menu list
144 char **list; local
[all...]
/illumos-gate/usr/src/cmd/rpcgen/
H A Drpc_util.h60 struct list { struct
62 struct list *next;
64 typedef struct list list; typedef in typeref:struct:list
103 extern list *defined;
139 extern void storeval(list **, definition *);
141 #define STOREVAL(list, item) \
142 storeval(list, item)
144 extern definition *findval(list *, char *, int (*)());
146 #define FINDVAL(list, ite
[all...]
/illumos-gate/usr/src/cmd/sgs/libelf/misc/
H A Dargs.c46 char *list[10]; member in struct:__anon1679
122 here.list[here.pos++] = c;
139 (void) demangle_doarg(sptr,here.list[here.pos]);
158 (void) demangle_doarg(sptr,here.list[here.pos]);
328 /* Did the argument list terminate properly? */
339 * an argument list.
/illumos-gate/usr/src/cmd/sgs/liblddbg/common/
H A Dtls.c71 Dbg_tls_static_block(Lm_list *lml, void *list, ulong_t size, ulong_t resv) argument
78 if (list) {
82 tlsmodlist = (TLS_modinfo **)list;
/illumos-gate/usr/src/cmd/sgs/libldmake/common/
H A Dld_file.c41 * Linked list of strings - used to keep lists of names
52 static Stritem *list = NULL; variable
61 prepend_str(Stritem **list, const char *str) argument
78 new->next = *list;
79 *list = new;
95 prepend_str(&list, file);
129 if (list)
132 for (cur = list; cur; cur = cur->next)
/illumos-gate/usr/src/cmd/krb5/ldap_util/
H A Dkdb5_ldap_list.c14 * this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
44 int list_count_str_array(char **list) argument
48 if (list == NULL)
51 for (i = 0; *list != NULL; list++) {
62 int list_count_int_array(int *list) argument
66 if (list == NULL)
69 for (i = 0; *list != END_OF_LIST; list
[all...]
/illumos-gate/usr/src/tools/protocmp/
H A Ddepend.c38 #include "list.h"
218 elem_list *list, int verbose)
234 count += process_package_dir(tmp->pkg_name, pkgdir, list,
217 process_dependencies(const char *pkgname, const char *parentdir, elem_list *list, int verbose) argument
H A Dproto_list.c34 #include "list.h"
231 read_in_protolist(const char *pname, elem_list *list, int verbose) argument
238 list->type = PROTOLIST_LIST;
254 if (!find_elem(list, e, FOLLOW_LINK)) {
255 add_elem(list, e);
/illumos-gate/usr/src/uts/common/io/cxgbe/shared/
H A Dshared.c38 va_list list; local
43 va_start(list, f);
44 vcmn_err(level, fmt, list);
45 va_end(list);
/illumos-gate/usr/src/lib/sun_fc/common/
H A DFCHBA.cc126 throw IOError("Unable to build HBA list");
322 void FCHBA::loadAdapters(vector<HBA*> &list) { argument
400 throw IOError("Unable to build HBA list");
417 list.insert(list.begin(), hba);
/illumos-gate/usr/src/uts/common/sys/
H A Dvuid_store.h44 * The typical struct vuid_seg state list contains 2 segments:
46 * First, the VKEY_FIRST segment with four values in its list,
64 struct vuid_value *next; /* Next node in list */
75 * Neither the vuid_seg list or the vuid_value list will be sorted
80 struct vuid_seg *next; /* Next state segment in list */
85 /* In/not in list */
86 struct vuid_value *list; /* Linked list of values of */ member in struct:vuid_seg
88 /* in this list, th
[all...]
/illumos-gate/usr/src/uts/common/io/ib/clients/of/sol_uverbs/
H A Dsol_uverbs_hca.c29 * sharing of IBT client handle, device list, and asynchronous event
53 * Globals for managing the list of HCA's and the registered clients.
61 llist_head_t list; member in struct:sol_uverbs_hca_client_data
96 llist_head_init(&client->list, client);
97 llist_add_tail(&client->list, &sol_uverbs_client_list);
160 llist_del(&client->list);
275 llist_head_init(&handler->list, handler);
276 llist_add_tail(&handler->list, &handler->hca->event_handler_list);
301 llist_del(&handler->list);
382 llist_head_init(&context->list, contex
[all...]
/illumos-gate/usr/src/uts/common/sys/ib/clients/of/sol_uverbs/
H A Dsol_uverbs_hca.h60 * a list that points to IBT handles and the client event handler
64 llist_head_t list; member in struct:sol_uverbs_hca
85 llist_head_t list; member in struct:sol_uverbs_ib_client
96 llist_head_t list; member in struct:sol_uverbs_ib_event_handler
108 llist_head_init(&(_struct_ptr)->list, 0); \
112 * Control structures for managmenet of common HCA list.
122 * sol_uverbs HCA list management and helper sol_uverbs nternal functions.
/illumos-gate/usr/src/lib/libast/common/comp/
H A Dwordexp.c31 struct list struct
33 struct list *next;
172 ((struct list*)cp)->next = (struct list*)(*av);
203 struct list *arg, *argnext;
206 argnext = (struct list*)wdarg->we_wordv[-1];
/illumos-gate/usr/src/lib/libast/common/hash/
H A Dhashlib.h67 Hash_root_t* next; /* next in list of all roots */ \
68 Hash_table_t* references; /* referencing table list */
74 Hash_table_t* next; /* root reference list link */
99 Hash_root_t* list; /* root table list */ member in struct:__anon2617
/illumos-gate/usr/src/uts/common/io/mega_sas/
H A Dlist.h2 * list.h: header for mega_sas
12 * this list of conditions and the following disclaimer.
15 * this list of conditions and the following disclaimer in the documentation
49 * Simple doubly linked list implementation.
77 * This is only for internal list manipulation where we know
94 * @head: list head to add it after
108 * @head: list head to add it before
121 * Delete a list entry by making the prev/next entries
124 * This is only for internal list manipulation where we know
137 * mlist_del - deletes entry from list
176 mlist_splice(struct mlist_head *list, struct mlist_head *head) argument
[all...]
/illumos-gate/usr/src/cmd/lp/cmd/
H A Dlpusers.c30 /* lpusers [-q priority-level] -u (user-list | "")
58 list = FALSE, limit = -1, deflt = -1; local
79 (void) printf(gettext("\tlpusers -q priority -u user-list\n"));
86 (void) printf(gettext("\tlpusers -u user-list\n"));
101 if (list)
103 list = TRUE;
144 if (((list || deflt != -1) && (limit != -1 || userlist))
145 || (list && deflt != -1)) {
165 if (list) {
/illumos-gate/usr/src/cmd/lp/lib/access/
H A Dbang.c152 bang_searchlist(char *item, char **list) argument
154 if (!list || !*list)
161 while (*list) {
162 if (bangequ(item, *list))
164 list++;
193 * ALL matching items in the list are deleted.
195 * Now suppose the list contains just the word ``all'', and
197 * happen? The word ``all'' will be deleted, leaving the list
200 * routine; the item (``fred'') is ADDED to an opposite list
[all...]
H A Dchange.c129 chgaccess(int isallow, char **list, char *name, char *dir, char *prefix) argument
149 for (pl = list; *pl; pl++) {
179 * For each regular item in the list,
180 * we add it to the ``add list'' and remove it
181 * from the ``remove list''. This is not
183 * items in the caller's list; doing it the
186 * list.
189 * list may have redundancies, but it will

Completed in 129 milliseconds

1234567891011>>