HomeSort by relevance Sort by last modified time
    Searched defs:entry (Results 1 - 25 of 328) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /netvirt/usr/src/cmd/fmli/oh/
pathott.c 45 register struct ott_entry *entry; local
61 if ((entry = name_to_ott(name = filename(path))) == NULL &&
62 (entry = dname_to_ott(name)) == NULL) {
77 return(entry);
path_to_vp.c 47 struct ott_entry *entry; local
54 if ((entry = path_to_ott(path)) == NULL)
56 convert = obj_to_oot(entry->objtype)[OF_MV];
58 if (entry->objmask & M_EN) {
65 sprintf(Holdpath, "%s%sv.%s", Oasys, viewdir, entry->objtype);
69 sprintf(Holdpath, "%s/.v%s", entry->dirpath, entry->name);
  /netvirt/usr/src/cmd/krb5/kadmin/ktutil/
ktutil.h 50 krb5_keytab_entry *entry; member in struct:_krb5_kt_list
  /netvirt/usr/src/cmd/perl/5.8.4/distrib/t/cmd/
while.t 64 entry: while (<fh>) { label
65 next entry if /vt100/;
  /netvirt/usr/src/cmd/tnf/tnfdump/
state.h 43 typedef struct entry { struct
  /netvirt/usr/src/cmd/cmd-inet/usr.sbin/in.ftpd/
xferlog.c 29 struct aclmember *entry = (struct aclmember *)NULL; local
33 while (getaclentry("xferlog", &entry)) {
timeout.c 47 struct aclmember *entry = NULL; local
48 while (getaclentry("timeout", &entry)) {
getpwnam.c 30 char *entry=(char *) malloc(1024); local
34 if(!fgets(entry,1024,stream)) {
35 free(entry);
39 tmp=strdup(entry);
44 free(tmp); free(entry); free(p); return NULL;
46 tmp2=strchr(entry,':')+1;
52 free(tmp); free(entry); free(p->pw_name); free(p); return NULL;
60 free(tmp); free(entry); free(p->pw_passwd); free(p->pw_name); free(p); return NULL;
69 free(tmp); free(entry); free(p->pw_passwd); free(p->pw_name); free(p); return NULL;
78 free(tmp); free(entry); free(p->pw_passwd); free(p->pw_name); free(p); return NULL
    [all...]
  /netvirt/usr/src/lib/gss_mechs/mech_krb5/krb5/keytab/
read_servi.c 59 krb5_keytab_entry entry; local
77 kerror = krb5_kt_get_entry(context, id, principal, vno, enctype, &entry);
83 krb5_copy_keyblock(context, &entry.key, key);
85 krb5_kt_free_entry(context, &entry);
  /netvirt/usr/src/uts/common/brand/lx/syscall/
lx_thread_area.c 44 int entry; local
46 if (fuword32(&inf->entry_number, (uint32_t *)&entry))
49 if (entry < GDT_TLSMIN || entry > GDT_TLSMAX)
52 dscrp = jlwp->br_tls + entry - GDT_TLSMIN;
59 ldt_inf.entry_number = entry;
73 int entry; local
79 entry = ldt_inf.entry_number;
80 if (entry == -1) {
82 * find an empty entry in the tls for this threa
    [all...]
  /netvirt/usr/src/cmd/loadkeys/
loadkeys.y 130 static keyentry *makeentry(int tablemask, int entry);
225 * We do that by trying to get the entry for keystation 0 and that
248 * the base entry.
257 * the base entry.
413 * Allocate and fill in a new entry.
416 makeentry(tablemask, entry)
418 int entry;
428 kep->ke_entry.kio_entry = (u_short)entry;
429 index = entry - STRING;
502 struct kiockeymap entry;
611 entry: label
    [all...]
  /netvirt/usr/src/cmd/modload/
plcysubr.h 37 char *entry; /* entry w/ escaped newlines removed */ member in struct:fileentry
  /netvirt/usr/src/cmd/sgs/rtld/amd64/
dlamd64getunwind.c 124 int entry = enter(); local
143 if (entry)
  /netvirt/usr/src/lib/libc/amd64/sys/
uadmin.c 33 * in a transient entry in /[stub]boot/grub/menu.lst
112 /* are we rebooting to a GRUB menu entry? */
114 int entry = strtol(bargs, NULL, 10); local
117 altroot, entry);
  /netvirt/usr/src/lib/libc/i386/sys/
uadmin.c 33 * in a transient entry in /[stub]boot/grub/menu.lst
112 /* are we rebooting to a GRUB menu entry? */
114 int entry = strtol(bargs, NULL, 10); local
117 altroot, entry);
  /netvirt/usr/src/lib/libc/port/gen/
confstr.c 96 config *entry; local
120 entry = (config *)default_conf;
122 if (name == entry->config_value) {
126 conf_length = strlen(entry->value) + 1;
128 (void) strncpy(buf, entry->value, length);
133 entry++;
136 /* If the entry was not found in table return an error */
  /netvirt/usr/src/uts/common/io/drm/
drm_scatter.c 47 drm_sg_cleanup(drm_sg_mem_t *entry)
49 if (entry->busaddr) {
50 drm_free(entry->busaddr,
51 entry->pages * sizeof (entry->busaddr),
53 entry->busaddr = NULL;
55 if (entry->virtual) {
56 ddi_umem_free(entry->sg_umem_cookie);
57 entry->virtual = NULL;
59 if (entry) {
71 drm_sg_mem_t *entry; local
156 drm_sg_mem_t *entry; local
    [all...]
  /netvirt/usr/src/cmd/cmd-crypto/kmfcfg/
uninstall.c 49 conf_entry_t *entry = NULL; local
107 entry = get_keystore_entry(keystore_name);
108 if (entry == NULL) {
  /netvirt/usr/src/cmd/ipf/lib/common/
printhash_live.c 26 iphtent_t entry, *top, *node; local
44 iter.ili_data = &entry;
55 if (entry.ipe_snext == NULL)
57 entry.ipe_snext = top;
61 bcopy(&entry, top, sizeof(entry));
printpool_live.c 26 ip_pool_node_t entry, *top, *node; local
44 iter.ili_data = &entry;
55 if (entry.ipn_next == NULL)
57 entry.ipn_next = top;
61 bcopy(&entry, top, sizeof(entry));
  /netvirt/usr/src/cmd/print/conv_fix/
conv_fix.c 45 * char *(return) - an entry from the stream
55 char entry[BUFSIZ], *tmp; local
58 size = sizeof (entry);
59 tmp = entry;
61 /* find an entry */
63 if ((tmp == entry) && ((*tmp == '#') || (*tmp == '\n'))) {
82 if (tmp == entry)
85 return (strdup(entry));
  /netvirt/usr/src/cmd/svc/startd/
dict.c 41 * id. To implement dictionary entry delete, the locking strategy for graph
74 dict_entry_t *entry, tmp; local
80 if ((entry = uu_list_find(dictionary->dict_list, &tmp, NULL,
84 id = entry->de_id;
101 dict_entry_t *entry, tmp; local
110 if ((entry = uu_list_find(dictionary->dict_list, &tmp, NULL,
113 return (entry->de_id);
116 entry = startd_alloc(sizeof (dict_entry_t));
118 entry->de_id = dictionary->dict_new_id++;
119 entry->de_name = startd_alloc(strlen(name) + 1)
    [all...]
  /netvirt/usr/src/cmd/ypcmd/
yp_getalias.c 118 listofnames *entry; local
136 for (entry = list, strcpy(name, entry->name); entry;
137 entry = entry->nextname, strcpy(name, entry->name)) {
168 listofnames *entry; local
186 for (entry = list, strcpy(name, entry->name)
    [all...]
  /netvirt/usr/src/head/
search.h 53 typedef struct entry { char *key, *data; } ENTRY; struct
59 ENTRY *hsearch(ENTRY, ACTION);
69 ENTRY *hsearch();
  /netvirt/usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/
search.h 54 typedef struct entry { struct
57 } ENTRY;
69 ENTRY *hsearch __P((ENTRY, ACTION));

Completed in 1889 milliseconds

1 2 3 4 5 6 7 8 91011>>