MCPcopy
hub / github.com/sql-js/sql.js / _unixLockSharedMemory

Function _unixLockSharedMemory

js/sql-debug.js:21309–21461  ·  view source on GitHub ↗
($0,$1)

Source from the content-addressed store, hash-verified

21307 STACKTOP = sp;return ($$0107|0);
21308}
21309function _unixLockSharedMemory($0,$1) {
21310 $0 = $0|0;
21311 $1 = $1|0;
21312 var $$$i = 0, $$0$i11 = 0, $$1 = 0, $$idx$pre$phiZZ2D = 0, $$idx$val = 0, $$idx$val$idx = 0, $$idx$val$idx$val = 0, $$idx$val$idx$val$idx = 0, $$idx$val$idx$val$idx$val = 0, $$idx10 = 0, $$idx10$val = 0, $$idx10$val$idx = 0, $$idx10$val$idx$val = 0, $$idx10$val$idx$val$idx = 0, $$idx10$val$idx$val$idx$val = 0, $$pre = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0;
21313 var $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0, $2 = 0, $20 = 0, $21 = 0, $22 = 0, $23 = 0, $24 = 0, $25 = 0, $26 = 0, $27 = 0, $28 = 0, $29 = 0, $3 = 0, $30 = 0, $31 = 0;
21314 var $32 = 0, $33 = 0, $34 = 0, $35 = 0, $36 = 0, $37 = 0, $38 = 0, $39 = 0, $4 = 0, $40 = 0, $41 = 0, $42 = 0, $43 = 0, $44 = 0, $45 = 0, $46 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0;
21315 var $9 = 0, $vararg_buffer = 0, $vararg_buffer1 = 0, $vararg_buffer12 = 0, $vararg_buffer5 = 0, $vararg_ptr10 = 0, $vararg_ptr11 = 0, $vararg_ptr8 = 0, $vararg_ptr9 = 0, label = 0, sp = 0;
21316 sp = STACKTOP;
21317 STACKTOP = STACKTOP + 80|0;
21318 $vararg_buffer12 = sp + 48|0;
21319 $vararg_buffer5 = sp + 24|0;
21320 $vararg_buffer1 = sp + 16|0;
21321 $vararg_buffer = sp;
21322 $2 = sp + 56|0;
21323 $3 = ((($2)) + 2|0);
21324 HEAP16[$3>>1] = 0;
21325 $4 = ((($2)) + 4|0);
21326 HEAP32[$4>>2] = 128;
21327 $5 = ((($2)) + 8|0);
21328 HEAP32[$5>>2] = 1;
21329 HEAP16[$2>>1] = 1;
21330 $6 = HEAP32[(3508)>>2]|0;
21331 $7 = ((($1)) + 12|0);
21332 $8 = HEAP32[$7>>2]|0;
21333 HEAP32[$vararg_buffer>>2] = $2;
21334 $9 = (FUNCTION_TABLE_iiii[$6 & 255]($8,12,$vararg_buffer)|0);
21335 $10 = ($9|0)==(0);
21336 if (!($10)) {
21337 $$1 = 3850;
21338 STACKTOP = sp;return ($$1|0);
21339 }
21340 $11 = HEAP16[$2>>1]|0;
21341 L4: do {
21342 switch ($11<<16>>16) {
21343 case 2: {
21344 $12 = ((($1)) + 22|0);
21345 $13 = HEAP8[$12>>0]|0;
21346 $14 = ($13<<24>>24)==(0);
21347 if (!($14)) {
21348 $15 = ((($1)) + 23|0);
21349 HEAP8[$15>>0] = 1;
21350 $$1 = 1288;
21351 STACKTOP = sp;return ($$1|0);
21352 }
21353 $$idx10 = ((($0)) + 8|0);
21354 $$idx10$val = HEAP32[$$idx10>>2]|0;
21355 $$idx10$val$idx = ((($$idx10$val)) + 28|0);
21356 $$idx10$val$idx$val = HEAP32[$$idx10$val$idx>>2]|0;
21357 $$idx10$val$idx$val$idx = ((($$idx10$val$idx$val)) + 12|0);
21358 $$idx10$val$idx$val$idx$val = HEAP32[$$idx10$val$idx$val$idx>>2]|0;
21359 $16 = ($$idx10$val$idx$val$idx$val|0)>(-1);
21360 if ($16) {
21361 $17 = ((($vararg_buffer)) + 12|0);
21362 HEAP32[$17>>2] = 0;
21363 HEAP16[$vararg_buffer>>1] = 1;
21364 $18 = ((($vararg_buffer)) + 2|0);
21365 HEAP16[$18>>1] = 0;
21366 $19 = ((($vararg_buffer)) + 4|0);

Callers 1

_unixShmMapFunction · 0.85

Calls 3

___errno_locationFunction · 0.85
_strerrorFunction · 0.85
_sqlite3_logFunction · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…