util.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377
  1. /*
  2. * random utiility code, for bcache but in theory not specific to bcache
  3. *
  4. * Copyright 2010, 2011 Kent Overstreet <kent.overstreet@gmail.com>
  5. * Copyright 2012 Google, Inc.
  6. */
  7. #include <linux/bio.h>
  8. #include <linux/blkdev.h>
  9. #include <linux/ctype.h>
  10. #include <linux/debugfs.h>
  11. #include <linux/module.h>
  12. #include <linux/seq_file.h>
  13. #include <linux/types.h>
  14. #include "util.h"
  15. #define simple_strtoint(c, end, base) simple_strtol(c, end, base)
  16. #define simple_strtouint(c, end, base) simple_strtoul(c, end, base)
  17. #define STRTO_H(name, type) \
  18. int bch_ ## name ## _h(const char *cp, type *res) \
  19. { \
  20. int u = 0; \
  21. char *e; \
  22. type i = simple_ ## name(cp, &e, 10); \
  23. \
  24. switch (tolower(*e)) { \
  25. default: \
  26. return -EINVAL; \
  27. case 'y': \
  28. case 'z': \
  29. u++; \
  30. case 'e': \
  31. u++; \
  32. case 'p': \
  33. u++; \
  34. case 't': \
  35. u++; \
  36. case 'g': \
  37. u++; \
  38. case 'm': \
  39. u++; \
  40. case 'k': \
  41. u++; \
  42. if (e++ == cp) \
  43. return -EINVAL; \
  44. case '\n': \
  45. case '\0': \
  46. if (*e == '\n') \
  47. e++; \
  48. } \
  49. \
  50. if (*e) \
  51. return -EINVAL; \
  52. \
  53. while (u--) { \
  54. if ((type) ~0 > 0 && \
  55. (type) ~0 / 1024 <= i) \
  56. return -EINVAL; \
  57. if ((i > 0 && ANYSINT_MAX(type) / 1024 < i) || \
  58. (i < 0 && -ANYSINT_MAX(type) / 1024 > i)) \
  59. return -EINVAL; \
  60. i *= 1024; \
  61. } \
  62. \
  63. *res = i; \
  64. return 0; \
  65. } \
  66. STRTO_H(strtoint, int)
  67. STRTO_H(strtouint, unsigned int)
  68. STRTO_H(strtoll, long long)
  69. STRTO_H(strtoull, unsigned long long)
  70. ssize_t bch_hprint(char *buf, int64_t v)
  71. {
  72. static const char units[] = "?kMGTPEZY";
  73. char dec[3] = "";
  74. int u, t = 0;
  75. for (u = 0; v >= 1024 || v <= -1024; u++) {
  76. t = v & ~(~0 << 10);
  77. v >>= 10;
  78. }
  79. if (!u)
  80. return sprintf(buf, "%llu", v);
  81. if (v < 100 && v > -100)
  82. sprintf(dec, ".%i", t / 100);
  83. return sprintf(buf, "%lli%s%c", v, dec, units[u]);
  84. }
  85. ssize_t bch_snprint_string_list(char *buf, size_t size, const char * const list[],
  86. size_t selected)
  87. {
  88. char *out = buf;
  89. size_t i;
  90. for (i = 0; list[i]; i++)
  91. out += snprintf(out, buf + size - out,
  92. i == selected ? "[%s] " : "%s ", list[i]);
  93. out[-1] = '\n';
  94. return out - buf;
  95. }
  96. ssize_t bch_read_string_list(const char *buf, const char * const list[])
  97. {
  98. size_t i;
  99. char *s, *d = kstrndup(buf, PAGE_SIZE - 1, GFP_KERNEL);
  100. if (!d)
  101. return -ENOMEM;
  102. s = strim(d);
  103. for (i = 0; list[i]; i++)
  104. if (!strcmp(list[i], s))
  105. break;
  106. kfree(d);
  107. if (!list[i])
  108. return -EINVAL;
  109. return i;
  110. }
  111. bool bch_is_zero(const char *p, size_t n)
  112. {
  113. size_t i;
  114. for (i = 0; i < n; i++)
  115. if (p[i])
  116. return false;
  117. return true;
  118. }
  119. int bch_parse_uuid(const char *s, char *uuid)
  120. {
  121. size_t i, j, x;
  122. memset(uuid, 0, 16);
  123. for (i = 0, j = 0;
  124. i < strspn(s, "-0123456789:ABCDEFabcdef") && j < 32;
  125. i++) {
  126. x = s[i] | 32;
  127. switch (x) {
  128. case '0'...'9':
  129. x -= '0';
  130. break;
  131. case 'a'...'f':
  132. x -= 'a' - 10;
  133. break;
  134. default:
  135. continue;
  136. }
  137. if (!(j & 1))
  138. x <<= 4;
  139. uuid[j++ >> 1] |= x;
  140. }
  141. return i;
  142. }
  143. void bch_time_stats_update(struct time_stats *stats, uint64_t start_time)
  144. {
  145. uint64_t now = local_clock();
  146. uint64_t duration = time_after64(now, start_time)
  147. ? now - start_time : 0;
  148. uint64_t last = time_after64(now, stats->last)
  149. ? now - stats->last : 0;
  150. stats->max_duration = max(stats->max_duration, duration);
  151. if (stats->last) {
  152. ewma_add(stats->average_duration, duration, 8, 8);
  153. if (stats->average_frequency)
  154. ewma_add(stats->average_frequency, last, 8, 8);
  155. else
  156. stats->average_frequency = last << 8;
  157. } else {
  158. stats->average_duration = duration << 8;
  159. }
  160. stats->last = now ?: 1;
  161. }
  162. unsigned bch_next_delay(struct ratelimit *d, uint64_t done)
  163. {
  164. uint64_t now = local_clock();
  165. d->next += div_u64(done, d->rate);
  166. return time_after64(d->next, now)
  167. ? div_u64(d->next - now, NSEC_PER_SEC / HZ)
  168. : 0;
  169. }
  170. void bch_bio_map(struct bio *bio, void *base)
  171. {
  172. size_t size = bio->bi_size;
  173. struct bio_vec *bv = bio->bi_io_vec;
  174. BUG_ON(!bio->bi_size);
  175. BUG_ON(bio->bi_vcnt);
  176. bv->bv_offset = base ? ((unsigned long) base) % PAGE_SIZE : 0;
  177. goto start;
  178. for (; size; bio->bi_vcnt++, bv++) {
  179. bv->bv_offset = 0;
  180. start: bv->bv_len = min_t(size_t, PAGE_SIZE - bv->bv_offset,
  181. size);
  182. if (base) {
  183. bv->bv_page = is_vmalloc_addr(base)
  184. ? vmalloc_to_page(base)
  185. : virt_to_page(base);
  186. base += bv->bv_len;
  187. }
  188. size -= bv->bv_len;
  189. }
  190. }
  191. int bch_bio_alloc_pages(struct bio *bio, gfp_t gfp)
  192. {
  193. int i;
  194. struct bio_vec *bv;
  195. bio_for_each_segment(bv, bio, i) {
  196. bv->bv_page = alloc_page(gfp);
  197. if (!bv->bv_page) {
  198. while (bv-- != bio->bi_io_vec + bio->bi_idx)
  199. __free_page(bv->bv_page);
  200. return -ENOMEM;
  201. }
  202. }
  203. return 0;
  204. }
  205. /*
  206. * Portions Copyright (c) 1996-2001, PostgreSQL Global Development Group (Any
  207. * use permitted, subject to terms of PostgreSQL license; see.)
  208. * If we have a 64-bit integer type, then a 64-bit CRC looks just like the
  209. * usual sort of implementation. (See Ross Williams' excellent introduction
  210. * A PAINLESS GUIDE TO CRC ERROR DETECTION ALGORITHMS, available from
  211. * ftp://ftp.rocksoft.com/papers/crc_v3.txt or several other net sites.)
  212. * If we have no working 64-bit type, then fake it with two 32-bit registers.
  213. *
  214. * The present implementation is a normal (not "reflected", in Williams'
  215. * terms) 64-bit CRC, using initial all-ones register contents and a final
  216. * bit inversion. The chosen polynomial is borrowed from the DLT1 spec
  217. * (ECMA-182, available from http://www.ecma.ch/ecma1/STAND/ECMA-182.HTM):
  218. *
  219. * x^64 + x^62 + x^57 + x^55 + x^54 + x^53 + x^52 + x^47 + x^46 + x^45 +
  220. * x^40 + x^39 + x^38 + x^37 + x^35 + x^33 + x^32 + x^31 + x^29 + x^27 +
  221. * x^24 + x^23 + x^22 + x^21 + x^19 + x^17 + x^13 + x^12 + x^10 + x^9 +
  222. * x^7 + x^4 + x + 1
  223. */
  224. static const uint64_t crc_table[256] = {
  225. 0x0000000000000000, 0x42F0E1EBA9EA3693, 0x85E1C3D753D46D26,
  226. 0xC711223CFA3E5BB5, 0x493366450E42ECDF, 0x0BC387AEA7A8DA4C,
  227. 0xCCD2A5925D9681F9, 0x8E224479F47CB76A, 0x9266CC8A1C85D9BE,
  228. 0xD0962D61B56FEF2D, 0x17870F5D4F51B498, 0x5577EEB6E6BB820B,
  229. 0xDB55AACF12C73561, 0x99A54B24BB2D03F2, 0x5EB4691841135847,
  230. 0x1C4488F3E8F96ED4, 0x663D78FF90E185EF, 0x24CD9914390BB37C,
  231. 0xE3DCBB28C335E8C9, 0xA12C5AC36ADFDE5A, 0x2F0E1EBA9EA36930,
  232. 0x6DFEFF5137495FA3, 0xAAEFDD6DCD770416, 0xE81F3C86649D3285,
  233. 0xF45BB4758C645C51, 0xB6AB559E258E6AC2, 0x71BA77A2DFB03177,
  234. 0x334A9649765A07E4, 0xBD68D2308226B08E, 0xFF9833DB2BCC861D,
  235. 0x388911E7D1F2DDA8, 0x7A79F00C7818EB3B, 0xCC7AF1FF21C30BDE,
  236. 0x8E8A101488293D4D, 0x499B3228721766F8, 0x0B6BD3C3DBFD506B,
  237. 0x854997BA2F81E701, 0xC7B97651866BD192, 0x00A8546D7C558A27,
  238. 0x4258B586D5BFBCB4, 0x5E1C3D753D46D260, 0x1CECDC9E94ACE4F3,
  239. 0xDBFDFEA26E92BF46, 0x990D1F49C77889D5, 0x172F5B3033043EBF,
  240. 0x55DFBADB9AEE082C, 0x92CE98E760D05399, 0xD03E790CC93A650A,
  241. 0xAA478900B1228E31, 0xE8B768EB18C8B8A2, 0x2FA64AD7E2F6E317,
  242. 0x6D56AB3C4B1CD584, 0xE374EF45BF6062EE, 0xA1840EAE168A547D,
  243. 0x66952C92ECB40FC8, 0x2465CD79455E395B, 0x3821458AADA7578F,
  244. 0x7AD1A461044D611C, 0xBDC0865DFE733AA9, 0xFF3067B657990C3A,
  245. 0x711223CFA3E5BB50, 0x33E2C2240A0F8DC3, 0xF4F3E018F031D676,
  246. 0xB60301F359DBE0E5, 0xDA050215EA6C212F, 0x98F5E3FE438617BC,
  247. 0x5FE4C1C2B9B84C09, 0x1D14202910527A9A, 0x93366450E42ECDF0,
  248. 0xD1C685BB4DC4FB63, 0x16D7A787B7FAA0D6, 0x5427466C1E109645,
  249. 0x4863CE9FF6E9F891, 0x0A932F745F03CE02, 0xCD820D48A53D95B7,
  250. 0x8F72ECA30CD7A324, 0x0150A8DAF8AB144E, 0x43A04931514122DD,
  251. 0x84B16B0DAB7F7968, 0xC6418AE602954FFB, 0xBC387AEA7A8DA4C0,
  252. 0xFEC89B01D3679253, 0x39D9B93D2959C9E6, 0x7B2958D680B3FF75,
  253. 0xF50B1CAF74CF481F, 0xB7FBFD44DD257E8C, 0x70EADF78271B2539,
  254. 0x321A3E938EF113AA, 0x2E5EB66066087D7E, 0x6CAE578BCFE24BED,
  255. 0xABBF75B735DC1058, 0xE94F945C9C3626CB, 0x676DD025684A91A1,
  256. 0x259D31CEC1A0A732, 0xE28C13F23B9EFC87, 0xA07CF2199274CA14,
  257. 0x167FF3EACBAF2AF1, 0x548F120162451C62, 0x939E303D987B47D7,
  258. 0xD16ED1D631917144, 0x5F4C95AFC5EDC62E, 0x1DBC74446C07F0BD,
  259. 0xDAAD56789639AB08, 0x985DB7933FD39D9B, 0x84193F60D72AF34F,
  260. 0xC6E9DE8B7EC0C5DC, 0x01F8FCB784FE9E69, 0x43081D5C2D14A8FA,
  261. 0xCD2A5925D9681F90, 0x8FDAB8CE70822903, 0x48CB9AF28ABC72B6,
  262. 0x0A3B7B1923564425, 0x70428B155B4EAF1E, 0x32B26AFEF2A4998D,
  263. 0xF5A348C2089AC238, 0xB753A929A170F4AB, 0x3971ED50550C43C1,
  264. 0x7B810CBBFCE67552, 0xBC902E8706D82EE7, 0xFE60CF6CAF321874,
  265. 0xE224479F47CB76A0, 0xA0D4A674EE214033, 0x67C58448141F1B86,
  266. 0x253565A3BDF52D15, 0xAB1721DA49899A7F, 0xE9E7C031E063ACEC,
  267. 0x2EF6E20D1A5DF759, 0x6C0603E6B3B7C1CA, 0xF6FAE5C07D3274CD,
  268. 0xB40A042BD4D8425E, 0x731B26172EE619EB, 0x31EBC7FC870C2F78,
  269. 0xBFC9838573709812, 0xFD39626EDA9AAE81, 0x3A28405220A4F534,
  270. 0x78D8A1B9894EC3A7, 0x649C294A61B7AD73, 0x266CC8A1C85D9BE0,
  271. 0xE17DEA9D3263C055, 0xA38D0B769B89F6C6, 0x2DAF4F0F6FF541AC,
  272. 0x6F5FAEE4C61F773F, 0xA84E8CD83C212C8A, 0xEABE6D3395CB1A19,
  273. 0x90C79D3FEDD3F122, 0xD2377CD44439C7B1, 0x15265EE8BE079C04,
  274. 0x57D6BF0317EDAA97, 0xD9F4FB7AE3911DFD, 0x9B041A914A7B2B6E,
  275. 0x5C1538ADB04570DB, 0x1EE5D94619AF4648, 0x02A151B5F156289C,
  276. 0x4051B05E58BC1E0F, 0x87409262A28245BA, 0xC5B073890B687329,
  277. 0x4B9237F0FF14C443, 0x0962D61B56FEF2D0, 0xCE73F427ACC0A965,
  278. 0x8C8315CC052A9FF6, 0x3A80143F5CF17F13, 0x7870F5D4F51B4980,
  279. 0xBF61D7E80F251235, 0xFD913603A6CF24A6, 0x73B3727A52B393CC,
  280. 0x31439391FB59A55F, 0xF652B1AD0167FEEA, 0xB4A25046A88DC879,
  281. 0xA8E6D8B54074A6AD, 0xEA16395EE99E903E, 0x2D071B6213A0CB8B,
  282. 0x6FF7FA89BA4AFD18, 0xE1D5BEF04E364A72, 0xA3255F1BE7DC7CE1,
  283. 0x64347D271DE22754, 0x26C49CCCB40811C7, 0x5CBD6CC0CC10FAFC,
  284. 0x1E4D8D2B65FACC6F, 0xD95CAF179FC497DA, 0x9BAC4EFC362EA149,
  285. 0x158E0A85C2521623, 0x577EEB6E6BB820B0, 0x906FC95291867B05,
  286. 0xD29F28B9386C4D96, 0xCEDBA04AD0952342, 0x8C2B41A1797F15D1,
  287. 0x4B3A639D83414E64, 0x09CA82762AAB78F7, 0x87E8C60FDED7CF9D,
  288. 0xC51827E4773DF90E, 0x020905D88D03A2BB, 0x40F9E43324E99428,
  289. 0x2CFFE7D5975E55E2, 0x6E0F063E3EB46371, 0xA91E2402C48A38C4,
  290. 0xEBEEC5E96D600E57, 0x65CC8190991CB93D, 0x273C607B30F68FAE,
  291. 0xE02D4247CAC8D41B, 0xA2DDA3AC6322E288, 0xBE992B5F8BDB8C5C,
  292. 0xFC69CAB42231BACF, 0x3B78E888D80FE17A, 0x7988096371E5D7E9,
  293. 0xF7AA4D1A85996083, 0xB55AACF12C735610, 0x724B8ECDD64D0DA5,
  294. 0x30BB6F267FA73B36, 0x4AC29F2A07BFD00D, 0x08327EC1AE55E69E,
  295. 0xCF235CFD546BBD2B, 0x8DD3BD16FD818BB8, 0x03F1F96F09FD3CD2,
  296. 0x41011884A0170A41, 0x86103AB85A2951F4, 0xC4E0DB53F3C36767,
  297. 0xD8A453A01B3A09B3, 0x9A54B24BB2D03F20, 0x5D45907748EE6495,
  298. 0x1FB5719CE1045206, 0x919735E51578E56C, 0xD367D40EBC92D3FF,
  299. 0x1476F63246AC884A, 0x568617D9EF46BED9, 0xE085162AB69D5E3C,
  300. 0xA275F7C11F7768AF, 0x6564D5FDE549331A, 0x279434164CA30589,
  301. 0xA9B6706FB8DFB2E3, 0xEB46918411358470, 0x2C57B3B8EB0BDFC5,
  302. 0x6EA7525342E1E956, 0x72E3DAA0AA188782, 0x30133B4B03F2B111,
  303. 0xF7021977F9CCEAA4, 0xB5F2F89C5026DC37, 0x3BD0BCE5A45A6B5D,
  304. 0x79205D0E0DB05DCE, 0xBE317F32F78E067B, 0xFCC19ED95E6430E8,
  305. 0x86B86ED5267CDBD3, 0xC4488F3E8F96ED40, 0x0359AD0275A8B6F5,
  306. 0x41A94CE9DC428066, 0xCF8B0890283E370C, 0x8D7BE97B81D4019F,
  307. 0x4A6ACB477BEA5A2A, 0x089A2AACD2006CB9, 0x14DEA25F3AF9026D,
  308. 0x562E43B4931334FE, 0x913F6188692D6F4B, 0xD3CF8063C0C759D8,
  309. 0x5DEDC41A34BBEEB2, 0x1F1D25F19D51D821, 0xD80C07CD676F8394,
  310. 0x9AFCE626CE85B507
  311. };
  312. uint64_t bch_crc64_update(uint64_t crc, const void *_data, size_t len)
  313. {
  314. const unsigned char *data = _data;
  315. while (len--) {
  316. int i = ((int) (crc >> 56) ^ *data++) & 0xFF;
  317. crc = crc_table[i] ^ (crc << 8);
  318. }
  319. return crc;
  320. }
  321. uint64_t bch_crc64(const void *data, size_t len)
  322. {
  323. uint64_t crc = 0xffffffffffffffff;
  324. crc = bch_crc64_update(crc, data, len);
  325. return crc ^ 0xffffffffffffffff;
  326. }