You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

68 lines
1.3 KiB

/*
* Copyright (c) 2018-present, Facebook, Inc.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
#include "my_typedef.h"
struct st {
int field;
};
int get_field(t* x) { return x->field; }
void call_get_field_cond_Bad() {
int a[5];
t x = {0};
if (get_field_wrapper(&x)) {
a[10] = 0;
} else {
a[10] = 0;
}
}
void call_get_field_Good() {
int a[5];
t x = {0};
a[get_field_wrapper(&x)] = 0;
}
void call_get_field_Bad() {
int a[5];
t x = {10};
a[get_field_wrapper(&x)] = 0;
}
struct List {
struct List* next;
struct List* prev;
int v;
};
// [l->next->prev->v] is unsoundly canonicalized to [l->next->v].
int get_v(struct List* l) { return l->next->prev->v; }
int call_get_v_Good_FP() {
int a[10];
struct List* l = (struct List*)malloc(sizeof(struct List));
struct List* next = (struct List*)malloc(sizeof(struct List));
l->next = next;
next->prev = l;
l->v = 0;
next->v = 10;
a[get_v(l)] = 0;
}
int call_get_v_Bad_FN() {
int a[10];
struct List* l = (struct List*)malloc(sizeof(struct List));
struct List* next = (struct List*)malloc(sizeof(struct List));
l->next = next;
next->prev = l;
l->v = 10;
next->v = 0;
a[get_v(l)] = 0;
}