TUHS

tuhs@tuhs.org

37 participants
6497 discussions

by Paul Ruizendaal

>> A not-very-thorough search at tuhs turned up V9/jerq/src/lib/j/bitblt.c >> It appears to be a pre-Reiser bitblt, not what was asked for. > > > The Reiser code is in the V8 jerq tarball that Dan Cross donated: > v8jerq.tar.bz2 <https://www.tuhs.org/Archive/Distributions/Research/Dan_Cross_v8/v8jerq.tar…> > > It is in file blit/src/libj/bitblt.s (attached below for convenience). It is 750 lines of 68K assembler. It does not appear to have been ported to the Bellmac 32 CPU. Maybe it did not make sense in that context. > > Paul There also is a file “bitblt.C” in that same directory (dated May 82, versus Aug 82 for the assembler file) that seems to have a similar approach coded up in C, with a big switch where each case has a lot of “asm()” statements. It is about 400 lines long. No author is mentioned. I have not investigated deeply, but at first glance it is possible that the approach was first coded up as a kind of threaded code in C (with inline asm) and later that Summer redone as fully hand coded assembler. Just a guess. Paul ==== #include <jerq.h> #define LEFTDIR 8 #define NOSHIFT 4 #define DAMMIT 4 /* you'll see why */ #undef sw bitblt(sm,r,dm,p,fc) Bitmap *sm,*dm; Rectangle r; Point p; int fc; { register Word *source,*dest,*_source,*_dest; /* %a2-%a5 */ register UWord m,mask1,mask2; /* %d2,%d3,%d4 */ register int a,b,i; /* %d5,%d6,%d7 */ int j,h,w,dx1,sw,dw; /* clip to the destination Bitmap only */ #define rp dest #define pp source rp = (int *) &(dm->rect); pp = (int *) &p; if ((a = *rp++ - *pp++) > 0) { *(pp-1) += a; r.origin.x += a; } if ((a = *rp++ - *pp) > 0) { *pp += a; r.origin.y += a; } if ((a = r.origin.x + *rp++ - *(pp-1)) < r.corner.x) r.corner.x = a; if ((a = r.origin.y + *rp - *pp) < r.corner.y) r.corner.y = a; i = r.corner.y - r.origin.y; /* going to be h */ a = r.corner.x - r.origin.x - 1; /* going to be dx1 */ if (i <= 0 || a < 0) return; if (a < 16) goto narrow; h = i; dx1 = a; /* i and b are regs, avoid work! */ sw = sm->width << 1; /* sleazy hack to avoid shift */ dw = dm->width << 1; /* in outer, inner loops */ w = ((p.x+dx1) >> 4) - (p.x >> 4) - 1; /* inner loop */ mask1 = ~topbits[p.x & 15]; mask2 = topbits[((p.x+dx1) & 15) + 1]; if (sm == dm) { /* may have to mess with loop order */ if (r.origin.y < p.y) { /* swap top with bottom */ r.origin.y += h-1; p.y += h-1; sw = -sw; dw = -dw; } if (r.origin.x < p.x) { /* swap left with right */ fc |= LEFTDIR; r.origin.x += dx1; p.x += dx1; } } _dest = addr(dm,p); _source = addr(sm,r.origin); a = (p.x&15) - (r.origin.x&15); if (a < 0) a += 16; else /* a == 0 means no shift, remember that */ _source--; /* else grab long and shift right */ b = 16 - a; if (a == 0) fc |= NOSHIFT; source = _source; dest = _dest; switch (fc) { case F_STORE | NOSHIFT: b = w; _source++; source = _source; a = h; /* a is free => use it */ do { *dest++ = (~mask1 & *dest) | (mask1 & *source++); if ((i = b>>2) > 0) do { *((long *)dest)++ = *((long *)source)++; *((long *)dest)++ = *((long *)source)++; } while (--i > 0); if ((i = b&3) > 0) do { *dest++ = *source++; } while (--i > 0); *dest = (~mask2 & *dest) | (mask2 & *source); (char *) _source += sw; source = _source; (char *) _dest += dw; dest = _dest; } while (--a > 0); break; case F_STORE: do { asm(" mov.l (%a2)+,%d2 # (long) m = *source++"); asm(" ror.l %d5,%d2 # rotate m right by a"); *dest++ = (~mask1 & *dest) | (mask1 & m); asm(" ror.l %d6,%d2 # rotate m right by b"); if ((i = w) > 0) do { m = *source++; asm(" ror.l %d5,%d2 # m >> a"); *dest++ = m; asm(" ror.l %d6,%d2 # m >> b"); } while (--i > 0); m = *source; asm(" ror.l %d5,%d2 # m >> a"); *dest = (~mask2 & *dest) | (mask2 & m); (char *) _source += sw; source = _source; (char *) _dest += dw; dest = _dest; } while (--h > 0); break; case F_STORE | NOSHIFT | LEFTDIR: b = w; _source++; source = _source; a = h; do { *dest = (~mask2 & *dest) | (mask2 & *source); if ((i = b>>2) > 0) do { *--((long *)dest) = *--((long *)source); *--((long *)dest) = *--((long *)source); } while (--i > 0); if ((i = b&3) > 0) do { *(--dest) = *(--source); } while (--i > 0); dest--; *dest = (~mask1 & *dest) | (mask1 & *(--source)); (char *) _source += sw; source = _source; (char *) _dest += dw; dest = _dest; } while (--a > 0); break; case F_STORE | LEFTDIR: do { asm(" mov.l (%a2),%d2 # (long) m = *source"); asm(" ror.l %d5,%d2 # m >> a"); *dest = (~mask2 & *dest) | (mask2 & m); asm(" rol.l %d5,%d2 # m << a"); if ((i = w) > 0) do { m = *(--source); asm(" rol.l %d6,%d2 # m << b"); *(--dest) = m; asm(" rol.l %d5,%d2 # m << a"); } while (--i > 0); m = *(--source); asm(" rol.l %d6,%d2 # m << b"); dest--; *dest = (~mask1 & *dest) | (mask1 & m); (char *) _source += sw; source = _source; (char *) _dest += dw; dest = _dest; } while (--h > 0); break; case F_OR: case F_OR | NOSHIFT: do { asm(" mov.l (%a2)+,%d2 # (long) m = *source++"); asm(" ror.l %d5,%d2 # rotate m right by a"); *dest++ |= (mask1 & m); asm(" ror.l %d6,%d2 # rotate m right by b"); if ((i = w) > 0) do { m = *source++; asm(" ror.l %d5,%d2 # m >> a"); *dest++ |= m; asm(" ror.l %d6,%d2 # m >> b"); } while (--i > 0); m = *source; asm(" ror.l %d5,%d2 # m >> a"); *dest |= (mask2 & m); (char *) _source += sw; source = _source; (char *) _dest += dw; dest = _dest; } while (--h > 0); break; case F_OR | LEFTDIR: case F_OR | NOSHIFT | LEFTDIR: do { asm(" mov.l (%a2),%d2 # (long) m = *source"); asm(" ror.l %d5,%d2 # m >> a"); *dest |= (mask2 & m); asm(" rol.l %d5,%d2 # m << a"); if ((i = w) > 0) do { m = *(--source); asm(" rol.l %d6,%d2 # m << b"); *(--dest) |= m; asm(" rol.l %d5,%d2 # m << a"); } while (--i > 0); m = *(--source); asm(" rol.l %d6,%d2 # m << b"); dest--; *dest |= (mask1 & m); (char *) _source += sw; source = _source; (char *) _dest += dw; dest = _dest; } while (--h > 0); break; case F_CLR: case F_CLR | NOSHIFT: do { asm(" mov.l (%a2)+,%d2 # (long) m = *source++"); asm(" ror.l %d5,%d2 # rotate m right by a"); *dest++ &= ~(mask1 & m); asm(" ror.l %d6,%d2 # rotate m right by b"); if ((i = w) > 0) do { m = *source++; asm(" ror.l %d5,%d2 # m >> a"); asm(" not.w %d2 # m = ~m"); *dest++ &= m; asm(" ror.l %d6,%d2 # m >> b"); } while (--i > 0); m = *source; asm(" ror.l %d5,%d2 # m >> a"); *dest &= ~(mask2 & m); (char *) _source += sw; source = _source; (char *) _dest += dw; dest = _dest; } while (--h > 0); break; case F_CLR | LEFTDIR: case F_CLR | NOSHIFT | LEFTDIR: do { asm(" mov.l (%a2),%d2 # (long) m = *source"); asm(" ror.l %d5,%d2 # m >> a"); *dest &= ~(mask2 & m); asm(" rol.l %d5,%d2 # m << a"); if ((i = w) > 0) do { m = *(--source); asm(" rol.l %d6,%d2 # m << b"); asm(" not.w %d2 # m = ~m"); *(--dest) &= m; asm(" rol.l %d5,%d2 # m << a"); } while (--i > 0); m = *(--source); asm(" rol.l %d6,%d2 # m << b"); dest--; *dest &= ~(mask1 & m); (char *) _source += sw; source = _source; (char *) _dest += dw; dest = _dest; } while (--h > 0); break; case F_XOR | NOSHIFT: b = w; _source++; source = _source; a = h; do { *dest++ ^= (mask1 & *source++); if ((i = b>>2) > 0) do { *((long *)dest)++ ^= *((long *)source)++; *((long *)dest)++ ^= *((long *)source)++; } while (--i > 0); if ((i = b&3) > 0) do { *dest++ ^= *source++; } while (--i > 0); *dest ^= (mask2 & *source); (char *) _source += sw; source = _source; (char *) _dest += dw; dest = _dest; } while (--a > 0); break; case F_XOR: default: do { asm(" mov.l (%a2)+,%d2 # (long) m = *source++"); asm(" ror.l %d5,%d2 # rotate m right by a"); *dest++ ^= (mask1 & m); asm(" ror.l %d6,%d2 # rotate m right by b"); if ((i = w) > 0) do { m = *source++; asm(" ror.l %d5,%d2 # m >> a"); *dest++ ^= m; asm(" ror.l %d6,%d2 # m >> b"); } while (--i > 0); m = *source; asm(" ror.l %d5,%d2 # m >> a"); *dest ^= (mask2 & m); (char *) _source += sw; source = _source; (char *) _dest += dw; dest = _dest; } while (--h > 0); break; case F_XOR | NOSHIFT | LEFTDIR: b = w; _source++; source = _source; a = h; do { *dest ^= (mask2 & *source); if ((i = b>>2) > 0) do { *--((long *)dest) ^= *--((long *)source); *--((long *)dest) ^= *--((long *)source); } while (--i > 0); if ((i = b&3) > 0) do { *(--dest) ^= *(--source); } while (--i > 0); dest--; *dest ^= (mask1 & *(--source)); (char *) _source += sw; source = _source; (char *) _dest += dw; dest = _dest; } while (--a > 0); break; case F_XOR | LEFTDIR: do { asm(" mov.l (%a2),%d2 # (long) m = *source"); asm(" ror.l %d5,%d2 # m >> a"); *dest ^= (mask2 & m); asm(" rol.l %d5,%d2 # m << a"); if ((i = w) > 0) do { m = *(--source); asm(" rol.l %d6,%d2 # m << b"); *(--dest) ^= m; asm(" rol.l %d5,%d2 # m << a"); } while (--i > 0); m = *(--source); asm(" rol.l %d6,%d2 # m << b"); dest--; *dest ^= (mask1 & m); (char *) _source += sw; source = _source; (char *) _dest += dw; dest = _dest; } while (--h > 0); break; } return; narrow: /* * width is 16 bits or less, so we can do it by reading and * writing 32 bits at a time */ _source = (Word *) sm; _dest = (Word *) dm; mask1 = ((Bitmap *) _source)->width; /* source increment */ mask1 <<= 1; /* hack to add to an address register */ mask2 = ((Bitmap *) _dest)->width; /* dest increment */ mask2 <<= 1; if (_source == _dest && r.origin.y < p.y) { /* swap top with bottom */ r.origin.y += i-1; p.y += i-1; mask1 = -mask1; mask2 = -mask2; } asm(" mov &0,%d6 # (long) b = 0"); b = topbits[a+1]; a = (16 - (p.x & 15)); /* hocus pocus to get long mask */ asm(" rol.l %d5,%d6 # (long) b <<= a"); a = 16 - a - (r.origin.x & 15); /* shift constant */ if (a < 0) { /* guess what! -1 == 63 to the 68000!!! */ fc |= DAMMIT; /* not fatal, just slow */ } source = addr(_source,r.origin); dest = addr(_dest,p); switch (fc) { case F_STORE: case F_STORE | DAMMIT: asm(" mov.l %d6,%d1 # prepare inverse mask"); asm(" not.l %d1 "); do { asm(" mov.l (%a2),%d2 # m = *source"); asm(" ror.l %d5,%d2 # rotate m right by a"); asm(" and.l %d6,%d2 # m &= b"); asm(" mov.l (%a3),%d0 # m |= *dest&~b"); asm(" and.l %d1,%d0 "); asm(" or.l %d0,%d2 "); asm(" mov.l %d2,(%a3) # *dest = m"); (char *) source += (int) mask1; (char *) dest += (int) mask2; } while (--i > 0); break; case F_OR: case F_OR | DAMMIT: do { asm(" mov.l (%a2),%d2 # m = *source"); asm(" ror.l %d5,%d2 # rotate m right by a"); asm(" and.l %d6,%d2 # m &= b"); asm(" or.l %d2,(%a3) # *dest |= m"); (char *) source += (int) mask1; (char *) dest += (int) mask2; } while (--i > 0); break; case F_CLR: case F_CLR | DAMMIT: do { asm(" mov.l (%a2),%d2 # m = *source"); asm(" ror.l %d5,%d2 # rotate m right by a"); asm(" and.l %d6,%d2 # m &= b"); asm(" not.l %d2 # m = ^m"); asm(" and.l %d2,(%a3) # *dest &= m"); (char *) source += (int) mask1; (char *) dest += (int) mask2; } while (--i > 0); break; case F_XOR: do { asm(" mov.l (%a2),%d2 # m = *source"); asm(" ror.l %d5,%d2 # rotate m right by a"); asm(" and.l %d6,%d2 # m &= b"); asm(" eor.l %d2,(%a3) # *dest ^= m"); (char *) source += (int) mask1; (char *) dest += (int) mask2; } while (--i > 0); break; case F_XOR | DAMMIT: a = -a; do { asm(" mov.l (%a2),%d2 # m = *source"); asm(" rol.l %d5,%d2 # rotate m left by a"); asm(" and.l %d6,%d2 # m &= b"); asm(" eor.l %d2,(%a3) # *dest ^= m"); (char *) source += (int) mask1; (char *) dest += (int) mask2; } while (--i > 0); break; } return; }

