author | Michael Krelin <hacker@klever.net> | 2011-08-30 20:06:11 (UTC) |
---|---|---|
committer | Michael Krelin <hacker@klever.net> | 2011-08-30 20:06:11 (UTC) |
commit | 77706495aa0cc1706cfe1535b40477e004312081 (patch) (unidiff) | |
tree | a63cf5ce4682a0ce4b412f303f7524c9fa6bacfa | |
parent | 111044b60ba5f40e003d1ba1d4082794985aa3ad (diff) | |
download | iii-77706495aa0cc1706cfe1535b40477e004312081.zip iii-77706495aa0cc1706cfe1535b40477e004312081.tar.gz iii-77706495aa0cc1706cfe1535b40477e004312081.tar.bz2 |
optimize integrity digest calculation memory use
Signed-off-by: Michael Krelin <hacker@klever.net>
-rw-r--r-- | src/eyetil.cc | 14 |
1 files changed, 5 insertions, 9 deletions
diff --git a/src/eyetil.cc b/src/eyetil.cc index 57ae607..2e6ab7e 100644 --- a/src/eyetil.cc +++ b/src/eyetil.cc | |||
@@ -1,177 +1,173 @@ | |||
1 | #include <stdlib.h> | 1 | #include <stdlib.h> |
2 | #include <sys/stat.h> | 2 | #include <sys/stat.h> |
3 | #include <syslog.h> | 3 | #include <syslog.h> |
4 | #include <iostream> | 4 | #include <iostream> |
5 | #include <cassert> | 5 | #include <cassert> |
6 | #include <stdexcept> | 6 | #include <stdexcept> |
7 | #include <algorithm> | 7 | #include <algorithm> |
8 | #include <numeric> | 8 | #include <numeric> |
9 | #include <openssl/md5.h> | 9 | #include <openssl/md5.h> |
10 | #include "eyetil.h" | 10 | #include "eyetil.h" |
11 | 11 | ||
12 | #include "config.h" | 12 | #include "config.h" |
13 | #ifdef HAVE_LIBUUID | 13 | #ifdef HAVE_LIBUUID |
14 | # include <uuid/uuid.h> | 14 | # include <uuid/uuid.h> |
15 | #endif | 15 | #endif |
16 | 16 | ||
17 | binary_t& binary_t::from_hex(const std::string& h) { | 17 | binary_t& binary_t::from_hex(const std::string& h) { |
18 | std::string::size_type hs = h.length(); | 18 | std::string::size_type hs = h.length(); |
19 | if(hs&1) | 19 | if(hs&1) |
20 | throw std::runtime_error("odd number of characters in hexadecimal number"); | 20 | throw std::runtime_error("odd number of characters in hexadecimal number"); |
21 | int rvs = hs>>1; | 21 | int rvs = hs>>1; |
22 | resize(rvs); | 22 | resize(rvs); |
23 | const unsigned char *hp = (const unsigned char*)h.data(); | 23 | const unsigned char *hp = (const unsigned char*)h.data(); |
24 | iterator oi=begin(); | 24 | iterator oi=begin(); |
25 | char t[3] = { 0,0,0 }; | 25 | char t[3] = { 0,0,0 }; |
26 | for(int i=0;i<rvs;++i) { | 26 | for(int i=0;i<rvs;++i) { |
27 | t[0]=*(hp++); t[1]=*(hp++); | 27 | t[0]=*(hp++); t[1]=*(hp++); |
28 | *(oi++) = strtol(t,0,16); | 28 | *(oi++) = strtol(t,0,16); |
29 | } | 29 | } |
30 | return *this; | 30 | return *this; |
31 | } | 31 | } |
32 | 32 | ||
33 | binary_t& binary_t::from_data(const void *d,size_t s) { | 33 | binary_t& binary_t::from_data(const void *d,size_t s) { |
34 | resize(s); | 34 | resize(s); |
35 | std::copy((const unsigned char*)d,(const unsigned char *)d+s, | 35 | std::copy((const unsigned char*)d,(const unsigned char *)d+s, |
36 | begin() ); | 36 | begin() ); |
37 | return *this; | 37 | return *this; |
38 | } | 38 | } |
39 | 39 | ||
40 | binary_t& binary_t::make_nonce() { | 40 | binary_t& binary_t::make_nonce() { |
41 | #ifdef HAVE_LIBUUID | 41 | #ifdef HAVE_LIBUUID |
42 | uuid_t uuid; | 42 | uuid_t uuid; |
43 | uuid_generate(uuid); | 43 | uuid_generate(uuid); |
44 | from_data((unsigned char*)uuid,sizeof(uuid)); | 44 | from_data((unsigned char*)uuid,sizeof(uuid)); |
45 | #else | 45 | #else |
46 | resize(16); | 46 | resize(16); |
47 | std::generate_n(begin(),16,rand); | 47 | std::generate_n(begin(),16,rand); |
48 | #endif /* HAVE_LIBUUID */ | 48 | #endif /* HAVE_LIBUUID */ |
49 | return *this; | 49 | return *this; |
50 | } | 50 | } |
51 | 51 | ||
52 | std::string binary_t::hex() const { | 52 | std::string binary_t::hex() const { |
53 | std::string rv; | 53 | std::string rv; |
54 | rv.reserve((size()<<1)+1); | 54 | rv.reserve((size()<<1)+1); |
55 | char t[3] = {0,0,0}; | 55 | char t[3] = {0,0,0}; |
56 | for(const_iterator i=begin(),ie=end();i!=ie;++i) { | 56 | for(const_iterator i=begin(),ie=end();i!=ie;++i) { |
57 | int rc = snprintf(t,sizeof(t),"%02x",*i); | 57 | int rc = snprintf(t,sizeof(t),"%02x",*i); |
58 | assert(rc<sizeof(t)); | 58 | assert(rc<sizeof(t)); |
59 | rv += t; | 59 | rv += t; |
60 | } | 60 | } |
61 | return rv; | 61 | return rv; |
62 | } | 62 | } |
63 | 63 | ||
64 | binary_t binary_t::md5() const { | 64 | binary_t binary_t::md5() const { |
65 | binary_t rv(MD5_DIGEST_LENGTH); | 65 | binary_t rv(MD5_DIGEST_LENGTH); |
66 | if(!MD5( | 66 | if(!MD5( |
67 | (const unsigned char*)&(front()),size(), | 67 | (const unsigned char*)&(front()),size(), |
68 | (unsigned char*)&(rv.front()) )) | 68 | (unsigned char*)&(rv.front()) )) |
69 | throw std::runtime_error("failed to md5()"); | 69 | throw std::runtime_error("failed to md5()"); |
70 | return rv; | 70 | return rv; |
71 | } | 71 | } |
72 | 72 | ||
73 | void md5_digester::init() { | 73 | void md5_digester::init() { |
74 | if(!MD5_Init(&ctx)) throw std::runtime_error("failed to MD5_Init()"); | 74 | if(!MD5_Init(&ctx)) throw std::runtime_error("failed to MD5_Init()"); |
75 | } | 75 | } |
76 | void md5_digester::update(const void *d,size_t l) { | 76 | void md5_digester::update(const void *d,size_t l) { |
77 | if(!MD5_Update(&ctx,d,l)) throw std::runtime_error("failed to MD5_Update()"); | 77 | if(!MD5_Update(&ctx,d,l)) throw std::runtime_error("failed to MD5_Update()"); |
78 | } | 78 | } |
79 | binary_t md5_digester::final() { | 79 | binary_t md5_digester::final() { |
80 | binary_t rv(MD5_DIGEST_LENGTH); | 80 | binary_t rv(MD5_DIGEST_LENGTH); |
81 | if(!MD5_Final((unsigned char*)&(rv.front()), &ctx)) | 81 | if(!MD5_Final((unsigned char*)&(rv.front()), &ctx)) |
82 | throw std::runtime_error("failed to MD5_Final()"); | 82 | throw std::runtime_error("failed to MD5_Final()"); |
83 | return rv; | 83 | return rv; |
84 | } | 84 | } |
85 | 85 | ||
86 | 86 | ||
87 | static void make_path_for_template(const std::string& p,mode_t m) { | 87 | static void make_path_for_template(const std::string& p,mode_t m) { |
88 | struct stat st; | 88 | struct stat st; |
89 | std::string pp; | 89 | std::string pp; |
90 | for(std::string::size_type sl=p.find('/',1); | 90 | for(std::string::size_type sl=p.find('/',1); |
91 | sl!=std::string::npos; | 91 | sl!=std::string::npos; |
92 | sl=p.find('/',sl+1)) { | 92 | sl=p.find('/',sl+1)) { |
93 | if(stat( (pp=p.substr(0,sl)).c_str() ,&st) | 93 | if(stat( (pp=p.substr(0,sl)).c_str() ,&st) |
94 | || !S_ISDIR(st.st_mode)) { | 94 | || !S_ISDIR(st.st_mode)) { |
95 | if(mkdir(pp.c_str(),m)) | 95 | if(mkdir(pp.c_str(),m)) |
96 | throw std::runtime_error("failed to mkdir()"); | 96 | throw std::runtime_error("failed to mkdir()"); |
97 | } | 97 | } |
98 | } | 98 | } |
99 | } | 99 | } |
100 | 100 | ||
101 | tmpdir_t::tmpdir_t(const std::string& dt) : dir(dt) { | 101 | tmpdir_t::tmpdir_t(const std::string& dt) : dir(dt) { |
102 | make_path_for_template(dt,0777); | 102 | make_path_for_template(dt,0777); |
103 | if(!mkdtemp((char*)dir.data())) | 103 | if(!mkdtemp((char*)dir.data())) |
104 | throw std::runtime_error("failed to mkdtmp()"); | 104 | throw std::runtime_error("failed to mkdtmp()"); |
105 | } | 105 | } |
106 | tmpdir_t::~tmpdir_t() { | 106 | tmpdir_t::~tmpdir_t() { |
107 | assert(!dir.empty()); | 107 | assert(!dir.empty()); |
108 | if(rmdir(dir.c_str())) { | 108 | if(rmdir(dir.c_str())) { |
109 | syslog(LOG_WARNING,"Failed to remove '%s' directory",dir.c_str()); | 109 | syslog(LOG_WARNING,"Failed to remove '%s' directory",dir.c_str()); |
110 | } | 110 | } |
111 | } | 111 | } |
112 | 112 | ||
113 | std::string tmpdir_t::get_file(const std::string& f) { | 113 | std::string tmpdir_t::get_file(const std::string& f) { |
114 | std::string::size_type ls = f.rfind('/'); | 114 | std::string::size_type ls = f.rfind('/'); |
115 | return dir+'/'+( | 115 | return dir+'/'+( |
116 | (ls==std::string::npos) | 116 | (ls==std::string::npos) |
117 | ? f | 117 | ? f |
118 | : f.substr(ls+1) | 118 | : f.substr(ls+1) |
119 | ); | 119 | ); |
120 | } | 120 | } |
121 | 121 | ||
122 | tarchive_t::tarchive_t(void *p,size_t s) : a(archive_read_new()), e(0) { | 122 | tarchive_t::tarchive_t(void *p,size_t s) : a(archive_read_new()), e(0) { |
123 | if(!a) throw std::runtime_error("failed to archive_read_new()"); | 123 | if(!a) throw std::runtime_error("failed to archive_read_new()"); |
124 | if(archive_read_support_format_tar(a)) { | 124 | if(archive_read_support_format_tar(a)) { |
125 | archive_read_finish(a); | 125 | archive_read_finish(a); |
126 | throw std::runtime_error("failed to archive_read_support_format_tar()"); | 126 | throw std::runtime_error("failed to archive_read_support_format_tar()"); |
127 | } | 127 | } |
128 | if(archive_read_open_memory(a,p,s)) { | 128 | if(archive_read_open_memory(a,p,s)) { |
129 | archive_read_finish(a); | 129 | archive_read_finish(a); |
130 | throw std::runtime_error("failed to archive_read_open_memory()"); | 130 | throw std::runtime_error("failed to archive_read_open_memory()"); |
131 | } | 131 | } |
132 | } | 132 | } |
133 | tarchive_t::~tarchive_t() { | 133 | tarchive_t::~tarchive_t() { |
134 | assert(a); | 134 | assert(a); |
135 | archive_read_finish(a); | 135 | archive_read_finish(a); |
136 | } | 136 | } |
137 | 137 | ||
138 | bool tarchive_t::read_next_header() { | 138 | bool tarchive_t::read_next_header() { |
139 | assert(a); | 139 | assert(a); |
140 | return archive_read_next_header(a,&e)==ARCHIVE_OK; | 140 | return archive_read_next_header(a,&e)==ARCHIVE_OK; |
141 | } | 141 | } |
142 | 142 | ||
143 | std::string tarchive_t::entry_pathname() { | 143 | std::string tarchive_t::entry_pathname() { |
144 | assert(a); assert(e); | 144 | assert(a); assert(e); |
145 | return archive_entry_pathname(e); | 145 | return archive_entry_pathname(e); |
146 | } | 146 | } |
147 | 147 | ||
148 | bool tarchive_t::read_data_into_fd(int fd) { | 148 | bool tarchive_t::read_data_into_fd(int fd) { |
149 | assert(a); | 149 | assert(a); |
150 | return archive_read_data_into_fd(a,fd)==ARCHIVE_OK; | 150 | return archive_read_data_into_fd(a,fd)==ARCHIVE_OK; |
151 | } | 151 | } |
152 | 152 | ||
153 | #pragma pack(1) | 153 | #pragma pack(1) |
154 | struct block512_t { | 154 | struct block512_t { |
155 | enum { words = 512 / sizeof(uint16_t) }; | 155 | enum { words = 512 / sizeof(uint16_t) }; |
156 | uint16_t data[words]; | 156 | uint16_t data[words]; |
157 | 157 | ||
158 | static uint16_t tcpcksum(block512_t& data) { | 158 | static uint16_t tcpcksum(block512_t& data) { |
159 | uint32_t sum = std::accumulate(data.data,data.data+words,0); | 159 | uint32_t sum = std::accumulate(data.data,data.data+words,0); |
160 | while(uint32_t hw = sum>>16) sum = (sum&0xffff)+hw; | 160 | while(uint32_t hw = sum>>16) sum = (sum&0xffff)+hw; |
161 | return ~sum; | 161 | return ~sum; |
162 | } | 162 | } |
163 | 163 | ||
164 | }; | 164 | }; |
165 | #pragma pack() | 165 | #pragma pack() |
166 | 166 | ||
167 | binary_t integrity_digest(const void *ptr,size_t size,const std::string& ukey) { | 167 | binary_t integrity_digest(const void *ptr,size_t size,const std::string& ukey) { |
168 | binary_t key; key.from_hex(ukey); | 168 | md5_digester rv; |
169 | std::vector<uint16_t> blksums; blksums.reserve(size/sizeof(block512_t)); | 169 | std::transform( (block512_t*)ptr, ((block512_t*)ptr)+size/sizeof(block512_t), |
170 | block512_t *db = (block512_t*)ptr, | 170 | rv.updater<uint16_t>(), block512_t::tcpcksum ); |
171 | *de = db + size/sizeof(block512_t); | 171 | rv.update( binary_t(ukey) ); |
172 | std::transform( db, de, std::back_inserter(blksums), block512_t::tcpcksum ); | 172 | return rv.final(); |
173 | binary_t subject; | ||
174 | subject.from_data((void*)&(blksums.front()),blksums.size()*sizeof(uint16_t)); | ||
175 | std::copy( key.begin(), key.end(), std::back_inserter(subject) ); | ||
176 | return subject.md5(); | ||
177 | } | 173 | } |