From owner-freebsd-hackers Tue Mar 14 16:50:26 1995 Return-Path: hackers-owner Received: (from majordom@localhost) by freefall.cdrom.com (8.6.10/8.6.6) id QAA03268 for hackers-outgoing; Tue, 14 Mar 1995 16:50:26 -0800 Received: from ref.tfs.com (ref.tfs.com [140.145.254.251]) by freefall.cdrom.com (8.6.10/8.6.6) with ESMTP id QAA03262 for ; Tue, 14 Mar 1995 16:50:25 -0800 Received: (from phk@localhost) by ref.tfs.com (8.6.8/8.6.6) id QAA05186; Tue, 14 Mar 1995 16:49:09 -0800 From: Poul-Henning Kamp Message-Id: <199503150049.QAA05186@ref.tfs.com> Subject: Re: SCSI ASC-ASCQ descriptions To: joerg_wunsch@uriah.heep.sax.de Date: Tue, 14 Mar 1995 16:49:09 -0800 (PST) Cc: freebsd-hackers@FreeBSD.org In-Reply-To: <199503142355.AAA01220@uriah.heep.sax.de> from "J Wunsch" at Mar 15, 95 00:55:38 am Content-Type: text Content-Length: 908 Sender: hackers-owner@FreeBSD.org Precedence: bulk > As Peter Dufault wrote: > > > > > I'm really tempted to make a program to do this... :) > > > > Yes, I thought of that too. I even went through the effort of seeing > > how many unique words there are (about 300). > > > > If you had a clever way of finding "good overlap" I think you > > could cut the size in half or more. > > Well, in this case, even a rather simple compression scheme will do > it. Find the most common words, and -- since they consist only of > ASCII characters -- assign them ``abbrevations'' in the range of 0x80 > and up. Why bother, gzip the thing in it's entirety and use the inflate() which is in the kernel to uncompress it into a malloc'ed area, get the string you want, and free again... -- Poul-Henning Kamp -- TRW Financial Systems, Inc. 'All relevant people are pertinent' && 'All rude people are impertinent' => 'no rude people are relevant'