Subversion Repositories wimsdev

Rev

Rev 8254 | Rev 11124 | 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. /* This is an internal program,
  19.  * used to show statistics of frequentation, module by module.
  20. */
  21.  
  22. #include "../Lib/libwims.h"
  23. #include "../wimsdef.h"
  24.  
  25. #define MAX_SCORE      512*1024
  26.  
  27. typedef struct {
  28.     short int dure,score;
  29.     long int next;
  30. } statscoredata;
  31. statscoredata scores[MAX_SCORE];
  32. int sccnt=0;
  33.  
  34. typedef struct {
  35.     int newcnt,scorecnt,lasttime,firstscore,lastscore;
  36.     char lastnew[12];
  37. } statexodata;
  38. statexodata shdata[MAX_SHEETS*MAX_EXOS],examdata[MAX_EXAMS*MAX_EXOS];
  39.  
  40. /* cid: combined index of difficulty */
  41. double scsum, scavg, scdeviat, scmin, scmax, cid;
  42. double dursum, duravg, durdeviat, durmin, durmax;
  43. double best[10];
  44. int filecnt=0, fcind;
  45. char *dirbase, *sdata, user[256];
  46.  
  47. int str2time(char *p)
  48. {
  49.     int sec,min,hr;
  50.     sec=atoi(p+15); p[14]=0;
  51.     min=atoi(p+12); p[11]=0;
  52.     hr=atoi(p+9);
  53.     if(sec<0 || min<0 || hr<0 || sec>59 || min>59 || hr>23) return -1;
  54.     return hr*3600+min*60+sec;
  55. }
  56.  
  57. void oneline(char *p, char *typ)
  58. {
  59.     int i, sh, ex, t;
  60.     char *data[64];
  61.     statexodata *tab;
  62.     char *pp, *pe;
  63.     for(i=0, pp=find_word_start(p); i<9  && *pp; pp=find_word_start(pe),i++) {
  64.       pe=find_word_end(pp); if(*pe) *pe++=0;
  65.       data[i]=pp;
  66.     }
  67.     if(i<6) return;
  68.     sh=atoi(data[2]); ex=atoi(data[3]);
  69.     if(sh<=0 || ex<=0 || ex>MAX_EXOS || strlen(data[1])>10) return;
  70.     if(data[0][0]=='E') {
  71.       tab=examdata; data[0]++; if(sh>MAX_EXAMS) return;
  72.     }
  73.     else {
  74.       tab=shdata; if(sh>MAX_SHEETS) return;
  75.     }
  76.     tab+=(sh-1)*MAX_EXOS+(ex-1);
  77.     t=str2time(data[0]); if(t==-1) return;
  78.     if(strstr(data[4],"new")!=NULL) {
  79.       if(strcmp(typ,"score")==0 &&
  80.         ((i > 6 && strcmp(data[6],"noscore")==0) || (i > 7 && strcmp(data[7],"noscore")==0)
  81.             || (i > 8 && strcmp(data[8],"noscore")==0))){ return; }
  82.       if(strcmp(typ,"noscore")==0 &&
  83.         (i < 7 || ( i>7 && strcmp(data[7],typ)!=0)
  84.             || (i > 8 && strcmp(data[8], typ)!=0)
  85.         )) { return; }
  86.       snprintf(tab->lastnew,12,"%s",data[1]);
  87.       tab->newcnt++; tab->lasttime=t;
  88.       fcind++;
  89.       return;
  90.     }
  91.     if(strcmp(data[4],"score")==0) {
  92.       if(strcmp(tab->lastnew,data[1])!=0) return;
  93.       if(sccnt>=MAX_SCORE) return;
  94.       if(tab->lasttime==-1) return;
  95.       if(strcmp(typ,"score")==0 && (
  96.          (i > 7 && strcmp(data[7],"noscore")==0)
  97.             || (i > 8 && strcmp(data[8],"noscore")==0))
  98.         ) { return; }
  99.       if(strcmp(typ,"noscore")==0 && (
  100.         ( i < 7 || ( i > 7 && strcmp(data[7],"noscore")!=0)
  101.             || (i > 8 && strcmp(data[8], typ)!=0))
  102.              )){ return; }
  103.       t-=tab->lasttime; tab->lasttime=-1; if(t<0) t+=24*3600;
  104.       if(t<0) t=0; if(t>5*3600) t=5*3600;
  105.       scores[sccnt].dure=t; scores[sccnt].next=-1;
  106.       scores[sccnt].score=(double) atof(data[5])*100+0.5;
  107.       if(tab->scorecnt>0) scores[tab->lastscore].next=sccnt;
  108.       else tab->firstscore=sccnt;
  109.       tab->lastscore=sccnt; sccnt++; tab->scorecnt++;
  110.     }
  111. }
  112.  
  113. void onefile(char *fname, char *typ)
  114. {
  115.     FILE *f;
  116.     char *buf, *pp, *pe;
  117.     long int l;
  118.     f=fopen(fname,"r"); if(f==NULL) return;
  119.     fseek(f,0,SEEK_END); l=ftell(f); fseek(f,0,SEEK_SET);
  120.     if(l<=0) {fclose(f); return;}
  121.     buf=xmalloc(l+16); (void)fread(buf,1,l,f); fclose(f); buf[l]=0;
  122.     fcind=0;
  123.     for(pp=buf; pp; pp=pe) {
  124.       pe=strchr(pp,'\n'); if(pe!=NULL) *pe++=0;
  125.       oneline(pp,typ);
  126.     }
  127.     free(buf);
  128.     if(fcind>0) filecnt++;
  129. }
  130.  
  131. void onedir_ (char buf[MAX_LINELEN+1], char *typ)
  132. {
  133.   char buf2[MAX_LINELEN+1];
  134.   DIR *dir;
  135.   struct dirent *ff;
  136.   dir=opendir(buf); if(dir==NULL) return;
  137.       while((ff=readdir(dir))!=NULL) {
  138.           if(!isalnum(ff->d_name[0]) ||
  139.              strcmp(ff->d_name,"supervisor")==0) continue;
  140.           snprintf(buf2,sizeof(buf2),"%s/%s",buf,ff->d_name);
  141.           onefile(buf2,typ);
  142.       }
  143.       closedir(dir);
  144. }
  145.  
  146. void onedir(char *dirname)
  147. {
  148.     char buf[MAX_LINELEN+1];
  149.     char *t1, *t2, types[256];
  150.     snprintf(types,sizeof(types),"%s",sdata);
  151.     for(t1=find_word_start(types); *t1; t1=find_word_start(t2)) {
  152.       t2=find_word_end(t1); if(*t2) *t2++=0;
  153.       snprintf(buf,sizeof(buf),"%s/%s/score",dirbase,dirname);
  154.       onedir_(buf,t1);
  155.       snprintf(buf,sizeof(buf),"%s/%s/noscore",dirbase,dirname);
  156.       onedir_(buf,t1);
  157.     }
  158. }
  159.  
  160. void oneuser(char *dirname, char fname[64])
  161. {
  162.     char buf[MAX_LINELEN+1], buf2[MAX_LINELEN+1];
  163.     char *t1, *t2, types[256];
  164.     snprintf(types,sizeof(types),"%s",sdata);
  165.     for(t1=find_word_start(types); *t1; t1=find_word_start(t2)) {
  166.       t2=find_word_end(t1); if(*t2) *t2++=0;
  167.       snprintf(buf,sizeof(buf),"%s/%s/score/%s",dirbase,dirname,fname);
  168.       onefile(buf,t1);
  169.       snprintf(buf2,sizeof(buf),"%s/%s/noscore/%s",dirbase,dirname,fname);
  170.       onefile(buf2,t1);
  171.     }
  172. }
  173.  
  174. void multiuser(char *dirname, char *user)
  175. {
  176.    char buf[MAX_LINELEN+1];
  177.    char *u1, *u2;
  178.    snprintf(buf,sizeof(buf),"%s",user);
  179.    for(u1=find_word_start(buf); *u1; u1=find_word_start(u2)) {
  180.       u2=find_word_end(u1); if(*u2) *u2++=0;
  181.       oneuser(dirname, u1);
  182.   }
  183. }
  184.  
  185. void stati(statexodata *dat)
  186. {
  187.     int i,j;
  188.     double s,d;
  189.  
  190.     scsum=scavg=scdeviat=dursum=duravg=durdeviat=cid=0;
  191.     scmin=10; scmax=0; durmin=24*3600; durmax=0;
  192.     {int k; for(k=0; k<10; k++) best[k]=0 ;}
  193.     for(i=0,j=dat->firstscore; i<dat->scorecnt; i++) {
  194.       s=(double) scores[j].score/100; d=(double) scores[j].dure/60;
  195.       scsum+=s; dursum+=d;
  196.       if(scmin>s) scmin=s; if(scmax<s) scmax=s;
  197.       if(durmin>d) durmin=d; if(durmax<d) durmax=d;
  198.       {
  199.        int k, l = 0;
  200.        for (k = 0; k < 10; k++) if (best[k] < best[l]) l = k;
  201.        if (best[l] < s) best[l] = s;
  202.       }
  203.       j=scores[j].next;
  204.     }
  205.     if(i<=0) {scmin=durmin=0; return;}
  206.     scavg=scsum/i; duravg=dursum/i;
  207.     if(scsum>1) cid=min(4*sqrt(dursum*dat->newcnt)/scsum,99);
  208.     else cid=0;
  209.     if(i>=2) {
  210.       for(i=0,j=dat->firstscore; i<dat->scorecnt; i++) {
  211.           s=(double) scores[j].score/100; d=(double) scores[j].dure/60;
  212.           scdeviat+=(s-scavg)*(s-scavg); durdeviat+=(d-duravg)*(d-duravg);
  213.           j=scores[j].next;
  214.       }
  215.       scdeviat=sqrt(scdeviat/i); durdeviat=sqrt(durdeviat/i);
  216.     }
  217. }
  218.  
  219. /* Output line format:
  220.  * type sh exo newcnt scorecnt scsum dursum scavg duravg scmin durmin scmax durmax scdeviat durdeviat cid
  221.  */
  222.  
  223. void  outsheetexo (int i, int flag)
  224. {
  225.   if(shdata[i].newcnt<=0) return;
  226.   stati(shdata+i);
  227.   switch(flag) {
  228.      case 0: printf(":S %2d %2d %4d %4d \
  229. %4.0f %4.0f %5.2f %5.2f \
  230. %5.2f %4.1f %5.2f %5.1f \
  231. %5.2f %5.2f %4.1f\n",
  232.              i/MAX_EXOS+1,i%MAX_EXOS+1,
  233.              shdata[i].newcnt, shdata[i].scorecnt,
  234.              scsum, dursum,
  235.              scavg, duravg,
  236.              scmin,durmin,scmax,durmax,
  237.              scdeviat, durdeviat,
  238.              cid); break;
  239.      case 1: printf("%d_%d=%d,%d,\
  240. %.0f,%.0f,%.2f,%.2f,\
  241. %.2f,%.1f,%.2f,%.1f,\
  242. %.2f,%.2f,%.1f;",
  243.              i/MAX_EXOS+1,i%MAX_EXOS+1,
  244.              shdata[i].newcnt, shdata[i].scorecnt,
  245.              scsum, dursum,
  246.              scavg, duravg,
  247.              scmin,durmin,scmax,durmax,
  248.              scdeviat, durdeviat,
  249.              cid);
  250.             int k; for (k=0; k<10; k++) printf("%.2f,", best[k]);
  251.             printf("\n");
  252.             break;
  253.    }
  254. }
  255.  
  256. void outexamexo (int i)
  257. {
  258.    if(examdata[i].newcnt<=0) return;
  259.       stati(examdata+i);
  260.       printf(":E %2d %2d %4d %4d \
  261. %4.0f %4.0f %5.2f %5.2f \
  262. %5.2f %4.1f %5.2f %5.1f \
  263. %5.2f %5.2f %4.1f\n",
  264.              i/MAX_EXOS+1,i%MAX_EXOS+1,
  265.              examdata[i].newcnt, examdata[i].scorecnt,
  266.              scsum, dursum,
  267.              scavg, duravg,
  268.              scmin,durmin,scmax,durmax,
  269.              scdeviat, durdeviat,
  270.              cid);
  271. }
  272.  
  273. void output(void)
  274. {
  275.     int i;
  276.     for(i=0;i<MAX_SHEETS*MAX_EXOS;i++) { outsheetexo(i, 0);}
  277.     for(i=0;i<MAX_EXAMS*MAX_EXOS;i++) { outexamexo(i);}
  278. }
  279.  
  280. int main()
  281. {
  282.     char cla[MAX_LINELEN+1], user[256];
  283.     char *c1, *c2;
  284.     char *cdata, *udata, *sh;
  285.  
  286.     memset(shdata,0,sizeof(shdata)); memset(examdata,0,sizeof(examdata));
  287.     dirbase=getenv("exostat_dirbase");
  288.     if(dirbase==NULL || *dirbase==0) dirbase="../log/classes";
  289.     sdata=getenv("exostat_types");
  290.     if(sdata==NULL || *sdata==0) sdata="score noscore";
  291.     cdata=getenv("exostat_classes");
  292.     if(cdata==NULL || *cdata==0) cdata=getenv("w_wims_class");
  293.     if(cdata==NULL || *cdata==0) return -1;
  294.     snprintf(cla,sizeof(cla),"%s",cdata);
  295.     udata=getenv("exostat_user");
  296.     if(udata==NULL || *udata==0) {
  297.      for(c1=cla; *c1; c1++) if(!isalnum(*c1) && *c1!='/') *c1=' ';
  298.      for(c1=find_word_start(cla); *c1; c1=find_word_start(c2)) {
  299.        c2=find_word_end(c1); if(*c2) *c2++=0;
  300.        onedir(c1);
  301.       }
  302.        output();
  303.     } else {
  304.       snprintf(user,sizeof(user),"%s",udata);
  305.       multiuser(cla, user);
  306.       sh=getenv("exostat_sheet");
  307.       if( sh==NULL || *sh==0 ) { output(); }
  308.       else {
  309.          int s=atoi(sh);
  310.          s=(s-1)*MAX_EXOS;
  311.          int i;
  312.          for(i=s;i < s + MAX_EXOS;i++) {
  313.          outsheetexo(i, 1);
  314.          }
  315.        };
  316.     }
  317.     return 0;
  318. }
  319.