cli_hush.c 93 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687
  1. /*
  2. * sh.c -- a prototype Bourne shell grammar parser
  3. * Intended to follow the original Thompson and Ritchie
  4. * "small and simple is beautiful" philosophy, which
  5. * incidentally is a good match to today's BusyBox.
  6. *
  7. * Copyright (C) 2000,2001 Larry Doolittle <larry@doolittle.boa.org>
  8. *
  9. * Credits:
  10. * The parser routines proper are all original material, first
  11. * written Dec 2000 and Jan 2001 by Larry Doolittle.
  12. * The execution engine, the builtins, and much of the underlying
  13. * support has been adapted from busybox-0.49pre's lash,
  14. * which is Copyright (C) 2000 by Lineo, Inc., and
  15. * written by Erik Andersen <andersen@lineo.com>, <andersee@debian.org>.
  16. * That, in turn, is based in part on ladsh.c, by Michael K. Johnson and
  17. * Erik W. Troan, which they placed in the public domain. I don't know
  18. * how much of the Johnson/Troan code has survived the repeated rewrites.
  19. * Other credits:
  20. * b_addchr() derived from similar w_addchar function in glibc-2.2
  21. * setup_redirect(), redirect_opt_num(), and big chunks of main()
  22. * and many builtins derived from contributions by Erik Andersen
  23. * miscellaneous bugfixes from Matt Kraai
  24. *
  25. * There are two big (and related) architecture differences between
  26. * this parser and the lash parser. One is that this version is
  27. * actually designed from the ground up to understand nearly all
  28. * of the Bourne grammar. The second, consequential change is that
  29. * the parser and input reader have been turned inside out. Now,
  30. * the parser is in control, and asks for input as needed. The old
  31. * way had the input reader in control, and it asked for parsing to
  32. * take place as needed. The new way makes it much easier to properly
  33. * handle the recursion implicit in the various substitutions, especially
  34. * across continuation lines.
  35. *
  36. * Bash grammar not implemented: (how many of these were in original sh?)
  37. * $@ (those sure look like weird quoting rules)
  38. * $_
  39. * ! negation operator for pipes
  40. * &> and >& redirection of stdout+stderr
  41. * Brace Expansion
  42. * Tilde Expansion
  43. * fancy forms of Parameter Expansion
  44. * aliases
  45. * Arithmetic Expansion
  46. * <(list) and >(list) Process Substitution
  47. * reserved words: case, esac, select, function
  48. * Here Documents ( << word )
  49. * Functions
  50. * Major bugs:
  51. * job handling woefully incomplete and buggy
  52. * reserved word execution woefully incomplete and buggy
  53. * to-do:
  54. * port selected bugfixes from post-0.49 busybox lash - done?
  55. * finish implementing reserved words: for, while, until, do, done
  56. * change { and } from special chars to reserved words
  57. * builtins: break, continue, eval, return, set, trap, ulimit
  58. * test magic exec
  59. * handle children going into background
  60. * clean up recognition of null pipes
  61. * check setting of global_argc and global_argv
  62. * control-C handling, probably with longjmp
  63. * follow IFS rules more precisely, including update semantics
  64. * figure out what to do with backslash-newline
  65. * explain why we use signal instead of sigaction
  66. * propagate syntax errors, die on resource errors?
  67. * continuation lines, both explicit and implicit - done?
  68. * memory leak finding and plugging - done?
  69. * more testing, especially quoting rules and redirection
  70. * document how quoting rules not precisely followed for variable assignments
  71. * maybe change map[] to use 2-bit entries
  72. * (eventually) remove all the printf's
  73. *
  74. * SPDX-License-Identifier: GPL-2.0+
  75. */
  76. #define __U_BOOT__
  77. #ifdef __U_BOOT__
  78. #include <malloc.h> /* malloc, free, realloc*/
  79. #include <linux/ctype.h> /* isalpha, isdigit */
  80. #include <common.h> /* readline */
  81. #include <bootretry.h>
  82. #include <cli.h>
  83. #include <cli_hush.h>
  84. #include <command.h> /* find_cmd */
  85. #ifndef CONFIG_SYS_PROMPT_HUSH_PS2
  86. #define CONFIG_SYS_PROMPT_HUSH_PS2 "> "
  87. #endif
  88. #endif
  89. #ifndef __U_BOOT__
  90. #include <ctype.h> /* isalpha, isdigit */
  91. #include <unistd.h> /* getpid */
  92. #include <stdlib.h> /* getenv, atoi */
  93. #include <string.h> /* strchr */
  94. #include <stdio.h> /* popen etc. */
  95. #include <glob.h> /* glob, of course */
  96. #include <stdarg.h> /* va_list */
  97. #include <errno.h>
  98. #include <fcntl.h>
  99. #include <getopt.h> /* should be pretty obvious */
  100. #include <sys/stat.h> /* ulimit */
  101. #include <sys/types.h>
  102. #include <sys/wait.h>
  103. #include <signal.h>
  104. /* #include <dmalloc.h> */
  105. #if 1
  106. #include "busybox.h"
  107. #include "cmdedit.h"
  108. #else
  109. #define applet_name "hush"
  110. #include "standalone.h"
  111. #define hush_main main
  112. #undef CONFIG_FEATURE_SH_FANCY_PROMPT
  113. #define BB_BANNER
  114. #endif
  115. #endif
  116. #define SPECIAL_VAR_SYMBOL 03
  117. #define SUBSTED_VAR_SYMBOL 04
  118. #ifndef __U_BOOT__
  119. #define FLAG_EXIT_FROM_LOOP 1
  120. #define FLAG_PARSE_SEMICOLON (1 << 1) /* symbol ';' is special for parser */
  121. #define FLAG_REPARSING (1 << 2) /* >= 2nd pass */
  122. #endif
  123. #ifdef __U_BOOT__
  124. DECLARE_GLOBAL_DATA_PTR;
  125. #define EXIT_SUCCESS 0
  126. #define EOF -1
  127. #define syntax() syntax_err()
  128. #define xstrdup strdup
  129. #define error_msg printf
  130. #else
  131. typedef enum {
  132. REDIRECT_INPUT = 1,
  133. REDIRECT_OVERWRITE = 2,
  134. REDIRECT_APPEND = 3,
  135. REDIRECT_HEREIS = 4,
  136. REDIRECT_IO = 5
  137. } redir_type;
  138. /* The descrip member of this structure is only used to make debugging
  139. * output pretty */
  140. struct {int mode; int default_fd; char *descrip;} redir_table[] = {
  141. { 0, 0, "()" },
  142. { O_RDONLY, 0, "<" },
  143. { O_CREAT|O_TRUNC|O_WRONLY, 1, ">" },
  144. { O_CREAT|O_APPEND|O_WRONLY, 1, ">>" },
  145. { O_RDONLY, -1, "<<" },
  146. { O_RDWR, 1, "<>" }
  147. };
  148. #endif
  149. typedef enum {
  150. PIPE_SEQ = 1,
  151. PIPE_AND = 2,
  152. PIPE_OR = 3,
  153. PIPE_BG = 4,
  154. } pipe_style;
  155. /* might eventually control execution */
  156. typedef enum {
  157. RES_NONE = 0,
  158. RES_IF = 1,
  159. RES_THEN = 2,
  160. RES_ELIF = 3,
  161. RES_ELSE = 4,
  162. RES_FI = 5,
  163. RES_FOR = 6,
  164. RES_WHILE = 7,
  165. RES_UNTIL = 8,
  166. RES_DO = 9,
  167. RES_DONE = 10,
  168. RES_XXXX = 11,
  169. RES_IN = 12,
  170. RES_SNTX = 13
  171. } reserved_style;
  172. #define FLAG_END (1<<RES_NONE)
  173. #define FLAG_IF (1<<RES_IF)
  174. #define FLAG_THEN (1<<RES_THEN)
  175. #define FLAG_ELIF (1<<RES_ELIF)
  176. #define FLAG_ELSE (1<<RES_ELSE)
  177. #define FLAG_FI (1<<RES_FI)
  178. #define FLAG_FOR (1<<RES_FOR)
  179. #define FLAG_WHILE (1<<RES_WHILE)
  180. #define FLAG_UNTIL (1<<RES_UNTIL)
  181. #define FLAG_DO (1<<RES_DO)
  182. #define FLAG_DONE (1<<RES_DONE)
  183. #define FLAG_IN (1<<RES_IN)
  184. #define FLAG_START (1<<RES_XXXX)
  185. /* This holds pointers to the various results of parsing */
  186. struct p_context {
  187. struct child_prog *child;
  188. struct pipe *list_head;
  189. struct pipe *pipe;
  190. #ifndef __U_BOOT__
  191. struct redir_struct *pending_redirect;
  192. #endif
  193. reserved_style w;
  194. int old_flag; /* for figuring out valid reserved words */
  195. struct p_context *stack;
  196. int type; /* define type of parser : ";$" common or special symbol */
  197. /* How about quoting status? */
  198. };
  199. #ifndef __U_BOOT__
  200. struct redir_struct {
  201. redir_type type; /* type of redirection */
  202. int fd; /* file descriptor being redirected */
  203. int dup; /* -1, or file descriptor being duplicated */
  204. struct redir_struct *next; /* pointer to the next redirect in the list */
  205. glob_t word; /* *word.gl_pathv is the filename */
  206. };
  207. #endif
  208. struct child_prog {
  209. #ifndef __U_BOOT__
  210. pid_t pid; /* 0 if exited */
  211. #endif
  212. char **argv; /* program name and arguments */
  213. /* was quoted when parsed; copy of struct o_string.nonnull field */
  214. int *argv_nonnull;
  215. #ifdef __U_BOOT__
  216. int argc; /* number of program arguments */
  217. #endif
  218. struct pipe *group; /* if non-NULL, first in group or subshell */
  219. #ifndef __U_BOOT__
  220. int subshell; /* flag, non-zero if group must be forked */
  221. struct redir_struct *redirects; /* I/O redirections */
  222. glob_t glob_result; /* result of parameter globbing */
  223. int is_stopped; /* is the program currently running? */
  224. struct pipe *family; /* pointer back to the child's parent pipe */
  225. #endif
  226. int sp; /* number of SPECIAL_VAR_SYMBOL */
  227. int type;
  228. };
  229. struct pipe {
  230. #ifndef __U_BOOT__
  231. int jobid; /* job number */
  232. #endif
  233. int num_progs; /* total number of programs in job */
  234. #ifndef __U_BOOT__
  235. int running_progs; /* number of programs running */
  236. char *text; /* name of job */
  237. char *cmdbuf; /* buffer various argv's point into */
  238. pid_t pgrp; /* process group ID for the job */
  239. #endif
  240. struct child_prog *progs; /* array of commands in pipe */
  241. struct pipe *next; /* to track background commands */
  242. #ifndef __U_BOOT__
  243. int stopped_progs; /* number of programs alive, but stopped */
  244. int job_context; /* bitmask defining current context */
  245. #endif
  246. pipe_style followup; /* PIPE_BG, PIPE_SEQ, PIPE_OR, PIPE_AND */
  247. reserved_style r_mode; /* supports if, for, while, until */
  248. };
  249. #ifndef __U_BOOT__
  250. struct close_me {
  251. int fd;
  252. struct close_me *next;
  253. };
  254. #endif
  255. struct variables {
  256. char *name;
  257. char *value;
  258. int flg_export;
  259. int flg_read_only;
  260. struct variables *next;
  261. };
  262. /* globals, connect us to the outside world
  263. * the first three support $?, $#, and $1 */
  264. #ifndef __U_BOOT__
  265. char **global_argv;
  266. unsigned int global_argc;
  267. #endif
  268. static unsigned int last_return_code;
  269. #ifndef __U_BOOT__
  270. extern char **environ; /* This is in <unistd.h>, but protected with __USE_GNU */
  271. #endif
  272. /* "globals" within this file */
  273. static uchar *ifs;
  274. static char map[256];
  275. #ifndef __U_BOOT__
  276. static int fake_mode;
  277. static int interactive;
  278. static struct close_me *close_me_head;
  279. static const char *cwd;
  280. static struct pipe *job_list;
  281. static unsigned int last_bg_pid;
  282. static unsigned int last_jobid;
  283. static unsigned int shell_terminal;
  284. static char *PS1;
  285. static char *PS2;
  286. struct variables shell_ver = { "HUSH_VERSION", "0.01", 1, 1, 0 };
  287. struct variables *top_vars = &shell_ver;
  288. #else
  289. static int flag_repeat = 0;
  290. static int do_repeat = 0;
  291. static struct variables *top_vars = NULL ;
  292. #endif /*__U_BOOT__ */
  293. #define B_CHUNK (100)
  294. #define B_NOSPAC 1
  295. typedef struct {
  296. char *data;
  297. int length;
  298. int maxlen;
  299. int quote;
  300. int nonnull;
  301. } o_string;
  302. #define NULL_O_STRING {NULL,0,0,0,0}
  303. /* used for initialization:
  304. o_string foo = NULL_O_STRING; */
  305. /* I can almost use ordinary FILE *. Is open_memstream() universally
  306. * available? Where is it documented? */
  307. struct in_str {
  308. const char *p;
  309. #ifndef __U_BOOT__
  310. char peek_buf[2];
  311. #endif
  312. int __promptme;
  313. int promptmode;
  314. #ifndef __U_BOOT__
  315. FILE *file;
  316. #endif
  317. int (*get) (struct in_str *);
  318. int (*peek) (struct in_str *);
  319. };
  320. #define b_getch(input) ((input)->get(input))
  321. #define b_peek(input) ((input)->peek(input))
  322. #ifndef __U_BOOT__
  323. #define JOB_STATUS_FORMAT "[%d] %-22s %.40s\n"
  324. struct built_in_command {
  325. char *cmd; /* name */
  326. char *descr; /* description */
  327. int (*function) (struct child_prog *); /* function ptr */
  328. };
  329. #endif
  330. /* define DEBUG_SHELL for debugging output (obviously ;-)) */
  331. #if 0
  332. #define DEBUG_SHELL
  333. #endif
  334. /* This should be in utility.c */
  335. #ifdef DEBUG_SHELL
  336. #ifndef __U_BOOT__
  337. static void debug_printf(const char *format, ...)
  338. {
  339. va_list args;
  340. va_start(args, format);
  341. vfprintf(stderr, format, args);
  342. va_end(args);
  343. }
  344. #else
  345. #define debug_printf(fmt,args...) printf (fmt ,##args)
  346. #endif
  347. #else
  348. static inline void debug_printf(const char *format, ...) { }
  349. #endif
  350. #define final_printf debug_printf
  351. #ifdef __U_BOOT__
  352. static void syntax_err(void) {
  353. printf("syntax error\n");
  354. }
  355. #else
  356. static void __syntax(char *file, int line) {
  357. error_msg("syntax error %s:%d", file, line);
  358. }
  359. #define syntax() __syntax(__FILE__, __LINE__)
  360. #endif
  361. #ifdef __U_BOOT__
  362. static void *xmalloc(size_t size);
  363. static void *xrealloc(void *ptr, size_t size);
  364. #else
  365. /* Index of subroutines: */
  366. /* function prototypes for builtins */
  367. static int builtin_cd(struct child_prog *child);
  368. static int builtin_env(struct child_prog *child);
  369. static int builtin_eval(struct child_prog *child);
  370. static int builtin_exec(struct child_prog *child);
  371. static int builtin_exit(struct child_prog *child);
  372. static int builtin_export(struct child_prog *child);
  373. static int builtin_fg_bg(struct child_prog *child);
  374. static int builtin_help(struct child_prog *child);
  375. static int builtin_jobs(struct child_prog *child);
  376. static int builtin_pwd(struct child_prog *child);
  377. static int builtin_read(struct child_prog *child);
  378. static int builtin_set(struct child_prog *child);
  379. static int builtin_shift(struct child_prog *child);
  380. static int builtin_source(struct child_prog *child);
  381. static int builtin_umask(struct child_prog *child);
  382. static int builtin_unset(struct child_prog *child);
  383. static int builtin_not_written(struct child_prog *child);
  384. #endif
  385. /* o_string manipulation: */
  386. static int b_check_space(o_string *o, int len);
  387. static int b_addchr(o_string *o, int ch);
  388. static void b_reset(o_string *o);
  389. static int b_addqchr(o_string *o, int ch, int quote);
  390. #ifndef __U_BOOT__
  391. static int b_adduint(o_string *o, unsigned int i);
  392. #endif
  393. /* in_str manipulations: */
  394. static int static_get(struct in_str *i);
  395. static int static_peek(struct in_str *i);
  396. static int file_get(struct in_str *i);
  397. static int file_peek(struct in_str *i);
  398. #ifndef __U_BOOT__
  399. static void setup_file_in_str(struct in_str *i, FILE *f);
  400. #else
  401. static void setup_file_in_str(struct in_str *i);
  402. #endif
  403. static void setup_string_in_str(struct in_str *i, const char *s);
  404. #ifndef __U_BOOT__
  405. /* close_me manipulations: */
  406. static void mark_open(int fd);
  407. static void mark_closed(int fd);
  408. static void close_all(void);
  409. #endif
  410. /* "run" the final data structures: */
  411. static char *indenter(int i);
  412. static int free_pipe_list(struct pipe *head, int indent);
  413. static int free_pipe(struct pipe *pi, int indent);
  414. /* really run the final data structures: */
  415. #ifndef __U_BOOT__
  416. static int setup_redirects(struct child_prog *prog, int squirrel[]);
  417. #endif
  418. static int run_list_real(struct pipe *pi);
  419. #ifndef __U_BOOT__
  420. static void pseudo_exec(struct child_prog *child) __attribute__ ((noreturn));
  421. #endif
  422. static int run_pipe_real(struct pipe *pi);
  423. /* extended glob support: */
  424. #ifndef __U_BOOT__
  425. static int globhack(const char *src, int flags, glob_t *pglob);
  426. static int glob_needed(const char *s);
  427. static int xglob(o_string *dest, int flags, glob_t *pglob);
  428. #endif
  429. /* variable assignment: */
  430. static int is_assignment(const char *s);
  431. /* data structure manipulation: */
  432. #ifndef __U_BOOT__
  433. static int setup_redirect(struct p_context *ctx, int fd, redir_type style, struct in_str *input);
  434. #endif
  435. static void initialize_context(struct p_context *ctx);
  436. static int done_word(o_string *dest, struct p_context *ctx);
  437. static int done_command(struct p_context *ctx);
  438. static int done_pipe(struct p_context *ctx, pipe_style type);
  439. /* primary string parsing: */
  440. #ifndef __U_BOOT__
  441. static int redirect_dup_num(struct in_str *input);
  442. static int redirect_opt_num(o_string *o);
  443. static int process_command_subs(o_string *dest, struct p_context *ctx, struct in_str *input, int subst_end);
  444. static int parse_group(o_string *dest, struct p_context *ctx, struct in_str *input, int ch);
  445. #endif
  446. static char *lookup_param(char *src);
  447. static char *make_string(char **inp, int *nonnull);
  448. static int handle_dollar(o_string *dest, struct p_context *ctx, struct in_str *input);
  449. #ifndef __U_BOOT__
  450. static int parse_string(o_string *dest, struct p_context *ctx, const char *src);
  451. #endif
  452. static int parse_stream(o_string *dest, struct p_context *ctx, struct in_str *input0, int end_trigger);
  453. /* setup: */
  454. static int parse_stream_outer(struct in_str *inp, int flag);
  455. #ifndef __U_BOOT__
  456. static int parse_string_outer(const char *s, int flag);
  457. static int parse_file_outer(FILE *f);
  458. #endif
  459. #ifndef __U_BOOT__
  460. /* job management: */
  461. static int checkjobs(struct pipe* fg_pipe);
  462. static void insert_bg_job(struct pipe *pi);
  463. static void remove_bg_job(struct pipe *pi);
  464. #endif
  465. /* local variable support */
  466. static char **make_list_in(char **inp, char *name);
  467. static char *insert_var_value(char *inp);
  468. static char *insert_var_value_sub(char *inp, int tag_subst);
  469. #ifndef __U_BOOT__
  470. /* Table of built-in functions. They can be forked or not, depending on
  471. * context: within pipes, they fork. As simple commands, they do not.
  472. * When used in non-forking context, they can change global variables
  473. * in the parent shell process. If forked, of course they can not.
  474. * For example, 'unset foo | whatever' will parse and run, but foo will
  475. * still be set at the end. */
  476. static struct built_in_command bltins[] = {
  477. {"bg", "Resume a job in the background", builtin_fg_bg},
  478. {"break", "Exit for, while or until loop", builtin_not_written},
  479. {"cd", "Change working directory", builtin_cd},
  480. {"continue", "Continue for, while or until loop", builtin_not_written},
  481. {"env", "Print all environment variables", builtin_env},
  482. {"eval", "Construct and run shell command", builtin_eval},
  483. {"exec", "Exec command, replacing this shell with the exec'd process",
  484. builtin_exec},
  485. {"exit", "Exit from shell()", builtin_exit},
  486. {"export", "Set environment variable", builtin_export},
  487. {"fg", "Bring job into the foreground", builtin_fg_bg},
  488. {"jobs", "Lists the active jobs", builtin_jobs},
  489. {"pwd", "Print current directory", builtin_pwd},
  490. {"read", "Input environment variable", builtin_read},
  491. {"return", "Return from a function", builtin_not_written},
  492. {"set", "Set/unset shell local variables", builtin_set},
  493. {"shift", "Shift positional parameters", builtin_shift},
  494. {"trap", "Trap signals", builtin_not_written},
  495. {"ulimit","Controls resource limits", builtin_not_written},
  496. {"umask","Sets file creation mask", builtin_umask},
  497. {"unset", "Unset environment variable", builtin_unset},
  498. {".", "Source-in and run commands in a file", builtin_source},
  499. {"help", "List shell built-in commands", builtin_help},
  500. {NULL, NULL, NULL}
  501. };
  502. static const char *set_cwd(void)
  503. {
  504. if(cwd==unknown)
  505. cwd = NULL; /* xgetcwd(arg) called free(arg) */
  506. cwd = xgetcwd((char *)cwd);
  507. if (!cwd)
  508. cwd = unknown;
  509. return cwd;
  510. }
  511. /* built-in 'eval' handler */
  512. static int builtin_eval(struct child_prog *child)
  513. {
  514. char *str = NULL;
  515. int rcode = EXIT_SUCCESS;
  516. if (child->argv[1]) {
  517. str = make_string(child->argv + 1);
  518. parse_string_outer(str, FLAG_EXIT_FROM_LOOP |
  519. FLAG_PARSE_SEMICOLON);
  520. free(str);
  521. rcode = last_return_code;
  522. }
  523. return rcode;
  524. }
  525. /* built-in 'cd <path>' handler */
  526. static int builtin_cd(struct child_prog *child)
  527. {
  528. char *newdir;
  529. if (child->argv[1] == NULL)
  530. newdir = getenv("HOME");
  531. else
  532. newdir = child->argv[1];
  533. if (chdir(newdir)) {
  534. printf("cd: %s: %s\n", newdir, strerror(errno));
  535. return EXIT_FAILURE;
  536. }
  537. set_cwd();
  538. return EXIT_SUCCESS;
  539. }
  540. /* built-in 'env' handler */
  541. static int builtin_env(struct child_prog *dummy)
  542. {
  543. char **e = environ;
  544. if (e == NULL) return EXIT_FAILURE;
  545. for (; *e; e++) {
  546. puts(*e);
  547. }
  548. return EXIT_SUCCESS;
  549. }
  550. /* built-in 'exec' handler */
  551. static int builtin_exec(struct child_prog *child)
  552. {
  553. if (child->argv[1] == NULL)
  554. return EXIT_SUCCESS; /* Really? */
  555. child->argv++;
  556. pseudo_exec(child);
  557. /* never returns */
  558. }
  559. /* built-in 'exit' handler */
  560. static int builtin_exit(struct child_prog *child)
  561. {
  562. if (child->argv[1] == NULL)
  563. exit(last_return_code);
  564. exit (atoi(child->argv[1]));
  565. }
  566. /* built-in 'export VAR=value' handler */
  567. static int builtin_export(struct child_prog *child)
  568. {
  569. int res = 0;
  570. char *name = child->argv[1];
  571. if (name == NULL) {
  572. return (builtin_env(child));
  573. }
  574. name = strdup(name);
  575. if(name) {
  576. char *value = strchr(name, '=');
  577. if (!value) {
  578. char *tmp;
  579. /* They are exporting something without an =VALUE */
  580. value = get_local_var(name);
  581. if (value) {
  582. size_t ln = strlen(name);
  583. tmp = realloc(name, ln+strlen(value)+2);
  584. if(tmp==NULL)
  585. res = -1;
  586. else {
  587. sprintf(tmp+ln, "=%s", value);
  588. name = tmp;
  589. }
  590. } else {
  591. /* bash does not return an error when trying to export
  592. * an undefined variable. Do likewise. */
  593. res = 1;
  594. }
  595. }
  596. }
  597. if (res<0)
  598. perror_msg("export");
  599. else if(res==0)
  600. res = set_local_var(name, 1);
  601. else
  602. res = 0;
  603. free(name);
  604. return res;
  605. }
  606. /* built-in 'fg' and 'bg' handler */
  607. static int builtin_fg_bg(struct child_prog *child)
  608. {
  609. int i, jobnum;
  610. struct pipe *pi=NULL;
  611. if (!interactive)
  612. return EXIT_FAILURE;
  613. /* If they gave us no args, assume they want the last backgrounded task */
  614. if (!child->argv[1]) {
  615. for (pi = job_list; pi; pi = pi->next) {
  616. if (pi->jobid == last_jobid) {
  617. break;
  618. }
  619. }
  620. if (!pi) {
  621. error_msg("%s: no current job", child->argv[0]);
  622. return EXIT_FAILURE;
  623. }
  624. } else {
  625. if (sscanf(child->argv[1], "%%%d", &jobnum) != 1) {
  626. error_msg("%s: bad argument '%s'", child->argv[0], child->argv[1]);
  627. return EXIT_FAILURE;
  628. }
  629. for (pi = job_list; pi; pi = pi->next) {
  630. if (pi->jobid == jobnum) {
  631. break;
  632. }
  633. }
  634. if (!pi) {
  635. error_msg("%s: %d: no such job", child->argv[0], jobnum);
  636. return EXIT_FAILURE;
  637. }
  638. }
  639. if (*child->argv[0] == 'f') {
  640. /* Put the job into the foreground. */
  641. tcsetpgrp(shell_terminal, pi->pgrp);
  642. }
  643. /* Restart the processes in the job */
  644. for (i = 0; i < pi->num_progs; i++)
  645. pi->progs[i].is_stopped = 0;
  646. if ( (i=kill(- pi->pgrp, SIGCONT)) < 0) {
  647. if (i == ESRCH) {
  648. remove_bg_job(pi);
  649. } else {
  650. perror_msg("kill (SIGCONT)");
  651. }
  652. }
  653. pi->stopped_progs = 0;
  654. return EXIT_SUCCESS;
  655. }
  656. /* built-in 'help' handler */
  657. static int builtin_help(struct child_prog *dummy)
  658. {
  659. struct built_in_command *x;
  660. printf("\nBuilt-in commands:\n");
  661. printf("-------------------\n");
  662. for (x = bltins; x->cmd; x++) {
  663. if (x->descr==NULL)
  664. continue;
  665. printf("%s\t%s\n", x->cmd, x->descr);
  666. }
  667. printf("\n\n");
  668. return EXIT_SUCCESS;
  669. }
  670. /* built-in 'jobs' handler */
  671. static int builtin_jobs(struct child_prog *child)
  672. {
  673. struct pipe *job;
  674. char *status_string;
  675. for (job = job_list; job; job = job->next) {
  676. if (job->running_progs == job->stopped_progs)
  677. status_string = "Stopped";
  678. else
  679. status_string = "Running";
  680. printf(JOB_STATUS_FORMAT, job->jobid, status_string, job->text);
  681. }
  682. return EXIT_SUCCESS;
  683. }
  684. /* built-in 'pwd' handler */
  685. static int builtin_pwd(struct child_prog *dummy)
  686. {
  687. puts(set_cwd());
  688. return EXIT_SUCCESS;
  689. }
  690. /* built-in 'read VAR' handler */
  691. static int builtin_read(struct child_prog *child)
  692. {
  693. int res;
  694. if (child->argv[1]) {
  695. char string[BUFSIZ];
  696. char *var = 0;
  697. string[0] = 0; /* In case stdin has only EOF */
  698. /* read string */
  699. fgets(string, sizeof(string), stdin);
  700. chomp(string);
  701. var = malloc(strlen(child->argv[1])+strlen(string)+2);
  702. if(var) {
  703. sprintf(var, "%s=%s", child->argv[1], string);
  704. res = set_local_var(var, 0);
  705. } else
  706. res = -1;
  707. if (res)
  708. fprintf(stderr, "read: %m\n");
  709. free(var); /* So not move up to avoid breaking errno */
  710. return res;
  711. } else {
  712. do res=getchar(); while(res!='\n' && res!=EOF);
  713. return 0;
  714. }
  715. }
  716. /* built-in 'set VAR=value' handler */
  717. static int builtin_set(struct child_prog *child)
  718. {
  719. char *temp = child->argv[1];
  720. struct variables *e;
  721. if (temp == NULL)
  722. for(e = top_vars; e; e=e->next)
  723. printf("%s=%s\n", e->name, e->value);
  724. else
  725. set_local_var(temp, 0);
  726. return EXIT_SUCCESS;
  727. }
  728. /* Built-in 'shift' handler */
  729. static int builtin_shift(struct child_prog *child)
  730. {
  731. int n=1;
  732. if (child->argv[1]) {
  733. n=atoi(child->argv[1]);
  734. }
  735. if (n>=0 && n<global_argc) {
  736. /* XXX This probably breaks $0 */
  737. global_argc -= n;
  738. global_argv += n;
  739. return EXIT_SUCCESS;
  740. } else {
  741. return EXIT_FAILURE;
  742. }
  743. }
  744. /* Built-in '.' handler (read-in and execute commands from file) */
  745. static int builtin_source(struct child_prog *child)
  746. {
  747. FILE *input;
  748. int status;
  749. if (child->argv[1] == NULL)
  750. return EXIT_FAILURE;
  751. /* XXX search through $PATH is missing */
  752. input = fopen(child->argv[1], "r");
  753. if (!input) {
  754. error_msg("Couldn't open file '%s'", child->argv[1]);
  755. return EXIT_FAILURE;
  756. }
  757. /* Now run the file */
  758. /* XXX argv and argc are broken; need to save old global_argv
  759. * (pointer only is OK!) on this stack frame,
  760. * set global_argv=child->argv+1, recurse, and restore. */
  761. mark_open(fileno(input));
  762. status = parse_file_outer(input);
  763. mark_closed(fileno(input));
  764. fclose(input);
  765. return (status);
  766. }
  767. static int builtin_umask(struct child_prog *child)
  768. {
  769. mode_t new_umask;
  770. const char *arg = child->argv[1];
  771. char *end;
  772. if (arg) {
  773. new_umask=strtoul(arg, &end, 8);
  774. if (*end!='\0' || end == arg) {
  775. return EXIT_FAILURE;
  776. }
  777. } else {
  778. printf("%.3o\n", (unsigned int) (new_umask=umask(0)));
  779. }
  780. umask(new_umask);
  781. return EXIT_SUCCESS;
  782. }
  783. /* built-in 'unset VAR' handler */
  784. static int builtin_unset(struct child_prog *child)
  785. {
  786. /* bash returned already true */
  787. unset_local_var(child->argv[1]);
  788. return EXIT_SUCCESS;
  789. }
  790. static int builtin_not_written(struct child_prog *child)
  791. {
  792. printf("builtin_%s not written\n",child->argv[0]);
  793. return EXIT_FAILURE;
  794. }
  795. #endif
  796. static int b_check_space(o_string *o, int len)
  797. {
  798. /* It would be easy to drop a more restrictive policy
  799. * in here, such as setting a maximum string length */
  800. if (o->length + len > o->maxlen) {
  801. char *old_data = o->data;
  802. /* assert (data == NULL || o->maxlen != 0); */
  803. o->maxlen += max(2*len, B_CHUNK);
  804. o->data = realloc(o->data, 1 + o->maxlen);
  805. if (o->data == NULL) {
  806. free(old_data);
  807. }
  808. }
  809. return o->data == NULL;
  810. }
  811. static int b_addchr(o_string *o, int ch)
  812. {
  813. debug_printf("b_addchr: %c %d %p\n", ch, o->length, o);
  814. if (b_check_space(o, 1)) return B_NOSPAC;
  815. o->data[o->length] = ch;
  816. o->length++;
  817. o->data[o->length] = '\0';
  818. return 0;
  819. }
  820. static void b_reset(o_string *o)
  821. {
  822. o->length = 0;
  823. o->nonnull = 0;
  824. if (o->data != NULL) *o->data = '\0';
  825. }
  826. static void b_free(o_string *o)
  827. {
  828. b_reset(o);
  829. free(o->data);
  830. o->data = NULL;
  831. o->maxlen = 0;
  832. }
  833. /* My analysis of quoting semantics tells me that state information
  834. * is associated with a destination, not a source.
  835. */
  836. static int b_addqchr(o_string *o, int ch, int quote)
  837. {
  838. if (quote && strchr("*?[\\",ch)) {
  839. int rc;
  840. rc = b_addchr(o, '\\');
  841. if (rc) return rc;
  842. }
  843. return b_addchr(o, ch);
  844. }
  845. #ifndef __U_BOOT__
  846. static int b_adduint(o_string *o, unsigned int i)
  847. {
  848. int r;
  849. char *p = simple_itoa(i);
  850. /* no escape checking necessary */
  851. do r=b_addchr(o, *p++); while (r==0 && *p);
  852. return r;
  853. }
  854. #endif
  855. static int static_get(struct in_str *i)
  856. {
  857. int ch = *i->p++;
  858. if (ch=='\0') return EOF;
  859. return ch;
  860. }
  861. static int static_peek(struct in_str *i)
  862. {
  863. return *i->p;
  864. }
  865. #ifndef __U_BOOT__
  866. static inline void cmdedit_set_initial_prompt(void)
  867. {
  868. #ifndef CONFIG_FEATURE_SH_FANCY_PROMPT
  869. PS1 = NULL;
  870. #else
  871. PS1 = getenv("PS1");
  872. if(PS1==0)
  873. PS1 = "\\w \\$ ";
  874. #endif
  875. }
  876. static inline void setup_prompt_string(int promptmode, char **prompt_str)
  877. {
  878. debug_printf("setup_prompt_string %d ",promptmode);
  879. #ifndef CONFIG_FEATURE_SH_FANCY_PROMPT
  880. /* Set up the prompt */
  881. if (promptmode == 1) {
  882. free(PS1);
  883. PS1=xmalloc(strlen(cwd)+4);
  884. sprintf(PS1, "%s %s", cwd, ( geteuid() != 0 ) ? "$ ":"# ");
  885. *prompt_str = PS1;
  886. } else {
  887. *prompt_str = PS2;
  888. }
  889. #else
  890. *prompt_str = (promptmode==1)? PS1 : PS2;
  891. #endif
  892. debug_printf("result %s\n",*prompt_str);
  893. }
  894. #endif
  895. static void get_user_input(struct in_str *i)
  896. {
  897. #ifndef __U_BOOT__
  898. char *prompt_str;
  899. static char the_command[BUFSIZ];
  900. setup_prompt_string(i->promptmode, &prompt_str);
  901. #ifdef CONFIG_FEATURE_COMMAND_EDITING
  902. /*
  903. ** enable command line editing only while a command line
  904. ** is actually being read; otherwise, we'll end up bequeathing
  905. ** atexit() handlers and other unwanted stuff to our
  906. ** child processes (rob@sysgo.de)
  907. */
  908. cmdedit_read_input(prompt_str, the_command);
  909. #else
  910. fputs(prompt_str, stdout);
  911. fflush(stdout);
  912. the_command[0]=fgetc(i->file);
  913. the_command[1]='\0';
  914. #endif
  915. fflush(stdout);
  916. i->p = the_command;
  917. #else
  918. int n;
  919. static char the_command[CONFIG_SYS_CBSIZE + 1];
  920. bootretry_reset_cmd_timeout();
  921. i->__promptme = 1;
  922. if (i->promptmode == 1) {
  923. n = cli_readline(CONFIG_SYS_PROMPT);
  924. } else {
  925. n = cli_readline(CONFIG_SYS_PROMPT_HUSH_PS2);
  926. }
  927. #ifdef CONFIG_BOOT_RETRY_TIME
  928. if (n == -2) {
  929. puts("\nTimeout waiting for command\n");
  930. # ifdef CONFIG_RESET_TO_RETRY
  931. do_reset(NULL, 0, 0, NULL);
  932. # else
  933. # error "This currently only works with CONFIG_RESET_TO_RETRY enabled"
  934. # endif
  935. }
  936. #endif
  937. if (n == -1 ) {
  938. flag_repeat = 0;
  939. i->__promptme = 0;
  940. }
  941. n = strlen(console_buffer);
  942. console_buffer[n] = '\n';
  943. console_buffer[n+1]= '\0';
  944. if (had_ctrlc()) flag_repeat = 0;
  945. clear_ctrlc();
  946. do_repeat = 0;
  947. if (i->promptmode == 1) {
  948. if (console_buffer[0] == '\n'&& flag_repeat == 0) {
  949. strcpy(the_command,console_buffer);
  950. }
  951. else {
  952. if (console_buffer[0] != '\n') {
  953. strcpy(the_command,console_buffer);
  954. flag_repeat = 1;
  955. }
  956. else {
  957. do_repeat = 1;
  958. }
  959. }
  960. i->p = the_command;
  961. }
  962. else {
  963. if (console_buffer[0] != '\n') {
  964. if (strlen(the_command) + strlen(console_buffer)
  965. < CONFIG_SYS_CBSIZE) {
  966. n = strlen(the_command);
  967. the_command[n-1] = ' ';
  968. strcpy(&the_command[n],console_buffer);
  969. }
  970. else {
  971. the_command[0] = '\n';
  972. the_command[1] = '\0';
  973. flag_repeat = 0;
  974. }
  975. }
  976. if (i->__promptme == 0) {
  977. the_command[0] = '\n';
  978. the_command[1] = '\0';
  979. }
  980. i->p = console_buffer;
  981. }
  982. #endif
  983. }
  984. /* This is the magic location that prints prompts
  985. * and gets data back from the user */
  986. static int file_get(struct in_str *i)
  987. {
  988. int ch;
  989. ch = 0;
  990. /* If there is data waiting, eat it up */
  991. if (i->p && *i->p) {
  992. ch = *i->p++;
  993. } else {
  994. /* need to double check i->file because we might be doing something
  995. * more complicated by now, like sourcing or substituting. */
  996. #ifndef __U_BOOT__
  997. if (i->__promptme && interactive && i->file == stdin) {
  998. while(! i->p || (interactive && strlen(i->p)==0) ) {
  999. #else
  1000. while(! i->p || strlen(i->p)==0 ) {
  1001. #endif
  1002. get_user_input(i);
  1003. }
  1004. i->promptmode=2;
  1005. #ifndef __U_BOOT__
  1006. i->__promptme = 0;
  1007. #endif
  1008. if (i->p && *i->p) {
  1009. ch = *i->p++;
  1010. }
  1011. #ifndef __U_BOOT__
  1012. } else {
  1013. ch = fgetc(i->file);
  1014. }
  1015. #endif
  1016. debug_printf("b_getch: got a %d\n", ch);
  1017. }
  1018. #ifndef __U_BOOT__
  1019. if (ch == '\n') i->__promptme=1;
  1020. #endif
  1021. return ch;
  1022. }
  1023. /* All the callers guarantee this routine will never be
  1024. * used right after a newline, so prompting is not needed.
  1025. */
  1026. static int file_peek(struct in_str *i)
  1027. {
  1028. #ifndef __U_BOOT__
  1029. if (i->p && *i->p) {
  1030. #endif
  1031. return *i->p;
  1032. #ifndef __U_BOOT__
  1033. } else {
  1034. i->peek_buf[0] = fgetc(i->file);
  1035. i->peek_buf[1] = '\0';
  1036. i->p = i->peek_buf;
  1037. debug_printf("b_peek: got a %d\n", *i->p);
  1038. return *i->p;
  1039. }
  1040. #endif
  1041. }
  1042. #ifndef __U_BOOT__
  1043. static void setup_file_in_str(struct in_str *i, FILE *f)
  1044. #else
  1045. static void setup_file_in_str(struct in_str *i)
  1046. #endif
  1047. {
  1048. i->peek = file_peek;
  1049. i->get = file_get;
  1050. i->__promptme=1;
  1051. i->promptmode=1;
  1052. #ifndef __U_BOOT__
  1053. i->file = f;
  1054. #endif
  1055. i->p = NULL;
  1056. }
  1057. static void setup_string_in_str(struct in_str *i, const char *s)
  1058. {
  1059. i->peek = static_peek;
  1060. i->get = static_get;
  1061. i->__promptme=1;
  1062. i->promptmode=1;
  1063. i->p = s;
  1064. }
  1065. #ifndef __U_BOOT__
  1066. static void mark_open(int fd)
  1067. {
  1068. struct close_me *new = xmalloc(sizeof(struct close_me));
  1069. new->fd = fd;
  1070. new->next = close_me_head;
  1071. close_me_head = new;
  1072. }
  1073. static void mark_closed(int fd)
  1074. {
  1075. struct close_me *tmp;
  1076. if (close_me_head == NULL || close_me_head->fd != fd)
  1077. error_msg_and_die("corrupt close_me");
  1078. tmp = close_me_head;
  1079. close_me_head = close_me_head->next;
  1080. free(tmp);
  1081. }
  1082. static void close_all(void)
  1083. {
  1084. struct close_me *c;
  1085. for (c=close_me_head; c; c=c->next) {
  1086. close(c->fd);
  1087. }
  1088. close_me_head = NULL;
  1089. }
  1090. /* squirrel != NULL means we squirrel away copies of stdin, stdout,
  1091. * and stderr if they are redirected. */
  1092. static int setup_redirects(struct child_prog *prog, int squirrel[])
  1093. {
  1094. int openfd, mode;
  1095. struct redir_struct *redir;
  1096. for (redir=prog->redirects; redir; redir=redir->next) {
  1097. if (redir->dup == -1 && redir->word.gl_pathv == NULL) {
  1098. /* something went wrong in the parse. Pretend it didn't happen */
  1099. continue;
  1100. }
  1101. if (redir->dup == -1) {
  1102. mode=redir_table[redir->type].mode;
  1103. openfd = open(redir->word.gl_pathv[0], mode, 0666);
  1104. if (openfd < 0) {
  1105. /* this could get lost if stderr has been redirected, but
  1106. bash and ash both lose it as well (though zsh doesn't!) */
  1107. perror_msg("error opening %s", redir->word.gl_pathv[0]);
  1108. return 1;
  1109. }
  1110. } else {
  1111. openfd = redir->dup;
  1112. }
  1113. if (openfd != redir->fd) {
  1114. if (squirrel && redir->fd < 3) {
  1115. squirrel[redir->fd] = dup(redir->fd);
  1116. }
  1117. if (openfd == -3) {
  1118. close(openfd);
  1119. } else {
  1120. dup2(openfd, redir->fd);
  1121. if (redir->dup == -1)
  1122. close (openfd);
  1123. }
  1124. }
  1125. }
  1126. return 0;
  1127. }
  1128. static void restore_redirects(int squirrel[])
  1129. {
  1130. int i, fd;
  1131. for (i=0; i<3; i++) {
  1132. fd = squirrel[i];
  1133. if (fd != -1) {
  1134. /* No error checking. I sure wouldn't know what
  1135. * to do with an error if I found one! */
  1136. dup2(fd, i);
  1137. close(fd);
  1138. }
  1139. }
  1140. }
  1141. /* never returns */
  1142. /* XXX no exit() here. If you don't exec, use _exit instead.
  1143. * The at_exit handlers apparently confuse the calling process,
  1144. * in particular stdin handling. Not sure why? */
  1145. static void pseudo_exec(struct child_prog *child)
  1146. {
  1147. int i, rcode;
  1148. char *p;
  1149. struct built_in_command *x;
  1150. if (child->argv) {
  1151. for (i=0; is_assignment(child->argv[i]); i++) {
  1152. debug_printf("pid %d environment modification: %s\n",getpid(),child->argv[i]);
  1153. p = insert_var_value(child->argv[i]);
  1154. putenv(strdup(p));
  1155. if (p != child->argv[i]) free(p);
  1156. }
  1157. child->argv+=i; /* XXX this hack isn't so horrible, since we are about
  1158. to exit, and therefore don't need to keep data
  1159. structures consistent for free() use. */
  1160. /* If a variable is assigned in a forest, and nobody listens,
  1161. * was it ever really set?
  1162. */
  1163. if (child->argv[0] == NULL) {
  1164. _exit(EXIT_SUCCESS);
  1165. }
  1166. /*
  1167. * Check if the command matches any of the builtins.
  1168. * Depending on context, this might be redundant. But it's
  1169. * easier to waste a few CPU cycles than it is to figure out
  1170. * if this is one of those cases.
  1171. */
  1172. for (x = bltins; x->cmd; x++) {
  1173. if (strcmp(child->argv[0], x->cmd) == 0 ) {
  1174. debug_printf("builtin exec %s\n", child->argv[0]);
  1175. rcode = x->function(child);
  1176. fflush(stdout);
  1177. _exit(rcode);
  1178. }
  1179. }
  1180. /* Check if the command matches any busybox internal commands
  1181. * ("applets") here.
  1182. * FIXME: This feature is not 100% safe, since
  1183. * BusyBox is not fully reentrant, so we have no guarantee the things
  1184. * from the .bss are still zeroed, or that things from .data are still
  1185. * at their defaults. We could exec ourself from /proc/self/exe, but I
  1186. * really dislike relying on /proc for things. We could exec ourself
  1187. * from global_argv[0], but if we are in a chroot, we may not be able
  1188. * to find ourself... */
  1189. #ifdef CONFIG_FEATURE_SH_STANDALONE_SHELL
  1190. {
  1191. int argc_l;
  1192. char** argv_l=child->argv;
  1193. char *name = child->argv[0];
  1194. #ifdef CONFIG_FEATURE_SH_APPLETS_ALWAYS_WIN
  1195. /* Following discussions from November 2000 on the busybox mailing
  1196. * list, the default configuration, (without
  1197. * get_last_path_component()) lets the user force use of an
  1198. * external command by specifying the full (with slashes) filename.
  1199. * If you enable CONFIG_FEATURE_SH_APPLETS_ALWAYS_WIN then applets
  1200. * _aways_ override external commands, so if you want to run
  1201. * /bin/cat, it will use BusyBox cat even if /bin/cat exists on the
  1202. * filesystem and is _not_ busybox. Some systems may want this,
  1203. * most do not. */
  1204. name = get_last_path_component(name);
  1205. #endif
  1206. /* Count argc for use in a second... */
  1207. for(argc_l=0;*argv_l!=NULL; argv_l++, argc_l++);
  1208. optind = 1;
  1209. debug_printf("running applet %s\n", name);
  1210. run_applet_by_name(name, argc_l, child->argv);
  1211. }
  1212. #endif
  1213. debug_printf("exec of %s\n",child->argv[0]);
  1214. execvp(child->argv[0],child->argv);
  1215. perror_msg("couldn't exec: %s",child->argv[0]);
  1216. _exit(1);
  1217. } else if (child->group) {
  1218. debug_printf("runtime nesting to group\n");
  1219. interactive=0; /* crucial!!!! */
  1220. rcode = run_list_real(child->group);
  1221. /* OK to leak memory by not calling free_pipe_list,
  1222. * since this process is about to exit */
  1223. _exit(rcode);
  1224. } else {
  1225. /* Can happen. See what bash does with ">foo" by itself. */
  1226. debug_printf("trying to pseudo_exec null command\n");
  1227. _exit(EXIT_SUCCESS);
  1228. }
  1229. }
  1230. static void insert_bg_job(struct pipe *pi)
  1231. {
  1232. struct pipe *thejob;
  1233. /* Linear search for the ID of the job to use */
  1234. pi->jobid = 1;
  1235. for (thejob = job_list; thejob; thejob = thejob->next)
  1236. if (thejob->jobid >= pi->jobid)
  1237. pi->jobid = thejob->jobid + 1;
  1238. /* add thejob to the list of running jobs */
  1239. if (!job_list) {
  1240. thejob = job_list = xmalloc(sizeof(*thejob));
  1241. } else {
  1242. for (thejob = job_list; thejob->next; thejob = thejob->next) /* nothing */;
  1243. thejob->next = xmalloc(sizeof(*thejob));
  1244. thejob = thejob->next;
  1245. }
  1246. /* physically copy the struct job */
  1247. memcpy(thejob, pi, sizeof(struct pipe));
  1248. thejob->next = NULL;
  1249. thejob->running_progs = thejob->num_progs;
  1250. thejob->stopped_progs = 0;
  1251. thejob->text = xmalloc(BUFSIZ); /* cmdedit buffer size */
  1252. /*if (pi->progs[0] && pi->progs[0].argv && pi->progs[0].argv[0]) */
  1253. {
  1254. char *bar=thejob->text;
  1255. char **foo=pi->progs[0].argv;
  1256. while(foo && *foo) {
  1257. bar += sprintf(bar, "%s ", *foo++);
  1258. }
  1259. }
  1260. /* we don't wait for background thejobs to return -- append it
  1261. to the list of backgrounded thejobs and leave it alone */
  1262. printf("[%d] %d\n", thejob->jobid, thejob->progs[0].pid);
  1263. last_bg_pid = thejob->progs[0].pid;
  1264. last_jobid = thejob->jobid;
  1265. }
  1266. /* remove a backgrounded job */
  1267. static void remove_bg_job(struct pipe *pi)
  1268. {
  1269. struct pipe *prev_pipe;
  1270. if (pi == job_list) {
  1271. job_list = pi->next;
  1272. } else {
  1273. prev_pipe = job_list;
  1274. while (prev_pipe->next != pi)
  1275. prev_pipe = prev_pipe->next;
  1276. prev_pipe->next = pi->next;
  1277. }
  1278. if (job_list)
  1279. last_jobid = job_list->jobid;
  1280. else
  1281. last_jobid = 0;
  1282. pi->stopped_progs = 0;
  1283. free_pipe(pi, 0);
  1284. free(pi);
  1285. }
  1286. /* Checks to see if any processes have exited -- if they
  1287. have, figure out why and see if a job has completed */
  1288. static int checkjobs(struct pipe* fg_pipe)
  1289. {
  1290. int attributes;
  1291. int status;
  1292. int prognum = 0;
  1293. struct pipe *pi;
  1294. pid_t childpid;
  1295. attributes = WUNTRACED;
  1296. if (fg_pipe==NULL) {
  1297. attributes |= WNOHANG;
  1298. }
  1299. while ((childpid = waitpid(-1, &status, attributes)) > 0) {
  1300. if (fg_pipe) {
  1301. int i, rcode = 0;
  1302. for (i=0; i < fg_pipe->num_progs; i++) {
  1303. if (fg_pipe->progs[i].pid == childpid) {
  1304. if (i==fg_pipe->num_progs-1)
  1305. rcode=WEXITSTATUS(status);
  1306. (fg_pipe->num_progs)--;
  1307. return(rcode);
  1308. }
  1309. }
  1310. }
  1311. for (pi = job_list; pi; pi = pi->next) {
  1312. prognum = 0;
  1313. while (prognum < pi->num_progs && pi->progs[prognum].pid != childpid) {
  1314. prognum++;
  1315. }
  1316. if (prognum < pi->num_progs)
  1317. break;
  1318. }
  1319. if(pi==NULL) {
  1320. debug_printf("checkjobs: pid %d was not in our list!\n", childpid);
  1321. continue;
  1322. }
  1323. if (WIFEXITED(status) || WIFSIGNALED(status)) {
  1324. /* child exited */
  1325. pi->running_progs--;
  1326. pi->progs[prognum].pid = 0;
  1327. if (!pi->running_progs) {
  1328. printf(JOB_STATUS_FORMAT, pi->jobid, "Done", pi->text);
  1329. remove_bg_job(pi);
  1330. }
  1331. } else {
  1332. /* child stopped */
  1333. pi->stopped_progs++;
  1334. pi->progs[prognum].is_stopped = 1;
  1335. #if 0
  1336. /* Printing this stuff is a pain, since it tends to
  1337. * overwrite the prompt an inconveinient moments. So
  1338. * don't do that. */
  1339. if (pi->stopped_progs == pi->num_progs) {
  1340. printf("\n"JOB_STATUS_FORMAT, pi->jobid, "Stopped", pi->text);
  1341. }
  1342. #endif
  1343. }
  1344. }
  1345. if (childpid == -1 && errno != ECHILD)
  1346. perror_msg("waitpid");
  1347. /* move the shell to the foreground */
  1348. /*if (interactive && tcsetpgrp(shell_terminal, getpgid(0))) */
  1349. /* perror_msg("tcsetpgrp-2"); */
  1350. return -1;
  1351. }
  1352. /* Figure out our controlling tty, checking in order stderr,
  1353. * stdin, and stdout. If check_pgrp is set, also check that
  1354. * we belong to the foreground process group associated with
  1355. * that tty. The value of shell_terminal is needed in order to call
  1356. * tcsetpgrp(shell_terminal, ...); */
  1357. void controlling_tty(int check_pgrp)
  1358. {
  1359. pid_t curpgrp;
  1360. if ((curpgrp = tcgetpgrp(shell_terminal = 2)) < 0
  1361. && (curpgrp = tcgetpgrp(shell_terminal = 0)) < 0
  1362. && (curpgrp = tcgetpgrp(shell_terminal = 1)) < 0)
  1363. goto shell_terminal_error;
  1364. if (check_pgrp && curpgrp != getpgid(0))
  1365. goto shell_terminal_error;
  1366. return;
  1367. shell_terminal_error:
  1368. shell_terminal = -1;
  1369. return;
  1370. }
  1371. #endif
  1372. /* run_pipe_real() starts all the jobs, but doesn't wait for anything
  1373. * to finish. See checkjobs().
  1374. *
  1375. * return code is normally -1, when the caller has to wait for children
  1376. * to finish to determine the exit status of the pipe. If the pipe
  1377. * is a simple builtin command, however, the action is done by the
  1378. * time run_pipe_real returns, and the exit code is provided as the
  1379. * return value.
  1380. *
  1381. * The input of the pipe is always stdin, the output is always
  1382. * stdout. The outpipe[] mechanism in BusyBox-0.48 lash is bogus,
  1383. * because it tries to avoid running the command substitution in
  1384. * subshell, when that is in fact necessary. The subshell process
  1385. * now has its stdout directed to the input of the appropriate pipe,
  1386. * so this routine is noticeably simpler.
  1387. */
  1388. static int run_pipe_real(struct pipe *pi)
  1389. {
  1390. int i;
  1391. #ifndef __U_BOOT__
  1392. int nextin, nextout;
  1393. int pipefds[2]; /* pipefds[0] is for reading */
  1394. struct child_prog *child;
  1395. struct built_in_command *x;
  1396. char *p;
  1397. # if __GNUC__
  1398. /* Avoid longjmp clobbering */
  1399. (void) &i;
  1400. (void) &nextin;
  1401. (void) &nextout;
  1402. (void) &child;
  1403. # endif
  1404. #else
  1405. int nextin;
  1406. int flag = do_repeat ? CMD_FLAG_REPEAT : 0;
  1407. struct child_prog *child;
  1408. char *p;
  1409. # if __GNUC__
  1410. /* Avoid longjmp clobbering */
  1411. (void) &i;
  1412. (void) &nextin;
  1413. (void) &child;
  1414. # endif
  1415. #endif /* __U_BOOT__ */
  1416. nextin = 0;
  1417. #ifndef __U_BOOT__
  1418. pi->pgrp = -1;
  1419. #endif
  1420. /* Check if this is a simple builtin (not part of a pipe).
  1421. * Builtins within pipes have to fork anyway, and are handled in
  1422. * pseudo_exec. "echo foo | read bar" doesn't work on bash, either.
  1423. */
  1424. if (pi->num_progs == 1) child = & (pi->progs[0]);
  1425. #ifndef __U_BOOT__
  1426. if (pi->num_progs == 1 && child->group && child->subshell == 0) {
  1427. int squirrel[] = {-1, -1, -1};
  1428. int rcode;
  1429. debug_printf("non-subshell grouping\n");
  1430. setup_redirects(child, squirrel);
  1431. /* XXX could we merge code with following builtin case,
  1432. * by creating a pseudo builtin that calls run_list_real? */
  1433. rcode = run_list_real(child->group);
  1434. restore_redirects(squirrel);
  1435. #else
  1436. if (pi->num_progs == 1 && child->group) {
  1437. int rcode;
  1438. debug_printf("non-subshell grouping\n");
  1439. rcode = run_list_real(child->group);
  1440. #endif
  1441. return rcode;
  1442. } else if (pi->num_progs == 1 && pi->progs[0].argv != NULL) {
  1443. for (i=0; is_assignment(child->argv[i]); i++) { /* nothing */ }
  1444. if (i!=0 && child->argv[i]==NULL) {
  1445. /* assignments, but no command: set the local environment */
  1446. for (i=0; child->argv[i]!=NULL; i++) {
  1447. /* Ok, this case is tricky. We have to decide if this is a
  1448. * local variable, or an already exported variable. If it is
  1449. * already exported, we have to export the new value. If it is
  1450. * not exported, we need only set this as a local variable.
  1451. * This junk is all to decide whether or not to export this
  1452. * variable. */
  1453. int export_me=0;
  1454. char *name, *value;
  1455. name = xstrdup(child->argv[i]);
  1456. debug_printf("Local environment set: %s\n", name);
  1457. value = strchr(name, '=');
  1458. if (value)
  1459. *value=0;
  1460. #ifndef __U_BOOT__
  1461. if ( get_local_var(name)) {
  1462. export_me=1;
  1463. }
  1464. #endif
  1465. free(name);
  1466. p = insert_var_value(child->argv[i]);
  1467. set_local_var(p, export_me);
  1468. if (p != child->argv[i]) free(p);
  1469. }
  1470. return EXIT_SUCCESS; /* don't worry about errors in set_local_var() yet */
  1471. }
  1472. for (i = 0; is_assignment(child->argv[i]); i++) {
  1473. p = insert_var_value(child->argv[i]);
  1474. #ifndef __U_BOOT__
  1475. putenv(strdup(p));
  1476. #else
  1477. set_local_var(p, 0);
  1478. #endif
  1479. if (p != child->argv[i]) {
  1480. child->sp--;
  1481. free(p);
  1482. }
  1483. }
  1484. if (child->sp) {
  1485. char * str = NULL;
  1486. str = make_string(child->argv + i,
  1487. child->argv_nonnull + i);
  1488. parse_string_outer(str, FLAG_EXIT_FROM_LOOP | FLAG_REPARSING);
  1489. free(str);
  1490. return last_return_code;
  1491. }
  1492. #ifndef __U_BOOT__
  1493. for (x = bltins; x->cmd; x++) {
  1494. if (strcmp(child->argv[i], x->cmd) == 0 ) {
  1495. int squirrel[] = {-1, -1, -1};
  1496. int rcode;
  1497. if (x->function == builtin_exec && child->argv[i+1]==NULL) {
  1498. debug_printf("magic exec\n");
  1499. setup_redirects(child,NULL);
  1500. return EXIT_SUCCESS;
  1501. }
  1502. debug_printf("builtin inline %s\n", child->argv[0]);
  1503. /* XXX setup_redirects acts on file descriptors, not FILEs.
  1504. * This is perfect for work that comes after exec().
  1505. * Is it really safe for inline use? Experimentally,
  1506. * things seem to work with glibc. */
  1507. setup_redirects(child, squirrel);
  1508. child->argv += i; /* XXX horrible hack */
  1509. rcode = x->function(child);
  1510. /* XXX restore hack so free() can work right */
  1511. child->argv -= i;
  1512. restore_redirects(squirrel);
  1513. }
  1514. return rcode;
  1515. }
  1516. #else
  1517. /* check ";", because ,example , argv consist from
  1518. * "help;flinfo" must not execute
  1519. */
  1520. if (strchr(child->argv[i], ';')) {
  1521. printf("Unknown command '%s' - try 'help' or use "
  1522. "'run' command\n", child->argv[i]);
  1523. return -1;
  1524. }
  1525. /* Process the command */
  1526. return cmd_process(flag, child->argc, child->argv,
  1527. &flag_repeat, NULL);
  1528. #endif
  1529. }
  1530. #ifndef __U_BOOT__
  1531. for (i = 0; i < pi->num_progs; i++) {
  1532. child = & (pi->progs[i]);
  1533. /* pipes are inserted between pairs of commands */
  1534. if ((i + 1) < pi->num_progs) {
  1535. if (pipe(pipefds)<0) perror_msg_and_die("pipe");
  1536. nextout = pipefds[1];
  1537. } else {
  1538. nextout=1;
  1539. pipefds[0] = -1;
  1540. }
  1541. /* XXX test for failed fork()? */
  1542. if (!(child->pid = fork())) {
  1543. /* Set the handling for job control signals back to the default. */
  1544. signal(SIGINT, SIG_DFL);
  1545. signal(SIGQUIT, SIG_DFL);
  1546. signal(SIGTERM, SIG_DFL);
  1547. signal(SIGTSTP, SIG_DFL);
  1548. signal(SIGTTIN, SIG_DFL);
  1549. signal(SIGTTOU, SIG_DFL);
  1550. signal(SIGCHLD, SIG_DFL);
  1551. close_all();
  1552. if (nextin != 0) {
  1553. dup2(nextin, 0);
  1554. close(nextin);
  1555. }
  1556. if (nextout != 1) {
  1557. dup2(nextout, 1);
  1558. close(nextout);
  1559. }
  1560. if (pipefds[0]!=-1) {
  1561. close(pipefds[0]); /* opposite end of our output pipe */
  1562. }
  1563. /* Like bash, explicit redirects override pipes,
  1564. * and the pipe fd is available for dup'ing. */
  1565. setup_redirects(child,NULL);
  1566. if (interactive && pi->followup!=PIPE_BG) {
  1567. /* If we (the child) win the race, put ourselves in the process
  1568. * group whose leader is the first process in this pipe. */
  1569. if (pi->pgrp < 0) {
  1570. pi->pgrp = getpid();
  1571. }
  1572. if (setpgid(0, pi->pgrp) == 0) {
  1573. tcsetpgrp(2, pi->pgrp);
  1574. }
  1575. }
  1576. pseudo_exec(child);
  1577. }
  1578. /* put our child in the process group whose leader is the
  1579. first process in this pipe */
  1580. if (pi->pgrp < 0) {
  1581. pi->pgrp = child->pid;
  1582. }
  1583. /* Don't check for errors. The child may be dead already,
  1584. * in which case setpgid returns error code EACCES. */
  1585. setpgid(child->pid, pi->pgrp);
  1586. if (nextin != 0)
  1587. close(nextin);
  1588. if (nextout != 1)
  1589. close(nextout);
  1590. /* If there isn't another process, nextin is garbage
  1591. but it doesn't matter */
  1592. nextin = pipefds[0];
  1593. }
  1594. #endif
  1595. return -1;
  1596. }
  1597. static int run_list_real(struct pipe *pi)
  1598. {
  1599. char *save_name = NULL;
  1600. char **list = NULL;
  1601. char **save_list = NULL;
  1602. struct pipe *rpipe;
  1603. int flag_rep = 0;
  1604. #ifndef __U_BOOT__
  1605. int save_num_progs;
  1606. #endif
  1607. int rcode=0, flag_skip=1;
  1608. int flag_restore = 0;
  1609. int if_code=0, next_if_code=0; /* need double-buffer to handle elif */
  1610. reserved_style rmode, skip_more_in_this_rmode=RES_XXXX;
  1611. /* check syntax for "for" */
  1612. for (rpipe = pi; rpipe; rpipe = rpipe->next) {
  1613. if ((rpipe->r_mode == RES_IN ||
  1614. rpipe->r_mode == RES_FOR) &&
  1615. (rpipe->next == NULL)) {
  1616. syntax();
  1617. #ifdef __U_BOOT__
  1618. flag_repeat = 0;
  1619. #endif
  1620. return 1;
  1621. }
  1622. if ((rpipe->r_mode == RES_IN &&
  1623. (rpipe->next->r_mode == RES_IN &&
  1624. rpipe->next->progs->argv != NULL))||
  1625. (rpipe->r_mode == RES_FOR &&
  1626. rpipe->next->r_mode != RES_IN)) {
  1627. syntax();
  1628. #ifdef __U_BOOT__
  1629. flag_repeat = 0;
  1630. #endif
  1631. return 1;
  1632. }
  1633. }
  1634. for (; pi; pi = (flag_restore != 0) ? rpipe : pi->next) {
  1635. if (pi->r_mode == RES_WHILE || pi->r_mode == RES_UNTIL ||
  1636. pi->r_mode == RES_FOR) {
  1637. #ifdef __U_BOOT__
  1638. /* check Ctrl-C */
  1639. ctrlc();
  1640. if ((had_ctrlc())) {
  1641. return 1;
  1642. }
  1643. #endif
  1644. flag_restore = 0;
  1645. if (!rpipe) {
  1646. flag_rep = 0;
  1647. rpipe = pi;
  1648. }
  1649. }
  1650. rmode = pi->r_mode;
  1651. debug_printf("rmode=%d if_code=%d next_if_code=%d skip_more=%d\n", rmode, if_code, next_if_code, skip_more_in_this_rmode);
  1652. if (rmode == skip_more_in_this_rmode && flag_skip) {
  1653. if (pi->followup == PIPE_SEQ) flag_skip=0;
  1654. continue;
  1655. }
  1656. flag_skip = 1;
  1657. skip_more_in_this_rmode = RES_XXXX;
  1658. if (rmode == RES_THEN || rmode == RES_ELSE) if_code = next_if_code;
  1659. if (rmode == RES_THEN && if_code) continue;
  1660. if (rmode == RES_ELSE && !if_code) continue;
  1661. if (rmode == RES_ELIF && !if_code) break;
  1662. if (rmode == RES_FOR && pi->num_progs) {
  1663. if (!list) {
  1664. /* if no variable values after "in" we skip "for" */
  1665. if (!pi->next->progs->argv) continue;
  1666. /* create list of variable values */
  1667. list = make_list_in(pi->next->progs->argv,
  1668. pi->progs->argv[0]);
  1669. save_list = list;
  1670. save_name = pi->progs->argv[0];
  1671. pi->progs->argv[0] = NULL;
  1672. flag_rep = 1;
  1673. }
  1674. if (!(*list)) {
  1675. free(pi->progs->argv[0]);
  1676. free(save_list);
  1677. list = NULL;
  1678. flag_rep = 0;
  1679. pi->progs->argv[0] = save_name;
  1680. #ifndef __U_BOOT__
  1681. pi->progs->glob_result.gl_pathv[0] =
  1682. pi->progs->argv[0];
  1683. #endif
  1684. continue;
  1685. } else {
  1686. /* insert new value from list for variable */
  1687. if (pi->progs->argv[0])
  1688. free(pi->progs->argv[0]);
  1689. pi->progs->argv[0] = *list++;
  1690. #ifndef __U_BOOT__
  1691. pi->progs->glob_result.gl_pathv[0] =
  1692. pi->progs->argv[0];
  1693. #endif
  1694. }
  1695. }
  1696. if (rmode == RES_IN) continue;
  1697. if (rmode == RES_DO) {
  1698. if (!flag_rep) continue;
  1699. }
  1700. if (rmode == RES_DONE) {
  1701. if (flag_rep) {
  1702. flag_restore = 1;
  1703. } else {
  1704. rpipe = NULL;
  1705. }
  1706. }
  1707. if (pi->num_progs == 0) continue;
  1708. #ifndef __U_BOOT__
  1709. save_num_progs = pi->num_progs; /* save number of programs */
  1710. #endif
  1711. rcode = run_pipe_real(pi);
  1712. debug_printf("run_pipe_real returned %d\n",rcode);
  1713. #ifndef __U_BOOT__
  1714. if (rcode!=-1) {
  1715. /* We only ran a builtin: rcode was set by the return value
  1716. * of run_pipe_real(), and we don't need to wait for anything. */
  1717. } else if (pi->followup==PIPE_BG) {
  1718. /* XXX check bash's behavior with nontrivial pipes */
  1719. /* XXX compute jobid */
  1720. /* XXX what does bash do with attempts to background builtins? */
  1721. insert_bg_job(pi);
  1722. rcode = EXIT_SUCCESS;
  1723. } else {
  1724. if (interactive) {
  1725. /* move the new process group into the foreground */
  1726. if (tcsetpgrp(shell_terminal, pi->pgrp) && errno != ENOTTY)
  1727. perror_msg("tcsetpgrp-3");
  1728. rcode = checkjobs(pi);
  1729. /* move the shell to the foreground */
  1730. if (tcsetpgrp(shell_terminal, getpgid(0)) && errno != ENOTTY)
  1731. perror_msg("tcsetpgrp-4");
  1732. } else {
  1733. rcode = checkjobs(pi);
  1734. }
  1735. debug_printf("checkjobs returned %d\n",rcode);
  1736. }
  1737. last_return_code=rcode;
  1738. #else
  1739. if (rcode < -1) {
  1740. last_return_code = -rcode - 2;
  1741. return -2; /* exit */
  1742. }
  1743. last_return_code=(rcode == 0) ? 0 : 1;
  1744. #endif
  1745. #ifndef __U_BOOT__
  1746. pi->num_progs = save_num_progs; /* restore number of programs */
  1747. #endif
  1748. if ( rmode == RES_IF || rmode == RES_ELIF )
  1749. next_if_code=rcode; /* can be overwritten a number of times */
  1750. if (rmode == RES_WHILE)
  1751. flag_rep = !last_return_code;
  1752. if (rmode == RES_UNTIL)
  1753. flag_rep = last_return_code;
  1754. if ( (rcode==EXIT_SUCCESS && pi->followup==PIPE_OR) ||
  1755. (rcode!=EXIT_SUCCESS && pi->followup==PIPE_AND) )
  1756. skip_more_in_this_rmode=rmode;
  1757. #ifndef __U_BOOT__
  1758. checkjobs(NULL);
  1759. #endif
  1760. }
  1761. return rcode;
  1762. }
  1763. /* broken, of course, but OK for testing */
  1764. static char *indenter(int i)
  1765. {
  1766. static char blanks[]=" ";
  1767. return &blanks[sizeof(blanks)-i-1];
  1768. }
  1769. /* return code is the exit status of the pipe */
  1770. static int free_pipe(struct pipe *pi, int indent)
  1771. {
  1772. char **p;
  1773. struct child_prog *child;
  1774. #ifndef __U_BOOT__
  1775. struct redir_struct *r, *rnext;
  1776. #endif
  1777. int a, i, ret_code=0;
  1778. char *ind = indenter(indent);
  1779. #ifndef __U_BOOT__
  1780. if (pi->stopped_progs > 0)
  1781. return ret_code;
  1782. final_printf("%s run pipe: (pid %d)\n",ind,getpid());
  1783. #endif
  1784. for (i=0; i<pi->num_progs; i++) {
  1785. child = &pi->progs[i];
  1786. final_printf("%s command %d:\n",ind,i);
  1787. if (child->argv) {
  1788. for (a=0,p=child->argv; *p; a++,p++) {
  1789. final_printf("%s argv[%d] = %s\n",ind,a,*p);
  1790. }
  1791. #ifndef __U_BOOT__
  1792. globfree(&child->glob_result);
  1793. #else
  1794. for (a = 0; a < child->argc; a++) {
  1795. free(child->argv[a]);
  1796. }
  1797. free(child->argv);
  1798. free(child->argv_nonnull);
  1799. child->argc = 0;
  1800. #endif
  1801. child->argv=NULL;
  1802. } else if (child->group) {
  1803. #ifndef __U_BOOT__
  1804. final_printf("%s begin group (subshell:%d)\n",ind, child->subshell);
  1805. #endif
  1806. ret_code = free_pipe_list(child->group,indent+3);
  1807. final_printf("%s end group\n",ind);
  1808. } else {
  1809. final_printf("%s (nil)\n",ind);
  1810. }
  1811. #ifndef __U_BOOT__
  1812. for (r=child->redirects; r; r=rnext) {
  1813. final_printf("%s redirect %d%s", ind, r->fd, redir_table[r->type].descrip);
  1814. if (r->dup == -1) {
  1815. /* guard against the case >$FOO, where foo is unset or blank */
  1816. if (r->word.gl_pathv) {
  1817. final_printf(" %s\n", *r->word.gl_pathv);
  1818. globfree(&r->word);
  1819. }
  1820. } else {
  1821. final_printf("&%d\n", r->dup);
  1822. }
  1823. rnext=r->next;
  1824. free(r);
  1825. }
  1826. child->redirects=NULL;
  1827. #endif
  1828. }
  1829. free(pi->progs); /* children are an array, they get freed all at once */
  1830. pi->progs=NULL;
  1831. return ret_code;
  1832. }
  1833. static int free_pipe_list(struct pipe *head, int indent)
  1834. {
  1835. int rcode=0; /* if list has no members */
  1836. struct pipe *pi, *next;
  1837. char *ind = indenter(indent);
  1838. for (pi=head; pi; pi=next) {
  1839. final_printf("%s pipe reserved mode %d\n", ind, pi->r_mode);
  1840. rcode = free_pipe(pi, indent);
  1841. final_printf("%s pipe followup code %d\n", ind, pi->followup);
  1842. next=pi->next;
  1843. pi->next=NULL;
  1844. free(pi);
  1845. }
  1846. return rcode;
  1847. }
  1848. /* Select which version we will use */
  1849. static int run_list(struct pipe *pi)
  1850. {
  1851. int rcode=0;
  1852. #ifndef __U_BOOT__
  1853. if (fake_mode==0) {
  1854. #endif
  1855. rcode = run_list_real(pi);
  1856. #ifndef __U_BOOT__
  1857. }
  1858. #endif
  1859. /* free_pipe_list has the side effect of clearing memory
  1860. * In the long run that function can be merged with run_list_real,
  1861. * but doing that now would hobble the debugging effort. */
  1862. free_pipe_list(pi,0);
  1863. return rcode;
  1864. }
  1865. /* The API for glob is arguably broken. This routine pushes a non-matching
  1866. * string into the output structure, removing non-backslashed backslashes.
  1867. * If someone can prove me wrong, by performing this function within the
  1868. * original glob(3) api, feel free to rewrite this routine into oblivion.
  1869. * Return code (0 vs. GLOB_NOSPACE) matches glob(3).
  1870. * XXX broken if the last character is '\\', check that before calling.
  1871. */
  1872. #ifndef __U_BOOT__
  1873. static int globhack(const char *src, int flags, glob_t *pglob)
  1874. {
  1875. int cnt=0, pathc;
  1876. const char *s;
  1877. char *dest;
  1878. for (cnt=1, s=src; s && *s; s++) {
  1879. if (*s == '\\') s++;
  1880. cnt++;
  1881. }
  1882. dest = malloc(cnt);
  1883. if (!dest) return GLOB_NOSPACE;
  1884. if (!(flags & GLOB_APPEND)) {
  1885. pglob->gl_pathv=NULL;
  1886. pglob->gl_pathc=0;
  1887. pglob->gl_offs=0;
  1888. pglob->gl_offs=0;
  1889. }
  1890. pathc = ++pglob->gl_pathc;
  1891. pglob->gl_pathv = realloc(pglob->gl_pathv, (pathc+1)*sizeof(*pglob->gl_pathv));
  1892. if (pglob->gl_pathv == NULL) return GLOB_NOSPACE;
  1893. pglob->gl_pathv[pathc-1]=dest;
  1894. pglob->gl_pathv[pathc]=NULL;
  1895. for (s=src; s && *s; s++, dest++) {
  1896. if (*s == '\\') s++;
  1897. *dest = *s;
  1898. }
  1899. *dest='\0';
  1900. return 0;
  1901. }
  1902. /* XXX broken if the last character is '\\', check that before calling */
  1903. static int glob_needed(const char *s)
  1904. {
  1905. for (; *s; s++) {
  1906. if (*s == '\\') s++;
  1907. if (strchr("*[?",*s)) return 1;
  1908. }
  1909. return 0;
  1910. }
  1911. #if 0
  1912. static void globprint(glob_t *pglob)
  1913. {
  1914. int i;
  1915. debug_printf("glob_t at %p:\n", pglob);
  1916. debug_printf(" gl_pathc=%d gl_pathv=%p gl_offs=%d gl_flags=%d\n",
  1917. pglob->gl_pathc, pglob->gl_pathv, pglob->gl_offs, pglob->gl_flags);
  1918. for (i=0; i<pglob->gl_pathc; i++)
  1919. debug_printf("pglob->gl_pathv[%d] = %p = %s\n", i,
  1920. pglob->gl_pathv[i], pglob->gl_pathv[i]);
  1921. }
  1922. #endif
  1923. static int xglob(o_string *dest, int flags, glob_t *pglob)
  1924. {
  1925. int gr;
  1926. /* short-circuit for null word */
  1927. /* we can code this better when the debug_printf's are gone */
  1928. if (dest->length == 0) {
  1929. if (dest->nonnull) {
  1930. /* bash man page calls this an "explicit" null */
  1931. gr = globhack(dest->data, flags, pglob);
  1932. debug_printf("globhack returned %d\n",gr);
  1933. } else {
  1934. return 0;
  1935. }
  1936. } else if (glob_needed(dest->data)) {
  1937. gr = glob(dest->data, flags, NULL, pglob);
  1938. debug_printf("glob returned %d\n",gr);
  1939. if (gr == GLOB_NOMATCH) {
  1940. /* quote removal, or more accurately, backslash removal */
  1941. gr = globhack(dest->data, flags, pglob);
  1942. debug_printf("globhack returned %d\n",gr);
  1943. }
  1944. } else {
  1945. gr = globhack(dest->data, flags, pglob);
  1946. debug_printf("globhack returned %d\n",gr);
  1947. }
  1948. if (gr == GLOB_NOSPACE)
  1949. error_msg_and_die("out of memory during glob");
  1950. if (gr != 0) { /* GLOB_ABORTED ? */
  1951. error_msg("glob(3) error %d",gr);
  1952. }
  1953. /* globprint(glob_target); */
  1954. return gr;
  1955. }
  1956. #endif
  1957. #ifdef __U_BOOT__
  1958. static char *get_dollar_var(char ch);
  1959. #endif
  1960. /* This is used to get/check local shell variables */
  1961. char *get_local_var(const char *s)
  1962. {
  1963. struct variables *cur;
  1964. if (!s)
  1965. return NULL;
  1966. #ifdef __U_BOOT__
  1967. if (*s == '$')
  1968. return get_dollar_var(s[1]);
  1969. #endif
  1970. for (cur = top_vars; cur; cur=cur->next)
  1971. if(strcmp(cur->name, s)==0)
  1972. return cur->value;
  1973. return NULL;
  1974. }
  1975. /* This is used to set local shell variables
  1976. flg_export==0 if only local (not exporting) variable
  1977. flg_export==1 if "new" exporting environ
  1978. flg_export>1 if current startup environ (not call putenv()) */
  1979. int set_local_var(const char *s, int flg_export)
  1980. {
  1981. char *name, *value;
  1982. int result=0;
  1983. struct variables *cur;
  1984. #ifdef __U_BOOT__
  1985. /* might be possible! */
  1986. if (!isalpha(*s))
  1987. return -1;
  1988. #endif
  1989. name=strdup(s);
  1990. #ifdef __U_BOOT__
  1991. if (getenv(name) != NULL) {
  1992. printf ("ERROR: "
  1993. "There is a global environment variable with the same name.\n");
  1994. free(name);
  1995. return -1;
  1996. }
  1997. #endif
  1998. /* Assume when we enter this function that we are already in
  1999. * NAME=VALUE format. So the first order of business is to
  2000. * split 's' on the '=' into 'name' and 'value' */
  2001. value = strchr(name, '=');
  2002. if (value == NULL && ++value == NULL) {
  2003. free(name);
  2004. return -1;
  2005. }
  2006. *value++ = 0;
  2007. for(cur = top_vars; cur; cur = cur->next) {
  2008. if(strcmp(cur->name, name)==0)
  2009. break;
  2010. }
  2011. if(cur) {
  2012. if(strcmp(cur->value, value)==0) {
  2013. if(flg_export>0 && cur->flg_export==0)
  2014. cur->flg_export=flg_export;
  2015. else
  2016. result++;
  2017. } else {
  2018. if(cur->flg_read_only) {
  2019. error_msg("%s: readonly variable", name);
  2020. result = -1;
  2021. } else {
  2022. if(flg_export>0 || cur->flg_export>1)
  2023. cur->flg_export=1;
  2024. free(cur->value);
  2025. cur->value = strdup(value);
  2026. }
  2027. }
  2028. } else {
  2029. cur = malloc(sizeof(struct variables));
  2030. if(!cur) {
  2031. result = -1;
  2032. } else {
  2033. cur->name = strdup(name);
  2034. if (cur->name == NULL) {
  2035. free(cur);
  2036. result = -1;
  2037. } else {
  2038. struct variables *bottom = top_vars;
  2039. cur->value = strdup(value);
  2040. cur->next = NULL;
  2041. cur->flg_export = flg_export;
  2042. cur->flg_read_only = 0;
  2043. while(bottom->next) bottom=bottom->next;
  2044. bottom->next = cur;
  2045. }
  2046. }
  2047. }
  2048. #ifndef __U_BOOT__
  2049. if(result==0 && cur->flg_export==1) {
  2050. *(value-1) = '=';
  2051. result = putenv(name);
  2052. } else {
  2053. #endif
  2054. free(name);
  2055. #ifndef __U_BOOT__
  2056. if(result>0) /* equivalent to previous set */
  2057. result = 0;
  2058. }
  2059. #endif
  2060. return result;
  2061. }
  2062. void unset_local_var(const char *name)
  2063. {
  2064. struct variables *cur;
  2065. if (name) {
  2066. for (cur = top_vars; cur; cur=cur->next) {
  2067. if(strcmp(cur->name, name)==0)
  2068. break;
  2069. }
  2070. if (cur != NULL) {
  2071. struct variables *next = top_vars;
  2072. if(cur->flg_read_only) {
  2073. error_msg("%s: readonly variable", name);
  2074. return;
  2075. } else {
  2076. #ifndef __U_BOOT__
  2077. if(cur->flg_export)
  2078. unsetenv(cur->name);
  2079. #endif
  2080. free(cur->name);
  2081. free(cur->value);
  2082. while (next->next != cur)
  2083. next = next->next;
  2084. next->next = cur->next;
  2085. }
  2086. free(cur);
  2087. }
  2088. }
  2089. }
  2090. static int is_assignment(const char *s)
  2091. {
  2092. if (s == NULL)
  2093. return 0;
  2094. if (!isalpha(*s)) return 0;
  2095. ++s;
  2096. while(isalnum(*s) || *s=='_') ++s;
  2097. return *s=='=';
  2098. }
  2099. #ifndef __U_BOOT__
  2100. /* the src parameter allows us to peek forward to a possible &n syntax
  2101. * for file descriptor duplication, e.g., "2>&1".
  2102. * Return code is 0 normally, 1 if a syntax error is detected in src.
  2103. * Resource errors (in xmalloc) cause the process to exit */
  2104. static int setup_redirect(struct p_context *ctx, int fd, redir_type style,
  2105. struct in_str *input)
  2106. {
  2107. struct child_prog *child=ctx->child;
  2108. struct redir_struct *redir = child->redirects;
  2109. struct redir_struct *last_redir=NULL;
  2110. /* Create a new redir_struct and drop it onto the end of the linked list */
  2111. while(redir) {
  2112. last_redir=redir;
  2113. redir=redir->next;
  2114. }
  2115. redir = xmalloc(sizeof(struct redir_struct));
  2116. redir->next=NULL;
  2117. redir->word.gl_pathv=NULL;
  2118. if (last_redir) {
  2119. last_redir->next=redir;
  2120. } else {
  2121. child->redirects=redir;
  2122. }
  2123. redir->type=style;
  2124. redir->fd= (fd==-1) ? redir_table[style].default_fd : fd ;
  2125. debug_printf("Redirect type %d%s\n", redir->fd, redir_table[style].descrip);
  2126. /* Check for a '2>&1' type redirect */
  2127. redir->dup = redirect_dup_num(input);
  2128. if (redir->dup == -2) return 1; /* syntax error */
  2129. if (redir->dup != -1) {
  2130. /* Erik had a check here that the file descriptor in question
  2131. * is legit; I postpone that to "run time"
  2132. * A "-" representation of "close me" shows up as a -3 here */
  2133. debug_printf("Duplicating redirect '%d>&%d'\n", redir->fd, redir->dup);
  2134. } else {
  2135. /* We do _not_ try to open the file that src points to,
  2136. * since we need to return and let src be expanded first.
  2137. * Set ctx->pending_redirect, so we know what to do at the
  2138. * end of the next parsed word.
  2139. */
  2140. ctx->pending_redirect = redir;
  2141. }
  2142. return 0;
  2143. }
  2144. #endif
  2145. static struct pipe *new_pipe(void)
  2146. {
  2147. struct pipe *pi;
  2148. pi = xmalloc(sizeof(struct pipe));
  2149. pi->num_progs = 0;
  2150. pi->progs = NULL;
  2151. pi->next = NULL;
  2152. pi->followup = 0; /* invalid */
  2153. pi->r_mode = RES_NONE;
  2154. return pi;
  2155. }
  2156. static void initialize_context(struct p_context *ctx)
  2157. {
  2158. ctx->pipe=NULL;
  2159. #ifndef __U_BOOT__
  2160. ctx->pending_redirect=NULL;
  2161. #endif
  2162. ctx->child=NULL;
  2163. ctx->list_head=new_pipe();
  2164. ctx->pipe=ctx->list_head;
  2165. ctx->w=RES_NONE;
  2166. ctx->stack=NULL;
  2167. #ifdef __U_BOOT__
  2168. ctx->old_flag=0;
  2169. #endif
  2170. done_command(ctx); /* creates the memory for working child */
  2171. }
  2172. /* normal return is 0
  2173. * if a reserved word is found, and processed, return 1
  2174. * should handle if, then, elif, else, fi, for, while, until, do, done.
  2175. * case, function, and select are obnoxious, save those for later.
  2176. */
  2177. struct reserved_combo {
  2178. char *literal;
  2179. int code;
  2180. long flag;
  2181. };
  2182. /* Mostly a list of accepted follow-up reserved words.
  2183. * FLAG_END means we are done with the sequence, and are ready
  2184. * to turn the compound list into a command.
  2185. * FLAG_START means the word must start a new compound list.
  2186. */
  2187. static struct reserved_combo reserved_list[] = {
  2188. { "if", RES_IF, FLAG_THEN | FLAG_START },
  2189. { "then", RES_THEN, FLAG_ELIF | FLAG_ELSE | FLAG_FI },
  2190. { "elif", RES_ELIF, FLAG_THEN },
  2191. { "else", RES_ELSE, FLAG_FI },
  2192. { "fi", RES_FI, FLAG_END },
  2193. { "for", RES_FOR, FLAG_IN | FLAG_START },
  2194. { "while", RES_WHILE, FLAG_DO | FLAG_START },
  2195. { "until", RES_UNTIL, FLAG_DO | FLAG_START },
  2196. { "in", RES_IN, FLAG_DO },
  2197. { "do", RES_DO, FLAG_DONE },
  2198. { "done", RES_DONE, FLAG_END }
  2199. };
  2200. #define NRES (sizeof(reserved_list)/sizeof(struct reserved_combo))
  2201. static int reserved_word(o_string *dest, struct p_context *ctx)
  2202. {
  2203. struct reserved_combo *r;
  2204. for (r=reserved_list;
  2205. r<reserved_list+NRES; r++) {
  2206. if (strcmp(dest->data, r->literal) == 0) {
  2207. debug_printf("found reserved word %s, code %d\n",r->literal,r->code);
  2208. if (r->flag & FLAG_START) {
  2209. struct p_context *new = xmalloc(sizeof(struct p_context));
  2210. debug_printf("push stack\n");
  2211. if (ctx->w == RES_IN || ctx->w == RES_FOR) {
  2212. syntax();
  2213. free(new);
  2214. ctx->w = RES_SNTX;
  2215. b_reset(dest);
  2216. return 1;
  2217. }
  2218. *new = *ctx; /* physical copy */
  2219. initialize_context(ctx);
  2220. ctx->stack=new;
  2221. } else if ( ctx->w == RES_NONE || ! (ctx->old_flag & (1<<r->code))) {
  2222. syntax();
  2223. ctx->w = RES_SNTX;
  2224. b_reset(dest);
  2225. return 1;
  2226. }
  2227. ctx->w=r->code;
  2228. ctx->old_flag = r->flag;
  2229. if (ctx->old_flag & FLAG_END) {
  2230. struct p_context *old;
  2231. debug_printf("pop stack\n");
  2232. done_pipe(ctx,PIPE_SEQ);
  2233. old = ctx->stack;
  2234. old->child->group = ctx->list_head;
  2235. #ifndef __U_BOOT__
  2236. old->child->subshell = 0;
  2237. #endif
  2238. *ctx = *old; /* physical copy */
  2239. free(old);
  2240. }
  2241. b_reset (dest);
  2242. return 1;
  2243. }
  2244. }
  2245. return 0;
  2246. }
  2247. /* normal return is 0.
  2248. * Syntax or xglob errors return 1. */
  2249. static int done_word(o_string *dest, struct p_context *ctx)
  2250. {
  2251. struct child_prog *child=ctx->child;
  2252. #ifndef __U_BOOT__
  2253. glob_t *glob_target;
  2254. int gr, flags = 0;
  2255. #else
  2256. char *str, *s;
  2257. int argc, cnt;
  2258. #endif
  2259. debug_printf("done_word: %s %p\n", dest->data, child);
  2260. if (dest->length == 0 && !dest->nonnull) {
  2261. debug_printf(" true null, ignored\n");
  2262. return 0;
  2263. }
  2264. #ifndef __U_BOOT__
  2265. if (ctx->pending_redirect) {
  2266. glob_target = &ctx->pending_redirect->word;
  2267. } else {
  2268. #endif
  2269. if (child->group) {
  2270. syntax();
  2271. return 1; /* syntax error, groups and arglists don't mix */
  2272. }
  2273. if (!child->argv && (ctx->type & FLAG_PARSE_SEMICOLON)) {
  2274. debug_printf("checking %s for reserved-ness\n",dest->data);
  2275. if (reserved_word(dest,ctx)) return ctx->w==RES_SNTX;
  2276. }
  2277. #ifndef __U_BOOT__
  2278. glob_target = &child->glob_result;
  2279. if (child->argv) flags |= GLOB_APPEND;
  2280. #else
  2281. for (cnt = 1, s = dest->data; s && *s; s++) {
  2282. if (*s == '\\') s++;
  2283. cnt++;
  2284. }
  2285. str = malloc(cnt);
  2286. if (!str) return 1;
  2287. if ( child->argv == NULL) {
  2288. child->argc=0;
  2289. }
  2290. argc = ++child->argc;
  2291. child->argv = realloc(child->argv, (argc+1)*sizeof(*child->argv));
  2292. if (child->argv == NULL) return 1;
  2293. child->argv_nonnull = realloc(child->argv_nonnull,
  2294. (argc+1)*sizeof(*child->argv_nonnull));
  2295. if (child->argv_nonnull == NULL)
  2296. return 1;
  2297. child->argv[argc-1]=str;
  2298. child->argv_nonnull[argc-1] = dest->nonnull;
  2299. child->argv[argc]=NULL;
  2300. child->argv_nonnull[argc] = 0;
  2301. for (s = dest->data; s && *s; s++,str++) {
  2302. if (*s == '\\') s++;
  2303. *str = *s;
  2304. }
  2305. *str = '\0';
  2306. #endif
  2307. #ifndef __U_BOOT__
  2308. }
  2309. gr = xglob(dest, flags, glob_target);
  2310. if (gr != 0) return 1;
  2311. #endif
  2312. b_reset(dest);
  2313. #ifndef __U_BOOT__
  2314. if (ctx->pending_redirect) {
  2315. ctx->pending_redirect=NULL;
  2316. if (glob_target->gl_pathc != 1) {
  2317. error_msg("ambiguous redirect");
  2318. return 1;
  2319. }
  2320. } else {
  2321. child->argv = glob_target->gl_pathv;
  2322. }
  2323. #endif
  2324. if (ctx->w == RES_FOR) {
  2325. done_word(dest,ctx);
  2326. done_pipe(ctx,PIPE_SEQ);
  2327. }
  2328. return 0;
  2329. }
  2330. /* The only possible error here is out of memory, in which case
  2331. * xmalloc exits. */
  2332. static int done_command(struct p_context *ctx)
  2333. {
  2334. /* The child is really already in the pipe structure, so
  2335. * advance the pipe counter and make a new, null child.
  2336. * Only real trickiness here is that the uncommitted
  2337. * child structure, to which ctx->child points, is not
  2338. * counted in pi->num_progs. */
  2339. struct pipe *pi=ctx->pipe;
  2340. struct child_prog *prog=ctx->child;
  2341. if (prog && prog->group == NULL
  2342. && prog->argv == NULL
  2343. #ifndef __U_BOOT__
  2344. && prog->redirects == NULL) {
  2345. #else
  2346. ) {
  2347. #endif
  2348. debug_printf("done_command: skipping null command\n");
  2349. return 0;
  2350. } else if (prog) {
  2351. pi->num_progs++;
  2352. debug_printf("done_command: num_progs incremented to %d\n",pi->num_progs);
  2353. } else {
  2354. debug_printf("done_command: initializing\n");
  2355. }
  2356. pi->progs = xrealloc(pi->progs, sizeof(*pi->progs) * (pi->num_progs+1));
  2357. prog = pi->progs + pi->num_progs;
  2358. #ifndef __U_BOOT__
  2359. prog->redirects = NULL;
  2360. #endif
  2361. prog->argv = NULL;
  2362. prog->argv_nonnull = NULL;
  2363. #ifndef __U_BOOT__
  2364. prog->is_stopped = 0;
  2365. #endif
  2366. prog->group = NULL;
  2367. #ifndef __U_BOOT__
  2368. prog->glob_result.gl_pathv = NULL;
  2369. prog->family = pi;
  2370. #endif
  2371. prog->sp = 0;
  2372. ctx->child = prog;
  2373. prog->type = ctx->type;
  2374. /* but ctx->pipe and ctx->list_head remain unchanged */
  2375. return 0;
  2376. }
  2377. static int done_pipe(struct p_context *ctx, pipe_style type)
  2378. {
  2379. struct pipe *new_p;
  2380. done_command(ctx); /* implicit closure of previous command */
  2381. debug_printf("done_pipe, type %d\n", type);
  2382. ctx->pipe->followup = type;
  2383. ctx->pipe->r_mode = ctx->w;
  2384. new_p=new_pipe();
  2385. ctx->pipe->next = new_p;
  2386. ctx->pipe = new_p;
  2387. ctx->child = NULL;
  2388. done_command(ctx); /* set up new pipe to accept commands */
  2389. return 0;
  2390. }
  2391. #ifndef __U_BOOT__
  2392. /* peek ahead in the in_str to find out if we have a "&n" construct,
  2393. * as in "2>&1", that represents duplicating a file descriptor.
  2394. * returns either -2 (syntax error), -1 (no &), or the number found.
  2395. */
  2396. static int redirect_dup_num(struct in_str *input)
  2397. {
  2398. int ch, d=0, ok=0;
  2399. ch = b_peek(input);
  2400. if (ch != '&') return -1;
  2401. b_getch(input); /* get the & */
  2402. ch=b_peek(input);
  2403. if (ch == '-') {
  2404. b_getch(input);
  2405. return -3; /* "-" represents "close me" */
  2406. }
  2407. while (isdigit(ch)) {
  2408. d = d*10+(ch-'0');
  2409. ok=1;
  2410. b_getch(input);
  2411. ch = b_peek(input);
  2412. }
  2413. if (ok) return d;
  2414. error_msg("ambiguous redirect");
  2415. return -2;
  2416. }
  2417. /* If a redirect is immediately preceded by a number, that number is
  2418. * supposed to tell which file descriptor to redirect. This routine
  2419. * looks for such preceding numbers. In an ideal world this routine
  2420. * needs to handle all the following classes of redirects...
  2421. * echo 2>foo # redirects fd 2 to file "foo", nothing passed to echo
  2422. * echo 49>foo # redirects fd 49 to file "foo", nothing passed to echo
  2423. * echo -2>foo # redirects fd 1 to file "foo", "-2" passed to echo
  2424. * echo 49x>foo # redirects fd 1 to file "foo", "49x" passed to echo
  2425. * A -1 output from this program means no valid number was found, so the
  2426. * caller should use the appropriate default for this redirection.
  2427. */
  2428. static int redirect_opt_num(o_string *o)
  2429. {
  2430. int num;
  2431. if (o->length==0) return -1;
  2432. for(num=0; num<o->length; num++) {
  2433. if (!isdigit(*(o->data+num))) {
  2434. return -1;
  2435. }
  2436. }
  2437. /* reuse num (and save an int) */
  2438. num=atoi(o->data);
  2439. b_reset(o);
  2440. return num;
  2441. }
  2442. FILE *generate_stream_from_list(struct pipe *head)
  2443. {
  2444. FILE *pf;
  2445. #if 1
  2446. int pid, channel[2];
  2447. if (pipe(channel)<0) perror_msg_and_die("pipe");
  2448. pid=fork();
  2449. if (pid<0) {
  2450. perror_msg_and_die("fork");
  2451. } else if (pid==0) {
  2452. close(channel[0]);
  2453. if (channel[1] != 1) {
  2454. dup2(channel[1],1);
  2455. close(channel[1]);
  2456. }
  2457. #if 0
  2458. #define SURROGATE "surrogate response"
  2459. write(1,SURROGATE,sizeof(SURROGATE));
  2460. _exit(run_list(head));
  2461. #else
  2462. _exit(run_list_real(head)); /* leaks memory */
  2463. #endif
  2464. }
  2465. debug_printf("forked child %d\n",pid);
  2466. close(channel[1]);
  2467. pf = fdopen(channel[0],"r");
  2468. debug_printf("pipe on FILE *%p\n",pf);
  2469. #else
  2470. free_pipe_list(head,0);
  2471. pf=popen("echo surrogate response","r");
  2472. debug_printf("started fake pipe on FILE *%p\n",pf);
  2473. #endif
  2474. return pf;
  2475. }
  2476. /* this version hacked for testing purposes */
  2477. /* return code is exit status of the process that is run. */
  2478. static int process_command_subs(o_string *dest, struct p_context *ctx, struct in_str *input, int subst_end)
  2479. {
  2480. int retcode;
  2481. o_string result=NULL_O_STRING;
  2482. struct p_context inner;
  2483. FILE *p;
  2484. struct in_str pipe_str;
  2485. initialize_context(&inner);
  2486. /* recursion to generate command */
  2487. retcode = parse_stream(&result, &inner, input, subst_end);
  2488. if (retcode != 0) return retcode; /* syntax error or EOF */
  2489. done_word(&result, &inner);
  2490. done_pipe(&inner, PIPE_SEQ);
  2491. b_free(&result);
  2492. p=generate_stream_from_list(inner.list_head);
  2493. if (p==NULL) return 1;
  2494. mark_open(fileno(p));
  2495. setup_file_in_str(&pipe_str, p);
  2496. /* now send results of command back into original context */
  2497. retcode = parse_stream(dest, ctx, &pipe_str, '\0');
  2498. /* XXX In case of a syntax error, should we try to kill the child?
  2499. * That would be tough to do right, so just read until EOF. */
  2500. if (retcode == 1) {
  2501. while (b_getch(&pipe_str)!=EOF) { /* discard */ };
  2502. }
  2503. debug_printf("done reading from pipe, pclose()ing\n");
  2504. /* This is the step that wait()s for the child. Should be pretty
  2505. * safe, since we just read an EOF from its stdout. We could try
  2506. * to better, by using wait(), and keeping track of background jobs
  2507. * at the same time. That would be a lot of work, and contrary
  2508. * to the KISS philosophy of this program. */
  2509. mark_closed(fileno(p));
  2510. retcode=pclose(p);
  2511. free_pipe_list(inner.list_head,0);
  2512. debug_printf("pclosed, retcode=%d\n",retcode);
  2513. /* XXX this process fails to trim a single trailing newline */
  2514. return retcode;
  2515. }
  2516. static int parse_group(o_string *dest, struct p_context *ctx,
  2517. struct in_str *input, int ch)
  2518. {
  2519. int rcode, endch=0;
  2520. struct p_context sub;
  2521. struct child_prog *child = ctx->child;
  2522. if (child->argv) {
  2523. syntax();
  2524. return 1; /* syntax error, groups and arglists don't mix */
  2525. }
  2526. initialize_context(&sub);
  2527. switch(ch) {
  2528. case '(': endch=')'; child->subshell=1; break;
  2529. case '{': endch='}'; break;
  2530. default: syntax(); /* really logic error */
  2531. }
  2532. rcode=parse_stream(dest,&sub,input,endch);
  2533. done_word(dest,&sub); /* finish off the final word in the subcontext */
  2534. done_pipe(&sub, PIPE_SEQ); /* and the final command there, too */
  2535. child->group = sub.list_head;
  2536. return rcode;
  2537. /* child remains "open", available for possible redirects */
  2538. }
  2539. #endif
  2540. /* basically useful version until someone wants to get fancier,
  2541. * see the bash man page under "Parameter Expansion" */
  2542. static char *lookup_param(char *src)
  2543. {
  2544. char *p;
  2545. char *sep;
  2546. char *default_val = NULL;
  2547. int assign = 0;
  2548. int expand_empty = 0;
  2549. if (!src)
  2550. return NULL;
  2551. sep = strchr(src, ':');
  2552. if (sep) {
  2553. *sep = '\0';
  2554. if (*(sep + 1) == '-')
  2555. default_val = sep+2;
  2556. if (*(sep + 1) == '=') {
  2557. default_val = sep+2;
  2558. assign = 1;
  2559. }
  2560. if (*(sep + 1) == '+') {
  2561. default_val = sep+2;
  2562. expand_empty = 1;
  2563. }
  2564. }
  2565. p = getenv(src);
  2566. if (!p)
  2567. p = get_local_var(src);
  2568. if (!p || strlen(p) == 0) {
  2569. p = default_val;
  2570. if (assign) {
  2571. char *var = malloc(strlen(src)+strlen(default_val)+2);
  2572. if (var) {
  2573. sprintf(var, "%s=%s", src, default_val);
  2574. set_local_var(var, 0);
  2575. }
  2576. free(var);
  2577. }
  2578. } else if (expand_empty) {
  2579. p += strlen(p);
  2580. }
  2581. if (sep)
  2582. *sep = ':';
  2583. return p;
  2584. }
  2585. #ifdef __U_BOOT__
  2586. static char *get_dollar_var(char ch)
  2587. {
  2588. static char buf[40];
  2589. buf[0] = '\0';
  2590. switch (ch) {
  2591. case '?':
  2592. sprintf(buf, "%u", (unsigned int)last_return_code);
  2593. break;
  2594. default:
  2595. return NULL;
  2596. }
  2597. return buf;
  2598. }
  2599. #endif
  2600. /* return code: 0 for OK, 1 for syntax error */
  2601. static int handle_dollar(o_string *dest, struct p_context *ctx, struct in_str *input)
  2602. {
  2603. #ifndef __U_BOOT__
  2604. int i, advance=0;
  2605. #else
  2606. int advance=0;
  2607. #endif
  2608. #ifndef __U_BOOT__
  2609. char sep[]=" ";
  2610. #endif
  2611. int ch = input->peek(input); /* first character after the $ */
  2612. debug_printf("handle_dollar: ch=%c\n",ch);
  2613. if (isalpha(ch)) {
  2614. b_addchr(dest, SPECIAL_VAR_SYMBOL);
  2615. ctx->child->sp++;
  2616. while(ch=b_peek(input),isalnum(ch) || ch=='_') {
  2617. b_getch(input);
  2618. b_addchr(dest,ch);
  2619. }
  2620. b_addchr(dest, SPECIAL_VAR_SYMBOL);
  2621. #ifndef __U_BOOT__
  2622. } else if (isdigit(ch)) {
  2623. i = ch-'0'; /* XXX is $0 special? */
  2624. if (i<global_argc) {
  2625. parse_string(dest, ctx, global_argv[i]); /* recursion */
  2626. }
  2627. advance = 1;
  2628. #endif
  2629. } else switch (ch) {
  2630. #ifndef __U_BOOT__
  2631. case '$':
  2632. b_adduint(dest,getpid());
  2633. advance = 1;
  2634. break;
  2635. case '!':
  2636. if (last_bg_pid > 0) b_adduint(dest, last_bg_pid);
  2637. advance = 1;
  2638. break;
  2639. #endif
  2640. case '?':
  2641. #ifndef __U_BOOT__
  2642. b_adduint(dest,last_return_code);
  2643. #else
  2644. ctx->child->sp++;
  2645. b_addchr(dest, SPECIAL_VAR_SYMBOL);
  2646. b_addchr(dest, '$');
  2647. b_addchr(dest, '?');
  2648. b_addchr(dest, SPECIAL_VAR_SYMBOL);
  2649. #endif
  2650. advance = 1;
  2651. break;
  2652. #ifndef __U_BOOT__
  2653. case '#':
  2654. b_adduint(dest,global_argc ? global_argc-1 : 0);
  2655. advance = 1;
  2656. break;
  2657. #endif
  2658. case '{':
  2659. b_addchr(dest, SPECIAL_VAR_SYMBOL);
  2660. ctx->child->sp++;
  2661. b_getch(input);
  2662. /* XXX maybe someone will try to escape the '}' */
  2663. while(ch=b_getch(input),ch!=EOF && ch!='}') {
  2664. b_addchr(dest,ch);
  2665. }
  2666. if (ch != '}') {
  2667. syntax();
  2668. return 1;
  2669. }
  2670. b_addchr(dest, SPECIAL_VAR_SYMBOL);
  2671. break;
  2672. #ifndef __U_BOOT__
  2673. case '(':
  2674. b_getch(input);
  2675. process_command_subs(dest, ctx, input, ')');
  2676. break;
  2677. case '*':
  2678. sep[0]=ifs[0];
  2679. for (i=1; i<global_argc; i++) {
  2680. parse_string(dest, ctx, global_argv[i]);
  2681. if (i+1 < global_argc) parse_string(dest, ctx, sep);
  2682. }
  2683. break;
  2684. case '@':
  2685. case '-':
  2686. case '_':
  2687. /* still unhandled, but should be eventually */
  2688. error_msg("unhandled syntax: $%c",ch);
  2689. return 1;
  2690. break;
  2691. #endif
  2692. default:
  2693. b_addqchr(dest,'$',dest->quote);
  2694. }
  2695. /* Eat the character if the flag was set. If the compiler
  2696. * is smart enough, we could substitute "b_getch(input);"
  2697. * for all the "advance = 1;" above, and also end up with
  2698. * a nice size-optimized program. Hah! That'll be the day.
  2699. */
  2700. if (advance) b_getch(input);
  2701. return 0;
  2702. }
  2703. #ifndef __U_BOOT__
  2704. int parse_string(o_string *dest, struct p_context *ctx, const char *src)
  2705. {
  2706. struct in_str foo;
  2707. setup_string_in_str(&foo, src);
  2708. return parse_stream(dest, ctx, &foo, '\0');
  2709. }
  2710. #endif
  2711. /* return code is 0 for normal exit, 1 for syntax error */
  2712. static int parse_stream(o_string *dest, struct p_context *ctx,
  2713. struct in_str *input, int end_trigger)
  2714. {
  2715. unsigned int ch, m;
  2716. #ifndef __U_BOOT__
  2717. int redir_fd;
  2718. redir_type redir_style;
  2719. #endif
  2720. int next;
  2721. /* Only double-quote state is handled in the state variable dest->quote.
  2722. * A single-quote triggers a bypass of the main loop until its mate is
  2723. * found. When recursing, quote state is passed in via dest->quote. */
  2724. debug_printf("parse_stream, end_trigger=%d\n",end_trigger);
  2725. while ((ch=b_getch(input))!=EOF) {
  2726. m = map[ch];
  2727. #ifdef __U_BOOT__
  2728. if (input->__promptme == 0) return 1;
  2729. #endif
  2730. next = (ch == '\n') ? 0 : b_peek(input);
  2731. debug_printf("parse_stream: ch=%c (%d) m=%d quote=%d - %c\n",
  2732. ch >= ' ' ? ch : '.', ch, m,
  2733. dest->quote, ctx->stack == NULL ? '*' : '.');
  2734. if (m==0 || ((m==1 || m==2) && dest->quote)) {
  2735. b_addqchr(dest, ch, dest->quote);
  2736. } else {
  2737. if (m==2) { /* unquoted IFS */
  2738. if (done_word(dest, ctx)) {
  2739. return 1;
  2740. }
  2741. /* If we aren't performing a substitution, treat a newline as a
  2742. * command separator. */
  2743. if (end_trigger != '\0' && ch=='\n')
  2744. done_pipe(ctx,PIPE_SEQ);
  2745. }
  2746. if (ch == end_trigger && !dest->quote && ctx->w==RES_NONE) {
  2747. debug_printf("leaving parse_stream (triggered)\n");
  2748. return 0;
  2749. }
  2750. #if 0
  2751. if (ch=='\n') {
  2752. /* Yahoo! Time to run with it! */
  2753. done_pipe(ctx,PIPE_SEQ);
  2754. run_list(ctx->list_head);
  2755. initialize_context(ctx);
  2756. }
  2757. #endif
  2758. if (m!=2) switch (ch) {
  2759. case '#':
  2760. if (dest->length == 0 && !dest->quote) {
  2761. while(ch=b_peek(input),ch!=EOF && ch!='\n') { b_getch(input); }
  2762. } else {
  2763. b_addqchr(dest, ch, dest->quote);
  2764. }
  2765. break;
  2766. case '\\':
  2767. if (next == EOF) {
  2768. syntax();
  2769. return 1;
  2770. }
  2771. b_addqchr(dest, '\\', dest->quote);
  2772. b_addqchr(dest, b_getch(input), dest->quote);
  2773. break;
  2774. case '$':
  2775. if (handle_dollar(dest, ctx, input)!=0) return 1;
  2776. break;
  2777. case '\'':
  2778. dest->nonnull = 1;
  2779. while(ch=b_getch(input),ch!=EOF && ch!='\'') {
  2780. #ifdef __U_BOOT__
  2781. if(input->__promptme == 0) return 1;
  2782. #endif
  2783. b_addchr(dest,ch);
  2784. }
  2785. if (ch==EOF) {
  2786. syntax();
  2787. return 1;
  2788. }
  2789. break;
  2790. case '"':
  2791. dest->nonnull = 1;
  2792. dest->quote = !dest->quote;
  2793. break;
  2794. #ifndef __U_BOOT__
  2795. case '`':
  2796. process_command_subs(dest, ctx, input, '`');
  2797. break;
  2798. case '>':
  2799. redir_fd = redirect_opt_num(dest);
  2800. done_word(dest, ctx);
  2801. redir_style=REDIRECT_OVERWRITE;
  2802. if (next == '>') {
  2803. redir_style=REDIRECT_APPEND;
  2804. b_getch(input);
  2805. } else if (next == '(') {
  2806. syntax(); /* until we support >(list) Process Substitution */
  2807. return 1;
  2808. }
  2809. setup_redirect(ctx, redir_fd, redir_style, input);
  2810. break;
  2811. case '<':
  2812. redir_fd = redirect_opt_num(dest);
  2813. done_word(dest, ctx);
  2814. redir_style=REDIRECT_INPUT;
  2815. if (next == '<') {
  2816. redir_style=REDIRECT_HEREIS;
  2817. b_getch(input);
  2818. } else if (next == '>') {
  2819. redir_style=REDIRECT_IO;
  2820. b_getch(input);
  2821. } else if (next == '(') {
  2822. syntax(); /* until we support <(list) Process Substitution */
  2823. return 1;
  2824. }
  2825. setup_redirect(ctx, redir_fd, redir_style, input);
  2826. break;
  2827. #endif
  2828. case ';':
  2829. done_word(dest, ctx);
  2830. done_pipe(ctx,PIPE_SEQ);
  2831. break;
  2832. case '&':
  2833. done_word(dest, ctx);
  2834. if (next=='&') {
  2835. b_getch(input);
  2836. done_pipe(ctx,PIPE_AND);
  2837. } else {
  2838. #ifndef __U_BOOT__
  2839. done_pipe(ctx,PIPE_BG);
  2840. #else
  2841. syntax_err();
  2842. return 1;
  2843. #endif
  2844. }
  2845. break;
  2846. case '|':
  2847. done_word(dest, ctx);
  2848. if (next=='|') {
  2849. b_getch(input);
  2850. done_pipe(ctx,PIPE_OR);
  2851. } else {
  2852. /* we could pick up a file descriptor choice here
  2853. * with redirect_opt_num(), but bash doesn't do it.
  2854. * "echo foo 2| cat" yields "foo 2". */
  2855. #ifndef __U_BOOT__
  2856. done_command(ctx);
  2857. #else
  2858. syntax_err();
  2859. return 1;
  2860. #endif
  2861. }
  2862. break;
  2863. #ifndef __U_BOOT__
  2864. case '(':
  2865. case '{':
  2866. if (parse_group(dest, ctx, input, ch)!=0) return 1;
  2867. break;
  2868. case ')':
  2869. case '}':
  2870. syntax(); /* Proper use of this character caught by end_trigger */
  2871. return 1;
  2872. break;
  2873. #endif
  2874. case SUBSTED_VAR_SYMBOL:
  2875. dest->nonnull = 1;
  2876. while (ch = b_getch(input), ch != EOF &&
  2877. ch != SUBSTED_VAR_SYMBOL) {
  2878. debug_printf("subst, pass=%d\n", ch);
  2879. if (input->__promptme == 0)
  2880. return 1;
  2881. b_addchr(dest, ch);
  2882. }
  2883. debug_printf("subst, term=%d\n", ch);
  2884. if (ch == EOF) {
  2885. syntax();
  2886. return 1;
  2887. }
  2888. break;
  2889. default:
  2890. syntax(); /* this is really an internal logic error */
  2891. return 1;
  2892. }
  2893. }
  2894. }
  2895. /* complain if quote? No, maybe we just finished a command substitution
  2896. * that was quoted. Example:
  2897. * $ echo "`cat foo` plus more"
  2898. * and we just got the EOF generated by the subshell that ran "cat foo"
  2899. * The only real complaint is if we got an EOF when end_trigger != '\0',
  2900. * that is, we were really supposed to get end_trigger, and never got
  2901. * one before the EOF. Can't use the standard "syntax error" return code,
  2902. * so that parse_stream_outer can distinguish the EOF and exit smoothly. */
  2903. debug_printf("leaving parse_stream (EOF)\n");
  2904. if (end_trigger != '\0') return -1;
  2905. return 0;
  2906. }
  2907. static void mapset(const unsigned char *set, int code)
  2908. {
  2909. const unsigned char *s;
  2910. for (s=set; *s; s++) map[*s] = code;
  2911. }
  2912. static void update_ifs_map(void)
  2913. {
  2914. /* char *ifs and char map[256] are both globals. */
  2915. ifs = (uchar *)getenv("IFS");
  2916. if (ifs == NULL) ifs=(uchar *)" \t\n";
  2917. /* Precompute a list of 'flow through' behavior so it can be treated
  2918. * quickly up front. Computation is necessary because of IFS.
  2919. * Special case handling of IFS == " \t\n" is not implemented.
  2920. * The map[] array only really needs two bits each, and on most machines
  2921. * that would be faster because of the reduced L1 cache footprint.
  2922. */
  2923. memset(map,0,sizeof(map)); /* most characters flow through always */
  2924. #ifndef __U_BOOT__
  2925. mapset((uchar *)"\\$'\"`", 3); /* never flow through */
  2926. mapset((uchar *)"<>;&|(){}#", 1); /* flow through if quoted */
  2927. #else
  2928. {
  2929. uchar subst[2] = {SUBSTED_VAR_SYMBOL, 0};
  2930. mapset(subst, 3); /* never flow through */
  2931. }
  2932. mapset((uchar *)"\\$'\"", 3); /* never flow through */
  2933. mapset((uchar *)";&|#", 1); /* flow through if quoted */
  2934. #endif
  2935. mapset(ifs, 2); /* also flow through if quoted */
  2936. }
  2937. /* most recursion does not come through here, the exeception is
  2938. * from builtin_source() */
  2939. static int parse_stream_outer(struct in_str *inp, int flag)
  2940. {
  2941. struct p_context ctx;
  2942. o_string temp=NULL_O_STRING;
  2943. int rcode;
  2944. #ifdef __U_BOOT__
  2945. int code = 0;
  2946. #endif
  2947. do {
  2948. ctx.type = flag;
  2949. initialize_context(&ctx);
  2950. update_ifs_map();
  2951. if (!(flag & FLAG_PARSE_SEMICOLON) || (flag & FLAG_REPARSING)) mapset((uchar *)";$&|", 0);
  2952. inp->promptmode=1;
  2953. rcode = parse_stream(&temp, &ctx, inp,
  2954. flag & FLAG_CONT_ON_NEWLINE ? -1 : '\n');
  2955. #ifdef __U_BOOT__
  2956. if (rcode == 1) flag_repeat = 0;
  2957. #endif
  2958. if (rcode != 1 && ctx.old_flag != 0) {
  2959. syntax();
  2960. #ifdef __U_BOOT__
  2961. flag_repeat = 0;
  2962. #endif
  2963. }
  2964. if (rcode != 1 && ctx.old_flag == 0) {
  2965. done_word(&temp, &ctx);
  2966. done_pipe(&ctx,PIPE_SEQ);
  2967. #ifndef __U_BOOT__
  2968. run_list(ctx.list_head);
  2969. #else
  2970. code = run_list(ctx.list_head);
  2971. if (code == -2) { /* exit */
  2972. b_free(&temp);
  2973. code = 0;
  2974. /* XXX hackish way to not allow exit from main loop */
  2975. if (inp->peek == file_peek) {
  2976. printf("exit not allowed from main input shell.\n");
  2977. continue;
  2978. }
  2979. break;
  2980. }
  2981. if (code == -1)
  2982. flag_repeat = 0;
  2983. #endif
  2984. } else {
  2985. if (ctx.old_flag != 0) {
  2986. free(ctx.stack);
  2987. b_reset(&temp);
  2988. }
  2989. #ifdef __U_BOOT__
  2990. if (inp->__promptme == 0) printf("<INTERRUPT>\n");
  2991. inp->__promptme = 1;
  2992. #endif
  2993. temp.nonnull = 0;
  2994. temp.quote = 0;
  2995. inp->p = NULL;
  2996. free_pipe_list(ctx.list_head,0);
  2997. }
  2998. b_free(&temp);
  2999. /* loop on syntax errors, return on EOF */
  3000. } while (rcode != -1 && !(flag & FLAG_EXIT_FROM_LOOP) &&
  3001. (inp->peek != static_peek || b_peek(inp)));
  3002. #ifndef __U_BOOT__
  3003. return 0;
  3004. #else
  3005. return (code != 0) ? 1 : 0;
  3006. #endif /* __U_BOOT__ */
  3007. }
  3008. #ifndef __U_BOOT__
  3009. static int parse_string_outer(const char *s, int flag)
  3010. #else
  3011. int parse_string_outer(const char *s, int flag)
  3012. #endif /* __U_BOOT__ */
  3013. {
  3014. struct in_str input;
  3015. #ifdef __U_BOOT__
  3016. char *p = NULL;
  3017. int rcode;
  3018. if ( !s || !*s)
  3019. return 1;
  3020. if (!(p = strchr(s, '\n')) || *++p) {
  3021. p = xmalloc(strlen(s) + 2);
  3022. strcpy(p, s);
  3023. strcat(p, "\n");
  3024. setup_string_in_str(&input, p);
  3025. rcode = parse_stream_outer(&input, flag);
  3026. free(p);
  3027. return rcode;
  3028. } else {
  3029. #endif
  3030. setup_string_in_str(&input, s);
  3031. return parse_stream_outer(&input, flag);
  3032. #ifdef __U_BOOT__
  3033. }
  3034. #endif
  3035. }
  3036. #ifndef __U_BOOT__
  3037. static int parse_file_outer(FILE *f)
  3038. #else
  3039. int parse_file_outer(void)
  3040. #endif
  3041. {
  3042. int rcode;
  3043. struct in_str input;
  3044. #ifndef __U_BOOT__
  3045. setup_file_in_str(&input, f);
  3046. #else
  3047. setup_file_in_str(&input);
  3048. #endif
  3049. rcode = parse_stream_outer(&input, FLAG_PARSE_SEMICOLON);
  3050. return rcode;
  3051. }
  3052. #ifdef __U_BOOT__
  3053. #ifdef CONFIG_NEEDS_MANUAL_RELOC
  3054. static void u_boot_hush_reloc(void)
  3055. {
  3056. unsigned long addr;
  3057. struct reserved_combo *r;
  3058. for (r=reserved_list; r<reserved_list+NRES; r++) {
  3059. addr = (ulong) (r->literal) + gd->reloc_off;
  3060. r->literal = (char *)addr;
  3061. }
  3062. }
  3063. #endif
  3064. int u_boot_hush_start(void)
  3065. {
  3066. if (top_vars == NULL) {
  3067. top_vars = malloc(sizeof(struct variables));
  3068. top_vars->name = "HUSH_VERSION";
  3069. top_vars->value = "0.01";
  3070. top_vars->next = NULL;
  3071. top_vars->flg_export = 0;
  3072. top_vars->flg_read_only = 1;
  3073. #ifdef CONFIG_NEEDS_MANUAL_RELOC
  3074. u_boot_hush_reloc();
  3075. #endif
  3076. }
  3077. return 0;
  3078. }
  3079. static void *xmalloc(size_t size)
  3080. {
  3081. void *p = NULL;
  3082. if (!(p = malloc(size))) {
  3083. printf("ERROR : memory not allocated\n");
  3084. for(;;);
  3085. }
  3086. return p;
  3087. }
  3088. static void *xrealloc(void *ptr, size_t size)
  3089. {
  3090. void *p = NULL;
  3091. if (!(p = realloc(ptr, size))) {
  3092. printf("ERROR : memory not allocated\n");
  3093. for(;;);
  3094. }
  3095. return p;
  3096. }
  3097. #endif /* __U_BOOT__ */
  3098. #ifndef __U_BOOT__
  3099. /* Make sure we have a controlling tty. If we get started under a job
  3100. * aware app (like bash for example), make sure we are now in charge so
  3101. * we don't fight over who gets the foreground */
  3102. static void setup_job_control(void)
  3103. {
  3104. static pid_t shell_pgrp;
  3105. /* Loop until we are in the foreground. */
  3106. while (tcgetpgrp (shell_terminal) != (shell_pgrp = getpgrp ()))
  3107. kill (- shell_pgrp, SIGTTIN);
  3108. /* Ignore interactive and job-control signals. */
  3109. signal(SIGINT, SIG_IGN);
  3110. signal(SIGQUIT, SIG_IGN);
  3111. signal(SIGTERM, SIG_IGN);
  3112. signal(SIGTSTP, SIG_IGN);
  3113. signal(SIGTTIN, SIG_IGN);
  3114. signal(SIGTTOU, SIG_IGN);
  3115. signal(SIGCHLD, SIG_IGN);
  3116. /* Put ourselves in our own process group. */
  3117. setsid();
  3118. shell_pgrp = getpid ();
  3119. setpgid (shell_pgrp, shell_pgrp);
  3120. /* Grab control of the terminal. */
  3121. tcsetpgrp(shell_terminal, shell_pgrp);
  3122. }
  3123. int hush_main(int argc, char * const *argv)
  3124. {
  3125. int opt;
  3126. FILE *input;
  3127. char **e = environ;
  3128. /* XXX what should these be while sourcing /etc/profile? */
  3129. global_argc = argc;
  3130. global_argv = argv;
  3131. /* (re?) initialize globals. Sometimes hush_main() ends up calling
  3132. * hush_main(), therefore we cannot rely on the BSS to zero out this
  3133. * stuff. Reset these to 0 every time. */
  3134. ifs = NULL;
  3135. /* map[] is taken care of with call to update_ifs_map() */
  3136. fake_mode = 0;
  3137. interactive = 0;
  3138. close_me_head = NULL;
  3139. last_bg_pid = 0;
  3140. job_list = NULL;
  3141. last_jobid = 0;
  3142. /* Initialize some more globals to non-zero values */
  3143. set_cwd();
  3144. #ifdef CONFIG_FEATURE_COMMAND_EDITING
  3145. cmdedit_set_initial_prompt();
  3146. #else
  3147. PS1 = NULL;
  3148. #endif
  3149. PS2 = "> ";
  3150. /* initialize our shell local variables with the values
  3151. * currently living in the environment */
  3152. if (e) {
  3153. for (; *e; e++)
  3154. set_local_var(*e, 2); /* without call putenv() */
  3155. }
  3156. last_return_code=EXIT_SUCCESS;
  3157. if (argv[0] && argv[0][0] == '-') {
  3158. debug_printf("\nsourcing /etc/profile\n");
  3159. if ((input = fopen("/etc/profile", "r")) != NULL) {
  3160. mark_open(fileno(input));
  3161. parse_file_outer(input);
  3162. mark_closed(fileno(input));
  3163. fclose(input);
  3164. }
  3165. }
  3166. input=stdin;
  3167. while ((opt = getopt(argc, argv, "c:xif")) > 0) {
  3168. switch (opt) {
  3169. case 'c':
  3170. {
  3171. global_argv = argv+optind;
  3172. global_argc = argc-optind;
  3173. opt = parse_string_outer(optarg, FLAG_PARSE_SEMICOLON);
  3174. goto final_return;
  3175. }
  3176. break;
  3177. case 'i':
  3178. interactive++;
  3179. break;
  3180. case 'f':
  3181. fake_mode++;
  3182. break;
  3183. default:
  3184. #ifndef BB_VER
  3185. fprintf(stderr, "Usage: sh [FILE]...\n"
  3186. " or: sh -c command [args]...\n\n");
  3187. exit(EXIT_FAILURE);
  3188. #else
  3189. show_usage();
  3190. #endif
  3191. }
  3192. }
  3193. /* A shell is interactive if the `-i' flag was given, or if all of
  3194. * the following conditions are met:
  3195. * no -c command
  3196. * no arguments remaining or the -s flag given
  3197. * standard input is a terminal
  3198. * standard output is a terminal
  3199. * Refer to Posix.2, the description of the `sh' utility. */
  3200. if (argv[optind]==NULL && input==stdin &&
  3201. isatty(fileno(stdin)) && isatty(fileno(stdout))) {
  3202. interactive++;
  3203. }
  3204. debug_printf("\ninteractive=%d\n", interactive);
  3205. if (interactive) {
  3206. /* Looks like they want an interactive shell */
  3207. #ifndef CONFIG_FEATURE_SH_EXTRA_QUIET
  3208. printf( "\n\n" BB_BANNER " hush - the humble shell v0.01 (testing)\n");
  3209. printf( "Enter 'help' for a list of built-in commands.\n\n");
  3210. #endif
  3211. setup_job_control();
  3212. }
  3213. if (argv[optind]==NULL) {
  3214. opt=parse_file_outer(stdin);
  3215. goto final_return;
  3216. }
  3217. debug_printf("\nrunning script '%s'\n", argv[optind]);
  3218. global_argv = argv+optind;
  3219. global_argc = argc-optind;
  3220. input = xfopen(argv[optind], "r");
  3221. opt = parse_file_outer(input);
  3222. #ifdef CONFIG_FEATURE_CLEAN_UP
  3223. fclose(input);
  3224. if (cwd && cwd != unknown)
  3225. free((char*)cwd);
  3226. {
  3227. struct variables *cur, *tmp;
  3228. for(cur = top_vars; cur; cur = tmp) {
  3229. tmp = cur->next;
  3230. if (!cur->flg_read_only) {
  3231. free(cur->name);
  3232. free(cur->value);
  3233. free(cur);
  3234. }
  3235. }
  3236. }
  3237. #endif
  3238. final_return:
  3239. return(opt?opt:last_return_code);
  3240. }
  3241. #endif
  3242. static char *insert_var_value(char *inp)
  3243. {
  3244. return insert_var_value_sub(inp, 0);
  3245. }
  3246. static char *insert_var_value_sub(char *inp, int tag_subst)
  3247. {
  3248. int res_str_len = 0;
  3249. int len;
  3250. int done = 0;
  3251. char *p, *p1, *res_str = NULL;
  3252. while ((p = strchr(inp, SPECIAL_VAR_SYMBOL))) {
  3253. /* check the beginning of the string for normal charachters */
  3254. if (p != inp) {
  3255. /* copy any charachters to the result string */
  3256. len = p - inp;
  3257. res_str = xrealloc(res_str, (res_str_len + len));
  3258. strncpy((res_str + res_str_len), inp, len);
  3259. res_str_len += len;
  3260. }
  3261. inp = ++p;
  3262. /* find the ending marker */
  3263. p = strchr(inp, SPECIAL_VAR_SYMBOL);
  3264. *p = '\0';
  3265. /* look up the value to substitute */
  3266. if ((p1 = lookup_param(inp))) {
  3267. if (tag_subst)
  3268. len = res_str_len + strlen(p1) + 2;
  3269. else
  3270. len = res_str_len + strlen(p1);
  3271. res_str = xrealloc(res_str, (1 + len));
  3272. if (tag_subst) {
  3273. /*
  3274. * copy the variable value to the result
  3275. * string
  3276. */
  3277. strcpy((res_str + res_str_len + 1), p1);
  3278. /*
  3279. * mark the replaced text to be accepted as
  3280. * is
  3281. */
  3282. res_str[res_str_len] = SUBSTED_VAR_SYMBOL;
  3283. res_str[res_str_len + 1 + strlen(p1)] =
  3284. SUBSTED_VAR_SYMBOL;
  3285. } else
  3286. /*
  3287. * copy the variable value to the result
  3288. * string
  3289. */
  3290. strcpy((res_str + res_str_len), p1);
  3291. res_str_len = len;
  3292. }
  3293. *p = SPECIAL_VAR_SYMBOL;
  3294. inp = ++p;
  3295. done = 1;
  3296. }
  3297. if (done) {
  3298. res_str = xrealloc(res_str, (1 + res_str_len + strlen(inp)));
  3299. strcpy((res_str + res_str_len), inp);
  3300. while ((p = strchr(res_str, '\n'))) {
  3301. *p = ' ';
  3302. }
  3303. }
  3304. return (res_str == NULL) ? inp : res_str;
  3305. }
  3306. static char **make_list_in(char **inp, char *name)
  3307. {
  3308. int len, i;
  3309. int name_len = strlen(name);
  3310. int n = 0;
  3311. char **list;
  3312. char *p1, *p2, *p3;
  3313. /* create list of variable values */
  3314. list = xmalloc(sizeof(*list));
  3315. for (i = 0; inp[i]; i++) {
  3316. p3 = insert_var_value(inp[i]);
  3317. p1 = p3;
  3318. while (*p1) {
  3319. if (*p1 == ' ') {
  3320. p1++;
  3321. continue;
  3322. }
  3323. if ((p2 = strchr(p1, ' '))) {
  3324. len = p2 - p1;
  3325. } else {
  3326. len = strlen(p1);
  3327. p2 = p1 + len;
  3328. }
  3329. /* we use n + 2 in realloc for list,because we add
  3330. * new element and then we will add NULL element */
  3331. list = xrealloc(list, sizeof(*list) * (n + 2));
  3332. list[n] = xmalloc(2 + name_len + len);
  3333. strcpy(list[n], name);
  3334. strcat(list[n], "=");
  3335. strncat(list[n], p1, len);
  3336. list[n++][name_len + len + 1] = '\0';
  3337. p1 = p2;
  3338. }
  3339. if (p3 != inp[i]) free(p3);
  3340. }
  3341. list[n] = NULL;
  3342. return list;
  3343. }
  3344. /*
  3345. * Make new string for parser
  3346. * inp - array of argument strings to flatten
  3347. * nonnull - indicates argument was quoted when originally parsed
  3348. */
  3349. static char *make_string(char **inp, int *nonnull)
  3350. {
  3351. char *p;
  3352. char *str = NULL;
  3353. int n;
  3354. int len = 2;
  3355. char *noeval_str;
  3356. int noeval = 0;
  3357. noeval_str = get_local_var("HUSH_NO_EVAL");
  3358. if (noeval_str != NULL && *noeval_str != '0' && *noeval_str != '\0')
  3359. noeval = 1;
  3360. for (n = 0; inp[n]; n++) {
  3361. p = insert_var_value_sub(inp[n], noeval);
  3362. str = xrealloc(str, (len + strlen(p) + (2 * nonnull[n])));
  3363. if (n) {
  3364. strcat(str, " ");
  3365. } else {
  3366. *str = '\0';
  3367. }
  3368. if (nonnull[n])
  3369. strcat(str, "'");
  3370. strcat(str, p);
  3371. if (nonnull[n])
  3372. strcat(str, "'");
  3373. len = strlen(str) + 3;
  3374. if (p != inp[n]) free(p);
  3375. }
  3376. len = strlen(str);
  3377. *(str + len) = '\n';
  3378. *(str + len + 1) = '\0';
  3379. return str;
  3380. }
  3381. #ifdef __U_BOOT__
  3382. static int do_showvar(cmd_tbl_t *cmdtp, int flag, int argc,
  3383. char * const argv[])
  3384. {
  3385. int i, k;
  3386. int rcode = 0;
  3387. struct variables *cur;
  3388. if (argc == 1) { /* Print all env variables */
  3389. for (cur = top_vars; cur; cur = cur->next) {
  3390. printf ("%s=%s\n", cur->name, cur->value);
  3391. if (ctrlc ()) {
  3392. puts ("\n ** Abort\n");
  3393. return 1;
  3394. }
  3395. }
  3396. return 0;
  3397. }
  3398. for (i = 1; i < argc; ++i) { /* print single env variables */
  3399. char *name = argv[i];
  3400. k = -1;
  3401. for (cur = top_vars; cur; cur = cur->next) {
  3402. if(strcmp (cur->name, name) == 0) {
  3403. k = 0;
  3404. printf ("%s=%s\n", cur->name, cur->value);
  3405. }
  3406. if (ctrlc ()) {
  3407. puts ("\n ** Abort\n");
  3408. return 1;
  3409. }
  3410. }
  3411. if (k < 0) {
  3412. printf ("## Error: \"%s\" not defined\n", name);
  3413. rcode ++;
  3414. }
  3415. }
  3416. return rcode;
  3417. }
  3418. U_BOOT_CMD(
  3419. showvar, CONFIG_SYS_MAXARGS, 1, do_showvar,
  3420. "print local hushshell variables",
  3421. "\n - print values of all hushshell variables\n"
  3422. "showvar name ...\n"
  3423. " - print value of hushshell variable 'name'"
  3424. );
  3425. #endif
  3426. /****************************************************************************/