1
0
mirror of https://github.com/rkd77/elinks.git synced 2024-11-04 08:17:17 -05:00
elinks/src/protocol
Witold Filipczyk 213b1933b3 fsp: Drop the protocol.fsp.sort, always sort entries.
The fsp_opendir always read the whole directory.
Sorting entries do not slow down noticeably.
2008-01-19 17:09:09 +02:00
..
auth Declare element types of lists. 2007-07-26 22:47:23 +03:00
bittorrent Define BITTORRENT_NULL_ID in common.c; declare extern in common.h. 2007-09-14 16:58:16 +02:00
file get_opt_*: Add ses parameter 2007-08-28 17:24:59 +00:00
finger NET: Move cache entry normalization to abort_connection 2006-02-08 21:40:08 +01:00
fsp fsp: Drop the protocol.fsp.sort, always sort entries. 2008-01-19 17:09:09 +02:00
ftp Trim trailing whitespaces. 2007-09-14 15:12:32 +02:00
gopher Trim trailing whitespaces. 2006-07-27 09:51:10 +02:00
http Disable protocol.http.compression by default 2007-11-01 02:28:00 +01:00
nntp NNTP: Improve listing of articles for groups 2007-09-11 17:01:06 +02:00
rewrite Merge commit 'origin/elinks-0.12' 2007-10-09 14:05:03 +00:00
smb get_opt_*: Add ses parameter 2007-08-28 17:24:59 +00:00
test Add tests for cwd-relative file URIs. 2007-09-09 20:06:25 +03:00
about.c about_protocol_handler: Don't define len if CONFIG_SMALL. 2006-12-10 17:16:38 +02:00
about.h Remove empty lines in start of header files 2005-11-15 11:33:27 +01:00
common.c Use add_string_to_string where applicable. 2007-03-18 20:29:08 +02:00
common.h DIRLIST: Add helper to at start of (HTML) directory listing 2006-01-30 01:22:31 +01:00
data.c Cast the NULL argument of straconcat to unsigned char *. 2007-03-11 12:59:11 +02:00
data.h Remove empty lines in start of header files 2005-11-15 11:33:27 +01:00
date.c Bug 924, my_timegm: Added a comment about 2100 not being a leap year. 2007-01-13 15:38:02 +02:00
date.h Remove empty lines in start of header files 2005-11-15 11:33:27 +01:00
header.c parse_header_param: better describe behaviour when @ret is NULL 2006-06-23 06:07:22 +00:00
header.h parse_header_param stores the string via a pointer parameter. 2006-06-05 20:22:53 +00:00
Makefile Bug 744: Add tests. There are four failures. 2007-07-19 13:46:47 +03:00
protocol.c Bug 744: Make removal of double slashes more protocol specific 2007-09-11 14:14:17 +02:00
protocol.h Bug 744: Make removal of double slashes more protocol specific 2007-09-11 14:14:17 +02:00
proxy.c get_opt_*: Add ses parameter 2007-08-28 17:24:59 +00:00
proxy.h enum connection_state instead of int to satisfy tcc 2006-04-05 16:27:16 +02:00
README.timegm Move README.timegm to the same directory as date.c. 2007-01-13 10:01:51 +02:00
uri.c Move is_in_domain from cookies/cookies.c to protocol/uri.c and export 2007-09-14 16:51:04 +02:00
uri.h Move is_in_domain from cookies/cookies.c to protocol/uri.c and export 2007-09-14 16:51:04 +02:00
user.c Trim trailing whitespaces. 2007-09-14 15:12:32 +02:00
user.h Remove empty lines in start of header files 2005-11-15 11:33:27 +01:00

This file contains description of our my_timegm() function in date.c. It was
posted as a mail to links-list by Stephane Chazelas, and I thought it may be
interesting for someone, so I decided to include it in the ELinks distribution.




Un explanation for it as one (me to start with) may wonder why
this works.

We first change of calendar. To make things easy, let's say
that 0/0/0 0:0:0 in our new calendar is the Marsh 1st 1968, so
just after a february 29th as 1968 was a leap year.

if y/m/d h:min:s is time in our calendar
and
   Y/M/D h:min:s in the new calendar

M = m - 1 - 2 (+ 12 if m < 3)
Y = y - 68 (-1 if m < 3)
D = d - 1

at Y/0/0 0:0:0, there has been Y / 4 leap years in the past, so
(int) 365 * Y + Y / 4 days have past.

at Y/M/0 0:0:0, lets find how many days have past since Y/0/0:

                   |Mar                                        Feb
                  M| 0   1   2   3   4   5   6   7   8   9  10  11
-------------------+-----------------------------------------------
 days in that month|31  30  31  30  31  31  30  31  30  31  31  28 or 29
-------------------+-----------------------------------------------
  x = days at Y/M/0| 0  31  61  92 122 153 184 214 245 275 306 337
-------------------+-----------------------------------------------
first approximation|
         y = 30 * M| 0  30  60  90 120 150 180 210 240 270 300 330
-------------------+-----------------------------------------------
              x - y| 0   1   1   2   2   3   4   4   5   5   6   7
-------------------+-----------------------------------------------
(M + 4) * 3 / 5 - 2| 0   1   1   2   2   3   4   4   5   5   6   7
-------------------+-----------------------------------------------

x - y = (M + 4) * 3 / 5 - 2

x = 30 * M + (M + 4) * 3 / 5 - 2

x = (153 * M + 2) / 5

So at Y/M/D 0:0:0,

Y * 1461 / 4 + (153 * M + 2) / 5 + D days have past since
the 1st of March of 1968

1st of March of 1968 was 671 days before 1970 Jan 1st (year 0
for unix time())

So
t = s + 60 * (min + 60 * (h + 24 * (Y * 1461 / 4 + (153 * M + 2) / 5 + D - 671)))
t = s + 60 * (min + 60 * (h + 24 * (Y * 1461 / 4 + (153 * M + 2) / 5 + d - 672)))

This shouldn't work past 2100/02/28 23:59:59 as 2100 is not a leap year.

--
St<53>phane