HomeSort by relevance Sort by last modified time
    Searched refs:CaseRanges (Results 1 - 10 of 10) 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/clang/lib/Sema/
SemaStmt.cpp 677 CaseRangesTy CaseRanges;
744 // If this is a case range, remember it in CaseRanges, otherwise CaseVals.
751 CaseRanges.push_back(std::make_pair(LoVal, CS));
818 if (!CaseRanges.empty()) {
821 std::stable_sort(CaseRanges.begin(), CaseRanges.end());
825 for (unsigned i = 0, e = CaseRanges.size(); i != e; ++i) {
826 llvm::APSInt &LoVal = CaseRanges[i].first;
827 CaseStmt *CR = CaseRanges[i].second;
863 CaseRanges.erase(CaseRanges.begin()+i)
    [all...]
  /external/llvm/lib/Transforms/Utils/
LowerSwitch.cpp 232 IntegersSubset CaseRanges = i.getCaseValueEx();
233 TheClusterifier.add(CaseRanges, SuccBB);
  /external/llvm/lib/Bitcode/Writer/
BitcodeWriter.cpp     [all...]
  /external/llvm/lib/VMCore/
Verifier.cpp 813 IntegersSubset CaseRanges = i.getCaseValueEx();
814 for (unsigned ri = 0, rie = CaseRanges.getNumItems(); ri < rie; ++ri) {
815 IntegersSubset::Range r = CaseRanges.getItem(ri);
    [all...]
Instructions.cpp     [all...]
  /external/llvm/include/llvm/
Instructions.h     [all...]

Completed in 107 milliseconds