HomeSort by relevance Sort by last modified time
    Searched refs:CaseRanges (Results 1 - 11 of 11) sorted by null

  /frameworks/compile/slang/BitWriter_2_9/
BitcodeWriterPass.cpp 60 IntegersSubset& CaseRanges = i.getCaseValueEx();
63 if (CaseRanges.isSingleNumbersOnly()) {
72 for (unsigned ri = 0, rn = CaseRanges.getNumItems(); ri != rn; ++ri) {
73 IntegersSubset::Range r = CaseRanges.getItem(ri);
74 bool IsSingleNumber = CaseRanges.isSingleNumber(ri);
BitcodeWriter.cpp     [all...]
  /frameworks/compile/slang/BitWriter_2_9_func/
BitcodeWriterPass.cpp 60 IntegersSubset& CaseRanges = i.getCaseValueEx();
63 if (CaseRanges.isSingleNumbersOnly()) {
72 for (unsigned ri = 0, rn = CaseRanges.getNumItems(); ri != rn; ++ri) {
73 IntegersSubset::Range r = CaseRanges.getItem(ri);
74 bool IsSingleNumber = CaseRanges.isSingleNumber(ri);
BitcodeWriter.cpp     [all...]
  /external/llvm/lib/Transforms/Utils/
LowerSwitch.cpp 232 IntegersSubset CaseRanges = i.getCaseValueEx();
233 TheClusterifier.add(CaseRanges, SuccBB);
  /external/clang/lib/Sema/
SemaStmt.cpp 713 CaseRangesTy CaseRanges;
780 // If this is a case range, remember it in CaseRanges, otherwise CaseVals.
787 CaseRanges.push_back(std::make_pair(LoVal, CS));
854 if (!CaseRanges.empty()) {
857 std::stable_sort(CaseRanges.begin(), CaseRanges.end());
861 for (unsigned i = 0, e = CaseRanges.size(); i != e; ++i) {
862 llvm::APSInt &LoVal = CaseRanges[i].first;
863 CaseStmt *CR = CaseRanges[i].second;
    [all...]
  /external/llvm/lib/Bitcode/Writer/
BitcodeWriter.cpp     [all...]
  /frameworks/compile/slang/BitWriter_3_2/
BitcodeWriter.cpp     [all...]
  /external/llvm/lib/IR/
Verifier.cpp     [all...]
Instructions.cpp     [all...]
  /external/llvm/include/llvm/IR/
Instructions.h     [all...]

Completed in 250 milliseconds