HomeSort by relevance Sort by last modified time
    Searched refs:HASHFRACTION (Results 1 - 3 of 3) sorted by null

  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/sys/
gmon.h 70 * The value of HASHFRACTION is based on the minimum number of bytes
73 * HASHFRACTION is calculated as:
75 * HASHFRACTION = MIN_SUBR_SEPARATION / (2 * sizeof(short) - 1);
82 * which is separated by only three bytes, thus HASHFRACTION is
85 * HASHFRACTION = 3 / (2 * 2 - 1) = 1
91 * distance. Hence, we will define HASHFRACTION to be 2 across all
96 #define HASHFRACTION 2
169 u_long hashfraction; member in struct:gmonparam
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/sys/
gmon.h 70 * The value of HASHFRACTION is based on the minimum number of bytes
73 * HASHFRACTION is calculated as:
75 * HASHFRACTION = MIN_SUBR_SEPARATION / (2 * sizeof(short) - 1);
82 * which is separated by only three bytes, thus HASHFRACTION is
85 * HASHFRACTION = 3 / (2 * 2 - 1) = 1
91 * distance. Hence, we will define HASHFRACTION to be 2 across all
96 #define HASHFRACTION 2
169 u_long hashfraction; member in struct:gmonparam
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/sys/
gmon.h 70 * The value of HASHFRACTION is based on the minimum number of bytes
73 * HASHFRACTION is calculated as:
75 * HASHFRACTION = MIN_SUBR_SEPARATION / (2 * sizeof(short) - 1);
82 * which is separated by only three bytes, thus HASHFRACTION is
85 * HASHFRACTION = 3 / (2 * 2 - 1) = 1
91 * distance. Hence, we will define HASHFRACTION to be 2 across all
96 #define HASHFRACTION 2
169 u_long hashfraction; member in struct:gmonparam

Completed in 447 milliseconds