Util.h 9.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321
  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 <deque>
  42. #include <iosfwd>
  43. #include <numeric>
  44. #include <map>
  45. #include "SharedHandle.h"
  46. #include "IntSequence.h"
  47. #include "a2time.h"
  48. #include "a2netcompat.h"
  49. #include "a2functional.h"
  50. namespace aria2 {
  51. class Randomizer;
  52. class BitfieldMan;
  53. class BinaryStream;
  54. class FileEntry;
  55. #define STRTOLL(X) strtoll(X, (char**)0, 10)
  56. #define STRTOULL(X) strtoull(X, (char**)0, 10)
  57. #define START_INDEX(OFFSET, PIECE_LENGTH) ((OFFSET)/(PIECE_LENGTH))
  58. #define END_INDEX(OFFSET, LENGTH, PIECE_LENGTH) (((OFFSET)+(LENGTH)-1)/(PIECE_LENGTH))
  59. #define DIV_FLOOR(X,Y) ((X)/(Y)+((X)%(Y)? 1:0))
  60. #ifdef WORDS_BIGENDIAN
  61. inline uint64_t ntoh64(uint64_t x) { return x; }
  62. inline uint64_t hton64(uint64_t x) { return x; }
  63. #else // !WORDS_BIGENDIAN
  64. inline uint64_t byteswap64(uint64_t x) {
  65. uint64_t v1 = ntohl(x & 0x00000000ffffffff);
  66. uint64_t v2 = ntohl(x >> 32);
  67. return (v1 << 32)|v2;
  68. }
  69. inline uint64_t ntoh64(uint64_t x) { return byteswap64(x); }
  70. inline uint64_t hton64(uint64_t x) { return byteswap64(x); }
  71. #endif // !WORDS_BIGENDIAN
  72. class Util {
  73. public:
  74. static void split(std::pair<std::string, std::string>& hp,
  75. const std::string& src, char delim);
  76. static std::pair<std::string, std::string>
  77. split(const std::string& src, const std::string& delims);
  78. template<typename T>
  79. static std::string uitos(T value, bool comma = false)
  80. {
  81. std::string str;
  82. if(value == 0) {
  83. str = "0";
  84. return str;
  85. }
  86. unsigned int count = 0;
  87. while(value) {
  88. ++count;
  89. char digit = value%10+'0';
  90. str.insert(str.begin(), digit);
  91. value /= 10;
  92. if(comma && count > 3 && count%3 == 1) {
  93. str.insert(str.begin()+1, ',');
  94. }
  95. }
  96. return str;
  97. }
  98. template<typename T>
  99. static std::string itos(T value, bool comma = false)
  100. {
  101. bool flag = false;
  102. if(value < 0) {
  103. flag = true;
  104. value = -value;
  105. }
  106. std::string str = uitos(value, comma);
  107. if(flag) {
  108. str.insert(str.begin(), '-');
  109. }
  110. return str;
  111. }
  112. /**
  113. * Computes difference in micro-seconds between tv1 and tv2,
  114. * assuming tv1 is newer than tv2.
  115. * If tv1 is older than tv2, then this method returns 0.
  116. */
  117. static int64_t difftv(struct timeval tv1, struct timeval tv2);
  118. static int32_t difftvsec(struct timeval tv1, struct timeval tv2);
  119. /**
  120. * Take a string src which is a deliminated list and add its elements
  121. * into result. result is not cleared before conversion begins.
  122. */
  123. static void slice(std::deque<std::string>& result, const std::string& src,
  124. char delim, bool trim = false);
  125. static const std::string DEFAULT_TRIM_CHARSET;
  126. static std::string trim(const std::string& src,
  127. const std::string& trimCharset = DEFAULT_TRIM_CHARSET);
  128. static void trimSelf(std::string& str,
  129. const std::string& trimCharset = DEFAULT_TRIM_CHARSET);
  130. static bool startsWith(const std::string& target, const std::string& part);
  131. static bool endsWith(const std::string& target, const std::string& part);
  132. static std::string replace(const std::string& target, const std::string& oldstr, const std::string& newstr);
  133. static std::string urlencode(const unsigned char* target, size_t len);
  134. static std::string urlencode(const std::string& target)
  135. {
  136. return urlencode((const unsigned char*)target.c_str(), target.size());
  137. }
  138. static bool inRFC3986ReservedChars(const char c);
  139. static bool inRFC3986UnreservedChars(const char c);
  140. static std::string urldecode(const std::string& target);
  141. static std::string torrentUrlencode(const unsigned char* target, size_t len);
  142. static std::string torrentUrlencode(const std::string& target)
  143. {
  144. return torrentUrlencode(reinterpret_cast<const unsigned char*>(target.c_str()),
  145. target.size());
  146. }
  147. static std::string toHex(const unsigned char* src, size_t len);
  148. static std::string toHex(const char* src, size_t len)
  149. {
  150. return toHex(reinterpret_cast<const unsigned char*>(src), len);
  151. }
  152. static std::string toHex(const std::string& src)
  153. {
  154. return toHex(reinterpret_cast<const unsigned char*>(src.c_str()), src.size());
  155. }
  156. static FILE* openFile(const std::string& filename, const std::string& mode);
  157. static void fileCopy(const std::string& destFile, const std::string& src);
  158. static void rangedFileCopy(const std::string& destFile, const std::string& src, off_t srcOffset, uint64_t length);
  159. static bool isPowerOf(int num, int base);
  160. static std::string secfmt(time_t sec);
  161. static size_t expandBuffer(char** pbuf, size_t curLength, size_t newLength);
  162. static void unfoldRange(const std::string& src, std::deque<int>& range);
  163. static int32_t parseInt(const std::string& s, int32_t base = 10);
  164. static uint32_t parseUInt(const std::string& s, int base = 10);
  165. static int64_t parseLLInt(const std::string& s, int32_t base = 10);
  166. static uint64_t parseULLInt(const std::string& s, int base = 10);
  167. static IntSequence parseIntRange(const std::string& src);
  168. // this function temporarily put here
  169. static std::string getContentDispositionFilename(const std::string& header);
  170. static unsigned int countBit(uint32_t n);
  171. static std::string randomAlpha(size_t length,
  172. const SharedHandle<Randomizer>& randomizer);
  173. static std::string toUpper(const std::string& src);
  174. static std::string toLower(const std::string& src);
  175. static bool isNumbersAndDotsNotation(const std::string& name);
  176. static void setGlobalSignalHandler(int signal, void (*handler)(int), int flags);
  177. static void indexRange(size_t& startIndex, size_t& endIndex,
  178. off_t offset,
  179. size_t srcLength, size_t destLength);
  180. static std::string getHomeDir();
  181. static int64_t getRealSize(const std::string& sizeWithUnit);
  182. static std::string abbrevSize(int64_t size);
  183. /**
  184. * Parses given httpTimeFormat and returns seconds ellapsed since epoc.
  185. * The available format is "%a, %Y-%m-%d %H:%M:%S GMT".
  186. * If specified date is later than "Tue, 2038-01-19 3:14:7 GMT",
  187. * this function returns INT32_MAX.
  188. * This function also cannot handle prior 1900-1-1 0:0:0 GMT.
  189. * If parse operation is failed, then return -1.
  190. */
  191. static time_t httpGMT(const std::string& httpTimeFormat);
  192. static void toStream(std::ostream& os,
  193. const std::deque<SharedHandle<FileEntry> >& entries);
  194. static void sleep(long seconds);
  195. static void usleep(long microseconds);
  196. static bool isNumber(const std::string& what);
  197. static bool isLowercase(const std::string& what);
  198. static bool isUppercase(const std::string& what);
  199. /**
  200. * Converts alphabets to unsigned int, assuming alphabets as a base 26
  201. * integer and 'a' or 'A' is 0.
  202. * This function assumes alphabets includes only a-z.
  203. * Upper case are allowed but all letters must be upper case.
  204. * If overflow occurs, returns 0.
  205. */
  206. static unsigned int alphaToNum(const std::string& alphabets);
  207. static void mkdirs(const std::string& dirpath);
  208. static void convertBitfield(BitfieldMan* dest, const BitfieldMan* src);
  209. // binaryStream has to be opened before calling this function.
  210. static std::string toString(const SharedHandle<BinaryStream>& binaryStream);
  211. #ifdef HAVE_POSIX_MEMALIGN
  212. static void* allocateAlignedMemory(size_t alignment, size_t size);
  213. #endif // HAVE_POSIX_MEMALIGN
  214. static std::pair<std::string, uint16_t>
  215. getNumericNameInfo(const struct sockaddr* sockaddr, socklen_t len);
  216. static std::string htmlEscape(const std::string& src);
  217. // Joins path element specified in [first, last). If ".." is found,
  218. // it eats the previous element if it exists. If "." is found, it
  219. // is just ignored and it is not appeared in the result.
  220. template<typename InputIterator>
  221. static std::string joinPath(InputIterator first, InputIterator last)
  222. {
  223. std::deque<std::string> elements;
  224. for(;first != last; ++first) {
  225. if(*first == "..") {
  226. if(!elements.empty()) {
  227. elements.pop_back();
  228. }
  229. } else if(*first == ".") {
  230. // do nothing
  231. } else {
  232. elements.push_back(*first);
  233. }
  234. }
  235. if(elements.empty()) {
  236. return "";
  237. }
  238. return std::accumulate(elements.begin()+1, elements.end(), elements[0],
  239. Concat("/"));
  240. }
  241. // Parses INDEX=PATH format string. INDEX must be an unsigned
  242. // integer.
  243. static std::map<size_t, std::string>::value_type
  244. parseIndexPath(const std::string& line);
  245. static std::map<size_t, std::string> createIndexPathMap(std::istream& i);
  246. };
  247. } // namespace aria2
  248. #endif // _D_UTIL_H_