A helper for Karatsuba multiplication (k_mul). Takes a long "n" and an integer "size" representing the place to split, and sets low and high such that abs(n) == (high << size) + low, viewing the shift as being by digits. The sign bit is ignored, and the return values are >= 0. Returns 0 on success, -1 on failure. */
source not stored for this graph (policy: none)
no test coverage detected