summaryrefslogtreecommitdiffabout
authorMichael Krelin <hacker@klever.net>2008-06-27 21:00:41 (UTC)
committer Michael Krelin <hacker@klever.net>2008-06-27 21:00:41 (UTC)
commit362678728b8232c9490e14ba14ff323d9a92d6be (patch) (unidiff)
tree105675f96fff87916b2fdea8b51ad9fe98c5531d
parenta344edbdddeac51524001faa10d06f85cfdb041c (diff)
downloadlibopkele-362678728b8232c9490e14ba14ff323d9a92d6be.zip
libopkele-362678728b8232c9490e14ba14ff323d9a92d6be.tar.gz
libopkele-362678728b8232c9490e14ba14ff323d9a92d6be.tar.bz2
made gcc 4.3 a bit happier
Signed-off-by: Michael Krelin <hacker@klever.net>
Diffstat (more/less context) (ignore whitespace changes)
-rw-r--r--include/opkele/iterator.h4
-rw-r--r--lib/discovery.cc4
-rw-r--r--lib/message.cc2
-rw-r--r--lib/prequeue_rp.cc4
-rw-r--r--lib/secret.cc2
-rw-r--r--lib/util.cc6
6 files changed, 11 insertions, 11 deletions
diff --git a/include/opkele/iterator.h b/include/opkele/iterator.h
index 28c1c83..8f86234 100644
--- a/include/opkele/iterator.h
+++ b/include/opkele/iterator.h
@@ -142,45 +142,45 @@ namespace opkele {
142 virtual ~basic_filterator() { } 142 virtual ~basic_filterator() { }
143 143
144 bool operator==(const basic_filterator<IT>& x) const { 144 bool operator==(const basic_filterator<IT>& x) const {
145 return empty?x.empty:(it==x.it); } 145 return empty?x.empty:(it==x.it); }
146 bool operator!=(const basic_filterator<IT>& x) const { 146 bool operator!=(const basic_filterator<IT>& x) const {
147 return empty!=x.empty || it!=x.it; } 147 return empty!=x.empty || it!=x.it; }
148 148
149 typename IT::reference operator*() const { 149 typename IT::reference operator*() const {
150 assert(!empty); 150 assert(!empty);
151 return *it; } 151 return *it; }
152 typename IT::pointer operator->() const { 152 typename IT::pointer operator->() const {
153 assert(!empty); 153 assert(!empty);
154 return it.operator->(); } 154 return it.operator->(); }
155 155
156 basic_filterator<IT>& operator++() { 156 basic_filterator<IT>& operator++() {
157 bool found = false; 157 bool found = false;
158 for(++it;!(it==ei || (found=is_interesting()));++it); 158 for(++it;!(it==ei || (found=is_interesting()));++it) ;
159 if(!found) empty=true; 159 if(!found) empty=true;
160 return *this; 160 return *this;
161 } 161 }
162 basic_filterator<IT> operator++(int) { 162 basic_filterator<IT> operator++(int) {
163 basic_filterator<IT> rv(*this); 163 basic_filterator<IT> rv(*this);
164 ++(*this); 164 ++(*this);
165 return rv; 165 return rv;
166 } 166 }
167 167
168 void prepare() { 168 void prepare() {
169 bool found = false; 169 bool found = false;
170 for(;!(it==ei || (found=is_interesting()));++it); 170 for(;!(it==ei || (found=is_interesting()));++it) ;
171 if(!found) empty = true; 171 if(!found) empty = true;
172 } 172 }
173 virtual bool is_interesting() const = 0; 173 virtual bool is_interesting() const = 0;
174 }; 174 };
175 175
176 template<typename IT,typename T=typename IT::value_type::first_type,typename TR=T&,typename TP=T*> 176 template<typename IT,typename T=typename IT::value_type::first_type,typename TR=T&,typename TP=T*>
177 class map_keys_iterator : public iterator< 177 class map_keys_iterator : public iterator<
178 typename IT::iterator_category, 178 typename IT::iterator_category,
179 T,void,TP,TR> { 179 T,void,TP,TR> {
180 public: 180 public:
181 typedef map_keys_iterator<IT,T,TR,TP> self_type; 181 typedef map_keys_iterator<IT,T,TR,TP> self_type;
182 IT it; 182 IT it;
183 IT ei; 183 IT ei;
184 bool empty; 184 bool empty;
185 185
186 map_keys_iterator() : empty(true) { } 186 map_keys_iterator() : empty(true) { }
diff --git a/lib/discovery.cc b/lib/discovery.cc
index d1989ec..984e308 100644
--- a/lib/discovery.cc
+++ b/lib/discovery.cc
@@ -326,33 +326,33 @@ namespace opkele {
326 if(!(xmode&xmode_html)) 326 if(!(xmode&xmode_html))
327 bytes = 0; 327 bytes = 0;
328 } 328 }
329 return bytes; 329 return bytes;
330 } 330 }
331 size_t header(void *p,size_t s,size_t nm) { 331 size_t header(void *p,size_t s,size_t nm) {
332 size_t bytes = s*nm; 332 size_t bytes = s*nm;
333 const char *h = (const char*)p; 333 const char *h = (const char*)p;
334 const char *colon = (const char*)memchr(p,':',bytes); 334 const char *colon = (const char*)memchr(p,':',bytes);
335 const char *space = (const char*)memchr(p,' ',bytes); 335 const char *space = (const char*)memchr(p,' ',bytes);
336 if(space && ( (!colon) || space<colon ) ) { 336 if(space && ( (!colon) || space<colon ) ) {
337 xrds_location.clear(); http_content_type.clear(); 337 xrds_location.clear(); http_content_type.clear();
338 }else if(colon) { 338 }else if(colon) {
339 const char *hv = ++colon; 339 const char *hv = ++colon;
340 size_t hnl = colon-h; 340 size_t hnl = colon-h;
341 int rb; 341 int rb;
342 for(rb = bytes-hnl-1;rb>0 && isspace(*hv);++hv,--rb); 342 for(rb = bytes-hnl-1;rb>0 && isspace(*hv);++hv,--rb) ;
343 while(rb>0 && isspace(hv[rb-1])) --rb; 343 while(rb>0 && isspace(hv[rb-1])) --rb;
344 if(rb) { 344 if(rb) {
345 if( (hnl>=sizeof(XRDS_HEADER)) 345 if( (hnl>=sizeof(XRDS_HEADER))
346 && !strncasecmp(h,XRDS_HEADER":", 346 && !strncasecmp(h,XRDS_HEADER":",
347 sizeof(XRDS_HEADER)) ) { 347 sizeof(XRDS_HEADER)) ) {
348 xrds_location.assign(hv,rb); 348 xrds_location.assign(hv,rb);
349 }else if( (hnl>=sizeof(CT_HEADER)) 349 }else if( (hnl>=sizeof(CT_HEADER))
350 && !strncasecmp(h,CT_HEADER":", 350 && !strncasecmp(h,CT_HEADER":",
351 sizeof(CT_HEADER)) ) { 351 sizeof(CT_HEADER)) ) {
352 const char *sc = (const char*)memchr( 352 const char *sc = (const char*)memchr(
353 hv,';',rb); 353 hv,';',rb);
354 http_content_type.assign(hv,sc?(sc-hv):rb); 354 http_content_type.assign(hv,sc?(sc-hv):rb);
355 } 355 }
356 } 356 }
357 } 357 }
358 return curl_t::header(p,s,nm); 358 return curl_t::header(p,s,nm);
@@ -487,33 +487,33 @@ namespace opkele {
487 if(!( strcasecmp(a[0],"http-equiv") 487 if(!( strcasecmp(a[0],"http-equiv")
488 || strcasecmp(a[1],XRDS_HEADER) )) 488 || strcasecmp(a[1],XRDS_HEADER) ))
489 heq = true; 489 heq = true;
490 else if(!strcasecmp(a[0],"content")) 490 else if(!strcasecmp(a[0],"content"))
491 l.assign(a[1]); 491 l.assign(a[1]);
492 } 492 }
493 if(heq) 493 if(heq)
494 xrds_location = l; 494 xrds_location = l;
495 }else if(is_element(n,"link")) { 495 }else if(is_element(n,"link")) {
496 string rels; 496 string rels;
497 string href; 497 string href;
498 for(;*a;a+=2) { 498 for(;*a;a+=2) {
499 if( !strcasecmp(a[0],"rel") ) { 499 if( !strcasecmp(a[0],"rel") ) {
500 rels.assign(a[1]); 500 rels.assign(a[1]);
501 }else if( !strcasecmp(a[0],"href") ) { 501 }else if( !strcasecmp(a[0],"href") ) {
502 const char *ns = a[1]; 502 const char *ns = a[1];
503 for(;*ns && isspace(*ns);++ns); 503 for(;*ns && isspace(*ns);++ns) ;
504 href.assign(ns); 504 href.assign(ns);
505 string::size_type lns=href.find_last_not_of(data::_whitespace_chars); 505 string::size_type lns=href.find_last_not_of(data::_whitespace_chars);
506 href.erase(lns+1); 506 href.erase(lns+1);
507 } 507 }
508 } 508 }
509 for(string::size_type ns=rels.find_first_not_of(data::_whitespace_chars); 509 for(string::size_type ns=rels.find_first_not_of(data::_whitespace_chars);
510 ns!=string::npos; ns=rels.find_first_not_of(data::_whitespace_chars,ns)) { 510 ns!=string::npos; ns=rels.find_first_not_of(data::_whitespace_chars,ns)) {
511 string::size_type s = rels.find_first_of(data::_whitespace_chars,ns); 511 string::size_type s = rels.find_first_of(data::_whitespace_chars,ns);
512 string rel; 512 string rel;
513 if(s==string::npos) { 513 if(s==string::npos) {
514 rel.assign(rels,ns,string::npos); 514 rel.assign(rels,ns,string::npos);
515 ns = string::npos; 515 ns = string::npos;
516 }else{ 516 }else{
517 rel.assign(rels,ns,s-ns); 517 rel.assign(rels,ns,s-ns);
518 ns = s; 518 ns = s;
519 } 519 }
diff --git a/lib/message.cc b/lib/message.cc
index 524946a..c1f8088 100644
--- a/lib/message.cc
+++ b/lib/message.cc
@@ -145,33 +145,33 @@ namespace opkele {
145 145
146 string basic_openid_message::find_ns(const string& uri,const char *pfx) const { 146 string basic_openid_message::find_ns(const string& uri,const char *pfx) const {
147 try { 147 try {
148 return get_ns(uri); 148 return get_ns(uri);
149 }catch(failed_lookup&) { 149 }catch(failed_lookup&) {
150 return pfx; 150 return pfx;
151 } 151 }
152 } 152 }
153 string basic_openid_message::allocate_ns(const string& uri,const char *pfx) { 153 string basic_openid_message::allocate_ns(const string& uri,const char *pfx) {
154 if(!has_field("ns")) 154 if(!has_field("ns"))
155 return pfx; 155 return pfx;
156 if(has_ns(uri)) 156 if(has_ns(uri))
157 throw bad_input(OPKELE_CP_ "OpenID message already contains namespace"); 157 throw bad_input(OPKELE_CP_ "OpenID message already contains namespace");
158 string rv = pfx; 158 string rv = pfx;
159 if(has_field("ns."+rv)) { 159 if(has_field("ns."+rv)) {
160 string::reference c=rv[rv.length()]; 160 string::reference c=rv[rv.length()];
161 for(c='a';c<='z' && has_field("ns."+rv);++c); 161 for(c='a';c<='z' && has_field("ns."+rv);++c) ;
162 if(c=='z') 162 if(c=='z')
163 throw exception(OPKELE_CP_ "Failed to allocate namespace"); 163 throw exception(OPKELE_CP_ "Failed to allocate namespace");
164 } 164 }
165 set_field("ns."+rv,uri); 165 set_field("ns."+rv,uri);
166 return rv; 166 return rv;
167 } 167 }
168 168
169 bool openid_message_t::has_field(const string& n) const { 169 bool openid_message_t::has_field(const string& n) const {
170 return find(n)!=end(); 170 return find(n)!=end();
171 } 171 }
172 const string& openid_message_t::get_field(const string& n) const { 172 const string& openid_message_t::get_field(const string& n) const {
173 const_iterator i=find(n); 173 const_iterator i=find(n);
174 if(i==end()) 174 if(i==end())
175 throw failed_lookup(OPKELE_CP_ n+": no such field"); 175 throw failed_lookup(OPKELE_CP_ n+": no such field");
176 return i->second; 176 return i->second;
177 } 177 }
diff --git a/lib/prequeue_rp.cc b/lib/prequeue_rp.cc
index e499d08..886efae 100644
--- a/lib/prequeue_rp.cc
+++ b/lib/prequeue_rp.cc
@@ -29,35 +29,35 @@ namespace opkele {
29 OP_verifier& operator*() { return *this; } 29 OP_verifier& operator*() { return *this; }
30 OP_verifier& operator=(const openid_endpoint_t& oep) { 30 OP_verifier& operator=(const openid_endpoint_t& oep) {
31 if(oep.uri==OP) { 31 if(oep.uri==OP) {
32 if(oep.claimed_id==IDURI_SELECT20 32 if(oep.claimed_id==IDURI_SELECT20
33 || oep.local_id==IDURI_SELECT20 ) 33 || oep.local_id==IDURI_SELECT20 )
34 throw bad_input(OPKELE_CP_ "claimed_id is an OP-Id"); 34 throw bad_input(OPKELE_CP_ "claimed_id is an OP-Id");
35 if(oep.local_id==id) 35 if(oep.local_id==id)
36 throw __OP_verifier_good_input(OPKELE_CP_ "Found corresponding endpoint"); 36 throw __OP_verifier_good_input(OPKELE_CP_ "Found corresponding endpoint");
37 } 37 }
38 return *this; 38 return *this;
39 } 39 }
40 40
41 OP_verifier& operator++() { return *this; } 41 OP_verifier& operator++() { return *this; }
42 OP_verifier& operator++(int) { return *this; } 42 OP_verifier& operator++(int) { return *this; }
43 }; 43 };
44 44
45 void prequeue_RP::verify_OP(const string& OP,const string& claimed_id,const string& id) const { 45 void prequeue_RP::verify_OP(const string& OP,const string& _claimed_id,const string& id) const {
46 try { 46 try {
47 discover(OP_verifier(OP,id),claimed_id); 47 discover(OP_verifier(OP,id),_claimed_id);
48 throw id_res_unauthorized(OPKELE_CP_ 48 throw id_res_unauthorized(OPKELE_CP_
49 "OP is not authorized to make an assertion regarding the identity"); 49 "OP is not authorized to make an assertion regarding the identity");
50 }catch(__OP_verifier_good_input& ovgi) { 50 }catch(__OP_verifier_good_input& ovgi) {
51 } 51 }
52 } 52 }
53 53
54 class endpoint_queuer : public iterator<output_iterator_tag,openid_endpoint_t,void> { 54 class endpoint_queuer : public iterator<output_iterator_tag,openid_endpoint_t,void> {
55 public: 55 public:
56 prequeue_RP& rp; 56 prequeue_RP& rp;
57 57
58 endpoint_queuer(prequeue_RP& r) : rp(r) { } 58 endpoint_queuer(prequeue_RP& r) : rp(r) { }
59 59
60 endpoint_queuer& operator*() { return *this; } 60 endpoint_queuer& operator*() { return *this; }
61 endpoint_queuer& operator=(const openid_endpoint_t& oep) { 61 endpoint_queuer& operator=(const openid_endpoint_t& oep) {
62 rp.queue_endpoint(oep); return *this; } 62 rp.queue_endpoint(oep); return *this; }
63 63
diff --git a/lib/secret.cc b/lib/secret.cc
index d538890..3f1e39c 100644
--- a/lib/secret.cc
+++ b/lib/secret.cc
@@ -1,29 +1,29 @@
1#include <algorithm> 1#include <algorithm>
2#include <functional> 2#include <functional>
3#include <opkele/types.h> 3#include <opkele/types.h>
4#include <opkele/exception.h> 4#include <opkele/exception.h>
5#include <opkele/util.h> 5#include <opkele/util.h>
6 6
7namespace opkele { 7namespace opkele {
8 using namespace std; 8 using namespace std;
9 9
10 template<class __a1,class __a2,class __r> 10 template<class __a1,class __a2,class __r>
11 struct bitwise_xor : public binary_function<__a1,__a2,__r> { 11 struct bitwise_xor : public binary_function<__a1,__a2,__r> {
12 __r operator() (const __a1& a1,const __a2& a2) const { 12 __r operator() (const __a1& a1,const __a2& a2) const {
13 return a1^a2; 13 return (__r)(a1^a2);
14 } 14 }
15 }; 15 };
16 16
17 void secret_t::enxor_to_base64(const unsigned char *key_d,string& rv) const { 17 void secret_t::enxor_to_base64(const unsigned char *key_d,string& rv) const {
18 vector<unsigned char> tmp; 18 vector<unsigned char> tmp;
19 transform( 19 transform(
20 begin(), end(), 20 begin(), end(),
21 key_d, 21 key_d,
22 back_insert_iterator<vector<unsigned char> >(tmp), 22 back_insert_iterator<vector<unsigned char> >(tmp),
23 bitwise_xor<unsigned char,unsigned char,unsigned char>() ); 23 bitwise_xor<unsigned char,unsigned char,unsigned char>() );
24 rv = util::encode_base64(&(tmp.front()),tmp.size()); 24 rv = util::encode_base64(&(tmp.front()),tmp.size());
25 } 25 }
26 26
27 void secret_t::enxor_from_base64(const unsigned char *key_d,const string& b64) { 27 void secret_t::enxor_from_base64(const unsigned char *key_d,const string& b64) {
28 clear(); 28 clear();
29 util::decode_base64(b64,*this); 29 util::decode_base64(b64,*this);
diff --git a/lib/util.cc b/lib/util.cc
index b702291..d979502 100644
--- a/lib/util.cc
+++ b/lib/util.cc
@@ -198,33 +198,33 @@ namespace opkele {
198 for(string::const_iterator i=str.begin(),ie=str.end(); 198 for(string::const_iterator i=str.begin(),ie=str.end();
199 i!=ie;++i) { 199 i!=ie;++i) {
200 switch(*i) { 200 switch(*i) {
201 case '+': 201 case '+':
202 *(ii++) = ' '; break; 202 *(ii++) = ' '; break;
203 case '%': 203 case '%':
204 ++i; 204 ++i;
205 static char tmp[3] = {0,0,0}; 205 static char tmp[3] = {0,0,0};
206 if(i==ie) 206 if(i==ie)
207 throw failed_conversion(OPKELE_CP_ "trailing percent in the url-encoded string"); 207 throw failed_conversion(OPKELE_CP_ "trailing percent in the url-encoded string");
208 tmp[0] = *(i++); 208 tmp[0] = *(i++);
209 if(i==ie) 209 if(i==ie)
210 throw failed_conversion(OPKELE_CP_ "not enough hexadecimals after the percent sign in url-encoded string"); 210 throw failed_conversion(OPKELE_CP_ "not enough hexadecimals after the percent sign in url-encoded string");
211 tmp[1] = *i; 211 tmp[1] = *i;
212 if(!(isxdigit(tmp[0]) && isxdigit(tmp[1]))) 212 if(!(isxdigit(tmp[0]) && isxdigit(tmp[1])))
213 throw failed_conversion(OPKELE_CP_ "non-hex follows percent in url-encoded string"); 213 throw failed_conversion(OPKELE_CP_ "non-hex follows percent in url-encoded string");
214 *(ii++) = strtol(tmp,0,16); 214 *(ii++) = (char)strtol(tmp,0,16);
215 break; 215 break;
216 default: 216 default:
217 *(ii++) = *i; break; 217 *(ii++) = *i; break;
218 } 218 }
219 } 219 }
220 return rv; 220 return rv;
221 } 221 }
222 222
223 string attr_escape(const string& str) { 223 string attr_escape(const string& str) {
224 static const char *unsafechars = "<>&\n\"'"; 224 static const char *unsafechars = "<>&\n\"'";
225 string rv; 225 string rv;
226 string::size_type p=0; 226 string::size_type p=0;
227 while(true) { 227 while(true) {
228 string::size_type us = str.find_first_of(unsafechars,p); 228 string::size_type us = str.find_first_of(unsafechars,p);
229 if(us==string::npos) { 229 if(us==string::npos) {
230 if(p!=str.length()) 230 if(p!=str.length())
@@ -335,36 +335,36 @@ namespace opkele {
335 if(unsafe==string::npos) { 335 if(unsafe==string::npos) {
336 pseg.append(uri,n,ul-n-1); n = ul-1; 336 pseg.append(uri,n,ul-n-1); n = ul-1;
337 }else{ 337 }else{
338 pseg.append(uri,n,unsafe-n); 338 pseg.append(uri,n,unsafe-n);
339 n = unsafe; 339 n = unsafe;
340 } 340 }
341 char c = uri[n++]; 341 char c = uri[n++];
342 if(c=='%') { 342 if(c=='%') {
343 if((n+1)>=ul) 343 if((n+1)>=ul)
344 throw bad_input(OPKELE_CP_ "Unexpected end of URI encountered while parsing percent-encoded character"); 344 throw bad_input(OPKELE_CP_ "Unexpected end of URI encountered while parsing percent-encoded character");
345 tmp[0] = uri[n++]; 345 tmp[0] = uri[n++];
346 tmp[1] = uri[n++]; 346 tmp[1] = uri[n++];
347 if(!( isxdigit(tmp[0]) && isxdigit(tmp[1]) )) 347 if(!( isxdigit(tmp[0]) && isxdigit(tmp[1]) ))
348 throw bad_input(OPKELE_CP_ "Invalid percent-encoded character in URI being normalized"); 348 throw bad_input(OPKELE_CP_ "Invalid percent-encoded character in URI being normalized");
349 int cc = strtol(tmp,0,16); 349 int cc = strtol(tmp,0,16);
350 if( isalpha(cc) || isdigit(cc) || strchr("._~-",cc) ) 350 if( isalpha(cc) || isdigit(cc) || strchr("._~-",cc) )
351 pseg += cc; 351 pseg += (char)cc;
352 else{ 352 else{
353 pseg += '%'; 353 pseg += '%';
354 pseg += toupper(tmp[0]); pseg += toupper(tmp[1]); 354 pseg += (char)toupper(tmp[0]); pseg += (char)toupper(tmp[1]);
355 } 355 }
356 }else if(qf) { 356 }else if(qf) {
357 rv += pseg; rv += c; 357 rv += pseg; rv += c;
358 pseg.clear(); 358 pseg.clear();
359 }else if(n>=ul || strchr("?/#",c)) { 359 }else if(n>=ul || strchr("?/#",c)) {
360 if(pseg.empty() || pseg==".") { 360 if(pseg.empty() || pseg==".") {
361 }else if(pseg=="..") { 361 }else if(pseg=="..") {
362 if(psegs.size()>1) { 362 if(psegs.size()>1) {
363 rv.resize(psegs.top()); psegs.pop(); 363 rv.resize(psegs.top()); psegs.pop();
364 } 364 }
365 }else{ 365 }else{
366 psegs.push(rv.length()); 366 psegs.push(rv.length());
367 if(c!='/') { 367 if(c!='/') {
368 pseg += c; 368 pseg += c;
369 qf = true; 369 qf = true;
370 } 370 }