Return to syscall_emulation.h CVS log

Up to [Apple XNU] / XNU / osfmk / kern

Annotation of XNU/osfmk/kern/syscall_emulation.h, revision 1.1.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:  * @OSF_COPYRIGHT@
                     24:  */
                     25: /* 
                     26:  * Mach Operating System
                     27:  * Copyright (c) 1991,1990,1989,1988,1987 Carnegie Mellon University
                     28:  * All Rights Reserved.
                     29:  * 
                     30:  * Permission to use, copy, modify and distribute this software and its
                     31:  * documentation is hereby granted, provided that both the copyright
                     32:  * notice and this permission notice appear in all copies of the
                     33:  * software, derivative works or modified versions, and any portions
                     34:  * thereof, and that both notices appear in supporting documentation.
                     35:  * 
                     36:  * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
                     37:  * CONDITION.  CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
                     38:  * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
                     39:  * 
                     40:  * Carnegie Mellon requests users of this software to return to
                     41:  * 
                     42:  *  Software Distribution Coordinator  or  [email protected]
                     43:  *  School of Computer Science
                     44:  *  Carnegie Mellon University
                     45:  *  Pittsburgh PA 15213-3890
                     46:  * 
                     47:  * any improvements or extensions that they make and grant Carnegie Mellon
                     48:  * the rights to redistribute these changes.
                     49:  */
                     50: /*
                     51:  */
                     52: 
                     53: #ifndef        _KERN_SYSCALL_EMULATION_H_
                     54: #define        _KERN_SYSCALL_EMULATION_H_
                     55: 
                     56: #ifndef        ASSEMBLER
                     57: #include <kern/kern_types.h>
                     58: #include <mach/machine/vm_types.h>
                     59: #include <kern/lock.h>
                     60: 
                     61: typedef        vm_offset_t     eml_routine_t;
                     62: 
                     63: typedef struct eml_dispatch {
                     64:        decl_mutex_data(,lock)          /* lock for reference count */
                     65:        int             ref_count;      /* reference count */
                     66:        int             disp_count;     /* count of entries in vector */
                     67:        int             disp_min;       /* index of lowest entry in vector */
                     68:        eml_routine_t   disp_vector[1]; /* first entry in array of dispatch */
                     69:                                        /* routines (array has disp_count
                     70:                                           elements) */
                     71: } *eml_dispatch_t;
                     72: 
                     73: #define EML_ROUTINE_NULL       (eml_routine_t)0
                     74: #define EML_DISPATCH_NULL      (eml_dispatch_t)0
                     75: 
                     76: #define        EML_SUCCESS             (0)
                     77: 
                     78: #define        EML_MOD                 (err_kern|err_sub(2))
                     79: #define        EML_BAD_TASK            (EML_MOD|0x0001)
                     80: #define        EML_BAD_CNT             (EML_MOD|0x0002)
                     81: 
                     82: /* Per-task initialization */
                     83: extern void    eml_init(void);
                     84: 
                     85: /* Take reference on common task emulation vector */
                     86: extern void    eml_task_reference(
                     87:                        task_t  new_task,
                     88:                        task_t  parent_task);
                     89: 
                     90: /* Deallocate reference on common task emulation vector */
                     91: extern void    eml_task_deallocate(
                     92:                        task_t  task);
                     93: 
                     94: #endif /* ASSEMBLER */
                     95: 
                     96: #endif /* _KERN_SYSCALL_EMULATION_H_ */

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