mu - Soul of a tiny new machine. More thorough tests → More comprehensible and rewrite-friendly software → More resilient society.

	Commit message (Expand)	Author	Age	Files	Lines
*	.	Kartik Agaram	2021-04-21	1	-4/+4
*	.	Kartik Agaram	2021-03-23	1	-0/+1067

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd"> <html> <head> <meta http-equiv="content-type" content="text/html; charset=UTF-8"> <title>Mu - linux/bootstrap/010vm.cc</title> <meta name="Generator" content="Vim/8.1"> <meta name="plugin-version" content="vim8.1_v1"> <meta name="syntax" content="cpp"> <meta name="settings" content="number_lines,use_css,pre_wrap,no_foldcolumn,expand_tabs,line_ids,prevent_copy="> <meta name="colorscheme" content="minimal-dark"> <style type="text/css">  </style> <script type='text/javascript'>  </script> </head> <body onload='JumpToLine();'> <a href='https://github.com/akkartik/mu/blob/main/linux/bootstrap/010vm.cc'>https://github.com/akkartik/mu/blob/main/linux/bootstrap/010vm.cc</a> <pre id='vimCodeElement'> 1 //: Core data structures for simulating the SubX VM (subset of an x86 processor), 2 //: either in tests or debug aids. 3 4 //:: registers 5 //: assume segment registers are hard-coded to 0 6 //: no MMX, etc. 7 8 :(before "End Types") 9 enum { 10 <a href='010vm.cc.html#L10'>EAX</a>, 11 <a href='010vm.cc.html#L11'>ECX</a>, 12 <a href='010vm.cc.html#L12'>EDX</a>, 13 <a href='010vm.cc.html#L13'>EBX</a>, 14 <a href='010vm.cc.html#L14'>ESP</a>, 15 <a href='010vm.cc.html#L15'>EBP</a>, 16 <a href='010vm.cc.html#L16'>ESI</a>, 17 <a href='010vm.cc.html#L17'>EDI</a>, 18 <a href='010vm.cc.html#L18'>NUM_INT_REGISTERS</a>, 19 }; 20 union <a href='010vm.cc.html#L20'>reg</a> { 21 int32_t i; 22 uint32_t u; 23 }; 24 :(before "End Globals") 25 <a href='010vm.cc.html#L20'>reg</a> Reg[NUM_INT_REGISTERS] = { {0} }; 26 uint32_t <a href='010vm.cc.html#L26'>EIP</a> = 1; // preserve null pointer 27 :(before "End Reset") 28 bzero(<a href='010vm.cc.html#L25'>Reg</a>, sizeof(<a href='010vm.cc.html#L25'>Reg</a>)); 29 <a href='010vm.cc.html#L26'>EIP</a> = 1; // preserve null pointer 30 31 :(before "End Types") 32 const int <a href='010vm.cc.html#L32'>NUM_XMM_REGISTERS</a> = 8; 33 float Xmm[NUM_XMM_REGISTERS] = { 0.0 }; 34 const string Xname[NUM_XMM_REGISTERS] = { "XMM0", "XMM1", "XMM2", "XMM3", "XMM4", "XMM5", "XMM6", "XMM7" }; 35 :(before "End Reset") 36 bzero(<a href='010vm.cc.html#L33'>Xmm</a>, sizeof(<a href='010vm.cc.html#L33'>Xmm</a>)); 37 38 :(before "End <a href='001help.cc.html#L53'>Help</a> Contents") 39 cerr << " registers\n"; 40 :(before "End <a href='001help.cc.html#L53'>Help</a> Texts") 41 <a href='001help.cc.html#L237'>put_new</a>(<a href='001help.cc.html#L53'>Help</a>, "registers", 42 "SubX supports 16 registers: eight 32-bit integer registers and eight single-precision\n" 43 "floating-point registers. From 0 to 7, they are:\n" 44 " integer: <a href='010vm.cc.html#L10'>EAX</a> <a href='010vm.cc.html#L11'>ECX</a> <a href='010vm.cc.html#L12'>EDX</a> <a href='010vm.cc.html#L13'>EBX</a> <a href='010vm.cc.html#L14'>ESP</a> <a href='010vm.cc.html#L15'>EBP</a> <a href='010vm.cc.html#L16'>ESI</a> <a href='010vm.cc.html#L17'>EDI</a>\n" 45 " floating point: XMM0 XMM1 XMM2 XMM3 XMM4 XMM5 XMM6 XMM7\n" 46 "ESP contains the top of the stack.\n" 47 "\n" 48 "-- 8-bit registers\n" 49 "Some instructions operate on eight *overlapping* 8-bit registers.\n" 50 "From 0 to 7, they are:\n" 51 " AL CL DL BL AH CH DH BH\n" 52 "The 8-bit registers overlap with the 32-bit ones. AL is the lowest signicant byte\n" 53 "of <a href='010vm.cc.html#L10'>EAX</a>, AH is the second lowest significant byte, and so on.\n" 54 "\n" 55 "For example, if <a href='010vm.cc.html#L13'>EBX</a> contains 0x11223344, then BL contains 0x44, and BH contains 0x33.\n" 56 "\n" 57 "There is no way to access bytes within <a href='010vm.cc.html#L14'>ESP</a>, <a href='010vm.cc.html#L15'>EBP</a>, <a href='010vm.cc.html#L16'>ESI</a> or EDI.\n" 58 "\n" 59 "For complete details consult the IA-32 software developer's manual, volume 2,\n" 60 "table 2-2, \"32-bit addressing forms with the ModR/M byte\".\n" 61 "It is included in this repository as 'modrm.pdf'.\n" 62 "The register encodings are described in the top row of the table, but you'll need\n" 63 "to spend some time with it.\n" 64 "\n" 65 "-- flag registers\n" 66 "Various instructions (particularly 'compare') modify one or more of four 1-bit\n" 67 "'flag' registers, as a side-effect:\n" 68 "- the sign flag (SF): usually set if an arithmetic result is negative, or\n" 69 " <a href='000organization.cc.html#L150'>reset</a> if not.\n" 70 "- the zero flag (<a href='010vm.cc.html#L89'>ZF</a>): usually set if a result is zero, or <a href='000organization.cc.html#L150'>reset</a> if not.\n" 71 "- the carry flag (<a href='010vm.cc.html#L90'>CF</a>): usually set if an arithmetic result overflows by just one bit.\n" 72 " Useful for operating on unsigned numbers.\n" 73 "- the overflow flag (<a href='010vm.cc.html#L91'>OF</a>): usually set if an arithmetic result overflows by more\n" 74 " than one bit. Useful for operating on signed numbers.\n" 75 "The flag bits are read by conditional jumps.\n" 76 "\n" 77 "For complete details on how different instructions update the flags, consult the IA-32\n" 78 "manual (volume 2). There's various versions of it online, such as <a href="https://c9x.me/x86,">https://c9x.me/x86,</a>\n" 79 "though of course you'll need to be careful to ignore instructions and flag registers\n" 80 "that SubX doesn't support.\n" 81 "\n" 82 "It isn't simple, but if this is the processor you have running on your computer,\n" 83 "might as well get good at it.\n" 84 ); 85 86 :(before "End Globals") 87 // the subset of x86 flag registers we care about 88 bool SF = false; // sign flag 89 bool <a href='010vm.cc.html#L89'>ZF</a> = false; // zero flag 90 bool <a href='010vm.cc.html#L90'>CF</a> = false; // carry flag 91 bool <a href='010vm.cc.html#L91'>OF</a> = false; // overflow flag 92 :(before "End Reset") 93 SF = <a href='010vm.cc.html#L89'>ZF</a> = <a href='010vm.cc.html#L90'>CF</a> = <a href='010vm.cc.html#L91'>OF</a> = false; 94 95 //:: simulated RAM 96 97 :(before "End Types") 98 const uint32_t <a href='010vm.cc.html#L98'>SEGMENT_ALIGNMENT</a> = 0x1000000; // 16MB 99 inline uint32_t <a href='010vm.cc.html#L99'>align_upwards</a>(uint32_t x, uint32_t align) { 100 return (x+align-1) & -(align); 101 } 102 103 // Like in real-world Linux, we'll allocate RAM for our programs in disjoint 104 // slabs called VMAs or Virtual Memory Areas. 105 struct vma { 106 uint32_t start; // inclusive 107 uint32_t end; // exclusive 108 vector<uint8_t> <a href='010vm.cc.html#L108'>_data</a>; 109 vma(uint32_t s, uint32_t e) :start(s), end(e) {} 110 vma(uint32_t s) :start(s), end(<a href='010vm.cc.html#L99'>align_upwards</a>(s+1, <a href='010vm.cc.html#L98'>SEGMENT_ALIGNMENT</a>)) {} 111 bool <a href='010vm.cc.html#L111'>match</a>(uint32_t a) { 112 return a >= start && a < end; 113 } 114 bool <a href='010vm.cc.html#L114'>match32</a>(uint32_t a) { 115 return a >= start && a+4 <= end; 116 } 117 uint8_t& data(uint32_t a) { 118 assert(<a href='010vm.cc.html#L111'>match</a>(a)); 119 uint32_t result_index = a-start; 120 if (<a href='010vm.cc.html#L108'>_data</a>.size() <= result_index+/*largest <a href='011run.cc.html#L127'>word</a> size that can be accessed in one instruction*/sizeof(int)) { 121 const int align = 0x1000; 122 uint32_t result_size = result_index + 1; // size needed for result_index to be valid 123 uint32_t new_size = <a href='010vm.cc.html#L99'>align_upwards</a>(result_size, align); 124 // grow at least 2x to maintain some amortized complexity guarantees 125 if (new_size < <a href='010vm.cc.html#L108'>_data</a>.size() * 2) 126 new_size = <a href='010vm.cc.html#L108'>_data</a>.size() * 2; 127 // never grow past the stated limit 128 if (new_size > end-start) 129 new_size = end-start; 130 <a href='010vm.cc.html#L108'>_data</a>.resize(new_size); 131 } 132 return <a href='010vm.cc.html#L108'>_data</a>.at(result_index); 133 } 134 void <a href='010vm.cc.html#L134'>grow_until</a>(uint32_t new_end_address) { 135 if (new_end_address < end) return; 136 // Ugly: vma knows about the global Memory list of vmas 137 void <a href='010vm.cc.html#L144'>sanity_check</a>(uint32_t start, uint32_t end); 138 <a href='010vm.cc.html#L144'>sanity_check</a>(start, new_end_address); 139 end = new_end_address; 140 } 141 // End vma Methods 142 }; 143 :(code) 144 void <a href='010vm.cc.html#L144'>sanity_check</a>(uint32_t start, uint32_t end) { 145 bool dup_found = false; 146 for (int i = 0; i < <a href='001help.cc.html#L168'>SIZE</a>(<a href='010vm.cc.html#L163'>Mem</a>); ++i) { 147 const vma& curr = <a href='010vm.cc.html#L163'>Mem</a>.at(i); 148 if (curr.start == start) { 149 assert(!dup_found); 150 dup_found = true; 151 } 152 else if (curr.start > start) { 153 assert(curr.start > end); 154 } 155 else if (curr.start < start) { 156 assert(curr.end < start); 157 } 158 } 159 } 160 161 :(before "End Globals") 162 // RAM is made of VMAs. 163 vector<vma> <a href='010vm.cc.html#L163'>Mem</a>; 164 :(code) 165 :(before "End Globals") 166 uint32_t <a href='010vm.cc.html#L166'>End_of_program</a> = 0; // when the program executes past this address in tests we'll stop the test 167 // The stack grows downward. Can't increase its size for now. 168 :(before "End Reset") 169 <a href='010vm.cc.html#L163'>Mem</a>.clear(); 170 <a href='010vm.cc.html#L166'>End_of_program</a> = 0; 171 :(code) 172 // These helpers depend on Mem being laid out contiguously (so you can't use a 173 // map, etc.) and on the host also being little-endian. 174 inline uint8_t <a href='010vm.cc.html#L174'>read_mem_u8</a>(uint32_t addr) { 175 uint8_t* handle = <a href='010vm.cc.html#L192'>mem_addr_u8</a>(addr); // error messages get printed here 176 return handle ? *handle : 0; 177 } 178 inline int8_t <a href='010vm.cc.html#L178'>read_mem_i8</a>(uint32_t addr) { 179 return static_cast<int8_t>(<a href='010vm.cc.html#L174'>read_mem_u8</a>(addr)); 180 } 181 inline uint32_t <a href='010vm.cc.html#L181'>read_mem_u32</a>(uint32_t addr) { 182 uint32_t* handle = <a href='010vm.cc.html#L211'>mem_addr_u32</a>(addr); // error messages get printed here 183 return handle ? *handle : 0; 184 } 185 inline int32_t <a href='010vm.cc.html#L185'>read_mem_i32</a>(uint32_t addr) { 186 return static_cast<int32_t>(<a href='010vm.cc.html#L181'>read_mem_u32</a>(addr)); 187 } 188 inline float <a href='010vm.cc.html#L188'>read_mem_f32</a>(uint32_t addr) { 189 return static_cast<float>(<a href='010vm.cc.html#L181'>read_mem_u32</a>(addr)); 190 } 191 192 inline uint8_t* <a href='010vm.cc.html#L192'>mem_addr_u8</a>(uint32_t addr) { 193 uint8_t* result = NULL; 194 for (int i = 0; i < <a href='001help.cc.html#L168'>SIZE</a>(<a href='010vm.cc.html#L163'>Mem</a>); ++i) { 195 if (<a href='010vm.cc.html#L163'>Mem</a>.at(i).<a href='010vm.cc.html#L111'>match</a>(addr)) { 196 if (result) 197 <a href='003trace.cc.html#L226'>raise</a> << "address 0x" << <a href='010vm.cc.html#L408'>HEXWORD</a> << addr << " is in two <a href='011run.cc.html#L106'>segments</a>\n" << end(); 198 result = &Mem.at(i).data(addr); 199 } 200 } 201 if (result == NULL) { 202 if (<a href='003trace.cc.html#L446'>Trace_file</a>.is_open()) <a href='003trace.cc.html#L446'>Trace_file</a>.<a href='011run.cc.html#L198'>flush</a>(); 203 <a href='003trace.cc.html#L226'>raise</a> << "Tried to access uninitialized memory at address 0x" << <a href='010vm.cc.html#L408'>HEXWORD</a> << addr << '\n' << end(); 204 exit(1); 205 } 206 return result; 207 } 208 inline int8_t* <a href='010vm.cc.html#L208'>mem_addr_i8</a>(uint32_t addr) { 209 return reinterpret_cast<int8_t*>(<a href='010vm.cc.html#L192'>mem_addr_u8</a>(addr)); 210 } 211 inline uint32_t* <a href='010vm.cc.html#L211'>mem_addr_u32</a>(uint32_t addr) { 212 uint32_t* result = NULL; 213 for (int i = 0; i < <a href='001help.cc.html#L168'>SIZE</a>(<a href='010vm.cc.html#L163'>Mem</a>); ++i) { 214 if (<a href='010vm.cc.html#L163'>Mem</a>.at(i).<a href='010vm.cc.html#L114'>match32</a>(addr)) { 215 if (result) 216 <a href='003trace.cc.html#L226'>raise</a> << "address 0x" << <a href='010vm.cc.html#L408'>HEXWORD</a> << addr << " is in two <a href='011run.cc.html#L106'>segments</a>\n" << end(); 217 result = reinterpret_cast<uint32_t*>(&Mem.at(i).data(addr)); 218 } 219 } 220 if (result == NULL) { 221 if (<a href='003trace.cc.html#L446'>Trace_file</a>.is_open()) <a href='003trace.cc.html#L446'>Trace_file</a>.<a href='011run.cc.html#L198'>flush</a>(); 222 <a href='003trace.cc.html#L226'>raise</a> << "Tried to access uninitialized memory at address 0x" << <a href='010vm.cc.html#L408'>HEXWORD</a> << addr << '\n' << end(); 223 exit(1); 224 } 225 return result; 226 } 227 inline int32_t* <a href='010vm.cc.html#L227'>mem_addr_i32</a>(uint32_t addr) { 228 return reinterpret_cast<int32_t*>(<a href='010vm.cc.html#L211'>mem_addr_u32</a>(addr)); 229 } 230 inline float* <a href='010vm.cc.html#L230'>mem_addr_f32</a>(uint32_t addr) { 231 return reinterpret_cast<float*>(<a href='010vm.cc.html#L211'>mem_addr_u32</a>(addr)); 232 } 233 // helper for some syscalls. But read-only. 234 inline const char* <a href='010vm.cc.html#L234'>mem_addr_kernel_string</a>(uint32_t addr) { 235 return reinterpret_cast<const char*>(<a href='010vm.cc.html#L192'>mem_addr_u8</a>(addr)); 236 } 237 inline string <a href='010vm.cc.html#L237'>mem_addr_string</a>(uint32_t addr, uint32_t size) { 238 ostringstream out; 239 for (size_t i = 0; i < size; ++i) 240 out << <a href='010vm.cc.html#L174'>read_mem_u8</a>(addr+i); 241 return out.str(); 242 } 243 244 inline void <a href='010vm.cc.html#L244'>write_mem_u8</a>(uint32_t addr, uint8_t val) { 245 uint8_t* handle = <a href='010vm.cc.html#L192'>mem_addr_u8</a>(addr); 246 if (handle != NULL) *handle = val; 247 } 248 inline void <a href='010vm.cc.html#L248'>write_mem_i8</a>(uint32_t addr, int8_t val) { 249 int8_t* handle = <a href='010vm.cc.html#L208'>mem_addr_i8</a>(addr); 250 if (handle != NULL) *handle = val; 251 } 252 inline void <a href='010vm.cc.html#L252'>write_mem_u32</a>(uint32_t addr, uint32_t val) { 253 uint32_t* handle = <a href='010vm.cc.html#L211'>mem_addr_u32</a>(addr); 254 if (handle != NULL) *handle = val; 255 } 256 inline void <a href='010vm.cc.html#L256'>write_mem_i32</a>(uint32_t addr, int32_t val) { 257 int32_t* handle = <a href='010vm.cc.html#L227'>mem_addr_i32</a>(addr); 258 if (handle != NULL) *handle = val; 259 } 260 261 inline bool <a href='010vm.cc.html#L261'>already_allocated</a>(uint32_t addr) { 262 bool result = false; 263 for (int i = 0; i < <a href='001help.cc.html#L168'>SIZE</a>(<a href='010vm.cc.html#L163'>Mem</a>); ++i) { 264 if (<a href='010vm.cc.html#L163'>Mem</a>.at(i).<a href='010vm.cc.html#L111'>match</a>(addr)) { 265 if (result) 266 <a href='003trace.cc.html#L226'>raise</a> << "address 0x" << <a href='010vm.cc.html#L408'>HEXWORD</a> << addr << " is in two <a href='011run.cc.html#L106'>segments</a>\n" << end(); 267 result = true; 268 } 269 } 270 return result; 271 } 272 273 //:: core interpreter loop 274 275 :(code) 276 // skeleton of how x86 instructions are decoded 277 void <a href='010vm.cc.html#L277'>run_one_instruction</a>() { 278 uint8_t op=0, op2=0, op3=0; 279 // Run One Instruction 280 if (<a href='003trace.cc.html#L446'>Trace_file</a>.is_open()) { 281 <a href='010vm.cc.html#L342'>dump_registers</a>(); 282 // End Dump Info for Instruction 283 } 284 uint32_t inst_start_address = <a href='010vm.cc.html#L26'>EIP</a>; 285 op = <a href='010vm.cc.html#L338'>next</a>(); 286 <a href='003trace.cc.html#L96'>trace</a>(Callstack_depth+1, "run") << "0x" << <a href='010vm.cc.html#L408'>HEXWORD</a> << inst_start_address << " opcode: " << <a href='010vm.cc.html#L407'>HEXBYTE</a> << <a href='010vm.cc.html#L410'>NUM</a>(op) << end(); 287 switch (op) { 288 case 0xf4: // hlt 289 <a href='010vm.cc.html#L26'>EIP</a> = <a href='010vm.cc.html#L166'>End_of_program</a>; 290 break; 291 // End Single-Byte Opcodes 292 case 0x0f: 293 switch(op2 = <a href='010vm.cc.html#L338'>next</a>()) { 294 // End Two-Byte Opcodes Starting With 0f 295 default: 296 cerr << "unrecognized second opcode after 0f: " << <a href='010vm.cc.html#L407'>HEXBYTE</a> << <a href='010vm.cc.html#L410'>NUM</a>(op2) << '\n'; 297 exit(1); 298 } 299 break; 300 case 0xf2: 301 switch(op2 = <a href='010vm.cc.html#L338'>next</a>()) { 302 // End Two-Byte Opcodes Starting With f2 303 case 0x0f: 304 switch(op3 = <a href='010vm.cc.html#L338'>next</a>()) { 305 // End Three-Byte Opcodes Starting With f2 0f 306 default: 307 cerr << "unrecognized third opcode after f2 0f: " << <a href='010vm.cc.html#L407'>HEXBYTE</a> << <a href='010vm.cc.html#L410'>NUM</a>(op3) << '\n'; 308 exit(1); 309 } 310 break; 311 default: 312 cerr << "unrecognized second opcode after f2: " << <a href='010vm.cc.html#L407'>HEXBYTE</a> << <a href='010vm.cc.html#L410'>NUM</a>(op2) << '\n'; 313 exit(1); 314 } 315 break; 316 case 0xf3: 317 switch(op2 = <a href='010vm.cc.html#L338'>next</a>()) { 318 // End Two-Byte Opcodes Starting With f3 319 case 0x0f: 320 switch(op3 = <a href='010vm.cc.html#L338'>next</a>()) { 321 // End Three-Byte Opcodes Starting With f3 0f 322 default: 323 cerr << "unrecognized third opcode after f3 0f: " << <a href='010vm.cc.html#L407'>HEXBYTE</a> << <a href='010vm.cc.html#L410'>NUM</a>(op3) << '\n'; 324 exit(1); 325 } 326 break; 327 default: 328 cerr << "unrecognized second opcode after f3: " << <a href='010vm.cc.html#L407'>HEXBYTE</a> << <a href='010vm.cc.html#L410'>NUM</a>(op2) << '\n'; 329 exit(1); 330 } 331 break; 332 default: 333 cerr << "unrecognized opcode: " << <a href='010vm.cc.html#L407'>HEXBYTE</a> << <a href='010vm.cc.html#L410'>NUM</a>(op) << '\n'; 334 exit(1); 335 } 336 } 337 338 inline uint8_t <a href='010vm.cc.html#L338'>next</a>() { 339 return <a href='010vm.cc.html#L174'>read_mem_u8</a>(EIP++); 340 } 341 342 void <a href='010vm.cc.html#L342'>dump_registers</a>() { 343 ostringstream out; 344 out << "regs: "; 345 for (int i = 0; i < <a href='010vm.cc.html#L18'>NUM_INT_REGISTERS</a>; ++i) { 346 if (i > 0) out << " "; 347 out <": " << std::hex << std::setw(8) << std::setfill('_') << Reg[i].u; 348 } 349 out << " -- SF: " << SF << "; <a href='010vm.cc.html#L89'>ZF</a>: " << <a href='010vm.cc.html#L89'>ZF</a> << "; <a href='010vm.cc.html#L90'>CF</a>: " << <a href='010vm.cc.html#L90'>CF</a> << "; <a href='010vm.cc.html#L91'>OF</a>: " << <a href='010vm.cc.html#L91'>OF</a>; 350 <a href='003trace.cc.html#L96'>trace</a>(Callstack_depth+1, "run") << out.str() << end(); 351 } 352 353 //: start tracking supported opcodes 354 :(before "End Globals") 355 map</*op*/string, string> <a href='010vm.cc.html#L355'>Name</a>; 356 map</*op*/string, string> <a href='010vm.cc.html#L356'>Name_0f</a>; 357 map</*op*/string, string> <a href='010vm.cc.html#L357'>Name_f3</a>; 358 map</*op*/string, string> <a href='010vm.cc.html#L358'>Name_f3_0f</a>; 359 :(before "End One-time Setup") 360 <a href='010vm.cc.html#L362'>init_op_names</a>(); 361 :(code) 362 void <a href='010vm.cc.html#L362'>init_op_names</a>() { 363 <a href='001help.cc.html#L227'>put</a>(<a href='010vm.cc.html#L355'>Name</a>, "f4", "halt (hlt)"); 364 // End Initialize Op Names 365 } 366 367 :(before "End <a href='001help.cc.html#L53'>Help</a> Special-cases(key)") 368 if (key == "opcodes") { 369 cerr << "Opcodes currently supported by SubX:\n"; 370 for (map<string, string>::iterator p = <a href='010vm.cc.html#L355'>Name</a>.begin(); p != <a href='010vm.cc.html#L355'>Name</a>.end(); ++p) 371 cerr << " " << p->first << ": " << p->second << '\n'; 372 for (map<string, string>::iterator p = <a href='010vm.cc.html#L356'>Name_0f</a>.begin(); p != <a href='010vm.cc.html#L356'>Name_0f</a>.end(); ++p) 373 cerr << " 0f " << p->first << ": " << p->second << '\n'; 374 for (map<string, string>::iterator p = <a href='010vm.cc.html#L357'>Name_f3</a>.begin(); p != <a href='010vm.cc.html#L357'>Name_f3</a>.end(); ++p) 375 cerr << " f3 " << p->first << ": " << p->second << '\n'; 376 for (map<string, string>::iterator p = <a href='010vm.cc.html#L358'>Name_f3_0f</a>.begin(); p != <a href='010vm.cc.html#L358'>Name_f3_0f</a>.end(); ++p) 377 cerr << " f3 0f " << p->first << ": " << p->second << '\n'; 378 cerr << "Run `bootstrap help instructions` for details on <a href='011run.cc.html#L122'>words</a> like 'r32' and 'disp8'.\n" 379 "For complete details on these instructions, consult the IA-32 manual (volume 2).\n" 380 "There's various versions of it online, such as <a href="https://c9x.me/x86.">https://c9x.me/x86.</a>\n" 381 "The mnemonics in brackets will help you locate each instruction.\n"; 382 return 0; 383 } 384 :(before "End <a href='001help.cc.html#L53'>Help</a> Contents") 385 cerr << " opcodes\n"; 386 387 //: Helpers for managing trace depths 388 //: 389 //: We're going to use trace depths primarily to segment code running at 390 //: different frames of the call stack. This will make it easy for the trace 391 //: browser to collapse over entire calls. 392 //: 393 //: Errors will be at depth 0. 394 //: Warnings will be at depth 1. 395 //: SubX instructions will occupy depth 2 and up to Max_depth, organized by 396 //: stack frames. Each instruction's internal details will be one level deeper 397 //: than its 'main' depth. So 'call' instruction details will be at the same 398 //: depth as the instructions of the function it calls. 399 :(before "End Globals") 400 extern const int <a href='010vm.cc.html#L400'>Initial_callstack_depth</a> = 2; 401 int Callstack_depth = <a href='010vm.cc.html#L400'>Initial_callstack_depth</a>; 402 :(before "End Reset") 403 Callstack_depth = <a href='010vm.cc.html#L400'>Initial_callstack_depth</a>; 404 405 :(before "End Includes") 406 #include <iomanip> 407 #define HEXBYTE std::hex << std::setw(2) << std::setfill('0') 408 #define HEXWORD std::hex << std::setw(8) << std::setfill('0') 409 // ugly that iostream doesn't print uint8_t as an integer 410 #define NUM(X) static_cast<int>(X) 411 #include <stdint.h> </pre> </body> </html>