summaryrefslogtreecommitdiffstats
path: root/lib/libc
Commit message (Collapse)AuthorAgeFilesLines
...
* reject empty scopeid. use strtoul() for checking all-numericness ofitojun2000-07-091-8/+15
| | | | | portname. explicitly reject empty numeric portname. sync with kame. based on comments from itohy@netbsd.org
* First appeared in 2.9BSD, not 3.0.dannyboy2000-07-081-1/+1
| | | | | | PR: 19263 Submitted by: NOKUBI Hirotaka <nokubi@ff.iij4u.or.jp> Obtained from: Open|NetBSD
* Since we have modified charjump to be CHAR_MIN-based, we have todcs2000-07-081-1/+2
| | | | | | correct the offset when we free it. Caught by: phkmalloc
* Change the dllockinit() interface from "experimental" tojdp2000-07-081-3/+4
| | | | "deprecated" and warn that it will disappear eventually.
* fix commentache2000-07-071-1/+1
|
* Do not free NULL pointers.dcs2000-07-071-1/+1
|
* Deal with the signed/unsigned chars issue in a more proper manner. Wedcs2000-07-072-21/+17
| | | | | | | | | use a CHAR_MIN-based array, like elsewhere in the code. Remove a number of unused variables (some due to the above change, one that was left after a number of optimizing steps through the source). Brucified by: bde
* remove sys/time.h by instruction from bde.jmg2000-07-061-1/+0
|
* cleanup the tsearch import.alfred2000-07-062-53/+4
| | | | | | | | | | | | remove (comment out) functions defined or depricated elsewhere: bsearch, lfind, lsearch, insque, remque change hcreate to take a size_t rather than uint (essentially the same) since hcreate/hdestroy are now in <search.h>, remove private search.h in lib/libc/db/hash/ add $FreeBSD tags to hsearch.c
* I hate signed chars.^W^W^W^W^WCast to unsigned char before using signeddcs2000-07-061-1/+1
| | | | chars as array indices.
* Correct comment to work with test code.dcs2000-07-061-2/+2
| | | | Prevent out of bounds array access in some specific cases.
* Use UCHAR_MAX consistently.dcs2000-07-061-1/+1
|
* sync with more recent kame tree.itojun2000-07-052-45/+254
| | | | | - correct scoped notation separator (s/@/%/) - include example and more references
* sync with latest kame.itojun2000-07-051-70/+208
| | | | | | | | - permit numeric scopeid, be more careful about buffer size TODO: 2nd arg type should be socklen_t for RFC2553 conformance, but due to include file dependency it is not a easy thing to do (netdb.h does not have socklen_t)
* sync with kame.itojun2000-07-051-29/+50
| | | | | - better return code. from enami@netbsd - do not use "class" as variable name. C++ guy had trouble with it.
* o Enable building of libposix1e capability state utility functions andrwatson2000-07-051-8/+12
| | | | | | capability-related syscall wrappers. Obtained from: TrustedBSD Project
* o Introduce cap_{get,set}_{file,fd}() syscall wrappers, associated withrwatson2000-07-054-0/+196
| | | | | | | soon to be committed syscall stubs. These calls will be used to get and set capability state associated with executables. Obtained from: TrustedBSD Project
* o When calling the syscall, use &cap instead of cap. Apparently thisrwatson2000-07-051-1/+1
| | | | | | | error was introduced during the merge; fixing it corrects a (correct) warning about types. Obtained from: TrustedBSD Project
* o Comment out <sys/audit.h> and <sys/mac.h> since they are not yetrwatson2000-07-051-2/+2
| | | | | | committed Obtained from: TrustedBSD Project
* add getifaddrs(3) from bsdi. this is a magic function which lets you grabitojun2000-07-053-2/+545
| | | | | | interface addresses in a portable manner, without headache of SIOCGIFCONF or sysctl. it is in bsdi/openbsd/netbsd already. from kame tree (actually, mandatory for latest kame tree).
* Describe agrument range correctly, according to multibyte(3)ache2000-07-032-23/+21
| | | | Remove unneded comment
* Remove trailing whitespace only.sheldonh2000-07-032-18/+18
|
* Fix overlong line and trailing whitespace introduced in rev 1.8.sheldonh2000-07-031-1/+2
|
* Add to the SEE ALSO section, a reference to the RFC mentioned insheldonh2000-07-032-1/+12
| | | | text introduced in the previous commit.
* Re-pair the MLINKS of unvis.3 with strunvisx.3. This undoubtedly was agreen2000-07-031-1/+1
| | | | world breakage.
* Previous commit broke the case of chained CNAME entries. Instead handlekris2000-07-031-6/+18
| | | | | | | the bogus case by being stricter about errors. Submitted by: itojun Obtained from: KAME
* Fix a nasty bug which would leave the struct hostent incompletely filled outkris2000-07-031-1/+1
| | | | | | | | 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 :-( Problem noticed by: ps
* Add strunvisx.3 MLINK.alex2000-07-021-1/+1
|
* Document VIS_HTTPSTYLE:alex2000-07-022-4/+34
| | | | | | | | | | | | | 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.
* Fix memory leak introduced with regcomp.c rev 1.14.dcs2000-07-021-0/+6
|
* Enhance the optimization provided by pre-matching. Fix style bugs withdcs2000-07-023-12/+177
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 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.
* Remove from the notes a bug that it's said to have been fixed.dcs2000-07-021-5/+0
| | | | | | PR: 15561 Submitted by: Martin Kammerhofer <mkamm@gmx.net> Confirmed by: ache
* Style fixes.dan2000-07-011-11/+12
|
* Add URI encoding to the vis/unvis routines courtesy of VIS_HTTPSTYLE.dan2000-07-012-1/+73
| | | | | | | | Since alex is a -doc committer, he can update his own manpage. :-) Also add $FreeBSD$ while I'm here. Submitted by: alex
* bring in binary search tree code.alfred2000-07-016-2/+347
| | | | Obtained from: NetBSD
* Initialize variables used by the Boyer-Moore algorithm.dcs2000-06-291-0/+2
| | | | | | | This should fix core dumps when the must pattern is of length three or less. Bug found by: knu
* Fix assigning alt_month in compatibility codeache2000-06-291-1/+1
|
* Add Boyler-Moore algorithm to pre-matching test.dcs2000-06-293-6/+202
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 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. PR: 14342
* Fix typo in SEE ALSO section.jasone2000-06-281-1/+1
|
* change first release date to 4.1-R as 5.0-R won't be out for at least ajmg2000-06-261-1/+1
| | | | | | year (from jkh).. Caught by: Fx macro warning on 3.4-R
* The argument is not mcontext_t but ucontext_t.alex2000-06-261-1/+1
| | | | | PR: 17836 Submitted by: Tim Moore <moore@bricoworks.com>
* Repair a cross-reference to sync(1) that should refer to sync(8).chris2000-06-231-1/+1
|
* Properly separate paragraphs by using `.Pp' instead of a blank line.chris2000-06-233-6/+6
|
* Remove blank lines.chris2000-06-234-4/+0
|
* Mark up errno as a variable (Va), not as a defined value (Dv).sheldonh2000-06-231-3/+3
| | | | | Do not terminate the cross-reference list in the SEE ALSO section with a period.
* Apply the accepted line breaking rules.sheldonh2000-06-231-7/+10
|
* Replace .Va, .Ar and .Nm with .Fa or .Va where necessary, examples:chris2000-06-2329-145/+145
| | | | | | ``.Ar errno'' -> ``.Va errno'' ``.Nm ops'' -> ``.Fa ops'' ``.Va fd'' -> ``.Fa fd''
* Replace an erroneous `.Va error' with `.Va errno'.chris2000-06-231-1/+1
|
* Replace ``FreeBSD 4.0'' with ``.Fx 4.0'' and remove a useless empty linechris2000-06-231-2/+2
| | | | at the end of the file.
* Replace .Va references to function arguments to .Fa references.chris2000-06-231-2/+2
|
OpenPOWER on IntegriCloud