Searched defs:list (Results 1 - 25 of 201) sorted by relevance

123456789

/osnet-11/usr/src/lib/sun_fc/common/
H A DSun_fcGetNumberOfTgtAdapters.cc42 HBAList* list = HBAList::instance(); local
43 return (list->getNumberofTgtAdapters());
H A DSun_fcLoadLibrary.cc48 HBAList* list = HBAList::instance(); local
49 return (list->load());
H A DSun_fcFreeLibrary.cc47 HBAList* list = HBAList::instance(); local
48 HBA_STATUS status = list->unload();
49 delete (list);
H A DSun_fcGetNumberOfAdapters.cc43 HBAList* list = HBAList::instance(); local
44 HBA_UINT32 ret = list->getNumberofAdapters();
50 return (list->getNumberofAdapters());
H A DSun_fcGetVendorLibraryAttributes.cc52 HBAList* list = HBAList::instance(); local
53 *attrs = list->getVSLAttributes();
H A DSun_fcGetAdapterName.cc55 HBAList* list = HBAList::instance(); local
56 std::string sname = list->getHBAName(index);
H A DSun_fcGetTgtAdapterName.cc55 HBAList* list = HBAList::instance(); local
56 std::string sname = list->getTgtHBAName(index);
/osnet-11/usr/src/lib/libldap5/sources/ldap/common/
H A Dreslist.c41 ldap_delete_result_entry( LDAPMessage **list, LDAPMessage *e ) argument
45 for ( tmp = *list; tmp != NULL && tmp != e; tmp = tmp->lm_chain )
52 *list = tmp->lm_chain;
61 ldap_add_result_entry( LDAPMessage **list, LDAPMessage *e ) argument
63 e->lm_chain = *list;
64 *list = e;
/osnet-11/usr/src/lib/libast/common/cdt/
H A Ddtextract.c36 reg Dtlink_t *list, **s, **ends; local
39 list = dt->data->here;
41 { list = dtflatten(dt);
46 { list = dt->data->head;
54 return list;
H A Ddtflatten.c24 /* Flatten a dictionary into a linked list.
37 reg Dtlink_t *t, *r, *list, *last, **s, **ends; local
43 list = last = NIL(Dtlink_t*);
49 else list = last = t;
57 list = dt->data->head;
61 for(list = last = r, r = r->right; r; last = r, r = r->right)
71 dt->data->here = list;
74 return list;
H A Ddtrestore.c24 /* Restore dictionary from given tree or list of elements.
25 ** There are two cases. If called from within, list is nil.
26 ** From without, list is not nil and data->size must be 0.
32 int dtrestore(reg Dt_t* dt, reg Dtlink_t* list) argument
34 int dtrestore(dt, list)
36 reg Dtlink_t* list;
44 if(!list) /* restoring a flattened dictionary */
47 list = dt->data->here;
49 else /* restoring an extracted list of elements */
61 { *s = list;
[all...]
H A Ddttreeset.c30 static Dtlink_t* treebalance(Dtlink_t* list, int size) argument
32 static Dtlink_t* treebalance(list, size)
33 Dtlink_t* list;
41 return list;
43 for(l = list, n = size/2 - 1; n > 0; n -= 1)
47 mid->left = treebalance(list, (n = size/2) );
H A Ddtmethod.c37 reg Dtlink_t *list, *r; local
50 /* get the list of elements */
51 list = dtflatten(dt);
70 { if((r = list) )
74 list->left = r;
77 dt->data->head = list;
81 while(list)
82 { r = list->right;
83 (*meth->searchf)(dt,(Void_t*)list,DT_RENEW);
84 list
[all...]
/osnet-11/usr/src/lib/libldap4/common/
H A Daddentry.c39 ldap_delete_result_entry( LDAPMessage **list, LDAPMessage *e ) argument
43 for ( tmp = *list; tmp != NULL && tmp != e; tmp = tmp->lm_chain )
50 *list = tmp->lm_chain;
59 ldap_add_result_entry( LDAPMessage **list, LDAPMessage *e ) argument
61 e->lm_chain = *list;
62 *list = e;
/osnet-11/usr/src/lib/gss_mechs/mech_krb5/krb5/krb/
H A Detype_list.c35 krb5int_count_etypes(const krb5_enctype *list) argument
39 for (count = 0; list[count]; count++);
43 /* Copy the zero-terminated enctype list old_list into *new_list. */
48 krb5_enctype *list; local
52 list = malloc(sizeof(krb5_enctype) * (count + 1));
53 if (list == NULL)
55 memcpy(list, old_list, sizeof(krb5_enctype) * (count + 1));
56 *new_list = list;
H A Dser_ctx.c107 etypes_len(krb5_enctype *list) argument
109 return (list == NULL) ? 0 : krb5int_count_etypes(list);
/osnet-11/usr/src/cmd/sendmail/db/db/
H A Ddb_shash.c34 } list[] = { variable in typeref:struct:__anon114
98 if (list[i].power == 0) {
102 if (list[i].power >= n_buckets)
105 return (list[i].prime);
/osnet-11/usr/src/cmd/sendmail/db/os/
H A Dos_tmpdir.c34 * The order of items in the list structure and the order of checks in
48 * static const char * const list[]
52 static const char * list[] = { local
106 /* Step through the list looking for a possibility. */
108 for (lp = list; *lp != NULL; ++lp)
/osnet-11/usr/src/lib/fm/libfmd_msg/common/
H A Dfmd_msg_test.c49 nvlist_t *fmri, *list, *test_arr[TEST_ARR_SZ]; local
60 * Build up a valid list.suspect event for a fictional diagnosis
66 nvlist_alloc(&list, NV_UNIQUE_NAME, 0) != 0) {
110 err |= nvlist_add_uint8(list, FM_VERSION, FM_SUSPECT_VERSION);
111 err |= nvlist_add_string(list, FM_CLASS, FM_LIST_SUSPECT_CLASS);
112 err |= nvlist_add_string(list, FM_SUSPECT_UUID, "12345678");
113 err |= nvlist_add_string(list, FM_SUSPECT_DIAG_CODE, code);
114 err |= nvlist_add_int64_array(list, FM_SUSPECT_DIAG_TIME, tod, 2);
115 err |= nvlist_add_nvlist(list, FM_SUSPECT_DE, fmri);
116 err |= nvlist_add_uint32(list, FM_SUSPECT_FAULT_S
[all...]
/osnet-11/usr/src/lib/libpp/common/
H A Dppbuiltin.c51 struct pplist* list; local
252 p = (list = (struct pplist*)hashget(pp.prdtab, a)) ? list->value : "";
/osnet-11/usr/src/lib/libntfs/common/include/ntfs/
H A Dlist.h2 * list.h - Linked list implementation. Part of the Linux-NTFS project.
26 * struct list_head - Simple doubly linked list implementation.
56 * This is only for internal list manipulation where we know the prev/next
71 * @head: list head to add it after
84 * @head: list head to add it before
99 * Delete a list entry by making the prev/next entries point to each other.
101 * This is only for internal list manipulation where we know the prev/next
112 * list_del - deletes entry from list.
113 * @entry: the element to delete from the list
147 list_splice(struct list_head *list, struct list_head *head) argument
[all...]
/osnet-11/usr/src/lib/libeti/form/common/
H A Dty_enum.c43 * set_field_type(f, TYPE_ENUM, list, checkcase, checkuniq);
45 * char ** list; list of acceptable strings
52 char ** list; member in struct:__anon1642
90 n -> list = va_arg(*ap, char **);
94 for (v = n -> list; *v; ++v)
96 n -> count = (int) (v - n -> list);
153 char ** list = n -> list; local
160 while (x = *list
188 char ** list = n -> list; local
210 char ** list = n -> list + n -> count - 1; local
[all...]
/osnet-11/usr/src/lib/fm/topo/modules/sun4u/hostbridge/common/
H A Dhb_sun4u.c34 count_busorrc(topo_mod_t *mod, busorrc_t *list, int *hbc, int *bph) argument
40 start = list->br_ba_ac;
41 p = list->br_nextbus;
52 * complexes in the list to have the same number of buses on
69 busorrc_process(topo_mod_t *mod, busorrc_t *list, int isrc, tnode_t *ptn) argument
73 if (list == NULL) {
85 * list, ordered by "bus address". We retrieved "bus address"
104 if (count_busorrc(mod, list, &hbc, &busper) < 0)
107 return (declare_exbuses(mod, list, ptn, hbc, busper));
109 return (declare_buses(mod, list, pt
[all...]
/osnet-11/usr/src/cmd/parted/
H A Dcommand.c64 command_register (Command** list, Command* cmd) argument
68 for (i = 0; list [i]; i++);
70 list [i] = cmd;
71 list [i + 1] = (Command*) NULL;
75 command_get (Command** list, char* name) argument
84 for (i=0; list [i]; i++) {
85 switch (str_list_match_any (list [i]->names, name)) {
87 return list [i];
104 return list [partial_match];
108 command_get_names (Command** list) argument
[all...]
/osnet-11/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];

Completed in 44 milliseconds

123456789