1. 18 8月, 2012 6 次提交
    • R
      add mips to supported arch list in INSTALL file · 3ae8b980
      Rich Felker 提交于
      3ae8b980
    • R
      crt1 must align stack pointer on mips · 259071c2
      Rich Felker 提交于
      it's naturally aligned when entered with the kernel argv array, but if
      ld.so has been invoked explicitly to run a program, the stack will not
      be aligned due to having thrown away argv[0].
      259071c2
    • R
      efe97514
    • R
      split up installation target · 07809363
      Rich Felker 提交于
      patch by Luca Barbato (lu_zero)
      07809363
    • R
      fix extremely rare but dangerous race condition in robust mutexes · da8d0fc4
      Rich Felker 提交于
      if new shared mappings of files/devices/shared memory can be made
      between the time a robust mutex is unlocked and its subsequent removal
      from the pending slot in the robustlist header, the kernel can
      inadvertently corrupt data in the newly-mapped pages when the process
      terminates. i am fixing the bug by using the same global vm lock
      mechanism that was used to fix the race condition with unmapping
      barriers after pthread_barrier_wait returns.
      da8d0fc4
    • R
      fix float parsing logic for long decimal expansions · 11458e5b
      Rich Felker 提交于
      this affects at least the case of very long inputs, but may also
      affect shorter inputs that become long due to growth while upscaling.
      basically, the logic for the circular buffer indices of the initial
      base-10^9 digit and the slot one past the final digit, and for
      simplicity of the loop logic, assumes an invariant that they're not
      equal. the upscale loop, which can increase the length of the
      base-10^9 representation, attempted to preserve this invariant, but
      was actually only ensuring that the end index did not loop around past
      the start index, not that the two never become equal.
      
      the main (only?) effect of this bug was that subsequent logic treats
      the excessively long number as having no digits, leading to junk
      results.
      11458e5b
  2. 16 8月, 2012 2 次提交
  3. 15 8月, 2012 3 次提交
  4. 14 8月, 2012 6 次提交
  5. 12 8月, 2012 5 次提交
  6. 11 8月, 2012 4 次提交
  7. 10 8月, 2012 4 次提交
    • R
      add blowfish hash support to crypt · a02bf5fc
      Rich Felker 提交于
      there are still some discussions going on about tweaking the code, but
      at least thing brings us to the point of having something working in
      the repository. hopefully the remaining major hashes (md5,sha) will
      follow soon.
      a02bf5fc
    • R
      fix (hopefully) all hard-coded 8's for kernel sigset_t size · 2f437040
      Rich Felker 提交于
      some minor changes to how hard-coded sets for thread-related purposes
      are handled were also needed, since the old object sizes were not
      necessarily sufficient. things have gotten a bit ugly in this area,
      and i think a cleanup is in order at some point, but for now the goal
      is just to get the code working on all supported archs including mips,
      which was badly broken by linux rejecting syscalls with the wrong
      sigset_t size.
      2f437040
    • R
      add defines for number of sigset_t bytes syscalls expect · 83b42d94
      Rich Felker 提交于
      yet another gratuitous mips incompatibility...
      83b42d94
    • R
      make crypt return an unmatchable hash rather than NULL on failure · b3c4cc12
      Rich Felker 提交于
      unfortunately, a large portion of programs which call crypt are not
      prepared for its failure and do not check that the return value is
      non-null before using it. thus, always "succeeding" but giving an
      unmatchable hash is reportedly a better behavior than failing on
      error.
      
      it was suggested that we could do this the same way as other
      implementations and put the null-to-unmatchable translation in the
      wrapper rather than the individual crypt modules like crypt_des, but
      when i tried to do it, i found it was making the logic in __crypt_r
      for keeping track of which hash type we're working with and whether it
      succeeded or failed much more complex, and potentially error-prone.
      the way i'm doing it now seems to have essentially zero cost, anyway.
      b3c4cc12
  8. 09 8月, 2012 1 次提交
  9. 08 8月, 2012 3 次提交
  10. 06 8月, 2012 6 次提交