243  *              divisor             - 32-bit divisor
257 		     u32 divisor, u64 *out_quotient, u32 *out_remainder)  in acpi_ut_short_divide()  argument
265 	/* Always check for a zero divisor */  in acpi_ut_short_divide()
267 	if (divisor == 0) {  in acpi_ut_short_divide()
278 	ACPI_DIV_64_BY_32(0, dividend_ovl.part.hi, divisor,  in acpi_ut_short_divide()
281 	ACPI_DIV_64_BY_32(remainder32, dividend_ovl.part.lo, divisor,  in acpi_ut_short_divide()
301  *              in_divisor          - Divisor
316 	union uint64_overlay divisor;  in acpi_ut_divide()  local
327 	/* Always check for a zero divisor */  in acpi_ut_divide()
334 	divisor.full = in_divisor;  in acpi_ut_divide()
336 	if (divisor.part.hi == 0) {  in acpi_ut_divide()
338 		 * 1) Simplest case is where the divisor is 32 bits, we can  in acpi_ut_divide()
347 		ACPI_DIV_64_BY_32(0, dividend.part.hi, divisor.part.lo,  in acpi_ut_divide()
350 		ACPI_DIV_64_BY_32(partial1, dividend.part.lo, divisor.part.lo,  in acpi_ut_divide()
356 		 * 2) The general case where the divisor is a full 64 bits  in acpi_ut_divide()
361 		normalized_divisor = divisor;  in acpi_ut_divide()
363 		/* Normalize the operands (shift until the divisor is < 32 bits) */  in acpi_ut_divide()
384 		partial1 = quotient.part.lo * divisor.part.hi;  in acpi_ut_divide()
385 		partial2.full = (u64) quotient.part.lo * divisor.part.lo;  in acpi_ut_divide()
396 						remainder.full -= divisor.full;  in acpi_ut_divide()
400 					remainder.full -= divisor.full;  in acpi_ut_divide()
445 		     u32 divisor, u64 *out_quotient, u32 *out_remainder)  in acpi_ut_short_divide()  argument
450 	/* Always check for a zero divisor */  in acpi_ut_short_divide()
452 	if (divisor == 0) {  in acpi_ut_short_divide()
460 		*out_quotient = in_dividend / divisor;  in acpi_ut_short_divide()
463 		*out_remainder = (u32) (in_dividend % divisor);  in acpi_ut_short_divide()
475 	/* Always check for a zero divisor */  in acpi_ut_divide()