diff options
author | Ilya Enkovich <enkovich.gnu@gmail.com> | 2015-12-10 16:01:42 +0000 |
---|---|---|
committer | Ilya Enkovich <ienkovich@gcc.gnu.org> | 2015-12-10 16:01:42 +0000 |
commit | 64a948e9c2c34aea10e5a995f9e67bb6325ca7e8 (patch) | |
tree | 933bb83d196ac3eeaa156a457f6a2b08e24ee50a /gcc/tree-chkp.c | |
parent | da8006f341fc2a30d32fe7a1d9d540617ff5f8b6 (diff) | |
download | gcc-64a948e9c2c34aea10e5a995f9e67bb6325ca7e8.zip gcc-64a948e9c2c34aea10e5a995f9e67bb6325ca7e8.tar.gz gcc-64a948e9c2c34aea10e5a995f9e67bb6325ca7e8.tar.bz2 |
tree-chkp.c (chkp_call_returns_bounds_p): Return true for VA_ARG call.
gcc/
* tree-chkp.c (chkp_call_returns_bounds_p): Return true
for VA_ARG call.
(chkp_fixup_inlined_call): New.
* tree-chkp.h (chkp_fixup_inlined_call): New.
* tree-stdarg.c: Include tree-chkp.h.
(expand_ifn_va_arg_1): Fixup bndret calls for removed
VA_ARG calls.
From-SVN: r231525
Diffstat (limited to 'gcc/tree-chkp.c')
-rw-r--r-- | gcc/tree-chkp.c | 69 |
1 files changed, 68 insertions, 1 deletions
diff --git a/gcc/tree-chkp.c b/gcc/tree-chkp.c index 8b6381f..b666e97 100644 --- a/gcc/tree-chkp.c +++ b/gcc/tree-chkp.c @@ -2157,7 +2157,11 @@ static bool chkp_call_returns_bounds_p (gcall *call) { if (gimple_call_internal_p (call)) - return false; + { + if (gimple_call_internal_fn (call) == IFN_VA_ARG) + return true; + return false; + } if (gimple_call_builtin_p (call, BUILT_IN_CHKP_NARROW_PTR_BOUNDS) || chkp_gimple_call_builtin_p (call, BUILT_IN_CHKP_NARROW)) @@ -2490,6 +2494,69 @@ chkp_build_bndstx (tree addr, tree ptr, tree bounds, } } +/* This function is called when call statement + is inlined and therefore we can't use bndret + for its LHS anymore. Function fixes bndret + call using new RHS value if possible. */ +void +chkp_fixup_inlined_call (tree lhs, tree rhs) +{ + tree addr, bounds; + gcall *retbnd, *bndldx; + + if (!BOUNDED_P (lhs)) + return; + + /* Search for retbnd call. */ + retbnd = chkp_retbnd_call_by_val (lhs); + if (!retbnd) + return; + + /* Currently only handle cases when call is replaced + with a memory access. In this case bndret call + may be replaced with bndldx call. Otherwise we + have to search for bounds which may cause wrong + result due to various optimizations applied. */ + switch (TREE_CODE (rhs)) + { + case VAR_DECL: + if (DECL_REGISTER (rhs)) + return; + break; + + case MEM_REF: + break; + + case ARRAY_REF: + case COMPONENT_REF: + addr = get_base_address (rhs); + if (!DECL_P (addr) + && TREE_CODE (addr) != MEM_REF) + return; + if (DECL_P (addr) && DECL_REGISTER (addr)) + return; + break; + + default: + return; + } + + /* Create a new statements sequence with bndldx call. */ + gimple_stmt_iterator gsi = gsi_for_stmt (retbnd); + addr = build_fold_addr_expr (rhs); + chkp_build_bndldx (addr, lhs, &gsi); + bndldx = as_a <gcall *> (gsi_stmt (gsi)); + + /* Remove bndret call. */ + bounds = gimple_call_lhs (retbnd); + gsi = gsi_for_stmt (retbnd); + gsi_remove (&gsi, true); + + /* Link new bndldx call. */ + gimple_call_set_lhs (bndldx, bounds); + update_stmt (bndldx); +} + /* Compute bounds for pointer NODE which was assigned in assignment statement ASSIGN. Return computed bounds. */ static tree |