2 * Copyright 2014-2016 by Open Source Security, Inc., Brad Spengler <spender@grsecurity.net>
3 * and PaX Team <pageexec@freemail.hu>
4 * Licensed under the GPL v2
6 * Note: the choice of the license means that the compilation process is
7 * NOT 'eligible' as defined by gcc's library exception to the GPL v3,
8 * but for the kernel it doesn't matter since it doesn't link against
9 * any of the gcc libraries
12 * $ # for 4.5/4.6/C based 4.7
13 * $ 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 * $ # for C++ based 4.7/4.8+
15 * $ 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 * $ gcc -fplugin=./randomize_layout_plugin.so test.c -O2
19 #include "gcc-common.h"
20 #include "randomize_layout_seed.h"
22 #if BUILDING_GCC_MAJOR < 4 || (BUILDING_GCC_MAJOR == 4 && BUILDING_GCC_MINOR < 7)
23 #error "The RANDSTRUCT plugin requires GCC 4.7 or newer."
26 #define ORIG_TYPE_NAME(node) \
27 (TYPE_NAME(TYPE_MAIN_VARIANT(node)) != NULL_TREE ? ((const unsigned char *)IDENTIFIER_POINTER(TYPE_NAME(TYPE_MAIN_VARIANT(node)))) : (const unsigned char *)"anonymous")
29 #define INFORM(loc, msg, ...) inform(loc, "randstruct: " msg, ##__VA_ARGS__)
30 #define MISMATCH(loc, how, ...) INFORM(loc, "casting between randomized structure pointer types (" how "): %qT and %qT\n", __VA_ARGS__)
32 __visible int plugin_is_GPL_compatible;
34 static int performance_mode;
36 static struct plugin_info randomize_layout_plugin_info = {
37 .version = PLUGIN_VERSION,
38 .help = "disable\t\t\tdo not activate plugin\n"
39 "performance-mode\tenable cacheline-aware layout randomization\n"
42 /* from old Linux dcache.h */
43 static inline unsigned long
44 partial_name_hash(unsigned long c, unsigned long prevhash)
46 return (prevhash + (c << 4) + (c >> 4)) * 11;
48 static inline unsigned int
49 name_hash(const unsigned char *name)
51 unsigned long hash = 0;
52 unsigned int len = strlen((const char *)name);
54 hash = partial_name_hash(*name++, hash);
55 return (unsigned int)hash;
58 static tree handle_randomize_layout_attr(tree *node, tree name, tree args, int flags, bool *no_add_attrs)
63 if (TREE_CODE(*node) == FUNCTION_DECL) {
64 error("%qE attribute does not apply to functions (%qF)", name, *node);
68 if (TREE_CODE(*node) == PARM_DECL) {
69 error("%qE attribute does not apply to function parameters (%qD)", name, *node);
73 if (TREE_CODE(*node) == VAR_DECL) {
74 error("%qE attribute does not apply to variables (%qD)", name, *node);
81 gcc_assert(TREE_CODE(*node) == TYPE_DECL);
82 type = TREE_TYPE(*node);
85 if (TREE_CODE(type) != RECORD_TYPE) {
86 error("%qE attribute used on %qT applies to struct types only", name, type);
90 if (lookup_attribute(IDENTIFIER_POINTER(name), TYPE_ATTRIBUTES(type))) {
91 error("%qE attribute is already applied to the type %qT", name, type);
95 *no_add_attrs = false;
100 /* set on complete types that we don't need to inspect further at all */
101 static tree handle_randomize_considered_attr(tree *node, tree name, tree args, int flags, bool *no_add_attrs)
103 *no_add_attrs = false;
108 * set on types that we've performed a shuffle on, to prevent re-shuffling
109 * this does not preclude us from inspecting its fields for potential shuffles
111 static tree handle_randomize_performed_attr(tree *node, tree name, tree args, int flags, bool *no_add_attrs)
113 *no_add_attrs = false;
118 * 64bit variant of Bob Jenkins' public domain PRNG
119 * 256 bits of internal state
122 typedef unsigned long long u64;
124 typedef struct ranctx { u64 a; u64 b; u64 c; u64 d; } ranctx;
126 #define rot(x,k) (((x)<<(k))|((x)>>(64-(k))))
127 static u64 ranval(ranctx *x) {
128 u64 e = x->a - rot(x->b, 7);
129 x->a = x->b ^ rot(x->c, 13);
130 x->b = x->c + rot(x->d, 37);
136 static void raninit(ranctx *x, u64 *seed) {
144 for (i=0; i < 30; ++i)
148 static u64 shuffle_seed[4];
150 struct partition_group {
153 unsigned long length;
156 static void partition_struct(tree *fields, unsigned long length, struct partition_group *size_groups, unsigned long *num_groups)
159 unsigned long accum_size = 0;
160 unsigned long accum_length = 0;
161 unsigned long group_idx = 0;
163 gcc_assert(length < INT_MAX);
165 memset(size_groups, 0, sizeof(struct partition_group) * length);
167 for (i = 0; i < length; i++) {
168 if (size_groups[group_idx].tree_start == NULL_TREE) {
169 size_groups[group_idx].tree_start = fields[i];
170 size_groups[group_idx].start = i;
174 accum_size += (unsigned long)int_size_in_bytes(TREE_TYPE(fields[i]));
176 if (accum_size >= 64) {
177 size_groups[group_idx].length = accum_length;
183 if (size_groups[group_idx].tree_start != NULL_TREE &&
184 !size_groups[group_idx].length) {
185 size_groups[group_idx].length = accum_length;
189 *num_groups = group_idx;
192 static void performance_shuffle(tree *newtree, unsigned long length, ranctx *prng_state)
194 unsigned long i, x, index;
195 struct partition_group size_group[length];
196 unsigned long num_groups = 0;
197 unsigned long randnum;
199 partition_struct(newtree, length, (struct partition_group *)&size_group, &num_groups);
201 /* FIXME: this group shuffle is currently a no-op. */
202 for (i = num_groups - 1; i > 0; i--) {
203 struct partition_group tmp;
204 randnum = ranval(prng_state) % (i + 1);
206 size_group[i] = size_group[randnum];
207 size_group[randnum] = tmp;
210 for (x = 0; x < num_groups; x++) {
211 for (index = size_group[x].length - 1; index > 0; index--) {
214 i = size_group[x].start + index;
215 if (DECL_BIT_FIELD_TYPE(newtree[i]))
217 randnum = ranval(prng_state) % (index + 1);
218 randnum += size_group[x].start;
219 // we could handle this case differently if desired
220 if (DECL_BIT_FIELD_TYPE(newtree[randnum]))
223 newtree[i] = newtree[randnum];
224 newtree[randnum] = tmp;
229 static void full_shuffle(tree *newtree, unsigned long length, ranctx *prng_state)
231 unsigned long i, randnum;
233 for (i = length - 1; i > 0; i--) {
235 randnum = ranval(prng_state) % (i + 1);
237 newtree[i] = newtree[randnum];
238 newtree[randnum] = tmp;
242 /* modern in-place Fisher-Yates shuffle */
243 static void shuffle(const_tree type, tree *newtree, unsigned long length)
248 const unsigned char *structname;
253 gcc_assert(TREE_CODE(type) == RECORD_TYPE);
255 structname = ORIG_TYPE_NAME(type);
257 #ifdef __DEBUG_PLUGIN
258 fprintf(stderr, "Shuffling struct %s %p\n", (const char *)structname, type);
259 #ifdef __DEBUG_VERBOSE
260 debug_tree((tree)type);
264 for (i = 0; i < 4; i++) {
265 seed[i] = shuffle_seed[i];
266 seed[i] ^= name_hash(structname);
269 raninit(&prng_state, (u64 *)&seed);
271 if (performance_mode)
272 performance_shuffle(newtree, length, &prng_state);
274 full_shuffle(newtree, length, &prng_state);
277 static bool is_flexible_array(const_tree field)
279 const_tree fieldtype;
282 fieldtype = TREE_TYPE(field);
283 typesize = TYPE_SIZE(fieldtype);
285 if (TREE_CODE(fieldtype) != ARRAY_TYPE)
288 /* size of type is represented in bits */
290 if (typesize == NULL_TREE && TYPE_DOMAIN(fieldtype) != NULL_TREE &&
291 TYPE_MAX_VALUE(TYPE_DOMAIN(fieldtype)) == NULL_TREE)
297 static int relayout_struct(tree type)
299 unsigned long num_fields = (unsigned long)list_length(TYPE_FIELDS(type));
300 unsigned long shuffle_length = num_fields;
302 tree newtree[num_fields];
307 expanded_location xloc;
308 bool has_flexarray = false;
310 if (TYPE_FIELDS(type) == NULL_TREE)
316 gcc_assert(TREE_CODE(type) == RECORD_TYPE);
318 gcc_assert(num_fields < INT_MAX);
320 if (lookup_attribute("randomize_performed", TYPE_ATTRIBUTES(type)) ||
321 lookup_attribute("no_randomize_layout", TYPE_ATTRIBUTES(TYPE_MAIN_VARIANT(type))))
324 /* Workaround for 3rd-party VirtualBox source that we can't modify ourselves */
325 if (!strcmp((const char *)ORIG_TYPE_NAME(type), "INTNETTRUNKFACTORY") ||
326 !strcmp((const char *)ORIG_TYPE_NAME(type), "RAWPCIFACTORY"))
329 /* throw out any structs in uapi */
330 xloc = expand_location(DECL_SOURCE_LOCATION(TYPE_FIELDS(type)));
332 if (strstr(xloc.file, "/uapi/"))
333 error(G_("attempted to randomize userland API struct %s"), ORIG_TYPE_NAME(type));
335 for (field = TYPE_FIELDS(type), i = 0; field; field = TREE_CHAIN(field), i++) {
336 gcc_assert(TREE_CODE(field) == FIELD_DECL);
341 * enforce that we don't randomize the layout of the last
342 * element of a struct if it's a 0 or 1-length array
343 * or a proper flexible array
345 if (is_flexible_array(newtree[num_fields - 1])) {
346 has_flexarray = true;
350 shuffle(type, (tree *)newtree, shuffle_length);
353 * set up a bogus anonymous struct field designed to error out on unnamed struct initializers
354 * as gcc provides no other way to detect such code
356 list = make_node(FIELD_DECL);
357 TREE_CHAIN(list) = newtree[0];
358 TREE_TYPE(list) = void_type_node;
359 DECL_SIZE(list) = bitsize_zero_node;
360 DECL_NONADDRESSABLE_P(list) = 1;
361 DECL_FIELD_BIT_OFFSET(list) = bitsize_zero_node;
362 DECL_SIZE_UNIT(list) = size_zero_node;
363 DECL_FIELD_OFFSET(list) = size_zero_node;
364 DECL_CONTEXT(list) = type;
365 // to satisfy the constify plugin
366 TREE_READONLY(list) = 1;
368 for (i = 0; i < num_fields - 1; i++)
369 TREE_CHAIN(newtree[i]) = newtree[i+1];
370 TREE_CHAIN(newtree[num_fields - 1]) = NULL_TREE;
372 main_variant = TYPE_MAIN_VARIANT(type);
373 for (variant = main_variant; variant; variant = TYPE_NEXT_VARIANT(variant)) {
374 TYPE_FIELDS(variant) = list;
375 TYPE_ATTRIBUTES(variant) = copy_list(TYPE_ATTRIBUTES(variant));
376 TYPE_ATTRIBUTES(variant) = tree_cons(get_identifier("randomize_performed"), NULL_TREE, TYPE_ATTRIBUTES(variant));
377 TYPE_ATTRIBUTES(variant) = tree_cons(get_identifier("designated_init"), NULL_TREE, TYPE_ATTRIBUTES(variant));
379 TYPE_ATTRIBUTES(type) = tree_cons(get_identifier("has_flexarray"), NULL_TREE, TYPE_ATTRIBUTES(type));
383 * force a re-layout of the main variant
384 * the TYPE_SIZE for all variants will be recomputed
385 * by finalize_type_size()
387 TYPE_SIZE(main_variant) = NULL_TREE;
388 layout_type(main_variant);
389 gcc_assert(TYPE_SIZE(main_variant) != NULL_TREE);
394 /* from constify plugin */
395 static const_tree get_field_type(const_tree field)
397 return strip_array_types(TREE_TYPE(field));
400 /* from constify plugin */
401 static bool is_fptr(const_tree fieldtype)
403 if (TREE_CODE(fieldtype) != POINTER_TYPE)
406 return TREE_CODE(TREE_TYPE(fieldtype)) == FUNCTION_TYPE;
409 /* derived from constify plugin */
410 static int is_pure_ops_struct(const_tree node)
414 gcc_assert(TREE_CODE(node) == RECORD_TYPE || TREE_CODE(node) == UNION_TYPE);
416 for (field = TYPE_FIELDS(node); field; field = TREE_CHAIN(field)) {
417 const_tree fieldtype = get_field_type(field);
418 enum tree_code code = TREE_CODE(fieldtype);
420 if (node == fieldtype)
423 if (code == RECORD_TYPE || code == UNION_TYPE) {
424 if (!is_pure_ops_struct(fieldtype))
429 if (!is_fptr(fieldtype))
436 static void randomize_type(tree type)
440 gcc_assert(TREE_CODE(type) == RECORD_TYPE);
442 if (lookup_attribute("randomize_considered", TYPE_ATTRIBUTES(type)))
445 if (lookup_attribute("randomize_layout", TYPE_ATTRIBUTES(TYPE_MAIN_VARIANT(type))) || is_pure_ops_struct(type))
446 relayout_struct(type);
448 for (variant = TYPE_MAIN_VARIANT(type); variant; variant = TYPE_NEXT_VARIANT(variant)) {
449 TYPE_ATTRIBUTES(type) = copy_list(TYPE_ATTRIBUTES(type));
450 TYPE_ATTRIBUTES(type) = tree_cons(get_identifier("randomize_considered"), NULL_TREE, TYPE_ATTRIBUTES(type));
452 #ifdef __DEBUG_PLUGIN
453 fprintf(stderr, "Marking randomize_considered on struct %s\n", ORIG_TYPE_NAME(type));
454 #ifdef __DEBUG_VERBOSE
460 static void update_decl_size(tree decl)
462 tree lastval, lastidx, field, init, type, flexsize;
463 unsigned HOST_WIDE_INT len;
465 type = TREE_TYPE(decl);
467 if (!lookup_attribute("has_flexarray", TYPE_ATTRIBUTES(type)))
470 init = DECL_INITIAL(decl);
471 if (init == NULL_TREE || init == error_mark_node)
474 if (TREE_CODE(init) != CONSTRUCTOR)
477 len = CONSTRUCTOR_NELTS(init);
481 lastval = CONSTRUCTOR_ELT(init, CONSTRUCTOR_NELTS(init) - 1)->value;
482 lastidx = CONSTRUCTOR_ELT(init, CONSTRUCTOR_NELTS(init) - 1)->index;
484 for (field = TYPE_FIELDS(TREE_TYPE(decl)); TREE_CHAIN(field); field = TREE_CHAIN(field))
487 if (lastidx != field)
490 if (TREE_CODE(lastval) != STRING_CST) {
491 error("Only string constants are supported as initializers "
492 "for randomized structures with flexible arrays");
496 flexsize = bitsize_int(TREE_STRING_LENGTH(lastval) *
497 tree_to_uhwi(TYPE_SIZE(TREE_TYPE(TREE_TYPE(lastval)))));
499 DECL_SIZE(decl) = size_binop(PLUS_EXPR, TYPE_SIZE(type), flexsize);
505 static void randomize_layout_finish_decl(void *event_data, void *data)
507 tree decl = (tree)event_data;
510 if (decl == NULL_TREE || decl == error_mark_node)
513 type = TREE_TYPE(decl);
515 if (TREE_CODE(decl) != VAR_DECL)
518 if (TREE_CODE(type) != RECORD_TYPE && TREE_CODE(type) != UNION_TYPE)
521 if (!lookup_attribute("randomize_performed", TYPE_ATTRIBUTES(type)))
525 DECL_SIZE_UNIT(decl) = 0;
526 SET_DECL_ALIGN(decl, 0);
527 SET_DECL_MODE (decl, VOIDmode);
528 SET_DECL_RTL(decl, 0);
529 update_decl_size(decl);
530 layout_decl(decl, 0);
533 static void finish_type(void *event_data, void *data)
535 tree type = (tree)event_data;
537 if (type == NULL_TREE || type == error_mark_node)
540 if (TREE_CODE(type) != RECORD_TYPE)
543 if (TYPE_FIELDS(type) == NULL_TREE)
546 if (lookup_attribute("randomize_considered", TYPE_ATTRIBUTES(type)))
549 #ifdef __DEBUG_PLUGIN
550 fprintf(stderr, "Calling randomize_type on %s\n", ORIG_TYPE_NAME(type));
552 #ifdef __DEBUG_VERBOSE
555 randomize_type(type);
560 static struct attribute_spec randomize_layout_attr = { };
561 static struct attribute_spec no_randomize_layout_attr = { };
562 static struct attribute_spec randomize_considered_attr = { };
563 static struct attribute_spec randomize_performed_attr = { };
565 static void register_attributes(void *event_data, void *data)
567 randomize_layout_attr.name = "randomize_layout";
568 randomize_layout_attr.type_required = true;
569 randomize_layout_attr.handler = handle_randomize_layout_attr;
570 randomize_layout_attr.affects_type_identity = true;
572 no_randomize_layout_attr.name = "no_randomize_layout";
573 no_randomize_layout_attr.type_required = true;
574 no_randomize_layout_attr.handler = handle_randomize_layout_attr;
575 no_randomize_layout_attr.affects_type_identity = true;
577 randomize_considered_attr.name = "randomize_considered";
578 randomize_considered_attr.type_required = true;
579 randomize_considered_attr.handler = handle_randomize_considered_attr;
581 randomize_performed_attr.name = "randomize_performed";
582 randomize_performed_attr.type_required = true;
583 randomize_performed_attr.handler = handle_randomize_performed_attr;
585 register_attribute(&randomize_layout_attr);
586 register_attribute(&no_randomize_layout_attr);
587 register_attribute(&randomize_considered_attr);
588 register_attribute(&randomize_performed_attr);
591 static void check_bad_casts_in_constructor(tree var, tree init)
593 unsigned HOST_WIDE_INT idx;
595 tree field_type, val_type;
597 FOR_EACH_CONSTRUCTOR_ELT(CONSTRUCTOR_ELTS(init), idx, field, val) {
598 if (TREE_CODE(val) == CONSTRUCTOR) {
599 check_bad_casts_in_constructor(var, val);
603 /* pipacs' plugin creates franken-arrays that differ from those produced by
604 normal code which all have valid 'field' trees. work around this */
605 if (field == NULL_TREE)
607 field_type = TREE_TYPE(field);
608 val_type = TREE_TYPE(val);
610 if (TREE_CODE(field_type) != POINTER_TYPE || TREE_CODE(val_type) != POINTER_TYPE)
613 if (field_type == val_type)
616 field_type = TYPE_MAIN_VARIANT(strip_array_types(TYPE_MAIN_VARIANT(TREE_TYPE(field_type))));
617 val_type = TYPE_MAIN_VARIANT(strip_array_types(TYPE_MAIN_VARIANT(TREE_TYPE(val_type))));
619 if (field_type == void_type_node)
621 if (field_type == val_type)
623 if (TREE_CODE(val_type) != RECORD_TYPE)
626 if (!lookup_attribute("randomize_performed", TYPE_ATTRIBUTES(val_type)))
628 MISMATCH(DECL_SOURCE_LOCATION(var), "constructor\n", TYPE_MAIN_VARIANT(field_type), TYPE_MAIN_VARIANT(val_type));
632 /* derived from the constify plugin */
633 static void check_global_variables(void *event_data, void *data)
635 struct varpool_node *node;
638 FOR_EACH_VARIABLE(node) {
639 tree var = NODE_DECL(node);
640 init = DECL_INITIAL(var);
641 if (init == NULL_TREE)
644 if (TREE_CODE(init) != CONSTRUCTOR)
647 check_bad_casts_in_constructor(var, init);
651 static bool dominated_by_is_err(const_tree rhs, basic_block bb)
657 const_tree poss_is_err_cond;
658 const_tree poss_is_err_func;
659 const_tree is_err_arg;
661 dom = get_immediate_dominator(CDI_DOMINATORS, bb);
665 dom_stmt = last_stmt(dom);
669 if (gimple_code(dom_stmt) != GIMPLE_COND)
672 if (gimple_cond_code(dom_stmt) != NE_EXPR)
675 if (!integer_zerop(gimple_cond_rhs(dom_stmt)))
678 poss_is_err_cond = gimple_cond_lhs(dom_stmt);
680 if (TREE_CODE(poss_is_err_cond) != SSA_NAME)
683 call_stmt = SSA_NAME_DEF_STMT(poss_is_err_cond);
685 if (gimple_code(call_stmt) != GIMPLE_CALL)
688 dom_lhs = gimple_get_lhs(call_stmt);
689 poss_is_err_func = gimple_call_fndecl(call_stmt);
690 if (!poss_is_err_func)
692 if (dom_lhs != poss_is_err_cond)
694 if (strcmp(DECL_NAME_POINTER(poss_is_err_func), "IS_ERR"))
697 is_err_arg = gimple_call_arg(call_stmt, 0);
701 if (is_err_arg != rhs)
707 static void handle_local_var_initializers(void)
712 FOR_EACH_LOCAL_DECL(cfun, i, var) {
713 tree init = DECL_INITIAL(var);
716 if (TREE_CODE(init) != CONSTRUCTOR)
718 check_bad_casts_in_constructor(var, init);
723 * iterate over all statements to find "bad" casts:
724 * those where the address of the start of a structure is cast
725 * to a pointer of a structure of a different type, or a
726 * structure pointer type is cast to a different structure pointer type
728 static unsigned int find_bad_casts_execute(void)
732 handle_local_var_initializers();
734 FOR_EACH_BB_FN(bb, cfun) {
735 gimple_stmt_iterator gsi;
737 for (gsi = gsi_start_bb(bb); !gsi_end_p(gsi); gsi_next(&gsi)) {
743 const_tree ptr_lhs_type;
744 const_tree ptr_rhs_type;
747 enum tree_code rhs_code;
749 stmt = gsi_stmt(gsi);
751 #ifdef __DEBUG_PLUGIN
752 #ifdef __DEBUG_VERBOSE
753 debug_gimple_stmt(stmt);
754 debug_tree(gimple_get_lhs(stmt));
758 if (gimple_code(stmt) != GIMPLE_ASSIGN)
761 #ifdef __DEBUG_PLUGIN
762 #ifdef __DEBUG_VERBOSE
763 debug_tree(gimple_assign_rhs1(stmt));
768 rhs_code = gimple_assign_rhs_code(stmt);
770 if (rhs_code != ADDR_EXPR && rhs_code != SSA_NAME)
773 lhs = gimple_get_lhs(stmt);
774 lhs_type = TREE_TYPE(lhs);
775 rhs1 = gimple_assign_rhs1(stmt);
776 rhs_type = TREE_TYPE(rhs1);
778 if (TREE_CODE(rhs_type) != POINTER_TYPE ||
779 TREE_CODE(lhs_type) != POINTER_TYPE)
782 ptr_lhs_type = TYPE_MAIN_VARIANT(strip_array_types(TYPE_MAIN_VARIANT(TREE_TYPE(lhs_type))));
783 ptr_rhs_type = TYPE_MAIN_VARIANT(strip_array_types(TYPE_MAIN_VARIANT(TREE_TYPE(rhs_type))));
785 if (ptr_rhs_type == void_type_node)
788 if (ptr_lhs_type == void_type_node)
791 if (dominated_by_is_err(rhs1, bb))
794 if (TREE_CODE(ptr_rhs_type) != RECORD_TYPE) {
795 #ifndef __DEBUG_PLUGIN
796 if (lookup_attribute("randomize_performed", TYPE_ATTRIBUTES(ptr_lhs_type)))
798 MISMATCH(gimple_location(stmt), "rhs", ptr_lhs_type, ptr_rhs_type);
802 if (rhs_code == SSA_NAME && ptr_lhs_type == ptr_rhs_type)
805 if (rhs_code == ADDR_EXPR) {
806 op0 = TREE_OPERAND(rhs1, 0);
808 if (op0 == NULL_TREE)
811 if (TREE_CODE(op0) != VAR_DECL)
814 op0_type = TYPE_MAIN_VARIANT(strip_array_types(TYPE_MAIN_VARIANT(TREE_TYPE(op0))));
815 if (op0_type == ptr_lhs_type)
818 #ifndef __DEBUG_PLUGIN
819 if (lookup_attribute("randomize_performed", TYPE_ATTRIBUTES(op0_type)))
821 MISMATCH(gimple_location(stmt), "op0", ptr_lhs_type, op0_type);
823 const_tree ssa_name_var = SSA_NAME_VAR(rhs1);
824 /* skip bogus type casts introduced by container_of */
825 if (ssa_name_var != NULL_TREE && DECL_NAME(ssa_name_var) &&
826 !strcmp((const char *)DECL_NAME_POINTER(ssa_name_var), "__mptr"))
828 #ifndef __DEBUG_PLUGIN
829 if (lookup_attribute("randomize_performed", TYPE_ATTRIBUTES(ptr_rhs_type)))
831 MISMATCH(gimple_location(stmt), "ssa", ptr_lhs_type, ptr_rhs_type);
839 #define PASS_NAME find_bad_casts
841 #define TODO_FLAGS_FINISH TODO_dump_func
842 #include "gcc-generate-gimple-pass.h"
844 __visible int plugin_init(struct plugin_name_args *plugin_info, struct plugin_gcc_version *version)
847 const char * const plugin_name = plugin_info->base_name;
848 const int argc = plugin_info->argc;
849 const struct plugin_argument * const argv = plugin_info->argv;
851 int obtained_seed = 0;
852 struct register_pass_info find_bad_casts_pass_info;
854 find_bad_casts_pass_info.pass = make_find_bad_casts_pass();
855 find_bad_casts_pass_info.reference_pass_name = "ssa";
856 find_bad_casts_pass_info.ref_pass_instance_number = 1;
857 find_bad_casts_pass_info.pos_op = PASS_POS_INSERT_AFTER;
859 if (!plugin_default_version_check(version, &gcc_version)) {
860 error(G_("incompatible gcc/plugin versions"));
864 if (strncmp(lang_hooks.name, "GNU C", 5) && !strncmp(lang_hooks.name, "GNU C+", 6)) {
865 inform(UNKNOWN_LOCATION, G_("%s supports C only, not %s"), plugin_name, lang_hooks.name);
869 for (i = 0; i < argc; ++i) {
870 if (!strcmp(argv[i].key, "disable")) {
874 if (!strcmp(argv[i].key, "performance-mode")) {
875 performance_mode = 1;
878 error(G_("unknown option '-fplugin-arg-%s-%s'"), plugin_name, argv[i].key);
881 if (strlen(randstruct_seed) != 64) {
882 error(G_("invalid seed value supplied for %s plugin"), plugin_name);
885 obtained_seed = sscanf(randstruct_seed, "%016llx%016llx%016llx%016llx",
886 &shuffle_seed[0], &shuffle_seed[1], &shuffle_seed[2], &shuffle_seed[3]);
887 if (obtained_seed != 4) {
888 error(G_("Invalid seed supplied for %s plugin"), plugin_name);
892 register_callback(plugin_name, PLUGIN_INFO, NULL, &randomize_layout_plugin_info);
894 register_callback(plugin_name, PLUGIN_ALL_IPA_PASSES_START, check_global_variables, NULL);
895 register_callback(plugin_name, PLUGIN_PASS_MANAGER_SETUP, NULL, &find_bad_casts_pass_info);
896 register_callback(plugin_name, PLUGIN_FINISH_TYPE, finish_type, NULL);
897 register_callback(plugin_name, PLUGIN_FINISH_DECL, randomize_layout_finish_decl, NULL);
899 register_callback(plugin_name, PLUGIN_ATTRIBUTES, register_attributes, NULL);