rdc12

25 ms·

211.
by rdc12 11y ago
"However this method of parsing is CPU bound because * it doesn't take advantage of multiple cores of modern CPUs. * memory bandwidth limitations" So not CPU bound at all then.
212.
UB Canaries (Undefined Behaviour)(blog.regehr.org)
4 points by rdc12 11y ago|0 comments
213.
by rdc12 11y ago
Lists like this often include the Pandemic board game the bit of that one that I love is you look at the reverse of the tile with Oz on it, you can see New Zealand there. (It sort of wraps around, can't think of a better way to put thi
214.
by rdc12 11y ago
You should keep in mind that XFS is primarily intended (it does get used in other places thou) for big systems/large raid arrays, with high IO loads etc. A kernel build is really a bad workload to benchmark a FS anyway.
215.
by rdc12 11y ago
lowRISC (an open SoC effort for the RISC-V arch) has a form of tagged memory, that among other things can be used for capabilities. [0] http://www.lowrisc.org/docs/memo-2014-001-tagged-memory-and-... [1] http:/&#
216.
by rdc12 11y ago
I personally didn't like the 7 languages book, to me it was a bit too shallow flavour of languages. The only take away from the book I had, was that IO looked to be a very sweet language to play with. It was a textbook for a class I ha
217.
by rdc12 11y ago
I believe I have seen some of The Little Schemer code translated into Clojure, and most of that looked pretty trivial changes. But I doubt you would gain anything from doing that. If you know Clojure you can pick up what you need of Scheme
218.
by rdc12 11y ago
Which is also brilliant, but is more about thinking in terms of types (more advanced type systems, then C/C++/Java etc). Should make a good warm up for learning the likes of OCaml and Haskell
219.
by rdc12 11y ago
LWN comments are generally pretty polite, I am really surprised that those sort of comments happened recenently on LWN
220.
by rdc12 11y ago
Both GCC and Clang can compile to branchless solutions for some conditional statements. The FizzBuzz problem for example both GCC and Clang can turn that into a small lookup table
221.
by rdc12 11y ago
Superoptimisers can be used on any sequance of instructions, to find a more optimial sequance. Since they approach the problem in a very different way to a compiler, it can do a better job in some cases. And it can work on hand written asse
222.
by rdc12 11y ago
Forgot to mention the site BookFlocks [1] which interviews people about books that were proven important to their career and life. Thou it looks like it might be dead on new material. [1] http://bookflocks.com/
223.
by rdc12 11y ago
You could do a web-app in C if you really wanted to, but you wouldn't be playing to the strengths of the language. But you could write a compiler or interpreter for a new language that is well suited to that... But then you would be ju
224.
by rdc12 12y ago
The annual threads on HN about, "What was the best book your read in $YEAR", tend to have some brilliant books that I would have never encounted any other way. Bill Gates annual list tends to be solid as well, but only a handful o
225.
by rdc12 12y ago
If the price per GB scales down to more "typical" sized drives, it still has interesting implications for filesystem devs. And given XFS being the strongest of the Linux filesystems for large systems they will undoubtedly try and
226.
by rdc12 12y ago
People don't buy Cortex-M or microcontrollers in general for processing power, their for low power consumption, size and cost (thou this may not the the aim for project).
227.
by rdc12 12y ago
There is a couple of other places where this fails pretty hard. If you compare to URL's on the same shared host, they will be considered equal and equality of URI's can change as the network goes up and down. I would imagine at so
228.
by rdc12 12y ago
It might be bit ugly, but couldn't you use a variable inplace of the compiler name, so that it would be trivial for someone to attempt using another compiler
229.
by rdc12 12y ago
Wouldn't there be cases where loop unrolling, is what enables SIMD instructions to be used? Is that the exception to your "rule"
230.
by rdc12 12y ago
One of the links on the post, links to a stack overflow question, that has this code. What is the purpose of the do-while loop with the condition 0, how is that different to not having the loop at all? #define BN_CONSTTIME_SWAP(ind) \ d
231.
by rdc12 12y ago
If this is being run on a binary only (for C anyway), then this won't be able to detect signed integer overflow if the compiler optimizes it away
232.
by rdc12 12y ago
But with TCO it is no longer needed to maintain a stack structure, so it would probably be a better stated as a tail-call recursive function is equivalent to iteration (assuming TCO)
233.
by rdc12 12y ago
Tridge (of Samba fame), did a really neat talk at LCA a few years back, where he reversed engineered a USB gadget in front of the audience (well the process anyway) http://mirror.linux.org.au/pub/linux.conf.au/2011
234.
by rdc12 12y ago
Curious to know which book that is, could you tell me please?
235.
by rdc12 12y ago
The Long Now date format isn't really a new date format thou, its just a symbolic extra digit to encourage thinking long term, it really is the same format in essence.
236.
by rdc12 12y ago
"In fact, the very example given in the article shows that without the ACCESS_ONCE, the compiler moved the access outside of the loop---thereby ensuring that it's accessed just once, ironically!!! Whereas by using ACCESS_ONCE, we
237.
by rdc12 12y ago
As soon as I read that, it was an o of course moment, especially with the time the orginal author spent talking about the ABI. Cheers
238.
by rdc12 12y ago
If I run the fib example on a Linux 64bit install and forget the -m32 flag (both GCC and Clang) it will return 0 for each call (the earlier return 42 example worked thou), add the flag and it works. Curious to know what change caused that?
239.
by rdc12 12y ago
"Something that succeeds as well as Java has to have some actual value" Sounds an awful lot like, the Bandwagon fallacy
240.
by rdc12 12y ago
And yet it has created a remarkable amount of buzz around it already

More ›