* Copyright (c) University of British Columbia, 1984
* Copyright (c) 1990 The Regents of the University of California.
* This code is derived from software contributed to Berkeley by
* the Laboratory for Computation Vision and the Computer Science Department
* of the University of British Columbia.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* from: @(#)pk_debug.c 7.7 (Berkeley) 5/9/91
"Listen", "Ready", "Received-Call",
"Sent-Call", "Data-Transfer","Received-Clear",
"Call", "Call-Conf", "Clear",
"Clear-Conf", "Data", "Intr", "Intr-Conf",
"Rr", "Rnr", "Reset", "Reset-Conf",
"Restart", "Restart-Conf", "Reject", "Diagnostic",
struct x25_packet
*xp
= mtod(m
, struct x25_packet
*);
register int i
, len
= 0, cnt
= 0;
if (xcp
-> xc_ptrace
== 0)
i
= pk_decode (xp
) / MAXSTATES
;
for (; m
; m
= m
-> m_next
) {
printf ("LCN=%d %s: %s #=%d, len=%d ",
LCN(xp
), dir
, pk_name
[i
], cnt
, len
);
for (s
= (char *) xp
, i
= 0; i
< 5; ++i
, ++s
)
printf ("%x ", (int) * s
& 0xff);
register struct mbuf_cache
*c
;
register struct mbuf
**mp
;
if (c
->mbc_size
!= c
->mbc_oldsize
) {
unsigned zero_size
, copy_size
;
unsigned new_size
= c
->mbc_size
* sizeof(m
);
caddr_t cache
= (caddr_t
)c
->mbc_cache
;
c
->mbc_cache
= (struct mbuf
**)
malloc(new_size
, M_MBUF
, M_NOWAIT
);
c
->mbc_cache
= (struct mbuf
**)cache
;
c
->mbc_num
%= c
->mbc_size
;
if (c
->mbc_size
< c
->mbc_oldsize
) {
register struct mbuf
**mplim
;
mp
= c
->mbc_size
+ (struct mbuf
**)cache
;
mplim
= c
->mbc_oldsize
+ (struct mbuf
**)cache
;
zero_size
= (c
->mbc_size
- c
->mbc_oldsize
) * sizeof(m
);
copy_size
= new_size
- zero_size
;
c
->mbc_oldsize
= c
->mbc_size
;
bcopy(cache
, (caddr_t
)c
->mbc_cache
, copy_size
);
bzero(copy_size
+ (caddr_t
)c
->mbc_cache
, zero_size
);
mp
= c
->mbc_cache
+ c
->mbc_num
;
c
->mbc_num
= (1 + c
->mbc_num
) % c
->mbc_size
;
*mp
= m_copym(m
, 0, M_COPYALL
, M_DONTWAIT
);