cron.c 11 KB

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