Go to content Go to menu

Conditional branching

Apr 28, 09:43 AM

Arguably the key feature that differentiates a computer from other kinds of logic is conditional branching. A computer must be able to execute different code based on conditions. Many instruction sets dedicate a great deal of space to different kinds of conditions, but everybody has to have at least one conditional instruction to be able to execute arbitrary code.

Today, Computer.Build acquired the ability to synthesize conditionals in instructions. This is completely general-purpose, so you could write an instruction that adds 32 to the Program Counter if it’s a multiple of 4, or some such thing. I’m using it right now to implement a “branch if accumulator equals 0” instruction, but it’s general enough to implement just about anything. It’s only supported in the Ruby implementation, but now that I have a grip on how to do it, the Clojure version is coming soon. Here’s an example of what you can do

  computer.instruction "bra0" do |i|
    i.if equal(:A, 0) do |thn|
      thn.move :pc, bitwise_and(:IR, 0x0F)
    end
  end

I’m not thrilled with the block-parameter metaprogramming technique here, but some of my DSL keywords are Ruby keywords, so instance_eval isn’t going to cut it. The Clojure DSL will be a lot nicer, but then again Lisp is almost cheating :)

With conditionals finished, Computer.Build is pretty much complete as far as this semester goes. Indirect addressing is just a matter of writing the appropriate microcode, which I’ve mostly finished, and multi-byte instructions can go the same route (the microcode just has to add N to the Program Counter). Sure, the computer isn’t very efficient, but it takes 0.05 seconds to generate. The next person who picks this project up can work on data path optimization and other things to make all Computer.Build-generated processors better.

Computer.Build kickoff

Jan 27, 06:01 PM

I met with my advisor for the project, Mukkai Krishnamoorthy, today to officially kick off my independent study this semester for Computer.Build. We mapped out some milestones, discussed some implementation ideas, and went over a couple of books. It’s time to get started for real.

I’m already making significant headway, with some basic VHDL code generation from both Ruby and Clojure and a simple multiplexer implemented in each. I’m about half way done building the state machine generator in Clojure, and once that’s finished the Ruby version shouldn’t be too much more work. I think the milestones we came up with are pretty solid, and I’m sure I can get things done on time.

My advisor suggested that I focus on getting most of the code written before the middle of the semester, so I have the rest of the time to test, tweak, debug, and write. I think this is a great approach, and the schedule we came up with to fit it seems quite doable.

Milestones (divide and conquer)

  • 1/4 done (February 21): State machines working in both languages, and plan for implementation of computer generation
  • 1/2 done (March 21): Simple computer successfully generated
  • 3/4 done (April 18): TBD
  • end of semester (May 16): Paper written comparing the two implementations, and a computer generated from each running successfully in an FPGA

Books

The Elements of Computing Systems: Building a Modern Computer from First Principles

This book got me really excited. My class this semester on Advanced Computer Hardware design requires no books, so I had no idea this even existed. It pretty much walks through the entire process of building a computer, all the way from gates to operating systems. My advisor let me borrow it for the entire semester! This is going to be a great reference and resource for figuring out how to put the pieces together.

Programming Languages: A grand tour

When I started talking about language stuff, which half of this project is, my advisor jumped up and started looking for his copy of this book. He couldn’t find it, but it sounds like a pretty useful thing to have. It’s basically a collection of all of the major papers about programming languages in the last few decades.

I love Ruby. As yet another Java convert, I enjoy Ruby’s expressiveness and simplicity, not to mention Rails. Lately I’ve been playing more with developing domain-specific languages in Ruby, and as Matz pointed out in his RubyConf keynote a couple of weeks ago, Ruby is great for building DSLs. As I start out on my next project, though, I’m beginning to understand why Lisp people go so crazy about macros. Basically, it’s all about the metaprogramming.

I see DSLs as 1st-order metaprogramming. You’re writing code that writes code, but you stop there. Rails does an amazing job of this, most notably in ActiveRecord relations (has_many, belongs_to, etc). As it turns out, many programming problems can be solved more elegantly with metaprogramming, and you generally only need one order of it. Instead of expressing the solution in basic language constructs, you go one level up and use a DSL. Not all problems, however, lend themselves to 1st-order metaprogramming. This is where macros come in: they’re nth-order metaprogramming.

Let’s say I want to design CPUs in FPGAs. I’m doing this for a class next semester, and the language we get to use, VHDL, is terrible at abstraction. So, I’m going to design a DSL for defining processors. Instead of working from the ground up, I’m going to start at the top and work down. Here’s what I’d like to write to build a simple little CPU.

Now, how am I going to get an FPGA from this? First off, I need to generate something more low-level that looks more like VHDL. Then, I’m going to need to translate that into actual VHDL so I can use an FPGA design tool like Quartus to get the end result. Now, how would I go about writing this? Well, I already started a bit, and the first step was a Ruby DSL for generating VHDL. But wait, I’ve got another DSL on top of that for the computer! Now what? Unfortunately, the backend for Ruby DSLs can get a bit messy, so trying to layer them is going to be a significant effort. Let’s take a step back here, though, and look at what I’m doing. What I really want here is 2nd-order metaprogramming. It can be done with two layers of 1st-order metaprogramming, but is there a better way?

Enter Lisp. Now, I’m not very experienced with Lisp yet, but that’s going to change now that I’ve recognized the significance. In a Lisp dialect, I could define my computer quite similarly to the Ruby above. Then, I use macros to decompose the “data” into something else closer to my goal. I can keep doing this until I’ve created a “data” structure that contains the code I want to execute, then I execute it! Layering the metaprogramming becomes a simple process of keeping track of the macros transforming the code, but they’re completely independent and loosely coupled. No more nasty DSL backend. No more struggling with code generation and parsing (How would you handle the “x+y” part of the above in a code-generating DSL?). This project is going to happen, but it’s going to happen in Clojure.

Lisp natively supports nth-order metaprogramming. In fact, from what I can tell, that’s pretty much the only thing it has going for it. The code/data duality of Lisp is somewhat akin to the wave/particle duality we encounter in physics. You can just accept it and move on, but to really understand things you must embrace the duality. This can be a big leap for a procedural programmer who tends toward languages like C, but I see it as the next step in my growth as a software developer. With nth-order metaprogramming, you can define the problem in code and work forward from there toward the solution, using as many layers of metaprogramming as you need. Often this is only one layer (thus Ruby’s awesomeness), but the flexibility to add another layer of metaprogramming when you need it can be well worth the learning curve required to pick up a language like Clojure.

I ran into a great article on Hacker News this week about passionate developers. I certainly consider myself an alpha geek, like him, but I still think I can find a job somewhere where I can be passionate about creating software and still love my job. Jonas, on the other hand, feels that a true alpha geek will never be happy with his (or her) day job, and that’s why we code on our off hours. Corporate culture is critical to keeping alpha geeks happy and productive. Alpha geeks, to use his term, are difficult to manage for a variety of reasons, most notably our disinterest in money. Keeping an army of them, much less one, happy and productive is a tough management task that most larger companies aren’t willing to undertake. That’s why I love small companies.

The passionate developer: I do like my profession, I don’t like my job