Subversion Repositories wimsdev

Rev

Rev 8149 | Rev 8879 | 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 "../Lib/libwims.h"
  21.  
  22. /* The maximal number of sessions within one day */
  23. #define MAX_SESSIONS (128*1024)
  24. /* The maximal number of classes within one day */
  25. #define MAX_CLASSES 8192
  26. /* At least these minutes will be counted for each session */
  27. #define MIN_CONNECT 2
  28. /* Add this number of minutes to each session */
  29. #define MIN_ADD 1
  30. /* Accounting discontinues after this number of idle minutes */
  31. #define MAX_LAPSE 15
  32.  
  33. struct {
  34.     char s[4], u[32];
  35.     int cl, start, end, cnt;
  36. } ses[MAX_SESSIONS];
  37. int sescnt;
  38.  
  39. char *datestr;
  40.  
  41. struct cls {
  42.     int cl, cnt;
  43. } cls[MAX_CLASSES];
  44. int clscnt;
  45.  
  46. /* Read/write to a file with variable parms to print filename */
  47. void accessfile(char *content, char *type, char *s,...)
  48. {
  49.     va_list vp;
  50.     char buf[MAX_LINELEN+1];
  51.     FILE *f;
  52.     int l;
  53.  
  54.     va_start(vp,s);
  55.     vsnprintf(buf,sizeof(buf),s,vp);
  56.     va_end(vp);
  57.     f=fopen(buf,type); if(f==NULL) {
  58.     if(*type=='r') content[0]=0; return;
  59.     }
  60.     switch(*type) {
  61.     case 'a':
  62.     case 'w': {
  63.         l=strlen(content); fwrite(content,1,l,f); break;
  64.     }
  65.     case 'r': {
  66.         l=fread(content,1,MAX_LINELEN-1,f);
  67.         if(l>0 && l<MAX_LINELEN) content[l]=0;
  68.         else content[0]=0;
  69.         break;
  70.     }
  71.     default: {
  72.         content[0]=0; break;
  73.     }
  74.     }
  75.     fclose(f);
  76. }
  77.  
  78. /* recursively generate a directory structure */
  79. void mkdirs2(char *s)
  80. {
  81.     struct stat st;
  82.     char *buf;
  83.     if(stat(s,&st)==-1) {
  84.     if(strrchr(s,'/')!=NULL) {
  85.         buf=xmalloc(strlen(s)+1);
  86.         ovlstrcpy(buf,s); *strrchr(buf,'/')=0;
  87.         mkdirs2(buf); free(buf);
  88.     }
  89.     mkdir(s,-1);
  90.     }
  91. }
  92.  
  93. void oneline(char *p)
  94. {
  95.     char tbuf[8], sbuf[8], ubuf[256], cbuf[64];
  96.     char *p1, *p2;
  97.     int i,t,cl;
  98.     memmove(tbuf,p+9,6); tbuf[2]=tbuf[5]=0;
  99.     t=atoi(tbuf)*60+atoi(tbuf+3);
  100.     memmove(sbuf,p+18,4); sbuf[4]=0;
  101.     p1=strchr(p,','); if(p1==NULL) return;
  102.     if(!isdigit(*(p1+1))) return;
  103.     snprintf(cbuf,sizeof(cbuf),"%s",p1+1);
  104.     for(p2=cbuf;isdigit(*p2); p2++){};
  105.     *p2=0; cl=atoi(cbuf);
  106.     *p1=0; for(p1--;p1>p && !isspace(*(p1-1)); p1--);
  107.     snprintf(ubuf,sizeof(ubuf),"%s",p1);
  108.     for(i=0;i<sescnt;i++) {
  109.     if(cl==ses[i].cl && memcmp(sbuf,ses[i].s,4)==0 &&
  110.        ses[i].end>=t-MAX_LAPSE) {
  111.         ses[i].end=t; return;
  112.     }
  113.     }
  114.     if(sescnt>=MAX_SESSIONS) return;
  115.     memmove(ses[sescnt].s,sbuf,4); ses[sescnt].cl=cl;
  116.     ses[sescnt].start=ses[sescnt].end=t;
  117.     snprintf(ses[sescnt].u,sizeof(ses[sescnt].u),"%s",ubuf);
  118.     sescnt++;
  119. }
  120.  
  121. void onefile(char *fname)
  122. {
  123.     FILE *f;
  124.     long l;
  125.     char *fbuf, *p1, *p2, *p3;
  126.     l=filelength(fname); if(l<=0) return;
  127.     f=fopen(fname,"r"); if(f==NULL) return;
  128.     fbuf=xmalloc(l+16); (void)fread(fbuf,1,l,f); fclose(f); fbuf[l]=0;
  129.     for(p1=fbuf; *p1; p1=p2) {
  130.     p2=strchr(p1,'\n'); if(p2==NULL) p2=p1+strlen(p1); else *p2++=0;
  131.     p3=strchr(p1,','); if(p3==NULL) continue;
  132.     if(strncmp(p1,datestr,8)!=0) continue;
  133.     oneline(p1);
  134.     }
  135. }
  136.  
  137. void classaccount(void)
  138. {
  139.     int i,j;
  140.     clscnt=0;
  141.     for(i=0;i<sescnt;i++) {
  142.     ses[i].cnt=ses[i].end-ses[i].start+MIN_ADD;
  143.     if(ses[i].cnt<MIN_CONNECT) ses[i].cnt=MIN_CONNECT;
  144.     for(j=0;j<clscnt && ses[i].cl!=cls[j].cl;j++);
  145.     if(j<clscnt) cls[j].cnt+=ses[i].cnt;
  146.     else if(clscnt<MAX_CLASSES) {
  147.         cls[clscnt].cl=ses[i].cl;
  148.         cls[clscnt].cnt=ses[i].cnt;
  149.         clscnt++;
  150.     }
  151.     }
  152. }
  153.  
  154. int clscmp(const void *c1, const void *c2)
  155. {
  156.     struct cls *cl1, *cl2;
  157.     cl1=(struct cls *) c1; cl2=(struct cls *) c2;
  158.     return cl1->cl-cl2->cl;
  159. }
  160.  
  161. void output(void)
  162. {
  163.     char *p, buf[1024], dbuf[1024];
  164.     int i,t;
  165.     p=getenv("ccsum_outdir"); if(p==NULL || *p==0) return;
  166.     for(i=0;i<sescnt;i++) {
  167.     snprintf(dbuf,sizeof(dbuf),"%s/%d",p,ses[i].cl);
  168.     mkdirs2(dbuf);
  169.     snprintf(buf,sizeof(buf),"%s.%02d:%02d %d\n",
  170.          datestr,ses[i].start/60,ses[i].start%60,ses[i].cnt);
  171.     accessfile(buf,"a","%s/%s",dbuf,ses[i].u);
  172.     }
  173.     snprintf(dbuf,sizeof(dbuf),"%s/bydate/%.4s",p,datestr);
  174.     mkdirs2(dbuf);
  175.     snprintf(dbuf+strlen(dbuf),sizeof(dbuf)-strlen(dbuf),"/%.2s",datestr+4);
  176.     t=0;
  177.     qsort(cls,clscnt,sizeof(cls[0]),clscmp);
  178.     for(i=0;i<clscnt;i++) {
  179.     snprintf(buf,sizeof(buf),"%s %d\n",datestr,cls[i].cnt);
  180.     accessfile(buf,"a","%s/%d/.total",p,cls[i].cl);
  181.     snprintf(buf,sizeof(buf),"%s %d %d\n",datestr+4,cls[i].cl,cls[i].cnt);
  182.     accessfile(buf,"a","%s",dbuf);
  183.     t+=cls[i].cnt;
  184.     }
  185.     snprintf(buf,sizeof(buf),"%s %d %d\n",datestr,t,(t+30)/60);
  186.     accessfile(buf,"a","%s/done",p);
  187. }
  188.  
  189. int main(int argc, char *argv[])
  190. {
  191.     sescnt=0;
  192.     if(argc<2) return 1;
  193.     datestr=getenv("ccsum_date");
  194.     if(datestr==NULL || strlen(datestr)!=8) return 2;
  195.     onefile(argv[1]);
  196.     classaccount();
  197.     output();
  198.     return 0;
  199. }
  200.  
  201.