AC_MSG_CHECKING([whether to include error messages])
AC_ARG_ENABLE([error_messages],
- AS_HELP_STRING([--disable-error-messages], [do not compile in error messsages]),
+ AS_HELP_STRING([--disable-error-messages], [do not compile in error messages]),
[ENABLE_ERROR_MESSAGES=$enableval],
[ENABLE_ERROR_MESSAGES=yes])
AC_MSG_RESULT([$ENABLE_ERROR_MESSAGES])
.PP
Add some files and directories to a WIM image. Note that the first path of each
\fBadd\fR command specifies the files to add, while the second path of each
-\fBadd\fR command specify the locations at which to to add them inside the WIM
+\fBadd\fR command specify the locations at which to add them inside the WIM
image:
.PP
.RS
* @param wim_ret
* On success, a pointer to the new ::WIMStruct is written to the memory
* location pointed to by this parameter. This ::WIMStruct must be freed
- * using using wimlib_free() when finished with it.
+ * using wimlib_free() when finished with it.
*
* @return 0 on success; a ::wimlib_error_code value on failure.
*
* @param wim_ret
* On success, a pointer to a new ::WIMStruct backed by the specified
* on-disk WIM file is written to the memory location pointed to by this
- * parameter. This ::WIMStruct must be freed using using wimlib_free()
- * when finished with it.
+ * parameter. This ::WIMStruct must be freed using wimlib_free() when
+ * finished with it.
*
* @return 0 on success; a ::wimlib_error_code value on failure.
*
if (!table)
goto oom;
- /* Allocate and initalize blob descriptors from the raw blob table
+ /* Allocate and initialize blob descriptors from the raw blob table
* buffer. */
for (size_t i = 0; i < num_entries; i++) {
const struct blob_descriptor_disk *disk_entry =
* shortening the longest codeword that is generated.
*
* There also is the issue of how codewords longer than @max_codeword_len
- * are dealt with. Fortunately, for LZMS this is irrelevant because
- * because for the LZMS alphabets no codeword can ever exceed
- * LZMS_MAX_CODEWORD_LEN (= 15). Since the LZMS algorithm regularly
- * halves all frequencies, the frequencies cannot become high enough for
- * a length 16 codeword to be generated. Specifically, I think that if
- * ties are broken in favor of non-leaves (as we do), the lowest total
- * frequency that would give a length-16 codeword would be the sum of the
- * frequencies 1 1 1 3 4 7 11 18 29 47 76 123 199 322 521 843 1364, which
- * is 3570. And in LZMS we can't get a frequency that high based on the
- * alphabet sizes, rebuild frequencies, and scaling factors. This
- * worst-case scenario is based on the following degenerate case (only
- * the bottom of the tree shown):
+ * are dealt with. Fortunately, for LZMS this is irrelevant because for
+ * the LZMS alphabets no codeword can ever exceed LZMS_MAX_CODEWORD_LEN
+ * (= 15). Since the LZMS algorithm regularly halves all frequencies,
+ * the frequencies cannot become high enough for a length 16 codeword to
+ * be generated. Specifically, I think that if ties are broken in favor
+ * of non-leaves (as we do), the lowest total frequency that would give a
+ * length-16 codeword would be the sum of the frequencies 1 1 1 3 4 7 11
+ * 18 29 47 76 123 199 322 521 843 1364, which is 3570. And in LZMS we
+ * can't get a frequency that high based on the alphabet sizes, rebuild
+ * frequencies, and scaling factors. This worst-case scenario is based
+ * on the following degenerate case (only the bottom of the tree shown):
*
* ...
* 17
* but rather we combine many symbols into a single "observation type". For
* literals we only look at the high bits and low bits, and for matches we only
* look at whether the match is long or not. The assumption is that for typical
- * "real" data, places that are good block boundaries will tend to be noticable
+ * "real" data, places that are good block boundaries will tend to be noticeable
* based only on changes in these aggregate frequencies, without looking for
* subtle differences in individual symbols. For example, a change from ASCII
* bytes to non-ASCII bytes, or from few matches (generally less compressible)
path_max = compute_path_max(dentry_list);
/* Add some extra for building Win32 paths for the file encryption APIs,
- * and ensure we have at least enough to potentially use a 8.3 name for
+ * and ensure we have at least enough to potentially use an 8.3 name for
* the last component. */
path_max += max(2 + (ctx->target_ntpath.Length / sizeof(wchar_t)),
8 + 1 + 3);
error "Failed to re-mount test WIM read-write"
fi
if ! imagex_unmount tmp.mnt --commit --check; then
- error "Failed to unmount read-write mounted WIM with changes commited (no changes made)"
+ error "Failed to unmount read-write mounted WIM with changes committed (no changes made)"
fi
echo "Testing removing file from mounted WIM"
if ! wimmountrw dir.wim dir tmp.mnt; then