|
|
1.1 root 1: /*
2: * Copyright (c) University of British Columbia, 1984
3: * Copyright (c) 1990 The Regents of the University of California.
4: * All rights reserved.
5: *
6: * This code is derived from software contributed to Berkeley by
7: * the Laboratory for Computation Vision and the Computer Science Department
8: * of the University of British Columbia.
9: *
10: * Redistribution and use in source and binary forms, with or without
11: * modification, are permitted provided that the following conditions
12: * are met:
13: * 1. Redistributions of source code must retain the above copyright
14: * notice, this list of conditions and the following disclaimer.
15: * 2. Redistributions in binary form must reproduce the above copyright
16: * notice, this list of conditions and the following disclaimer in the
17: * documentation and/or other materials provided with the distribution.
18: * 3. All advertising materials mentioning features or use of this software
19: * must display the following acknowledgement:
20: * This product includes software developed by the University of
21: * California, Berkeley and its contributors.
22: * 4. Neither the name of the University nor the names of its contributors
23: * may be used to endorse or promote products derived from this software
24: * without specific prior written permission.
25: *
26: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36: * SUCH DAMAGE.
37: *
38: * @(#)x25acct.h 7.2 (Berkeley) 5/11/90
39: */
40:
41: /*
42: * Format of X.25 accounting record written
43: * to X25ACCTF whenever a circuit is closed.
44: */
45:
46: #ifdef waterloo
47: #define X25ACCTF "/usr/adm/logs/x25acct"
48: #else
49: #define X25ACCTF "/usr/adm/x25acct"
50: #endif
51:
52: struct x25acct {
53: time_t x25acct_stime; /* start time */
54: #ifdef waterloo
55: u_long x25acct_etime; /* elapsed time (seconds) */
56: #else
57: u_short x25acct_etime; /* elapsed time (seconds) */
58: #endif
59: short x25acct_uid; /* user id */
60: short x25acct_net; /* network id */
61: u_short x25acct_psize:4, /* packet size */
62: x25acct_addrlen:4, /* x25acct_addr length */
63: x25acct_revcharge:1, /* reverse charging */
64: x25acct_callin:1, /* incoming call */
65: x25acct_unused:6;
66: char x25acct_addr[8]; /* remote DTE address (in bcd) */
67: char x25acct_udata[4]; /* protocol id */
68: long x25acct_txcnt; /* packets transmitted */
69: long x25acct_rxcnt; /* packets received */
70: };
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.