On 4/28/14, 6:02 PM, Keegan McAllister wrote:
Ultimately I'm sort of pessimistic about table-less interning, because it
proposes to speed up parsing at the expense of layout.
A thought.
If the goal is to speed up parsing in a separate task by avoiding
contention on a table, have we considere
burt"
Sent: Thursday, April 24, 2014 2:07:38 PM
Subject: Re: [dev-servo] Table-less string interning
> A collision in a widely used cryptographic hash would be a major,
> publishable security advance.
That's true for SHA-256 itself. But I ran the numbers, and it turns out bru
> A collision in a widely used cryptographic hash would be a major,
> publishable security advance.
That's true for SHA-256 itself. But I ran the numbers, and it turns out brute
force search for a collision on a 128-bit hash (even with no algorithmic
weakness) is feasible. I wrote more on the
On 4/23/14 6:06 PM, Boris Zbarsky wrote:
On 4/23/14, 8:53 PM, Brian Anderson wrote:
We're assuming nobody is going to be attacking Rust symbols though
Oh, right, that's the other worry.
We've had security issues in the past due to things like being treated as a file input by some parts of th
On 4/23/14, 8:53 PM, Brian Anderson wrote:
We're assuming nobody is going to be attacking Rust symbols though
Oh, right, that's the other worry.
We've had security issues in the past due to things like type="fİle"> being treated as a file input by some parts of the system
but not others. So
On 4/23/14, 7:38 PM, Keegan McAllister wrote:
* How much does a 128-bit compare cost, vs. 64 bits for a pointer?
Are we more or less assuming we're on 64-bit systems?
My memory is that the 128-bit IID compares we end up doing in
QueryInterface sorta suck, but we do a bunch of them at a time,
On 04/23/2014 04:38 PM, Keegan McAllister wrote:
I opened this as a GitHub issue (https://github.com/mozilla/servo/issues/2217)
but I thought I'd mention it here as well.
Rust already uses SipHash, which is supposed to be fast and crypto-strength.
But we would need to run it twice to get 128
- Original Message -
From: "Robert O'Callahan"
To: "Keegan McAllister"
Cc: dev-servo@lists.mozilla.org
Sent: Wednesday, April 23, 2014 5:35:29 PM
Subject: Re: [dev-servo] Table-less string interning
It seems like it would be a good idea to instrument Gecko to gather
It seems like it would be a good idea to instrument Gecko to gather a trace
of intern operations from regular Web browsing that you can run against
test programs.
Making the interned atom for <= 8-char or 4-char ASCII strings be the
string itself is a really interesting idea.
Another idea I like
I opened this as a GitHub issue (https://github.com/mozilla/servo/issues/2217)
but I thought I'd mention it here as well.
The traditional approach for string interning is:
* Interned strings are pointers
* To intern a string, look in a hash table mapping strings to pointers
* If it's not found,
10 matches
Mail list logo
