Subversion Repositories wimsdev

Rev

Rev 12248 | 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. /* same in Interfaces/common.c and wlogdaccessfile */
  48. static
  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;
  61.     return;
  62.   }
  63.   switch(*type) {
  64.     case 'a':
  65.     case 'w': {
  66.       l=strlen(content); fwrite(content,1,l,f); break;
  67.     }
  68.     case 'r': {
  69.       l=fread(content,1,MAX_LINELEN-1,f);
  70.       if(l>0 && l<MAX_LINELEN) content[l]=0;
  71.       else content[0]=0;
  72.       break;
  73.     }
  74.    default: {
  75.       content[0]=0; break;
  76.    }
  77.   }
  78.   fclose(f);
  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. static
  96. void oneline(char *p)
  97. {
  98.   char tbuf[8], sbuf[8], ubuf[32], cbuf[64];
  99.   char *p1, *p2;
  100.   int i,t,cl;
  101.   memmove(tbuf,p+9,6); tbuf[2]=tbuf[5]=0;
  102.   t=atoi(tbuf)*60+atoi(tbuf+3);
  103.   memmove(sbuf,p+18,4); sbuf[4]=0;
  104.   p1=strchr(p,','); if(p1==NULL) return;
  105.   if(!isdigit(*(p1+1))) return;
  106.   snprintf(cbuf,sizeof(cbuf),"%s",p1+1);
  107.   for(p2=cbuf;isdigit(*p2); p2++){};
  108.   *p2=0; cl=atoi(cbuf);
  109.   *p1=0; for(p1--;p1>p && !isspace(*(p1-1)); p1--);
  110.   snprintf(ubuf,sizeof(ubuf),"%s",p1);
  111.   for(i=0;i<sescnt;i++) {
  112.     if(cl==ses[i].cl && memcmp(sbuf,ses[i].s,4)==0 &&
  113.         ses[i].end>=t-MAX_LAPSE) {
  114.       ses[i].end=t; return;
  115.     }
  116.   }
  117.   if(sescnt>=MAX_SESSIONS) return;
  118.   memmove(ses[sescnt].s,sbuf,4); ses[sescnt].cl=cl;
  119.   ses[sescnt].start=ses[sescnt].end=t;
  120.   snprintf(ses[sescnt].u,sizeof(ses[sescnt].u),"%s",ubuf);
  121.   sescnt++;
  122. }
  123.  
  124. void onefile(char *fname)
  125. {
  126.   FILE *f;
  127.   long l;
  128.   char *fbuf, *p1, *p2, *p3;
  129.   l=filelength(fname); if(l<=0) return;
  130.   f=fopen(fname,"r"); if(f==NULL) return;
  131.   fbuf=xmalloc(l+16); (void)fread(fbuf,1,l,f); fclose(f); fbuf[l]=0;
  132.   for(p1=fbuf; *p1; p1=p2) {
  133.   p2=strchr(p1,'\n'); if(p2==NULL) p2=p1+strlen(p1); else *p2++=0;
  134.   p3=strchr(p1,','); if(p3==NULL) continue;
  135.   if(strncmp(p1,datestr,8)!=0) continue;
  136.   oneline(p1);
  137.   }
  138. }
  139.  
  140. void classaccount(void)
  141. {
  142.   int i,j;
  143.   clscnt=0;
  144.   for(i=0;i<sescnt;i++) {
  145.   ses[i].cnt=ses[i].end-ses[i].start+MIN_ADD;
  146.   if(ses[i].cnt<MIN_CONNECT) ses[i].cnt=MIN_CONNECT;
  147.   for(j=0;j<clscnt && ses[i].cl!=cls[j].cl;j++);
  148.   if(j<clscnt) cls[j].cnt+=ses[i].cnt;
  149.   else
  150.     if(clscnt<MAX_CLASSES) {
  151.       cls[clscnt].cl=ses[i].cl;
  152.       cls[clscnt].cnt=ses[i].cnt;
  153.       clscnt++;
  154.     }
  155.   }
  156. }
  157.  
  158. int clscmp(const void *c1, const void *c2)
  159. {
  160.   struct cls *cl1, *cl2;
  161.   cl1=(struct cls *) c1; cl2=(struct cls *) c2;
  162.   return cl1->cl-cl2->cl;
  163. }
  164.  
  165. void output(void)
  166. {
  167.   char *p, buf[1024], dbuf[1024];
  168.   int i,t;
  169.   p=getenv("ccsum_outdir"); if(p==NULL || *p==0) return;
  170.   for(i=0;i<sescnt;i++) {
  171.     snprintf(dbuf,sizeof(dbuf),"%s/%d",p,ses[i].cl);
  172.     mkdirs2(dbuf);
  173.     snprintf(buf,sizeof(buf),"%s.%02d:%02d %d\n",
  174.        datestr,ses[i].start/60,ses[i].start%60,ses[i].cnt);
  175.     accessfile(buf,"a","%s/%s",dbuf,ses[i].u);
  176.   }
  177.   snprintf(dbuf,sizeof(dbuf),"%s/bydate/%.4s",p,datestr);
  178.   mkdirs2(dbuf);
  179.   snprintf(dbuf+strlen(dbuf),sizeof(dbuf)-strlen(dbuf),"/%.2s",datestr+4);
  180.   t=0;
  181.   qsort(cls,clscnt,sizeof(cls[0]),clscmp);
  182.   for(i=0;i<clscnt;i++) {
  183.     snprintf(buf,sizeof(buf),"%s %d\n",datestr,cls[i].cnt);
  184.     accessfile(buf,"a","%s/%d/.total",p,cls[i].cl);
  185.     snprintf(buf,sizeof(buf),"%s %d %d\n",datestr+4,cls[i].cl,cls[i].cnt);
  186.     accessfile(buf,"a","%s",dbuf);
  187.     t+=cls[i].cnt;
  188.   }
  189.   snprintf(buf,sizeof(buf),"%s %d %d\n",datestr,t,(t+30)/60);
  190.   accessfile(buf,"a","%s/done",p);
  191. }
  192.  
  193. int main(int argc, char *argv[])
  194. {
  195.   sescnt=0;
  196.   if(argc<2) return 1;
  197.   datestr=getenv("ccsum_date");
  198.   if(datestr==NULL || strlen(datestr)!=8) return 2;
  199.   onefile(argv[1]);
  200.   classaccount();
  201.   output();
  202.   return 0;
  203. }
  204.  
  205.