From owner-cvs-all Mon May 13 19: 7:23 2002 Delivered-To: cvs-all@freebsd.org Received: from magic.adaptec.com (magic.adaptec.com [208.236.45.80]) by hub.freebsd.org (Postfix) with ESMTP id BD6D637B403; Mon, 13 May 2002 19:07:17 -0700 (PDT) Received: from redfish.adaptec.com (redfish.adaptec.com [162.62.50.11]) by magic.adaptec.com (8.10.2+Sun/8.10.2) with ESMTP id g4E27Gj13314; Mon, 13 May 2002 19:07:16 -0700 (PDT) Received: from btc.btc.adaptec.com (btc.btc.adaptec.com [10.100.0.52]) by redfish.adaptec.com (8.8.8+Sun/8.8.8) with ESMTP id TAA24041; Mon, 13 May 2002 19:07:16 -0700 (PDT) Received: from btcexc01.btc.adaptec.com (btcexc01 [10.100.0.23]) by btc.btc.adaptec.com (8.8.8+Sun/8.8.8) with ESMTP id UAA00779; Mon, 13 May 2002 20:07:13 -0600 (MDT) Received: by btcexc01.btc.adaptec.com with Internet Mail Service (5.5.2653.19) id ; Mon, 13 May 2002 20:07:14 -0600 Message-ID: <2C7CBDC6EA58D6119E4A00065B3A24CB046345@btcexc01.btc.adaptec.com> From: "Long, Scott" To: "'Jonathan Mini'" , Peter Wemm Cc: cvs-committers@freebsd.org, cvs-all@freebsd.org Subject: RE: cvs commit: src/sys/boot/i386/boot2 Makefile boot2.c Date: Mon, 13 May 2002 20:07:14 -0600 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2653.19) Content-Type: text/plain Sender: owner-cvs-all@FreeBSD.ORG Precedence: bulk List-ID: List-Archive: (Web Archive) List-Help: (List Instructions) List-Subscribe: List-Unsubscribe: X-Loop: FreeBSD.ORG > Peter Wemm [peter@FreeBSD.org] wrote : > > > peter 2002/05/11 14:39:59 PDT > > > > Modified files: > > sys/boot/i386/boot2 Makefile boot2.c > > Log: > > Use a crowbar and duct-tape to make boot2 fit again. > This gets it down > > to 4 bytes free. I removed a printf (the Keyboard > yes/no) since it is of > > marginal value and sed'ed the generated asm output to > remove the unwanted > > aligns. There's probably a better way to gain a few > extra bytes than > > losing the printf. Shortening strings is probably a > better option but this > > should get us over the hurdle. > > Have we considered compressing the strings using come nefariously lame > compression mechanism? > > ASCII text tends to compress really well even with methods > that have really > small decompression algorithms. > Years ago I played around with an algorithm that decomposed ascii from 8 bits to 5 bits [*]. That gave you 26 characters for letters, and a few control characters for doing elite tricks like selecting which 32 character window you wanted to map into. It could probably be implemented in less than 100 bytes, but I'm not sure if you would get a net gain or not in this case. Scott [*] I learned about this from the old 'Compute!' magazine, circa 1985 or so. What I describe is probably obvious to most people, though. To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe cvs-all" in the body of the message