arrfab / rpms / httpd

Forked from rpms/httpd 5 years ago
Clone

Blame SOURCES/httpd-2.4.4-mod_unique_id.patch

28b219
--- trunk/modules/metadata/mod_unique_id.c	2011/12/02 23:02:04	1209766
28b219
+++ trunk/modules/metadata/mod_unique_id.c	2013/07/10 16:20:31	1501827
28b219
@@ -31,14 +31,11 @@
28b219
 #include "http_log.h"
28b219
 #include "http_protocol.h"  /* for ap_hook_post_read_request */
28b219
 
28b219
-#if APR_HAVE_UNISTD_H
28b219
-#include <unistd.h>         /* for getpid() */
28b219
-#endif
28b219
+#define ROOT_SIZE 10
28b219
 
28b219
 typedef struct {
28b219
     unsigned int stamp;
28b219
-    unsigned int in_addr;
28b219
-    unsigned int pid;
28b219
+    char root[ROOT_SIZE];
28b219
     unsigned short counter;
28b219
     unsigned int thread_index;
28b219
 } unique_id_rec;
28b219
@@ -64,20 +61,15 @@
28b219
  * gethostbyname (gethostname()) is unique across all the machines at the
28b219
  * "site".
28b219
  *
28b219
- * We also further assume that pids fit in 32-bits.  If something uses more
28b219
- * than 32-bits, the fix is trivial, but it requires the unrolled uuencoding
28b219
- * loop to be extended.  * A similar fix is needed to support multithreaded
28b219
- * servers, using a pid/tid combo.
28b219
- *
28b219
- * Together, the in_addr and pid are assumed to absolutely uniquely identify
28b219
- * this one child from all other currently running children on all servers
28b219
- * (including this physical server if it is running multiple httpds) from each
28b219
+ * The root is assumed to absolutely uniquely identify this one child
28b219
+ * from all other currently running children on all servers (including
28b219
+ * this physical server if it is running multiple httpds) from each
28b219
  * other.
28b219
  *
28b219
- * The stamp and counter are used to distinguish all hits for a particular
28b219
- * (in_addr,pid) pair.  The stamp is updated using r->request_time,
28b219
- * saving cpu cycles.  The counter is never reset, and is used to permit up to
28b219
- * 64k requests in a single second by a single child.
28b219
+ * The stamp and counter are used to distinguish all hits for a
28b219
+ * particular root.  The stamp is updated using r->request_time,
28b219
+ * saving cpu cycles.  The counter is never reset, and is used to
28b219
+ * permit up to 64k requests in a single second by a single child.
28b219
  *
28b219
  * The 144-bits of unique_id_rec are encoded using the alphabet
28b219
  * [A-Za-z0-9@-], resulting in 24 bytes of printable characters.  That is then
28b219
@@ -92,7 +84,7 @@
28b219
  * module change.
28b219
  *
28b219
  * It is highly desirable that identifiers exist for "eternity".  But future
