util.h 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444
  1. /* <!-- copyright */
  2. /*
  3. * aria2 - The high speed download utility
  4. *
  5. * Copyright (C) 2006 Tatsuhiro Tsujikawa
  6. *
  7. * This program is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License as published by
  9. * the Free Software Foundation; either version 2 of the License, or
  10. * (at your option) any later version.
  11. *
  12. * This program is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License
  18. * along with this program; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. *
  21. * In addition, as a special exception, the copyright holders give
  22. * permission to link the code of portions of this program with the
  23. * OpenSSL library under certain conditions as described in each
  24. * individual source file, and distribute linked combinations
  25. * including the two.
  26. * You must obey the GNU General Public License in all respects
  27. * for all of the code used other than OpenSSL. If you modify
  28. * file(s) with this exception, you may extend this exception to your
  29. * version of the file(s), but you are not obligated to do so. If you
  30. * do not wish to do so, delete this exception statement from your
  31. * version. If you delete this exception statement from all source
  32. * files in the program, then also delete it here.
  33. */
  34. /* copyright --> */
  35. #ifndef D_UTIL_H
  36. #define D_UTIL_H
  37. #include "common.h"
  38. #include <sys/time.h>
  39. #include <cstdio>
  40. #include <string>
  41. #include <utility>
  42. #include <iosfwd>
  43. #include <ostream>
  44. #include <numeric>
  45. #include <map>
  46. #include <iomanip>
  47. #include <algorithm>
  48. #include <vector>
  49. #include "SharedHandle.h"
  50. #include "IntSequence.h"
  51. #include "a2time.h"
  52. #include "a2netcompat.h"
  53. #include "a2functional.h"
  54. namespace aria2 {
  55. class Randomizer;
  56. class BitfieldMan;
  57. class BinaryStream;
  58. class FileEntry;
  59. class RequestGroup;
  60. class Option;
  61. #define STRTOLL(X) strtoll(X, reinterpret_cast<char**>(0), 10)
  62. #define STRTOULL(X) strtoull(X, reinterpret_cast<char**>(0), 10)
  63. #define START_INDEX(OFFSET, PIECE_LENGTH) ((OFFSET)/(PIECE_LENGTH))
  64. #define END_INDEX(OFFSET, LENGTH, PIECE_LENGTH) (((OFFSET)+(LENGTH)-1)/(PIECE_LENGTH))
  65. #define DIV_FLOOR(X,Y) ((X)/(Y)+((X)%(Y)? 1:0))
  66. #ifdef WORDS_BIGENDIAN
  67. inline uint64_t ntoh64(uint64_t x) { return x; }
  68. inline uint64_t hton64(uint64_t x) { return x; }
  69. #else // !WORDS_BIGENDIAN
  70. inline uint64_t byteswap64(uint64_t x) {
  71. uint64_t v1 = ntohl(x & 0x00000000ffffffffllu);
  72. uint64_t v2 = ntohl(x >> 32);
  73. return (v1 << 32)|v2;
  74. }
  75. inline uint64_t ntoh64(uint64_t x) { return byteswap64(x); }
  76. inline uint64_t hton64(uint64_t x) { return byteswap64(x); }
  77. #endif // !WORDS_BIGENDIAN
  78. namespace util {
  79. void divide
  80. (std::pair<std::string, std::string>& hp, const std::string& src, char delim);
  81. template<typename T>
  82. std::string uitos(T value, bool comma = false)
  83. {
  84. std::string str;
  85. if(value == 0) {
  86. str = "0";
  87. return str;
  88. }
  89. unsigned int count = 0;
  90. while(value) {
  91. ++count;
  92. char digit = value%10+'0';
  93. if(comma && count > 3 && count%3 == 1) {
  94. str += ',';
  95. }
  96. str += digit;
  97. value /= 10;
  98. }
  99. std::reverse(str.begin(), str.end());
  100. return str;
  101. }
  102. std::string itos(int64_t value, bool comma = false);
  103. /**
  104. * Computes difference in micro-seconds between tv1 and tv2,
  105. * assuming tv1 is newer than tv2.
  106. * If tv1 is older than tv2, then this method returns 0.
  107. */
  108. int64_t difftv(struct timeval tv1, struct timeval tv2);
  109. int32_t difftvsec(struct timeval tv1, struct timeval tv2);
  110. extern const std::string DEFAULT_STRIP_CHARSET;
  111. template<typename InputIterator>
  112. std::string stripIter
  113. (InputIterator first, InputIterator last,
  114. const std::string& chars = DEFAULT_STRIP_CHARSET)
  115. {
  116. if(std::distance(first, last) == 0) {
  117. return A2STR::NIL;
  118. }
  119. for(; first != last &&
  120. std::find(chars.begin(), chars.end(), *first) != chars.end(); ++first);
  121. if(first == last) {
  122. return A2STR::NIL;
  123. }
  124. InputIterator left = last-1;
  125. for(; left != first &&
  126. std::find(chars.begin(), chars.end(), *left) != chars.end(); --left);
  127. return std::string(first, left+1);
  128. }
  129. std::string strip
  130. (const std::string& str, const std::string& chars = DEFAULT_STRIP_CHARSET);
  131. bool startsWith(const std::string& target, const std::string& part);
  132. bool endsWith(const std::string& target, const std::string& part);
  133. std::string replace(const std::string& target, const std::string& oldstr, const std::string& newstr);
  134. std::string percentEncode(const unsigned char* target, size_t len);
  135. std::string percentEncode(const std::string& target);
  136. bool inRFC3986ReservedChars(const char c);
  137. bool inRFC3986UnreservedChars(const char c);
  138. bool isUtf8(const std::string& str);
  139. std::string percentDecode(const std::string& target);
  140. std::string torrentPercentEncode(const unsigned char* target, size_t len);
  141. std::string torrentPercentEncode(const std::string& target);
  142. std::string toHex(const unsigned char* src, size_t len);
  143. std::string toHex(const char* src, size_t len);
  144. std::string toHex(const std::string& src);
  145. // Converts hexadecimal ascii string 'src' into packed binary form and
  146. // return the result. If src is not well formed, then empty string is
  147. // returned.
  148. std::string fromHex(const std::string& src);
  149. FILE* openFile(const std::string& filename, const std::string& mode);
  150. bool isPowerOf(int num, int base);
  151. std::string secfmt(time_t sec);
  152. int32_t parseInt(const std::string& s, int32_t base = 10);
  153. bool parseIntNoThrow(int32_t& result, const std::string& s, int base = 10);
  154. uint32_t parseUInt(const std::string& s, int base = 10);
  155. bool parseUIntNoThrow(uint32_t& result, const std::string& s, int base = 10);
  156. int64_t parseLLInt(const std::string& s, int32_t base = 10);
  157. bool parseLLIntNoThrow(int64_t& result, const std::string& s, int base = 10);
  158. uint64_t parseULLInt(const std::string& s, int base = 10);
  159. IntSequence parseIntRange(const std::string& src);
  160. // Parses string which specifies the range of piece index for higher
  161. // priority and appends those indexes into result. The input string
  162. // src can contain 2 keywords "head" and "tail". To include both
  163. // keywords, they must be separated by comma. "head" means the pieces
  164. // where the first byte of each file sits. "tail" means the pieces
  165. // where the last byte of each file sits. These keywords can take one
  166. // parameter, SIZE. For example, if "head=SIZE" is specified, pieces
  167. // in the range of first SIZE bytes of each file get higher
  168. // priority. SIZE can include K or M(1K = 1024, 1M = 1024K).
  169. // If SIZE is omitted, SIZE=defaultSize is used.
  170. //
  171. // sample: head=512K,tail=512K
  172. void parsePrioritizePieceRange
  173. (std::vector<size_t>& result, const std::string& src,
  174. const std::vector<SharedHandle<FileEntry> >& fileEntries,
  175. size_t pieceLength,
  176. uint64_t defaultSize = 1048576 /* 1MiB */);
  177. // Converts ISO/IEC 8859-1 string src to utf-8.
  178. std::string iso8859ToUtf8(const std::string& src);
  179. std::string getContentDispositionFilename(const std::string& header);
  180. std::string randomAlpha(size_t length,
  181. const SharedHandle<Randomizer>& randomizer);
  182. std::string toUpper(const std::string& src);
  183. std::string toLower(const std::string& src);
  184. void uppercase(std::string& s);
  185. void lowercase(std::string& s);
  186. bool isNumericHost(const std::string& name);
  187. void setGlobalSignalHandler(int signal, void (*handler)(int), int flags);
  188. std::string getHomeDir();
  189. int64_t getRealSize(const std::string& sizeWithUnit);
  190. std::string abbrevSize(int64_t size);
  191. template<typename InputIterator>
  192. void toStream
  193. (InputIterator first, InputIterator last, std::ostream& os)
  194. {
  195. os << _("Files:") << "\n";
  196. os << "idx|path/length" << "\n";
  197. os << "===+===========================================================================" << "\n";
  198. int32_t count = 1;
  199. for(; first != last; ++first, ++count) {
  200. os << std::setw(3) << count << "|" << (*first)->getPath() << "\n";
  201. os << " |" << util::abbrevSize((*first)->getLength()) << "B ("
  202. << util::uitos((*first)->getLength(), true) << ")\n";
  203. os << "---+---------------------------------------------------------------------------" << "\n";
  204. }
  205. }
  206. void sleep(long seconds);
  207. void usleep(long microseconds);
  208. bool isNumber(const std::string& what);
  209. bool isDigit(const char c);
  210. bool isHexDigit(const char c);
  211. bool isHexDigit(const std::string& s);
  212. bool isLowercase(const std::string& what);
  213. bool isUppercase(const std::string& what);
  214. /**
  215. * Converts alphabets to unsigned int, assuming alphabets as a base 26
  216. * integer and 'a' or 'A' is 0.
  217. * This function assumes alphabets includes only a-z.
  218. * Upper case are allowed but all letters must be upper case.
  219. * If overflow occurs, returns 0.
  220. */
  221. unsigned int alphaToNum(const std::string& alphabets);
  222. void mkdirs(const std::string& dirpath);
  223. void convertBitfield(BitfieldMan* dest, const BitfieldMan* src);
  224. // binaryStream has to be opened before calling this function.
  225. std::string toString(const SharedHandle<BinaryStream>& binaryStream);
  226. #ifdef HAVE_POSIX_MEMALIGN
  227. void* allocateAlignedMemory(size_t alignment, size_t size);
  228. #endif // HAVE_POSIX_MEMALIGN
  229. std::pair<std::string, uint16_t>
  230. getNumericNameInfo(const struct sockaddr* sockaddr, socklen_t len);
  231. std::string htmlEscape(const std::string& src);
  232. // Joins path element specified in [first, last). If ".." is found,
  233. // it eats the previous element if it exists. If "." is found, it
  234. // is just ignored and it is not appeared in the result.
  235. template<typename InputIterator>
  236. std::string joinPath(InputIterator first, InputIterator last)
  237. {
  238. std::vector<std::string> elements;
  239. for(;first != last; ++first) {
  240. if(*first == "..") {
  241. if(!elements.empty()) {
  242. elements.pop_back();
  243. }
  244. } else if(*first == ".") {
  245. // do nothing
  246. } else {
  247. elements.push_back(*first);
  248. }
  249. }
  250. return strjoin(elements.begin(), elements.end(), "/");
  251. }
  252. // Parses INDEX=PATH format string. INDEX must be an unsigned
  253. // integer.
  254. std::map<size_t, std::string>::value_type
  255. parseIndexPath(const std::string& line);
  256. std::map<size_t, std::string> createIndexPathMap(std::istream& i);
  257. /**
  258. * Take a string src which is a delimited list and add its elements
  259. * into result. result is stored in out.
  260. */
  261. template<typename OutputIterator>
  262. OutputIterator split(const std::string& src, OutputIterator out,
  263. const std::string& delims, bool doStrip = false,
  264. bool allowEmpty = false)
  265. {
  266. std::string::const_iterator first = src.begin();
  267. std::string::const_iterator last = src.end();
  268. for(std::string::const_iterator i = first; i != last;) {
  269. std::string::const_iterator j = i;
  270. for(; j != last &&
  271. std::find(delims.begin(), delims.end(), *j) == delims.end(); ++j);
  272. std::string t = doStrip?util::stripIter(i, j):std::string(i, j);
  273. if(allowEmpty || !t.empty()) {
  274. *out++ = t;
  275. }
  276. i = j;
  277. if(j != last) {
  278. ++i;
  279. }
  280. }
  281. if(allowEmpty &&
  282. (src.empty() ||
  283. std::find(delims.begin(), delims.end(),
  284. src[src.size()-1]) != delims.end())) {
  285. *out++ = A2STR::NIL;
  286. }
  287. return out;
  288. }
  289. void generateRandomData(unsigned char* data, size_t length);
  290. // Saves data to file whose name is filename. If overwrite is true,
  291. // existing file is overwritten. Otherwise, this function doesn't do
  292. // nothing. If data is saved successfully, return true. Otherwise
  293. // returns false.
  294. bool saveAs
  295. (const std::string& filename, const std::string& data, bool overwrite=false);
  296. // Prepend dir to relPath. If dir is empty, it prepends "." to relPath.
  297. //
  298. // dir = "/dir", relPath = "foo" => "/dir/foo"
  299. // dir = "", relPath = "foo" => "./foo"
  300. // dir = "/", relPath = "foo" => "/foo"
  301. std::string applyDir(const std::string& dir, const std::string& relPath);
  302. // In HTTP/FTP, file name is file component in URI. In HTTP, filename
  303. // may be a value of Content-Disposition header. They are likely
  304. // percent encoded. If they contains, for example, %2F, when decoded,
  305. // basename contains dir component. This should be avoided. This
  306. // function is created to fix these issues. This function expects src
  307. // should be non-percent-encoded basename. Currently, this function
  308. // replaces '/' with '_' and result string is passed to escapePath()
  309. // function and its result is returned.
  310. std::string fixTaintedBasename(const std::string& src);
  311. // Generates 20 bytes random key and store it to the address pointed
  312. // by key. Caller must allocate at least 20 bytes for generated key.
  313. void generateRandomKey(unsigned char* key);
  314. // Returns true is given numeric ipv4addr is in Private Address Space.
  315. bool inPrivateAddress(const std::string& ipv4addr);
  316. // Returns true if s contains directory traversal path component such
  317. // as '..' or it contains null or control character which may fool
  318. // user.
  319. bool detectDirTraversal(const std::string& s);
  320. // Replaces null(0x00) and control character(0x01-0x1f) with '_'. If
  321. // __MINGW32__ is defined, following characters are also replaced with
  322. // '_': '"', '*', ':', '<', '>', '?', '\', '|'.
  323. std::string escapePath(const std::string& s);
  324. // Stores network address of numeric IPv4 address ip using CIDR bits
  325. // into in. On success, returns true. Otherwise returns false.
  326. bool getCidrPrefix(struct in_addr& in, const std::string& ip, int bits);
  327. // Returns true if ip1 and ip2 are in the same CIDR block.
  328. bool inSameCidrBlock(const std::string& ip1, const std::string& ip2, int bits);
  329. void removeMetalinkContentTypes(const SharedHandle<RequestGroup>& group);
  330. // No throw
  331. void executeHookByOptName
  332. (const SharedHandle<RequestGroup>& group, const Option* option,
  333. const std::string& opt);
  334. // No throw
  335. void executeHookByOptName
  336. (const RequestGroup* group, const Option* option, const std::string& opt);
  337. std::string createSafePath(const std::string& dir, const std::string& filename);
  338. std::string encodeNonUtf8(const std::string& s);
  339. // Create string safely. If str is NULL, returns empty string.
  340. // Otherwise, returns std::string(str).
  341. std::string makeString(const char* str);
  342. // This function is basically the same with strerror(errNum) but when
  343. // strerror returns NULL, this function returns empty string.
  344. std::string safeStrerror(int errNum);
  345. } // namespace util
  346. } // namespace aria2
  347. #endif // D_UTIL_H