-rw-r--r-- | lib/params.cc | 13 | ||||
-rw-r--r-- | lib/secret.cc | 12 |
2 files changed, 17 insertions, 8 deletions
diff --git a/lib/params.cc b/lib/params.cc index ea86d3a..7a572c1 100644 --- a/lib/params.cc +++ b/lib/params.cc | |||
@@ -1,108 +1,121 @@ | |||
1 | #include <opkele/types.h> | 1 | #include <opkele/types.h> |
2 | #include <opkele/exception.h> | 2 | #include <opkele/exception.h> |
3 | #include <opkele/util.h> | 3 | #include <opkele/util.h> |
4 | #include <openssl/sha.h> | 4 | #include <openssl/sha.h> |
5 | #include <openssl/hmac.h> | 5 | #include <openssl/hmac.h> |
6 | 6 | ||
7 | #include "config.h" | 7 | #include "config.h" |
8 | 8 | ||
9 | namespace opkele { | 9 | namespace opkele { |
10 | using namespace std; | 10 | using namespace std; |
11 | 11 | ||
12 | bool params_t::has_param(const string& n) const { | 12 | bool params_t::has_param(const string& n) const { |
13 | return find(n)!=end(); | 13 | return find(n)!=end(); |
14 | } | 14 | } |
15 | const string& params_t::get_param(const string& n) const { | 15 | const string& params_t::get_param(const string& n) const { |
16 | const_iterator i = find(n); | 16 | const_iterator i = find(n); |
17 | if(i==end()) | 17 | if(i==end()) |
18 | throw failed_lookup(OPKELE_CP_ n+": no such parameter"); | 18 | throw failed_lookup(OPKELE_CP_ n+": no such parameter"); |
19 | return i->second; | 19 | return i->second; |
20 | } | 20 | } |
21 | string& params_t::get_param(const string& n) { | 21 | string& params_t::get_param(const string& n) { |
22 | iterator i = find(n); | 22 | iterator i = find(n); |
23 | if(i==end()) | 23 | if(i==end()) |
24 | throw failed_lookup(OPKELE_CP_ n+": no such parameter"); | 24 | throw failed_lookup(OPKELE_CP_ n+": no such parameter"); |
25 | return i->second; | 25 | return i->second; |
26 | } | 26 | } |
27 | 27 | ||
28 | void params_t::parse_keyvalues(const string& kv) { | 28 | void params_t::parse_keyvalues(const string& kv) { |
29 | clear(); | 29 | clear(); |
30 | string::size_type p = 0; | 30 | string::size_type p = 0; |
31 | while(true) { | 31 | while(true) { |
32 | string::size_type co = kv.find(':',p); | 32 | string::size_type co = kv.find(':',p); |
33 | if(co==string::npos) | 33 | if(co==string::npos) |
34 | break; | 34 | break; |
35 | #ifndef POSTELS_LAW | 35 | #ifndef POSTELS_LAW |
36 | string::size_type nl = kv.find('\n',co+1); | 36 | string::size_type nl = kv.find('\n',co+1); |
37 | if(nl==string::npos) | 37 | if(nl==string::npos) |
38 | throw bad_input(OPKELE_CP_ "malformed input"); | 38 | throw bad_input(OPKELE_CP_ "malformed input"); |
39 | if(nl>co) | 39 | if(nl>co) |
40 | insert(value_type(kv.substr(p,co-p),kv.substr(co+1,nl-co-1))); | 40 | insert(value_type(kv.substr(p,co-p),kv.substr(co+1,nl-co-1))); |
41 | p = nl+1; | 41 | p = nl+1; |
42 | #else /* POSTELS_LAW */ | 42 | #else /* POSTELS_LAW */ |
43 | string::size_type lb = kv.find_first_of("\r\n",co+1); | 43 | string::size_type lb = kv.find_first_of("\r\n",co+1); |
44 | if(lb==string::npos) { | 44 | if(lb==string::npos) { |
45 | insert(value_type(kv.substr(p,co-p),kv.substr(co+1))); | 45 | insert(value_type(kv.substr(p,co-p),kv.substr(co+1))); |
46 | break; | 46 | break; |
47 | } | 47 | } |
48 | if(lb>co) | 48 | if(lb>co) |
49 | insert(value_type(kv.substr(p,co-p),kv.substr(co+1,lb-co-1))); | 49 | insert(value_type(kv.substr(p,co-p),kv.substr(co+1,lb-co-1))); |
50 | string::size_type nolb = kv.find_first_not_of("\r\n",lb); | 50 | string::size_type nolb = kv.find_first_not_of("\r\n",lb); |
51 | if(nolb==string::npos) | 51 | if(nolb==string::npos) |
52 | break; | 52 | break; |
53 | p = nolb; | 53 | p = nolb; |
54 | #endif /* POSTELS_LAW */ | 54 | #endif /* POSTELS_LAW */ |
55 | } | 55 | } |
56 | } | 56 | } |
57 | 57 | ||
58 | void params_t::sign(secret_t secret,string& sig,const string& slist,const char *prefix) const { | 58 | void params_t::sign(secret_t secret,string& sig,const string& slist,const char *prefix) const { |
59 | string kv; | 59 | string kv; |
60 | string::size_type p = 0; | 60 | string::size_type p = 0; |
61 | while(true) { | 61 | while(true) { |
62 | string::size_type co = slist.find(',',p); | 62 | string::size_type co = slist.find(',',p); |
63 | string f = (co==string::npos)?slist.substr(p):slist.substr(p,co-p); | 63 | string f = (co==string::npos)?slist.substr(p):slist.substr(p,co-p); |
64 | kv += f; | 64 | kv += f; |
65 | kv += ':'; | 65 | kv += ':'; |
66 | if(prefix) f.insert(0,prefix); | 66 | if(prefix) f.insert(0,prefix); |
67 | kv += get_param(f); | 67 | kv += get_param(f); |
68 | kv += '\n'; | 68 | kv += '\n'; |
69 | if(co==string::npos) | 69 | if(co==string::npos) |
70 | break; | 70 | break; |
71 | p = co+1; | 71 | p = co+1; |
72 | } | 72 | } |
73 | unsigned int md_len = 0; | 73 | unsigned int md_len = 0; |
74 | unsigned char *md = HMAC( | 74 | unsigned char *md = HMAC( |
75 | EVP_sha1(), | 75 | EVP_sha1(), |
76 | &(secret.front()),secret.size(), | 76 | &(secret.front()),secret.size(), |
77 | (const unsigned char *)kv.data(),kv.length(), | 77 | (const unsigned char *)kv.data(),kv.length(), |
78 | 0,&md_len); | 78 | 0,&md_len); |
79 | sig = util::encode_base64(md,md_len); | 79 | sig = util::encode_base64(md,md_len); |
80 | } | 80 | } |
81 | 81 | ||
82 | string params_t::append_query(const string& url,const char *prefix) const { | 82 | string params_t::append_query(const string& url,const char *prefix) const { |
83 | string rv = url; | 83 | string rv = url; |
84 | bool p = true; | 84 | bool p = true; |
85 | if(rv.find('?')==string::npos) { | 85 | if(rv.find('?')==string::npos) { |
86 | rv += '?'; | 86 | rv += '?'; |
87 | p = false; | 87 | p = false; |
88 | } | 88 | } |
89 | for(const_iterator i=begin();i!=end();++i) { | 89 | for(const_iterator i=begin();i!=end();++i) { |
90 | if(p) | 90 | if(p) |
91 | rv += '&'; | 91 | rv += '&'; |
92 | else | 92 | else |
93 | p = true; | 93 | p = true; |
94 | rv += prefix; | 94 | rv += prefix; |
95 | rv += i->first; | 95 | rv += i->first; |
96 | rv += '='; | 96 | rv += '='; |
97 | rv += util::url_encode(i->second); | 97 | rv += util::url_encode(i->second); |
98 | } | 98 | } |
99 | return rv; | 99 | return rv; |
100 | } | 100 | } |
101 | 101 | ||
102 | string params_t::query_string(const char *prefix) const { | ||
103 | string rv; | ||
104 | for(const_iterator i=begin();i!=end();++i) { | ||
105 | if(!rv.empty()) | ||
106 | rv += '&'; | ||
107 | rv += prefix; | ||
108 | rv += i->first; | ||
109 | rv += '='; | ||
110 | rv += util::url_encode(i->second); | ||
111 | } | ||
112 | return rv; | ||
113 | } | ||
114 | |||
102 | ostream& operator << (ostream& o,const params_t& p) { | 115 | ostream& operator << (ostream& o,const params_t& p) { |
103 | for(params_t::const_iterator i=p.begin();i!=p.end();++i) | 116 | for(params_t::const_iterator i=p.begin();i!=p.end();++i) |
104 | o << i->first << ':' << i->second << '\n'; | 117 | o << i->first << ':' << i->second << '\n'; |
105 | return o; | 118 | return o; |
106 | } | 119 | } |
107 | 120 | ||
108 | } | 121 | } |
diff --git a/lib/secret.cc b/lib/secret.cc index 632a2ca..d538890 100644 --- a/lib/secret.cc +++ b/lib/secret.cc | |||
@@ -1,49 +1,45 @@ | |||
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 | ||
7 | namespace opkele { | 7 | namespace 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 a1^a2; |
14 | } | 14 | } |
15 | }; | 15 | }; |
16 | 16 | ||
17 | void secret_t::enxor_to_base64(const unsigned char *key_sha1,string& rv) const { | 17 | void secret_t::enxor_to_base64(const unsigned char *key_d,string& rv) const { |
18 | if(size()!=20) | ||
19 | throw bad_input(OPKELE_CP_ "wrong secret size"); | ||
20 | vector<unsigned char> tmp; | 18 | vector<unsigned char> tmp; |
21 | transform( | 19 | transform( |
22 | begin(), end(), | 20 | begin(), end(), |
23 | key_sha1, | 21 | key_d, |
24 | back_insert_iterator<vector<unsigned char> >(tmp), | 22 | back_insert_iterator<vector<unsigned char> >(tmp), |
25 | bitwise_xor<unsigned char,unsigned char,unsigned char>() ); | 23 | bitwise_xor<unsigned char,unsigned char,unsigned char>() ); |
26 | rv = util::encode_base64(&(tmp.front()),tmp.size()); | 24 | rv = util::encode_base64(&(tmp.front()),tmp.size()); |
27 | } | 25 | } |
28 | 26 | ||
29 | void secret_t::enxor_from_base64(const unsigned char *key_sha1,const string& b64) { | 27 | void secret_t::enxor_from_base64(const unsigned char *key_d,const string& b64) { |
30 | clear(); | 28 | clear(); |
31 | util::decode_base64(b64,*this); | 29 | util::decode_base64(b64,*this); |
32 | transform( | 30 | transform( |
33 | begin(), end(), | 31 | begin(), end(), |
34 | key_sha1, | 32 | key_d, |
35 | begin(), | 33 | begin(), |
36 | bitwise_xor<unsigned char,unsigned char,unsigned char>() ); | 34 | bitwise_xor<unsigned char,unsigned char,unsigned char>() ); |
37 | } | 35 | } |
38 | 36 | ||
39 | void secret_t::to_base64(string& rv) const { | 37 | void secret_t::to_base64(string& rv) const { |
40 | if(size()!=20) | ||
41 | throw bad_input(OPKELE_CP_ "wrong secret size"); | ||
42 | rv = util::encode_base64(&(front()),size()); | 38 | rv = util::encode_base64(&(front()),size()); |
43 | } | 39 | } |
44 | 40 | ||
45 | void secret_t::from_base64(const string& b64) { | 41 | void secret_t::from_base64(const string& b64) { |
46 | util::decode_base64(b64,*this); | 42 | util::decode_base64(b64,*this); |
47 | } | 43 | } |
48 | 44 | ||
49 | } | 45 | } |