3 years, 1 month

Re: [TUHS] A Reiser tour do force

by Douglas McIlroy

> Does {Reiser's bitblt replacement] exist for the rest of us to study? A not-very-thorough search at tuhs turned up V9/jerq/src/lib/j/bitblt.c It appears to be a pre-Reiser bitblt, not what was asked for. But weighing in at over 800 lines of C, it vivifies the challenge that Reiser met in half the space. Doug

3 years, 1 month

LSI-11

by Jon Steinhart

Someone on another list is getting rid of one of these. Lemme know if you want it and I'll put you in touch.

3 years, 1 month

A Reiser tour de force

by Douglas McIlroy

The recent discussion about Research choosing BSD's paging over Reiser-London's brought to mind a stunning program by Reiser that Research did adopt. A critical primitive in the Blit terminal was bitblt (block transfer of a rectangular area). It was used ubiquitously, for example to refresh data when window-stacking changed, to move data within a window, or to pop up a menu.. The display memory was word-oriented, so bitblt was fraught with niggling details about bit alignment and overlap of source and destination. A general bitblt subroutine was a rats' nest of conditionals--grossly inefficient for important special cases like scrolling. Bitblt got refined (i.e. elaborated) several times before Reiser did away with it entirely. Instead he wrote a just-in-time generator of optimal code. Thousands of distinct variants, which varied in size from 16 to 72 bytes, could be produced by the same 400 lines of assembler code. Doug

3 years, 1 month

Alive?

by Warren Toomey

Just checking that the TUHS list hasn't gone belly up, as it's been pretty quiet for a week :-) Cheers, Warren

