nikic

12 ms·

61.
by nikic 8y ago
The only "dick move" involved here is the fact that zdnet wrote this article. Minor security issue lapses standard disclosure deadline? Who cares. Instead we get this attempt to sensationalize this into some kind of big Google vs.
62.
by nikic 9y ago
Windows is an LLP64 platform, meaning that the "long" type on Windows stays at 32bit even when you're compiling 64bit binaries. Getting 64bit integer support for PHP on Windows took a major port of all basic type usage to mov
63.
by nikic 9y ago
Disclaimer: PHP core dev. Be careful with microbenchmarks. From my experience, there tends to be very little correlation between performance improvements on microbenchmarks and real applications. If you improve performance on the microbench
64.
by nikic 9y ago
Tangentially related, my number one feature request for GitHub would be support for cross-referencing (a la Opengrok) in the code browser. Browsing through project code without a local checkout is one of the main things I do on GitHub, but
65.
by nikic 10y ago
If the function was implemented as an infinite loop, would you consider the code working correctly as well? After all, the result after execution of the function is always correct (ex falso quodlibet).
66.
by nikic 10y ago
It looks like recently, there has been a convergence of hashtable implementations across a number of programming languages. Details differ, but the general structure is now to use two arrays, one for storing the data in insertion order (thu
67.
by nikic 10y ago
Copy-pasting from an answer on reddit ( https://www.reddit.com/r/PHP/comments/5eu9pc/whats_new_in_ph... ): Because the alternative conflicts in case we ever introduce generics. Consider <?php new Foo&lt
68.
by nikic 10y ago
We tried to implement an LLVM based JIT compiler for PHP. There's basically two problems: First, LLVM is excruciatingly slow. If I remember correctly, it took more than a minute to compile all the WP functions for a front-page access (
69.
by nikic 10y ago
Our perf work in the 7.1 cycle hasn't shown any significant gains on real applications (we have some improvements for computationally intensive code -- like arithmetic inside tight loops). Whether or not the JIT will bring a major impr
70.
by nikic 10y ago
> The charged 42 backdated certificates are an intentional activity that we try to help the desperate customers since there are more than 3M users still using Windows XP sp2 in China. We like to make things simple that don’t realize how
71.
by nikic 10y ago
Thankfully the RCE vulnerability is only in OpenSSL 1.1, which is probably not commonly used yet. Does the second issue imply that OpenSSL does not have any automated tests for the CRL functionality?
72.
by nikic 10y ago
This article reads very weirdly to me. Are they arguing that disclosing confidential information, and subsequently opposing steps to contain the disclosed information, is perfectly fine because ... it can be found on the internet, precisely
73.
by nikic 10y ago
One consideration to take into account when choosing your hash table implementation is how much it is susceptible to the quality of the used hash function. Hash tables using chaining are pretty robust against low-quality hash functions. Usi
74.
by nikic 10y ago
Division by zero is undefined behavior, so the compiler is free to assume that the b==false branch is unreachable.
75.
by nikic 10y ago
This result is interesting not because tetraquark states were not previously expected to exist, but because it allows us to verify whether theoretical predictions about them coincide with the experimental results. I don't think there w
76.
by nikic 10y ago
To handle this case some SSA implementations add a concept of "pi" nodes, which are used to artificially split variables on branches that establish some useful data flow property. x1 = ... if (x1 > 0) { x2 = p
77.
by nikic 10y ago
The bug report contains a quote from the C++ standard: "An rvalue or lvalue t is swappable if and only if t is swappable with any rvalue or lvalue, respectively, of type T" What does this statement mean and why is it not tautologi
78.
by nikic 11y ago
Isn't value range inference for eliminating overflow / out-of-bounds checks, and LCM (/PRE) for hoisting checks out of loops pretty standard in any optimizing compiler nowadays?
79.
by nikic 11y ago
A fun r/programming subthread about this package: https://www.reddit.com/r/programming/comments/4bjss2/an_11_l... Those are just the three top-level dependencies. The package has 9 recursive depende
80.
by nikic 11y ago
The language changes that happened in PHP 7 are, with maybe two exceptions (func_get_args and foreach details) not related to performance. So if you're comparing performance (and not language support), there is nothing wrong with compa
81.
by nikic 11y ago
What I think many people fail to realize is that a large part of the code as a C compiler sees it is machine-generated. While I certainly do not tend to literally write out `if (1 != 0)` conditionals in my code, these and other similarly
82.
by nikic 11y ago
Static analyzers for different languages detect different types of errors. A static analyzer for PHP may try to find type mismatches. For statically typed languages that's obviously not relevant, as the compiler already handles it. On
83.
by nikic 11y ago
I think this is the first time I've seen PHP accused of getting "so much love"...
84.
by nikic 11y ago
You make it sound like people don't implement static analyzers from scratch for every static language out there. Static analysis is not obsoleted by using a "static" language. You can't even say that static analysis is
85.
by nikic 11y ago
Having a GC can make the implementation of lock-free data structures significantly easier. Without GC you effectively end up implementing a sort of very specialized garbage collection scheme for the data structure. This is a very nice artic
86.
by nikic 11y ago
That's true, I got confused with min and max there. gre's suggestion of using a min-max heap (if deletion is required) seems a reasonable workaround for this issue.
87.
by nikic 11y ago
Per the last posts: Number of heaps: O(n^(1/3)). Maximum elements per heap O(n^(2/3)). Lookup of an element. Find the heap with the element (i.e. element between maximum of previous heap and this heap). Perform linear search in he
88.
by nikic 11y ago
I wouldn't consider that particular question to be noise, even though it does not really fit the SO format. By "noise" I'm mainly referring to exceedingly simple questions, which could have been solved by even minimal re
89.
by nikic 11y ago
Questions with many upvotes do require more deletion votes. E.g. this question needed 10 votes, rather than the usual 3.
90.
by nikic 11y ago
After seeing a couple of posts like this, I'd like to provide an alternative perspective: I no longer actively answer questions on StackOverflow, because it is too hard to find worthwhile questions between all the noise. If someone spe

More ›