HomeSort by: relevance | last modified time | path
    Searched refs:Sets (Results 1 - 25 of 42) sorted by relevancy

1 2

  /src/external/apache2/llvm/dist/llvm/lib/Support/
DeltaAlgorithm.cpp 45 const changesetlist_ty &Sets) {
47 UpdatedSearchState(Changes, Sets);
50 if (Sets.size() <= 1)
55 if (Search(Changes, Sets, Res))
58 // Otherwise, partition the sets if possible; if not we are done.
60 for (changesetlist_ty::const_iterator it = Sets.begin(),
61 ie = Sets.end(); it != ie; ++it)
63 if (SplitSets.size() == Sets.size())
70 const changesetlist_ty &Sets,
73 for (changesetlist_ty::const_iterator it = Sets.begin()
    [all...]
DAGDeltaAlgorithm.cpp 118 const changesetlist_ty &Sets,
120 DDA.UpdatedSearchState(Changes, Sets, Required);
163 const changesetlist_ty &Sets) override {
164 DDAI.UpdatedSearchState(Changes, Sets, Required);
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
DeltaAlgorithm.h 17 /// for minimizing arbitrary sets using a predicate function.
58 /// smaller sets, by attempting to remove individual subsets.
60 const changesetlist_ty &Sets);
62 /// Search - Search for a subset (or subsets) in \p Sets which can be
68 bool Search(const changeset_ty &Changes, const changesetlist_ty &Sets,
74 const changesetlist_ty &Sets) {}
DAGDeltaAlgorithm.h 69 const changesetlist_ty &Sets,
  /src/external/apache2/llvm/dist/libcxx/benchmarks/
ordered_set.bench.cpp 45 std::vector<std::set<uint64_t> > Sets;
52 R.Sets.resize(1);
55 R.Sets[0].insert(2 * I);
58 R.Sets.resize(NumTables, R.Sets[0]);
90 std::vector<std::set<uint64_t>> Sets(NumTables);
92 for (auto& Set : Sets) {
113 for (auto& Set : Data.Sets) {
134 for (auto& Set : Data.Sets) {
155 for (auto& Set : Data.Sets) {
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/DWARF/
DWARFDebugPubTable.h 39 /// Each table consists of sets of variable length entries. Each set describes
67 std::vector<Set> Sets;
81 ArrayRef<Set> getData() { return Sets; }
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/DWARF/
DWARFDebugPubTable.cpp 26 Sets.clear();
30 Sets.push_back({});
31 Set &NewSet = Sets.back();
38 Sets.pop_back();
94 for (const Set &S : Sets) {
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
CFLSteensAliasAnalysis.cpp 26 // in order to transform the graph into sets of variables that may alias in
73 StratifiedSets<InstantiatedValue> Sets;
81 return Sets;
94 /// Determines whether it would be pointless to add the given Value to our sets.
97 // sets, e.g. in
119 : Sets(std::move(S)) {
148 auto &Link = Sets.getLink(SetIndex);
167 auto RetInfo = Sets.find(InstantiatedValue{RetVal, 0});
176 auto ParamInfo = Sets.find(InstantiatedValue{&Param, 0});
298 auto &Sets = MaybeInfo->getStratifiedSets()
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
SplitModule.cpp 170 SmallVector<SortType, 64> Sets;
178 Sets.push_back(
182 llvm::sort(Sets, [](const SortType &a, const SortType &b) {
189 for (auto &I : Sets) {
  /src/external/apache2/llvm/dist/llvm/tools/obj2yaml/
dwarf2yaml.cpp 178 ArrayRef<DWARFDebugPubTable::Set> Sets = Table.getData();
179 if (Sets.empty())
183 Y.Format = Sets[0].Format;
184 Y.Length = Sets[0].Length;
185 Y.Version = Sets[0].Version;
186 Y.UnitOffset = Sets[0].Offset;
187 Y.UnitSize = Sets[0].Size;
189 for (const DWARFDebugPubTable::Entry &E : Sets[0].Entries)
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
TableGen.cpp 116 clEnumValN(PrintSets, "print-sets",
117 "Print expanded sets for testing DAG exprs"),
227 SetTheory Sets;
228 Sets.addFieldExpander("Set", "Elements");
231 const std::vector<Record*> *Elts = Sets.expand(Rec);
CodeGenRegisters.h 531 SetTheory Sets;
562 // unique set for each register class. Simliar sets are coalesced with
570 // register units to lists of unit sets. If the list of unit sets does not
601 // Iteratively prune unit sets.
624 SetTheory &getSets() { return Sets; }
768 // register classes if some register units appeared in a list of sets that
CodeGenSchedule.cpp 171 Sets.addFieldExpander("InstRW", "Instrs");
175 Sets.addOperator("instrs", std::make_unique<InstrsOp>());
176 Sets.addOperator("instregex", std::make_unique<InstRegexOp>(Target));
320 // elements based on their processor and predicate sets.
1045 // Sort Instrs into sets.
1046 const RecVec *InstDefs = Sets.expand(InstRWDef);
1067 const RecVec *OrigInstDefs = Sets.expand(RWDefs[0]);
1268 const RecVec *InstDefs = Sets.expand(Rec);
CodeGenRegisters.cpp 876 // This is a simple lexicographical order that can be used to search for sets.
1104 // Configure register Sets to understand register classes and tuples.
1105 Sets.addFieldExpander("RegisterClass", "MemberList");
1106 Sets.addFieldExpander("CalleeSavedRegs", "SaveList");
1107 Sets.addExpander("RegisterTuples",
1132 std::vector<Record *> TupRegs = *Sets.expand(R);
1758 // The unit may be shared among sets and registers within this set.
1818 /// Iteratively prune unit sets. Prune subsets that are close to the superset,
1822 /// encodings. Generating all possible overlapping sets is combinatorial and
1828 /// are not nicely defined by merging nearly identical register unit sets
    [all...]
CodeGenSchedule.h 421 SetTheory Sets;
  /src/sys/arch/ia64/stand/common/
help.common 135 Sets the default delay for the autoboot command to <value> seconds.
142 Sets the default set of kernel boot filename(s). It may be overridden
216 Sets the current console. If <value> is omitted, a list of valid
231 Sets the list of binaries which the kernel will try to run as initial
240 Sets the list of directories which will be searched in for modules
284 Sets the size of kernel memory (bytes). This overrides
316 Sets the lowest address that the pci code will assign
  /src/distrib/sets/
maketars 10 # The default sets are "base base32 base64 comp debug debug32 debug64 dtb
12 # The X sets are "xbase xcomp xdebug xetc xfont xserver"
14 # If '-i installdir' is given, copy the given sets to installdir
16 # In this case, remove "etc", and "xetc" from the list of default sets.
21 . "${rundir}/sets.subr"
36 # mtree(8) keys to skip (exclude) in the generated /etc/mtree/sets.* files.
37 # Note: sets contain sha256 so that keyword is not listed here.
50 -i idir Install sets to idir instead of creating tar files
54 -s setsdir Directory to find sets [${setsdir}]
63 [setname ...] Sets to build [${lists}
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/IR/
Attributes.cpp 1124 AttributeListImpl::AttributeListImpl(ArrayRef<AttributeSet> Sets)
1125 : NumAttrSets(Sets.size()) {
1126 assert(!Sets.empty() && "pointless AttributeListImpl");
1129 llvm::copy(Sets, getTrailingObjects<AttributeSet>());
1133 for (const auto &I : Sets[attrIdxToArrayIdx(AttributeList::FunctionIndex)])
1137 for (const auto &Set : Sets)
1148 ArrayRef<AttributeSet> Sets) {
1149 for (const auto &Set : Sets)
1282 // AttributeListImpls by dropping empty attribute sets at the end of the list.
1299 // If all attribute sets were empty, we can use the empty attribute list
    [all...]
AttributeImpl.h 300 AttributeListImpl(ArrayRef<AttributeSet> Sets);
  /src/usr.sbin/sysinst/
msg.mi.de 66 {Sets erneut installieren f�r}
113 die Sets auf eine im Vorfeld partitionierte und bootf�hige Festplatte.
457 {Das Extrahieren der ausgew�hlten Sets f�r NetBSD-@@VERSION@@ ist abgeschlossen.
512 {Die NetBSD-Distribution ist in verschiedene Pakete (Sets) aufgeteilt.
521 * $0 = sets suffix .tgz
537 * $0 = sets suffix .tgz
554 * $0 = sets suffix .tgz
586 * $0 = sets suffix .tgz
596 * $0 = sets suffix .tgz
824 Sind Sie sicher, dass Sie alle ben�tigten Sets installiert haben
    [all...]
  /src/usr.bin/make/unit-tests/
varmod-assign.mk 93 # The :L modifier sets the value of the expression to its variable
156 ${VARNAME}= initial-value # Sets 'VAR.${param}' to 'expanded'.
  /src/external/apache2/llvm/dist/llvm/bindings/ocaml/target/
llvm_target.mli 207 (** Sets the assembly verbosity of this target machine.
  /src/external/apache2/llvm/dist/clang/lib/AST/
OpenMPClause.cpp 2258 for (const OMPTraitSet &Set : Sets) {
2312 for (const OMPTraitSet &Set : Sets) {
2365 for (const OMPTraitSet &Set : Sets) {
2395 Sets.push_back(OMPTraitSet());
2396 OMPTraitSet &Set = Sets.back();
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LICM.cpp 453 // Loop over all of the alias sets in the tracker object.
1122 /// Return true if all of the alias sets within this AST are known not to
2297 // We're only interested in must-alias sets that contain a mod.
2298 SmallVector<const AliasSet *, 8> Sets;
2301 Sets.push_back(&AS);
2303 if (Sets.empty())
2306 // Discard any sets for which there is an aliasing non-promotable access.
2311 llvm::erase_if(Sets, [&](const AliasSet *AS) {
2317 for (const AliasSet *Set : Sets) {
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
LowerTypeTests.cpp 93 STATISTIC(NumTypeIdDisjointSets, "Number of disjoint sets of type identifiers");
824 /// build the bit sets and lower the llvm.type.test calls.
1262 /// Given a disjoint set of type identifiers and functions, build the bit sets
1432 /// for the functions, build the bit sets and lower the llvm.type.test calls.
1650 // Order the sets of indices by size. The GlobalLayoutBuilder works best
1651 // when given small index sets first.
1657 // Create a GlobalLayoutBuilder and provide it with index sets as layout
1866 // the module into disjoint sets.
2141 // Build a list of disjoint sets ordered by their maximum global index for
2143 std::vector<std::pair<GlobalClassesTy::iterator, unsigned>> Sets;
    [all...]

Completed in 32 milliseconds

1 2