The equality test indicates how long we spin, so do that first.
Signed-off-by: H. Peter Anvin <hpa@linux.intel.com>
int i;
for (i = sizeof(a->field) / sizeof(a->field[0]) - 1; i >= 0; i--) {
int i;
for (i = sizeof(a->field) / sizeof(a->field[0]) - 1; i >= 0; i--) {
- if (a->field[i] < b->field[i])
- return -1;
- else if (a->field[i] > b->field[i])
- return 1;
+ if (a->field[i] == b->field[i])
+ continue;
+
+ return (a->field[i] > b->field[i]) ? 1 : -1;