Hi Ingo, Here is the update to the jump patching optimization taking care of Peter's comments about register liveliness and instruction re-use by gcc optimizations. A good thing : it actually simplifies the code. Unfortunately, it adds 3 bytes to the instructions in i-cache because I now have to use a 5-bytes mov instruction so I can replace it with a 5-bytes jump. Therefore, 9 bytes are added to rather small functions (5-bytes mov + 2-bytes test + 2 bytes conditional branch) and 13 bytes are added to larger functions which needs a 6 bytes conditional branch at the branch site. Instead of having to execute a sequence of nop, nop and jump, we now only have to execute the near jump, which jumps either at the address following the conditional branch or at the target address of the conditional branch, depending on the immediate value variable state. Thanks to Peter for the review. Those two patches apply on top of sched-devel.git. Mathieu -- Mathieu Desnoyers Computer Engineering Ph.D. Student, Ecole Polytechnique de Montreal OpenPGP key fingerprint: 8CD5 52C3 8E3C 4140 715F BA06 3F25 A8FE 3BAE 9A68 --
| Alexandre Oliva | Re: Dual-Licensing Linux Kernel with GPL V2 and GPL V3 |
| Eric W. Biederman | Re: [net-2.6.24][patch 2/2] Dynamically allocate the loopback device |
| Ingo Molnar | Re: containers (was Re: -mm merge plans for 2.6.23) |
| Greg KH | [GIT PATCH] driver core patches against 2.6.24 |
git: | |
| Gerrit Renker | [PATCH 27/37] dccp: Integration of dynamic feature activation - part 2 (server side) |
| David Miller | [GIT]: Networking |
| Michael Riepe | Re: 2.6.27.19 + 28.7: network timeouts for r8169 and 8139too |
