HomeSort by relevance Sort by last modified time
    Searched full:sumlen (Results 1 - 3 of 3) sorted by null

  /external/tcpdump/
print-ah.c 41 int sumlen; local
49 sumlen = ah->ah_len << 2;
54 ND_PRINT((ndo, ",sumlen=%d", sumlen));
56 if (bp + sizeof(struct ah) + sumlen > ep)
60 return sizeof(struct ah) + sumlen;
  /external/tcpdump/tests/
ospf3_ah-vv.out 1 IP6 (class 0xe0, hlim 1, next-header AH (51) payload length: 60) fe80::1 > ff02::5: AH(spi=0x00000100,sumlen=16,seq=0x13): OSPFv3, Hello, length 36
6 IP6 (class 0xe0, hlim 1, next-header AH (51) payload length: 60) fe80::2 > ff02::5: AH(spi=0x00000100,sumlen=16,seq=0xd): OSPFv3, Hello, length 36
11 IP6 (class 0xe0, hlim 1, next-header AH (51) payload length: 64) fe80::1 > ff02::5: AH(spi=0x00000100,sumlen=16,seq=0x14): OSPFv3, Hello, length 40
17 IP6 (class 0xe0, hlim 1, next-header AH (51) payload length: 64) fe80::2 > ff02::5: AH(spi=0x00000100,sumlen=16,seq=0xe): OSPFv3, Hello, length 40
23 IP6 (class 0xe0, hlim 1, next-header AH (51) payload length: 64) fe80::1 > ff02::5: AH(spi=0x00000100,sumlen=16,seq=0x15): OSPFv3, Hello, length 40
29 IP6 (class 0xe0, hlim 1, next-header AH (51) payload length: 64) fe80::2 > ff02::5: AH(spi=0x00000100,sumlen=16,seq=0xf): OSPFv3, Hello, length 40
35 IP6 (class 0xe0, hlim 1, next-header AH (51) payload length: 64) fe80::1 > ff02::5: AH(spi=0x00000100,sumlen=16,seq=0x17): OSPFv3, Hello, length 40
42 IP6 (class 0xe0, hlim 1, next-header AH (51) payload length: 52) fe80::1 > fe80::2: AH(spi=0x00000100,sumlen=16,seq=0x16): OSPFv3, Database Description, length 28
45 IP6 (class 0xe0, hlim 1, next-header AH (51) payload length: 64) fe80::2 > ff02::5: AH(spi=0x00000100,sumlen=16,seq=0x10): OSPFv3, Hello, length 40
51 IP6 (class 0xe0, hlim 1, next-header AH (51) payload length: 52) fe80::1 > fe80::2: AH(spi=0x00000100,sumlen=16,seq=0x18): OSPFv3, Database Description, length 2
    [all...]
  /external/libvncserver/libvncserver/tightvnc-filetransfer/
filelistinfo.c 117 int i = 0, sumLen = 0;
119 sumLen += strlen(fileListInfo.pEntries[i].name);
120 return sumLen;

Completed in 324 milliseconds