Wed, 07 May 2008 08:06:46 -0700
6603011: RFE: Optimize long division
Summary: Transform long division by constant into multiply
Reviewed-by: never, kvn
duke@435 | 1 | /* |
duke@435 | 2 | * Copyright 2000-2005 Sun Microsystems, Inc. All Rights Reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | // native word offsets from memory address (little endian) |
duke@435 | 26 | enum { |
duke@435 | 27 | pd_lo_word_offset_in_bytes = 0, |
duke@435 | 28 | pd_hi_word_offset_in_bytes = BytesPerWord |
duke@435 | 29 | }; |
duke@435 | 30 | |
duke@435 | 31 | // explicit rounding operations are required to implement the strictFP mode |
duke@435 | 32 | enum { |
duke@435 | 33 | pd_strict_fp_requires_explicit_rounding = true |
duke@435 | 34 | }; |
duke@435 | 35 | |
duke@435 | 36 | |
duke@435 | 37 | // registers |
duke@435 | 38 | enum { |
duke@435 | 39 | pd_nof_cpu_regs_frame_map = 8, // number of registers used during code emission |
duke@435 | 40 | pd_nof_fpu_regs_frame_map = 8, // number of registers used during code emission |
duke@435 | 41 | pd_nof_xmm_regs_frame_map = 8, // number of registers used during code emission |
duke@435 | 42 | pd_nof_caller_save_cpu_regs_frame_map = 6, // number of registers killed by calls |
duke@435 | 43 | pd_nof_caller_save_fpu_regs_frame_map = 8, // number of registers killed by calls |
duke@435 | 44 | pd_nof_caller_save_xmm_regs_frame_map = 8, // number of registers killed by calls |
duke@435 | 45 | |
duke@435 | 46 | pd_nof_cpu_regs_reg_alloc = 6, // number of registers that are visible to register allocator |
duke@435 | 47 | pd_nof_fpu_regs_reg_alloc = 6, // number of registers that are visible to register allocator |
duke@435 | 48 | |
duke@435 | 49 | pd_nof_cpu_regs_linearscan = 8, // number of registers visible to linear scan |
duke@435 | 50 | pd_nof_fpu_regs_linearscan = 8, // number of registers visible to linear scan |
duke@435 | 51 | pd_nof_xmm_regs_linearscan = 8, // number of registers visible to linear scan |
duke@435 | 52 | pd_first_cpu_reg = 0, |
duke@435 | 53 | pd_last_cpu_reg = 5, |
duke@435 | 54 | pd_first_byte_reg = 2, |
duke@435 | 55 | pd_last_byte_reg = 5, |
duke@435 | 56 | pd_first_fpu_reg = pd_nof_cpu_regs_frame_map, |
duke@435 | 57 | pd_last_fpu_reg = pd_first_fpu_reg + 7, |
duke@435 | 58 | pd_first_xmm_reg = pd_nof_cpu_regs_frame_map + pd_nof_fpu_regs_frame_map, |
duke@435 | 59 | pd_last_xmm_reg = pd_first_xmm_reg + 7 |
duke@435 | 60 | }; |
duke@435 | 61 | |
duke@435 | 62 | |
duke@435 | 63 | // encoding of float value in debug info: |
duke@435 | 64 | enum { |
duke@435 | 65 | pd_float_saved_as_double = true |
duke@435 | 66 | }; |