Home
last modified time | relevance | path

Searched refs:entries (Results 1 – 25 of 1348) sorted by relevance

12345678910>>...54

/freebsd/sys/kern/
H A Dsubr_filter.c97 tf->entries[i].value = set_val; in setup_time_filter()
98 tf->entries[i].time_up = 0; in setup_time_filter()
128 tf->entries[i].value = set_val; in setup_time_filter_small()
129 tf->entries[i].time_up = 0; in setup_time_filter_small()
142 tim = now - tf->entries[i].time_up; in check_update_times()
147 if (tf->entries[i].time_up < tf->entries[j].time_up) { in check_update_times()
148 tf->entries[i].value = tf->entries[j].value; in check_update_times()
149 tf->entries[i].time_up = tf->entries[j].time_up; in check_update_times()
156 tf->entries[i].value = value; in check_update_times()
157 tf->entries[i].time_up = now; in check_update_times()
[all …]
/freebsd/contrib/libarchive/libarchive/test/
H A Dtest_write_format_mtree_classic.c37 } entries[] = {
126 /* Write entries */ in test_write_format_mtree_sub()
127 for (i = 0; entries[i].path != NULL; i++) { in test_write_format_mtree_sub()
129 archive_entry_set_nlink(ae, entries[i].nlink); in test_write_format_mtree_sub()
130 assertEqualInt(entries[i].nlink, archive_entry_nlink(ae)); in test_write_format_mtree_sub()
131 archive_entry_set_mtime(ae, entries[i].mtime, 0); in test_write_format_mtree_sub()
132 assertEqualInt(entries[i].mtime, archive_entry_mtime(ae)); in test_write_format_mtree_sub()
133 archive_entry_set_mode(ae, entries[i].mode); in test_write_format_mtree_sub()
134 assertEqualInt(entries[i].mode, archive_entry_mode(ae)); in test_write_format_mtree_sub()
135 archive_entry_set_uid(ae, entries[ in test_write_format_mtree_sub()
38 } entries[] = { global() variable
[all...]
H A Dtest_write_format_mtree_classic_indent.c37 } entries[] = {
128 /* Write entries */ in test_write_format_mtree_sub()
129 for (i = 0; entries[i].path != NULL; i++) { in test_write_format_mtree_sub()
131 archive_entry_set_nlink(ae, entries[i].nlink); in test_write_format_mtree_sub()
132 assertEqualInt(entries[i].nlink, archive_entry_nlink(ae)); in test_write_format_mtree_sub()
133 archive_entry_set_mtime(ae, entries[i].mtime, 0); in test_write_format_mtree_sub()
134 assertEqualInt(entries[i].mtime, archive_entry_mtime(ae)); in test_write_format_mtree_sub()
135 archive_entry_set_mode(ae, entries[i].mode); in test_write_format_mtree_sub()
136 assertEqualInt(entries[i].mode, archive_entry_mode(ae)); in test_write_format_mtree_sub()
137 archive_entry_set_uid(ae, entries[ in test_write_format_mtree_sub()
38 } entries[] = { global() variable
[all...]
H A Dtest_write_format_mtree_absolute.c37 } entries[] = { variable
83 for (i = 0; entries[i].path != NULL; i++) { in DEFINE_TEST()
85 archive_entry_set_nlink(ae, entries[i].nlink); in DEFINE_TEST()
86 assertEqualInt(entries[i].nlink, archive_entry_nlink(ae)); in DEFINE_TEST()
87 archive_entry_set_mtime(ae, entries[i].mtime, 0); in DEFINE_TEST()
88 assertEqualInt(entries[i].mtime, archive_entry_mtime(ae)); in DEFINE_TEST()
89 archive_entry_set_mode(ae, entries[i].mode); in DEFINE_TEST()
90 assertEqualInt(entries[i].mode, archive_entry_mode(ae)); in DEFINE_TEST()
91 archive_entry_set_uid(ae, entries[i].uid); in DEFINE_TEST()
92 assertEqualInt(entries[i].uid, archive_entry_uid(ae)); in DEFINE_TEST()
[all …]
H A Dtest_write_format_mtree.c36 } entries[] = { variable
89 for (i = 0; entries[i].path != NULL; i++) { in test_write_format_mtree_sub()
91 archive_entry_set_mtime(ae, entries[i].mtime, 0); in test_write_format_mtree_sub()
92 assert(entries[i].mtime == archive_entry_mtime(ae)); in test_write_format_mtree_sub()
93 archive_entry_set_mode(ae, entries[i].mode); in test_write_format_mtree_sub()
94 assert(entries[i].mode == archive_entry_mode(ae)); in test_write_format_mtree_sub()
95 archive_entry_set_uid(ae, entries[i].uid); in test_write_format_mtree_sub()
96 assert(entries[i].uid == archive_entry_uid(ae)); in test_write_format_mtree_sub()
97 archive_entry_set_gid(ae, entries[i].gid); in test_write_format_mtree_sub()
98 assert(entries[i].gid == archive_entry_gid(ae)); in test_write_format_mtree_sub()
[all …]
/freebsd/lib/libc/tests/sys/
H A Dqueue_test.c44 SLIST_ENTRY(entry) entries; in ATF_TC_BODY()
57 SLIST_FOREACH(np, &head, entries) { in ATF_TC_BODY()
68 SLIST_INSERT_HEAD(&head, n1, entries); in ATF_TC_BODY()
74 SLIST_FOREACH(np, &head, entries) { in ATF_TC_BODY()
88 SLIST_INSERT_AFTER(n1, n2, entries); in ATF_TC_BODY()
94 SLIST_INSERT_AFTER(n2, n3, entries); in ATF_TC_BODY()
97 SLIST_FOREACH(np, &head, entries) { in ATF_TC_BODY()
110 SLIST_REMOVE_HEAD(&head, entries); in ATF_TC_BODY()
117 SLIST_FOREACH(np, &head, entries) { in ATF_TC_BODY()
127 SLIST_REMOVE_AFTER(n2, entries); in ATF_TC_BODY()
[all …]
/freebsd/crypto/openssl/crypto/x509/
H A Dx_name.c96 if ((ret->entries = sk_X509_NAME_ENTRY_new_null()) == NULL) { in IMPLEMENT_EXTERN_ASN1()
110 sk_X509_NAME_ENTRY_free(ret->entries); in IMPLEMENT_EXTERN_ASN1()
125 sk_X509_NAME_ENTRY_pop_free(a->entries, X509_NAME_ENTRY_free); in x509_name_ex_free()
160 STACK_OF(X509_NAME_ENTRY) *entries; in x509_name_ex_d2i()
186 entries = sk_STACK_OF_X509_NAME_ENTRY_value(intname.s, i); in x509_name_ex_d2i()
187 for (j = 0; j < sk_X509_NAME_ENTRY_num(entries); j++) { in x509_name_ex_d2i()
188 entry = sk_X509_NAME_ENTRY_value(entries, j); in x509_name_ex_d2i()
190 if (!sk_X509_NAME_ENTRY_push(nm.x->entries, entry)) in x509_name_ex_d2i()
192 (void)sk_X509_NAME_ENTRY_set(entries, j, NULL); in x509_name_ex_d2i()
246 STACK_OF(X509_NAME_ENTRY) *entries = NULL; in x509_name_encode()
[all …]
/freebsd/sys/cam/
H A Dcam_queue.c89 KASSERT(new_size >= queue->entries, ("camq_resize: " in camq_resize()
91 new_size, queue->entries)); in camq_resize()
105 (queue->entries + 1) * sizeof(cam_pinfo *)); in camq_resize()
122 KASSERT(queue->entries < queue->array_size, in camq_insert()
124 queue->entries, queue->array_size)); in camq_insert()
125 queue->entries++; in camq_insert()
126 queue->queue_array[queue->entries] = new_entry; in camq_insert()
127 new_entry->index = queue->entries; in camq_insert()
128 if (queue->entries != 0) in camq_insert()
129 heap_up(queue->queue_array, queue->entries); in camq_insert()
[all …]
/freebsd/sys/dev/mlx4/mlx4_core/
H A Dmlx4_port.c68 table->entries[i] = 0; in mlx4_init_mac_table()
82 table->entries[i] = 0; in mlx4_init_vlan_table()
105 if (index < 0 || index >= table->max || !table->entries[index]) { in validate_index()
120 (MLX4_MAC_MASK & be64_to_cpu(table->entries[i]))) in find_index()
128 __be64 *entries) in mlx4_set_port_mac_table() argument
138 memcpy(mailbox->buf, entries, MLX4_MAC_TABLE_SIZE); in mlx4_set_port_mac_table()
160 if (mac == (MLX4_MAC_MASK & be64_to_cpu(table->entries[i]))) { in mlx4_find_cached_mac()
216 if (((MLX4_MAC_MASK & mac) == (MLX4_MAC_MASK & be64_to_cpu(table->entries[i])))) in __mlx4_register_mac()
218 if (((MLX4_MAC_MASK & mac) == (MLX4_MAC_MASK & be64_to_cpu(dup_table->entries[i])))) in __mlx4_register_mac()
243 ((MLX4_MAC_MASK & mac) == (MLX4_MAC_MASK & be64_to_cpu(table->entries[index_at_dup_port])))) in __mlx4_register_mac()
[all …]
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/dedup/
H A Ddedup_bclone_pruned.ksh87 typeset entries=$(zpool status -D $TESTPOOL | \
89 log_must test "$entries" -eq 8
102 entries=$(zpool status -D $TESTPOOL | \
104 [[ -z "$entries" || "$entries" -eq 0 ]] || \
105 log_fail "DDT entries not pruned: $entries remain"
125 typeset entries=$(zpool status -D $TESTPOOL | \
127 log_must test "$entries" -eq 8
136 entries=$(zpool status -D $TESTPOOL | \
138 log_must test "$entries" -eq 8
H A Ddedup_prune.ksh64 typeset -i entries=$(zpool status -D $TESTPOOL | \
67 echo ${entries}
79 entries=$(ddt_entries)
80 log_note "ddt entries before: $entries"
85 [[ "$entries" -eq "$new_entries" ]] || \
86 log_fail "DDT entries changed from $entries to $new_entries"
96 log_fail "DDT entries did not shrink enough: $entries -> $new_entries"
/freebsd/crypto/heimdal/lib/krb5/
H A Dkeytab_memory.c39 krb5_keytab_entry *entries; member
88 d->entries = NULL; in mkt_resolve()
123 krb5_kt_free_entry(context, &d->entries[i]); in mkt_close()
124 free(d->entries); in mkt_close()
159 return krb5_kt_copy_entry_contents(context, &d->entries[c->fd++], entry); in mkt_next_entry()
177 tmp = realloc(d->entries, (d->num_entries + 1) * sizeof(*d->entries)); in mkt_add_entry()
183 d->entries = tmp; in mkt_add_entry()
185 &d->entries[d->num_entries++]); in mkt_add_entry()
203 for(end = d->entries + d->num_entries, e = end - 1; e >= d->entries; e--) { in mkt_remove_entry()
218 e = realloc(d->entries, d->num_entries * sizeof(*d->entries)); in mkt_remove_entry()
[all …]
/freebsd/sys/dev/vmware/vmci/
H A Dvmci_hashtable.c53 table->entries = vmci_alloc_kernel_mem(sizeof(*table->entries) * size, in vmci_hashtable_create()
55 if (table->entries == NULL) { in vmci_hashtable_create()
59 memset(table->entries, 0, sizeof(*table->entries) * size); in vmci_hashtable_create()
63 vmci_free_kernel_mem(table->entries, sizeof(*table->entries) * size); in vmci_hashtable_create()
97 vmci_free_kernel_mem(table->entries, sizeof(*table->entries) * in vmci_hashtable_destroy()
99 table->entries = NULL; in vmci_hashtable_destroy()
170 entry->next = table->entries[idx]; in vmci_hashtable_add_entry()
171 table->entries[idx] = entry; in vmci_hashtable_add_entry()
253 cur = table->entries[idx]; in vmci_hashtable_get_entry_locked()
475 entry = table->entries[idx]; in vmci_hashtable_entry_exists_locked()
[all …]
/freebsd/usr.bin/column/
H A Dcolumn.c59 static int entries; /* number of records */ variable
137 if (!entries) in main()
163 if (!--entries) in c_columnate()
187 numrows = entries / numcols; in r_columnate()
188 if (entries % numcols) in r_columnate()
196 if ((base += numrows) >= entries) in r_columnate()
214 for (cnt = entries, lp = list; cnt--; ++lp) in print()
235 if ((t = tbl = calloc(entries, sizeof(TBL))) == NULL) in maketbl()
241 for (cnt = 0, lp = list; cnt < entries; ++cnt, ++lp, ++t) { in maketbl()
278 for (cnt = 0, t = tbl; cnt < entries; ++cnt, ++t) { in maketbl()
[all …]
/freebsd/usr.sbin/bluetooth/hccontrol/
H A Dnode.c224 r.entries = calloc(NG_HCI_MAX_NEIGHBOR_NUM, in hci_read_neighbor_cache()
226 if (r.entries == NULL) { in hci_read_neighbor_cache()
246 uint8_t addrtype = r.entries[n].addrtype; in hci_read_neighbor_cache()
256 hci_bdaddr2str(&r.entries[n].bdaddr), in hci_read_neighbor_cache()
257 r.entries[n].features[0], r.entries[n].features[1], in hci_read_neighbor_cache()
258 r.entries[n].features[2], r.entries[n].features[3], in hci_read_neighbor_cache()
259 r.entries[n].features[4], r.entries[ in hci_read_neighbor_cache()
[all...]
/freebsd/sys/contrib/dev/iwlwifi/mld/tests/
H A Dagg.c53 } entries[BA_WINDOW_SIZE]; member
244 .entries[0].sn = 101,
270 .entries[0].sn = IEEE80211_MAX_SN,
297 .entries[0].sn = 102,
323 .entries[0].sn = 101,
324 .entries[1].sn = 104,
325 .entries[2].sn = 105,
351 .entries[0].sn = 101,
352 .entries[1].sn = 103,
353 .entries[2].sn = 104,
[all …]
/freebsd/contrib/mandoc/
H A Ddba.c190 struct dba_array *entries; in dba_page_add() local
193 entries = dba_array_get(page, ie); in dba_page_add()
195 if (entries == NULL) in dba_page_add()
198 dba_array_free(entries); in dba_page_add()
205 dba_array_FOREACH(entries, entry) { in dba_page_add()
211 dba_array_add(entries, (void *)str); in dba_page_add()
220 struct dba_array *entries; in dba_page_alias() local
227 entries = dba_array_get(page, DBP_NAME); in dba_page_alias()
228 dba_array_FOREACH(entries, entry) { in dba_page_alias()
234 dba_array_add(entries, prepen in dba_page_alias()
434 struct macro_entry **entries, *entry; dba_macro_write() local
[all...]
/freebsd/contrib/ncurses/progs/
H A Dinfocmp.c65 static ENTRY *entries; /* terminfo entries */ variable
121 free(entries); in ExitProgram()
228 if (idx < NUM_BOOLEANS(&(entries[0].tterm))) { in use_predicate()
231 for (ep = &entries[1]; ep < entries + termcount; ep++) { in use_predicate()
237 if (is_set != entries[0].tterm.Booleans[idx]) in use_predicate()
250 if (idx < NUM_NUMBERS(&(entries[0].tterm))) { in use_predicate()
253 for (ep = &entries[1]; ep < entries + termcount; ep++) in use_predicate()
260 if (value != entries[0].tterm.Numbers[idx]) in use_predicate()
268 const char *termstr = entries[0].tterm.Strings[idx]; in use_predicate()
276 if (idx < NUM_STRINGS(&(entries[0].tterm))) { in use_predicate()
[all …]
/freebsd/usr.sbin/nscd/
H A Dhashtable.h62 struct entry *entries; \
76 (table)->entries = calloc(_entries_size, \
77 sizeof(*(table)->entries)); \
80 (table)->entries[var].field.capacity = \
82 (table)->entries[var].field.size = 0; \
83 (table)->entries[var].field.values = malloc( \
86 assert((table)->entries[var].field.values != NULL);\
97 free((table)->entries[var].field.values); \
102 (&((table)->entries[hash]))
108 for ((var) = &((table)->entries[0]); \
[all …]
/freebsd/usr.bin/ktrdump/
H A Dktrdump.c100 int entries; in main() local
213 entries = sb.st_size / sizeof(*buf); in main()
219 if (kvm_read(kd, nl[1].n_value, &entries, sizeof(entries)) in main()
222 if ((buf = malloc(sizeof(*buf) * entries)) == NULL) in main()
227 kvm_read(kd, bufptr, buf, sizeof(*buf) * entries) == -1 || in main()
272 i = index2 + 1 % entries; in main()
275 if (i == entries) in main()
281 i = entries - 1; in main()
359 if (++i == entries) in main()
367 i = entries - 1; in main()
[all …]
/freebsd/sys/contrib/ck/src/
H A Dck_rhs.c126 const void **entries; member
129 } entries; member
139 return (map->entries.no_entries.entries[offset]); in ck_rhs_entry()
141 return (map->entries.descs[offset].entry); in ck_rhs_entry()
149 return (&map->entries.no_entries.entries[offset]); in ck_rhs_entry_addr()
151 return (&map->entries.descs[offset].entry); in ck_rhs_entry_addr()
159 return ((struct ck_rhs_entry_desc *)(void *)&map->entries.no_entries.descs[offset]); in ck_rhs_desc()
161 return (&map->entries.descs[offset]); in ck_rhs_desc()
169 map->entries.no_entries.descs[offset].wanted++; in ck_rhs_wanted_inc()
171 map->entries.descs[offset].wanted++; in ck_rhs_wanted_inc()
[all …]
/freebsd/crypto/openssl/crypto/hashtable/
H A Dhashtable.c83 #define PREFETCH_NEIGHBORHOOD(x) __builtin_prefetch(x.entries)
120 struct ht_neighborhood_entry_st entries[NEIGHBORHOOD_LEN]; member
272 if (oldmd->neighborhoods[i].entries[j].value != NULL) { in free_oldmd()
273 v = oldmd->neighborhoods[i].entries[j].value; in free_oldmd()
370 if (md->neighborhoods[i].entries[j].value != NULL) { in ossl_ht_foreach_until()
371 if (!cb((HT_VALUE *)md->neighborhoods[i].entries[j].value, arg)) in ossl_ht_foreach_until()
403 v = md->neighborhoods[i].entries[j].value; in ossl_ht_filter()
472 oldv = oldmd->neighborhoods[oldi].entries[oldj].value; in grow_hashtable()
475 oldhash = oldmd->neighborhoods[oldi].entries[oldj].hash; in grow_hashtable()
479 if (newmd->neighborhoods[newi].entries[newj].value == NULL) { in grow_hashtable()
[all …]
/freebsd/contrib/expat/tests/
H A Dstructdata.c79 storage->entries = NULL; in StructData_Init()
93 new_entries = realloc(storage->entries, in StructData_AddItem()
96 storage->entries = new_entries; in StructData_AddItem()
99 entry = &storage->entries[storage->count]; in StructData_AddItem()
125 const StructDataEntry *got = &storage->entries[i]; in StructData_CheckItems()
156 free((void *)storage->entries[i].str); in StructData_Dispose()
157 free(storage->entries); in StructData_Dispose()
160 storage->entries = NULL; in StructData_Dispose()
/freebsd/crypto/openssh/
H A Dhostfile.c220 ret->entries = NULL; in init_hostkeys()
248 if ((tmp = recallocarray(hostkeys->entries, hostkeys->num_entries, in record_hostkey()
249 hostkeys->num_entries + 1, sizeof(*hostkeys->entries))) == NULL) in record_hostkey()
251 hostkeys->entries = tmp; in record_hostkey()
252 hostkeys->entries[hostkeys->num_entries].host = xstrdup(ctx->host); in record_hostkey()
253 hostkeys->entries[hostkeys->num_entries].file = xstrdup(l->path); in record_hostkey()
254 hostkeys->entries[hostkeys->num_entries].line = l->linenum; in record_hostkey()
255 hostkeys->entries[hostkeys->num_entries].key = l->key; in record_hostkey()
257 hostkeys->entries[hostkeys->num_entries].marker = l->marker; in record_hostkey()
258 hostkeys->entries[hostkeys->num_entries].note = l->note; in record_hostkey()
[all …]
/freebsd/usr.bin/gencat/
H A Dgencat.c90 LIST_ENTRY(_msgT) entries;
96 LIST_ENTRY(_setT) entries;
498 set = set->entries.le_next) {
502 msg = msg->entries.le_next) {
549 set = set->entries.le_next) {
553 msg = msg->entries.le_next) {
595 for (; p != NULL && p->setId < setId; q = p, p = p->entries.le_next);
607 LIST_INSERT_HEAD(&sethead, p, entries);
609 LIST_INSERT_AFTER(q, p, entries);
635 for (; p != NULL && p->msgId < msgId; q = p, p = p->entries.le_next);
[all …]

12345678910>>...54