Recommended
Recommended
More Related Content
What's hot
What's hot (20)
Similar to JavaScript ∩ WebAssembly
Similar to JavaScript ∩ WebAssembly (20)
Recently uploaded
Recently uploaded (20)
JavaScript ∩ WebAssembly
- 1. JavaScript ⋂ WebAssembly @tadeuzagallo Tadeu Zagallo Apple, Inc.
- 2. webkit.org
- 3. Safari
- 4. What is a VM?
- 6. Lexer Parser Interpreter Runtime “function add(x, y) { return x + y }”
- 7. Lexer Parser Interpreter Runtime “function add(x, y) { return x + y }” function[ add ( x , y) { return x +y } ] Tokens
- 8. Lexer Parser Interpreter Runtime “function add(x, y) { return x + y }” function[ add ( x , y) { return x +y } ] Tokens
- 9. Lexer Parser Interpreter Runtime “function add(x, y) { return x + y }” function[ add ( x , y) { return x +y } ] Function Return Identifier Identifier AST Tokens Addition
- 10. Lexer Parser Interpreter Runtime “function add(x, y) { return x + y }” function[ add ( x , y) { return x +y } ] Function Return Identifier Identifier AST Tokens Addition
- 11. AST Interpreter
- 12. function runFunction(functionNode) { ... } function runReturn(returnNode) { ... } function runAddition(additionNode) { ... } function runIdentifier(identifierNode) { ... }
- 13. function runAddition(additionNode) { return run(additionNode.left) + run(additionNode.right); }
- 14. function runAddition(additionNode) { return run(additionNode.left) + run(additionNode.right); }
- 15. function runAddition(additionNode) { return run(additionNode.left) + run(additionNode.right); }
- 19. function runAddition(additionNode) { return run(additionNode.left) + run(additionNode.right); }
- 20. function runAddition(additionNode) { return jsAdd(run(additionNode.left), run(additionNode.right)); }
- 21. Lexer Parser Interpreter Runtime “function add(x, y) { return x + y }” function[ add ( x , y) { return x +y } ] Function Return Identifier Identifier AST Tokens Addition
- 22. Lexer Parser Interpreter Runtime “function add(x, y) { return x + y }” function[ add ( x , y) { return x +y } ] Function Return Identifier Identifier AST - Language Support - Memory Management - Debugging Support - … Tokens Addition
- 24. Lexer Parser Interpreter Runtime “function add(x, y) { return x + y }” function[ add ( x , y) { return x +y } ] Function Return Identifier Identifier AST Tokens Addition
- 25. Lexer Parser Bytecode Generator Runtime “function add(x, y) { return x + y }” function[ add ( x , y) { return x +y } ] Function Return Identifier Identifier AST Interpreter Tokens Addition
- 26. Lexer Parser Bytecode Generator Runtime “function add(x, y) { return x + y }” function[ add ( x , y) { return x +y } ] Function Return Identifier Identifier AST Interpreter [ 0] enter [ 1] add loc0, arg1, arg2 [ 7] ret loc0Tokens Bytecode Addition
- 27. function runBytecode(bytecode) { switch (bytecode.type) { case "enter": return runEnter(bytecode); case "add": return runAddition(bytecode); case "ret": return runRet(bytecode); } }
- 30. Lexer Parser Bytecode Generator Runtime “function add(x, y) { return x + y }” function[ add ( x , y) { return x +y } ] Function Return Identifier Identifier AST Interpreter [ 0] enter [ 1] add loc0, arg1, arg2 [ 7] ret loc0Tokens Bytecode JIT Addition
- 31. function jitCompile(bytecode) { switch (bytecode.type) { case "enter": return compileEnter(bytecode); case "add": return compileAddition(bytecode); case "ret": return compileRet(bytecode); } }
- 32. function compileAddition(bytecode) { return ` ${load(bytecode.left, reg0)} ${load(bytecode.right, reg1)} call _jsAdd `; }
- 33. int add(int x, int y) { return x + y; }
- 34. _add: # prologue leal (%rdi, %rsi), %eax # epilogue
- 35. function compileAddition(bytecode) { return ` ${load(bytecode.left, reg0)} ${load(bytecode.right, reg1)} call _jsAdd `; }
- 36. function compileAddition(bytecode) { return ` ${load(bytecode.left, reg0)} ${load(bytecode.right, reg1)} leal (${reg0}, ${reg1}), ${returnReg} `; }
- 38. Lexer Parser Bytecode Generator Runtime turn x + y }” ( x , y) { return x +y } ] Identifier Identifier Interpreter [ 0] enter [ 1] add loc0, arg1, arg2 [ 7] ret loc0 Bytecode JIT Optimizing JIT Addition
- 39. function add(x, y) { return x + y } for (var i = 0; i < 1000000; i++) add(i, 7);
- 40. function add(x, y) { return x + y } for (var i = 0; i < 1000000; i++) add(i, 7); root
- 41. function add(x, y) { return x + y } for (var i = 0; i < 1000000; i++) add(i, 7); root add Interpreter
- 42. function add(x, y) { return x + y } for (var i = 0; i < 1000000; i++) add(i, 7); root add i = 100 Interpreter
- 43. function add(x, y) { return x + y } for (var i = 0; i < 1000000; i++) add(i, 7); root add add i = 100 Interpreter JIT
- 44. function add(x, y) { return x + y } for (var i = 0; i < 1000000; i++) add(i, 7); root add add i = 100 i = 1000 Interpreter JIT
- 45. function add(int x, int y) { return x + y } for (var i = 0; i < 1000000; i++) add(i, 7); root add add i = 100 i = 1000 Interpreter JIT
- 46. function add(int x, int y) { return x + y } for (var i = 0; i < 1000000; i++) add(i, 7); root add add add i = 100 i = 1000 Interpreter JIT Optimizing JIT
- 47. Quick Recap
- 50. LLInt interpreter Baseline template JIT DFG less optimizing JIT FTL full optimizing JIT BBQ less optimizing JIT OMG full optimizing JIT JavaScript WebAssembly Polymorphic Access template JIT Snippet template JIT Misc YARR regexp template JIT CSS template JIT YARR regexp interpreter LLInt interpreter
- 51. LLInt interpreter Baseline template JIT DFG less optimizing JIT FTL full optimizing JIT JavaScript Latency Throughput
- 52. WebAssembly
- 53. LLInt interpreter Baseline template JIT DFG less optimizing JIT FTL full optimizing JIT JavaScript Latency Throughput
- 54. -CSE -Constant Folding -LICM -DCE -68 more phases DFG Frontend FTL Lowering Instruction Selection Register Allocation DFG Optimizer Air Optimizer Bytecode DFGIR DFGIR B3IR B3IR Air Air Machine Code -CSE -DCE -Tail Duplication -16 more phases B3 Optimizer -Simply CFG -DCE -Spill CSE -8 more phases
- 55. LLInt interpreter Baseline template JIT DFG less optimizing JIT FTL full optimizing JIT BBQ less optimizing JIT OMG full optimizing JIT JavaScript WebAssembly Polymorphic Access template JIT Snippet template JIT Misc YARR regexp template JIT CSS template JIT YARR regexp interpreter
- 56. -CSE -Constant Folding -LICM -DCE -68 more phases DFG Frontend FTL Lowering Instruction Selection Register Allocation DFG Optimizer Air Optimizer Bytecode DFGIR DFGIR B3IR B3IR Air Air Machine Code -CSE -DCE -Tail Duplication -16 more phases B3 Optimizer -Simply CFG -DCE -Spill CSE -8 more phases
- 57. WASM B3 Frontend Instruction Selection Register Allocation Air Optimizer WebAssembly Bytecode B3IR B3IR Air Air Machine Code -CSE -DCE -Tail Duplication -16 more phases B3 Optimizer -Simply CFG -DCE -Spill CSE -8 more phases
- 58. WASM B3 Frontend Instruction Selection Register Allocation Air Optimizer WebAssembly Bytecode B3IR B3IR Air Air Machine Code -CSE -DCE -Tail Duplication -16 more phases B3 Optimizer -Simply CFG -DCE -Spill CSE -8 more phases BBQ OMG
- 59. WASM B3 Frontend Instruction Selection Register Allocation Air Optimizer WebAssembly Bytecode B3IR B3IR Air Air Machine Code -CSE -DCE -Tail Duplication -16 more phases B3 Optimizer -Simply CFG -DCE -Spill CSE -8 more phases BBQ OMG -O0-O2
- 61. WASM B3 Frontend Instruction Selection Register Allocation Air Optimizer WebAssembly Bytecode B3IR B3IR Air Air Machine Code -CSE -DCE -Tail Duplication -16 more phases B3 Optimizer -Simply CFG -DCE -Spill CSE -8 more phases BBQ OMG -O0-O2
- 62. WASM B3 Frontend Instruction Selection Register Allocation Air Optimizer WebAssembly Bytecode B3IR B3IR Air Air Machine Code -CSE -DCE -Tail Duplication -16 more phases B3 Optimizer -Simply CFG -DCE -Spill CSE BBQ OMG -O2 WASM Air Frontend
- 66. op :select, args: { dst: VirtualRegister, condition: VirtualRegister, nonZero: VirtualRegister, zero: VirtualRegister, } Bytecode Definition DSL
- 67. op_group :Store, [ :store8, :store16, :store32, :store64, ], args: { pointer: VirtualRegister, value: VirtualRegister, offset: unsigned, } Bytecode Definition DSL
- 68. wasmOp(select, WasmSelect, macro (ctx) mloadi(ctx, m_condition, t0) btiz t0, .isZero mloadq(ctx, m_nonZero, t0) returnq(ctx, t0) .isZero: mloadq(ctx, m_zero, t0) returnq(ctx, t0) end) offlineasm
- 69. wasmOp(select, WasmSelect, macro (ctx) mloadi(ctx, m_condition, t0) btiz t0, .isZero mloadq(ctx, m_nonZero, t0) returnq(ctx, t0) .isZero: mloadq(ctx, m_zero, t0) returnq(ctx, t0) end) offlineasm - Registers
- 70. wasmOp(select, WasmSelect, macro (ctx) mloadi(ctx, m_condition, t0) btiz t0, .isZero mloadq(ctx, m_nonZero, t0) returnq(ctx, t0) .isZero: mloadq(ctx, m_zero, t0) returnq(ctx, t0) end) offlineasm - Registers - Instructions
- 71. wasmOp(select, WasmSelect, macro (ctx) mloadi(ctx, m_condition, t0) btiz t0, .isZero mloadq(ctx, m_nonZero, t0) returnq(ctx, t0) .isZero: mloadq(ctx, m_zero, t0) returnq(ctx, t0) end) offlineasm - Registers - Instructions - Macros as lambdas
- 72. wasmOp(select, WasmSelect, macro (ctx) mloadi(ctx, m_condition, t0) btiz t0, .isZero mloadq(ctx, m_nonZero, t0) returnq(ctx, t0) .isZero: mloadq(ctx, m_zero, t0) returnq(ctx, t0) end) offlineasm - Registers - Instructions - Macros as lambdas
- 73. wasmOp(select, WasmSelect, macro (ctx) mloadi(ctx, m_condition, t0) btiz t0, .isZero mloadq(ctx, m_nonZero, t0) returnq(ctx, t0) .isZero: mloadq(ctx, m_zero, t0) returnq(ctx, t0) end) offlineasm - Registers - Instructions - Macros as lambdas - Access to C++ constants/offsets/ sizes
- 74. wasmOp(select, WasmSelect, macro (ctx) mloadi(ctx, m_condition, t0) btiz t0, .isZero mloadq(ctx, m_nonZero, t0) returnq(ctx, t0) .isZero: mloadq(ctx, m_zero, t0) returnq(ctx, t0) end) offlineasm - Registers - Instructions - Macros as lambdas - Access to C++ constants/offsets/ sizes - Compiles to armv7, arm64, arm64e, x86, x86_64, mips and C++
- 75. BBQ less optimizing JIT OMG full optimizing JIT WebAssembly Latency Throughput LLInt interpreter
- 76. LLInt interpreter Baseline template JIT DFG less optimizing JIT FTL full optimizing JIT JavaScript Latency Throughput BBQ less optimizing JIT OMG full optimizing JIT WebAssembly LLInt interpreter