test.c 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427
  1. /*
  2. * This file is part of the UCB release of Plan 9. It is subject to the license
  3. * terms in the LICENSE file found in the top-level directory of this
  4. * distribution and at http://akaros.cs.berkeley.edu/files/Plan9License. No
  5. * part of the UCB release of Plan 9, including this file, may be copied,
  6. * modified, propagated, or distributed except according to the terms contained
  7. * in the LICENSE file.
  8. */
  9. /*
  10. * POSIX standard
  11. * test expression
  12. * [ expression ]
  13. *
  14. * Plan 9 additions:
  15. * -A file exists and is append-only
  16. * -L file exists and is exclusive-use
  17. * -T file exists and is temporary
  18. */
  19. #include <u.h>
  20. #include <libc.h>
  21. #define EQ(a,b) ((tmp=a)==0?0:(strcmp(tmp,b)==0))
  22. int ap;
  23. int ac;
  24. char **av;
  25. char *tmp;
  26. void synbad(char *, char *);
  27. int fsizep(char *);
  28. int isdir(char *);
  29. int isreg(char *);
  30. int isatty(int);
  31. int isint(char *, int *);
  32. int isolder(char *, char *);
  33. int isolderthan(char *, char *);
  34. int isnewerthan(char *, char *);
  35. int hasmode(char *, uint32_t);
  36. int tio(char *, int);
  37. int e(void), e1(void), e2(void), e3(void);
  38. char *nxtarg(int);
  39. void
  40. main(int argc, char *argv[])
  41. {
  42. int r;
  43. char *c;
  44. ac = argc; av = argv; ap = 1;
  45. if(EQ(argv[0],"[")) {
  46. if(!EQ(argv[--ac],"]"))
  47. synbad("] missing","");
  48. }
  49. argv[ac] = 0;
  50. if (ac<=1)
  51. exits("usage");
  52. r = e();
  53. /*
  54. * nice idea but short-circuit -o and -a operators may have
  55. * not consumed their right-hand sides.
  56. */
  57. if(0 && (c = nxtarg(1)) != nil)
  58. synbad("unexpected operator/operand: ", c);
  59. exits(r?0:"false");
  60. }
  61. char *
  62. nxtarg(int mt)
  63. {
  64. if(ap>=ac){
  65. if(mt){
  66. ap++;
  67. return(0);
  68. }
  69. synbad("argument expected","");
  70. }
  71. return(av[ap++]);
  72. }
  73. int
  74. nxtintarg(int *pans)
  75. {
  76. if(ap<ac && isint(av[ap], pans)){
  77. ap++;
  78. return 1;
  79. }
  80. return 0;
  81. }
  82. int
  83. e(void)
  84. {
  85. int p1;
  86. p1 = e1();
  87. if (EQ(nxtarg(1), "-o"))
  88. return(p1 || e());
  89. ap--;
  90. return(p1);
  91. }
  92. int
  93. e1(void)
  94. {
  95. int p1;
  96. p1 = e2();
  97. if (EQ(nxtarg(1), "-a"))
  98. return (p1 && e1());
  99. ap--;
  100. return(p1);
  101. }
  102. int
  103. e2(void)
  104. {
  105. if (EQ(nxtarg(0), "!"))
  106. return(!e2());
  107. ap--;
  108. return(e3());
  109. }
  110. int
  111. e3(void)
  112. {
  113. int p1, int1, int2;
  114. char *a, *p2;
  115. a = nxtarg(0);
  116. if(EQ(a, "(")) {
  117. p1 = e();
  118. if(!EQ(nxtarg(0), ")"))
  119. synbad(") expected","");
  120. return(p1);
  121. }
  122. if(EQ(a, "-A"))
  123. return(hasmode(nxtarg(0), DMAPPEND));
  124. if(EQ(a, "-L"))
  125. return(hasmode(nxtarg(0), DMEXCL));
  126. if(EQ(a, "-T"))
  127. return(hasmode(nxtarg(0), DMTMP));
  128. if(EQ(a, "-f"))
  129. return(isreg(nxtarg(0)));
  130. if(EQ(a, "-d"))
  131. return(isdir(nxtarg(0)));
  132. if(EQ(a, "-r"))
  133. return(tio(nxtarg(0), 4));
  134. if(EQ(a, "-w"))
  135. return(tio(nxtarg(0), 2));
  136. if(EQ(a, "-x"))
  137. return(tio(nxtarg(0), 1));
  138. if(EQ(a, "-e"))
  139. return(tio(nxtarg(0), 0));
  140. if(EQ(a, "-c"))
  141. return(0);
  142. if(EQ(a, "-b"))
  143. return(0);
  144. if(EQ(a, "-u"))
  145. return(0);
  146. if(EQ(a, "-g"))
  147. return(0);
  148. if(EQ(a, "-s"))
  149. return(fsizep(nxtarg(0)));
  150. if(EQ(a, "-t"))
  151. if(ap>=ac)
  152. return(isatty(1));
  153. else if(nxtintarg(&int1))
  154. return(isatty(int1));
  155. else
  156. synbad("not a valid file descriptor number ", "");
  157. if(EQ(a, "-n"))
  158. return(!EQ(nxtarg(0), ""));
  159. if(EQ(a, "-z"))
  160. return(EQ(nxtarg(0), ""));
  161. p2 = nxtarg(1);
  162. if (p2==0)
  163. return(!EQ(a,""));
  164. if(EQ(p2, "="))
  165. return(EQ(nxtarg(0), a));
  166. if(EQ(p2, "!="))
  167. return(!EQ(nxtarg(0), a));
  168. if(EQ(p2, "-older"))
  169. return(isolder(nxtarg(0), a));
  170. if(EQ(p2, "-ot"))
  171. return(isolderthan(nxtarg(0), a));
  172. if(EQ(p2, "-nt"))
  173. return(isnewerthan(nxtarg(0), a));
  174. if(!isint(a, &int1))
  175. synbad("unexpected operator/operand: ", p2);
  176. if(nxtintarg(&int2)){
  177. if(EQ(p2, "-eq"))
  178. return(int1==int2);
  179. if(EQ(p2, "-ne"))
  180. return(int1!=int2);
  181. if(EQ(p2, "-gt"))
  182. return(int1>int2);
  183. if(EQ(p2, "-lt"))
  184. return(int1<int2);
  185. if(EQ(p2, "-ge"))
  186. return(int1>=int2);
  187. if(EQ(p2, "-le"))
  188. return(int1<=int2);
  189. }
  190. synbad("unknown operator ",p2);
  191. return 0; /* to shut ken up */
  192. }
  193. int
  194. tio(char *a, int f)
  195. {
  196. return access (a, f) >= 0;
  197. }
  198. /*
  199. * note that the name strings pointed to by Dir members are
  200. * allocated with the Dir itself (by the same call to malloc),
  201. * but are not included in sizeof(Dir), so copying a Dir won't
  202. * copy the strings it points to.
  203. */
  204. int
  205. hasmode(char *f, uint32_t m)
  206. {
  207. int r;
  208. Dir *dir;
  209. dir = dirstat(f);
  210. if (dir == nil)
  211. return 0;
  212. r = (dir->mode & m) != 0;
  213. free(dir);
  214. return r;
  215. }
  216. int
  217. isdir(char *f)
  218. {
  219. return hasmode(f, DMDIR);
  220. }
  221. int
  222. isreg(char *f)
  223. {
  224. int r;
  225. Dir *dir;
  226. dir = dirstat(f);
  227. if (dir == nil)
  228. return 0;
  229. r = (dir->mode & DMDIR) == 0;
  230. free(dir);
  231. return r;
  232. }
  233. int
  234. isatty(int fd)
  235. {
  236. int r;
  237. Dir *d1, *d2;
  238. d1 = dirfstat(fd);
  239. d2 = dirstat("/dev/cons");
  240. if (d1 == nil || d2 == nil)
  241. r = 0;
  242. else
  243. r = d1->type == d2->type && d1->dev == d2->dev &&
  244. d1->qid.path == d2->qid.path;
  245. free(d1);
  246. free(d2);
  247. return r;
  248. }
  249. int
  250. fsizep(char *f)
  251. {
  252. int r;
  253. Dir *dir;
  254. dir = dirstat(f);
  255. if (dir == nil)
  256. return 0;
  257. r = dir->length > 0;
  258. free(dir);
  259. return r;
  260. }
  261. void
  262. synbad(char *s1, char *s2)
  263. {
  264. int len;
  265. write(2, "test: ", 6);
  266. if ((len = strlen(s1)) != 0)
  267. write(2, s1, len);
  268. if ((len = strlen(s2)) != 0)
  269. write(2, s2, len);
  270. write(2, "\n", 1);
  271. exits("bad syntax");
  272. }
  273. int
  274. isint(char *s, int *pans)
  275. {
  276. char *ep;
  277. *pans = strtol(s, &ep, 0);
  278. return (*ep == 0);
  279. }
  280. int
  281. isolder(char *pin, char *f)
  282. {
  283. int r, rel;
  284. uint32_t n, m;
  285. char *p = pin;
  286. Dir *dir;
  287. dir = dirstat(f);
  288. if (dir == nil)
  289. return 0;
  290. /* parse time */
  291. n = 0;
  292. rel = 0;
  293. while(*p){
  294. m = strtoul(p, &p, 0);
  295. switch(*p){
  296. case 0:
  297. n = m;
  298. break;
  299. case 'y':
  300. m *= 12;
  301. /* fall through */
  302. case 'M':
  303. m *= 30;
  304. /* fall through */
  305. case 'd':
  306. m *= 24;
  307. /* fall through */
  308. case 'h':
  309. m *= 60;
  310. /* fall through */
  311. case 'm':
  312. m *= 60;
  313. /* fall through */
  314. case 's':
  315. n += m;
  316. p++;
  317. rel = 1;
  318. break;
  319. default:
  320. synbad("bad time syntax, ", pin);
  321. }
  322. }
  323. if (!rel)
  324. m = n;
  325. else{
  326. m = time(0);
  327. if (n > m) /* before epoch? */
  328. m = 0;
  329. else
  330. m -= n;
  331. }
  332. r = dir->mtime < m;
  333. free(dir);
  334. return r;
  335. }
  336. int
  337. isolderthan(char *a, char *b)
  338. {
  339. int r;
  340. Dir *ad, *bd;
  341. ad = dirstat(a);
  342. bd = dirstat(b);
  343. if (ad == nil || bd == nil)
  344. r = 0;
  345. else
  346. r = ad->mtime > bd->mtime;
  347. free(ad);
  348. free(bd);
  349. return r;
  350. }
  351. int
  352. isnewerthan(char *a, char *b)
  353. {
  354. int r;
  355. Dir *ad, *bd;
  356. ad = dirstat(a);
  357. bd = dirstat(b);
  358. if (ad == nil || bd == nil)
  359. r = 0;
  360. else
  361. r = ad->mtime < bd->mtime;
  362. free(ad);
  363. free(bd);
  364. return r;
  365. }