bb 49 common/gcc-millicode/adddi3.c union uu aa, bb, sum; bb 52 common/gcc-millicode/adddi3.c bb.ll = b; bb 53 common/gcc-millicode/adddi3.c sum.ui[L] = aa.ui[L] + bb.ui[L]; bb 54 common/gcc-millicode/adddi3.c sum.ui[H] = aa.ui[H] + bb.ui[H] + (sum.ui[L] < bb.ui[L]); bb 46 common/gcc-millicode/anddi3.c union uu aa, bb; bb 49 common/gcc-millicode/anddi3.c bb.ll = b; bb 50 common/gcc-millicode/anddi3.c aa.ui[0] &= bb.ui[0]; bb 51 common/gcc-millicode/anddi3.c aa.ui[1] &= bb.ui[1]; bb 48 common/gcc-millicode/cmpdi2.c union uu aa, bb; bb 51 common/gcc-millicode/cmpdi2.c bb.ll = b; bb 52 common/gcc-millicode/cmpdi2.c return (aa.si[H] < bb.si[H] ? 0 : aa.si[H] > bb.si[H] ? 2 : bb 53 common/gcc-millicode/cmpdi2.c aa.ui[L] < bb.ui[L] ? 0 : aa.ui[L] > bb.ui[L] ? 2 : 1); bb 46 common/gcc-millicode/iordi3.c union uu aa, bb; bb 49 common/gcc-millicode/iordi3.c bb.ll = b; bb 50 common/gcc-millicode/iordi3.c aa.ui[0] |= bb.ui[0]; bb 51 common/gcc-millicode/iordi3.c aa.ui[1] |= bb.ui[1]; bb 48 common/gcc-millicode/subdi3.c union uu aa, bb, diff; bb 51 common/gcc-millicode/subdi3.c bb.ll = b; bb 52 common/gcc-millicode/subdi3.c diff.ui[L] = aa.ui[L] - bb.ui[L]; bb 53 common/gcc-millicode/subdi3.c diff.ui[H] = aa.ui[H] - bb.ui[H] - (diff.ui[L] > aa.ui[L]); bb 47 common/gcc-millicode/ucmpdi2.c union uu aa, bb; bb 50 common/gcc-millicode/ucmpdi2.c bb.ull = b; bb 51 common/gcc-millicode/ucmpdi2.c return (aa.ui[H] < bb.ui[H] ? 0 : aa.ui[H] > bb.ui[H] ? 2 : bb 52 common/gcc-millicode/ucmpdi2.c aa.ui[L] < bb.ui[L] ? 0 : aa.ui[L] > bb.ui[L] ? 2 : 1); bb 46 common/gcc-millicode/xordi3.c union uu aa, bb; bb 49 common/gcc-millicode/xordi3.c bb.ll = b; bb 50 common/gcc-millicode/xordi3.c aa.ui[0] ^= bb.ui[0]; bb 51 common/gcc-millicode/xordi3.c aa.ui[1] ^= bb.ui[1]; bb 866 user/sbin/sfsck/sfsck.c dirsortfunc(const void *aa, const void *bb) bb 869 user/sbin/sfsck/sfsck.c const int *b = (const int *)bb;