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
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
|
/*
* Copyright 2008 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
/*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer,
* without modification.
* 2. Redistributions in binary form must reproduce at minimum a disclaimer
* similar to the "NO WARRANTY" disclaimer below ("Disclaimer") and any
* redistribution must be conditioned upon including a substantially
* similar Disclaimer requirement for further binary redistribution.
* 3. Neither the names of the above-listed copyright holders nor the names
* of any contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* NO WARRANTY
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF NONINFRINGEMENT, MERCHANTIBILITY
* AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
* THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY,
* OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
* IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGES.
*
*/
#include <sys/param.h>
#include <sys/types.h>
#include <sys/cmn_err.h>
#include <sys/kmem.h>
#include <sys/ddi.h>
#include <sys/sunddi.h>
#include <sys/varargs.h>
#include "ath_hal.h"
#include "ath_impl.h"
struct ath_halfix {
void *p;
size_t size;
};
#define ATH_MAX_HALMEM 1024
static struct ath_halfix ath_halfix[ATH_MAX_HALMEM];
/* HAL layer needs these definitions */
int ath_hal_dma_beacon_response_time = 2; /* in TU's */
int ath_hal_sw_beacon_response_time = 10; /* in TU's */
int ath_hal_additional_swba_backoff = 0; /* in TU's */
/*
* Print/log message support.
*/
void
ath_hal_printf(struct ath_hal *ah, const char *fmt, ...)
{
va_list ap;
_NOTE(ARGUNUSED(ah))
va_start(ap, fmt);
vcmn_err(CE_CONT, fmt, ap);
va_end(ap);
}
/*
* Delay n microseconds.
*/
void
ath_hal_delay(int n)
{
drv_usecwait(n);
}
/*
* ath_hal_malloc() and ath_hal_free() are called
* within ath_hal.o. We must record the size of
* the memory alloced, so ath_hal_free() can get
* the size and then calls kmem_free().
*/
void *
ath_hal_malloc(size_t size)
{
void *p;
int i;
for (i = 0; i < ATH_MAX_HALMEM; i++) {
if (ath_halfix[i].p == NULL)
break;
}
if (i >= ATH_MAX_HALMEM) {
ath_problem("ath: ath_hal_malloc(): too many malloc\n");
return (NULL);
}
p = kmem_zalloc(size, KM_SLEEP);
ath_halfix[i].p = p;
ath_halfix[i].size = size;
ATH_DEBUG((ATH_DBG_OSDEP, "ath: ath_hal_malloc(): "
"%d: p=%p, size=%d\n", i, p, size));
return (p);
}
void
ath_hal_free(void* p)
{
int i;
for (i = 0; i < ATH_MAX_HALMEM; i++) {
if (ath_halfix[i].p == p)
break;
}
if (i >= ATH_MAX_HALMEM) {
ath_problem("ath: ath_hal_free(): no record for %p\n", p);
return;
}
kmem_free(p, ath_halfix[i].size);
ath_halfix[i].p = NULL;
ATH_DEBUG((ATH_DBG_OSDEP, "ath: ath_hal_free(): %d: p=%p, size=%d\n",
i, p, ath_halfix[i].size));
}
void *
ath_hal_memcpy(void *dst, const void *src, size_t n)
{
bcopy(src, dst, n);
return (dst);
}
void
ath_hal_memzero(void *dst, size_t n)
{
bzero(dst, n);
}
void
ath_halfix_init(void)
{
int i;
for (i = 0; i < ATH_MAX_HALMEM; i++)
ath_halfix[i].p = NULL;
}
void
ath_halfix_finit(void)
{
int i;
for (i = 0; i < ATH_MAX_HALMEM; i++)
if (ath_halfix[i].p != NULL) {
kmem_free(ath_halfix[i].p, ath_halfix[i].size);
ATH_DEBUG((ATH_DBG_OSDEP, "ath_halfix: "
"Free %d: p=%x size=%d\n",
i, ath_halfix[i].p, ath_halfix[i].size));
}
}
|
