OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:Cases
(Results
1 - 10
of
10
) sorted by null
/external/clang/test/Sema/
warn-unreachable.c
102
enum
Cases
{ C1, C2, C3 };
103
int test_enum_cases(enum
Cases
C) {
return.c
247
// Test that for switch(enum) that if the switch statement covers all the
cases
249
enum
Cases
{ C1, C2, C3, C4 };
250
int test_enum_cases(enum
Cases
C) {
/external/llvm/include/llvm/ADT/
StringSwitch.h
10
// statement whose
cases
are string literals.
22
/// \brief A switch()-like statement whose
cases
are string literals.
38
/// .
Cases
("violet", "purple", Violet)
85
StringSwitch&
Cases
(const char (&S0)[N0], const char (&S1)[N1],
91
StringSwitch&
Cases
(const char (&S0)[N0], const char (&S1)[N1],
97
StringSwitch&
Cases
(const char (&S0)[N0], const char (&S1)[N1],
104
StringSwitch&
Cases
(const char (&S0)[N0], const char (&S1)[N1],
/external/llvm/utils/TableGen/
DAGISelMatcherOpt.cpp
446
SmallVector<std::pair<const SDNodeInfo*, Matcher*>, 8>
Cases
;
451
Cases
.push_back(std::make_pair(&COM->getOpcode(), COM->getNext()));
454
MatcherPtr.reset(new SwitchOpcodeMatcher(&
Cases
[0],
Cases
.size()));
461
SmallVector<std::pair<MVT::SimpleValueType, Matcher*>, 8>
Cases
;
473
Matcher *PrevMatcher =
Cases
[Entry-1].second;
481
Cases
[Entry-1].second = new ScopeMatcher(Entries, 2);
485
Entry =
Cases
.size()+1;
486
Cases
.push_back(std::make_pair(CTMTy, MatcherWithoutCTM));
489
if (
Cases
.size() != 1)
[
all
...]
DAGISelMatcher.h
471
/// to one matcher per opcode. If the opcode doesn't match any of the
cases
,
475
SmallVector<std::pair<const SDNodeInfo*, Matcher*>, 8>
Cases
;
477
SwitchOpcodeMatcher(const std::pair<const SDNodeInfo*, Matcher*> *
cases
,
479
: Matcher(SwitchOpcode),
Cases
(
cases
,
cases
+numcases) {}
485
unsigned getNumCases() const { return
Cases
.size(); }
487
const SDNodeInfo &getCaseOpcode(unsigned i) const { return *
Cases
[i].first; }
488
Matcher *getCaseMatcher(unsigned i) { return
Cases
[i].second; }
489
const Matcher *getCaseMatcher(unsigned i) const { return
Cases
[i].second;
[
all
...]
/external/llvm/lib/Transforms/Utils/
LowerSwitch.cpp
67
unsigned Clusterify(CaseVector&
Cases
, SwitchInst *SI);
223
// Clusterify - Transform simple list of
Cases
into list of CaseRange's
224
unsigned LowerSwitch::Clusterify(CaseVector&
Cases
, SwitchInst *SI) {
228
// Start with "simple"
cases
245
Cases
.push_back(CaseRange(C.first.getLow().toConstantInt(),
288
// Prepare
cases
vector.
289
CaseVector
Cases
;
290
unsigned numCmps = Clusterify(
Cases
, SI);
292
DEBUG(dbgs() << "Clusterify finished. Total clusters: " <<
Cases
.size()
294
DEBUG(dbgs() << "
Cases
: " << Cases << "\n")
[
all
...]
SimplifyCFG.cpp
80
std::vector<ValueEqualityComparisonCase> &
Cases
);
417
// If this is an icmp against a constant, handle this as one of the
cases
.
534
/// decode all of the '
cases
' that it represents and return the 'default' block.
538
&
Cases
) {
540
Cases
.reserve(SI->getNumCases());
542
Cases
.push_back(ValueEqualityComparisonCase(i.getCaseValue(),
550
Cases
.push_back(ValueEqualityComparisonCase(GetConstantInt(ICI->getOperand(1),
560
std::vector<ValueEqualityComparisonCase> &
Cases
) {
561
for (unsigned i = 0, e =
Cases
.size(); i != e; ++i)
562
if (
Cases
[i].Dest == BB)
[
all
...]
/external/llvm/include/llvm/Support/
IntegersSubsetMapping.h
259
typedef std::list<Case>
Cases
;
260
typedef typename
Cases
::iterator CasesIt;
518
void getCases(
Cases
& TheCases, bool PreventMerging = false) {
/external/llvm/lib/CodeGen/SelectionDAG/
SelectionDAGBuilder.h
191
size_t Clusterify(CaseVector &
Cases
, const SwitchInst &SI);
269
Parent(P), Default(D),
Cases
(C) { }
278
BitTestInfo
Cases
;
408
bool ShouldEmitAsBranches(const std::vector<CaseBlock> &
Cases
);
SelectionDAGBuilder.cpp
302
// Handle
cases
such as i8 -> <1 x i1>
[
all
...]
Completed in 333 milliseconds