From 695f9bf8d0a7d0a871b8ab75270ceb29715d9be3 Mon Sep 17 00:00:00 2001 From: Kartik Agaram Date: Thu, 25 Jul 2019 00:08:23 -0700 Subject: 5468 --- html/subx/032check_operand_bounds.cc.html | 20 ++++++++++---------- 1 file changed, 10 insertions(+), 10 deletions(-) (limited to 'html/subx/032check_operand_bounds.cc.html') diff --git a/html/subx/032check_operand_bounds.cc.html b/html/subx/032check_operand_bounds.cc.html index 433f1549..63838a83 100644 --- a/html/subx/032check_operand_bounds.cc.html +++ b/html/subx/032check_operand_bounds.cc.html @@ -66,7 +66,7 @@ if ('onhashchange' in window) { 6 "== code 0x1\n" 7 "01/add 4/mod 3/rm32 1/r32\n" // add ECX to EBX 8 ); - 9 CHECK_TRACE_CONTENTS( + 9 CHECK_TRACE_CONTENTS( 10 "error: '4/mod' too large to fit in bitfield mod\n" 11 ); 12 } @@ -89,7 +89,7 @@ if ('onhashchange' in window) { 29 30 :(before "Pack Operands(segment code)") 31 check_operand_bounds(code); - 32 if (trace_contains_errors()) return; + 32 if (trace_contains_errors()) return; 33 :(code) 34 void check_operand_bounds(const segment& code) { 35 trace(3, "transform") << "-- check operand bounds" << end(); @@ -97,7 +97,7 @@ if ('onhashchange' in window) { 37 const line& inst = code.lines.at(i); 38 for (int j = first_operand(inst); j < SIZE(inst.words); ++j) 39 check_operand_bounds(inst.words.at(j)); - 40 if (trace_contains_errors()) return; // stop at the first mal-formed instruction + 40 if (trace_contains_errors()) return; // stop at the first mal-formed instruction 41 } 42 } 43 @@ -109,17 +109,17 @@ if ('onhashchange' in window) { 49 if (x >= 0) { 50 if (p->first == "disp8" || p->first == "disp16") { 51 if (static_cast<uint32_t>(x) >= p->second/2) - 52 raise << "'" << w.original << "' too large to fit in signed bitfield " << p->first << '\n' << end(); + 52 raise << "'" << w.original << "' too large to fit in signed bitfield " << p->first << '\n' << end(); 53 } 54 else { 55 if (static_cast<uint32_t>(x) >= p->second) - 56 raise << "'" << w.original << "' too large to fit in bitfield " << p->first << '\n' << end(); + 56 raise << "'" << w.original << "' too large to fit in bitfield " << p->first << '\n' << end(); 57 } 58 } 59 else { 60 // hacky? assuming bound is a power of 2 61 if (x < -1*static_cast<int32_t>(p->second/2)) - 62 raise << "'" << w.original << "' too large to fit in bitfield " << p->first << '\n' << end(); + 62 raise << "'" << w.original << "' too large to fit in bitfield " << p->first << '\n' << end(); 63 } 64 } 65 } @@ -138,7 +138,7 @@ if ('onhashchange' in window) { 78 "== code 0x1\n" 79 "c1/shift 4/subop/left 3/mod/direct 1/rm32/ECX 0x100/imm8" // shift EBX left 80 ); - 81 CHECK_TRACE_CONTENTS( + 81 CHECK_TRACE_CONTENTS( 82 "error: '0x100/imm8' too large to fit in bitfield imm8\n" 83 ); 84 } @@ -157,7 +157,7 @@ if ('onhashchange' in window) { 97 "== code 0x1\n" 98 "c1/shift 4/subop/left 3/mod/direct 1/rm32/ECX -0x81/imm8" // shift EBX left 99 ); -100 CHECK_TRACE_CONTENTS( +100 CHECK_TRACE_CONTENTS( 101 "error: '-0x81/imm8' too large to fit in bitfield imm8\n" 102 ); 103 } @@ -177,7 +177,7 @@ if ('onhashchange' in window) { 117 "== code 0x1\n" 118 "01/add 1/mod/*+disp8 3/rm32 1/r32 0x80/disp8\n" // add ECX to *(EBX+0x80) 119 ); -120 CHECK_TRACE_CONTENTS( +120 CHECK_TRACE_CONTENTS( 121 "error: '0x80/disp8' too large to fit in signed bitfield disp8\n" 122 ); 123 } @@ -197,7 +197,7 @@ if ('onhashchange' in window) { 137 "== code 0x1\n" 138 "01/add 1/mod/*+disp8 3/rm32 1/r32 -0x81/disp8\n" // add ECX to *(EBX-0x81) 139 ); -140 CHECK_TRACE_CONTENTS( +140 CHECK_TRACE_CONTENTS( 141 "error: '-0x81/disp8' too large to fit in bitfield disp8\n" 142 ); 143 } -- cgit 1.4.1-2-gfad0