Util.h 9.5 KB

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