🚀 go-pugleaf

consult the GNU uucp implementation.

since you're in Norway, try ftp.eunet.no:/pub/gnu/uucp-1.05.tar.gz
as well as uucp-doc-1.05.tar.gz.

#<Erik>
-- 
requiescat in pace: Erik Jarve (1944-1994)

In article <3dsl1h$drd@lightning.powertech.no> harald@lightning.powertech.no (Harald Paulsen) writes:

   HELP! I need UUCP documentation, and the file I've currently got
   does not contain complete enough information. One of my major
   problems is the calculation of the checksum. If an successive
   UUCP-implementor would email me for aiding, then please do!

   --
   Harald Paulsen - harald@powertech.no

Have you read the document included in Taylor UUCP distribution?
If the document is not enough for your purpose, the source of
Taylor UUCP will do.

--
OGAWA, Hiroshi(santa@tansei.cc.u-tokyo.ac.jp)
Assistant Professor, Department of Economics
Kanto-Gakuen Univ., Gunnma, Japan

harald@lightning.powertech.no (Harald Paulsen) writes:

> HELP! I need UUCP documentation, and the file I've currently got
> does not contain complete enough information. One of my major
> problems is the calculation of the checksum. If an successive
> UUCP-implementor would email me for aiding, then please do!

Every decent Uucp reference should come with the 'g' checksum
algorithm. Although all the ones I've seen include code in C,
and not in pascal as you requested in another post. I think I
recall seeing something in Pascal, but I don't remember where
or exactly what it was.

Check:
uucp-internals                  FAQ posted on comp.mail.uucp
Hanrahan and Chesson papers     Available on the net.
Managin Uucp and Usenet         O'Reilly nutshell book.

I could post the checksum routine here (just a few lines), but do
yourself a favor and get, at least, one of thoses. Don't start
coding on a lousy description. We are already suffering enough from
non-compliant implementations.

	Jorge

(followups redirected; posted and mailed)

jorge@laser.satlink.net (Jorge Cwik) writes:

> Every decent Uucp reference should come with the 'g' checksum
> algorithm. Although all the ones I've seen include code in C,
> and not in pascal as you requested in another post.

it's fairly trivial to express in some Pascal-derived languages, like Turbo:
(unfortunately, my version has no word-based xor builtin)

function wxor(w1,w2: word): word;

begin
  wxor := (w1 or w2)-(w1 and w2);
end;

function checksumof(apacket: datapackett; completelen: integer): word;

var
  check1: word;
  check2: word;
  i: integer;
  onebyte: byte;

{check1 and check2 have to be 16-bit quantities, or do a lot of AND $FFFF}

{this routine copied from Taylor's UUCP Internals FAQ}

begin
  check1 := $ffff;
  check2 := 0;

  for i := 1 to completelen do
    begin
      if (check1 and $8000)=0 then
        check1 := check1 shl 1
      else
        check1 := (check1 shl 1)+1;

      onebyte := apacket[i];

      inc(check1,onebyte);

      inc(check2,wxor(check1,completelen-i+1));

      if (onebyte=0) or (check1<onebyte) then
        check1 := wxor(check1,check2);
    end;

  checksumof := check1;
end;
-- 
Russell Schulz  russell@alpha3.ersys.edmonton.ab.ca  ersys!rschulz  Shad 86c