sewardj | a704d35 | 2004-07-10 12:22:40 +0000 | [diff] [blame] | 1 | |
| 2 | /*---------------------------------------------------------------*/ |
sewardj | 752f906 | 2010-05-03 21:38:49 +0000 | [diff] [blame] | 3 | /*--- begin host_generic_regs.c ---*/ |
sewardj | a704d35 | 2004-07-10 12:22:40 +0000 | [diff] [blame] | 4 | /*---------------------------------------------------------------*/ |
| 5 | |
sewardj | f8ed9d8 | 2004-11-12 17:40:23 +0000 | [diff] [blame] | 6 | /* |
sewardj | 752f906 | 2010-05-03 21:38:49 +0000 | [diff] [blame] | 7 | This file is part of Valgrind, a dynamic binary instrumentation |
| 8 | framework. |
sewardj | f8ed9d8 | 2004-11-12 17:40:23 +0000 | [diff] [blame] | 9 | |
sewardj | 89ae847 | 2013-10-18 14:12:58 +0000 | [diff] [blame] | 10 | Copyright (C) 2004-2013 OpenWorks LLP |
sewardj | 752f906 | 2010-05-03 21:38:49 +0000 | [diff] [blame] | 11 | info@open-works.net |
sewardj | f8ed9d8 | 2004-11-12 17:40:23 +0000 | [diff] [blame] | 12 | |
sewardj | 752f906 | 2010-05-03 21:38:49 +0000 | [diff] [blame] | 13 | This program is free software; you can redistribute it and/or |
| 14 | modify it under the terms of the GNU General Public License as |
| 15 | published by the Free Software Foundation; either version 2 of the |
| 16 | License, or (at your option) any later version. |
sewardj | f8ed9d8 | 2004-11-12 17:40:23 +0000 | [diff] [blame] | 17 | |
sewardj | 752f906 | 2010-05-03 21:38:49 +0000 | [diff] [blame] | 18 | This program is distributed in the hope that it will be useful, but |
| 19 | WITHOUT ANY WARRANTY; without even the implied warranty of |
| 20 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 21 | General Public License for more details. |
| 22 | |
| 23 | You should have received a copy of the GNU General Public License |
| 24 | along with this program; if not, write to the Free Software |
| 25 | Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA |
sewardj | 7bd6ffe | 2005-08-03 16:07:36 +0000 | [diff] [blame] | 26 | 02110-1301, USA. |
| 27 | |
sewardj | 752f906 | 2010-05-03 21:38:49 +0000 | [diff] [blame] | 28 | The GNU General Public License is contained in the file COPYING. |
sewardj | f8ed9d8 | 2004-11-12 17:40:23 +0000 | [diff] [blame] | 29 | |
| 30 | Neither the names of the U.S. Department of Energy nor the |
| 31 | University of California nor the names of its contributors may be |
| 32 | used to endorse or promote products derived from this software |
| 33 | without prior written permission. |
sewardj | f8ed9d8 | 2004-11-12 17:40:23 +0000 | [diff] [blame] | 34 | */ |
| 35 | |
sewardj | a704d35 | 2004-07-10 12:22:40 +0000 | [diff] [blame] | 36 | #include "libvex_basictypes.h" |
| 37 | #include "libvex.h" |
| 38 | |
sewardj | cef7d3e | 2009-07-02 12:21:59 +0000 | [diff] [blame] | 39 | #include "main_util.h" |
| 40 | #include "host_generic_regs.h" |
sewardj | a704d35 | 2004-07-10 12:22:40 +0000 | [diff] [blame] | 41 | |
| 42 | |
sewardj | a704d35 | 2004-07-10 12:22:40 +0000 | [diff] [blame] | 43 | void ppHRegClass ( HRegClass hrc ) |
| 44 | { |
| 45 | switch (hrc) { |
sewardj | 4a31b26 | 2004-12-01 02:24:44 +0000 | [diff] [blame] | 46 | case HRcInt32: vex_printf("HRcInt32"); break; |
| 47 | case HRcInt64: vex_printf("HRcInt64"); break; |
sewardj | 6c299f3 | 2009-12-31 18:00:12 +0000 | [diff] [blame] | 48 | case HRcFlt32: vex_printf("HRcFlt32"); break; |
sewardj | 4a31b26 | 2004-12-01 02:24:44 +0000 | [diff] [blame] | 49 | case HRcFlt64: vex_printf("HRcFlt64"); break; |
| 50 | case HRcVec64: vex_printf("HRcVec64"); break; |
| 51 | case HRcVec128: vex_printf("HRcVec128"); break; |
sewardj | a704d35 | 2004-07-10 12:22:40 +0000 | [diff] [blame] | 52 | default: vpanic("ppHRegClass"); |
| 53 | } |
| 54 | } |
| 55 | |
| 56 | /* Generic printing for registers. */ |
| 57 | void ppHReg ( HReg r ) |
| 58 | { |
florian | 55085f8 | 2012-11-21 00:36:55 +0000 | [diff] [blame] | 59 | const HChar* maybe_v = hregIsVirtual(r) ? "v" : ""; |
sewardj | a8415ff | 2005-01-21 20:55:36 +0000 | [diff] [blame] | 60 | Int regNo = hregNumber(r); |
sewardj | a704d35 | 2004-07-10 12:22:40 +0000 | [diff] [blame] | 61 | switch (hregClass(r)) { |
sewardj | 4a31b26 | 2004-12-01 02:24:44 +0000 | [diff] [blame] | 62 | case HRcInt32: vex_printf("%%%sr%d", maybe_v, regNo); return; |
| 63 | case HRcInt64: vex_printf("%%%sR%d", maybe_v, regNo); return; |
sewardj | 6c299f3 | 2009-12-31 18:00:12 +0000 | [diff] [blame] | 64 | case HRcFlt32: vex_printf("%%%sF%d", maybe_v, regNo); return; |
| 65 | case HRcFlt64: vex_printf("%%%sD%d", maybe_v, regNo); return; |
sewardj | 4a31b26 | 2004-12-01 02:24:44 +0000 | [diff] [blame] | 66 | case HRcVec64: vex_printf("%%%sv%d", maybe_v, regNo); return; |
| 67 | case HRcVec128: vex_printf("%%%sV%d", maybe_v, regNo); return; |
sewardj | a704d35 | 2004-07-10 12:22:40 +0000 | [diff] [blame] | 68 | default: vpanic("ppHReg"); |
| 69 | } |
| 70 | } |
| 71 | |
| 72 | |
| 73 | /*---------------------------------------------------------*/ |
| 74 | /*--- Helpers for recording reg usage (for reg-alloc) ---*/ |
| 75 | /*---------------------------------------------------------*/ |
| 76 | |
| 77 | void ppHRegUsage ( HRegUsage* tab ) |
| 78 | { |
sewardj | 4a6f384 | 2005-03-26 11:59:23 +0000 | [diff] [blame] | 79 | Int i; |
florian | 55085f8 | 2012-11-21 00:36:55 +0000 | [diff] [blame] | 80 | const HChar* str; |
sewardj | a704d35 | 2004-07-10 12:22:40 +0000 | [diff] [blame] | 81 | vex_printf("HRegUsage {\n"); |
| 82 | for (i = 0; i < tab->n_used; i++) { |
| 83 | switch (tab->mode[i]) { |
| 84 | case HRmRead: str = "Read "; break; |
| 85 | case HRmWrite: str = "Write "; break; |
| 86 | case HRmModify: str = "Modify "; break; |
| 87 | default: vpanic("ppHRegUsage"); |
| 88 | } |
| 89 | vex_printf(" %s ", str); |
| 90 | ppHReg(tab->hreg[i]); |
| 91 | vex_printf("\n"); |
| 92 | } |
| 93 | vex_printf("}\n"); |
| 94 | } |
| 95 | |
| 96 | |
sewardj | a704d35 | 2004-07-10 12:22:40 +0000 | [diff] [blame] | 97 | /* Add a register to a usage table. Combine incoming read uses with |
| 98 | existing write uses into a modify use, and vice versa. Do not |
| 99 | create duplicate entries -- each reg should only be mentioned once. |
| 100 | */ |
| 101 | void addHRegUse ( HRegUsage* tab, HRegMode mode, HReg reg ) |
| 102 | { |
| 103 | Int i; |
| 104 | /* Find it ... */ |
| 105 | for (i = 0; i < tab->n_used; i++) |
florian | 79efdc6 | 2013-02-11 00:47:35 +0000 | [diff] [blame] | 106 | if (sameHReg(tab->hreg[i], reg)) |
sewardj | a704d35 | 2004-07-10 12:22:40 +0000 | [diff] [blame] | 107 | break; |
| 108 | if (i == tab->n_used) { |
| 109 | /* Not found, add new entry. */ |
sewardj | 2778bcf | 2004-09-09 02:45:30 +0000 | [diff] [blame] | 110 | vassert(tab->n_used < N_HREG_USAGE); |
sewardj | a704d35 | 2004-07-10 12:22:40 +0000 | [diff] [blame] | 111 | tab->hreg[tab->n_used] = reg; |
| 112 | tab->mode[tab->n_used] = mode; |
| 113 | tab->n_used++; |
| 114 | } else { |
| 115 | /* Found: combine or ignore. */ |
sewardj | 3f21fd3 | 2005-10-22 12:46:06 +0000 | [diff] [blame] | 116 | /* This is a greatest-lower-bound operation in the poset: |
| 117 | |
| 118 | R W |
| 119 | \ / |
| 120 | M |
| 121 | |
| 122 | Need to do: tab->mode[i] = GLB(tab->mode, mode). In this |
| 123 | case very simple -- if tab->mode[i] != mode then result must |
| 124 | be M. |
| 125 | */ |
| 126 | if (tab->mode[i] == mode) { |
| 127 | /* duplicate, ignore */ |
| 128 | } else { |
sewardj | a704d35 | 2004-07-10 12:22:40 +0000 | [diff] [blame] | 129 | tab->mode[i] = HRmModify; |
sewardj | a704d35 | 2004-07-10 12:22:40 +0000 | [diff] [blame] | 130 | } |
sewardj | a704d35 | 2004-07-10 12:22:40 +0000 | [diff] [blame] | 131 | } |
| 132 | } |
| 133 | |
| 134 | |
| 135 | /*---------------------------------------------------------*/ |
| 136 | /*--- Indicating register remappings (for reg-alloc) ---*/ |
| 137 | /*---------------------------------------------------------*/ |
| 138 | |
| 139 | void ppHRegRemap ( HRegRemap* map ) |
| 140 | { |
| 141 | Int i; |
| 142 | vex_printf("HRegRemap {\n"); |
| 143 | for (i = 0; i < map->n_used; i++) { |
| 144 | vex_printf(" "); |
| 145 | ppHReg(map->orig[i]); |
| 146 | vex_printf(" --> "); |
| 147 | ppHReg(map->replacement[i]); |
| 148 | vex_printf("\n"); |
| 149 | } |
| 150 | vex_printf("}\n"); |
| 151 | } |
| 152 | |
| 153 | |
| 154 | void initHRegRemap ( HRegRemap* map ) |
| 155 | { |
| 156 | map->n_used = 0; |
| 157 | } |
| 158 | |
| 159 | |
| 160 | void addToHRegRemap ( HRegRemap* map, HReg orig, HReg replacement ) |
| 161 | { |
| 162 | Int i; |
| 163 | for (i = 0; i < map->n_used; i++) |
florian | 79efdc6 | 2013-02-11 00:47:35 +0000 | [diff] [blame] | 164 | if (sameHReg(map->orig[i], orig)) |
sewardj | a704d35 | 2004-07-10 12:22:40 +0000 | [diff] [blame] | 165 | vpanic("addToHRegMap: duplicate entry"); |
| 166 | if (!hregIsVirtual(orig)) |
| 167 | vpanic("addToHRegMap: orig is not a vreg"); |
| 168 | if (hregIsVirtual(replacement)) |
florian | 81c22f0 | 2011-08-19 02:58:51 +0000 | [diff] [blame] | 169 | vpanic("addToHRegMap: replacement is a vreg"); |
sewardj | a704d35 | 2004-07-10 12:22:40 +0000 | [diff] [blame] | 170 | |
| 171 | vassert(map->n_used+1 < N_HREG_REMAP); |
| 172 | map->orig[map->n_used] = orig; |
| 173 | map->replacement[map->n_used] = replacement; |
| 174 | map->n_used++; |
| 175 | } |
| 176 | |
| 177 | |
| 178 | HReg lookupHRegRemap ( HRegRemap* map, HReg orig ) |
| 179 | { |
| 180 | Int i; |
| 181 | if (!hregIsVirtual(orig)) |
| 182 | return orig; |
| 183 | for (i = 0; i < map->n_used; i++) |
florian | 79efdc6 | 2013-02-11 00:47:35 +0000 | [diff] [blame] | 184 | if (sameHReg(map->orig[i], orig)) |
sewardj | a704d35 | 2004-07-10 12:22:40 +0000 | [diff] [blame] | 185 | return map->replacement[i]; |
| 186 | vpanic("lookupHRegRemap: not found"); |
| 187 | } |
| 188 | |
| 189 | /*---------------------------------------------------------*/ |
| 190 | /*--- Abstract instructions ---*/ |
| 191 | /*---------------------------------------------------------*/ |
| 192 | |
| 193 | HInstrArray* newHInstrArray ( void ) |
| 194 | { |
| 195 | HInstrArray* ha = LibVEX_Alloc(sizeof(HInstrArray)); |
| 196 | ha->arr_size = 4; |
| 197 | ha->arr_used = 0; |
| 198 | ha->arr = LibVEX_Alloc(ha->arr_size * sizeof(HInstr*)); |
| 199 | ha->n_vregs = 0; |
| 200 | return ha; |
| 201 | } |
| 202 | |
| 203 | void addHInstr ( HInstrArray* ha, HInstr* instr ) |
| 204 | { |
| 205 | vassert(ha->arr_used <= ha->arr_size); |
| 206 | if (ha->arr_used < ha->arr_size) { |
| 207 | ha->arr[ha->arr_used] = instr; |
| 208 | ha->arr_used++; |
| 209 | } else { |
| 210 | Int i; |
| 211 | HInstr** arr2 = LibVEX_Alloc(ha->arr_size * 2 * sizeof(HInstr*)); |
| 212 | for (i = 0; i < ha->arr_size; i++) |
| 213 | arr2[i] = ha->arr[i]; |
| 214 | ha->arr_size *= 2; |
| 215 | ha->arr = arr2; |
| 216 | addHInstr(ha, instr); |
| 217 | } |
| 218 | } |
| 219 | |
| 220 | |
sewardj | cfe046e | 2013-01-17 14:23:53 +0000 | [diff] [blame] | 221 | /*---------------------------------------------------------*/ |
| 222 | /*--- C-Call return-location actions ---*/ |
| 223 | /*---------------------------------------------------------*/ |
| 224 | |
| 225 | void ppRetLoc ( RetLoc ska ) |
| 226 | { |
sewardj | 74142b8 | 2013-08-08 10:28:59 +0000 | [diff] [blame] | 227 | switch (ska.pri) { |
| 228 | case RLPri_INVALID: |
| 229 | vex_printf("RLPri_INVALID"); return; |
| 230 | case RLPri_None: |
| 231 | vex_printf("RLPri_None"); return; |
| 232 | case RLPri_Int: |
| 233 | vex_printf("RLPri_Int"); return; |
| 234 | case RLPri_2Int: |
| 235 | vex_printf("RLPri_2Int"); return; |
| 236 | case RLPri_V128SpRel: |
| 237 | vex_printf("RLPri_V128SpRel(%d)", ska.spOff); return; |
| 238 | case RLPri_V256SpRel: |
| 239 | vex_printf("RLPri_V256SpRel(%d)", ska.spOff); return; |
| 240 | default: |
| 241 | vpanic("ppRetLoc"); |
sewardj | cfe046e | 2013-01-17 14:23:53 +0000 | [diff] [blame] | 242 | } |
| 243 | } |
| 244 | |
| 245 | |
sewardj | a704d35 | 2004-07-10 12:22:40 +0000 | [diff] [blame] | 246 | /*---------------------------------------------------------------*/ |
sewardj | cef7d3e | 2009-07-02 12:21:59 +0000 | [diff] [blame] | 247 | /*--- end host_generic_regs.c ---*/ |
sewardj | a704d35 | 2004-07-10 12:22:40 +0000 | [diff] [blame] | 248 | /*---------------------------------------------------------------*/ |