common.cpp 19 KB

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