Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
dumael
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
7 ms
·
1.
▲
by
dumael
2y ago
The MIPS-I chip also had load delay slots along with branch delay slots.
2.
▲
by
dumael
3y ago
An aside but "Making Money" by Terry Pratchett references a similar sub-office of the Post Office in Ankh-Morpork--the Blind Letter Office. Amusingly, Lord Vetinari is able to assist with some as their addresses are mis-spelled va
3.
▲
by
dumael
4y ago
The Evening Standard ( https://www.standard.co.uk/news/uk/rwanda-asylum-deal-uk-asy... ) quotes 200 people from the Rwandan Government, "but that it could be scaled up". A research briefing document from t
4.
▲
by
dumael
4y ago
rescue.org ( https://www.rescue.org/uk/article/why-uk-government-should-r... section 5) reports GBP 140m so far, GBP 120m on up front costs along with The Times reporting a further payment of GBP 20m. The Migration
5.
▲
by
dumael
5y ago
'signed' and 'unsigned' on their own--act as short-hand for 'signed int' and 'unsigned int' in C and C++. Note that the size of an 'int' is dependant on the "data model"[1]. As for
6.
▲
by
dumael
5y ago
> This is a great overview. I don't remember having to put in padding instructions to prevent the pipeline issues mentioned here; maybe we just never ran into that. (I wrote pretty much all the R3000 code for Crash 1 and just do not
7.
▲
by
dumael
7y ago
Indeed, the likes of x86 little endian assumptions of programmers (even compiler engineers) can be hilarious (in the sad clown way) when targeting something like MIPS64 big endian.
8.
▲
by
dumael
8y ago
> There is no legal reason why ministers cannot reject Brexit; There is, for a revocation of article 50 notice to be legal, Parliament has to pass a motion directing the Government to do so[1]. [1] https://ukandeu.ac.uk/r
9.
▲
by
dumael
8y ago
Nit: It's Parliament cannot bind a future Parliament rather than UK governments cannot bind future UK governments. https://www.parliament.uk/about/how/role/sovereignty The subtly here is that usually a g
10.
▲
by
dumael
8y ago
MIPS has what's called an Application Specific Extension (ASE) basis for extending a given MIPS core for particular areas. The MIPS DSP ASE extends the base instruction set with certain instructions applicable to various codecs of the
11.
▲
by
dumael
8y ago
It would be more likely that nanoMIPS would be considered for open sourcing if that the implementation was to be made open source. Otherwise it would be the fobbing off of releasing the code to the InterAptiv which has MIPS16e(2) support.
12.
▲
by
dumael
8y ago
MIPSR6 does away with the HI/LO registers and have multiplication instructions which return the result to GPR registers. Pre-R6 MIPS cores have the MUL instruction which hide the usage of the HI/LO registers, but do clobber those
13.
▲
by
dumael
8y ago
nanoMIPS doesn't have delay slots IIRC. microMIPSR6 also deprecated delay slots for branches. MIPSR6 got rid of delay slots for a family of branches called 'compact branches' which have 'forbidden slots' which requi
14.
▲
by
dumael
10y ago
GC write barriers are implemented by expanding sequences that update pointers to perform some sort of additional action. Their purpose is to capture some information about the updated pointer that the GC can then use to avoid a full heap sc
15.
▲
by
dumael
10y ago
Almost every modern compiler uses some form of intermediate representation. The choice of IR is shaped by history and design. As the posted article shows, LLVM uses a SSA based IR to describe programs. GCC in contrast uses 2 IRs, GIMPLE and
16.
▲
by
dumael
10y ago
> It's pretty cool that clang uses this when it knows the value in the first argument is byte-sized. Clang is using the 8 bit subregister due to how it legalizes types. When LLVM-IR is compiled for a target, it undergoes a process c
17.
▲
by
dumael
10y ago
An aside: Tolpin and Toft designed an extension to the functional language ML which used region based memory managed instead of traditional garbage collection for ML. This lifted the lifetimes of variables into ML's type system (!!!) w
18.
▲
by
dumael
10y ago
> At the time Intel had already introduced some mobile silicon, but there was little uptake. So they were iterating; they wanted to improve for each succeeding generation. But they had a kind of design-by-committee process. One person or
19.
▲
by
dumael
10y ago
My old Q6600 could do this to a degree. Sometimes the fan wouldn't spin up on boot, so there was just passive cooling. i'd try playing a game/doing something and performance would start digging it's way to China. At whic
20.
▲
by
dumael
10y ago
I've dealt with bugs that existed at -O0, -O2 was fine. But the bug was in the compiler itself.
21.
▲
by
dumael
10y ago
One option in GCC I'm aware of is -faggressive-loop-optimizations . Quoting the manual "This option tells the loop optimizer to use language constraints to derive bounds for the number of iterations of a loop. This assumes that lo
22.
▲
by
dumael
11y ago
As I know, some of those contributors are just making systemic changes throughout LLVM, which would require touching the PowerPC backend. I'm not at all surprised at the @[a-z.]+.ibm.com contributors, the @anl.gov is the code maintaine
23.
▲
by
dumael
11y ago
The NSA are doing this now? I was friends with someone in TCD (Ireland) who did this work >3 years ago.
24.
▲
by
dumael
11y ago
That video was amazing, thank you.
25.
▲
by
dumael
11y ago
> I absolutely prefer strict typing myself. The issue becomes whether or not one thinks type coercion should be a thing. As a strong typing fanatic, I'd rather have the interpreter/compiler scream at me. In my opinion automatic
26.
▲
by
dumael
11y ago
I'll freely admit I'm not a fan of dynamic languages (mostly due to hacking the Erlang HiPE compiler) and in a previous life I was a Haskell guy. So I'm a fan of strict typing. > The unreasonable behavior is giving integer
27.
▲
by
dumael
11y ago
As a compiler developer I honestly shudder reading this. From the last example: > $ node > "5" + "1" > '51' > "5" - "1" > 4 How is this in anyway reasonable behavior? '+&
28.
▲
by
dumael
11y ago
Linking several hundred objects in a dozen or so libaries out of 2.5kish objects together is going to get hairily expensive memory wise no matter what way you do it. Compiling with debug information embedded raises that to around 12GB to do
29.
▲
by
dumael
11y ago
Yeah, "new" languages have a real tendency to go for "some sort" of automatic memory management. And they pick the easy option. Unfortunately, this can lead to wired-in assumptions, such as reference counting which can l
30.
▲
by
dumael
11y ago
Garbage collection worries about reachability of objects, not of access patterns. Some GC setups may not apply read/write barriers to stack objects as they are not required. The difficultly with stack centric working is that you have t
More ›