/haiku/src/add-ons/kernel/file_systems/ext2/ |
H A D | crc_table.cpp | 24 ulong crc, poly; local 31 sscanf(argv[1], "%lo", &poly); 32 if (poly & 0xffff0000) { 37 printf("//! CRC 0%o table, as generated by crc_table.cpp\n", poly); 45 crc = (crc >> 1) ^ poly;
|
/haiku/src/add-ons/kernel/file_systems/shared/ |
H A D | crc_table.cpp | 21 ulong crc, poly; local 28 sscanf(argv[1], "%lo", &poly); 29 if (poly & 0xffff0000) { 34 printf("//! CRC 0%o table, as generated by crc_table.cpp\n", poly); 42 crc = (crc << 1) ^ poly;
|
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | crc_table.cpp | 43 uint32 crc, poly; local 49 sscanf(argv[1], "%lo", &poly); 50 printf("//! CRC 0%o table, as generated by crc_table.cpp\n", poly); 56 crc = (crc << 1) ^ poly;
|
/haiku/src/system/libroot/posix/musl/math/ |
H A D | log2f_data.h | 16 double poly[LOG2F_POLY_ORDER]; member in struct:log2f_data
|
H A D | logf_data.h | 17 double poly[LOGF_POLY_ORDER - 1]; /* First order coefficient is 1. */ member in struct:logf_data
|
H A D | pow_data.h | 15 double poly[POW_LOG_POLY_ORDER - 1]; /* First coefficient is 1. */ member in struct:pow_log_data
|
H A D | powf_data.h | 23 double poly[POWF_LOG2_POLY_ORDER]; member in struct:powf_log2_data
|
H A D | exp2f_data.h | 17 double poly[EXP2F_POLY_ORDER]; member in struct:exp2f_data
|
H A D | exp_data.h | 20 double poly[4]; /* Last four coefficients. */ member in struct:exp_data
|
H A D | log2_data.h | 16 double poly[LOG2_POLY_ORDER - 1]; member in struct:log2_data
|
H A D | log_data.h | 16 double poly[LOG_POLY_ORDER - 1]; /* First coefficient is 1. */ member in struct:log_data
|
H A D | exp.c | 19 #define C2 __exp_data.poly[5 - EXP_POLY_ORDER] 20 #define C3 __exp_data.poly[6 - EXP_POLY_ORDER] 21 #define C4 __exp_data.poly[7 - EXP_POLY_ORDER] 22 #define C5 __exp_data.poly[8 - EXP_POLY_ORDER] 126 /* Worst case error is less than 0.5+1.11/N+(abs poly error * 2^53) ulp. */
|
H A D | exp2f_data.c | 27 .poly = {
|
H A D | log2f_data.c | 29 .poly = {
|
H A D | logf_data.c | 30 .poly = {
|
H A D | pow.c | 21 #define A __pow_log_data.poly 111 #define C2 __exp_data.poly[5 - EXP_POLY_ORDER] 112 #define C3 __exp_data.poly[6 - EXP_POLY_ORDER] 113 #define C4 __exp_data.poly[7 - EXP_POLY_ORDER] 114 #define C5 __exp_data.poly[8 - EXP_POLY_ORDER] 115 #define C6 __exp_data.poly[9 - EXP_POLY_ORDER] 223 /* Worst case error is less than 0.5+1.11/N+(abs poly error * 2^53) ulp. */
|
H A D | exp2f.c | 25 #define C __exp2f_data.poly
|
H A D | log2f.c | 23 #define A __log2f_data.poly
|
H A D | logf.c | 22 #define A __logf_data.poly
|
H A D | powf_data.c | 29 .poly = {
|
H A D | powf.c | 24 #define A __powf_log2_data.poly 82 #define C __exp2f_data.poly
|
H A D | exp_data.c | 25 .poly = {
|
H A D | log.c | 16 #define A __log_data.poly 106 0.5 + 4.13/N + abs-poly-error*2^57 ULP (+ 0.002 ULP without fma) 108 0.5 + 2.06/N + abs-poly-error*2^56 ULP (+ 0.001 ULP without fma). */
|
H A D | log2.c | 16 #define A __log2_data.poly 113 /* log2(r+1) = r/ln2 + r^2*poly(r). */ 118 ~ 0.5 + 2/N/ln2 + abs-poly-error*0x1p56 ULP (+ 0.003 ULP without fma). */
|
/haiku/headers/libs/agg/ |
H A D | agg_path_storage.h | 784 poly_plain_adaptor<T> poly(data, num_points, closed); 785 concat_path(poly); 794 poly_plain_adaptor<T> poly(data, num_points, closed); 795 join_path(poly);
|