common.cpp 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861
  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. memset(&inner,0,sizeof(inner));
  158. if(addr->sa_family==AF_INET6)
  159. {
  160. assert(slen==sizeof(sockaddr_in6));
  161. inner.ipv6= *( (sockaddr_in6*) addr );
  162. }
  163. else if(addr->sa_family==AF_INET)
  164. {
  165. assert(slen==sizeof(sockaddr_in));
  166. inner.ipv4= *( (sockaddr_in*) addr );
  167. }
  168. else
  169. {
  170. assert(0==1);
  171. }
  172. return 0;
  173. }
  174. int address_t::new_connected_udp_fd()
  175. {
  176. int new_udp_fd;
  177. new_udp_fd = socket(get_type(), SOCK_DGRAM, IPPROTO_UDP);
  178. if (new_udp_fd < 0) {
  179. mylog(log_warn, "create udp_fd error\n");
  180. return -1;
  181. }
  182. setnonblocking(new_udp_fd);
  183. set_buf_size(new_udp_fd,socket_buf_size);
  184. mylog(log_debug, "created new udp_fd %d\n", new_udp_fd);
  185. int ret = connect(new_udp_fd, (struct sockaddr *) &inner, get_len());
  186. if (ret != 0) {
  187. mylog(log_warn, "udp fd connect fail %d %s\n",ret,strerror(errno) );
  188. //sock_close(new_udp_fd);
  189. close(new_udp_fd);
  190. return -1;
  191. }
  192. return new_udp_fd;
  193. }
  194. u64_t get_current_time()
  195. {
  196. timespec tmp_time;
  197. clock_gettime(CLOCK_MONOTONIC, &tmp_time);
  198. return ((u64_t)tmp_time.tv_sec)*1000llu+((u64_t)tmp_time.tv_nsec)/(1000*1000llu);
  199. }
  200. u64_t pack_u64(u32_t a,u32_t b)
  201. {
  202. u64_t ret=a;
  203. ret<<=32u;
  204. ret+=b;
  205. return ret;
  206. }
  207. u32_t get_u64_h(u64_t a)
  208. {
  209. return a>>32u;
  210. }
  211. u32_t get_u64_l(u64_t a)
  212. {
  213. return (a<<32u)>>32u;
  214. }
  215. char * my_ntoa(u32_t ip)
  216. {
  217. in_addr a;
  218. a.s_addr=ip;
  219. return inet_ntoa(a);
  220. }
  221. void init_random_number_fd()
  222. {
  223. random_number_fd=open("/dev/urandom",O_RDONLY);
  224. if(random_number_fd==-1)
  225. {
  226. mylog(log_fatal,"error open /dev/urandom\n");
  227. myexit(-1);
  228. }
  229. setnonblocking(random_number_fd);
  230. }
  231. u64_t get_true_random_number_64()
  232. {
  233. u64_t ret;
  234. int size=read(random_number_fd,&ret,sizeof(ret));
  235. if(size!=sizeof(ret))
  236. {
  237. mylog(log_fatal,"get random number failed %d\n",size);
  238. myexit(-1);
  239. }
  240. return ret;
  241. }
  242. u32_t get_true_random_number()
  243. {
  244. u32_t ret;
  245. int size=read(random_number_fd,&ret,sizeof(ret));
  246. if(size!=sizeof(ret))
  247. {
  248. mylog(log_fatal,"get random number failed %d\n",size);
  249. myexit(-1);
  250. }
  251. return ret;
  252. }
  253. u32_t get_true_random_number_nz() //nz for non-zero
  254. {
  255. u32_t ret=0;
  256. while(ret==0)
  257. {
  258. ret=get_true_random_number();
  259. }
  260. return ret;
  261. }
  262. u64_t ntoh64(u64_t a)
  263. {
  264. if(__BYTE_ORDER == __LITTLE_ENDIAN)
  265. {
  266. return bswap_64( a);
  267. }
  268. else return a;
  269. }
  270. u64_t hton64(u64_t a)
  271. {
  272. if(__BYTE_ORDER == __LITTLE_ENDIAN)
  273. {
  274. return bswap_64( a);
  275. }
  276. else return a;
  277. }
  278. void setnonblocking(int sock) {
  279. int opts;
  280. opts = fcntl(sock, F_GETFL);
  281. if (opts < 0) {
  282. mylog(log_fatal,"fcntl(sock,GETFL)\n");
  283. //perror("fcntl(sock,GETFL)");
  284. myexit(1);
  285. }
  286. opts = opts | O_NONBLOCK;
  287. if (fcntl(sock, F_SETFL, opts) < 0) {
  288. mylog(log_fatal,"fcntl(sock,SETFL,opts)\n");
  289. //perror("fcntl(sock,SETFL,opts)");
  290. myexit(1);
  291. }
  292. }
  293. /*
  294. Generic checksum calculation function
  295. */
  296. unsigned short csum(const unsigned short *ptr,int nbytes) {//works both for big and little endian
  297. register long sum;
  298. unsigned short oddbyte;
  299. register short answer;
  300. sum=0;
  301. while(nbytes>1) {
  302. sum+=*ptr++;
  303. nbytes-=2;
  304. }
  305. if(nbytes==1) {
  306. oddbyte=0;
  307. *((u_char*)&oddbyte)=*(u_char*)ptr;
  308. sum+=oddbyte;
  309. }
  310. sum = (sum>>16)+(sum & 0xffff);
  311. sum = sum + (sum>>16);
  312. answer=(short)~sum;
  313. return(answer);
  314. }
  315. int set_buf_size(int fd,int socket_buf_size)
  316. {
  317. if(force_socket_buf)
  318. {
  319. if(setsockopt(fd, SOL_SOCKET, SO_SNDBUFFORCE, &socket_buf_size, sizeof(socket_buf_size))<0)
  320. {
  321. mylog(log_fatal,"SO_SNDBUFFORCE fail socket_buf_size=%d errno=%s\n",socket_buf_size,strerror(errno));
  322. myexit(1);
  323. }
  324. if(setsockopt(fd, SOL_SOCKET, SO_RCVBUFFORCE, &socket_buf_size, sizeof(socket_buf_size))<0)
  325. {
  326. mylog(log_fatal,"SO_RCVBUFFORCE fail socket_buf_size=%d errno=%s\n",socket_buf_size,strerror(errno));
  327. myexit(1);
  328. }
  329. }
  330. else
  331. {
  332. if(setsockopt(fd, SOL_SOCKET, SO_SNDBUF, &socket_buf_size, sizeof(socket_buf_size))<0)
  333. {
  334. mylog(log_fatal,"SO_SNDBUF fail socket_buf_size=%d errno=%s\n",socket_buf_size,strerror(errno));
  335. myexit(1);
  336. }
  337. if(setsockopt(fd, SOL_SOCKET, SO_RCVBUF, &socket_buf_size, sizeof(socket_buf_size))<0)
  338. {
  339. mylog(log_fatal,"SO_RCVBUF fail socket_buf_size=%d errno=%s\n",socket_buf_size,strerror(errno));
  340. myexit(1);
  341. }
  342. }
  343. return 0;
  344. }
  345. int numbers_to_char(id_t id1,id_t id2,id_t id3,char * &data,int &len)
  346. {
  347. static char buf[buf_len];
  348. data=buf;
  349. id_t tmp=htonl(id1);
  350. memcpy(buf,&tmp,sizeof(tmp));
  351. tmp=htonl(id2);
  352. memcpy(buf+sizeof(tmp),&tmp,sizeof(tmp));
  353. tmp=htonl(id3);
  354. memcpy(buf+sizeof(tmp)*2,&tmp,sizeof(tmp));
  355. len=sizeof(id_t)*3;
  356. return 0;
  357. }
  358. int char_to_numbers(const char * data,int len,id_t &id1,id_t &id2,id_t &id3)
  359. {
  360. if(len<int(sizeof(id_t)*3)) return -1;
  361. //id1=ntohl( *((id_t*)(data+0)) );
  362. memcpy(&id1,data+0,sizeof(id1));
  363. id1=ntohl(id1);
  364. //id2=ntohl( *((id_t*)(data+sizeof(id_t))) );
  365. memcpy(&id2,data+sizeof(id_t),sizeof(id2));
  366. id2=ntohl(id2);
  367. //id3=ntohl( *((id_t*)(data+sizeof(id_t)*2)) );
  368. memcpy(&id3,data+sizeof(id_t)*2,sizeof(id3));
  369. id3=ntohl(id3);
  370. return 0;
  371. }
  372. int hex_to_u32(const string & a,u32_t &output)
  373. {
  374. //string b="0x";
  375. //b+=a;
  376. if(sscanf(a.c_str(),"%x",&output)==1)
  377. {
  378. //printf("%s %x\n",a.c_str(),output);
  379. return 0;
  380. }
  381. mylog(log_error,"<%s> doesnt contain a hex\n",a.c_str());
  382. return -1;
  383. }
  384. int hex_to_u32_with_endian(const string & a,u32_t &output)
  385. {
  386. //string b="0x";
  387. //b+=a;
  388. if(sscanf(a.c_str(),"%x",&output)==1)
  389. {
  390. output=htonl(output);
  391. //printf("%s %x\n",a.c_str(),output);
  392. return 0;
  393. }
  394. mylog(log_error,"<%s> doesnt contain a hex\n",a.c_str());
  395. return -1;
  396. }
  397. bool larger_than_u32(u32_t a,u32_t b)
  398. //TODO
  399. //looks like this can simply be done by return ((i32_t)(a-b) >0)
  400. {
  401. u32_t smaller,bigger;
  402. smaller=min(a,b);//smaller in normal sense
  403. bigger=max(a,b);
  404. u32_t distance=min(bigger-smaller,smaller+(0xffffffff-bigger+1));
  405. if(distance==bigger-smaller)
  406. {
  407. if(bigger==a)
  408. {
  409. return 1;
  410. }
  411. else
  412. {
  413. return 0;
  414. }
  415. }
  416. else
  417. {
  418. if(smaller==b)
  419. {
  420. return 0;
  421. }
  422. else
  423. {
  424. return 1;
  425. }
  426. }
  427. }
  428. bool larger_than_u16(uint16_t a,uint16_t b)
  429. {
  430. uint16_t smaller,bigger;
  431. smaller=min(a,b);//smaller in normal sense
  432. bigger=max(a,b);
  433. uint16_t distance=min(bigger-smaller,smaller+(0xffff-bigger+1));
  434. if(distance==bigger-smaller)
  435. {
  436. if(bigger==a)
  437. {
  438. return 1;
  439. }
  440. else
  441. {
  442. return 0;
  443. }
  444. }
  445. else
  446. {
  447. if(smaller==b)
  448. {
  449. return 0;
  450. }
  451. else
  452. {
  453. return 1;
  454. }
  455. }
  456. }
  457. void myexit(int a)
  458. {
  459. if(enable_log_color)
  460. printf("%s\n",RESET);
  461. if(keep_thread_running)
  462. {
  463. if(pthread_cancel(keep_thread))
  464. {
  465. mylog(log_warn,"pthread_cancel failed\n");
  466. }
  467. else
  468. {
  469. mylog(log_info,"pthread_cancel success\n");
  470. }
  471. }
  472. clear_iptables_rule();
  473. exit(a);
  474. }
  475. vector<string> string_to_vec(const char * s,const char * sp) {
  476. vector<string> res;
  477. string str=s;
  478. char *p = strtok ((char *)str.c_str(),sp);
  479. while (p != NULL)
  480. {
  481. res.push_back(p);
  482. //printf ("%s\n",p);
  483. p = strtok(NULL, sp);
  484. }
  485. /* for(int i=0;i<(int)res.size();i++)
  486. {
  487. printf("<<%s>>\n",res[i].c_str());
  488. }*/
  489. return res;
  490. }
  491. vector< vector <string> > string_to_vec2(const char * s)
  492. {
  493. vector< vector <string> > res;
  494. vector<string> lines=string_to_vec(s,"\n");
  495. for(int i=0;i<int(lines.size());i++)
  496. {
  497. vector<string> tmp;
  498. tmp=string_to_vec(lines[i].c_str(),"\t ");
  499. res.push_back(tmp);
  500. }
  501. return res;
  502. }
  503. int read_file(const char * file,string &output)
  504. {
  505. const int max_len=3*1024*1024;
  506. // static char buf[max_len+100];
  507. string buf0;
  508. buf0.reserve(max_len+200);
  509. char * buf=(char *)buf0.c_str();
  510. buf[max_len]=0;
  511. //buf[sizeof(buf)-1]=0;
  512. int fd=open(file,O_RDONLY);
  513. if(fd==-1)
  514. {
  515. mylog(log_error,"read_file %s fail\n",file);
  516. return -1;
  517. }
  518. int len=read(fd,buf,max_len);
  519. if(len==max_len)
  520. {
  521. buf[0]=0;
  522. mylog(log_error,"%s too long,buf not large enough\n",file);
  523. return -2;
  524. }
  525. else if(len<0)
  526. {
  527. buf[0]=0;
  528. mylog(log_error,"%s read fail %d\n",file,len);
  529. return -3;
  530. }
  531. else
  532. {
  533. buf[len]=0;
  534. output=buf;
  535. }
  536. return 0;
  537. }
  538. int run_command(string command0,char * &output,int flag) {
  539. FILE *in;
  540. if((flag&show_log)==0) command0+=" 2>&1 ";
  541. const char * command=command0.c_str();
  542. int level= (flag&show_log)?log_warn:log_debug;
  543. if(flag&show_command)
  544. {
  545. mylog(log_info,"run_command %s\n",command);
  546. }
  547. else
  548. {
  549. mylog(log_debug,"run_command %s\n",command);
  550. }
  551. static __thread char buf[1024*1024+100];
  552. buf[sizeof(buf)-1]=0;
  553. if(!(in = popen(command, "r"))){
  554. mylog(level,"command %s popen failed,errno %s\n",command,strerror(errno));
  555. return -1;
  556. }
  557. int len =fread(buf, 1024*1024, 1, in);
  558. if(len==1024*1024)
  559. {
  560. buf[0]=0;
  561. mylog(level,"too long,buf not larger enough\n");
  562. return -2;
  563. }
  564. else
  565. {
  566. buf[len]=0;
  567. }
  568. int ret;
  569. if(( ret=ferror(in) ))
  570. {
  571. mylog(level,"command %s fread failed,ferror return value %d \n",command,ret);
  572. return -3;
  573. }
  574. //if(output!=0)
  575. output=buf;
  576. ret= pclose(in);
  577. int ret2=WEXITSTATUS(ret);
  578. if(ret!=0||ret2!=0)
  579. {
  580. mylog(level,"commnad %s ,pclose returned %d ,WEXITSTATUS %d,errnor :%s \n",command,ret,ret2,strerror(errno));
  581. return -4;
  582. }
  583. return 0;
  584. }
  585. /*
  586. int run_command_no_log(string command0,char * &output) {
  587. FILE *in;
  588. command0+=" 2>&1 ";
  589. const char * command=command0.c_str();
  590. mylog(log_debug,"run_command_no_log %s\n",command);
  591. static char buf[1024*1024+100];
  592. buf[sizeof(buf)-1]=0;
  593. if(!(in = popen(command, "r"))){
  594. mylog(log_debug,"command %s popen failed,errno %s\n",command,strerror(errno));
  595. return -1;
  596. }
  597. int len =fread(buf, 1024*1024, 1, in);
  598. if(len==1024*1024)
  599. {
  600. buf[0]=0;
  601. mylog(log_debug,"too long,buf not larger enough\n");
  602. return -2;
  603. }
  604. else
  605. {
  606. buf[len]=0;
  607. }
  608. int ret;
  609. if(( ret=ferror(in) ))
  610. {
  611. mylog(log_debug,"command %s fread failed,ferror return value %d \n",command,ret);
  612. return -3;
  613. }
  614. //if(output!=0)
  615. output=buf;
  616. ret= pclose(in);
  617. int ret2=WEXITSTATUS(ret);
  618. if(ret!=0||ret2!=0)
  619. {
  620. mylog(log_debug,"commnad %s ,pclose returned %d ,WEXITSTATUS %d,errnor :%s \n",command,ret,ret2,strerror(errno));
  621. return -4;
  622. }
  623. return 0;
  624. }*/
  625. // Remove preceding and trailing characters
  626. string trim(const string& str, char c) {
  627. size_t first = str.find_first_not_of(c);
  628. if(string::npos==first)
  629. {
  630. return "";
  631. }
  632. size_t last = str.find_last_not_of(c);
  633. return str.substr(first,(last-first+1));
  634. }
  635. vector<string> parse_conf_line(const string& s0)
  636. {
  637. string s=s0;
  638. s.reserve(s.length()+200);
  639. char *buf=(char *)s.c_str();
  640. //char buf[s.length()+200];
  641. char *p=buf;
  642. int i=int(s.length())-1;
  643. int j;
  644. vector<string>res;
  645. strcpy(buf,(char *)s.c_str());
  646. while(i>=0)
  647. {
  648. if(buf[i]==' ' || buf[i]== '\t')
  649. buf[i]=0;
  650. else break;
  651. i--;
  652. }
  653. while(*p!=0)
  654. {
  655. if(*p==' ' || *p== '\t')
  656. {
  657. p++;
  658. }
  659. else break;
  660. }
  661. int new_len=strlen(p);
  662. if(new_len==0)return res;
  663. if(p[0]=='#') return res;
  664. if(p[0]!='-')
  665. {
  666. mylog(log_fatal,"line :<%s> not begin with '-' ",s.c_str());
  667. myexit(-1);
  668. }
  669. for(i=0;i<new_len;i++)
  670. {
  671. if(p[i]==' '||p[i]=='\t')
  672. {
  673. break;
  674. }
  675. }
  676. if(i==new_len)
  677. {
  678. res.push_back(p);
  679. return res;
  680. }
  681. j=i;
  682. while(p[j]==' '||p[j]=='\t')
  683. j++;
  684. p[i]=0;
  685. res.push_back(p);
  686. res.push_back(p+j);
  687. return res;
  688. }
  689. int create_fifo(char * file)
  690. {
  691. if(mkfifo (file, 0666)!=0)
  692. {
  693. if(errno==EEXIST)
  694. {
  695. mylog(log_warn,"warning fifo file %s exist\n",file);
  696. }
  697. else
  698. {
  699. mylog(log_fatal,"create fifo file %s failed\n",file);
  700. myexit(-1);
  701. }
  702. }
  703. int fifo_fd=open (file, O_RDWR);
  704. if(fifo_fd<0)
  705. {
  706. mylog(log_fatal,"create fifo file %s failed\n",file);
  707. myexit(-1);
  708. }
  709. struct stat st;
  710. if (fstat(fifo_fd, &st)!=0)
  711. {
  712. mylog(log_fatal,"fstat failed for fifo file %s\n",file);
  713. myexit(-1);
  714. }
  715. if(!S_ISFIFO(st.st_mode))
  716. {
  717. mylog(log_fatal,"%s is not a fifo\n",file);
  718. myexit(-1);
  719. }
  720. setnonblocking(fifo_fd);
  721. return fifo_fd;
  722. }
  723. /*
  724. void ip_port_t::from_u64(u64_t u64)
  725. {
  726. ip=get_u64_h(u64);
  727. port=get_u64_l(u64);
  728. }
  729. u64_t ip_port_t::to_u64()
  730. {
  731. return pack_u64(ip,port);
  732. }
  733. char * ip_port_t::to_s()
  734. {
  735. static char res[40];
  736. sprintf(res,"%s:%d",my_ntoa(ip),port);
  737. return res;
  738. }*/
  739. void print_binary_chars(const char * a,int len)
  740. {
  741. for(int i=0;i<len;i++)
  742. {
  743. unsigned char b=a[i];
  744. log_bare(log_debug,"<%02x>",(int)b);
  745. }
  746. log_bare(log_debug,"\n");
  747. }
  748. u32_t djb2(unsigned char *str,int len)
  749. {
  750. u32_t hash = 5381;
  751. int c;
  752. int i=0;
  753. while(c = *str++,i++!=len)
  754. {
  755. hash = ((hash << 5) + hash)^c; /* (hash * 33) ^ c */
  756. }
  757. hash=htonl(hash);
  758. return hash;
  759. }
  760. u32_t sdbm(unsigned char *str,int len)
  761. {
  762. u32_t hash = 0;
  763. int c;
  764. int i=0;
  765. while(c = *str++,i++!=len)
  766. {
  767. hash = c + (hash << 6) + (hash << 16) - hash;
  768. }
  769. //hash=htonl(hash);
  770. return hash;
  771. }