1. 10 6月, 2001 1 次提交
  2. 06 6月, 2001 1 次提交
  3. 01 6月, 2001 1 次提交
    • T
      Clean up some minor problems exposed by further thought about Panon's bug · 0b370ea7
      Tom Lane 提交于
      report on old-style functions invoked by RI triggers.  We had a number of
      other places that were being sloppy about which memory context FmgrInfo
      subsidiary data will be allocated in.  Turns out none of them actually
      cause a problem in 7.1, but this is for arcane reasons such as the fact
      that old-style triggers aren't supported anyway.  To avoid getting burnt
      later, I've restructured the trigger support so that we don't keep trigger
      FmgrInfo structs in relcache memory.  Some other related cleanups too:
      it's not really necessary to call fmgr_info at all while setting up
      the index support info in relcache entries, because those ScanKeyEntry
      structs are never used to invoke the functions.  This should speed up
      relcache initialization a tiny bit.
      0b370ea7
  4. 31 5月, 2001 1 次提交
  5. 30 5月, 2001 2 次提交
    • B
      33f2614a
    • B
      Attached is my patch that adds DROP CONSTRAINT support to PostgreSQL. I · 36546c98
      Bruce Momjian 提交于
      basically want your guys feedback.  I have sprinkled some of my q's thru
      the text delimited with the @@ symbol.  It seems to work perfectly.
      
      [ Removed @@ comments because patch was reviewed. ]
      
      At the moment it does CHECK constraints only, with inheritance.  However,
      due to the problem mentioned before with the mismatching between inherited
      constraints it may be wise to disable the inheritance feature for a while.
      it is written in an extensible fashion to support future dropping of other
      types of constraint, and is well documented.
      
      Please send me your comments, check my use of locking, updating of
      indices, use of ERROR and NOTICE, etc. and I will rework the patch based
      on feedback until everyone
      is happy with it...
      
      Christopher Kings
      36546c98
  6. 27 5月, 2001 1 次提交
  7. 21 5月, 2001 1 次提交
    • T
      Modify optimizer data structures so that IndexOptInfo lists built for · be03eb25
      Tom Lane 提交于
      create_index_paths are not immediately discarded, but are available for
      subsequent planner work.  This allows avoiding redundant syscache lookups
      in several places.  Change interface to operator selectivity estimation
      procedures to allow faster and more flexible estimation.
      Initdb forced due to change of pg_proc entries for selectivity functions!
      be03eb25
  8. 19 5月, 2001 1 次提交
  9. 17 5月, 2001 1 次提交
  10. 15 5月, 2001 5 次提交
  11. 10 5月, 2001 1 次提交
    • B
      I have modifed heap.c so that it won't automatically generate duplicate · bea7a885
      Bruce Momjian 提交于
      constraint names.
      
      > > A reasonable interpretation of DROP CONSTRAINT "foo" is to drop *all*
      > > constraints named "foo" on the target table.
      >
      > Then it should probably be a good thing to avoid the automatic
      > generation of
      > duplicate names?  I might take a look at that, actually...
      >
      
      Christopher Kings-Lynne
      bea7a885
  12. 07 5月, 2001 1 次提交
    • T
      Rewrite of planner statistics-gathering code. ANALYZE is now available as · f905d65e
      Tom Lane 提交于
      a separate statement (though it can still be invoked as part of VACUUM, too).
      pg_statistic redesigned to be more flexible about what statistics are
      stored.  ANALYZE now collects a list of several of the most common values,
      not just one, plus a histogram (not just the min and max values).  Random
      sampling is used to make the process reasonably fast even on very large
      tables.  The number of values and histogram bins collected is now
      user-settable via an ALTER TABLE command.
      
      There is more still to do; the new stats are not being used everywhere
      they could be in the planner.  But the remaining changes for this project
      should be localized, and the behavior is already better than before.
      
      A not-very-related change is that sorting now makes use of btree comparison
      routines if it can find one, rather than invoking '<' twice.
      f905d65e
  13. 02 4月, 2001 1 次提交
  14. 22 3月, 2001 2 次提交
  15. 23 2月, 2001 2 次提交
  16. 15 2月, 2001 1 次提交
    • T
      Change scoping of table and join refnames to conform to SQL92: a JOIN · 4a66f9dd
      Tom Lane 提交于
      clause with an alias is a <subquery> and therefore hides table references
      appearing within it, according to the spec.  This is the same as the
      preliminary patch I posted to pgsql-patches yesterday, plus some really
      grotty code in ruleutils.c to reverse-list a query tree with the correct
      alias name depending on context.  I'd rather not have done that, but unless
      we want to force another initdb for 7.1, there's no other way for now.
      4a66f9dd
  17. 13 2月, 2001 1 次提交
    • T
      Rearrange order of operations in heap_create_with_catalog so that if · aa88e59a
      Tom Lane 提交于
      two transactions create the same table name concurrently, the one that
      fails will complain about unique index pg_class_relname_index, rather than
      about pg_type_typname_index which'll confuse most people.  Free side
      benefit: pg_class.reltype is correctly linked to the pg_type entry now.
      It's been zero in all but the preloaded pg_class entries since who knows
      when.
      aa88e59a
  18. 29 1月, 2001 1 次提交
    • T
      Clean up handling of tuple descriptors so that result-tuple descriptors · 0d54d6ac
      Tom Lane 提交于
      allocated by plan nodes are not leaked at end of query.  This doesn't
      really matter for normal queries, but it sure does for queries invoked
      repetitively inside SQL functions.  Clean up some other grotty code
      associated with tupdescs, and fix a few other memory leaks exposed by
      tests with simple SQL functions.
      0d54d6ac
  19. 25 1月, 2001 1 次提交
  20. 24 1月, 2001 2 次提交
  21. 23 1月, 2001 1 次提交
    • T
      Fix all the places that called heap_update() and heap_delete() without · 786f1a59
      Tom Lane 提交于
      bothering to check the return value --- which meant that in case the
      update or delete failed because of a concurrent update, you'd not find
      out about it, except by observing later that the transaction produced
      the wrong outcome.  There are now subroutines simple_heap_update and
      simple_heap_delete that should be used anyplace that you're not prepared
      to do the full nine yards of coping with concurrent updates.  In
      practice, that seems to mean absolutely everywhere but the executor,
      because *noplace* else was checking.
      786f1a59
  22. 18 1月, 2001 2 次提交
  23. 17 1月, 2001 1 次提交
  24. 02 1月, 2001 1 次提交
  25. 28 12月, 2000 1 次提交
    • T
      Fix portability problems recently exposed by regression tests on Alphas. · 8609d4ab
      Tom Lane 提交于
      1. Distinguish cases where a Datum representing a tuple datatype is an OID
      from cases where it is a pointer to TupleTableSlot, and make sure we use
      the right typlen in each case.
      2. Make fetchatt() and related code support 8-byte by-value datatypes on
      machines where Datum is 8 bytes.  Centralize knowledge of the available
      by-value datatype sizes in two macros in tupmacs.h, so that this will be
      easier if we ever have to do it again.
      8609d4ab
  26. 23 12月, 2000 2 次提交
  27. 14 12月, 2000 1 次提交
  28. 10 12月, 2000 1 次提交
  29. 08 12月, 2000 2 次提交