2012-08-25 04:39:55 +08:00
|
|
|
|
// RUN: %clang_cc1 -analyze -analyzer-checker=core,alpha.deadcode.UnreachableCode,alpha.core.CastSize,unix.Malloc,debug.ExprInspection -analyzer-store=region -verify %s
|
2012-11-19 18:00:59 +08:00
|
|
|
|
|
2012-09-12 09:11:10 +08:00
|
|
|
|
#include "Inputs/system-header-simulator.h"
|
2012-02-12 07:46:36 +08:00
|
|
|
|
|
2012-06-08 08:04:40 +08:00
|
|
|
|
void clang_analyzer_eval(int);
|
|
|
|
|
|
2009-11-14 12:23:25 +08:00
|
|
|
|
typedef __typeof(sizeof(int)) size_t;
|
2009-11-14 04:03:22 +08:00
|
|
|
|
void *malloc(size_t);
|
2012-02-15 08:11:22 +08:00
|
|
|
|
void *valloc(size_t);
|
2009-11-14 04:03:22 +08:00
|
|
|
|
void free(void *);
|
2009-12-12 20:29:38 +08:00
|
|
|
|
void *realloc(void *ptr, size_t size);
|
2012-02-15 08:11:25 +08:00
|
|
|
|
void *reallocf(void *ptr, size_t size);
|
2009-12-12 20:29:38 +08:00
|
|
|
|
void *calloc(size_t nmemb, size_t size);
|
2012-05-18 09:16:10 +08:00
|
|
|
|
char *strdup(const char *s);
|
|
|
|
|
char *strndup(const char *s, size_t n);
|
2012-02-09 07:16:56 +08:00
|
|
|
|
|
|
|
|
|
void myfoo(int *p);
|
|
|
|
|
void myfooint(int p);
|
2012-02-15 08:11:28 +08:00
|
|
|
|
char *fooRetPtr();
|
2009-11-13 15:48:11 +08:00
|
|
|
|
|
|
|
|
|
void f1() {
|
2010-05-25 12:59:19 +08:00
|
|
|
|
int *p = malloc(12);
|
2012-08-09 02:23:36 +08:00
|
|
|
|
return; // expected-warning{{Memory is never released; potential leak of memory pointed to by 'p'}}
|
2009-11-13 15:48:11 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void f2() {
|
2010-05-25 12:59:19 +08:00
|
|
|
|
int *p = malloc(12);
|
2009-11-13 15:48:11 +08:00
|
|
|
|
free(p);
|
2012-02-17 06:26:12 +08:00
|
|
|
|
free(p); // expected-warning{{Attempt to free released memory}}
|
2009-11-13 15:48:11 +08:00
|
|
|
|
}
|
2009-11-14 04:00:28 +08:00
|
|
|
|
|
2011-04-27 22:49:29 +08:00
|
|
|
|
void f2_realloc_0() {
|
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
realloc(p,0);
|
2012-02-17 06:26:12 +08:00
|
|
|
|
realloc(p,0); // expected-warning{{Attempt to free released memory}}
|
2011-04-27 22:49:29 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void f2_realloc_1() {
|
|
|
|
|
int *p = malloc(12);
|
2011-09-01 12:53:59 +08:00
|
|
|
|
int *q = realloc(p,0); // no-warning
|
2011-04-27 22:49:29 +08:00
|
|
|
|
}
|
|
|
|
|
|
2012-02-14 02:05:39 +08:00
|
|
|
|
void reallocNotNullPtr(unsigned sizeIn) {
|
|
|
|
|
unsigned size = 12;
|
|
|
|
|
char *p = (char*)malloc(size);
|
|
|
|
|
if (p) {
|
|
|
|
|
char *q = (char*)realloc(p, sizeIn);
|
2012-08-09 02:23:36 +08:00
|
|
|
|
char x = *q; // expected-warning {{Memory is never released; potential leak of memory pointed to by 'q'}}
|
2012-02-14 02:05:39 +08:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int *realloctest1() {
|
|
|
|
|
int *q = malloc(12);
|
|
|
|
|
q = realloc(q, 20);
|
|
|
|
|
return q; // no warning - returning the allocated value
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// p should be freed if realloc fails.
|
|
|
|
|
void reallocFails() {
|
|
|
|
|
char *p = malloc(12);
|
|
|
|
|
char *r = realloc(p, 12+1);
|
|
|
|
|
if (!r) {
|
|
|
|
|
free(p);
|
|
|
|
|
} else {
|
|
|
|
|
free(r);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2012-02-14 04:57:07 +08:00
|
|
|
|
void reallocSizeZero1() {
|
|
|
|
|
char *p = malloc(12);
|
|
|
|
|
char *r = realloc(p, 0);
|
|
|
|
|
if (!r) {
|
2012-08-04 02:30:18 +08:00
|
|
|
|
free(p); // expected-warning {{Attempt to free released memory}}
|
2012-02-14 04:57:07 +08:00
|
|
|
|
} else {
|
|
|
|
|
free(r);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void reallocSizeZero2() {
|
|
|
|
|
char *p = malloc(12);
|
|
|
|
|
char *r = realloc(p, 0);
|
|
|
|
|
if (!r) {
|
2012-08-04 02:30:18 +08:00
|
|
|
|
free(p); // expected-warning {{Attempt to free released memory}}
|
2012-02-14 04:57:07 +08:00
|
|
|
|
} else {
|
|
|
|
|
free(r);
|
|
|
|
|
}
|
2012-02-17 06:26:12 +08:00
|
|
|
|
free(p); // expected-warning {{Attempt to free released memory}}
|
2012-02-14 04:57:07 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void reallocSizeZero3() {
|
|
|
|
|
char *p = malloc(12);
|
|
|
|
|
char *r = realloc(p, 0);
|
|
|
|
|
free(r);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void reallocSizeZero4() {
|
|
|
|
|
char *r = realloc(0, 0);
|
|
|
|
|
free(r);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void reallocSizeZero5() {
|
|
|
|
|
char *r = realloc(0, 0);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void reallocPtrZero1() {
|
2012-11-16 03:11:43 +08:00
|
|
|
|
char *r = realloc(0, 12);
|
|
|
|
|
} // expected-warning {{Memory is never released; potential leak of memory pointed to by 'r'}}
|
2012-02-14 04:57:07 +08:00
|
|
|
|
|
|
|
|
|
void reallocPtrZero2() {
|
|
|
|
|
char *r = realloc(0, 12);
|
|
|
|
|
if (r)
|
|
|
|
|
free(r);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void reallocPtrZero3() {
|
|
|
|
|
char *r = realloc(0, 12);
|
|
|
|
|
free(r);
|
|
|
|
|
}
|
|
|
|
|
|
2012-02-14 08:26:13 +08:00
|
|
|
|
void reallocRadar6337483_1() {
|
|
|
|
|
char *buf = malloc(100);
|
|
|
|
|
buf = (char*)realloc(buf, 0x1000000);
|
|
|
|
|
if (!buf) {
|
2012-03-22 03:45:08 +08:00
|
|
|
|
return;// expected-warning {{Memory is never released; potential leak}}
|
2012-02-14 08:26:13 +08:00
|
|
|
|
}
|
|
|
|
|
free(buf);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void reallocRadar6337483_2() {
|
|
|
|
|
char *buf = malloc(100);
|
|
|
|
|
char *buf2 = (char*)realloc(buf, 0x1000000);
|
2012-11-16 03:11:43 +08:00
|
|
|
|
if (!buf2) {
|
2012-02-14 08:26:13 +08:00
|
|
|
|
;
|
|
|
|
|
} else {
|
|
|
|
|
free(buf2);
|
|
|
|
|
}
|
2012-11-16 03:11:43 +08:00
|
|
|
|
} // expected-warning {{Memory is never released; potential leak}}
|
2012-02-14 08:26:13 +08:00
|
|
|
|
|
|
|
|
|
void reallocRadar6337483_3() {
|
|
|
|
|
char * buf = malloc(100);
|
|
|
|
|
char * tmp;
|
|
|
|
|
tmp = (char*)realloc(buf, 0x1000000);
|
|
|
|
|
if (!tmp) {
|
|
|
|
|
free(buf);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
buf = tmp;
|
|
|
|
|
free(buf);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void reallocRadar6337483_4() {
|
|
|
|
|
char *buf = malloc(100);
|
|
|
|
|
char *buf2 = (char*)realloc(buf, 0x1000000);
|
|
|
|
|
if (!buf2) {
|
2012-03-22 03:45:08 +08:00
|
|
|
|
return; // expected-warning {{Memory is never released; potential leak}}
|
2012-02-14 08:26:13 +08:00
|
|
|
|
} else {
|
|
|
|
|
free(buf2);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2012-02-15 08:11:25 +08:00
|
|
|
|
int *reallocfTest1() {
|
|
|
|
|
int *q = malloc(12);
|
|
|
|
|
q = reallocf(q, 20);
|
|
|
|
|
return q; // no warning - returning the allocated value
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void reallocfRadar6337483_4() {
|
|
|
|
|
char *buf = malloc(100);
|
|
|
|
|
char *buf2 = (char*)reallocf(buf, 0x1000000);
|
|
|
|
|
if (!buf2) {
|
|
|
|
|
return; // no warning - reallocf frees even on failure
|
|
|
|
|
} else {
|
|
|
|
|
free(buf2);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void reallocfRadar6337483_3() {
|
|
|
|
|
char * buf = malloc(100);
|
|
|
|
|
char * tmp;
|
|
|
|
|
tmp = (char*)reallocf(buf, 0x1000000);
|
|
|
|
|
if (!tmp) {
|
2012-02-17 06:26:12 +08:00
|
|
|
|
free(buf); // expected-warning {{Attempt to free released memory}}
|
2012-02-15 08:11:25 +08:00
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
buf = tmp;
|
|
|
|
|
free(buf);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void reallocfPtrZero1() {
|
2012-11-16 03:11:43 +08:00
|
|
|
|
char *r = reallocf(0, 12);
|
|
|
|
|
} // expected-warning {{Memory is never released; potential leak}}
|
2012-02-15 08:11:25 +08:00
|
|
|
|
|
|
|
|
|
|
2009-11-17 15:54:15 +08:00
|
|
|
|
// This case tests that storing malloc'ed memory to a static variable which is
|
|
|
|
|
// then returned is not leaked. In the absence of known contracts for functions
|
|
|
|
|
// or inter-procedural analysis, this is a conservative answer.
|
2009-11-14 04:00:28 +08:00
|
|
|
|
int *f3() {
|
|
|
|
|
static int *p = 0;
|
2010-05-25 12:59:19 +08:00
|
|
|
|
p = malloc(12);
|
2009-11-17 16:58:18 +08:00
|
|
|
|
return p; // no-warning
|
2009-11-14 04:00:28 +08:00
|
|
|
|
}
|
|
|
|
|
|
2009-11-17 15:54:15 +08:00
|
|
|
|
// This case tests that storing malloc'ed memory to a static global variable
|
|
|
|
|
// which is then returned is not leaked. In the absence of known contracts for
|
|
|
|
|
// functions or inter-procedural analysis, this is a conservative answer.
|
2009-11-14 04:00:28 +08:00
|
|
|
|
static int *p_f4 = 0;
|
|
|
|
|
int *f4() {
|
2010-05-25 12:59:19 +08:00
|
|
|
|
p_f4 = malloc(12);
|
2009-11-17 16:58:18 +08:00
|
|
|
|
return p_f4; // no-warning
|
2009-11-14 04:00:28 +08:00
|
|
|
|
}
|
2009-12-12 20:29:38 +08:00
|
|
|
|
|
|
|
|
|
int *f5() {
|
2010-05-25 12:59:19 +08:00
|
|
|
|
int *q = malloc(12);
|
2009-12-12 20:29:38 +08:00
|
|
|
|
q = realloc(q, 20);
|
|
|
|
|
return q; // no-warning
|
|
|
|
|
}
|
2009-12-31 14:13:07 +08:00
|
|
|
|
|
|
|
|
|
void f6() {
|
2010-05-25 12:59:19 +08:00
|
|
|
|
int *p = malloc(12);
|
2009-12-31 14:13:07 +08:00
|
|
|
|
if (!p)
|
|
|
|
|
return; // no-warning
|
|
|
|
|
else
|
|
|
|
|
free(p);
|
|
|
|
|
}
|
2010-01-18 12:01:40 +08:00
|
|
|
|
|
2011-04-27 22:49:29 +08:00
|
|
|
|
void f6_realloc() {
|
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
if (!p)
|
|
|
|
|
return; // no-warning
|
|
|
|
|
else
|
|
|
|
|
realloc(p,0);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2010-01-18 12:01:40 +08:00
|
|
|
|
char *doit2();
|
|
|
|
|
void pr6069() {
|
|
|
|
|
char *buf = doit2();
|
|
|
|
|
free(buf);
|
|
|
|
|
}
|
2010-02-14 14:49:48 +08:00
|
|
|
|
|
|
|
|
|
void pr6293() {
|
|
|
|
|
free(0);
|
|
|
|
|
}
|
2010-03-10 12:58:55 +08:00
|
|
|
|
|
|
|
|
|
void f7() {
|
|
|
|
|
char *x = (char*) malloc(4);
|
|
|
|
|
free(x);
|
2012-02-17 06:26:12 +08:00
|
|
|
|
x[0] = 'a'; // expected-warning{{Use of memory after it is freed}}
|
2010-03-10 12:58:55 +08:00
|
|
|
|
}
|
2010-05-25 12:59:19 +08:00
|
|
|
|
|
2012-05-18 09:16:10 +08:00
|
|
|
|
void f8() {
|
|
|
|
|
char *x = (char*) malloc(4);
|
|
|
|
|
free(x);
|
|
|
|
|
char *y = strndup(x, 4); // expected-warning{{Use of memory after it is freed}}
|
|
|
|
|
}
|
|
|
|
|
|
2011-04-27 22:49:29 +08:00
|
|
|
|
void f7_realloc() {
|
|
|
|
|
char *x = (char*) malloc(4);
|
|
|
|
|
realloc(x,0);
|
2012-02-17 06:26:12 +08:00
|
|
|
|
x[0] = 'a'; // expected-warning{{Use of memory after it is freed}}
|
2011-04-27 22:49:29 +08:00
|
|
|
|
}
|
|
|
|
|
|
2010-05-25 12:59:19 +08:00
|
|
|
|
void PR6123() {
|
Allow multiple PathDiagnosticConsumers to be used with a BugReporter at the same time.
This fixes several issues:
- removes egregious hack where PlistDiagnosticConsumer would forward to HTMLDiagnosticConsumer,
but diagnostics wouldn't be generated consistently in the same way if PlistDiagnosticConsumer
was used by itself.
- emitting diagnostics to the terminal (using clang's diagnostic machinery) is no longer a special
case, just another PathDiagnosticConsumer. This also magically resolved some duplicate warnings,
as we now use PathDiagnosticConsumer's diagnostic pruning, which has scope for the entire translation
unit, not just the scope of a BugReporter (which is limited to a particular ExprEngine).
As an interesting side-effect, diagnostics emitted to the terminal also have their trailing "." stripped,
just like with diagnostics emitted to plists and HTML. This required some tests to be updated, but now
the tests have higher fidelity with what users will see.
There are some inefficiencies in this patch. We currently generate the report graph (from the ExplodedGraph)
once per PathDiagnosticConsumer, which is a bit wasteful, but that could be pulled up higher in the
logic stack. There is some intended duplication, however, as we now generate different PathDiagnostics (for the same issue)
for different PathDiagnosticConsumers. This is necessary to produce the diagnostics that a particular
consumer expects.
llvm-svn: 162028
2012-08-17 01:45:23 +08:00
|
|
|
|
int *x = malloc(11); // expected-warning{{Cast a region whose size is not a multiple of the destination type size}}
|
2010-05-25 12:59:19 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void PR7217() {
|
Allow multiple PathDiagnosticConsumers to be used with a BugReporter at the same time.
This fixes several issues:
- removes egregious hack where PlistDiagnosticConsumer would forward to HTMLDiagnosticConsumer,
but diagnostics wouldn't be generated consistently in the same way if PlistDiagnosticConsumer
was used by itself.
- emitting diagnostics to the terminal (using clang's diagnostic machinery) is no longer a special
case, just another PathDiagnosticConsumer. This also magically resolved some duplicate warnings,
as we now use PathDiagnosticConsumer's diagnostic pruning, which has scope for the entire translation
unit, not just the scope of a BugReporter (which is limited to a particular ExprEngine).
As an interesting side-effect, diagnostics emitted to the terminal also have their trailing "." stripped,
just like with diagnostics emitted to plists and HTML. This required some tests to be updated, but now
the tests have higher fidelity with what users will see.
There are some inefficiencies in this patch. We currently generate the report graph (from the ExplodedGraph)
once per PathDiagnosticConsumer, which is a bit wasteful, but that could be pulled up higher in the
logic stack. There is some intended duplication, however, as we now generate different PathDiagnostics (for the same issue)
for different PathDiagnosticConsumers. This is necessary to produce the diagnostics that a particular
consumer expects.
llvm-svn: 162028
2012-08-17 01:45:23 +08:00
|
|
|
|
int *buf = malloc(2); // expected-warning{{Cast a region whose size is not a multiple of the destination type size}}
|
2010-05-25 12:59:19 +08:00
|
|
|
|
buf[1] = 'c'; // not crash
|
2010-06-20 12:30:57 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void mallocCastToVoid() {
|
|
|
|
|
void *p = malloc(2);
|
|
|
|
|
const void *cp = p; // not crash
|
|
|
|
|
free(p);
|
|
|
|
|
}
|
2010-05-25 12:59:19 +08:00
|
|
|
|
|
2010-06-20 12:30:57 +08:00
|
|
|
|
void mallocCastToFP() {
|
|
|
|
|
void *p = malloc(2);
|
|
|
|
|
void (*fp)() = p; // not crash
|
|
|
|
|
free(p);
|
2010-05-25 12:59:19 +08:00
|
|
|
|
}
|
2010-06-20 12:30:57 +08:00
|
|
|
|
|
2010-06-01 11:01:33 +08:00
|
|
|
|
// This tests that malloc() buffers are undefined by default
|
|
|
|
|
char mallocGarbage () {
|
|
|
|
|
char *buf = malloc(2);
|
|
|
|
|
char result = buf[1]; // expected-warning{{undefined}}
|
|
|
|
|
free(buf);
|
|
|
|
|
return result;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// This tests that calloc() buffers need to be freed
|
|
|
|
|
void callocNoFree () {
|
|
|
|
|
char *buf = calloc(2,2);
|
|
|
|
|
return; // expected-warning{{never released}}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// These test that calloc() buffers are zeroed by default
|
|
|
|
|
char callocZeroesGood () {
|
|
|
|
|
char *buf = calloc(2,2);
|
|
|
|
|
char result = buf[3]; // no-warning
|
|
|
|
|
if (buf[1] == 0) {
|
|
|
|
|
free(buf);
|
|
|
|
|
}
|
|
|
|
|
return result; // no-warning
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
char callocZeroesBad () {
|
|
|
|
|
char *buf = calloc(2,2);
|
|
|
|
|
char result = buf[3]; // no-warning
|
|
|
|
|
if (buf[1] != 0) {
|
2010-07-24 07:04:53 +08:00
|
|
|
|
free(buf); // expected-warning{{never executed}}
|
2010-06-01 11:01:33 +08:00
|
|
|
|
}
|
|
|
|
|
return result; // expected-warning{{never released}}
|
|
|
|
|
}
|
2012-02-09 07:16:56 +08:00
|
|
|
|
|
|
|
|
|
void nullFree() {
|
|
|
|
|
int *p = 0;
|
|
|
|
|
free(p); // no warning - a nop
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void paramFree(int *p) {
|
|
|
|
|
myfoo(p);
|
|
|
|
|
free(p); // no warning
|
2012-08-04 02:30:18 +08:00
|
|
|
|
myfoo(p); // expected-warning {{Use of memory after it is freed}}
|
2012-02-09 07:16:56 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int* mallocEscapeRet() {
|
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
return p; // no warning
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void mallocEscapeFoo() {
|
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
myfoo(p);
|
|
|
|
|
return; // no warning
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void mallocEscapeFree() {
|
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
myfoo(p);
|
|
|
|
|
free(p);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void mallocEscapeFreeFree() {
|
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
myfoo(p);
|
|
|
|
|
free(p);
|
2012-02-17 06:26:12 +08:00
|
|
|
|
free(p); // expected-warning{{Attempt to free released memory}}
|
2012-02-09 07:16:56 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void mallocEscapeFreeUse() {
|
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
myfoo(p);
|
|
|
|
|
free(p);
|
2012-02-17 06:26:12 +08:00
|
|
|
|
myfoo(p); // expected-warning{{Use of memory after it is freed}}
|
2012-02-09 07:16:56 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int *myalloc();
|
|
|
|
|
void myalloc2(int **p);
|
|
|
|
|
|
|
|
|
|
void mallocEscapeFreeCustomAlloc() {
|
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
myfoo(p);
|
|
|
|
|
free(p);
|
|
|
|
|
p = myalloc();
|
|
|
|
|
free(p); // no warning
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void mallocEscapeFreeCustomAlloc2() {
|
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
myfoo(p);
|
|
|
|
|
free(p);
|
|
|
|
|
myalloc2(&p);
|
|
|
|
|
free(p); // no warning
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void mallocBindFreeUse() {
|
|
|
|
|
int *x = malloc(12);
|
|
|
|
|
int *y = x;
|
|
|
|
|
free(y);
|
2012-02-17 06:26:12 +08:00
|
|
|
|
myfoo(x); // expected-warning{{Use of memory after it is freed}}
|
2012-02-09 07:16:56 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void mallocEscapeMalloc() {
|
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
myfoo(p);
|
2012-11-16 03:11:43 +08:00
|
|
|
|
p = malloc(12);
|
|
|
|
|
} // expected-warning{{Memory is never released; potential leak}}
|
2012-02-09 07:16:56 +08:00
|
|
|
|
|
|
|
|
|
void mallocMalloc() {
|
|
|
|
|
int *p = malloc(12);
|
2012-11-16 03:11:43 +08:00
|
|
|
|
p = malloc(12);
|
|
|
|
|
} // expected-warning {{Memory is never released; potential leak}}
|
2012-02-09 07:16:56 +08:00
|
|
|
|
|
|
|
|
|
void mallocFreeMalloc() {
|
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
free(p);
|
|
|
|
|
p = malloc(12);
|
|
|
|
|
free(p);
|
|
|
|
|
}
|
|
|
|
|
|
2012-02-09 14:25:47 +08:00
|
|
|
|
void mallocFreeUse_params() {
|
2012-02-09 07:16:56 +08:00
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
free(p);
|
2012-02-17 06:26:12 +08:00
|
|
|
|
myfoo(p); //expected-warning{{Use of memory after it is freed}}
|
2012-02-12 07:46:36 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void mallocFreeUse_params2() {
|
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
free(p);
|
2012-02-17 06:26:12 +08:00
|
|
|
|
myfooint(*p); //expected-warning{{Use of memory after it is freed}}
|
2012-02-09 07:16:56 +08:00
|
|
|
|
}
|
|
|
|
|
|
2012-02-09 14:25:51 +08:00
|
|
|
|
void mallocFailedOrNot() {
|
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
if (!p)
|
|
|
|
|
free(p);
|
|
|
|
|
else
|
|
|
|
|
free(p);
|
|
|
|
|
}
|
|
|
|
|
|
2012-02-10 09:11:00 +08:00
|
|
|
|
struct StructWithInt {
|
|
|
|
|
int g;
|
|
|
|
|
};
|
2012-02-12 05:44:39 +08:00
|
|
|
|
|
|
|
|
|
int *mallocReturnFreed() {
|
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
free(p);
|
2012-02-17 06:26:12 +08:00
|
|
|
|
return p; // expected-warning {{Use of memory after it is freed}}
|
2012-02-12 05:44:39 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int useAfterFreeStruct() {
|
|
|
|
|
struct StructWithInt *px= malloc(sizeof(struct StructWithInt));
|
|
|
|
|
px->g = 5;
|
|
|
|
|
free(px);
|
2012-02-17 06:26:12 +08:00
|
|
|
|
return px->g; // expected-warning {{Use of memory after it is freed}}
|
2012-02-12 05:44:39 +08:00
|
|
|
|
}
|
|
|
|
|
|
2012-02-10 09:11:00 +08:00
|
|
|
|
void nonSymbolAsFirstArg(int *pp, struct StructWithInt *p);
|
|
|
|
|
|
|
|
|
|
void mallocEscapeFooNonSymbolArg() {
|
|
|
|
|
struct StructWithInt *p = malloc(sizeof(struct StructWithInt));
|
|
|
|
|
nonSymbolAsFirstArg(&p->g, p);
|
|
|
|
|
return; // no warning
|
|
|
|
|
}
|
|
|
|
|
|
2012-02-12 05:02:35 +08:00
|
|
|
|
void mallocFailedOrNotLeak() {
|
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
if (p == 0)
|
|
|
|
|
return; // no warning
|
|
|
|
|
else
|
2012-03-22 03:45:08 +08:00
|
|
|
|
return; // expected-warning {{Memory is never released; potential leak}}
|
2012-02-12 05:02:35 +08:00
|
|
|
|
}
|
2012-02-10 09:11:00 +08:00
|
|
|
|
|
2012-02-15 08:11:28 +08:00
|
|
|
|
void mallocAssignment() {
|
|
|
|
|
char *p = malloc(12);
|
2012-11-16 03:11:43 +08:00
|
|
|
|
p = fooRetPtr();
|
|
|
|
|
} // expected-warning {{leak}}
|
2012-02-15 08:11:28 +08:00
|
|
|
|
|
2012-02-15 08:11:22 +08:00
|
|
|
|
int vallocTest() {
|
|
|
|
|
char *mem = valloc(12);
|
2012-03-22 03:45:08 +08:00
|
|
|
|
return 0; // expected-warning {{Memory is never released; potential leak}}
|
2012-02-15 08:11:22 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void vallocEscapeFreeUse() {
|
|
|
|
|
int *p = valloc(12);
|
|
|
|
|
myfoo(p);
|
|
|
|
|
free(p);
|
2012-02-17 06:26:12 +08:00
|
|
|
|
myfoo(p); // expected-warning{{Use of memory after it is freed}}
|
2012-02-15 08:11:22 +08:00
|
|
|
|
}
|
|
|
|
|
|
2012-02-09 14:25:47 +08:00
|
|
|
|
int *Gl;
|
|
|
|
|
struct GlStTy {
|
|
|
|
|
int *x;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
struct GlStTy GlS = {0};
|
|
|
|
|
|
|
|
|
|
void GlobalFree() {
|
|
|
|
|
free(Gl);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void GlobalMalloc() {
|
|
|
|
|
Gl = malloc(12);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void GlobalStructMalloc() {
|
|
|
|
|
int *a = malloc(12);
|
|
|
|
|
GlS.x = a;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void GlobalStructMallocFree() {
|
|
|
|
|
int *a = malloc(12);
|
|
|
|
|
GlS.x = a;
|
|
|
|
|
free(GlS.x);
|
|
|
|
|
}
|
2012-02-10 09:11:03 +08:00
|
|
|
|
|
2012-02-17 06:26:15 +08:00
|
|
|
|
char *ArrayG[12];
|
|
|
|
|
|
|
|
|
|
void globalArrayTest() {
|
|
|
|
|
char *p = (char*)malloc(12);
|
|
|
|
|
ArrayG[0] = p;
|
|
|
|
|
}
|
|
|
|
|
|
2012-02-16 11:40:57 +08:00
|
|
|
|
// Make sure that we properly handle a pointer stored into a local struct/array.
|
|
|
|
|
typedef struct _StructWithPtr {
|
|
|
|
|
int *memP;
|
|
|
|
|
} StructWithPtr;
|
|
|
|
|
|
|
|
|
|
static StructWithPtr arrOfStructs[10];
|
|
|
|
|
|
|
|
|
|
void testMalloc() {
|
|
|
|
|
int *x = malloc(12);
|
|
|
|
|
StructWithPtr St;
|
|
|
|
|
St.memP = x;
|
2012-08-09 02:23:31 +08:00
|
|
|
|
arrOfStructs[0] = St; // no-warning
|
2012-02-16 11:40:57 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
StructWithPtr testMalloc2() {
|
|
|
|
|
int *x = malloc(12);
|
|
|
|
|
StructWithPtr St;
|
|
|
|
|
St.memP = x;
|
2012-08-09 02:23:31 +08:00
|
|
|
|
return St; // no-warning
|
2012-02-16 11:40:57 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int *testMalloc3() {
|
|
|
|
|
int *x = malloc(12);
|
|
|
|
|
int *y = x;
|
2012-08-09 02:23:31 +08:00
|
|
|
|
return y; // no-warning
|
2012-02-16 11:40:57 +08:00
|
|
|
|
}
|
|
|
|
|
|
2012-02-18 06:35:34 +08:00
|
|
|
|
void testElemRegion1() {
|
|
|
|
|
char *x = (void*)malloc(2);
|
|
|
|
|
int *ix = (int*)x;
|
|
|
|
|
free(&(x[0]));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void testElemRegion2(int **pp) {
|
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
*pp = p;
|
|
|
|
|
free(pp[0]);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void testElemRegion3(int **pp) {
|
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
*pp = p;
|
|
|
|
|
free(*pp);
|
|
|
|
|
}
|
2012-02-12 05:02:35 +08:00
|
|
|
|
// Region escape testing.
|
|
|
|
|
|
|
|
|
|
unsigned takePtrToPtr(int **p);
|
|
|
|
|
void PassTheAddrOfAllocatedData(int f) {
|
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
// We don't know what happens after the call. Should stop tracking here.
|
|
|
|
|
if (takePtrToPtr(&p))
|
|
|
|
|
f++;
|
|
|
|
|
free(p); // no warning
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
struct X {
|
|
|
|
|
int *p;
|
|
|
|
|
};
|
|
|
|
|
unsigned takePtrToStruct(struct X *s);
|
|
|
|
|
int ** foo2(int *g, int f) {
|
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
struct X *px= malloc(sizeof(struct X));
|
|
|
|
|
px->p = p;
|
|
|
|
|
// We don't know what happens after this call. Should not track px nor p.
|
|
|
|
|
if (takePtrToStruct(px))
|
|
|
|
|
f++;
|
|
|
|
|
free(p);
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
struct X* RegInvalidationDetect1(struct X *s2) {
|
|
|
|
|
struct X *px= malloc(sizeof(struct X));
|
|
|
|
|
px->p = 0;
|
|
|
|
|
px = s2;
|
2012-03-22 03:45:08 +08:00
|
|
|
|
return px; // expected-warning {{Memory is never released; potential leak}}
|
2012-02-12 05:02:35 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
struct X* RegInvalidationGiveUp1() {
|
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
struct X *px= malloc(sizeof(struct X));
|
|
|
|
|
px->p = p;
|
|
|
|
|
return px;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int **RegInvalidationDetect2(int **pp) {
|
|
|
|
|
int *p = malloc(12);
|
|
|
|
|
pp = &p;
|
|
|
|
|
pp++;
|
2012-03-22 03:45:08 +08:00
|
|
|
|
return 0;// expected-warning {{Memory is never released; potential leak}}
|
2012-02-12 05:02:35 +08:00
|
|
|
|
}
|
2012-02-10 09:11:03 +08:00
|
|
|
|
|
|
|
|
|
extern void exit(int) __attribute__ ((__noreturn__));
|
|
|
|
|
void mallocExit(int *g) {
|
|
|
|
|
struct xx *p = malloc(12);
|
2012-02-12 05:02:40 +08:00
|
|
|
|
if (g != 0)
|
|
|
|
|
exit(1);
|
2012-02-10 09:11:03 +08:00
|
|
|
|
free(p);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
extern void __assert_fail (__const char *__assertion, __const char *__file,
|
|
|
|
|
unsigned int __line, __const char *__function)
|
|
|
|
|
__attribute__ ((__noreturn__));
|
|
|
|
|
#define assert(expr) \
|
|
|
|
|
((expr) ? (void)(0) : __assert_fail (#expr, __FILE__, __LINE__, __func__))
|
|
|
|
|
void mallocAssert(int *g) {
|
|
|
|
|
struct xx *p = malloc(12);
|
|
|
|
|
|
2012-02-12 05:02:40 +08:00
|
|
|
|
assert(g != 0);
|
2012-02-10 09:11:03 +08:00
|
|
|
|
free(p);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
2012-02-12 07:46:36 +08:00
|
|
|
|
void doNotInvalidateWhenPassedToSystemCalls(char *s) {
|
|
|
|
|
char *p = malloc(12);
|
|
|
|
|
strlen(p);
|
2012-11-16 03:11:43 +08:00
|
|
|
|
strcpy(p, s);
|
|
|
|
|
} // expected-warning {{leak}}
|
2012-02-12 07:46:36 +08:00
|
|
|
|
|
2012-02-18 06:35:31 +08:00
|
|
|
|
// Rely on the CString checker evaluation of the strcpy API to convey that the result of strcpy is equal to p.
|
|
|
|
|
void symbolLostWithStrcpy(char *s) {
|
|
|
|
|
char *p = malloc(12);
|
|
|
|
|
p = strcpy(p, s);
|
|
|
|
|
free(p);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
// The same test as the one above, but with what is actually generated on a mac.
|
|
|
|
|
static __inline char *
|
|
|
|
|
__inline_strcpy_chk (char *restrict __dest, const char *restrict __src)
|
|
|
|
|
{
|
|
|
|
|
return __builtin___strcpy_chk (__dest, __src, __builtin_object_size (__dest, 2 > 1));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void symbolLostWithStrcpy_InlineStrcpyVersion(char *s) {
|
|
|
|
|
char *p = malloc(12);
|
|
|
|
|
p = ((__builtin_object_size (p, 0) != (size_t) -1) ? __builtin___strcpy_chk (p, s, __builtin_object_size (p, 2 > 1)) : __inline_strcpy_chk (p, s));
|
|
|
|
|
free(p);
|
|
|
|
|
}
|
2012-02-22 10:36:01 +08:00
|
|
|
|
|
|
|
|
|
// Here we are returning a pointer one past the allocated value. An idiom which
|
|
|
|
|
// can be used for implementing special malloc. The correct uses of this might
|
|
|
|
|
// be rare enough so that we could keep this as a warning.
|
|
|
|
|
static void *specialMalloc(int n){
|
|
|
|
|
int *p;
|
|
|
|
|
p = malloc( n+8 );
|
|
|
|
|
if( p ){
|
|
|
|
|
p[0] = n;
|
|
|
|
|
p++;
|
|
|
|
|
}
|
|
|
|
|
return p;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Potentially, the user could free the struct by performing pointer arithmetic on the return value.
|
|
|
|
|
// This is a variation of the specialMalloc issue, though probably would be more rare in correct code.
|
|
|
|
|
int *specialMallocWithStruct() {
|
|
|
|
|
struct StructWithInt *px= malloc(sizeof(struct StructWithInt));
|
|
|
|
|
return &(px->g);
|
|
|
|
|
}
|
|
|
|
|
|
2012-02-22 11:14:20 +08:00
|
|
|
|
// Test various allocation/deallocation functions.
|
|
|
|
|
void testStrdup(const char *s, unsigned validIndex) {
|
|
|
|
|
char *s2 = strdup(s);
|
2012-11-16 03:11:43 +08:00
|
|
|
|
s2[validIndex + 1] = 'b';
|
|
|
|
|
} // expected-warning {{Memory is never released; potential leak}}
|
2012-02-22 11:14:20 +08:00
|
|
|
|
|
|
|
|
|
int testStrndup(const char *s, unsigned validIndex, unsigned size) {
|
|
|
|
|
char *s2 = strndup(s, size);
|
|
|
|
|
s2 [validIndex + 1] = 'b';
|
|
|
|
|
if (s2[validIndex] != 'a')
|
2012-02-24 05:38:21 +08:00
|
|
|
|
return 0;
|
2012-02-22 11:14:20 +08:00
|
|
|
|
else
|
2012-03-22 03:45:08 +08:00
|
|
|
|
return 1;// expected-warning {{Memory is never released; potential leak}}
|
2012-02-22 11:14:20 +08:00
|
|
|
|
}
|
|
|
|
|
|
2012-02-23 03:24:52 +08:00
|
|
|
|
void testStrdupContentIsDefined(const char *s, unsigned validIndex) {
|
|
|
|
|
char *s2 = strdup(s);
|
|
|
|
|
char result = s2[1];// no warning
|
|
|
|
|
free(s2);
|
|
|
|
|
}
|
|
|
|
|
|
2012-03-01 02:42:47 +08:00
|
|
|
|
// ----------------------------------------------------------------------------
|
2012-02-23 09:05:27 +08:00
|
|
|
|
// Test the system library functions to which the pointer can escape.
|
2012-03-01 02:42:47 +08:00
|
|
|
|
// This tests false positive suppression.
|
2012-02-23 09:05:27 +08:00
|
|
|
|
|
|
|
|
|
// For now, we assume memory passed to pthread_specific escapes.
|
|
|
|
|
// TODO: We could check that if a new pthread binding is set, the existing
|
|
|
|
|
// binding must be freed; otherwise, a memory leak can occur.
|
|
|
|
|
void testPthereadSpecificEscape(pthread_key_t key) {
|
|
|
|
|
void *buf = malloc(12);
|
|
|
|
|
pthread_setspecific(key, buf); // no warning
|
|
|
|
|
}
|
|
|
|
|
|
2012-03-01 02:42:47 +08:00
|
|
|
|
// PR12101: Test funopen().
|
|
|
|
|
static int releasePtr(void *_ctx) {
|
|
|
|
|
free(_ctx);
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
FILE *useFunOpen() {
|
|
|
|
|
void *ctx = malloc(sizeof(int));
|
|
|
|
|
FILE *f = funopen(ctx, 0, 0, 0, releasePtr); // no warning
|
|
|
|
|
if (f == 0) {
|
|
|
|
|
free(ctx);
|
|
|
|
|
}
|
|
|
|
|
return f;
|
|
|
|
|
}
|
|
|
|
|
FILE *useFunOpenNoReleaseFunction() {
|
|
|
|
|
void *ctx = malloc(sizeof(int));
|
|
|
|
|
FILE *f = funopen(ctx, 0, 0, 0, 0);
|
|
|
|
|
if (f == 0) {
|
|
|
|
|
free(ctx);
|
|
|
|
|
}
|
|
|
|
|
return f; // expected-warning{{leak}}
|
|
|
|
|
}
|
|
|
|
|
|
2012-07-03 03:27:51 +08:00
|
|
|
|
static int readNothing(void *_ctx, char *buf, int size) {
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
FILE *useFunOpenReadNoRelease() {
|
|
|
|
|
void *ctx = malloc(sizeof(int));
|
|
|
|
|
FILE *f = funopen(ctx, readNothing, 0, 0, 0);
|
|
|
|
|
if (f == 0) {
|
|
|
|
|
free(ctx);
|
|
|
|
|
}
|
|
|
|
|
return f; // expected-warning{{leak}}
|
|
|
|
|
}
|
|
|
|
|
|
2012-03-01 02:42:47 +08:00
|
|
|
|
// Test setbuf, setvbuf.
|
|
|
|
|
int my_main_no_warning() {
|
|
|
|
|
char *p = malloc(100);
|
|
|
|
|
setvbuf(stdout, p, 0, 100);
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
int my_main_no_warning2() {
|
|
|
|
|
char *p = malloc(100);
|
|
|
|
|
setbuf(__stdoutp, p);
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
int my_main_warn(FILE *f) {
|
|
|
|
|
char *p = malloc(100);
|
|
|
|
|
setvbuf(f, p, 0, 100);
|
|
|
|
|
return 0;// expected-warning {{leak}}
|
|
|
|
|
}
|
|
|
|
|
|
2012-03-06 07:06:19 +08:00
|
|
|
|
// <rdar://problem/10978247>.
|
|
|
|
|
// some people use stack allocated memory as an optimization to avoid
|
|
|
|
|
// a heap allocation for small work sizes. This tests the analyzer's
|
|
|
|
|
// understanding that the malloc'ed memory is not the same as stackBuffer.
|
|
|
|
|
void radar10978247(int myValueSize) {
|
|
|
|
|
char stackBuffer[128];
|
|
|
|
|
char *buffer;
|
|
|
|
|
|
|
|
|
|
if (myValueSize <= sizeof(stackBuffer))
|
|
|
|
|
buffer = stackBuffer;
|
|
|
|
|
else
|
|
|
|
|
buffer = malloc(myValueSize);
|
|
|
|
|
|
|
|
|
|
// do stuff with the buffer
|
|
|
|
|
if (buffer != stackBuffer)
|
|
|
|
|
free(buffer);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void radar10978247_positive(int myValueSize) {
|
|
|
|
|
char stackBuffer[128];
|
|
|
|
|
char *buffer;
|
|
|
|
|
|
|
|
|
|
if (myValueSize <= sizeof(stackBuffer))
|
|
|
|
|
buffer = stackBuffer;
|
|
|
|
|
else
|
|
|
|
|
buffer = malloc(myValueSize);
|
|
|
|
|
|
|
|
|
|
// do stuff with the buffer
|
2012-11-16 03:11:43 +08:00
|
|
|
|
if (buffer == stackBuffer)
|
2012-03-06 07:06:19 +08:00
|
|
|
|
return;
|
2012-11-16 03:11:43 +08:00
|
|
|
|
else
|
|
|
|
|
return; // expected-warning {{leak}}
|
|
|
|
|
}
|
2012-04-26 13:08:26 +08:00
|
|
|
|
// <rdar://problem/11269741> Previously this triggered a false positive
|
|
|
|
|
// because malloc() is known to return uninitialized memory and the binding
|
|
|
|
|
// of 'o' to 'p->n' was not getting propertly handled. Now we report a leak.
|
|
|
|
|
struct rdar11269741_a_t {
|
|
|
|
|
struct rdar11269741_b_t {
|
|
|
|
|
int m;
|
|
|
|
|
} n;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
int rdar11269741(struct rdar11269741_b_t o)
|
|
|
|
|
{
|
|
|
|
|
struct rdar11269741_a_t *p = (struct rdar11269741_a_t *) malloc(sizeof(*p));
|
|
|
|
|
p->n = o;
|
|
|
|
|
return p->n.m; // expected-warning {{leak}}
|
|
|
|
|
}
|
|
|
|
|
|
2012-05-03 10:13:56 +08:00
|
|
|
|
// Pointer arithmetic, returning an ElementRegion.
|
|
|
|
|
void *radar11329382(unsigned bl) {
|
|
|
|
|
void *ptr = malloc (16);
|
|
|
|
|
ptr = ptr + (2 - bl);
|
|
|
|
|
return ptr; // no warning
|
|
|
|
|
}
|
|
|
|
|
|
2012-05-02 05:10:29 +08:00
|
|
|
|
void __assert_rtn(const char *, const char *, int, const char *) __attribute__((__noreturn__));
|
|
|
|
|
int strcmp(const char *, const char *);
|
|
|
|
|
char *a (void);
|
|
|
|
|
void radar11270219(void) {
|
|
|
|
|
char *x = a(), *y = a();
|
|
|
|
|
(__builtin_expect(!(x && y), 0) ? __assert_rtn(__func__, "/Users/zaks/tmp/ex.c", 24, "x && y") : (void)0);
|
|
|
|
|
strcmp(x, y); // no warning
|
|
|
|
|
}
|
|
|
|
|
|
2012-05-02 08:05:20 +08:00
|
|
|
|
void radar_11358224_test_double_assign_ints_positive_2()
|
|
|
|
|
{
|
|
|
|
|
void *ptr = malloc(16);
|
2012-11-16 03:11:43 +08:00
|
|
|
|
ptr = ptr;
|
|
|
|
|
} // expected-warning {{leak}}
|
2012-05-02 08:05:20 +08:00
|
|
|
|
|
2012-05-04 07:50:28 +08:00
|
|
|
|
// Assume that functions which take a function pointer can free memory even if
|
|
|
|
|
// they are defined in system headers and take the const pointer to the
|
|
|
|
|
// allocated memory. (radar://11160612)
|
|
|
|
|
int const_ptr_and_callback(int, const char*, int n, void(*)(void*));
|
|
|
|
|
void r11160612_1() {
|
|
|
|
|
char *x = malloc(12);
|
|
|
|
|
const_ptr_and_callback(0, x, 12, free); // no - warning
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Null is passed as callback.
|
|
|
|
|
void r11160612_2() {
|
|
|
|
|
char *x = malloc(12);
|
2012-11-16 03:11:43 +08:00
|
|
|
|
const_ptr_and_callback(0, x, 12, 0);
|
|
|
|
|
} // expected-warning {{leak}}
|
2012-05-04 07:50:28 +08:00
|
|
|
|
|
|
|
|
|
// Callback is passed to a function defined in a system header.
|
|
|
|
|
void r11160612_4() {
|
|
|
|
|
char *x = malloc(12);
|
|
|
|
|
sqlite3_bind_text_my(0, x, 12, free); // no - warning
|
|
|
|
|
}
|
|
|
|
|
|
2012-05-04 07:50:33 +08:00
|
|
|
|
// Passing callbacks in a struct.
|
|
|
|
|
void r11160612_5(StWithCallback St) {
|
|
|
|
|
void *x = malloc(12);
|
|
|
|
|
dealocateMemWhenDoneByVal(x, St);
|
|
|
|
|
}
|
|
|
|
|
void r11160612_6(StWithCallback St) {
|
|
|
|
|
void *x = malloc(12);
|
|
|
|
|
dealocateMemWhenDoneByRef(&St, x);
|
|
|
|
|
}
|
|
|
|
|
|
2012-05-05 01:37:16 +08:00
|
|
|
|
int mySub(int, int);
|
|
|
|
|
int myAdd(int, int);
|
|
|
|
|
int fPtr(unsigned cond, int x) {
|
|
|
|
|
return (cond ? mySub : myAdd)(x, x);
|
|
|
|
|
}
|
|
|
|
|
|
2012-06-07 11:57:32 +08:00
|
|
|
|
// Test anti-aliasing.
|
2012-02-12 05:02:40 +08:00
|
|
|
|
|
2012-02-10 09:11:03 +08:00
|
|
|
|
void dependsOnValueOfPtr(int *g, unsigned f) {
|
|
|
|
|
int *p;
|
|
|
|
|
|
|
|
|
|
if (f) {
|
|
|
|
|
p = g;
|
|
|
|
|
} else {
|
|
|
|
|
p = malloc(12);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (p != g)
|
|
|
|
|
free(p);
|
|
|
|
|
else
|
2012-06-07 11:57:32 +08:00
|
|
|
|
return; // no warning
|
2012-02-10 09:11:03 +08:00
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
2012-06-07 11:57:32 +08:00
|
|
|
|
int CMPRegionHeapToStack() {
|
|
|
|
|
int x = 0;
|
|
|
|
|
int *x1 = malloc(8);
|
|
|
|
|
int *x2 = &x;
|
2012-06-08 08:04:40 +08:00
|
|
|
|
clang_analyzer_eval(x1 == x2); // expected-warning{{FALSE}}
|
2012-06-07 11:57:32 +08:00
|
|
|
|
free(x1);
|
|
|
|
|
return x;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int CMPRegionHeapToHeap2() {
|
|
|
|
|
int x = 0;
|
|
|
|
|
int *x1 = malloc(8);
|
|
|
|
|
int *x2 = malloc(8);
|
|
|
|
|
int *x4 = x1;
|
|
|
|
|
int *x5 = x2;
|
2012-06-08 08:04:40 +08:00
|
|
|
|
clang_analyzer_eval(x4 == x5); // expected-warning{{FALSE}}
|
2012-06-07 11:57:32 +08:00
|
|
|
|
free(x1);
|
|
|
|
|
free(x2);
|
|
|
|
|
return x;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int CMPRegionHeapToHeap() {
|
|
|
|
|
int x = 0;
|
|
|
|
|
int *x1 = malloc(8);
|
|
|
|
|
int *x4 = x1;
|
|
|
|
|
if (x1 == x4) {
|
|
|
|
|
free(x1);
|
|
|
|
|
return 5/x; // expected-warning{{Division by zero}}
|
|
|
|
|
}
|
|
|
|
|
return x;// expected-warning{{This statement is never executed}}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int HeapAssignment() {
|
|
|
|
|
int m = 0;
|
|
|
|
|
int *x = malloc(4);
|
|
|
|
|
int *y = x;
|
|
|
|
|
*x = 5;
|
2012-06-08 08:04:40 +08:00
|
|
|
|
clang_analyzer_eval(*x != *y); // expected-warning{{FALSE}}
|
2012-06-07 11:57:32 +08:00
|
|
|
|
free(x);
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2012-06-08 04:18:08 +08:00
|
|
|
|
int *retPtr();
|
|
|
|
|
int *retPtrMightAlias(int *x);
|
|
|
|
|
int cmpHeapAllocationToUnknown() {
|
|
|
|
|
int zero = 0;
|
|
|
|
|
int *yBefore = retPtr();
|
|
|
|
|
int *m = malloc(8);
|
|
|
|
|
int *yAfter = retPtrMightAlias(m);
|
2012-06-08 08:04:40 +08:00
|
|
|
|
clang_analyzer_eval(yBefore == m); // expected-warning{{FALSE}}
|
|
|
|
|
clang_analyzer_eval(yAfter == m); // expected-warning{{FALSE}}
|
2012-06-08 04:18:08 +08:00
|
|
|
|
free(m);
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2012-11-27 10:37:49 +08:00
|
|
|
|
#ifdef __INTPTR_TYPE__
|
2012-05-02 05:58:29 +08:00
|
|
|
|
// Test double assignment through integers.
|
2012-11-27 10:37:49 +08:00
|
|
|
|
typedef __INTPTR_TYPE__ intptr_t;
|
|
|
|
|
typedef unsigned __INTPTR_TYPE__ uintptr_t;
|
|
|
|
|
|
|
|
|
|
static intptr_t glob;
|
2012-05-02 05:58:29 +08:00
|
|
|
|
void test_double_assign_ints()
|
|
|
|
|
{
|
|
|
|
|
void *ptr = malloc (16); // no-warning
|
2012-11-27 10:37:49 +08:00
|
|
|
|
glob = (intptr_t)(uintptr_t)ptr;
|
2012-05-02 05:58:29 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void test_double_assign_ints_positive()
|
|
|
|
|
{
|
|
|
|
|
void *ptr = malloc(16);
|
2012-11-27 10:37:49 +08:00
|
|
|
|
(void*)(intptr_t)(uintptr_t)ptr; // expected-warning {{unused}}
|
2012-11-16 03:11:43 +08:00
|
|
|
|
} // expected-warning {{leak}}
|
2012-11-27 10:37:49 +08:00
|
|
|
|
#endif
|
2012-06-16 08:09:20 +08:00
|
|
|
|
|
|
|
|
|
void testCGContextNoLeak()
|
|
|
|
|
{
|
|
|
|
|
void *ptr = malloc(16);
|
|
|
|
|
CGContextRef context = CGBitmapContextCreate(ptr);
|
|
|
|
|
|
|
|
|
|
// Because you can get the data back out like this, even much later,
|
|
|
|
|
// CGBitmapContextCreate is one of our "stop-tracking" exceptions.
|
|
|
|
|
free(CGBitmapContextGetData(context));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void testCGContextLeak()
|
|
|
|
|
{
|
|
|
|
|
void *ptr = malloc(16);
|
|
|
|
|
CGContextRef context = CGBitmapContextCreate(ptr);
|
|
|
|
|
// However, this time we're just leaking the data, because the context
|
|
|
|
|
// object doesn't escape and it hasn't been freed in this function.
|
|
|
|
|
}
|
|
|
|
|
|
2012-06-21 07:35:57 +08:00
|
|
|
|
// Allow xpc context to escape. radar://11635258
|
|
|
|
|
// TODO: Would be great if we checked that the finalize_connection_context actually releases it.
|
|
|
|
|
static void finalize_connection_context(void *ctx) {
|
|
|
|
|
int *context = ctx;
|
|
|
|
|
free(context);
|
|
|
|
|
}
|
|
|
|
|
void foo (xpc_connection_t peer) {
|
|
|
|
|
int *ctx = calloc(1, sizeof(int));
|
|
|
|
|
xpc_connection_set_context(peer, ctx);
|
|
|
|
|
xpc_connection_set_finalizer_f(peer, finalize_connection_context);
|
|
|
|
|
xpc_connection_resume(peer);
|
|
|
|
|
}
|
|
|
|
|
|
2012-08-04 02:30:18 +08:00
|
|
|
|
// Make sure we catch errors when we free in a function which does not allocate memory.
|
|
|
|
|
void freeButNoMalloc(int *p, int x){
|
|
|
|
|
if (x) {
|
|
|
|
|
free(p);
|
|
|
|
|
//user forgot a return here.
|
|
|
|
|
}
|
|
|
|
|
free(p); // expected-warning {{Attempt to free released memory}}
|
|
|
|
|
}
|
2012-08-04 10:04:27 +08:00
|
|
|
|
|
|
|
|
|
struct HasPtr {
|
2012-08-24 10:28:20 +08:00
|
|
|
|
char *p;
|
2012-08-04 10:04:27 +08:00
|
|
|
|
};
|
|
|
|
|
|
2012-08-24 10:28:20 +08:00
|
|
|
|
char* reallocButNoMalloc(struct HasPtr *a, int c, int size) {
|
2012-08-04 10:04:27 +08:00
|
|
|
|
int *s;
|
2012-08-24 10:28:20 +08:00
|
|
|
|
char *b = realloc(a->p, size);
|
|
|
|
|
char *m = realloc(a->p, size); // expected-warning {{Attempt to free released memory}}
|
2012-08-04 10:04:27 +08:00
|
|
|
|
return a->p;
|
|
|
|
|
}
|
2012-08-09 02:23:31 +08:00
|
|
|
|
|
2012-08-24 10:28:20 +08:00
|
|
|
|
// We should not warn in this case since the caller will presumably free a->p in all cases.
|
|
|
|
|
int reallocButNoMallocPR13674(struct HasPtr *a, int c, int size) {
|
|
|
|
|
int *s;
|
|
|
|
|
char *b = realloc(a->p, size);
|
|
|
|
|
if (b == 0)
|
|
|
|
|
return -1;
|
|
|
|
|
a->p = b;
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2012-09-13 06:57:34 +08:00
|
|
|
|
// Test realloc with no visible malloc.
|
|
|
|
|
void *test(void *ptr) {
|
|
|
|
|
void *newPtr = realloc(ptr, 4);
|
|
|
|
|
if (newPtr == 0) {
|
|
|
|
|
if (ptr)
|
|
|
|
|
free(ptr); // no-warning
|
|
|
|
|
}
|
|
|
|
|
return newPtr;
|
|
|
|
|
}
|
|
|
|
|
|
2012-11-16 03:11:27 +08:00
|
|
|
|
|
|
|
|
|
char *testLeakWithinReturn(char *str) {
|
|
|
|
|
return strdup(strdup(str)); // expected-warning{{leak}}
|
|
|
|
|
}
|
|
|
|
|
|
2012-08-09 02:23:31 +08:00
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
|
// False negatives.
|
|
|
|
|
|
|
|
|
|
// TODO: This is another false negative.
|
|
|
|
|
void testMallocWithParam(int **p) {
|
|
|
|
|
*p = (int*) malloc(sizeof(int));
|
|
|
|
|
*p = 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void testMallocWithParam_2(int **p) {
|
|
|
|
|
*p = (int*) malloc(sizeof(int));
|
|
|
|
|
}
|
2013-02-06 08:01:14 +08:00
|
|
|
|
|
|
|
|
|
// Pending on removal of the escaping on assignment to struct fields.
|
|
|
|
|
void testStructLeak() {
|
|
|
|
|
StructWithPtr St;
|
|
|
|
|
St.memP = malloc(12);
|
|
|
|
|
return; // missing warning
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void localArrayTest() {
|
|
|
|
|
char *p = (char*)malloc(12);
|
|
|
|
|
char *ArrayL[12];
|
|
|
|
|
ArrayL[0] = p;
|
|
|
|
|
} // missing warning
|
|
|
|
|
|
|
|
|
|
void localStructTest() {
|
|
|
|
|
StructWithPtr St;
|
|
|
|
|
StructWithPtr *pSt = &St;
|
|
|
|
|
pSt->memP = malloc(12);
|
|
|
|
|
} // missing warning
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|