ranger - mirror of ranger - a simple, vim-like file manager

diff options

Diffstat (limited to 'ranger/gui/widgets/statusbar.py')

-rw-r--r--

1 files changed, 1 insertions, 1 deletions

<!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/034check_operand_bounds.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-light"> <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/034check_operand_bounds.cc'>https://github.com/akkartik/mu/blob/main/linux/bootstrap/034check_operand_bounds.cc</a> <pre id='vimCodeElement'> 1 //:: Check that the different arguments of an instruction aren't too large for their bitfields. 2 3 void <a href='034check_operand_bounds.cc.html#L3'>test_check_bitfield_sizes</a>() { 4 Hide_errors = true; 5 <a href='011run.cc.html#L82'>run</a>( 6 "== code 0x1\n" 7 "01/add 4/mod 3/rm32 1/r32\n" // add ECX to EBX 8 ); 9 <a href='003trace.cc.html#L290'>CHECK_TRACE_CONTENTS</a>( 10 "error: '4/mod' too large to fit in bitfield mod\n" 11 ); 12 } 13 14 :(before "End Globals") 15 map<string, uint32_t> <a href='034check_operand_bounds.cc.html#L15'>Operand_bound</a>; 16 :(before "End One-time Setup") 17 <a href='001help.cc.html#L237'>put_new</a>(<a href='034check_operand_bounds.cc.html#L15'>Operand_bound</a>, "subop", 1<<3); 18 <a href='001help.cc.html#L237'>put_new</a>(<a href='034check_operand_bounds.cc.html#L15'>Operand_bound</a>, "mod", 1<<2); 19 <a href='001help.cc.html#L237'>put_new</a>(<a href='034check_operand_bounds.cc.html#L15'>Operand_bound</a>, "rm32", 1<<3); 20 <a href='001help.cc.html#L237'>put_new</a>(<a href='034check_operand_bounds.cc.html#L15'>Operand_bound</a>, "base", 1<<3); 21 <a href='001help.cc.html#L237'>put_new</a>(<a href='034check_operand_bounds.cc.html#L15'>Operand_bound</a>, "index", 1<<3); 22 <a href='001help.cc.html#L237'>put_new</a>(<a href='034check_operand_bounds.cc.html#L15'>Operand_bound</a>, "scale", 1<<2); 23 <a href='001help.cc.html#L237'>put_new</a>(<a href='034check_operand_bounds.cc.html#L15'>Operand_bound</a>, "r32", 1<<3); 24 <a href='001help.cc.html#L237'>put_new</a>(<a href='034check_operand_bounds.cc.html#L15'>Operand_bound</a>, "disp8", 1<<8); 25 <a href='001help.cc.html#L237'>put_new</a>(<a href='034check_operand_bounds.cc.html#L15'>Operand_bound</a>, "disp16", 1<<16); 26 // no bound needed for disp32 27 <a href='001help.cc.html#L237'>put_new</a>(<a href='034check_operand_bounds.cc.html#L15'>Operand_bound</a>, "imm8", 1<<8); 28 // no bound needed for imm32 29 30 :(before "Pack Operands(segment code)") 31 check_argument_bounds(code); 32 if (<a href='003trace.cc.html#L262'>trace_contains_errors</a>()) return; 33 :(code) 34 void check_argument_bounds(const segment& code) { 35 <a href='003trace.cc.html#L96'>trace</a>(3, "transform") << "-- check argument bounds" << end(); 36 for (int i = 0; i < <a href='001help.cc.html#L168'>SIZE</a>(code.<a href='011run.cc.html#L113'>lines</a>); ++i) { 37 const line& inst = code.<a href='011run.cc.html#L113'>lines</a>.at(i); 38 for (int j = <a href='033check_operands.cc.html#L319'>first_argument</a>(inst); j < <a href='001help.cc.html#L168'>SIZE</a>(inst.<a href='011run.cc.html#L122'>words</a>); ++j) 39 check_argument_bounds(inst.<a href='011run.cc.html#L122'>words</a>.at(j)); 40 if (<a href='003trace.cc.html#L262'>trace_contains_errors</a>()) return; // stop at the first mal-formed instruction 41 } 42 } 43 44 void check_argument_bounds(const word& w) { 45 for (map<string, uint32_t>::iterator p = <a href='034check_operand_bounds.cc.html#L15'>Operand_bound</a>.begin(); p != <a href='034check_operand_bounds.cc.html#L15'>Operand_bound</a>.end(); ++p) { 46 if (!has_argument_metadata(w, p->first)) continue; 47 if (!looks_like_hex_int(w.data)) continue; // later transforms are on their own to do their own bounds checking 48 int32_t x = <a href='032operands.cc.html#L610'>parse_int</a>(w.data); 49 if (x >= 0) { 50 if (p->first == "disp8" || p->first == "disp16") { 51 if (static_cast<uint32_t>(x) >= p->second/2) 52 <a href='003trace.cc.html#L226'>raise</a> << "'" << 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 <a href='003trace.cc.html#L226'>raise</a> << "'" << 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 <a href='003trace.cc.html#L226'>raise</a> << "'" << w.original << "' too large to fit in bitfield " << p->first << '\n' << end(); 63 } 64 } 65 } 66 67 void <a href='034check_operand_bounds.cc.html#L67'>test_check_bitfield_sizes_for_imm8</a>() { 68 <a href='011run.cc.html#L82'>run</a>( 69 "== code 0x1\n" 70 "c1/shift 4/subop/left 3/mod/direct 1/rm32/ECX 0xff/imm8" // shift EBX left 71 ); 72 <a href='002test.cc.html#L24'>CHECK</a>(!trace_contains_errors()); 73 } 74 75 void <a href='034check_operand_bounds.cc.html#L75'>test_check_bitfield_sizes_for_imm8_error</a>() { 76 Hide_errors = true; 77 <a href='011run.cc.html#L82'>run</a>( 78 "== code 0x1\n" 79 "c1/shift 4/subop/left 3/mod/direct 1/rm32/ECX 0x100/imm8" // shift EBX left 80 ); 81 <a href='003trace.cc.html#L290'>CHECK_TRACE_CONTENTS</a>( 82 "error: '0x100/imm8' too large to fit in bitfield imm8\n" 83 ); 84 } 85 86 void <a href='034check_operand_bounds.cc.html#L86'>test_check_bitfield_sizes_for_negative_imm8</a>() { 87 <a href='011run.cc.html#L82'>run</a>( 88 "== code 0x1\n" 89 "c1/shift 4/subop/left 3/mod/direct 1/rm32/ECX -0x80/imm8" // shift EBX left 90 ); 91 <a href='002test.cc.html#L24'>CHECK</a>(!trace_contains_errors()); 92 } 93 94 void <a href='034check_operand_bounds.cc.html#L94'>test_check_bitfield_sizes_for_negative_imm8_error</a>() { 95 Hide_errors = true; 96 <a href='011run.cc.html#L82'>run</a>( 97 "== code 0x1\n" 98 "c1/shift 4/subop/left 3/mod/direct 1/rm32/ECX -0x81/imm8" // shift EBX left 99 ); 100 <a href='003trace.cc.html#L290'>CHECK_TRACE_CONTENTS</a>( 101 "error: '-0x81/imm8' too large to fit in bitfield imm8\n" 102 ); 103 } 104 105 void <a href='034check_operand_bounds.cc.html#L105'>test_check_bitfield_sizes_for_disp8</a>() { 106 // not bothering to run 107 transform( 108 "== code 0x1\n" 109 "01/add 1/mod/*+disp8 3/rm32 1/r32 0x7f/disp8\n" // add ECX to *(EBX+0x7f) 110 ); 111 <a href='002test.cc.html#L24'>CHECK</a>(!trace_contains_errors()); 112 } 113 114 void <a href='034check_operand_bounds.cc.html#L114'>test_check_bitfield_sizes_for_disp8_error</a>() { 115 Hide_errors = true; 116 <a href='011run.cc.html#L82'>run</a>( 117 "== code 0x1\n" 118 "01/add 1/mod/*+disp8 3/rm32 1/r32 0x80/disp8\n" // add ECX to *(EBX+0x80) 119 ); 120 <a href='003trace.cc.html#L290'>CHECK_TRACE_CONTENTS</a>( 121 "error: '0x80/disp8' too large to fit in signed bitfield disp8\n" 122 ); 123 } 124 125 void <a href='034check_operand_bounds.cc.html#L125'>test_check_bitfield_sizes_for_negative_disp8</a>() { 126 // not bothering to run 127 transform( 128 "== code 0x1\n" 129 "01/add 1/mod/*+disp8 3/rm32 1/r32 -0x80/disp8\n" // add ECX to *(EBX-0x80) 130 ); 131 <a href='002test.cc.html#L24'>CHECK</a>(!trace_contains_errors()); 132 } 133 134 void <a href='034check_operand_bounds.cc.html#L134'>test_check_bitfield_sizes_for_negative_disp8_error</a>() { 135 Hide_errors = true; 136 <a href='011run.cc.html#L82'>run</a>( 137 "== code 0x1\n" 138 "01/add 1/mod/*+disp8 3/rm32 1/r32 -0x81/disp8\n" // add ECX to *(EBX-0x81) 139 ); 140 <a href='003trace.cc.html#L290'>CHECK_TRACE_CONTENTS</a>( 141 "error: '-0x81/disp8' too large to fit in bitfield disp8\n" 142 ); 143 } </pre> </body> </html>


context:
space:
mode: