Age | Commit message (Collapse) | Author | |
---|---|---|---|
2004-08-10 | order #includes, Brian Poole <raj@cerias.purdue.edu> | Henning Brauer | |
2004-08-10 | wrong sizeof; Brian Poole <raj@cerias.purdue.edu> | Henning Brauer | |
2004-08-10 | in the pool case ("servers somepool.somewhere"), we add new peers while | Henning Brauer | |
looping over the addresses returned by the dns lookup, as each address is one new peer. however, if the lookup fails with a temporary error, we will try to lookup later again. for that, we obviously need to insert one peer with the hostname in addr_head... change one for() loop into a do { } while() one | |||
2004-08-10 | move memory allocation for new peers into a new function, makes ID allocation | Henning Brauer | |
easier | |||
2004-07-29 | keep an ID per server we talk to | Henning Brauer | |
2004-07-28 | prevent unresolvable hostnames in "listen on" statements | Henning Brauer | |
2004-07-28 | when a dns lookup fails at parse time, do not abort but try again | Henning Brauer | |
to resolve the hostname every 60 seconds fixes ntpd invocations before e. g. a dialup link is established and such. as we want ntpd to be a "fire and forget" background daemon it should cope with such situations. tested by many | |||
2004-07-25 | remove unused function | Henning Brauer | |
2004-07-21 | no multiple free(); "John L. Scarfone" <j0@cox.net> | Henning Brauer | |
2004-07-20 | wrap the heads for the linked list of addresses into a new ntp_addr_wrap | Henning Brauer | |
which, besides the head pointer for the list of course, stores the original address as specified (i. e. as hostname instead of resolved IPs) and flags and such. | |||
2004-07-18 | there are a few recvfrom(2) errors we do not want to panic on | Henning Brauer | |
2004-07-18 | query interval scaling, episode II | Henning Brauer | |
1) base the interval calculation on the offset from the last reply, not from the last peer update. Allows us to send more queries again faster when the local clock diverges too much 2) every time we form a peer update (for which we need 8 replies) check wether we have a ready peer update for all peers that are currently trusted, and if so, calculate the total offset and call adjtime(). that means that adjtime is no longer called in fixed intervals but whenever we have enough data to reliably calculate the local clock offset. In practice, that means we call adjtime() less often, but with probably better data. 3) invalidate peer updates after beeing used. no point in re-using them - this resulted in calling adjtime() multiple times with the same offset, which doesn't make sense tested by many | |||
2004-07-14 | do not do the stratum guessing dance. | Henning Brauer | |
stratum is pretty much pointless anyway these days, and we certainly do not want to send out illegal packets (stratum=0) until synced... | |||
2004-07-13 | tweaks; ok henning@ | Jason McIntyre | |
2004-07-13 | Respond to client queries with better server statistics. We now output | Alexander Guy | |
a close-to-reality stratum, a real reference time, and a leap indicator that will indicate if the local clock isn't synchronized. This also means that until the server feels it's synchronized, it will tell the clients it isn't. This is normal, and correct. ok henning@ | |||
2004-07-13 | ignore obviously malformed queries; ok henning@ | Alexander Guy | |
2004-07-13 | liek bgpd, use a socketpair(2) instead of a pipe(2) | Henning Brauer | |
2004-07-12 | Add missing newlines | Darren Tucker | |
2004-07-12 | Replace errx with equivalent fprintf+exit to make porting easier; ok henning@ | Darren Tucker | |
2004-07-11 | Use SA_LEN(sa) instead of sa->sa_len; ok henning@ | Darren Tucker | |
2004-07-11 | Start collecting the remote server state along with the calculated | Alexander Guy | |
offsets, in preparation for having correct server statistics in responses to client queries. ok henning@ | |||
2004-07-10 | KNF; ok henning@ | Alexander Guy | |
2004-07-10 | short fixed point <-> double conversion routines; ok henning@ | Alexander Guy | |
2004-07-10 | correct leap indicator mask; ok henning@ | Alexander Guy | |
2004-07-10 | missing {} | Henning Brauer | |
2004-07-10 | check wether we have enough data to form a peer update on receiption | Henning Brauer | |
of each packet, not only after each 8th (where we have enough for sure) | |||
2004-07-10 | oups | Henning Brauer | |
2004-07-10 | scale query interval based on local clock offset. tested by many | Henning Brauer | |
not as efficient as I want it to be yet, but more is coming | |||
2004-07-09 | make lint a wee bit happier | Theo de Raadt | |
2004-07-09 | make date(1), rdate(8), ntpd(8), and timed(8) .Xr themselves; | Jason McIntyre | |
mostly from Andreas Kahari (PR #3846); | |||
2004-07-09 | Do not forget to initialize head. ok henning@ | Otto Moerbeek | |
2004-07-09 | too chatty; ok henning | Theo de Raadt | |
2004-07-09 | don't panic when sendto() fails; for the client part just re-schedule | Henning Brauer | |
noticed & fix tested by fries@ | |||
2004-07-09 | don't try to update the clock when we have no data | Henning Brauer | |
2004-07-09 | various cleanup: | Jared Yanovich | |
- mention '#' comments - fix macros for directives - typos - change list display - ntp -> NTP - slight rewording help and ok jmc ok henning otto | |||
2004-07-09 | the child process needs to ignore SIGHUP for now, otto | Henning Brauer | |
2004-07-09 | remove leftover pieces of on-the-fly reconfig shitz that made ntpd exit on | Henning Brauer | |
SIGHUP, noticed by otto | |||
2004-07-09 | soem tweaks from the Frankfurt->Hamburg flight | Henning Brauer | |
2004-07-09 | document the "servers" keyword | Henning Brauer | |
2004-07-09 | rework dns handling with all its cosequences... | Henning Brauer | |
we know have both a "server" and "servers" keyword. they differ when the hostname resolves to more than one IP, server picks one and servers expands to all. that means no longer stuffing a sockaddr_storage into ntp_peer but a pointer to a linked list of ntp_addr structs. in the "servers" case the list of n addresses returned by host() is expanded into n ntp_peer structs and thus n individual peers. in the "server" case the whole list is attached to ntp_peer, and whenever we do not receive a reply in time we traverse the list one further, so that hosts with both AAAA and A records are first tried with the AAAA one but we gracefully fall back to the A one. semantics with theo; hacked up on the Montreal->Frankfurt flight. again Air Canada surprised me, that older 767 hat pretty decent seats. | |||
2004-07-09 | when calculating the timeout for poll() we need to take the deadlines for | Henning Brauer | |
the outstanding queries into account just-before-meal from the Montreal->Frankfurt flight | |||
2004-07-08 | kill traces of on-the-fly reconfigure (from bgpd), not needed in ntpd | Henning Brauer | |
2004-07-08 | remove a bogus always-true test before adjtime() | Henning Brauer | |
2004-07-08 | remove all handling of netmasks/prefix lengths - we don't need that in ntpd. | Henning Brauer | |
fixes the dns resolves to v4 and v6 addresses bug found by phessler hacked on the Calgary->Montreal flight that proved that Air Canada _does_ have some modern aircrafts with good seats | |||
2004-07-08 | log_debug() when a peer doesn't answer in time | Henning Brauer | |
2004-07-08 | lof replies with log_debug so one gets increased verbosity when in | Henning Brauer | |
foreground/debug mode | |||
2004-07-08 | make log_debug() only log anything at all when we are in debug mode | Henning Brauer | |
before, it would log with LOG_DEBUG to syslog when !debug | |||
2004-07-07 | tweaks; ok henning@ | Jason McIntyre | |
2004-07-07 | add rdate(8) to SEE ALSO; | Jason McIntyre | |
2004-07-07 | RFC 2030 is incorrect with regards to the computation of the delay value | Alexander Guy | |
for NTP queries/replies. RFC 1305 and some of Mills' other papers have the correct formula. ok henning@ |