* Compute the position of the lowest set bit (trailing zeros). * This determines the alignment of an address for fpage sizing. * Returns the shift value such that (1 << shift) is the largest * power of 2 that divides addr. */
source not stored for this graph (policy: none)
no outgoing calls
no test coverage detected