On 1/31/07, Tom Lane [EMAIL PROTECTED] wrote:
We can't change TOAST_MAX_CHUNK_SIZE without forcing an initdb, but I
think that it would be safe to remove the MAXALIGN'ing of the tuple
size in the tests in heapam.c, that is
That would mean that the tuple size in the heap may exceed
On 1/31/2007 12:41 PM, Tom Lane wrote:
Pavan Deolasee [EMAIL PROTECTED] writes:
On 1/31/07, Tom Lane [EMAIL PROTECTED] wrote:
The toast code takes pains to ensure that the tuples it creates won't be
subject to re-toasting. Else it'd be an infinite recursion.
I think I found it. The
Jan Wieck [EMAIL PROTECTED] writes:
On 1/31/2007 12:41 PM, Tom Lane wrote:
We can't change TOAST_MAX_CHUNK_SIZE without forcing an initdb, but I
think that it would be safe to remove the MAXALIGN'ing of the tuple
size in the tests in heapam.c, that is
Can't we maxalign the page header in the
On 1/31/07, Tom Lane [EMAIL PROTECTED] wrote:
Pavan Deolasee [EMAIL PROTECTED] writes:
Btw, I noticed that the toast_insert_or_update() is re-entrant.
toast_save_datum() calls simple_heap_insert() which somewhere down the
line calls toast_insert_or_update() again.
The toast code takes pains
On 1/31/07, Pavan Deolasee [EMAIL PROTECTED] wrote:
Attached is a patch which would print the recursion depth for
toast_insert_or_update() before PANICing the server to help us
examine the core.
Here is the attachment.
Thanks,
Pavan
--
EnterpriseDB http://www.enterprisedb.com
Pavan Deolasee [EMAIL PROTECTED] writes:
On 1/31/07, Tom Lane [EMAIL PROTECTED] wrote:
The toast code takes pains to ensure that the tuples it creates won't be
subject to re-toasting. Else it'd be an infinite recursion.
I think I found it. The toast_insert_or_update() function gets into an
Not sure whether its worth optimizing, but had spotted this while browsing
the code a while back. So thought would post it anyways.
The stack usage for toast_insert_or_update() may run into several KBs since
the MaxHeapAttributeNumber is set to a very large value of 1600. The usage
could
Pavan Deolasee [EMAIL PROTECTED] writes:
The stack usage for toast_insert_or_update() may run into several KBs since
the MaxHeapAttributeNumber is set to a very large value of 1600. The usage
could anywhere between 28K to 48K depending on alignment and whether its a
32-bit or a 64-bit machine.
On 1/30/07, Tom Lane [EMAIL PROTECTED] wrote:
Pavan Deolasee [EMAIL PROTECTED] writes:
The stack usage for toast_insert_or_update() may run into several KBs
since
the MaxHeapAttributeNumber is set to a very large value of 1600. The
usage
could anywhere between 28K to 48K depending on
Pavan Deolasee [EMAIL PROTECTED] writes:
Btw, I noticed that the toast_insert_or_update() is re-entrant.
toast_save_datum() calls simple_heap_insert() which somewhere down the
line calls toast_insert_or_update() again.
The toast code takes pains to ensure that the tuples it creates won't be
10 matches
Mail list logo