Like in
r10-7215-g700d4cb08c88aec37c13e21e63dd61fd698baabc 2 years ago,
I've run
grep -v 'long long\|optab optab\|template template\|double double' *.{[chS],cc} */*.{[chS],cc} *.def config/*/* 2>/dev/null | grep ' \([a-zA-Z]\+\) \1 '
and for the cases that looked clearly wrong changed them, mostly by removing
one of the duplicated words but in some cases with other changes.
2022-03-07 Jakub Jelinek <jakub@redhat.com>
gcc/
* tree-ssa-propagate.cc: Fix up duplicated word issue in a comment.
* config/riscv/riscv.cc: Likewise.
* config/darwin.h: Likewise.
* config/i386/i386.cc: Likewise.
* config/aarch64/thunderx3t110.md: Likewise.
* config/aarch64/fractional-cost.h: Likewise.
* config/vax/vax.cc: Likewise.
* config/rs6000/pcrel-opt.md: Likewise.
* config/rs6000/predicates.md: Likewise.
* ctfc.h: Likewise.
* tree-ssa-uninit.cc: Likewise.
* value-relation.h: Likewise.
* gimple-range-gori.cc: Likewise.
* ipa-polymorphic-call.cc: Likewise.
* pointer-query.cc: Likewise.
* ipa-sra.cc: Likewise.
* internal-fn.cc: Likewise.
* varasm.cc: Likewise.
* gimple-ssa-warn-access.cc: Likewise.
gcc/analyzer/
* store.cc: Fix up duplicated word issue in a comment.
* analyzer.cc: Likewise.
* engine.cc: Likewise.
* sm-taint.cc: Likewise.
gcc/c-family/
* c-attribs.cc: Fix up duplicated word issue in a comment.
gcc/cp/
* cvt.cc: Fix up duplicated word issue in a comment.
* pt.cc: Likewise.
* module.cc: Likewise.
* coroutines.cc: Likewise.
gcc/fortran/
* trans-expr.cc: Fix up duplicated word issue in a comment.
* gfortran.h: Likewise.
* scanner.cc: Likewise.
gcc/jit/
* libgccjit.h: Fix up duplicated word issue in a comment.
}
/* Subroutine of fixup_tree_for_diagnostic_1, called on SSA names.
- Attempt to reconstruct a a tree expression for SSA_NAME
+ Attempt to reconstruct a tree expression for SSA_NAME
based on its def-stmt.
SSA_NAME must be non-NULL.
VISITED must be non-NULL; it is used to ensure termination.
analysis of the current function.
The analyzer handles calls to such functions while
- analysing the stmt itself, so the the function call
+ analysing the stmt itself, so the function call
must have been handled by the anlyzer till now. */
exploded_node *next
= get_or_create_node (next_point,
return;
/* Initialize a map of attribute access specifications for arguments
- to the function function call. */
+ to the function call. */
rdwr_map rdwr_idx;
init_attr_rdwr_indices (&rdwr_idx, TYPE_ATTRIBUTES (fntype));
/* Return a new json::object of the form
{"escaped": true/false,
"touched": true/false,
- "map" : object for the the binding_map. */
+ "map" : object for the binding_map. */
json::object *
binding_cluster::to_json () const
&& !m_touched);
}
-/* Add PV to OUT_PVS, casting it to TYPE if if is not already of that type. */
+/* Add PV to OUT_PVS, casting it to TYPE if it is not already of that type. */
static void
append_pathvar_with_type (path_var pv,
it with this one. Ideally, the attribute would reference
the DECL of the deallocator but since that changes for each
redeclaration, use DECL_NAME instead. (DECL_ASSEMBLER_NAME
- need not be set set this point and setting it here is too early. */
+ need not be set at this point and setting it here is too early. */
tree attrs = build_tree_list (NULL_TREE, DECL_NAME (fndecl));
attrs = tree_cons (get_identifier ("*dealloc"), attrs, at_noinline);
decl_attributes (&dealloc, attrs, 0);
value: "+^2[*],$0$1^3[*],$1$1"
list: < <0, x> <1, y> >
- where the list has a single value which itself is is a list each
+ where the list has a single value which itself is a list, each
of whose <node>s corresponds to one VLA bound for each of the two
parameters. */
constexpr fractional_cost (uint64_t value, raw) : m_value (value) {}
// A multiple of [1, 16] * 16. This ensures that 1/N is representable
- // for every every possible SVE element count N, or for any "X per cycle"
+ // for every possible SVE element count N, or for any "X per cycle"
// value N in the range [1, 16].
static const uint32_t SCALE = 11531520;
logic_shift_imm,logics_shift_imm"))
"thunderx3t110_i01")
-; we are going for the the optimistic answer (13)
+; we are going for the optimistic answer (13)
; for now, the worst case is 23
(define_insn_reservation "thunderx3t110_div" 13
(and (eq_attr "tune" "thunderx3t110")
" %:version-compare(>= 10.6 mmacosx-version-min= -no_compact_unwind) "
/* In Darwin linker specs we can put -lcrt0.o and ld will search the library
- path for crt0.o or -lcrtx.a and it will search for for libcrtx.a. As for
+ path for crt0.o or -lcrtx.a and it will search for libcrtx.a. As for
other ports, we can also put xxx.{o,a}%s and get the appropriate complete
startfile absolute directory. This latter point is important when we want
to override ld's rule of .dylib being found ahead of .a and the user wants
/* Return cost of shift in MODE.
If CONSTANT_OP1 is true, the op1 value is known and set in OP1_VAL.
- AND_IN_OP1 specify in op1 is result of and and SHIFT_AND_TRUNCATE
+ AND_IN_OP1 specify in op1 is result of AND and SHIFT_AND_TRUNCATE
if op1 is a result of subreg.
SKIP_OP0/1 is set to true if cost of OP0/1 should be ignored. */
target_flags |= MASK_FDIV;
/* Handle -mtune, use -mcpu if -mtune is not given, and use default -mtune
- if -mtune and -mcpu both not not given. */
+ if -mtune and -mcpu both not given. */
cpu = riscv_parse_tune (riscv_tune_string ? riscv_tune_string :
(riscv_cpu_string ? riscv_cpu_string :
RISCV_TUNE_STRING_DEFAULT));
;; that both registers may be set in the first insn, and will be used in the
;; second insn.
;;
-;; Since we use UNSPEC's and link both the the register holding the external
+;; Since we use UNSPEC's and link both the register holding the external
;; address and the value being loaded, it should prevent other passes from
;; modifying it.
;;
})
;; Return 1 if op is a constant integer valid for D field
-;; or non-special register register.
+;; or non-special register.
(define_predicate "reg_or_short_operand"
(if_then_else (match_code "const_int")
(match_operand 0 "short_cint_operand")
&& (DEFAULT_ABI != ABI_AIX || SYMBOL_REF_FUNCTION_P (op))")))
;; Return 1 if op is an operand that can be loaded via the GOT.
-;; or non-special register register field no cr0
+;; or non-special register field no cr0
(define_predicate "got_operand"
(match_code "symbol_ref,const,label_ref"))
/* Return the narrowest CC mode that spans both modes offered. If they
intersect, this will be the wider of the two, and if they do not then
- find find one that is a superset of both (i.e. CCNZmode for a pair
+ find one that is a superset of both (i.e. CCNZmode for a pair
consisting of CCNmode and CCZmode). A wider CC writer will satisfy
a narrower CC reader, e.g. a comparison operator that uses CCZmode
can use a CCNZmode output of a previous instruction. */
cp_walk_tree (await_init, co_await_find_in_subtree, &aw_expr_ptr, NULL))
expand_one_await_expression (await_init, aw_expr_ptr, d);
- /* Expand any more await expressions in the the original statement. */
+ /* Expand any more await expressions in the original statement. */
if (cp_walk_tree (revised, co_await_find_in_subtree, &aw_expr_ptr, NULL))
expand_one_await_expression (revised, aw_expr_ptr, d);
}
/* Return true iff FROM can convert to TO by dropping noexcept.
- This is just a subroutine of of fnptr_conv_p. */
+ This is just a subroutine of fnptr_conv_p. */
static bool
noexcept_conv_p (tree to, tree from)
}
}
-/* Given a CLASSTYPE_DECL_LIST VALUE get the the template friend decl,
+/* Given a CLASSTYPE_DECL_LIST VALUE get the template friend decl,
if that's what this is. */
static tree
OUTER_TARGS is used during template argument deduction (context == adc_unify)
to properly substitute the result. It's also used in the adc_unify and
- adc_requirement contexts to communicate the the necessary template arguments
+ adc_requirement contexts to communicate the necessary template arguments
to satisfaction. OUTER_TARGS is ignored in other contexts.
For partial-concept-ids, extra args may be appended to the list of deduced
typedef struct GTY (()) ctf_func_arg
{
ctf_id_t farg_type; /* Type identifier of the argument. */
- const char * farg_name; /* Name of the the argument. */
+ const char * farg_name; /* Name of the argument. */
uint32_t farg_name_offset; /* Offset of the name in str table. */
struct ctf_func_arg * farg_next;/* A list node. */
} ctf_func_arg_t;
/* Linked list of !$omp declare variant constructs. */
struct gfc_omp_declare_variant *omp_declare_variant;
- /* A hash set for the the gfc expressions that have already
+ /* A hash set for the gfc expressions that have already
been finalized in this namespace. */
gfc_was_finalized *was_finalized;
/* For truncation and tab warnings, set seen_comment to false if one has
either an OpenMP or OpenACC directive - or a !GCC$ attribute. If
- OpenMP is enabled, use '!$' as as conditional compilation sentinel
+ OpenMP is enabled, use '!$' as conditional compilation sentinel
and OpenMP directive ('!$omp'). */
if (seen_comment && first_comment && flag_openmp && comment_ix + 1 == i
&& c == '$')
Note that allocatable implies 'len=:'. */
if (e->ts.type != BT_ASSUMED && e->ts.type != BT_CHARACTER )
{
- /* Length is known at compile time; use use 'block' for it. */
+ /* Length is known at compile time; use 'block' for it. */
tmp = size_in_bytes (gfc_typenode_for_spec (&e->ts));
tmp2 = gfc_get_cfi_desc_elem_len (cfi);
gfc_add_modify (&block, tmp2, fold_convert (TREE_TYPE (tmp2), tmp));
case BIT_AND_EXPR:
if (!lhs.zero_p ())
{
- // The TRUE side is the intersection of the the 2 true ranges.
+ // The TRUE side is the intersection of the 2 true ranges.
r = op1_true;
r.intersect (op2_true);
}
a bound that's larger than the size of either array makes no sense
and is likely a bug. When the length of neither of the two strings
is known but the sizes of both of the arrays they are stored in is,
- issue a warning if the bound is larger than than the size of
+ issue a warning if the bound is larger than the size of
the larger of the two arrays. */
c_strlen_data lendata1{ }, lendata2{ };
0 and there will be no overflow, if the first argument is
negative and the second argument positive, the result when
treated as signed will be negative (minimum -0x7f80 or
- -0x7f..f80..0) there there will be always overflow. So, do
+ -0x7f..f80..0) there will be always overflow. So, do
res = (U) (s1 * u2)
ovf = (S) res < 0 */
struct separate_ops ops;
if (!maybe_in_construction && !maybe_derived_type)
return false;
- /* If we are in fact not looking at any object object or the instance is
+ /* If we are in fact not looking at any object or the instance is
some placement new into a random load, give up straight away. */
if (TREE_CODE (instance) == MEM_REF)
return false;
bool thunk;
/* Call site with no available information. */
bool unknown_callsite;
- /* Call from outside the the candidate's comdat group. */
+ /* Call from outside the candidate's comdat group. */
bool call_from_outside_comdat;
/* There is a bit-aligned load into one of non-gimple-typed arguments. */
bool bit_aligned_aggregate_argument;
set to the corresponding value in `values`. `fields` and `values`
are paired by index.
- Each value has to have have the same unqualified type as the field
+ Each value has to have the same unqualified type as the field
it is applied to.
A NULL value element in `values` is a shorthand for zero initialization
`value` specifies what value to set the corresponding field to.
If `value` is NULL, zero initialization will be used.
- Each value has to have have the same unqualified type as the field
+ Each value has to have the same unqualified type as the field
it is applied to.
`field` need to be the same objects that were used
(which may be greater than MAX_OBJECT_SIZE).
The lower bound is either the sum of the current offset and
MIN when abs(MAX) is greater than the former, or zero otherwise.
- Zero because then then inverted range includes the negative of
+ Zero because then the inverted range includes the negative of
the lower bound. */
offset_int maxoff = wi::to_offset (TYPE_MAX_VALUE (ptrdiff_type_node));
offrng[1] = maxoff;
gimple_stmt_iterator new_gsi);
};
-/* Call post_new_stmt for each each new statement that has been added
+/* Call post_new_stmt for each new statement that has been added
to the current BB. OLD_GSI is the statement iterator before the BB
changes ocurred. NEW_GSI is the iterator which may contain new
statements. */
return;
/* Initialize a map of attribute access specifications for arguments
- to the function function call. */
+ to the function call. */
rdwr_map rdwr_idx;
init_attr_rdwr_indices (&rdwr_idx, TYPE_ATTRIBUTES (fntype));
return true;
}
-/* Counters and limits controlling the the depth of analysis and
+/* Counters and limits controlling the depth of analysis and
strictness of the warning. */
struct wlimits
{
const bool save_always_executed = wlims.always_executed;
/* Initialize a map of attribute access specifications for arguments
- to the function function call. */
+ to the function call. */
rdwr_map rdwr_idx;
init_attr_rdwr_indices (&rdwr_idx, TYPE_ATTRIBUTES (fntype));
static void
warn_uninitialized_vars (bool wmaybe_uninit)
{
- /* Counters and limits controlling the the depth of the warning. */
+ /* Counters and limits controlling the depth of the warning. */
wlimits wlims = { };
wlims.wmaybe_uninit = wmaybe_uninit;
// relation comes back EQ_EXPR, it is also possible to query the set of
// equivlaencies. These are basically bitmaps over ssa_names.
//
-// relations are maintained via the dominace trees, are are optimized assuming
+// Relations are maintained via the dominace trees and are optimized assuming
// they are registered in dominance order. When a new relation is added, it
// is intersected with whatever existing relation exists in the dominance tree
// and registered at the specified block.
a new section with the given fields if no such structure exists.
When NOT_EXISTING, then fail if the section already exists. Return
the existing section if the SECTION_RETAIN bit doesn't match. Set
- the SECTION_WRITE | SECTION_RELRO bits on the the existing section
+ the SECTION_WRITE | SECTION_RELRO bits on the existing section
if one of the section flags is SECTION_WRITE | SECTION_RELRO and the
other has none of these flags in named sections and either the section
hasn't been declared yet or has been declared as writable. */
projects / thirdparty / gcc.git / commitdiff
