3 * DEBUG: section 53 AS Number handling
4 * AUTHOR: Duane Wessels, Kostas Anagnostakis
6 * SQUID Web Proxy Cache http://www.squid-cache.org/
7 * ----------------------------------------------------------
9 * Squid is the result of efforts by numerous individuals from
10 * the Internet community; see the CONTRIBUTORS file for full
11 * details. Many organizations have provided support for Squid's
12 * development; see the SPONSORS file for full details. Squid is
13 * Copyrighted (C) 2001 by the Regents of the University of
14 * California; see the COPYRIGHT file for full details. Squid
15 * incorporates software developed and/or copyrighted by other
16 * sources; see the CREDITS file for full details.
18 * This program is free software; you can redistribute it and/or modify
19 * it under the terms of the GNU General Public License as published by
20 * the Free Software Foundation; either version 2 of the License, or
21 * (at your option) any later version.
23 * This program is distributed in the hope that it will be useful,
24 * but WITHOUT ANY WARRANTY; without even the implied warranty of
25 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
26 * GNU General Public License for more details.
28 * You should have received a copy of the GNU General Public License
29 * along with this program; if not, write to the Free Software
30 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
37 #include "acl/Checklist.h"
38 #include "acl/DestinationAsn.h"
39 #include "acl/DestinationIp.h"
40 #include "acl/SourceAsn.h"
43 #include "HttpReply.h"
44 #include "HttpRequest.h"
46 #include "mgr/Registration.h"
48 #include "RequestFlags.h"
49 #include "SquidConfig.h"
51 #include "StoreClient.h"
52 #include "StoreClient.h"
56 #define AS_REQBUF_SZ 4096
58 /* BEGIN of definitions for radix tree entries */
60 /* 32/128 bits address in memory with length */
67 m_ADDR() : len(sizeof(Ip::Address
)) {};
70 /* END of definitions for radix tree entries */
72 /* Head for ip to asn radix tree */
74 struct squid_radix_node_head
*AS_tree_head
;
76 /* explicit instantiation required for some systems */
78 /// \cond AUTODOCS_IGNORE
79 template cbdata_type CbDataList
<int>::CBDATA_CbDataList
;
83 * Structure for as number information. it could be simply
84 * a list but it's coded as a structure for future
85 * enhancements (e.g. expires)
88 CbDataList
<int> *as_number
;
89 time_t expires
; /* NOTUSED */
100 HttpRequest::Pointer request
;
104 char reqbuf
[AS_REQBUF_SZ
];
107 CBDATA_CLASS2(ASState
);
110 CBDATA_CLASS_INIT(ASState
);
121 memset(reqbuf
, 0, AS_REQBUF_SZ
);
126 debugs(53, 3, entry
->url());
127 storeUnregister(sc
, entry
, this);
128 entry
->unlock("~ASState");
131 /** entry into the radix tree */
133 struct squid_radix_node e_nodes
[2];
139 static int asnAddNet(char *, int);
141 static void asnCacheStart(int as
);
143 static STCB asHandleReply
;
145 #if defined(__cplusplus)
149 static int destroyRadixNode(struct squid_radix_node
*rn
, void *w
);
150 static int printRadixNode(struct squid_radix_node
*rn
, void *sentry
);
152 #if defined(__cplusplus)
156 void asnAclInitialize(ACL
* acls
);
158 static void destroyRadixNodeInfo(as_info
*);
160 static OBJH asnStats
;
165 asnMatchIp(CbDataList
<int> *data
, Ip::Address
&addr
)
167 struct squid_radix_node
*rn
;
170 CbDataList
<int> *a
= NULL
;
171 CbDataList
<int> *b
= NULL
;
173 debugs(53, 3, "asnMatchIp: Called for " << addr
);
175 if (AS_tree_head
== NULL
)
181 if (addr
.isAnyAddr())
186 rn
= squid_rn_match(&m_addr
, AS_tree_head
);
189 debugs(53, 3, "asnMatchIp: Address not in as db.");
193 debugs(53, 3, "asnMatchIp: Found in db!");
194 e
= ((rtentry_t
*) rn
)->e_info
;
197 for (a
= data
; a
; a
= a
->next
)
198 for (b
= e
->as_number
; b
; b
= b
->next
)
199 if (a
->element
== b
->element
) {
200 debugs(53, 5, "asnMatchIp: Found a match!");
204 debugs(53, 5, "asnMatchIp: AS not in as db.");
209 ACLASN::prepareForUse()
211 for (CbDataList
<int> *i
= data
; i
; i
= i
->
213 asnCacheStart(i
->element
);
217 asnRegisterWithCacheManager(void)
219 Mgr::RegisterAction("asndb", "AS Number Database", asnStats
, 0, 1);
222 /* initialize the radix tree structure */
224 SQUIDCEXTERN
int squid_max_keylen
; /* yuck.. this is in lib/radix.c */
229 static bool inited
= false;
230 squid_max_keylen
= 40;
237 squid_rn_inithead(&AS_tree_head
, 8);
239 asnRegisterWithCacheManager();
245 squid_rn_walktree(AS_tree_head
, destroyRadixNode
, AS_tree_head
);
247 destroyRadixNode((struct squid_radix_node
*) 0, (void *) AS_tree_head
);
251 asnStats(StoreEntry
* sentry
)
253 storeAppendPrintf(sentry
, "Address \tAS Numbers\n");
254 squid_rn_walktree(AS_tree_head
, printRadixNode
, sentry
);
260 asnCacheStart(int as
)
262 LOCAL_ARRAY(char, asres
, 4096);
264 ASState
*asState
= new ASState
;
265 debugs(53, 3, "AS " << as
);
266 snprintf(asres
, 4096, "whois://%s/!gAS%d", Config
.as_whois_server
, as
);
267 asState
->as_number
= as
;
268 asState
->request
= HttpRequest::CreateFromUrl(asres
);
269 assert(asState
->request
!= NULL
);
271 if ((e
= storeGetPublic(asres
, Http::METHOD_GET
)) == NULL
) {
272 e
= storeCreateEntry(asres
, asres
, RequestFlags(), Http::METHOD_GET
);
273 asState
->sc
= storeClientListAdd(e
, asState
);
274 FwdState::fwdStart(Comm::ConnectionPointer(), e
, asState
->request
.getRaw());
277 asState
->sc
= storeClientListAdd(e
, asState
);
281 StoreIOBuffer
readBuffer (AS_REQBUF_SZ
, asState
->offset
, asState
->reqbuf
);
282 storeClientCopy(asState
->sc
, e
, readBuffer
, asHandleReply
, asState
);
286 asHandleReply(void *data
, StoreIOBuffer result
)
288 ASState
*asState
= (ASState
*)data
;
289 StoreEntry
*e
= asState
->entry
;
292 char *buf
= asState
->reqbuf
;
295 debugs(53, 3, "asHandleReply: Called with size=" << (unsigned int)result
.length
);
296 debugs(53, 3, "asHandleReply: buffer='" << buf
<< "'");
298 /* First figure out whether we should abort the request */
300 if (EBIT_TEST(e
->flags
, ENTRY_ABORTED
)) {
305 if (result
.length
== 0 && asState
->dataRead
) {
306 debugs(53, 3, "asHandleReply: Done: " << e
->url());
309 } else if (result
.flags
.error
) {
310 debugs(53, DBG_IMPORTANT
, "asHandleReply: Called with Error set and size=" << (unsigned int) result
.length
);
313 } else if (e
->getReply()->sline
.status() != Http::scOkay
) {
314 debugs(53, DBG_IMPORTANT
, "WARNING: AS " << asState
->as_number
<< " whois request failed");
320 * Next, attempt to parse our request
321 * Remembering that the actual buffer size is retsize + reqofs!
325 while ((size_t)(s
- buf
) < result
.length
+ asState
->reqofs
&& *s
!= '\0') {
326 while (*s
&& xisspace(*s
))
329 for (t
= s
; *t
; ++t
) {
335 /* oof, word should continue on next block */
340 debugs(53, 3, "asHandleReply: AS# " << s
<< " (" << asState
->as_number
<< ")");
341 asnAddNet(s
, asState
->as_number
);
343 asState
->dataRead
= true;
347 * Next, grab the end of the 'valid data' in the buffer, and figure
348 * out how much data is left in our buffer, which we need to keep
349 * around for the next request
351 leftoversz
= (asState
->reqofs
+ result
.length
) - (s
- buf
);
353 assert(leftoversz
>= 0);
356 * Next, copy the left over data, from s to s + leftoversz to the
357 * beginning of the buffer
359 memmove(buf
, s
, leftoversz
);
362 * Next, update our offset and reqofs, and kick off a copy if required
364 asState
->offset
+= result
.length
;
366 asState
->reqofs
= leftoversz
;
368 debugs(53, 3, "asState->offset = " << asState
->offset
);
370 if (e
->store_status
== STORE_PENDING
) {
371 debugs(53, 3, "asHandleReply: store_status == STORE_PENDING: " << e
->url() );
372 StoreIOBuffer
tempBuffer (AS_REQBUF_SZ
- asState
->reqofs
,
374 asState
->reqbuf
+ asState
->reqofs
);
375 storeClientCopy(asState
->sc
,
381 StoreIOBuffer tempBuffer
;
382 debugs(53, 3, "asHandleReply: store complete, but data received " << e
->url() );
383 tempBuffer
.offset
= asState
->offset
;
384 tempBuffer
.length
= AS_REQBUF_SZ
- asState
->reqofs
;
385 tempBuffer
.data
= asState
->reqbuf
+ asState
->reqofs
;
386 storeClientCopy(asState
->sc
,
395 * add a network (addr, mask) to the radix tree, with matching AS number
398 asnAddNet(char *as_string
, int as_number
)
400 struct squid_radix_node
*rn
;
401 CbDataList
<int> **Tail
= NULL
;
402 CbDataList
<int> *q
= NULL
;
403 as_info
*asinfo
= NULL
;
410 t
= strchr(as_string
, '/');
413 debugs(53, 3, "asnAddNet: failed, invalid response from whois server.");
424 // INET6 TODO : find a better way of identifying the base IPA family for mask than this.
425 t
= strchr(as_string
, '.');
427 // generate Netbits Format Mask
429 mask
.applyMask(bitl
, (t
!=NULL
?AF_INET
:AF_INET6
) );
431 debugs(53, 3, "asnAddNet: called for " << addr
<< "/" << mask
);
433 rtentry_t
*e
= (rtentry_t
*)xcalloc(1, sizeof(rtentry_t
));
435 e
->e_addr
.addr
= addr
;
437 e
->e_mask
.addr
= mask
;
439 rn
= squid_rn_lookup(&e
->e_addr
, &e
->e_mask
, AS_tree_head
);
442 asinfo
= ((rtentry_t
*) rn
)->e_info
;
444 if (asinfo
->as_number
->find(as_number
)) {
445 debugs(53, 3, "asnAddNet: Ignoring repeated network '" << addr
<< "/" << bitl
<< "' for AS " << as_number
);
447 debugs(53, 3, "asnAddNet: Warning: Found a network with multiple AS numbers!");
449 for (Tail
= &asinfo
->as_number
; *Tail
; Tail
= &(*Tail
)->next
);
450 q
= new CbDataList
<int> (as_number
);
457 q
= new CbDataList
<int> (as_number
);
458 asinfo
= (as_info
*)xmalloc(sizeof(as_info
));
459 asinfo
->as_number
= q
;
460 squid_rn_addroute(&e
->e_addr
, &e
->e_mask
, AS_tree_head
, e
->e_nodes
);
461 rn
= squid_rn_match(&e
->e_addr
, AS_tree_head
);
466 if (rn
== 0) { /* assert might expand to nothing */
470 debugs(53, 3, "asnAddNet: Could not add entry.");
479 destroyRadixNode(struct squid_radix_node
*rn
, void *w
)
482 struct squid_radix_node_head
*rnh
= (struct squid_radix_node_head
*) w
;
484 if (rn
&& !(rn
->rn_flags
& RNF_ROOT
)) {
485 rtentry_t
*e
= (rtentry_t
*) rn
;
486 rn
= squid_rn_delete(rn
->rn_key
, rn
->rn_mask
, rnh
);
489 debugs(53, 3, "destroyRadixNode: internal screwup");
491 destroyRadixNodeInfo(e
->e_info
);
500 destroyRadixNodeInfo(as_info
* e_info
)
502 CbDataList
<int> *prev
= NULL
;
503 CbDataList
<int> *data
= e_info
->as_number
;
513 printRadixNode(struct squid_radix_node
*rn
, void *_sentry
)
515 StoreEntry
*sentry
= (StoreEntry
*)_sentry
;
516 rtentry_t
*e
= (rtentry_t
*) rn
;
519 char buf
[MAX_IPSTRLEN
];
525 addr
= e
->e_addr
.addr
;
526 mask
= e
->e_mask
.addr
;
527 storeAppendPrintf(sentry
, "%s/%d\t",
528 addr
.toStr(buf
, MAX_IPSTRLEN
),
531 assert(asinfo
->as_number
);
533 for (q
= asinfo
->as_number
; q
; q
= q
->next
)
534 storeAppendPrintf(sentry
, " %d", q
->element
);
536 storeAppendPrintf(sentry
, "\n");
549 ACLASN::match(Ip::Address toMatch
)
551 return asnMatchIp(data
, toMatch
);
559 CbDataList
<int> *ldata
= data
;
561 while (ldata
!= NULL
) {
562 snprintf(buf
, sizeof(buf
), "%d", ldata
->element
);
563 wordlistAdd(&W
, buf
);
571 ACLASN::empty () const
579 CbDataList
<int> **curlist
= &data
;
580 CbDataList
<int> **Tail
;
581 CbDataList
<int> *q
= NULL
;
584 for (Tail
= curlist
; *Tail
; Tail
= &((*Tail
)->next
));
585 while ((t
= strtokFile())) {
586 q
= new CbDataList
<int> (atoi(t
));
592 ACLData
<Ip::Address
> *
593 ACLASN::clone() const
596 fatal ("cloning of ACLASN not implemented");
598 return new ACLASN(*this);
601 /* explicit template instantiation required for some systems */
603 template class ACLStrategised
<Ip::Address
>;
605 ACL::Prototype
ACLASN::SourceRegistryProtoype(&ACLASN::SourceRegistryEntry_
, "src_as");
607 ACLStrategised
<Ip::Address
> ACLASN::SourceRegistryEntry_(new ACLASN
, ACLSourceASNStrategy::Instance(), "src_as");
609 ACL::Prototype
ACLASN::DestinationRegistryProtoype(&ACLASN::DestinationRegistryEntry_
, "dst_as");
611 ACLStrategised
<Ip::Address
> ACLASN::DestinationRegistryEntry_(new ACLASN
, ACLDestinationASNStrategy::Instance(), "dst_as");
614 ACLSourceASNStrategy::match (ACLData
<Ip::Address
> * &data
, ACLFilledChecklist
*checklist
, ACLFlags
&)
616 return data
->match(checklist
->src_addr
);
619 ACLSourceASNStrategy
*
620 ACLSourceASNStrategy::Instance()
625 ACLSourceASNStrategy
ACLSourceASNStrategy::Instance_
;
628 ACLDestinationASNStrategy::match (ACLData
<MatchType
> * &data
, ACLFilledChecklist
*checklist
, ACLFlags
&)
630 const ipcache_addrs
*ia
= ipcache_gethostbyname(checklist
->request
->GetHost(), IP_LOOKUP_IF_MISS
);
633 for (int k
= 0; k
< (int) ia
->count
; ++k
) {
634 if (data
->match(ia
->in_addrs
[k
]))
640 } else if (!checklist
->request
->flags
.destinationIpLookedUp
) {
641 /* No entry in cache, lookup not attempted */
642 debugs(28, 3, "asnMatchAcl: Can't yet compare '" << AclMatchedName
<< "' ACL for '" << checklist
->request
->GetHost() << "'");
643 if (checklist
->goAsync(DestinationIPLookup::Instance()))
645 // else fall through to noaddr match, hiding the lookup failure (XXX)
649 return data
->match(noaddr
);
652 ACLDestinationASNStrategy
*
653 ACLDestinationASNStrategy::Instance()
658 ACLDestinationASNStrategy
ACLDestinationASNStrategy::Instance_
;