|
| 1 | +/* |
| 2 | + * PostgreSQL type definitions for IP addresses. |
| 3 | + */ |
| 4 | + |
| 5 | +#include <stdio.h> |
| 6 | + |
| 7 | +#include <postgres.h> |
| 8 | +#include <utils/palloc.h> |
| 9 | + |
| 10 | +/* |
| 11 | + * This is the internal storage format for IP addresses: |
| 12 | + */ |
| 13 | + |
| 14 | +typedef struct ipaddr { |
| 15 | + unsigned char a; |
| 16 | + unsigned char b; |
| 17 | + unsigned char c; |
| 18 | + unsigned char d; |
| 19 | + unsigned char w; |
| 20 | + unsigned char pad1; |
| 21 | + short pad2; |
| 22 | +} ipaddr; |
| 23 | + |
| 24 | +/* |
| 25 | + * Various forward declarations: |
| 26 | + */ |
| 27 | + |
| 28 | +ipaddr *ipaddr_in(char *str); |
| 29 | +char *ipaddr_out(ipaddr *addr); |
| 30 | + |
| 31 | +bool ipaddr_lt(ipaddr *a1, ipaddr *a2); |
| 32 | +bool ipaddr_le(ipaddr *a1, ipaddr *a2); |
| 33 | +bool ipaddr_eq(ipaddr *a1, ipaddr *a2); |
| 34 | +bool ipaddr_ge(ipaddr *a1, ipaddr *a2); |
| 35 | +bool ipaddr_gt(ipaddr *a1, ipaddr *a2); |
| 36 | + |
| 37 | +bool ipaddr_ne(ipaddr *a1, ipaddr *a2); |
| 38 | +int4 ipaddr_cmp(ipaddr *a1, ipaddr *a2); |
| 39 | +bool ipaddr_like(ipaddr *a1, ipaddr *a2); |
| 40 | + |
| 41 | +/* |
| 42 | + * A utility macro used for sorting addresses numerically: |
| 43 | + */ |
| 44 | + |
| 45 | +#define Mag(addr) \ |
| 46 | + ((unsigned long)((addr->a<<24)|(addr->b<<16)|(addr->c<<8)|(addr->d))) |
| 47 | + |
| 48 | +/* |
| 49 | + * IP address reader. Note how the count returned by sscanf() |
| 50 | + * is used to determine whether the mask size was specified. |
| 51 | + */ |
| 52 | + |
| 53 | +ipaddr *ipaddr_in(char *str) { |
| 54 | + int a, b, c, d, w; |
| 55 | + ipaddr *result; |
| 56 | + int count; |
| 57 | + |
| 58 | + if (strlen(str) > 0) { |
| 59 | + |
| 60 | + count = sscanf(str, "%d.%d.%d.%d/%d", &a, &b, &c, &d, &w); |
| 61 | + |
| 62 | + if (count < 4) { |
| 63 | + elog(ERROR, "ipaddr_in: error in parsing \"%s\"", str); |
| 64 | + return(NULL); |
| 65 | + } |
| 66 | + |
| 67 | + if (count == 4) |
| 68 | + w = 32; |
| 69 | + |
| 70 | + if ((a < 0) || (a > 255) || (b < 0) || (b > 255) || |
| 71 | + (c < 0) || (c > 255) || (d < 0) || (d > 255) || |
| 72 | + (w < 0) || (w > 32)) { |
| 73 | + elog(ERROR, "ipaddr_in: illegal address \"%s\"", str); |
| 74 | + return(NULL); |
| 75 | + } |
| 76 | + } else { |
| 77 | + a = b = c = d = w = 0; /* special case for missing address */ |
| 78 | + } |
| 79 | + |
| 80 | + result = (ipaddr *)palloc(sizeof(ipaddr)); |
| 81 | + |
| 82 | + result->a = a; |
| 83 | + result->b = b; |
| 84 | + result->c = c; |
| 85 | + result->d = d; |
| 86 | + result->w = w; |
| 87 | + |
| 88 | + return(result); |
| 89 | +} |
| 90 | + |
| 91 | +/* |
| 92 | + * IP address output function. Note mask size specification |
| 93 | + * generated only for subnets, not for plain host addresses. |
| 94 | + */ |
| 95 | + |
| 96 | +char *ipaddr_out(ipaddr *addr) { |
| 97 | + char *result; |
| 98 | + |
| 99 | + if (addr == NULL) |
| 100 | + return(NULL); |
| 101 | + |
| 102 | + result = (char *)palloc(32); |
| 103 | + |
| 104 | + if (Mag(addr) > 0) { |
| 105 | + if (addr->w == 32) |
| 106 | + sprintf(result, "%d.%d.%d.%d", |
| 107 | + addr->a, addr->b, addr->c, addr->d); |
| 108 | + else |
| 109 | + sprintf(result, "%d.%d.%d.%d/%d", |
| 110 | + addr->a, addr->b, addr->c, addr->d, addr->w); |
| 111 | + } else { |
| 112 | + result[0] = 0; /* special case for missing address */ |
| 113 | + } |
| 114 | + return(result); |
| 115 | +} |
| 116 | + |
| 117 | +/* |
| 118 | + * Boolean tests. The Mag() macro was defined above. |
| 119 | + */ |
| 120 | + |
| 121 | +bool ipaddr_lt(ipaddr *a1, ipaddr *a2) { |
| 122 | + unsigned long a1mag, a2mag; |
| 123 | + a1mag = Mag(a1); |
| 124 | + a2mag = Mag(a2); |
| 125 | + return (a1mag < a2mag); |
| 126 | +}; |
| 127 | + |
| 128 | +bool ipaddr_le(ipaddr *a1, ipaddr *a2) { |
| 129 | + unsigned long a1mag, a2mag; |
| 130 | + a1mag = Mag(a1); |
| 131 | + a2mag = Mag(a2); |
| 132 | + return (a1mag <= a2mag); |
| 133 | +}; |
| 134 | + |
| 135 | +bool ipaddr_eq(ipaddr *a1, ipaddr *a2) { |
| 136 | + unsigned long a1mag, a2mag; |
| 137 | + a1mag = Mag(a1); |
| 138 | + a2mag = Mag(a2); |
| 139 | + return ((a1mag == a2mag) && (a1->w == a2->w)); |
| 140 | +}; |
| 141 | + |
| 142 | +bool ipaddr_ge(ipaddr *a1, ipaddr *a2) { |
| 143 | + unsigned long a1mag, a2mag; |
| 144 | + a1mag = Mag(a1); |
| 145 | + a2mag = Mag(a2); |
| 146 | + return (a1mag >= a2mag); |
| 147 | +}; |
| 148 | + |
| 149 | +bool ipaddr_gt(ipaddr *a1, ipaddr *a2) { |
| 150 | + unsigned long a1mag, a2mag; |
| 151 | + a1mag = Mag(a1); |
| 152 | + a2mag = Mag(a2); |
| 153 | + return (a1mag > a2mag); |
| 154 | +}; |
| 155 | + |
| 156 | +bool ipaddr_ne(ipaddr *a1, ipaddr *a2) { |
| 157 | + unsigned long a1mag, a2mag; |
| 158 | + a1mag = Mag(a1); |
| 159 | + a2mag = Mag(a2); |
| 160 | + return ((a1mag != a2mag) || (a1->w != a2->w)); |
| 161 | +}; |
| 162 | + |
| 163 | +/* |
| 164 | + * Comparison function for sorting: |
| 165 | + */ |
| 166 | + |
| 167 | +int4 ipaddr_cmp(ipaddr *a1, ipaddr *a2) { |
| 168 | + unsigned long a1mag = Mag(a1), a2mag = Mag(a2); |
| 169 | + if (a1mag < a2mag) |
| 170 | + return -1; |
| 171 | + else if (a1mag > a2mag) |
| 172 | + return 1; |
| 173 | + else |
| 174 | + return 0; |
| 175 | +} |
| 176 | + |
| 177 | +/* |
| 178 | + * Our "similarity" operator checks whether two addresses are |
| 179 | + * either the same node address, or, failing that, whether one |
| 180 | + * of them contains the other. This will be true if they have |
| 181 | + * the same high bits down as far as the shortest mask reaches. |
| 182 | + */ |
| 183 | + |
| 184 | +unsigned long build_mask(unsigned char bits) { |
| 185 | + unsigned long mask = 0; |
| 186 | + int i; |
| 187 | + for (i = 0; i < bits; i++) |
| 188 | + mask = (mask >> 1) | 0x80000000; |
| 189 | + return mask; |
| 190 | +} |
| 191 | + |
| 192 | +bool ipaddr_like(ipaddr *a1, ipaddr *a2) { |
| 193 | + unsigned long a1bits, a2bits, maskbits; |
| 194 | + if ((a1->w == 0) || (a2->w == 0)) |
| 195 | + return FALSE; |
| 196 | + if ((a1->w == 32) && (a2->w == 32)) |
| 197 | + return ipaddr_eq(a1, a2); |
| 198 | + a1bits = Mag(a1); |
| 199 | + a2bits = Mag(a2); |
| 200 | + if (a1->w > a2->w) { |
| 201 | + maskbits = build_mask(a2->w); |
| 202 | + return ((a1bits & maskbits) == (a2bits & maskbits)); |
| 203 | + } else { |
| 204 | + maskbits = build_mask(a1->w); |
| 205 | + return ((a2bits & maskbits) == (a1bits & maskbits)); |
| 206 | + } |
| 207 | + return FALSE; |
| 208 | +} |
| 209 | + |
| 210 | +/* |
| 211 | + * eof |
| 212 | + */ |
0 commit comments