Subversion Repositories wimsdev

Rev

Rev 3718 | Rev 7079 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | RSS feed

  1. /*    Copyright (C) 1998-2003 XIAO, Gang of Universite de Nice - Sophia Antipolis
  2.  *
  3.  *  This program is free software; you can redistribute it and/or modify
  4.  *  it under the terms of the GNU General Public License as published by
  5.  *  the Free Software Foundation; either version 2 of the License, or
  6.  *  (at your option) any later version.
  7.  *
  8.  *  This program is distributed in the hope that it will be useful,
  9.  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  10.  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  11.  *  GNU General Public License for more details.
  12.  *
  13.  *  You should have received a copy of the GNU General Public License
  14.  *  along with this program; if not, write to the Free Software
  15.  *  Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  16.  */
  17.  
  18.         /* Computes class connection count (unit: student-minutes) */
  19.  
  20. #include "../wimsdef.h"
  21. #include "../includes.h"
  22. #include "../Lib/basicstr.c"
  23.  
  24.         /* The maximal number of sessions within one day */
  25. #define MAX_SESSIONS (128*1024)
  26.         /* The maximal number of classes within one day */
  27. #define MAX_CLASSES 8192
  28.         /* At least these minutes will be counted for each session */
  29. #define MIN_CONNECT 2
  30.         /* Add this number of minutes to each session */
  31. #define MIN_ADD 1
  32.         /* Accounting discontinues after this number of idle minutes */
  33. #define MAX_LAPSE 15
  34.  
  35. struct {
  36.     char s[4], u[32];
  37.     int cl, start, end, cnt;
  38. } ses[MAX_SESSIONS];
  39. int sescnt;
  40.  
  41. char *datestr;
  42.  
  43. struct cls {
  44.     int cl, cnt;
  45. } cls[MAX_CLASSES];
  46. int clscnt;
  47.  
  48. void *xmalloc(size_t n)
  49. {
  50.     void *p;
  51.     p=malloc(n);
  52.     if(p==NULL) {
  53.         fprintf(stderr,"Malloc failure."); exit(1);
  54.     }
  55.     return p;
  56. }
  57.  
  58.         /* Points to the end of the word */
  59. char *find_word_end(char *p)
  60. {
  61.     int i;
  62.     for(i=0;!isspace(*p) && *p!=0 && i<MAX_LINELEN; p++,i++);
  63.     return p;
  64. }
  65.  
  66.         /* Strips leading spaces */
  67. char *find_word_start(char *p)
  68. {
  69.     int i;
  70.     for(i=0; isspace(*p) && i<MAX_LINELEN; p++,i++);
  71.     return p;
  72. }
  73.  
  74.         /* Read/write to a file with variable parms to print filename */
  75. void accessfile(char *content, char *type, char *s,...)
  76. {
  77.     va_list vp;
  78.     char buf[MAX_LINELEN+1];
  79.     FILE *f;
  80.     int l;
  81.  
  82.     va_start(vp,s);
  83.     vsnprintf(buf,sizeof(buf),s,vp);
  84.     va_end(vp);
  85.     f=fopen(buf,type); if(f==NULL) {
  86.         if(*type=='r') content[0]=0; return;
  87.     }
  88.     switch(*type) {
  89.         case 'a':
  90.         case 'w': {
  91.             l=strlen(content); fwrite(content,1,l,f); break;
  92.         }
  93.         case 'r': {
  94.             l=fread(content,1,MAX_LINELEN-1,f);
  95.             if(l>0 && l<MAX_LINELEN) content[l]=0;
  96.             else content[0]=0;
  97.             break;
  98.         }
  99.         default: {
  100.             content[0]=0; break;
  101.         }
  102.     }
  103.     fclose(f);
  104. }
  105.  
  106.         /* returns -1 if error */
  107. long int filelength(char *fn,...)
  108. {
  109.     char buf[4096];
  110.     va_list vp;
  111.     struct stat st;
  112.     int l;
  113.    
  114.     va_start(vp,fn);
  115.     vsnprintf(buf,sizeof(buf),fn,vp); va_end(vp);
  116.     l=stat(buf,&st); if(l) return -1;
  117.     return st.st_size;
  118. }
  119.  
  120.         /* recursively generate a directory structure */
  121. void mkdirs(char *s)
  122. {
  123.     struct stat st;
  124.     char *buf;
  125.     if(stat(s,&st)==-1) {
  126.         if(strrchr(s,'/')!=NULL) {
  127.             buf=xmalloc(strlen(s)+1);
  128.             ovlstrcpy(buf,s); *strrchr(buf,'/')=0;
  129.             mkdirs(buf); free(buf);
  130.         }
  131.         mkdir(s,-1);
  132.     }
  133. }
  134.  
  135. void oneline(char *p)
  136. {
  137.     char tbuf[8], sbuf[8], ubuf[256], cbuf[64];
  138.     char *p1, *p2;
  139.     int i,t,cl;
  140.     memmove(tbuf,p+9,6); tbuf[2]=tbuf[5]=0;
  141.     t=atoi(tbuf)*60+atoi(tbuf+3);
  142.     memmove(sbuf,p+18,4); sbuf[4]=0;
  143.     p1=strchr(p,','); if(p1==NULL) return;
  144.     if(!isdigit(*(p1+1))) return;
  145.     snprintf(cbuf,sizeof(cbuf),"%s",p1+1);
  146.     for(p2=cbuf;isdigit(*p2); p2++); *p2=0; cl=atoi(cbuf);
  147.     *p1=0; for(p1--;p1>p && !isspace(*(p1-1)); p1--);
  148.     snprintf(ubuf,sizeof(ubuf),"%s",p1);
  149.     for(i=0;i<sescnt;i++) {
  150.         if(cl==ses[i].cl && memcmp(sbuf,ses[i].s,4)==0 &&
  151.            ses[i].end>=t-MAX_LAPSE) {
  152.             ses[i].end=t; return;
  153.         }
  154.     }
  155.     if(sescnt>=MAX_SESSIONS) return;
  156.     memmove(ses[sescnt].s,sbuf,4); ses[sescnt].cl=cl;
  157.     ses[sescnt].start=ses[sescnt].end=t;
  158.     snprintf(ses[sescnt].u,sizeof(ses[sescnt].u),"%s",ubuf);
  159.     sescnt++;
  160. }
  161.  
  162. void onefile(char *fname)
  163. {
  164.     FILE *f;
  165.     long l;
  166.     char *fbuf, *p1, *p2, *p3;
  167.     l=filelength(fname); if(l<=0) return;
  168.     f=fopen(fname,"r"); if(f==NULL) return;
  169.     fbuf=xmalloc(l+16); (void)fread(fbuf,1,l,f); fclose(f); fbuf[l]=0;
  170.     for(p1=fbuf; *p1; p1=p2) {
  171.         p2=strchr(p1,'\n'); if(p2==NULL) p2=p1+strlen(p1); else *p2++=0;
  172.         p3=strchr(p1,','); if(p3==NULL) continue;
  173.         if(strncmp(p1,datestr,8)!=0) continue;
  174.         oneline(p1);
  175.     }
  176. }
  177.  
  178. void classaccount(void)
  179. {
  180.     int i,j;
  181.     clscnt=0;
  182.     for(i=0;i<sescnt;i++) {
  183.         ses[i].cnt=ses[i].end-ses[i].start+MIN_ADD;
  184.         if(ses[i].cnt<MIN_CONNECT) ses[i].cnt=MIN_CONNECT;
  185.         for(j=0;j<clscnt && ses[i].cl!=cls[j].cl;j++);
  186.         if(j<clscnt) cls[j].cnt+=ses[i].cnt;
  187.         else if(clscnt<MAX_CLASSES) {
  188.             cls[clscnt].cl=ses[i].cl;
  189.             cls[clscnt].cnt=ses[i].cnt;
  190.             clscnt++;
  191.         }
  192.     }
  193. }
  194.  
  195. int clscmp(const void *c1, const void *c2)
  196. {
  197.     struct cls *cl1, *cl2;
  198.     cl1=(struct cls *) c1; cl2=(struct cls *) c2;
  199.     return cl1->cl-cl2->cl;
  200. }
  201.  
  202. void output(void)
  203. {
  204.     char *p, buf[1024], dbuf[1024];
  205.     int i,t;
  206.     p=getenv("ccsum_outdir"); if(p==NULL || *p==0) return;
  207.     for(i=0;i<sescnt;i++) {
  208.         snprintf(dbuf,sizeof(dbuf),"%s/%d",p,ses[i].cl);
  209.         mkdirs(dbuf);
  210.         snprintf(buf,sizeof(buf),"%s.%02d:%02d %d\n",
  211.                  datestr,ses[i].start/60,ses[i].start%60,ses[i].cnt);
  212.         accessfile(buf,"a","%s/%s",dbuf,ses[i].u);
  213.     }
  214.     snprintf(dbuf,sizeof(dbuf),"%s/bydate/%.4s",p,datestr);
  215.     mkdirs(dbuf);
  216.     snprintf(dbuf+strlen(dbuf),sizeof(dbuf)-strlen(dbuf),"/%.2s",datestr+4);
  217.     t=0;
  218.     qsort(cls,clscnt,sizeof(cls[0]),clscmp);
  219.     for(i=0;i<clscnt;i++) {
  220.         snprintf(buf,sizeof(buf),"%s %d\n",datestr,cls[i].cnt);
  221.         accessfile(buf,"a","%s/%d/.total",p,cls[i].cl);
  222.         snprintf(buf,sizeof(buf),"%s %d %d\n",datestr+4,cls[i].cl,cls[i].cnt);
  223.         accessfile(buf,"a","%s",dbuf);
  224.         t+=cls[i].cnt;
  225.     }
  226.     snprintf(buf,sizeof(buf),"%s %d %d\n",datestr,t,(t+30)/60);
  227.     accessfile(buf,"a","%s/done",p);
  228. }
  229.  
  230. int main(int argc, char *argv[])
  231. {
  232.     sescnt=0;
  233.     if(argc<2) return 1;
  234.     datestr=getenv("ccsum_date");
  235.     if(datestr==NULL || strlen(datestr)!=8) return 2;
  236.     onefile(argv[1]);
  237.     classaccount();
  238.     output();
  239.     return 0;
  240. }
  241.  
  242.