mirror of
git://gcc.gnu.org/git/gcc.git
synced 2025-03-09 03:29:02 +08:00
emmintrin.h: Fix comment typos.
* config/i386/emmintrin.h: Fix comment typos. * config/i386/i386.c: Likewise. * config/i386/i386.h: Likewise. * config/i386/sco5.h: Likewise. * config/ia64/ia64.c: Likewise. * config/ia64/itanium2.md: Likewise. From-SVN: r68857
This commit is contained in:
parent
82911f36f9
commit
c51e6d855e
@ -1,3 +1,12 @@
|
||||
2003-07-02 Kazu Hirata <kazu@cs.umass.edu>
|
||||
|
||||
* config/i386/emmintrin.h: Fix comment typos.
|
||||
* config/i386/i386.c: Likewise.
|
||||
* config/i386/i386.h: Likewise.
|
||||
* config/i386/sco5.h: Likewise.
|
||||
* config/ia64/ia64.c: Likewise.
|
||||
* config/ia64/itanium2.md: Likewise.
|
||||
|
||||
2003-07-02 H.J. Lu <hongjiu.lu@intel.com>
|
||||
|
||||
* dbxout.c (pending_bincls): Replace DBX_USE_BINCLS with
|
||||
|
@ -147,7 +147,7 @@ _mm_store_sd (double *__P, __m128d __A)
|
||||
__builtin_ia32_storesd (__P, (__v2df)__A);
|
||||
}
|
||||
|
||||
/* Store the lower DPFP value acrosd two words. */
|
||||
/* Store the lower DPFP value across two words. */
|
||||
static __inline void
|
||||
_mm_store1_pd (double *__P, __m128d __A)
|
||||
{
|
||||
|
@ -2608,7 +2608,7 @@ contains_128bit_aligned_vector_p (type)
|
||||
|
||||
if (AGGREGATE_TYPE_P (type))
|
||||
{
|
||||
/* Walk the agregates recursivly. */
|
||||
/* Walk the agregates recursively. */
|
||||
if (TREE_CODE (type) == RECORD_TYPE
|
||||
|| TREE_CODE (type) == UNION_TYPE
|
||||
|| TREE_CODE (type) == QUAL_UNION_TYPE)
|
||||
@ -9597,9 +9597,9 @@ ix86_expand_carry_flag_compare (code, op0, op1, pop)
|
||||
code = swap_condition (code);
|
||||
}
|
||||
|
||||
/* Try to expand the comparsion and verify that we end up with carry flag
|
||||
based comparsion. This is fails to be true only when we decide to expand
|
||||
comparsion using arithmetic that is not too common scenario. */
|
||||
/* Try to expand the comparison and verify that we end up with carry flag
|
||||
based comparison. This is fails to be true only when we decide to expand
|
||||
comparison using arithmetic that is not too common scenario. */
|
||||
start_sequence ();
|
||||
compare_op = ix86_expand_fp_compare (code, op0, op1, NULL_RTX,
|
||||
&second_test, &bypass_test);
|
||||
@ -12217,7 +12217,7 @@ ix86_adjust_cost (insn, link, dep_insn, cost)
|
||||
floating unit pipeline preparation stages, the memory operands
|
||||
for floating point are cheaper.
|
||||
|
||||
??? For Athlon it the difference is most propbably 2. */
|
||||
??? For Athlon it the difference is most probably 2. */
|
||||
if (unit == UNIT_INTEGER || unit == UNIT_UNKNOWN)
|
||||
loadcost = 3;
|
||||
else
|
||||
@ -15690,7 +15690,7 @@ x86_function_profiler (file, labelno)
|
||||
|
||||
/* We don't have exact information about the insn sizes, but we may assume
|
||||
quite safely that we are informed about all 1 byte insns and memory
|
||||
address sizes. This is enought to elliminate unnecesary padding in
|
||||
address sizes. This is enough to eliminate unnecessary padding in
|
||||
99% of cases. */
|
||||
|
||||
static int
|
||||
@ -15735,7 +15735,7 @@ min_insn_size (insn)
|
||||
return 2;
|
||||
}
|
||||
|
||||
/* AMD K8 core misspredicts jumps when there are more than 3 jumps in 16 byte
|
||||
/* AMD K8 core mispredicts jumps when there are more than 3 jumps in 16 byte
|
||||
window. */
|
||||
|
||||
static void
|
||||
@ -15839,7 +15839,7 @@ ix86_reorg ()
|
||||
&& ((GET_CODE (prev) == JUMP_INSN && any_condjump_p (prev))
|
||||
|| GET_CODE (prev) == CALL_INSN))
|
||||
replace = true;
|
||||
/* Empty functions get branch misspredict even when the jump destination
|
||||
/* Empty functions get branch mispredict even when the jump destination
|
||||
is not visible to us. */
|
||||
if (!prev && cfun->function_frequency > FUNCTION_FREQUENCY_UNLIKELY_EXECUTED)
|
||||
replace = true;
|
||||
|
@ -1248,7 +1248,7 @@ do { \
|
||||
#define RETURN_IN_MEMORY(TYPE) \
|
||||
ix86_return_in_memory (TYPE)
|
||||
|
||||
/* This is overriden by <cygwin.h>. */
|
||||
/* This is overridden by <cygwin.h>. */
|
||||
#define MS_AGGREGATE_RETURN 0
|
||||
|
||||
|
||||
|
@ -36,7 +36,7 @@ Boston, MA 02111-1307, USA. */
|
||||
* Here's the reason why. If we dont define them, and we dont define them
|
||||
* to always emit to the same section, the default is to emit to "named"
|
||||
* ctors and dtors sections. This would be great if we could use GNU ld,
|
||||
* but we can't. The native linker could possibly be trained to coallesce
|
||||
* but we can't. The native linker could possibly be trained to coalesce
|
||||
* named ctors sections, but that hasn't been done either. So if we don't
|
||||
* define these, many C++ ctors and dtors dont get run, because they never
|
||||
* wind up in the ctors/dtors arrays.
|
||||
|
@ -4268,7 +4268,7 @@ ia64_secondary_reload_class (class, mode, x)
|
||||
break;
|
||||
|
||||
case FR_REGS:
|
||||
/* Need to go through general regsters to get to other class regs. */
|
||||
/* Need to go through general registers to get to other class regs. */
|
||||
if (regno >= 0 && ! (FR_REGNO_P (regno) || GENERAL_REGNO_P (regno)))
|
||||
return GR_REGS;
|
||||
|
||||
|
@ -484,7 +484,7 @@
|
||||
(define_reservation "2_M_only_um01" "2_M0_only_um01|2_M1_only_um01")
|
||||
|
||||
;; I instruction is dispersed to the lowest numbered I unit
|
||||
;; not already in use. Remeber about possible spliting.
|
||||
;; not already in use. Remeber about possible splitting.
|
||||
(define_reservation "2_I0"
|
||||
"2_0mi.i+2_ui0|2_0mii.+(2_ui0|2_ui1)|2_0mmi.+2_ui0\
|
||||
|2_0mfi.+2_ui0|2_0mi.b+2_ui0|(2_1mi.i|2_1mi.b)+(2_ui0|2_ui1)\
|
||||
@ -1335,7 +1335,7 @@
|
||||
+(2b_um2|2b_um3)")
|
||||
|
||||
;; I instruction is dispersed to the lowest numbered I unit
|
||||
;; not already in use. Remeber about possible spliting.
|
||||
;; not already in use. Remeber about possible splitting.
|
||||
(define_reservation "2b_I"
|
||||
"2b_0mi.i+2_2+2b_ui0|2b_0mii.+2_3+(2b_ui0|2b_ui1)|2b_0mmi.+2_3+2b_ui0\
|
||||
|2b_0mfi.+2_3+2b_ui0|2b_0mi.b+2_2+2b_ui0\
|
||||
|
Loading…
Reference in New Issue
Block a user