1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
|
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* or http://www.opensolaris.org/os/licensing.
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright (c) 1991-1994, by Sun Microsystems, Inc.
* All rights reserved.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
#include <sys/promif.h>
#include <sys/promimpl.h>
/*
* This allocator has SMCC-OBP-like semantics associated with it.
* Specifically, the alignment value specifies both a physical
* and virtual alignment. If virthint is zero, a suitable virt
* is chosen. In either case, align is not ignored.
*
* This routine returns NULL on failure.
* This routine is suitable for (the given semantics) machines with
* a 2-cell physical address.
*
* Memory allocated with prom_alloc can be freed with prom_free.
*
* The generic allocator is prom_malloc.
*
*/
caddr_t
prom_alloc(caddr_t virthint, size_t size, u_int align)
{
caddr_t virt = virthint;
unsigned long long physaddr;
if (align == 0)
align = (u_int)1;
/*
* First, allocate or claim the virtual address space.
* In either case, after this code, "virt" is the chosen address.
*/
if (virthint == 0) {
virt = prom_allocate_virt(align, size);
if (virt == (caddr_t)-1)
return ((caddr_t)0);
} else {
if (prom_claim_virt(size, virthint) == (caddr_t)-1)
return ((caddr_t)0);
}
/*
* Next, allocate the physical address space, at the specified
* physical alignment (or 1 byte alignment, if none specified)
*/
if (prom_allocate_phys(size, align, &physaddr) == -1) {
/*
* Request failed, free virtual address space and return.
*/
prom_free_virt(size, virt);
return ((caddr_t)0);
}
/*
* Next, create a mapping from the physical to virtual address,
* using a default "mode".
*/
if (prom_map_phys(-1, size, virt, physaddr) == -1) {
/*
* The call failed; release the physical and virtual
* addresses allocated or claimed, and return.
*/
prom_free_virt(size, virt);
prom_free_phys(size, physaddr);
return ((caddr_t)0);
}
return (virt);
}
/*
* This is the generic client interface to "claim" memory.
* These two routines belong in the common directory.
*/
caddr_t
prom_malloc(caddr_t virt, size_t size, u_int align)
{
cell_t ci[7];
int rv;
ci[0] = p1275_ptr2cell("claim"); /* Service name */
ci[1] = (cell_t)3; /* #argument cells */
ci[2] = (cell_t)1; /* #result cells */
ci[3] = p1275_ptr2cell(virt); /* Arg1: virt */
ci[4] = p1275_size2cell(size); /* Arg2: size */
ci[5] = p1275_uint2cell(align); /* Arg3: align */
promif_preprom();
rv = p1275_cif_handler(&ci);
promif_postprom();
if (rv == 0)
return ((caddr_t)p1275_cell2ptr(ci[6])); /* Res1: base */
return ((caddr_t)-1);
}
void
prom_free(caddr_t virt, size_t size)
{
cell_t ci[5];
ci[0] = p1275_ptr2cell("release"); /* Service name */
ci[1] = (cell_t)2; /* #argument cells */
ci[2] = (cell_t)0; /* #result cells */
ci[3] = p1275_ptr2cell(virt); /* Arg1: virt */
ci[4] = p1275_size2cell(size); /* Arg2: size */
promif_preprom();
(void) p1275_cif_handler(&ci);
promif_postprom();
}
|
