NetBSD/sys/arch/i386/boot/sys.c

224 lines
5.1 KiB
C
Raw Normal View History

1993-03-21 21:04:42 +03:00
/*
* Ported to boot 386BSD by Julian Elischer (julian@tfs.com) Sept 1992
*
* Mach Operating System
* Copyright (c) 1992, 1991 Carnegie Mellon University
* All Rights Reserved.
*
* Permission to use, copy, modify and distribute this software and its
* documentation is hereby granted, provided that both the copyright
* notice and this permission notice appear in all copies of the
* software, derivative works or modified versions, and any portions
* thereof, and that both notices appear in supporting documentation.
*
* CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
* CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
* ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
*
* Carnegie Mellon requests users of this software to return to
*
* Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
* School of Computer Science
* Carnegie Mellon University
* Pittsburgh PA 15213-3890
*
* any improvements or extensions that they make and grant Carnegie Mellon
* the rights to redistribute these changes.
*
1994-01-11 17:24:11 +03:00
* $Id: sys.c,v 1.4 1994/01/11 14:27:56 mycroft Exp $
1993-03-21 21:04:42 +03:00
*/
#include "boot.h"
1993-12-17 03:41:23 +03:00
#include <sys/dirent.h>
1993-03-21 21:04:42 +03:00
#include <sys/reboot.h>
/* #define BUFSIZE 4096 */
#define BUFSIZE MAXBSIZE
char buf[BUFSIZE], fsbuf[SBSIZE], iobuf[MAXBSIZE];
int xread(addr, size)
char * addr;
int size;
{
int count = BUFSIZE;
while (size > 0) {
if (BUFSIZE > size)
count = size;
read(buf, count);
pcpy(buf, addr, count);
size -= count;
addr += count;
}
}
read(buffer, count)
int count;
char *buffer;
{
int logno, off, size;
int cnt2, bnum2;
while (count) {
off = blkoff(fs, poff);
logno = lblkno(fs, poff);
cnt2 = size = blksize(fs, &inode, logno);
bnum2 = fsbtodb(fs, block_map(logno)) + boff;
cnt = cnt2;
bnum = bnum2;
1994-01-11 17:24:11 +03:00
if (!off && (size <= count)) {
1993-03-21 21:04:42 +03:00
iodest = buffer;
devread();
1994-01-11 17:24:11 +03:00
} else {
1993-03-21 21:04:42 +03:00
iodest = iobuf;
size -= off;
if (size > count)
size = count;
devread();
1994-01-11 17:24:11 +03:00
bcopy(iodest + off, buffer, size);
1993-03-21 21:04:42 +03:00
}
buffer += size;
count -= size;
poff += size;
}
}
find(path)
1994-01-11 17:24:11 +03:00
char *path;
1993-03-21 21:04:42 +03:00
{
char *rest, ch;
int block, off, loc, ino = ROOTINO;
1993-12-17 03:41:23 +03:00
struct dirent *dp;
1994-01-11 17:24:11 +03:00
loop:
iodest = iobuf;
1993-03-21 21:04:42 +03:00
cnt = fs->fs_bsize;
1994-01-11 17:24:11 +03:00
bnum = fsbtodb(fs, itod(fs,ino)) + boff;
1993-03-21 21:04:42 +03:00
devread();
bcopy(&((struct dinode *)iodest)[ino % fs->fs_inopb],
&inode.i_din,
1994-01-11 17:24:11 +03:00
sizeof(struct dinode));
1993-03-21 21:04:42 +03:00
if (!*path)
return 1;
while (*path == '/')
path++;
1994-01-11 17:24:11 +03:00
if (!inode.i_size || ((inode.i_mode & IFMT) != IFDIR))
1993-03-21 21:04:42 +03:00
return 0;
1994-01-11 17:24:11 +03:00
for (rest = path; (ch = *rest) && ch != '/'; rest++);
1993-03-21 21:04:42 +03:00
*rest = 0;
loc = 0;
do {
if (loc >= inode.i_size)
return 0;
if (!(off = blkoff(fs, loc))) {
block = lblkno(fs, loc);
cnt = blksize(fs, &inode, block);
bnum = fsbtodb(fs, block_map(block)) + boff;
iodest = iobuf;
devread();
}
1993-12-17 03:41:23 +03:00
dp = (struct dirent *)(iodest + off);
1993-03-21 21:04:42 +03:00
loc += dp->d_reclen;
1993-12-17 03:41:23 +03:00
} while (!dp->d_fileno || strcmp(path, dp->d_name));
ino = dp->d_fileno;
1993-03-21 21:04:42 +03:00
*(path = rest) = ch;
goto loop;
}
char mapbuf[MAXBSIZE];
int mapblock = 0;
block_map(file_block)
1994-01-11 17:24:11 +03:00
int file_block;
1993-03-21 21:04:42 +03:00
{
if (file_block < NDADDR)
return(inode.i_db[file_block]);
1994-01-11 17:24:11 +03:00
if ((bnum = fsbtodb(fs, inode.i_ib[0]) + boff) != mapblock) {
1993-03-21 21:04:42 +03:00
iodest = mapbuf;
cnt = fs->fs_bsize;
devread();
mapblock = bnum;
}
return (((int *)mapbuf)[(file_block - NDADDR) % NINDIR(fs)]);
}
openrd()
{
char **devp, *cp = name;
/*******************************************************\
* If bracket given look for preceding device name *
\*******************************************************/
while (*cp && *cp!='(')
cp++;
1994-01-11 17:24:11 +03:00
if (!*cp) {
1993-03-21 21:04:42 +03:00
cp = name;
1994-01-11 17:24:11 +03:00
} else {
if (cp++ != name) {
1993-03-21 21:04:42 +03:00
for (devp = devs; *devp; devp++)
if (name[0] == (*devp)[0] &&
name[1] == (*devp)[1])
break;
1994-01-11 17:24:11 +03:00
if (!*devp) {
1993-03-21 21:04:42 +03:00
printf("Unknown device\n");
return 1;
}
maj = devp-devs;
}
/*******************************************************\
* Look inside brackets for unit number, and partition *
\*******************************************************/
if (*cp >= '0' && *cp <= '9')
1994-01-11 17:24:11 +03:00
if ((unit = *cp++ - '0') > 1) {
1993-03-21 21:04:42 +03:00
printf("Bad unit\n");
return 1;
}
if (!*cp || (*cp == ',' && !*++cp))
return 1;
if (*cp >= 'a' && *cp <= 'p')
part = *cp++ - 'a';
while (*cp && *cp++!=')') ;
if (!*cp)
return 1;
}
1994-01-11 17:24:11 +03:00
switch(maj) {
1993-03-21 21:04:42 +03:00
case 1:
dosdev = unit | 0x80;
unit = 0;
break;
case 0:
case 4:
dosdev = unit | 0x80;
break;
case 2:
dosdev = unit;
break;
case 3:
printf("Wangtek unsupported\n");
return 1;
break;
}
inode.i_dev = dosdev;
/***********************************************\
* Now we know the disk unit and part, *
* Load disk info, (open the device) *
\***********************************************/
if (devopen())
return 1;
/***********************************************\
* Load Filesystem info (mount the device) *
\***********************************************/
iodest = (char *)(fs = (struct fs *)fsbuf);
cnt = SBSIZE;
bnum = SBLOCK + boff;
devread();
/***********************************************\
* Find the actual FILE on the mounted device *
\***********************************************/
1994-01-11 17:24:11 +03:00
if (!find(cp)) {
1993-03-21 21:04:42 +03:00
return 1;
}
poff = 0;
name = cp;
return 0;
}