cron.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627
  1. #include <u.h>
  2. #include <libc.h>
  3. #include <bio.h>
  4. #include <libsec.h>
  5. #include <auth.h>
  6. #include "authcmdlib.h"
  7. char CRONLOG[] = "cron";
  8. typedef struct Job Job;
  9. typedef struct Time Time;
  10. typedef struct User User;
  11. struct Time{ /* bit masks for each valid time */
  12. ulong min; /* actually 1 bit for every 2 min */
  13. ulong hour;
  14. ulong mday;
  15. ulong wday;
  16. ulong mon;
  17. };
  18. struct Job{
  19. char *host; /* where ... */
  20. Time time; /* when ... */
  21. char *cmd; /* and what to execute */
  22. Job *next;
  23. };
  24. struct User{
  25. Qid lastqid; /* of last read /cron/user/cron */
  26. char *name; /* who ... */
  27. Job *jobs; /* wants to execute these jobs */
  28. };
  29. User *users;
  30. int nuser;
  31. int maxuser;
  32. char *savec;
  33. char *savetok;
  34. int tok;
  35. int debug;
  36. ulong lexval;
  37. void rexec(User*, Job*);
  38. void readalljobs(void);
  39. Job *readjobs(char*, User*);
  40. int getname(char**);
  41. ulong gettime(int, int);
  42. int gettok(int, int);
  43. void initcap(void);
  44. void pushtok(void);
  45. void usage(void);
  46. void freejobs(Job*);
  47. User *newuser(char*);
  48. void *emalloc(ulong);
  49. void *erealloc(void*, ulong);
  50. int myauth(int, char*);
  51. void createuser(void);
  52. int mkcmd(char*, char*, int);
  53. void printjobs(void);
  54. int qidcmp(Qid, Qid);
  55. int becomeuser(char*);
  56. void
  57. main(int argc, char *argv[])
  58. {
  59. Job *j;
  60. Tm tm;
  61. Time t;
  62. ulong now, last, x;
  63. int i;
  64. debug = 0;
  65. ARGBEGIN{
  66. case 'c':
  67. createuser();
  68. exits(0);
  69. case 'd':
  70. debug = 1;
  71. break;
  72. default:
  73. usage();
  74. }ARGEND
  75. USED(argc, argv);
  76. if(debug){
  77. readalljobs();
  78. printjobs();
  79. exits(0);
  80. }
  81. initcap();
  82. switch(fork()){
  83. case -1:
  84. error("can't fork");
  85. case 0:
  86. break;
  87. default:
  88. exits(0);
  89. }
  90. argv0 = "cron";
  91. srand(getpid()*time(0));
  92. last = time(0) / 60;
  93. for(;;){
  94. readalljobs();
  95. now = time(0) / 60;
  96. if ((now-last) > (60*60*24)) /* don't go mad */
  97. last = now-(60*60*24);
  98. for(; last <= now; last += 2){
  99. tm = *localtime(last*60);
  100. t.min = 1 << tm.min/2;
  101. t.hour = 1 << tm.hour;
  102. t.wday = 1 << tm.wday;
  103. t.mday = 1 << tm.mday;
  104. t.mon = 1 << (tm.mon + 1);
  105. for(i = 0; i < nuser; i++)
  106. for(j = users[i].jobs; j; j = j->next)
  107. if(j->time.min & t.min && j->time.hour & t.hour
  108. && j->time.wday & t.wday
  109. && j->time.mday & t.mday
  110. && j->time.mon & t.mon)
  111. rexec(&users[i], j);
  112. }
  113. x = time(0) / 60;
  114. if(x - now < 2)
  115. sleep((2 - (x - now))*60*1000);
  116. }
  117. exits(0);
  118. }
  119. void
  120. createuser(void)
  121. {
  122. Dir d;
  123. char file[128], *user;
  124. int fd;
  125. user = getuser();
  126. sprint(file, "/cron/%s", user);
  127. fd = create(file, OREAD, 0755|DMDIR);
  128. if(fd < 0)
  129. sysfatal("couldn't create %s: %r", file);
  130. nulldir(&d);
  131. d.gid = user;
  132. dirfwstat(fd, &d);
  133. close(fd);
  134. sprint(file, "/cron/%s/cron", user);
  135. fd = create(file, OREAD, 0644);
  136. if(fd < 0)
  137. sysfatal("couldn't create %s: %r", file);
  138. nulldir(&d);
  139. d.gid = user;
  140. dirfwstat(fd, &d);
  141. close(fd);
  142. }
  143. void
  144. readalljobs(void)
  145. {
  146. User *u;
  147. Dir *d, *du;
  148. char file[128];
  149. int i, n, fd;
  150. fd = open("/cron", OREAD);
  151. if(fd < 0)
  152. error("can't open /cron\n");
  153. while((n = dirread(fd, &d)) > 0){
  154. for(i = 0; i < n; i++){
  155. if(strcmp(d[i].name, "log") == 0)
  156. continue;
  157. if(strcmp(d[i].name, d[i].uid) != 0){
  158. syslog(1, CRONLOG, "cron for %s owned by %s\n", d[i].name, d[i].uid);
  159. continue;
  160. }
  161. u = newuser(d[i].name);
  162. sprint(file, "/cron/%s/cron", d[i].name);
  163. du = dirstat(file);
  164. if(du == nil || qidcmp(u->lastqid, du->qid) != 0){
  165. freejobs(u->jobs);
  166. u->jobs = readjobs(file, u);
  167. }
  168. free(du);
  169. }
  170. free(d);
  171. }
  172. close(fd);
  173. }
  174. /*
  175. * parse user's cron file
  176. * other lines: minute hour monthday month weekday host command
  177. */
  178. Job *
  179. readjobs(char *file, User *user)
  180. {
  181. Biobuf *b;
  182. Job *j, *jobs;
  183. Dir *d;
  184. int line;
  185. d = dirstat(file);
  186. if(!d)
  187. return nil;
  188. b = Bopen(file, OREAD);
  189. if(!b){
  190. free(d);
  191. return nil;
  192. }
  193. jobs = nil;
  194. user->lastqid = d->qid;
  195. free(d);
  196. for(line = 1; savec = Brdline(b, '\n'); line++){
  197. savec[Blinelen(b) - 1] = '\0';
  198. while(*savec == ' ' || *savec == '\t')
  199. savec++;
  200. if(*savec == '#' || *savec == '\0')
  201. continue;
  202. if(strlen(savec) > 1024){
  203. syslog(0, CRONLOG, "%s: line %d: line too long", user->name, line);
  204. continue;
  205. }
  206. j = emalloc(sizeof *j);
  207. if((j->time.min = gettime(0, 59))
  208. && (j->time.hour = gettime(0, 23))
  209. && (j->time.mday = gettime(1, 31))
  210. && (j->time.mon = gettime(1, 12))
  211. && (j->time.wday = gettime(0, 6))
  212. && getname(&j->host)){
  213. j->cmd = emalloc(strlen(savec) + 1);
  214. strcpy(j->cmd, savec);
  215. j->next = jobs;
  216. jobs = j;
  217. }else{
  218. syslog(0, CRONLOG, "%s: line %d: syntax error", user->name, line);
  219. free(j);
  220. }
  221. }
  222. Bterm(b);
  223. return jobs;
  224. }
  225. void
  226. printjobs(void)
  227. {
  228. char buf[8*1024];
  229. Job *j;
  230. int i;
  231. for(i = 0; i < nuser; i++){
  232. print("user %s\n", users[i].name);
  233. for(j = users[i].jobs; j; j = j->next){
  234. if(!mkcmd(j->cmd, buf, sizeof buf))
  235. print("\tbad job %s on host %s\n", j->cmd, j->host);
  236. else
  237. print("\tjob %s on host %s\n", buf, j->host);
  238. }
  239. }
  240. }
  241. User *
  242. newuser(char *name)
  243. {
  244. int i;
  245. for(i = 0; i < nuser; i++)
  246. if(strcmp(users[i].name, name) == 0)
  247. return &users[i];
  248. if(nuser == maxuser){
  249. maxuser += 32;
  250. users = erealloc(users, maxuser * sizeof *users);
  251. }
  252. memset(&users[nuser], 0, sizeof(users[nuser]));
  253. users[nuser].name = strdup(name);
  254. users[nuser].jobs = 0;
  255. users[nuser].lastqid.type = QTFILE;
  256. users[nuser].lastqid.path = ~0LL;
  257. users[nuser].lastqid.vers = ~0L;
  258. return &users[nuser++];
  259. }
  260. void
  261. freejobs(Job *j)
  262. {
  263. Job *next;
  264. for(; j; j = next){
  265. next = j->next;
  266. free(j->cmd);
  267. free(j->host);
  268. free(j);
  269. }
  270. }
  271. int
  272. getname(char **namep)
  273. {
  274. int c;
  275. char buf[64], *p;
  276. if(!savec)
  277. return 0;
  278. while(*savec == ' ' || *savec == '\t')
  279. savec++;
  280. for(p = buf; (c = *savec) && c != ' ' && c != '\t'; p++){
  281. if(p >= buf+sizeof buf -1)
  282. return 0;
  283. *p = *savec++;
  284. }
  285. *p = '\0';
  286. *namep = strdup(buf);
  287. if(*namep == 0){
  288. syslog(0, CRONLOG, "internal error: strdup failure");
  289. _exits(0);
  290. }
  291. while(*savec == ' ' || *savec == '\t')
  292. savec++;
  293. return p > buf;
  294. }
  295. /*
  296. * return the next time range in the file:
  297. * times: '*'
  298. * | range
  299. * range: number
  300. * | number '-' number
  301. * | range ',' range
  302. * a return of zero means a syntax error was discovered
  303. */
  304. ulong
  305. gettime(int min, int max)
  306. {
  307. ulong n, m, e;
  308. if(gettok(min, max) == '*')
  309. return ~0;
  310. n = 0;
  311. while(tok == '1'){
  312. m = 1 << lexval;
  313. n |= m;
  314. if(gettok(0, 0) == '-'){
  315. if(gettok(lexval, max) != '1')
  316. return 0;
  317. e = 1 << lexval;
  318. for( ; m <= e; m <<= 1)
  319. n |= m;
  320. gettok(min, max);
  321. }
  322. if(tok != ',')
  323. break;
  324. if(gettok(min, max) != '1')
  325. return 0;
  326. }
  327. pushtok();
  328. return n;
  329. }
  330. void
  331. pushtok(void)
  332. {
  333. savec = savetok;
  334. }
  335. int
  336. gettok(int min, int max)
  337. {
  338. char c;
  339. savetok = savec;
  340. if(!savec)
  341. return tok = 0;
  342. while((c = *savec) == ' ' || c == '\t')
  343. savec++;
  344. switch(c){
  345. case '0': case '1': case '2': case '3': case '4':
  346. case '5': case '6': case '7': case '8': case '9':
  347. lexval = strtoul(savec, &savec, 10);
  348. if(lexval < min || lexval > max)
  349. return tok = 0;
  350. if(max > 32)
  351. lexval /= 2; /* yuk: correct min by / 2 */
  352. return tok = '1';
  353. case '*': case '-': case ',':
  354. savec++;
  355. return tok = c;
  356. default:
  357. return tok = 0;
  358. }
  359. }
  360. int
  361. call(char *host)
  362. {
  363. char *na, *p;
  364. na = netmkaddr(host, 0, "rexexec");
  365. p = utfrune(na, L'!');
  366. if(!p)
  367. return -1;
  368. p = utfrune(p+1, L'!');
  369. if(!p)
  370. return -1;
  371. if(strcmp(p, "!rexexec") != 0)
  372. return -2;
  373. return dial(na, 0, 0, 0);
  374. }
  375. /*
  376. * convert command to run properly on the remote machine
  377. * need to escape the quotes wo they don't get stripped
  378. */
  379. int
  380. mkcmd(char *cmd, char *buf, int len)
  381. {
  382. char *p;
  383. int n, m;
  384. n = sizeof "exec rc -c '" -1;
  385. if(n >= len)
  386. return 0;
  387. strcpy(buf, "exec rc -c '");
  388. while(p = utfrune(cmd, L'\'')){
  389. p++;
  390. m = p - cmd;
  391. if(n + m + 1 >= len)
  392. return 0;
  393. strncpy(&buf[n], cmd, m);
  394. n += m;
  395. buf[n++] = '\'';
  396. cmd = p;
  397. }
  398. m = strlen(cmd);
  399. if(n + m + sizeof "'</dev/null>/dev/null>[2=1]" >= len)
  400. return 0;
  401. strcpy(&buf[n], cmd);
  402. strcpy(&buf[n+m], "'</dev/null>/dev/null>[2=1]");
  403. return 1;
  404. }
  405. void
  406. rexec(User *user, Job *j)
  407. {
  408. char buf[8*1024];
  409. int n, fd;
  410. AuthInfo *ai;
  411. switch(rfork(RFPROC|RFNOWAIT|RFNAMEG|RFENVG|RFFDG)){
  412. case 0:
  413. break;
  414. case -1:
  415. syslog(0, CRONLOG, "can't fork a job for %s: %r\n", user->name);
  416. default:
  417. return;
  418. }
  419. if(!mkcmd(j->cmd, buf, sizeof buf)){
  420. syslog(0, CRONLOG, "internal error: cmd buffer overflow");
  421. _exits(0);
  422. }
  423. /*
  424. * remote call, auth, cmd with no i/o
  425. * give it 2 min to complete
  426. */
  427. if(strcmp(j->host, "local") == 0){
  428. if(becomeuser(user->name) < 0){
  429. syslog(0, CRONLOG, "%s: can't change uid for %s on %s: %r", user->name, j->cmd, j->host);
  430. _exits(0);
  431. }
  432. syslog(0, CRONLOG, "%s: ran '%s' on %s", user->name, j->cmd, j->host);
  433. execl("/bin/rc", "rc", "-c", buf, nil);
  434. syslog(0, CRONLOG, "%s: exec failed for %s on %s: %r",
  435. user->name, j->cmd, j->host);
  436. _exits(0);
  437. }
  438. alarm(2*60*1000);
  439. fd = call(j->host);
  440. if(fd < 0){
  441. if(fd == -2){
  442. syslog(0, CRONLOG, "%s: dangerous host %s", user->name, j->host);
  443. }
  444. syslog(0, CRONLOG, "%s: can't call %s: %r", user->name, j->host);
  445. _exits(0);
  446. }
  447. syslog(0, CRONLOG, "%s: called %s on %s", user->name, j->cmd, j->host);
  448. if(becomeuser(user->name) < 0){
  449. syslog(0, CRONLOG, "%s: can't change uid for %s on %s: %r", user->name, j->cmd, j->host);
  450. _exits(0);
  451. }
  452. ai = auth_proxy(fd, nil, "proto=p9any role=client");
  453. if(ai == nil){
  454. syslog(0, CRONLOG, "%s: can't authenticate for %s on %s: %r", user->name, j->cmd, j->host);
  455. _exits(0);
  456. }
  457. syslog(0, CRONLOG, "%s: authenticated %s on %s", user->name, j->cmd, j->host);
  458. write(fd, buf, strlen(buf)+1);
  459. write(fd, buf, 0);
  460. while((n = read(fd, buf, sizeof(buf)-1)) > 0){
  461. buf[n] = 0;
  462. syslog(0, CRONLOG, "%s: %s\n", j->cmd, buf);
  463. }
  464. _exits(0);
  465. }
  466. void *
  467. emalloc(ulong n)
  468. {
  469. void *p;
  470. if(p = mallocz(n, 1))
  471. return p;
  472. error("out of memory");
  473. return 0;
  474. }
  475. void *
  476. erealloc(void *p, ulong n)
  477. {
  478. if(p = realloc(p, n))
  479. return p;
  480. error("out of memory");
  481. return 0;
  482. }
  483. void
  484. usage(void)
  485. {
  486. fprint(2, "usage: cron [-c]\n");
  487. exits("usage");
  488. }
  489. int
  490. qidcmp(Qid a, Qid b)
  491. {
  492. /* might be useful to know if a > b, but not for cron */
  493. return(a.path != b.path || a.vers != b.vers);
  494. }
  495. void
  496. memrandom(void *p, int n)
  497. {
  498. uchar *cp;
  499. for(cp = (uchar*)p; n > 0; n--)
  500. *cp++ = fastrand();
  501. }
  502. /*
  503. * keep caphash fd open since opens of it could be disabled
  504. */
  505. static int caphashfd;
  506. void
  507. initcap(void)
  508. {
  509. caphashfd = open("#¤/caphash", OWRITE);
  510. if(caphashfd < 0)
  511. fprint(2, "%s: opening #¤/caphash: %r", argv0);
  512. }
  513. /*
  514. * create a change uid capability
  515. */
  516. char*
  517. mkcap(char *from, char *to)
  518. {
  519. uchar rand[20];
  520. char *cap;
  521. char *key;
  522. int nfrom, nto;
  523. uchar hash[SHA1dlen];
  524. if(caphashfd < 0)
  525. return nil;
  526. /* create the capability */
  527. nto = strlen(to);
  528. nfrom = strlen(from);
  529. cap = emalloc(nfrom+1+nto+1+sizeof(rand)*3+1);
  530. sprint(cap, "%s@%s", from, to);
  531. memrandom(rand, sizeof(rand));
  532. key = cap+nfrom+1+nto+1;
  533. enc64(key, sizeof(rand)*3, rand, sizeof(rand));
  534. /* hash the capability */
  535. hmac_sha1((uchar*)cap, strlen(cap), (uchar*)key, strlen(key), hash, nil);
  536. /* give the kernel the hash */
  537. key[-1] = '@';
  538. if(write(caphashfd, hash, SHA1dlen) < 0){
  539. free(cap);
  540. return nil;
  541. }
  542. return cap;
  543. }
  544. int
  545. usecap(char *cap)
  546. {
  547. int fd, rv;
  548. fd = open("#¤/capuse", OWRITE);
  549. if(fd < 0)
  550. return -1;
  551. rv = write(fd, cap, strlen(cap));
  552. close(fd);
  553. return rv;
  554. }
  555. int
  556. becomeuser(char *new)
  557. {
  558. char *cap;
  559. int rv;
  560. cap = mkcap(getuser(), new);
  561. if(cap == nil)
  562. return -1;
  563. rv = usecap(cap);
  564. free(cap);
  565. newns(new, nil);
  566. return rv;
  567. }