Searched refs:entries (Results 1 - 25 of 193) sorted by relevance

12345678

/illumos-gate/usr/src/lib/sun_fc/common/
H A DSun_fcGetFcpTargetMapping.cc74 HBA_UINT32 entries = 0; local
86 entries = mapping->NumberOfEntries;
101 mappingV2->NumberOfEntries = mapping->NumberOfEntries < entries ?
102 entries - mapping->NumberOfEntries : 0 ;
115 limit = (mapping->NumberOfEntries < entries) ? mapping->NumberOfEntries : entries;
/illumos-gate/usr/src/uts/common/crypto/io/
H A Dcryptoadm.c243 crypto_dev_list_entry_t *entries; local
252 if (crypto_get_dev_list(&count, &entries) != 0) {
264 crypto_free_dev_list(entries, count);
278 crypto_free_dev_list(entries, count);
282 /* copyout entries */
284 if (count > 0 && copyout(entries, arg + offset, copyout_size) != 0) {
285 crypto_free_dev_list(entries, count);
288 crypto_free_dev_list(entries, count);
361 crypto_mech_name_t *entries; local
383 &count, &entries)) !
432 crypto_mech_name_t *entries; local
499 crypto_mech_name_t *entries; local
575 crypto_mech_name_t *entries; local
655 crypto_mech_name_t *entries; local
[all...]
/illumos-gate/usr/src/lib/libldap5/sources/ldap/common/
H A Dfriendly.c48 int i, entries; local
65 entries = 0;
68 entries++;
72 if ( (*map = (FriendlyMap)NSLDAPI_MALLOC( (entries + 1) *
79 while ( fgets( buf, sizeof(buf), fp ) != NULL && i < entries ) {
/illumos-gate/usr/src/lib/krb5/plugins/kdb/ldap/libkdb_ldap/
H A Dldap_principal2.c81 krb5_ldap_get_principal(context, searchfor, entries, nentries, more)
84 krb5_db_entry *entries; /* filled in */
104 memset(entries, 0, sizeof(*entries));
163 entries)) != 0)
178 krb5_dbe_free_contents(context, entries);
452 krb5_ldap_put_principal(context, entries, nentries, db_args)
454 krb5_db_entry *entries;
490 for (i=0; i < *nentries; ++i, ++entries) {
491 if (is_principal_in_realm(ldap_context, entries
[all...]
H A Dldap_principal.c129 krb5_ldap_free_principal(kcontext , entries, nentries)
131 krb5_db_entry *entries;
136 krb5_dbe_free_contents(kcontext, &entries[i]);
273 krb5_db_entry entries; local
281 if ((st=krb5_ldap_get_principal(context, searchfor, &entries, nentries, &more)) != 0 || *nentries == 0)
284 if (((st=krb5_get_princ_type(context, &entries, &(ptype))) != 0) ||
285 ((st=krb5_get_attributes_mask(context, &entries, &(attrsetmask))) != 0) ||
286 ((st=krb5_get_princ_count(context, &entries, &(pcount))) != 0) ||
287 ((st=krb5_get_userdn(context, &entries, &(DN))) != 0))
329 * NOTE: krbsecretkey attribute has per principal entries
[all...]
/illumos-gate/usr/src/cmd/fs.d/smbclnt/smbutil/
H A Dview.c165 int error, entries, total; local
171 error = smb_netshareenum(ctx, &entries, &total, &share_info);
177 print_shares(entries, total, share_info);
182 print_shares(int entries, int total, argument
191 for (ep = share_info, i = 0; i < entries; i++, ep++) {
202 entries, total);
/illumos-gate/usr/src/lib/libsmbfs/smb/
H A Dnetshareenum.c85 int error, i, entries;
195 entries = share_info.share_union.tagged_union.share1->share_count;
197 entry_list = calloc(entries, sizeof (struct share_info));
202 for (share = shares, elp = entry_list, i = 0; i < entries;
213 *entriesp = entries;
221 for (elp = entry_list, i = 0; i < entries; i++, elp++) {
226 * to any entries after this one.
238 for (share = shares, i = 0; i < entries; i++, share++) {
302 int error, bufsize, i, entries, total, nreturned; local
313 error = smb_rap_NetShareEnum(ctx, 1, rpbuf, &bufsize, &entries,
[all...]
/illumos-gate/usr/src/lib/libnisdb/yptol/
H A Dshim.c133 ret = dbm_delete(map->entries, key);
167 ret = dbm_fetch(map->entries, key);
171 ret = dbm_fetch(map->entries, key);
183 * or updates entries.
202 ret = dbm_fetch(map->entries, key);
211 * this is the time to scan it and see if any new entries have been
270 dbm_close(map->entries);
287 ret = dbm_firstkey(map->entries);
322 ret = dbm_nextkey(map->entries);
363 ret = dbm_do_nextkey(map->entries, inke
[all...]
H A Dmap_ctrl.c100 map->entries = NULL;
114 * can save a lot of work as map entries are accessed.
249 map->entries = NULL;
311 if (NULL != old_map->entries) {
338 if (NULL != map->entries) {
339 dbm_close(map->entries);
340 map->entries = NULL;
474 /* Open entries map */
475 map->entries = dbm_open(map->map_path, map->open_flags, map->open_mode);
477 if (NULL == map->entries) {
[all...]
H A Dupdate.c84 /* Only update individual entries if entire map is */
97 update_timestamp(map->entries);
170 dbm_delete(map->entries, *key);
178 res = dbm_store(map->entries, *key, dat, DBM_REPLACE);
/illumos-gate/usr/src/cmd/cmd-inet/usr.sbin/snoop/
H A Dsnoop_mount.c85 "Return mount entries", /* 2 */
87 "Remove all mount entries", /* 4 */
445 int entries = 0; local
448 (void) sprintf(buff, "%d+ entries", entries);
457 entries++;
460 (void) sprintf(buff, "%d entries", entries);
467 int entries = 0; local
473 " %d+ entries
492 int entries = 0; local
513 int entries = 0; local
[all...]
H A Dsnoop_nfs3.c1055 static int entries; local
1057 entries = 0;
1059 (void) sprintf(buff, " %d+ entries (incomplete)", entries);
1065 entries++;
1071 (void) sprintf(buff, " %d entries (%s)",
1072 entries, getxdr_bool() ? "No more" : "More");
1080 static int entries; local
1083 entries = 0;
1085 (void) sprintf(buff, " %d+ entries (incomplet
1110 static int entries; local
1144 static int entries; local
[all...]
H A Dsnoop_nfs.c637 int entries = 0; local
640 (void) sprintf(buff, " %d+ entries (incomplete)", entries);
644 entries++;
650 (void) sprintf(buff, " %d entries (%s)",
651 entries,
660 int entries = 0; local
668 " %d+ entries. (Frame is incomplete)",
669 entries);
673 entries
[all...]
/illumos-gate/usr/src/uts/sun4u/serengeti/io/
H A Dsbdp_error.c108 int entries[SBDP_IE_MAX_ENTRIES]; member in struct:error_matrix
227 sbdp_error_matrix[index].entries[entry] = value;
235 * Reset all entries to 0.
247 sbdp_error_matrix[i].entries[j] = 0;
295 value = sbdp_error_matrix[index].entries[entry];
/illumos-gate/usr/src/cmd/idmap/idmapd/
H A Ddirectory_server.c77 directory_entry_rpc *entries;
83 entries = (directory_entry_rpc *)
85 if (entries == NULL)
87 result->directory_results_rpc_u.entries.entries_val = entries;
88 result->directory_results_rpc_u.entries.entries_len = nids;
94 directory_entry_set_error(&entries[i],
101 de = providers[i]->get(entries, &ids, types,
/illumos-gate/usr/src/cmd/sendmail/db/btree/
H A Dbt_search.c354 size_t entries; local
357 entries = cp->esp - cp->sp;
359 if ((ret = __os_calloc(entries * 2, sizeof(EPG), &p)) != 0)
361 memcpy(p, cp->sp, entries * sizeof(EPG));
363 __os_free(cp->sp, entries * sizeof(EPG));
365 cp->csp = p + entries;
366 cp->esp = p + entries * 2;
/illumos-gate/usr/src/boot/sys/boot/usb/tools/
H A Dsysinit.c28 * This utility sorts sysinit structure entries in binary format and
170 int entries; local
227 entries = input_len / (uint32_t)sizeof(struct sysinit_data);
229 start = do_malloc(sizeof(void *) * entries);
230 stop = start + entries;
232 for (c = 0; c != entries; c++)
246 /* sort entries, rising numerical order */
247 qsort(start, entries, sizeof(void *), &compare);
249 /* sort entries, falling numerical order */
250 qsort(start, entries, sizeo
[all...]
/illumos-gate/usr/src/tools/scripts/
H A Dhg-active.py103 entries = [i for i in act]
104 entries.sort()
106 for entry in entries:
/illumos-gate/usr/src/lib/libshell/common/tests/
H A Dvartree2.sh80 if [[ "${!dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[*]}" == "" ]] ; then
81 typeset -A dest_tree.l1["$a"].l2["$b"].l3["$c"].entries
86 new_index=$(( ${#dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[@]}+1 ))
91 if [[ "${dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[${new_index}]}" != "" ]] ; then
96 add_tree_leaf dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[${new_index}] "${index}" "${tree_mode}"
147 if [[ "${!dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[*]}" == "" ]] ; then
148 typeset -A dest_tree.l1["$a"].l2["$b"].l3["$c"].entries
153 new_index=$(( ${#dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[@]}+1 ))
158 if [[ "${dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[${new_index}]}" != "" ]] ; then
163 add_tree_leaf dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[
[all...]
H A Dsun_solaris_vartree001.sh105 if [[ "${!dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[*]}" == "" ]] ; then
106 typeset -A dest_tree.l1["$a"].l2["$b"].l3["$c"].entries
109 #dest_tree.l1["$a"].l2["$b"].l3["$c"].entries+=( "$index" )
112 new_index=$(( ${#dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[@]}+1 ))
117 if [[ "${dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[${new_index}]}" != "" ]] ; then
122 add_tree_leaf dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[${new_index}] "${index}" "${tree_mode}"
H A Dvartree1.sh75 if [[ "${!dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[*]}" == "" ]] ; then
76 typeset -A dest_tree.l1["$a"].l2["$b"].l3["$c"].entries
79 #dest_tree.l1["$a"].l2["$b"].l3["$c"].entries+=( "$index" )
82 new_index=$(( ${#dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[@]}+1 ))
87 if [[ "${dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[${new_index}]}" != "" ]] ; then
92 add_tree_leaf dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[${new_index}] "${index}" "${tree_mode}"
199 unset 'mytree_global.l1[urw].l2[itc zapfdingbats].l3[medium].entries[abcd].filenames[0]' ||
200 err_exit "variable 'mytree_global.l1[urw].l2[itc zapfdingbats].l3[medium].entries[abcd].filenames[0]' not found"
204 unset 'mytree_local.l1[urw].l2[itc zapfdingbats].l3[medium].entries[abcd].filenames[0]' ||
205 err_exit "variable 'mytree_local.l1[urw].l2[itc zapfdingbats].l3[medium].entries[abc
[all...]
/illumos-gate/usr/src/grub/grub-0.97/util/
H A Dgrub-set-default.in62 echo "More than one entries?" 1>&2
/illumos-gate/usr/src/lib/krb5/kdb/
H A Dkdb_log.h85 krb5_db_entry *entries, kdb_incr_update_t *updates, int nentries);
87 krb5_db_entry *entries, kdb_incr_update_t *updates, int nentries);
H A Dkdb5.h66 krb5_db_entry *entries,
72 krb5_db_entry *entries,
81 krb5_db_entry *entries,
/illumos-gate/usr/src/uts/common/inet/
H A Dilb.h176 * Flags for listing NAT/persistence table entries
208 /* List NAT table entries command struct */
213 ilb_nat_entry_t entries[1]; member in struct:__anon4702
223 /* List sticky table entries command struct */
228 ilb_sticky_entry_t entries[1]; member in struct:__anon4704

Completed in 173 milliseconds

12345678