projects
/
unix-history
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
tags
|
clone url
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
get rid of obsolete structures and allow timer-setting routines to be macros
[unix-history]
/
usr
/
src
/
sys
/
netiso
/
iso_chksum.c
diff --git
a/usr/src/sys/netiso/iso_chksum.c
b/usr/src/sys/netiso/iso_chksum.c
index
5668f93
..
19d3512
100644
(file)
--- a/
usr/src/sys/netiso/iso_chksum.c
+++ b/
usr/src/sys/netiso/iso_chksum.c
@@
-1,3
+1,12
@@
+/*-
+ * Copyright (c) 1991 The Regents of the University of California.
+ * All rights reserved.
+ *
+ * %sccs.include.redist.c%
+ *
+ * @(#)iso_chksum.c 7.6 (Berkeley) %G%
+ */
+
/***********************************************************
Copyright IBM Corporation 1987
/***********************************************************
Copyright IBM Corporation 1987
@@
-48,10
+57,6
@@
SOFTWARE.
*/
#ifdef ISO
*/
#ifdef ISO
-#ifndef lint
-static char *rcsid = "$Header: iso_chksum.c,v 4.7 88/07/29 15:31:26 nhall Exp $";
-#endif
-
#include "argo_debug.h"
#include "param.h"
#include "mbuf.h"
#include "argo_debug.h"
#include "param.h"
#include "mbuf.h"
@@
-168,7
+173,7
@@
iso_gen_csum(m,n,l)
while(i < l) {
len = MIN(m->m_len, CLBYTES);
/* RAH: don't cksum more than l bytes */
while(i < l) {
len = MIN(m->m_len, CLBYTES);
/* RAH: don't cksum more than l bytes */
- len = MIN(len, l);
+ len = MIN(len, l
- i
);
cum +=len;
p = mtod(m, u_char *);
cum +=len;
p = mtod(m, u_char *);
@@
-222,22
+227,6
@@
iso_gen_csum(m,n,l)
ENDDEBUG
}
ENDDEBUG
}
-struct mbuf *
-m_append(head, m)
- struct mbuf *head, *m;
-{
- register struct mbuf *n;
-
- if (m == 0)
- return head;
- if (head == 0)
- return m;
- n = head;
- while (n->m_next)
- n = n->m_next;
- n->m_next = m;
- return head;
-}
/*
* FUNCTION: m_datalen
*
/*
* FUNCTION: m_datalen
*
@@
-252,23
+241,13
@@
m_append(head, m)
*/
int
*/
int
-m_datalen (m
orig
)
-
struct mbuf *morig
;
+m_datalen (m)
+
register struct mbuf *m
;
{
{
- int s = splimp();
- register struct mbuf *n=morig;
- register int datalen = 0;
+ register int datalen;
- if( morig == (struct mbuf *)0)
- return 0;
- for(;;) {
- datalen += n->m_len;
- if (n->m_next == (struct mbuf *)0 ) {
- break;
- }
- n = n->m_next;
- }
- splx(s);
+ for (datalen = 0; m; m = m->m_next)
+ datalen += m->m_len;
return datalen;
}
return datalen;
}