1. 25 4月, 2012 5 次提交
    • R
      first attempt at enabling stack protector support · 60872cf9
      Rich Felker 提交于
      the code is written to pre-init the thread pointer in static linked
      programs that pull in __stack_chk_fail or dynamic-linked programs that
      lookup the symbol. no explicit canary is set; the canary will be
      whatever happens to be in the thread structure at the offset gcc
      hard-coded. this can be improved later.
      60872cf9
    • R
      use signed char rather than plain char for int8_t · 848d30a1
      Rich Felker 提交于
      otherwise this BADLY breaks if -funsigned-char is passed to gcc
      848d30a1
    • R
      add another example option to dist/config.mak · e4d35ea9
      Rich Felker 提交于
      e4d35ea9
    • R
      ditch the priority inheritance locks; use malloc's version of lock · 4750cf42
      Rich Felker 提交于
      i did some testing trying to switch malloc to use the new internal
      lock with priority inheritance, and my malloc contention test got
      20-100 times slower. if priority inheritance futexes are this slow,
      it's simply too high a price to pay for avoiding priority inversion.
      maybe we can consider them somewhere down the road once the kernel
      folks get their act together on this (and perferably don't link it to
      glibc's inefficient lock API)...
      
      as such, i've switch __lock to use malloc's implementation of
      lightweight locks, and updated all the users of the code to use an
      array with a waiter count for their locks. this should give optimal
      performance in the vast majority of cases, and it's simple.
      
      malloc is still using its own internal copy of the lock code because
      it seems to yield measurably better performance with -O3 when it's
      inlined (20% or more difference in the contention stress test).
      4750cf42
    • R
      internal locks: new owner of contended lock must set waiters flag · e7655ed3
      Rich Felker 提交于
      this bug probably would have gone unnoticed since it's only used in
      the fallback code for systems where priority-inheritance locking
      fails. unfortunately this approach results in one spurious wake
      syscall on the final unlock, when there are no waiters remaining. the
      alternative (possibly better) would be to use broadcast wakes instead
      of reflagging the waiter unconditionally, and let each waiter reflag
      itself; this saves one syscall at the expense of invoking the
      "thundering herd" effect (worse performance degredation) when there
      are many waiters.
      
      ideally we would be able to update all of our locks to use an array of
      two ints rather than a single int, and use a separate counter system
      like proper mutexes use; then we could avoid all spurious wake calls
      without resorting to broadcasts. however, it's not clear to me that
      priority inheritance futexes support this usage. the kernel sets the
      waiters flag for them (just like we're doing now) and i can't tell if
      it's safe to bypass the kernel when unlocking just because we know
      (from private data, the waiter count) that there are no waiters. this
      is something that could be explored in the future.
      e7655ed3
  2. 24 4月, 2012 7 次提交
    • R
      new internal locking primitive; drop spinlocks · f34d0ea5
      Rich Felker 提交于
      we use priority inheritance futexes if possible so that the library
      cannot hit internal priority inversion deadlocks in the presence of
      realtime priority scheduling (full support to be added later).
      f34d0ea5
    • R
      new wcwidth implementation (fast table-based) · 1b0ce9af
      Rich Felker 提交于
      i tried to go with improving the old binary-search-based algorithm,
      but between growth in the number of ranges, bad performance, and lack
      of confidence in the binary search code's stability under changes in
      the table, i decided it was worth the extra 1.8k to have something
      clean and maintainable.
      
      also note that, like the alpha and punct tables, there's definitely
      room to optimize the nonspacing/wide tables by overlapping subtables.
      this is not a high priority, but i've begun looking into how to do it,
      and i suspect the table sizes can be roughly halved. if that turns out
      to be true, the new, fast, table-based implementation will be roughly
      the same size as if i had just extended the old binary search one.
      1b0ce9af
    • R
      sync case mappings with unicode 6.1 · 1a63a9fc
      Rich Felker 提交于
      also special-case ß (U+00DF) as lowercase even though it does not have
      a mapping to uppercase. unicode added an uppercase version of this
      character but does not map it, presumably because the uppercase
      version is not actually used except for some obscure purpose...
      1a63a9fc
    • R
      optimize iswprint · 38b5d7d0
      Rich Felker 提交于
      38b5d7d0
    • R
      fix spurious punct class for some surrogate codepoints (invalid) · 640fe75c
      Rich Felker 提交于
      this happened due to their entries in UnicodeData.txt
      640fe75c
    • R
      destubify iswalpha and update iswpunct to unicode 6.1 · 7e38b1ea
      Rich Felker 提交于
      alpha is defined as unicode property "Alphabetic" plus category Nd
      minus ASCII digits minus 2 special-cased Thai punctuation marks
      supposedly misclassified by Unicode as letters.
      
      punct is defined as all of unicode except control, alphanumeric, and
      space characters.
      
      the tables were generated by a simple tool based on the code posted
      previously to the mailing list. in the future, this and other code
      used for maintaining locale/iconv/i18n data will be published either
      in the main source repository or in a separate locale data generation
      repository.
      7e38b1ea
    • R
      make dlerror produce informative results · a5d10eb1
      Rich Felker 提交于
      note that dlerror is specified to be non-thread-safe, so no locking is
      performed on the error flag or message aside from the rwlock already
      held by dlopen or dlsym. if 2 invocations of dlsym are generating
      errors at the same time, they could clobber each other's results, but
      the resulting string, albeit corrupt, will still be null-terminated.
      any use of dlerror in such a situation could not be expected to give
      meaningful results anyway.
      a5d10eb1
  3. 23 4月, 2012 4 次提交
  4. 22 4月, 2012 6 次提交
  5. 21 4月, 2012 2 次提交
  6. 20 4月, 2012 3 次提交
  7. 19 4月, 2012 2 次提交
  8. 18 4月, 2012 11 次提交