test.c 5.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384
  1. /*
  2. * POSIX standard
  3. * test expression
  4. * [ expression ]
  5. *
  6. * Plan 9 additions:
  7. * -A file exists and is append-only
  8. * -L file exists and is exclusive-use
  9. */
  10. #include <u.h>
  11. #include <libc.h>
  12. #define EQ(a,b) ((tmp=a)==0?0:(strcmp(tmp,b)==0))
  13. int ap;
  14. int ac;
  15. char **av;
  16. char *tmp;
  17. void synbad(char *, char *);
  18. int fsizep(char *);
  19. int isdir(char *);
  20. int isreg(char *);
  21. int isatty(int);
  22. int isint(char *, int *);
  23. int isolder(char *, char *);
  24. int isolderthan(char *, char *);
  25. int isnewerthan(char *, char *);
  26. int hasmode(char *, ulong);
  27. int tio(char *, int);
  28. int e(void), e1(void), e2(void), e3(void);
  29. void
  30. main(int argc, char *argv[])
  31. {
  32. ac = argc; av = argv; ap = 1;
  33. if(EQ(argv[0],"[")) {
  34. if(!EQ(argv[--ac],"]"))
  35. synbad("] missing","");
  36. }
  37. argv[ac] = 0;
  38. if (ac<=1) exits("usage");
  39. exits(e()?0:"false");
  40. }
  41. char *
  42. nxtarg(int mt)
  43. {
  44. if(ap>=ac){
  45. if(mt){
  46. ap++;
  47. return(0);
  48. }
  49. synbad("argument expected","");
  50. }
  51. return(av[ap++]);
  52. }
  53. int
  54. nxtintarg(int *pans)
  55. {
  56. if(ap<ac && isint(av[ap], pans)){
  57. ap++;
  58. return 1;
  59. }
  60. return 0;
  61. }
  62. int
  63. e(void) {
  64. int p1;
  65. p1 = e1();
  66. if (EQ(nxtarg(1), "-o")) return(p1 || e());
  67. ap--;
  68. return(p1);
  69. }
  70. int
  71. e1(void) {
  72. int p1;
  73. p1 = e2();
  74. if (EQ(nxtarg(1), "-a")) return (p1 && e1());
  75. ap--;
  76. return(p1);
  77. }
  78. int
  79. e2(void) {
  80. if (EQ(nxtarg(0), "!"))
  81. return(!e2());
  82. ap--;
  83. return(e3());
  84. }
  85. int
  86. e3(void) {
  87. int p1;
  88. char *a;
  89. char *p2;
  90. int int1, int2;
  91. a = nxtarg(0);
  92. if(EQ(a, "(")) {
  93. p1 = e();
  94. if(!EQ(nxtarg(0), ")")) synbad(") expected","");
  95. return(p1);
  96. }
  97. if(EQ(a, "-A"))
  98. return(hasmode(nxtarg(0), DMAPPEND));
  99. if(EQ(a, "-L"))
  100. return(hasmode(nxtarg(0), DMEXCL));
  101. if(EQ(a, "-f"))
  102. return(isreg(nxtarg(0)));
  103. if(EQ(a, "-d"))
  104. return(isdir(nxtarg(0)));
  105. if(EQ(a, "-r"))
  106. return(tio(nxtarg(0), 4));
  107. if(EQ(a, "-w"))
  108. return(tio(nxtarg(0), 2));
  109. if(EQ(a, "-x"))
  110. return(tio(nxtarg(0), 1));
  111. if(EQ(a, "-e"))
  112. return(tio(nxtarg(0), 0));
  113. if(EQ(a, "-c"))
  114. return(0);
  115. if(EQ(a, "-b"))
  116. return(0);
  117. if(EQ(a, "-u"))
  118. return(0);
  119. if(EQ(a, "-g"))
  120. return(0);
  121. if(EQ(a, "-s"))
  122. return(fsizep(nxtarg(0)));
  123. if(EQ(a, "-t"))
  124. if(ap>=ac || !nxtintarg(&int1))
  125. return(isatty(1));
  126. else
  127. return(isatty(int1));
  128. if(EQ(a, "-n"))
  129. return(!EQ(nxtarg(0), ""));
  130. if(EQ(a, "-z"))
  131. return(EQ(nxtarg(0), ""));
  132. p2 = nxtarg(1);
  133. if (p2==0)
  134. return(!EQ(a,""));
  135. if(EQ(p2, "="))
  136. return(EQ(nxtarg(0), a));
  137. if(EQ(p2, "!="))
  138. return(!EQ(nxtarg(0), a));
  139. if(EQ(p2, "-older"))
  140. return(isolder(nxtarg(0), a));
  141. if(EQ(p2, "-ot"))
  142. return(isolderthan(nxtarg(0), a));
  143. if(EQ(p2, "-nt"))
  144. return(isnewerthan(nxtarg(0), a));
  145. if(!isint(a, &int1))
  146. return(!EQ(a,""));
  147. if(nxtintarg(&int2)){
  148. if(EQ(p2, "-eq"))
  149. return(int1==int2);
  150. if(EQ(p2, "-ne"))
  151. return(int1!=int2);
  152. if(EQ(p2, "-gt"))
  153. return(int1>int2);
  154. if(EQ(p2, "-lt"))
  155. return(int1<int2);
  156. if(EQ(p2, "-ge"))
  157. return(int1>=int2);
  158. if(EQ(p2, "-le"))
  159. return(int1<=int2);
  160. }
  161. synbad("unknown operator ",p2);
  162. return 0; /* to shut ken up */
  163. }
  164. int
  165. tio(char *a, int f)
  166. {
  167. return access (a, f) >= 0;
  168. }
  169. /* copy to local memory; clear names for safety */
  170. int
  171. localstat(char *f, Dir *dir)
  172. {
  173. Dir *d;
  174. d = dirstat(f);
  175. if(d == 0)
  176. return(-1);
  177. *dir = *d;
  178. dir->name = 0;
  179. dir->uid = 0;
  180. dir->gid = 0;
  181. dir->muid = 0;
  182. return 0;
  183. }
  184. /* copy to local memory; clear names for safety */
  185. int
  186. localfstat(int f, Dir *dir)
  187. {
  188. Dir *d;
  189. d = dirfstat(f);
  190. if(d == 0)
  191. return(-1);
  192. *dir = *d;
  193. dir->name = 0;
  194. dir->uid = 0;
  195. dir->gid = 0;
  196. dir->muid = 0;
  197. return 0;
  198. }
  199. int
  200. hasmode(char *f, ulong m)
  201. {
  202. Dir dir;
  203. if(localstat(f,&dir)<0)
  204. return(0);
  205. return(dir.mode&m);
  206. }
  207. int
  208. isdir(char *f)
  209. {
  210. Dir dir;
  211. if(localstat(f,&dir)<0)
  212. return(0);
  213. return(dir.mode&DMDIR);
  214. }
  215. int
  216. isreg(char *f)
  217. {
  218. Dir dir;
  219. if(localstat(f,&dir)<0)
  220. return(0);
  221. return(!(dir.mode&DMDIR));
  222. }
  223. int
  224. isatty(int fd)
  225. {
  226. Dir d1, d2;
  227. if(localfstat(fd, &d1) < 0)
  228. return 0;
  229. if(localstat("/dev/cons", &d2) < 0)
  230. return 0;
  231. return d1.type==d2.type && d1.dev==d2.dev && d1.qid.path==d2.qid.path;
  232. }
  233. int
  234. fsizep(char *f)
  235. {
  236. Dir dir;
  237. if(localstat(f,&dir)<0)
  238. return(0);
  239. return(dir.length>0);
  240. }
  241. void
  242. synbad(char *s1, char *s2)
  243. {
  244. int len;
  245. write(2, "test: ", 6);
  246. if ((len = strlen(s1)) != 0)
  247. write(2, s1, len);
  248. if ((len = strlen(s2)) != 0)
  249. write(2, s2, len);
  250. write(2, "\n", 1);
  251. exits("bad syntax");
  252. }
  253. int
  254. isint(char *s, int *pans)
  255. {
  256. char *ep;
  257. *pans = strtol(s, &ep, 0);
  258. return (*ep == 0);
  259. }
  260. int
  261. isolder(char *pin, char *f)
  262. {
  263. char *p = pin;
  264. ulong n, m;
  265. Dir dir;
  266. if(localstat(f,&dir)<0)
  267. return(0);
  268. /* parse time */
  269. n = 0;
  270. while(*p){
  271. m = strtoul(p, &p, 0);
  272. switch(*p){
  273. case 0:
  274. n = m;
  275. break;
  276. case 'y':
  277. m *= 12;
  278. /* fall through */
  279. case 'M':
  280. m *= 30;
  281. /* fall through */
  282. case 'd':
  283. m *= 24;
  284. /* fall through */
  285. case 'h':
  286. m *= 60;
  287. /* fall through */
  288. case 'm':
  289. m *= 60;
  290. /* fall through */
  291. case 's':
  292. n += m;
  293. p++;
  294. break;
  295. default:
  296. synbad("bad time syntax, ", pin);
  297. }
  298. }
  299. return(dir.mtime+n < time(0));
  300. }
  301. int
  302. isolderthan(char *a, char *b)
  303. {
  304. Dir ad, bd;
  305. if(localstat(a, &ad)<0)
  306. return(0);
  307. if(localstat(b, &bd)<0)
  308. return(0);
  309. return ad.mtime > bd.mtime;
  310. }
  311. int
  312. isnewerthan(char *a, char *b)
  313. {
  314. Dir ad, bd;
  315. if(localstat(a, &ad)<0)
  316. return(0);
  317. if(localstat(b, &bd)<0)
  318. return(0);
  319. return ad.mtime < bd.mtime;
  320. }