forked from OSchip/llvm-project
Revert r136046 while fixing handling of e.g. &foo[index_one_past_size]
llvm-svn: 136113
This commit is contained in:
parent
e69a19569b
commit
c45dcd2594
|
@ -4035,17 +4035,11 @@ def err_out_of_line_default_deletes : Error<
|
|||
def err_defaulted_move_unsupported : Error<
|
||||
"defaulting move functions not yet supported">;
|
||||
|
||||
def warn_ptr_arith_precedes_bounds : Warning<
|
||||
"the pointer decremented by %0 refers before the beginning of the array">,
|
||||
InGroup<DiagGroup<"array-bounds-pointer-arithmetic">>, DefaultIgnore;
|
||||
def warn_ptr_arith_exceeds_bounds : Warning<
|
||||
"the pointer incremented by %0 refers past the end of the array (that contains %1 element%s2)">,
|
||||
InGroup<DiagGroup<"array-bounds-pointer-arithmetic">>, DefaultIgnore;
|
||||
def warn_array_index_precedes_bounds : Warning<
|
||||
"array index of '%0' indexes before the beginning of the array">,
|
||||
InGroup<DiagGroup<"array-bounds">>;
|
||||
def warn_array_index_exceeds_bounds : Warning<
|
||||
"array index of '%0' indexes past the end of an array (that contains %1 element%s2)">,
|
||||
"array index of '%0' indexes past the end of an array (that contains %1 elements)">,
|
||||
InGroup<DiagGroup<"array-bounds">>;
|
||||
def note_array_index_out_of_bounds : Note<
|
||||
"array %0 declared here">;
|
||||
|
|
|
@ -5885,8 +5885,6 @@ public:
|
|||
unsigned ByteNo) const;
|
||||
|
||||
private:
|
||||
void CheckArrayAccess(const Expr *BaseExpr, const Expr *IndexExpr,
|
||||
bool isSubscript=false);
|
||||
void CheckArrayAccess(const Expr *E);
|
||||
bool CheckFunctionCall(FunctionDecl *FDecl, CallExpr *TheCall);
|
||||
bool CheckBlockCall(NamedDecl *NDecl, CallExpr *TheCall);
|
||||
|
|
|
@ -3467,87 +3467,43 @@ void Sema::CheckCastAlign(Expr *Op, QualType T, SourceRange TRange) {
|
|||
<< TRange << Op->getSourceRange();
|
||||
}
|
||||
|
||||
static const Type* getElementType(const Expr *BaseExpr) {
|
||||
const Type* EltType = BaseExpr->getType().getTypePtr();
|
||||
if (EltType->isAnyPointerType())
|
||||
return EltType->getPointeeType().getTypePtr();
|
||||
else if (EltType->isArrayType())
|
||||
return EltType->getBaseElementTypeUnsafe();
|
||||
return EltType;
|
||||
}
|
||||
|
||||
void Sema::CheckArrayAccess(const Expr *BaseExpr, const Expr *IndexExpr,
|
||||
bool isSubscript) {
|
||||
const Type* EffectiveType = getElementType(BaseExpr);
|
||||
BaseExpr = BaseExpr->IgnoreParenCasts();
|
||||
IndexExpr = IndexExpr->IgnoreParenCasts();
|
||||
|
||||
static void CheckArrayAccess_Check(Sema &S,
|
||||
const clang::ArraySubscriptExpr *E) {
|
||||
const Expr *BaseExpr = E->getBase()->IgnoreParenImpCasts();
|
||||
const ConstantArrayType *ArrayTy =
|
||||
Context.getAsConstantArrayType(BaseExpr->getType());
|
||||
S.Context.getAsConstantArrayType(BaseExpr->getType());
|
||||
if (!ArrayTy)
|
||||
return;
|
||||
|
||||
const Expr *IndexExpr = E->getIdx();
|
||||
if (IndexExpr->isValueDependent())
|
||||
return;
|
||||
llvm::APSInt index;
|
||||
if (!IndexExpr->isIntegerConstantExpr(index, Context))
|
||||
if (!IndexExpr->isIntegerConstantExpr(index, S.Context))
|
||||
return;
|
||||
|
||||
if (index.isUnsigned() || !index.isNegative()) {
|
||||
llvm::APInt size = ArrayTy->getSize();
|
||||
if (!size.isStrictlyPositive())
|
||||
return;
|
||||
|
||||
const Type* BaseType = getElementType(BaseExpr);
|
||||
if (BaseType != EffectiveType) {
|
||||
// Make sure we're comparing apples to apples when comparing index to size
|
||||
uint64_t ptrarith_typesize = Context.getTypeSize(EffectiveType);
|
||||
uint64_t array_typesize = Context.getTypeSize(BaseType);
|
||||
if (ptrarith_typesize != array_typesize) {
|
||||
// There's a cast to a different size type involved
|
||||
uint64_t ratio = array_typesize / ptrarith_typesize;
|
||||
if (ptrarith_typesize * ratio != array_typesize)
|
||||
// If the size of the array's base type is not a multiple of the
|
||||
// casted-to pointee type, the results of the pointer arithmetic
|
||||
// may or may not point to something consistently meaningful or within a
|
||||
// valid reference...
|
||||
return;
|
||||
|
||||
size *= llvm::APInt(size.getBitWidth(), ratio);
|
||||
}
|
||||
}
|
||||
|
||||
if (size.getBitWidth() > index.getBitWidth())
|
||||
index = index.sext(size.getBitWidth());
|
||||
else if (size.getBitWidth() < index.getBitWidth())
|
||||
size = size.sext(index.getBitWidth());
|
||||
|
||||
// For array subscripting the index must be less than size, but for pointer
|
||||
// arithmetic also allow the index (offset) to be equal to size since
|
||||
// computing the next address after the end of the array is legal and
|
||||
// commonly done e.g. in C++ iterators and range-based for loops.
|
||||
if (isSubscript ? index.slt(size) : index.sle(size))
|
||||
if (index.slt(size))
|
||||
return;
|
||||
|
||||
unsigned DiagID = diag::warn_ptr_arith_exceeds_bounds;
|
||||
if (isSubscript)
|
||||
DiagID = diag::warn_array_index_exceeds_bounds;
|
||||
|
||||
DiagRuntimeBehavior(BaseExpr->getLocStart(), BaseExpr,
|
||||
PDiag(DiagID) << index.toString(10, true)
|
||||
<< size.toString(10, true)
|
||||
<< (unsigned)size.getLimitedValue(~0U)
|
||||
<< IndexExpr->getSourceRange());
|
||||
S.DiagRuntimeBehavior(E->getBase()->getLocStart(), BaseExpr,
|
||||
S.PDiag(diag::warn_array_index_exceeds_bounds)
|
||||
<< index.toString(10, true)
|
||||
<< size.toString(10, true)
|
||||
<< IndexExpr->getSourceRange());
|
||||
} else {
|
||||
unsigned DiagID = diag::warn_array_index_precedes_bounds;
|
||||
if (!isSubscript) {
|
||||
DiagID = diag::warn_ptr_arith_precedes_bounds;
|
||||
if (index.isNegative()) index = -index;
|
||||
}
|
||||
|
||||
DiagRuntimeBehavior(BaseExpr->getLocStart(), BaseExpr,
|
||||
PDiag(DiagID) << index.toString(10, true)
|
||||
<< IndexExpr->getSourceRange());
|
||||
S.DiagRuntimeBehavior(E->getBase()->getLocStart(), BaseExpr,
|
||||
S.PDiag(diag::warn_array_index_precedes_bounds)
|
||||
<< index.toString(10, true)
|
||||
<< IndexExpr->getSourceRange());
|
||||
}
|
||||
|
||||
const NamedDecl *ND = NULL;
|
||||
|
@ -3556,21 +3512,18 @@ void Sema::CheckArrayAccess(const Expr *BaseExpr, const Expr *IndexExpr,
|
|||
if (const MemberExpr *ME = dyn_cast<MemberExpr>(BaseExpr))
|
||||
ND = dyn_cast<NamedDecl>(ME->getMemberDecl());
|
||||
if (ND)
|
||||
DiagRuntimeBehavior(ND->getLocStart(), BaseExpr,
|
||||
PDiag(diag::note_array_index_out_of_bounds)
|
||||
<< ND->getDeclName());
|
||||
S.DiagRuntimeBehavior(ND->getLocStart(), BaseExpr,
|
||||
S.PDiag(diag::note_array_index_out_of_bounds)
|
||||
<< ND->getDeclName());
|
||||
}
|
||||
|
||||
void Sema::CheckArrayAccess(const Expr *expr) {
|
||||
while (true) {
|
||||
expr = expr->IgnoreParens();
|
||||
switch (expr->getStmtClass()) {
|
||||
case Stmt::ArraySubscriptExprClass: {
|
||||
const ArraySubscriptExpr *ASE = cast<ArraySubscriptExpr>(expr);
|
||||
CheckArrayAccess(ASE->getBase(),
|
||||
ASE->getIdx(), true);
|
||||
case Stmt::ArraySubscriptExprClass:
|
||||
CheckArrayAccess_Check(*this, cast<ArraySubscriptExpr>(expr));
|
||||
return;
|
||||
}
|
||||
case Stmt::ConditionalOperatorClass: {
|
||||
const ConditionalOperator *cond = cast<ConditionalOperator>(expr);
|
||||
if (const Expr *lhs = cond->getLHS())
|
||||
|
|
|
@ -268,7 +268,6 @@ ExprResult Sema::DefaultFunctionArrayConversion(Expr *E) {
|
|||
E = ImpCastExprToType(E, Context.getPointerType(Ty),
|
||||
CK_FunctionToPointerDecay).take();
|
||||
else if (Ty->isArrayType()) {
|
||||
CheckArrayAccess(E);
|
||||
// In C90 mode, arrays only promote to pointers if the array expression is
|
||||
// an lvalue. The relevant legalese is C90 6.2.2.1p3: "an lvalue that has
|
||||
// type 'array of type' is converted to an expression that has type 'pointer
|
||||
|
@ -311,7 +310,6 @@ ExprResult Sema::DefaultLvalueConversion(Expr *E) {
|
|||
// A glvalue of a non-function, non-array type T can be
|
||||
// converted to a prvalue.
|
||||
if (!E->isGLValue()) return Owned(E);
|
||||
|
||||
QualType T = E->getType();
|
||||
assert(!T.isNull() && "r-value conversion on typeless expression?");
|
||||
|
||||
|
@ -387,14 +385,6 @@ ExprResult Sema::UsualUnaryConversions(Expr *E) {
|
|||
QualType Ty = E->getType();
|
||||
assert(!Ty.isNull() && "UsualUnaryConversions - missing type");
|
||||
|
||||
if (Ty->isPointerType() || Ty->isArrayType()) {
|
||||
Expr *subE = E->IgnoreParenImpCasts();
|
||||
while (UnaryOperator *UO = dyn_cast<UnaryOperator>(subE)) {
|
||||
subE = UO->getSubExpr()->IgnoreParenImpCasts();
|
||||
}
|
||||
if (subE) CheckArrayAccess(subE);
|
||||
}
|
||||
|
||||
// Try to perform integral promotions if the object has a theoretically
|
||||
// promotable type.
|
||||
if (Ty->isIntegralOrUnscopedEnumerationType()) {
|
||||
|
@ -5822,8 +5812,6 @@ QualType Sema::CheckAdditionOperands( // C99 6.5.6
|
|||
return QualType();
|
||||
}
|
||||
|
||||
CheckArrayAccess(PExp, IExp);
|
||||
|
||||
if (CompLHSTy) {
|
||||
QualType LHSTy = Context.isPromotableBitField(lex.get());
|
||||
if (LHSTy.isNull()) {
|
||||
|
@ -5878,11 +5866,6 @@ QualType Sema::CheckSubtractionOperands(ExprResult &lex, ExprResult &rex,
|
|||
if (!checkArithmeticOpPointerOperand(*this, Loc, lex.get()))
|
||||
return QualType();
|
||||
|
||||
Expr *IExpr = rex.get()->IgnoreParenCasts();
|
||||
UnaryOperator negRex(IExpr, UO_Minus, IExpr->getType(), VK_RValue,
|
||||
OK_Ordinary, IExpr->getExprLoc());
|
||||
CheckArrayAccess(lex.get()->IgnoreParenCasts(), &negRex);
|
||||
|
||||
if (CompLHSTy) *CompLHSTy = lex.get()->getType();
|
||||
return lex.get()->getType();
|
||||
}
|
||||
|
|
|
@ -1,33 +0,0 @@
|
|||
// RUN: %clang_cc1 -verify -Warray-bounds-pointer-arithmetic %s
|
||||
|
||||
void swallow (const char *x) { (void)x; }
|
||||
void test_pointer_arithmetic(int n) {
|
||||
const char hello[] = "Hello world!"; // expected-note 2 {{declared here}}
|
||||
const char *helloptr = hello;
|
||||
|
||||
swallow("Hello world!" + 6); // no-warning
|
||||
swallow("Hello world!" - 6); // expected-warning {{refers before the beginning of the array}}
|
||||
swallow("Hello world!" + 14); // expected-warning {{refers past the end of the array}}
|
||||
swallow("Hello world!" + 13); // no-warning
|
||||
|
||||
swallow(hello + 6); // no-warning
|
||||
swallow(hello - 6); // expected-warning {{refers before the beginning of the array}}
|
||||
swallow(hello + 14); // expected-warning {{refers past the end of the array}}
|
||||
swallow(hello + 13); // no-warning
|
||||
|
||||
swallow(helloptr + 6); // no-warning
|
||||
swallow(helloptr - 6); // no-warning
|
||||
swallow(helloptr + 14); // no-warning
|
||||
swallow(helloptr + 13); // no-warning
|
||||
|
||||
double numbers[2]; // expected-note {{declared here}}
|
||||
swallow((char*)numbers + sizeof(double)); // no-warning
|
||||
swallow((char*)numbers + 60); // expected-warning {{refers past the end of the array}}
|
||||
|
||||
char buffer[5]; // expected-note 2 {{declared here}}
|
||||
// TODO: Add FixIt notes for adding parens around non-ptr part of arith expr
|
||||
swallow(buffer + sizeof("Hello")-1); // expected-warning {{refers past the end of the array}}
|
||||
swallow(buffer + (sizeof("Hello")-1)); // no-warning
|
||||
if (n > 0 && n <= 6) swallow(buffer + 6 - n); // expected-warning {{refers past the end of the array}}
|
||||
if (n > 0 && n <= 6) swallow(buffer + (6 - n)); // no-warning
|
||||
}
|
|
@ -25,7 +25,7 @@ void f1(int a[1]) {
|
|||
}
|
||||
|
||||
void f2(const int (&a)[1]) { // expected-note {{declared here}}
|
||||
int val = a[3]; // expected-warning {{array index of '3' indexes past the end of an array (that contains 1 element)}}
|
||||
int val = a[3]; // expected-warning {{array index of '3' indexes past the end of an array (that contains 1 elements)}}
|
||||
}
|
||||
|
||||
void test() {
|
||||
|
@ -35,17 +35,15 @@ void test() {
|
|||
s2.a[3] = 0; // no warning for 0-sized array
|
||||
|
||||
union {
|
||||
short a[2]; // expected-note 2 {{declared here}}
|
||||
short a[2]; // expected-note {{declared here}}
|
||||
char c[4];
|
||||
} u;
|
||||
u.a[3] = 1; // expected-warning {{array index of '3' indexes past the end of an array (that contains 2 elements)}}
|
||||
u.c[3] = 1; // no warning
|
||||
*(&u.a[3]) = 1; // expected-warning {{array index of '3' indexes past the end of an array (that contains 2 elements)}}
|
||||
*(&u.c[3]) = 1; // no warning
|
||||
|
||||
const int const_subscript = 3;
|
||||
int array[1]; // expected-note {{declared here}}
|
||||
array[const_subscript] = 0; // expected-warning {{array index of '3' indexes past the end of an array (that contains 1 element)}}
|
||||
array[const_subscript] = 0; // expected-warning {{array index of '3' indexes past the end of an array (that contains 1 elements)}}
|
||||
|
||||
int *ptr;
|
||||
ptr[3] = 0; // no warning for pointer references
|
||||
|
@ -61,7 +59,7 @@ void test() {
|
|||
char c2 = str2[5]; // expected-warning {{array index of '5' indexes past the end of an array (that contains 4 elements)}}
|
||||
|
||||
int (*array_ptr)[1];
|
||||
(*array_ptr)[3] = 1; // expected-warning {{array index of '3' indexes past the end of an array (that contains 1 element)}}
|
||||
(*array_ptr)[3] = 1; // expected-warning {{array index of '3' indexes past the end of an array (that contains 1 elements)}}
|
||||
}
|
||||
|
||||
template <int I> struct S {
|
||||
|
@ -153,7 +151,8 @@ void test_switch() {
|
|||
enum enumA { enumA_A, enumA_B, enumA_C, enumA_D, enumA_E };
|
||||
enum enumB { enumB_X, enumB_Y, enumB_Z };
|
||||
static enum enumB myVal = enumB_X;
|
||||
void test_nested_switch() {
|
||||
void test_nested_switch()
|
||||
{
|
||||
switch (enumA_E) { // expected-warning {{no case matching constant}}
|
||||
switch (myVal) { // expected-warning {{enumeration values 'enumB_X' and 'enumB_Z' not handled in switch}}
|
||||
case enumB_Y: ;
|
||||
|
|
Loading…
Reference in New Issue