28b219
- * needs (such as much faster webservers, moving to 64-bit pids, or moving to a
28b219
+ * needs (such as much faster webservers, or moving to a
28b219
  * multithreaded server) may dictate a need to change the contents of
28b219
  * unique_id_rec.  Such a future implementation should ensure that the first
28b219
  * field is still a time_t stamp.  By doing that, it is possible for a site to
28b219
@@ -100,7 +92,15 @@
28b219
  * wait one entire second, and then start all of their new-servers.  This
28b219
  * procedure will ensure that the new space of identifiers is completely unique
28b219
  * from the old space.  (Since the first four unencoded bytes always differ.)
28b219
+ *
28b219
+ * Note: previous implementations used 32-bits of IP address plus pid
28b219
+ * in place of the PRNG output in the "root" field.  This was
28b219
+ * insufficient for IPv6-only hosts, required working DNS to determine
28b219
+ * a unique IP address (fragile), and needed a [0, 1) second sleep
28b219
+ * call at startup to avoid pid reuse.  Use of the PRNG avoids all
28b219
+ * these issues.
28b219
  */
28b219
+
28b219
 /*
28b219
  * Sun Jun  7 05:43:49 CEST 1998 -- Alvaro
28b219
  * More comments:
28b219
@@ -116,8 +116,6 @@
28b219
  * htonl/ntohl. Well, this shouldn't be a problem till year 2106.
28b219
  */
28b219
 
28b219
-static unsigned global_in_addr;
28b219
-
28b219
 /*
28b219
  * XXX: We should have a per-thread counter and not use cur_unique_id.counter
28b219
  * XXX: in all threads, because this is bad for performance on multi-processor
28b219
@@ -129,7 +127,7 @@
28b219
 /*
28b219
  * Number of elements in the structure unique_id_rec.
28b219
  */
28b219
-#define UNIQUE_ID_REC_MAX 5
28b219
+#define UNIQUE_ID_REC_MAX 4
28b219
 
28b219
 static unsigned short unique_id_rec_offset[UNIQUE_ID_REC_MAX],
28b219
                       unique_id_rec_size[UNIQUE_ID_REC_MAX],
28b219
@@ -138,113 +136,32 @@
28b219
 
28b219
 static int unique_id_global_init(apr_pool_t *p, apr_pool_t *plog, apr_pool_t *ptemp, server_rec *main_server)
28b219
 {
28b219
-    char str[APRMAXHOSTLEN + 1];
28b219
-    apr_status_t rv;
28b219
-    char *ipaddrstr;
28b219
-    apr_sockaddr_t *sockaddr;
28b219
-
28b219
     /*
28b219
      * Calculate the sizes and offsets in cur_unique_id.
28b219
      */
28b219
     unique_id_rec_offset[0] = APR_OFFSETOF(unique_id_rec, stamp);
28b219
     unique_id_rec_size[0] = sizeof(cur_unique_id.stamp);
28b219
-    unique_id_rec_offset[1] = APR_OFFSETOF(unique_id_rec, in_addr);
28b219
-    unique_id_rec_size[1] = sizeof(cur_unique_id.in_addr);
28b219
-    unique_id_rec_offset[2] = APR_OFFSETOF(unique_id_rec, pid);
28b219
-    unique_id_rec_size[2] = sizeof(cur_unique_id.pid);
28b219
-    unique_id_rec_offset[3] = APR_OFFSETOF(unique_id_rec, counter);
28b219
-    unique_id_rec_size[3] = sizeof(cur_unique_id.counter);
28b219
-    unique_id_rec_offset[4] = APR_OFFSETOF(unique_id_rec, thread_index);
28b219
-    unique_id_rec_size[4] = sizeof(cur_unique_id.thread_index);
28b219
+    unique_id_rec_offset[1] = APR_OFFSETOF(unique_id_rec, root);
28b219
+    unique_id_rec_size[1] = sizeof(cur_unique_id.root);
28b219
+    unique_id_rec_offset[2] = APR_OFFSETOF(unique_id_rec, counter);
28b219
+    unique_id_rec_size[2] = sizeof(cur_unique_id.counter);
28b219
+    unique_id_rec_offset[3] = APR_OFFSETOF(unique_id_rec, thread_index);
28b219
+    unique_id_rec_size[3] = sizeof(cur_unique_id.thread_index);
28b219
     unique_id_rec_total_size = unique_id_rec_size[0] + unique_id_rec_size[1] +
28b219
-                               unique_id_rec_size[2] + unique_id_rec_size[3] +
28b219
-                               unique_id_rec_size[4];
28b219
+                               unique_id_rec_size[2] + unique_id_rec_size[3];
28b219
 
28b219
     /*
28b219
      * Calculate the size of the structure when encoded.
28b219
      */
28b219
     unique_id_rec_size_uu = (unique_id_rec_total_size*8+5)/6;
28b219
 
28b219
-    /*
28b219
-     * Now get the global in_addr.  Note that it is not sufficient to use one
28b219
-     * of the addresses from the main_server, since those aren't as likely to
28b219
-     * be unique as the physical address of the machine
28b219
-     */
28b219
-    if ((rv = apr_gethostname(str, sizeof(str) - 1, p)) != APR_SUCCESS) {
28b219
-        ap_log_error(APLOG_MARK, APLOG_ALERT, rv, main_server, APLOGNO(01563)
28b219
-          "unable to find hostname of the server");
28b219
-        return HTTP_INTERNAL_SERVER_ERROR;
28b219
-    }
28b219
-
28b219
-    if ((rv = apr_sockaddr_info_get(&sockaddr, str, AF_INET, 0, 0, p)) == APR_SUCCESS) {
28b219
-        global_in_addr = sockaddr->sa.sin.sin_addr.s_addr;
28b219
-    }
28b219
-    else {
28b219
-        ap_log_error(APLOG_MARK, APLOG_ALERT, rv, main_server, APLOGNO(01564)
28b219
-                    "unable to find IPv4 address of \"%s\"", str);
28b219
-#if APR_HAVE_IPV6
28b219
-        if ((rv = apr_sockaddr_info_get(&sockaddr, str, AF_INET6, 0, 0, p)) == APR_SUCCESS) {
28b219
-            memcpy(&global_in_addr,
28b219
-                   (char *)sockaddr->ipaddr_ptr + sockaddr->ipaddr_len - sizeof(global_in_addr),
28b219
-                   sizeof(global_in_addr));
28b219
-            ap_log_error(APLOG_MARK, APLOG_ALERT, rv, main_server, APLOGNO(01565)
28b219
-                         "using low-order bits of IPv6 address "
28b219
-                         "as if they were unique");
28b219
-        }
28b219
-        else
28b219
-#endif
28b219
-        return HTTP_INTERNAL_SERVER_ERROR;
28b219
-    }
28b219
-
28b219
-    apr_sockaddr_ip_get(&ipaddrstr, sockaddr);
28b219
-    ap_log_error(APLOG_MARK, APLOG_INFO, 0, main_server, APLOGNO(01566) "using ip addr %s",
28b219
-                 ipaddrstr);
28b219
-
28b219
-    /*
28b219
-     * If the server is pummelled with restart requests we could possibly end
28b219
-     * up in a situation where we're starting again during the same second
28b219
-     * that has been used in previous identifiers.  Avoid that situation.
28b219
-     *
28b219
-     * In truth, for this to actually happen not only would it have to restart
28b219
-     * in the same second, but it would have to somehow get the same pids as
28b219
-     * one of the other servers that was running in that second. Which would
28b219
-     * mean a 64k wraparound on pids ... not very likely at all.
28b219
-     *
28b219
-     * But protecting against it is relatively cheap.  We just sleep into the
28b219
-     * next second.
28b219
-     */
28b219
-    apr_sleep(apr_time_from_sec(1) - apr_time_usec(apr_time_now()));
28b219
     return OK;
28b219
 }
28b219
 
28b219
 static void unique_id_child_init(apr_pool_t *p, server_rec *s)
28b219
 {
28b219
-    pid_t pid;
28b219
-
28b219
-    /*
28b219
-     * Note that we use the pid because it's possible that on the same
28b219
-     * physical machine there are multiple servers (i.e. using Listen). But
28b219
-     * it's guaranteed that none of them will share the same pids between
28b219
-     * children.
28b219
-     *
28b219
-     * XXX: for multithread this needs to use a pid/tid combo and probably
28b219
-     * needs to be expanded to 32 bits
28b219
-     */
28b219
-    pid = getpid();
28b219
-    cur_unique_id.pid = pid;
28b219
-
28b219
-    /*
28b219
-     * Test our assumption that the pid is 32-bits.  It's possible that
28b219
-     * 64-bit machines will declare pid_t to be 64 bits but only use 32
28b219
-     * of them.  It would have been really nice to test this during
28b219
-     * global_init ... but oh well.
28b219
-     */
28b219
-    if ((pid_t)cur_unique_id.pid != pid) {
28b219
-        ap_log_error(APLOG_MARK, APLOG_CRIT, 0, s, APLOGNO(01567)
28b219
-                    "oh no! pids are greater than 32-bits!  I'm broken!");
28b219
-    }
28b219
-
28b219
-    cur_unique_id.in_addr = global_in_addr;
28b219
+    ap_random_insecure_bytes(&cur_unique_id.root,
28b219
+                             sizeof(cur_unique_id.root));
28b219
 
28b219
     /*
28b219
      * If we use 0 as the initial counter we have a little less protection
28b219
@@ -253,13 +170,6 @@
28b219
      */
28b219
     ap_random_insecure_bytes(&cur_unique_id.counter,
28b219
                              sizeof(cur_unique_id.counter));
28b219
-
28b219
-    /*
28b219
-     * We must always use network ordering for these bytes, so that
28b219
-     * identifiers are comparable between machines of different byte
28b219
-     * orderings.  Note in_addr is already in network order.
28b219
-     */
28b219
-    cur_unique_id.pid = htonl(cur_unique_id.pid);
28b219
 }
28b219
 
28b219
 /* NOTE: This is *NOT* the same encoding used by base64encode ... the last two
28b219
@@ -291,10 +201,8 @@
28b219
     unsigned short counter;
28b219
     int i,j,k;
28b219
 
28b219
-    new_unique_id.in_addr = cur_unique_id.in_addr;
28b219
-    new_unique_id.pid = cur_unique_id.pid;
28b219
+    memcpy(&new_unique_id.root, &cur_unique_id.root, ROOT_SIZE);
28b219
     new_unique_id.counter = cur_unique_id.counter;
28b219
-
28b219
     new_unique_id.stamp = htonl((unsigned int)apr_time_sec(r->request_time));
28b219
     new_unique_id.thread_index = htonl((unsigned int)r->connection->id);
28b219