Home
last modified time | relevance | path

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

12345678910>>...261

/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 …]
/titanic_50/usr/src/man/man1/
H A Dsetfacl.130 deletes one or more \fBACL\fR entries, including default entries on
43 permissions on a file with \fBACL\fR entries, both the file group owner
46 for additional users and groups who have \fBACL\fR entries on the file.
49 A directory can contain default \fBACL\fR entries. If a file or directory is
50 created in a directory that contains default \fBACL\fR entries, the newly
52 default \fBACL\fR entries and the permissions requested at creation time. The
54 entries. If a default \fBACL\fR is specified for a specific user (or users),
69 comma-separated \fBACL\fR entries.
107 The following table shows the valid \fBACL\fR entries (default entries can only
148 \fBACL\fR entries without permissions. Notice that the entries for file owner,
[all …]
H A Dgetfacl.1101 The \fBACL\fR entries are displayed in the order in which they are evaluated
102 when an access check is performed. The default \fBACL\fR entries that may exist
112 are granted to the file owner. One or more additional user entries indicate the
117 are granted to the file group owner. One or more additional group entries
122 maximum permissions allowed to any user entries except the file owner, and to
123 any group entries, including the file group owner. These permissions restrict
124 the permissions specified in other entries.
130 The \fBdefault\fR entries may exist only for directories. These entries
131 indicate the default entries that are added to a file created within the
147 permissions on a file with \fBACL\fR entries, both the file group owner
[all …]
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/dedup/
H A Ddedup_prune.ksh28 # Verify that zpool ddtprune successfully reduces the number of entries
33 # 2. Add duplicate entries to the DDT
34 # 3. Verify ddtprune doesn't remove duplicate entries
35 # 4. Convert some entries to non-duplicate
36 # 5. Verify ddtprune removes non-duplicate entries
44 log_assert "Verify DDT pruning correctly removes non-duplicate entries"
48 # entries appear in the DDT ZAP
64 typeset -i entries=$(zpool status -D $TESTPOOL | \
65 grep "dedup: DDT entries" | awk '{print $4}')
67 echo ${entries}
[all …]
H A Ddedup_fdt_pacing.ksh31 log_assert "dedup (FDT) paces out log entries appropriately"
35 zdb -D $TESTPOOL | grep -- "-log-sha256-" | sed 's/.*entries=//' | \
56 # Create a filesystem with a small recordsize so that we get more DDT entries,
74 # Create a file. This is 256 full blocks, so will produce 256 entries in the
79 # Verify there are at least 240 entries in the dedup log.
82 log_fail "Fewer than 240 entries in dedup log: $log_entries"
89 # Verify there are at least 220 entries in the dedup log.
92 log_fail "Too many entries pruned from dedup log: " \
95 log_fail "Too few entries pruned from dedup log: " \
102 # Verify there are 0 entries in the dedup log.
[all …]
H A Ddedup_quota.ksh28 # Verify that new entries are not added to the DDT when dedup_table_quota has
35 # 4. Verify no new entries are added after subsequent sync's
37 # 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/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/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/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...]
/titanic_50/usr/src/uts/common/crypto/io/
H A Dcryptoadm.c243 crypto_dev_list_entry_t *entries; in get_dev_list() local
252 if (crypto_get_dev_list(&count, &entries) != 0) { in get_dev_list()
264 crypto_free_dev_list(entries, count); in get_dev_list()
278 crypto_free_dev_list(entries, count); in get_dev_list()
282 /* copyout entries */ in get_dev_list()
284 if (count > 0 && copyout(entries, arg + offset, copyout_size) != 0) { in get_dev_list()
285 crypto_free_dev_list(entries, count); in get_dev_list()
288 crypto_free_dev_list(entries, count); in get_dev_list()
361 crypto_mech_name_t *entries; in get_dev_info() local
383 &count, &entries)) != CRYPTO_SUCCESS) { in get_dev_info()
[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...]
/titanic_50/usr/src/lib/krb5/plugins/kdb/ldap/libkdb_ldap/
H A Dldap_principal2.c81 krb5_ldap_get_principal(context, searchfor, entries, nentries, more) in krb5_ldap_get_principal() argument
84 krb5_db_entry *entries; /* filled in */
104 memset(entries, 0, sizeof(*entries));
163 entries)) != 0)
178 krb5_dbe_free_contents(context, entries);
452 krb5_ldap_put_principal(context, entries, nentries, db_args) in krb5_ldap_put_principal() argument
454 krb5_db_entry *entries;
490 for (i=0; i < *nentries; ++i, ++entries) {
491 if (is_principal_in_realm(ldap_context, entries->princ) != 0) {
498 if (entries->princ) {
[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/share/man/man3/
H A Dqueue.3284 Entries can be added at the end of a list.
340 Entries can be added at the end of a list.
438 removing all entries from the former.
585 SLIST_ENTRY(entry) entries; /* Singly-linked List. */
592 SLIST_INSERT_HEAD(&head, n1, entries);
595 SLIST_INSERT_AFTER(n1, n2, entries);
597 SLIST_REMOVE(&head, n2, entry, entries);/* Deletion. */
601 SLIST_REMOVE_HEAD(&head, entries); /* Deletion from the head. */
604 SLIST_FOREACH(np, &head, entries)
607 SLIST_FOREACH_SAFE(np, &head, entries, np_temp) {
[all …]
/titanic_50/usr/src/man/man1m/
H A Dldapaddent.1m8 ldapaddent \- create LDAP entries from corresponding /etc files
55 \fBldapaddent\fR creates entries in LDAP containers from their corresponding
100 specified by the \fB-N\fR option. The entries will be stored in the directory
104 By default (if the \fB-h\fR option is not specified), entries will be stored in
109 The location where entries are to be written can be overridden by using the
129 You must add entries from the \fBpasswd\fR database before you attempt to add
130 entries from the \fBshadow\fR database. The addition of a \fBshadow\fR entry
161 LDAP server. The \fBldapaddent\fR command skips any duplicate entries.
244 Create entries in the \fIbaseDN\fR directory. \fIbaseDN\fR is not relative to
246 the entries will be created. If this parameter is not specified, the first
[all …]
H A Dipsecconf.1m71 entries) or by a single policy entry which installs the needed symmetric
76 entries loaded are shown. To display the (\fBspd p.e.\fRs) use the \fB-l\fR
83 entries (\fBSPE\fRs), the list of FPEs may not show all the actual entries.
99 With no options, the entries are displayed in the order that they were added,
109 Policy entries are not preserved across system restarts. Permanent policy
110 entries should be added to \fB/etc/inet/ipsecinit.conf\fR. This file is read by
136 IPsec configuration file contains one or more entries that specify the
140 Entries in the files are described in the section below. Examples can be found
144 \fBaccept\fR(3SOCKET) is issued. So, the addition of new policy entries may not
148 entries.
[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 …]
/titanic_50/usr/src/man/man4/
H A Dhosts.equiv.433 requesting access. Entries in these files can be of two forms. Positive entries
34 allow access, while negative entries deny access. The authentication succeeds
36 matching negative entry is found, or if no matching entries are found in either
37 file. The order of entries is important. If the files contain both positive and
38 negative entries, the entry that appears first will prevail. The \fBrsh\fR(1)
44 Both files are formatted as a list of one-line entries. Each entry has the
59 Negative entries are differentiated from positive entries by a `\(mi' character
61 .SS "Positive Entries"
175 .SS "Negative Entries"
178 Negative entries are preceded by a `\(mi' sign. The form:
[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/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 …]
/titanic_50/usr/src/uts/common/avs/ns/sdbc/
H A Ddynmem_readme.txt50 resources comprise cache control entries (ccent), write control entries
59 owns the the allocated memory of two or more pages. The secondary entries
67 two scans this list of typed cache entries and based on immediate neighbors
69 if there is one or more eligible entries immediately following it and it
74 allocating multipage memory for hosts, single page entries for others or
75 simply setting up pointers in the parasitic entries into it's corresponding
78 2.1.2 The maximum number of parasitic entries following a host memory
103 been reached. The entries selected for this behavior are governed by
111 entries as regards to aging but is absolute - i.e. no percentage governs
112 the number of such entries.
[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...]

12345678910>>...261