3 years, 1 month

Re: [TUHS] Old screen editors

by jnc＠mercury.lcs.mit.edu

> From: Clem Cole > Ward had a nice history here: TecoEditor > <http://c2.com/wiki/remodel/?TecoEditor> - worth reading Yeah, pretty good. A couple of minor points: "TECO Madness -- a moment of convenience, a lifetime of regret" - I have seen this attributed to Dave Moon. "the [ITS] version of TECO was used by Richard Stallman to implement the original Emacs Editor" - accurate if read _just_ the right way, but incorrect in the 'naive' reading. Stallman didn't _originate_ the body of stuff that eventually turned into ITS EMACS, although he did take over maintenance of it once it was rolling; and later wrote Gnu Emacs from scratch himself. The mostly accurate one-line history is the one given in Dan Weinreb's blog "the original (TECO-based) Emacs was created and designed by Guy L. Steele Jr. and David Moon. After they had it working, and it had become established as the standard text editor at the AI lab, Stallman took over its maintenance", to which Moon added "in all fairness I have to say that Stallman greatly improved Emacs after he 'liberated' it from Guy and me". More people were involved than Moon, Steele and Stallman, though; a lot of people were writing stuff before Stallman took over; and even after that, others (like Eugene Ciccarelli, a member of the CSR group) helped a lot with ITS EMACS. Stallman's EMACS paper ("sEMACS: The Extensible, Customizable, Self-Documenting Display Editor") contains _many_ statements that are _demonstrably_ wrong, e.g. "it is simply impossible to implement an extensible system in [languages like PASCAL or C]" ... "This eliminates most popular programming languages except LISP, APL and SNOBOL." Given that I've been using a heavily customized Epsilon for decades, which is written completely in EEL (a dialect of C enhanced with editing primitives like buffers, etc), that's clerly very confused. Noel

