Subversion Repositories wimsdev

Rev

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