1. 05 1月, 2013 4 次提交
  2. 02 1月, 2013 4 次提交
    • R
      add some new-ish IPPROTO constants that were missing · 5d893e50
      Rich Felker 提交于
      5d893e50
    • S
      math: bessel cleanup (jn.c and jnf.c) · 5652d700
      Szabolcs Nagy 提交于
      both jn and yn functions had integer overflow issues for large
      and small n
      
      to handle these issues nm1 (== |n|-1) is used instead of n and -n
      in the code and some loops are changed to make sure the iteration
      counter does not overflow
      
      (another solution could be to use larger integer type or even double
      but that has more size and runtime cost, on x87 loading int64_t or
      even uint32_t into an fpu register is more than two times slower than
      loading int32_t, and using double for n slows down iteration logic)
      
      yn(-1,0) now returns inf
      
      posix2008 specifies that on overflow and at +-0 all y0,y1,yn functions
      return -inf, this is not consistent with math when n<0 odd integer in yn
      (eg. when x->0, yn(-1,x)->inf, but historically yn(-1,0) seems to be
      special cased and returned -inf)
      
      some threshold values in jnf and ynf were fixed that seems to be
      incorrectly copy-pasted from the double version
      5652d700
    • S
      math: bessel cleanup (j1.c and j1f.c) · 5bb6b249
      Szabolcs Nagy 提交于
      a common code path in j1 and y1 was factored out so the resulting
      object code is a bit smaller
      
      unsigned int arithmetics is used for bit manipulation
      
      j1(-inf) now returns 0 instead of -0
      
      an incorrect threshold in the common code of j1f and y1f got fixed
      (this caused spurious overflow and underflow exceptions)
      
      the else branch in pone and pzero functions are fixed
      (so code analyzers dont warn about uninitialized values)
      5bb6b249
    • S
      math: bessel cleanup (j0.c and j0f.c) · 697acde6
      Szabolcs Nagy 提交于
      a common code path in j0 and y0 was factored out so the resulting
      object code is smaller
      
      unsigned int arithmetics is used for bit manipulation
      
      the logic of j0 got a bit simplified (x < 1 case was handled
      separately with a bit higher precision than now, but there are large
      errors in other domains anyway so that branch has been removed)
      
      some threshold values were adjusted in j0f and y0f
      697acde6
  3. 29 12月, 2012 1 次提交
  4. 28 12月, 2012 1 次提交
    • R
      align EPOLL_* flags with fcntl O_* flag definitions, which vary by arch · 761ebe06
      Rich Felker 提交于
      the old definitions were wrong on some archs. actually, EPOLL_NONBLOCK
      probably should not even be defined; it is not accepted by the kernel
      and it's not clear to me whether it has any use at all, even if it did
      work. this issue should be revisited at some point, but I'm leaving it
      in place for now in case some applications reference it.
      761ebe06
  5. 27 12月, 2012 2 次提交
  6. 26 12月, 2012 1 次提交
    • R
      fix reference to libc struct in static tls init code · e172c7b4
      Rich Felker 提交于
      libc is the macro, __libc is the internal symbol, but under some
      configurations on old/broken compilers, the symbol might not actually
      exist and the libc macro might instead use __libc_loc() to obtain
      access to the object.
      e172c7b4
  7. 21 12月, 2012 1 次提交
    • R
      clean up and fix logic for making mmap fail on invalid/unsupported offsets · d12f2ed2
      Rich Felker 提交于
      the previous logic was assuming the kernel would give EINVAL when
      passed an invalid address, but instead with MAP_FIXED it was giving
      EPERM, as it considered this an attempt to map over kernel memory.
      instead of trying to get the kernel to do the rigth thing, the new
      code just handles the error in userspace.
      
      I have also cleaned up the code to use a single mask to check for
      invalid low bits and unsupported high bits, so it's simpler and more
      clearly correct. the old code was actually wrong for sizeof(long)
      smaller than sizeof(off_t) but not equal to 4; now it should be
      correct for all possibilities.
      
      for 64-bit systems, the low-bits test is new and extraneous (the
      kernel should catch the error anyway when the mmap2 syscall is not
      used), but it's cheap anyway. if this is an issue, the OFF_MASK
      definition could be tweaked to omit the low bits when SYS_mmap2 is not
      defined.
      d12f2ed2
  8. 20 12月, 2012 2 次提交
  9. 19 12月, 2012 5 次提交
    • S
      math: more correct tgmath.h type cast logic · 3c4214db
      Szabolcs Nagy 提交于
      __IS_FP is a portable integer constant expression now
      (uses that unsigned long long is larger than float)
      the result casting logic should work now on all compilers
      supporting typeof
      3c4214db
    • R
      add inet_network (required for wine) · 36d73038
      rofl0r 提交于
      36d73038
    • R
      x86_64/bits/signal.h: fix typo in REG_CSGSFS · 3bb167b3
      rofl0r 提交于
      3bb167b3
    • R
      link.h: expose glibc/svr4 dynlinker debugging glue · 26cf9c3c
      rofl0r 提交于
      this is already implemented in the dynliker (see struct debug),
      but was not exposed.
      we need it to do so to make wine happy...
      26cf9c3c
    • S
      math: new type cast logic in tgmath.h · e9e2b66e
      Szabolcs Nagy 提交于
      * return type logic is simplified a bit and fixed (see below)
      * return type of conj and cproj were wrong on int arguments
      * added comments about the pending issues
      (usually we don't have comments in public headers but this is
      not the biggest issue with tgmath.h)
      
      casting the result to the right type cannot be done in c99
      (c11 _Generic can solve this but that is not widely supported),
      so the typeof extension of gcc is used and that the ?: operator
      has special semantics when one of the operands is a null
      pointer constant
      
      the standard is very strict about the definition of null
      pointer constants so typeof with ?: is still not enough so
      compiler specific workaround is used for now
      
      on gcc '!1.0' is a null pointer constant so we can use the old
      __IS_FP logic (eventhough it's non-standard)
      
      on clang (and on gcc as well) 'sizeof(void)-1' is a null
      pointer constant so we can use
       !(sizeof(*(0?(int*)0:(void*)__IS_FP(x)))-1)
      (this is non-standard as well), the old logic is used by
      default and this new one on clang
      e9e2b66e
  10. 17 12月, 2012 7 次提交
    • S
      math: use 0x1p-120f and 0x1p120f for tiny and huge values · c6383b7b
      Szabolcs Nagy 提交于
      previously 0x1p-1000 and 0x1p1000 was used for raising inexact
      exception like x+tiny (when x is big) or x+huge (when x is small)
      
      the rational is that these float consts are large enough
      (0x1p-120 + 1 raises inexact even on ld128 which has 113 mant bits)
      and float consts maybe smaller or easier to load on some platforms
      (on i386 this reduced the object file size by 4bytes in some cases)
      c6383b7b
    • S
      math: tgammal.c fixes · d8a7619e
      Szabolcs Nagy 提交于
      this is not a full rewrite just fixes to the special case logic:
      +-0 and non-integer x<INT_MIN inputs incorrectly raised invalid
      exception and for +-0 the return value was wrong
      
      so integer test and odd/even test for negative inputs are changed
      and a useless overflow test was removed
      d8a7619e
    • S
      math: tanh.c cleanup similar to sinh, cosh · e42a977f
      Szabolcs Nagy 提交于
      comments are kept in the double version of the function
      
      compared to fdlibm/freebsd we partition the domain into one
      more part and select different threshold points:
      now the [log(5/3)/2,log(3)/2] and [log(3)/2,inf] domains
      should have <1.5ulp error
      (so only the last bit may be wrong, assuming good exp, expm1)
      
      (note that log(3)/2 and log(5/3)/2 are the points where tanh
      changes resolution: tanh(log(3)/2)=0.5, tanh(log(5/3)/2)=0.25)
      
      for some x < log(5/3)/2 (~=0.2554) the error can be >1.5ulp
      but it should be <2ulp
      (the freebsd code had some >2ulp errors in [0.255,1])
      
      even with the extra logic the new code produces smaller
      object files
      e42a977f
    • S
      math: sinh.c cleanup similar to the cosh one · f1434582
      Szabolcs Nagy 提交于
      comments are kept in the double version of the function
      f1434582
    • S
      math: finished cosh.c cleanup · 1aec620f
      Szabolcs Nagy 提交于
      changed the algorithm: large input is not special cased
      (when exp(-x) is small compared to exp(x))
      and the threshold values are reevaluated
      (fdlibm code had a log(2)/2 cutoff for which i could not find
      justification, log(2) seems to be a better threshold and this
      was verified empirically)
      
      the new code is simpler, makes smaller binaries and should be
      faster for common cases
      
      the old comments were removed as they are no longer true for the
      new algorithm and the fdlibm copyright was dropped as well
      because there is no common code or idea with the original anymore
      except for trivial ones.
      1aec620f
    • S
    • S
      525ad96e
  11. 16 12月, 2012 1 次提交
  12. 15 12月, 2012 3 次提交
  13. 14 12月, 2012 2 次提交
  14. 12 12月, 2012 6 次提交
    • R
      2384f27d
    • S
      math: add a non-dummy tgamma implementation · 0f53c1a4
      Szabolcs Nagy 提交于
      uses the lanczos approximation method with the usual tweaks.
      same parameters were selected as in boost and python.
      (avoides some extra work and special casing found in boost
      so the precision is not that good: measured error is <5ulp for
      positive x and <10ulp for negative)
      
      an alternative lgamma_r implementation is also given in the same
      file which is simpler and smaller than the current one, but less
      precise so it's ifdefed out for now.
      0f53c1a4
    • S
      math: cosh cleanup · 14cc9c7f
      Szabolcs Nagy 提交于
      do fabs by hand, don't check for nan and inf separately
      14cc9c7f
    • S
      math: fix comment in __rem_pio2f.c · 9c6b1de0
      Szabolcs Nagy 提交于
      9c6b1de0
    • S
      math: add empty __invtrigl.s to i386 and x86_64 · 1384ad5f
      Szabolcs Nagy 提交于
      __invtrigl is not needed when acosl, asinl, atanl have asm
      implementations
      1384ad5f
    • S
      math: clean up inverse trigonometric functions · b12a73d5
      Szabolcs Nagy 提交于
      modifications:
      * avoid unsigned->signed conversions
      * removed various volatile hacks
      * use FORCE_EVAL when evaluating only for side-effects
      * factor out R() rational approximation instead of manual inline
      * __invtrigl.h now only provides __invtrigl_R, __pio2_hi and __pio2_lo
      * use 2*pio2_hi, 2*pio2_lo instead of pi_hi, pi_lo
      
      otherwise the logic is not changed, long double versions will
      need a revisit when a genaral long double cleanup happens
      b12a73d5