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/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/clang/lib/ARCMigrate/
TransProtectedScope.cpp
57
SmallVectorImpl<CaseInfo> &
Cases
;
60
CaseCollector(ParentMap &PMap, SmallVectorImpl<CaseInfo> &
Cases
)
61
: PMap(PMap),
Cases
(
Cases
) { }
80
Cases
.push_back(CaseInfo(Curr,SourceRange(Curr->getLocStart(), NextLoc)));
98
SmallVector<CaseInfo, 16>
Cases
;
106
CaseCollector(BodyCtx.getParentMap(),
Cases
)
149
for (unsigned i = 0; i !=
Cases
.size(); i++) {
150
CaseInfo &info =
Cases
[i];
/external/llvm/utils/TableGen/
DAGISelMatcherOpt.cpp
454
SmallVector<std::pair<const SDNodeInfo*, Matcher*>, 8>
Cases
;
459
Cases
.push_back(std::make_pair(&COM->getOpcode(), COM->getNext()));
462
MatcherPtr.reset(new SwitchOpcodeMatcher(
Cases
));
469
SmallVector<std::pair<MVT::SimpleValueType, Matcher*>, 8>
Cases
;
481
Matcher *PrevMatcher =
Cases
[Entry-1].second;
489
Cases
[Entry-1].second = new ScopeMatcher(Entries);
493
Entry =
Cases
.size()+1;
494
Cases
.push_back(std::make_pair(CTMTy, MatcherWithoutCTM));
497
if (
Cases
.size() != 1) {
498
MatcherPtr.reset(new SwitchTypeMatcher(
Cases
));
[
all
...]
AsmWriterEmitter.cpp
300
/// To reduce the number of unhandled
cases
, we expand the size from 32-bit
365
// Compute the number of bits we need to represent these
cases
, this is
452
// Compute the number of bits we need to represent these
cases
, this is
479
// Print out all the
cases
.
[
all
...]
DAGISelMatcher.h
501
/// to one matcher per opcode. If the opcode doesn't match any of the
cases
,
505
SmallVector<std::pair<const SDNodeInfo*, Matcher*>, 8>
Cases
;
507
SwitchOpcodeMatcher(ArrayRef<std::pair<const SDNodeInfo*, Matcher*> >
cases
)
508
: Matcher(SwitchOpcode),
Cases
(
cases
.begin(),
cases
.end()) {}
515
unsigned getNumCases() const { return
Cases
.size(); }
517
const SDNodeInfo &getCaseOpcode(unsigned i) const { return *
Cases
[i].first; }
518
Matcher *getCaseMatcher(unsigned i) { return
Cases
[i].second; }
519
const Matcher *getCaseMatcher(unsigned i) const { return
Cases
[i].second;
[
all
...]
/external/clang/test/Sema/
return.c
258
// Test that for switch(enum) that if the switch statement covers all the
cases
260
enum
Cases
{ C1, C2, C3, C4 };
261
int test_enum_cases(enum
Cases
C) {
warn-unreachable.c
104
enum
Cases
{ C1, C2, C3 };
105
int test_enum_cases(enum
Cases
C) {
169
// Don't warn about unreachable 'default'
cases
, as that is covered
/external/llvm/lib/Transforms/Utils/
LowerSwitch.cpp
74
unsigned Clusterify(CaseVector &
Cases
, SwitchInst *SI);
288
// Clusterify - Transform simple list of
Cases
into list of CaseRange's
289
unsigned LowerSwitch::Clusterify(CaseVector&
Cases
, SwitchInst *SI) {
292
// Start with "simple"
cases
294
Cases
.push_back(CaseRange(i.getCaseValue(), i.getCaseValue(),
297
std::sort(
Cases
.begin(),
Cases
.end(), CaseCmp());
300
if (
Cases
.size()>=2)
301
for (CaseItr I =
Cases
.begin(), J = std::next(
Cases
.begin())
[
all
...]
SimplifyCFG.cpp
98
std::vector<ValueEqualityComparisonCase> &
Cases
);
354
// If this is an icmp against a constant, handle this as one of the
cases
.
497
/// decode all of the '
cases
' that it represents and return the 'default' block.
501
&
Cases
) {
503
Cases
.reserve(SI->getNumCases());
505
Cases
.push_back(ValueEqualityComparisonCase(i.getCaseValue(),
513
Cases
.push_back(ValueEqualityComparisonCase(GetConstantInt(ICI->getOperand(1),
523
std::vector<ValueEqualityComparisonCase> &
Cases
) {
524
Cases
.erase(std::remove(
Cases
.begin(), Cases.end(), BB), Cases.end())
[
all
...]
/external/llvm/lib/CodeGen/SelectionDAG/
SelectionDAGBuilder.h
203
size_t Clusterify(CaseVector &
Cases
, const SwitchInst &SI);
281
Parent(P), Default(D),
Cases
(C) { }
290
BitTestInfo
Cases
;
622
bool ShouldEmitAsBranches(const std::vector<CaseBlock> &
Cases
);
Completed in 4169 milliseconds