File Manager

X7ROOT File Manager

Current Path: /opt/alt/php71/usr/include/php/ext/standard

opt / alt / php71 / usr / include / php / ext / standard /

ðŸ“ ..
ðŸ“„ base64.h(1.56 KB)
ðŸ“„ basic_functions.h(7.55 KB)
ðŸ“„ crc32.h(4.78 KB)
ðŸ“„ credits.h(1.69 KB)
ðŸ“„ credits_ext.h(5.39 KB)
ðŸ“„ credits_sapi.h(851 B)
ðŸ“„ crypt_blowfish.h(1.02 KB)
ðŸ“„ crypt_freesec.h(665 B)
ðŸ“„ css.h(1.21 KB)
ðŸ“„ cyr_convert.h(1.24 KB)
ðŸ“„ datetime.h(1.35 KB)
ðŸ“„ dl.h(1.55 KB)
ðŸ“„ exec.h(1.69 KB)
ðŸ“„ file.h(4.71 KB)
ðŸ“„ flock_compat.h(2.07 KB)
ðŸ“„ fsock.h(1.57 KB)
ðŸ“„ head.h(1.8 KB)
ðŸ“„ html.h(2.65 KB)
ðŸ“„ html_tables.h(472.42 KB)
ðŸ“„ info.h(22.61 KB)
ðŸ“„ md5.h(2.11 KB)
ðŸ“„ microtime.h(1.33 KB)
ðŸ“„ pack.h(1.25 KB)
ðŸ“„ pageinfo.h(1.43 KB)
ðŸ“„ php_array.h(4.38 KB)
ðŸ“„ php_assert.h(1.4 KB)
ðŸ“„ php_browscap.h(1.3 KB)
ðŸ“„ php_crypt.h(1.62 KB)
ðŸ“„ php_crypt_r.h(2 KB)
ðŸ“„ php_dir.h(1.67 KB)
ðŸ“„ php_dns.h(2.93 KB)
ðŸ“„ php_ext_syslog.h(1.47 KB)
ðŸ“„ php_filestat.h(3.15 KB)
ðŸ“„ php_fopen_wrappers.h(1.93 KB)
ðŸ“„ php_ftok.h(1.23 KB)
ðŸ“„ php_http.h(1.75 KB)
ðŸ“„ php_image.h(2.38 KB)
ðŸ“„ php_incomplete_class.h(2.25 KB)
ðŸ“„ php_iptc.h(1.24 KB)
ðŸ“„ php_lcg.h(1.5 KB)
ðŸ“„ php_link.h(1.34 KB)
ðŸ“„ php_mail.h(1.36 KB)
ðŸ“„ php_math.h(4.66 KB)
ðŸ“„ php_metaphone.h(1.21 KB)
ðŸ“„ php_mt_rand.h(1.97 KB)
ðŸ“„ php_password.h(1.58 KB)
ðŸ“„ php_rand.h(3.25 KB)
ðŸ“„ php_random.h(2.12 KB)
ðŸ“„ php_smart_string.h(5.17 KB)
ðŸ“„ php_smart_string_public.h(1.37 KB)
ðŸ“„ php_standard.h(2.3 KB)
ðŸ“„ php_string.h(5.96 KB)
ðŸ“„ php_type.h(1.6 KB)
ðŸ“„ php_uuencode.h(1.46 KB)
ðŸ“„ php_var.h(3.26 KB)
ðŸ“„ php_versioning.h(1.37 KB)
ðŸ“„ proc_open.h(1.75 KB)
ðŸ“„ quot_print.h(1.46 KB)
ðŸ“„ scanf.h(2.25 KB)
ðŸ“„ sha1.h(1.7 KB)
ðŸ“„ streamsfuncs.h(2.78 KB)
ðŸ“„ uniqid.h(1.24 KB)
ðŸ“„ url.h(2.34 KB)
ðŸ“„ url_scanner_ex.h(2.45 KB)
ðŸ“„ winver.h(6.23 KB)

Editing: php_rand.h

/*
   +----------------------------------------------------------------------+
   | PHP Version 7                                                        |
   +----------------------------------------------------------------------+
   | Copyright (c) 1997-2018 The PHP Group                                |
   +----------------------------------------------------------------------+
   | This source file is subject to version 3.01 of the PHP license,      |
   | that is bundled with this package in the file LICENSE, and is        |
   | available through the world-wide-web at the following url:           |
   | http://www.php.net/license/3_01.txt                                  |
   | If you did not receive a copy of the PHP license and are unable to   |
   | obtain it through the world-wide-web, please send a note to          |
   | license@php.net so we can mail you a copy immediately.               |
   +----------------------------------------------------------------------+
   | Authors: Rasmus Lerdorf <rasmus@php.net>                             |
   |          Zeev Suraski <zeev@zend.com>                                |
   |          Pedro Melo <melo@ip.pt>                                     |
   |          Sterling Hughes <sterling@php.net>                          |
   |                                                                      |
   | Based on code from: Shawn Cokus <Cokus@math.washington.edu>          |
   +----------------------------------------------------------------------+
 */
/* $Id$ */

#ifndef PHP_RAND_H
#define	PHP_RAND_H

#include "php_lcg.h"
#include "php_mt_rand.h"

/* System Rand functions */
#ifndef RAND_MAX
#define RAND_MAX PHP_MT_RAND_MAX
#endif

#define PHP_RAND_MAX PHP_MT_RAND_MAX

/*
 * A bit of tricky math here.  We want to avoid using a modulus because
 * that simply tosses the high-order bits and might skew the distribution
 * of random values over the range.  Instead we map the range directly.
 *
 * We need to map the range from 0...M evenly to the range a...b
 * Let n = the random number and n' = the mapped random number
 *
 * Then we have: n' = a + n(b-a)/M
 *
 * We have a problem here in that only n==M will get mapped to b which
 # means the chances of getting b is much much less than getting any of
 # the other values in the range.  We can fix this by increasing our range
 # artificially and using:
 #
 #               n' = a + n(b-a+1)/M
 *
 # Now we only have a problem if n==M which would cause us to produce a
 # number of b+1 which would be bad.  So we bump M up by one to make sure
 # this will never happen, and the final algorithm looks like this:
 #
 #               n' = a + n(b-a+1)/(M+1)
 *
 * -RL
 */
#define RAND_RANGE_BADSCALING(__n, __min, __max, __tmax) \
	(__n) = (__min) + (zend_long) ((double) ( (double) (__max) - (__min) + 1.0) * ((__n) / ((__tmax) + 1.0)))

#define RAND_RANGE(__n, __min, __max, __tmax) \
	(__n) = php_mt_rand_range((__min), (__max))

#ifdef PHP_WIN32
#define GENERATE_SEED() (((zend_long) (time(0) * GetCurrentProcessId())) ^ ((zend_long) (1000000.0 * php_combined_lcg())))
#else
#define GENERATE_SEED() (((zend_long) (time(0) * getpid())) ^ ((zend_long) (1000000.0 * php_combined_lcg())))
#endif

PHPAPI void php_srand(zend_long seed);
PHPAPI zend_long php_rand(void);

#endif	/* PHP_RAND_H */

X7ROOT File Manager

Editing: php_rand.h

Upload File

Create Folder