public inbox for gcc-patches@gcc.gnu.org
 help / color / mirror / Atom feed
From: Richard Biener <rguenther@suse.de>
To: Jakub Jelinek <jakub@redhat.com>
Cc: Jan Hubicka <jh@suse.cz>, gcc-patches@gcc.gnu.org
Subject: Re: Patch ping
Date: Fri, 28 Jul 2017 07:59:00 -0000	[thread overview]
Message-ID: <alpine.LSU.2.20.1707280959360.10808@zhemvz.fhfr.qr> (raw)
In-Reply-To: <20170727083448.GB2123@tucnak>

On Thu, 27 Jul 2017, Jakub Jelinek wrote:

> On Thu, Jul 27, 2017 at 09:19:34AM +0200, Richard Biener wrote:
> > > I'm building both addresses and subtracting them to get the offset.
> > > I guess the other option is to compute just the address of the base
> > > (i.e. base_addr), and add offset (if non-NULL) plus bitpos / BITS_PER_UNIT
> > > plus offset from the MEM_REF (if any).  In that case it would probably
> > > handle any handled_component_p and bitfields too.
> > 
> > Yes.  Can you try sth along this route?  Should be a matter of
> > adding offset and bitpos / BITS_PER_UNIT (thus rounded down) plus
> > any MEM_REF offset on the base.
> 
> Here it is, bootstrapped/regtested on x86_64-linux and i686-linux, ok for
> trunk?

Ok.

Thanks,
Richard.

