Live data from Hacker News

Viewing profile — sanjoy_das

sanjoy_das

HN member
Joined
Mon, Jun 22, 2015, 12:43 AM UTC
HN karma
81
Public activity
25 items

About sanjoy_das

http://playingwithpointers.com

Recent public activity

  1. story
  2. comment
    Comment #30169044

    > It is interesting to me that right now this is sitting on the HN homepage directly adjacent to: "Tesla to recall vehicles that may disobey stop signs (reuters.com)" Based on http…

  3. comment
    Comment #29711261

    Another data point: I tend to receive far more recruiter cold calls in an old email address that I no longer use than in my newer more active email address.

  4. story
  5. comment
    Comment #19308483

    Similar: tfcompile AOT compiles TensorFlow models into native code using XLA ( https://www.tensorflow.org/xla/tfcompile ).

  6. story
  7. story
  8. story
  9. comment
    Comment #14432627

    That's an especially interesting possibility since LLVM now has IR support for C++ coroutines.

  10. comment
    Comment #14413305

    > Recursion and memoization is easy but dynamic programming doesn't really feel as natural. Ways to get better? Just do more? Once you have the recursive solution, the DP solution …

  11. story
  12. comment
    Comment #14190515

    I can never understand this attitude. Programmers are people -- why is it surprising that some of them are ethically flexible?

  13. comment
    Comment #14074346

    My guess is that they meant "up" in the sense of "up in post dominator tree".

  14. comment
    Comment #12155143

    > How did the other thread get the reference to the object? The only possible existing reference is the one we are using to decrement the shared counter. I don't think this affects…

  15. comment
    Comment #12153901

    In (other) words, the situation is that you've just decremented the reference count of an object, because you've nulled out the only location in the heap that reached it. The refer…

  16. story
  17. comment
    Comment #12111568

    Yup. The "obvious" downside to that is that you'll burn CPU cycles and memory by generating and keeping around a slow-but-correct compile for every function.

  18. comment
    Comment #12111507

    Is this what you're looking for: http://www.playingwithpointers.com/check-widening-in-llvm.ht... ?

  19. comment
    Comment #12111494

    Yes they're definitely close, but I don't know if there are subtle differences in semantics between what we have in LLVM and what Swift needs (since I'm not familiar with Swift).

  20. story
  21. story
  22. comment
    Comment #10811801

    Interesting observation -- just because I've checked `%i` is within array bounds, doesn't mean `a[%i]` is safe to access, since `%i` could be `undef` and pass the range check spuri…

  23. comment
    Comment #10133753

    From the thesis the post linked to: ``` Although limbo lists are accessed using lock-free operations, and garbage collection does not interfere with other mutator processes, this r…

  24. comment
    Comment #9856234

    With ARC sharing objects across threads becomes trickier. First of all, in the general case you'll have to do atomic increments and decrements which tend to be fairly expensive, an…

  25. comment
    Comment #9755617

    Another interesting data point is libFirm: http://pp.ipd.kit.edu/firm/ which regalloc's directly over SSA.