]>
Commit | Line | Data |
---|---|---|
985c86bc | 1 | |
2 | /* | |
262a0e14 | 3 | * $Id$ |
985c86bc | 4 | * |
5 | * DEBUG: section 23 URL Scheme parsing | |
6 | * AUTHOR: Robert Collins | |
7 | * | |
8 | * SQUID Web Proxy Cache http://www.squid-cache.org/ | |
9 | * ---------------------------------------------------------- | |
10 | * | |
11 | * Squid is the result of efforts by numerous individuals from | |
12 | * the Internet community; see the CONTRIBUTORS file for full | |
13 | * details. Many organizations have provided support for Squid's | |
14 | * development; see the SPONSORS file for full details. Squid is | |
15 | * Copyrighted (C) 2001 by the Regents of the University of | |
16 | * California; see the COPYRIGHT file for full details. Squid | |
17 | * incorporates software developed and/or copyrighted by other | |
18 | * sources; see the CREDITS file for full details. | |
19 | * | |
20 | * This program is free software; you can redistribute it and/or modify | |
21 | * it under the terms of the GNU General Public License as published by | |
22 | * the Free Software Foundation; either version 2 of the License, or | |
23 | * (at your option) any later version. | |
26ac0430 | 24 | * |
985c86bc | 25 | * This program is distributed in the hope that it will be useful, |
26 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
27 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
28 | * GNU General Public License for more details. | |
26ac0430 | 29 | * |
985c86bc | 30 | * You should have received a copy of the GNU General Public License |
31 | * along with this program; if not, write to the Free Software | |
32 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA. | |
33 | * | |
34 | */ | |
35 | ||
f7f3304a | 36 | #include "squid.h" |
985c86bc | 37 | #include "URLScheme.h" |
38 | #include "wordlist.h" | |
39 | ||
0c3d3f65 AJ |
40 | char const * |
41 | URLScheme::const_str() const | |
42 | { | |
43 | if (theScheme_ == AnyP::PROTO_UNKNOWN) | |
44 | return "(unknown)"; | |
45 | ||
46 | static char out[BUFSIZ]; | |
47 | int p = 0; | |
48 | ||
49 | if (theScheme_ > AnyP::PROTO_NONE && theScheme_ < AnyP::PROTO_MAX) { | |
50 | const char *in = AnyP::ProtocolType_str[theScheme_]; | |
51 | for (; p < (BUFSIZ-1) && in[p] != '\0'; ++p) | |
52 | out[p] = xtolower(in[p]); | |
53 | } | |
54 | out[p] = '\0'; | |
55 | return out; | |
56 | } |