| memset.c (35923) | memset.c (46079) |
|---|---|
| 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 --- 54 unchanged lines hidden (view full) --- 63void * 64memset(dst0, c0, length) 65 void *dst0; 66 register int c0; 67 register size_t length; 68#endif 69{ 70 register size_t t; | 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 --- 54 unchanged lines hidden (view full) --- 63void * 64memset(dst0, c0, length) 65 void *dst0; 66 register int c0; 67 register size_t length; 68#endif 69{ 70 register size_t t; |
| 71#ifndef BZERO |
|
| 71 register u_int c; | 72 register u_int c; |
| 73#endif |
|
| 72 register u_char *dst; 73 74 dst = dst0; 75 /* 76 * If not enough words, just fill bytes. A length >= 2 words 77 * guarantees that at least one of them is `complete' after 78 * any necessary alignment. For instance: 79 * --- 51 unchanged lines hidden --- | 74 register u_char *dst; 75 76 dst = dst0; 77 /* 78 * If not enough words, just fill bytes. A length >= 2 words 79 * guarantees that at least one of them is `complete' after 80 * any necessary alignment. For instance: 81 * --- 51 unchanged lines hidden --- |