How did we make the DOS redirector take up only 256 bytes of memory?(blogs.msdn.com)
blogs.msdn.com
How did we make the DOS redirector take up only 256 bytes of memory?
http://blogs.msdn.com/b/larryosterman/archive/2004/11/08/254108.aspx
9 comments
For the people who do not have CONFIG.SYS / DEBUG.COM / MASM kung-fu , please do not give up.. Google, wiki and read up. The journey will be fascinating.
Put your lenses on for jump-offs produced by Google on keywords TSR and LIM EMS for further mind-bending fun.
And quit laughing at HIMEM.SYS
Put your lenses on for jump-offs produced by Google on keywords TSR and LIM EMS for further mind-bending fun.
And quit laughing at HIMEM.SYS
For more about the redirector interface specifically, look up the sub-functions of AH=11h and AH=12h of INT 2F. Originally undocumented, this blog article mentions why they were designed the way it is.
Do not forget Ralf Brown's Interrupt List ;-)
For those who wonder:
http://www.ctyme.com/rbrown.htm
http://www.ctyme.com/rbrown.htm
I always preferred TASM than MASM.
Seconded :) But maybe that's because I used Turbo Pascal and Turbo C++! Just before discovering (and buying) the Watcom compiler.
zura, spot on.. so did I.. till things became a bit difficult after Borland started to implode and Win 9x reached the endzone.
for the new folk exploring TASM == http://en.wikipedia.org/wiki/Turbo_Assembler :-).
wow, this whole thread coupled with the recent one on PE format has resulted in a serious trip down the memory lane for me personally.
for the new folk exploring TASM == http://en.wikipedia.org/wiki/Turbo_Assembler :-).
wow, this whole thread coupled with the recent one on PE format has resulted in a serious trip down the memory lane for me personally.
Kids, I am old enough to have written a DOS TSR in 8086 assembler! Sadly, you likely have no idea what I'm talking about. Suffice to say, I understand this article completely.
Hey, you and me both, brother! Some of the most fun I've had programming was writing an assembly TSR that would scrape the screen buffer of the PAL BBS game Flash Attack (I think that was name of it, anyway) to calculate the firing angles for me.
I also tied into the keyboard hooks so that I could build an entire decoy base with a single key press (just some simple buffer stuffing) along with a cool little "death blossom" attack.
Ahhh, those were the days ;)
I also tied into the keyboard hooks so that I could build an entire decoy base with a single key press (just some simple buffer stuffing) along with a cool little "death blossom" attack.
Ahhh, those were the days ;)
I am 29 now. Guilty of the crime of TSR at 13. I officially declare everyone who's commenting on this thread brothers including the brave soul who visited us from the world of Ruby.
It hasn't got to be one or another.
I'm visiting from the world of Ruby too, yet I was deep in masm/tasm, 386 dos extenders back then :)
I'm visiting from the world of Ruby too, yet I was deep in masm/tasm, 386 dos extenders back then :)
nod. My latest vice is Python. Oddly enough, still doing low-level stuff thanks to WDK.
My first professional coding job was to write a DOS TSR for a modem driver. It was the first TSR I wrote, worked well, and .. set me off on over two decades of experience in embedded systems and now mobile development.
Without the pain of INT13 behind me, I doubt I'd have gotten so far.
Without the pain of INT13 behind me, I doubt I'd have gotten so far.
You are taking me on a nostalgia road.. most fun a bunch of us schoolies had via (sub) function(s) AH=05h-07h .. ;-)
I'm 34 and old enough too, yet I wouldn't call people 'kids' :)
Represent, yo.
I remember seeing mention of "A20" in old BIOS settings, but I never knew what it did. Today, I know: it enabled access a 64k RAM region.
It makes more sense when you know that 'A20 line' stands for '20th address line', and 2^20 (two to the 20th power) is one megabyte, so you need 20 bits to give unique addresses to all of the bytes in one megabyte.
Since those lines start counting at A0, it's the 21st bit.
The thing is, with 20 bits you can address one megabyte, but without a 21st line, any calculated offset (be it indirect addressing or, more commonly, segments) will roll over.
For compatibility with some ancient programs that exploited the rollover (access 0xfffff+0x400 -> 0x3ff), 80286+ gained the "A20 Gate", which allows to simulate the rollover effect (by always forcing A20, the 21st line, to 0) or not (in which case you can go above 1MB using offsets).
Note that the A20 Gate is only active in 16bit modes, otherwise even more fun trickery becomes possible (since half the 32bit accesses with A20 pulled low would change, too)
The thing is, with 20 bits you can address one megabyte, but without a 21st line, any calculated offset (be it indirect addressing or, more commonly, segments) will roll over.
For compatibility with some ancient programs that exploited the rollover (access 0xfffff+0x400 -> 0x3ff), 80286+ gained the "A20 Gate", which allows to simulate the rollover effect (by always forcing A20, the 21st line, to 0) or not (in which case you can go above 1MB using offsets).
Note that the A20 Gate is only active in 16bit modes, otherwise even more fun trickery becomes possible (since half the 32bit accesses with A20 pulled low would change, too)
And more importantly, how real mode segment-offset addressing worked.
djgpp ftw.
This was a fun read, and what is scary is how much of this memory is fresh as newly plucked fruits with uncounted boxes full of APIs that have long gone to dust sitting besides it.
Maybe one day it will come in handy again.
In case you don't know what djgpp is: http://www.delorie.com/
This was a fun read, and what is scary is how much of this memory is fresh as newly plucked fruits with uncounted boxes full of APIs that have long gone to dust sitting besides it.
Maybe one day it will come in handy again.
In case you don't know what djgpp is: http://www.delorie.com/
I miss DJGPP. When I was first learning C back in the days when DOS ruled my world, DJGPP is almost invariably what I used. I clicked the "by DJ Delorie" link on his page and saw that he now works for Redhat working on GCC. Strange or not, that continuity brought a smile to my face.
Also found this quote on the History of DJGPP page: DJGPP was born around 1989 (originally called djgcc), when Richard Stallman spoke at a meeting of the Northern New England Unix Users Group (NNEUUG) at Data General, where I then worked. I asked if the FSF ever planned on porting gcc to MS-DOS (I wanted to use it to write a 32-bit operating system for PCs), and he said it couldn't be done because gcc was too big and MS-DOS was a 16-bit operating system. Challenge in hand, I began.
I like his moxie.
Also found this quote on the History of DJGPP page: DJGPP was born around 1989 (originally called djgcc), when Richard Stallman spoke at a meeting of the Northern New England Unix Users Group (NNEUUG) at Data General, where I then worked. I asked if the FSF ever planned on porting gcc to MS-DOS (I wanted to use it to write a 32-bit operating system for PCs), and he said it couldn't be done because gcc was too big and MS-DOS was a 16-bit operating system. Challenge in hand, I began.
I like his moxie.
Well... I don't want to brag much about it, but on the Apple II+ (I relied on rotines in ROM and it wouldn't work on a plain II) I did a "window stacker" in about 1K of 6502 code... People used it for dialog boxes.
Neat stuff -- note that the Linux kernel (and probably others, I'd guess) uses a similar technique to tag code/data that's only used during initialization. It gets put in a dedicated section of the kernel (or module thereof) that's discarded once it's up and running so it can reclaim some space. (See include/linux/init.h in the kernel source tree.)
I learned to program in Ruby and what is this?
These are the shoulders of the giants that you stand on.
(or: the fun stuff that you never get to see anymore.)
(or: the fun stuff that you never get to see anymore.)
This is back from the day when Ruby was just a gem and people went insane trying to see logic behind segmentation[1].
[1] - http://en.wikipedia.org/wiki/X86_memory_segmentation
[1] - http://en.wikipedia.org/wiki/X86_memory_segmentation
Something far too closer to the metal than your level of abstraction
Just a small off-topic notice: He's got the Raymond Chen blog address wrong, it's http://blogs.msdn.com/b/oldnewthing/
Check it, it's really enjoyable (even for a rabid Unixoid GPL lover like yours truly).
Check it, it's really enjoyable (even for a rabid Unixoid GPL lover like yours truly).
Myself and another school boy wrote enough of a connection based networking system that we could reliably send about 100 bytes of data into that receive buffer. By having our 'protocol stack' then CALL the buffer itself we would execute the code that we had just sent (i.e. the machine code).
Building up from 100 byte chunks we built a network monitoring and management system which allowed things like screen mirroring, chat programs, taking control of the keyboard and broadcast functionality. The entire thing was written in assembly language.
The actual protocol stack was loaded into a part of the BIOS of the machine that was unused and we just grabbed a bunch of NOPs and over wrote them. In the end Research Machines were kind enough to send us the spec. of Z-Net (which they considered somewhat secret) as we'd already reverse engineered the entire thing by disassembling the operating system.
[1] http://en.wikipedia.org/wiki/Link_480Z#Z-Net