wordsplit.c 33 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628
  1. /* wordsplit - a word splitter
  2. Copyright (C) 2009-2014 Free Software Foundation, Inc.
  3. This program is free software; you can redistribute it and/or modify it
  4. under the terms of the GNU General Public License as published by the
  5. Free Software Foundation; either version 3 of the License, or (at your
  6. option) any later version.
  7. This program is distributed in the hope that it will be useful,
  8. but WITHOUT ANY WARRANTY; without even the implied warranty of
  9. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  10. GNU General Public License for more details.
  11. You should have received a copy of the GNU General Public License along
  12. with this program. If not, see <http://www.gnu.org/licenses/>.
  13. Written by Sergey Poznyakoff
  14. */
  15. #ifdef HAVE_CONFIG_H
  16. # include <config.h>
  17. #endif
  18. #include <errno.h>
  19. #include <ctype.h>
  20. #include <unistd.h>
  21. #include <stdlib.h>
  22. #include <string.h>
  23. #include <stdio.h>
  24. #include <stdarg.h>
  25. #if ENABLE_NLS
  26. # include <gettext.h>
  27. #else
  28. # define gettext(msgid) msgid
  29. #endif
  30. #define _(msgid) gettext (msgid)
  31. #define N_(msgid) msgid
  32. #include <wordsplit.h>
  33. #define ISWS(c) ((c)==' '||(c)=='\t'||(c)=='\n')
  34. #define ISDELIM(ws,c) \
  35. (strchr ((ws)->ws_delim, (c)) != NULL)
  36. #define ISPUNCT(c) (strchr("!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~",(c))!=NULL)
  37. #define ISUPPER(c) ('A' <= ((unsigned) (c)) && ((unsigned) (c)) <= 'Z')
  38. #define ISLOWER(c) ('a' <= ((unsigned) (c)) && ((unsigned) (c)) <= 'z')
  39. #define ISALPHA(c) (ISUPPER(c) || ISLOWER(c))
  40. #define ISDIGIT(c) ('0' <= ((unsigned) (c)) && ((unsigned) (c)) <= '9')
  41. #define ISXDIGIT(c) (strchr("abcdefABCDEF", c)!=NULL)
  42. #define ISALNUM(c) (ISALPHA(c) || ISDIGIT(c))
  43. #define ISPRINT(c) (' ' <= ((unsigned) (c)) && ((unsigned) (c)) <= 127)
  44. #define ALLOC_INIT 128
  45. #define ALLOC_INCR 128
  46. static void
  47. _wsplt_alloc_die (struct wordsplit *wsp)
  48. {
  49. wsp->ws_error (_("memory exhausted"));
  50. abort ();
  51. }
  52. static void __attribute__ ((__format__ (__printf__, 1, 2)))
  53. _wsplt_error (const char *fmt, ...)
  54. {
  55. va_list ap;
  56. va_start (ap, fmt);
  57. vfprintf (stderr, fmt, ap);
  58. va_end (ap);
  59. fputc ('\n', stderr);
  60. }
  61. static void wordsplit_free_nodes (struct wordsplit *);
  62. static int
  63. _wsplt_nomem (struct wordsplit *wsp)
  64. {
  65. errno = ENOMEM;
  66. wsp->ws_errno = WRDSE_NOSPACE;
  67. if (wsp->ws_flags & WRDSF_ENOMEMABRT)
  68. wsp->ws_alloc_die (wsp);
  69. if (wsp->ws_flags & WRDSF_SHOWERR)
  70. wordsplit_perror (wsp);
  71. if (!(wsp->ws_flags & WRDSF_REUSE))
  72. wordsplit_free (wsp);
  73. wordsplit_free_nodes (wsp);
  74. return wsp->ws_errno;
  75. }
  76. static void
  77. wordsplit_init0 (struct wordsplit *wsp)
  78. {
  79. if (wsp->ws_flags & WRDSF_REUSE)
  80. {
  81. if (!(wsp->ws_flags & WRDSF_APPEND))
  82. wordsplit_free_words (wsp);
  83. }
  84. else
  85. {
  86. wsp->ws_wordv = NULL;
  87. wsp->ws_wordc = 0;
  88. wsp->ws_wordn = 0;
  89. }
  90. wsp->ws_errno = 0;
  91. wsp->ws_head = wsp->ws_tail = NULL;
  92. }
  93. static int
  94. wordsplit_init (struct wordsplit *wsp, const char *input, size_t len,
  95. int flags)
  96. {
  97. wsp->ws_flags = flags;
  98. if (!(wsp->ws_flags & WRDSF_ALLOC_DIE))
  99. wsp->ws_alloc_die = _wsplt_alloc_die;
  100. if (!(wsp->ws_flags & WRDSF_ERROR))
  101. wsp->ws_error = _wsplt_error;
  102. if (!(wsp->ws_flags & WRDSF_NOVAR)
  103. && !(wsp->ws_flags & (WRDSF_ENV | WRDSF_GETVAR)))
  104. {
  105. errno = EINVAL;
  106. wsp->ws_errno = WRDSE_USAGE;
  107. if (wsp->ws_flags & WRDSF_SHOWERR)
  108. wordsplit_perror (wsp);
  109. return wsp->ws_errno;
  110. }
  111. if (!(wsp->ws_flags & WRDSF_NOCMD))
  112. {
  113. errno = EINVAL;
  114. wsp->ws_errno = WRDSE_NOSUPP;
  115. if (wsp->ws_flags & WRDSF_SHOWERR)
  116. wordsplit_perror (wsp);
  117. return wsp->ws_errno;
  118. }
  119. if (wsp->ws_flags & WRDSF_SHOWDBG)
  120. {
  121. if (!(wsp->ws_flags & WRDSF_DEBUG))
  122. {
  123. if (wsp->ws_flags & WRDSF_ERROR)
  124. wsp->ws_debug = wsp->ws_error;
  125. else if (wsp->ws_flags & WRDSF_SHOWERR)
  126. wsp->ws_debug = _wsplt_error;
  127. else
  128. wsp->ws_flags &= ~WRDSF_SHOWDBG;
  129. }
  130. }
  131. wsp->ws_input = input;
  132. wsp->ws_len = len;
  133. if (!(wsp->ws_flags & WRDSF_DOOFFS))
  134. wsp->ws_offs = 0;
  135. if (!(wsp->ws_flags & WRDSF_DELIM))
  136. wsp->ws_delim = " \t\n";
  137. if (!(wsp->ws_flags & WRDSF_COMMENT))
  138. wsp->ws_comment = NULL;
  139. if (!(wsp->ws_flags & WRDSF_CLOSURE))
  140. wsp->ws_closure = NULL;
  141. wsp->ws_endp = 0;
  142. wordsplit_init0 (wsp);
  143. return 0;
  144. }
  145. static int
  146. alloc_space (struct wordsplit *wsp, size_t count)
  147. {
  148. size_t offs = (wsp->ws_flags & WRDSF_DOOFFS) ? wsp->ws_offs : 0;
  149. char **ptr;
  150. size_t newalloc;
  151. if (wsp->ws_wordv == NULL)
  152. {
  153. newalloc = offs + count > ALLOC_INIT ? count : ALLOC_INIT;
  154. ptr = calloc (newalloc, sizeof (ptr[0]));
  155. }
  156. else if (wsp->ws_wordn < offs + wsp->ws_wordc + count)
  157. {
  158. newalloc = offs + wsp->ws_wordc +
  159. (count > ALLOC_INCR ? count : ALLOC_INCR);
  160. ptr = realloc (wsp->ws_wordv, newalloc * sizeof (ptr[0]));
  161. }
  162. else
  163. return 0;
  164. if (ptr)
  165. {
  166. wsp->ws_wordn = newalloc;
  167. wsp->ws_wordv = ptr;
  168. }
  169. else
  170. return _wsplt_nomem (wsp);
  171. return 0;
  172. }
  173. /* Node state flags */
  174. #define _WSNF_NULL 0x01 /* null node (a noop) */
  175. #define _WSNF_WORD 0x02 /* node contains word in v.word */
  176. #define _WSNF_QUOTE 0x04 /* text is quoted */
  177. #define _WSNF_NOEXPAND 0x08 /* text is not subject to expansion */
  178. #define _WSNF_JOIN 0x10 /* node must be joined with the next node */
  179. #define _WSNF_SEXP 0x20 /* is a sed expression */
  180. #define _WSNF_EMPTYOK 0x0100 /* special flag indicating that
  181. wordsplit_add_segm must add the
  182. segment even if it is empty */
  183. struct wordsplit_node
  184. {
  185. struct wordsplit_node *prev; /* Previous element */
  186. struct wordsplit_node *next; /* Next element */
  187. int flags; /* Node flags */
  188. union
  189. {
  190. struct
  191. {
  192. size_t beg; /* Start of word in ws_input */
  193. size_t end; /* End of word in ws_input */
  194. } segm;
  195. char *word;
  196. } v;
  197. };
  198. static const char *
  199. wsnode_flagstr (int flags)
  200. {
  201. static char retbuf[6];
  202. char *p = retbuf;
  203. if (flags & _WSNF_WORD)
  204. *p++ = 'w';
  205. else if (flags & _WSNF_NULL)
  206. *p++ = 'n';
  207. else
  208. *p++ = '-';
  209. if (flags & _WSNF_QUOTE)
  210. *p++ = 'q';
  211. else
  212. *p++ = '-';
  213. if (flags & _WSNF_NOEXPAND)
  214. *p++ = 'E';
  215. else
  216. *p++ = '-';
  217. if (flags & _WSNF_JOIN)
  218. *p++ = 'j';
  219. else
  220. *p++ = '-';
  221. if (flags & _WSNF_SEXP)
  222. *p++ = 's';
  223. else
  224. *p++ = '-';
  225. *p = 0;
  226. return retbuf;
  227. }
  228. static const char *
  229. wsnode_ptr (struct wordsplit *wsp, struct wordsplit_node *p)
  230. {
  231. if (p->flags & _WSNF_NULL)
  232. return "";
  233. else if (p->flags & _WSNF_WORD)
  234. return p->v.word;
  235. else
  236. return wsp->ws_input + p->v.segm.beg;
  237. }
  238. static size_t
  239. wsnode_len (struct wordsplit_node *p)
  240. {
  241. if (p->flags & _WSNF_NULL)
  242. return 0;
  243. else if (p->flags & _WSNF_WORD)
  244. return strlen (p->v.word);
  245. else
  246. return p->v.segm.end - p->v.segm.beg;
  247. }
  248. static int
  249. wsnode_new (struct wordsplit *wsp, struct wordsplit_node **pnode)
  250. {
  251. struct wordsplit_node *node = calloc (1, sizeof (*node));
  252. if (!node)
  253. return _wsplt_nomem (wsp);
  254. *pnode = node;
  255. return 0;
  256. }
  257. static void
  258. wsnode_free (struct wordsplit_node *p)
  259. {
  260. if (p->flags & _WSNF_WORD)
  261. free (p->v.word);
  262. free (p);
  263. }
  264. static void
  265. wsnode_append (struct wordsplit *wsp, struct wordsplit_node *node)
  266. {
  267. node->next = NULL;
  268. node->prev = wsp->ws_tail;
  269. if (wsp->ws_tail)
  270. wsp->ws_tail->next = node;
  271. else
  272. wsp->ws_head = node;
  273. wsp->ws_tail = node;
  274. }
  275. static void
  276. wsnode_remove (struct wordsplit *wsp, struct wordsplit_node *node)
  277. {
  278. struct wordsplit_node *p;
  279. p = node->prev;
  280. if (p)
  281. {
  282. p->next = node->next;
  283. if (!node->next)
  284. p->flags &= ~_WSNF_JOIN;
  285. }
  286. else
  287. wsp->ws_head = node->next;
  288. p = node->next;
  289. if (p)
  290. p->prev = node->prev;
  291. else
  292. wsp->ws_tail = node->prev;
  293. node->next = node->prev = NULL;
  294. }
  295. static void
  296. wsnode_insert (struct wordsplit *wsp, struct wordsplit_node *node,
  297. struct wordsplit_node *anchor, int before)
  298. {
  299. if (!wsp->ws_head)
  300. {
  301. node->next = node->prev = NULL;
  302. wsp->ws_head = wsp->ws_tail = node;
  303. }
  304. else if (before)
  305. {
  306. if (anchor->prev)
  307. wsnode_insert (wsp, node, anchor->prev, 0);
  308. else
  309. {
  310. node->prev = NULL;
  311. node->next = anchor;
  312. anchor->prev = node;
  313. wsp->ws_head = node;
  314. }
  315. }
  316. else
  317. {
  318. struct wordsplit_node *p;
  319. p = anchor->next;
  320. if (p)
  321. p->prev = node;
  322. else
  323. wsp->ws_tail = node;
  324. node->next = p;
  325. node->prev = anchor;
  326. anchor->next = node;
  327. }
  328. }
  329. static int
  330. wordsplit_add_segm (struct wordsplit *wsp, size_t beg, size_t end, int flg)
  331. {
  332. struct wordsplit_node *node;
  333. int rc;
  334. if (end == beg && !(flg & _WSNF_EMPTYOK))
  335. return 0;
  336. rc = wsnode_new (wsp, &node);
  337. if (rc)
  338. return rc;
  339. node->flags = flg & ~(_WSNF_WORD | _WSNF_EMPTYOK);
  340. node->v.segm.beg = beg;
  341. node->v.segm.end = end;
  342. wsnode_append (wsp, node);
  343. return 0;
  344. }
  345. static void
  346. wordsplit_free_nodes (struct wordsplit *wsp)
  347. {
  348. struct wordsplit_node *p;
  349. for (p = wsp->ws_head; p;)
  350. {
  351. struct wordsplit_node *next = p->next;
  352. wsnode_free (p);
  353. p = next;
  354. }
  355. wsp->ws_head = wsp->ws_tail = NULL;
  356. }
  357. static void
  358. wordsplit_dump_nodes (struct wordsplit *wsp)
  359. {
  360. struct wordsplit_node *p;
  361. int n = 0;
  362. for (p = wsp->ws_head, n = 0; p; p = p->next, n++)
  363. {
  364. if (p->flags & _WSNF_WORD)
  365. wsp->ws_debug ("%4d: %p: %#04x (%s):%s;",
  366. n, p, p->flags, wsnode_flagstr (p->flags), p->v.word);
  367. else
  368. wsp->ws_debug ("%4d: %p: %#04x (%s):%.*s;",
  369. n, p, p->flags, wsnode_flagstr (p->flags),
  370. (int) (p->v.segm.end - p->v.segm.beg),
  371. wsp->ws_input + p->v.segm.beg);
  372. }
  373. }
  374. static int
  375. coalesce_segment (struct wordsplit *wsp, struct wordsplit_node *node)
  376. {
  377. struct wordsplit_node *p, *end;
  378. size_t len = 0;
  379. char *buf, *cur;
  380. int stop;
  381. for (p = node; p && (p->flags & _WSNF_JOIN); p = p->next)
  382. {
  383. len += wsnode_len (p);
  384. }
  385. len += wsnode_len (p);
  386. end = p;
  387. buf = malloc (len + 1);
  388. if (!buf)
  389. return _wsplt_nomem (wsp);
  390. cur = buf;
  391. p = node;
  392. for (stop = 0; !stop;)
  393. {
  394. struct wordsplit_node *next = p->next;
  395. const char *str = wsnode_ptr (wsp, p);
  396. size_t slen = wsnode_len (p);
  397. memcpy (cur, str, slen);
  398. cur += slen;
  399. if (p != node)
  400. {
  401. wsnode_remove (wsp, p);
  402. stop = p == end;
  403. wsnode_free (p);
  404. }
  405. p = next;
  406. }
  407. *cur = 0;
  408. node->flags &= ~_WSNF_JOIN;
  409. if (node->flags & _WSNF_WORD)
  410. free (node->v.word);
  411. else
  412. node->flags |= _WSNF_WORD;
  413. node->v.word = buf;
  414. return 0;
  415. }
  416. static int
  417. wsnode_quoteremoval (struct wordsplit *wsp)
  418. {
  419. struct wordsplit_node *p;
  420. void (*uqfn) (char *, const char *, size_t) =
  421. (wsp->ws_flags & WRDSF_CESCAPES) ?
  422. wordsplit_c_unquote_copy : wordsplit_sh_unquote_copy;
  423. for (p = wsp->ws_head; p; p = p->next)
  424. {
  425. const char *str = wsnode_ptr (wsp, p);
  426. size_t slen = wsnode_len (p);
  427. int unquote;
  428. if (wsp->ws_flags & WRDSF_QUOTE)
  429. {
  430. unquote = !(p->flags & _WSNF_NOEXPAND);
  431. }
  432. else
  433. unquote = 0;
  434. if (unquote)
  435. {
  436. if (!(p->flags & _WSNF_WORD))
  437. {
  438. char *newstr = malloc (slen + 1);
  439. if (!newstr)
  440. return _wsplt_nomem (wsp);
  441. memcpy (newstr, str, slen);
  442. newstr[slen] = 0;
  443. p->v.word = newstr;
  444. p->flags |= _WSNF_WORD;
  445. }
  446. if (wsp->ws_flags & WRDSF_ESCAPE)
  447. wordsplit_general_unquote_copy (p->v.word, str, slen,
  448. wsp->ws_escape);
  449. else
  450. uqfn (p->v.word, str, slen);
  451. }
  452. }
  453. return 0;
  454. }
  455. static int
  456. wsnode_coalesce (struct wordsplit *wsp)
  457. {
  458. struct wordsplit_node *p;
  459. for (p = wsp->ws_head; p; p = p->next)
  460. {
  461. if (p->flags & _WSNF_JOIN)
  462. if (coalesce_segment (wsp, p))
  463. return 1;
  464. }
  465. return 0;
  466. }
  467. static int
  468. wordsplit_finish (struct wordsplit *wsp)
  469. {
  470. struct wordsplit_node *p;
  471. size_t n;
  472. n = 0;
  473. for (p = wsp->ws_head; p; p = p->next)
  474. n++;
  475. if (alloc_space (wsp, n + 1))
  476. return 1;
  477. for (p = wsp->ws_head; p; p = p->next)
  478. {
  479. const char *str = wsnode_ptr (wsp, p);
  480. size_t slen = wsnode_len (p);
  481. char *newstr = malloc (slen + 1);
  482. /* Assign newstr first, even if it is NULL. This way
  483. wordsplit_free will work even if we return
  484. nomem later. */
  485. wsp->ws_wordv[wsp->ws_offs + wsp->ws_wordc] = newstr;
  486. if (!newstr)
  487. return _wsplt_nomem (wsp);
  488. memcpy (newstr, str, slen);
  489. newstr[slen] = 0;
  490. wsp->ws_wordc++;
  491. }
  492. wsp->ws_wordv[wsp->ws_offs + wsp->ws_wordc] = NULL;
  493. return 0;
  494. }
  495. /* Variable expansion */
  496. static int
  497. node_split_prefix (struct wordsplit *wsp,
  498. struct wordsplit_node **ptail,
  499. struct wordsplit_node *node,
  500. size_t beg, size_t len, int flg)
  501. {
  502. struct wordsplit_node *newnode;
  503. if (len == 0)
  504. return 0;
  505. if (wsnode_new (wsp, &newnode))
  506. return 1;
  507. wsnode_insert (wsp, newnode, *ptail, 0);
  508. if (node->flags & _WSNF_WORD)
  509. {
  510. const char *str = wsnode_ptr (wsp, node);
  511. char *newstr = malloc (len + 1);
  512. if (!newstr)
  513. return _wsplt_nomem (wsp);
  514. memcpy (newstr, str + beg, len);
  515. newstr[len] = 0;
  516. newnode->flags = _WSNF_WORD;
  517. newnode->v.word = newstr;
  518. }
  519. else
  520. {
  521. newnode->v.segm.beg = node->v.segm.beg + beg;
  522. newnode->v.segm.end = newnode->v.segm.beg + len;
  523. }
  524. newnode->flags |= flg;
  525. *ptail = newnode;
  526. return 0;
  527. }
  528. static int
  529. find_closing_cbrace (const char *str, size_t i, size_t len, size_t * poff)
  530. {
  531. enum
  532. { st_init, st_squote, st_dquote } state = st_init;
  533. size_t level = 1;
  534. for (; i < len; i++)
  535. {
  536. switch (state)
  537. {
  538. case st_init:
  539. switch (str[i])
  540. {
  541. case '{':
  542. level++;
  543. break;
  544. case '}':
  545. if (--level == 0)
  546. {
  547. *poff = i;
  548. return 0;
  549. }
  550. break;
  551. case '"':
  552. state = st_dquote;
  553. break;
  554. case '\'':
  555. state = st_squote;
  556. break;
  557. }
  558. break;
  559. case st_squote:
  560. if (str[i] == '\'')
  561. state = st_init;
  562. break;
  563. case st_dquote:
  564. if (str[i] == '\\')
  565. i++;
  566. else if (str[i] == '"')
  567. state = st_init;
  568. break;
  569. }
  570. }
  571. return 1;
  572. }
  573. static const char *
  574. wordsplit_find_env (struct wordsplit *wsp, const char *name, size_t len)
  575. {
  576. size_t i;
  577. if (!(wsp->ws_flags & WRDSF_ENV))
  578. return NULL;
  579. if (wsp->ws_flags & WRDSF_ENV_KV)
  580. {
  581. /* A key-value pair environment */
  582. for (i = 0; wsp->ws_env[i]; i++)
  583. {
  584. size_t elen = strlen (wsp->ws_env[i]);
  585. if (elen == len && memcmp (wsp->ws_env[i], name, elen) == 0)
  586. return wsp->ws_env[i + 1];
  587. /* Skip the value. Break the loop if it is NULL. */
  588. i++;
  589. if (wsp->ws_env[i] == NULL)
  590. break;
  591. }
  592. }
  593. else
  594. {
  595. /* Usual (A=B) environment. */
  596. for (i = 0; wsp->ws_env[i]; i++)
  597. {
  598. size_t j;
  599. const char *var = wsp->ws_env[i];
  600. for (j = 0; j < len; j++)
  601. if (name[j] != var[j])
  602. break;
  603. if (j == len && var[j] == '=')
  604. return var + j + 1;
  605. }
  606. }
  607. return NULL;
  608. }
  609. static int
  610. expvar (struct wordsplit *wsp, const char *str, size_t len,
  611. struct wordsplit_node **ptail, const char **pend, int flg)
  612. {
  613. size_t i = 0;
  614. const char *defstr = NULL;
  615. const char *value;
  616. const char *vptr;
  617. struct wordsplit_node *newnode;
  618. const char *start = str - 1;
  619. if (ISALPHA (str[0]) || str[0] == '_')
  620. {
  621. for (i = 1; i < len; i++)
  622. if (!(ISALNUM (str[i]) || str[i] == '_'))
  623. break;
  624. *pend = str + i - 1;
  625. }
  626. else if (str[0] == '{')
  627. {
  628. str++;
  629. len--;
  630. for (i = 1; i < len; i++)
  631. if (str[i] == '}' || str[i] == ':')
  632. break;
  633. if (str[i] == ':')
  634. {
  635. size_t j;
  636. defstr = str + i + 1;
  637. if (find_closing_cbrace (str, i + 1, len, &j))
  638. {
  639. wsp->ws_errno = WRDSE_CBRACE;
  640. return 1;
  641. }
  642. *pend = str + j;
  643. }
  644. else if (str[i] == '}')
  645. {
  646. defstr = NULL;
  647. *pend = str + i;
  648. }
  649. else
  650. {
  651. wsp->ws_errno = WRDSE_CBRACE;
  652. return 1;
  653. }
  654. }
  655. else
  656. {
  657. if (wsnode_new (wsp, &newnode))
  658. return 1;
  659. wsnode_insert (wsp, newnode, *ptail, 0);
  660. *ptail = newnode;
  661. newnode->flags = _WSNF_WORD | flg;
  662. newnode->v.word = malloc (3);
  663. if (!newnode->v.word)
  664. return _wsplt_nomem (wsp);
  665. newnode->v.word[0] = '$';
  666. newnode->v.word[1] = str[0];
  667. newnode->v.word[2] = 0;
  668. *pend = str;
  669. return 0;
  670. }
  671. /* Actually expand the variable */
  672. /* str - start of the variable name
  673. i - its length
  674. defstr - default replacement str */
  675. vptr = wordsplit_find_env (wsp, str, i);
  676. if (vptr)
  677. {
  678. value = strdup (vptr);
  679. if (!value)
  680. return _wsplt_nomem (wsp);
  681. }
  682. else if (wsp->ws_flags & WRDSF_GETVAR)
  683. value = wsp->ws_getvar (str, i, wsp->ws_closure);
  684. else if (wsp->ws_flags & WRDSF_UNDEF)
  685. {
  686. wsp->ws_errno = WRDSE_UNDEF;
  687. if (wsp->ws_flags & WRDSF_SHOWERR)
  688. wordsplit_perror (wsp);
  689. return 1;
  690. }
  691. else
  692. {
  693. if (wsp->ws_flags & WRDSF_WARNUNDEF)
  694. wsp->ws_error (_("warning: undefined variable `%.*s'"), (int) i, str);
  695. if (wsp->ws_flags & WRDSF_KEEPUNDEF)
  696. value = NULL;
  697. else
  698. value = "";
  699. }
  700. /* FIXME: handle defstr */
  701. (void) defstr;
  702. if (value)
  703. {
  704. if (flg & _WSNF_QUOTE)
  705. {
  706. if (wsnode_new (wsp, &newnode))
  707. return 1;
  708. wsnode_insert (wsp, newnode, *ptail, 0);
  709. *ptail = newnode;
  710. newnode->flags = _WSNF_WORD | _WSNF_NOEXPAND | flg;
  711. newnode->v.word = strdup (value);
  712. if (!newnode->v.word)
  713. return _wsplt_nomem (wsp);
  714. }
  715. else if (*value == 0)
  716. {
  717. /* Empty string is a special case */
  718. if (wsnode_new (wsp, &newnode))
  719. return 1;
  720. wsnode_insert (wsp, newnode, *ptail, 0);
  721. *ptail = newnode;
  722. newnode->flags = _WSNF_NULL;
  723. }
  724. else
  725. {
  726. struct wordsplit ws;
  727. int i;
  728. ws.ws_delim = wsp->ws_delim;
  729. if (wordsplit (value, &ws,
  730. WRDSF_NOVAR | WRDSF_NOCMD | WRDSF_DELIM | WRDSF_WS))
  731. {
  732. wordsplit_free (&ws);
  733. return 1;
  734. }
  735. for (i = 0; i < ws.ws_wordc; i++)
  736. {
  737. if (wsnode_new (wsp, &newnode))
  738. return 1;
  739. wsnode_insert (wsp, newnode, *ptail, 0);
  740. *ptail = newnode;
  741. newnode->flags = _WSNF_WORD |
  742. _WSNF_NOEXPAND |
  743. (i + 1 < ws.ws_wordc ? (flg & ~_WSNF_JOIN) : flg);
  744. newnode->v.word = strdup (ws.ws_wordv[i]);
  745. if (!newnode->v.word)
  746. return _wsplt_nomem (wsp);
  747. }
  748. wordsplit_free (&ws);
  749. }
  750. }
  751. else if (wsp->ws_flags & WRDSF_KEEPUNDEF)
  752. {
  753. size_t size = *pend - start + 1;
  754. if (wsnode_new (wsp, &newnode))
  755. return 1;
  756. wsnode_insert (wsp, newnode, *ptail, 0);
  757. *ptail = newnode;
  758. newnode->flags = _WSNF_WORD | _WSNF_NOEXPAND | flg;
  759. newnode->v.word = malloc (size + 1);
  760. if (!newnode->v.word)
  761. return _wsplt_nomem (wsp);
  762. memcpy (newnode->v.word, start, size);
  763. newnode->v.word[size] = 0;
  764. }
  765. else
  766. {
  767. if (wsnode_new (wsp, &newnode))
  768. return 1;
  769. wsnode_insert (wsp, newnode, *ptail, 0);
  770. *ptail = newnode;
  771. newnode->flags = _WSNF_NULL;
  772. }
  773. return 0;
  774. }
  775. static int
  776. node_expand_vars (struct wordsplit *wsp, struct wordsplit_node *node)
  777. {
  778. const char *str = wsnode_ptr (wsp, node);
  779. size_t slen = wsnode_len (node);
  780. const char *end = str + slen;
  781. const char *p;
  782. size_t off = 0;
  783. struct wordsplit_node *tail = node;
  784. for (p = str; p < end; p++)
  785. {
  786. if (*p == '\\')
  787. {
  788. p++;
  789. continue;
  790. }
  791. if (*p == '$')
  792. {
  793. size_t n = p - str;
  794. if (tail != node)
  795. tail->flags |= _WSNF_JOIN;
  796. if (node_split_prefix (wsp, &tail, node, off, n, _WSNF_JOIN))
  797. return 1;
  798. p++;
  799. if (expvar (wsp, p, slen - n, &tail, &p,
  800. node->flags & (_WSNF_JOIN | _WSNF_QUOTE)))
  801. return 1;
  802. off += p - str + 1;
  803. str = p + 1;
  804. }
  805. }
  806. if (p > str)
  807. {
  808. if (tail != node)
  809. tail->flags |= _WSNF_JOIN;
  810. if (node_split_prefix (wsp, &tail, node, off, p - str,
  811. node->flags & _WSNF_JOIN))
  812. return 1;
  813. }
  814. if (tail != node)
  815. {
  816. wsnode_remove (wsp, node);
  817. wsnode_free (node);
  818. }
  819. return 0;
  820. }
  821. /* Remove NULL lists */
  822. static void
  823. wsnode_nullelim (struct wordsplit *wsp)
  824. {
  825. struct wordsplit_node *p;
  826. for (p = wsp->ws_head; p;)
  827. {
  828. struct wordsplit_node *next = p->next;
  829. if (p->flags & _WSNF_NULL)
  830. {
  831. wsnode_remove (wsp, p);
  832. wsnode_free (p);
  833. }
  834. p = next;
  835. }
  836. }
  837. static int
  838. wordsplit_varexp (struct wordsplit *wsp)
  839. {
  840. struct wordsplit_node *p;
  841. for (p = wsp->ws_head; p;)
  842. {
  843. struct wordsplit_node *next = p->next;
  844. if (!(p->flags & _WSNF_NOEXPAND))
  845. if (node_expand_vars (wsp, p))
  846. return 1;
  847. p = next;
  848. }
  849. wsnode_nullelim (wsp);
  850. return 0;
  851. }
  852. /* Strip off any leading and trailing whitespace. This function is called
  853. right after the initial scanning, therefore it assumes that every
  854. node in the list is a text reference node. */
  855. static void
  856. wordsplit_trimws (struct wordsplit *wsp)
  857. {
  858. struct wordsplit_node *p;
  859. for (p = wsp->ws_head; p; p = p->next)
  860. {
  861. size_t n;
  862. if (p->flags & _WSNF_QUOTE)
  863. continue;
  864. /* Skip leading whitespace: */
  865. for (n = p->v.segm.beg; n < p->v.segm.end && ISWS (wsp->ws_input[n]);
  866. n++)
  867. ;
  868. p->v.segm.beg = n;
  869. /* Trim trailing whitespace */
  870. for (n = p->v.segm.end;
  871. n > p->v.segm.beg && ISWS (wsp->ws_input[n - 1]); n--);
  872. p->v.segm.end = n;
  873. if (p->v.segm.beg == p->v.segm.end)
  874. p->flags |= _WSNF_NULL;
  875. }
  876. wsnode_nullelim (wsp);
  877. }
  878. static int
  879. skip_sed_expr (const char *command, size_t i, size_t len)
  880. {
  881. int state;
  882. do
  883. {
  884. int delim;
  885. if (command[i] == ';')
  886. i++;
  887. if (!(command[i] == 's' && i + 3 < len && ISPUNCT (command[i + 1])))
  888. break;
  889. delim = command[++i];
  890. state = 1;
  891. for (i++; i < len; i++)
  892. {
  893. if (state == 3)
  894. {
  895. if (command[i] == delim || !ISALNUM (command[i]))
  896. break;
  897. }
  898. else if (command[i] == '\\')
  899. i++;
  900. else if (command[i] == delim)
  901. state++;
  902. }
  903. }
  904. while (state == 3 && i < len && command[i] == ';');
  905. return i;
  906. }
  907. static size_t
  908. skip_delim (struct wordsplit *wsp)
  909. {
  910. size_t start = wsp->ws_endp;
  911. if (wsp->ws_flags & WRDSF_SQUEEZE_DELIMS)
  912. {
  913. if ((wsp->ws_flags & WRDSF_RETURN_DELIMS) &&
  914. ISDELIM (wsp, wsp->ws_input[start]))
  915. {
  916. int delim = wsp->ws_input[start];
  917. do
  918. start++;
  919. while (start < wsp->ws_len && delim == wsp->ws_input[start]);
  920. }
  921. else
  922. {
  923. do
  924. start++;
  925. while (start < wsp->ws_len && ISDELIM (wsp, wsp->ws_input[start]));
  926. }
  927. start--;
  928. }
  929. if (!(wsp->ws_flags & WRDSF_RETURN_DELIMS))
  930. start++;
  931. return start;
  932. }
  933. #define _WRDS_EOF 0
  934. #define _WRDS_OK 1
  935. #define _WRDS_ERR 2
  936. static int
  937. scan_qstring (struct wordsplit *wsp, size_t start, size_t * end)
  938. {
  939. size_t j;
  940. const char *command = wsp->ws_input;
  941. size_t len = wsp->ws_len;
  942. char q = command[start];
  943. for (j = start + 1; j < len && command[j] != q; j++)
  944. if (q == '"' && command[j] == '\\')
  945. j++;
  946. if (j < len && command[j] == q)
  947. {
  948. int flags = _WSNF_QUOTE | _WSNF_EMPTYOK;
  949. if (q == '\'')
  950. flags |= _WSNF_NOEXPAND;
  951. if (wordsplit_add_segm (wsp, start + 1, j, flags))
  952. return _WRDS_ERR;
  953. *end = j;
  954. }
  955. else
  956. {
  957. wsp->ws_endp = start;
  958. wsp->ws_errno = WRDSE_QUOTE;
  959. if (wsp->ws_flags & WRDSF_SHOWERR)
  960. wordsplit_perror (wsp);
  961. return _WRDS_ERR;
  962. }
  963. return 0;
  964. }
  965. static int
  966. scan_word (struct wordsplit *wsp, size_t start)
  967. {
  968. size_t len = wsp->ws_len;
  969. const char *command = wsp->ws_input;
  970. const char *comment = wsp->ws_comment;
  971. int join = 0;
  972. int flags = 0;
  973. size_t i = start;
  974. if (i >= len)
  975. {
  976. wsp->ws_errno = WRDSE_EOF;
  977. return _WRDS_EOF;
  978. }
  979. start = i;
  980. if (wsp->ws_flags & WRDSF_SED_EXPR
  981. && command[i] == 's' && i + 3 < len && ISPUNCT (command[i + 1]))
  982. {
  983. flags = _WSNF_SEXP;
  984. i = skip_sed_expr (command, i, len);
  985. }
  986. else if (!ISDELIM (wsp, command[i]))
  987. {
  988. while (i < len)
  989. {
  990. if (comment && strchr (comment, command[i]) != NULL)
  991. {
  992. size_t j;
  993. for (j = i + 1; j < len && command[j] != '\n'; j++)
  994. ;
  995. if (wordsplit_add_segm (wsp, start, i, 0))
  996. return _WRDS_ERR;
  997. wsp->ws_endp = j;
  998. return _WRDS_OK;
  999. }
  1000. if (wsp->ws_flags & WRDSF_QUOTE)
  1001. {
  1002. if (command[i] == '\\')
  1003. {
  1004. if (++i == len)
  1005. break;
  1006. i++;
  1007. continue;
  1008. }
  1009. if (((wsp->ws_flags & WRDSF_SQUOTE) && command[i] == '\'') ||
  1010. ((wsp->ws_flags & WRDSF_DQUOTE) && command[i] == '"'))
  1011. {
  1012. if (join && wsp->ws_tail)
  1013. wsp->ws_tail->flags |= _WSNF_JOIN;
  1014. if (wordsplit_add_segm (wsp, start, i, _WSNF_JOIN))
  1015. return _WRDS_ERR;
  1016. if (scan_qstring (wsp, i, &i))
  1017. return _WRDS_ERR;
  1018. start = i + 1;
  1019. join = 1;
  1020. }
  1021. }
  1022. if (ISDELIM (wsp, command[i]))
  1023. break;
  1024. else
  1025. i++;
  1026. }
  1027. }
  1028. else if (wsp->ws_flags & WRDSF_RETURN_DELIMS)
  1029. {
  1030. i++;
  1031. }
  1032. else if (!(wsp->ws_flags & WRDSF_SQUEEZE_DELIMS))
  1033. flags |= _WSNF_EMPTYOK;
  1034. if (join && i > start && wsp->ws_tail)
  1035. wsp->ws_tail->flags |= _WSNF_JOIN;
  1036. if (wordsplit_add_segm (wsp, start, i, flags))
  1037. return _WRDS_ERR;
  1038. wsp->ws_endp = i;
  1039. if (wsp->ws_flags & WRDSF_INCREMENTAL)
  1040. return _WRDS_EOF;
  1041. return _WRDS_OK;
  1042. }
  1043. static char quote_transtab[] = "\\\\\"\"a\ab\bf\fn\nr\rt\tv\v";
  1044. int
  1045. wordsplit_c_unquote_char (int c)
  1046. {
  1047. char *p;
  1048. for (p = quote_transtab; *p; p += 2)
  1049. {
  1050. if (*p == c)
  1051. return p[1];
  1052. }
  1053. return c;
  1054. }
  1055. int
  1056. wordsplit_c_quote_char (int c)
  1057. {
  1058. char *p;
  1059. for (p = quote_transtab + sizeof (quote_transtab) - 2;
  1060. p > quote_transtab; p -= 2)
  1061. {
  1062. if (*p == c)
  1063. return p[-1];
  1064. }
  1065. return -1;
  1066. }
  1067. #define to_num(c) \
  1068. (ISDIGIT(c) ? c - '0' : (ISXDIGIT(c) ? toupper(c) - 'A' + 10 : 255 ))
  1069. static int
  1070. xtonum (int *pval, const char *src, int base, int cnt)
  1071. {
  1072. int i, val;
  1073. for (i = 0, val = 0; i < cnt; i++, src++)
  1074. {
  1075. int n = *(unsigned char *) src;
  1076. if (n > 127 || (n = to_num (n)) >= base)
  1077. break;
  1078. val = val * base + n;
  1079. }
  1080. *pval = val;
  1081. return i;
  1082. }
  1083. size_t
  1084. wordsplit_c_quoted_length (const char *str, int quote_hex, int *quote)
  1085. {
  1086. size_t len = 0;
  1087. *quote = 0;
  1088. for (; *str; str++)
  1089. {
  1090. if (strchr (" \"", *str))
  1091. *quote = 1;
  1092. if (*str == ' ')
  1093. len++;
  1094. else if (*str == '"')
  1095. len += 2;
  1096. else if (*str != '\t' && *str != '\\' && ISPRINT (*str))
  1097. len++;
  1098. else if (quote_hex)
  1099. len += 3;
  1100. else
  1101. {
  1102. if (wordsplit_c_quote_char (*str) != -1)
  1103. len += 2;
  1104. else
  1105. len += 4;
  1106. }
  1107. }
  1108. return len;
  1109. }
  1110. void
  1111. wordsplit_general_unquote_copy (char *dst, const char *src, size_t n,
  1112. const char *escapable)
  1113. {
  1114. int i;
  1115. for (i = 0; i < n;)
  1116. {
  1117. if (src[i] == '\\' && i < n && strchr (escapable, src[i + 1]))
  1118. i++;
  1119. *dst++ = src[i++];
  1120. }
  1121. *dst = 0;
  1122. }
  1123. void
  1124. wordsplit_sh_unquote_copy (char *dst, const char *src, size_t n)
  1125. {
  1126. int i;
  1127. for (i = 0; i < n;)
  1128. {
  1129. if (src[i] == '\\')
  1130. i++;
  1131. *dst++ = src[i++];
  1132. }
  1133. *dst = 0;
  1134. }
  1135. void
  1136. wordsplit_c_unquote_copy (char *dst, const char *src, size_t n)
  1137. {
  1138. int i = 0;
  1139. int c;
  1140. while (i < n)
  1141. {
  1142. if (src[i] == '\\')
  1143. {
  1144. ++i;
  1145. if (src[i] == 'x' || src[i] == 'X')
  1146. {
  1147. if (n - i < 2)
  1148. {
  1149. *dst++ = '\\';
  1150. *dst++ = src[i++];
  1151. }
  1152. else
  1153. {
  1154. int off = xtonum (&c, src + i + 1,
  1155. 16, 2);
  1156. if (off == 0)
  1157. {
  1158. *dst++ = '\\';
  1159. *dst++ = src[i++];
  1160. }
  1161. else
  1162. {
  1163. *dst++ = c;
  1164. i += off + 1;
  1165. }
  1166. }
  1167. }
  1168. else if ((unsigned char) src[i] < 128 && ISDIGIT (src[i]))
  1169. {
  1170. if (n - i < 1)
  1171. {
  1172. *dst++ = '\\';
  1173. *dst++ = src[i++];
  1174. }
  1175. else
  1176. {
  1177. int off = xtonum (&c, src + i, 8, 3);
  1178. if (off == 0)
  1179. {
  1180. *dst++ = '\\';
  1181. *dst++ = src[i++];
  1182. }
  1183. else
  1184. {
  1185. *dst++ = c;
  1186. i += off;
  1187. }
  1188. }
  1189. }
  1190. else
  1191. *dst++ = wordsplit_c_unquote_char (src[i++]);
  1192. }
  1193. else
  1194. *dst++ = src[i++];
  1195. }
  1196. *dst = 0;
  1197. }
  1198. void
  1199. wordsplit_c_quote_copy (char *dst, const char *src, int quote_hex)
  1200. {
  1201. for (; *src; src++)
  1202. {
  1203. if (*src == '"')
  1204. {
  1205. *dst++ = '\\';
  1206. *dst++ = *src;
  1207. }
  1208. else if (*src != '\t' && *src != '\\' && ISPRINT (*src))
  1209. *dst++ = *src;
  1210. else
  1211. {
  1212. char tmp[4];
  1213. if (quote_hex)
  1214. {
  1215. snprintf (tmp, sizeof tmp, "%%%02X", *(unsigned char *) src);
  1216. memcpy (dst, tmp, 3);
  1217. dst += 3;
  1218. }
  1219. else
  1220. {
  1221. int c = wordsplit_c_quote_char (*src);
  1222. *dst++ = '\\';
  1223. if (c != -1)
  1224. *dst++ = c;
  1225. else
  1226. {
  1227. snprintf (tmp, sizeof tmp, "%03o", *(unsigned char *) src);
  1228. memcpy (dst, tmp, 3);
  1229. dst += 3;
  1230. }
  1231. }
  1232. }
  1233. }
  1234. }
  1235. static int
  1236. wordsplit_process_list (struct wordsplit *wsp, size_t start)
  1237. {
  1238. if (wsp->ws_flags & WRDSF_NOSPLIT)
  1239. {
  1240. /* Treat entire input as a quoted argument */
  1241. if (wordsplit_add_segm (wsp, start, wsp->ws_len, _WSNF_QUOTE))
  1242. return wsp->ws_errno;
  1243. }
  1244. else
  1245. {
  1246. int rc;
  1247. while ((rc = scan_word (wsp, start)) == _WRDS_OK)
  1248. start = skip_delim (wsp);
  1249. /* Make sure tail element is not joinable */
  1250. if (wsp->ws_tail)
  1251. wsp->ws_tail->flags &= ~_WSNF_JOIN;
  1252. if (rc == _WRDS_ERR)
  1253. return wsp->ws_errno;
  1254. }
  1255. if (wsp->ws_flags & WRDSF_SHOWDBG)
  1256. {
  1257. wsp->ws_debug ("Initial list:");
  1258. wordsplit_dump_nodes (wsp);
  1259. }
  1260. if (wsp->ws_flags & WRDSF_WS)
  1261. {
  1262. /* Trim leading and trailing whitespace */
  1263. wordsplit_trimws (wsp);
  1264. if (wsp->ws_flags & WRDSF_SHOWDBG)
  1265. {
  1266. wsp->ws_debug ("After WS trimming:");
  1267. wordsplit_dump_nodes (wsp);
  1268. }
  1269. }
  1270. /* Expand variables (FIXME: & commands) */
  1271. if (!(wsp->ws_flags & WRDSF_NOVAR))
  1272. {
  1273. if (wordsplit_varexp (wsp))
  1274. {
  1275. wordsplit_free_nodes (wsp);
  1276. return wsp->ws_errno;
  1277. }
  1278. if (wsp->ws_flags & WRDSF_SHOWDBG)
  1279. {
  1280. wsp->ws_debug ("Expanded list:");
  1281. wordsplit_dump_nodes (wsp);
  1282. }
  1283. }
  1284. do
  1285. {
  1286. if (wsnode_quoteremoval (wsp))
  1287. break;
  1288. if (wsp->ws_flags & WRDSF_SHOWDBG)
  1289. {
  1290. wsp->ws_debug ("After quote removal:");
  1291. wordsplit_dump_nodes (wsp);
  1292. }
  1293. if (wsnode_coalesce (wsp))
  1294. break;
  1295. if (wsp->ws_flags & WRDSF_SHOWDBG)
  1296. {
  1297. wsp->ws_debug ("Coalesced list:");
  1298. wordsplit_dump_nodes (wsp);
  1299. }
  1300. }
  1301. while (0);
  1302. return wsp->ws_errno;
  1303. }
  1304. int
  1305. wordsplit_len (const char *command, size_t length, struct wordsplit *wsp,
  1306. int flags)
  1307. {
  1308. int rc;
  1309. size_t start;
  1310. const char *cmdptr;
  1311. size_t cmdlen;
  1312. if (!command)
  1313. {
  1314. if (!(flags & WRDSF_INCREMENTAL))
  1315. return EINVAL;
  1316. start = skip_delim (wsp);
  1317. if (wsp->ws_endp == wsp->ws_len)
  1318. {
  1319. wsp->ws_errno = WRDSE_NOINPUT;
  1320. if (wsp->ws_flags & WRDSF_SHOWERR)
  1321. wordsplit_perror (wsp);
  1322. return wsp->ws_errno;
  1323. }
  1324. cmdptr = wsp->ws_input + wsp->ws_endp;
  1325. cmdlen = wsp->ws_len - wsp->ws_endp;
  1326. wsp->ws_flags |= WRDSF_REUSE;
  1327. wordsplit_init0 (wsp);
  1328. }
  1329. else
  1330. {
  1331. cmdptr = command;
  1332. cmdlen = length;
  1333. start = 0;
  1334. rc = wordsplit_init (wsp, cmdptr, cmdlen, flags);
  1335. if (rc)
  1336. return rc;
  1337. }
  1338. if (wsp->ws_flags & WRDSF_SHOWDBG)
  1339. wsp->ws_debug ("Input:%.*s;", (int) cmdlen, cmdptr);
  1340. rc = wordsplit_process_list (wsp, start);
  1341. if (rc == 0 && (flags & WRDSF_INCREMENTAL))
  1342. {
  1343. while (!wsp->ws_head && wsp->ws_endp < wsp->ws_len)
  1344. {
  1345. start = skip_delim (wsp);
  1346. if (wsp->ws_flags & WRDSF_SHOWDBG)
  1347. {
  1348. cmdptr = wsp->ws_input + wsp->ws_endp;
  1349. cmdlen = wsp->ws_len - wsp->ws_endp;
  1350. wsp->ws_debug ("Restart:%.*s;", (int) cmdlen, cmdptr);
  1351. }
  1352. rc = wordsplit_process_list (wsp, start);
  1353. if (rc)
  1354. break;
  1355. }
  1356. }
  1357. if (rc)
  1358. {
  1359. wordsplit_free_nodes (wsp);
  1360. return rc;
  1361. }
  1362. wordsplit_finish (wsp);
  1363. wordsplit_free_nodes (wsp);
  1364. return wsp->ws_errno;
  1365. }
  1366. int
  1367. wordsplit (const char *command, struct wordsplit *ws, int flags)
  1368. {
  1369. return wordsplit_len (command, command ? strlen (command) : 0, ws,
  1370. flags);
  1371. }
  1372. void
  1373. wordsplit_free_words (struct wordsplit *ws)
  1374. {
  1375. size_t i;
  1376. for (i = 0; i < ws->ws_wordc; i++)
  1377. {
  1378. char *p = ws->ws_wordv[ws->ws_offs + i];
  1379. if (p)
  1380. {
  1381. free (p);
  1382. ws->ws_wordv[ws->ws_offs + i] = NULL;
  1383. }
  1384. }
  1385. ws->ws_wordc = 0;
  1386. }
  1387. void
  1388. wordsplit_free (struct wordsplit *ws)
  1389. {
  1390. wordsplit_free_words (ws);
  1391. free (ws->ws_wordv);
  1392. ws->ws_wordv = NULL;
  1393. }
  1394. void
  1395. wordsplit_perror (struct wordsplit *wsp)
  1396. {
  1397. switch (wsp->ws_errno)
  1398. {
  1399. case WRDSE_EOF:
  1400. wsp->ws_error (_("no error"));
  1401. break;
  1402. case WRDSE_QUOTE:
  1403. wsp->ws_error (_("missing closing %c (start near #%lu)"),
  1404. wsp->ws_input[wsp->ws_endp],
  1405. (unsigned long) wsp->ws_endp);
  1406. break;
  1407. case WRDSE_NOSPACE:
  1408. wsp->ws_error (_("memory exhausted"));
  1409. break;
  1410. case WRDSE_NOSUPP:
  1411. wsp->ws_error (_("command substitution is not yet supported"));
  1412. case WRDSE_USAGE:
  1413. wsp->ws_error (_("invalid wordsplit usage"));
  1414. break;
  1415. case WRDSE_CBRACE:
  1416. wsp->ws_error (_("unbalanced curly brace"));
  1417. break;
  1418. case WRDSE_UNDEF:
  1419. wsp->ws_error (_("undefined variable"));
  1420. break;
  1421. case WRDSE_NOINPUT:
  1422. wsp->ws_error (_("input exhausted"));
  1423. break;
  1424. default:
  1425. wsp->ws_error (_("unknown error"));
  1426. }
  1427. }
  1428. const char *_wordsplit_errstr[] = {
  1429. N_("no error"),
  1430. N_("missing closing quote"),
  1431. N_("memory exhausted"),
  1432. N_("command substitution is not yet supported"),
  1433. N_("invalid wordsplit usage"),
  1434. N_("unbalanced curly brace"),
  1435. N_("undefined variable"),
  1436. N_("input exhausted")
  1437. };
  1438. int _wordsplit_nerrs =
  1439. sizeof (_wordsplit_errstr) / sizeof (_wordsplit_errstr[0]);
  1440. const char *
  1441. wordsplit_strerror (struct wordsplit *ws)
  1442. {
  1443. if (ws->ws_errno < _wordsplit_nerrs)
  1444. return _wordsplit_errstr[ws->ws_errno];
  1445. return N_("unknown error");
  1446. }