3 years, 1 month

Re: [TUHS] Old screen editors

by jnc＠mercury.lcs.mit.edu

> From: George Michaelson > Teco was painful. Some of us can recall when the _only_ choices for editing on UNIX (on the PWB1 systems at MIT) were 'ed' and TECO! But to add some real history (not just the usual low S/N flaming about people's opinions of various relatively recent software, which is way too common on this list), the guys at MIT in DSSR/RTS (the group which later did the 68K version of PCC), who had done the port of PDP-11 TECO (in MACRO-11) from the Delphi system at MIT (which preceded adoption of UNIX there) - a comment in one source file alludes to Delphi, so that's where it came from, to UNIX (I think this TECO was written there, and was not a port of a DEC one, since it's all in lower case, and doesn't have other DEC stylisms), after the port, added a '^R mode' similar to the one added to the PDP-10 ITS TECO and used there to write EMACS (in TECO's usual 'line noise' code - historical aside: at one point there was a whole 'Ivory' package for ITS TECO which could 'purify' ITS TECO code so that one copy in core [actual, real core!] could be shared by multiple processes). That was used to write an EMACS-like package for the PDP-11 UNIX TECO (but much simpler than real EMACS), which we used for quite a while before Montgomery EMACS for UNIX showed up. The full dump of the MIT-CSR PWB1 UNIX system which I retrieved has all the sources and documentation for that TECO, and the ^R-mode code, etc. If anyone is interested in seeing it (or maybe even playing with it, which will need the UNIX MACRO-11), let me know, and I'll upload it. Noel PS: Speaking of the full dump of the MIT-CSR PWB1 UNIX system, I was poking around it a couple of days ago, and I found V6 'multiplexor' kernel drivers - mpio.c and mpx.c, etc - I think thay 'fell off the back of a truck' at Bell, like a lot of other stuff we weren't supposed to have, like the circuit design tools, etc. I'm not sure if I have the user programs to go with them; I think I may have found some of them for Paul Ruizendaal a while back, but the memory has faded. Again, if interested, let me know.

3 years, 1 month

Re: [TUHS] Old screen editors

by Steve Simon

I never really used it but i do remember an editor called le on the v7 interdata/Perkin Elmer i used at Leeds poly. I read electronics and we all used vi, the computer science people at a different campus used le on their Interdata; no idea why. anyone any background on le? ihave not seen sight nor sound of it since. -Steve

3 years, 1 month

NetBSD VMs from 1.0 to present

by Chris Pinnock

Evening all, Seeing as our leader is worried about aliveness, I felt it fitting to send a link to a part-time project I’m working on. A couple of weeks ago, I fired up Virtualbox and installed NetBSD/i386 1.0 from floppy images. Virtualbox can be persuaded to read 1.2MB floppies - I’ve had less luck on Qemu with this. But after I setup the VM, I quickly converted it to one that Qemu could use. Then I loaded all the source floppies for 1.1 and 1.2 onto the VM, then upgraded the VM to 1.1 then 1.2 by compiling from source. By which time the pcnet network interface worked reliably. NetBSD still provides a pserver CVS method, so I was able then to CVS update, upgrade to 1.3.3 onwards. 1.4.3 -> 1.5.4 involves a change of binary format from a.out -> ELF. From 1.6 onwards, life becaomes simpler because of the build.sh system, but I spent the time to go all the way up to 9.2 via sources between each release. (I managed to build 9.2 from 6.1 as well.) The VMs can be found on this landing page: https://chrispinnock.com/stuff/netbsd/ I’m working on a write-up which I will publish at some point and I’m also working on OpenBSD branching off at NetBSD 1.1 - I’ve build a OpenBSD 2.0 VM from the NetBSD 1.1 VM on the page above. amnesiac# ls -l /ne* -rwxr-xr-x 1 root wheel 19089180 Mar 26 02:47 /netbsd -rwxr-xr-x 1 root wheel 659600 Mar 13 22:09 /netbsd.10 -rwxr-xr-x 1 root wheel 1332275 Mar 13 22:09 /netbsd.11 -rwxr-xr-x 1 root wheel 1477949 Mar 13 16:13 /netbsd.12 -rwxr-xr-x 1 root wheel 1530049 Mar 13 17:47 /netbsd.121 -rwxr-xr-x 1 root wheel 2211878 Mar 14 02:23 /netbsd.133 -rwxr-xr-x 1 root wheel 3407541 Mar 14 05:12 /netbsd.143 -rwxr-xr-x 1 root wheel 4941157 Mar 14 05:50 /netbsd.154.aout -rwxr-xr-x 1 root wheel 5048054 Mar 14 09:20 /netbsd.154.elf -rwxr-xr-x 1 root wheel 6182687 Mar 14 11:53 /netbsd.162 -rwxr-xr-x 1 root wheel 7447216 Mar 14 14:35 /netbsd.203 -rwxr-xr-x 1 root wheel 7476202 Mar 15 01:12 /netbsd.21 -rwxr-xr-x 1 root wheel 8577892 Mar 15 11:50 /netbsd.31 -rwxr-xr-x 1 root wheel 10343742 Mar 15 23:47 /netbsd.4 -rwxr-xr-x 1 root wheel 12002769 Mar 16 05:31 /netbsd.52 -rwxr-xr-x 1 root wheel 13116694 Mar 16 14:53 /netbsd.61 -rwxr-xr-x 1 root wheel 17143555 Mar 17 04:50 /netbsd.72 -rwxr-xr-x 1 root wheel 19695304 Mar 20 09:12 /netbsd.82 -rwxr-xr-x 1 root wheel 19089180 Mar 28 10:46 /netbsd.92 All the best Chris

3 years, 1 month

Re: [TUHS] Old screen editors

by jnc＠mercury.lcs.mit.edu

> From: Angelo Papenhoff > By 'upload it' do you mean the full dump or TECO only? At this point in time, not the full dump (below for why). I have previously uploaded lots of other bits, e.g. (looks quickly): the TCP/IP that was written for it (with the TCP in the 'user process', making for a small system, good for -11/23's and -11/40's); Montgomery EMACS; TECO (already done - along with the MACRO-11, but I still need to do the linker, and the BCPL compiler one needs for the linker). > That system sounds very interesting and I'd love to see the whole thing. Unfortunately, the dump includes _everything_ on the system, including personal email, etc, etc. So I have to curate it anything I upload. I suppose I should put together an 'index page', which lists (and links to) everything that has been uploaded? Noel

3 years, 1 month

Jump to page:

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

1997

1996

1995

1994

1993

1992

1991

1990

TUHS