Piotr Balcer
Piotr Balcer
@tristan957 As you can imagine, we are in the process of reprioritizing our current work. But I'm hoping we can finish the build system changes soon. We are 95% done...
Given `typedef unsigned long DWORD`, the old implementation: ``` DWORD rel_wait = (DWORD)(ms - now_ms); return rel_wait < 0 ? 0 : rel_wait; ``` and the new one: ``` return...
I changed the approach to concurrency a little. The new API exposes the region mechanism and doesn't try to retain order between entries in regions. This means that concurrency has...
@kilobyte can you either close this or address the problem?
This could be solved by including locks into the ranges tree with a flag denoting the type of a lock. Then, during tx_end, the tree traversal would include an unlock....
@krzycz: as Tomek said, the example is to show why we need the iteration. The time complexity of this operation currently is O(n \* (m + n)), where **n** is...
@GBuella : yes
This is likely the same issue as #4983, so I'll focus on that first.
@draghan is this still an issue?
Hmm... this doesn't cause any problems because the data from the out of bounds read is inserted in an array location that is `> n`. So it will never be...