19851b340SKonstantin Belousov /*-
29851b340SKonstantin Belousov * Copyright (c) 2017 Juniper Networks. All rights reserved.
39851b340SKonstantin Belousov *
49851b340SKonstantin Belousov * Redistribution and use in source and binary forms, with or without
59851b340SKonstantin Belousov * modification, are permitted provided that the following conditions
69851b340SKonstantin Belousov * are met:
79851b340SKonstantin Belousov * 1. Redistributions of source code must retain the above copyright
89851b340SKonstantin Belousov * notice, this list of conditions and the following disclaimer.
99851b340SKonstantin Belousov * 2. Redistributions in binary form must reproduce the above copyright
109851b340SKonstantin Belousov * notice, this list of conditions and the following disclaimer in the
119851b340SKonstantin Belousov * documentation and/or other materials provided with the distribution.
129851b340SKonstantin Belousov *
139851b340SKonstantin Belousov * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
149851b340SKonstantin Belousov * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
159851b340SKonstantin Belousov * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
169851b340SKonstantin Belousov * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
179851b340SKonstantin Belousov * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
189851b340SKonstantin Belousov * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
199851b340SKonstantin Belousov * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
209851b340SKonstantin Belousov * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
219851b340SKonstantin Belousov * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
229851b340SKonstantin Belousov * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
239851b340SKonstantin Belousov * SUCH DAMAGE.
249851b340SKonstantin Belousov */
259851b340SKonstantin Belousov
269851b340SKonstantin Belousov #include <errno.h>
279851b340SKonstantin Belousov #include <stddef.h>
289851b340SKonstantin Belousov #include <stdint.h>
299851b340SKonstantin Belousov #include <string.h>
309851b340SKonstantin Belousov #include "libc_private.h"
319851b340SKonstantin Belousov
329851b340SKonstantin Belousov /* ISO/IEC 9899:2011 K.3.7.4.1 */
339851b340SKonstantin Belousov errno_t
memset_s(void * s,rsize_t smax,int c,rsize_t n)349851b340SKonstantin Belousov memset_s(void *s, rsize_t smax, int c, rsize_t n)
359851b340SKonstantin Belousov {
369851b340SKonstantin Belousov errno_t ret;
379851b340SKonstantin Belousov rsize_t lim;
389851b340SKonstantin Belousov unsigned char v;
399851b340SKonstantin Belousov volatile unsigned char *dst;
409851b340SKonstantin Belousov
419851b340SKonstantin Belousov ret = EINVAL;
4225b73e63SKonstantin Belousov lim = n < smax ? n : smax;
439851b340SKonstantin Belousov v = (unsigned char)c;
449851b340SKonstantin Belousov dst = (unsigned char *)s;
459851b340SKonstantin Belousov if (s == NULL) {
469851b340SKonstantin Belousov __throw_constraint_handler_s("memset_s : s is NULL", ret);
479851b340SKonstantin Belousov } else if (smax > RSIZE_MAX) {
489851b340SKonstantin Belousov __throw_constraint_handler_s("memset_s : smax > RSIZE_MAX",
499851b340SKonstantin Belousov ret);
509851b340SKonstantin Belousov } else if (n > RSIZE_MAX) {
519851b340SKonstantin Belousov __throw_constraint_handler_s("memset_s : n > RSIZE_MAX", ret);
529851b340SKonstantin Belousov } else {
539851b340SKonstantin Belousov while (lim > 0)
549851b340SKonstantin Belousov dst[--lim] = v;
5525b73e63SKonstantin Belousov if (n > smax) {
5625b73e63SKonstantin Belousov __throw_constraint_handler_s("memset_s : n > smax",
5725b73e63SKonstantin Belousov ret);
5825b73e63SKonstantin Belousov } else {
599851b340SKonstantin Belousov ret = 0;
609851b340SKonstantin Belousov }
6125b73e63SKonstantin Belousov }
629851b340SKonstantin Belousov return (ret);
639851b340SKonstantin Belousov }
64