|
|
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) 1996 Apple Computer, Inc.
27: *
28: * The information contained herein is subject to change without
29: * notice and should not be construed as a commitment by Apple
30: * Computer, Inc. Apple Computer, Inc. assumes no responsibility
31: * for any errors that may appear.
32: *
33: * Confidential and Proprietary to Apple Computer, Inc.
34: *
35: * File: cfg.c
36: */
37: #define RESOLVE_DBG
38: #include <sysglue.h>
39: #include <at/appletalk.h>
40: #include <lap.h>
41: #include <routing_tables.h>
42: #define _AURP
43: #include <at/aurp.h>
44: #include <at_aurp.h>
45:
46: extern atlock_t aurpgen_lock;
47: static int aurp_inited = 0;
48: static char aurp_minor_no[4];
49:
50: int aurp_open(gref)
51: gref_t *gref;
52: {
53: extern void AURPcmdx();
54: int i, s;
55:
56: if (!aurp_inited) {
57: aurp_inited = 1;
58: ATLOCKINIT(aurpgen_lock);
59: }
60:
61: for (i=1; i < sizeof(aurp_minor_no); i++) {
62: if (aurp_minor_no[i] == 0) {
63: aurp_minor_no[i] = (char )i;
64: break;
65: }
66: }
67: if (i == sizeof(aurp_minor_no))
68: return EAGAIN;
69: if (i == 1) {
70: aurp_gref = gref;
71: if (ddp_AURPfuncx(AURPCODE_REG, AURPcmdx, 0)) {
72: aurp_gref = 0;
73: aurp_minor_no[i] = 0;
74: return EPROTO;
75: }
76: }
77:
78: gref->info = (void *)&aurp_minor_no[i];
79: return 0;
80: }
81:
82: int aurp_close(gref)
83: gref_t *gref;
84: {
85: if (*(char *)gref->info == 1) {
86: aurp_gref = 0;
87: aurp_inited = 0;
88: ddp_AURPfuncx(AURPCODE_REG, 0, 0);
89: }
90:
91: *(char *)gref->info = 0;
92: gref->info = 0;
93: return 0;
94: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.