1 package edu.berkeley.fleet.assembler;
2 import edu.berkeley.fleet.api.*;
3 import edu.berkeley.sbp.*;
4 import edu.berkeley.sbp.chr.*;
5 import edu.berkeley.sbp.misc.*;
6 import edu.berkeley.sbp.meta.*;
7 import edu.berkeley.sbp.util.*;
8 import static edu.berkeley.fleet.util.BitManipulations.*;
9 import edu.berkeley.fleet.two.*;
10 import edu.berkeley.fleet.api.Instruction.Set;
11 import static edu.berkeley.fleet.api.Instruction.*;
12 import static edu.berkeley.fleet.api.Instruction.Set.*;
13 import static edu.berkeley.fleet.api.Predicate.*;
14 import edu.berkeley.fleet.two.*;
15 import static edu.berkeley.fleet.two.FleetTwoFleet.SHIFT;
16 import edu.berkeley.fleet.fpga.*;
17 import edu.berkeley.fleet.interpreter.*;
23 * @author Adam Megacz <megacz@cs.berkeley.edu>
27 private static final BitVector SIGNAL_ZERO = new BitVector(1);
28 private static final BitVector SIGNAL_ONE = new BitVector(1);
30 SIGNAL_ONE.set(0,true);
34 expect = new ArrayList<Long>();
38 //////////////////////////////////////////////////////////////////////////////
41 private ArrayList<String> imports = new ArrayList<String>();
43 private HashMap<String,Ship> shipMap = new HashMap<String,Ship>();
45 // codebags in numerical order
46 private ArrayList<CodeBag> codeBags = new ArrayList<CodeBag>();
47 private HashMap<String,CodeBag> codeBagsByName = new HashMap<String,CodeBag>();
49 private CodeBag getCodeBag(String name) {
50 CodeBag cb = codeBagsByName.get(name);
51 if (cb!=null) return cb;
52 return new CodeBag(name);
55 private static Union grammar;
56 private static synchronized Union getGrammar() throws Exception {
57 if (grammar != null) return grammar;
58 InputStream grammarStream =
59 Parser.class.getClassLoader().getResourceAsStream("edu/berkeley/fleet/assembler/fleet.g");
60 CharParser metaGrammarParser = new CharParser(GrammarAST.getMetaGrammar());
61 Tree<String> parsedGrammar = metaGrammarParser.parse(new CharInput(grammarStream)).expand1();
62 grammar = GrammarAST.buildFromAST(parsedGrammar, "s", new GrammarAST.ImportResolver() {
63 public InputStream getImportStream(String importname) { return null; }
68 // FIXME: this ought to be cached via serialization, I think
69 private static CharParser cp = null;
70 Tree<String> parseIt(Reader r) throws Exception {
72 cp = new CharParser(getGrammar());
73 CharInput ci = new CharInput(r);
74 Forest f = cp.parse(ci);
78 public Instruction[] parse(Reader r) throws Exception {
79 // this needs to be "code bag zero"
80 CodeBag baseCodeBag = new CodeBag();
81 CodeBag rootCodeBag = new CodeBag();
83 Tree<String> parsed = (Tree<String>)parseIt(r);
84 walk(parsed, rootCodeBag);
86 // map from arbitrary identifiers to actual addresses
87 int[] codeBagMap = new int[codeBags.size()];
89 for(int i=0; i<codeBags.size(); i++) {
90 CodeBag c = codeBags.get(i);
91 codeBagMap[i] = count;
92 for(Instruction inst : c) {
99 ArrayList<Instruction> ret = new ArrayList<Instruction>();
100 for(int i=0; i<codeBags.size(); i++) {
101 CodeBag c = codeBags.get(i);
102 for(int j=0; j<c.size(); j++) {
103 Instruction inst = c.get(j);
104 if (c.isCBD.contains(j)) {
107 lit = FleetTwoFleet.CBD_SIZE.setval(lit, codeBags.get((int)old.immediate).size());
108 lit = FleetTwoFleet.CBD_OFFSET.setval(lit, codeBagMap[(int)old.immediate]);
109 inst = new Set(old.dock, false, IgnoreOLC, SetDest.DataLatch, lit);
116 for(int i=0; i<codeBags.size(); i++) {
117 if (codeBags.get(i)==rootCodeBag) {
119 lit = FleetTwoFleet.CBD_SIZE.setval(lit, codeBags.get(i).size());
120 lit = FleetTwoFleet.CBD_OFFSET.setval(lit, codeBagMap[i]);
124 if (codeBags.size()<=2)
125 return (Instruction[])ret.toArray(new Instruction[0]);
126 return fixup((Instruction[])ret.toArray(new Instruction[0]), startcbd);
129 private Instruction[] fixup(Instruction[] instructions, long startcbd) {
130 ArrayList<Instruction> ret = new ArrayList<Instruction>();
133 Dock inAddrWrite = null;
134 Dock inDataWrite = null;
140 for(Ship ship : fpga) {
141 if ("Memory".equals(ship.getType()) && ship.getOrdinal()==0) {
142 inAddrWrite = ship.getDock("inAddrWrite");
143 inDataWrite = ship.getDock("inDataWrite");
144 inCBD = ship.getDock("inCBD");
145 out = ship.getDock("out");
147 //ihorn = ship.getDock("outIhorn");
149 if ("Debug".equals(ship.getType()) && ship.getOrdinal()==0) {
150 debugIn = ship.getDock("in");
154 for(int i=0; i<instructions.length; i++) {
155 long lit = ((FleetTwoFleet)fpga).writeInstruction(instructions[i], out);
156 ret.add(discard(out));
157 ret.add(new Instruction.Shift(inDataWrite, false, IgnoreOLC, new BitVector(fpga.getWordWidth()).set(getField(36, 19, lit))));
158 ret.add(new Instruction.Shift(inDataWrite, false, IgnoreOLC, new BitVector(fpga.getWordWidth()).set(getField(18, 0, lit))));
159 ret.add(deliver(inDataWrite));
160 ret.add(new Instruction.Shift(inAddrWrite, false, IgnoreOLC, new BitVector(fpga.getWordWidth()).set(getField(36, 19, i))));
161 ret.add(new Instruction.Shift(inAddrWrite, false, IgnoreOLC, new BitVector(fpga.getWordWidth()).set(getField(18, 0, i))));
162 ret.add(deliver(inAddrWrite));
164 ret.add(new Instruction.Shift(inCBD, false, IgnoreOLC, new BitVector(fpga.getWordWidth()).set(getField(36, 19, startcbd))));
165 ret.add(new Instruction.Shift(inCBD, false, IgnoreOLC, new BitVector(fpga.getWordWidth()).set(getField(18, 0, startcbd))));
166 ret.add(wait(inCBD));
167 ret.add(deliver(inCBD));
168 ret.add(sendto(out, out.getPath(inCBD.getDataDestination(),null)));
170 int count = (int)FleetTwoFleet.CBD_SIZE.getval(startcbd);
171 // FIXME FIXME FIXME!
175 int num = Math.min(count, MAX_ILC);
178 ret.add(new Instruction.Set(ihorn, false, IgnoreOLC, SetDest.InnerLoopCounter, num));
179 ret.add(new Instruction.Move(ihorn, false, IgnoreOLC, false, null,false,true,true,true,true,false));
181 if (num_instrs > ihorn.getInstructionFifoSize()) throw new RuntimeException();
183 return (Instruction[])ret.toArray(new Instruction[0]);
186 /** in the first pass, codebags are assigned "addresses" in arbitrary order */
187 void walk(Tree<String> t, CodeBag cb) {
189 String head = t.head();
191 } else if (head.equals("Program")) {
192 for(Tree<String> tc : t.child(0))
195 for(Tree<String> statement : t.child(1))
196 fillCodeBag(statement, cb);
198 } else if (head.equals("#import")) {
201 } else if (head.equals("#ship")) {
202 String name = name(t.child(0));
203 String type = string(t.child(1));
206 if (fleet instanceof FleetWithDynamicShips) {
207 FleetWithDynamicShips dyn = ((FleetWithDynamicShips)fleet);
208 ship = dyn.createShip(type, name);
210 throw new RuntimeException("couldn't find a ship called \""+type+"\"");
212 ship = allocateShip(type);
214 shipMap.put(name, ship);
216 } else if (head.equals("#include")) {
218 walk(parseIt(new InputStreamReader(new FileInputStream(string(t.child(0))))), cb);
219 } catch (Exception e) {
220 throw new RuntimeException(e);
223 } else if (head.equals("#expect")) {
224 expect.add(number(t.child(0)));
225 } else if (head.equals("#skip")) {
231 String string(Tree<String> t) {
233 if (t.head() != null) ret += t.head();
234 for(Tree<String> c : t)
239 String stringBody(Tree<String> t) {
241 for(Tree<String> c : t)
246 String name(Tree<String> t) {
247 return string(t.child(0))+string(t.child(1));
250 Path path(Dock dock, Tree<String> t) {
251 if (!"Dock".equals(t.head()) && !"Destination".equals(t.head()) && !"ShipSpecificLiteral".equals(t.head())) return null;
253 String shipName = name(t.child(0));
254 String portName = name(t.child(1));
255 String subPort = t.size()<3 ? null : name(t.child(2));
256 Ship ship = shipMap.get(shipName);
257 if (ship==null) throw new RuntimeException("no such ship \""+shipName+"\"");
258 Destination ret = null;
261 if (b.getName().equals(portName)) {
265 throw new RuntimeException("no such pump \""+portName+"\"");
266 if (subPort==null) subPort="";
267 if (":i".equals(t.head())) return dock.getPath(bb.getInstructionDestination(),SIGNAL_ZERO);
268 if (":1".equals(t.head())) return dock.getPath(bb.getDataDestination(),SIGNAL_ONE);
269 if (":0".equals(t.head())) return dock.getPath(bb.getDataDestination(),SIGNAL_ZERO);
270 return dock.getPath(bb.getDataDestination(),SIGNAL_ZERO);
273 Dock dock(Tree<String> t) {
274 if (!"Dock".equals(t.head()) && !"Destination".equals(t.head()) && !"ShipSpecificLiteral".equals(t.head()))
275 throw new RuntimeException(t+"");
276 String shipName = name(t.child(0));
277 String portName = name(t.child(1));
278 Ship ship = shipMap.get(shipName);
279 if (ship==null) throw new RuntimeException("no such ship \""+shipName+"\"");
282 if (b.getName().equals(portName))
284 throw new RuntimeException("no such pump \""+portName+"\"");
287 private HashMap<String,Integer> numAllocated = new HashMap<String,Integer>();
289 Ship allocateShip(String shipType) {
291 if (numAllocated.get(shipType) != null)
292 allocated = numAllocated.get(shipType);
293 numAllocated.put(shipType, allocated+1);
294 for(Iterator<Ship> it = fleet.iterator();
298 if (s.getType().equals(shipType)) {
299 if (allocated == 0) return s;
303 throw new RuntimeException("no more ships of type \""+shipType+"\"");
306 private long parseSSL(Tree t) {
307 String shipType = name(t.child(0));
308 String portName = name(t.child(1));
309 Ship chosenship = null;
310 for(Ship ship : fleet) {
311 if (ship.getType().equals(shipType)) {
316 if (chosenship==null) throw new RuntimeException("no ships of type " + shipType);
317 Dock chosenport = chosenship.getDock(portName);
318 Tree specs = t.child(2);
320 for(int i=0; i<specs.size(); i++) {
321 Tree tt = specs.child(i);
322 literal |= resolveLiteral(chosenport, stringBody(tt));
327 private static long resolveLiteral(Dock dd, String s) {
330 boolean hasval = false;
331 if (s.indexOf('=') != -1) {
332 val = Long.parseLong(s.substring(s.indexOf('=')+1));
333 s = s.substring(0, s.indexOf('='));
336 ShipDescription.Constant c = ((FleetTwoDock)dd).getConstant(s);
337 if (c==null) throw new RuntimeException("no constant " + s + " on dock " + dd);
341 ret |= ((~(0xffffffffffffffffL << c.numberWidth)) & val) << c.numberOffset;
345 private static FlagFunction parseFlags(Tree<String> t) {
346 FlagFunction ret = FlagFunction.ZERO;
347 for(int i=0; i<t.size(); i++) {
348 String s = t.child(i).head();
349 if (s.equals("0")) ret = ret.add(FlagFunction.ZERO);
350 if (s.equals("1")) ret = ret.add(FlagFunction.ONE);
351 if (s.equals("a")) ret = ret.add(FlagA);
352 if (s.equals("!a")) ret = ret.add(NotFlagA);
353 if (s.equals("b")) ret = ret.add(FlagB);
354 if (s.equals("!b")) ret = ret.add(NotFlagB);
355 if (s.equals("c")) ret = ret.add(FlagC);
356 if (s.equals("!c")) ret = ret.add(NotFlagC);
361 private int anoncount = 1;
362 void fillCodeBag(Tree<String> t, CodeBag cb) {
363 if (t.head()==null) return;
364 else if (t.head().equals("CodeBagDef")) {
365 CodeBag cb2 = getCodeBag(name(t.child(0)));
366 for(Tree<String> statement : t.child(1))
367 fillCodeBag(statement, cb2);
369 } else if (t.head().equals("Fiber")) {
370 Dock dock = (Dock)dock(t.child(0));
372 OUTER: for(Tree tt : t.child(1)) {
374 Predicate predicate = Default;
375 boolean looping = false;
376 boolean interruptible = false;
377 for(int i=0; i<tt.child(0).size(); i++) {
378 Tree ttt = tt.child(0).child(i);
379 if ("[a]".equals(ttt.head())) predicate = FlagA;
380 if ("[b]".equals(ttt.head())) predicate = FlagB;
381 if ("[c]".equals(ttt.head())) predicate = FlagC;
382 if ("[!a]".equals(ttt.head())) predicate = NotFlagA;
383 if ("[!b]".equals(ttt.head())) predicate = NotFlagB;
384 if ("[!c]".equals(ttt.head())) predicate = NotFlagC;
385 if ("[+]".equals(ttt.head())) predicate = IgnoreOLC;
386 if ("[I]".equals(ttt.head())) interruptible = true;
387 if ("[L]".equals(ttt.head())) looping = true;
390 if ("tail".equals(tt.head())) {
391 cb.add(new Tail(dock));
393 } else if ("setflags".equals(tt.head())) {
394 cb.add(new Set(dock, looping, predicate, parseFlags(tt.child(0)), parseFlags(tt.child(1))));
396 } else if ("load".equals(tt.head()) && "loop".equals(tt.child(0).head())) {
397 cb.add(new Set(dock, looping, predicate, SetDest.OuterLoopCounter, SetSource.DataLatch));
399 } else if ("load".equals(tt.head()) && "repeat".equals(tt.child(0).head())) {
400 cb.add(new Set(dock, looping, predicate, SetDest.InnerLoopCounter, SetSource.DataLatch));
402 } else if ("*".equals(tt.head())) {
403 cb.add(new Set(dock, looping, predicate, SetDest.InnerLoopCounter, SetSource.Infinity));
405 } else if ("with".equals(tt.head()) && "loop".equals(tt.child(0).head())) {
406 cb.add(new Set(dock, looping, predicate, SetDest.OuterLoopCounter, (number(tt.child(1)))));
408 } else if ("with".equals(tt.head()) && "repeat".equals(tt.child(0).head())) {
409 cb.add(new Set(dock, looping, predicate, SetDest.InnerLoopCounter, (number(tt.child(1)))));
411 } else if ("decrement".equals(tt.head())) {
412 cb.add(new Set(dock, looping, predicate, SetDest.OuterLoopCounter, SetSource.Decrement));
414 } else if ("literal".equals(tt.head())) {
416 if (tt.child(0).head().equals("CodeBagBody")) {
417 Tree<String> tq = tt;
418 CodeBag cb2 = getCodeBag("anon"+(anoncount++));
419 for(Tree<String> statement : tq.child(0))
420 fillCodeBag(statement, cb2);
421 cb.add(new Set(dock, looping, predicate, SetDest.DataLatch, (cb2.getFakeAddress())), true);
423 } else if (tt.child(0).head().equals("Name")) {
424 String refname = name(tt.child(0));
425 CodeBag cb2 = getCodeBag(refname);
426 cb.add(new Set(dock, looping, predicate, SetDest.DataLatch, (cb2.getFakeAddress())), true);
428 } else if (tt.child(0).head().equals("[")) {
429 literal = parseSSL(tt.child(0));
431 literal = number(tt.child(0));
434 if ("int".equals(tt.child(1).head())) {
435 count = (int)number(tt.child(1));
436 } else if ("forever".equals(tt.child(1).head())) {
441 if (FleetTwoFleet.isSmallEnoughToFit(literal)) {
442 cb.add(new Set(dock, looping, predicate, SetDest.DataLatch, (literal)));
445 while(counter < dock.getShip().getFleet().getWordWidth()) counter += SHIFT.valmaskwidth;
447 cb.add(new Shift(dock, looping, predicate,
448 new BitVector(dock.getShip().getFleet().getWordWidth())
449 .set(getField(counter-1, counter-SHIFT.valmaskwidth, literal))));
450 counter -= SHIFT.valmaskwidth;
457 boolean requeue = false;
458 ttx = tt.child(1).head().equals("Commands") ? tt.child(1) : tt;
459 if ("int".equals(tt.child(2).head())) {
460 count = (int)number(tt.child(2));
462 } else if ("forever".equals(tt.child(2).head())) {
467 if (tt.head().equals("[*]")) {
468 cb.add(new Set(dock, looping, predicate, SetDest.InnerLoopCounter, SetSource.Infinity));
471 } else if (tt.head().equals("int")) {
472 count = (int)number(tt);
475 boolean tokenIn = false;
476 boolean dataIn = false;
477 boolean latch = false;
478 boolean dataOut = false;
479 boolean tokenOut = false;
480 boolean dispatch = false;
481 boolean localLiteral = false;
482 boolean ignoreUntilLast = false;
485 for(int i=0; i<ttx.size(); i++) {
486 Tree ttt = ttx.child(i);
487 if ("wait".equals(ttt.head())) { tokenIn = true; }
488 else if ("nop".equals(ttt.head())) { }
489 else if ("discard".equals(ttt.head())) { dataIn = true; latch = false; }
490 else if ("take".equals(ttt.head())) { dataIn = true; latch = true; }
491 else if ("recv".equals(ttt.head())) { dataIn = true; latch = true; }
492 else if ("collect".equals(ttt.head())) { dataIn = true; latch = true; }
493 else if ("recieve".equals(ttt.head())) { dataIn = true; latch = true; }
494 else if ("send".equals(ttt.head())) { dispatch = true; dataOut = true; }
495 else if ("sendto".equals(ttt.head())) { dataOut = true; path = path(dock, ttt.child(0)); }
496 else if ("deliver".equals(ttt.head())) { dataOut = true; }
497 else if ("notify".equals(ttt.head())) { tokenOut = true; path = path(dock, ttt.child(0)); }
498 else if ("notifyLast".equals(ttt.head())) { tokenOut = true; ignoreUntilLast = true; path = path(dock, ttt.child(0)); }
500 cb.add(new Move(dock, looping, predicate,
501 interruptible, path, tokenIn, dataIn,
502 latch, dispatch, dataOut, tokenOut));
507 private class CodeBag extends ArrayList<Instruction> {
508 public long address = -1;
509 public final String name;
510 private HashSet<Integer> isCBD = new HashSet<Integer>();
511 public CodeBag() { codeBags.add(this); this.name = "root"; }
512 public CodeBag(String name) { codeBags.add(this); codeBagsByName.put(name, this); this.name = name; }
513 public long getFakeAddress() { return codeBags.indexOf(this); }
514 public boolean equals(Object o) { return this==o; }
515 public void add(Instruction i, boolean isCBD) {
516 if (isCBD) this.isCBD.add(size());
522 public static ArrayList<Long> expect;
523 public static boolean skip;
525 private static long number(Tree t) {
527 for(Object c : t.child(2)) ret += ((Tree)c).head();
528 boolean negative = "-".equals(t.child(0).head());
531 if ("0x".equals(t.child(1).head())) val = Long.parseLong(ret, 16);
532 else if ("0b".equals(t.child(1).head())) val = Long.parseLong(ret, 2);
533 else val = Long.parseLong(ret);
534 if (negative) val = -1L * val;
538 * This interface marks Fleets which can create ships on the fly, like the fleeterpreter;
539 * if available, the parser will use this interface to create ships out of #ship definitions.
541 public static interface FleetWithDynamicShips {
542 public Ship createShip(String shiptype, String shipname);
545 private static Move discard(Dock dock) { return new Move(dock, false, IgnoreOLC, false, null, false, true, false, false, false, false); }
546 private static Move deliver(Dock dock) { return new Move(dock, false, IgnoreOLC, false, null, false, false, false, false, true, false); }
547 private static Move wait(Dock dock) { return new Move(dock, false, IgnoreOLC, false, null, true, false, false, false, false, false); }
548 private static Move sendto(Dock dock, Path path) { return new Move(dock, false, IgnoreOLC, false, path, false, false, false, false, true, false); }