Mercurial > hg > truffle
view graal/com.oracle.truffle.sl/src/com/oracle/truffle/sl/NodeFactory.java @ 7292:213c1297a814
Simple Language: A simple dynamic programming language to demonstrate Truffle features
author | Christian Wimmer <christian.wimmer@oracle.com> |
---|---|
date | Fri, 21 Dec 2012 10:45:37 -0800 |
parents | |
children | 31da1716950f |
line wrap: on
line source
/* * Copyright (c) 2012, 2012, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ package com.oracle.truffle.sl; import java.io.*; import java.math.*; import java.util.*; import com.oracle.truffle.api.frame.*; import com.oracle.truffle.sl.nodes.*; import com.oracle.truffle.sl.ops.*; import com.oracle.truffle.sl.types.*; public class NodeFactory { private final HashMap<String, FunctionDefinitionNode> functions; private final PrintStream printOutput; private FrameDescriptor frameDescriptor; private TypedNode returnValue; public NodeFactory(PrintStream printOutput) { this.functions = new HashMap<>(); this.printOutput = printOutput; } public FunctionDefinitionNode findFunction(String name) { return functions.get(name); } public void startFunction() { frameDescriptor = new FrameDescriptor(TypesGen.TYPES); } public void createFunction(StatementNode body, String name) { functions.put(name, new FunctionDefinitionNode(body, frameDescriptor, name, returnValue)); } public TypedNode createLocal(String name) { return ReadLocalOpFactory.create(frameDescriptor.findOrAddFrameSlot(name)); } public TypedNode createStringLiteral(String value) { return StringLiteralFactory.create(value); } public StatementNode createAssignment(String name, TypedNode right) { return WriteLocalOpFactory.create(right, frameDescriptor.findOrAddFrameSlot(name)); } public StatementNode createPrint(List<TypedNode> expressions) { return new PrintNode(expressions, printOutput); } public StatementNode createWhile(ConditionNode condition, StatementNode body) { return new WhileNode(condition, body); } public StatementNode createBlock(List<StatementNode> statements) { return new BlockNode(statements.toArray(new StatementNode[statements.size()])); } public TypedNode createBinary(String operation, TypedNode left, TypedNode right) { switch (operation) { case "+": return AddOpFactory.create(left, right); case "*": return MulOpFactory.create(left, right); case "<": return LessThanOpFactory.create(left, right); case "&&": return LogicalAndOpFactory.create(left, right); default: throw new RuntimeException("unexpected operation: " + operation); } } public TypedNode createNumericLiteral(String value) { try { return IntegerLiteralFactory.create(Integer.parseInt(value)); } catch (NumberFormatException ex) { return BigIntegerLiteralFactory.create(new BigInteger(value)); } } public TypedNode createTime() { return TimeOpFactory.create(); } public StatementNode createReturn(TypedNode value) { FrameSlot slot = frameDescriptor.findOrAddFrameSlot("<retval>"); if (returnValue == null) { returnValue = ReadLocalOpFactory.create(slot); } StatementNode write = WriteLocalOpFactory.create(value, slot); return new ReturnNode(write); } }