Bill Anderson <[EMAIL PROTECTED]> wrote:
> Why not use "-type f" to tell find to only show files, which does not
> include directories? That is how I did it when I was using the brute
> force method. Nice advantage in that you can have any amount of
> hashing in a directory and still get an a
On Fri, Nov 07, 2008 at 04:26:54PM -0600, Gerald V. Livingston II wrote:
> I seldom have to deal with REALLY large queues but I use this I hacked
> up real quick to see if anything is starting to build up:
>
> #!/bin/bash
> echo ACTIVE
> echo
> find /var/spool/postfix/active/. ! -name . ! -name
eldom have to deal with REALLY large queues but I use this I hacked
up real quick to see if anything is starting to build up:
#!/bin/bash
echo ACTIVE
echo
find /var/spool/postfix/active/. ! -name . ! -name '?' -print |wc -l
echo
echo DEFERRED
echo
find /var/spool/postfix/deferred/. ! -name . !
Victor Duchovni wrote:
On Fri, Nov 07, 2008 at 03:42:49PM -0500, Ofer Inbar wrote:
We track the number of messages in each postfix queue on our
mailservers using a program I've written. For most queues,
it simply does a readdir() and counts all files whose names don't
begin with ".", which is
Ofer Inbar:
> > Postfix hash_queue_names uses one-character (letter or digit)
> > directory names. This is sufficient to implement a tree.
> >
> > Current queue file names are longer than 1, because they have two
> > parts (inode number and time).
>
> Thanks!
>
> > A future queue implementation
On Fri, Nov 07, 2008 at 03:42:49PM -0500, Ofer Inbar wrote:
> We track the number of messages in each postfix queue on our
> mailservers using a program I've written. For most queues,
> it simply does a readdir() and counts all files whose names don't
> begin with ".", which is quick and efficien
> Postfix hash_queue_names uses one-character (letter or digit)
> directory names. This is sufficient to implement a tree.
>
> Current queue file names are longer than 1, because they have two
> parts (inode number and time).
Thanks!
> A future queue implementation may use a different organizati
Postfix hash_queue_names uses one-character (letter or digit)
directory names. This is sufficient to implement a tree.
Current queue file names are longer than 1, because they have two
parts (inode number and time).
A future queue implementation may use a different organization:
one tree that com
We track the number of messages in each postfix queue on our
mailservers using a program I've written. For most queues,
it simply does a readdir() and counts all files whose names don't
begin with ".", which is quick and efficient. For the deferred queue,
it does a find-style walk through the dir
