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
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
|
/*
* Linux initialization.
*
* Copyright (C) 1996 The University of Utah and the Computer Systems
* Laboratory at the University of Utah (CSL)
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2, or (at your option)
* any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
*
* Author: Shantanu Goel, University of Utah CSL
*/
/*
* linux/init/main.c
*
* Copyright (C) 1991, 1992 Linus Torvalds
*/
#include <sys/types.h>
#include <mach/vm_param.h>
#include <mach/vm_prot.h>
#include <mach/machine.h>
#include <vm/vm_page.h>
#include <kern/kalloc.h>
#include <machine/spl.h>
#include <machine/pmap.h>
#include <machine/vm_param.h>
#include <machine/model_dep.h>
#define MACH_INCLUDE
#include <linux/sched.h>
#include <linux/mm.h>
#include <linux/interrupt.h>
#include <linux/delay.h>
#include <linux/ioport.h>
#include <linux/string.h>
#include <linux/pci.h>
#include <linux/dev/glue/glue.h>
#include <asm/system.h>
#include <asm/io.h>
/*
* Timing loop count.
*/
unsigned long loops_per_sec = 1;
#if defined(__SMP__) && defined(__i386__)
unsigned long smp_loops_per_tick = 1000000;
#endif
/*
* End of physical memory.
*/
unsigned long high_memory;
/*
* Flag to indicate auto-configuration is in progress.
*/
int linux_auto_config = 1;
/*
* Hard drive parameters obtained from the BIOS.
*/
struct drive_info_struct
{
char dummy[32];
} drive_info;
/*
* Forward declarations.
*/
static void calibrate_delay (void);
/*
* Amount of contiguous memory to allocate for initialization.
*/
#define CONTIG_ALLOC (512 * 1024)
/*
* Initialize Linux drivers.
*/
void
linux_init (void)
{
int addr;
unsigned memory_start, memory_end;
vm_page_t pages;
/*
* Initialize memory size.
*/
high_memory = phys_last_addr;
init_IRQ ();
linux_sched_init ();
/*
* Set loop count.
*/
calibrate_delay ();
/*
* Initialize drive info.
*/
addr = *((unsigned *) phystokv (0x104));
memcpy (&drive_info,
(void *) ((addr & 0xffff) + ((addr >> 12) & 0xffff0)), 16);
addr = *((unsigned *) phystokv (0x118));
memcpy ((char *) &drive_info + 16,
(void *) ((addr & 0xffff) + ((addr >> 12) & 0xffff0)), 16);
/*
* Initialize Linux memory allocator.
*/
linux_kmem_init ();
/*
* Allocate contiguous memory below 16 MB.
*/
memory_start = (unsigned long) alloc_contig_mem (CONTIG_ALLOC,
16 * 1024 * 1024,
0, &pages);
if (memory_start == 0)
panic ("linux_init: alloc_contig_mem failed");
memory_end = memory_start + CONTIG_ALLOC;
/*
* Initialize PCI bus.
*/
memory_start = pci_init (memory_start, memory_end);
if (memory_start > memory_end)
panic ("linux_init: ran out memory");
/*
* Free unused memory.
*/
while (pages && phystokv(pages->phys_addr) < round_page (memory_start))
pages = (vm_page_t) pages->pageq.next;
if (pages)
free_contig_mem (pages);
/*
* Initialize devices.
*/
#ifdef CONFIG_INET
linux_net_emulation_init ();
#endif
cli ();
device_setup ();
#ifdef CONFIG_PCMCIA
/*
* Initialize pcmcia.
*/
pcmcia_init ();
#endif
restore_IRQ ();
linux_auto_config = 0;
}
#ifndef NBPW
#define NBPW 32
#endif
/*
* Allocate contiguous memory with the given constraints.
* This routine is horribly inefficient but it is presently
* only used during initialization so it's not that bad.
*/
void *
alloc_contig_mem (unsigned size, unsigned limit,
unsigned mask, vm_page_t * pages)
{
int i, j, bits_len;
unsigned *bits, len;
void *m;
vm_page_t p, page_list, tail, prev;
vm_offset_t addr, max_addr;
if (size == 0)
return (NULL);
size = round_page (size);
if ((size >> PAGE_SHIFT) > vm_page_free_count)
return (NULL);
/* Allocate bit array. */
max_addr = phys_last_addr;
if (max_addr > limit)
max_addr = limit;
bits_len = ((((max_addr >> PAGE_SHIFT) + NBPW - 1) / NBPW)
* sizeof (unsigned));
bits = (unsigned *) kalloc (bits_len);
if (!bits)
return (NULL);
memset (bits, 0, bits_len);
/*
* Walk the page free list and set a bit for every usable page.
*/
simple_lock (&vm_page_queue_free_lock);
p = vm_page_queue_free;
while (p)
{
if (p->phys_addr < limit)
(bits[(p->phys_addr >> PAGE_SHIFT) / NBPW]
|= 1 << ((p->phys_addr >> PAGE_SHIFT) % NBPW));
p = (vm_page_t) p->pageq.next;
}
/*
* Scan bit array for contiguous pages.
*/
len = 0;
m = NULL;
for (i = 0; len < size && i < bits_len / sizeof (unsigned); i++)
for (j = 0; len < size && j < NBPW; j++)
if (!(bits[i] & (1 << j)))
{
len = 0;
m = NULL;
}
else
{
if (len == 0)
{
addr = ((vm_offset_t) (i * NBPW + j)
<< PAGE_SHIFT);
if ((addr & mask) == 0)
{
len += PAGE_SIZE;
m = (void *) addr;
}
}
else
len += PAGE_SIZE;
}
if (len != size)
{
simple_unlock (&vm_page_queue_free_lock);
kfree ((vm_offset_t) bits, bits_len);
return (NULL);
}
/*
* Remove pages from free list
* and construct list to return to caller.
*/
page_list = NULL;
for (len = 0; len < size; len += PAGE_SIZE, addr += PAGE_SIZE)
{
prev = NULL;
for (p = vm_page_queue_free; p; p = (vm_page_t) p->pageq.next)
{
if (p->phys_addr == addr)
break;
prev = p;
}
if (!p)
panic ("alloc_contig_mem: page not on free list");
if (prev)
prev->pageq.next = p->pageq.next;
else
vm_page_queue_free = (vm_page_t) p->pageq.next;
p->free = FALSE;
p->pageq.next = NULL;
if (!page_list)
page_list = tail = p;
else
{
tail->pageq.next = (queue_entry_t) p;
tail = p;
}
vm_page_free_count--;
}
simple_unlock (&vm_page_queue_free_lock);
kfree ((vm_offset_t) bits, bits_len);
if (pages)
*pages = page_list;
return phystokv(m);
}
/*
* Free memory allocated by alloc_contig_mem.
*/
void
free_contig_mem (vm_page_t pages)
{
int i;
vm_page_t p;
for (p = pages, i = 0; p->pageq.next; p = (vm_page_t) p->pageq.next, i++)
p->free = TRUE;
p->free = TRUE;
simple_lock (&vm_page_queue_free_lock);
vm_page_free_count += i + 1;
p->pageq.next = (queue_entry_t) vm_page_queue_free;
vm_page_queue_free = pages;
simple_unlock (&vm_page_queue_free_lock);
}
/* This is the number of bits of precision for the loops_per_second. Each
* bit takes on average 1.5/HZ seconds. This (like the original) is a little
* better than 1%
*/
#define LPS_PREC 8
static void
calibrate_delay (void)
{
int ticks;
int loopbit;
int lps_precision = LPS_PREC;
loops_per_sec = (1 << 12);
#ifndef MACH
printk ("Calibrating delay loop.. ");
#endif
while (loops_per_sec <<= 1)
{
/* wait for "start of" clock tick */
ticks = jiffies;
while (ticks == jiffies)
/* nothing */ ;
/* Go .. */
ticks = jiffies;
__delay (loops_per_sec);
ticks = jiffies - ticks;
if (ticks)
break;
}
/* Do a binary approximation to get loops_per_second set to equal one clock
* (up to lps_precision bits)
*/
loops_per_sec >>= 1;
loopbit = loops_per_sec;
while (lps_precision-- && (loopbit >>= 1))
{
loops_per_sec |= loopbit;
ticks = jiffies;
while (ticks == jiffies);
ticks = jiffies;
__delay (loops_per_sec);
if (jiffies != ticks) /* longer than 1 tick */
loops_per_sec &= ~loopbit;
}
/* finally, adjust loops per second in terms of seconds instead of clocks */
loops_per_sec *= HZ;
/* Round the value and print it */
#ifndef MACH
printk ("ok - %lu.%02lu BogoMIPS\n",
(loops_per_sec + 2500) / 500000,
((loops_per_sec + 2500) / 5000) % 100);
#endif
#if defined(__SMP__) && defined(__i386__)
smp_loops_per_tick = loops_per_sec / 400;
#endif
}
|