Searched full:efficiently (Results 1 – 25 of 259) sorted by relevance
1234567891011
4 …e execution path through which execution reached this EIP. The BPU can efficiently predict the fol…14 …e execution path through which execution reached this EIP. The BPU can efficiently predict the fol…24 …e execution path through which execution reached this EIP. The BPU can efficiently predict the fol…34 …e execution path through which execution reached this EIP. The BPU can efficiently predict the fol…44 …e execution path through which execution reached this EIP. The BPU can efficiently predict the fol…54 …e execution path through which execution reached this EIP. The BPU can efficiently predict the fol…64 …e execution path through which execution reached this EIP. The BPU can efficiently predict the fol…74 …e execution path through which execution reached this EIP. The BPU can efficiently predict the fol…84 …e execution path through which execution reached this EIP. The BPU can efficiently predict the fol…350 …e execution path through which execution reached this EIP. The BPU can efficiently predict the fol…
4 …e execution path through which execution reached this EIP. The BPU can efficiently predict the fol…14 …e execution path through which execution reached this EIP. The BPU can efficiently predict the fol…24 …e execution path through which execution reached this EIP. The BPU can efficiently predict the fol…34 …e execution path through which execution reached this EIP. The BPU can efficiently predict the fol…44 …e execution path through which execution reached this EIP. The BPU can efficiently predict the fol…54 …e execution path through which execution reached this EIP. The BPU can efficiently predict the fol…64 …e execution path through which execution reached this EIP. The BPU can efficiently predict the fol…74 …e execution path through which execution reached this EIP. The BPU can efficiently predict the fol…84 …e execution path through which execution reached this EIP. The BPU can efficiently predict the fol…347 …e execution path through which execution reached this EIP. The BPU can efficiently predict the fol…
13 efficiently allocate sk_buffs without introducing any potential for
9 used by Android to efficiently allocate buffers
16 efficiently allocate sk_buffs without introducing any potential for
134 efficiently implemented.193 However the atomic_fetch_add() might be implemented more efficiently.
9 efficiently mapping small regions of an I/O device to the CPU. The initial
2 * Xtensa doesn't handle unaligned accesses efficiently.
8 to easily and efficiently run guest operating systems. Normally, these guests14 allowing a guest to use VMX instructions, and correctly and efficiently
11 to easily and efficiently run guest operating systems. Normally, these guests17 allowing a guest to use VMX instructions, and correctly and efficiently
8 used by Android to efficiently allocate buffers
153 efficiently implemented.218 However the atomic_fetch_add() might be implemented more efficiently.
19 Merkle tree root hash also allows efficiently supporting
15 efficiently driving high peak power into small loudspeakers.
27 efficiently. The optional hardware development platform further provides real
22 * with the allocations for initrd and fdt more efficiently.
15 * more efficiently than a btree which will result in less disk space use,188 * This lets you iterate through all the entries in an array efficiently
14 * specific hacks for copying pages efficiently, while 0xffff4000
13 * specific hacks for copying pages efficiently, while 0xffff4000