|
|
1.1 root 1: /*
2: * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
3: *
4: * @APPLE_LICENSE_HEADER_START@
5: *
6: * Portions Copyright (c) 1999 Apple Computer, Inc. All Rights
7: * Reserved. This file contains Original Code and/or Modifications of
8: * Original Code as defined in and that are subject to the Apple Public
9: * Source License Version 1.1 (the "License"). You may not use this file
10: * except in compliance with the License. Please obtain a copy of the
11: * License at http://www.apple.com/publicsource and read it before using
12: * this file.
13: *
14: * The Original Code and all software distributed under the License are
15: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
16: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
17: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
18: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
19: * License for the specific language governing rights and limitations
20: * under the License.
21: *
22: * @APPLE_LICENSE_HEADER_END@
23: */
24:
25: /*
26: * Copyright (c) University of British Columbia, 1984
27: * Copyright (c) 1990, 1993
28: * The Regents of the University of California. All rights reserved.
29: *
30: * This code is derived from software contributed to Berkeley by
31: * the Laboratory for Computation Vision and the Computer Science Department
32: * of the University of British Columbia.
33: *
34: * Redistribution and use in source and binary forms, with or without
35: * modification, are permitted provided that the following conditions
36: * are met:
37: * 1. Redistributions of source code must retain the above copyright
38: * notice, this list of conditions and the following disclaimer.
39: * 2. Redistributions in binary form must reproduce the above copyright
40: * notice, this list of conditions and the following disclaimer in the
41: * documentation and/or other materials provided with the distribution.
42: * 3. All advertising materials mentioning features or use of this software
43: * must display the following acknowledgement:
44: * This product includes software developed by the University of
45: * California, Berkeley and its contributors.
46: * 4. Neither the name of the University nor the names of its contributors
47: * may be used to endorse or promote products derived from this software
48: * without specific prior written permission.
49: *
50: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
51: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
52: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
53: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
54: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
55: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
56: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
57: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
58: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
59: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
60: * SUCH DAMAGE.
61: *
62: * @(#)pk_acct.c 8.1 (Berkeley) 6/10/93
63: */
64:
65: #include <sys/param.h>
66: #include <sys/systm.h>
67: #include <sys/namei.h>
68: #include <sys/proc.h>
69: #include <sys/vnode.h>
70: #include <sys/kernel.h>
71: #include <sys/file.h>
72: #include <sys/socket.h>
73: #include <sys/socketvar.h>
74:
75: #include <net/if.h>
76:
77: #include <netccitt/x25.h>
78: #include <netccitt/pk.h>
79: #include <netccitt/pk_var.h>
80: #include <netccitt/x25acct.h>
81:
82:
83: struct vnode *pkacctp;
84: /*
85: * Turn on packet accounting
86: */
87:
88: pk_accton (path)
89: char *path;
90: {
91: register struct vnode *vp = NULL;
92: struct nameidata nd;
93: struct vnode *oacctp = pkacctp;
94: struct proc *p = current_proc();
95: int error;
96:
97: if (path == 0)
98: goto close;
99: NDINIT(&nd, LOOKUP, FOLLOW, UIO_USERSPACE, path, p);
100: if (error = vn_open (&nd, FWRITE, 0644))
101: return (error);
102: vp = nd.ni_vp;
103: VOP_UNLOCK(vp);
104: if (vp -> v_type != VREG) {
105: vrele (vp);
106: return (EACCES);
107: }
108: pkacctp = vp;
109: if (oacctp) {
110: close:
111: error = vn_close (oacctp, FWRITE, p -> p_ucred, p);
112: }
113: return (error);
114: }
115:
116: /*
117: * Write a record on the accounting file.
118: */
119:
120: pk_acct (lcp)
121: register struct pklcd *lcp;
122: {
123: register struct vnode *vp;
124: register struct sockaddr_x25 *sa;
125: register char *src, *dst;
126: register int len;
127: register long etime;
128: static struct x25acct acbuf;
129:
130: if ((vp = pkacctp) == 0)
131: return;
132: bzero ((caddr_t)&acbuf, sizeof (acbuf));
133: if (lcp -> lcd_ceaddr != 0)
134: sa = lcp -> lcd_ceaddr;
135: else if (lcp -> lcd_craddr != 0) {
136: sa = lcp -> lcd_craddr;
137: acbuf.x25acct_callin = 1;
138: } else
139: return;
140:
141: if (sa -> x25_opts.op_flags & X25_REVERSE_CHARGE)
142: acbuf.x25acct_revcharge = 1;
143: acbuf.x25acct_stime = lcp -> lcd_stime;
144: acbuf.x25acct_etime = time.tv_sec - acbuf.x25acct_stime;
145: acbuf.x25acct_uid = current_proc() -> p_cred -> p_ruid;
146: acbuf.x25acct_psize = sa -> x25_opts.op_psize;
147: acbuf.x25acct_net = sa -> x25_net;
148: /*
149: * Convert address to bcd
150: */
151: src = sa -> x25_addr;
152: dst = acbuf.x25acct_addr;
153: for (len = 0; *src; len++)
154: if (len & 01)
155: *dst++ |= *src++ & 0xf;
156: else
157: *dst = *src++ << 4;
158: acbuf.x25acct_addrlen = len;
159:
160: bcopy (sa -> x25_udata, acbuf.x25acct_udata,
161: sizeof (acbuf.x25acct_udata));
162: acbuf.x25acct_txcnt = lcp -> lcd_txcnt;
163: acbuf.x25acct_rxcnt = lcp -> lcd_rxcnt;
164:
165: (void) vn_rdwr(UIO_WRITE, vp, (caddr_t)&acbuf, sizeof (acbuf),
166: (off_t)0, UIO_SYSSPACE, IO_UNIT|IO_APPEND,
167: current_proc() -> p_ucred, (int *)0,
168: (struct proc *)0);
169: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.