From: | Bruce Momjian <pgman(at)candle(dot)pha(dot)pa(dot)us> |
---|---|
To: | Claudio Natoli <claudio(dot)natoli(at)memetrics(dot)com> |
Cc: | "'''Tom Lane ' ' '" <tgl(at)sss(dot)pgh(dot)pa(dot)us>, "'''Jan Wieck ' ' '" <JanWieck(at)Yahoo(dot)com>, "''''''pgsql-patches(at)postgresql(dot)org' ' ' ' ' '" <pgsql-patches(at)postgresql(dot)org> |
Subject: | Re: fork/exec patch: pre-CreateProcess finalization |
Date: | 2004-01-09 05:07:05 |
Message-ID: | 200401090507.i09575q13986@candle.pha.pa.us |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-patches |
Claudio Natoli wrote:
>
> I wrote:
> > Just to be clear, this would involve turning the BackendList dlllist into
> an
> > array in shared memory, right? If so, a couple of questions:
>
> Bruce Momjian wrote:
> > I assumed a much simpler solution. I thought we would just have:
> >
> > struct {
> > pid_t pid;
> > int cancel_key;
> > } PidCancel[maxbackend];
> >
> > in shared memory and we would just sequentially scan looking for a pid
> > match? Is that wrong?
>
> Isn't that basically "turning the BackendList dlllist into an array in
> shared memory"? And I don't think that an array length of maxbackend is
> enough.
Uh, why would you need more than maxbackends? Can't it be indexed by
slot number --- each backend has a slot? Maybe I am missing something.
--
Bruce Momjian | http://candle.pha.pa.us
pgman(at)candle(dot)pha(dot)pa(dot)us | (610) 359-1001
+ If your life is a hard drive, | 13 Roberts Road
+ Christ can be your backup. | Newtown Square, Pennsylvania 19073
From | Date | Subject | |
---|---|---|---|
Next Message | Tom Lane | 2004-01-09 05:09:22 | Re: fork/exec patch: pre-CreateProcess finalization |
Previous Message | Claudio Natoli | 2004-01-09 05:01:07 | Re: fork/exec patch: pre-CreateProcess finalization |