HomeSort by: relevance | last modified time | path
    Searched defs:Sets (Results 1 - 11 of 11) sorted by relevancy

  /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...]
  /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/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/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/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);
CodeGenSchedule.h 421 SetTheory Sets;
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
  /src/external/mit/isl/dist/doc/
implementation.tex 1 \section{Sets and Relations}
4 A {\em polyhedral set}\index{polyhedral set} $S$ is a finite union of basic sets
109 For rational sets, the obvious choice would be to compute the
110 (rational) convex hull. For integer sets, the obvious choice
163 in sets involving such variables
393 {\tt isl} performs such simplifications on all sets and relations.
519 sets and relations in {\tt isl}. Instead, {\tt isl} represents
667 A restriction of the algorithm is that it only works on bounded sets.
828 expressions in the internal representation of sets and relations
945 and with $\Delta_i$ the basic sets that compos
    [all...]
  /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/clang/include/clang/AST/
OpenMPClause.h 75 /// Sets the starting location of the clause.
78 /// Sets the ending location of the clause.
218 /// Sets the list of variables for this clause.
247 /// Sets the location of '('.
298 /// Sets the location of '('.
368 /// Sets location of ':' symbol in clause.
488 /// Sets the location of '('.
565 /// Sets the location of '('.
637 /// Sets the location of '('.
704 /// Sets the location of '('
    [all...]

Completed in 99 milliseconds