> 2017-07-27  Jakub Jelinek  <jakub@redhat.com>
> 
> 	PR sanitizer/80998
> 	* sanopt.c (pass_sanopt::execute): Handle IFN_UBSAN_PTR.
> 	* tree-ssa-alias.c (call_may_clobber_ref_p_1): Likewise.
> 	* flag-types.h (enum sanitize_code): Add SANITIZER_POINTER_OVERFLOW.
> 	Or it into SANITIZER_UNDEFINED.
> 	* ubsan.c: Include gimple-fold.h and varasm.h.
> 	(ubsan_expand_ptr_ifn): New function.
> 	(instrument_pointer_overflow): New function.
> 	(maybe_instrument_pointer_overflow): New function.
> 	(instrument_object_size): Formatting fix.
> 	(pass_ubsan::execute): Call instrument_pointer_overflow
> 	and maybe_instrument_pointer_overflow.
> 	* internal-fn.c (expand_UBSAN_PTR): New function.
> 	* ubsan.h (ubsan_expand_ptr_ifn): Declare.
> 	* sanitizer.def (__ubsan_handle_pointer_overflow,
> 	__ubsan_handle_pointer_overflow_abort): New builtins.
> 	* tree-ssa-tail-merge.c (merge_stmts_p): Handle IFN_UBSAN_PTR.
> 	* internal-fn.def (UBSAN_PTR): New internal function.
> 	* opts.c (sanitizer_opts): Add pointer-overflow.
> 	* lto-streamer-in.c (input_function): Handle IFN_UBSAN_PTR.
> 	* fold-const.c (build_range_check): Compute pointer range check in
> 	integral type if pointer arithmetics would be needed.  Formatting
> 	fixes.
> gcc/testsuite/
> 	* c-c++-common/ubsan/ptr-overflow-1.c: New test.
> 	* c-c++-common/ubsan/ptr-overflow-2.c: New test.
> libsanitizer/
> 	* ubsan/ubsan_handlers.cc: Cherry-pick upstream r304461.
> 	* ubsan/ubsan_checks.inc: Likewise.
> 	* ubsan/ubsan_handlers.h: Likewise.
> 
> --- gcc/sanopt.c.jj	2017-07-04 13:51:47.781815329 +0200
> +++ gcc/sanopt.c	2017-07-26 13:44:13.833204640 +0200
> @@ -1062,6 +1062,9 @@ pass_sanopt::execute (function *fun)
>  		case IFN_UBSAN_OBJECT_SIZE:
>  		  no_next = ubsan_expand_objsize_ifn (&gsi);
>  		  break;
> +		case IFN_UBSAN_PTR:
> +		  no_next = ubsan_expand_ptr_ifn (&gsi);
> +		  break;
>  		case IFN_UBSAN_VPTR:
>  		  no_next = ubsan_expand_vptr_ifn (&gsi);
>  		  break;
> --- gcc/tree-ssa-alias.c.jj	2017-06-19 08:26:17.274597722 +0200
> +++ gcc/tree-ssa-alias.c	2017-07-26 13:44:13.834204628 +0200
> @@ -1991,6 +1991,7 @@ call_may_clobber_ref_p_1 (gcall *call, a
>        case IFN_UBSAN_BOUNDS:
>        case IFN_UBSAN_VPTR:
>        case IFN_UBSAN_OBJECT_SIZE:
> +      case IFN_UBSAN_PTR:
>        case IFN_ASAN_CHECK:
>  	return false;
>        default:
> --- gcc/flag-types.h.jj	2017-06-19 08:26:17.593593662 +0200
> +++ gcc/flag-types.h	2017-07-26 13:44:13.834204628 +0200
> @@ -238,6 +238,7 @@ enum sanitize_code {
>    SANITIZE_OBJECT_SIZE = 1UL << 21,
>    SANITIZE_VPTR = 1UL << 22,
>    SANITIZE_BOUNDS_STRICT = 1UL << 23,
> +  SANITIZE_POINTER_OVERFLOW = 1UL << 24,
>    SANITIZE_SHIFT = SANITIZE_SHIFT_BASE | SANITIZE_SHIFT_EXPONENT,
>    SANITIZE_UNDEFINED = SANITIZE_SHIFT | SANITIZE_DIVIDE | SANITIZE_UNREACHABLE
>  		       | SANITIZE_VLA | SANITIZE_NULL | SANITIZE_RETURN
> @@ -245,7 +246,8 @@ enum sanitize_code {
>  		       | SANITIZE_BOUNDS | SANITIZE_ALIGNMENT
>  		       | SANITIZE_NONNULL_ATTRIBUTE
>  		       | SANITIZE_RETURNS_NONNULL_ATTRIBUTE
> -		       | SANITIZE_OBJECT_SIZE | SANITIZE_VPTR,
> +		       | SANITIZE_OBJECT_SIZE | SANITIZE_VPTR
> +		       | SANITIZE_POINTER_OVERFLOW,
>    SANITIZE_UNDEFINED_NONDEFAULT = SANITIZE_FLOAT_DIVIDE | SANITIZE_FLOAT_CAST
>  				  | SANITIZE_BOUNDS_STRICT
>  };
> --- gcc/ubsan.c.jj	2017-06-30 09:49:32.306609364 +0200
> +++ gcc/ubsan.c	2017-07-26 20:22:34.718284238 +0200
> @@ -45,6 +45,8 @@ along with GCC; see the file COPYING3.
>  #include "builtins.h"
>  #include "tree-object-size.h"
>  #include "tree-cfg.h"
> +#include "gimple-fold.h"
> +#include "varasm.h"
>  
>  /* Map from a tree to a VAR_DECL tree.  */
>  
> @@ -1029,6 +1031,170 @@ ubsan_expand_objsize_ifn (gimple_stmt_it
>    return true;
>  }
>  
> +/* Expand UBSAN_PTR internal call.  */
> +
> +bool
> +ubsan_expand_ptr_ifn (gimple_stmt_iterator *gsip)
> +{
> +  gimple_stmt_iterator gsi = *gsip;
> +  gimple *stmt = gsi_stmt (gsi);
> +  location_t loc = gimple_location (stmt);
> +  gcc_assert (gimple_call_num_args (stmt) == 2);
> +  tree ptr = gimple_call_arg (stmt, 0);
> +  tree off = gimple_call_arg (stmt, 1);
> +
> +  if (integer_zerop (off))
> +    {
> +      gsi_remove (gsip, true);
> +      unlink_stmt_vdef (stmt);
> +      return true;
> +    }
> +
> +  basic_block cur_bb = gsi_bb (gsi);
> +  tree ptrplusoff = make_ssa_name (pointer_sized_int_node);
> +  tree ptri = make_ssa_name (pointer_sized_int_node);
> +  int pos_neg = get_range_pos_neg (off);
> +
> +  /* Split the original block holding the pointer dereference.  */
> +  edge e = split_block (cur_bb, stmt);
> +
> +  /* Get a hold on the 'condition block', the 'then block' and the
> +     'else block'.  */
> +  basic_block cond_bb = e->src;
> +  basic_block fallthru_bb = e->dest;
> +  basic_block then_bb = create_empty_bb (cond_bb);
> +  basic_block cond_pos_bb = NULL, cond_neg_bb = NULL;
> +  add_bb_to_loop (then_bb, cond_bb->loop_father);
> +  loops_state_set (LOOPS_NEED_FIXUP);
> +
> +  /* Set up the fallthrough basic block.  */
> +  e->flags = EDGE_FALSE_VALUE;
> +  if (pos_neg != 3)
> +    {
> +      e->count = cond_bb->count;
> +      e->probability = profile_probability::very_likely ();
> +
> +      /* Connect 'then block' with the 'else block'.  This is needed
> +	 as the ubsan routines we call in the 'then block' are not noreturn.
> +	 The 'then block' only has one outcoming edge.  */
> +      make_single_succ_edge (then_bb, fallthru_bb, EDGE_FALLTHRU);
> +
> +      /* Make an edge coming from the 'cond block' into the 'then block';
> +	 this edge is unlikely taken, so set up the probability
> +	 accordingly.  */
> +      e = make_edge (cond_bb, then_bb, EDGE_TRUE_VALUE);
> +      e->probability = profile_probability::very_unlikely ();
> +    }
> +  else
> +    {
> +      profile_count count = cond_bb->count.apply_probability (PROB_EVEN);
> +      e->count = count;
> +      e->probability = profile_probability::even ();
> +
> +      e = split_block (fallthru_bb, (gimple *) NULL);
> +      cond_neg_bb = e->src;
> +      fallthru_bb = e->dest;
> +      e->count = count;
> +      e->probability = profile_probability::very_likely ();
> +      e->flags = EDGE_FALSE_VALUE;
> +
> +      e = make_edge (cond_neg_bb, then_bb, EDGE_TRUE_VALUE);
> +      e->probability = profile_probability::very_unlikely ();
> +
> +      cond_pos_bb = create_empty_bb (cond_bb);
> +      add_bb_to_loop (cond_pos_bb, cond_bb->loop_father);
> +
> +      e = make_edge (cond_bb, cond_pos_bb, EDGE_TRUE_VALUE);
> +      e->count = count;
> +      e->probability = profile_probability::even ();
> +
> +      e = make_edge (cond_pos_bb, then_bb, EDGE_TRUE_VALUE);
> +      e->probability = profile_probability::very_unlikely ();
> +
> +      e = make_edge (cond_pos_bb, fallthru_bb, EDGE_FALSE_VALUE);
> +      e->count = count;
> +      e->probability = profile_probability::very_likely ();
> +
> +      make_single_succ_edge (then_bb, fallthru_bb, EDGE_FALLTHRU);
> +    }
> +
> +  gimple *g = gimple_build_assign (ptri, NOP_EXPR, ptr);
> +  gimple_set_location (g, loc);
> +  gsi_insert_before (&gsi, g, GSI_SAME_STMT);
> +  g = gimple_build_assign (ptrplusoff, PLUS_EXPR, ptri, off);
> +  gimple_set_location (g, loc);
> +  gsi_insert_before (&gsi, g, GSI_SAME_STMT);
> +
> +  /* Update dominance info for the newly created then_bb; note that
> +     fallthru_bb's dominance info has already been updated by
> +     split_block.  */
> +  if (dom_info_available_p (CDI_DOMINATORS))
> +    {
> +      set_immediate_dominator (CDI_DOMINATORS, then_bb, cond_bb);
> +      if (pos_neg == 3)
> +	{
> +	  set_immediate_dominator (CDI_DOMINATORS, cond_pos_bb, cond_bb);
> +	  set_immediate_dominator (CDI_DOMINATORS, fallthru_bb, cond_bb);
> +	}
> +    }
> +
> +  /* Put the ubsan builtin call into the newly created BB.  */
> +  if (flag_sanitize_undefined_trap_on_error)
> +    g = gimple_build_call (builtin_decl_implicit (BUILT_IN_TRAP), 0);
> +  else
> +    {
> +      enum built_in_function bcode
> +	= (flag_sanitize_recover & SANITIZE_POINTER_OVERFLOW)
> +	  ? BUILT_IN_UBSAN_HANDLE_POINTER_OVERFLOW
> +	  : BUILT_IN_UBSAN_HANDLE_POINTER_OVERFLOW_ABORT;
> +      tree fn = builtin_decl_implicit (bcode);
> +      tree data
> +	= ubsan_create_data ("__ubsan_ptrovf_data", 1, &loc,
> +			     NULL_TREE, NULL_TREE);
> +      data = build_fold_addr_expr_loc (loc, data);
> +      g = gimple_build_call (fn, 3, data, ptr, ptrplusoff);
> +    }
> +  gimple_stmt_iterator gsi2 = gsi_start_bb (then_bb);
> +  gimple_set_location (g, loc);
> +  gsi_insert_after (&gsi2, g, GSI_NEW_STMT);
> +
> +  /* Unlink the UBSAN_PTRs vops before replacing it.  */
> +  unlink_stmt_vdef (stmt);
> +
> +  if (TREE_CODE (off) == INTEGER_CST)
> +    g = gimple_build_cond (wi::neg_p (off) ? LT_EXPR : GE_EXPR, ptri,
> +			   fold_build1 (NEGATE_EXPR, sizetype, off),
> +			   NULL_TREE, NULL_TREE);
> +  else if (pos_neg != 3)
> +    g = gimple_build_cond (pos_neg == 1 ? LT_EXPR : GT_EXPR,
> +			   ptrplusoff, ptri, NULL_TREE, NULL_TREE);
> +  else
> +    {
> +      gsi2 = gsi_start_bb (cond_pos_bb);
> +      g = gimple_build_cond (LT_EXPR, ptrplusoff, ptri, NULL_TREE, NULL_TREE);
> +      gimple_set_location (g, loc);
> +      gsi_insert_after (&gsi2, g, GSI_NEW_STMT);
> +
> +      gsi2 = gsi_start_bb (cond_neg_bb);
> +      g = gimple_build_cond (GT_EXPR, ptrplusoff, ptri, NULL_TREE, NULL_TREE);
> +      gimple_set_location (g, loc);
> +      gsi_insert_after (&gsi2, g, GSI_NEW_STMT);
> +
> +      gimple_seq seq = NULL;
> +      tree t = gimple_build (&seq, loc, NOP_EXPR, ssizetype, off);
> +      t = gimple_build (&seq, loc, GE_EXPR, boolean_type_node,
> +			t, ssize_int (0));
> +      gsi_insert_seq_before (&gsi, seq, GSI_SAME_STMT);
> +      g = gimple_build_cond (NE_EXPR, t, boolean_false_node,
> +			     NULL_TREE, NULL_TREE);
> +    }
> +  gimple_set_location (g, loc);
> +  /* Replace the UBSAN_PTR with a GIMPLE_COND stmt.  */
> +  gsi_replace (&gsi, g, false);
> +  return false;
> +}
> +
> +
>  /* Cached __ubsan_vptr_type_cache decl.  */
>  static GTY(()) tree ubsan_vptr_type_cache_decl;
>  
> @@ -1234,6 +1400,111 @@ instrument_null (gimple_stmt_iterator gs
>      instrument_mem_ref (t, base, &gsi, is_lhs);
>  }
>  
> +/* Instrument pointer arithmetics PTR p+ OFF.  */
> +
> +static void
> +instrument_pointer_overflow (gimple_stmt_iterator *gsi, tree ptr, tree off)
> +{
> +  if (TYPE_PRECISION (sizetype) != POINTER_SIZE)
> +    return;
> +  gcall *g = gimple_build_call_internal (IFN_UBSAN_PTR, 2, ptr, off);
> +  gimple_set_location (g, gimple_location (gsi_stmt (*gsi)));
> +  gsi_insert_before (gsi, g, GSI_SAME_STMT);
> +}
> +
> +/* Instrument pointer arithmetics if any.  */
> +
> +static void
> +maybe_instrument_pointer_overflow (gimple_stmt_iterator *gsi, tree t)
> +{
> +  if (TYPE_PRECISION (sizetype) != POINTER_SIZE)
> +    return;
> +
> +  /* Handle also e.g. &s->i.  */
> +  if (TREE_CODE (t) == ADDR_EXPR)
> +    t = TREE_OPERAND (t, 0);
> +
> +  if (!handled_component_p (t) && TREE_CODE (t) != MEM_REF)
> +    return;
> +
> +  HOST_WIDE_INT bitsize, bitpos, bytepos;
> +  tree offset;
> +  machine_mode mode;
> +  int volatilep = 0, reversep, unsignedp = 0;
> +  tree inner = get_inner_reference (t, &bitsize, &bitpos, &offset, &mode,
> +				    &unsignedp, &reversep, &volatilep);
> +  tree moff = NULL_TREE;
> +
> +  bool decl_p = DECL_P (inner);
> +  tree base;
> +  if (decl_p)
> +    {
> +      if (DECL_REGISTER (inner))
> +	return;
> +      base = inner;
> +      /* If BASE is a fixed size automatic variable or
> +	 global variable defined in the current TU and bitpos
> +	 fits, don't instrument anything.  */
> +      if (offset == NULL_TREE
> +	  && bitpos > 0
> +	  && (VAR_P (base)
> +	      || TREE_CODE (base) == PARM_DECL
> +	      || TREE_CODE (base) == RESULT_DECL)
> +	  && DECL_SIZE (base)
> +	  && TREE_CODE (DECL_SIZE (base)) == INTEGER_CST
> +	  && compare_tree_int (DECL_SIZE (base), bitpos) >= 0
> +	  && (!is_global_var (base) || decl_binds_to_current_def_p (base)))
> +	return;
> +    }
> +  else if (TREE_CODE (inner) == MEM_REF)
> +    {
> +      base = TREE_OPERAND (inner, 0);
> +      if (TREE_CODE (base) == ADDR_EXPR
> +	  && DECL_P (TREE_OPERAND (base, 0))
> +	  && !TREE_ADDRESSABLE (TREE_OPERAND (base, 0))
> +	  && !is_global_var (TREE_OPERAND (base, 0)))
> +	return;
> +      moff = TREE_OPERAND (inner, 1);
> +      if (integer_zerop (moff))
> +	moff = NULL_TREE;
> +    }
> +  else
> +    return;
> +
> +  if (!POINTER_TYPE_P (TREE_TYPE (base)) && !DECL_P (base))
> +    return;
> +  bytepos = bitpos / BITS_PER_UNIT;
> +  if (offset == NULL_TREE && bytepos == 0 && moff == NULL_TREE)
> +    return;
> +
> +  tree base_addr = base;
> +  if (decl_p)
> +    base_addr = build1 (ADDR_EXPR,
> +			build_pointer_type (TREE_TYPE (base)), base);
> +  t = offset;
> +  if (bytepos)
> +    {
> +      if (t)
> +	t = fold_build2 (PLUS_EXPR, TREE_TYPE (t), t,
> +			 build_int_cst (TREE_TYPE (t), bytepos));
> +      else
> +	t = size_int (bytepos);
> +    }
> +  if (moff)
> +    {
> +      if (t)
> +	t = fold_build2 (PLUS_EXPR, TREE_TYPE (t), t,
> +			 fold_convert (TREE_TYPE (t), moff));
> +      else
> +	t = fold_convert (sizetype, moff);
> +    }
> +  t = force_gimple_operand_gsi (gsi, t, true, NULL_TREE, true,
> +				GSI_SAME_STMT);
> +  base_addr = force_gimple_operand_gsi (gsi, base_addr, true, NULL_TREE, true,
> +					GSI_SAME_STMT);
> +  instrument_pointer_overflow (gsi, base_addr, t);
> +}
> +
>  /* Build an ubsan builtin call for the signed-integer-overflow
>     sanitization.  CODE says what kind of builtin are we building,
>     LOC is a location, LHSTYPE is the type of LHS, OP0 and OP1
> @@ -1849,7 +2120,7 @@ instrument_object_size (gimple_stmt_iter
>  	{
>  	  tree rhs1 = gimple_assign_rhs1 (def_stmt);
>  	  if (TREE_CODE (rhs1) == SSA_NAME
> -	    && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (rhs1))
> +	      && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (rhs1))
>  	    break;
>  	  else
>  	    base = rhs1;
> @@ -1973,7 +2244,8 @@ public:
>  				| SANITIZE_ALIGNMENT
>  				| SANITIZE_NONNULL_ATTRIBUTE
>  				| SANITIZE_RETURNS_NONNULL_ATTRIBUTE
> -				| SANITIZE_OBJECT_SIZE));
> +				| SANITIZE_OBJECT_SIZE
> +				| SANITIZE_POINTER_OVERFLOW));
>      }
>  
>    virtual unsigned int execute (function *);
> @@ -2064,6 +2336,32 @@ pass_ubsan::execute (function *fun)
>  		    }
>  		}
>  	    }
> +
> +	  if (sanitize_flags_p (SANITIZE_POINTER_OVERFLOW, fun->decl))
> +	    {
> +	      if (is_gimple_assign (stmt)
> +		  && gimple_assign_rhs_code (stmt) == POINTER_PLUS_EXPR)
> +		instrument_pointer_overflow (&gsi,
> +					     gimple_assign_rhs1 (stmt),
> +					     gimple_assign_rhs2 (stmt));
> +	      if (gimple_store_p (stmt))
> +		maybe_instrument_pointer_overflow (&gsi,
> +						   gimple_get_lhs (stmt));
> +	      if (gimple_assign_single_p (stmt))
> +		maybe_instrument_pointer_overflow (&gsi,
> +						   gimple_assign_rhs1 (stmt));
> +	      if (is_gimple_call (stmt))
> +		{
> +		  unsigned args_num = gimple_call_num_args (stmt);
> +		  for (unsigned i = 0; i < args_num; ++i)
> +		    {
> +		      tree arg = gimple_call_arg (stmt, i);
> +		      if (is_gimple_reg (arg))
> +			continue;
> +		      maybe_instrument_pointer_overflow (&gsi, arg);
> +		    }
> +		}
> +	    }
>  
>  	  gsi_next (&gsi);
>  	}
> --- gcc/internal-fn.c.jj	2017-07-17 10:08:34.923647976 +0200
> +++ gcc/internal-fn.c	2017-07-26 13:44:13.837204592 +0200
> @@ -402,6 +402,14 @@ expand_UBSAN_VPTR (internal_fn, gcall *)
>  /* This should get expanded in the sanopt pass.  */
>  
>  static void
> +expand_UBSAN_PTR (internal_fn, gcall *)
> +{
> +  gcc_unreachable ();
> +}
> +
> +/* This should get expanded in the sanopt pass.  */
> +
> +static void
>  expand_UBSAN_OBJECT_SIZE (internal_fn, gcall *)
>  {
>    gcc_unreachable ();
> --- gcc/ubsan.h.jj	2017-06-20 09:05:22.498654128 +0200
> +++ gcc/ubsan.h	2017-07-26 13:44:13.837204592 +0200
> @@ -52,6 +52,7 @@ enum ubsan_encode_value_phase {
>  extern bool ubsan_expand_bounds_ifn (gimple_stmt_iterator *);
>  extern bool ubsan_expand_null_ifn (gimple_stmt_iterator *);
>  extern bool ubsan_expand_objsize_ifn (gimple_stmt_iterator *);
> +extern bool ubsan_expand_ptr_ifn (gimple_stmt_iterator *);
>  extern bool ubsan_expand_vptr_ifn (gimple_stmt_iterator *);
>  extern bool ubsan_instrument_unreachable (gimple_stmt_iterator *);
>  extern tree ubsan_create_data (const char *, int, const location_t *, ...);
> --- gcc/sanitizer.def.jj	2017-07-06 20:31:32.835082221 +0200
> +++ gcc/sanitizer.def	2017-07-26 13:44:13.837204592 +0200
> @@ -448,6 +448,10 @@ DEF_SANITIZER_BUILTIN(BUILT_IN_UBSAN_HAN
>  		      "__ubsan_handle_load_invalid_value",
>  		      BT_FN_VOID_PTR_PTR,
>  		      ATTR_COLD_NOTHROW_LEAF_LIST)
> +DEF_SANITIZER_BUILTIN(BUILT_IN_UBSAN_HANDLE_POINTER_OVERFLOW,
> +		      "__ubsan_handle_pointer_overflow",
> +		      BT_FN_VOID_PTR_PTR_PTR,
> +		      ATTR_COLD_NOTHROW_LEAF_LIST)
>  DEF_SANITIZER_BUILTIN(BUILT_IN_UBSAN_HANDLE_DIVREM_OVERFLOW_ABORT,
>  		      "__ubsan_handle_divrem_overflow_abort",
>  		      BT_FN_VOID_PTR_PTR_PTR,
> @@ -484,6 +488,10 @@ DEF_SANITIZER_BUILTIN(BUILT_IN_UBSAN_HAN
>  		      "__ubsan_handle_load_invalid_value_abort",
>  		      BT_FN_VOID_PTR_PTR,
>  		      ATTR_COLD_NORETURN_NOTHROW_LEAF_LIST)
> +DEF_SANITIZER_BUILTIN(BUILT_IN_UBSAN_HANDLE_POINTER_OVERFLOW_ABORT,
> +		      "__ubsan_handle_pointer_overflow_abort",
> +		      BT_FN_VOID_PTR_PTR_PTR,
> +		      ATTR_COLD_NORETURN_NOTHROW_LEAF_LIST)
>  DEF_SANITIZER_BUILTIN(BUILT_IN_UBSAN_HANDLE_FLOAT_CAST_OVERFLOW,
>  		      "__ubsan_handle_float_cast_overflow",
>  		      BT_FN_VOID_PTR_PTR,
> --- gcc/tree-ssa-tail-merge.c.jj	2017-07-03 19:03:29.467756294 +0200
> +++ gcc/tree-ssa-tail-merge.c	2017-07-26 13:44:13.838204580 +0200
> @@ -1241,6 +1241,7 @@ merge_stmts_p (gimple *stmt1, gimple *st
>        case IFN_UBSAN_CHECK_SUB:
>        case IFN_UBSAN_CHECK_MUL:
>        case IFN_UBSAN_OBJECT_SIZE:
> +      case IFN_UBSAN_PTR:
>        case IFN_ASAN_CHECK:
>  	/* For these internal functions, gimple_location is an implicit
>  	   parameter, which will be used explicitly after expansion.
> --- gcc/internal-fn.def.jj	2017-07-06 20:31:43.930946892 +0200
> +++ gcc/internal-fn.def	2017-07-26 13:44:13.838204580 +0200
> @@ -166,6 +166,7 @@ DEF_INTERNAL_FN (UBSAN_VPTR, ECF_LEAF |
>  DEF_INTERNAL_FN (UBSAN_CHECK_ADD, ECF_CONST | ECF_LEAF | ECF_NOTHROW, NULL)
>  DEF_INTERNAL_FN (UBSAN_CHECK_SUB, ECF_CONST | ECF_LEAF | ECF_NOTHROW, NULL)
>  DEF_INTERNAL_FN (UBSAN_CHECK_MUL, ECF_CONST | ECF_LEAF | ECF_NOTHROW, NULL)
> +DEF_INTERNAL_FN (UBSAN_PTR, ECF_LEAF | ECF_NOTHROW, ".R.")
>  DEF_INTERNAL_FN (UBSAN_OBJECT_SIZE, ECF_LEAF | ECF_NOTHROW, NULL)
>  DEF_INTERNAL_FN (ABNORMAL_DISPATCHER, ECF_NORETURN, NULL)
>  DEF_INTERNAL_FN (BUILTIN_EXPECT, ECF_CONST | ECF_LEAF | ECF_NOTHROW, NULL)
> --- gcc/opts.c.jj	2017-07-26 13:37:44.955908409 +0200
> +++ gcc/opts.c	2017-07-26 13:44:13.839204567 +0200
> @@ -1521,6 +1521,7 @@ const struct sanitizer_opts_s sanitizer_
>  		 true),
>    SANITIZER_OPT (object-size, SANITIZE_OBJECT_SIZE, true),
>    SANITIZER_OPT (vptr, SANITIZE_VPTR, true),
> +  SANITIZER_OPT (pointer-overflow, SANITIZE_POINTER_OVERFLOW, true),
>    SANITIZER_OPT (all, ~0U, true),
>  #undef SANITIZER_OPT
>    { NULL, 0U, 0UL, false }
> --- gcc/lto-streamer-in.c.jj	2017-06-30 09:49:28.006662098 +0200
> +++ gcc/lto-streamer-in.c	2017-07-26 13:44:13.840204555 +0200
> @@ -1143,6 +1143,10 @@ input_function (tree fn_decl, struct dat
>  		      if ((flag_sanitize & SANITIZE_OBJECT_SIZE) == 0)
>  			remove = true;
>  		      break;
> +		    case IFN_UBSAN_PTR:
> +		      if ((flag_sanitize & SANITIZE_POINTER_OVERFLOW) == 0)
> +			remove = true;
> +		      break;
>  		    case IFN_ASAN_MARK:
>  		      if ((flag_sanitize & SANITIZE_ADDRESS) == 0)
>  			remove = true;
> --- gcc/fold-const.c.jj	2017-07-25 12:19:45.423601159 +0200
> +++ gcc/fold-const.c	2017-07-26 14:59:51.908708150 +0200
> @@ -4859,21 +4859,21 @@ build_range_check (location_t loc, tree
>  
>    if (low == 0)
>      return fold_build2_loc (loc, LE_EXPR, type, exp,
> -			fold_convert_loc (loc, etype, high));
> +			    fold_convert_loc (loc, etype, high));
>  
>    if (high == 0)
>      return fold_build2_loc (loc, GE_EXPR, type, exp,
> -			fold_convert_loc (loc, etype, low));
> +			    fold_convert_loc (loc, etype, low));
>  
>    if (operand_equal_p (low, high, 0))
>      return fold_build2_loc (loc, EQ_EXPR, type, exp,
> -			fold_convert_loc (loc, etype, low));
> +			    fold_convert_loc (loc, etype, low));
>  
>    if (TREE_CODE (exp) == BIT_AND_EXPR
>        && maskable_range_p (low, high, etype, &mask, &value))
>      return fold_build2_loc (loc, EQ_EXPR, type,
>  			    fold_build2_loc (loc, BIT_AND_EXPR, etype,
> -					      exp, mask),
> +					     exp, mask),
>  			    value);
>  
>    if (integer_zerop (low))
> @@ -4905,7 +4905,7 @@ build_range_check (location_t loc, tree
>  	      exp = fold_convert_loc (loc, etype, exp);
>  	    }
>  	  return fold_build2_loc (loc, GT_EXPR, type, exp,
> -			      build_int_cst (etype, 0));
> +				  build_int_cst (etype, 0));
>  	}
>      }
>  
> @@ -4915,25 +4915,15 @@ build_range_check (location_t loc, tree
>    if (etype == NULL_TREE)
>      return NULL_TREE;
>  
> +  if (POINTER_TYPE_P (etype))
> +    etype = unsigned_type_for (etype);
> +
>    high = fold_convert_loc (loc, etype, high);
>    low = fold_convert_loc (loc, etype, low);
>    exp = fold_convert_loc (loc, etype, exp);
>  
>    value = const_binop (MINUS_EXPR, high, low);
>  
> -
> -  if (POINTER_TYPE_P (etype))
> -    {
> -      if (value != 0 && !TREE_OVERFLOW (value))
> -	{
> -	  low = fold_build1_loc (loc, NEGATE_EXPR, TREE_TYPE (low), low);
> -          return build_range_check (loc, type,
> -			     	    fold_build_pointer_plus_loc (loc, exp, low),
> -			            1, build_int_cst (etype, 0), value);
> -	}
> -      return 0;
> -    }
> -
>    if (value != 0 && !TREE_OVERFLOW (value))
>      return build_range_check (loc, type,
>  			      fold_build2_loc (loc, MINUS_EXPR, etype, exp, low),
> --- gcc/testsuite/c-c++-common/ubsan/ptr-overflow-1.c.jj	2017-07-26 13:44:13.840204555 +0200
> +++ gcc/testsuite/c-c++-common/ubsan/ptr-overflow-1.c	2017-07-26 13:44:13.840204555 +0200
> @@ -0,0 +1,65 @@
> +/* PR sanitizer/80998 */
> +/* { dg-do run } */
> +/* { dg-options "-fsanitize=pointer-overflow -fno-sanitize-recover=pointer-overflow -Wall" } */
> +
> +struct S { int a; int b; int c[64]; };
> +__attribute__((noinline, noclone)) char *f1 (char *p) { return p + 1; }
> +__attribute__((noinline, noclone)) char *f2 (char *p) { return p - 1; }
> +__attribute__((noinline, noclone)) char *f3 (char *p, int i) { return p + i; }
> +__attribute__((noinline, noclone)) char *f4 (char *p, int i) { return p - i; }
> +__attribute__((noinline, noclone)) char *f5 (char *p, unsigned long int i) { return p + i; }
> +__attribute__((noinline, noclone)) char *f6 (char *p, unsigned long int i) { return p - i; }
> +__attribute__((noinline, noclone)) int *f7 (struct S *p) { return &p->a; }
> +__attribute__((noinline, noclone)) int *f8 (struct S *p) { return &p->b; }
> +__attribute__((noinline, noclone)) int *f9 (struct S *p) { return &p->c[64]; }
> +__attribute__((noinline, noclone)) int *f10 (struct S *p, int i) { return &p->c[i]; }
> +
> +char *volatile p;
> +struct S *volatile q;
> +char a[64];
> +struct S s;
> +int *volatile r;
> +
> +int
> +main ()
> +{
> +  struct S t;
> +  p = &a[32];
> +  p = f1 (p);
> +  p = f1 (p);
> +  p = f2 (p);
> +  p = f3 (p, 1);
> +  p = f3 (p, -1);
> +  p = f3 (p, 3);
> +  p = f3 (p, -6);
> +  p = f4 (p, 1);
> +  p = f4 (p, -1);
> +  p = f4 (p, 3);
> +  p = f4 (p, -6);
> +  p = f5 (p, 1);
> +  p = f5 (p, 3);
> +  p = f6 (p, 1);
> +  p = f6 (p, 3);
> +  if (sizeof (unsigned long) >= sizeof (char *))
> +    {
> +      p = f5 (p, -1);
> +      p = f5 (p, -6);
> +      p = f6 (p, -1);
> +      p = f6 (p, -6);
> +    }
> +  q = &s;
> +  r = f7 (q);
> +  r = f8 (q);
> +  r = f9 (q);
> +  r = f10 (q, 0);
> +  r = f10 (q, 10);
> +  r = f10 (q, 64);
> +  q = &t;
> +  r = f7 (q);
> +  r = f8 (q);
> +  r = f9 (q);
> +  r = f10 (q, 0);
> +  r = f10 (q, 10);
> +  r = f10 (q, 64);
> +  return 0;
> +}
> --- gcc/testsuite/c-c++-common/ubsan/ptr-overflow-2.c.jj	2017-07-26 13:44:13.840204555 +0200
> +++ gcc/testsuite/c-c++-common/ubsan/ptr-overflow-2.c	2017-07-26 13:44:13.840204555 +0200
> @@ -0,0 +1,113 @@
> +/* PR sanitizer/80998 */
> +/* { dg-do run } */
> +/* { dg-options "-fsanitize=pointer-overflow -fsanitize-recover=pointer-overflow -fno-ipa-icf -Wall" } */
> +
> +__attribute__((noinline, noclone)) char * f1 (char *p) { return p + 1; }
> +__attribute__((noinline, noclone)) char * f2 (char *p) { return p - 1; }
> +__attribute__((noinline, noclone)) char * f3 (char *p, int i) { return p + i; }
> +__attribute__((noinline, noclone)) char * f4 (char *p, int i) { return p + i; }
> +__attribute__((noinline, noclone)) char * f5 (char *p, int i) { return p - i; }
> +__attribute__((noinline, noclone)) char * f6 (char *p, int i) { return p - i; }
> +__attribute__((noinline, noclone)) char * f7 (char *p, unsigned long int i) { return p + i; }
> +__attribute__((noinline, noclone)) char * f8 (char *p, unsigned long int i) { return p + i; }
> +__attribute__((noinline, noclone)) char * f9 (char *p, unsigned long int i) { return p - i; }
> +__attribute__((noinline, noclone)) char * f10 (char *p, unsigned long int i) { return p - i; }
> +struct S { int a; int b; int c[64]; };
> +__attribute__((noinline, noclone)) int *f11 (struct S *p) { return &p->a; }
> +__attribute__((noinline, noclone)) int *f12 (struct S *p) { return &p->b; }
> +__attribute__((noinline, noclone)) int *f13 (struct S *p) { return &p->c[64]; }
> +__attribute__((noinline, noclone)) int *f14 (struct S *p, int i) { return &p->c[i]; }
> +__attribute__((noinline, noclone)) int *f15 (struct S *p, int i) { return &p->c[i]; }
> +__attribute__((noinline, noclone)) int *f16 (struct S *p) { return &p->a; }
> +__attribute__((noinline, noclone)) int *f17 (struct S *p) { return &p->b; }
> +__attribute__((noinline, noclone)) int *f18 (struct S *p) { return &p->c[64]; }
> +__attribute__((noinline, noclone)) int *f19 (struct S *p, int i) { return &p->c[i]; }
> +__attribute__((noinline, noclone)) int *f20 (struct S *p, int i) { return &p->c[i]; }
> +__attribute__((noinline, noclone)) int *f21 (struct S *p) { return &p->a; }
> +__attribute__((noinline, noclone)) int *f22 (struct S *p) { return &p->b; }
> +__attribute__((noinline, noclone)) int *f23 (struct S *p) { return &p->c[64]; }
> +__attribute__((noinline, noclone)) int *f24 (struct S *p, int i) { return &p->c[i]; }
> +__attribute__((noinline, noclone)) int *f25 (struct S *p, int i) { return &p->c[i]; }
> +
> +char *volatile p;
> +__UINTPTR_TYPE__ volatile u;
> +struct S *volatile q;
> +int *volatile r;
> +
> +int
> +main ()
> +{
> +  u = ~(__UINTPTR_TYPE__) 0;
> +  p = (char *) u;
> +  p = f1 (p);
> +  u = 0;
> +  p = (char *) u;
> +  p = f2 (p);
> +  u = -(__UINTPTR_TYPE__) 7;
> +  p = (char *) u;
> +  p = f3 (p, 7);
> +  u = 3;
> +  p = (char *) u;
> +  p = f4 (p, -4);
> +  u = 23;
> +  p = (char *) u;
> +  p = f5 (p, 27);
> +  u = -(__UINTPTR_TYPE__) 15;
> +  p = (char *) u;
> +  p = f6 (p, -15);
> +  u = -(__UINTPTR_TYPE__) 29;
> +  p = (char *) u;
> +  p = f7 (p, 31);
> +  u = 23;
> +  p = (char *) u;
> +  p = f9 (p, 24);
> +  if (sizeof (unsigned long) < sizeof (char *))
> +    return 0;
> +  u = 7;
> +  p = (char *) u;
> +  p = f8 (p, -8);
> +  u = -(__UINTPTR_TYPE__) 25;
> +  p = (char *) u;
> +  p = f10 (p, -25);
> +  u = ~(__UINTPTR_TYPE__) 0;
> +  q = (struct S *) u;
> +  r = f11 (q);
> +  r = f12 (q);
> +  r = f13 (q);
> +  r = f14 (q, 0);
> +  r = f15 (q, 63);
> +  u = ~(__UINTPTR_TYPE__) 0 - (17 * sizeof (int));
> +  q = (struct S *) u;
> +  r = f16 (q);
> +  r = f17 (q);
> +  r = f18 (q);
> +  r = f19 (q, 0);
> +  r = f20 (q, 63);
> +  u = 3 * sizeof (int);
> +  q = (struct S *) u;
> +  r = f21 (q);
> +  r = f22 (q);
> +  r = f23 (q);
> +  r = f24 (q, -2);
> +  r = f25 (q, -6);
> +  return 0;
> +}
> +
> +/* { dg-output ":5:6\[79]\[^\n\r]*runtime error: pointer index expression with base (0\[xX])?\[fF]\+ overflowed to (0\[xX])?0\+(\n|\r\n|\r)" } */
> +/* { dg-output "\[^\n\r]*:6:6\[79]\[^\n\r]*runtime error: pointer index expression with base (0\[xX])?0\+ overflowed to (0\[xX])?\[fF]\+(\n|\r\n|\r)" } */
> +/* { dg-output "\[^\n\r]*:7:7\[46]\[^\n\r]*runtime error: pointer index expression with base (0\[xX])?\[fF]\+9 overflowed to (0\[xX])?0\+(\n|\r\n|\r)" } */
> +/* { dg-output "\[^\n\r]*:8:7\[46]\[^\n\r]*runtime error: pointer index expression with base (0\[xX])?0\+3 overflowed to (0\[xX])?\[fF]\+(\n|\r\n|\r)" } */
> +/* { dg-output "\[^\n\r]*:9:7\[46]\[^\n\r]*runtime error: pointer index expression with base (0\[xX])?0\+17 overflowed to (0\[xX])?\[fF]\+\[cC](\n|\r\n|\r)" } */
> +/* { dg-output "\[^\n\r]*:10:7\[46]\[^\n\r]*runtime error: pointer index expression with base (0\[xX])?\[fF]\+1 overflowed to (0\[xX])?0\+(\n|\r\n|\r)" } */
> +/* { dg-output "\[^\n\r]*:11:\[89]\[80]\[^\n\r]*runtime error: pointer index expression with base (0\[xX])?\[fF]\+\[eE]3 overflowed to (0\[xX])?0\+2(\n|\r\n|\r)" } */
> +/* { dg-output "\[^\n\r]*:13:\[89]\[80]\[^\n\r]*runtime error: pointer index expression with base (0\[xX])?0\+17 overflowed to (0\[xX])?\[fF]\+(\n|\r\n|\r)" } */
> +/* { dg-output "\[^\n\r]*:12:\[89]\[80]\[^\n\r]*runtime error: pointer index expression with base (0\[xX])?0\+7 overflowed to (0\[xX])?\[fF]\+(\n|\r\n|\r)" } */
> +/* { dg-output "\[^\n\r]*:14:\[89]\[91]\[^\n\r]*runtime error: pointer index expression with base (0\[xX])?\[fF]\+\[eE]7 overflowed to (0\[xX])?0\+" } */
> +/* { dg-output "(\n|\r\n|\r)" { target int32 } } */
> +/* { dg-output "\[^\n\r]*:17:\[67]\[82]\[^\n\r]*runtime error: pointer index expression with base (0\[xX])?\[fF]\+ overflowed to (0\[xX])?0\+3(\n|\r\n|\r)" { target int32 } } */
> +/* { dg-output "\[^\n\r]*:18:\[67]\[86]\[^\n\r]*runtime error: pointer index expression with base (0\[xX])?\[fF]\+ overflowed to (0\[xX])?0\+107(\n|\r\n|\r)" { target int32 } } */
> +/* { dg-output "\[^\n\r]*:19:\[78]\[52]\[^\n\r]*runtime error: pointer index expression with base (0\[xX])?\[fF]\+ overflowed to (0\[xX])?0\+7(\n|\r\n|\r)" { target int32 } } */
> +/* { dg-output "\[^\n\r]*:20:\[78]\[52]\[^\n\r]*runtime error: pointer index expression with base (0\[xX])?\[fF]\+ overflowed to (0\[xX])?0\+103(\n|\r\n|\r)" { target int32 } } */
> +/* { dg-output "\[^\n\r]*:23:\[67]\[86]\[^\n\r]*runtime error: pointer index expression with base (0\[xX])?\[fF]\+\[bB]\[bB] overflowed to (0\[xX])?0\+\[cC]3(\n|\r\n|\r)" { target int32 } } */
> +/* { dg-output "\[^\n\r]*:25:\[78]\[52]\[^\n\r]*runtime error: pointer index expression with base (0\[xX])?\[fF]\+\[bB]\[bB] overflowed to (0\[xX])?0\+\[bB]\[fF](\n|\r\n|\r)" { target int32 } } */
> +/* { dg-output "\[^\n\r]*:30:\[78]\[52]\[^\n\r]*runtime error: pointer index expression with base (0\[xX])?0\+\[cC] overflowed to (0\[xX])?\[fF]\+\[cC]" { target int32 } } */
> --- libsanitizer/ubsan/ubsan_handlers.cc.jj	2017-06-19 08:26:17.073600279 +0200
> +++ libsanitizer/ubsan/ubsan_handlers.cc	2017-07-26 13:44:14.261199463 +0200
> @@ -521,6 +521,37 @@ void __ubsan::__ubsan_handle_nonnull_arg
>    Die();
>  }
>  
> +static void handlePointerOverflowImpl(PointerOverflowData *Data,
> +                                      ValueHandle Base,
> +                                      ValueHandle Result,
> +                                      ReportOptions Opts) {
> +  SourceLocation Loc = Data->Loc.acquire();
> +  ErrorType ET = ErrorType::PointerOverflow;
> +
> +  if (ignoreReport(Loc, Opts, ET))
> +    return;
> +
> +  ScopedReport R(Opts, Loc, ET);
> +
> +  Diag(Loc, DL_Error, "pointer index expression with base %0 overflowed to %1")
> +    << (void *)Base << (void*)Result;
> +}
> +
> +void __ubsan::__ubsan_handle_pointer_overflow(PointerOverflowData *Data,
> +                                              ValueHandle Base,
> +                                              ValueHandle Result) {
> +  GET_REPORT_OPTIONS(false);
> +  handlePointerOverflowImpl(Data, Base, Result, Opts);
> +}
> +
> +void __ubsan::__ubsan_handle_pointer_overflow_abort(PointerOverflowData *Data,
> +                                                    ValueHandle Base,
> +                                                    ValueHandle Result) {
> +  GET_REPORT_OPTIONS(true);
> +  handlePointerOverflowImpl(Data, Base, Result, Opts);
> +  Die();
> +}
> +
>  static void handleCFIBadIcall(CFICheckFailData *Data, ValueHandle Function,
>                                ReportOptions Opts) {
>    if (Data->CheckKind != CFITCK_ICall)
> --- libsanitizer/ubsan/ubsan_checks.inc.jj	2017-06-19 08:26:17.061600432 +0200
> +++ libsanitizer/ubsan/ubsan_checks.inc	2017-07-26 13:44:14.275199294 +0200
> @@ -17,6 +17,7 @@
>  
>  UBSAN_CHECK(GenericUB, "undefined-behavior", "undefined")
>  UBSAN_CHECK(NullPointerUse, "null-pointer-use", "null")
> +UBSAN_CHECK(PointerOverflow, "pointer-overflow", "pointer-overflow")
>  UBSAN_CHECK(MisalignedPointerUse, "misaligned-pointer-use", "alignment")
>  UBSAN_CHECK(InsufficientObjectSize, "insufficient-object-size", "object-size")
>  UBSAN_CHECK(SignedIntegerOverflow, "signed-integer-overflow",
> --- libsanitizer/ubsan/ubsan_handlers.h.jj	2017-06-19 08:26:17.073600279 +0200
> +++ libsanitizer/ubsan/ubsan_handlers.h	2017-07-26 13:44:14.282199209 +0200
> @@ -146,6 +146,13 @@ struct NonNullArgData {
>  /// \brief Handle passing null pointer to function with nonnull attribute.
>  RECOVERABLE(nonnull_arg, NonNullArgData *Data)
>  
> +struct PointerOverflowData {
> +  SourceLocation Loc;
> +};
> +
> +RECOVERABLE(pointer_overflow, PointerOverflowData *Data, ValueHandle Base,
> +            ValueHandle Result)
> +
>  /// \brief Known CFI check kinds.
>  /// Keep in sync with the enum of the same name in CodeGenFunction.h
>  enum CFITypeCheckKind : unsigned char {
> 
> 
> 	Jakub
> 
> 

-- 
Richard Biener <rguenther@suse.de>
SUSE LINUX GmbH, GF: Felix Imendoerffer, Jane Smithard, Graham Norton, HRB 21284 (AG Nuernberg)

  reply	other threads:[~2017-07-28  7:59 UTC|newest]

Thread overview: 502+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2017-07-25  9:40 Jakub Jelinek
2017-07-26 10:34 ` Richard Biener
2017-07-26 13:47   ` Jakub Jelinek
2017-07-26 14:13     ` Richard Biener
2017-07-26 17:31       ` Jakub Jelinek
2017-07-27  7:19         ` Richard Biener
2017-07-27  8:35           ` Jakub Jelinek
2017-07-28  7:59             ` Richard Biener [this message]
  -- strict thread matches above, loose matches on Subject: below --
2024-02-09  9:44 Jakub Jelinek
2024-02-12 16:07 ` Jeff Law
2023-03-01 10:23 Jakub Jelinek
2023-03-04  1:33 ` Joseph Myers
2023-02-13 10:35 Jakub Jelinek
2023-01-30  9:50 Jakub Jelinek
2023-01-30 23:07 ` Richard Sandiford
2023-01-09 16:50 Jakub Jelinek
2022-12-09 15:09 Jakub Jelinek
2022-10-21  7:23 [PATCH] builtins: Add __builtin_nextafterf16b builtin Jakub Jelinek
2022-10-21 15:42 ` [PATCH] builtins: Add various complex builtins for _Float{16,32,64,128,32x,64x,128x} Jakub Jelinek
2022-10-24 16:28   ` Jeff Law
2022-10-25  9:03     ` Patch ping Jakub Jelinek
2022-03-02  9:47 Jakub Jelinek
2022-03-02 18:59 ` Jeff Law
2022-01-04 12:45 Jakub Jelinek
2022-01-03 10:40 Jakub Jelinek
2022-01-03 12:38 ` Richard Biener
2022-01-03 10:25 Jakub Jelinek
2022-01-03 12:39 ` Richard Biener
2022-01-03 13:15 ` Jan Hubicka
2021-12-01 15:15 Jakub Jelinek
2021-03-31  7:07 Jakub Jelinek
2021-03-31  7:10 ` Richard Biener
2021-03-24 11:44 Jakub Jelinek
2021-03-24 15:45 ` Martin Sebor
2021-03-24 16:40   ` Jakub Jelinek
2021-03-24 17:14     ` Martin Sebor
2021-03-25  8:45       ` Richard Biener
2021-03-24 16:12 ` Jeff Law
2021-03-19  9:57 Jakub Jelinek
2021-02-16  8:13 [PATCH] cfgrtl: Fix up fixup_partitions caused ICE [PR99085] Jakub Jelinek
2021-02-23  8:49 ` Patch ping Jakub Jelinek
2021-01-25  9:43 Jakub Jelinek
2021-01-25 22:34 ` Jason Merrill
2020-10-22  9:05 Jakub Jelinek
2020-10-22 20:42 ` Joseph Myers
2020-10-05  9:09 Jakub Jelinek
2020-10-05 12:02 ` Nathan Sidwell
2020-09-25 11:42 Jakub Jelinek
2020-03-10 12:28 Jakub Jelinek
2020-02-10  9:24 Jakub Jelinek
2020-02-12 21:39 ` Jeff Law
2020-02-13  9:54   ` Jakub Jelinek
2020-02-13 17:42     ` Martin Sebor
2020-02-13 19:36       ` Jeff Law
2020-01-07 10:20 Jakub Jelinek
2019-09-14  0:40 [PATCH] Fix up sqrt(x) < c and sqrt(x) >= c match.pd folding (PR tree-optimization/91734) Jakub Jelinek
2019-09-16  6:57 ` Richard Biener
2019-09-21  6:14   ` [PATCH] Fix up sqrt(x) < c and sqrt(x) >= c match.pd folding (PR tree-optimization/91734, take 2) Jakub Jelinek
2019-09-30  7:03     ` Patch ping Jakub Jelinek
2019-04-16 11:54 Jakub Jelinek
2018-04-30  8:43 Jakub Jelinek
2018-04-16 10:35 Jakub Jelinek
2018-04-17  6:14 ` Kirill Yukhin
2018-04-10 13:35 Jakub Jelinek
2018-04-10 12:34 ` Kirill Yukhin
2018-03-12 17:35 Jakub Jelinek
2018-03-12 23:22 ` Jason Merrill
2018-03-05 18:38 Jakub Jelinek
2018-03-05 16:19 ` Jan Hubicka
2018-03-02  8:49 Jakub Jelinek
2018-03-02 17:17 ` Jeff Law
2018-03-05 15:39 ` Kirill Yukhin
2018-02-14 17:49 Jakub Jelinek
2018-02-19 18:15 ` Jeff Law
2018-02-07  9:01 Jakub Jelinek
2017-11-20  8:31 Jakub Jelinek
2017-11-20 18:31 ` Nathan Sidwell
2017-11-20 19:08 ` Nathan Sidwell
2017-11-21  8:53   ` Jakub Jelinek
2017-11-21  0:16 ` Jim Wilson
2017-11-21  3:01   ` Jim Wilson
2017-11-21  8:14   ` Jakub Jelinek
2017-11-06 16:22 Jakub Jelinek
2017-10-24 11:04 Jakub Jelinek
2017-10-24 18:58 ` Kirill Yukhin
2017-10-16 10:16 Jakub Jelinek
2017-10-06 14:12 Jakub Jelinek
2017-10-06 15:25 ` Nathan Sidwell
2017-10-06 15:27 ` Nathan Sidwell
2017-09-29  9:13 Jakub Jelinek
2017-07-28 16:58 Jakub Jelinek
2017-04-10 12:18 Jakub Jelinek
2017-04-10 12:41 ` Nathan Sidwell
2017-04-10 13:22   ` Jakub Jelinek
2017-04-10 14:39     ` Nathan Sidwell
2017-04-05 10:45 Jakub Jelinek
2017-03-31  8:34 Jakub Jelinek
2017-03-31 15:14 ` Jeff Law
2017-03-31 18:50   ` Jakub Jelinek
2017-03-31 15:15 ` Jeff Law
2017-02-07 15:11 Jakub Jelinek
2017-02-07 15:22 ` Uros Bizjak
2017-02-02 10:13 Jakub Jelinek
2017-02-02 10:15 ` Richard Biener
2017-01-26 20:42 Jakub Jelinek
2017-01-10  7:27 Jakub Jelinek
2016-11-18 17:08 Jakub Jelinek
2016-10-08  6:15 [C++ PATCH] Fix -Wimplicit-fallthrough in templates (PR c++/77886) Jakub Jelinek
2016-10-17 17:37 ` Patch ping Jakub Jelinek
2016-09-28 21:18 Bernd Edlinger
2016-09-28 19:31 Jakub Jelinek
2016-09-28 19:35 ` Bernd Schmidt
2016-09-28 19:55   ` Jakub Jelinek
2016-09-28 20:19   ` Jakub Jelinek
2016-09-28 21:41     ` Bernd Schmidt
2016-09-28 21:51       ` Jakub Jelinek
2016-09-29  0:32         ` Bernd Schmidt
2016-09-29  0:41           ` Jakub Jelinek
2016-09-14 21:55 Jakub Jelinek
2016-09-15 11:01 ` Bernd Schmidt
2016-09-05 17:14 [C++ PATCH] Fix constexpr switch handling (PR c++/77467) Jakub Jelinek
2016-09-16 20:00 ` Jason Merrill
2016-09-16 20:51   ` Jakub Jelinek
2016-09-19 18:49     ` Jason Merrill
2016-09-20 16:29       ` [C++ PATCH] Fix constexpr switch handling (PR c++/77467, take 2) Jakub Jelinek
2016-09-27 21:33         ` Patch ping Jakub Jelinek
2016-08-15  8:50 Jakub Jelinek
2016-07-22 14:16 Cesar Philippidis
2016-07-18 18:08 Jakub Jelinek
2016-07-11 13:14 Jakub Jelinek
2016-07-12  8:54 ` Richard Biener
2016-06-02  9:47 Jakub Jelinek
2016-03-18  9:23 Jakub Jelinek
2016-03-17 14:24 Jakub Jelinek
2016-03-17 15:48 ` Jason Merrill
2016-03-04  7:30 Jakub Jelinek
2016-03-04  7:38 ` Jeff Law
2016-03-03 14:36 Jakub Jelinek
2016-03-04  7:10 ` Jeff Law
2016-03-04  7:23   ` Jakub Jelinek
2016-02-11 18:14 Jakub Jelinek
2016-02-10 14:12 Jakub Jelinek
2016-02-10 14:21 ` Richard Biener
2015-05-05 18:52 Jakub Jelinek
2015-05-05 19:10 ` Andreas Krebbel
2015-04-17  8:47 Jakub Jelinek
2015-04-17 15:32 ` Jeff Law
2015-04-11 22:27 patch ping Bernhard Reutner-Fischer
2015-04-13 13:12 ` Jeff Law
2015-04-22 19:47   ` Bernhard Reutner-Fischer
2015-03-18 14:01 Patch ping Jakub Jelinek
2015-02-12 15:37 Jakub Jelinek
2015-02-09 23:06 patch ping Trevor Saunders
2015-02-09 23:15 ` Jan Hubicka
2015-02-04 19:30 Patch ping Jakub Jelinek
2015-01-14  6:29 Jan Hubicka
2015-01-14 21:42 ` Jason Merrill
2015-01-05 13:53 Jakub Jelinek
2015-01-05 21:27 ` Jeff Law
2015-01-05 21:39   ` Jakub Jelinek
2015-01-06  8:23     ` Jakub Jelinek
2015-01-09  5:34     ` Jeff Law
2014-12-12  8:23 Jakub Jelinek
2014-11-01 11:58 nvptx offloading patches [3/n], RFD Bernd Schmidt
2015-02-04 11:38 ` Jakub Jelinek
2015-02-09 10:20   ` Richard Biener
2015-02-16 21:08     ` Jakub Jelinek
2015-02-16 21:35       ` Richard Biener
2015-02-16 21:44         ` Jakub Jelinek
2015-02-17 10:00           ` Richard Biener
2015-02-18 10:00             ` Jakub Jelinek
2015-02-25  8:51               ` Patch ping Jakub Jelinek
2015-02-25  9:30                 ` Richard Biener
2015-02-25 16:51                   ` Jakub Jelinek
2014-07-19 10:12 Jakub Jelinek
2014-04-09 13:07 Jakub Jelinek
2014-04-09 22:29 ` DJ Delorie
2014-04-10  5:59   ` Jakub Jelinek
2014-04-10 16:01     ` DJ Delorie
2014-04-10 18:42       ` Tobias Burnus
2014-04-14 11:02       ` Jakub Jelinek
2014-04-16 18:45         ` Toon Moene
2014-04-16 19:13         ` DJ Delorie
2014-04-17 12:21           ` Jakub Jelinek
2014-04-10  4:24 ` Jeff Law
2014-02-06 12:12 Jakub Jelinek
2015-04-17 15:46 ` Richard Earnshaw
2015-04-17 15:47   ` Richard Earnshaw
2014-01-13  8:07 Jakub Jelinek
2014-01-13  8:15 ` Uros Bizjak
2014-01-13  8:35   ` Jakub Jelinek
2014-01-13 10:23     ` Richard Biener
2014-01-13 18:26     ` Kirill Yukhin
2014-01-13 18:33       ` Uros Bizjak
2014-01-13 18:40       ` Uros Bizjak
2014-01-13 18:59         ` Jakub Jelinek
2014-01-13 15:15 ` Jeff Law
2014-01-13 16:26   ` Jakub Jelinek
2014-01-13 15:22     ` Jeff Law
2014-04-14 10:56       ` Jakub Jelinek
2014-04-16 21:35 ` Jeff Law
2014-04-17 21:56   ` Uros Bizjak
2014-01-06  9:52 Jakub Jelinek
2013-05-17  6:49 Jakub Jelinek
2013-05-17 15:44 ` Jeff Law
2013-04-26  7:40 Jakub Jelinek
2013-04-26 11:01 ` Gabriel Dos Reis
2013-03-05 13:12 Jakub Jelinek
2013-03-05 13:26 ` Richard Biener
2013-03-05 13:47   ` Jakub Jelinek
2013-03-05 13:52     ` Richard Biener
2013-03-05 15:44 ` Vladimir Makarov
2013-03-05 15:46 ` Vladimir Makarov
2013-02-07  8:24 Jakub Jelinek
2013-02-07 14:34 ` Jeff Law
2013-01-30 10:18 Jakub Jelinek
2012-12-18 14:12 Jakub Jelinek
2012-12-18 21:36 ` Paul Richard Thomas
2012-11-26 12:30 Jakub Jelinek
2012-12-06  9:28 ` Richard Biener
2012-11-16  9:10 Jakub Jelinek
2012-11-17 19:12 ` Richard Henderson
2012-11-17 19:16 ` Richard Henderson
2012-11-17 20:04 ` Richard Henderson
2012-11-19  7:53   ` Jakub Jelinek
2012-11-19 16:56     ` Richard Henderson
2012-10-22 18:31 Jakub Jelinek
2012-08-27  7:44 Jakub Jelinek
2012-09-03 11:34 ` Richard Guenther
2012-06-11 11:28 Jakub Jelinek
2012-03-05 11:09 Jakub Jelinek
2012-03-05 12:18 ` Richard Guenther
2012-03-05 20:08 ` Richard Henderson
2012-02-14 10:07 Jakub Jelinek
2012-02-17 14:56 ` Jan Hubicka
2012-02-03 10:14 Jakub Jelinek
2012-02-03 10:56 ` Paolo Carlini
2012-01-24 10:29 Jakub Jelinek
2012-01-24 10:53 ` Richard Guenther
2012-01-02 10:38 Jakub Jelinek
2012-01-02 12:20 ` Richard Guenther
2011-11-07 21:54 Jakub Jelinek
2011-11-08 13:45 ` Richard Guenther
2011-11-02 20:19 Jakub Jelinek
2011-11-04 10:11 ` Richard Guenther
2011-11-04 10:39   ` Jakub Jelinek
2011-11-04 11:44     ` Richard Guenther
2011-11-04 14:09       ` Michael Matz
2011-09-26  9:30 Jakub Jelinek
2011-09-26 10:08 ` Richard Sandiford
2011-09-12 15:39 Jakub Jelinek
2011-09-12 16:17 ` Jeff Law
2011-08-29  9:41 Jakub Jelinek
2011-08-29 12:00 ` Joseph S. Myers
2011-08-29 12:49 ` Bernd Schmidt
2011-08-29 21:33 ` Jeff Law
2011-08-18  9:45 Jakub Jelinek
2011-06-20  9:22 Jakub Jelinek
2011-06-21 18:37 ` Richard Henderson
2011-06-25 19:39 ` Eric Botcazou
2011-06-25 23:56   ` Mike Stump
2011-05-23  9:34 Jakub Jelinek
2011-05-23 10:11 ` Richard Guenther
2011-05-23 18:13 ` Jeff Law
2011-05-12 16:12 Jakub Jelinek
2011-04-26 12:55 Jakub Jelinek
2011-03-14 20:20 Jakub Jelinek
2011-03-14 20:27 ` Diego Novillo
2011-02-28 10:38 Jakub Jelinek
2011-02-28 16:07 ` Jeff Law
2011-02-28 16:18 ` Jeff Law
2011-02-28 18:12 ` Jeff Law
2011-02-03 11:59 Jakub Jelinek
2011-02-03 16:14 ` Richard Henderson
2011-02-03 16:20   ` Jakub Jelinek
2011-02-03 16:25     ` IainS
2011-02-03 16:27       ` Richard Henderson
2011-02-03 16:38         ` Jakub Jelinek
2011-02-03 16:49           ` IainS
2011-02-03 16:54             ` Jakub Jelinek
2011-02-03 18:44           ` Mike Stump
2011-02-03 19:04             ` IainS
2010-11-05 20:04 Jakub Jelinek
2010-11-09 15:48 ` Jeff Law
2010-09-08 18:13 Jakub Jelinek
2010-07-20 16:59 Jakub Jelinek
2010-07-27 17:39 ` Jeff Law
2010-06-21 10:12 Jakub Jelinek
2010-06-21 11:19 ` Paolo Bonzini
2010-06-21 12:08   ` Jan Kratochvil
2010-06-21 12:20     ` Jan Kratochvil
2010-05-10 17:00 Jakub Jelinek
2010-05-10 23:43 ` Joseph S. Myers
2010-04-19  9:47 Jakub Jelinek
2010-03-02 19:00 Patch Ping Jeff Law
2010-03-03 10:09 ` Richard Guenther
2010-02-23 15:42 Patch ping Jakub Jelinek
2010-02-23 20:12 ` Uros Bizjak
2010-02-09 22:39 Jakub Jelinek
2010-02-09 22:52 ` Richard Guenther
2010-01-14  9:33 Jakub Jelinek
2010-01-14 19:12 ` Richard Henderson
2010-01-04 10:54 Jakub Jelinek
2010-01-04 14:35 ` Richard Guenther
2009-11-02 13:17 Jakub Jelinek
2009-11-02 13:29 ` Richard Guenther
2009-10-19 19:22 Jakub Jelinek
2009-10-19 19:22 ` Richard Henderson
2009-10-19 21:09 ` Joseph S. Myers
2009-10-19 22:06 ` Jason Merrill
2009-10-20  1:25   ` Paolo Carlini
2009-10-12 12:37 Jakub Jelinek
2009-10-12 19:23 ` Tom Tromey
2009-10-12 20:21   ` Jakub Jelinek
2009-10-12 21:29     ` Tom Tromey
2009-08-06 20:57 Jakub Jelinek
2009-05-20 21:07 Jakub Jelinek
2009-04-08 18:16 Jakub Jelinek
2009-01-09 16:41 Jakub Jelinek
2009-01-10  2:39 ` Ian Lance Taylor
2008-11-10 16:53 Jakub Jelinek
2008-11-12 15:51 ` Nick Clifton
2008-11-22  2:49 ` Ian Lance Taylor
2008-09-26  0:33 Jakub Jelinek
2008-09-26 12:53 ` Diego Novillo
2008-09-26 17:36 ` Richard Henderson
2008-07-28 15:02 Jakub Jelinek
2008-06-27 16:11 Jakub Jelinek
2008-05-07  8:38 Jakub Jelinek
2008-05-07 14:59 ` Jason Merrill
2008-05-21 15:05   ` Jakub Jelinek
2008-05-21 15:51     ` Jason Merrill
2008-05-10 19:23 ` Diego Novillo
2008-04-05 16:54 Jan Hubicka
2008-04-05 17:36 ` Richard Guenther
2008-04-05 20:39   ` Jan Hubicka
2008-04-08 20:42     ` Mark Mitchell
2008-04-08 22:52       ` Jan Hubicka
2008-04-08 23:06         ` Mark Mitchell
2008-04-09  7:19           ` Andi Kleen
2008-04-10 13:36           ` Jan Hubicka
2008-04-10 18:36       ` Michael Matz
2008-04-11  8:16         ` Mark Mitchell
2008-04-12 19:10           ` Hans-Peter Nilsson
2008-08-29 22:15   ` Jan Hubicka
2008-08-30 19:06     ` Richard Guenther
2008-09-02 14:38       ` Ian Lance Taylor
2008-02-20 14:35 Jakub Jelinek
2008-02-20 16:26 ` Tom Tromey
2008-02-15 16:47 Jakub Jelinek
2007-09-04 10:02 Jan Hubicka
2007-09-04 10:07 ` Richard Guenther
2007-07-30 18:17 Zdenek Dvorak
2007-07-09  9:03 Zdenek Dvorak
2007-07-09  9:44 ` Richard Guenther
2007-05-24 21:39 Krister Walfridsson
2007-05-23  9:13 Zdenek Dvorak
2007-05-23 20:24 ` Diego Novillo
2007-04-18  1:07 Jan Hubicka
2007-04-17  1:49 Zdenek Dvorak
2006-12-16  0:05 H. J. Lu
2006-12-16  0:35 ` Janis Johnson
2006-12-14 23:53 Zdenek Dvorak
2006-12-15 13:12 ` Richard Guenther
2006-12-16 16:32   ` Zdenek Dvorak
2006-05-02 14:32 Patch Ping Tom Tromey
2006-05-03  2:22 ` Mark Mitchell
2006-03-21 21:26 Patch ping Zdenek Dvorak
2006-03-10 19:33 Uttam Pawar
2006-03-11 20:40 ` Roger Sayle
2006-03-13 19:23   ` Uttam Pawar
2006-03-14  1:02     ` Roger Sayle
2006-03-14 16:49     ` Steve Ellcey
2006-03-14 16:55       ` Andrew Pinski
2006-03-15  4:38       ` Roger Sayle
2006-03-15 19:29         ` Steve Ellcey
2006-03-15 10:23       ` Grigory Zagorodnev
2006-03-15 10:15     ` Andreas Schwab
2006-02-16 23:51 [patch] for PR26327 Uttam Pawar
2006-02-21 19:36 ` patch Ping Uttam Pawar
2006-02-16 15:58 Patch ping Zdenek Dvorak
2006-02-17  2:40 ` Roger Sayle
2006-02-17  9:24   ` Zdenek Dvorak
2006-02-17 10:34     ` Paolo Bonzini
2006-02-17 15:31       ` Roger Sayle
2006-02-21  9:15         ` Zdenek Dvorak
2006-02-21 14:47           ` Roger Sayle
2006-02-21 15:43             ` Zdenek Dvorak
2006-02-21 18:01               ` Richard Henderson
2006-02-21 23:04                 ` Zdenek Dvorak
2006-02-21 23:16                   ` Richard Henderson
2006-02-22  0:20                     ` Zdenek Dvorak
2006-02-14 17:19 Jakub Jelinek
2006-01-28  0:07 Zdenek Dvorak
2006-01-16 21:54 Jakub Jelinek
2006-01-10 21:41 Jan Hubicka
2006-01-10 22:45 ` Ian Lance Taylor
2006-01-10 14:03 Zdenek Dvorak
2006-01-10 14:20 ` Diego Novillo
2006-01-10 16:27   ` Zdenek Dvorak
2005-12-19 19:30 Jan Hubicka
2005-12-19  8:10 patch ping Jan Beulich
2005-12-19  9:26 ` Gerald Pfeifer
2005-11-19 19:14 Rafael Ávila de Espíndola
2005-11-20  9:06 ` Andreas Jaeger
2005-10-30 13:57 Richard Kenner
2005-10-29  1:18 Andrew Pinski
2005-10-29  4:16 ` Ian Lance Taylor
2005-10-29 20:17   ` Andrew Pinski
2005-10-29 20:26     ` Andrew Pinski
2005-10-29 21:08       ` Andrew Pinski
2005-10-30  4:59         ` Ian Lance Taylor
2005-10-04 16:35 Patch ping Ian Lance Taylor
2005-10-04 17:49 ` Richard Henderson
2005-08-29  8:03 Jakub Jelinek
2005-08-29  8:49 ` Ian Lance Taylor
2005-08-01 12:56 Jan Hubicka
2005-06-20 19:37 Jan Hubicka
2005-06-20 22:42 ` Richard Henderson
2005-06-21  8:34   ` Jan Hubicka
2005-06-15 22:34 patch ping Eric Christopher
2005-05-18 11:23 Patch ping Tobias Schlüter
2005-05-12 20:41 Jakub Jelinek
2005-04-04 15:14 Ian Lance Taylor
2005-04-05  2:09 ` Richard Henderson
2005-03-30 19:18 Dale Johannesen
2005-03-30 22:59 ` Tom Tromey
2005-03-30 23:05 ` Geoffrey Keating
2005-03-25 21:26 Zdenek Dvorak
2005-03-09 23:35 Jakub Jelinek
2005-02-27 16:37 Zdenek Dvorak
2004-12-10 17:14 H. J. Lu
2004-12-10 17:02 H. J. Lu
2004-10-11 20:39 Patch Ping Tom Tromey
2004-10-12 23:35 ` Geoffrey Keating
2004-09-03 23:39 Patch ping H. J. Lu
2004-09-03 23:44 ` Richard Henderson
     [not found] <20040731163035.GA7104@troutmask.apl.washington.edu>
2004-08-06 20:45 ` Paul Brook
2004-07-08 14:50 jlquinn
2004-07-08 14:55 ` Roger Sayle
2004-07-08 15:26 ` Paolo Bonzini
2004-06-24  3:10 patch ping Ziemowit Laski
2004-06-23 19:35 Josef Zlomek
2004-06-21 22:57 Pat Haugen
2004-06-21 17:42 Jerry Quinn
2004-06-21 11:44 Patch ping Paolo Bonzini
2004-06-21 15:20 ` Roger Sayle
2004-06-14 13:11 Paul Brook
2004-06-14 17:14 ` Mark Mitchell
2004-06-14 17:36   ` Daniel Jacobowitz
2004-06-14 18:13     ` Paul Brook
2004-06-14 18:22       ` Daniel Jacobowitz
2004-06-15  0:08 ` Richard Henderson
2004-06-15 16:33   ` Paul Brook
2004-06-15 17:46     ` Richard Henderson
2004-06-10 16:48 Tobias Schlüter
2004-06-11  6:49 ` Steve Kargl
2004-05-29 19:51 patch ping jlquinn
2004-05-20 13:25 Patch ping Ben Elliston
2004-05-16 11:59 Richard Guenther
     [not found] <c7dcf6$uiq$1@sea.gmane.org>
     [not found] ` <16538.13954.773875.174452@cuddles.cambridge.redhat.com>
2004-05-06 19:00   ` Patch Ping Ranjit Mathew
2004-05-04 23:01 Patch ping Andrew Pinski
2004-04-28 13:35 Paul Brook
2004-04-28 13:51 ` Richard Earnshaw
2004-04-28 14:02   ` Paul Brook
2004-04-28 15:36     ` Richard Earnshaw
2004-04-28 13:56 ` Roger Sayle
2004-04-23 11:08 Zdenek Dvorak
2004-04-23 13:34 ` Nathan Sidwell
2004-04-23 13:48   ` Zdenek Dvorak
2004-04-23 14:18     ` Roger Sayle
2004-04-24 13:01   ` Aldy Hernandez
2004-04-24 19:40     ` Zdenek Dvorak
2004-04-25  3:39       ` Aldy Hernandez
2004-04-25 16:37     ` Zdenek Dvorak
2004-04-23  9:30 Paolo Bonzini
2004-04-19 19:21 Josef Zlomek
2004-04-20  0:50 ` Roger Sayle
2004-04-16 10:50 Paolo Bonzini
2004-04-16 21:16 ` Geoff Keating
2004-04-19  5:37   ` Andreas Jaeger
2004-04-19  9:45     ` Paolo Bonzini
2004-04-19  9:56       ` Arnaud Charlet
2004-04-19 10:01         ` Paolo Bonzini
2004-04-19 12:10           ` Arnaud Charlet
2004-04-19 10:07       ` Andreas Jaeger
2004-04-19 10:41       ` Laurent GUERBY
2004-04-19 11:13         ` Paolo Bonzini
2004-04-19 11:30       ` Andreas Jaeger
2004-04-19 12:38         ` Paolo Bonzini
2004-04-19 12:57       ` Andreas Schwab
2004-04-19 13:16         ` Paul Brook
2004-04-19 15:08           ` Richard Earnshaw
2004-04-19 13:20         ` Richard Earnshaw
2004-04-19  5:41   ` Andreas Jaeger
2004-03-26 15:38 Ian Lance Taylor
2004-03-24  2:53 patch ping Eric Christopher
2004-03-01 13:03 Patch ping Zdenek Dvorak
2004-03-02  9:33 ` Zack Weinberg
2004-03-19  8:14   ` Zack Weinberg
2004-03-19  8:14 ` Zdenek Dvorak
2004-02-17  0:25 patch ping Alan Modra
2004-02-21 13:45 ` Alan Modra
2004-02-12 21:22 Patch ping Zdenek Dvorak
2004-02-21 13:45 ` Zdenek Dvorak
2004-02-06  1:23 patch ping Alan Modra
2004-02-06  4:23 ` Roger Sayle
2004-02-21 13:45   ` Roger Sayle
2004-02-06 10:40 ` Andreas Schwab
2004-02-06 11:02   ` Alan Modra
2004-02-21 13:45     ` Alan Modra
2004-02-21 13:45   ` Andreas Schwab
2004-02-21 13:45 ` Alan Modra
2004-02-02  9:21 Patch ping Paolo Bonzini
2004-02-21 13:45 ` Paolo Bonzini
2003-10-19 11:11 Zdenek Dvorak
2003-10-19 17:39 ` Zack Weinberg
2003-10-19 18:38   ` Jan Hubicka
2003-10-19 18:41     ` Andreas Jaeger
2003-10-19 19:54       ` Zack Weinberg
2003-09-10  3:17 Jerry Quinn
2003-09-11 14:49 ` Jim Wilson
2002-12-18 11:59 Dale Johannesen
2002-07-12 15:33 patch ping Eric Christopher

Reply instructions:

You may reply publicly to this message via plain-text email
using any one of the following methods:

* Save the following mbox file, import it into your mail client,
  and reply-to-all from there: mbox

  Avoid top-posting and favor interleaved quoting:
  https://en.wikipedia.org/wiki/Posting_style#Interleaved_style

* Reply using the --to, --cc, and --in-reply-to
  switches of git-send-email(1):

  git send-email \
    --in-reply-to=alpine.LSU.2.20.1707280959360.10808@zhemvz.fhfr.qr \
    --to=rguenther@suse.de \
    --cc=gcc-patches@gcc.gnu.org \
    --cc=jakub@redhat.com \
    --cc=jh@suse.cz \
    /path/to/YOUR_REPLY

  https://kernel.org/pub/software/scm/git/docs/git-send-email.html

* If your mail client supports setting the In-Reply-To header
  via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).