| /freebsd/contrib/llvm-project/lldb/docs/design/ |
| H A D | overview.rst | |
| H A D | sbapi.rst | |
| /freebsd/crypto/heimdal/kadmin/ |
| H A D | random_password.c | 92 number of characters from a set of character classes.
94 If there are n classes, and the size of each class is Pi, and the
96 passwords are (given that the character classes are disjoint):
118 } *classes; in generate_password() local
126 classes = malloc(num_classes * sizeof(*classes)); in generate_password()
127 if(classes == NULL) in generate_password()
132 classes[i].str = va_arg(ap, const char*); in generate_password()
133 classes[i].len = strlen(classes[i].str); in generate_password()
134 classes[i].freq = va_arg(ap, int); in generate_password()
135 len += classes[i].freq; in generate_password()
[all …]
|
| /freebsd/contrib/jemalloc/include/jemalloc/internal/ |
| H A D | sc.h | 12 * Ignore the first few size classes for a moment. We can then split all the
13 * remaining size classes into groups. The size classes in a group are spaced
15 * power of two is called the base of the group, and the size classes in it
17 * SC_NGROUP size classes in each group, equally spaced in the range, so that
27 * The size classes in a group with a given lg_base and lg_delta (which, recall,
44 * Now, let's start considering the first few size classes. Two extra constants
53 * classes; one per power of two, up until we hit the quantum size. There are
54 * therefore LG_QUANTUM - SC_LG_TINY_MIN such size classes.
64 * having SC_NGROUP size classes, spaced (1 << LG_QUANTUM) apart. These size
65 * classes are:
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | IntEqClasses.h | 1 //===-- llvm/ADT/IntEqClasses.h - Equiv. Classes of Integers ----*- C++ -*-===//
10 /// Equivalence classes for small integers. This is a mapping of the integers
11 /// 0 .. N-1 into M equivalence classes numbered 0 .. M-1.
13 /// Initially each integer has its own equivalence class. Classes are joined by
16 /// Once the classes are built, compress() will number them 0 .. M-1 and prevent
36 /// NumClasses - The number of equivalence classes when compressed, or 0 when
45 /// equivalence classes.
49 /// clear - Clear all classes so that grow() will assign a unique class to
56 /// Join the equivalence classes of a and b. After joining classes,
66 /// compress - Compress equivalence classes by numbering them 0 .. M.
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RenameIndependentSubregs.cpp | 81 /// equivalence classes.
83 bool findComponents(IntEqClasses &Classes,
89 void distribute(const IntEqClasses &Classes,
94 void computeMainRangesFixFlags(const IntEqClasses &Classes,
99 void rewriteOperands(const IntEqClasses &Classes,
128 IntEqClasses Classes; in INITIALIZE_PASS_DEPENDENCY() local
129 if (!findComponents(Classes, SubRangeInfos, LI)) in INITIALIZE_PASS_DEPENDENCY()
137 LLVM_DEBUG(dbgs() << printReg(Reg) << ": Found " << Classes.getNumClasses() in INITIALIZE_PASS_DEPENDENCY()
138 << " equivalence classes.\n"); in INITIALIZE_PASS_DEPENDENCY()
140 for (unsigned I = 1, NumClasses = Classes.getNumClasses(); I < NumClasses; in INITIALIZE_PASS_DEPENDENCY()
[all …]
|
| H A D | CriticalAntiDepBreaker.cpp | 45 Classes(TRI->getNumRegs(), nullptr), KillIndices(TRI->getNumRegs(), 0), in CriticalAntiDepBreaker()
54 Classes[i] = nullptr; in StartBlock()
71 Classes[Reg] = reinterpret_cast<TargetRegisterClass *>(-1); in StartBlock()
89 Classes[Reg] = reinterpret_cast<TargetRegisterClass *>(-1); in StartBlock()
119 Classes[Reg] = reinterpret_cast<TargetRegisterClass *>(-1); in Observe()
126 Classes[Reg] = reinterpret_cast<TargetRegisterClass *>(-1); in Observe()
180 // Classes and RegRefs. in PrescanInstruction()
193 if (!Classes[Reg] && NewRC) in PrescanInstruction()
194 Classes[Reg] = NewRC; in PrescanInstruction()
195 else if (!NewRC || Classes[Reg] != NewRC) in PrescanInstruction()
[all …]
|
| H A D | RegisterBank.cpp | 30 // Verify that the register bank covers all the sub classes of the in RegisterBank()
31 // classes it covers. in RegisterBank()
43 // all the register classes it covers. in verify()
82 << "Number of Covered register classes: " << Count << '\n';
84 // This register classes may not be properly initialized yet. in dump()
89 OS << "Covered register classes:\n"; in print()
|
| /freebsd/contrib/pam_modules/pam_passwdqc/ |
| H A D | passwdqc_check.c | 26 "not enough different characters or classes for this length"
28 "not enough different characters or classes"
65 int length, classes, words, chars; in is_simple() local
69 length = classes = words = chars = 0; in is_simple()
98 /* Count the number of different character classes we've seen. We assume in is_simple()
100 classes = 0; in is_simple()
101 if (digits) classes++; in is_simple()
102 if (lowers) classes++; in is_simple()
103 if (uppers) classes++; in is_simple()
104 if (others) classes++; in is_simple()
[all …]
|
| H A D | README | 29 class only. (The character classes are: digits, lower-case letters,
35 classes, which don't meet the requirements for a passphrase.
41 and four character classes, respectively.
43 When calculating the number of character classes, upper-case letters
48 contain enough different characters for the character classes and
|
| /freebsd/contrib/openbsm/man/ |
| H A D | audit_user.5 | 37 file specifies which audit event classes are to be audited for the given users.
40 file to determine which classes of events to audit for that user.
43 Each line maps a user name to a list of classes that should be audited and a
44 list of classes that should not be audited.
51 is a set of event classes that are always audited, and
53 is a set of event classes that should not be audited.
55 the inclusion or exclusion of multiple classes, and whether to audit successful
|
| /freebsd/contrib/llvm-project/llvm/lib/TextAPI/ |
| H A D | TextStub.cpp | 58 objc-classes: [] # Optional: List of Objective-C classes
92 objc-classes: [] # Optional: List of Objective-C classes
101 objc-classes: [] # Optional: List of Objective-C classes
133 objc-classes: [] # Optional: List of Objective-C classes
134 objc-eh-types: [] # Optional: List of Objective-C classes
144 objc-classes: [] # Optional: List of Objective-C classes
145 objc-eh-types: [] # Optional: List of Objective-C classes
183 objc-classes: [] # Optional: List of Objective-C classes
184 objc-eh-types: [] # Optional: List of Objective-C classes
196 objc-classes: [] # Optional: List of Objective-C classes
[all …]
|
| /freebsd/share/man/man5/ |
| H A D | hesiod.conf.5 | 45 .Bl -tag -width classes
60 .It Ic classes
61 Specifies which DNS classes Hesiod should do lookups in.
67 You may specify both classes separated by
70 The default value of the classes variable is
|
| /freebsd/contrib/kyua/model/ |
| H A D | README | 1 This directory contains the classes that form the data model of Kyua.
3 The classes in this directory are intended to be pure data types without
8 All the classes in the data model have to have an on-disk representation
10 model. Some of these classes may also have special behavior at run-time,
|
| /freebsd/contrib/llvm-project/lldb/bindings/interface/ |
| H A D | SBTypeExtensions.i | 63 num_bases = property(GetNumberOfDirectBaseClasses, None, doc='''A read only property that returns number of direct base classes in this type as an integer.''')
64 num_vbases = property(GetNumberOfVirtualBaseClasses, None, doc='''A read only property that returns number of virtual base classes in this type as an integer.''')
71 '''An accessor function that returns a list() that contains all direct base classes in a lldb.SBType object.'''
92 '''An accessor function that returns a list() that contains all members (base classes and fields) in a lldb.SBType object in ascending bit offset order.'''
137 bases = property(get_bases_array, None, doc='''A read only property that returns a list() of lldb.SBTypeMember objects that represent all of the direct base classes for this type.''')
138 vbases = property(get_vbases_array, None, doc='''A read only property that returns a list() of lldb.SBTypeMember objects that represent all of the virtual base classes for this type.''')
140 members = property(get_members_array, None, doc='''A read only property that returns a list() of all lldb.SBTypeMember objects that represent all of the base classes, virtual base classes and fields for this type in ascending bit offset order.''')
|
| H A D | SBTypeDocstrings.i | 113 * Objective-C: Same as in C. For Objective-C classes this always returns
149 virtual member function or if at least one of its base classes is
418 fields). The fields of any base classes are not included in the count.
419 * Objective-C: Same as in C for structs. For Objective-C classes the number
427 "Returns the number of base/parent classes of this type.
429 Returns ``0`` if this type doesn't have any base classes.
434 * C++: The number of direct non-virtual base classes if this type is
436 * Objective-C: The number of super classes for Objective-C classes.
443 "Returns the number of virtual base/parent classes o
[all...] |
| H A D | SBValueDocstrings.i | 51 Structs, unions, classes, arrays and pointers have child
57 Classes reserve the first indexes for base classes that have
58 members (empty base classes are omitted), and all members of the
59 current class will then follow the base classes.
107 Matches children of this object only and will match base classes and
121 classes.
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | IntEqClasses.cpp | 1 //===-- llvm/ADT/IntEqClasses.cpp - Equivalence Classes of Integers -------===//
9 // Equivalence classes for small integers. This is a mapping of the integers
10 // 0 .. N-1 into M equivalence classes numbered 0 .. M-1.
12 // Initially each integer has its own equivalence class. Classes are joined by
15 // Once the classes are built, compress() will number them 0 .. M-1 and prevent
38 // classes. in join()
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/scudo/standalone/ |
| H A D | size_class_map.h | 41 // SizeClassMap maps allocation sizes into size classes and back, in an
45 // classes. The allocator uses it to hold batches.
50 // - MidSizeLog: classes increase with step 2^MinSizeLog from 2^MinSizeLog to
53 // eg. with NumBits==3 all size classes after 2^MidSizeLog look like
118 sizeof(Config::Classes) / sizeof(Config::Classes[0]);
134 if (Size <= Config::Classes[i]) in computeClassId()
154 if (Config::Classes[I] & (1 << Bit)) { in LSBTable()
190 static const uptr MaxSize = Config::Classes[LargestClassId - 1];
193 return Config::Classes[ClassI in getSizeByClassId()
257 static constexpr u32 Classes[] = { global() member
[all...] |
| /freebsd/usr.bin/clang/llvm-pdbutil/ |
| H A D | llvm-pdbutil.1 | 234 padding, accounting for padding in base classes and aggregate field members.
240 padding, ignoring padding in base classes and aggregate field members.
290 Displays classes in the specified order.
297 =name \- Sort classes by name
298 =size \- Sort classes by size
299 =padding \- Sort classes by amount of padding
300 =padding\-pct \- Sort classes by percentage of space consumed by padding
301 =padding\-imm \- Sort classes by amount of immediate padding
302 =padding\-pct\-imm \- Sort classes by percentage of space consumed by immediate padding
316 .B \-classes
[all …]
|
| /freebsd/lib/libc/net/ |
| H A D | hesiod.c | 63 int classes[2]; /* The class search order. */ member
226 retvec = get_txt_records(ctx->classes[0], bindname); in hesiod_resolve()
227 if (retvec == NULL && errno == ENOENT && ctx->classes[1]) in hesiod_resolve()
228 retvec = get_txt_records(ctx->classes[1], bindname); in hesiod_resolve()
261 /* Set default query classes. */ in read_config_file()
262 ctx->classes[0] = C_IN; in read_config_file()
263 ctx->classes[1] = C_HS; in read_config_file()
309 if (strcasecmp(key, "classes") == 0) { in read_config_file()
318 ctx->classes[n++] = C_IN; in read_config_file()
321 ctx->classes[n++] = in read_config_file()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/ |
| H A D | CodeGenRegisters.h | 85 // indexes are not used to create new register classes.
318 // Bit mask of sub-classes including this, indexed by their EnumValue.
320 // List of super-classes, topologocally ordered to have the larger classes
335 // Map SubRegIndex -> set of super-reg classes. This is all register
336 // classes SuperRC such that:
416 /// This can be used to find a suitable pair of classes for subregister
430 // getSuperRegClasses - Returns a bit vector of all register classes
446 // getSuperClasses - Returns a list of super classes ordered by EnumValue.
478 // sub-classes. Note the ordering provided by this key is not the same as
500 // Get ordering value among register base classes.
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Target/ |
| H A D | TargetInstrPredicate.td | 64 // New MCInstPredicate classes must be added to this file. For each new class
214 // classes. This check is always expanded to "false" when generating code for
390 list<InstructionEquivalenceClass> classes> {
392 list<InstructionEquivalenceClass> Classes = classes;
396 // Convenience classes and definitions used by processor scheduling models to
410 class IsZeroIdiomFunction<list<DepBreakingClass> classes>
411 : STIPredicate<IsZeroIdiomDecl, classes>;
413 class IsDepBreakingFunction<list<DepBreakingClass> classes>
414 : STIPredicate<IsDepBreakingDecl, classes>;
[all...] |
| /freebsd/sys/dev/isci/scil/ |
| H A D | sci_overview.h | 63 -# SCI Base classes
77 of the SCI classes and their relationships.
121 - <b>SCI Component</b> - An SCI component is one of: SCI base classes, Core,
181 @page sci_classes SCI Classes
183 This section depicts the common classes and utility functions across the
188 The following is a list of features that can be found in the SCI base classes:
197 SCI class methods can be overridden by sub-classes in the SCI Core,
206 The following UML diagram graphically depicts the SCI base classes and their
208 @image latex sci_base_classes.eps "SCI Classes" width=4cm
|
| /freebsd/contrib/flex/src/ |
| H A D | ecs.c | 37 /* ccl2ecl - convert character classes to set of equivalence classes */
47 * done, character classes will really consist of collections in ccl2ecl()
48 * of equivalence classes in ccl2ecl()
75 * Returned is the number of classes.
100 /* mkeccl - update equivalence classes based on character class xtions
|