On Fri, Jun 06, 2014 at 10:11:57AM +0200, Otto Moerbeek wrote:
On Thu, Jun 05, 2014 at 09:41:03AM -0600, Theo de Raadt wrote:
The new malloc has been comitted, so now take the next step.
This changes _dl_malloc to a regular non-zeroing _dl_malloc and uses
_dl_calloc and
Hi,
the howmany macro as used in param.h and select.h is prone to an integer
overflow. It adds divisor-1 to the base value, which means that it
COULD overflow.
Most of the times, the howmany macro is used with file descriptors and
polling, would be hard to overflow it. Especially due to C
On Sat, Jun 14, 2014 at 7:13 AM, Tobias Stoeckmann tob...@stoeckmann.org
wrote:
Hi,
the howmany macro as used in param.h and select.h is prone to an integer
overflow. It adds divisor-1 to the base value, which means that it
COULD overflow.
Most of the times, the howmany macro is used with
Tweaked version. The previous version was working just fine, but this
one also marks hardlinks and symlinks as skippable, as should be.
It also adjusts the pace of progress slightly (making the meter jump AFTER
skipping the entry), and also it does prepare_to_extract systematically
(which will
Hi,
fsck_msdos is prone to an infinite loop if cluster chains in the
filesystem are infinite: FAT handles clusters as linked lists, and at
worst this list can be cyclic.
Android included a fix from Samsung for this issue, with the commit
b6ee08aadb580341a4d80943741b80de16a88b5d:
On Fri, Jun 13, 2014 at 10:40, sven falempin wrote:
Now soliciting diffs to change readwrite to a loop with two buffers
that poll()s in all four directions. :)
Is using kqueue ok ?
like : http://pastebin.com/F1c5Hswi
uh, maybe. the kqueue changes make it harder to review at first, but
On 14 June 2014 09:09, Tobias Stoeckmann tob...@stoeckmann.org wrote:
Hi,
fsck_msdos is prone to an infinite loop if cluster chains in the
filesystem are infinite: FAT handles clusters as linked lists, and at
worst this list can be cyclic.
Android included a fix from Samsung for this issue,
On Sat, Jun 14, 2014 at 11:25:22AM -0400, Kenneth Westerback wrote:
/* follow the chain to its end (hopefully) */
- for (p = head;
+ for (len = fat[head].length, p = head;
(n = fat[p].next) = CLUST_FIRST n
On 14 June 2014 11:57, Tobias Stoeckmann tob...@stoeckmann.org wrote:
On Sat, Jun 14, 2014 at 11:25:22AM -0400, Kenneth Westerback wrote:
/* follow the chain to its end (hopefully) */
- for (p = head;
+ for (len = fat[head].length, p = head;
Hi,
When assigning mount points to an already-partitioned disk
without a its fstab handy, it's annoying to type the partition
letters one after another. (And sing the alphabet each time or
look at the output of 'p' for letters after 'f'. I blame hex.)
I could go back to preeschool and learn the
10 matches
Mail list logo