usr/src/lib/libc/port/i18n/wmemcpy.c

   1 /*
   2  * CDDL HEADER START
   3  *
   4  * The contents of this file are subject to the terms of the
   5  * Common Development and Distribution License (the "License").
   6  * You may not use this file except in compliance with the License.
   7  *
   8  * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
   9  * or http://www.opensolaris.org/os/licensing.
  10  * See the License for the specific language governing permissions
  11  * and limitations under the License.
  12  *
  13  * When distributing Covered Code, include this CDDL HEADER in each
  14  * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
  15  * If applicable, add the following below this CDDL HEADER, with the
  16  * fields enclosed by brackets "[]" replaced with your own identifying
  17  * information: Portions Copyright [yyyy] [name of copyright owner]
  18  *
  19  * CDDL HEADER END
  20  */
  21
  22 /*
  23  * Copyright 2008 Sun Microsystems, Inc.  All rights reserved.
  24  * Use is subject to license terms.
  25  */
  26
  27 #pragma ident   "%Z%%M% %I%     %E% SMI"
  28
  29 #include "lint.h"
  30 #include <sys/types.h>
  31 #include <wchar.h>
  32 #include <limits.h>
  33 #include <string.h>
  34 #include "libc.h"
  35
  36 wchar_t *
  37 wmemcpy(wchar_t *ws1, const wchar_t *ws2, size_t n)
  38 {
  39         wchar_t *p1, *p2;
  40         size_t  len;
  41         size_t  max = SIZE_MAX / sizeof (wchar_t);
  42
  43         if (n <= max) {
  44                 return ((wchar_t *)memcpy((void *)ws1,
  45                     (const void *)ws2, n * sizeof (wchar_t)));
  46         }
  47
  48         p1 = ws1;
  49         p2 = (wchar_t *)ws2;
  50         do {
  51                 if (n > max) {
  52                         len = max;
  53                 } else {
  54                         len = n;
  55                 }
  56                 (void) memcpy((void *)p1,
  57                     (const void *)p2, len * sizeof (wchar_t));
  58                 n = n - len;
  59                 p1 += len;
  60                 p2 += len;
  61         } while (n != 0);
  62         return (ws1);
  63 }