hbase.c 7.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363
  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_strrchr_dir(const char* filepath) {
  151. char* p = (char*)filepath;
  152. while (*p) ++p;
  153. while (--p >= filepath) {
  154. #ifdef OS_WIN
  155. if (*p == '/' || *p == '\\')
  156. #else
  157. if (*p == '/')
  158. #endif
  159. return p;
  160. }
  161. return NULL;
  162. }
  163. const char* hv_basename(const char* filepath) {
  164. const char* pos = hv_strrchr_dir(filepath);
  165. return pos ? pos+1 : filepath;
  166. }
  167. const char* hv_suffixname(const char* filename) {
  168. const char* pos = hv_strrchr_dot(filename);
  169. return pos ? pos+1 : "";
  170. }
  171. int hv_mkdir_p(const char* dir) {
  172. if (access(dir, 0) == 0) {
  173. return EEXIST;
  174. }
  175. char tmp[MAX_PATH] = {0};
  176. hv_strncpy(tmp, dir, sizeof(tmp));
  177. char* p = tmp;
  178. char delim = '/';
  179. while (*p) {
  180. #ifdef OS_WIN
  181. if (*p == '/' || *p == '\\') {
  182. delim = *p;
  183. #else
  184. if (*p == '/') {
  185. #endif
  186. *p = '\0';
  187. hv_mkdir(tmp);
  188. *p = delim;
  189. }
  190. ++p;
  191. }
  192. if (hv_mkdir(tmp) != 0) {
  193. return EPERM;
  194. }
  195. return 0;
  196. }
  197. int hv_rmdir_p(const char* dir) {
  198. if (access(dir, 0) != 0) {
  199. return ENOENT;
  200. }
  201. if (rmdir(dir) != 0) {
  202. return EPERM;
  203. }
  204. char tmp[MAX_PATH] = {0};
  205. hv_strncpy(tmp, dir, sizeof(tmp));
  206. char* p = tmp;
  207. while (*p) ++p;
  208. while (--p >= tmp) {
  209. #ifdef OS_WIN
  210. if (*p == '/' || *p == '\\') {
  211. #else
  212. if (*p == '/') {
  213. #endif
  214. *p = '\0';
  215. if (rmdir(tmp) != 0) {
  216. return 0;
  217. }
  218. }
  219. }
  220. return 0;
  221. }
  222. bool hv_exists(const char* path) {
  223. return access(path, 0) == 0;
  224. }
  225. bool hv_isdir(const char* path) {
  226. if (access(path, 0) != 0) return false;
  227. struct stat st;
  228. memset(&st, 0, sizeof(st));
  229. stat(path, &st);
  230. return S_ISDIR(st.st_mode);
  231. }
  232. bool hv_isfile(const char* path) {
  233. if (access(path, 0) != 0) return false;
  234. struct stat st;
  235. memset(&st, 0, sizeof(st));
  236. stat(path, &st);
  237. return S_ISREG(st.st_mode);
  238. }
  239. bool hv_islink(const char* path) {
  240. #ifdef OS_WIN
  241. return hv_isdir(path) && (GetFileAttributes(path) & FILE_ATTRIBUTE_REPARSE_POINT);
  242. #else
  243. if (access(path, 0) != 0) return false;
  244. struct stat st;
  245. memset(&st, 0, sizeof(st));
  246. lstat(path, &st);
  247. return S_ISLNK(st.st_mode);
  248. #endif
  249. }
  250. size_t hv_filesize(const char* filepath) {
  251. struct stat st;
  252. memset(&st, 0, sizeof(st));
  253. stat(filepath, &st);
  254. return st.st_size;
  255. }
  256. char* get_executable_path(char* buf, int size) {
  257. #ifdef OS_WIN
  258. GetModuleFileName(NULL, buf, size);
  259. #elif defined(OS_LINUX)
  260. if (readlink("/proc/self/exe", buf, size) == -1) {
  261. return NULL;
  262. }
  263. #elif defined(OS_DARWIN)
  264. _NSGetExecutablePath(buf, (uint32_t*)&size);
  265. #endif
  266. return buf;
  267. }
  268. char* get_executable_dir(char* buf, int size) {
  269. char filepath[MAX_PATH] = {0};
  270. get_executable_path(filepath, sizeof(filepath));
  271. char* pos = hv_strrchr_dir(filepath);
  272. if (pos) {
  273. *pos = '\0';
  274. strncpy(buf, filepath, size);
  275. }
  276. return buf;
  277. }
  278. char* get_executable_file(char* buf, int size) {
  279. char filepath[MAX_PATH] = {0};
  280. get_executable_path(filepath, sizeof(filepath));
  281. char* pos = hv_strrchr_dir(filepath);
  282. if (pos) {
  283. strncpy(buf, pos+1, size);
  284. }
  285. return buf;
  286. }
  287. char* get_run_dir(char* buf, int size) {
  288. return getcwd(buf, size);
  289. }
  290. int hv_rand(int min, int max) {
  291. static int s_seed = 0;
  292. assert(max > min);
  293. if (s_seed == 0) {
  294. s_seed = time(NULL);
  295. srand(s_seed);
  296. }
  297. int _rand = rand();
  298. _rand = min + (int) ((double) ((double) (max) - (min) + 1.0) * ((_rand) / ((RAND_MAX) + 1.0)));
  299. return _rand;
  300. }
  301. void hv_random_string(char *buf, int len) {
  302. static char s_characters[] = {
  303. 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U',
  304. 'V', 'W', 'X', 'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p',
  305. 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
  306. };
  307. int i = 0;
  308. for (; i < len; i++) {
  309. buf[i] = s_characters[hv_rand(0, sizeof(s_characters) - 1)];
  310. }
  311. buf[i] = '\0';
  312. }
  313. bool hv_getboolean(const char* str) {
  314. if (str == NULL) return false;
  315. int len = strlen(str);
  316. if (len == 0) return false;
  317. switch (len) {
  318. case 1: return *str == '1' || *str == 'y' || *str == 'Y';
  319. case 2: return stricmp(str, "on") == 0;
  320. case 3: return stricmp(str, "yes") == 0;
  321. case 4: return stricmp(str, "true") == 0;
  322. case 6: return stricmp(str, "enable") == 0;
  323. default: return false;
  324. }
  325. }