Home
last modified time | relevance | path

Searched full:entries (Results 1 – 25 of 4194) sorted by relevance

12345678910>>...168

/freebsd/sys/kern/
H A Dsubr_filter.c57 * age out entries based on the time now and your time limit
97 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()
[all …]
/freebsd/bin/setfacl/
H A Dsetfacl.137 .Op Fl a Ar position entries
38 .Op Fl m Ar entries
40 .Op Fl x Ar entries | position
54 .It Fl a Ar position entries
56 ACL entries
58 .Ar entries ,
64 Remove all ACL entries except for the ones synthesized
65 from the file mode - the three mandatory entries in case
76 entries of the current ACL.
78 The operations apply to the default ACL entries instead of
[all …]
/freebsd/contrib/libarchive/libarchive/
H A Darchive_entry_acl.3118 A POSIX.1e ACL consists of a number of independent entries.
155 model and specify non-extended ACL entries.
162 which controls the initial access ACL for newly-created directory entries.
164 A NFSv4 ACL consists of multiple individual entries called Access Control
165 Entries (ACEs).
197 Entries with the
217 List entries (directory).
260 Only first-level entries inherit ACLs.
275 An archive entry cannot contain both POSIX.1e and NFSv4 ACL entries.
278 removes all ACL entries an
[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.c36 } entries[] = {
88 /* Write entries */ in test_write_format_mtree_sub()
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[ in test_write_format_mtree_sub()
37 } entries[] = { global() variable
[all...]
/freebsd/contrib/llvm-project/clang/lib/CodeGen/
H A DSwiftCallingConv.cpp280 // Fast path: we can just add entries to the end. in addEntry()
281 if (Entries.empty() || Entries.back().End <= begin) { in addEntry()
282 Entries.push_back({begin, end, type}); in addEntry()
287 // TODO: do a binary search if Entries is big enough for it to matter. in addEntry()
288 size_t index = Entries.size() - 1; in addEntry()
290 if (Entries[index - 1].End <= begin) break; in addEntry()
296 if (Entries[index].Begin >= end) { in addEntry()
300 Entries.insert(Entries.begin() + index, {begin, end, type}); in addEntry()
309 if (Entries[index].Begin == begin && Entries[index].End == end) { in addEntry()
311 if (Entries[index].Type == type) return; in addEntry()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DDebugLocStream.h23 /// Byte stream of .debug_loc entries.
25 /// Stores a unified stream of .debug_loc entries. There's \a List for each
48 SmallVector<Entry, 32> Entries;
78 /// Until the next call, \a startEntry() will add entries to this list.
81 Lists.emplace_back(CU, Entries.size()); in startList()
87 /// If there are no entries in this list, delete it outright. Otherwise,
98 Entries.push_back({BeginSym, EndSym, DWARFBytes.size(), Comments.size()}); in startEntry()
111 return ArrayRef(Entries).slice(Lists[LI].EntryOffset, getNumEntries(LI)); in getEntries()
117 .slice(Entries[EI].ByteOffset, getNumBytes(EI)); in getBytes()
121 return ArrayRef(Comments).slice(Entries[E in getComments()
49 SmallVector<Entry, 32> Entries; global() variable
[all...]
H A DDbgEntityHistoryCalculator.cpp76 auto &Entries = VarEntries[Var]; in startDbgValue() local
77 if (!Entries.empty() && Entries.back().isDbgValue() && in startDbgValue()
78 !Entries.back().isClosed() && in startDbgValue()
79 Entries.back().getInstr()->isEquivalentDbgInstr(MI)) { in startDbgValue()
80 LLVM_DEBUG(dbgs() << "Coalescing identical DBG_VALUE entries:\n" in startDbgValue()
81 << "\t" << Entries.back().getInstr() << "\t" << MI in startDbgValue()
85 Entries.emplace_back(&MI, Entry::DbgValue); in startDbgValue()
86 NewIndex = Entries.size() - 1; in startDbgValue()
92 auto &Entries = VarEntries[Var]; in startClobber() local
95 if (Entries.back().isClobber() && Entries.back().getInstr() == &MI) in startClobber()
[all …]
/freebsd/share/man/man3/
H A Dqueue.3264 Entries can be added at the end of a list.
320 Entries can be added at the end of a list.
418 removing all entries from the former.
550 SLIST_ENTRY(entry) entries; /* Singly-linked List. */
557 SLIST_INSERT_HEAD(&head, n1, entries);
560 SLIST_INSERT_AFTER(n1, n2, entries);
562 SLIST_REMOVE(&head, n2, entry, entries);/* Deletion. */
566 SLIST_REMOVE_HEAD(&head, entries); /* Deletion from the head. */
569 SLIST_FOREACH(np, &head, entries)
572 SLIST_FOREACH_SAFE(np, &head, entries, np_temp) {
[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/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_interceptors_ioctl_netbsd.inc45 /* Entries from file: altq/altq_afmap.h */
50 /* Entries from file: altq/altq.h */
54 /* Entries from file: altq/altq_blue.h */
59 /* Entries from file: altq/altq_cbq.h */
66 /* Entries from file: altq/altq_cdnr.h */
80 /* Entries from file: altq/altq_fifoq.h */
83 /* Entries from file: altq/altq_hfsc.h */
87 /* Entries from file: altq/altq_jobs.h */
95 /* Entries from file: altq/altq_priq.h */
104 /* Entries from file: altq/altq_red.h */
[all …]
/freebsd/lib/libc/gen/
H A Dgetutxent.371 This file only contains process related entries, such as user login and
74 Log of last user login entries per user.
81 Log of all entries, sorted by date of addition.
129 Entries of type
139 This field is used for all types of entries, except
146 This field is only applicable to entries of type
154 This field is only applicable to entries of type
162 This field is only applicable to entries of type
168 entries this entry typically contains the name of the login process.
175 This field is only applicable to entries of type
[all …]
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/dedup/
H A Ddedup_quota.ksh27 # Verify that new entries are not added to the DDT when dedup_table_quota has
34 # 4. Verify no new entries are added after subsequent sync's
36 # 6. Verify new entries are added to DDT
98 typeset -i entries=$(zpool status -D $POOL | \
99 grep "dedup: DDT entries" | awk '{print $4}')
101 echo ${entries}
123 # Create 6000 entries over three syncs
128 log_note base ddt entries is $(ddt_entries)
144 log_note base ddt entries is $(ddt_entries)
154 # count the entries we have
[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/contrib/llvm-project/llvm/include/llvm/ADT/
H A DConcurrentHashtable.h48 /// bucket entries
51 /// buckets might be extended to contain more entries. Each bucket can be
56 /// BucketsArray keeps all buckets. Each bucket keeps an array of Entries
57 /// (pointers to KeyDataTy) and another array of entries hashes:
60 /// BucketsArray[BucketIdx].Entries[EntryIdx]:
63 /// [Bucket 0].Entries -> [KeyDataTy*][KeyDataTy*]
66 /// [Bucket 1].Entries -> [KeyDataTy*][KeyDataTy*][KeyDataTy*][KeyDataTy*]
69 /// [Bucket N].Entries -> [KeyDataTy*][KeyDataTy*][KeyDataTy*]
137 DataPtr Entries = new EntryDataTy[InitialBucketSize]; in MultiThreadAllocator()
138 memset(Entries, in MultiThreadAllocator() local
290 DataPtr Entries = nullptr; global() member
[all...]
/freebsd/contrib/llvm-project/llvm/lib/Target/DirectX/
H A DDXILResource.cpp275 SmallVector<Metadata *> Entries; in write() local
277 Entries.emplace_back( in write()
279 Entries.emplace_back(ConstantAsMetadata::get( in write()
282 if (Entries.empty()) in write()
284 return MDNode::get(Ctx, Entries); in write()
288 MutableArrayRef<Metadata *> Entries) const { in write()
290 Entries[0] = ConstantAsMetadata::get(B.getInt32(ID)); in write()
291 Entries[1] = ConstantAsMetadata::get(GV); in write()
292 Entries[2] = MDString::get(Ctx, Name); in write()
293 Entries[3] = ConstantAsMetadata::get(B.getInt32(Space)); in write()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/BinaryFormat/
H A DDynamicTags.def46 DYNAMIC_TAG(PLTRELSZ, 2) // Size of relocation entries in PLT.
51 DYNAMIC_TAG(RELA, 7) // Address of relocation table (Rela entries).
61 DYNAMIC_TAG(REL, 17) // Address of relocation table (Rel entries).
86 DYNAMIC_TAG(RELR, 36) // Address of relocation table (Relr entries).
107 DYNAMIC_TAG(ANDROID_RELR, 0x6FFFE000) // Address of relocation table (Relr entries).
124 DYNAMIC_TAG(VERDEFNUM, 0X6FFFFFFD) // The number of entries in DT_VERDEF.
127 DYNAMIC_TAG(VERNEEDNUM, 0X6FFFFFFF) // The number of entries in DT_VERNEED.
129 // AArch64 specific dynamic table entries
139 // AArch64 specific dynamic table entries for RELR auth relocations as described here:
145 // Hexagon specific dynamic table entries
[all …]
/freebsd/sys/dev/ice/
H A Dice_fwlog.c49 * @entries: entries to validate
50 * @num_entries: number of entries to validate
53 valid_module_entries(struct ice_hw *hw, struct ice_fwlog_module_entry *entries, in valid_module_entries()
58 if (!entries) { in valid_module_entries()
69 struct ice_fwlog_module_entry *entry = &entries[i]; in valid_module_entries()
138 * @entries: entries to configure
139 * @num_entries: number of @entries
144 ice_aq_fwlog_set(struct ice_hw *hw, struct ice_fwlog_module_entry *entries, in ice_aq_fwlog_set()
52 valid_module_entries(struct ice_hw * hw,struct ice_fwlog_module_entry * entries,u16 num_entries) valid_module_entries() argument
143 ice_aq_fwlog_set(struct ice_hw * hw,struct ice_fwlog_module_entry * entries,u16 num_entries,u16 options,u16 log_resolution) ice_aq_fwlog_set() argument
238 update_cached_entries(struct ice_hw * hw,struct ice_fwlog_module_entry * entries,u16 num_entries) update_cached_entries() argument
273 ice_fwlog_update_modules(struct ice_hw * hw,struct ice_fwlog_module_entry * entries,u16 num_entries) ice_fwlog_update_modules() argument
[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()
107 sk_X509_NAME_ENTRY_free(ret->entries); in IMPLEMENT_EXTERN_ASN1()
122 sk_X509_NAME_ENTRY_pop_free(a->entries, X509_NAME_ENTRY_free); in x509_name_ex_free()
157 STACK_OF(X509_NAME_ENTRY) *entries; in x509_name_ex_d2i()
183 entries = sk_STACK_OF_X509_NAME_ENTRY_value(intname.s, i); in x509_name_ex_d2i()
184 for (j = 0; j < sk_X509_NAME_ENTRY_num(entries); j++) { in x509_name_ex_d2i()
185 entry = sk_X509_NAME_ENTRY_value(entries, j); in x509_name_ex_d2i()
187 if (!sk_X509_NAME_ENTRY_push(nm.x->entries, entry)) in x509_name_ex_d2i()
189 (void)sk_X509_NAME_ENTRY_set(entries, j, NULL); in x509_name_ex_d2i()
243 STACK_OF(X509_NAME_ENTRY) *entries = NULL; in x509_name_encode()
[all …]
/freebsd/sys/dev/vnic/
H A Dnicvf_queues.h53 #define RBDR_SIZE0 0UL /* 8K entries */
54 #define RBDR_SIZE1 1UL /* 16K entries */
55 #define RBDR_SIZE2 2UL /* 32K entries */
56 #define RBDR_SIZE3 3UL /* 64K entries */
57 #define RBDR_SIZE4 4UL /* 126K entries */
58 #define RBDR_SIZE5 5UL /* 256K entries */
59 #define RBDR_SIZE6 6UL /* 512K entries */
61 #define SND_QUEUE_SIZE0 0UL /* 1K entries */
62 #define SND_QUEUE_SIZE1 1UL /* 2K entries */
63 #define SND_QUEUE_SIZE2 2UL /* 4K entries */
[all …]
/freebsd/contrib/llvm-project/lld/ELF/
H A DSyntheticSections.h213 // Returns the number of entries in the local part of GOT including
214 // the number of reserved entries.
222 // contains different types of entries. Here is a layout of GOT:
223 // - Header entries |
224 // - Page entries | Local part
225 // - Local entries (16-bit access) |
226 // - Local entries (32-bit access) |
227 // - Normal global entries || Global part
228 // - Reloc-only global entries ||
229 // - TLS entries ||| TLS part
[all …]
/freebsd/stand/lua/
H A Dmenu.lua.853 .Va entries
57 .Va entries
64 .Va entries
103 All menu entries that can be selected may have any number of
105 entries.
161 Contains single and multi user boot options, as well as entries to access other
211 local stock_entries = menu.welcome.entries
212 function menu.welcome.entries()
228 -- Fill in with vendor specific entries
251 .Ic menu.boot_options.entries
[all …]
/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/contrib/ntp/ntpd/
H A Dntp_monitor.c36 * the memory limit. Then we free memory by grabbing entries off the
40 * INC_MONLIST is the default allocation granularity in entries.
41 * INIT_MONLIST is the default initial allocation in entries.
75 u_int mru_initalloc = INIT_MONLIST;/* entries to preallocate */
96 int mru_maxage = 64; /* for entries older than */
181 u_int entries; in mon_getmoremem() local
183 entries = (0 == mon_mem_increments) in mon_getmoremem()
187 if (entries) { in mon_getmoremem()
188 chunk = eallocarray(entries, sizeof(*chunk)); in mon_getmoremem()
189 mru_alloc += entries; in mon_getmoremem()
[all...]

12345678910>>...168