| memset.c (8870) | memset.c (35923) |
|---|---|
| 1/*- 2 * Copyright (c) 1990, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * Mike Hibler and Chris Torek. 7 * 8 * Redistribution and use in source and binary forms, with or without --- 91 unchanged lines hidden (view full) --- 100 c = (c << 16) | c; /* u_int is 32 bits. */ 101#endif 102#if UINT_MAX > 0xffffffff 103 c = (c << 32) | c; /* u_int is 64 bits. */ 104#endif 105 } 106#endif 107 /* Align destination by filling in bytes. */ | 1/*- 2 * Copyright (c) 1990, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * Mike Hibler and Chris Torek. 7 * 8 * Redistribution and use in source and binary forms, with or without --- 91 unchanged lines hidden (view full) --- 100 c = (c << 16) | c; /* u_int is 32 bits. */ 101#endif 102#if UINT_MAX > 0xffffffff 103 c = (c << 32) | c; /* u_int is 64 bits. */ 104#endif 105 } 106#endif 107 /* Align destination by filling in bytes. */ |
| 108 if ((t = (int)dst & wmask) != 0) { | 108 if ((t = (long)dst & wmask) != 0) { |
| 109 t = wsize - t; 110 length -= t; 111 do { 112 *dst++ = VAL; 113 } while (--t != 0); 114 } 115 116 /* Fill words. Length was >= 2*words so we know t >= 1 here. */ --- 14 unchanged lines hidden --- | 109 t = wsize - t; 110 length -= t; 111 do { 112 *dst++ = VAL; 113 } while (--t != 0); 114 } 115 116 /* Fill words. Length was >= 2*words so we know t >= 1 here. */ --- 14 unchanged lines hidden --- |