Searched refs:entry (Results 76 - 100 of 1421) sorted by relevance

1234567891011>>

/freebsd-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/docsExamples/
H A Drwtime.d38 syscall::read:entry,
39 syscall::write:entry
H A Dtruss.d45 syscall::read:entry
51 syscall::write:entry
H A Dtrussrw.d40 syscall::read:entry,
41 syscall::write:entry
/freebsd-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/fbtprovider/
H A Dtst.tailcall.d39 fbt::kern_ioctl:entry
44 fbt:::entry
H A Derr.D_PDESC_ZERO.notreturn.d46 fbt::bar:entry
/freebsd-11-stable/crypto/heimdal/admin/
H A Dcopy.c55 krb5_keytab_entry entry, dummy; local
82 &entry, &cursor)) == 0) {
85 ret = krb5_unparse_name (context, entry.principal, &name_str);
90 ret = krb5_enctype_to_string(context, entry.keyblock.keytype, &etype_str);
96 entry.principal,
97 entry.vno,
98 entry.keyblock.keytype,
101 /* this entry is already in the new keytab, so no need to
104 if(!compare_keyblock(&entry.keyblock, &dummy.keyblock)) {
105 krb5_warnx(context, "entry wit
[all...]
/freebsd-11-stable/tools/tools/mtxstat/
H A Dmtxstat.pl87 my %entry;
89 $entry{$_} = ($_ eq 'name') ? shift(@fields) : 0.0 + shift(@fields);
92 $entry{'name'} =~ s/^(\S+)\s+\((.*)\)$/$2/;
94 my $name = $entry{'name'};
96 if ($entry{'max'} > $data{$name}->{'max'}) {
97 $data{$name}->{'max'} = $entry{'max'};
99 $data{$name}->{'total'} += $entry{'total'};
100 $data{$name}->{'count'} += $entry{'count'};
104 $data{$name} = \%entry;
/freebsd-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/raise/
H A Dtst.raise1.d46 syscall::getpid:entry
57 syscall::exit:entry
H A Dtst.raise3.d46 syscall::getpid:entry
57 syscall::exit:entry
/freebsd-11-stable/sys/dev/drm/
H A Ddrm_agpsupport.c171 drm_agp_mem_t *entry; local
180 entry = malloc(sizeof(*entry), DRM_MEM_AGPLISTS, M_NOWAIT | M_ZERO);
181 if (entry == NULL)
191 free(entry, DRM_MEM_AGPLISTS);
195 entry->handle = handle;
196 entry->bound = 0;
197 entry->pages = pages;
198 entry->prev = NULL;
199 entry
232 drm_agp_mem_t *entry; local
242 drm_agp_mem_t *entry; local
279 drm_agp_mem_t *entry; local
320 drm_agp_mem_t *entry; local
[all...]
H A Ddrm_hashtab.c60 struct drm_hash_item *entry; local
68 LIST_FOREACH(entry, h_list, head)
69 DRM_DEBUG("count %d, key: 0x%08lx\n", count++, entry->key);
75 struct drm_hash_item *entry; local
81 LIST_FOREACH(entry, h_list, head) {
82 if (entry->key == key)
83 return entry;
84 if (entry->key > key)
93 struct drm_hash_item *entry, *parent; local
101 LIST_FOREACH(entry, h_lis
147 struct drm_hash_item *entry; local
159 struct drm_hash_item *entry; local
[all...]
/freebsd-11-stable/usr.sbin/bsnmpd/modules/snmp_hostres/
H A Dhostres_device_tbl.c98 * Create a new entry out of thin air.
103 struct device_entry *entry = NULL; local
179 if ((entry = malloc(sizeof(*entry))) == NULL) {
183 memset(entry, 0, sizeof(*entry));
185 entry->index = map->hrIndex;
186 map->entry_p = entry;
188 if ((entry->name = strdup(map->name_key)) == NULL) {
190 free(entry);
260 device_entry_delete(struct device_entry *entry) argument
300 struct device_entry *entry; local
373 struct device_entry *entry; local
555 struct device_entry *entry, *entry_tmp; local
626 struct device_entry *entry; local
[all...]
H A Dhostres_printer_tbl.c68 * This structure is used to hold a SNMP table entry
89 * Create entry into the printer table.
94 struct printer_entry *entry = NULL; local
100 if ((entry = malloc(sizeof(*entry))) == NULL) {
104 memset(entry, 0, sizeof(*entry));
105 entry->index = devEntry->index;
106 INSERT_OBJECT_INT(entry, &printer_tbl);
107 return (entry);
114 printer_entry_delete(struct printer_entry *entry) argument
131 struct printer_entry *entry; local
320 struct printer_entry *entry; local
354 struct printer_entry *entry; local
[all...]
H A Dhostres_diskstorage_tbl.c76 * This structure is used to hold a SNMP table entry for HOST-RESOURCES-MIB's
146 * Create a new entry into the DiskStorageTable.
151 struct disk_entry *entry; local
157 if ((entry = malloc(sizeof(*entry))) == NULL) {
162 memset(entry, 0, sizeof(*entry));
163 entry->index = devEntry->index;
164 INSERT_OBJECT_INT(entry, &disk_tbl);
166 return (entry);
173 disk_entry_delete(struct disk_entry *entry) argument
200 struct disk_entry *entry; local
213 disk_query_disk(struct disk_entry *entry) argument
253 struct device_entry *entry; local
341 struct device_entry *entry; local
403 struct device_entry *entry; local
512 struct disk_entry *entry, *entry_tmp; local
601 struct disk_entry *entry; local
[all...]
/freebsd-11-stable/sys/contrib/ck/src/
H A Dck_hp.c97 ck_stack_entry_t *entry; local
103 CK_STACK_FOREACH(&global->subscribers, entry) {
104 record = ck_hp_record_container(entry);
120 ck_hp_unregister(struct ck_hp_record *entry) argument
123 entry->n_pending = 0;
124 entry->n_peak = 0;
125 entry->n_reclamations = 0;
126 ck_stack_init(&entry->pending);
128 ck_pr_store_int(&entry->state, CK_HP_FREE);
129 ck_pr_inc_uint(&entry
134 ck_hp_register(struct ck_hp *state, struct ck_hp_record *entry, void **pointers) argument
165 ck_hp_member_scan(ck_stack_entry_t *entry, unsigned int degree, void *pointer) argument
193 ck_stack_entry_t *entry; local
227 ck_stack_entry_t *previous, *entry, *next; local
[all...]
/freebsd-11-stable/lib/libc/stdlib/
H A Dhsearch_r.c39 * Look up an unused entry in the hash table for a given hash. For this
49 ENTRY *entry = &hsearch->entries[index & hsearch->index_mask]; local
50 if (entry->key == NULL)
51 return (entry);
79 ENTRY *entry, *old_entries, *new_entries; local
86 * Search the hash table for an existing entry for this key.
87 * Stop searching if we run into an unused hash table entry.
90 entry = &hsearch->entries[index & hsearch->index_mask];
91 if (entry->key == NULL)
93 if (strcmp(entry
[all...]
/freebsd-11-stable/lib/libmt/
H A Dmtlib.h92 void mt_status_tree_sbuf(struct sbuf *sb, struct mt_status_entry *entry,
94 struct mt_status_entry *entry, void *arg), void *arg);
95 void mt_status_tree_print(struct mt_status_entry *entry, int indent,
96 void (*print_func)(struct mt_status_entry *entry,
98 struct mt_status_entry *mt_entry_find(struct mt_status_entry *entry,
102 void mt_status_entry_free(struct mt_status_entry *entry);
104 void mt_entry_sbuf(struct sbuf *sb, struct mt_status_entry *entry, char *fmt);
105 void mt_param_parent_print(struct mt_status_entry *entry,
107 void mt_param_parent_sbuf(struct sbuf *sb, struct mt_status_entry *entry,
109 void mt_param_entry_sbuf(struct sbuf *sb, struct mt_status_entry *entry,
[all...]
/freebsd-11-stable/sys/vm/
H A Dvm_map.c114 * [That is, an entry is split into two, bordering at a
133 static void vm_map_entry_deallocate(vm_map_entry_t entry, boolean_t system_map);
134 static void vm_map_entry_dispose(vm_map_t map, vm_map_entry_t entry);
135 static void vm_map_entry_unwire(vm_map_t map, vm_map_entry_t entry);
147 static void vm_map_wire_entry_failure(vm_map_t map, vm_map_entry_t entry,
183 * Map and entry structures are allocated from the general
507 vm_map_entry_t entry, next; local
511 entry = td->td_map_def_user;
513 while (entry != NULL) {
514 next = entry
811 vm_map_entry_dispose(vm_map_t map, vm_map_entry_t entry) argument
843 vm_map_entry_set_behavior(vm_map_entry_t entry, u_char behavior) argument
855 vm_map_entry_set_max_free(vm_map_entry_t entry) argument
983 vm_map_entry_link(vm_map_t map, vm_map_entry_t after_where, vm_map_entry_t entry) argument
1023 vm_map_entry_unlink(vm_map_t map, vm_map_entry_t entry) argument
1061 vm_map_entry_resize_free(vm_map_t map, vm_map_entry_t entry) argument
1087 vm_map_lookup_entry( vm_map_t map, vm_offset_t address, vm_map_entry_t *entry) argument
1381 vm_map_entry_t entry; local
1599 vm_map_simplify_entry(vm_map_t map, vm_map_entry_t entry) argument
1695 _vm_map_clip_start(vm_map_t map, vm_map_entry_t entry, vm_offset_t start) argument
1782 _vm_map_clip_end(vm_map_t map, vm_map_entry_t entry, vm_offset_t end) argument
1864 vm_map_entry_t entry; local
2002 vm_map_entry_t current, entry, in_tran; local
2177 vm_map_entry_t current, entry; local
2362 vm_map_entry_t entry; local
2404 vm_map_entry_t entry, first_entry, tmp_entry; local
2566 vm_map_wire_entry_failure(vm_map_t map, vm_map_entry_t entry, vm_offset_t failed_addr) argument
2603 vm_map_entry_t entry, first_entry, tmp_entry; local
2867 vm_map_entry_t entry; local
2952 vm_map_entry_unwire(vm_map_t map, vm_map_entry_t entry) argument
2965 vm_map_entry_deallocate(vm_map_entry_t entry, boolean_t system_map) argument
2979 vm_map_entry_delete(vm_map_t map, vm_map_entry_t entry) argument
3063 vm_map_entry_t entry; local
3189 vm_map_entry_t entry; local
3352 vmspace_map_entry_forked(const struct vmspace *vm1, struct vmspace *vm2, vm_map_entry_t entry) argument
4051 vm_map_entry_t entry; local
4234 vm_map_entry_t entry; local
4306 vm_map_lookup_done(vm_map_t map, vm_map_entry_t entry) argument
4344 vm_map_entry_t entry; local
[all...]
/freebsd-11-stable/sys/kern/
H A Dsubr_acl_nfs4.c114 const struct acl_entry *entry; local
123 entry = &(aclp->acl_entry[i]);
125 if (entry->ae_entry_type != ACL_ENTRY_TYPE_ALLOW &&
126 entry->ae_entry_type != ACL_ENTRY_TYPE_DENY)
128 if (entry->ae_flags & ACL_ENTRY_INHERIT_ONLY)
130 switch (entry->ae_tag) {
136 if (entry->ae_id != cred->cr_uid)
144 if (!groupmember(entry->ae_id, cred))
148 KASSERT(entry->ae_tag == ACL_EVERYONE,
149 ("entry
307 _acl_entry_matches(struct acl_entry *entry, acl_tag_t tag, acl_perm_t perm, acl_entry_type_t entry_type) argument
332 struct acl_entry *entry; local
370 struct acl_entry *entry, *copy, *previous, local
728 const struct acl_entry *entry; local
857 struct acl_entry *entry, *copy; local
1020 struct acl_entry *entry; local
1313 const struct acl_entry *entry; local
[all...]
/freebsd-11-stable/crypto/heimdal/lib/hdb/
H A Dcommon.c103 unsigned flags, krb5_kvno kvno, hdb_entry_ex *entry)
132 code = hdb_value2entry(context, &value, &entry->entry);
152 code = hdb_value2entry(context, &value, &entry->entry);
160 code = hdb_unseal_keys (context, db, &entry->entry);
162 hdb_free_entry(context, entry);
209 unsigned flags, hdb_entry_ex *entry)
216 code = hdb_entry_get_aliases(&entry
102 _hdb_fetch_kvno(krb5_context context, HDB *db, krb5_const_principal principal, unsigned flags, krb5_kvno kvno, hdb_entry_ex *entry) argument
208 hdb_add_aliases(krb5_context context, HDB *db, unsigned flags, hdb_entry_ex *entry) argument
240 hdb_check_aliases(krb5_context context, HDB *db, hdb_entry_ex *entry) argument
282 _hdb_store(krb5_context context, HDB *db, unsigned flags, hdb_entry_ex *entry) argument
[all...]
H A Dhdb-keytab.c92 unsigned flags, hdb_entry_ex *entry)
99 hdb_entry_ex * entry)
121 unsigned flags, krb5_kvno kvno, hdb_entry_ex * entry)
134 entry->entry.flags.server = 1;
135 entry->entry.flags.forwardable = 1;
136 entry->entry.flags.renewable = 1;
140 &entry
91 hkt_firstkey(krb5_context context, HDB *db, unsigned flags, hdb_entry_ex *entry) argument
98 hkt_nextkey(krb5_context context, HDB * db, unsigned flags, hdb_entry_ex * entry) argument
120 hkt_fetch_kvno(krb5_context context, HDB * db, krb5_const_principal principal, unsigned flags, krb5_kvno kvno, hdb_entry_ex * entry) argument
174 hkt_store(krb5_context context, HDB * db, unsigned flags, hdb_entry_ex * entry) argument
[all...]
/freebsd-11-stable/sys/dev/drm2/
H A Ddrm_hashtab.c61 struct drm_hash_item *entry; local
69 LIST_FOREACH(entry, h_list, head)
70 DRM_DEBUG("count %d, key: 0x%08lx\n", count++, entry->key);
76 struct drm_hash_item *entry; local
82 LIST_FOREACH(entry, h_list, head) {
83 if (entry->key == key)
84 return entry;
85 if (entry->key > key)
94 struct drm_hash_item *entry, *parent; local
102 LIST_FOREACH(entry, h_lis
150 struct drm_hash_item *entry; local
163 struct drm_hash_item *entry; local
[all...]
/freebsd-11-stable/contrib/netbsd-tests/lib/libc/gen/
H A Dt_dir.c55 struct dirent *entry; local
77 entry = readdir(dp);
78 ATF_REQUIRE_MSG(entry != NULL, "readdir[%s] failed: %s",
81 entry = readdir(dp);
82 ATF_REQUIRE_MSG(entry != NULL, "readdir[%s] failed: %s",
85 /* get first entry */
86 entry = readdir(dp);
87 ATF_REQUIRE_MSG(entry != NULL, "readdir[%s] failed: %s",
93 /* get second entry */
94 entry
[all...]
/freebsd-11-stable/contrib/mdocml/
H A Ddba.c87 struct macro_entry *entry; local
91 for (entry = ohash_first(macro, &slot); entry != NULL;
92 entry = ohash_next(macro, &slot)) {
93 dba_array_free(entry->pages);
94 free(entry);
161 struct dba_array *page, *entry; local
164 entry = dba_array_new(1, DBA_STR | DBA_GROW);
165 dba_array_add(page, entry);
166 entry
191 char *entry; local
221 char *entry; local
273 struct dba_array *page, *entry; local
343 struct macro_entry *entry; local
367 struct macro_entry *entry; local
389 struct macro_entry *entry; local
434 struct macro_entry **entries, *entry; local
[all...]
/freebsd-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/builtinvar/
H A Dtst.arg1to8clause.d42 syscall:::entry

Completed in 276 milliseconds

1234567891011>>