1. 12 Jul, 2010 3 commits
    • Bruno Haible's avatar
      Tests for module '_Exit'. · 088612b2
      Bruno Haible authored
    • Bruno Haible's avatar
      New module '_Exit'. · 5518d301
      Bruno Haible authored
    • Paul R. Eggert's avatar
      strtod: make it more-accurate typically, and don't require libm · 3458f09c
      Paul R. Eggert authored
      * lib/strtod.c (_GL_ARG_NONNULL): Remove; no longer needed.
      Include limits.h.  Don't include string.h.
      (HAVE_LDEXP_IN_LIBC, HAVE_RAW_DECL_STRTOD): Define to 0 if not defined.
      (locale_isspace): New function, so that no casts are needed to
      check whether *s is a space.
      (ldexp): Provide an unused dummy if not available.
      (scale_radix_exp, parse_number, underlying_strtod): New functions.
      (strtod): Use them.  This implementation prefers to use the
      underlying strtod if available, falling back on our own code
      only to fix known bugs.  This is more likely to produce an
      accurate result.  Also, it avoids the use of libm functions.
      * m4/strtod.m4 (gl_FUNC_STRTOD): Don't invoke _AC_LIBOBJ_STRTOD;
      no longer needed.  Invoke AC_LIBOBJ([strtod]); don't know why this
      was absent, but it caused a test failure with coreutils.
      (gl_PREREQ_STRTOD): Check wither ldexp can be used without linking
      with libm.
      * modules/strtod (Makefile.am, Link): libm is no longer needed.
      * modules/strtod-tests (Makefile.am): Likewise.
  2. 11 Jul, 2010 2 commits
  3. 09 Jul, 2010 1 commit
    • Paul Eggert's avatar
      (x)memcoll: minor tweaks · 277aeb36
      Paul Eggert authored
      * lib/memcoll.c (strcoll_loop): Prefer the style where 'const'
      is after the type that it qualifies.
      (memcoll0): Likewise.
      * lib/memcoll.h (memcoll0): Likewise.
      * lib/xmemcoll.c (collate_error, xmemcoll0): Likewise.
      * lib/xmemcoll.h (xmemcoll0): Likewise.
      * lib/memcoll.c (memcoll0): Correct the comment.  This function
      differs from memcoll in that the NUL byte is part of the argument.
      Omit the abort-checks, as performance is a real issue here.  Plus,
      the checks were wrong anyway (an off-by-one error).  Omit local
      variable 'diff', as it's a bit clearer that way.
      * m4/memcoll.m4 (gl_MEMCOLL): Omit AC_FUNC_STRCOLL, as it's
      no longer needed.
  4. 08 Jul, 2010 1 commit
    • Chen Guo's avatar
      (x)memcoll: speedup when input is known to be NUL delimited · 9f31a791
      Chen Guo authored
      * lib/memcoll.c: Include stdlib.
      (memcoll0) New function.
      (strcoll_loop) New function, refactored for use in both memcoll
      and memcoll0.
      * lib/memcoll.h: Add prototype for memcoll0.
      * lib/xmemcoll.c: (xmemcoll0) New function.
      (collate_error) New function, refactored for use in both xmemcoll
      and xmemcoll0.
      * lib/xmemcoll.h: Add prototype for xmemcoll0.
      * m4/memcoll.m4: add inline invocation.
  5. 07 Jul, 2010 1 commit
    • Pádraig Brady's avatar
      bootstrap: discard non translation project po files · 4e559a98
      Pádraig Brady authored
      * build-aux/bootstrap (update_po_files): Remove any
      local only files from the $po_dir/.reference directory.
      The LINGUAS index is generated from this directory
      and so those translations will not be distributed.
      Note, local only translations are not removed from the
      $po_dir directory.
  6. 04 Jul, 2010 3 commits
  7. 02 Jul, 2010 1 commit
  8. 01 Jul, 2010 3 commits
  9. 30 Jun, 2010 1 commit
  10. 29 Jun, 2010 1 commit
  11. 23 Jun, 2010 1 commit
  12. 22 Jun, 2010 2 commits
    • Karl Berry's avatar
      autoupdates · d0ed135f
      Karl Berry authored
    • Eric Blake's avatar
      memmem: slight optimization · fffd5fac
      Eric Blake authored
      For any needle, the factorization 0/n has a local period of 1, so it
      is a critical factorization iff the entire needle consists only of a
      single repeated byte, in which case 1/n-1 would also be critical.
      Starting with a comparison of x[0] and x[1] in the maximal suffix
      check will either find the 0/n case or move on to something else, so
      we can optimize and start with the x[1] vs. x[2] case to begin with.
      To avoid out-of-bounds references, we must then special case needles
      of length two or less.  However, for these cases, we can determine a
      critical factorization without any probes of the needle (we already
      require a non-empty needle; a 1-byte needle can factor as either 0/1
      or 1/0 but the rest of our code assumes a non-empty suffix; and of the
      two 2-byte needle patterns, "aa" can factor as either 0/2 or 1/1 but
      with best performance for 1/1, and "ab" must be factored as 1/1).
      * lib/str-two-way.h (critical_factorization): Update comments.
      Reduce work during factorization phase.
      Reported by Carlos Bueno <carlos@bueno.org>.
      Signed-off-by: default avatarEric Blake <eblake@redhat.com>
  13. 21 Jun, 2010 6 commits
  14. 20 Jun, 2010 1 commit
  15. 17 Jun, 2010 2 commits
  16. 16 Jun, 2010 1 commit
  17. 15 Jun, 2010 5 commits
  18. 14 Jun, 2010 2 commits
  19. 13 Jun, 2010 3 commits