[analyzer] Reimplement dependencies between checkers
Unfortunately, up until now, the fact that certain checkers depended on one
another was known, but how these actually unfolded was hidden deep within the
implementation. For example, many checkers (like RetainCount, Malloc or CString)
modelled a certain functionality, and exposed certain reportable bug types to
the user. For example, while MallocChecker models many many different types of
memory handling, the actual "unix.MallocChecker" checker the user was exposed to
was merely and option to this modeling part.
Other than this being an ugly mess, this issue made resolving the checker naming
issue almost impossible. (The checker naming issue being that if a checker
registered more than one checker within its registry function, both checker
object recieved the same name) Also, if the user explicitly disabled a checker
that was a dependency of another that _was_ explicitly enabled, it implicitly,
without "telling" the user, reenabled it.
Clearly, changing this to a well structured, declarative form, where the
handling of dependencies are done on a higher level is very much preferred.
This patch, among the detailed things later, makes checkers declare their
dependencies within the TableGen file Checkers.td, and exposes the same
functionality to plugins and statically linked non-generated checkers through
CheckerRegistry::addDependency. CheckerRegistry now resolves these dependencies,
makes sure that checkers are added to CheckerManager in the correct order,
and makes sure that if a dependency is disabled, so will be every checker that
depends on it.
In detail:
* Add a new field to the Checker class in CheckerBase.td called Dependencies,
which is a list of Checkers.
* Move unix checkers before cplusplus, as there is no forward declaration in
tblgen :/
* Add the following new checkers:
- StackAddrEscapeBase
- StackAddrEscapeBase
- CStringModeling
- DynamicMemoryModeling (base of the MallocChecker family)
- IteratorModeling (base of the IteratorChecker family)
- ValistBase
- SecuritySyntaxChecker (base of bcmp, bcopy, etc...)
- NSOrCFErrorDerefChecker (base of NSErrorChecker and CFErrorChecker)
- IvarInvalidationModeling (base of IvarInvalidation checker family)
- RetainCountBase (base of RetainCount and OSObjectRetainCount)
* Clear up and registry functions in MallocChecker, happily remove old FIXMEs.
* Add a new addDependency function to CheckerRegistry.
* Neatly format RUN lines in files I looked at while debugging.
Big thanks to Artem Degrachev for all the guidance through this project!
Differential Revision: https://reviews.llvm.org/D54438
llvm-svn: 352287
2019-01-27 04:06:54 +08:00
|
|
|
// RUN: %clang_analyze_cc1 -std=c++11 -fblocks -verify %s \
|
|
|
|
// RUN: -analyzer-checker=core \
|
|
|
|
// RUN: -analyzer-checker=cplusplus.NewDelete
|
|
|
|
//
|
|
|
|
// RUN: %clang_analyze_cc1 -DLEAKS -std=c++11 -fblocks -verify %s \
|
|
|
|
// RUN: -analyzer-checker=core \
|
|
|
|
// RUN: -analyzer-checker=cplusplus.NewDeleteLeaks
|
|
|
|
//
|
|
|
|
// RUN: %clang_analyze_cc1 -std=c++11 -fblocks -verify %s \
|
|
|
|
// RUN: -analyzer-checker=core \
|
|
|
|
// RUN: -analyzer-checker=cplusplus.NewDelete \
|
|
|
|
// RUN: -analyzer-config c++-allocator-inlining=true
|
|
|
|
//
|
|
|
|
// RUN: %clang_analyze_cc1 -DLEAKS -std=c++11 -fblocks -verify %s \
|
|
|
|
// RUN: -analyzer-checker=core \
|
|
|
|
// RUN: -analyzer-checker=cplusplus.NewDeleteLeaks \
|
|
|
|
// RUN: -analyzer-config c++-allocator-inlining=true
|
|
|
|
//
|
|
|
|
// RUN: %clang_analyze_cc1 -DTEST_INLINABLE_ALLOCATORS \
|
|
|
|
// RUN: -std=c++11 -fblocks -verify %s \
|
|
|
|
// RUN: -analyzer-checker=core \
|
|
|
|
// RUN: -analyzer-checker=cplusplus.NewDelete
|
|
|
|
//
|
|
|
|
// RUN: %clang_analyze_cc1 -DLEAKS -DTEST_INLINABLE_ALLOCATORS \
|
|
|
|
// RUN: -std=c++11 -fblocks -verify %s \
|
|
|
|
// RUN: -analyzer-checker=core \
|
|
|
|
// RUN: -analyzer-checker=cplusplus.NewDeleteLeaks
|
|
|
|
//
|
|
|
|
// RUN: %clang_analyze_cc1 -DTEST_INLINABLE_ALLOCATORS \
|
|
|
|
// RUN: -std=c++11 -fblocks -verify %s \
|
|
|
|
// RUN: -analyzer-checker=core \
|
|
|
|
// RUN: -analyzer-checker=cplusplus.NewDelete \
|
|
|
|
// RUN: -analyzer-config c++-allocator-inlining=true
|
|
|
|
//
|
|
|
|
// RUN: %clang_analyze_cc1 -DLEAKS -DTEST_INLINABLE_ALLOCATORS \
|
|
|
|
// RUN: -std=c++11 -fblocks -verify %s \
|
|
|
|
// RUN: -analyzer-checker=core \
|
|
|
|
// RUN: -analyzer-checker=cplusplus.NewDeleteLeaks \
|
|
|
|
// RUN: -analyzer-config c++-allocator-inlining=true
|
2018-01-25 05:24:10 +08:00
|
|
|
|
2013-03-25 09:35:45 +08:00
|
|
|
#include "Inputs/system-header-simulator-cxx.h"
|
|
|
|
|
|
|
|
typedef __typeof__(sizeof(int)) size_t;
|
|
|
|
extern "C" void *malloc(size_t);
|
2013-08-09 08:55:47 +08:00
|
|
|
extern "C" void free (void* ptr);
|
2013-03-25 09:35:45 +08:00
|
|
|
int *global;
|
|
|
|
|
|
|
|
//------------------
|
|
|
|
// check for leaks
|
|
|
|
//------------------
|
|
|
|
|
2013-03-29 00:10:38 +08:00
|
|
|
//----- Standard non-placement operators
|
|
|
|
void testGlobalOpNew() {
|
|
|
|
void *p = operator new(0);
|
2013-04-06 01:55:00 +08:00
|
|
|
}
|
|
|
|
#ifdef LEAKS
|
2013-04-06 08:41:36 +08:00
|
|
|
// expected-warning@-2{{Potential leak of memory pointed to by 'p'}}
|
2013-04-06 01:55:00 +08:00
|
|
|
#endif
|
2013-03-25 09:35:45 +08:00
|
|
|
|
2013-03-29 00:10:38 +08:00
|
|
|
void testGlobalOpNewArray() {
|
|
|
|
void *p = operator new[](0);
|
2013-04-06 01:55:00 +08:00
|
|
|
}
|
|
|
|
#ifdef LEAKS
|
2013-04-06 08:41:36 +08:00
|
|
|
// expected-warning@-2{{Potential leak of memory pointed to by 'p'}}
|
2013-04-06 01:55:00 +08:00
|
|
|
#endif
|
2013-03-25 09:35:45 +08:00
|
|
|
|
2013-03-29 00:10:38 +08:00
|
|
|
void testGlobalNewExpr() {
|
2013-03-25 09:35:45 +08:00
|
|
|
int *p = new int;
|
2013-04-06 01:55:00 +08:00
|
|
|
}
|
|
|
|
#ifdef LEAKS
|
2013-04-06 08:41:36 +08:00
|
|
|
// expected-warning@-2{{Potential leak of memory pointed to by 'p'}}
|
2013-04-06 01:55:00 +08:00
|
|
|
#endif
|
2013-03-25 09:35:45 +08:00
|
|
|
|
2013-03-29 00:10:38 +08:00
|
|
|
void testGlobalNewExprArray() {
|
|
|
|
int *p = new int[0];
|
2013-04-06 01:55:00 +08:00
|
|
|
}
|
|
|
|
#ifdef LEAKS
|
2013-04-06 08:41:36 +08:00
|
|
|
// expected-warning@-2{{Potential leak of memory pointed to by 'p'}}
|
2013-04-06 01:55:00 +08:00
|
|
|
#endif
|
2013-03-25 09:35:45 +08:00
|
|
|
|
2013-03-29 00:10:38 +08:00
|
|
|
//----- Standard nothrow placement operators
|
|
|
|
void testGlobalNoThrowPlacementOpNewBeforeOverload() {
|
|
|
|
void *p = operator new(0, std::nothrow);
|
2013-04-06 01:55:00 +08:00
|
|
|
}
|
|
|
|
#ifdef LEAKS
|
2018-01-25 05:24:10 +08:00
|
|
|
#ifndef TEST_INLINABLE_ALLOCATORS
|
|
|
|
// expected-warning@-3{{Potential leak of memory pointed to by 'p'}}
|
|
|
|
#endif
|
2013-04-06 01:55:00 +08:00
|
|
|
#endif
|
2013-03-25 09:35:45 +08:00
|
|
|
|
2013-03-29 00:10:38 +08:00
|
|
|
void testGlobalNoThrowPlacementExprNewBeforeOverload() {
|
|
|
|
int *p = new(std::nothrow) int;
|
2013-04-06 01:55:00 +08:00
|
|
|
}
|
|
|
|
#ifdef LEAKS
|
2018-01-25 05:24:10 +08:00
|
|
|
#ifndef TEST_INLINABLE_ALLOCATORS
|
|
|
|
// expected-warning@-3{{Potential leak of memory pointed to by 'p'}}
|
|
|
|
#endif
|
2013-04-06 01:55:00 +08:00
|
|
|
#endif
|
2013-03-25 09:35:45 +08:00
|
|
|
|
2013-03-29 00:10:38 +08:00
|
|
|
//----- Standard pointer placement operators
|
|
|
|
void testGlobalPointerPlacementNew() {
|
2013-03-25 09:35:45 +08:00
|
|
|
int i;
|
|
|
|
|
2013-03-29 00:10:38 +08:00
|
|
|
void *p1 = operator new(0, &i); // no warn
|
2013-03-25 09:35:45 +08:00
|
|
|
|
2013-03-29 00:10:38 +08:00
|
|
|
void *p2 = operator new[](0, &i); // no warn
|
2013-03-25 09:35:45 +08:00
|
|
|
|
2013-03-29 00:10:38 +08:00
|
|
|
int *p3 = new(&i) int; // no warn
|
2013-03-25 09:35:45 +08:00
|
|
|
|
2013-03-29 00:10:38 +08:00
|
|
|
int *p4 = new(&i) int[0]; // no warn
|
2013-03-25 09:35:45 +08:00
|
|
|
}
|
|
|
|
|
2013-03-29 00:10:38 +08:00
|
|
|
//----- Other cases
|
|
|
|
void testNewMemoryIsInHeap() {
|
|
|
|
int *p = new int;
|
|
|
|
if (global != p) // condition is always true as 'p' wraps a heap region that
|
|
|
|
// is different from a region wrapped by 'global'
|
|
|
|
global = p; // pointer escapes
|
2013-03-25 09:35:45 +08:00
|
|
|
}
|
|
|
|
|
2013-03-29 00:10:38 +08:00
|
|
|
struct PtrWrapper {
|
|
|
|
int *x;
|
|
|
|
|
|
|
|
PtrWrapper(int *input) : x(input) {}
|
|
|
|
};
|
2013-03-25 09:35:45 +08:00
|
|
|
|
2013-03-29 00:10:38 +08:00
|
|
|
void testNewInvalidationPlacement(PtrWrapper *w) {
|
|
|
|
// Ensure that we don't consider this a leak.
|
|
|
|
new (w) PtrWrapper(new int); // no warn
|
2013-03-25 09:35:45 +08:00
|
|
|
}
|
|
|
|
|
2015-04-14 22:18:04 +08:00
|
|
|
//-----------------------------------------
|
|
|
|
// check for usage of zero-allocated memory
|
|
|
|
//-----------------------------------------
|
|
|
|
|
|
|
|
void testUseZeroAlloc1() {
|
|
|
|
int *p = (int *)operator new(0);
|
|
|
|
*p = 1; // expected-warning {{Use of zero-allocated memory}}
|
|
|
|
delete p;
|
|
|
|
}
|
|
|
|
|
|
|
|
int testUseZeroAlloc2() {
|
|
|
|
int *p = (int *)operator new[](0);
|
|
|
|
return p[0]; // expected-warning {{Use of zero-allocated memory}}
|
|
|
|
delete[] p;
|
|
|
|
}
|
|
|
|
|
|
|
|
void f(int);
|
|
|
|
|
|
|
|
void testUseZeroAlloc3() {
|
|
|
|
int *p = new int[0];
|
|
|
|
f(*p); // expected-warning {{Use of zero-allocated memory}}
|
|
|
|
delete[] p;
|
|
|
|
}
|
|
|
|
|
2013-03-25 09:35:45 +08:00
|
|
|
//---------------
|
|
|
|
// other checks
|
|
|
|
//---------------
|
|
|
|
|
2013-04-11 06:21:41 +08:00
|
|
|
class SomeClass {
|
|
|
|
public:
|
|
|
|
void f(int *p);
|
|
|
|
};
|
|
|
|
|
|
|
|
void f(int *p1, int *p2 = 0, int *p3 = 0);
|
|
|
|
void g(SomeClass &c, ...);
|
2013-03-25 09:35:45 +08:00
|
|
|
|
2013-04-11 06:21:41 +08:00
|
|
|
void testUseFirstArgAfterDelete() {
|
2013-03-25 09:35:45 +08:00
|
|
|
int *p = new int;
|
|
|
|
delete p;
|
|
|
|
f(p); // expected-warning{{Use of memory after it is freed}}
|
|
|
|
}
|
|
|
|
|
2013-04-11 06:21:41 +08:00
|
|
|
void testUseMiddleArgAfterDelete(int *p) {
|
|
|
|
delete p;
|
|
|
|
f(0, p); // expected-warning{{Use of memory after it is freed}}
|
|
|
|
}
|
|
|
|
|
|
|
|
void testUseLastArgAfterDelete(int *p) {
|
|
|
|
delete p;
|
|
|
|
f(0, 0, p); // expected-warning{{Use of memory after it is freed}}
|
|
|
|
}
|
|
|
|
|
2013-04-11 06:36:16 +08:00
|
|
|
void testUseSeveralArgsAfterDelete(int *p) {
|
|
|
|
delete p;
|
|
|
|
f(p, p, p); // expected-warning{{Use of memory after it is freed}}
|
|
|
|
}
|
|
|
|
|
2013-04-11 06:21:41 +08:00
|
|
|
void testUseRefArgAfterDelete(SomeClass &c) {
|
|
|
|
delete &c;
|
|
|
|
g(c); // expected-warning{{Use of memory after it is freed}}
|
|
|
|
}
|
|
|
|
|
|
|
|
void testVariadicArgAfterDelete() {
|
|
|
|
SomeClass c;
|
|
|
|
int *p = new int;
|
|
|
|
delete p;
|
|
|
|
g(c, 0, p); // expected-warning{{Use of memory after it is freed}}
|
|
|
|
}
|
|
|
|
|
|
|
|
void testUseMethodArgAfterDelete(int *p) {
|
|
|
|
SomeClass *c = new SomeClass;
|
|
|
|
delete p;
|
|
|
|
c->f(p); // expected-warning{{Use of memory after it is freed}}
|
|
|
|
}
|
|
|
|
|
|
|
|
void testUseThisAfterDelete() {
|
|
|
|
SomeClass *c = new SomeClass;
|
|
|
|
delete c;
|
|
|
|
c->f(0); // expected-warning{{Use of memory after it is freed}}
|
|
|
|
}
|
|
|
|
|
2013-03-25 09:35:45 +08:00
|
|
|
void testDoubleDelete() {
|
|
|
|
int *p = new int;
|
|
|
|
delete p;
|
2018-12-17 20:07:57 +08:00
|
|
|
delete p; // expected-warning{{Attempt to free released memory}}
|
2013-03-25 09:35:45 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void testExprDeleteArg() {
|
|
|
|
int i;
|
2013-03-29 01:05:19 +08:00
|
|
|
delete &i; // expected-warning{{Argument to 'delete' is the address of the local variable 'i', which is not memory allocated by 'new'}}
|
|
|
|
}
|
2013-03-25 09:35:45 +08:00
|
|
|
|
|
|
|
void testExprDeleteArrArg() {
|
|
|
|
int i;
|
2013-03-29 01:05:19 +08:00
|
|
|
delete[] &i; // expected-warning{{Argument to 'delete[]' is the address of the local variable 'i', which is not memory allocated by 'new[]'}}
|
|
|
|
}
|
2013-03-25 09:35:45 +08:00
|
|
|
|
|
|
|
void testAllocDeallocNames() {
|
|
|
|
int *p = new(std::nothrow) int[1];
|
2018-01-25 05:24:10 +08:00
|
|
|
delete[] (++p);
|
|
|
|
#ifndef TEST_INLINABLE_ALLOCATORS
|
|
|
|
// expected-warning@-2{{Argument to 'delete[]' is offset by 4 bytes from the start of memory allocated by 'new[]'}}
|
|
|
|
#endif
|
2013-03-29 01:05:19 +08:00
|
|
|
}
|
2013-03-25 09:35:45 +08:00
|
|
|
|
2013-03-29 07:15:29 +08:00
|
|
|
//--------------------------------
|
|
|
|
// Test escape of newed const pointer. Note, a const pointer can be deleted.
|
|
|
|
//--------------------------------
|
|
|
|
struct StWithConstPtr {
|
|
|
|
const int *memp;
|
|
|
|
};
|
|
|
|
void escape(const int &x);
|
|
|
|
void escapeStruct(const StWithConstPtr &x);
|
|
|
|
void escapePtr(const StWithConstPtr *x);
|
|
|
|
void escapeVoidPtr(const void *x);
|
|
|
|
|
|
|
|
void testConstEscape() {
|
|
|
|
int *p = new int(1);
|
|
|
|
escape(*p);
|
|
|
|
} // no-warning
|
|
|
|
|
|
|
|
void testConstEscapeStruct() {
|
|
|
|
StWithConstPtr *St = new StWithConstPtr();
|
|
|
|
escapeStruct(*St);
|
|
|
|
} // no-warning
|
|
|
|
|
|
|
|
void testConstEscapeStructPtr() {
|
|
|
|
StWithConstPtr *St = new StWithConstPtr();
|
|
|
|
escapePtr(St);
|
|
|
|
} // no-warning
|
|
|
|
|
|
|
|
void testConstEscapeMember() {
|
|
|
|
StWithConstPtr St;
|
|
|
|
St.memp = new int(2);
|
|
|
|
escapeVoidPtr(St.memp);
|
|
|
|
} // no-warning
|
|
|
|
|
|
|
|
void testConstEscapePlacementNew() {
|
|
|
|
int *x = (int *)malloc(sizeof(int));
|
|
|
|
void *y = new (x) int;
|
|
|
|
escapeVoidPtr(y);
|
|
|
|
} // no-warning
|
2013-05-17 10:16:49 +08:00
|
|
|
|
2013-08-09 08:55:47 +08:00
|
|
|
//============== Test Uninitialized delete delete[]========================
|
|
|
|
void testUninitDelete() {
|
|
|
|
int *x;
|
|
|
|
int * y = new int;
|
|
|
|
delete y;
|
|
|
|
delete x; // expected-warning{{Argument to 'delete' is uninitialized}}
|
|
|
|
}
|
|
|
|
|
|
|
|
void testUninitDeleteArray() {
|
|
|
|
int *x;
|
|
|
|
int * y = new int[5];
|
|
|
|
delete[] y;
|
|
|
|
delete[] x; // expected-warning{{Argument to 'delete[]' is uninitialized}}
|
|
|
|
}
|
|
|
|
|
|
|
|
void testUninitFree() {
|
|
|
|
int *x;
|
2017-03-08 23:22:24 +08:00
|
|
|
free(x); // expected-warning{{1st function call argument is an uninitialized value}}
|
2013-08-09 08:55:47 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void testUninitDeleteSink() {
|
|
|
|
int *x;
|
|
|
|
delete x; // expected-warning{{Argument to 'delete' is uninitialized}}
|
|
|
|
(*(volatile int *)0 = 1); // no warn
|
|
|
|
}
|
|
|
|
|
|
|
|
void testUninitDeleteArraySink() {
|
|
|
|
int *x;
|
|
|
|
delete[] x; // expected-warning{{Argument to 'delete[]' is uninitialized}}
|
|
|
|
(*(volatile int *)0 = 1); // no warn
|
|
|
|
}
|
2013-05-17 10:16:49 +08:00
|
|
|
|
|
|
|
namespace reference_count {
|
|
|
|
class control_block {
|
|
|
|
unsigned count;
|
|
|
|
public:
|
|
|
|
control_block() : count(0) {}
|
|
|
|
void retain() { ++count; }
|
|
|
|
int release() { return --count; }
|
|
|
|
};
|
|
|
|
|
|
|
|
template <typename T>
|
|
|
|
class shared_ptr {
|
|
|
|
T *p;
|
|
|
|
control_block *control;
|
|
|
|
|
|
|
|
public:
|
|
|
|
shared_ptr() : p(0), control(0) {}
|
|
|
|
explicit shared_ptr(T *p) : p(p), control(new control_block) {
|
|
|
|
control->retain();
|
|
|
|
}
|
|
|
|
shared_ptr(shared_ptr &other) : p(other.p), control(other.control) {
|
|
|
|
if (control)
|
|
|
|
control->retain();
|
|
|
|
}
|
|
|
|
~shared_ptr() {
|
|
|
|
if (control && control->release() == 0) {
|
|
|
|
delete p;
|
|
|
|
delete control;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
T &operator *() {
|
|
|
|
return *p;
|
|
|
|
};
|
|
|
|
|
|
|
|
void swap(shared_ptr &other) {
|
|
|
|
T *tmp = p;
|
|
|
|
p = other.p;
|
|
|
|
other.p = tmp;
|
|
|
|
|
|
|
|
control_block *ctrlTmp = control;
|
|
|
|
control = other.control;
|
|
|
|
other.control = ctrlTmp;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
void testSingle() {
|
|
|
|
shared_ptr<int> a(new int);
|
|
|
|
*a = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
void testDouble() {
|
|
|
|
shared_ptr<int> a(new int);
|
|
|
|
shared_ptr<int> b = a;
|
|
|
|
*a = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
void testInvalidated() {
|
|
|
|
shared_ptr<int> a(new int);
|
|
|
|
shared_ptr<int> b = a;
|
|
|
|
*a = 1;
|
|
|
|
|
|
|
|
extern void use(shared_ptr<int> &);
|
|
|
|
use(b);
|
|
|
|
}
|
|
|
|
|
|
|
|
void testNestedScope() {
|
|
|
|
shared_ptr<int> a(new int);
|
|
|
|
{
|
|
|
|
shared_ptr<int> b = a;
|
|
|
|
}
|
|
|
|
*a = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
void testSwap() {
|
|
|
|
shared_ptr<int> a(new int);
|
|
|
|
shared_ptr<int> b;
|
|
|
|
shared_ptr<int> c = a;
|
|
|
|
shared_ptr<int>(c).swap(b);
|
|
|
|
}
|
|
|
|
|
|
|
|
void testUseAfterFree() {
|
|
|
|
int *p = new int;
|
|
|
|
{
|
|
|
|
shared_ptr<int> a(p);
|
|
|
|
shared_ptr<int> b = a;
|
|
|
|
}
|
|
|
|
|
|
|
|
// FIXME: We should get a warning here, but we don't because we've
|
|
|
|
// conservatively modeled ~shared_ptr.
|
|
|
|
*p = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-09-26 00:06:17 +08:00
|
|
|
// Test double delete
|
|
|
|
class DerefClass{
|
|
|
|
public:
|
|
|
|
int *x;
|
|
|
|
DerefClass() {}
|
2014-01-09 02:46:55 +08:00
|
|
|
~DerefClass() {*x = 1;}
|
2013-09-26 00:06:17 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
void testDoubleDeleteClassInstance() {
|
|
|
|
DerefClass *foo = new DerefClass();
|
|
|
|
delete foo;
|
2014-01-09 02:46:55 +08:00
|
|
|
delete foo; // expected-warning {{Attempt to delete released memory}}
|
2013-09-26 00:06:17 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
class EmptyClass{
|
|
|
|
public:
|
|
|
|
EmptyClass() {}
|
|
|
|
~EmptyClass() {}
|
|
|
|
};
|
|
|
|
|
|
|
|
void testDoubleDeleteEmptyClass() {
|
|
|
|
EmptyClass *foo = new EmptyClass();
|
|
|
|
delete foo;
|
2014-01-09 02:46:55 +08:00
|
|
|
delete foo; // expected-warning {{Attempt to delete released memory}}
|
2013-09-26 00:06:17 +08:00
|
|
|
}
|
2016-08-08 17:22:59 +08:00
|
|
|
|
|
|
|
struct Base {
|
|
|
|
virtual ~Base() {}
|
|
|
|
};
|
|
|
|
|
|
|
|
struct Derived : Base {
|
|
|
|
};
|
|
|
|
|
|
|
|
Base *allocate() {
|
|
|
|
return new Derived;
|
|
|
|
}
|
|
|
|
|
|
|
|
void shouldNotReportLeak() {
|
|
|
|
Derived *p = (Derived *)allocate();
|
|
|
|
delete p;
|
|
|
|
}
|