summaryrefslogtreecommitdiff
path: root/gcc/expmed.c
Commit message (Expand)AuthorAgeFilesLines
* (expand_mult): Preserve useful sub-expressions whenkenner1993-12-231-10/+15
* (store_split_bit_field): Properly load a constant VALUErms1993-11-151-6/+12
* (expand_divmod): If rem_flag, always force op0 to a register.rms1993-11-101-3/+4
* (expand_divmod): Use target as copy_to_suggested_regrms1993-11-031-1/+8
* (synth_mult): When factoring T, break from loop after first factor.tege1993-11-011-1/+4
* (store_bit_field): When calling operand_subword_force,rms1993-10-301-1/+4
* (init_expmed): Use register 10000, not FIRST_PSEUDO_REGISTERrms1993-10-261-2/+2
* (expand_divmod): Create RESULT in proper mode when tryingkenner1993-10-211-1/+1
* (extract_split_bit_field): Change shift count calculationrms1993-10-181-2/+2
* (expand_shift): Use convert_modes.rms1993-09-121-7/+7
* (emit_store_flag, expand_divmod): Use convert_modes.rms1993-09-091-5/+5
* (make_tree, case CONST_INT): Properly set high part if unsigned.kenner1993-09-081-1/+1
* * expmed.c (store_bit_field): Do not use bitfield instructions forlaw1993-08-251-3/+6
* (SLOW_UNALIGNED_ACCESS): Define, but allow override.rms1993-08-111-10/+28
* (expand_divmod): Clean up code and documentation, especially in areaskenner1993-08-071-87/+85
* (mult_is_very_cheap): Delete.kenner1993-07-301-108/+106
* * expmed.c (store_split_bitfield): Fix handling of bitfields thatdje1993-07-281-7/+25
* (store_split_bit_field, extract_split_bit_field):rms1993-07-051-130/+113
* (MAX_BITS_PER_WORD): Define earlier.rms1993-06-101-7/+11
* (synth_mult): Move code to add or subtract attege1993-06-051-52/+49
* (init_expmed): Supply missing arg to rtx_cost.rms1993-05-081-1/+1
* (store_split_bit_field): Properly handle VALUE when it is akenner1993-05-061-2/+7
* (extract_fixed_bit_field): Adjust BITPOS so that itwilson1993-04-251-0/+10
* (expand_divmod): When adjusting op0 for trunc_div orrms1993-04-111-9/+17
* (init_expmed): Fix typo in last change.tege1993-03-201-2/+2
* (synth_mult): Don't try to make recursive call if we would be shiftingkenner1993-03-191-21/+27
* (zero_cost): New variable.kenner1993-03-191-167/+176
* (lea_max_mul): Delete.kenner1993-03-151-51/+88
* (shift_cost): Now a vector.kenner1993-03-151-265/+238
* (emit_store_flag): Fix typo in testing BRANCH_COST.kenner1993-02-251-1/+1
* (emit_store_flag): Add missing arg to convert_move.rms1993-02-081-1/+1
* (emit_store_flag): Swap operands if first is a constant and second is not.kenner1993-01-281-5/+18
* (emit_store_flag): Reset ICODE using returned COMPARISON.rms1993-01-241-1/+7
* (expand_shift): If rotating by a constant, try both directions ofkenner1992-12-281-1/+46
* (store_bit_field): If VALUE needs to be narrowed, dorms1992-12-271-4/+10
* (struct algorithm): Make coeff a HOST_WIDE_INT.rms1992-11-261-1/+1
* (expand_mult): Bound second synth_mult cost by cost of algorithm fromkenner1992-08-171-4/+7
* (expand_divmod): Eliminate the generation of brancheswood1992-07-251-12/+54
* (expand_shift, expand_set_flag):rms1992-07-171-3/+7
* entered into RCSmycroft1992-07-061-116/+122
* *** empty log message ***kenner1992-06-281-0/+6
* *** empty log message ***rms1992-05-271-0/+5
* *** empty log message ***kenner1992-05-221-0/+8
* *** empty log message ***rms1992-05-181-1/+5
* *** empty log message ***rms1992-05-141-2/+14
* *** empty log message ***rms1992-04-191-2/+7
* *** empty log message ***rms1992-04-181-9/+9
* *** empty log message ***kenner1992-04-041-7/+4
* *** empty log message ***rms1992-03-231-9/+18
* Initial revisiontege1992-03-061-0/+2946