1*4882a593Smuzhiyun /*
2*4882a593Smuzhiyun * Copyright 2014-2016 by Open Source Security, Inc., Brad Spengler <spender@grsecurity.net>
3*4882a593Smuzhiyun * and PaX Team <pageexec@freemail.hu>
4*4882a593Smuzhiyun * Licensed under the GPL v2
5*4882a593Smuzhiyun *
6*4882a593Smuzhiyun * Note: the choice of the license means that the compilation process is
7*4882a593Smuzhiyun * NOT 'eligible' as defined by gcc's library exception to the GPL v3,
8*4882a593Smuzhiyun * but for the kernel it doesn't matter since it doesn't link against
9*4882a593Smuzhiyun * any of the gcc libraries
10*4882a593Smuzhiyun *
11*4882a593Smuzhiyun * Usage:
12*4882a593Smuzhiyun * $ # for 4.5/4.6/C based 4.7
13*4882a593Smuzhiyun * $ gcc -I`gcc -print-file-name=plugin`/include -I`gcc -print-file-name=plugin`/include/c-family -fPIC -shared -O2 -o randomize_layout_plugin.so randomize_layout_plugin.c
14*4882a593Smuzhiyun * $ # for C++ based 4.7/4.8+
15*4882a593Smuzhiyun * $ g++ -I`g++ -print-file-name=plugin`/include -I`g++ -print-file-name=plugin`/include/c-family -fPIC -shared -O2 -o randomize_layout_plugin.so randomize_layout_plugin.c
16*4882a593Smuzhiyun * $ gcc -fplugin=./randomize_layout_plugin.so test.c -O2
17*4882a593Smuzhiyun */
18*4882a593Smuzhiyun
19*4882a593Smuzhiyun #include "gcc-common.h"
20*4882a593Smuzhiyun #include "randomize_layout_seed.h"
21*4882a593Smuzhiyun
22*4882a593Smuzhiyun #if BUILDING_GCC_MAJOR < 4 || (BUILDING_GCC_MAJOR == 4 && BUILDING_GCC_MINOR < 7)
23*4882a593Smuzhiyun #error "The RANDSTRUCT plugin requires GCC 4.7 or newer."
24*4882a593Smuzhiyun #endif
25*4882a593Smuzhiyun
26*4882a593Smuzhiyun #define ORIG_TYPE_NAME(node) \
27*4882a593Smuzhiyun (TYPE_NAME(TYPE_MAIN_VARIANT(node)) != NULL_TREE ? ((const unsigned char *)IDENTIFIER_POINTER(TYPE_NAME(TYPE_MAIN_VARIANT(node)))) : (const unsigned char *)"anonymous")
28*4882a593Smuzhiyun
29*4882a593Smuzhiyun #define INFORM(loc, msg, ...) inform(loc, "randstruct: " msg, ##__VA_ARGS__)
30*4882a593Smuzhiyun #define MISMATCH(loc, how, ...) INFORM(loc, "casting between randomized structure pointer types (" how "): %qT and %qT\n", __VA_ARGS__)
31*4882a593Smuzhiyun
32*4882a593Smuzhiyun __visible int plugin_is_GPL_compatible;
33*4882a593Smuzhiyun
34*4882a593Smuzhiyun static int performance_mode;
35*4882a593Smuzhiyun
36*4882a593Smuzhiyun static struct plugin_info randomize_layout_plugin_info = {
37*4882a593Smuzhiyun .version = "201402201816vanilla",
38*4882a593Smuzhiyun .help = "disable\t\t\tdo not activate plugin\n"
39*4882a593Smuzhiyun "performance-mode\tenable cacheline-aware layout randomization\n"
40*4882a593Smuzhiyun };
41*4882a593Smuzhiyun
42*4882a593Smuzhiyun struct whitelist_entry {
43*4882a593Smuzhiyun const char *pathname;
44*4882a593Smuzhiyun const char *lhs;
45*4882a593Smuzhiyun const char *rhs;
46*4882a593Smuzhiyun };
47*4882a593Smuzhiyun
48*4882a593Smuzhiyun static const struct whitelist_entry whitelist[] = {
49*4882a593Smuzhiyun /* NIU overloads mapping with page struct */
50*4882a593Smuzhiyun { "drivers/net/ethernet/sun/niu.c", "page", "address_space" },
51*4882a593Smuzhiyun /* unix_skb_parms via UNIXCB() buffer */
52*4882a593Smuzhiyun { "net/unix/af_unix.c", "unix_skb_parms", "char" },
53*4882a593Smuzhiyun /* big_key payload.data struct splashing */
54*4882a593Smuzhiyun { "security/keys/big_key.c", "path", "void *" },
55*4882a593Smuzhiyun /* walk struct security_hook_heads as an array of struct hlist_head */
56*4882a593Smuzhiyun { "security/security.c", "hlist_head", "security_hook_heads" },
57*4882a593Smuzhiyun { }
58*4882a593Smuzhiyun };
59*4882a593Smuzhiyun
60*4882a593Smuzhiyun /* from old Linux dcache.h */
61*4882a593Smuzhiyun static inline unsigned long
partial_name_hash(unsigned long c,unsigned long prevhash)62*4882a593Smuzhiyun partial_name_hash(unsigned long c, unsigned long prevhash)
63*4882a593Smuzhiyun {
64*4882a593Smuzhiyun return (prevhash + (c << 4) + (c >> 4)) * 11;
65*4882a593Smuzhiyun }
66*4882a593Smuzhiyun static inline unsigned int
name_hash(const unsigned char * name)67*4882a593Smuzhiyun name_hash(const unsigned char *name)
68*4882a593Smuzhiyun {
69*4882a593Smuzhiyun unsigned long hash = 0;
70*4882a593Smuzhiyun unsigned int len = strlen((const char *)name);
71*4882a593Smuzhiyun while (len--)
72*4882a593Smuzhiyun hash = partial_name_hash(*name++, hash);
73*4882a593Smuzhiyun return (unsigned int)hash;
74*4882a593Smuzhiyun }
75*4882a593Smuzhiyun
handle_randomize_layout_attr(tree * node,tree name,tree args,int flags,bool * no_add_attrs)76*4882a593Smuzhiyun static tree handle_randomize_layout_attr(tree *node, tree name, tree args, int flags, bool *no_add_attrs)
77*4882a593Smuzhiyun {
78*4882a593Smuzhiyun tree type;
79*4882a593Smuzhiyun
80*4882a593Smuzhiyun *no_add_attrs = true;
81*4882a593Smuzhiyun if (TREE_CODE(*node) == FUNCTION_DECL) {
82*4882a593Smuzhiyun error("%qE attribute does not apply to functions (%qF)", name, *node);
83*4882a593Smuzhiyun return NULL_TREE;
84*4882a593Smuzhiyun }
85*4882a593Smuzhiyun
86*4882a593Smuzhiyun if (TREE_CODE(*node) == PARM_DECL) {
87*4882a593Smuzhiyun error("%qE attribute does not apply to function parameters (%qD)", name, *node);
88*4882a593Smuzhiyun return NULL_TREE;
89*4882a593Smuzhiyun }
90*4882a593Smuzhiyun
91*4882a593Smuzhiyun if (TREE_CODE(*node) == VAR_DECL) {
92*4882a593Smuzhiyun error("%qE attribute does not apply to variables (%qD)", name, *node);
93*4882a593Smuzhiyun return NULL_TREE;
94*4882a593Smuzhiyun }
95*4882a593Smuzhiyun
96*4882a593Smuzhiyun if (TYPE_P(*node)) {
97*4882a593Smuzhiyun type = *node;
98*4882a593Smuzhiyun } else {
99*4882a593Smuzhiyun gcc_assert(TREE_CODE(*node) == TYPE_DECL);
100*4882a593Smuzhiyun type = TREE_TYPE(*node);
101*4882a593Smuzhiyun }
102*4882a593Smuzhiyun
103*4882a593Smuzhiyun if (TREE_CODE(type) != RECORD_TYPE) {
104*4882a593Smuzhiyun error("%qE attribute used on %qT applies to struct types only", name, type);
105*4882a593Smuzhiyun return NULL_TREE;
106*4882a593Smuzhiyun }
107*4882a593Smuzhiyun
108*4882a593Smuzhiyun if (lookup_attribute(IDENTIFIER_POINTER(name), TYPE_ATTRIBUTES(type))) {
109*4882a593Smuzhiyun error("%qE attribute is already applied to the type %qT", name, type);
110*4882a593Smuzhiyun return NULL_TREE;
111*4882a593Smuzhiyun }
112*4882a593Smuzhiyun
113*4882a593Smuzhiyun *no_add_attrs = false;
114*4882a593Smuzhiyun
115*4882a593Smuzhiyun return NULL_TREE;
116*4882a593Smuzhiyun }
117*4882a593Smuzhiyun
118*4882a593Smuzhiyun /* set on complete types that we don't need to inspect further at all */
handle_randomize_considered_attr(tree * node,tree name,tree args,int flags,bool * no_add_attrs)119*4882a593Smuzhiyun static tree handle_randomize_considered_attr(tree *node, tree name, tree args, int flags, bool *no_add_attrs)
120*4882a593Smuzhiyun {
121*4882a593Smuzhiyun *no_add_attrs = false;
122*4882a593Smuzhiyun return NULL_TREE;
123*4882a593Smuzhiyun }
124*4882a593Smuzhiyun
125*4882a593Smuzhiyun /*
126*4882a593Smuzhiyun * set on types that we've performed a shuffle on, to prevent re-shuffling
127*4882a593Smuzhiyun * this does not preclude us from inspecting its fields for potential shuffles
128*4882a593Smuzhiyun */
handle_randomize_performed_attr(tree * node,tree name,tree args,int flags,bool * no_add_attrs)129*4882a593Smuzhiyun static tree handle_randomize_performed_attr(tree *node, tree name, tree args, int flags, bool *no_add_attrs)
130*4882a593Smuzhiyun {
131*4882a593Smuzhiyun *no_add_attrs = false;
132*4882a593Smuzhiyun return NULL_TREE;
133*4882a593Smuzhiyun }
134*4882a593Smuzhiyun
135*4882a593Smuzhiyun /*
136*4882a593Smuzhiyun * 64bit variant of Bob Jenkins' public domain PRNG
137*4882a593Smuzhiyun * 256 bits of internal state
138*4882a593Smuzhiyun */
139*4882a593Smuzhiyun
140*4882a593Smuzhiyun typedef unsigned long long u64;
141*4882a593Smuzhiyun
142*4882a593Smuzhiyun typedef struct ranctx { u64 a; u64 b; u64 c; u64 d; } ranctx;
143*4882a593Smuzhiyun
144*4882a593Smuzhiyun #define rot(x,k) (((x)<<(k))|((x)>>(64-(k))))
ranval(ranctx * x)145*4882a593Smuzhiyun static u64 ranval(ranctx *x) {
146*4882a593Smuzhiyun u64 e = x->a - rot(x->b, 7);
147*4882a593Smuzhiyun x->a = x->b ^ rot(x->c, 13);
148*4882a593Smuzhiyun x->b = x->c + rot(x->d, 37);
149*4882a593Smuzhiyun x->c = x->d + e;
150*4882a593Smuzhiyun x->d = e + x->a;
151*4882a593Smuzhiyun return x->d;
152*4882a593Smuzhiyun }
153*4882a593Smuzhiyun
raninit(ranctx * x,u64 * seed)154*4882a593Smuzhiyun static void raninit(ranctx *x, u64 *seed) {
155*4882a593Smuzhiyun int i;
156*4882a593Smuzhiyun
157*4882a593Smuzhiyun x->a = seed[0];
158*4882a593Smuzhiyun x->b = seed[1];
159*4882a593Smuzhiyun x->c = seed[2];
160*4882a593Smuzhiyun x->d = seed[3];
161*4882a593Smuzhiyun
162*4882a593Smuzhiyun for (i=0; i < 30; ++i)
163*4882a593Smuzhiyun (void)ranval(x);
164*4882a593Smuzhiyun }
165*4882a593Smuzhiyun
166*4882a593Smuzhiyun static u64 shuffle_seed[4];
167*4882a593Smuzhiyun
168*4882a593Smuzhiyun struct partition_group {
169*4882a593Smuzhiyun tree tree_start;
170*4882a593Smuzhiyun unsigned long start;
171*4882a593Smuzhiyun unsigned long length;
172*4882a593Smuzhiyun };
173*4882a593Smuzhiyun
partition_struct(tree * fields,unsigned long length,struct partition_group * size_groups,unsigned long * num_groups)174*4882a593Smuzhiyun static void partition_struct(tree *fields, unsigned long length, struct partition_group *size_groups, unsigned long *num_groups)
175*4882a593Smuzhiyun {
176*4882a593Smuzhiyun unsigned long i;
177*4882a593Smuzhiyun unsigned long accum_size = 0;
178*4882a593Smuzhiyun unsigned long accum_length = 0;
179*4882a593Smuzhiyun unsigned long group_idx = 0;
180*4882a593Smuzhiyun
181*4882a593Smuzhiyun gcc_assert(length < INT_MAX);
182*4882a593Smuzhiyun
183*4882a593Smuzhiyun memset(size_groups, 0, sizeof(struct partition_group) * length);
184*4882a593Smuzhiyun
185*4882a593Smuzhiyun for (i = 0; i < length; i++) {
186*4882a593Smuzhiyun if (size_groups[group_idx].tree_start == NULL_TREE) {
187*4882a593Smuzhiyun size_groups[group_idx].tree_start = fields[i];
188*4882a593Smuzhiyun size_groups[group_idx].start = i;
189*4882a593Smuzhiyun accum_length = 0;
190*4882a593Smuzhiyun accum_size = 0;
191*4882a593Smuzhiyun }
192*4882a593Smuzhiyun accum_size += (unsigned long)int_size_in_bytes(TREE_TYPE(fields[i]));
193*4882a593Smuzhiyun accum_length++;
194*4882a593Smuzhiyun if (accum_size >= 64) {
195*4882a593Smuzhiyun size_groups[group_idx].length = accum_length;
196*4882a593Smuzhiyun accum_length = 0;
197*4882a593Smuzhiyun group_idx++;
198*4882a593Smuzhiyun }
199*4882a593Smuzhiyun }
200*4882a593Smuzhiyun
201*4882a593Smuzhiyun if (size_groups[group_idx].tree_start != NULL_TREE &&
202*4882a593Smuzhiyun !size_groups[group_idx].length) {
203*4882a593Smuzhiyun size_groups[group_idx].length = accum_length;
204*4882a593Smuzhiyun group_idx++;
205*4882a593Smuzhiyun }
206*4882a593Smuzhiyun
207*4882a593Smuzhiyun *num_groups = group_idx;
208*4882a593Smuzhiyun }
209*4882a593Smuzhiyun
performance_shuffle(tree * newtree,unsigned long length,ranctx * prng_state)210*4882a593Smuzhiyun static void performance_shuffle(tree *newtree, unsigned long length, ranctx *prng_state)
211*4882a593Smuzhiyun {
212*4882a593Smuzhiyun unsigned long i, x;
213*4882a593Smuzhiyun struct partition_group size_group[length];
214*4882a593Smuzhiyun unsigned long num_groups = 0;
215*4882a593Smuzhiyun unsigned long randnum;
216*4882a593Smuzhiyun
217*4882a593Smuzhiyun partition_struct(newtree, length, (struct partition_group *)&size_group, &num_groups);
218*4882a593Smuzhiyun for (i = num_groups - 1; i > 0; i--) {
219*4882a593Smuzhiyun struct partition_group tmp;
220*4882a593Smuzhiyun randnum = ranval(prng_state) % (i + 1);
221*4882a593Smuzhiyun tmp = size_group[i];
222*4882a593Smuzhiyun size_group[i] = size_group[randnum];
223*4882a593Smuzhiyun size_group[randnum] = tmp;
224*4882a593Smuzhiyun }
225*4882a593Smuzhiyun
226*4882a593Smuzhiyun for (x = 0; x < num_groups; x++) {
227*4882a593Smuzhiyun for (i = size_group[x].start + size_group[x].length - 1; i > size_group[x].start; i--) {
228*4882a593Smuzhiyun tree tmp;
229*4882a593Smuzhiyun if (DECL_BIT_FIELD_TYPE(newtree[i]))
230*4882a593Smuzhiyun continue;
231*4882a593Smuzhiyun randnum = ranval(prng_state) % (i + 1);
232*4882a593Smuzhiyun // we could handle this case differently if desired
233*4882a593Smuzhiyun if (DECL_BIT_FIELD_TYPE(newtree[randnum]))
234*4882a593Smuzhiyun continue;
235*4882a593Smuzhiyun tmp = newtree[i];
236*4882a593Smuzhiyun newtree[i] = newtree[randnum];
237*4882a593Smuzhiyun newtree[randnum] = tmp;
238*4882a593Smuzhiyun }
239*4882a593Smuzhiyun }
240*4882a593Smuzhiyun }
241*4882a593Smuzhiyun
full_shuffle(tree * newtree,unsigned long length,ranctx * prng_state)242*4882a593Smuzhiyun static void full_shuffle(tree *newtree, unsigned long length, ranctx *prng_state)
243*4882a593Smuzhiyun {
244*4882a593Smuzhiyun unsigned long i, randnum;
245*4882a593Smuzhiyun
246*4882a593Smuzhiyun for (i = length - 1; i > 0; i--) {
247*4882a593Smuzhiyun tree tmp;
248*4882a593Smuzhiyun randnum = ranval(prng_state) % (i + 1);
249*4882a593Smuzhiyun tmp = newtree[i];
250*4882a593Smuzhiyun newtree[i] = newtree[randnum];
251*4882a593Smuzhiyun newtree[randnum] = tmp;
252*4882a593Smuzhiyun }
253*4882a593Smuzhiyun }
254*4882a593Smuzhiyun
255*4882a593Smuzhiyun /* modern in-place Fisher-Yates shuffle */
shuffle(const_tree type,tree * newtree,unsigned long length)256*4882a593Smuzhiyun static void shuffle(const_tree type, tree *newtree, unsigned long length)
257*4882a593Smuzhiyun {
258*4882a593Smuzhiyun unsigned long i;
259*4882a593Smuzhiyun u64 seed[4];
260*4882a593Smuzhiyun ranctx prng_state;
261*4882a593Smuzhiyun const unsigned char *structname;
262*4882a593Smuzhiyun
263*4882a593Smuzhiyun if (length == 0)
264*4882a593Smuzhiyun return;
265*4882a593Smuzhiyun
266*4882a593Smuzhiyun gcc_assert(TREE_CODE(type) == RECORD_TYPE);
267*4882a593Smuzhiyun
268*4882a593Smuzhiyun structname = ORIG_TYPE_NAME(type);
269*4882a593Smuzhiyun
270*4882a593Smuzhiyun #ifdef __DEBUG_PLUGIN
271*4882a593Smuzhiyun fprintf(stderr, "Shuffling struct %s %p\n", (const char *)structname, type);
272*4882a593Smuzhiyun #ifdef __DEBUG_VERBOSE
273*4882a593Smuzhiyun debug_tree((tree)type);
274*4882a593Smuzhiyun #endif
275*4882a593Smuzhiyun #endif
276*4882a593Smuzhiyun
277*4882a593Smuzhiyun for (i = 0; i < 4; i++) {
278*4882a593Smuzhiyun seed[i] = shuffle_seed[i];
279*4882a593Smuzhiyun seed[i] ^= name_hash(structname);
280*4882a593Smuzhiyun }
281*4882a593Smuzhiyun
282*4882a593Smuzhiyun raninit(&prng_state, (u64 *)&seed);
283*4882a593Smuzhiyun
284*4882a593Smuzhiyun if (performance_mode)
285*4882a593Smuzhiyun performance_shuffle(newtree, length, &prng_state);
286*4882a593Smuzhiyun else
287*4882a593Smuzhiyun full_shuffle(newtree, length, &prng_state);
288*4882a593Smuzhiyun }
289*4882a593Smuzhiyun
is_flexible_array(const_tree field)290*4882a593Smuzhiyun static bool is_flexible_array(const_tree field)
291*4882a593Smuzhiyun {
292*4882a593Smuzhiyun const_tree fieldtype;
293*4882a593Smuzhiyun const_tree typesize;
294*4882a593Smuzhiyun const_tree elemtype;
295*4882a593Smuzhiyun const_tree elemsize;
296*4882a593Smuzhiyun
297*4882a593Smuzhiyun fieldtype = TREE_TYPE(field);
298*4882a593Smuzhiyun typesize = TYPE_SIZE(fieldtype);
299*4882a593Smuzhiyun
300*4882a593Smuzhiyun if (TREE_CODE(fieldtype) != ARRAY_TYPE)
301*4882a593Smuzhiyun return false;
302*4882a593Smuzhiyun
303*4882a593Smuzhiyun elemtype = TREE_TYPE(fieldtype);
304*4882a593Smuzhiyun elemsize = TYPE_SIZE(elemtype);
305*4882a593Smuzhiyun
306*4882a593Smuzhiyun /* size of type is represented in bits */
307*4882a593Smuzhiyun
308*4882a593Smuzhiyun if (typesize == NULL_TREE && TYPE_DOMAIN(fieldtype) != NULL_TREE &&
309*4882a593Smuzhiyun TYPE_MAX_VALUE(TYPE_DOMAIN(fieldtype)) == NULL_TREE)
310*4882a593Smuzhiyun return true;
311*4882a593Smuzhiyun
312*4882a593Smuzhiyun if (typesize != NULL_TREE &&
313*4882a593Smuzhiyun (TREE_CONSTANT(typesize) && (!tree_to_uhwi(typesize) ||
314*4882a593Smuzhiyun tree_to_uhwi(typesize) == tree_to_uhwi(elemsize))))
315*4882a593Smuzhiyun return true;
316*4882a593Smuzhiyun
317*4882a593Smuzhiyun return false;
318*4882a593Smuzhiyun }
319*4882a593Smuzhiyun
relayout_struct(tree type)320*4882a593Smuzhiyun static int relayout_struct(tree type)
321*4882a593Smuzhiyun {
322*4882a593Smuzhiyun unsigned long num_fields = (unsigned long)list_length(TYPE_FIELDS(type));
323*4882a593Smuzhiyun unsigned long shuffle_length = num_fields;
324*4882a593Smuzhiyun tree field;
325*4882a593Smuzhiyun tree newtree[num_fields];
326*4882a593Smuzhiyun unsigned long i;
327*4882a593Smuzhiyun tree list;
328*4882a593Smuzhiyun tree variant;
329*4882a593Smuzhiyun tree main_variant;
330*4882a593Smuzhiyun expanded_location xloc;
331*4882a593Smuzhiyun bool has_flexarray = false;
332*4882a593Smuzhiyun
333*4882a593Smuzhiyun if (TYPE_FIELDS(type) == NULL_TREE)
334*4882a593Smuzhiyun return 0;
335*4882a593Smuzhiyun
336*4882a593Smuzhiyun if (num_fields < 2)
337*4882a593Smuzhiyun return 0;
338*4882a593Smuzhiyun
339*4882a593Smuzhiyun gcc_assert(TREE_CODE(type) == RECORD_TYPE);
340*4882a593Smuzhiyun
341*4882a593Smuzhiyun gcc_assert(num_fields < INT_MAX);
342*4882a593Smuzhiyun
343*4882a593Smuzhiyun if (lookup_attribute("randomize_performed", TYPE_ATTRIBUTES(type)) ||
344*4882a593Smuzhiyun lookup_attribute("no_randomize_layout", TYPE_ATTRIBUTES(TYPE_MAIN_VARIANT(type))))
345*4882a593Smuzhiyun return 0;
346*4882a593Smuzhiyun
347*4882a593Smuzhiyun /* Workaround for 3rd-party VirtualBox source that we can't modify ourselves */
348*4882a593Smuzhiyun if (!strcmp((const char *)ORIG_TYPE_NAME(type), "INTNETTRUNKFACTORY") ||
349*4882a593Smuzhiyun !strcmp((const char *)ORIG_TYPE_NAME(type), "RAWPCIFACTORY"))
350*4882a593Smuzhiyun return 0;
351*4882a593Smuzhiyun
352*4882a593Smuzhiyun /* throw out any structs in uapi */
353*4882a593Smuzhiyun xloc = expand_location(DECL_SOURCE_LOCATION(TYPE_FIELDS(type)));
354*4882a593Smuzhiyun
355*4882a593Smuzhiyun if (strstr(xloc.file, "/uapi/"))
356*4882a593Smuzhiyun error(G_("attempted to randomize userland API struct %s"), ORIG_TYPE_NAME(type));
357*4882a593Smuzhiyun
358*4882a593Smuzhiyun for (field = TYPE_FIELDS(type), i = 0; field; field = TREE_CHAIN(field), i++) {
359*4882a593Smuzhiyun gcc_assert(TREE_CODE(field) == FIELD_DECL);
360*4882a593Smuzhiyun newtree[i] = field;
361*4882a593Smuzhiyun }
362*4882a593Smuzhiyun
363*4882a593Smuzhiyun /*
364*4882a593Smuzhiyun * enforce that we don't randomize the layout of the last
365*4882a593Smuzhiyun * element of a struct if it's a 0 or 1-length array
366*4882a593Smuzhiyun * or a proper flexible array
367*4882a593Smuzhiyun */
368*4882a593Smuzhiyun if (is_flexible_array(newtree[num_fields - 1])) {
369*4882a593Smuzhiyun has_flexarray = true;
370*4882a593Smuzhiyun shuffle_length--;
371*4882a593Smuzhiyun }
372*4882a593Smuzhiyun
373*4882a593Smuzhiyun shuffle(type, (tree *)newtree, shuffle_length);
374*4882a593Smuzhiyun
375*4882a593Smuzhiyun /*
376*4882a593Smuzhiyun * set up a bogus anonymous struct field designed to error out on unnamed struct initializers
377*4882a593Smuzhiyun * as gcc provides no other way to detect such code
378*4882a593Smuzhiyun */
379*4882a593Smuzhiyun list = make_node(FIELD_DECL);
380*4882a593Smuzhiyun TREE_CHAIN(list) = newtree[0];
381*4882a593Smuzhiyun TREE_TYPE(list) = void_type_node;
382*4882a593Smuzhiyun DECL_SIZE(list) = bitsize_zero_node;
383*4882a593Smuzhiyun DECL_NONADDRESSABLE_P(list) = 1;
384*4882a593Smuzhiyun DECL_FIELD_BIT_OFFSET(list) = bitsize_zero_node;
385*4882a593Smuzhiyun DECL_SIZE_UNIT(list) = size_zero_node;
386*4882a593Smuzhiyun DECL_FIELD_OFFSET(list) = size_zero_node;
387*4882a593Smuzhiyun DECL_CONTEXT(list) = type;
388*4882a593Smuzhiyun // to satisfy the constify plugin
389*4882a593Smuzhiyun TREE_READONLY(list) = 1;
390*4882a593Smuzhiyun
391*4882a593Smuzhiyun for (i = 0; i < num_fields - 1; i++)
392*4882a593Smuzhiyun TREE_CHAIN(newtree[i]) = newtree[i+1];
393*4882a593Smuzhiyun TREE_CHAIN(newtree[num_fields - 1]) = NULL_TREE;
394*4882a593Smuzhiyun
395*4882a593Smuzhiyun main_variant = TYPE_MAIN_VARIANT(type);
396*4882a593Smuzhiyun for (variant = main_variant; variant; variant = TYPE_NEXT_VARIANT(variant)) {
397*4882a593Smuzhiyun TYPE_FIELDS(variant) = list;
398*4882a593Smuzhiyun TYPE_ATTRIBUTES(variant) = copy_list(TYPE_ATTRIBUTES(variant));
399*4882a593Smuzhiyun TYPE_ATTRIBUTES(variant) = tree_cons(get_identifier("randomize_performed"), NULL_TREE, TYPE_ATTRIBUTES(variant));
400*4882a593Smuzhiyun TYPE_ATTRIBUTES(variant) = tree_cons(get_identifier("designated_init"), NULL_TREE, TYPE_ATTRIBUTES(variant));
401*4882a593Smuzhiyun if (has_flexarray)
402*4882a593Smuzhiyun TYPE_ATTRIBUTES(type) = tree_cons(get_identifier("has_flexarray"), NULL_TREE, TYPE_ATTRIBUTES(type));
403*4882a593Smuzhiyun }
404*4882a593Smuzhiyun
405*4882a593Smuzhiyun /*
406*4882a593Smuzhiyun * force a re-layout of the main variant
407*4882a593Smuzhiyun * the TYPE_SIZE for all variants will be recomputed
408*4882a593Smuzhiyun * by finalize_type_size()
409*4882a593Smuzhiyun */
410*4882a593Smuzhiyun TYPE_SIZE(main_variant) = NULL_TREE;
411*4882a593Smuzhiyun layout_type(main_variant);
412*4882a593Smuzhiyun gcc_assert(TYPE_SIZE(main_variant) != NULL_TREE);
413*4882a593Smuzhiyun
414*4882a593Smuzhiyun return 1;
415*4882a593Smuzhiyun }
416*4882a593Smuzhiyun
417*4882a593Smuzhiyun /* from constify plugin */
get_field_type(const_tree field)418*4882a593Smuzhiyun static const_tree get_field_type(const_tree field)
419*4882a593Smuzhiyun {
420*4882a593Smuzhiyun return strip_array_types(TREE_TYPE(field));
421*4882a593Smuzhiyun }
422*4882a593Smuzhiyun
423*4882a593Smuzhiyun /* from constify plugin */
is_fptr(const_tree fieldtype)424*4882a593Smuzhiyun static bool is_fptr(const_tree fieldtype)
425*4882a593Smuzhiyun {
426*4882a593Smuzhiyun if (TREE_CODE(fieldtype) != POINTER_TYPE)
427*4882a593Smuzhiyun return false;
428*4882a593Smuzhiyun
429*4882a593Smuzhiyun return TREE_CODE(TREE_TYPE(fieldtype)) == FUNCTION_TYPE;
430*4882a593Smuzhiyun }
431*4882a593Smuzhiyun
432*4882a593Smuzhiyun /* derived from constify plugin */
is_pure_ops_struct(const_tree node)433*4882a593Smuzhiyun static int is_pure_ops_struct(const_tree node)
434*4882a593Smuzhiyun {
435*4882a593Smuzhiyun const_tree field;
436*4882a593Smuzhiyun
437*4882a593Smuzhiyun gcc_assert(TREE_CODE(node) == RECORD_TYPE || TREE_CODE(node) == UNION_TYPE);
438*4882a593Smuzhiyun
439*4882a593Smuzhiyun for (field = TYPE_FIELDS(node); field; field = TREE_CHAIN(field)) {
440*4882a593Smuzhiyun const_tree fieldtype = get_field_type(field);
441*4882a593Smuzhiyun enum tree_code code = TREE_CODE(fieldtype);
442*4882a593Smuzhiyun
443*4882a593Smuzhiyun if (node == fieldtype)
444*4882a593Smuzhiyun continue;
445*4882a593Smuzhiyun
446*4882a593Smuzhiyun if (code == RECORD_TYPE || code == UNION_TYPE) {
447*4882a593Smuzhiyun if (!is_pure_ops_struct(fieldtype))
448*4882a593Smuzhiyun return 0;
449*4882a593Smuzhiyun continue;
450*4882a593Smuzhiyun }
451*4882a593Smuzhiyun
452*4882a593Smuzhiyun if (!is_fptr(fieldtype))
453*4882a593Smuzhiyun return 0;
454*4882a593Smuzhiyun }
455*4882a593Smuzhiyun
456*4882a593Smuzhiyun return 1;
457*4882a593Smuzhiyun }
458*4882a593Smuzhiyun
randomize_type(tree type)459*4882a593Smuzhiyun static void randomize_type(tree type)
460*4882a593Smuzhiyun {
461*4882a593Smuzhiyun tree variant;
462*4882a593Smuzhiyun
463*4882a593Smuzhiyun gcc_assert(TREE_CODE(type) == RECORD_TYPE);
464*4882a593Smuzhiyun
465*4882a593Smuzhiyun if (lookup_attribute("randomize_considered", TYPE_ATTRIBUTES(type)))
466*4882a593Smuzhiyun return;
467*4882a593Smuzhiyun
468*4882a593Smuzhiyun if (lookup_attribute("randomize_layout", TYPE_ATTRIBUTES(TYPE_MAIN_VARIANT(type))) || is_pure_ops_struct(type))
469*4882a593Smuzhiyun relayout_struct(type);
470*4882a593Smuzhiyun
471*4882a593Smuzhiyun for (variant = TYPE_MAIN_VARIANT(type); variant; variant = TYPE_NEXT_VARIANT(variant)) {
472*4882a593Smuzhiyun TYPE_ATTRIBUTES(type) = copy_list(TYPE_ATTRIBUTES(type));
473*4882a593Smuzhiyun TYPE_ATTRIBUTES(type) = tree_cons(get_identifier("randomize_considered"), NULL_TREE, TYPE_ATTRIBUTES(type));
474*4882a593Smuzhiyun }
475*4882a593Smuzhiyun #ifdef __DEBUG_PLUGIN
476*4882a593Smuzhiyun fprintf(stderr, "Marking randomize_considered on struct %s\n", ORIG_TYPE_NAME(type));
477*4882a593Smuzhiyun #ifdef __DEBUG_VERBOSE
478*4882a593Smuzhiyun debug_tree(type);
479*4882a593Smuzhiyun #endif
480*4882a593Smuzhiyun #endif
481*4882a593Smuzhiyun }
482*4882a593Smuzhiyun
update_decl_size(tree decl)483*4882a593Smuzhiyun static void update_decl_size(tree decl)
484*4882a593Smuzhiyun {
485*4882a593Smuzhiyun tree lastval, lastidx, field, init, type, flexsize;
486*4882a593Smuzhiyun unsigned HOST_WIDE_INT len;
487*4882a593Smuzhiyun
488*4882a593Smuzhiyun type = TREE_TYPE(decl);
489*4882a593Smuzhiyun
490*4882a593Smuzhiyun if (!lookup_attribute("has_flexarray", TYPE_ATTRIBUTES(type)))
491*4882a593Smuzhiyun return;
492*4882a593Smuzhiyun
493*4882a593Smuzhiyun init = DECL_INITIAL(decl);
494*4882a593Smuzhiyun if (init == NULL_TREE || init == error_mark_node)
495*4882a593Smuzhiyun return;
496*4882a593Smuzhiyun
497*4882a593Smuzhiyun if (TREE_CODE(init) != CONSTRUCTOR)
498*4882a593Smuzhiyun return;
499*4882a593Smuzhiyun
500*4882a593Smuzhiyun len = CONSTRUCTOR_NELTS(init);
501*4882a593Smuzhiyun if (!len)
502*4882a593Smuzhiyun return;
503*4882a593Smuzhiyun
504*4882a593Smuzhiyun lastval = CONSTRUCTOR_ELT(init, CONSTRUCTOR_NELTS(init) - 1)->value;
505*4882a593Smuzhiyun lastidx = CONSTRUCTOR_ELT(init, CONSTRUCTOR_NELTS(init) - 1)->index;
506*4882a593Smuzhiyun
507*4882a593Smuzhiyun for (field = TYPE_FIELDS(TREE_TYPE(decl)); TREE_CHAIN(field); field = TREE_CHAIN(field))
508*4882a593Smuzhiyun ;
509*4882a593Smuzhiyun
510*4882a593Smuzhiyun if (lastidx != field)
511*4882a593Smuzhiyun return;
512*4882a593Smuzhiyun
513*4882a593Smuzhiyun if (TREE_CODE(lastval) != STRING_CST) {
514*4882a593Smuzhiyun error("Only string constants are supported as initializers "
515*4882a593Smuzhiyun "for randomized structures with flexible arrays");
516*4882a593Smuzhiyun return;
517*4882a593Smuzhiyun }
518*4882a593Smuzhiyun
519*4882a593Smuzhiyun flexsize = bitsize_int(TREE_STRING_LENGTH(lastval) *
520*4882a593Smuzhiyun tree_to_uhwi(TYPE_SIZE(TREE_TYPE(TREE_TYPE(lastval)))));
521*4882a593Smuzhiyun
522*4882a593Smuzhiyun DECL_SIZE(decl) = size_binop(PLUS_EXPR, TYPE_SIZE(type), flexsize);
523*4882a593Smuzhiyun
524*4882a593Smuzhiyun return;
525*4882a593Smuzhiyun }
526*4882a593Smuzhiyun
527*4882a593Smuzhiyun
randomize_layout_finish_decl(void * event_data,void * data)528*4882a593Smuzhiyun static void randomize_layout_finish_decl(void *event_data, void *data)
529*4882a593Smuzhiyun {
530*4882a593Smuzhiyun tree decl = (tree)event_data;
531*4882a593Smuzhiyun tree type;
532*4882a593Smuzhiyun
533*4882a593Smuzhiyun if (decl == NULL_TREE || decl == error_mark_node)
534*4882a593Smuzhiyun return;
535*4882a593Smuzhiyun
536*4882a593Smuzhiyun type = TREE_TYPE(decl);
537*4882a593Smuzhiyun
538*4882a593Smuzhiyun if (TREE_CODE(decl) != VAR_DECL)
539*4882a593Smuzhiyun return;
540*4882a593Smuzhiyun
541*4882a593Smuzhiyun if (TREE_CODE(type) != RECORD_TYPE && TREE_CODE(type) != UNION_TYPE)
542*4882a593Smuzhiyun return;
543*4882a593Smuzhiyun
544*4882a593Smuzhiyun if (!lookup_attribute("randomize_performed", TYPE_ATTRIBUTES(type)))
545*4882a593Smuzhiyun return;
546*4882a593Smuzhiyun
547*4882a593Smuzhiyun DECL_SIZE(decl) = 0;
548*4882a593Smuzhiyun DECL_SIZE_UNIT(decl) = 0;
549*4882a593Smuzhiyun SET_DECL_ALIGN(decl, 0);
550*4882a593Smuzhiyun SET_DECL_MODE (decl, VOIDmode);
551*4882a593Smuzhiyun SET_DECL_RTL(decl, 0);
552*4882a593Smuzhiyun update_decl_size(decl);
553*4882a593Smuzhiyun layout_decl(decl, 0);
554*4882a593Smuzhiyun }
555*4882a593Smuzhiyun
finish_type(void * event_data,void * data)556*4882a593Smuzhiyun static void finish_type(void *event_data, void *data)
557*4882a593Smuzhiyun {
558*4882a593Smuzhiyun tree type = (tree)event_data;
559*4882a593Smuzhiyun
560*4882a593Smuzhiyun if (type == NULL_TREE || type == error_mark_node)
561*4882a593Smuzhiyun return;
562*4882a593Smuzhiyun
563*4882a593Smuzhiyun if (TREE_CODE(type) != RECORD_TYPE)
564*4882a593Smuzhiyun return;
565*4882a593Smuzhiyun
566*4882a593Smuzhiyun if (TYPE_FIELDS(type) == NULL_TREE)
567*4882a593Smuzhiyun return;
568*4882a593Smuzhiyun
569*4882a593Smuzhiyun if (lookup_attribute("randomize_considered", TYPE_ATTRIBUTES(type)))
570*4882a593Smuzhiyun return;
571*4882a593Smuzhiyun
572*4882a593Smuzhiyun #ifdef __DEBUG_PLUGIN
573*4882a593Smuzhiyun fprintf(stderr, "Calling randomize_type on %s\n", ORIG_TYPE_NAME(type));
574*4882a593Smuzhiyun #endif
575*4882a593Smuzhiyun #ifdef __DEBUG_VERBOSE
576*4882a593Smuzhiyun debug_tree(type);
577*4882a593Smuzhiyun #endif
578*4882a593Smuzhiyun randomize_type(type);
579*4882a593Smuzhiyun
580*4882a593Smuzhiyun return;
581*4882a593Smuzhiyun }
582*4882a593Smuzhiyun
583*4882a593Smuzhiyun static struct attribute_spec randomize_layout_attr = { };
584*4882a593Smuzhiyun static struct attribute_spec no_randomize_layout_attr = { };
585*4882a593Smuzhiyun static struct attribute_spec randomize_considered_attr = { };
586*4882a593Smuzhiyun static struct attribute_spec randomize_performed_attr = { };
587*4882a593Smuzhiyun
register_attributes(void * event_data,void * data)588*4882a593Smuzhiyun static void register_attributes(void *event_data, void *data)
589*4882a593Smuzhiyun {
590*4882a593Smuzhiyun randomize_layout_attr.name = "randomize_layout";
591*4882a593Smuzhiyun randomize_layout_attr.type_required = true;
592*4882a593Smuzhiyun randomize_layout_attr.handler = handle_randomize_layout_attr;
593*4882a593Smuzhiyun #if BUILDING_GCC_VERSION >= 4007
594*4882a593Smuzhiyun randomize_layout_attr.affects_type_identity = true;
595*4882a593Smuzhiyun #endif
596*4882a593Smuzhiyun
597*4882a593Smuzhiyun no_randomize_layout_attr.name = "no_randomize_layout";
598*4882a593Smuzhiyun no_randomize_layout_attr.type_required = true;
599*4882a593Smuzhiyun no_randomize_layout_attr.handler = handle_randomize_layout_attr;
600*4882a593Smuzhiyun #if BUILDING_GCC_VERSION >= 4007
601*4882a593Smuzhiyun no_randomize_layout_attr.affects_type_identity = true;
602*4882a593Smuzhiyun #endif
603*4882a593Smuzhiyun
604*4882a593Smuzhiyun randomize_considered_attr.name = "randomize_considered";
605*4882a593Smuzhiyun randomize_considered_attr.type_required = true;
606*4882a593Smuzhiyun randomize_considered_attr.handler = handle_randomize_considered_attr;
607*4882a593Smuzhiyun
608*4882a593Smuzhiyun randomize_performed_attr.name = "randomize_performed";
609*4882a593Smuzhiyun randomize_performed_attr.type_required = true;
610*4882a593Smuzhiyun randomize_performed_attr.handler = handle_randomize_performed_attr;
611*4882a593Smuzhiyun
612*4882a593Smuzhiyun register_attribute(&randomize_layout_attr);
613*4882a593Smuzhiyun register_attribute(&no_randomize_layout_attr);
614*4882a593Smuzhiyun register_attribute(&randomize_considered_attr);
615*4882a593Smuzhiyun register_attribute(&randomize_performed_attr);
616*4882a593Smuzhiyun }
617*4882a593Smuzhiyun
check_bad_casts_in_constructor(tree var,tree init)618*4882a593Smuzhiyun static void check_bad_casts_in_constructor(tree var, tree init)
619*4882a593Smuzhiyun {
620*4882a593Smuzhiyun unsigned HOST_WIDE_INT idx;
621*4882a593Smuzhiyun tree field, val;
622*4882a593Smuzhiyun tree field_type, val_type;
623*4882a593Smuzhiyun
624*4882a593Smuzhiyun FOR_EACH_CONSTRUCTOR_ELT(CONSTRUCTOR_ELTS(init), idx, field, val) {
625*4882a593Smuzhiyun if (TREE_CODE(val) == CONSTRUCTOR) {
626*4882a593Smuzhiyun check_bad_casts_in_constructor(var, val);
627*4882a593Smuzhiyun continue;
628*4882a593Smuzhiyun }
629*4882a593Smuzhiyun
630*4882a593Smuzhiyun /* pipacs' plugin creates franken-arrays that differ from those produced by
631*4882a593Smuzhiyun normal code which all have valid 'field' trees. work around this */
632*4882a593Smuzhiyun if (field == NULL_TREE)
633*4882a593Smuzhiyun continue;
634*4882a593Smuzhiyun field_type = TREE_TYPE(field);
635*4882a593Smuzhiyun val_type = TREE_TYPE(val);
636*4882a593Smuzhiyun
637*4882a593Smuzhiyun if (TREE_CODE(field_type) != POINTER_TYPE || TREE_CODE(val_type) != POINTER_TYPE)
638*4882a593Smuzhiyun continue;
639*4882a593Smuzhiyun
640*4882a593Smuzhiyun if (field_type == val_type)
641*4882a593Smuzhiyun continue;
642*4882a593Smuzhiyun
643*4882a593Smuzhiyun field_type = TYPE_MAIN_VARIANT(strip_array_types(TYPE_MAIN_VARIANT(TREE_TYPE(field_type))));
644*4882a593Smuzhiyun val_type = TYPE_MAIN_VARIANT(strip_array_types(TYPE_MAIN_VARIANT(TREE_TYPE(val_type))));
645*4882a593Smuzhiyun
646*4882a593Smuzhiyun if (field_type == void_type_node)
647*4882a593Smuzhiyun continue;
648*4882a593Smuzhiyun if (field_type == val_type)
649*4882a593Smuzhiyun continue;
650*4882a593Smuzhiyun if (TREE_CODE(val_type) != RECORD_TYPE)
651*4882a593Smuzhiyun continue;
652*4882a593Smuzhiyun
653*4882a593Smuzhiyun if (!lookup_attribute("randomize_performed", TYPE_ATTRIBUTES(val_type)))
654*4882a593Smuzhiyun continue;
655*4882a593Smuzhiyun MISMATCH(DECL_SOURCE_LOCATION(var), "constructor\n", TYPE_MAIN_VARIANT(field_type), TYPE_MAIN_VARIANT(val_type));
656*4882a593Smuzhiyun }
657*4882a593Smuzhiyun }
658*4882a593Smuzhiyun
659*4882a593Smuzhiyun /* derived from the constify plugin */
check_global_variables(void * event_data,void * data)660*4882a593Smuzhiyun static void check_global_variables(void *event_data, void *data)
661*4882a593Smuzhiyun {
662*4882a593Smuzhiyun struct varpool_node *node;
663*4882a593Smuzhiyun tree init;
664*4882a593Smuzhiyun
665*4882a593Smuzhiyun FOR_EACH_VARIABLE(node) {
666*4882a593Smuzhiyun tree var = NODE_DECL(node);
667*4882a593Smuzhiyun init = DECL_INITIAL(var);
668*4882a593Smuzhiyun if (init == NULL_TREE)
669*4882a593Smuzhiyun continue;
670*4882a593Smuzhiyun
671*4882a593Smuzhiyun if (TREE_CODE(init) != CONSTRUCTOR)
672*4882a593Smuzhiyun continue;
673*4882a593Smuzhiyun
674*4882a593Smuzhiyun check_bad_casts_in_constructor(var, init);
675*4882a593Smuzhiyun }
676*4882a593Smuzhiyun }
677*4882a593Smuzhiyun
dominated_by_is_err(const_tree rhs,basic_block bb)678*4882a593Smuzhiyun static bool dominated_by_is_err(const_tree rhs, basic_block bb)
679*4882a593Smuzhiyun {
680*4882a593Smuzhiyun basic_block dom;
681*4882a593Smuzhiyun gimple dom_stmt;
682*4882a593Smuzhiyun gimple call_stmt;
683*4882a593Smuzhiyun const_tree dom_lhs;
684*4882a593Smuzhiyun const_tree poss_is_err_cond;
685*4882a593Smuzhiyun const_tree poss_is_err_func;
686*4882a593Smuzhiyun const_tree is_err_arg;
687*4882a593Smuzhiyun
688*4882a593Smuzhiyun dom = get_immediate_dominator(CDI_DOMINATORS, bb);
689*4882a593Smuzhiyun if (!dom)
690*4882a593Smuzhiyun return false;
691*4882a593Smuzhiyun
692*4882a593Smuzhiyun dom_stmt = last_stmt(dom);
693*4882a593Smuzhiyun if (!dom_stmt)
694*4882a593Smuzhiyun return false;
695*4882a593Smuzhiyun
696*4882a593Smuzhiyun if (gimple_code(dom_stmt) != GIMPLE_COND)
697*4882a593Smuzhiyun return false;
698*4882a593Smuzhiyun
699*4882a593Smuzhiyun if (gimple_cond_code(dom_stmt) != NE_EXPR)
700*4882a593Smuzhiyun return false;
701*4882a593Smuzhiyun
702*4882a593Smuzhiyun if (!integer_zerop(gimple_cond_rhs(dom_stmt)))
703*4882a593Smuzhiyun return false;
704*4882a593Smuzhiyun
705*4882a593Smuzhiyun poss_is_err_cond = gimple_cond_lhs(dom_stmt);
706*4882a593Smuzhiyun
707*4882a593Smuzhiyun if (TREE_CODE(poss_is_err_cond) != SSA_NAME)
708*4882a593Smuzhiyun return false;
709*4882a593Smuzhiyun
710*4882a593Smuzhiyun call_stmt = SSA_NAME_DEF_STMT(poss_is_err_cond);
711*4882a593Smuzhiyun
712*4882a593Smuzhiyun if (gimple_code(call_stmt) != GIMPLE_CALL)
713*4882a593Smuzhiyun return false;
714*4882a593Smuzhiyun
715*4882a593Smuzhiyun dom_lhs = gimple_get_lhs(call_stmt);
716*4882a593Smuzhiyun poss_is_err_func = gimple_call_fndecl(call_stmt);
717*4882a593Smuzhiyun if (!poss_is_err_func)
718*4882a593Smuzhiyun return false;
719*4882a593Smuzhiyun if (dom_lhs != poss_is_err_cond)
720*4882a593Smuzhiyun return false;
721*4882a593Smuzhiyun if (strcmp(DECL_NAME_POINTER(poss_is_err_func), "IS_ERR"))
722*4882a593Smuzhiyun return false;
723*4882a593Smuzhiyun
724*4882a593Smuzhiyun is_err_arg = gimple_call_arg(call_stmt, 0);
725*4882a593Smuzhiyun if (!is_err_arg)
726*4882a593Smuzhiyun return false;
727*4882a593Smuzhiyun
728*4882a593Smuzhiyun if (is_err_arg != rhs)
729*4882a593Smuzhiyun return false;
730*4882a593Smuzhiyun
731*4882a593Smuzhiyun return true;
732*4882a593Smuzhiyun }
733*4882a593Smuzhiyun
handle_local_var_initializers(void)734*4882a593Smuzhiyun static void handle_local_var_initializers(void)
735*4882a593Smuzhiyun {
736*4882a593Smuzhiyun tree var;
737*4882a593Smuzhiyun unsigned int i;
738*4882a593Smuzhiyun
739*4882a593Smuzhiyun FOR_EACH_LOCAL_DECL(cfun, i, var) {
740*4882a593Smuzhiyun tree init = DECL_INITIAL(var);
741*4882a593Smuzhiyun if (!init)
742*4882a593Smuzhiyun continue;
743*4882a593Smuzhiyun if (TREE_CODE(init) != CONSTRUCTOR)
744*4882a593Smuzhiyun continue;
745*4882a593Smuzhiyun check_bad_casts_in_constructor(var, init);
746*4882a593Smuzhiyun }
747*4882a593Smuzhiyun }
748*4882a593Smuzhiyun
type_name_eq(gimple stmt,const_tree type_tree,const char * wanted_name)749*4882a593Smuzhiyun static bool type_name_eq(gimple stmt, const_tree type_tree, const char *wanted_name)
750*4882a593Smuzhiyun {
751*4882a593Smuzhiyun const char *type_name;
752*4882a593Smuzhiyun
753*4882a593Smuzhiyun if (type_tree == NULL_TREE)
754*4882a593Smuzhiyun return false;
755*4882a593Smuzhiyun
756*4882a593Smuzhiyun switch (TREE_CODE(type_tree)) {
757*4882a593Smuzhiyun case RECORD_TYPE:
758*4882a593Smuzhiyun type_name = TYPE_NAME_POINTER(type_tree);
759*4882a593Smuzhiyun break;
760*4882a593Smuzhiyun case INTEGER_TYPE:
761*4882a593Smuzhiyun if (TYPE_PRECISION(type_tree) == CHAR_TYPE_SIZE)
762*4882a593Smuzhiyun type_name = "char";
763*4882a593Smuzhiyun else {
764*4882a593Smuzhiyun INFORM(gimple_location(stmt), "found non-char INTEGER_TYPE cast comparison: %qT\n", type_tree);
765*4882a593Smuzhiyun debug_tree(type_tree);
766*4882a593Smuzhiyun return false;
767*4882a593Smuzhiyun }
768*4882a593Smuzhiyun break;
769*4882a593Smuzhiyun case POINTER_TYPE:
770*4882a593Smuzhiyun if (TREE_CODE(TREE_TYPE(type_tree)) == VOID_TYPE) {
771*4882a593Smuzhiyun type_name = "void *";
772*4882a593Smuzhiyun break;
773*4882a593Smuzhiyun } else {
774*4882a593Smuzhiyun INFORM(gimple_location(stmt), "found non-void POINTER_TYPE cast comparison %qT\n", type_tree);
775*4882a593Smuzhiyun debug_tree(type_tree);
776*4882a593Smuzhiyun return false;
777*4882a593Smuzhiyun }
778*4882a593Smuzhiyun default:
779*4882a593Smuzhiyun INFORM(gimple_location(stmt), "unhandled cast comparison: %qT\n", type_tree);
780*4882a593Smuzhiyun debug_tree(type_tree);
781*4882a593Smuzhiyun return false;
782*4882a593Smuzhiyun }
783*4882a593Smuzhiyun
784*4882a593Smuzhiyun return strcmp(type_name, wanted_name) == 0;
785*4882a593Smuzhiyun }
786*4882a593Smuzhiyun
whitelisted_cast(gimple stmt,const_tree lhs_tree,const_tree rhs_tree)787*4882a593Smuzhiyun static bool whitelisted_cast(gimple stmt, const_tree lhs_tree, const_tree rhs_tree)
788*4882a593Smuzhiyun {
789*4882a593Smuzhiyun const struct whitelist_entry *entry;
790*4882a593Smuzhiyun expanded_location xloc = expand_location(gimple_location(stmt));
791*4882a593Smuzhiyun
792*4882a593Smuzhiyun for (entry = whitelist; entry->pathname; entry++) {
793*4882a593Smuzhiyun if (!strstr(xloc.file, entry->pathname))
794*4882a593Smuzhiyun continue;
795*4882a593Smuzhiyun
796*4882a593Smuzhiyun if (type_name_eq(stmt, lhs_tree, entry->lhs) && type_name_eq(stmt, rhs_tree, entry->rhs))
797*4882a593Smuzhiyun return true;
798*4882a593Smuzhiyun }
799*4882a593Smuzhiyun
800*4882a593Smuzhiyun return false;
801*4882a593Smuzhiyun }
802*4882a593Smuzhiyun
803*4882a593Smuzhiyun /*
804*4882a593Smuzhiyun * iterate over all statements to find "bad" casts:
805*4882a593Smuzhiyun * those where the address of the start of a structure is cast
806*4882a593Smuzhiyun * to a pointer of a structure of a different type, or a
807*4882a593Smuzhiyun * structure pointer type is cast to a different structure pointer type
808*4882a593Smuzhiyun */
find_bad_casts_execute(void)809*4882a593Smuzhiyun static unsigned int find_bad_casts_execute(void)
810*4882a593Smuzhiyun {
811*4882a593Smuzhiyun basic_block bb;
812*4882a593Smuzhiyun
813*4882a593Smuzhiyun handle_local_var_initializers();
814*4882a593Smuzhiyun
815*4882a593Smuzhiyun FOR_EACH_BB_FN(bb, cfun) {
816*4882a593Smuzhiyun gimple_stmt_iterator gsi;
817*4882a593Smuzhiyun
818*4882a593Smuzhiyun for (gsi = gsi_start_bb(bb); !gsi_end_p(gsi); gsi_next(&gsi)) {
819*4882a593Smuzhiyun gimple stmt;
820*4882a593Smuzhiyun const_tree lhs;
821*4882a593Smuzhiyun const_tree lhs_type;
822*4882a593Smuzhiyun const_tree rhs1;
823*4882a593Smuzhiyun const_tree rhs_type;
824*4882a593Smuzhiyun const_tree ptr_lhs_type;
825*4882a593Smuzhiyun const_tree ptr_rhs_type;
826*4882a593Smuzhiyun const_tree op0;
827*4882a593Smuzhiyun const_tree op0_type;
828*4882a593Smuzhiyun enum tree_code rhs_code;
829*4882a593Smuzhiyun
830*4882a593Smuzhiyun stmt = gsi_stmt(gsi);
831*4882a593Smuzhiyun
832*4882a593Smuzhiyun #ifdef __DEBUG_PLUGIN
833*4882a593Smuzhiyun #ifdef __DEBUG_VERBOSE
834*4882a593Smuzhiyun debug_gimple_stmt(stmt);
835*4882a593Smuzhiyun debug_tree(gimple_get_lhs(stmt));
836*4882a593Smuzhiyun #endif
837*4882a593Smuzhiyun #endif
838*4882a593Smuzhiyun
839*4882a593Smuzhiyun if (gimple_code(stmt) != GIMPLE_ASSIGN)
840*4882a593Smuzhiyun continue;
841*4882a593Smuzhiyun
842*4882a593Smuzhiyun #ifdef __DEBUG_PLUGIN
843*4882a593Smuzhiyun #ifdef __DEBUG_VERBOSE
844*4882a593Smuzhiyun debug_tree(gimple_assign_rhs1(stmt));
845*4882a593Smuzhiyun #endif
846*4882a593Smuzhiyun #endif
847*4882a593Smuzhiyun
848*4882a593Smuzhiyun
849*4882a593Smuzhiyun rhs_code = gimple_assign_rhs_code(stmt);
850*4882a593Smuzhiyun
851*4882a593Smuzhiyun if (rhs_code != ADDR_EXPR && rhs_code != SSA_NAME)
852*4882a593Smuzhiyun continue;
853*4882a593Smuzhiyun
854*4882a593Smuzhiyun lhs = gimple_get_lhs(stmt);
855*4882a593Smuzhiyun lhs_type = TREE_TYPE(lhs);
856*4882a593Smuzhiyun rhs1 = gimple_assign_rhs1(stmt);
857*4882a593Smuzhiyun rhs_type = TREE_TYPE(rhs1);
858*4882a593Smuzhiyun
859*4882a593Smuzhiyun if (TREE_CODE(rhs_type) != POINTER_TYPE ||
860*4882a593Smuzhiyun TREE_CODE(lhs_type) != POINTER_TYPE)
861*4882a593Smuzhiyun continue;
862*4882a593Smuzhiyun
863*4882a593Smuzhiyun ptr_lhs_type = TYPE_MAIN_VARIANT(strip_array_types(TYPE_MAIN_VARIANT(TREE_TYPE(lhs_type))));
864*4882a593Smuzhiyun ptr_rhs_type = TYPE_MAIN_VARIANT(strip_array_types(TYPE_MAIN_VARIANT(TREE_TYPE(rhs_type))));
865*4882a593Smuzhiyun
866*4882a593Smuzhiyun if (ptr_rhs_type == void_type_node)
867*4882a593Smuzhiyun continue;
868*4882a593Smuzhiyun
869*4882a593Smuzhiyun if (ptr_lhs_type == void_type_node)
870*4882a593Smuzhiyun continue;
871*4882a593Smuzhiyun
872*4882a593Smuzhiyun if (dominated_by_is_err(rhs1, bb))
873*4882a593Smuzhiyun continue;
874*4882a593Smuzhiyun
875*4882a593Smuzhiyun if (TREE_CODE(ptr_rhs_type) != RECORD_TYPE) {
876*4882a593Smuzhiyun #ifndef __DEBUG_PLUGIN
877*4882a593Smuzhiyun if (lookup_attribute("randomize_performed", TYPE_ATTRIBUTES(ptr_lhs_type)))
878*4882a593Smuzhiyun #endif
879*4882a593Smuzhiyun {
880*4882a593Smuzhiyun if (!whitelisted_cast(stmt, ptr_lhs_type, ptr_rhs_type))
881*4882a593Smuzhiyun MISMATCH(gimple_location(stmt), "rhs", ptr_lhs_type, ptr_rhs_type);
882*4882a593Smuzhiyun }
883*4882a593Smuzhiyun continue;
884*4882a593Smuzhiyun }
885*4882a593Smuzhiyun
886*4882a593Smuzhiyun if (rhs_code == SSA_NAME && ptr_lhs_type == ptr_rhs_type)
887*4882a593Smuzhiyun continue;
888*4882a593Smuzhiyun
889*4882a593Smuzhiyun if (rhs_code == ADDR_EXPR) {
890*4882a593Smuzhiyun op0 = TREE_OPERAND(rhs1, 0);
891*4882a593Smuzhiyun
892*4882a593Smuzhiyun if (op0 == NULL_TREE)
893*4882a593Smuzhiyun continue;
894*4882a593Smuzhiyun
895*4882a593Smuzhiyun if (TREE_CODE(op0) != VAR_DECL)
896*4882a593Smuzhiyun continue;
897*4882a593Smuzhiyun
898*4882a593Smuzhiyun op0_type = TYPE_MAIN_VARIANT(strip_array_types(TYPE_MAIN_VARIANT(TREE_TYPE(op0))));
899*4882a593Smuzhiyun if (op0_type == ptr_lhs_type)
900*4882a593Smuzhiyun continue;
901*4882a593Smuzhiyun
902*4882a593Smuzhiyun #ifndef __DEBUG_PLUGIN
903*4882a593Smuzhiyun if (lookup_attribute("randomize_performed", TYPE_ATTRIBUTES(op0_type)))
904*4882a593Smuzhiyun #endif
905*4882a593Smuzhiyun {
906*4882a593Smuzhiyun if (!whitelisted_cast(stmt, ptr_lhs_type, op0_type))
907*4882a593Smuzhiyun MISMATCH(gimple_location(stmt), "op0", ptr_lhs_type, op0_type);
908*4882a593Smuzhiyun }
909*4882a593Smuzhiyun } else {
910*4882a593Smuzhiyun const_tree ssa_name_var = SSA_NAME_VAR(rhs1);
911*4882a593Smuzhiyun /* skip bogus type casts introduced by container_of */
912*4882a593Smuzhiyun if (ssa_name_var != NULL_TREE && DECL_NAME(ssa_name_var) &&
913*4882a593Smuzhiyun !strcmp((const char *)DECL_NAME_POINTER(ssa_name_var), "__mptr"))
914*4882a593Smuzhiyun continue;
915*4882a593Smuzhiyun #ifndef __DEBUG_PLUGIN
916*4882a593Smuzhiyun if (lookup_attribute("randomize_performed", TYPE_ATTRIBUTES(ptr_rhs_type)))
917*4882a593Smuzhiyun #endif
918*4882a593Smuzhiyun {
919*4882a593Smuzhiyun if (!whitelisted_cast(stmt, ptr_lhs_type, ptr_rhs_type))
920*4882a593Smuzhiyun MISMATCH(gimple_location(stmt), "ssa", ptr_lhs_type, ptr_rhs_type);
921*4882a593Smuzhiyun }
922*4882a593Smuzhiyun }
923*4882a593Smuzhiyun
924*4882a593Smuzhiyun }
925*4882a593Smuzhiyun }
926*4882a593Smuzhiyun return 0;
927*4882a593Smuzhiyun }
928*4882a593Smuzhiyun
929*4882a593Smuzhiyun #define PASS_NAME find_bad_casts
930*4882a593Smuzhiyun #define NO_GATE
931*4882a593Smuzhiyun #define TODO_FLAGS_FINISH TODO_dump_func
932*4882a593Smuzhiyun #include "gcc-generate-gimple-pass.h"
933*4882a593Smuzhiyun
plugin_init(struct plugin_name_args * plugin_info,struct plugin_gcc_version * version)934*4882a593Smuzhiyun __visible int plugin_init(struct plugin_name_args *plugin_info, struct plugin_gcc_version *version)
935*4882a593Smuzhiyun {
936*4882a593Smuzhiyun int i;
937*4882a593Smuzhiyun const char * const plugin_name = plugin_info->base_name;
938*4882a593Smuzhiyun const int argc = plugin_info->argc;
939*4882a593Smuzhiyun const struct plugin_argument * const argv = plugin_info->argv;
940*4882a593Smuzhiyun bool enable = true;
941*4882a593Smuzhiyun int obtained_seed = 0;
942*4882a593Smuzhiyun struct register_pass_info find_bad_casts_pass_info;
943*4882a593Smuzhiyun
944*4882a593Smuzhiyun find_bad_casts_pass_info.pass = make_find_bad_casts_pass();
945*4882a593Smuzhiyun find_bad_casts_pass_info.reference_pass_name = "ssa";
946*4882a593Smuzhiyun find_bad_casts_pass_info.ref_pass_instance_number = 1;
947*4882a593Smuzhiyun find_bad_casts_pass_info.pos_op = PASS_POS_INSERT_AFTER;
948*4882a593Smuzhiyun
949*4882a593Smuzhiyun if (!plugin_default_version_check(version, &gcc_version)) {
950*4882a593Smuzhiyun error(G_("incompatible gcc/plugin versions"));
951*4882a593Smuzhiyun return 1;
952*4882a593Smuzhiyun }
953*4882a593Smuzhiyun
954*4882a593Smuzhiyun if (strncmp(lang_hooks.name, "GNU C", 5) && !strncmp(lang_hooks.name, "GNU C+", 6)) {
955*4882a593Smuzhiyun inform(UNKNOWN_LOCATION, G_("%s supports C only, not %s"), plugin_name, lang_hooks.name);
956*4882a593Smuzhiyun enable = false;
957*4882a593Smuzhiyun }
958*4882a593Smuzhiyun
959*4882a593Smuzhiyun for (i = 0; i < argc; ++i) {
960*4882a593Smuzhiyun if (!strcmp(argv[i].key, "disable")) {
961*4882a593Smuzhiyun enable = false;
962*4882a593Smuzhiyun continue;
963*4882a593Smuzhiyun }
964*4882a593Smuzhiyun if (!strcmp(argv[i].key, "performance-mode")) {
965*4882a593Smuzhiyun performance_mode = 1;
966*4882a593Smuzhiyun continue;
967*4882a593Smuzhiyun }
968*4882a593Smuzhiyun error(G_("unknown option '-fplugin-arg-%s-%s'"), plugin_name, argv[i].key);
969*4882a593Smuzhiyun }
970*4882a593Smuzhiyun
971*4882a593Smuzhiyun if (strlen(randstruct_seed) != 64) {
972*4882a593Smuzhiyun error(G_("invalid seed value supplied for %s plugin"), plugin_name);
973*4882a593Smuzhiyun return 1;
974*4882a593Smuzhiyun }
975*4882a593Smuzhiyun obtained_seed = sscanf(randstruct_seed, "%016llx%016llx%016llx%016llx",
976*4882a593Smuzhiyun &shuffle_seed[0], &shuffle_seed[1], &shuffle_seed[2], &shuffle_seed[3]);
977*4882a593Smuzhiyun if (obtained_seed != 4) {
978*4882a593Smuzhiyun error(G_("Invalid seed supplied for %s plugin"), plugin_name);
979*4882a593Smuzhiyun return 1;
980*4882a593Smuzhiyun }
981*4882a593Smuzhiyun
982*4882a593Smuzhiyun register_callback(plugin_name, PLUGIN_INFO, NULL, &randomize_layout_plugin_info);
983*4882a593Smuzhiyun if (enable) {
984*4882a593Smuzhiyun register_callback(plugin_name, PLUGIN_ALL_IPA_PASSES_START, check_global_variables, NULL);
985*4882a593Smuzhiyun register_callback(plugin_name, PLUGIN_PASS_MANAGER_SETUP, NULL, &find_bad_casts_pass_info);
986*4882a593Smuzhiyun register_callback(plugin_name, PLUGIN_FINISH_TYPE, finish_type, NULL);
987*4882a593Smuzhiyun register_callback(plugin_name, PLUGIN_FINISH_DECL, randomize_layout_finish_decl, NULL);
988*4882a593Smuzhiyun }
989*4882a593Smuzhiyun register_callback(plugin_name, PLUGIN_ATTRIBUTES, register_attributes, NULL);
990*4882a593Smuzhiyun
991*4882a593Smuzhiyun return 0;
992*4882a593Smuzhiyun }
993