1. 23 8月, 2005 2 次提交
  2. 22 8月, 2005 1 次提交
  3. 21 8月, 2005 4 次提交
  4. 20 8月, 2005 4 次提交
  5. 19 8月, 2005 3 次提交
  6. 18 8月, 2005 7 次提交
  7. 17 8月, 2005 5 次提交
  8. 16 8月, 2005 6 次提交
  9. 15 8月, 2005 6 次提交
  10. 14 8月, 2005 2 次提交
    • T
      Tweak catalog cache management algorithms to reduce cost of · f60d176a
      Tom Lane 提交于
      SearchCatCacheList and ReleaseCatCacheList.  Previously, we incremented
      and decremented the refcounts of list member tuples along with the list
      itself, but that's unnecessary, and very expensive when the list is big.
      It's cheaper to change only the list refcount.  When we are considering
      deleting a cache entry, we have to check not only its own refcount but
      its parent list's ... but it's easy to arrange the code so that this
      check is not made in any commonly-used paths, so the cost is really nil.
      The bigger gain though is to refrain from DLMoveToFront'ing each individual
      member tuple each time the list is referenced.  To keep some semblance
      of fair space management, lists are just marked as used or not since the
      last cache cleanout search, and we do a MoveToFront pass only when about
      to run a cleanout.  In combination, these changes reduce the costs of
      SearchCatCacheList and ReleaseCatCacheList from about 4.5% of pgbench
      runtime to under 1%, according to my gprof results.
      f60d176a
    • T
      Make pg_stat_file() use OUT parameters so that the user doesn't have to · 2af9a44f
      Tom Lane 提交于
      remember the output parameter set for himself.  It's a bit of a kluge
      but fixing array_in to work in bootstrap mode looks worse.
      I removed the separate pg_file_length() function, as it no longer has any
      real notational advantage --- you can write (pg_stat_file(...)).length.
      2af9a44f