Index: uspace/lib/softint/generic/division.c
===================================================================
--- uspace/lib/softint/generic/division.c	(revision 1b20da07baaa3e3c424f62c927274e676e4295cd)
+++ uspace/lib/softint/generic/division.c	(revision 8565a42398543d14e36b2df6f7a70c6237b458f8)
@@ -45,23 +45,23 @@
 	unsigned int result;
 	int steps = sizeof(unsigned int) * 8;
-	
+
 	*remainder = 0;
 	result = 0;
-	
+
 	if (b == 0) {
 		/* FIXME: division by zero */
 		return 0;
 	}
-	
+
 	if (a < b) {
 		*remainder = a;
 		return 0;
 	}
-	
+
 	for (; steps > 0; steps--) {
 		/* shift one bit to remainder */
 		*remainder = ((*remainder) << 1) | (( a >> 31) & 0x1);
 		result <<= 1;
-		
+
 		if (*remainder >= b) {
 			*remainder -= b;
@@ -70,5 +70,5 @@
 		a <<= 1;
 	}
-	
+
 	return result;
 }
@@ -79,23 +79,23 @@
 	unsigned long long result;
 	int steps = sizeof(unsigned long long) * 8;
-	
+
 	*remainder = 0;
 	result = 0;
-	
+
 	if (b == 0) {
 		/* FIXME: division by zero */
 		return 0;
 	}
-	
+
 	if (a < b) {
 		*remainder = a;
 		return 0;
 	}
-	
+
 	for (; steps > 0; steps--) {
 		/* shift one bit to remainder */
 		*remainder = ((*remainder) << 1) | ((a >> 63) & 0x1);
 		result <<= 1;
-		
+
 		if (*remainder >= b) {
 			*remainder -= b;
@@ -104,5 +104,5 @@
 		a <<= 1;
 	}
-	
+
 	return result;
 }
@@ -113,8 +113,8 @@
 	unsigned int rem;
 	int result = (int) divandmod32(ABSVAL(a), ABSVAL(b), &rem);
-	
+
 	if (SGN(a) == SGN(b))
 		return result;
-	
+
 	return -result;
 }
@@ -125,8 +125,8 @@
 	unsigned long long rem;
 	long long result = (long long) divandmod64(ABSVAL(a), ABSVAL(b), &rem);
-	
+
 	if (SGN(a) == SGN(b))
 		return result;
-	
+
 	return -result;
 }
@@ -151,9 +151,9 @@
 	unsigned int rem;
 	divandmod32(a, b, &rem);
-	
+
 	/* if divident is negative, remainder must be too */
 	if (!(SGN(a)))
 		return -((int) rem);
-	
+
 	return (int) rem;
 }
@@ -164,9 +164,9 @@
 	unsigned long long rem;
 	divandmod64(a, b, &rem);
-	
+
 	/* if divident is negative, remainder must be too */
 	if (!(SGN(a)))
 		return -((long long) rem);
-	
+
 	return (long long) rem;
 }
@@ -192,10 +192,10 @@
 	unsigned int rem;
 	int result = (int) divandmod32(ABSVAL(a), ABSVAL(b), &rem);
-	
+
 	if (SGN(a) == SGN(b)) {
 		*c = rem;
 		return result;
 	}
-	
+
 	*c = -rem;
 	return -result;
@@ -212,10 +212,10 @@
 	unsigned long long rem;
 	long long result = (int) divandmod64(ABSVAL(a), ABSVAL(b), &rem);
-	
+
 	if (SGN(a) == SGN(b)) {
 		*c = rem;
 		return result;
 	}
-	
+
 	*c = -rem;
 	return -result;
@@ -226,10 +226,10 @@
 	unsigned long long rem;
 	long long result = (int) divandmod64(ABSVAL(a), ABSVAL(b), &rem);
-	
+
 	if (SGN(a) == SGN(b)) {
 		*c = rem;
 		return result;
 	}
-	
+
 	*c = -rem;
 	return -result;
Index: uspace/lib/softint/generic/multiplication.c
===================================================================
--- uspace/lib/softint/generic/multiplication.c	(revision 1b20da07baaa3e3c424f62c927274e676e4295cd)
+++ uspace/lib/softint/generic/multiplication.c	(revision 8565a42398543d14e36b2df6f7a70c6237b458f8)
@@ -53,12 +53,12 @@
 	unsigned int b1 = b >> 16;
 	unsigned int b2 = b & UINT16_MAX;
-	
+
 	unsigned long long t1 = a1 * b1;
 	unsigned long long t2 = a1 * b2;
 	t2 += a2 * b1;
 	unsigned long long t3 = a2 * b2;
-	
+
 	t3 = (((t1 << 16) + t2) << 16) + t3;
-	
+
 	return t3;
 }
@@ -70,40 +70,40 @@
 {
 	char neg = 0;
-	
+
 	if (a < 0) {
 		neg = !neg;
 		a = -a;
 	}
-	
+
 	if (b < 0) {
 		neg = !neg;
 		b = -b;
 	}
-	
+
 	unsigned long long a1 = a >> 32;
 	unsigned long long b1 = b >> 32;
-	
+
 	unsigned long long a2 = a & (UINT32_MAX);
 	unsigned long long b2 = b & (UINT32_MAX);
-	
+
 	if (SOFTINT_CHECK_OF && (a1 != 0) && (b1 != 0)) {
 		/* Error (overflow) */
 		return (neg ? INT64_MIN : INT64_MAX);
 	}
-	
+
 	/* (if OF checked) a1 or b1 is zero => result fits in 64 bits,
 	 * no need to another overflow check
 	 */
 	unsigned long long t1 = mul(a1, b2) + mul(b1, a2);
-	
+
 	if ((SOFTINT_CHECK_OF) && (t1 > UINT32_MAX)) {
 		/* Error (overflow) */
 		return (neg ? INT64_MIN : INT64_MAX);
 	}
-	
+
 	t1 = t1 << 32;
 	unsigned long long t2 = mul(a2, b2);
 	t2 += t1;
-	
+
 	/* t2 & (1ull << 63) - if this bit is set in unsigned long long,
 	 * result does not fit in signed one */
@@ -112,9 +112,9 @@
 		return (neg ? INT64_MIN : INT64_MAX);
 	}
-	
+
 	long long result = t2;
 	if (neg)
 		result = -result;
-	
+
 	return result;
 }
Index: uspace/lib/softint/generic/shift.c
===================================================================
--- uspace/lib/softint/generic/shift.c	(revision 1b20da07baaa3e3c424f62c927274e676e4295cd)
+++ uspace/lib/softint/generic/shift.c	(revision 8565a42398543d14e36b2df6f7a70c6237b458f8)
@@ -42,9 +42,9 @@
 
 	ll.s_whole = val;
-	
+
 	if (shift <= 0) {
 		return ll.s_whole;
 	}
-	
+
 	if (shift >= (int) WHOLE_BIT_CNT) {
 		ll.u_half[HI] = 0;