-$OpenBSD: README,v 1.3 2016/12/17 16:12:15 krw Exp $
+$OpenBSD: README,v 1.4 2022/01/11 05:34:32 jsg Exp $
$NetBSD: README,v 1.7 2015/01/12 19:50:47 christos Exp $
makefs - build a file system image from a directory tree
ffs BSD fast file system
msdos MS-DOS `FAT' file system (FAT12, FAT16, FAT32)
-Various file system independent parameters and contraints can be
+Various file system independent parameters and constraints can be
specified, such as:
- minimum file system size (in KB)
prepare_options and cleanup_options are optional and can be NULL.
NOTE: All file system specific options are referenced via the fs_specific
-pointer from the fsinfo_t strucutre. It is up to the filesystem to allocate
+pointer from the fsinfo_t structure. It is up to the filesystem to allocate
and free any data needed for this via the prepare and cleanup callbacks.
Each fs-specific module will need to add its routines to the dispatch array
-/* $OpenBSD: cd9660.c,v 1.22 2021/07/12 15:09:21 beck Exp $ */
+/* $OpenBSD: cd9660.c,v 1.23 2022/01/11 05:34:32 jsg Exp $ */
/* $NetBSD: cd9660.c,v 1.53 2016/11/25 23:02:44 christos Exp $ */
/*
/*
- * Allocate and initalize a cd9660node
+ * Allocate and initialize a cd9660node
* @returns struct cd9660node * Pointer to new node, or NULL on error
*/
static cd9660node *
/*
* Called After cd9660_sorted_child_insert
- * handles file collisions by suffixing each filname with ~n
+ * handles file collisions by suffixing each filename with ~n
* where n represents the files respective place in the ordering
*/
static int
-/* $OpenBSD: cd9660_write.c,v 1.8 2017/04/06 19:09:45 natano Exp $ */
+/* $OpenBSD: cd9660_write.c,v 1.9 2022/01/11 05:34:33 jsg Exp $ */
/* $NetBSD: cd9660_write.c,v 1.17 2013/10/19 17:16:37 christos Exp $ */
/*
/*
* Write the path tables: there are actually four, but right
- * now we are only concearned with two.
+ * now we are only concerned with two.
*/
status = cd9660_write_path_tables(diskStructure, fd);
if (status == 0) {
* Here is a new revelation that ECMA didnt explain
* (at least not well).
* ALL . and .. records store the name "\0" and "\1"
- * resepctively. So, for each directory, we have to
+ * respectively. So, for each directory, we have to
* make a new node.
*
* This is where it gets kinda messy, since we have to
-/* $OpenBSD: ffs.c,v 1.35 2021/10/24 21:24:19 deraadt Exp $ */
+/* $OpenBSD: ffs.c,v 1.36 2022/01/11 05:34:32 jsg Exp $ */
/* $NetBSD: ffs.c,v 1.66 2015/12/21 00:58:08 christos Exp $ */
/*
- /* publically visible functions */
+ /* publicly visible functions */
void
ffs_prep_opts(fsinfo_t *fsopts)
{
-/* $OpenBSD: ffs_alloc.c,v 1.14 2021/10/06 00:40:41 deraadt Exp $ */
+/* $OpenBSD: ffs_alloc.c,v 1.15 2022/01/11 05:34:33 jsg Exp $ */
/* $NetBSD: ffs_alloc.c,v 1.29 2016/06/24 19:24:11 christos Exp $ */
/* From: NetBSD: ffs_alloc.c,v 1.50 2001/09/06 02:16:01 lukem Exp */
* 1) allocate the requested block.
* 2) allocate a rotationally optimal block in the same cylinder.
* 3) allocate a block in the same cylinder group.
- * 4) quadradically rehash into other cylinder groups, until an
+ * 4) quadratically rehash into other cylinder groups, until an
* available block is located.
* If no block preference is given the following hierarchy is used
* to allocate a block:
* 1) allocate a block in the cylinder group that contains the
* inode for the file.
- * 2) quadradically rehash into other cylinder groups, until an
+ * 2) quadratically rehash into other cylinder groups, until an
* available block is located.
*/
int
*
* The policy implemented by this algorithm is:
* 1) allocate the block in its requested cylinder group.
- * 2) quadradically rehash on the cylinder group number.
+ * 2) quadratically rehash on the cylinder group number.
* 3) brute force search for a free block.
*
* `size': size for data blocks, mode for inodes
-/* $OpenBSD: ffs_subr.c,v 1.5 2021/10/06 00:40:41 deraadt Exp $ */
+/* $OpenBSD: ffs_subr.c,v 1.6 2022/01/11 05:34:33 jsg Exp $ */
/* $NetBSD: ffs_subr.c,v 1.49 2016/05/07 11:59:08 maxv Exp $ */
/*
* block operations
*
* check if a block is available
- * returns true if all the correponding bits in the free map are 1
+ * returns true if all the corresponding bits in the free map are 1
* returns false if any corresponding bit in the free map is 0
*/
int
-/* $OpenBSD: msdosfs_fat.c,v 1.6 2021/10/06 00:40:41 deraadt Exp $ */
+/* $OpenBSD: msdosfs_fat.c,v 1.7 2022/01/11 05:34:33 jsg Exp $ */
/* $NetBSD: msdosfs_fat.c,v 1.31 2016/05/07 16:43:02 mlelstv Exp $ */
/*-
int error;
u_long i;
u_long cn;
- u_long prevcn = 0; /* XXX: prevcn could be used unititialized */
+ u_long prevcn = 0; /* XXX: prevcn could be used uninitialized */
u_long byteoffset;
u_long bn;
u_long bo;
}
/*
- * Allocate contigous free clusters.
+ * Allocate contiguous free clusters.
*
* pmp - mount point.
* start - start of cluster chain.
{
u_long idx;
u_long len, newst, foundl, cn, l;
- u_long foundcn = 0; /* XXX: foundcn could be used unititialized */
+ u_long foundcn = 0; /* XXX: foundcn could be used uninitialized */
u_long fillwith = CLUST_EOFE;
u_int map;
-/* $OpenBSD: walk.c,v 1.10 2021/09/01 15:19:00 deraadt Exp $ */
+/* $OpenBSD: walk.c,v 1.11 2022/01/11 05:34:32 jsg Exp $ */
/* $NetBSD: walk.c,v 1.29 2015/11/25 00:48:49 christos Exp $ */
/*
/*
* free_fsnodes --
* Removes node from tree and frees it and all of
- * its decendents.
+ * its descendants.
*/
void
free_fsnodes(fsnode *node)
projects / openbsd / commitdiff