1

I have been trying to calculate the LSA checksum for an OSPF packet without success.

I read the ospf's RFC and says there that you need to use the Fletcher algorithm. I tried to it but it still doesnt give the right answer. My code:

Void calccksum(lsaHeader* lsa)
{
  lsa->checksum = 0;
  unsigned short answer = 0;
  unsigned char* ptr = (unsigned char*) lsa;
  int len = ntohs(lsa->len);

  // skip the age field
  ptr += 2;
  len -= 2;

  unsigned short sum1 = 0;
  unsigned short sum2 = 0;

  for (int i=0; i<len; i++)
  {
     sum1 += *ptr;
     if (sum1 >= 255)
        sum1 -= 255;
     sum2 += sum1;
     if (sum2 >= 255)
        sum2 -= 255;
     ptr++;
    }
   answer = (sum2 << 8) | sum1;
   lsa->checksum = ntohs(answer);
}

Would love for some help.

user3206874
  • 795
  • 2
  • 7
  • 15

1 Answers1

0
void calccksum(lsaHeader* lsa)
{
   unsigned char* data  = (unsigned char*) lsa;
   unsigned short bytes = ntohs(lsa->len);
   unsigned short sum1  = 0xff, sum2 = 0xff;

   /* RFC : The Fletcher checksum of the complete contents of the LSA,
    *       including the LSA header but excluding the LS age field.
    */
   data += 2; bytes -= 2;

   lsa->checksum = 0;
   while (bytes) {
       size_t len = bytes > 20 ? 20 : bytes;
       bytes -= len;
       do {
           sum2 += sum1 += *data++;
       } while (--len);
       sum1 = (sum1 & 0xff) + (sum1 >> 8);
       sum2 = (sum2 & 0xff) + (sum2 >> 8);
   }
   sum1 = (sum1 & 0xff) + (sum1 >> 8);
   sum2 = (sum2 & 0xff) + (sum2 >> 8);
   lsa->checksum = htons(sum2 << 8 | sum1);
}
Appjar
  • 1
  • 1