../
|
usr.sbin/
|
1532
(16 years ago)
by laffer1:
Always build pccard
|
usr.bin/
|
1521
(16 years ago)
by laffer1:
Update dig for bind 9.4.2
|
tools/
|
1409
(16 years ago)
by laffer1:
remove w3 check crap, fix hostnames
|
sys/
|
1419
(16 years ago)
by laffer1:
Fix spurious warnings from neighbor discovery when working with IPv6 over
point to point tunnels (gif).
This crops up when using one of the many IPV6 tunnel brokers, etc. with MidnightBSD.
Obtained from FreeBSD.
|
share/
|
1473
(16 years ago)
by laffer1:
Update for r33d
|
secure/
|
1460
(16 years ago)
by laffer1:
Add sftp-server-main.c which includes the main function for the sftp-server in openssh 4.9p1
|
sbin/
|
1466
(16 years ago)
by laffer1:
Don't leak memory #2
|
rescue/
|
1216
(16 years ago)
by laffer1:
Add chown to rescue. It could be very handy.
Remove alpha bits.
|
release/
|
1111
(16 years ago)
by laffer1:
We're making progress on transitioning off GNU cpio.
|
nrelease/
|
1064
(16 years ago)
by laffer1:
Running md5 and sha256 is rather helpful.
|
libexec/
|
1504
(16 years ago)
by ctriv:
add mport.query tool.
|
lib/
|
1518
(16 years ago)
by laffer1:
Add missing includes
|
kerberos5/
|
6
(18 years ago)
by laffer1:
This commit was generated by cvs2svn to compensate for changes in r5, which
included commits to RCS files with non-trunk default branches.
|
include/
|
1125
(16 years ago)
by laffer1:
Don't install umap filesystem headers.
|
gnu/
|
1418
(16 years ago)
by laffer1:
Add some newer OS releases for DF and FBSD.
|
games/
|
1153
(16 years ago)
by laffer1:
Forced commit to add:
The changes in the randomize_fd.c are pretty simple: Basically in the older algorithm you had to
walk thru the whole list element-by-element in order to reach an specific line and print it. This
process is rather slow in big lists (big files :)), since it had to go all the way from the head
of the list until it reached the element it randomly selected.
The new algorithm only changes the way we access the elements, basically after the whole file is
loaded up into the linked-list, we create an array of pointers to rand_node pointers, basically we
walk over the whole list once (after the whole file is loaded into the list) and map each address
into an array position (in the same order they were inserted on the list), after that whenever a
random number is selected, we dont need to walk the whole list until we reach it, we simply
rand_node_table[selected] it and get it in one move.
If the unique option is used, after a rand_node_table[selected] gets visited we set it to NULL
and if we reach that same slot afterwards, we simply go back and randomly select another number.
Pretty simple.
victor loureiro lima
|
etc/
|
1468
(16 years ago)
by laffer1:
debug is lying!
|
crypto/
|
1481
(16 years ago)
by laffer1:
Update for 5.0p1
|
contrib/
|
1517
(16 years ago)
by laffer1:
*** empty log message ***
|
bin/
|
1472
(16 years ago)
by laffer1:
FIx for r33d
|
UPDATING
|
1462
(16 years ago)
by laffer1:
Sync updating.
|
README
|
170
(17 years ago)
by laffer1:
Remove $FreeBSD$
|
ObsoleteFiles.inc
|
1288
(16 years ago)
by laffer1:
Remove early.sh
|
Makefile.inc1
|
687
(17 years ago)
by laffer1:
Clean up
|
Makefile
|
686
(17 years ago)
by laffer1:
Oops.. typo
|
MAINTAINERS
|
1433
(16 years ago)
by laffer1:
alex isn't with us anymore reset this.
|
COPYRIGHT
|
1363
(16 years ago)
by laffer1:
Happy New Year
|