Subversion Repositories wimsdev

Rev

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