Recomendados
Mais conteúdo relacionado
Mais de Maarten Mulders
Mais de Maarten Mulders (20)
Último
Último (20)
Building a DSL with GraalVM (javaBin online)
- 1. B DSL G VM M M @mthmulders javaBin
- 2. W A Y C F www.slido.com, event code #26563 @mthmulders javaBin
- 8. B This program adds the numbers 2 and 5 + + Store the number 2 in the f rst slot > + + + + + Store the number 5 in the second slot [ Move back and forth between f rst and second slot < + > - While "moving" ones from the second to the f rst slot ] The f rst slot now has '7' in it but we need to output the ASCII value for that The ASCII value is 48 higher than the number we have The second slot is now empty It will act as a counter so we can add 6 * 8 to the f rst slot + + + + + + + + Store 8 in it [ Again move back and forth between f rst and second slot < + + + + + + while adding 6 to the f rst slot > - before reducing the counter in the second slot ] < . Go back to the f rst slot and print it @mthmulders javaBin
- 9. 0 1 2 3 4 ... 29 997 29 998 29 999 2 5 3 0 0 0 0 0 ↑ @mthmulders javaBin
- 10. command meaning + increase value decrease value . print value to std out , read one byte from std in [ if value eq 0, jump after matching ] ] if value neq 0, jump after matching [ < move pointer left > move pointer right @mthmulders javaBin
- 15. B yapi.bf calculating 15 digits of π Runtime Average time (ms/op) Error Java HotSpot(TM) 64-Bit Server VM 53 ± 1 OpenJDK GraalVM CE 19.0.0 45 ± 1 All tests are ran on an 2018 MacBook Pro with 2.6 GHz Intel Core i7 and 16 GB 2400 MHz DDR4. The machine runs macOS Mojave 10.14.4 and JDK 1.8.0_212. Tests measured with . Each test ran 5 times with 5 warmup iterations.jmh @mthmulders javaBin
- 16. B yapi.bf calculating 45 digits of π Runtime Average time (ms/op) Error Java HotSpot(TM) 64-Bit Server VM 207 ± 2 OpenJDK GraalVM CE 19.0.0 185 ± 3 All tests are ran on an 2018 MacBook Pro with 2.6 GHz Intel Core i7 and 16 GB 2400 MHz DDR4. The machine runs macOS Mojave 10.14.4 and JDK 1.8.0_212. Tests measured with . Each test ran 5 times with 5 warmup iterations.jmh @mthmulders javaBin
- 18. A S T ROOT INCR_VAL INCR_VAL INCR_VAL INCR_VAL INCR_VAL JUMP INCR_VAL INCR_VAL DECR_PTR INCR_VAL INCR_PTR DECR_VAL (part of the program that adds 5 and 2) @mthmulders javaBin
- 20. P E Calculate for positive integers If we know (or assume) that , the program becomes simpler: x n f (x, n) = ⎧ ⎩ ⎨ ⎪ ⎪ 1 ,(f (x, 0.5 ∗ n)) 2 x ∗ f (x, n − 1), if n = 0 if n is even otherwise n = 5 f (x) = x ∗ ( )x 2 2 @mthmulders javaBin
- 21. N POJO public class BFIncrementByteNode extends Node { /** The slot that holds the data pointer. private f nal FrameSlot dataPointerSlot; public BFIncrementByteNode(f nal FrameSlot dataPointerSlot) { this.dataPointerSlot = dataPointerSlot; } @Override public void execute(f nal VirtualFrame frame) { Find the memory location f nal int dataPointer = FrameUtil.getIntSafe(frame, dataPointerSlot); f nal FrameSlot currentByteSlot = frame.getFrameDescriptor().f ndFrameSlot(dataPointer); Find the current value in that location f nal byte currentValue = FrameUtil.getByteSafe(frame, currentByteSlot); Increase the current value f nal byte newValue = (byte) (1 + currentValue); Store the current value frame.setByte(getSlot(frame), newValue); } } @mthmulders javaBin
- 23. B @Override public void execute(f nal VirtualFrame frame) { f nal int currentValue = someCalculation(); doPrint(getContext().getOutput(), (char) currentValue); } @TruffleBoundary private void doPrint(f nal PrintWriter out, f nal char value) { out.print(value); out.flush(); } @mthmulders javaBin
- 26. S @Specialization(rewriteOn = ArithmeticException.class) int doAddNoOverflow(int a, int b) { return Math.addExact(a, b); } @Specialization long doAddWithOverflow(int a, int b) { return a + b; } execute(Integer.MAX_VALUE - 1, 1) doAddNoOverflow(Integer.MAX_VALUE - 1, 1) execute(Integer.MAX_VALUE , 1) doAddNoOverflow(Integer.MAX_VALUE, 1) throws ArithmeticException doAddWithOverflow(Integer.MAX_VALUE, 1) execute(Integer.MAX_VALUE - 1, 1) doAddWithOverflow(Integer.MAX_VALUE - 1, 1) @mthmulders javaBin
- 27. W G VM JVM function abs (int i) if ( we saw only positive integers in the input ) { return i; } else { transferToInterpreterAndInvalidate; return i < 0 ? i : i; } } @mthmulders javaBin
- 28. B T @mthmulders javaBin
- 32. P L 1. Write some regular expressions 2. Use a parser generator (like )ANTLR cc-by-nc/2.5 - © Randall Munroe - https://www.xkcd.com/1171/ @mthmulders javaBin
- 36. U 1. Prepare source code 2. Prepare GraalVM polyglot context 3. Evaluate the source code input = "+ + > + + + + + [ < + > - ] + + + + + + + + [ < + + + + + + > - ] < ."; source = Source.newBuilder("bf", input, "user input").build(); output = new ByteArrayOutputStream(); context = Context.newBuilder("bf").out(output).build(); context.eval(source); System.out.println(output.toString()); @mthmulders javaBin
- 40. G L C Start the launcher with coverage, and optionally coverage.Output=detailed coverage.OutputFile=coverage.txt ------------------------------------------------------------------------------------------------ Code coverage histogram. Shows what percent of each element was covered during execution ------------------------------------------------------------------------------------------------ Path | Statements | Lines | Roots ------------------------------------------------------------------------------------------------ ~/Code/brainfuck jvm/launcher/src/test/resources/sample.bf | 100.00% | 100.00% | 0.00% ------------------------------------------------------------------------------------------------ @mthmulders javaBin
- 41. W The Truffle framework has an Instrument API to write other tools: 1. Source code-related events 2. Allocation events 3. Language runtime and thread creation events 4. Application execution events @mthmulders javaBin