common.cpp 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755
  1. /*
  2. * comm.cpp
  3. *
  4. * Created on: Jul 29, 2017
  5. * Author: wangyu
  6. */
  7. #include "common.h"
  8. #include "log.h"
  9. int about_to_exit=0;
  10. raw_mode_t raw_mode=mode_faketcp;
  11. unordered_map<int, const char*> raw_mode_tostring = {{mode_faketcp, "faketcp"}, {mode_udp, "udp"}, {mode_icmp, "icmp"}};
  12. int socket_buf_size=1024*1024;
  13. int force_socket_buf=0;
  14. static int random_number_fd=-1;
  15. string iptables_pattern="";
  16. int iptables_rule_added=0;
  17. int iptables_rule_keeped=0;
  18. int iptables_rule_keep_index=0;
  19. //int iptables_rule_no_clear=0;
  20. program_mode_t program_mode=unset_mode;//0 unset; 1client 2server
  21. u64_t get_current_time()
  22. {
  23. timespec tmp_time;
  24. clock_gettime(CLOCK_MONOTONIC, &tmp_time);
  25. return tmp_time.tv_sec*1000+tmp_time.tv_nsec/(1000*1000l);
  26. }
  27. u64_t pack_u64(u32_t a,u32_t b)
  28. {
  29. u64_t ret=a;
  30. ret<<=32u;
  31. ret+=b;
  32. return ret;
  33. }
  34. u32_t get_u64_h(u64_t a)
  35. {
  36. return a>>32u;
  37. }
  38. u32_t get_u64_l(u64_t a)
  39. {
  40. return (a<<32u)>>32u;
  41. }
  42. char * my_ntoa(u32_t ip)
  43. {
  44. in_addr a;
  45. a.s_addr=ip;
  46. return inet_ntoa(a);
  47. }
  48. /*
  49. int add_iptables_rule(const char * s)
  50. {
  51. iptables_pattern=s;
  52. string rule="iptables -I INPUT ";
  53. rule+=iptables_pattern;
  54. rule+=" -j DROP";
  55. char *output;
  56. if(run_command(rule.c_str(),output)==0)
  57. {
  58. mylog(log_warn,"auto added iptables rule by: %s\n",rule.c_str());
  59. }
  60. else
  61. {
  62. mylog(log_fatal,"auto added iptables failed by: %s\n",rule.c_str());
  63. //mylog(log_fatal,"reason : %s\n",strerror(errno));
  64. myexit(-1);
  65. }
  66. iptables_rule_added=1;
  67. return 0;
  68. }*/
  69. string chain[2];
  70. string rule_keep[2];
  71. string rule_keep_add[2];
  72. string rule_keep_del[2];
  73. u64_t keep_rule_last_time=0;
  74. pthread_t keep_thread;
  75. int keep_thread_running=0;
  76. int iptables_gen_add(const char * s,u32_t const_id)
  77. {
  78. string dummy="";
  79. iptables_pattern=s;
  80. chain[0] =dummy+ "udp2rawDwrW_C";
  81. rule_keep[0]=dummy+ iptables_pattern+" -j " +chain[0];
  82. rule_keep_add[0]=dummy+"iptables -I INPUT "+rule_keep[0];
  83. char *output;
  84. run_command(dummy+"iptables -N "+chain[0],output,show_none);
  85. run_command(dummy+"iptables -F "+chain[0],output);
  86. run_command(dummy+"iptables -I "+chain[0] + " -j DROP",output);
  87. rule_keep_del[0]=dummy+"iptables -D INPUT "+rule_keep[0];
  88. run_command(rule_keep_del[0],output,show_none);
  89. run_command(rule_keep_del[0],output,show_none);
  90. if(run_command(rule_keep_add[0],output)!=0)
  91. {
  92. mylog(log_fatal,"auto added iptables failed by: %s\n",rule_keep_add[0].c_str());
  93. myexit(-1);
  94. }
  95. return 0;
  96. }
  97. int iptables_rule_init(const char * s,u32_t const_id,int keep)
  98. {
  99. iptables_pattern=s;
  100. iptables_rule_added=1;
  101. iptables_rule_keeped=keep;
  102. string dummy="";
  103. char const_id_str[100];
  104. sprintf(const_id_str, "%x", const_id);
  105. chain[0] =dummy+ "udp2rawDwrW_"+const_id_str+"_C0";
  106. chain[1] =dummy+ "udp2rawDwrW_"+const_id_str+"_C1";
  107. rule_keep[0]=dummy+ iptables_pattern+" -j " +chain[0];
  108. rule_keep[1]=dummy+ iptables_pattern+" -j " +chain[1];
  109. rule_keep_add[0]=dummy+"iptables -I INPUT "+rule_keep[0];
  110. rule_keep_add[1]=dummy+"iptables -I INPUT "+rule_keep[1];
  111. rule_keep_del[0]=dummy+"iptables -D INPUT "+rule_keep[0];
  112. rule_keep_del[1]=dummy+"iptables -D INPUT "+rule_keep[1];
  113. keep_rule_last_time=get_current_time();
  114. char *output;
  115. for(int i=0;i<=iptables_rule_keeped;i++)
  116. {
  117. run_command(dummy+"iptables -N "+chain[i],output);
  118. run_command(dummy+"iptables -F "+chain[i],output);
  119. run_command(dummy+"iptables -I "+chain[i] + " -j DROP",output);
  120. if(run_command(rule_keep_add[i],output)!=0)
  121. {
  122. mylog(log_fatal,"auto added iptables failed by: %s\n",rule_keep_add[i].c_str());
  123. myexit(-1);
  124. }
  125. }
  126. mylog(log_warn,"auto added iptables rules\n");
  127. return 0;
  128. }
  129. int keep_iptables_rule() //magic to work on a machine without grep/iptables --check/-m commment
  130. {
  131. /*
  132. if(iptables_rule_keeped==0) return 0;
  133. uint64_t tmp_current_time=get_current_time();
  134. if(tmp_current_time-keep_rule_last_time<=iptables_rule_keep_interval)
  135. {
  136. return 0;
  137. }
  138. else
  139. {
  140. keep_rule_last_time=tmp_current_time;
  141. }*/
  142. mylog(log_debug,"keep_iptables_rule begin %llu\n",get_current_time());
  143. iptables_rule_keep_index+=1;
  144. iptables_rule_keep_index%=2;
  145. string dummy="";
  146. char *output;
  147. int i=iptables_rule_keep_index;
  148. run_command(dummy + "iptables -N " + chain[i], output,show_none);
  149. if (run_command(dummy + "iptables -F " + chain[i], output,show_none) != 0)
  150. mylog(log_warn, "iptables -F failed %d\n",i);
  151. if (run_command(dummy + "iptables -I " + chain[i] + " -j DROP",output,show_none) != 0)
  152. mylog(log_warn, "iptables -I failed %d\n",i);
  153. if (run_command(rule_keep_del[i], output,show_none) != 0)
  154. mylog(log_warn, "rule_keep_del failed %d\n",i);
  155. run_command(rule_keep_del[i], output,show_none); //do it twice,incase it fails for unknown random reason
  156. if(run_command(rule_keep_add[i], output,show_log)!=0)
  157. mylog(log_warn, "rule_keep_del failed %d\n",i);
  158. mylog(log_debug,"keep_iptables_rule end %llu\n",get_current_time());
  159. return 0;
  160. }
  161. int clear_iptables_rule()
  162. {
  163. char *output;
  164. string dummy="";
  165. if(!iptables_rule_added) return 0;
  166. for(int i=0;i<=iptables_rule_keeped;i++ )
  167. {
  168. run_command(rule_keep_del[i],output);
  169. run_command(dummy+"iptables -F "+chain[i],output);
  170. run_command(dummy+"iptables -X "+chain[i],output);
  171. }
  172. return 0;
  173. }
  174. void init_random_number_fd()
  175. {
  176. random_number_fd=open("/dev/urandom",O_RDONLY);
  177. if(random_number_fd==-1)
  178. {
  179. mylog(log_fatal,"error open /dev/urandom\n");
  180. myexit(-1);
  181. }
  182. setnonblocking(random_number_fd);
  183. }
  184. u64_t get_true_random_number_64()
  185. {
  186. u64_t ret;
  187. int size=read(random_number_fd,&ret,sizeof(ret));
  188. if(size!=sizeof(ret))
  189. {
  190. mylog(log_fatal,"get random number failed %d\n",size);
  191. myexit(-1);
  192. }
  193. return ret;
  194. }
  195. u32_t get_true_random_number()
  196. {
  197. u32_t ret;
  198. int size=read(random_number_fd,&ret,sizeof(ret));
  199. if(size!=sizeof(ret))
  200. {
  201. mylog(log_fatal,"get random number failed %d\n",size);
  202. myexit(-1);
  203. }
  204. return ret;
  205. }
  206. u32_t get_true_random_number_nz() //nz for non-zero
  207. {
  208. u32_t ret=0;
  209. while(ret==0)
  210. {
  211. ret=get_true_random_number();
  212. }
  213. return ret;
  214. }
  215. u64_t ntoh64(u64_t a)
  216. {
  217. if(__BYTE_ORDER == __LITTLE_ENDIAN)
  218. {
  219. return bswap_64( a);
  220. }
  221. else return a;
  222. }
  223. u64_t hton64(u64_t a)
  224. {
  225. if(__BYTE_ORDER == __LITTLE_ENDIAN)
  226. {
  227. return bswap_64( a);
  228. }
  229. else return a;
  230. }
  231. void setnonblocking(int sock) {
  232. int opts;
  233. opts = fcntl(sock, F_GETFL);
  234. if (opts < 0) {
  235. mylog(log_fatal,"fcntl(sock,GETFL)\n");
  236. //perror("fcntl(sock,GETFL)");
  237. myexit(1);
  238. }
  239. opts = opts | O_NONBLOCK;
  240. if (fcntl(sock, F_SETFL, opts) < 0) {
  241. mylog(log_fatal,"fcntl(sock,SETFL,opts)\n");
  242. //perror("fcntl(sock,SETFL,opts)");
  243. myexit(1);
  244. }
  245. }
  246. /*
  247. Generic checksum calculation function
  248. */
  249. unsigned short csum(const unsigned short *ptr,int nbytes) {//works both for big and little endian
  250. register long sum;
  251. unsigned short oddbyte;
  252. register short answer;
  253. sum=0;
  254. while(nbytes>1) {
  255. sum+=*ptr++;
  256. nbytes-=2;
  257. }
  258. if(nbytes==1) {
  259. oddbyte=0;
  260. *((u_char*)&oddbyte)=*(u_char*)ptr;
  261. sum+=oddbyte;
  262. }
  263. sum = (sum>>16)+(sum & 0xffff);
  264. sum = sum + (sum>>16);
  265. answer=(short)~sum;
  266. return(answer);
  267. }
  268. int set_buf_size(int fd)
  269. {
  270. if(force_socket_buf)
  271. {
  272. if(setsockopt(fd, SOL_SOCKET, SO_SNDBUFFORCE, &socket_buf_size, sizeof(socket_buf_size))<0)
  273. {
  274. mylog(log_fatal,"SO_SNDBUFFORCE fail socket_buf_size=%d errno=%s\n",socket_buf_size,strerror(errno));
  275. myexit(1);
  276. }
  277. if(setsockopt(fd, SOL_SOCKET, SO_RCVBUFFORCE, &socket_buf_size, sizeof(socket_buf_size))<0)
  278. {
  279. mylog(log_fatal,"SO_RCVBUFFORCE fail socket_buf_size=%d errno=%s\n",socket_buf_size,strerror(errno));
  280. myexit(1);
  281. }
  282. }
  283. else
  284. {
  285. if(setsockopt(fd, SOL_SOCKET, SO_SNDBUF, &socket_buf_size, sizeof(socket_buf_size))<0)
  286. {
  287. mylog(log_fatal,"SO_SNDBUF fail socket_buf_size=%d errno=%s\n",socket_buf_size,strerror(errno));
  288. myexit(1);
  289. }
  290. if(setsockopt(fd, SOL_SOCKET, SO_RCVBUF, &socket_buf_size, sizeof(socket_buf_size))<0)
  291. {
  292. mylog(log_fatal,"SO_RCVBUF fail socket_buf_size=%d errno=%s\n",socket_buf_size,strerror(errno));
  293. myexit(1);
  294. }
  295. }
  296. return 0;
  297. }
  298. void myexit(int a)
  299. {
  300. if(enable_log_color)
  301. printf("%s\n",RESET);
  302. if(keep_thread_running)
  303. {
  304. if(pthread_cancel(keep_thread))
  305. {
  306. mylog(log_warn,"pthread_cancel failed\n");
  307. }
  308. else
  309. {
  310. mylog(log_info,"pthread_cancel success\n");
  311. }
  312. }
  313. clear_iptables_rule();
  314. exit(a);
  315. }
  316. void signal_handler(int sig)
  317. {
  318. about_to_exit=1;
  319. // myexit(0);
  320. }
  321. int numbers_to_char(id_t id1,id_t id2,id_t id3,char * &data,int &len)
  322. {
  323. static char buf[buf_len];
  324. data=buf;
  325. id_t tmp=htonl(id1);
  326. memcpy(buf,&tmp,sizeof(tmp));
  327. tmp=htonl(id2);
  328. memcpy(buf+sizeof(tmp),&tmp,sizeof(tmp));
  329. tmp=htonl(id3);
  330. memcpy(buf+sizeof(tmp)*2,&tmp,sizeof(tmp));
  331. len=sizeof(id_t)*3;
  332. return 0;
  333. }
  334. int char_to_numbers(const char * data,int len,id_t &id1,id_t &id2,id_t &id3)
  335. {
  336. if(len<int(sizeof(id_t)*3)) return -1;
  337. //id1=ntohl( *((id_t*)(data+0)) );
  338. memcpy(&id1,data+0,sizeof(id1));
  339. id1=ntohl(id1);
  340. //id2=ntohl( *((id_t*)(data+sizeof(id_t))) );
  341. memcpy(&id2,data+sizeof(id_t),sizeof(id2));
  342. id2=ntohl(id2);
  343. //id3=ntohl( *((id_t*)(data+sizeof(id_t)*2)) );
  344. memcpy(&id3,data+sizeof(id_t)*2,sizeof(id3));
  345. id3=ntohl(id3);
  346. return 0;
  347. }
  348. int hex_to_u32(const string & a,u32_t &output)
  349. {
  350. //string b="0x";
  351. //b+=a;
  352. if(sscanf(a.c_str(),"%x",&output)==1)
  353. {
  354. //printf("%s %x\n",a.c_str(),output);
  355. return 0;
  356. }
  357. mylog(log_error,"<%s> doesnt contain a hex\n",a.c_str());
  358. return -1;
  359. }
  360. int hex_to_u32_with_endian(const string & a,u32_t &output)
  361. {
  362. //string b="0x";
  363. //b+=a;
  364. if(sscanf(a.c_str(),"%x",&output)==1)
  365. {
  366. output=htonl(output);
  367. //printf("%s %x\n",a.c_str(),output);
  368. return 0;
  369. }
  370. mylog(log_error,"<%s> doesnt contain a hex\n",a.c_str());
  371. return -1;
  372. }
  373. bool larger_than_u32(u32_t a,u32_t b)
  374. //TODO
  375. //looks like this can simply be done by return ((i32_t)(a-b) >0)
  376. {
  377. u32_t smaller,bigger;
  378. smaller=min(a,b);//smaller in normal sense
  379. bigger=max(a,b);
  380. u32_t distance=min(bigger-smaller,smaller+(0xffffffff-bigger+1));
  381. if(distance==bigger-smaller)
  382. {
  383. if(bigger==a)
  384. {
  385. return 1;
  386. }
  387. else
  388. {
  389. return 0;
  390. }
  391. }
  392. else
  393. {
  394. if(smaller==b)
  395. {
  396. return 0;
  397. }
  398. else
  399. {
  400. return 1;
  401. }
  402. }
  403. }
  404. bool larger_than_u16(uint16_t a,uint16_t b)
  405. {
  406. uint16_t smaller,bigger;
  407. smaller=min(a,b);//smaller in normal sense
  408. bigger=max(a,b);
  409. uint16_t distance=min(bigger-smaller,smaller+(0xffff-bigger+1));
  410. if(distance==bigger-smaller)
  411. {
  412. if(bigger==a)
  413. {
  414. return 1;
  415. }
  416. else
  417. {
  418. return 0;
  419. }
  420. }
  421. else
  422. {
  423. if(smaller==b)
  424. {
  425. return 0;
  426. }
  427. else
  428. {
  429. return 1;
  430. }
  431. }
  432. }
  433. vector<string> string_to_vec(const char * s,const char * sp) {
  434. vector<string> res;
  435. string str=s;
  436. char *p = strtok ((char *)str.c_str(),sp);
  437. while (p != NULL)
  438. {
  439. res.push_back(p);
  440. //printf ("%s\n",p);
  441. p = strtok(NULL, sp);
  442. }
  443. /* for(int i=0;i<(int)res.size();i++)
  444. {
  445. printf("<<%s>>\n",res[i].c_str());
  446. }*/
  447. return res;
  448. }
  449. vector< vector <string> > string_to_vec2(const char * s)
  450. {
  451. vector< vector <string> > res;
  452. vector<string> lines=string_to_vec(s,"\n");
  453. for(int i=0;i<int(lines.size());i++)
  454. {
  455. vector<string> tmp;
  456. tmp=string_to_vec(lines[i].c_str(),"\t ");
  457. res.push_back(tmp);
  458. }
  459. return res;
  460. }
  461. int read_file(const char * file,string &output)
  462. {
  463. const int max_len=3*1024*1024;
  464. // static char buf[max_len+100];
  465. string buf0;
  466. buf0.reserve(max_len+200);
  467. char * buf=(char *)buf0.c_str();
  468. buf[max_len]=0;
  469. //buf[sizeof(buf)-1]=0;
  470. int fd=open(file,O_RDONLY);
  471. if(fd==-1)
  472. {
  473. mylog(log_error,"read_file %s fail\n",file);
  474. return -1;
  475. }
  476. int len=read(fd,buf,max_len);
  477. if(len==max_len)
  478. {
  479. buf[0]=0;
  480. mylog(log_error,"%s too long,buf not large enough\n",file);
  481. return -2;
  482. }
  483. else if(len<0)
  484. {
  485. buf[0]=0;
  486. mylog(log_error,"%s read fail %d\n",file,len);
  487. return -3;
  488. }
  489. else
  490. {
  491. buf[len]=0;
  492. output=buf;
  493. }
  494. return 0;
  495. }
  496. int run_command(string command0,char * &output,int flag) {
  497. FILE *in;
  498. if((flag&show_log)==0) command0+=" 2>&1 ";
  499. const char * command=command0.c_str();
  500. int level= (flag&show_log)?log_warn:log_debug;
  501. if(flag&show_command)
  502. {
  503. mylog(log_info,"run_command %s\n",command);
  504. }
  505. else
  506. {
  507. mylog(log_debug,"run_command %s\n",command);
  508. }
  509. static __thread char buf[1024*1024+100];
  510. buf[sizeof(buf)-1]=0;
  511. if(!(in = popen(command, "r"))){
  512. mylog(level,"command %s popen failed,errno %s\n",command,strerror(errno));
  513. return -1;
  514. }
  515. int len =fread(buf, 1024*1024, 1, in);
  516. if(len==1024*1024)
  517. {
  518. buf[0]=0;
  519. mylog(level,"too long,buf not larger enough\n");
  520. return -2;
  521. }
  522. else
  523. {
  524. buf[len]=0;
  525. }
  526. int ret;
  527. if(( ret=ferror(in) ))
  528. {
  529. mylog(level,"command %s fread failed,ferror return value %d \n",command,ret);
  530. return -3;
  531. }
  532. //if(output!=0)
  533. output=buf;
  534. ret= pclose(in);
  535. int ret2=WEXITSTATUS(ret);
  536. if(ret!=0||ret2!=0)
  537. {
  538. mylog(level,"commnad %s ,pclose returned %d ,WEXITSTATUS %d,errnor :%s \n",command,ret,ret2,strerror(errno));
  539. return -4;
  540. }
  541. return 0;
  542. }
  543. /*
  544. int run_command_no_log(string command0,char * &output) {
  545. FILE *in;
  546. command0+=" 2>&1 ";
  547. const char * command=command0.c_str();
  548. mylog(log_debug,"run_command_no_log %s\n",command);
  549. static char buf[1024*1024+100];
  550. buf[sizeof(buf)-1]=0;
  551. if(!(in = popen(command, "r"))){
  552. mylog(log_debug,"command %s popen failed,errno %s\n",command,strerror(errno));
  553. return -1;
  554. }
  555. int len =fread(buf, 1024*1024, 1, in);
  556. if(len==1024*1024)
  557. {
  558. buf[0]=0;
  559. mylog(log_debug,"too long,buf not larger enough\n");
  560. return -2;
  561. }
  562. else
  563. {
  564. buf[len]=0;
  565. }
  566. int ret;
  567. if(( ret=ferror(in) ))
  568. {
  569. mylog(log_debug,"command %s fread failed,ferror return value %d \n",command,ret);
  570. return -3;
  571. }
  572. //if(output!=0)
  573. output=buf;
  574. ret= pclose(in);
  575. int ret2=WEXITSTATUS(ret);
  576. if(ret!=0||ret2!=0)
  577. {
  578. mylog(log_debug,"commnad %s ,pclose returned %d ,WEXITSTATUS %d,errnor :%s \n",command,ret,ret2,strerror(errno));
  579. return -4;
  580. }
  581. return 0;
  582. }*/
  583. // Remove preceding and trailing characters
  584. string trim(const string& str, char c) {
  585. size_t first = str.find_first_not_of(c);
  586. if(string::npos==first)
  587. {
  588. return "";
  589. }
  590. size_t last = str.find_last_not_of(c);
  591. return str.substr(first,(last-first+1));
  592. }
  593. vector<string> parse_conf_line(const string& s0)
  594. {
  595. string s=s0;
  596. s.reserve(s.length()+200);
  597. char *buf=(char *)s.c_str();
  598. //char buf[s.length()+200];
  599. char *p=buf;
  600. int i=int(s.length())-1;
  601. int j;
  602. vector<string>res;
  603. strcpy(buf,(char *)s.c_str());
  604. while(i>=0)
  605. {
  606. if(buf[i]==' ' || buf[i]== '\t')
  607. buf[i]=0;
  608. else break;
  609. i--;
  610. }
  611. while(*p!=0)
  612. {
  613. if(*p==' ' || *p== '\t')
  614. {
  615. p++;
  616. }
  617. else break;
  618. }
  619. int new_len=strlen(p);
  620. if(new_len==0)return res;
  621. if(p[0]=='#') return res;
  622. if(p[0]!='-')
  623. {
  624. mylog(log_fatal,"line :<%s> not begin with '-' ",s.c_str());
  625. myexit(-1);
  626. }
  627. for(i=0;i<new_len;i++)
  628. {
  629. if(p[i]==' '||p[i]=='\t')
  630. {
  631. break;
  632. }
  633. }
  634. if(i==new_len)
  635. {
  636. res.push_back(p);
  637. return res;
  638. }
  639. j=i;
  640. while(p[j]==' '||p[j]=='\t')
  641. j++;
  642. p[i]=0;
  643. res.push_back(p);
  644. res.push_back(p+j);
  645. return res;
  646. }