common.cpp 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936
  1. /*
  2. * comm.cpp
  3. *
  4. * Created on: Jul 29, 2017
  5. * Author: wangyu
  6. */
  7. #include "common.h"
  8. #include "log.h"
  9. #include "misc.h"
  10. static int random_number_fd=-1;
  11. int force_socket_buf=0;
  12. int address_t::from_str(char *str)
  13. {
  14. clear();
  15. char ip_addr_str[100];u32_t port;
  16. mylog(log_info,"parsing address: %s\n",str);
  17. int is_ipv6=0;
  18. if(sscanf(str, "[%[^]]]:%u", ip_addr_str,&port)==2)
  19. {
  20. mylog(log_info,"its an ipv6 adress\n");
  21. inner.ipv6.sin6_family=AF_INET6;
  22. is_ipv6=1;
  23. }
  24. else if(sscanf(str, "%[^:]:%u", ip_addr_str,&port)==2)
  25. {
  26. mylog(log_info,"its an ipv4 adress\n");
  27. inner.ipv4.sin_family=AF_INET;
  28. }
  29. else
  30. {
  31. mylog(log_error,"failed to parse\n");
  32. myexit(-1);
  33. }
  34. mylog(log_info,"ip_address is {%s}, port is {%u}\n",ip_addr_str,port);
  35. if(port>65535)
  36. {
  37. mylog(log_error,"invalid port: %d\n",port);
  38. myexit(-1);
  39. }
  40. int ret=-100;
  41. if(is_ipv6)
  42. {
  43. ret=inet_pton(AF_INET6, ip_addr_str,&(inner.ipv6.sin6_addr));
  44. inner.ipv6.sin6_port=htons(port);
  45. if(ret==0) // 0 if address type doesnt match
  46. {
  47. mylog(log_error,"ip_addr %s is not an ipv6 address, %d\n",ip_addr_str,ret);
  48. myexit(-1);
  49. }
  50. else if(ret==1) // inet_pton returns 1 on success
  51. {
  52. //okay
  53. }
  54. else
  55. {
  56. mylog(log_error,"ip_addr %s is invalid, %d\n",ip_addr_str,ret);
  57. myexit(-1);
  58. }
  59. }
  60. else
  61. {
  62. ret=inet_pton(AF_INET, ip_addr_str,&(inner.ipv4.sin_addr));
  63. inner.ipv4.sin_port=htons(port);
  64. if(ret==0)
  65. {
  66. mylog(log_error,"ip_addr %s is not an ipv4 address, %d\n",ip_addr_str,ret);
  67. myexit(-1);
  68. }
  69. else if(ret==1)
  70. {
  71. //okay
  72. }
  73. else
  74. {
  75. mylog(log_error,"ip_addr %s is invalid, %d\n",ip_addr_str,ret);
  76. myexit(-1);
  77. }
  78. }
  79. return 0;
  80. }
  81. char * address_t::get_str()
  82. {
  83. static char res[max_addr_len];
  84. to_str(res);
  85. return res;
  86. }
  87. void address_t::to_str(char * s)
  88. {
  89. //static char res[max_addr_len];
  90. char ip_addr[max_addr_len];
  91. u32_t port;
  92. const char * ret=0;
  93. if(get_type()==AF_INET6)
  94. {
  95. ret=inet_ntop(AF_INET6, &inner.ipv6.sin6_addr, ip_addr,max_addr_len);
  96. port=inner.ipv6.sin6_port;
  97. }
  98. else if(get_type()==AF_INET)
  99. {
  100. ret=inet_ntop(AF_INET, &inner.ipv4.sin_addr, ip_addr,max_addr_len);
  101. port=inner.ipv4.sin_port;
  102. }
  103. else
  104. {
  105. assert(0==1);
  106. }
  107. if(ret==0) //NULL on failure
  108. {
  109. mylog(log_error,"inet_ntop failed\n");
  110. myexit(-1);
  111. }
  112. port=ntohs(port);
  113. ip_addr[max_addr_len-1]=0;
  114. if(get_type()==AF_INET6)
  115. {
  116. sprintf(s,"[%s]:%u",ip_addr,(u32_t)port);
  117. }else
  118. {
  119. sprintf(s,"%s:%u",ip_addr,(u32_t)port);
  120. }
  121. //return res;
  122. }
  123. char* address_t::get_ip()
  124. {
  125. char ip_addr[max_addr_len];
  126. static char s[max_addr_len];
  127. const char * ret=0;
  128. if(get_type()==AF_INET6)
  129. {
  130. ret=inet_ntop(AF_INET6, &inner.ipv6.sin6_addr, ip_addr,max_addr_len);
  131. }
  132. else if(get_type()==AF_INET)
  133. {
  134. ret=inet_ntop(AF_INET, &inner.ipv4.sin_addr, ip_addr,max_addr_len);
  135. }
  136. else
  137. {
  138. assert(0==1);
  139. }
  140. if(ret==0) //NULL on failure
  141. {
  142. mylog(log_error,"inet_ntop failed\n");
  143. myexit(-1);
  144. }
  145. ip_addr[max_addr_len-1]=0;
  146. if(get_type()==AF_INET6)
  147. {
  148. sprintf(s,"[%s]",ip_addr);
  149. }else
  150. {
  151. sprintf(s,"%s",ip_addr);
  152. }
  153. return s;
  154. }
  155. int address_t::from_sockaddr(sockaddr * addr,socklen_t slen)
  156. {
  157. clear();
  158. //memset(&inner,0,sizeof(inner));
  159. if(addr->sa_family==AF_INET6)
  160. {
  161. assert(slen==sizeof(sockaddr_in6));
  162. //inner.ipv6= *( (sockaddr_in6*) addr );
  163. memcpy(&inner,addr,slen);
  164. }
  165. else if(addr->sa_family==AF_INET)
  166. {
  167. assert(slen==sizeof(sockaddr_in));
  168. //inner.ipv4= *( (sockaddr_in*) addr );
  169. memcpy(&inner,addr,slen);
  170. }
  171. else
  172. {
  173. assert(0==1);
  174. }
  175. return 0;
  176. }
  177. int address_t::new_connected_udp_fd()
  178. {
  179. int new_udp_fd;
  180. new_udp_fd = socket(get_type(), SOCK_DGRAM, IPPROTO_UDP);
  181. if (new_udp_fd < 0) {
  182. mylog(log_warn, "create udp_fd error\n");
  183. return -1;
  184. }
  185. setnonblocking(new_udp_fd);
  186. set_buf_size(new_udp_fd,socket_buf_size);
  187. mylog(log_debug, "created new udp_fd %d\n", new_udp_fd);
  188. int ret = connect(new_udp_fd, (struct sockaddr *) &inner, get_len());
  189. if (ret != 0) {
  190. mylog(log_warn, "udp fd connect fail %d %s\n",ret,strerror(errno) );
  191. //sock_close(new_udp_fd);
  192. close(new_udp_fd);
  193. return -1;
  194. }
  195. return new_udp_fd;
  196. }
  197. u64_t get_current_time()
  198. {
  199. timespec tmp_time;
  200. clock_gettime(CLOCK_MONOTONIC, &tmp_time);
  201. return ((u64_t)tmp_time.tv_sec)*1000llu+((u64_t)tmp_time.tv_nsec)/(1000*1000llu);
  202. }
  203. u64_t pack_u64(u32_t a,u32_t b)
  204. {
  205. u64_t ret=a;
  206. ret<<=32u;
  207. ret+=b;
  208. return ret;
  209. }
  210. u32_t get_u64_h(u64_t a)
  211. {
  212. return a>>32u;
  213. }
  214. u32_t get_u64_l(u64_t a)
  215. {
  216. return (a<<32u)>>32u;
  217. }
  218. char * my_ntoa(u32_t ip)
  219. {
  220. in_addr a;
  221. a.s_addr=ip;
  222. return inet_ntoa(a);
  223. }
  224. void init_random_number_fd()
  225. {
  226. random_number_fd=open("/dev/urandom",O_RDONLY);
  227. if(random_number_fd==-1)
  228. {
  229. mylog(log_fatal,"error open /dev/urandom\n");
  230. myexit(-1);
  231. }
  232. setnonblocking(random_number_fd);
  233. }
  234. u64_t get_true_random_number_64()
  235. {
  236. u64_t ret;
  237. int size=read(random_number_fd,&ret,sizeof(ret));
  238. if(size!=sizeof(ret))
  239. {
  240. mylog(log_fatal,"get random number failed %d\n",size);
  241. myexit(-1);
  242. }
  243. return ret;
  244. }
  245. u32_t get_true_random_number()
  246. {
  247. u32_t ret;
  248. int size=read(random_number_fd,&ret,sizeof(ret));
  249. if(size!=sizeof(ret))
  250. {
  251. mylog(log_fatal,"get random number failed %d\n",size);
  252. myexit(-1);
  253. }
  254. return ret;
  255. }
  256. u32_t get_true_random_number_nz() //nz for non-zero
  257. {
  258. u32_t ret=0;
  259. while(ret==0)
  260. {
  261. ret=get_true_random_number();
  262. }
  263. return ret;
  264. }
  265. u64_t ntoh64(u64_t a)
  266. {
  267. if(__BYTE_ORDER == __LITTLE_ENDIAN)
  268. {
  269. return bswap_64( a);
  270. }
  271. else return a;
  272. }
  273. u64_t hton64(u64_t a)
  274. {
  275. if(__BYTE_ORDER == __LITTLE_ENDIAN)
  276. {
  277. return bswap_64( a);
  278. }
  279. else return a;
  280. }
  281. void write_u16(char * p,u16_t w)
  282. {
  283. *(unsigned char*)(p + 1) = (w & 0xff);
  284. *(unsigned char*)(p + 0) = (w >> 8);
  285. }
  286. u16_t read_u16(char * p)
  287. {
  288. u16_t res;
  289. res = *(const unsigned char*)(p + 0);
  290. res = *(const unsigned char*)(p + 1) + (res << 8);
  291. return res;
  292. }
  293. void write_u32(char * p,u32_t l)
  294. {
  295. *(unsigned char*)(p + 3) = (unsigned char)((l >> 0) & 0xff);
  296. *(unsigned char*)(p + 2) = (unsigned char)((l >> 8) & 0xff);
  297. *(unsigned char*)(p + 1) = (unsigned char)((l >> 16) & 0xff);
  298. *(unsigned char*)(p + 0) = (unsigned char)((l >> 24) & 0xff);
  299. }
  300. u32_t read_u32(char * p)
  301. {
  302. u32_t res;
  303. res = *(const unsigned char*)(p + 0);
  304. res = *(const unsigned char*)(p + 1) + (res << 8);
  305. res = *(const unsigned char*)(p + 2) + (res << 8);
  306. res = *(const unsigned char*)(p + 3) + (res << 8);
  307. return res;
  308. }
  309. void write_u64(char * s,u64_t a)
  310. {
  311. assert(0==1);
  312. }
  313. u64_t read_u64(char * s)
  314. {
  315. assert(0==1);
  316. return 0;
  317. }
  318. void setnonblocking(int sock) {
  319. int opts;
  320. opts = fcntl(sock, F_GETFL);
  321. if (opts < 0) {
  322. mylog(log_fatal,"fcntl(sock,GETFL)\n");
  323. //perror("fcntl(sock,GETFL)");
  324. myexit(1);
  325. }
  326. opts = opts | O_NONBLOCK;
  327. if (fcntl(sock, F_SETFL, opts) < 0) {
  328. mylog(log_fatal,"fcntl(sock,SETFL,opts)\n");
  329. //perror("fcntl(sock,SETFL,opts)");
  330. myexit(1);
  331. }
  332. }
  333. /*
  334. Generic checksum calculation function
  335. */
  336. unsigned short csum(const unsigned short *ptr,int nbytes) {//works both for big and little endian
  337. register long sum;
  338. unsigned short oddbyte;
  339. register short answer;
  340. sum=0;
  341. while(nbytes>1) {
  342. sum+=*ptr++;
  343. nbytes-=2;
  344. }
  345. if(nbytes==1) {
  346. oddbyte=0;
  347. *((u_char*)&oddbyte)=*(u_char*)ptr;
  348. sum+=oddbyte;
  349. }
  350. sum = (sum>>16)+(sum & 0xffff);
  351. sum = sum + (sum>>16);
  352. answer=(short)~sum;
  353. return(answer);
  354. }
  355. unsigned short csum_with_header(char* header,int hlen,const unsigned short *ptr,int nbytes) {//works both for big and little endian
  356. long sum;
  357. unsigned short oddbyte;
  358. short answer;
  359. assert(hlen%2==0);
  360. sum=0;
  361. unsigned short * tmp= (unsigned short *)header;
  362. for(int i=0;i<hlen/2;i++)
  363. {
  364. sum+=*tmp++;
  365. }
  366. while(nbytes>1) {
  367. sum+=*ptr++;
  368. nbytes-=2;
  369. }
  370. if(nbytes==1) {
  371. oddbyte=0;
  372. *((u_char*)&oddbyte)=*(u_char*)ptr;
  373. sum+=oddbyte;
  374. }
  375. sum = (sum>>16)+(sum & 0xffff);
  376. sum = sum + (sum>>16);
  377. answer=(short)~sum;
  378. return(answer);
  379. }
  380. int set_buf_size(int fd,int socket_buf_size)
  381. {
  382. if(force_socket_buf)
  383. {
  384. if(setsockopt(fd, SOL_SOCKET, SO_SNDBUFFORCE, &socket_buf_size, sizeof(socket_buf_size))<0)
  385. {
  386. mylog(log_fatal,"SO_SNDBUFFORCE fail socket_buf_size=%d errno=%s\n",socket_buf_size,strerror(errno));
  387. myexit(1);
  388. }
  389. if(setsockopt(fd, SOL_SOCKET, SO_RCVBUFFORCE, &socket_buf_size, sizeof(socket_buf_size))<0)
  390. {
  391. mylog(log_fatal,"SO_RCVBUFFORCE fail socket_buf_size=%d errno=%s\n",socket_buf_size,strerror(errno));
  392. myexit(1);
  393. }
  394. }
  395. else
  396. {
  397. if(setsockopt(fd, SOL_SOCKET, SO_SNDBUF, &socket_buf_size, sizeof(socket_buf_size))<0)
  398. {
  399. mylog(log_fatal,"SO_SNDBUF fail socket_buf_size=%d errno=%s\n",socket_buf_size,strerror(errno));
  400. myexit(1);
  401. }
  402. if(setsockopt(fd, SOL_SOCKET, SO_RCVBUF, &socket_buf_size, sizeof(socket_buf_size))<0)
  403. {
  404. mylog(log_fatal,"SO_RCVBUF fail socket_buf_size=%d errno=%s\n",socket_buf_size,strerror(errno));
  405. myexit(1);
  406. }
  407. }
  408. return 0;
  409. }
  410. int numbers_to_char(id_t id1,id_t id2,id_t id3,char * &data,int &len)
  411. {
  412. static char buf[buf_len];
  413. data=buf;
  414. id_t tmp=htonl(id1);
  415. memcpy(buf,&tmp,sizeof(tmp));
  416. tmp=htonl(id2);
  417. memcpy(buf+sizeof(tmp),&tmp,sizeof(tmp));
  418. tmp=htonl(id3);
  419. memcpy(buf+sizeof(tmp)*2,&tmp,sizeof(tmp));
  420. len=sizeof(id_t)*3;
  421. return 0;
  422. }
  423. int char_to_numbers(const char * data,int len,id_t &id1,id_t &id2,id_t &id3)
  424. {
  425. if(len<int(sizeof(id_t)*3)) return -1;
  426. //id1=ntohl( *((id_t*)(data+0)) );
  427. memcpy(&id1,data+0,sizeof(id1));
  428. id1=ntohl(id1);
  429. //id2=ntohl( *((id_t*)(data+sizeof(id_t))) );
  430. memcpy(&id2,data+sizeof(id_t),sizeof(id2));
  431. id2=ntohl(id2);
  432. //id3=ntohl( *((id_t*)(data+sizeof(id_t)*2)) );
  433. memcpy(&id3,data+sizeof(id_t)*2,sizeof(id3));
  434. id3=ntohl(id3);
  435. return 0;
  436. }
  437. int hex_to_u32(const string & a,u32_t &output)
  438. {
  439. //string b="0x";
  440. //b+=a;
  441. if(sscanf(a.c_str(),"%x",&output)==1)
  442. {
  443. //printf("%s %x\n",a.c_str(),output);
  444. return 0;
  445. }
  446. mylog(log_error,"<%s> doesnt contain a hex\n",a.c_str());
  447. return -1;
  448. }
  449. int hex_to_u32_with_endian(const string & a,u32_t &output)
  450. {
  451. //string b="0x";
  452. //b+=a;
  453. if(sscanf(a.c_str(),"%x",&output)==1)
  454. {
  455. output=htonl(output);
  456. //printf("%s %x\n",a.c_str(),output);
  457. return 0;
  458. }
  459. mylog(log_error,"<%s> doesnt contain a hex\n",a.c_str());
  460. return -1;
  461. }
  462. bool larger_than_u32(u32_t a,u32_t b)
  463. //TODO
  464. //looks like this can simply be done by return ((i32_t)(a-b) >0)
  465. {
  466. u32_t smaller,bigger;
  467. smaller=min(a,b);//smaller in normal sense
  468. bigger=max(a,b);
  469. u32_t distance=min(bigger-smaller,smaller+(0xffffffff-bigger+1));
  470. if(distance==bigger-smaller)
  471. {
  472. if(bigger==a)
  473. {
  474. return 1;
  475. }
  476. else
  477. {
  478. return 0;
  479. }
  480. }
  481. else
  482. {
  483. if(smaller==b)
  484. {
  485. return 0;
  486. }
  487. else
  488. {
  489. return 1;
  490. }
  491. }
  492. }
  493. bool larger_than_u16(uint16_t a,uint16_t b)
  494. {
  495. uint16_t smaller,bigger;
  496. smaller=min(a,b);//smaller in normal sense
  497. bigger=max(a,b);
  498. uint16_t distance=min(bigger-smaller,smaller+(0xffff-bigger+1));
  499. if(distance==bigger-smaller)
  500. {
  501. if(bigger==a)
  502. {
  503. return 1;
  504. }
  505. else
  506. {
  507. return 0;
  508. }
  509. }
  510. else
  511. {
  512. if(smaller==b)
  513. {
  514. return 0;
  515. }
  516. else
  517. {
  518. return 1;
  519. }
  520. }
  521. }
  522. void myexit(int a)
  523. {
  524. if(enable_log_color)
  525. printf("%s\n",RESET);
  526. if(keep_thread_running)
  527. {
  528. if(pthread_cancel(keep_thread))
  529. {
  530. mylog(log_warn,"pthread_cancel failed\n");
  531. }
  532. else
  533. {
  534. mylog(log_info,"pthread_cancel success\n");
  535. }
  536. }
  537. clear_iptables_rule();
  538. exit(a);
  539. }
  540. vector<string> string_to_vec(const char * s,const char * sp) {
  541. vector<string> res;
  542. string str=s;
  543. char *p = strtok ((char *)str.c_str(),sp);
  544. while (p != NULL)
  545. {
  546. res.push_back(p);
  547. //printf ("%s\n",p);
  548. p = strtok(NULL, sp);
  549. }
  550. /* for(int i=0;i<(int)res.size();i++)
  551. {
  552. printf("<<%s>>\n",res[i].c_str());
  553. }*/
  554. return res;
  555. }
  556. vector< vector <string> > string_to_vec2(const char * s)
  557. {
  558. vector< vector <string> > res;
  559. vector<string> lines=string_to_vec(s,"\n");
  560. for(int i=0;i<int(lines.size());i++)
  561. {
  562. vector<string> tmp;
  563. tmp=string_to_vec(lines[i].c_str(),"\t ");
  564. res.push_back(tmp);
  565. }
  566. return res;
  567. }
  568. int read_file(const char * file,string &output)
  569. {
  570. const int max_len=3*1024*1024;
  571. // static char buf[max_len+100];
  572. string buf0;
  573. buf0.reserve(max_len+200);
  574. char * buf=(char *)buf0.c_str();
  575. buf[max_len]=0;
  576. //buf[sizeof(buf)-1]=0;
  577. int fd=open(file,O_RDONLY);
  578. if(fd==-1)
  579. {
  580. mylog(log_error,"read_file %s fail\n",file);
  581. return -1;
  582. }
  583. int len=read(fd,buf,max_len);
  584. if(len==max_len)
  585. {
  586. buf[0]=0;
  587. mylog(log_error,"%s too long,buf not large enough\n",file);
  588. return -2;
  589. }
  590. else if(len<0)
  591. {
  592. buf[0]=0;
  593. mylog(log_error,"%s read fail %d\n",file,len);
  594. return -3;
  595. }
  596. else
  597. {
  598. buf[len]=0;
  599. output=buf;
  600. }
  601. return 0;
  602. }
  603. int run_command(string command0,char * &output,int flag) {
  604. FILE *in;
  605. if((flag&show_log)==0) command0+=" 2>&1 ";
  606. const char * command=command0.c_str();
  607. int level= (flag&show_log)?log_warn:log_debug;
  608. if(flag&show_command)
  609. {
  610. mylog(log_info,"run_command %s\n",command);
  611. }
  612. else
  613. {
  614. mylog(log_debug,"run_command %s\n",command);
  615. }
  616. static __thread char buf[1024*1024+100];
  617. buf[sizeof(buf)-1]=0;
  618. if(!(in = popen(command, "r"))){
  619. mylog(level,"command %s popen failed,errno %s\n",command,strerror(errno));
  620. return -1;
  621. }
  622. int len =fread(buf, 1024*1024, 1, in);
  623. if(len==1024*1024)
  624. {
  625. buf[0]=0;
  626. mylog(level,"too long,buf not larger enough\n");
  627. return -2;
  628. }
  629. else
  630. {
  631. buf[len]=0;
  632. }
  633. int ret;
  634. if(( ret=ferror(in) ))
  635. {
  636. mylog(level,"command %s fread failed,ferror return value %d \n",command,ret);
  637. return -3;
  638. }
  639. //if(output!=0)
  640. output=buf;
  641. ret= pclose(in);
  642. int ret2=WEXITSTATUS(ret);
  643. if(ret!=0||ret2!=0)
  644. {
  645. mylog(level,"commnad %s ,pclose returned %d ,WEXITSTATUS %d,errnor :%s \n",command,ret,ret2,strerror(errno));
  646. return -4;
  647. }
  648. return 0;
  649. }
  650. /*
  651. int run_command_no_log(string command0,char * &output) {
  652. FILE *in;
  653. command0+=" 2>&1 ";
  654. const char * command=command0.c_str();
  655. mylog(log_debug,"run_command_no_log %s\n",command);
  656. static char buf[1024*1024+100];
  657. buf[sizeof(buf)-1]=0;
  658. if(!(in = popen(command, "r"))){
  659. mylog(log_debug,"command %s popen failed,errno %s\n",command,strerror(errno));
  660. return -1;
  661. }
  662. int len =fread(buf, 1024*1024, 1, in);
  663. if(len==1024*1024)
  664. {
  665. buf[0]=0;
  666. mylog(log_debug,"too long,buf not larger enough\n");
  667. return -2;
  668. }
  669. else
  670. {
  671. buf[len]=0;
  672. }
  673. int ret;
  674. if(( ret=ferror(in) ))
  675. {
  676. mylog(log_debug,"command %s fread failed,ferror return value %d \n",command,ret);
  677. return -3;
  678. }
  679. //if(output!=0)
  680. output=buf;
  681. ret= pclose(in);
  682. int ret2=WEXITSTATUS(ret);
  683. if(ret!=0||ret2!=0)
  684. {
  685. mylog(log_debug,"commnad %s ,pclose returned %d ,WEXITSTATUS %d,errnor :%s \n",command,ret,ret2,strerror(errno));
  686. return -4;
  687. }
  688. return 0;
  689. }*/
  690. // Remove preceding and trailing characters
  691. string trim(const string& str, char c) {
  692. size_t first = str.find_first_not_of(c);
  693. if(string::npos==first)
  694. {
  695. return "";
  696. }
  697. size_t last = str.find_last_not_of(c);
  698. return str.substr(first,(last-first+1));
  699. }
  700. vector<string> parse_conf_line(const string& s0)
  701. {
  702. string s=s0;
  703. s.reserve(s.length()+200);
  704. char *buf=(char *)s.c_str();
  705. //char buf[s.length()+200];
  706. char *p=buf;
  707. int i=int(s.length())-1;
  708. int j;
  709. vector<string>res;
  710. strcpy(buf,(char *)s.c_str());
  711. while(i>=0)
  712. {
  713. if(buf[i]==' ' || buf[i]== '\t')
  714. buf[i]=0;
  715. else break;
  716. i--;
  717. }
  718. while(*p!=0)
  719. {
  720. if(*p==' ' || *p== '\t')
  721. {
  722. p++;
  723. }
  724. else break;
  725. }
  726. int new_len=strlen(p);
  727. if(new_len==0)return res;
  728. if(p[0]=='#') return res;
  729. if(p[0]!='-')
  730. {
  731. mylog(log_fatal,"line :<%s> not begin with '-' ",s.c_str());
  732. myexit(-1);
  733. }
  734. for(i=0;i<new_len;i++)
  735. {
  736. if(p[i]==' '||p[i]=='\t')
  737. {
  738. break;
  739. }
  740. }
  741. if(i==new_len)
  742. {
  743. res.push_back(p);
  744. return res;
  745. }
  746. j=i;
  747. while(p[j]==' '||p[j]=='\t')
  748. j++;
  749. p[i]=0;
  750. res.push_back(p);
  751. res.push_back(p+j);
  752. return res;
  753. }
  754. int create_fifo(char * file)
  755. {
  756. if(mkfifo (file, 0666)!=0)
  757. {
  758. if(errno==EEXIST)
  759. {
  760. mylog(log_warn,"warning fifo file %s exist\n",file);
  761. }
  762. else
  763. {
  764. mylog(log_fatal,"create fifo file %s failed\n",file);
  765. myexit(-1);
  766. }
  767. }
  768. int fifo_fd=open (file, O_RDWR);
  769. if(fifo_fd<0)
  770. {
  771. mylog(log_fatal,"create fifo file %s failed\n",file);
  772. myexit(-1);
  773. }
  774. struct stat st;
  775. if (fstat(fifo_fd, &st)!=0)
  776. {
  777. mylog(log_fatal,"fstat failed for fifo file %s\n",file);
  778. myexit(-1);
  779. }
  780. if(!S_ISFIFO(st.st_mode))
  781. {
  782. mylog(log_fatal,"%s is not a fifo\n",file);
  783. myexit(-1);
  784. }
  785. setnonblocking(fifo_fd);
  786. return fifo_fd;
  787. }
  788. /*
  789. void ip_port_t::from_u64(u64_t u64)
  790. {
  791. ip=get_u64_h(u64);
  792. port=get_u64_l(u64);
  793. }
  794. u64_t ip_port_t::to_u64()
  795. {
  796. return pack_u64(ip,port);
  797. }
  798. char * ip_port_t::to_s()
  799. {
  800. static char res[40];
  801. sprintf(res,"%s:%d",my_ntoa(ip),port);
  802. return res;
  803. }*/
  804. void print_binary_chars(const char * a,int len)
  805. {
  806. for(int i=0;i<len;i++)
  807. {
  808. unsigned char b=a[i];
  809. log_bare(log_debug,"<%02x>",(int)b);
  810. }
  811. log_bare(log_debug,"\n");
  812. }
  813. u32_t djb2(unsigned char *str,int len)
  814. {
  815. u32_t hash = 5381;
  816. int c;
  817. int i=0;
  818. while(c = *str++,i++!=len)
  819. {
  820. hash = ((hash << 5) + hash)^c; /* (hash * 33) ^ c */
  821. }
  822. hash=htonl(hash);
  823. return hash;
  824. }
  825. u32_t sdbm(unsigned char *str,int len)
  826. {
  827. u32_t hash = 0;
  828. int c;
  829. int i=0;
  830. while(c = *str++,i++!=len)
  831. {
  832. hash = c + (hash << 6) + (hash << 16) - hash;
  833. }
  834. //hash=htonl(hash);
  835. return hash;
  836. }