Subversion Repositories shark

Rev

Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | RSS feed

/*
 * Project: S.Ha.R.K.
 *
 * Coordinators:
 *   Giorgio Buttazzo    <giorgio@sssup.it>
 *   Paolo Gai           <pj@gandalf.sssup.it>
 *
 * Authors     :
 *   Paolo Gai           <pj@gandalf.sssup.it>
 *   Massimiliano Giorgi <massy@gandalf.sssup.it>
 *   Luca Abeni          <luca@gandalf.sssup.it>
 *   (see the web pages for full authors list)
 *
 * ReTiS Lab (Scuola Superiore S.Anna - Pisa - Italy)
 *
 * http://www.sssup.it
 * http://retis.sssup.it
 * http://shark.sssup.it
 */


/*
 * Copyright (C) 2000 Massimiliano Giorgi
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 * CVS :        $Id: distr.c,v 1.1.1.1 2004-05-24 18:03:44 giacomo Exp $
 */


long t[PREC];
long counter;
long hoops;
long maxv=0;

void d_init(void)
{
  int i;
  hoops=counter=0;
  for (i=0;i<PREC;i++) t[i]=0;
}

void d_insert(long d)
{
  if (d>=MAXX) {
    hoops++;
    if (d>maxv) maxv=d;
    return;
  }

  counter++;
  t[(int)(d/DELTA)]++;
}

void d_dump(FILE *fout)
{
  int i;

  if (counter==0) {
    fprintf(stderr,"nothing to write to the output file\n");
    return;
  }
 
  if (hoops) {
    fprintf(stderr,"%li values to big (max=%li)\n",hoops,maxv);
  }
 
  for (i=0;i<PREC;i++)
    fprintf(fout,"%f %f\n",
            DELTA/2.0+DELTA*i,
            (double)t[i]/(double)counter
            );
}