> Does anyone know an inexpensive algorithm (O(1)) to go from an number to
> the next (lower or higher) power of two.
>
> 1 -> 1
> 2,3 -> 2
> 4,5,6,7 -> 4
> 8,9,10,11,12,13,14,15 -> 8
> etc.
>
> So %1101 should become either %1 or %
Following my previous post:
I wrote ..
>I believe a reversed dataset would be partitioned
>into two subpartitions sorted in order at the 1'st pass of
>the partitionings. Is this incorrect ?
>
Sorry, I'd confirmed BSD qsort's partitioning logic does not
guarantee that "a reversed dataset would be p
Following my previous post:
I wrote ..
>I believe a reversed dataset would be partitioned
>into two subpartitions sorted in order at the 1'st pass of
>the partitionings. Is this incorrect ?
>
Sorry, I'd confirmed BSD qsort's partitioning logic does not
guarantee that "a reversed dataset would be
:Now I've got to go figure out what *I've* screwed up. I fstat the file before
:mapping it and pass S.st_size as the map length. Is there any reason why
:mmap would return non-NULL but map less than the requested size?
:
:Scratching my head,
Note that mmap() returns (void *)-1 when an error
:Wes Peters scribbled this message on Aug 21:
:> Now I've got to go figure out what *I've* screwed up. I fstat the file
before
:> mapping it and pass S.st_size as the map length. Is there any reason why
:> mmap would return non-NULL but map less than the requested size?
:
:no, there is NO reaso
On Wed, Aug 18, 1999 at 03:44:56PM -0700, Brian F. Feldman wrote:
> On Wed, 18 Aug 1999, Nik Clayton wrote:
>
> > On Tue, Aug 03, 1999 at 12:37:39AM -0700, Julian Elischer wrote:
> > > Just fetched and compiled the "festival" package.
> > > http://www.cstr.ed.ac.uk/projects/festival
> >
> > Likew
:Now I've got to go figure out what *I've* screwed up. I fstat the file before
:mapping it and pass S.st_size as the map length. Is there any reason why
:mmap would return non-NULL but map less than the requested size?
:
:Scratching my head,
Note that mmap() returns (void *)-1 when an erro
Wes Peters scribbled this message on Aug 21:
> Now I've got to go figure out what *I've* screwed up. I fstat the file before
> mapping it and pass S.st_size as the map length. Is there any reason why
> mmap would return non-NULL but map less than the requested size?
no, there is NO reason why it
:Wes Peters scribbled this message on Aug 21:
:> Now I've got to go figure out what *I've* screwed up. I fstat the file before
:> mapping it and pass S.st_size as the map length. Is there any reason why
:> mmap would return non-NULL but map less than the requested size?
:
:no, there is NO reaso
Don Lewis wrote:
>
> On Aug 21, 2:10am, Wes Peters wrote:
> } Subject: mmap mapped segment length
> } I discovered to my dismay today that the length field in the mmap call is
> } a size_t, not an off_t. I was attempting to process a large (~50 MByte)
> file
> } and found I was only processing
On Wed, Aug 18, 1999 at 03:44:56PM -0700, Brian F. Feldman wrote:
> On Wed, 18 Aug 1999, Nik Clayton wrote:
>
> > On Tue, Aug 03, 1999 at 12:37:39AM -0700, Julian Elischer wrote:
> > > Just fetched and compiled the "festival" package.
> > > http://www.cstr.ed.ac.uk/projects/festival
> >
> > Like
Archie Cobbs wrote...
>Christopher Seiwald writes:
>> But as I'm proposing a change to a fairly sensitive piece of code, I'd
>> like to keep the change as modest as possible.
>
>How about this?
>
>Index: qsort.c
>===
>RCS fil
Wes Peters scribbled this message on Aug 21:
> Now I've got to go figure out what *I've* screwed up. I fstat the file before
> mapping it and pass S.st_size as the map length. Is there any reason why
> mmap would return non-NULL but map less than the requested size?
no, there is NO reason why i
Don Lewis wrote:
>
> On Aug 21, 2:10am, Wes Peters wrote:
> } Subject: mmap mapped segment length
> } I discovered to my dismay today that the length field in the mmap call is
> } a size_t, not an off_t. I was attempting to process a large (~50 MByte) file
> } and found I was only processing th
Archie Cobbs wrote...
>Christopher Seiwald writes:
>> But as I'm proposing a change to a fairly sensitive piece of code, I'd
>> like to keep the change as modest as possible.
>
>How about this?
>
>Index: qsort.c
>===
>RCS fi
Archie Cobbs wrote...
>Christopher Seiwald writes:
>> But as I'm proposing a change to a fairly sensitive piece of code, I'd
>> like to keep the change as modest as possible.
>
>How about this?
>
>Index: qsort.c
>===
>RCS fil
Archie Cobbs wrote...
>Christopher Seiwald writes:
>> But as I'm proposing a change to a fairly sensitive piece of code, I'd
>> like to keep the change as modest as possible.
>
>How about this?
>
>Index: qsort.c
>===
>RCS fi
Nick Hibma scribbled this message on Aug 21:
> Does anyone know an inexpensive algorithm (O(1)) to go from an number to
> the next (lower or higher) power of two.
>
> 1 -> 1
> 2,3 -> 2
> 4,5,6,7 -> 4
> 8,9,10,11,12,13,14,15 -> 8
> etc.
>
Wes Peters scribbled this message on Aug 21:
> I discovered to my dismay today that the length field in the mmap call is
> a size_t, not an off_t. I was attempting to process a large (~50 MByte) file
> and found I was only processing the first 4 MBytes of it.
as w/ others I'm assuming the file is
In message <199908211739.laa20...@mt.sri.com> Nate Williams writes:
: Your definition of kernel threads and mine are obviously quite
: different. :)
True. The kernel "threads" are just process context that a task can
run in Lots of thread-like things are missing...
Warner
To Unsubscribe:
In message Nick Hibma
writes:
: Does anyone know an inexpensive algorithm (O(1)) to go from an number to
: the next (lower or higher) power of two.
1 << ffs(x)
Warner
To Unsubscribe: send mail to majord...@freebsd.org
with "unsubscribe freebsd-hackers" in the body of the message
Nick Hibma scribbled this message on Aug 21:
> Does anyone know an inexpensive algorithm (O(1)) to go from an number to
> the next (lower or higher) power of two.
>
> 1 -> 1
> 2,3 -> 2
> 4,5,6,7 -> 4
> 8,9,10,11,12,13,14,15 -> 8
> etc.
>
Wes Peters scribbled this message on Aug 21:
> I discovered to my dismay today that the length field in the mmap call is
> a size_t, not an off_t. I was attempting to process a large (~50 MByte) file
> and found I was only processing the first 4 MBytes of it.
as w/ others I'm assuming the file i
In message <[EMAIL PROTECTED]> Nate Williams writes:
: Your definition of kernel threads and mine are obviously quite
: different. :)
True. The kernel "threads" are just process context that a task can
run in Lots of thread-like things are missing...
Warner
To Unsubscribe: send mail to [
In message <[EMAIL PROTECTED]> Nick Hibma writes:
: Does anyone know an inexpensive algorithm (O(1)) to go from an number to
: the next (lower or higher) power of two.
1 << ffs(x)
Warner
To Unsubscribe: send mail to [EMAIL PROTECTED]
with "unsubscribe freebsd-hackers" in the body of the messag
On 21-Aug-99 Nick Hibma wrote:
>
> Does anyone know an inexpensive algorithm (O(1)) to go from an number to
> the next (lower or higher) power of two.
>
> 1 -> 1
> 2,3 -> 2
> 4,5,6,7 -> 4
> 8,9,10,11,12,13,14,15 -> 8
> etc.
>
> So %110
On 21-Aug-99 Nick Hibma wrote:
>
> Does anyone know an inexpensive algorithm (O(1)) to go from an number to
> the next (lower or higher) power of two.
>
> 1 -> 1
> 2,3 -> 2
> 4,5,6,7 -> 4
> 8,9,10,11,12,13,14,15 -> 8
> etc.
>
> So %11
On Sat, 21 Aug 1999 02:10:47 -0600
Wes Peters wrote:
> I discovered to my dismay today that the length field in the mmap call is
> a size_t, not an off_t. I was attempting to process a large (~50 MByte) file
> and found I was only processing the first 4 MBytes of it.
...first of all, I ass
I just setup vinum for the first time on a brand new server,
nd I am getting what I think are strange results in performance
tests with rawio. My SCSI drives seem to be much slower that my
IDE drives?
Here is a dmesg from the machine:
##
> > FreeBSD has no kernel 'thread' support, only user level.
>
> That's not strictly true. The fact is we have both kernel and user
> threads but no mapping between the two... The kernel already
> internally use some threads.
Your definition of kernel threads and mine are obviously quite
differen
According to Nate Williams:
> FreeBSD has no kernel 'thread' support, only user level.
That's not strictly true. The fact is we have both kernel and user threads but
no mapping between the two... The kernel already internally use some threads.
--
Ollivier ROBERT -=- FreeBSD: The Power to Serve! -
On Sat, 21 Aug 1999 02:10:47 -0600
Wes Peters <[EMAIL PROTECTED]> wrote:
> I discovered to my dismay today that the length field in the mmap call is
> a size_t, not an off_t. I was attempting to process a large (~50 MByte) file
> and found I was only processing the first 4 MBytes of it.
..
At Sat, 21 Aug 1999 12:54:32 +0200, Nick Hibma wrote:
>
>Does anyone know an inexpensive algorithm (O(1)) to go from an number to
>the next (lower or higher) power of two.
>
>1 -> 1
>2,3-> 2
>4,5,6,7-> 4
>8,9,10,11,12,13,14,15 -> 8
>
I have successfully used vnconfig to add swap file and mount disk image
files. However, I am still not sure about the following two things:
(1) What does the count in "pseudo-device vn count" stand for? My guess
is that if it is 2, then we can use /dev/vn0x and /dev/vn1x. If it is 1,
then we can
On Sat, 21 Aug 1999, Kevin Day wrote:
> At 12:29 PM 8/21/99 -0400, Chuck Robey wrote:
> >Anyone know where the spec might be for how ATX power supplies work
> >(especially the interface to the motherboard, and their on'off methods?)
> >
> >Thanks.
>
> ftp://download.intel.com/design/motherbd/atx_
I just setup vinum for the first time on a brand new server,
nd I am getting what I think are strange results in performance
tests with rawio. My SCSI drives seem to be much slower that my
IDE drives?
Here is a dmesg from the machine:
#
At 12:29 PM 8/21/99 -0400, Chuck Robey wrote:
Anyone know where the spec might be for how ATX power supplies work
(especially the interface to the motherboard, and their on'off methods?)
Thanks.
ftp://download.intel.com/design/motherbd/atx_201.pdf
See section 4.2
Kevin
To Unsubscribe: se
> > FreeBSD has no kernel 'thread' support, only user level.
>
> That's not strictly true. The fact is we have both kernel and user
> threads but no mapping between the two... The kernel already
> internally use some threads.
Your definition of kernel threads and mine are obviously quite
differe
Anyone know where the spec might be for how ATX power supplies work
(especially the interface to the motherboard, and their on'off methods?)
Thanks.
+---
Chuck Robey | Interests include any kind of voice or da
According to Nate Williams:
> FreeBSD has no kernel 'thread' support, only user level.
That's not strictly true. The fact is we have both kernel and user threads but
no mapping between the two... The kernel already internally use some threads.
--
Ollivier ROBERT -=- FreeBSD: The Power to Serve!
At Sat, 21 Aug 1999 12:54:32 +0200, Nick Hibma wrote:
>
>Does anyone know an inexpensive algorithm (O(1)) to go from an number to
>the next (lower or higher) power of two.
>
>1 -> 1
>2,3-> 2
>4,5,6,7-> 4
>8,9,10,11,12,13,14,15 -> 8
I have successfully used vnconfig to add swap file and mount disk image
files. However, I am still not sure about the following two things:
(1) What does the count in "pseudo-device vn count" stand for? My guess
is that if it is 2, then we can use /dev/vn0x and /dev/vn1x. If it is 1,
then we ca
On Sat, 21 Aug 1999, Kevin Day wrote:
> At 12:29 PM 8/21/99 -0400, Chuck Robey wrote:
> >Anyone know where the spec might be for how ATX power supplies work
> >(especially the interface to the motherboard, and their on'off methods?)
> >
> >Thanks.
>
> ftp://download.intel.com/design/motherbd/atx
At 12:29 PM 8/21/99 -0400, Chuck Robey wrote:
>Anyone know where the spec might be for how ATX power supplies work
>(especially the interface to the motherboard, and their on'off methods?)
>
>Thanks.
ftp://download.intel.com/design/motherbd/atx_201.pdf
See section 4.2
Kevin
To Unsubscribe:
Anyone know where the spec might be for how ATX power supplies work
(especially the interface to the motherboard, and their on'off methods?)
Thanks.
+---
Chuck Robey | Interests include any kind of voice or d
> Does anyone know an inexpensive algorithm (O(1)) to go from an number to
> the next (lower or higher) power of two.
>
> 1 -> 1
> 2,3 -> 2
> 4,5,6,7 -> 4
> 8,9,10,11,12,13,14,15 -> 8
> etc.
>
> So %1101 should become either %1 or %
> Does anyone know an inexpensive algorithm (O(1)) to go from an number to
> the next (lower or higher) power of two.
>
> 1 -> 1
> 2,3 -> 2
> 4,5,6,7 -> 4
> 8,9,10,11,12,13,14,15 -> 8
> etc.
>
> So %1101 should become either %1 or %1
G'day Nick,
Nick Hibma wrote:
>
> Does anyone know an inexpensive algorithm (O(1)) to go from
> an number to the next (lower or higher) power of two.
>
> 1 -> 1
> 2,3 -> 2
> 4,5,6,7 -> 4
> 8,9,10,11,12,13,14,15 -> 8
> etc.
>
> So %11
How do I allocate DMA-able memory? Or is all memory DMA-able?
Like so:
#include
dma_addr = vtophys(addr);
The UHCI (and OHCI) USB controllers use DMA to access the queues with
the TransferDescriptors and QueueHeads. This is going to be loads of
small (4 to 32 byte) mem
Does anyone know an inexpensive algorithm (O(1)) to go from an number to
the next (lower or higher) power of two.
1 -> 1
2,3 -> 2
4,5,6,7 -> 4
8,9,10,11,12,13,14,15 -> 8
etc.
So %1101 should become either %1 or %1000.
The only solu
> Does anyone know an inexpensive algorithm (O(1)) to go from an number to
> the next (lower or higher) power of two.
>
> 1 -> 1
> 2,3 -> 2
> 4,5,6,7 -> 4
> 8,9,10,11,12,13,14,15 -> 8
> etc.
>
> So %1101 should become either %1 or
Zhihui Zhang writes:
> Thanks for your response. I can not think of those points myself.
> However, on page 7 of the book "Panic! Unix system crash dump analysis",
> it says that a debugger named kadb in SunOS can load the real kernel
> during boot and treat the latter like a great, big, user pr
> Does anyone know an inexpensive algorithm (O(1)) to go from an number to
> the next (lower or higher) power of two.
>
> 1 -> 1
> 2,3 -> 2
> 4,5,6,7 -> 4
> 8,9,10,11,12,13,14,15 -> 8
> etc.
>
> So %1101 should become either %1 or %
G'day Nick,
Nick Hibma <[EMAIL PROTECTED]> wrote:
>
> Does anyone know an inexpensive algorithm (O(1)) to go from
> an number to the next (lower or higher) power of two.
>
> 1 -> 1
> 2,3 -> 2
> 4,5,6,7 -> 4
> 8,9,10,11,12,13,14,15 ->
How do I allocate DMA-able memory? Or is all memory DMA-able?
Like so:
#include
dma_addr = vtophys(addr);
The UHCI (and OHCI) USB controllers use DMA to access the queues with
the TransferDescriptors and QueueHeads. This is going to be loads of
small (4 to 32 byte) me
Does anyone know an inexpensive algorithm (O(1)) to go from an number to
the next (lower or higher) power of two.
1 -> 1
2,3 -> 2
4,5,6,7 -> 4
8,9,10,11,12,13,14,15 -> 8
etc.
So %1101 should become either %1 or %1000.
The only sol
Zhihui Zhang <[EMAIL PROTECTED]> writes:
> Thanks for your response. I can not think of those points myself.
> However, on page 7 of the book "Panic! Unix system crash dump analysis",
> it says that a debugger named kadb in SunOS can load the real kernel
> during boot and treat the latter like a
> So are there any _objections_ to having the kernel match promiscuous
> "enabled" messages with "disabled" counterparts?
I strongly _request_ such a log message.
M
--
Mark Murray
Join the anti-SPAM movement: http://www.cauce.org
To Unsubscribe: send mail to majord...@freebsd.org
with "unsubscr
-hackers,
I'm playing around with the pkg_create(1) command at the moment, trying
to get the creation of pre-built versions (HTML, PS, etc) of the FDP
documentation working.
One of the things I'm trying to do is *not* require that the doc that's
being packaged up be installed first.
For example,
Don Lewis said:
> On Aug 21, 2:10am, Wes Peters wrote:
> } Subject: mmap mapped segment length
> } I discovered to my dismay today that the length field in the mmap call is
> } a size_t, not an off_t. I was attempting to process a large (~50 MByte)
> file
> } and found I was only processing the
> So are there any _objections_ to having the kernel match promiscuous
> "enabled" messages with "disabled" counterparts?
I strongly _request_ such a log message.
M
--
Mark Murray
Join the anti-SPAM movement: http://www.cauce.org
To Unsubscribe: send mail to [EMAIL PROTECTED]
with "unsubscribe
-hackers,
I'm playing around with the pkg_create(1) command at the moment, trying
to get the creation of pre-built versions (HTML, PS, etc) of the FDP
documentation working.
One of the things I'm trying to do is *not* require that the doc that's
being packaged up be installed first.
For example
Don Lewis said:
> On Aug 21, 2:10am, Wes Peters wrote:
> } Subject: mmap mapped segment length
> } I discovered to my dismay today that the length field in the mmap call is
> } a size_t, not an off_t. I was attempting to process a large (~50 MByte) file
> } and found I was only processing the fi
"Daniel C. Sobral" wrote:
>
> Terry Lambert wrote:
> >
> > That's kind of the point. No other VFS stacking system out there
> > plays by FreeBSD's revamped rules.
>
> I look around and I see no standards. It is still time to be
> experimental.
Since someone complained of my meekness, let me res
:The problem that occurs on the FreeBSD server is simply that the
:nfsrv_commit() procedure calls fsync() on the file... on the *ENTIRE*
:file, for every commit rpc, rather then syncing just the offset/range
:requested. I am looking into ways to fix this.
:
Ok, I've verified
You can check the change by recompiling a few utils with the change:
(find . -name \*.c | xargs grep -l qsort)
./bin/ps/ps.c
./contrib/gcc/*.c
./contrib/top/commands.c
./games/fortune/strfile/strfile.c
./gnu/usr.bin/sort/sort.c
./sbin/fsck/pass2.c
The fsck one is a nice one. Just wack your /usr
man 9 device_probe_and_attach
Nick
On Sat, 21 Aug 1999, Warner Losh wrote:
> In message <199908210557.baa22...@cs.rpi.edu> "David E. Cross" writes:
> : I have been writing a nasty kludge to treat a CardBus bridge as a standard
> : PCI bridge (with static config) .
>
> Ewe. Yuck. Wouldn't it
On Aug 21, 2:10am, Wes Peters wrote:
} Subject: mmap mapped segment length
} I discovered to my dismay today that the length field in the mmap call is
} a size_t, not an off_t. I was attempting to process a large (~50 MByte) file
} and found I was only processing the first 4 MBytes of it.
50 MB
"Daniel C. Sobral" wrote:
>
> Terry Lambert wrote:
> >
> > That's kind of the point. No other VFS stacking system out there
> > plays by FreeBSD's revamped rules.
>
> I look around and I see no standards. It is still time to be
> experimental.
Since someone complained of my meekness, let me re
I discovered to my dismay today that the length field in the mmap call is
a size_t, not an off_t. I was attempting to process a large (~50 MByte) file
and found I was only processing the first 4 MBytes of it.
Is this intentional, or just an artifact of the implementation? Is there any
reason NOT
You can check the change by recompiling a few utils with the change:
(find . -name \*.c | xargs grep -l qsort)
./bin/ps/ps.c
./contrib/gcc/*.c
./contrib/top/commands.c
./games/fortune/strfile/strfile.c
./gnu/usr.bin/sort/sort.c
./sbin/fsck/pass2.c
The fsck one is a nice one. Just wack your /usr
man 9 device_probe_and_attach
Nick
On Sat, 21 Aug 1999, Warner Losh wrote:
> In message <[EMAIL PROTECTED]> "David E. Cross" writes:
> : I have been writing a nasty kludge to treat a CardBus bridge as a standard
> : PCI bridge (with static config) .
>
> Ewe. Yuck. Wouldn't it be better to
On Aug 21, 2:10am, Wes Peters wrote:
} Subject: mmap mapped segment length
} I discovered to my dismay today that the length field in the mmap call is
} a size_t, not an off_t. I was attempting to process a large (~50 MByte) file
} and found I was only processing the first 4 MBytes of it.
50 MB
:The problem that occurs on the FreeBSD server is simply that the
:nfsrv_commit() procedure calls fsync() on the file... on the *ENTIRE*
:file, for every commit rpc, rather then syncing just the offset/range
:requested. I am looking into ways to fix this.
:
Ok, I've verified
I discovered to my dismay today that the length field in the mmap call is
a size_t, not an off_t. I was attempting to process a large (~50 MByte) file
and found I was only processing the first 4 MBytes of it.
Is this intentional, or just an artifact of the implementation? Is there any
reason NO
75 matches
Mail list logo
