Messages in this thread |  | | Date | Sat, 13 Apr 2013 16:55:38 +0200 | | From | Stanislaw Gruszka <> | | Subject | Re: [tip:sched/core] sched: Lower chances of cputime scaling overflow |
| |
On Thu, Apr 11, 2013 at 08:38:37AM -0700, Linus Torvalds wrote: > /* We know one of the values has a bit set in the high 32 bits */ > for (;;) { > /* Make sure "stime" is the bigger of stime/rtime */ > if (rtime > stime) { > u64 tmp = stime; stime = rtime; rtime = tmp; > }
For most workloads rtime is bigger than stime, so swapping those would save some cycles on common cases. Otherwise this algorithm looks great.
Thanks Stanislaw
|  |