David Nugent [Mon, 3 Jul 2000 12:13:10 +0000 (12:13 +0000)]
Fix breakage introduced by bypassing update for additional 'mod'
functionality when nothing had actually changed; -d changes would
not set the 'something had changed flag'. Actually test for a
change in homedir.
PR: bin/19649
What the commit log for rev 1.16 neglected to mention was that the
delta touched the Name Description (Nd). It introduced a grammar
error and did not fix the extraneous punctuation (Nd lines are not
terminated with a period).
Peter Wemm [Mon, 3 Jul 2000 09:30:28 +0000 (09:30 +0000)]
Merge conflicting vendor changes onto mainline. This essentially reverts
this file to the vendor version except for the added $FreeBSD$.
(The rev 1.2 IEXTEN change has been implemented more cleanly)
Peter Wemm [Mon, 3 Jul 2000 06:24:23 +0000 (06:24 +0000)]
USA_RESIDENT is forced to YES or NO at the start of Makefile.inc1
Use that to be the final arbiter of whether or not to build the
librsaintl.so plugin for openssl/openssh. Add a magic WANT_RSAINTL flag
to force building even if USA_RESIDENT=YES.
Fix a nasty bug which would leave the struct hostent incompletely filled out
when parsing certain DNS records during a reverse address resolution. Thus
when code tries to examine the returned host name, it dereferences a null
pointer :-(
Document VIS_HTTPSTYLE:
VIS_HTTPSTYLE is a new encoding style for use in vis(), strvis() and
strvisx() that escapes characters according to RFC 1808 (URI encoding).
Since decoding of these require different detection of start-points of
escaped characters, VIS_HTTPSTYLE can be given as flag to unvis().
unvis() will then properly decode URIs.
A new function appeared, strunvisx(): strunvisx() behaves similar as
strunvis(), with one exception: It has an additional flag parameter,
which is passed to unvis() to archive the effect I described above.
- Various comment fixes and additions.
- Add 2 explicit (paranoid?) memory barriers in the
interrupt code (After the reading of the `flag' and
prior to looking at the data, of course. :-) ).
- Remove obsolete informations from the README.sym file.
This commit actually results in no object difference
for IA32, but 2x`mb' added for Alpha.
Add versions of the UK keymaps with the key marked "Caps Lock"
acting as a left control key. Many want a control key in the "real"
place, but still want the keymap to match the printed keys as much
as possible.
Inspired by obrien's us.pc-ctrl.kbd keymap, although I've had these
in my tree for a long time (since the left control key on my laptop
stopped working :)
Mark Murray [Sun, 2 Jul 2000 15:45:05 +0000 (15:45 +0000)]
Bunch-o'-tweaks.
1) (Biggest) I tried long-and-hard to keep the version number (5.006)
backwards compatible with FreeBSD; I have lost this battle, and
must defer to the Perl convention (5.6.0). Victims include suidperl.
this means that dirs with a name of 5.006 will be replaced with
dirs named 5.6.0 in both /usr/libdata/perl and /usr/local/lib/perl.
2) Errno module is added.
3) Alpha bits extensively tweeked after a Beast-build.
Enhance the optimization provided by pre-matching. Fix style bugs with
previous commits.
At the time we search the pattern for the "must" string, we now compute
the longest offset from the beginning of the pattern at which the must
string might be found. If that offset is found to be infinite (through
use of "+" or "*"), we set it to -1 to disable the heuristics applied
later.
After we are done with pre-matching, we use that offset and the point in
the text at which the must string was found to compute the earliest
point at which the pattern might be found.
Special care should be taken here. The variable "start" is passed to the
automata-processing functions fast() and slow() to indicate the point in
the text at which they should start working from. The real beginning of
the text is passed in a struct match variable m, which is used to check
for anchors. That variable, though, is initialized with "start", so we
must not adjust "start" before "m" is properly initialized.
Simple tests showed a speed increase from 100% to 400%, but they were
biased in that regexec() was called for the whole file instead of line
by line, and parenthized subexpressions were not searched for.
This change adds a single integer to the size of the "guts" structure,
and does not change the ABI.
Further improvements possible:
Since the speed increase observed here is so huge, one intuitive
optimization would be to introduce a bias in the function that computes
the "must" string so as to prefer a smaller string with a finite offset
over a larger one with an infinite offset. Tests have shown this to be a
bad idea, though, as the cost of false pre-matches far outweights the
benefits of a must offset, even in biased situations.
A number of other improvements suggest themselves, though:
* identify the cases where the pattern is identical to the must
string, and avoid entering fast() and slow() in these cases.
* compute the maximum offset from the must string to the end of
the pattern, and use that to set the point at which fast() and
slow() should give up trying to find a match, and return then
return to pre-matching.
* return all the way to pre-matching if a "match" was found and
later invalidated by back reference processing. Since back
references are evil and should be avoided anyway, this is of
little use.
Brian Feldman [Sun, 2 Jul 2000 08:08:09 +0000 (08:08 +0000)]
Modify ktrace's general I/O tracing, ktrgenio(), to use a struct uio *
instead of a struct iovec * array and int len. Get rid of stupidly trying
to allocate all of the memory and copyin()ing the entire iovec[], and
instead just do the proper VOP_WRITE() in ktrwrite() using a copy of
the struct uio that the syscall originally used.
This solves the DoS which could easily be performed; to work around the
DoS, one could also remove "options KTRACE" from the kernel. This is
a very strong MFC candidate for 4.1.
Prevent user from breaking his limits and restrictions or
abusing sendmail by any other way via MAILTO tag (since sendmail is running
from daemon). Now run sendmail from user, as any other cron user command.
Obtained from: Inspired by OpenBSD, but implementation is different
John Baldwin [Sat, 1 Jul 2000 21:48:05 +0000 (21:48 +0000)]
- Build modules with world so that modules are back in the bin dist.
- Small cleanups to kernel installs.
- Don't install kernel.config and loader.config on the boot floppy since
they haven't been used in quite some time.
Brian Feldman [Sat, 1 Jul 2000 05:48:33 +0000 (05:48 +0000)]
The SVR4 module calls itself ELFOSABI_SOLARIS, and who am I to disagree
if it runs my Solaris binaries? Add the missing "Solaris" type here
so that binaries may be branded with it rather than the seemingly-
defunct ELFOSABI_SVR4.
Brian Feldman [Sat, 1 Jul 2000 05:36:25 +0000 (05:36 +0000)]
Various cleanups are made to reduce warnings and make code prettier :)
Also, check for ftruncate() return value and die on failure, but only
try to ftruncate() when the file is a regular file.
Archie Cobbs [Thu, 29 Jun 2000 17:57:04 +0000 (17:57 +0000)]
Move the securelevel check before loading KLD's into linker_load_file(),
instead of requiring every caller of linker_load_file() to perform the
check itself. This avoids netgraph loading KLD's when securelevel > 0,
not to mention any future code that may call linker_load_file().
- Removed machine dependent directory and command from
src/release/{boot,fixit}_crunch.conf.
- Added machine specific fixit_crunch.conf for PC/AT and PC-98 to
src/release/$MACHINE.
- Use config file in src/release/$MACHINE if exist. If it does not exist,
use in src/release.
Alexander Langer [Thu, 29 Jun 2000 10:45:55 +0000 (10:45 +0000)]
- MSDOSFS can do both FAT _and_ FAT32. Since the name "MSDOS" might be
confusing, explecitely mention this.
- softupdates' README is no longer in contrib/softupdates. Fix new location.
John Baldwin [Thu, 29 Jun 2000 09:51:53 +0000 (09:51 +0000)]
Note that the cleaning up and reordering in revision 1.19 actually fixed a
nasty bug. The comparison to tset for an instruciton with the $0xf prefix
should have jumped down to the next non-prefix instruction test. Instead,
it jumped down to the next instruction test, which happened to be prefixed
instruction test. This test assumed that the earlier test had succeeded,
thus in some rare cases, this test would actually succeed, and we would
actually attempt to emulate a RDMSR instruction instead of the instruction
we were supposed to be emulating. Since %ecx usually did not contain a
valid MSR index at the time of the trap, this usually resulted in a #GP
due to an invalid MSR address and a lovely BTX fault when one tried to boot
the machine.
Satoshi Asami [Thu, 29 Jun 2000 06:26:13 +0000 (06:26 +0000)]
Increment __FreeBSD_version to mark perl5 upgrade in -current. (I
know, a little late, but snaps with the new perl5 aren't showing up
yet so it should still help.)
Daniel C. Sobral [Thu, 29 Jun 2000 04:48:34 +0000 (04:48 +0000)]
Add Boyler-Moore algorithm to pre-matching test.
The BM algorithm works by scanning the pattern from right to left,
and jumping as many characters as viable based on the text's mismatched
character and the pattern's already matched suffix.
This typically enable us to test only a fraction of the text's characters,
but has a worse performance than the straight-forward method for small
patterns. Because of this, the BM algorithm will only be used if the
pattern size is at least 4 characters.
Notice that this pre-matching is done on the largest substring of the
regular expression that _must_ be present on the text for a succesful
match to be possible at all.
For instance, "(xyzzy|grues)" will yield a null "must" substring, and,
therefore, not benefit from the BM algorithm at all. Because of the
lack of intelligence of the algorithm that finds the "must" string,
things like "charjump|matchjump" will also yield a null string. To
optimize that, "(char|match)jump" should be used.
The setup time (at regcomp()) for the BM algorithm will most likely
outweight any benefits for one-time matches. Given the slow regex(3)
we have, this is unlikely to be even perceptible, though.
The size of a regex_t structure is increased by 2*sizeof(char*) +
256*sizeof(int) + strlen(must)*sizeof(int). This is all inside the
regex_t's "guts", which is allocated dynamically by regcomp(). If
allocation of either of the two tables fail, the other one is freed.
In this case, the straight-forward algorithm is used for pre-matching.
Tests exercising the code path affected have shown a speed increase of
50% for "must" strings of length four or five.
API and ABI remain unchanged by this commit.
The patch submitted on the PR was not used, as it was non-functional.
Boris Popov [Thu, 29 Jun 2000 03:41:30 +0000 (03:41 +0000)]
If kernel compiled with INVARIANTS:
On unload, remove references from freelist to memory type defined by module.
Print a warning if module defines and allocate its own memory type, but
didn't free it all on unload.