Return to pk_acct.c CVS log

Up to [Apple XNU] / XNU / bsd / netccitt

Annotation of XNU/bsd/netccitt/pk_acct.c, revision 1.1

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

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.