OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:NewE
(Results
1 - 7
of
7
) sorted by null
/external/llvm/lib/Support/
ScaledNumber.cpp
169
int
NewE
= std::min(ScaledNumbers::MaxScale, E + 63 - LeadingZeros);
170
int Shift = 63 - (
NewE
- E);
172
assert(Shift == LeadingZeros ||
NewE
== ScaledNumbers::MaxScale);
175
E =
NewE
;
/external/clang/lib/StaticAnalyzer/Checkers/
DynamicTypePropagation.cpp
105
void checkPostStmt(const CXXNewExpr *
NewE
, CheckerContext &C) const;
294
void DynamicTypePropagation::checkPostStmt(const CXXNewExpr *
NewE
,
296
if (
NewE
->isArray())
300
const MemRegion *MR = C.getSVal(
NewE
).getAsRegion();
304
C.addTransition(setDynamicTypeInfo(C.getState(), MR,
NewE
->getType(),
[
all
...]
/external/llvm/unittests/Analysis/
LazyCallGraphTest.cpp
507
const LazyCallGraph::Edge &
NewE
= A[D];
508
EXPECT_TRUE(
NewE
);
509
EXPECT_TRUE(
NewE
.isCall());
510
EXPECT_EQ(&D,
NewE
.getNode());
528
EXPECT_FALSE(
NewE
.isCall());
545
EXPECT_TRUE(
NewE
.isCall());
[
all
...]
/external/llvm/lib/Target/Hexagon/
HexagonGenInsert.cpp
796
iterator
NewE
= std::upper_bound(NewB, E, VR, RCB);
804
for (iterator I =
NewE
; I != E; ++I)
807
B = NewB, E =
NewE
;
[
all
...]
HexagonCommonGEP.cpp
642
NodeVect::iterator
NewE
= std::remove_if(Nodes.begin(), Nodes.end(),
644
Nodes.resize(std::distance(Nodes.begin(),
NewE
));
[
all
...]
/external/llvm/lib/MC/MCParser/
AsmParser.cpp
[
all
...]
/external/clang/lib/Sema/
SemaOverload.cpp
[
all
...]
Completed in 169 milliseconds