hbase.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501
  1. #include "hbase.h"
  2. #ifdef OS_DARWIN
  3. #include <mach-o/dyld.h> // for _NSGetExecutablePath
  4. #endif
  5. #include "hatomic.h"
  6. #ifndef RAND_MAX
  7. #define RAND_MAX 2147483647
  8. #endif
  9. static hatomic_t s_alloc_cnt = HATOMIC_VAR_INIT(0);
  10. static hatomic_t s_free_cnt = HATOMIC_VAR_INIT(0);
  11. long hv_alloc_cnt() {
  12. return s_alloc_cnt;
  13. }
  14. long hv_free_cnt() {
  15. return s_free_cnt;
  16. }
  17. void* hv_malloc(size_t size) {
  18. hatomic_inc(&s_alloc_cnt);
  19. void* ptr = malloc(size);
  20. if (!ptr) {
  21. fprintf(stderr, "malloc failed!\n");
  22. exit(-1);
  23. }
  24. return ptr;
  25. }
  26. void* hv_realloc(void* oldptr, size_t newsize, size_t oldsize) {
  27. hatomic_inc(&s_alloc_cnt);
  28. hatomic_inc(&s_free_cnt);
  29. void* ptr = realloc(oldptr, newsize);
  30. if (!ptr) {
  31. fprintf(stderr, "realloc failed!\n");
  32. exit(-1);
  33. }
  34. if (newsize > oldsize) {
  35. memset((char*)ptr + oldsize, 0, newsize - oldsize);
  36. }
  37. return ptr;
  38. }
  39. void* hv_calloc(size_t nmemb, size_t size) {
  40. hatomic_inc(&s_alloc_cnt);
  41. void* ptr = calloc(nmemb, size);
  42. if (!ptr) {
  43. fprintf(stderr, "calloc failed!\n");
  44. exit(-1);
  45. }
  46. return ptr;
  47. }
  48. void* hv_zalloc(size_t size) {
  49. hatomic_inc(&s_alloc_cnt);
  50. void* ptr = malloc(size);
  51. if (!ptr) {
  52. fprintf(stderr, "malloc failed!\n");
  53. exit(-1);
  54. }
  55. memset(ptr, 0, size);
  56. return ptr;
  57. }
  58. void hv_free(void* ptr) {
  59. if (ptr) {
  60. free(ptr);
  61. ptr = NULL;
  62. hatomic_inc(&s_free_cnt);
  63. }
  64. }
  65. char* hv_strupper(char* str) {
  66. char* p = str;
  67. while (*p != '\0') {
  68. if (*p >= 'a' && *p <= 'z') {
  69. *p &= ~0x20;
  70. }
  71. ++p;
  72. }
  73. return str;
  74. }
  75. char* hv_strlower(char* str) {
  76. char* p = str;
  77. while (*p != '\0') {
  78. if (*p >= 'A' && *p <= 'Z') {
  79. *p |= 0x20;
  80. }
  81. ++p;
  82. }
  83. return str;
  84. }
  85. char* hv_strreverse(char* str) {
  86. if (str == NULL) return NULL;
  87. char* b = str;
  88. char* e = str;
  89. while(*e) {++e;}
  90. --e;
  91. char tmp;
  92. while (e > b) {
  93. tmp = *e;
  94. *e = *b;
  95. *b = tmp;
  96. --e;
  97. ++b;
  98. }
  99. return str;
  100. }
  101. // n = sizeof(dest_buf)
  102. char* hv_strncpy(char* dest, const char* src, size_t n) {
  103. assert(dest != NULL && src != NULL);
  104. char* ret = dest;
  105. while (*src != '\0' && --n > 0) {
  106. *dest++ = *src++;
  107. }
  108. *dest = '\0';
  109. return ret;
  110. }
  111. // n = sizeof(dest_buf)
  112. char* hv_strncat(char* dest, const char* src, size_t n) {
  113. assert(dest != NULL && src != NULL);
  114. char* ret = dest;
  115. while (*dest) {++dest;--n;}
  116. while (*src != '\0' && --n > 0) {
  117. *dest++ = *src++;
  118. }
  119. *dest = '\0';
  120. return ret;
  121. }
  122. bool hv_strstartswith(const char* str, const char* start) {
  123. assert(str != NULL && start != NULL);
  124. while (*str && *start && *str == *start) {
  125. ++str;
  126. ++start;
  127. }
  128. return *start == '\0';
  129. }
  130. bool hv_strendswith(const char* str, const char* end) {
  131. assert(str != NULL && end != NULL);
  132. int len1 = 0;
  133. int len2 = 0;
  134. while (*str) {++str; ++len1;}
  135. while (*end) {++end; ++len2;}
  136. if (len1 < len2) return false;
  137. while (len2-- > 0) {
  138. --str;
  139. --end;
  140. if (*str != *end) {
  141. return false;
  142. }
  143. }
  144. return true;
  145. }
  146. bool hv_strcontains(const char* str, const char* sub) {
  147. assert(str != NULL && sub != NULL);
  148. return strstr(str, sub) != NULL;
  149. }
  150. char* hv_strnchr(const char* s, char c, size_t n) {
  151. assert(s != NULL);
  152. const char* p = s;
  153. while (*p != '\0' && n-- > 0) {
  154. if (*p == c) return (char*)p;
  155. ++p;
  156. }
  157. return NULL;
  158. }
  159. char* hv_strrchr_dir(const char* filepath) {
  160. char* p = (char*)filepath;
  161. while (*p) ++p;
  162. while (--p >= filepath) {
  163. #ifdef OS_WIN
  164. if (*p == '/' || *p == '\\')
  165. #else
  166. if (*p == '/')
  167. #endif
  168. return p;
  169. }
  170. return NULL;
  171. }
  172. const char* hv_basename(const char* filepath) {
  173. const char* pos = hv_strrchr_dir(filepath);
  174. return pos ? pos+1 : filepath;
  175. }
  176. const char* hv_suffixname(const char* filename) {
  177. const char* pos = hv_strrchr_dot(filename);
  178. return pos ? pos+1 : "";
  179. }
  180. int hv_mkdir_p(const char* dir) {
  181. if (access(dir, 0) == 0) {
  182. return EEXIST;
  183. }
  184. char tmp[MAX_PATH] = {0};
  185. hv_strncpy(tmp, dir, sizeof(tmp));
  186. char* p = tmp;
  187. char delim = '/';
  188. while (*p) {
  189. #ifdef OS_WIN
  190. if (*p == '/' || *p == '\\') {
  191. delim = *p;
  192. #else
  193. if (*p == '/') {
  194. #endif
  195. *p = '\0';
  196. hv_mkdir(tmp);
  197. *p = delim;
  198. }
  199. ++p;
  200. }
  201. if (hv_mkdir(tmp) != 0) {
  202. return EPERM;
  203. }
  204. return 0;
  205. }
  206. int hv_rmdir_p(const char* dir) {
  207. if (access(dir, 0) != 0) {
  208. return ENOENT;
  209. }
  210. if (rmdir(dir) != 0) {
  211. return EPERM;
  212. }
  213. char tmp[MAX_PATH] = {0};
  214. hv_strncpy(tmp, dir, sizeof(tmp));
  215. char* p = tmp;
  216. while (*p) ++p;
  217. while (--p >= tmp) {
  218. #ifdef OS_WIN
  219. if (*p == '/' || *p == '\\') {
  220. #else
  221. if (*p == '/') {
  222. #endif
  223. *p = '\0';
  224. if (rmdir(tmp) != 0) {
  225. return 0;
  226. }
  227. }
  228. }
  229. return 0;
  230. }
  231. bool hv_exists(const char* path) {
  232. return access(path, 0) == 0;
  233. }
  234. bool hv_isdir(const char* path) {
  235. if (access(path, 0) != 0) return false;
  236. struct stat st;
  237. memset(&st, 0, sizeof(st));
  238. stat(path, &st);
  239. return S_ISDIR(st.st_mode);
  240. }
  241. bool hv_isfile(const char* path) {
  242. if (access(path, 0) != 0) return false;
  243. struct stat st;
  244. memset(&st, 0, sizeof(st));
  245. stat(path, &st);
  246. return S_ISREG(st.st_mode);
  247. }
  248. bool hv_islink(const char* path) {
  249. #ifdef OS_WIN
  250. return hv_isdir(path) && (GetFileAttributes(path) & FILE_ATTRIBUTE_REPARSE_POINT);
  251. #else
  252. if (access(path, 0) != 0) return false;
  253. struct stat st;
  254. memset(&st, 0, sizeof(st));
  255. lstat(path, &st);
  256. return S_ISLNK(st.st_mode);
  257. #endif
  258. }
  259. size_t hv_filesize(const char* filepath) {
  260. struct stat st;
  261. memset(&st, 0, sizeof(st));
  262. stat(filepath, &st);
  263. return st.st_size;
  264. }
  265. char* get_executable_path(char* buf, int size) {
  266. #ifdef OS_WIN
  267. GetModuleFileName(NULL, buf, size);
  268. #elif defined(OS_LINUX)
  269. if (readlink("/proc/self/exe", buf, size) == -1) {
  270. return NULL;
  271. }
  272. #elif defined(OS_DARWIN)
  273. _NSGetExecutablePath(buf, (uint32_t*)&size);
  274. #endif
  275. return buf;
  276. }
  277. char* get_executable_dir(char* buf, int size) {
  278. char filepath[MAX_PATH] = {0};
  279. get_executable_path(filepath, sizeof(filepath));
  280. char* pos = hv_strrchr_dir(filepath);
  281. if (pos) {
  282. *pos = '\0';
  283. strncpy(buf, filepath, size);
  284. }
  285. return buf;
  286. }
  287. char* get_executable_file(char* buf, int size) {
  288. char filepath[MAX_PATH] = {0};
  289. get_executable_path(filepath, sizeof(filepath));
  290. char* pos = hv_strrchr_dir(filepath);
  291. if (pos) {
  292. strncpy(buf, pos+1, size);
  293. }
  294. return buf;
  295. }
  296. char* get_run_dir(char* buf, int size) {
  297. return getcwd(buf, size);
  298. }
  299. int hv_rand(int min, int max) {
  300. static int s_seed = 0;
  301. assert(max > min);
  302. if (s_seed == 0) {
  303. s_seed = time(NULL);
  304. srand(s_seed);
  305. }
  306. int _rand = rand();
  307. _rand = min + (int) ((double) ((double) (max) - (min) + 1.0) * ((_rand) / ((RAND_MAX) + 1.0)));
  308. return _rand;
  309. }
  310. char* hv_random_string(char *buf, int len) {
  311. static char s_characters[] = {
  312. 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U',
  313. 'V', 'W', 'X', 'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p',
  314. 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
  315. };
  316. int i = 0;
  317. for (; i < len; i++) {
  318. buf[i] = s_characters[hv_rand(0, sizeof(s_characters) - 1)];
  319. }
  320. buf[i] = '\0';
  321. return buf;
  322. }
  323. bool hv_getboolean(const char* str) {
  324. if (str == NULL) return false;
  325. int len = strlen(str);
  326. if (len == 0) return false;
  327. switch (len) {
  328. case 1: return *str == '1' || *str == 'y' || *str == 'Y';
  329. case 2: return stricmp(str, "on") == 0;
  330. case 3: return stricmp(str, "yes") == 0;
  331. case 4: return stricmp(str, "true") == 0;
  332. case 6: return stricmp(str, "enable") == 0;
  333. default: return false;
  334. }
  335. }
  336. size_t hv_parse_size(const char* str) {
  337. size_t size = 0, n = 0;
  338. const char* p = str;
  339. char c;
  340. while ((c = *p) != '\0') {
  341. if (c >= '0' && c <= '9') {
  342. n = n * 10 + c - '0';
  343. } else {
  344. switch (c) {
  345. case 'K': case 'k': n <<= 10; break;
  346. case 'M': case 'm': n <<= 20; break;
  347. case 'G': case 'g': n <<= 30; break;
  348. case 'T': case 't': n <<= 40; break;
  349. default: break;
  350. }
  351. size += n;
  352. n = 0;
  353. }
  354. ++p;
  355. }
  356. return size + n;
  357. }
  358. time_t hv_parse_time(const char* str) {
  359. time_t time = 0, n = 0;
  360. const char* p = str;
  361. char c;
  362. while ((c = *p) != '\0') {
  363. if (c >= '0' && c <= '9') {
  364. n = n * 10 + c - '0';
  365. } else {
  366. switch (c) {
  367. case 's': break;
  368. case 'm': n *= 60; break;
  369. case 'h': n *= 60 * 60; break;
  370. case 'd': n *= 24 * 60 * 60; break;
  371. case 'w': n *= 7 * 24 * 60 * 60; break;
  372. default: break;
  373. }
  374. time += n;
  375. n = 0;
  376. }
  377. ++p;
  378. }
  379. return time + n;
  380. }
  381. int hv_parse_url(hurl_t* stURL, const char* strURL) {
  382. if (stURL == NULL || strURL == NULL) return -1;
  383. memset(stURL, 0, sizeof(hurl_t));
  384. const char* begin = strURL;
  385. const char* end = strURL;
  386. while (*end != '\0') ++end;
  387. if (end - begin > 65535) return -2;
  388. // scheme://
  389. const char* sp = strURL;
  390. const char* ep = strstr(sp, "://");
  391. if (ep) {
  392. // stURL->fields[HV_URL_SCHEME].off = sp - begin;
  393. stURL->fields[HV_URL_SCHEME].len = ep - sp;
  394. sp = ep + 3;
  395. }
  396. // user:pswd@host:port
  397. ep = strchr(sp, '/');
  398. if (ep == NULL) ep = end;
  399. const char* user = sp;
  400. const char* host = sp;
  401. const char* pos = hv_strnchr(sp, '@', ep - sp);
  402. if (pos) {
  403. // user:pswd
  404. const char* pswd = hv_strnchr(user, ':', pos - user);
  405. if (pswd) {
  406. stURL->fields[HV_URL_PASSWORD].off = pswd + 1 - begin;
  407. stURL->fields[HV_URL_PASSWORD].len = pos - pswd - 1;
  408. } else {
  409. pswd = pos;
  410. }
  411. stURL->fields[HV_URL_USERNAME].off = user - begin;
  412. stURL->fields[HV_URL_USERNAME].len = pswd - user;
  413. // @
  414. host = pos + 1;
  415. }
  416. // port
  417. const char* port = hv_strnchr(host, ':', ep - host);
  418. if (port) {
  419. stURL->fields[HV_URL_PORT].off = port + 1 - begin;
  420. stURL->fields[HV_URL_PORT].len = ep - port - 1;
  421. // atoi
  422. for (unsigned short i = 1; i <= stURL->fields[HV_URL_PORT].len; ++i) {
  423. stURL->port = stURL->port * 10 + (port[i] - '0');
  424. }
  425. } else {
  426. port = ep;
  427. // set default port
  428. stURL->port = 80;
  429. if (stURL->fields[HV_URL_SCHEME].len > 0) {
  430. if (strncmp(strURL, "https://", 8) == 0) {
  431. stURL->port = 443;
  432. }
  433. }
  434. }
  435. // host
  436. stURL->fields[HV_URL_HOST].off = host - begin;
  437. stURL->fields[HV_URL_HOST].len = port - host;
  438. if (ep == end) return 0;
  439. // /path
  440. sp = ep;
  441. ep = strchr(sp, '?');
  442. if (ep == NULL) ep = end;
  443. stURL->fields[HV_URL_PATH].off = sp - begin;
  444. stURL->fields[HV_URL_PATH].len = ep - sp;
  445. if (ep == end) return 0;
  446. // ?query
  447. sp = ep + 1;
  448. ep = strchr(sp, '#');
  449. if (ep == NULL) ep = end;
  450. stURL->fields[HV_URL_QUERY].off = sp - begin;
  451. stURL->fields[HV_URL_QUERY].len = ep - sp;
  452. if (ep == end) return 0;
  453. // #fragment
  454. sp = ep + 1;
  455. ep = end;
  456. stURL->fields[HV_URL_FRAGMENT].off = sp - begin;
  457. stURL->fields[HV_URL_FRAGMENT].len = ep - sp;
  458. return 0;
  459. }