A recent article devoted to the *macho* side of programming made the bald and unvarnished statement:
Real Programmers write in Fortran.
Maybe they do now, in this decadent era of Lite beer, hand calculators and "user-friendly" software but back in the Good Old Days, when the term "software" sounded funny and Real Computers were made out of drums and vacuum tubes, Real Programmers wrote in machine code. Not Fortran. Not RATFOR. Not, even, assembly language. Machine Code. Raw, unadorned, inscrutable hexadecimal numbers. Directly.
Lest a whole new generation of programmers grow up in ignorance of this glorious past, I feel duty-bound to describe, as best I can through the generation gap, how a Real Programmer wrote code. I'll call him Mel, because that was his name.
I first met Mel when I went to work for Royal McBee Computer Corp., a now-defunct subsidiary of the typewriter company. The firm manufactured the LGP-30, a small, cheap (by the standards of the day) drum-memory computer, and had just started to manufacture the RPC-4000, a much-improved, bigger, better, faster -- drum-memory computer. Cores cost too much, and weren't here to stay, anyway. (That's why you haven't heard of the company, or the computer.)
I had been hired to write a Fortran compiler for this new marvel and Mel was my guide to its wonders. Mel didn't approve of compilers.
"If a program can't rewrite its own code," he asked, "what good is it?"
Mel had written, in hexadecimal, the most popular computer program the company owned. It ran on the LGP-30 and played blackjack with potential customers at computer shows. Its effect was always dramatic. The LGP-30 booth was packed at every show, and the IBM salesmen stood around talking to each other. Whether or not this actually sold computers was a question we never discussed.
Mel's job was to re-write the blackjack program for the RPC-4000. (Port? What does that mean?) The new computer had a one-plus-one addressing scheme, in which each machine instruction, in addition to the operation code and the address of the needed operand, had a second address that indicated where, on the revolving drum, the next instruction was located. In modern parlance, every single instruction was followed by a GO TO! Put *that* in Pascal's pipe and smoke it.
Mel loved the RPC-4000 because he could optimize his code: that is, locate instructions on the drum so that just as one finished its job, the next would be just arriving at the "read head" and available for immediate execution. There was a program to do that job, an "optimizing assembler", but Mel refused to use it.
"You never know where it's going to put things", he explained, "so you'd have to use separate constants".
It was a long time before I understood that remark. Since Mel knew the numerical value of every operation code, and assigned his own drum addresses, every instruction he wrote could also be considered a numerical constant. He could pick up an earlier "add" instruction, say, and multiply by it, if it had the right numeric value. His code was not easy for someone else to modify.
I compared Mel's hand-optimized programs with the same code massaged by the optimizing assembler program, and Mel's always ran faster. That was because the "top-down" method of program design hadn't been invented yet, and Mel wouldn't have used it anyway. He wrote the innermost parts of his program loops first, so they would get first choice of the optimum address locations on the drum. The optimizing assembler wasn't smart enough to do it that way.
Mel never wrote time-delay loops, either, even when the balky Flexowriter required a delay between output characters to work right. He just located instructions on the drum so each successive one was just *past* the read head when it was needed; the drum had to execute another complete revolution to find the next instruction. He coined an unforgettable term for this procedure. Although "optimum" is an absolute term, like "unique", it became common verbal practice to make it relative: "not quite optimum" or "less optimum" or "not very optimum". Mel called the maximum time-delay locations the "most pessimum".
After he finished the blackjack program and got it to run, ("Even the initializer is optimized", he said proudly) he got a Change Request from the sales department. The program used an elegant (optimized) random number generator to shuffle the "cards" and deal from the "deck", and some of the salesmen felt it was too fair, since sometimes the customers lost. They wanted Mel to modify the program so, at the setting of a sense switch on the console, they could change the odds and let the customer win.
Mel balked. He felt this was patently dishonest, which it was, and that it impinged on his personal integrity as a programmer, which it did, so he refused to do it. The Head Salesman talked to Mel, as did the Big Boss and, at the boss's urging, a few Fellow Programmers. Mel finally gave in and wrote the code, but he got the test backwards, and, when the sense switch was turned on, the program would cheat, winning every time. Mel was delighted with this, claiming his subconscious was uncontrollably ethical, and adamantly refused to fix it.
After Mel had left the company for greener pa$ture$, the Big Boss asked me to look at the code and see if I could find the test and reverse it. Somewhat reluctantly, I agreed to look. Tracking Mel's code was a real adventure.
I have often felt that programming is an art form, whose real value can only be appreciated by another versed in the same arcane art; there are lovely gems and brilliant coups hidden from human view and admiration, sometimes forever, by the very nature of the process. You can learn a lot about an individual just by reading through his code, even in hexadecimal. Mel was, I think, an unsung genius.
Perhaps my greatest shock came when I found an innocent loop that had no test in it. No test. *None*. Common sense said it had to be a closed loop, where the program would circle, forever, endlessly. Program control passed right through it, however, and safely out the other side. It took me two weeks to figure it out.
The RPC-4000 computer had a really modern facility called an index register. It allowed the programmer to write a program loop that used an indexed instruction inside; each time through, the number in the index register was added to the address of that instruction, so it would refer to the next datum in a series. He had only to increment the index register each time through. Mel never used it.
Instead, he would pull the instruction into a machine register, add one to its address, and store it back. He would then execute the modified instruction right from the register. The loop was written so this additional execution time was taken into account -- just as this instruction finished, the next one was right under the drum's read head, ready to go. But the loop had no test in it.
The vital clue came when I noticed the index register bit, the bit that lay between the address and the operation code in the instruction word, was turned on-- yet Mel never used the index register, leaving it zero all the time. When the light went on it nearly blinded me.
He had located the data he was working on near the top of memory -- the largest locations the instructions could address -- so, after the last datum was handled, incrementing the instruction address would make it overflow. The carry would add one to the operation code, changing it to the next one in the instruction set: a jump instruction. Sure enough, the next program instruction was in address location zero, and the program went happily on its way.
I haven't kept in touch with Mel, so I don't know if he ever gave in to the flood of change that has washed over programming techniques since those long-gone days. I like to think he didn't. In any event, I was impressed enough that I quit looking for the offending test, telling the Big Boss I couldn't find it. He didn't seem surprised.
When I left the company, the blackjack program would still cheat if you turned on the right sense switch, and I think that's how it should be. I didn't feel comfortable hacking up the code of a Real Programmer.
Joined: 16 Jun 2003
Location: Kraków, Poland
I remember I first read this text years ago. One of my thoughts then was that while this might (and should) sound ridiculous from the point of view of any modern programmer, I am also guilty of something similar, even if on a different (much less demanding and not nearly as impressive) level. In the sources of fasm 1 I use many data structures that have no named fields, I just use the offsets (and structure sizes) in form of raw numbers. In the history of fasm's development there were a few moments when I attempted to change this and give names to all the offsets. But I was giving up each time, repeatedly realizing that there are actually places in code where I utilize the fact that a given offset is exactly the number it is.
Years later, when developing fasmg, I already had a solution to this problem. I no longer use raw numbers and name all the structure fields, but I still can utilize the fact that some of the offsets or sizes have specific values (like a size being a power of two, or some fields being adjacent) - I just put appropriate ASSERT into my source. Then when someone changes the layout of structure in a way that would break something, the ASSERT is going to react and show what places in code depend on that value being exactly as it is.
The mention of Pascal is probably due to its popularity at the time. (Would they have preferred ALGOL-68? Hardly!) Despite other criticisms like BWK's paper, that era (early '80s) was famous for at least two Pascal products: Turbo Pascal and Knuth's TeX. Conveniently, most of the critics ignore later descendants that "fixed" any remaining problems. Also, Wirth had already moved on to Modula-2.
Even Ada is glossed over as "incredibly complex" despite obvious flexibility. FORTRAN (later just "Fortran") is perceived as the antithesis to structured programming despite Fortran-77's gains in that area. (Oops, it briefly mentions those "subtle tricks" as having "failed", yeah right!) Let's not forget that FORTRAN was originally meant to be as fast as assembly but more readable and easier to program. And Pascal doesn't hate GOTO (although Modula-2 does), it has a global one (stronger than C's local-only, but I guess you can fake it with cryptic setjmp/longjmp)! C has "no type checking"?? Come on, it's weak but still there. Of course classic Pascal was high-level only (no SYSTEM module like in Modula-2), so "pointers" only pointed to the heap (new, dispose) and with limited but safer strings (and, often optional, conformant arrays).
This is clearly somewhat tongue-in-cheek. You can't take it seriously because of how much things have changed (even then, as he admits). It's probably rather a comparison of the self-made hacker vs. newfangled Comp. Sci. educated "professor". Certainly you can be too sloppy / "ad hoc" or too rigid / formal.
These days, we're way worse off because things are so layered, so complex, so many abstractions, so many modern "can't live without" features and newfangled fads that force themselves on everyone. Not that it majorly matters as long as you can get the work done. But low-level programmers are of course harder to find than ever before. In simpler times, there was less development, less options for getting things done. (Although I guess there were always too many *nix competitors and incompatible cpu manufacturers!) Therefore there was more stability. Nowadays with thousands of options, you get thousands of versions / variations, thousands of dependencies, thousands of downloadable updates, etc.
You cannot post new topics in this forum You cannot reply to topics in this forum You cannot edit your posts in this forum You cannot delete your posts in this forum You cannot vote in polls in this forum You cannot attach files in this forum You can download files in this forum