forked from OSchip/llvm-project
parent
ae06a0d888
commit
486c5d6ae9
|
@ -8,19 +8,15 @@
|
||||||
#include <assert.h>
|
#include <assert.h>
|
||||||
#include <stdlib.h>
|
#include <stdlib.h>
|
||||||
|
|
||||||
char *p;
|
int f(char c, char *p, char *q) {
|
||||||
int main(int argc, char **argv) {
|
|
||||||
// ALL-ERRORS: ERROR: AddressSanitizer: invalid-pointer-pair
|
// ALL-ERRORS: ERROR: AddressSanitizer: invalid-pointer-pair
|
||||||
// [[PTR1:0x[0-9a-f]+]] [[PTR2:0x[0-9a-f]+]]
|
// [[PTR1:0x[0-9a-f]+]] [[PTR2:0x[0-9a-f]+]]
|
||||||
assert(argc >= 2);
|
switch (c) {
|
||||||
p = (char *)malloc(42);
|
|
||||||
char *q = (char *)malloc(42);
|
|
||||||
switch (argv[1][0]) {
|
|
||||||
case 'g':
|
case 'g':
|
||||||
// CMP: #0 {{.*}} in main {{.*}}invalid-pointer-pairs.cc:[[@LINE+1]]:14
|
// CMP: #0 {{.*}} in f(char, char*, char*) {{.*}}invalid-pointer-pairs.cc:[[@LINE+1]]:14
|
||||||
return p > q;
|
return p > q;
|
||||||
case 's':
|
case 's':
|
||||||
// SUB: #0 {{.*}} in main {{.*}}invalid-pointer-pairs.cc:[[@LINE+1]]:14
|
// SUB: #0 {{.*}} in f(char, char*, char*) {{.*}}invalid-pointer-pairs.cc:[[@LINE+1]]:14
|
||||||
return p - q;
|
return p - q;
|
||||||
case 'k': {
|
case 'k': {
|
||||||
// OK-NOT: ERROR
|
// OK-NOT: ERROR
|
||||||
|
@ -30,9 +26,19 @@ int main(int argc, char **argv) {
|
||||||
case 'f': {
|
case 'f': {
|
||||||
char *p3 = p + 20;
|
char *p3 = p + 20;
|
||||||
free(p);
|
free(p);
|
||||||
// FREE: #0 {{.*}} in main {{.*}}invalid-pointer-pairs.cc:[[@LINE+2]]:14
|
// FREE: #0 {{.*}} in f(char, char*, char*) {{.*}}invalid-pointer-pairs.cc:[[@LINE+2]]:14
|
||||||
// FREE: freed by thread
|
// FREE: freed by thread
|
||||||
return p < p3;
|
return p < p3;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
assert(0);
|
||||||
|
}
|
||||||
|
|
||||||
|
int main(int argc, char **argv) {
|
||||||
|
char *p = (char *)malloc(42);
|
||||||
|
char *q = (char *)malloc(42);
|
||||||
|
assert(argc >= 2);
|
||||||
|
f(argv[1][0], p, q);
|
||||||
|
free(p);
|
||||||
|
free(q);
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in New Issue