| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2017-07-09 | remove redundant variable declarations in Makefiles, since those are | Marc Espie | |
| the default. okay millert@ | |||
| 2017-05-20 | reorg node struct so it's packed tighter (found by clang actually) | Marc Espie | |
| mark usage __dead okay millert@ | |||
| 2016-01-05 | stuff may still change, disable whitelist for now. | Marc Espie | |
| ok semarie@ | |||
| 2015-12-31 | Remove use of sysexits.h; OK espie@ | Todd C. Miller | |
| 2015-12-04 | read_hints should also protect against ferror. | Marc Espie | |
| obvious commit | |||
| 2015-10-11 | now that tsort has a clean structure, do more specific pledge() calls. | Marc Espie | |
| okay deraadt@ | |||
| 2015-10-11 | reorg code to have an array with all the files used apparent. | Marc Espie | |
| okay millert@ | |||
| 2015-10-10 | basic pledge "stdio rpath" | Theo de Raadt | |
| ok doug | |||
| 2015-09-03 | reorg code, preliminary step to more cleanup | Marc Espie | |
| - split the two blobs in main into separate functions - use return instead of exit okay millert@ | |||
| 2015-08-31 | indent is 8 not 4 | Marc Espie | |
| 2015-08-31 | wrong index in error message | Marc Espie | |
| 2015-07-29 | gc macro that's no longer used since the move to reallocarray | Marc Espie | |
| 2015-07-21 | whitespace cleanup | Jasper Lievisse Adriaanse | |
| 2014-10-11 | convert to use of reallocarray() | Theo de Raadt | |
| ok doug | |||
| 2014-05-12 | adjust to ohash being in libutil now, and to the interface changes. | Marc Espie | |
| fix potential integer overflows in memory allocation (mostly for pedagogical purposes, these are unlikely to overflow in practice) move the rest of lst.lib stuff into its own directory. | |||
| 2013-11-27 | unsigned char for ctype | Theo de Raadt | |
| ok okan | |||
| 2012-03-29 | there must be an even number of node names, not pairs; | Jason McIntyre | |
| from Jan Stary | |||
| 2010-09-03 | add an EXIT STATUS section for /usr/bin; | Jason McIntyre | |
| 2010-07-21 | document exit values; from daniel dickman | Jason McIntyre | |
| 2009-02-08 | updates to IEEE Std 1003.1-2008; | Jason McIntyre | |
| 2007-05-31 | convert to new .Dd format; | Jason McIntyre | |
| 2007-05-31 | - note some apps which are xpg4, not posix | Jason McIntyre | |
| - note that some apps are optional to posix after some discussion w/ otto | |||
| 2006-08-06 | +.Sh STANDARDS | Jason McIntyre | |
| from espie, tweaked by myself; | |||
| 2006-01-20 | use stdint.h where appropriate. okay millert@ | Marc Espie | |
| 2004-08-05 | simpler copyright, adjust date. | Marc Espie | |
| 2004-08-04 | sort SYNOPSIS and usage(), format tweaks, by jmc@ | Marc Espie | |
| 2004-08-04 | alternate description of tsort and example. | Marc Espie | |
| Approved by jmc@, with minor corrections coming up. | |||
| 2003-09-22 | Fix read beyond end of buffer, found by mallocguard. ok deraadt@ espie@ | Dale Rahn | |
| 2003-06-10 | mostly ansi cleanup; pval ok | Theo de Raadt | |
| 2003-06-10 | - section reorder | Jason McIntyre | |
| - COMPATIBILITY merge - macro cleanup - kill whitespace at EOL - new sentence, new line ssh pages ok markus@ | |||
| 2003-06-03 | Remove the advertising clause in the UCB license which Berkeley | Todd C. Miller | |
| rescinded 22 July 1999. Proofed by myself and Theo. | |||
| 2002-11-18 | Modern english is more than just a band, fix word choice; Jon Bernard | Todd C. Miller | |
| 2002-07-17 | spring clean-up: remove extra spaces at end of line, | Marc Espie | |
| and rescind 3rd licence clause. | |||
| 2002-02-27 | ANSI decls. okay millert@ | Marc Espie | |
| 2002-02-17 | Manual cleanup of remaining userland __P use (excluding packages maintained ↵ | Todd C. Miller | |
| outside the tree) | |||
| 2002-02-16 | Part one of userland __P removal. Done with a simple regexp with some minor ↵ | Todd C. Miller | |
| hand editing to make comments line up correctly. Another pass is forthcoming that handles the cases that could not be done automatically. | |||
| 2002-02-14 | lclint says this is an unsigned variable... and it's right ! | Marc Espie | |
| 2001-09-06 | Initial idea from aaron@: Last char of .Xr group in SEE ALSO section should | Mike Pechkin | |
| be a single digit. Powered by mantoya@. millert@ ok. | |||
| 2001-07-19 | CDIAGFLAGS | Marc Espie | |
| 2001-07-14 | Fix cycle detection. | Marc Espie | |
| Under some circumstances, trying to find a cycle starting with a given point can be very time-consuming (probably exponential, as an implementation of an NP-complete problem), so we lower our expectations, and just report the first cycle we find, irregardless of which point it cuts, which is guaranteed to be much faster (quadratic behavior at the worst--because we won't explore more than a tree out of the graph). Always find that cycle, even if -q is specified, so that -q is only `quiet', e.g., does not change the reported result. Based on a testcase reported by Dragos Ruiu, okay millert@ | |||
| 2001-07-11 | Clarify performance of tsort -l (hamiltonian circuit is NP-complete). | Marc Espie | |
| 2001-06-25 | Add -v flag to synopsis line | Peter Valchev | |
| 2001-05-01 | Revert stupid buggy optimisation. | Marc Espie | |
| Another Murphy's law: complicated code always works right the first time. Stupid dumb details, on the other hand. Of course we can't share both arrays, as we don't know how they will grow, duh ! | |||
| 2001-04-30 | Better hints handling (used for sorting package lists): | Marc Espie | |
| - nodes without a hint should be fully transparent. The make_transparent procedure is potentially slow, but in reality, it's very fast. - don't automatically add an order to un-hinted nodes, so that they are truely transparent. Better memory allocation: split the hash of nodes into a single array instead of duplicating the memory requirements. Okay Todd. | |||
| 2001-04-18 | Fix `hinted' options: set initial order to maximal, so that any hint | Marc Espie | |
| will be first. Also, keep order around between hints file and reading normal pairt, so that this option actually is useful. | |||
| 2001-04-07 | Small changes, user-friendly: | Marc Espie | |
| - just warn if hints file holds duplicates. So what ? We sure can't use uniq to remove those. - on the other hand, warn in verbose mode if main file holds nodes that are not in hints file. Ok millert@ | |||
| 2001-03-26 | Replacement for original tsort. | Marc Espie | |
| The old code suffers from a few defects: - it does not even implement the standard optimal topological sort algorithm. It's much slower. - its longest cycle computation is completely bogus. This is clean-slate code, that does implement the actual standard optimal topological sort, together with a correct graph traversal to find longest cycles. It does also feature a `stable tsort' mode, where it uses a heap to yield the least disturbed permutation of input nodes that satisfies the ordering constraints (in particular, try tsort -f). Thanks to the nature of the problem, the actual output won't exactly match the old one, but it does pass the regression suite (and it is a topological sorter). Ok millert@ | |||
| 2000-03-11 | Various cleanups and standardizations. | Aaron Campbell | |
| 2000-03-04 | In Unix land we prefer "whitespace" to "white space" or "white-space". At | Aaron Campbell | |
| least, this is the impression I get from looking at a lot of Perl docs. | |||
| 1998-10-30 | usr.bin/ man page fixes, t-z | Aaron Campbell | |
 |
index : src | |
| OpenBSD base system |
| summaryrefslogtreecommitdiff |