| commit | f35f4b3396e337c4fe0fb75e8887d5fbc94dbde8 | |
| author | Paul Eggert <eggert@cs.ucla.edu> | |
| Fri, 3 Dec 2010 22:39:23 +0000 (3 14:39 -0800) | ||
| committer | Paul Eggert <eggert@cs.ucla.edu> | |
| Sat, 4 Dec 2010 07:43:30 +0000 (3 23:43 -0800) | ||
| tree | f698e540459e5ce1d660123af24ab214bd2374a0 | treesnapshot (tar.gz zip) |
| parent | eb989f4b75cd8ef738bfee4f7363e73da293cff3 | commitdiff |
sort: tune struct_merge_node slightly
* src/sort.c (struct merge_node): 'lock' is now the actual lock,
not a pointer to the lock; there's no need for indirection here.
Make 'level' unsigned int instead of size_t, since it is a
bit-shift count; also, move it next to a bool so that it's more
likely to take less space. All uses changed.
(sortlines, sort): Spell out initialization instead of using an
initializer. This makes the initializer a bit easier to understand,
and avoids unnecessary stores into the spin lock.
* src/sort.c (struct merge_node): 'lock' is now the actual lock,
not a pointer to the lock; there's no need for indirection here.
Make 'level' unsigned int instead of size_t, since it is a
bit-shift count; also, move it next to a bool so that it's more
likely to take less space. All uses changed.
(sortlines, sort): Spell out initialization instead of using an
initializer. This makes the initializer a bit easier to understand,
and avoids unnecessary stores into the spin lock.
| src/sort.c | diffblobblamehistory |