common.cpp 22 KB

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