util.h 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389
  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 <string>
  40. #include <utility>
  41. #include <iosfwd>
  42. #include <ostream>
  43. #include <numeric>
  44. #include <map>
  45. #include <iomanip>
  46. #include <algorithm>
  47. #include <vector>
  48. #include "SharedHandle.h"
  49. #include "IntSequence.h"
  50. #include "a2time.h"
  51. #include "a2netcompat.h"
  52. #include "a2functional.h"
  53. namespace aria2 {
  54. class Randomizer;
  55. class BitfieldMan;
  56. class BinaryStream;
  57. class FileEntry;
  58. #define STRTOLL(X) strtoll(X, reinterpret_cast<char**>(0), 10)
  59. #define STRTOULL(X) strtoull(X, reinterpret_cast<char**>(0), 10)
  60. #define START_INDEX(OFFSET, PIECE_LENGTH) ((OFFSET)/(PIECE_LENGTH))
  61. #define END_INDEX(OFFSET, LENGTH, PIECE_LENGTH) (((OFFSET)+(LENGTH)-1)/(PIECE_LENGTH))
  62. #define DIV_FLOOR(X,Y) ((X)/(Y)+((X)%(Y)? 1:0))
  63. #ifdef WORDS_BIGENDIAN
  64. inline uint64_t ntoh64(uint64_t x) { return x; }
  65. inline uint64_t hton64(uint64_t x) { return x; }
  66. #else // !WORDS_BIGENDIAN
  67. inline uint64_t byteswap64(uint64_t x) {
  68. uint64_t v1 = ntohl(x & 0x00000000ffffffff);
  69. uint64_t v2 = ntohl(x >> 32);
  70. return (v1 << 32)|v2;
  71. }
  72. inline uint64_t ntoh64(uint64_t x) { return byteswap64(x); }
  73. inline uint64_t hton64(uint64_t x) { return byteswap64(x); }
  74. #endif // !WORDS_BIGENDIAN
  75. namespace util {
  76. void split(std::pair<std::string, std::string>& hp,
  77. const std::string& src, char delim);
  78. std::pair<std::string, std::string>
  79. split(const std::string& src, const std::string& delims);
  80. template<typename T>
  81. std::string uitos(T value, bool comma = false)
  82. {
  83. std::string str;
  84. if(value == 0) {
  85. str = "0";
  86. return str;
  87. }
  88. unsigned int count = 0;
  89. while(value) {
  90. ++count;
  91. char digit = value%10+'0';
  92. if(comma && count > 3 && count%3 == 1) {
  93. str += ',';
  94. }
  95. str += digit;
  96. value /= 10;
  97. }
  98. std::reverse(str.begin(), str.end());
  99. return str;
  100. }
  101. std::string itos(int64_t value, bool comma = false);
  102. /**
  103. * Computes difference in micro-seconds between tv1 and tv2,
  104. * assuming tv1 is newer than tv2.
  105. * If tv1 is older than tv2, then this method returns 0.
  106. */
  107. int64_t difftv(struct timeval tv1, struct timeval tv2);
  108. int32_t difftvsec(struct timeval tv1, struct timeval tv2);
  109. extern const std::string DEFAULT_TRIM_CHARSET;
  110. std::string trim(const std::string& src,
  111. const std::string& trimCharset = DEFAULT_TRIM_CHARSET);
  112. void trimSelf(std::string& str,
  113. const std::string& trimCharset = DEFAULT_TRIM_CHARSET);
  114. bool startsWith(const std::string& target, const std::string& part);
  115. bool endsWith(const std::string& target, const std::string& part);
  116. std::string replace(const std::string& target, const std::string& oldstr, const std::string& newstr);
  117. std::string percentEncode(const unsigned char* target, size_t len);
  118. std::string percentEncode(const std::string& target);
  119. bool inRFC3986ReservedChars(const char c);
  120. bool inRFC3986UnreservedChars(const char c);
  121. std::string percentDecode(const std::string& target);
  122. std::string torrentPercentEncode(const unsigned char* target, size_t len);
  123. std::string torrentPercentEncode(const std::string& target);
  124. std::string toHex(const unsigned char* src, size_t len);
  125. std::string toHex(const char* src, size_t len);
  126. std::string toHex(const std::string& src);
  127. // Converts hexadecimal ascii string 'src' into packed binary form and
  128. // return the result. If src is not well formed, then empty string is
  129. // returned.
  130. std::string fromHex(const std::string& src);
  131. FILE* openFile(const std::string& filename, const std::string& mode);
  132. bool isPowerOf(int num, int base);
  133. std::string secfmt(time_t sec);
  134. int32_t parseInt(const std::string& s, int32_t base = 10);
  135. uint32_t parseUInt(const std::string& s, int base = 10);
  136. bool parseUIntNoThrow(uint32_t& result, const std::string& s, int base = 10);
  137. int64_t parseLLInt(const std::string& s, int32_t base = 10);
  138. uint64_t parseULLInt(const std::string& s, int base = 10);
  139. IntSequence parseIntRange(const std::string& src);
  140. // Parses string which specifies the range of piece index for higher
  141. // priority and appends those indexes into result. The input string
  142. // src can contain 2 keywords "head" and "tail". To include both
  143. // keywords, they must be separated by comma. "head" means the pieces
  144. // where the first byte of each file sits. "tail" means the pieces
  145. // where the last byte of each file sits. These keywords can take one
  146. // parameter, SIZE. For example, if "head=SIZE" is specified, pieces
  147. // in the range of first SIZE bytes of each file get higher
  148. // priority. SIZE can include K or M(1K = 1024, 1M = 1024K).
  149. // If SIZE is omitted, SIZE=defaultSize is used.
  150. //
  151. // sample: head=512K,tail=512K
  152. void parsePrioritizePieceRange
  153. (std::vector<size_t>& result, const std::string& src,
  154. const std::vector<SharedHandle<FileEntry> >& fileEntries,
  155. size_t pieceLength,
  156. uint64_t defaultSize = 1048576 /* 1MiB */);
  157. // Converts ISO/IEC 8859-1 string src to utf-8.
  158. std::string iso8859ToUtf8(const std::string& src);
  159. std::string getContentDispositionFilename(const std::string& header);
  160. std::string randomAlpha(size_t length,
  161. const SharedHandle<Randomizer>& randomizer);
  162. std::string toUpper(const std::string& src);
  163. std::string toLower(const std::string& src);
  164. bool isNumericHost(const std::string& name);
  165. void setGlobalSignalHandler(int signal, void (*handler)(int), int flags);
  166. std::string getHomeDir();
  167. int64_t getRealSize(const std::string& sizeWithUnit);
  168. std::string abbrevSize(int64_t size);
  169. template<typename InputIterator>
  170. void toStream
  171. (InputIterator first, InputIterator last, std::ostream& os)
  172. {
  173. os << _("Files:") << "\n";
  174. os << "idx|path/length" << "\n";
  175. os << "===+===========================================================================" << "\n";
  176. int32_t count = 1;
  177. for(; first != last; ++first, ++count) {
  178. os << std::setw(3) << count << "|" << (*first)->getPath() << "\n";
  179. os << " |" << util::abbrevSize((*first)->getLength()) << "B ("
  180. << util::uitos((*first)->getLength(), true) << ")\n";
  181. os << "---+---------------------------------------------------------------------------" << "\n";
  182. }
  183. }
  184. void sleep(long seconds);
  185. void usleep(long microseconds);
  186. bool isNumber(const std::string& what);
  187. bool isHexDigit(const char c);
  188. bool isHexDigit(const std::string& s);
  189. bool isLowercase(const std::string& what);
  190. bool isUppercase(const std::string& what);
  191. /**
  192. * Converts alphabets to unsigned int, assuming alphabets as a base 26
  193. * integer and 'a' or 'A' is 0.
  194. * This function assumes alphabets includes only a-z.
  195. * Upper case are allowed but all letters must be upper case.
  196. * If overflow occurs, returns 0.
  197. */
  198. unsigned int alphaToNum(const std::string& alphabets);
  199. void mkdirs(const std::string& dirpath);
  200. void convertBitfield(BitfieldMan* dest, const BitfieldMan* src);
  201. // binaryStream has to be opened before calling this function.
  202. std::string toString(const SharedHandle<BinaryStream>& binaryStream);
  203. #ifdef HAVE_POSIX_MEMALIGN
  204. void* allocateAlignedMemory(size_t alignment, size_t size);
  205. #endif // HAVE_POSIX_MEMALIGN
  206. std::pair<std::string, uint16_t>
  207. getNumericNameInfo(const struct sockaddr* sockaddr, socklen_t len);
  208. std::string htmlEscape(const std::string& src);
  209. // Joins path element specified in [first, last). If ".." is found,
  210. // it eats the previous element if it exists. If "." is found, it
  211. // is just ignored and it is not appeared in the result.
  212. template<typename InputIterator>
  213. std::string joinPath(InputIterator first, InputIterator last)
  214. {
  215. std::vector<std::string> elements;
  216. for(;first != last; ++first) {
  217. if(*first == "..") {
  218. if(!elements.empty()) {
  219. elements.pop_back();
  220. }
  221. } else if(*first == ".") {
  222. // do nothing
  223. } else {
  224. elements.push_back(*first);
  225. }
  226. }
  227. return strjoin(elements.begin(), elements.end(), "/");
  228. }
  229. // Parses INDEX=PATH format string. INDEX must be an unsigned
  230. // integer.
  231. std::map<size_t, std::string>::value_type
  232. parseIndexPath(const std::string& line);
  233. std::map<size_t, std::string> createIndexPathMap(std::istream& i);
  234. /**
  235. * Take a string src which is a delimited list and add its elements
  236. * into result. result is stored in out.
  237. */
  238. template<typename OutputIterator>
  239. OutputIterator split(const std::string& src, OutputIterator out,
  240. const std::string& delims, bool doTrim = false,
  241. bool allowEmpty = false)
  242. {
  243. std::string::size_type p = 0;
  244. while(1) {
  245. std::string::size_type np = src.find_first_of(delims, p);
  246. if(np == std::string::npos) {
  247. std::string term = src.substr(p);
  248. if(doTrim) {
  249. term = util::trim(term);
  250. }
  251. if(allowEmpty || !term.empty()) {
  252. *out = term;
  253. ++out;
  254. }
  255. break;
  256. }
  257. std::string term = src.substr(p, np-p);
  258. if(doTrim) {
  259. term = util::trim(term);
  260. }
  261. p = np+1;
  262. if(allowEmpty || !term.empty()) {
  263. *out = term;
  264. ++out;
  265. }
  266. }
  267. return out;
  268. }
  269. void generateRandomData(unsigned char* data, size_t length);
  270. // Saves data to file whose name is filename. If overwrite is true,
  271. // existing file is overwritten. Otherwise, this function doesn't do
  272. // nothing. If data is saved successfully, return true. Otherwise
  273. // returns false.
  274. bool saveAs
  275. (const std::string& filename, const std::string& data, bool overwrite=false);
  276. // Prepend dir to relPath. If dir is empty, it prepends "." to relPath.
  277. //
  278. // dir = "/dir", relPath = "foo" => "/dir/foo"
  279. // dir = "", relPath = "foo" => "./foo"
  280. // dir = "/", relPath = "foo" => "/foo"
  281. std::string applyDir(const std::string& dir, const std::string& relPath);
  282. // In HTTP/FTP, file name is file component in URI. In HTTP, filename
  283. // may be a value of Content-Disposition header. They are likely
  284. // percent encoded. If they contains, for example, %2F, when decoded,
  285. // basename contains dir component. This should be avoided. This
  286. // function is created to fix these issues. This function expects src
  287. // should be non-percent-encoded basename. Currently, this function
  288. // replaces '/' with '_' and result string is passed to escapePath()
  289. // function and its result is returned.
  290. std::string fixTaintedBasename(const std::string& src);
  291. // Generates 20 bytes random key and store it to the address pointed
  292. // by key. Caller must allocate at least 20 bytes for generated key.
  293. void generateRandomKey(unsigned char* key);
  294. // Returns true is given numeric ipv4addr is in Private Address Space.
  295. bool inPrivateAddress(const std::string& ipv4addr);
  296. // Returns true if s contains directory traversal path component such
  297. // as '..' or it contains null or control character which may fool
  298. // user.
  299. bool detectDirTraversal(const std::string& s);
  300. // Replaces null(0x00) and control character(0x01-0x1f) with '_'. If
  301. // __MINGW32__ is defined, following characters are also replaced with
  302. // '_': '"', '*', ':', '<', '>', '?', '\', '|'.
  303. std::string escapePath(const std::string& s);
  304. } // namespace util
  305. } // namespace aria2
  306. #endif // _D_UTIL_H_