mem_share.h 49 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525
  1. /*
  2. *
  3. * Copyright (c) 2011, Jue Ruan <ruanjue@gmail.com>
  4. *
  5. *
  6. * This program is free software: you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License as published by
  8. * the Free Software Foundation, either version 3 of the License, or
  9. * (at your option) any later version.
  10. *
  11. * This program is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License
  17. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  18. */
  19. #ifndef __MEM_SHARE_RJ_H
  20. #define __MEM_SHARE_RJ_H
  21. #ifndef _GNU_SOURCE
  22. #define _GNU_SOURCE
  23. #endif
  24. #if defined(__APPLE__) && defined(__MACH__)
  25. #include <machine/endian.h>
  26. #else
  27. #include <endian.h>
  28. #endif
  29. #include <sys/stat.h>
  30. #include <sys/mman.h>
  31. //#include <sys/times.h>
  32. #include <sys/time.h>
  33. #include <sys/signal.h>
  34. //#include <sys/resource.h>
  35. //#include <sys/sysinfo.h>
  36. #include <unistd.h>
  37. #include <fcntl.h>
  38. #include <errno.h>
  39. #include <signal.h>
  40. #include <stdio.h>
  41. #include <stdlib.h>
  42. #include <stdint.h>
  43. #include <stddef.h>
  44. #include <string.h>
  45. #include <alloca.h>
  46. #ifndef __HEADER_NO_EXECINFO
  47. #include <execinfo.h>
  48. #endif
  49. #include <time.h>
  50. #include "thread.h"
  51. /**
  52. * Data types
  53. */
  54. #define MAX_VALUE_U1 0xFFU
  55. #define MAX_U1 MAX_VALUE_U1
  56. typedef uint8_t u1i;
  57. #define MAX_VALUE_U2 0xFFFFU
  58. #define MAX_U2 MAX_VALUE_U2
  59. typedef uint16_t u2i;
  60. #define MAX_VALUE_U4 0xFFFFFFFFU
  61. #define MAX_U4 MAX_VALUE_U4
  62. typedef uint32_t u4i;
  63. #define MAX_VALUE_U8 0xFFFFFFFFFFFFFFFFLLU
  64. #define MAX_U8 MAX_VALUE_U8
  65. typedef unsigned long long u8i;
  66. #define MAX_VALUE_B1 0x7F
  67. #define MAX_B1 MAX_VALUE_B1
  68. typedef int8_t b1i;
  69. #define MAX_VALUE_B2 0x7FFF
  70. #define MAX_B2 MAX_VALUE_B2
  71. typedef int16_t b2i;
  72. #define MAX_VALUE_B4 0x7FFFFFFF
  73. #define MAX_B4 MAX_VALUE_B4
  74. typedef int32_t b4i;
  75. #define MAX_VALUE_B8 0x7FFFFFFFFFFFFFFFLL
  76. #define MAX_B8 MAX_VALUE_B8
  77. typedef long long b8i;
  78. typedef float f4i;
  79. typedef long double f8i;
  80. #define Int(x) ((int)(x))
  81. #define UInt(x) ((unsigned)(x))
  82. #define Int32(x) ((b4i)(x))
  83. #define Int64(x) ((b8i)(x))
  84. #define UInt64(x) ((u8i)(x))
  85. /**
  86. * Useful functions
  87. */
  88. #define num_min(n1, n2) (((n1) < (n2))? (n1) : (n2))
  89. #define num_max(n1, n2) (((n1) > (n2))? (n1) : (n2))
  90. #define num_diff(n1, n2) (((n1) < (n2))? ((n2) - (n1)) : ((n1) - (n2)))
  91. #define num_cmp(a, b) (((a) > (b))? 1 : (((a) < (b))? -1 : -0))
  92. #define num_cmpgt(a, b) ((a) > (b))
  93. #define num_cmpx(a, b, c, d) (((a) > (b))? 1 : (((a) < (b))? -1 : (((c) > (d))? 1 : (((c) < (d))? -1 : 0))))
  94. #define num_cmpgtx(a, b, c, d) (((a) > (b))? 1 : (((a) < (b))? 0 : (((c) > (d)))))
  95. #define num_cmpxx(a, b, c, d, e, f) (((a) > (b))? 1 : (((a) < (b))? -1 : (((c) > (d))? 1 : (((c) < (d))? -1 : (((e) > (f))? 1 : (((e) < (f))? -1 : 0))))))
  96. #define num_cmpgtxx(a, b, c, d, e, f) (((a) > (b))? 1 : (((a) < (b))? 0 : (((c) > (d))? 1 : (((c) < (d))? 0 : ((e) > (f))))))
  97. #define num_abs(n) ((n) < 0? -(n) : (n))
  98. #ifndef SWAP_TMP
  99. #define SWAP_TMP
  100. #define swap_tmp(a, b, t) { t = a; a = b; b = t; }
  101. #endif
  102. #define swap_var(a, b) { typeof(a) __swap_tmp__ = (a); (a) = (b); (b) = __swap_tmp__; }
  103. #define UNUSED(x) (void)(x)
  104. #define EXPR(...) __VA_ARGS__
  105. #define _QUOTE_STR(x) #x
  106. #define TOSTR(x) _QUOTE_STR(x)
  107. #define uc(ch) (((ch) >= 'a' && (ch) <= 'z')? (ch) + 'A' - 'a' : (ch))
  108. #define lc(ch) (((ch) >= 'A' && (ch) <= 'Z')? (ch) + 'a' - 'A' : (ch))
  109. #define get_bit8(bits, idx) ((((bits)[(idx) >> 3]) >> ((idx) & 0x07)) & 0x01)
  110. #define get_bit16(bits, idx) ((((bits)[(idx) >> 4]) >> ((idx) & 0x0F)) & 0x01)
  111. #define get_bit32(bits, idx) ((((bits)[(idx) >> 5]) >> ((idx) & 0x1F)) & 0x01)
  112. #define get_bit64(bits, idx) ((((bits)[(idx) >> 6]) >> ((idx) & 0x3F)) & 0x01)
  113. #define get_2bit8(bits, idx) ((((bits)[(idx) >> 2]) >> (((idx) & 0x03) << 1)) & 0x03)
  114. #define get_2bit16(bits, idx) ((((bits)[(idx) >> 3]) >> (((idx) & 0x07) << 1)) & 0x03)
  115. #define get_2bit32(bits, idx) ((((bits)[(idx) >> 4]) >> (((idx) & 0x0F) << 1)) & 0x03)
  116. #define get_2bit64(bits, idx) ((((bits)[(idx) >> 5]) >> (((idx) & 0x1F) << 1)) & 0x03)
  117. #define inc_2bit64(bits, idx) (((bits)[(idx) >> 5]) += (1LLU << (((idx) & 0x1F) << 1)))
  118. #define get_4bit8(bits, idx) ((((bits)[(idx) >> 1]) >> (((idx) & 0x01) << 2)) & 0x0F)
  119. #define get_4bit16(bits, idx) ((((bits)[(idx) >> 2]) >> (((idx) & 0x03) << 2)) & 0x0F)
  120. #define get_4bit32(bits, idx) ((((bits)[(idx) >> 3]) >> (((idx) & 0x07) << 2)) & 0x0F)
  121. #define get_4bit64(bits, idx) ((((bits)[(idx) >> 4]) >> (((idx) & 0x0F) << 2)) & 0x0F)
  122. #define get_8bit16(bits, idx) ((((bits)[(idx) >> 1]) >> (((idx) & 0x01) << 3)) & 0xFF)
  123. #define get_8bit32(bits, idx) ((((bits)[(idx) >> 2]) >> (((idx) & 0x03) << 3)) & 0xFF)
  124. #define get_8bit64(bits, idx) ((((bits)[(idx) >> 3]) >> (((idx) & 0x07) << 3)) & 0xFF)
  125. #ifndef __HEADER_NO_EXECINFO
  126. static inline void print_backtrace(FILE *out, int max_frame){
  127. void **buffer;
  128. int frames;
  129. if(max_frame < 1) max_frame = 1;
  130. buffer = malloc(sizeof(void*) * max_frame);
  131. frames = backtrace(buffer, max_frame);
  132. backtrace_symbols_fd(buffer, frames, fileno(out));
  133. free(buffer);
  134. }
  135. #else
  136. static inline void print_backtrace(FILE *out, int max_frame){
  137. UNUSED(max_frame);
  138. fprintf(out, "-- ** Cannot back trace frames ** --\n");
  139. }
  140. #endif
  141. static inline void num2bits(u8i num, char bits[64]){
  142. int i;
  143. for(i=0;i<64;i++){
  144. bits[i] = '0' + ((num >> (63 - i)) & 0x01);
  145. }
  146. }
  147. static inline size_t roundup_power2(size_t v){
  148. if(v == 0) return 0;
  149. v --;
  150. v |= v >> 1;
  151. v |= v >> 2;
  152. v |= v >> 4;
  153. v |= v >> 8;
  154. v |= v >> 16;
  155. return v + 1;
  156. }
  157. static inline size_t roundup_times(size_t v, size_t base){
  158. return (v + base - 1) / base * base;
  159. }
  160. static inline void* malloc16(size_t size){
  161. u1i *p, *q;
  162. p = malloc(size + 16);
  163. if(p == NULL) return NULL;
  164. q = (u1i*)(((u8i)(p + 16)) & (~0xFLLU));
  165. *(q - 1) = q - p;
  166. return q;
  167. }
  168. static inline void free16(void *ptr){
  169. u1i *p, *q;
  170. q = (u1i*)ptr;
  171. p = q - *(q - 1);
  172. free(p);
  173. }
  174. static inline size_t encap_list(void **buffer, size_t e_size, size_t size, size_t cur_cap, size_t inc, int mem_zeros, size_t n_head){
  175. void *ptr;
  176. size_t cap;
  177. if(cur_cap - size >= inc) return cur_cap;
  178. if(MAX_U8 - inc <= size){
  179. fprintf(stderr, " -- Overflow(64bits) %llu + %llu, in %s -- %s:%d --\n", (u8i)size, (u8i)inc, __FUNCTION__, __FILE__, __LINE__);
  180. print_backtrace(stderr, 20);
  181. abort();
  182. }
  183. if(MAX_U8 - inc < 0x3FFFFFFFLLU){
  184. fprintf(stderr, " -- Overflow(64bits) %llu + %llu, in %s -- %s:%d --\n", (u8i)size, (u8i)inc, __FUNCTION__, __FILE__, __LINE__);
  185. print_backtrace(stderr, 20);
  186. abort();
  187. }
  188. if(size + inc < 0x3FFFFFFFLLU){
  189. cap = roundup_power2(size + inc);
  190. } else {
  191. cap = (size + inc + 0x3FFFFFFFLLU) & (MAX_U8 << 30);
  192. }
  193. ptr = realloc((*buffer) - n_head * e_size, e_size * (cap + n_head));
  194. if(ptr == NULL){
  195. fprintf(stderr, " -- Out of memory, try to allocate %llu bytes, old size %llu, old addr %p in %s -- %s:%d --\n", (unsigned long long)(e_size * (cap + n_head)), (unsigned long long)(e_size * (cur_cap + n_head)), *buffer, __FUNCTION__, __FILE__, __LINE__);
  196. print_backtrace(stderr, 20);
  197. abort();
  198. }
  199. *buffer = ptr + n_head * e_size;
  200. if(mem_zeros) memset((*buffer) + (cur_cap * e_size), 0, e_size * (cap - cur_cap));
  201. return cap;
  202. }
  203. #define ZEROS(e) memset((void*)(e), 0, sizeof(*(e)))
  204. #ifndef __USE_GNU
  205. # define TEMP_FAILURE_RETRY(expression) \
  206. ({ \
  207. long int __result; \
  208. do __result = (long int) (expression); \
  209. while (__result == -1L && errno == EINTR); \
  210. __result; \
  211. })
  212. #endif
  213. static inline void nano_sleep(u8i nsec){
  214. struct timespec timeout;
  215. timeout.tv_sec = nsec/1000000000;
  216. timeout.tv_nsec = nsec%1000000000;
  217. nanosleep(&timeout, NULL);
  218. }
  219. #define micro_sleep(usec) nano_sleep(((u8i)(usec)) * 1000LLU)
  220. #define microsleep(usec) micro_sleep(usec)
  221. static inline long long microtime(){
  222. struct timeval tv;
  223. gettimeofday(&tv, NULL);
  224. return ((long long)tv.tv_sec) * 1000000 + tv.tv_usec;
  225. }
  226. static inline char* date(){
  227. time_t tm;
  228. char *dstr, *p;
  229. tm = time(NULL);
  230. p = dstr = asctime(localtime(&tm));
  231. while(*p){
  232. if(*p == '\n'){ *p = 0; break; }
  233. p ++;
  234. }
  235. return dstr;
  236. }
  237. static inline int replace_char(char *str, char src, char dst, int max){
  238. int ret;
  239. ret = 0;
  240. while(*str){
  241. if((*str) == src){
  242. (*str) = dst;
  243. ret ++;
  244. if(ret == max) break;
  245. }
  246. str ++;
  247. }
  248. return ret;
  249. }
  250. static inline int file_exists(const char *filename){
  251. char *realpath;
  252. struct stat s;
  253. realpath = canonicalize_file_name(filename);
  254. if(realpath == NULL) return 0;
  255. if(stat(realpath, &s) == -1){ free(realpath); return 0; }
  256. free(realpath);
  257. switch(s.st_mode & S_IFMT){
  258. //case S_IFBLK:
  259. //case S_IFCHR:
  260. //case S_IFDIR:
  261. //case S_IFIFO:
  262. //case S_IFSOCK:
  263. //case S_IFLNK:
  264. case S_IFREG: return 1;
  265. default: return 0;
  266. }
  267. }
  268. static inline int dir_exists(const char *filename){
  269. char *realpath;
  270. struct stat s;
  271. realpath = canonicalize_file_name(filename);
  272. if(realpath == NULL) return 0;
  273. if(stat(realpath, &s) == -1){ free(realpath); return 0; }
  274. free(realpath);
  275. switch(s.st_mode & S_IFMT){
  276. //case S_IFBLK:
  277. //case S_IFCHR:
  278. //case S_IFREG:
  279. //case S_IFIFO:
  280. //case S_IFSOCK:
  281. //case S_IFLNK:
  282. case S_IFDIR: return 1;
  283. default: return 0;
  284. }
  285. }
  286. static inline char* relative_filename(char *filename){
  287. char *ptr;
  288. if(filename == NULL) return NULL;
  289. ptr = filename + strlen(filename);
  290. while(ptr >= filename){
  291. if(*ptr == '/') break;
  292. ptr --;
  293. }
  294. return strdup(ptr + 1);
  295. }
  296. static inline char* absolute_filename(char *filename){
  297. char *path, *cwd, *ptr;
  298. int x, y, z, i;
  299. if(filename == NULL) return NULL;
  300. if(filename[0] == '/') return strdup(filename);
  301. cwd = getcwd(NULL, 0);
  302. path = malloc(strlen(cwd) + strlen(filename) + 2);
  303. x = 0;
  304. y = 0;
  305. z = 0;
  306. ptr = filename;
  307. while(*ptr){
  308. if((*ptr) == '.'){
  309. z ++;
  310. if(z > 2) break;
  311. } else if((*ptr) == '/'){
  312. y = ptr - filename + 1;
  313. if(z == 2) x ++;
  314. z = 0;
  315. } else {
  316. break;
  317. }
  318. ptr ++;
  319. }
  320. z = 0;
  321. i = strlen(cwd);
  322. while(x && i){
  323. while(i){
  324. i --;
  325. if(cwd[i] == '/') break;
  326. }
  327. x --;
  328. }
  329. if(x || i == 0){
  330. fprintf(stderr, " -- BAD File name: '%s'. PWD = '%s' --\n", filename, cwd); fflush(stderr);
  331. free(cwd);
  332. return NULL;
  333. }
  334. strncpy(path, cwd, i);
  335. free(cwd);
  336. path[i] = '/';
  337. strncpy(path + i + 1, filename + y, strlen(filename) - y);
  338. path[i + 1 + strlen(filename) - y] = 0;
  339. return path;
  340. }
  341. static inline int exists_file(char *dir, char *filename){
  342. char *realpath, *fullname;
  343. int ret;
  344. realpath = absolute_filename(dir? dir : ".");
  345. if(!dir_exists(realpath)){ free(realpath); return 0; }
  346. fullname = malloc(strlen(realpath) + strlen(filename) + 3);
  347. sprintf(fullname, "%s/%s", realpath, filename);
  348. free(realpath);
  349. ret = file_exists(fullname);
  350. free(fullname);
  351. return ret;
  352. }
  353. static inline FILE* open_file_for_read(char *name, char *suffix){
  354. char *full_name;
  355. FILE *file;
  356. if(name == NULL && suffix == NULL){
  357. full_name = "-";
  358. } else if(suffix == NULL){
  359. full_name = name;
  360. } else {
  361. full_name = (char*)alloca(strlen(name) + strlen(suffix) + 1);
  362. memcpy(full_name, name, strlen(name));
  363. memcpy(full_name + strlen(name), suffix, strlen(suffix) + 1);
  364. }
  365. if(strcmp(full_name, "-") == 0){
  366. file = stdin;
  367. } else {
  368. file = fopen(full_name, "r");
  369. }
  370. if(file == NULL){
  371. fprintf(stderr, "Cannot open file for read: %s\n", full_name);
  372. perror(NULL);
  373. exit(1);
  374. }
  375. return file;
  376. }
  377. static inline FILE* open_file_for_write(char *name, char *suffix, int overwrite){
  378. char *full_name;
  379. FILE *file;
  380. if(name == NULL && suffix == NULL){
  381. full_name = "-";
  382. } else if(suffix == NULL){
  383. full_name = name;
  384. } else {
  385. full_name = (char*)alloca(strlen(name) + strlen(suffix) + 1);
  386. memcpy(full_name, name, strlen(name));
  387. memcpy(full_name + strlen(name), suffix, strlen(suffix) + 1);
  388. }
  389. if(strcmp(full_name, "-") == 0){
  390. file = stdout;
  391. } else if(!overwrite && file_exists(full_name)){
  392. fprintf(stderr, "File exists: %s\n", full_name); exit(1);
  393. } else {
  394. file = fopen(full_name, "w+");
  395. }
  396. if(file == NULL){
  397. fprintf(stderr, "Cannot open file for write: %s\n", full_name);
  398. perror(NULL);
  399. exit(1);
  400. }
  401. return file;
  402. }
  403. static inline FILE* open_file_for_append(char *name, char *suffix){
  404. char *full_name;
  405. FILE *file;
  406. if(name == NULL && suffix == NULL){
  407. full_name = "-";
  408. } else if(suffix == NULL){
  409. full_name = name;
  410. } else {
  411. full_name = (char*)alloca(strlen(name) + strlen(suffix) + 1);
  412. memcpy(full_name, name, strlen(name));
  413. memcpy(full_name + strlen(name), suffix, strlen(suffix) + 1);
  414. }
  415. if(strcmp(full_name, "-") == 0){
  416. file = stdout;
  417. } else {
  418. file = fopen(full_name, "a+");
  419. }
  420. if(file == NULL){
  421. fprintf(stderr, "Cannot open file for append: %s\n", full_name);
  422. perror(NULL);
  423. exit(1);
  424. }
  425. return file;
  426. }
  427. static inline void close_file(FILE *file){
  428. if(file == NULL) return;
  429. if(file == stdin || file == stdout || file == stderr) return;
  430. if(fclose(file)) perror("Error on close file");
  431. }
  432. #define STEP_WISE_BUFF_SIZE 4096
  433. static inline size_t fread_stepwise(void *_ptr, size_t size, size_t ne, FILE *stream){
  434. void *ptr;
  435. size_t ret, len, n, sz;
  436. ret = 0;
  437. ptr = _ptr;
  438. sz = STEP_WISE_BUFF_SIZE / size;
  439. if(sz < 1) sz = 1;
  440. while(ne){
  441. len = num_min(ne, sz);
  442. if((n = fread(ptr, size, len, stream)) == 0){
  443. break;
  444. }
  445. ret += n;
  446. ptr += n;
  447. ne -= n;
  448. }
  449. return ret;
  450. }
  451. //static inline u8i total_sys_memory(){ return getpagesize() * get_phys_pages(); }
  452. //static inline u8i avail_sys_memory(){ return getpagesize() * get_avphys_pages(); }
  453. //static inline u8i proc_maxrss_memory(){ struct rusage ru; if(getrusage(RUSAGE_SELF, &ru) != -1){ return ru.ru_maxrss * 1024; } else { return 0; } }
  454. /*
  455. * runtime memory usage, adopt from Heng's runlib
  456. */
  457. static inline int get_linux_sys_info(u8i *memtotal, u8i *memavail, int *ncpu){
  458. FILE *fp;
  459. char buffer[64];
  460. u8i freed, buffered, cached;
  461. int core;
  462. if(memtotal || memavail){
  463. freed = buffered = cached = 0;
  464. fp = open_file_for_read("/proc/meminfo", NULL);
  465. while((fscanf(fp, "%s", buffer)) > 0){
  466. if (strstr(buffer, "MemTotal") == buffer) {
  467. fscanf(fp, "%llu", memtotal);
  468. (*memtotal) *= 1024;
  469. } else if (strstr(buffer, "MemFree") == buffer) {
  470. fscanf(fp, "%llu", &freed);
  471. } else if (strstr(buffer, "Buffers") == buffer) {
  472. fscanf(fp, "%llu", &buffered);
  473. } else if (strstr(buffer, "Cached") == buffer) {
  474. fscanf(fp, "%llu", &cached);
  475. }
  476. }
  477. fclose(fp);
  478. if(memavail){
  479. *memavail = (freed + buffered + cached) * 1024;
  480. }
  481. }
  482. if(ncpu){
  483. fp = open_file_for_read("/proc/cpuinfo", NULL);
  484. core = 0;
  485. while((fscanf(fp, "%s", buffer)) > 0){
  486. if (strstr(buffer, "processor") == buffer) {
  487. core ++;
  488. }
  489. }
  490. fclose(fp);
  491. *ncpu = core;
  492. }
  493. return 0;
  494. }
  495. static inline int get_linux_proc_info(u8i *rss, u8i *vsize, double *utime, double *stime){
  496. int c, n_spc;
  497. char str[64];
  498. FILE *fp;
  499. unsigned long tmp, tmp2;
  500. size_t page_size;
  501. *rss = *vsize = 0;
  502. *utime = *stime = 0;
  503. //page_size = getpagesize();
  504. page_size = sysconf(_SC_PAGESIZE);
  505. sprintf(str, "/proc/%u/stat", getpid());
  506. fp = open_file_for_read(str, NULL);
  507. n_spc = 0;
  508. while ((c = fgetc(fp)) != EOF) {
  509. if (c == ' ') ++n_spc;
  510. if (n_spc == 13) break;
  511. }
  512. fscanf(fp, "%lu%lu", &tmp, &tmp2);
  513. *utime = tmp / 100.0;
  514. *stime = tmp2 / 100.0;
  515. ++n_spc;
  516. while ((c = fgetc(fp)) != EOF) {
  517. if (c == ' ') ++n_spc;
  518. if (n_spc == 22) break;
  519. }
  520. fscanf(fp, "%lu%lu", &tmp, &tmp2);
  521. fclose(fp);
  522. *vsize = tmp;
  523. *rss = tmp2 * page_size;
  524. return 0;
  525. }
  526. thread_beg_def(_proc_deamon);
  527. u8i memtotal, memavail;
  528. int ncpu;
  529. u8i max_rss, max_vsz;
  530. u8i rss_limit;
  531. double utime, stime, rtime;
  532. double rtime_limit;
  533. int interval;
  534. thread_end_def(_proc_deamon);
  535. static struct _proc_deamon_struct* _sig_proc_deamon = NULL;
  536. static inline void print_proc_stat_info(int signum){
  537. FILE *log;
  538. if(_sig_proc_deamon == NULL) return;
  539. log = stderr;
  540. thread_beg_syn_read(_sig_proc_deamon);
  541. fprintf(log, "** PROC_STAT(%d) **: real %.3f sec, user %.3f sec, sys %.3f sec, maxrss %.1f kB, maxvsize %.1f kB\n", signum, _sig_proc_deamon->rtime, _sig_proc_deamon->utime, _sig_proc_deamon->stime, _sig_proc_deamon->max_rss / 1024.0, _sig_proc_deamon->max_vsz / 1024.0);
  542. thread_end_syn_read(_sig_proc_deamon);
  543. //if(signum > 0) fprintf(log, "-- noticed by signal %d\n", signum);
  544. //else fprintf(log, "-- noticed by program\n");
  545. //fprintf(log, "-- real %16.3f sec\n", _sig_proc_deamon->rtime);
  546. //fprintf(log, "-- user %16.3f sec\n", _sig_proc_deamon->utime);
  547. //fprintf(log, "-- sys %16.3f sec\n", _sig_proc_deamon->stime);
  548. //fprintf(log, "-- maxrss %16.3f kB\n", _sig_proc_deamon->max_rss / 1024.0);
  549. //fprintf(log, "-- maxvsize %16.3f kB\n", _sig_proc_deamon->max_vsz / 1024.0);
  550. //fprintf(log, "--\n");
  551. fflush(log);
  552. }
  553. static inline void _deamon_config_proc_limit(int signum){
  554. char *val;
  555. u8i rss_limit, rtime_limit;
  556. UNUSED(signum);
  557. if(_sig_proc_deamon == NULL) return;
  558. thread_beg_syn_write(_sig_proc_deamon);
  559. val = getenv("LIMIT_RSS");
  560. if(val){
  561. rss_limit = atol(val) * 1024 * 1024;
  562. } else {
  563. rss_limit = 0;
  564. }
  565. val = getenv("LIMIT_RTIME");
  566. if(val){
  567. rtime_limit = atol(val);
  568. } else {
  569. rtime_limit = 0;
  570. }
  571. _sig_proc_deamon->rss_limit = rss_limit;
  572. _sig_proc_deamon->rtime_limit = rtime_limit;
  573. fprintf(stderr, "** PROC_LIMIT: max rss = %llu MB rtime = %llu secs. **\n", rss_limit / 1024 * 1024, rtime_limit);
  574. thread_end_syn_write(_sig_proc_deamon);
  575. }
  576. thread_beg_func(_proc_deamon);
  577. u8i rss, vsz;
  578. u8i cb, ce;
  579. cb = microtime();
  580. get_linux_sys_info((u8i*)&_proc_deamon->memtotal, (u8i*)&_proc_deamon->memavail, (int*)&_proc_deamon->ncpu);
  581. _proc_deamon->max_rss = 0;
  582. _proc_deamon->max_vsz = 0;
  583. _proc_deamon->rtime = 0;
  584. _proc_deamon->rss_limit = 0;
  585. _proc_deamon->rtime_limit = 0;
  586. _proc_deamon->interval = 100000; // 0.1 sec
  587. get_linux_proc_info(&rss, &vsz, (double*)&_proc_deamon->utime, (double*)&_proc_deamon->stime);
  588. _sig_proc_deamon = (struct _proc_deamon_struct*)_proc_deamon;
  589. signal(SIGUSR1, _deamon_config_proc_limit);
  590. signal(SIGUSR2, print_proc_stat_info);
  591. _proc_deamon->once = 0; // Don't set ->state to 0 at thread_end_loop
  592. thread_beg_loop(_proc_deamon);
  593. thread_beg_syn_write(_proc_deamon);
  594. get_linux_proc_info(&rss, &vsz, (double*)&_proc_deamon->utime, (double*)&_proc_deamon->stime);
  595. if(rss > _proc_deamon->max_rss) _proc_deamon->max_rss = rss;
  596. if(vsz > _proc_deamon->max_vsz) _proc_deamon->max_vsz = vsz;
  597. ce = microtime();
  598. _proc_deamon->rtime = (ce - cb) / 1000000.0;
  599. thread_end_syn_write(_proc_deamon);
  600. if(_proc_deamon->rss_limit && rss > _proc_deamon->rss_limit){
  601. fprintf(stderr, "-- Exceed memory limit: %llu > %llu\n", rss, _proc_deamon->rss_limit);
  602. abort();
  603. }
  604. if(_proc_deamon->rtime_limit){
  605. if(_proc_deamon->rtime > _proc_deamon->rtime_limit){
  606. fprintf(stderr, "-- Timeout: %16.3f > %16.3f\n", _proc_deamon->rtime, _proc_deamon->rtime_limit);
  607. abort();
  608. }
  609. }
  610. microsleep(_proc_deamon->interval); // 0.1 sec
  611. thread_end_loop(_proc_deamon);
  612. get_linux_proc_info(&rss, &vsz, (double*)&_proc_deamon->utime, (double*)&_proc_deamon->stime);
  613. if(rss > _proc_deamon->max_rss) _proc_deamon->max_rss = rss;
  614. if(vsz > _proc_deamon->max_vsz) _proc_deamon->max_vsz = vsz;
  615. ce = microtime();
  616. _proc_deamon->rtime = (ce - cb) / 1000000.0;
  617. thread_end_func(_proc_deamon);
  618. #if defined(__linux__) || defined(__unix__) || defined(__CYGWIN__)
  619. #define BEG_STAT_PROC_INFO(log, argc, argv) \
  620. thread_preprocess(_proc_deamon); \
  621. thread_beg_init(_proc_deamon, 1); \
  622. thread_end_init(_proc_deamon); \
  623. thread_wake_all(_proc_deamon); \
  624. if(log){ \
  625. fprintf(log, "--\n"); \
  626. fprintf(log, "-- total memory %16.1f kB\n", _proc_deamon->memtotal / 1024.0); \
  627. fprintf(log, "-- available %16.1f kB\n", _proc_deamon->memavail / 1024.0); \
  628. fprintf(log, "-- %d cores\n", _proc_deamon->ncpu); \
  629. int i; \
  630. char **opts; \
  631. opts = (char**)argv; \
  632. fprintf(log, "-- Starting program:"); \
  633. for(i=0;i<argc;i++) fprintf(log, " %s", opts[i]); \
  634. fprintf(log, "\n"); \
  635. fprintf(log, "-- pid %16d\n", getpid()); \
  636. fprintf(log, "-- date %s\n", date()); \
  637. fprintf(log, "--\n"); \
  638. fflush(log); \
  639. }
  640. #else
  641. #define BEG_STAT_PROC_INFO(log, argc, argv) \
  642. if(log){ \
  643. int i; \
  644. char **opts; \
  645. opts = (char**)argv; \
  646. fprintf(log, "-- Starting program:"); \
  647. for(i=0;i<argc;i++) fprintf(log, " %s", opts[i]); \
  648. fprintf(log, "\n"); \
  649. fflush(log); \
  650. }
  651. #endif
  652. #if defined(__linux__) || defined(__unix__) || defined(__CYGWIN__)
  653. #define SET_PROC_LIMIT(memory, time) \
  654. thread_beg_iter(_proc_deamon); \
  655. _proc_deamon->rss_limit = memory; \
  656. _proc_deamon->rtime_limit = time; \
  657. thread_end_iter(_proc_deamon)
  658. #else
  659. #define SET_PROC_LIMIT(memory, time)
  660. #endif
  661. #if defined(__linux__) || defined(__unix__) || defined(__CYGWIN__)
  662. #define END_STAT_PROC_INFO(log) \
  663. _proc_deamon->once = 1; \
  664. thread_beg_close(_proc_deamon); \
  665. if(log){ \
  666. fprintf(log, "** PROC_STAT(TOTAL) **: real %.3f sec, user %.3f sec, sys %.3f sec, maxrss %.1f kB, maxvsize %.1f kB\n---\n", _sig_proc_deamon->rtime, _sig_proc_deamon->utime, _sig_proc_deamon->stime, _sig_proc_deamon->max_rss / 1024.0, _sig_proc_deamon->max_vsz / 1024.0); \
  667. } \
  668. thread_end_close(_proc_deamon)
  669. #else
  670. #define END_STAT_PROC_INFO(log) \
  671. if(log){ \
  672. fprintf(log, "-- proc stat failed: only support 'linux, unix, cygwin' OS --\n"); \
  673. }
  674. #endif
  675. // Object I/O
  676. /**
  677. * Careful: when two pointers refer to the same addr of a object, we cannot make sure of it after mem_load
  678. */
  679. #ifndef OBJ_DESC_MAX_CHILD
  680. #define OBJ_DESC_MAX_CHILD 64
  681. #endif
  682. static inline size_t mem_size_round(size_t size){ return (size + 7) & 0xFFFFFFFFFFFFFFF8LLU; }
  683. static inline uint8_t mem_size_gap(size_t size){ return (size & 0x07U)? 8 - (size & 0x07U) : 0; }
  684. static inline size_t mem_dump(void *mem, size_t len, FILE *out){
  685. size_t size;
  686. uint8_t i, v;
  687. if(mem == NULL) return 0;
  688. size = mem_size_round(len);
  689. if(out){
  690. fwrite(mem, 1, len, out);
  691. v = 0;
  692. for(i=0;i<mem_size_gap(len);i++) fwrite(&v, 1, 1, out);
  693. }
  694. return size;
  695. }
  696. typedef size_t (*mem_array_count)(void *obj, int idx);
  697. typedef void (*mem_load_post)(void *obj, size_t aux_data);
  698. struct obj_desc_t;
  699. #define MEM_PTR_TYPE_DUMP 1 // whether it take bytes
  700. #define MEM_PTR_TYPE_POINTER 2 // take desc->size or sizeof(void*) bytes
  701. typedef struct obj_desc_t {
  702. const char *tag;
  703. size_t size; // If size = 0, it is virtual, mem_type will be OR with MEM_PTR_TYPE_DUMP. See OBJ_DESC_CHAR_ARRAY
  704. int n_child; // <= OBJ_DESC_MAX_CHILD.
  705. uint8_t mem_type[OBJ_DESC_MAX_CHILD];
  706. off_t addr[OBJ_DESC_MAX_CHILD]; // offsetof(type, field)
  707. const struct obj_desc_t *desc[OBJ_DESC_MAX_CHILD];
  708. mem_array_count cnt;
  709. mem_load_post post;
  710. } obj_desc_t;
  711. // Basic obj_desc_t, size = 1 byte
  712. static const struct obj_desc_t OBJ_DESC_DATA = {"OBJ_DESC_DATA", 1, 0, {}, {}, {}, NULL, NULL};
  713. // Special obj_desc_t for string, set mem_type=0 and addr=0 to call the _char_array_obj_desc_cnt on itself
  714. // so that we know the length of string, then set size=0 to indicate that it is an virtual reference, program should add MEM_PTR_TYPE_DUMP to its mem_type
  715. static inline size_t _char_array_obj_desc_cnt(void *obj, int idx){ if(idx == 0 && obj) return strlen((char*)obj) + 1; else return 0; }
  716. static const struct obj_desc_t OBJ_DESC_CHAR_ARRAY = {"OBJ_DESC_CHAR_ARRAY", 0, 1, {0}, {0}, {&OBJ_DESC_DATA}, _char_array_obj_desc_cnt, NULL};
  717. static inline size_t mem_size_obj(void *obj, uint8_t mem_type, const obj_desc_t *desc, size_t size, size_t cnt){
  718. size_t m;
  719. void *ref;
  720. int i;
  721. if(desc == NULL) return size;
  722. if(obj == NULL) return size;
  723. switch(mem_type){
  724. case 3: size += mem_size_round(sizeof(void*) * cnt);
  725. case 2:
  726. for(m=0;m<cnt;m++) if(((void**)obj)[m]) size += mem_size_round(desc->size);
  727. break;
  728. case 1: size += mem_size_round(cnt * desc->size); // TODO: if desc == &OBJ_DESC_DATA, mem_size_round may waste many memory
  729. case 0: break;
  730. }
  731. if(desc->n_child == 0) return size;
  732. for(m=0;m<cnt;m++){
  733. if(mem_type & 0x02){
  734. ref = ((void**)obj)[m];
  735. if(ref == NULL) continue;
  736. } else {
  737. ref = obj + m * desc->size;
  738. }
  739. for(i=0;i<desc->n_child;i++){
  740. if(desc->mem_type[i] & 0x01){
  741. size += mem_size_obj(*((void**)(ref + desc->addr[i])), desc->mem_type[i] | (desc->size? 0 : MEM_PTR_TYPE_DUMP), desc->desc[i], 0, desc->cnt? desc->cnt(ref, i) : 1);
  742. } else {
  743. size += mem_size_obj(ref + desc->addr[i], desc->mem_type[i] | (desc->size? 0 : MEM_PTR_TYPE_DUMP), desc->desc[i], 0, desc->cnt? desc->cnt(ref, i) : 1);
  744. }
  745. }
  746. }
  747. return size;
  748. }
  749. static inline void mem_dup_obj(void **ret, void *obj, size_t aux_data, uint8_t mem_type, const obj_desc_t *desc, size_t cnt){
  750. size_t m;
  751. void *ref, *chd;
  752. int i;
  753. if(desc == NULL || obj == NULL){ *ret = NULL; return; }
  754. if(mem_type & 0x01){
  755. if(mem_type & 0x02){
  756. *ret = calloc(cnt, sizeof(void*) * cnt);
  757. } else if(desc->size){
  758. *ret = calloc(cnt, desc->size);
  759. memcpy(*ret, obj, desc->size * cnt);
  760. } else {
  761. // OBJ_DESC_CHAR_ARRAY
  762. }
  763. }
  764. if(desc->n_child == 0 && desc->post == NULL){
  765. //if((mem_type & 0x02) == 0 && desc->n_child == 0){
  766. } else {
  767. for(m=0;m<cnt;m++){
  768. if(mem_type & 0x02){
  769. ref = ((void**)obj)[m];
  770. if(ref == NULL) continue;
  771. chd = malloc(desc->size);
  772. memcpy(chd, ref, desc->size);
  773. ret[m] = chd;
  774. } else if(desc->size){
  775. ref = obj + m * desc->size;
  776. chd = (*ret) + m * desc->size;
  777. } else {
  778. ref = obj;
  779. chd = ret;
  780. }
  781. for(i=0;i<desc->n_child;i++){
  782. if(desc->mem_type[i] & 0x01){
  783. mem_dup_obj((void**)(chd + desc->addr[i]), *((void**)(ref + desc->addr[i])), aux_data, desc->mem_type[i] | (desc->size? 0 : MEM_PTR_TYPE_DUMP), desc->desc[i], desc->cnt? desc->cnt(ref, i) : 1);
  784. } else {
  785. mem_dup_obj((void**)(chd + desc->addr[i]), ref + desc->addr[i], aux_data, desc->mem_type[i] | (desc->size? 0 : MEM_PTR_TYPE_DUMP), desc->desc[i], desc->cnt? desc->cnt(ref, i) : 1);
  786. }
  787. }
  788. if(desc->post) desc->post(chd, aux_data);
  789. }
  790. }
  791. }
  792. static inline size_t mem_dump_obj(void *obj, uint8_t mem_type, const obj_desc_t *desc, size_t offset, size_t cnt, FILE *out, int mem_free){
  793. void *ref;
  794. size_t size, m;
  795. int i;
  796. if(obj == NULL) return offset;
  797. size = offset;
  798. if(mem_type & 0x01){
  799. if(mem_type & 0x02){
  800. size += mem_dump(obj, cnt * sizeof(void*), out);
  801. } else {
  802. size += mem_dump(obj, cnt * desc->size, out);
  803. }
  804. }
  805. if((mem_type & 0x02) == 0 && desc->n_child == 0){
  806. } else {
  807. for(m=0;m<cnt;m++){
  808. if(mem_type & 0x02){
  809. ref = ((void**)obj)[m];
  810. if(ref == NULL) continue;
  811. size += mem_dump(ref, desc->size, out);
  812. } else {
  813. ref = obj + m * desc->size;
  814. }
  815. for(i=0;i<desc->n_child;i++){
  816. if(desc->mem_type[i] & 0x01){
  817. size = mem_dump_obj(*((void**)(ref + desc->addr[i])), desc->mem_type[i] | (desc->size? 0 : MEM_PTR_TYPE_DUMP), desc->desc[i], size, desc->cnt? desc->cnt(ref, i) : 1, out, mem_free);
  818. } else {
  819. size = mem_dump_obj(ref + desc->addr[i], desc->mem_type[i] | (desc->size? 0 : MEM_PTR_TYPE_DUMP), desc->desc[i], size, desc->cnt? desc->cnt(ref, i) : 1, out, mem_free);
  820. }
  821. }
  822. }
  823. }
  824. if(mem_free){
  825. if((mem_type & 0x02) && desc->size) for(m=0;m<cnt;m++) free(((void**)obj)[m]);
  826. if((mem_type & 0x01) && ((mem_type & 0x02) | desc->size)) free(obj);
  827. }
  828. return size;
  829. }
  830. static inline size_t mem_load_obj(void *obj, size_t aux_data, uint8_t mem_type, const obj_desc_t *desc, size_t addr_beg, size_t cnt){
  831. size_t addr, m;
  832. int i;
  833. void *ref, **ptr;
  834. if(obj == NULL) return 0;
  835. addr = addr_beg? : (size_t)obj;
  836. if(mem_type & 0x01){
  837. if(mem_type & 0x02){
  838. addr += mem_size_round(cnt * sizeof(void*));
  839. } else {
  840. addr += mem_size_round(cnt * desc->size);
  841. }
  842. }
  843. if(desc->n_child == 0 && desc->post == NULL){
  844. switch(mem_type){
  845. case 2:
  846. case 3:
  847. for(m=0;m<cnt;m++){
  848. ptr = ((void**)obj) + m;
  849. if(*ptr == NULL) continue;
  850. *ptr = (void*)addr;
  851. addr += mem_size_round(desc->size);
  852. }
  853. default: return addr;
  854. }
  855. }
  856. for(m=0;m<cnt;m++){
  857. if(mem_type & 0x02){
  858. ptr = ((void**)obj) + m;
  859. if(*ptr == NULL) continue;
  860. ref = *ptr = (void*)addr;
  861. addr += mem_size_round(desc->size);
  862. } else {
  863. ref = obj + m * desc->size;
  864. }
  865. for(i=0;i<desc->n_child;i++){
  866. ptr = ref + desc->addr[i];
  867. if(desc->mem_type[i] & 0x01){
  868. if(*ptr == NULL) continue;
  869. *ptr = (void*)addr;
  870. addr = mem_load_obj(*ptr, aux_data, desc->mem_type[i] | (desc->size? 0 : MEM_PTR_TYPE_DUMP), desc->desc[i], addr, desc->cnt? desc->cnt(ref, i) : 1);
  871. } else {
  872. addr = mem_load_obj((void*)ptr, aux_data, desc->mem_type[i] | (desc->size? 0 : MEM_PTR_TYPE_DUMP), desc->desc[i], addr, desc->cnt? desc->cnt(ref, i) : 1);
  873. }
  874. }
  875. if(desc->post) desc->post(ref, aux_data);
  876. }
  877. return addr;
  878. }
  879. static inline size_t mem_tree_obj(FILE *out, void *obj, size_t mem_type, const obj_desc_t *desc, size_t addr, size_t cnt, size_t max_cnt, int level, int max_level){
  880. size_t m;
  881. int i, j;
  882. void *ref, **ptr;
  883. if(obj == NULL) return 0;
  884. if(addr == 0) addr = (size_t)obj;
  885. if(max_level <= 0 || level <= max_level){
  886. for(j=0;j<level;j++) fputc('-', out);
  887. fprintf(out, "%s:%p:%llu:%llu:", desc->tag, obj, (u8i)mem_type, (u8i)cnt);
  888. }
  889. if(mem_type & 0x01){
  890. if(mem_type & 0x02){
  891. addr += mem_size_round(cnt * sizeof(void*));
  892. } else {
  893. addr += mem_size_round(cnt * desc->size);
  894. }
  895. }
  896. if(desc->n_child == 0){
  897. if(mem_type == 3){
  898. for(m=0;m<cnt;m++){
  899. ptr = ((void**)obj) + m;
  900. if(*ptr == NULL) continue;
  901. addr += mem_size_round(desc->size);
  902. }
  903. }
  904. if(max_level <= 0 || level <= max_level) fprintf(out, "%llu\n", (u8i)(addr - (size_t)obj));
  905. return addr;
  906. }
  907. if(max_level <= 0 || level <= max_level) fprintf(out, "%llu\n", (u8i)(addr - (size_t)obj));
  908. for(m=0;m<cnt;m++){
  909. if(cnt > 1 && (max_level <= 0 || level <= max_level) && (max_cnt == 0 || m < max_cnt)){
  910. for(j=0;j<level;j++) fputc('-', out);
  911. fprintf(out, "[%llu/%llu]\n", (u8i)m, (u8i)cnt);
  912. }
  913. if(mem_type & 0x02){
  914. ptr = ((void**)obj) + m;
  915. if(*ptr == NULL) continue;
  916. ref = (void*)addr;
  917. addr += mem_size_round(desc->size);
  918. } else {
  919. ref = obj + m * desc->size;
  920. }
  921. for(i=0;i<desc->n_child;i++){
  922. ptr = ref + desc->addr[i];
  923. if(desc->mem_type[i] & 0x01){
  924. if(*ptr == NULL) continue;
  925. if(max_cnt && m >= max_cnt){
  926. addr = mem_tree_obj(out, (void*)addr, desc->mem_type[i] | (desc->size? 0 : MEM_PTR_TYPE_DUMP), desc->desc[i], addr, desc->cnt? desc->cnt(ref, i) : 1, max_cnt, 2, 1);
  927. } else {
  928. addr = mem_tree_obj(out, (void*)addr, desc->mem_type[i] | (desc->size? 0 : MEM_PTR_TYPE_DUMP), desc->desc[i], addr, desc->cnt? desc->cnt(ref, i) : 1, max_cnt, level + 1, max_level);
  929. }
  930. } else {
  931. if(max_cnt && m >= max_cnt){
  932. addr = mem_tree_obj(out, (void*)ptr, desc->mem_type[i] | (desc->size? 0 : MEM_PTR_TYPE_DUMP), desc->desc[i], addr, desc->cnt? desc->cnt(ref, i) : 1, max_cnt, 2, 1);
  933. } else {
  934. addr = mem_tree_obj(out, (void*)ptr, desc->mem_type[i] | (desc->size? 0 : MEM_PTR_TYPE_DUMP), desc->desc[i], addr, desc->cnt? desc->cnt(ref, i) : 1, max_cnt, level + 1, max_level);
  935. }
  936. }
  937. }
  938. }
  939. return addr;
  940. }
  941. static inline const obj_desc_t* mem_locate_obj(void *obj, size_t *_mem_type, const obj_desc_t *desc, u4i *trace_childs, size_t *trace_cnts, u4i ntrace, size_t *addr, size_t *cnt, int selected){
  942. const obj_desc_t *ret;
  943. size_t m, mem_type;
  944. u4i ns;
  945. int i, nc;
  946. void *ref, **ptr;
  947. if(obj == NULL) return desc;
  948. if(*addr == 0) *addr = (size_t)obj;
  949. if(selected && ntrace == 0) return desc;
  950. mem_type = *_mem_type;
  951. if(mem_type & 0x01){
  952. if(mem_type & 0x02){
  953. *addr += mem_size_round((*cnt) * sizeof(void*));
  954. } else {
  955. *addr += mem_size_round((*cnt) * desc->size);
  956. }
  957. }
  958. if(selected){
  959. if(trace_childs[0] >= (u4i)desc->n_child){
  960. fprintf(stderr, " -- Illegal trace child (%d >= %d) in OBJ_DESC[%s] in %s -- %s:%d --\n", trace_childs[0], desc->n_child, desc->tag, __FUNCTION__, __FILE__, __LINE__);
  961. return desc;
  962. }
  963. if(trace_cnts[0] >= *cnt){
  964. fprintf(stderr, " -- Illegal trace cont (%llu >= %llu) in OBJ_DESC[%s] in %s -- %s:%d --\n", (u8i)trace_cnts[0], (u8i)*cnt, desc->tag, __FUNCTION__, __FILE__, __LINE__);
  965. return desc;
  966. }
  967. }
  968. if(desc->n_child == 0){
  969. switch(mem_type){
  970. case 2:
  971. case 3:
  972. *addr += (*cnt) * mem_size_round(desc->size);
  973. default: return desc;
  974. }
  975. }
  976. ret = desc;
  977. ns = selected? trace_cnts[0] + 1 : *cnt;
  978. for(m=0;m<ns;m++){
  979. if(mem_type & 0x02){
  980. ptr = ((void**)obj) + m;
  981. if(*ptr == NULL){
  982. if(selected && m + 1 == ns){
  983. *_mem_type = desc->mem_type[trace_childs[0]] | (desc->size? 0 : MEM_PTR_TYPE_DUMP);
  984. *cnt = 0;
  985. }
  986. continue;
  987. }
  988. ref = (void*)*addr;
  989. *addr += mem_size_round(desc->size);
  990. } else {
  991. ref = obj + m * desc->size;
  992. }
  993. nc = (selected && m + 1 == ns)? trace_childs[0] + 1 : (u4i)desc->n_child;
  994. for(i=0;i<nc;i++){
  995. ptr = ref + desc->addr[i];
  996. if(desc->mem_type[i] & 0x01){
  997. *_mem_type = desc->mem_type[i] | (desc->size? 0 : MEM_PTR_TYPE_DUMP);
  998. if(*ptr == NULL){
  999. *cnt = 0;
  1000. continue;
  1001. }
  1002. *cnt = desc->cnt? desc->cnt(ref, i) : 1;
  1003. ret = mem_locate_obj((void*)*addr, _mem_type, desc->desc[i], trace_childs + 1, trace_cnts + 1, ntrace - 1, addr, cnt, (selected && m + 1 == ns && i == nc));
  1004. } else {
  1005. *_mem_type = desc->mem_type[i] | (desc->size? 0 : MEM_PTR_TYPE_DUMP);
  1006. *cnt = desc->cnt? desc->cnt(ref, i) : 1;
  1007. ret = mem_locate_obj((void*)ptr, _mem_type, desc->desc[i], trace_childs + 1, trace_cnts + 1, ntrace - 1, addr, cnt, (selected && m + 1 == ns && i == nc));
  1008. }
  1009. }
  1010. }
  1011. return ret;
  1012. }
  1013. static inline size_t mem_dump_obj_file(void *obj, size_t mem_type, const obj_desc_t *desc, size_t cnt, size_t aux_data, FILE *out){
  1014. size_t size;
  1015. if(desc == NULL) return 0;
  1016. if((mem_type & 0x01) == 0){
  1017. fprintf(stderr, " -- Illegal mem_type (%u) to call mem_dump, object should have standalone memory in %s -- %s:%d --\n", (int)mem_type, __FUNCTION__, __FILE__, __LINE__);
  1018. exit(1);
  1019. }
  1020. size = mem_size_obj(obj, mem_type, desc, 0, cnt);
  1021. if(out){
  1022. fwrite(&size, sizeof(size_t), 1, out);
  1023. fwrite(&mem_type, sizeof(size_t), 1, out);
  1024. fwrite(&cnt, sizeof(size_t), 1, out);
  1025. fwrite(&aux_data, sizeof(size_t), 1, out);
  1026. }
  1027. size = 4 * sizeof(size_t);
  1028. size = mem_dump_obj(obj, mem_type, desc, size, cnt, out, 0);
  1029. if(out) fflush(out);
  1030. return size;
  1031. }
  1032. static inline size_t mem_dump_free_obj_file(void *obj, size_t mem_type, const obj_desc_t *desc, size_t cnt, size_t aux_data, FILE *out){
  1033. size_t size;
  1034. if(desc == NULL) return 0;
  1035. if((mem_type & 0x01) == 0){
  1036. fprintf(stderr, " -- Illegal mem_type (%u) to call mem_dump, object should have standalone memory in %s -- %s:%d --\n", (int)mem_type, __FUNCTION__, __FILE__, __LINE__);
  1037. exit(1);
  1038. }
  1039. size = mem_size_obj(obj, mem_type, desc, 0, cnt);
  1040. if(out){
  1041. fwrite(&size, sizeof(size_t), 1, out);
  1042. fwrite(&mem_type, sizeof(size_t), 1, out);
  1043. fwrite(&cnt, sizeof(size_t), 1, out);
  1044. fwrite(&aux_data, sizeof(size_t), 1, out);
  1045. }
  1046. size = 4 * sizeof(size_t);
  1047. size = mem_dump_obj(obj, mem_type, desc, size, cnt, out, 1);
  1048. if(out) fflush(out);
  1049. return size;
  1050. }
  1051. static char *mem_share_locks = NULL;
  1052. static int mem_share_lock_size = 0;
  1053. static inline void cleanup_mem_share_file_locks(){
  1054. int off;
  1055. off = 0;
  1056. while(off < mem_share_lock_size){
  1057. shm_unlink(mem_share_locks + off);
  1058. off += strlen(mem_share_locks + off) + 1;
  1059. }
  1060. if(mem_share_locks) free(mem_share_locks);
  1061. mem_share_lock_size = 0;
  1062. mem_share_locks = NULL;
  1063. }
  1064. #ifndef sighandler_t
  1065. typedef void (*sighandler_t)(int sig);
  1066. #endif
  1067. static sighandler_t sig_term = SIG_IGN;
  1068. static sighandler_t sig_int = SIG_IGN;
  1069. static sighandler_t sig_hup = SIG_IGN;
  1070. static sighandler_t sig_kill = SIG_IGN;
  1071. static volatile sig_atomic_t cleanup_mem_share_in_progress = 0;
  1072. static inline void sig_cleanup_mem_share_file_locks(int sig){
  1073. if(cleanup_mem_share_in_progress) raise(sig);
  1074. cleanup_mem_share_in_progress = 1;
  1075. cleanup_mem_share_file_locks();
  1076. signal(SIGTERM, sig_term);
  1077. signal(SIGINT , sig_int);
  1078. signal(SIGHUP, sig_hup);
  1079. signal(SIGKILL, sig_kill);
  1080. raise(sig);
  1081. }
  1082. static inline void register_mem_share_file_lock(char *file){
  1083. int len;
  1084. if(mem_share_lock_size == 0){
  1085. if((sig_term = signal(SIGTERM, sig_cleanup_mem_share_file_locks)) == SIG_IGN) signal(SIGTERM, SIG_IGN);
  1086. if((sig_int = signal(SIGINT , sig_cleanup_mem_share_file_locks)) == SIG_IGN) signal(SIGINT , SIG_IGN);
  1087. if((sig_hup = signal(SIGHUP , sig_cleanup_mem_share_file_locks)) == SIG_IGN) signal(SIGHUP , SIG_IGN);
  1088. if((sig_kill = signal(SIGKILL, sig_cleanup_mem_share_file_locks)) == SIG_IGN) signal(SIGKILL, SIG_IGN);
  1089. atexit(cleanup_mem_share_file_locks);
  1090. }
  1091. len = strlen(file);
  1092. mem_share_locks = realloc(mem_share_locks, mem_share_lock_size + len + 1);
  1093. strcpy(mem_share_locks + mem_share_lock_size, file);
  1094. mem_share_lock_size += len + 1;
  1095. }
  1096. static inline void print_tree_obj_file(FILE *out, const obj_desc_t *desc, char *path, size_t max_cnt, int max_level){
  1097. FILE *file;
  1098. void *mem;
  1099. size_t psize, *size, *mem_type, *cnt, *aux_data;
  1100. if(desc == NULL) return;
  1101. if((file = fopen(path, "r")) == NULL){
  1102. fprintf(stderr, " -- Cannot open %s in %s -- %s:%d --\n", path, __FUNCTION__, __FILE__, __LINE__); fflush(stderr);
  1103. return;
  1104. }
  1105. size = alloca(sizeof(size_t));
  1106. mem_type = alloca(sizeof(size_t));
  1107. cnt = alloca(sizeof(size_t));
  1108. aux_data = alloca(sizeof(size_t));
  1109. fread(size, sizeof(size_t), 1, file);
  1110. fread(mem_type, sizeof(size_t), 1, file);
  1111. fread(cnt, sizeof(size_t), 1, file);
  1112. fread(aux_data, sizeof(size_t), 1, file);
  1113. psize = getpagesize();
  1114. mem = mmap(0, (((*size) + 4 * sizeof(size_t)) + psize - 1) / psize * psize, PROT_READ, MAP_PRIVATE, fileno(file), 0);
  1115. if(mem == NULL){
  1116. perror("Cannot mmap");
  1117. return;
  1118. }
  1119. fprintf(out, "OBJ_TREE[%s]{\n", path);
  1120. mem_tree_obj(out, mem + 4 * sizeof(size_t), *mem_type, desc, 0, *cnt, max_cnt, 1, max_level);
  1121. fprintf(out, "}\n");
  1122. munmap(mem, (((*size) + 4 * sizeof(size_t)) + psize - 1) / psize * psize);
  1123. fclose(file);
  1124. }
  1125. // Directly read from file, don't share this object
  1126. static inline void* mem_read_obj_file(const obj_desc_t *desc, char *path, size_t *size, size_t *mem_type, size_t *cnt, size_t *aux_data){
  1127. void *mem;
  1128. size_t nin;
  1129. FILE *file;
  1130. if(desc == NULL) return NULL;
  1131. if((file = fopen(path, "r")) == NULL){
  1132. fprintf(stderr, " -- Cannot open %s in %s -- %s:%d --\n", path, __FUNCTION__, __FILE__, __LINE__); fflush(stderr);
  1133. return NULL;
  1134. }
  1135. if(size == NULL) size = alloca(sizeof(size_t));
  1136. if(mem_type == NULL) mem_type = alloca(sizeof(size_t));
  1137. if(cnt == NULL) cnt = alloca(sizeof(size_t));
  1138. if(aux_data == NULL) aux_data = alloca(sizeof(size_t));
  1139. fread(size, sizeof(size_t), 1, file);
  1140. fread(mem_type, sizeof(size_t), 1, file);
  1141. fread(cnt, sizeof(size_t), 1, file);
  1142. fread(aux_data, sizeof(size_t), 1, file);
  1143. mem = malloc(*size);
  1144. if(mem == NULL){
  1145. fprintf(stderr, " -- Cannot alloc %llu bytes memory for %s in %s -- %s:%d --\n", (unsigned long long)*size, path, __FUNCTION__, __FILE__, __LINE__); fflush(stderr);
  1146. return NULL;
  1147. }
  1148. if((nin = fread_stepwise(mem, 1, *size, file)) != *size){
  1149. fprintf(stderr, " -- Read %llu bytes, not %llu bytes in %s -- %s:%d --\n", (unsigned long long)nin, (unsigned long long)*size, __FUNCTION__, __FILE__, __LINE__); fflush(stderr);
  1150. return NULL;
  1151. }
  1152. fclose(file);
  1153. mem_load_obj(mem, *aux_data, *mem_type, desc, 0, *cnt);
  1154. //if(desc->post) desc->post(mem, *aux_data);
  1155. return mem;
  1156. }
  1157. // only read a child object specified by indexs and nidx
  1158. static inline void* mem_read_sub_obj_file(const obj_desc_t *desc, u4i *trace_childs, size_t *trace_cnts, u4i ntrace, char *path, size_t *size){
  1159. const obj_desc_t *sub;
  1160. void *mem;
  1161. size_t *mem_type, *cnt, *aux_data, psize, addr, sz, nin;
  1162. FILE *file;
  1163. if(desc == NULL) return NULL;
  1164. if((file = fopen(path, "r")) == NULL){
  1165. fprintf(stderr, " -- Cannot open %s in %s -- %s:%d --\n", path, __FUNCTION__, __FILE__, __LINE__); fflush(stderr); exit(1);
  1166. }
  1167. if(size == NULL) size = alloca(sizeof(size_t));
  1168. mem_type = alloca(sizeof(size_t));
  1169. cnt = alloca(sizeof(size_t));
  1170. aux_data = alloca(sizeof(size_t));
  1171. fread(size, sizeof(size_t), 1, file);
  1172. fread(mem_type, sizeof(size_t), 1, file);
  1173. fread(cnt, sizeof(size_t), 1, file);
  1174. fread(aux_data, sizeof(size_t), 1, file);
  1175. psize = getpagesize();
  1176. mem = mmap(0, (((*size) + 4 * sizeof(size_t)) + psize - 1) / psize * psize, PROT_READ, MAP_PRIVATE, fileno(file), 0);
  1177. if(mem == NULL){
  1178. perror("Cannot mmap");
  1179. return NULL;
  1180. }
  1181. addr = 0;
  1182. sub = mem_locate_obj(mem + 4 * sizeof(size_t), mem_type, desc, trace_childs, trace_cnts, ntrace, &addr, cnt, 1);
  1183. sz = mem_size_obj((void*)addr, *mem_type, sub, 0, *cnt);
  1184. munmap(mem, (((*size) + 4 * sizeof(size_t)) + psize - 1) / psize * psize);
  1185. mem = malloc(sz);
  1186. fseek(file, addr - ((size_t)mem) + 4 * sizeof(size_t), SEEK_SET);
  1187. if((nin = fread_stepwise(mem, 1, sz, file)) != sz){
  1188. fprintf(stderr, " -- Read %llu bytes, not %llu bytes in %s -- %s:%d --\n", (unsigned long long)nin, (unsigned long long)sz, __FUNCTION__, __FILE__, __LINE__); fflush(stderr);
  1189. return NULL;
  1190. }
  1191. fclose(file);
  1192. mem_load_obj(mem, *aux_data, *mem_type, sub, 0, *cnt);
  1193. //if(sub->post) sub->post(mem, *aux_data);
  1194. *size = sz;
  1195. return mem;
  1196. }
  1197. // WARNNING ** the content of shared memory object can be modified by any mmaped process, thus is not multiple-process-safety
  1198. static inline void* mem_load_obj_file(const obj_desc_t *desc, char *_path, size_t *size, size_t *mem_type, size_t *cnt, size_t *aux_data){
  1199. void *mem;
  1200. size_t sz, nin, psize, *msg;
  1201. char *lock, *shadow, *path, *shmp;
  1202. char hostname[65];
  1203. FILE *file;
  1204. int fd, ret;
  1205. if(desc == NULL) return NULL;
  1206. path = absolute_filename(_path);
  1207. shmp = strdup(path);
  1208. replace_char(shmp, '/', '_', 0);
  1209. if((file = fopen(path, "r+")) == NULL){
  1210. fprintf(stderr, " -- Cannot open %s in %s -- %s:%d --\n", path, __FUNCTION__, __FILE__, __LINE__); fflush(stderr); exit(1);
  1211. }
  1212. if(size == NULL) size = alloca(sizeof(size_t));
  1213. if(mem_type == NULL) mem_type = alloca(sizeof(size_t));
  1214. if(cnt == NULL) cnt = alloca(sizeof(size_t));
  1215. if(aux_data == NULL) aux_data = alloca(sizeof(size_t));
  1216. fread(size, sizeof(size_t), 1, file);
  1217. fread(mem_type, sizeof(size_t), 1, file);
  1218. fread(cnt, sizeof(size_t), 1, file);
  1219. fread(aux_data, sizeof(size_t), 1, file);
  1220. psize = getpagesize();
  1221. sz = (*size) + 4 * sizeof(size_t);
  1222. //fd = fileno(file);
  1223. //mem = mmap(0, (size + 4 * sizeof(size_t) + psize - 1) / psize * psize, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
  1224. gethostname(hostname, 64);
  1225. shadow = alloca(strlen(shmp) + strlen(hostname) + 40);
  1226. sprintf(shadow, "%s.mem_share.%s.%ld.shm", shmp, hostname, gethostid());
  1227. fd = shm_open(shadow, O_CREAT | O_RDWR, 0777);
  1228. if(fd == -1){
  1229. fprintf(stderr, " -- shm_open failed: %s in %s -- %s:%d --\n", shadow, __FUNCTION__, __FILE__, __LINE__); fflush(stderr); exit(1);
  1230. }
  1231. ret = ftruncate(fd, (sz + psize - 1) / psize * psize);
  1232. if(ret == -1){
  1233. fprintf(stderr, " -- ftruncate failed: %s in %s -- %s:%d --\n", shadow, __FUNCTION__, __FILE__, __LINE__); fflush(stderr); exit(1);
  1234. }
  1235. //register_mem_share_file_lock(shadow);
  1236. mem = mmap(0, (sz + psize - 1) / psize * psize, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
  1237. if(mem == MAP_FAILED){
  1238. perror("Cannot mmap");
  1239. return NULL;
  1240. }
  1241. fseek(file, 0, SEEK_SET);
  1242. if((nin = fread_stepwise(mem, 1, sz, file)) != sz){
  1243. fprintf(stderr, " -- Read %llu bytes, not %llu bytes in %s -- %s:%d --\n", (unsigned long long)nin, (unsigned long long)sz, __FUNCTION__, __FILE__, __LINE__); fflush(stderr); exit(1);
  1244. }
  1245. fclose(file);
  1246. fprintf(stderr, " -- Read %llu bytes from %s --\n", (unsigned long long)nin, path); fflush(stderr);
  1247. mem_load_obj(mem + 4 * sizeof(size_t), *aux_data, *mem_type, desc, 0, *cnt);
  1248. //if(desc->post) desc->post(mem + 4 * sizeof(size_t), *aux_data);
  1249. lock = alloca(strlen(shmp) + strlen(hostname) + 20);
  1250. sprintf(lock, "%s.mem_share.%s.%ld", shmp, hostname, gethostid());
  1251. if((fd = shm_open(lock, O_CREAT | O_RDWR, 0777)) == -1){
  1252. fprintf(stderr, " -- shm_open failed: %s in %s -- %s:%d --\n", lock, __FUNCTION__, __FILE__, __LINE__); fflush(stderr); exit(1);
  1253. }
  1254. if((ret = ftruncate(fd, psize)) == -1){
  1255. fprintf(stderr, " -- ftruncate failed: %s in %s -- %s:%d --\n", lock, __FUNCTION__, __FILE__, __LINE__); fflush(stderr); exit(1);
  1256. }
  1257. msg = mmap(0, psize, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
  1258. if(msg == MAP_FAILED){
  1259. perror("Cannot mmap");
  1260. exit(1);
  1261. }
  1262. msg[0] = (size_t)mem;
  1263. msg[1] = *size;
  1264. fprintf(stderr, "-- mem_share '%s' at %p:%llu --\n", path, mem, (u8i)*size); fflush(stderr);
  1265. free(path);
  1266. free(shmp);
  1267. //register_mem_share_file_lock(lock);
  1268. return mem + 4 * sizeof(size_t);
  1269. }
  1270. static inline int mem_stop_obj_file(char *_path){
  1271. char *lock, *shadow, *path, *shmp;
  1272. char hostname[65];
  1273. path = absolute_filename(_path);
  1274. shmp = strdup(path);
  1275. replace_char(shmp, '/', '_', 0);
  1276. gethostname(hostname, 64);
  1277. shadow = alloca(strlen(shmp) + strlen(hostname) + 40);
  1278. sprintf(shadow, "%s.mem_share.%s.%ld.shm", shmp, hostname, gethostid());
  1279. if(shm_unlink(shadow) == -1){
  1280. fprintf(stderr, " -- Failed to remove mmap object %s --\n", shadow); fflush(stderr);
  1281. return 0;
  1282. }
  1283. lock = alloca(strlen(shmp) + strlen(hostname) + 20);
  1284. sprintf(lock, "%s.mem_share.%s.%ld", shmp, hostname, gethostid());
  1285. if(shm_unlink(lock) == -1){
  1286. fprintf(stderr, " -- Failed to remove mmap object %s --\n", lock); fflush(stderr);
  1287. return 0;
  1288. }
  1289. free(path);
  1290. free(shmp);
  1291. return 1;
  1292. }
  1293. // wr: whether to obtain write permission the mmap object
  1294. static inline void* mem_find_obj_file(const obj_desc_t *desc, char *_path, size_t *size, size_t *mem_type, size_t *cnt, size_t *aux_data, int wr){
  1295. char *lock, *shadow, *path, *shmp;
  1296. char hostname[65];
  1297. void *addr, *mem;
  1298. size_t psize, *msg;
  1299. int fd, prot;
  1300. UNUSED(desc);
  1301. gethostname(hostname, 64);
  1302. psize = getpagesize();
  1303. path = absolute_filename(_path);
  1304. shmp = strdup(path);
  1305. replace_char(shmp, '/', '_', 0);
  1306. lock = alloca(strlen(shmp) + strlen(hostname) + 32);
  1307. sprintf(lock, "%s.mem_share.%s.%ld", shmp, hostname, gethostid());
  1308. if(size == NULL) size = alloca(sizeof(size_t));
  1309. if(mem_type == NULL) mem_type = alloca(sizeof(size_t));
  1310. if(cnt == NULL) cnt = alloca(sizeof(size_t));
  1311. if(aux_data == NULL) aux_data = alloca(sizeof(size_t));
  1312. if((fd = shm_open(lock, O_RDWR, 0777)) == -1){
  1313. return NULL;
  1314. }
  1315. msg = mmap(0, psize, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
  1316. if(msg == MAP_FAILED){
  1317. perror("Cannot mmap");
  1318. return NULL;
  1319. }
  1320. addr = (void*)msg[0];
  1321. *size = msg[1];
  1322. munmap(msg, psize);
  1323. shadow = alloca(strlen(shmp) + strlen(hostname) + 40);
  1324. sprintf(shadow, "%s.mem_share.%s.%ld.shm", shmp, hostname, gethostid());
  1325. fd = shm_open(shadow, O_RDWR, 0777);
  1326. prot = PROT_READ;
  1327. if(wr) prot |= PROT_WRITE;
  1328. mem = mmap(addr, ((*size) + 4 * sizeof(size_t) + psize - 1) / psize * psize, prot, MAP_SHARED | MAP_FIXED, fd, 0);
  1329. if(mem == MAP_FAILED){
  1330. perror("Cannot map shared object");
  1331. return NULL;
  1332. }
  1333. *mem_type = ((size_t*)addr)[1];
  1334. *cnt = ((size_t*)addr)[2];
  1335. *aux_data = ((size_t*)addr)[3];
  1336. //fclose(file);
  1337. //mem_load_obj(mem + 4 * sizeof(size_t), *mem_type, desc, 0, *cnt);
  1338. fprintf(stderr, "-- mem_map '%s' at %p:%llu --\n", path, addr, (u8i)*size); fflush(stderr);
  1339. free(path);
  1340. free(shmp);
  1341. return mem + 4 * sizeof(size_t);
  1342. }
  1343. #endif
  1344. /*
  1345. * An example to use mem_dump
  1346. */
  1347. /*
  1348. #include "mem_share.h"
  1349. typedef struct {
  1350. char *str;
  1351. int val;
  1352. } Type1;
  1353. size_t type1_count(void *obj, int idx){ if(idx == 0){ return strlen(((Type1*)obj)->str) + 1; } else return 0; }
  1354. //const obj_desc_t type1_obj_desc = {"TYPE1", sizeof(Type1), 1, {1}, {offsetof(Type1, str)}, {&OBJ_DESC_DATA}, type1_count, NULL};
  1355. const obj_desc_t type1_obj_desc = {"TYPE1", sizeof(Type1), 1, {1}, {offsetof(Type1, str)}, {&OBJ_DESC_CHAR_ARRAY}, NULL, NULL};
  1356. typedef struct {
  1357. int a, b, c;
  1358. Type1 d1, d2[10], *d3, *d4[10], **d5;
  1359. char **strs;
  1360. int d3len, d5len;
  1361. } Type2;
  1362. size_t type2_count(void *obj, int idx){
  1363. switch(idx){
  1364. case 0: return 1;
  1365. case 1: return 10;
  1366. case 2: return ((Type2*)obj)->d3len;
  1367. case 3: return 10;
  1368. case 4: return ((Type2*)obj)->d5len;
  1369. default: return 10;
  1370. }
  1371. }
  1372. const obj_desc_t type2_obj_desc = {"TYPE2", sizeof(Type2), 6, {0, 0, 1, 2, 3, 3}, {offsetof(Type2, d1), offsetof(Type2, d2), offsetof(Type2, d3), offsetof(Type2, d4), offsetof(Type2, d5), offsetof(Type2, strs)}, {&type1_obj_desc, &type1_obj_desc, &type1_obj_desc, &type1_obj_desc, &type1_obj_desc, &OBJ_DESC_CHAR_ARRAY}, type2_count, NULL};
  1373. int main(){
  1374. Type2 *t2, *t3;
  1375. t2 = calloc(1, sizeof(Type2));
  1376. int idx = 0;
  1377. t2->d1.val = idx ++;
  1378. t2->d1.str = strdup("d1");
  1379. int i;
  1380. for(i=0;i<10;i++){
  1381. t2->d2[i].val = idx ++;
  1382. t2->d2[i].str = strdup("d2");
  1383. }
  1384. t2->d3len = 10;
  1385. t2->d3 = malloc(sizeof(Type1) * t2->d3len);
  1386. for(i=0;i<t2->d3len;i++){
  1387. t2->d3[i].val = idx ++;
  1388. t2->d3[i].str = strdup("d3");
  1389. }
  1390. for(i=0;i<10;i++){
  1391. t2->d4[i] = malloc(sizeof(Type1));
  1392. t2->d4[i]->val = idx ++;
  1393. t2->d4[i]->str = strdup("d4");
  1394. }
  1395. t2->d5len = 10;
  1396. t2->d5 = malloc(sizeof(Type1*) * t2->d5len);
  1397. for(i=0;i<t2->d5len;i++){
  1398. t2->d5[i] = malloc(sizeof(Type1));
  1399. t2->d5[i]->val = idx ++;
  1400. t2->d5[i]->str = strdup("d5");
  1401. }
  1402. t2->strs = malloc(sizeof(char*) * 10);
  1403. for(i=0;i<10;i++){
  1404. t2->strs[i] = malloc(32);
  1405. sprintf(t2->strs[i], "strs[%d,%d]", i, idx ++);
  1406. }
  1407. size_t aux_data, size, cnt, mem_type;
  1408. FILE *file;
  1409. size = mem_size_obj(t2, 1, &type2_obj_desc, 0, 1);
  1410. fprintf(stdout, " -- size = %d in %s -- %s:%d --\n", (int)size, __FUNCTION__, __FILE__, __LINE__);
  1411. aux_data = 1000999900;
  1412. file = fopen("test.mem_share", "w");
  1413. size = mem_dump_free_obj_file(t2, 1, &type2_obj_desc, 1, aux_data, file);
  1414. fclose(file);
  1415. fprintf(stdout, " -- size = %d in %s -- %s:%d --\n", (int)(size - 4 * sizeof(size_t)), __FUNCTION__, __FILE__, __LINE__);
  1416. t3 = mem_read_obj_file(&type2_obj_desc, "test.mem_share", &mem_type, &cnt, &aux_data);
  1417. fprintf(stdout, " -- aux_data = %d in %s -- %s:%d --\n", (int)aux_data, __FUNCTION__, __FILE__, __LINE__);
  1418. printf("%d %s\n", t3->d1.val, t3->d1.str);
  1419. for(i=0;i<10;i++) printf("%d %s\n", t3->d2[i].val, t3->d2[i].str);
  1420. for(i=0;i<t3->d3len;i++) printf("%d %s\n", t3->d3[i].val, t3->d3[i].str);
  1421. for(i=0;i<10;i++) printf("%d %s\n", t3->d4[i]->val, t3->d4[i]->str);
  1422. for(i=0;i<t3->d5len;i++) printf("%d %s\n", t3->d5[i]->val, t3->d5[i]->str);
  1423. for(i=0;i<10;i++) printf("%s\n", t3->strs[i]);
  1424. free(t3);
  1425. return 0;
  1426. }
  1427. */