Return to ranf.c CVS log

Up to [CSRG BSD Unix] / 43BSDTahoe / games / trek

Annotation of 43BSDTahoe/games/trek/ranf.c, revision 1.1.1.1

1.1       root        1: /*
                      2:  * Copyright (c) 1980 Regents of the University of California.
                      3:  * All rights reserved.
                      4:  *
                      5:  * Redistribution and use in source and binary forms are permitted
                      6:  * provided that the above copyright notice and this paragraph are
                      7:  * duplicated in all such forms and that any documentation,
                      8:  * advertising materials, and other materials related to such
                      9:  * distribution and use acknowledge that the software was developed
                     10:  * by the University of California, Berkeley.  The name of the
                     11:  * University may not be used to endorse or promote products derived
                     12:  * from this software without specific prior written permission.
                     13:  * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
                     14:  * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
                     15:  * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
                     16:  */
                     17: 
                     18: #ifndef lint
                     19: static char sccsid[] = "@(#)ranf.c     5.3 (Berkeley) 6/18/88";
                     20: #endif /* not lint */
                     21: 
                     22: # include      <stdio.h>
                     23: 
                     24: ranf(max)
                     25: int    max;
                     26: {
                     27:        register int    t;
                     28: 
                     29:        if (max <= 0)
                     30:                return (0);
                     31:        t = rand() >> 5;
                     32:        return (t % max);
                     33: }
                     34: 
                     35: 
                     36: double franf()
                     37: {
                     38:        double          t;
                     39:        t = rand() & 077777;
                     40:        return (t / 32767.0);
                     41: }

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.