libera/#petalisp - IRC Chatlog
Search
7:42:52
hayley
Well, I was going to ask if there was a PSHUFB function in SB-SIMD, and there is already. Neato.
7:43:58
hayley
I decided to see how other regular expression engines handle searching for substrings with SIMD, and two use the "Teddy" algorithm <https://github.com/jneem/teddy#teddy-1> which requires PSHUFB.
7:56:29
heisig
It's just that sb-simd has so many functions that many of them have been executed zero times so far.
7:56:58
hayley
Sure. But I guess I haven't properly tested anything until I have compiled code using it.
8:38:04
hayley
Though, the compiled code is so fast that pushing to the list of results takes more time than running the DFA on tests with ~100 characters or so. So I am thinking I need to redo the interface first.
8:46:12
hayley
The other solution is to benchmark with larger strings, of course. Oh, and since characters on SBCL are 32 bits, I can also get a 4× increase in the magnitude of marketing numbers by switching from Gcharacters/second to GB/second.
13:22:26
heisig
The test suite is the worst offender. I need to generate full calls with 1, 2, 3, and 4 arguments to check the compiler macro of each arithmetic function.
13:37:54
heisig
I have tests for almost 500 functions by now. Which sounds good until you realize there are 1445 exported function in total.