thanks. -- rob
On Jan 21, 2008, at 3:00 PM, Pete Wyckoff wrote:
[EMAIL PROTECTED] wrote on Mon, 21 Jan 2008 14:24 -0600:
New versions will still be able to find bstream files for files
created by
old servers? -- Rob
Bstreams didn't move by this patch. Else we would have needed a
major ver
[EMAIL PROTECTED] wrote on Mon, 21 Jan 2008 14:24 -0600:
> New versions will still be able to find bstream files for files created by
> old servers? -- Rob
Bstreams didn't move by this patch. Else we would have needed a
major version bump.
-- Pete
> On Jan 18, 2008, at 12:42 PM
Yes, The bstream macro never used the coll_id.
-sam
On Jan 21, 2008, at 2:24 PM, Rob Ross wrote:
New versions will still be able to find bstream files for files
created by old servers? -- Rob
On Jan 18, 2008, at 12:42 PM, Pete Wyckoff wrote:
[EMAIL PROTECTED] wrote on Fri, 18 Jan 2008 11
New versions will still be able to find bstream files for files
created by old servers? -- Rob
On Jan 18, 2008, at 12:42 PM, Pete Wyckoff wrote:
[EMAIL PROTECTED] wrote on Fri, 18 Jan 2008 11:51 -0600:
On Jan 17, 2008, at 3:26 PM, Pete Wyckoff wrote:
I just noticed this bit in trove-dbpf/d
New versions will still be able to find bstream files for files
created by old servers? -- Rob
On Jan 18, 2008, at 12:42 PM, Pete Wyckoff wrote:
[EMAIL PROTECTED] wrote on Fri, 18 Jan 2008 11:51 -0600:
On Jan 17, 2008, at 3:26 PM, Pete Wyckoff wrote:
I just noticed this bit in trove-dbpf/d
[EMAIL PROTECTED] wrote on Fri, 18 Jan 2008 11:51 -0600:
> On Jan 17, 2008, at 3:26 PM, Pete Wyckoff wrote:
>
>> I just noticed this bit in trove-dbpf/dbpf.h. The code carefully
>> builds (( << 24) | ) then does a modulo against
>> a power of 2, effectively stripping off all but the low bits of
>>
On Jan 17, 2008, at 3:26 PM, Pete Wyckoff wrote:
I just noticed this bit in trove-dbpf/dbpf.h. The code carefully
builds (( << 24) | ) then does a modulo against
a power of 2, effectively stripping off all but the low bits of
the handleid.
The collid is not used in the hash at all. Just in c
I just noticed this bit in trove-dbpf/dbpf.h. The code carefully
builds (( << 24) | ) then does a modulo against
a power of 2, effectively stripping off all but the low bits of
the handleid.
The collid is not used in the hash at all. Just in case anybody
thought this was important. I've ever on
