/freebsd-13-stable/sys/kern/ |
H A D | subr_filter.c | 58 * age out entries based on the time now and your time limit 98 tf->entries[i].value = set_val; 99 tf->entries[i].time_up = 0; 129 tf->entries[i].value = set_val; 130 tf->entries[i].time_up = 0; 143 tim = now - tf->entries[i].time_up; 148 if (tf->entries[i].time_up < tf->entries[j].time_up) { 149 tf->entries[i].value = tf->entries[ [all...] |
/freebsd-13-stable/usr.sbin/lpr/chkprintcap/ |
H A D | skimprintcap.h | 40 int entries; member in struct:skiminfo
|
/freebsd-13-stable/contrib/libarchive/libarchive/test/ |
H A D | test_write_format_mtree_classic.c | 38 } entries[] = { variable in typeref:struct:__anon1152 127 /* Write entries */ 128 for (i = 0; entries[i].path != NULL; i++) { 130 archive_entry_set_nlink(ae, entries[i].nlink); 131 assertEqualInt(entries[i].nlink, archive_entry_nlink(ae)); 132 archive_entry_set_mtime(ae, entries[i].mtime, 0); 133 assertEqualInt(entries[i].mtime, archive_entry_mtime(ae)); 134 archive_entry_set_mode(ae, entries[i].mode); 135 assertEqualInt(entries[i].mode, archive_entry_mode(ae)); 136 archive_entry_set_uid(ae, entries[ [all...] |
H A D | test_write_format_mtree_classic_indent.c | 38 } entries[] = { variable in typeref:struct:__anon1153 129 /* Write entries */ 130 for (i = 0; entries[i].path != NULL; i++) { 132 archive_entry_set_nlink(ae, entries[i].nlink); 133 assertEqualInt(entries[i].nlink, archive_entry_nlink(ae)); 134 archive_entry_set_mtime(ae, entries[i].mtime, 0); 135 assertEqualInt(entries[i].mtime, archive_entry_mtime(ae)); 136 archive_entry_set_mode(ae, entries[i].mode); 137 assertEqualInt(entries[i].mode, archive_entry_mode(ae)); 138 archive_entry_set_uid(ae, entries[ [all...] |
H A D | test_write_format_mtree.c | 37 } entries[] = { variable in typeref:struct:__anon1150 89 /* Write entries */ 90 for (i = 0; entries[i].path != NULL; i++) { 92 archive_entry_set_mtime(ae, entries[i].mtime, 0); 93 assert(entries[i].mtime == archive_entry_mtime(ae)); 94 archive_entry_set_mode(ae, entries[i].mode); 95 assert(entries[i].mode == archive_entry_mode(ae)); 96 archive_entry_set_uid(ae, entries[i].uid); 97 assert(entries[i].uid == archive_entry_uid(ae)); 98 archive_entry_set_gid(ae, entries[ [all...] |
H A D | test_write_format_mtree_fflags.c | 42 } entries[] = { variable in typeref:struct:__anon1154 70 /* Write entries */ 71 for (i = 0; entries[i].path != NULL; i++) { 73 archive_entry_set_fflags(ae, entries[i].fflags, 0); 74 archive_entry_copy_pathname(ae, entries[i].path); 109 /* Read entries */ 110 for (i = 0; entries[i].path != NULL; i++) { 115 assertEqualInt((int)entries[i].fflags, (int)fset); 117 assertEqualString(entries[i].path, archive_entry_pathname(ae));
|
/freebsd-13-stable/lib/libc/stdlib/ |
H A D | hsearch.h | 36 size_t entries_used; /* Number of entries currently used. */ 37 ENTRY *entries; /* Hash table entries. */ member in struct:__hsearch
|
H A D | hcreate_r.c | 41 * off with a table of sixteen entries. In most cases this hint is 48 hsearch->entries = calloc(16, sizeof(ENTRY)); 49 if (hsearch->entries == NULL) {
|
H A D | hdestroy_r.c | 39 /* Free hash table object and its entries. */ 41 free(hsearch->entries);
|
/freebsd-13-stable/contrib/subversion/subversion/libsvn_fs_fs/ |
H A D | load-index.c | 35 get_max_covered(apr_array_header_t *entries) argument 38 if (entries->nelts == 0) 41 entry = APR_ARRAY_IDX(entries, entries->nelts - 1, 49 check_all_covered(apr_array_header_t *entries, argument 54 for (i = 0; i < entries->nelts; ++i) 57 = APR_ARRAY_IDX(entries, i, const svn_fs_fs__p2l_entry_t *); 99 apr_array_header_t *entries, 110 svn_sort__array(entries, compare_p2l_entry_revision); 113 if (entries 97 svn_fs_fs__load_index(svn_fs_t *fs, svn_revnum_t revision, apr_array_header_t *entries, apr_pool_t *scratch_pool) argument [all...] |
H A D | dump-index.c | 59 /* Walk through all P2L index entries in offset order. */ 62 apr_array_header_t *entries; local 64 /* Read entries for the next block. There will be no overlaps since 67 SVN_ERR(svn_fs_fs__p2l_index_lookup(&entries, fs, rev_file, revision, 71 /* Print entries for this block, one line per entry. */ 72 for (i = 0; i < entries->nelts && offset < max_offset; ++i) 75 = &APR_ARRAY_IDX(entries, i, const svn_fs_fs__p2l_entry_t);
|
H A D | temp_serializer.c | 150 /* number of entries in the directory 170 /* reference to the entries */ 171 svn_fs_dirent_t **entries; member in struct:dir_data_t 173 /* size of the serialized entries and don't be too wasteful 174 * (needed since the entries are no longer in sequence) */ 212 apr_array_header_t *entries = dir->entries; local 215 int count = entries->nelts; 218 apr_size_t entries_len = total_count * sizeof(*dir_data.entries); 221 /* copy the hash entries t 270 svn_fs_dirent_t **entries; local 551 const char **entries = *strings; local 572 const svn_string_t **entries = *strings; local 890 find_entry(svn_fs_dirent_t **entries, const char *name, apr_size_t count, svn_boolean_t *found) argument 942 const svn_fs_dirent_t * const *entries = local 998 apr_array_header_t *entries; local 1037 svn_fs_dirent_t **entries; local [all...] |
/freebsd-13-stable/contrib/unbound/contrib/ |
H A D | build-unbound-localzone-from-hosts.pl | 24 my @entries = split( /\s+/, $hostline ); 29 foreach my $entry ( @entries ) {
|
/freebsd-13-stable/lib/libc/tests/sys/ |
H A D | queue_test.c | 47 SLIST_ENTRY(entry) entries; 60 SLIST_FOREACH(np, &head, entries) { 71 SLIST_INSERT_HEAD(&head, n1, entries); 77 SLIST_FOREACH(np, &head, entries) { 91 SLIST_INSERT_AFTER(n1, n2, entries); 97 SLIST_INSERT_AFTER(n2, n3, entries); 100 SLIST_FOREACH(np, &head, entries) { 113 SLIST_REMOVE_HEAD(&head, entries); 120 SLIST_FOREACH(np, &head, entries) { 130 SLIST_REMOVE_AFTER(n2, entries); [all...] |
/freebsd-13-stable/include/rpcsvc/ |
H A D | nis_callback.x | 66 obj_p entries<>; /* List of objects */
|
/freebsd-13-stable/contrib/llvm-project/lldb/source/Interpreter/ |
H A D | OptionValueBoolean.cpp | 79 auto entries = llvm::makeArrayRef(autocomplete_entries); local 83 entries = entries.take_front(2); 85 for (auto entry : entries)
|
/freebsd-13-stable/sys/dev/vmware/vmci/ |
H A D | vmci_hashtable.c | 55 table->entries = vmci_alloc_kernel_mem(sizeof(*table->entries) * size, 57 if (table->entries == NULL) { 61 memset(table->entries, 0, sizeof(*table->entries) * size); 65 vmci_free_kernel_mem(table->entries, sizeof(*table->entries) * size); 80 * entries at this point in time. Hence we should be able to just remove 81 * all entries from the hash table. 99 vmci_free_kernel_mem(table->entries, sizeo [all...] |
/freebsd-13-stable/usr.sbin/mptutil/ |
H A D | mpt_evt.c | 98 MPI_LOG_0_ENTRY **entries; local 135 /* Build a list of valid entries and sort them by sequence. */ 136 entries = malloc(sizeof(MPI_LOG_0_ENTRY *) * log->NumLogEntries); 137 if (entries == NULL) { 147 entries[num_events] = &log->LogEntry[i]; 151 qsort(entries, num_events, sizeof(MPI_LOG_0_ENTRY *), event_compare); 158 mpt_print_event(entries[i], verbose); 161 free(entries);
|
/freebsd-13-stable/crypto/openssl/crypto/x509/ |
H A D | x_name.c | 96 if ((ret->entries = sk_X509_NAME_ENTRY_new_null()) == NULL) 107 sk_X509_NAME_ENTRY_free(ret->entries); 122 sk_X509_NAME_ENTRY_pop_free(a->entries, X509_NAME_ENTRY_free); 157 STACK_OF(X509_NAME_ENTRY) *entries; 182 entries = sk_STACK_OF_X509_NAME_ENTRY_value(intname.s, i); 183 for (j = 0; j < sk_X509_NAME_ENTRY_num(entries); j++) { 184 entry = sk_X509_NAME_ENTRY_value(entries, j); 186 if (!sk_X509_NAME_ENTRY_push(nm.x->entries, entry)) 188 sk_X509_NAME_ENTRY_set(entries, j, NULL); 241 STACK_OF(X509_NAME_ENTRY) *entries [all...] |
/freebsd-13-stable/contrib/subversion/subversion/libsvn_fs_x/ |
H A D | temp_serializer.c | 189 /* number of entries in the directory 209 /* reference to the entries */ 210 svn_fs_x__dirent_t **entries; member in struct:dir_data_t 212 /* size of the serialized entries and don't be too wasteful 213 * (needed since the entries are no longer in sequence) */ 253 apr_array_header_t *entries = dir->entries; local 256 int count = entries->nelts; 265 /* copy the hash entries to an auxiliary struct of known layout */ 270 dir_data.entries 317 svn_fs_x__dirent_t **entries; local 521 const char **entries = *strings; local 542 const svn_string_t **entries = *strings; local 765 find_entry(svn_fs_x__dirent_t **entries, const char *name, apr_size_t count, svn_boolean_t *found) argument 809 found_entry(const svn_fs_x__dirent_t * const *entries, const char *name, apr_size_t idx) argument 835 const svn_fs_x__dirent_t * const *entries = local 910 apr_array_header_t *entries; local 949 svn_fs_x__dirent_t **entries; local [all...] |
/freebsd-13-stable/crypto/heimdal/lib/krb5/ |
H A D | keytab_memory.c | 39 krb5_keytab_entry *entries; member in struct:mkt_data 88 d->entries = NULL; 123 krb5_kt_free_entry(context, &d->entries[i]); 124 free(d->entries); 159 return krb5_kt_copy_entry_contents(context, &d->entries[c->fd++], entry); 177 tmp = realloc(d->entries, (d->num_entries + 1) * sizeof(*d->entries)); 183 d->entries = tmp; 185 &d->entries[d->num_entries++]); 203 for(end = d->entries [all...] |
/freebsd-13-stable/tools/tools/commitsdb/ |
H A D | make_commit_db | 67 my @entries = split /----------------------------\n/, $log; 70 shift @entries; 74 foreach my $e (@entries) {
|
/freebsd-13-stable/sys/cam/ |
H A D | cam_queue.c | 102 KASSERT(new_size >= queue->entries, ("camq_resize: " 103 "New queue size can't accommodate queued entries (%d < %d).", 104 new_size, queue->entries)); 119 queue->entries * sizeof(cam_pinfo *)); 136 KASSERT(queue->entries < queue->array_size, 138 queue->entries, queue->array_size)); 139 queue->entries++; 140 queue->queue_array[queue->entries] = new_entry; 141 new_entry->index = queue->entries; 142 if (queue->entries ! [all...] |
/freebsd-13-stable/usr.bin/ktrdump/ |
H A D | ktrdump.c | 88 * Reads the ktr trace buffer from kernel memory and prints the trace entries. 103 int entries; local 216 entries = sb.st_size / sizeof(*buf); 222 if (kvm_read(kd, nl[1].n_value, &entries, sizeof(entries)) 225 if ((buf = malloc(sizeof(*buf) * entries)) == NULL) 230 kvm_read(kd, bufptr, buf, sizeof(*buf) * entries) == -1 || 275 i = index2 + 1 % entries; 278 if (i == entries) 284 i = entries [all...] |
/freebsd-13-stable/contrib/llvm-project/lldb/bindings/interface/ |
H A D | SBEnvironment.i | 39 void SetEntries(const SBStringList &entries, bool append);
|