Welcome to mirror list, hosted at ThFree Co, Russian Federation.

cygwin.com/git/newlib-cygwin.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
path: root/newlib/libc/machine/visium/memset.c
diff options
context:
space:
mode:
Diffstat (limited to 'newlib/libc/machine/visium/memset.c')
-rw-r--r--newlib/libc/machine/visium/memset.c677
1 files changed, 0 insertions, 677 deletions
diff --git a/newlib/libc/machine/visium/memset.c b/newlib/libc/machine/visium/memset.c
deleted file mode 100644
index bad64a96d..000000000
--- a/newlib/libc/machine/visium/memset.c
+++ /dev/null
@@ -1,677 +0,0 @@
-/* memset for the Visium processor.
-
- Copyright (c) 2015 Rolls-Royce Controls and Data Services Limited.
- All rights reserved.
-
- Redistribution and use in source and binary forms, with or without
- modification, are permitted provided that the following conditions are met:
-
- * Redistributions of source code must retain the above copyright notice,
- this list of conditions and the following disclaimer.
- * Redistributions in binary form must reproduce the above copyright
- notice, this list of conditions and the following disclaimer in the
- documentation and/or other materials provided with the distribution.
- * Neither the name of Rolls-Royce Controls and Data Services Limited nor
- the names of its contributors may be used to endorse or promote products
- derived from this software without specific prior written permission.
-
- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
- THE POSSIBILITY OF SUCH DAMAGE. */
-
-/* This file must be kept in sync with libgcc/config/visium/memset.c */
-
-#include <stddef.h>
-#include "memset.h"
-
-#define SET_32_OBJECTS(out) \
-do { \
- out [0] = m0; \
- out [1] = m0; \
- out [2] = m0; \
- out [3] = m0; \
- out [4] = m0; \
- out [5] = m0; \
- out [6] = m0; \
- out [7] = m0; \
- out [8] = m0; \
- out [9] = m0; \
- out [10] = m0; \
- out [11] = m0; \
- out [12] = m0; \
- out [13] = m0; \
- out [14] = m0; \
- out [15] = m0; \
- out [16] = m0; \
- out [17] = m0; \
- out [18] = m0; \
- out [19] = m0; \
- out [20] = m0; \
- out [21] = m0; \
- out [22] = m0; \
- out [23] = m0; \
- out [24] = m0; \
- out [25] = m0; \
- out [26] = m0; \
- out [27] = m0; \
- out [28] = m0; \
- out [29] = m0; \
- out [30] = m0; \
- out [31] = m0; \
- out += 32; \
-} while(0)
-
-#define SET_16_OBJECTS(out) \
-do { \
- out [0] = m0; \
- out [1] = m0; \
- out [2] = m0; \
- out [3] = m0; \
- out [4] = m0; \
- out [5] = m0; \
- out [6] = m0; \
- out [7] = m0; \
- out [8] = m0; \
- out [9] = m0; \
- out [10] = m0; \
- out [11] = m0; \
- out [12] = m0; \
- out [13] = m0; \
- out [14] = m0; \
- out [15] = m0; \
- out += 16; \
-} while(0)
-
-#define SET_12_OBJECTS(out) \
-do { \
- out [0] = m0; \
- out [1] = m0; \
- out [2] = m0; \
- out [3] = m0; \
- out [4] = m0; \
- out [5] = m0; \
- out [6] = m0; \
- out [7] = m0; \
- out [8] = m0; \
- out [9] = m0; \
- out [10] = m0; \
- out [11] = m0; \
- out += 12; \
-} while(0)
-
-#define SET_11_OBJECTS(out) \
-do { \
- out [0] = m0; \
- out [1] = m0; \
- out [2] = m0; \
- out [3] = m0; \
- out [4] = m0; \
- out [5] = m0; \
- out [6] = m0; \
- out [7] = m0; \
- out [8] = m0; \
- out [9] = m0; \
- out [10] = m0; \
- out += 11; \
-} while(0)
-
-#define SET_10_OBJECTS(out) \
-do { \
- out [0] = m0; \
- out [1] = m0; \
- out [2] = m0; \
- out [3] = m0; \
- out [4] = m0; \
- out [5] = m0; \
- out [6] = m0; \
- out [7] = m0; \
- out [8] = m0; \
- out [9] = m0; \
- out += 10; \
-} while(0)
-
-#define SET_9_OBJECTS(out) \
-do { \
- out [0] = m0; \
- out [1] = m0; \
- out [2] = m0; \
- out [3] = m0; \
- out [4] = m0; \
- out [5] = m0; \
- out [6] = m0; \
- out [7] = m0; \
- out [8] = m0; \
- out += 9; \
-} while(0)
-
-#define SET_8_OBJECTS(out) \
-do { \
- out [0] = m0; \
- out [1] = m0; \
- out [2] = m0; \
- out [3] = m0; \
- out [4] = m0; \
- out [5] = m0; \
- out [6] = m0; \
- out [7] = m0; \
- out += 8; \
-} while(0)
-
-#define SET_7_OBJECTS(out) \
-do { \
- out [0] = m0; \
- out [1] = m0; \
- out [2] = m0; \
- out [3] = m0; \
- out [4] = m0; \
- out [5] = m0; \
- out [6] = m0; \
- out += 7; \
-} while(0)
-
-#define SET_6_OBJECTS(out) \
-do { \
- out [0] = m0; \
- out [1] = m0; \
- out [2] = m0; \
- out [3] = m0; \
- out [4] = m0; \
- out [5] = m0; \
- out += 6; \
-} while(0)
-
-#define SET_5_OBJECTS(out) \
-do { \
- out [0] = m0; \
- out [1] = m0; \
- out [2] = m0; \
- out [3] = m0; \
- out [4] = m0; \
- out += 5; \
-} while(0)
-
-#define SET_4_OBJECTS(out) \
-do { \
- out [0] = m0; \
- out [1] = m0; \
- out [2] = m0; \
- out [3] = m0; \
- out += 4; \
-} while(0)
-
-#define SET_3_OBJECTS(out) \
-do { \
- out [0] = m0; \
- out [1] = m0; \
- out [2] = m0; \
- out += 3; \
-} while(0)
-
-#define SET_2_OBJECTS(out) \
-do { \
- out [0] = m0; \
- out [1] = m0; \
- out += 2; \
-} while(0)
-
-#define SET_1_OBJECT(out) \
-do { \
- out [0] = m0; \
- out += 1; \
-} while(0)
-
-
-static inline void
-__int_memset (void *__restrict s1, int val, size_t n)
-{
- int value = n;
- int loop_var;
- int *out = s1;
- int count;
- int m0 = val;
-
- /* This code currently give a stall for any value with a 1->2 in the low 5
- bits, i.e. 1,2, 33,34 ? not acceptable! */
- switch (value & 0x1f)
- {
- case 0:
- break;
- case 1:
- SET_1_OBJECT (out);
- break;
- case 2:
- SET_2_OBJECTS (out);
- break;
- case 3:
- SET_3_OBJECTS (out);
- break;
- case 4:
- SET_4_OBJECTS (out);
- break;
- case 5:
- SET_5_OBJECTS (out);
- break;
- case 6:
- SET_6_OBJECTS (out);
- break;
- case 7:
- SET_7_OBJECTS (out);
- break;
- case 8:
- SET_8_OBJECTS (out);
- break;
- case 9:
- SET_9_OBJECTS (out);
- break;
- case 10:
- SET_10_OBJECTS (out);
- break;
- case 11:
- SET_11_OBJECTS (out);
- break;
- case 12:
- SET_12_OBJECTS (out);
- break;
- case 13:
- SET_9_OBJECTS (out);
- SET_4_OBJECTS (out);
- break;
- case 14:
- SET_12_OBJECTS (out);
- SET_2_OBJECTS (out);
- break;
- case 15:
- SET_11_OBJECTS (out);
- SET_4_OBJECTS (out);
- break;
- case 16:
- SET_16_OBJECTS (out);
- break;
- case 17:
- SET_11_OBJECTS (out);
- SET_6_OBJECTS (out);
- break;
- case 18:
- SET_9_OBJECTS (out);
- SET_9_OBJECTS (out);
- break;
- case 19:
- SET_16_OBJECTS (out);
- SET_3_OBJECTS (out);
- break;
- case 20:
- SET_16_OBJECTS (out);
- SET_4_OBJECTS (out);
- break;
- case 21:
- SET_16_OBJECTS (out);
- SET_5_OBJECTS (out);
- break;
- case 22:
- SET_16_OBJECTS (out);
- SET_6_OBJECTS (out);
- break;
- case 23:
- SET_16_OBJECTS (out);
- SET_7_OBJECTS (out);
- break;
- case 24:
- SET_16_OBJECTS (out);
- SET_8_OBJECTS (out);
- break;
- case 25:
- SET_16_OBJECTS (out);
- SET_9_OBJECTS (out);
- break;
- case 26:
- SET_16_OBJECTS (out);
- SET_10_OBJECTS (out);
- break;
- case 27:
- SET_16_OBJECTS (out);
- SET_11_OBJECTS (out);
- break;
- case 28:
- SET_16_OBJECTS (out);
- SET_8_OBJECTS (out);
- SET_4_OBJECTS (out);
- break;
- case 29:
- SET_16_OBJECTS (out);
- SET_9_OBJECTS (out);
- SET_4_OBJECTS (out);
- break;
- case 30:
- SET_16_OBJECTS (out);
- SET_12_OBJECTS (out);
- SET_2_OBJECTS (out);
- break;
- case 31:
- SET_16_OBJECTS (out);
- SET_11_OBJECTS (out);
- SET_4_OBJECTS (out);
- break;
- }
-
- /* This loop governs the asmptoptic behaviour of this algorithm, for long
- word copies. */
- count = value >> 5;
- for (loop_var = 0; loop_var < count; loop_var++)
- SET_32_OBJECTS (out);
-}
-
-static inline void
-__short_int_memset (void *__restrict s1, int val, size_t n)
-{
- int value = n;
- int loop_var;
- int short *out = s1;
- int count;
- int m0 = val;
-
- /* This code currently give a stall for any value with a 1->2 in the low 5
- bits, i.e. 1,2, 33,34 ? not acceptable! */
- switch (value & 0x1f)
- {
- case 0:
- break;
- case 1:
- SET_1_OBJECT (out);
- break;
- case 2:
- SET_2_OBJECTS (out);
- break;
- case 3:
- SET_3_OBJECTS (out);
- break;
- case 4:
- SET_4_OBJECTS (out);
- break;
- case 5:
- SET_5_OBJECTS (out);
- break;
- case 6:
- SET_6_OBJECTS (out);
- break;
- case 7:
- SET_7_OBJECTS (out);
- break;
- case 8:
- SET_8_OBJECTS (out);
- break;
- case 9:
- SET_9_OBJECTS (out);
- break;
- case 10:
- SET_10_OBJECTS (out);
- break;
- case 11:
- SET_11_OBJECTS (out);
- break;
- case 12:
- SET_12_OBJECTS (out);
- break;
- case 13:
- SET_9_OBJECTS (out);
- SET_4_OBJECTS (out);
- break;
- case 14:
- SET_12_OBJECTS (out);
- SET_2_OBJECTS (out);
- break;
- case 15:
- SET_11_OBJECTS (out);
- SET_4_OBJECTS (out);
- break;
- case 16:
- SET_16_OBJECTS (out);
- break;
- case 17:
- SET_11_OBJECTS (out);
- SET_6_OBJECTS (out);
- break;
- case 18:
- SET_9_OBJECTS (out);
- SET_9_OBJECTS (out);
- break;
- case 19:
- SET_16_OBJECTS (out);
- SET_3_OBJECTS (out);
- break;
- case 20:
- SET_16_OBJECTS (out);
- SET_4_OBJECTS (out);
- break;
- case 21:
- SET_16_OBJECTS (out);
- SET_5_OBJECTS (out);
- break;
- case 22:
- SET_16_OBJECTS (out);
- SET_6_OBJECTS (out);
- break;
- case 23:
- SET_16_OBJECTS (out);
- SET_7_OBJECTS (out);
- break;
- case 24:
- SET_16_OBJECTS (out);
- SET_8_OBJECTS (out);
- break;
- case 25:
- SET_16_OBJECTS (out);
- SET_9_OBJECTS (out);
- break;
- case 26:
- SET_16_OBJECTS (out);
- SET_10_OBJECTS (out);
- break;
- case 27:
- SET_16_OBJECTS (out);
- SET_11_OBJECTS (out);
- break;
- case 28:
- SET_16_OBJECTS (out);
- SET_8_OBJECTS (out);
- SET_4_OBJECTS (out);
- break;
- case 29:
- SET_16_OBJECTS (out);
- SET_9_OBJECTS (out);
- SET_4_OBJECTS (out);
- break;
- case 30:
- SET_16_OBJECTS (out);
- SET_12_OBJECTS (out);
- SET_2_OBJECTS (out);
- break;
- case 31:
- SET_16_OBJECTS (out);
- SET_11_OBJECTS (out);
- SET_4_OBJECTS (out);
- break;
- }
-
- /* This loop governs the asmptoptic behaviour of this algorithm, for long
- word copies. */
- count = value >> 5;
- for (loop_var = 0; loop_var < count; loop_var++)
- SET_32_OBJECTS (out);
-}
-
-static inline void
-__byte_memset (void *__restrict s1, int val, size_t n)
-{
- int value = n;
- int loop_var;
- char *out = s1;
- int count;
- int m0 = val;
-
- /* This code currently give a stall for any value with a 1->2 in the low 5
- bits, i.e. 1,2, 33,34 ? not acceptable! */
- switch (value & 0x1f)
- {
- case 0:
- break;
- case 1:
- SET_1_OBJECT (out);
- break;
- case 2:
- SET_2_OBJECTS (out);
- break;
- case 3:
- SET_3_OBJECTS (out);
- break;
- case 4:
- SET_4_OBJECTS (out);
- break;
- case 5:
- SET_5_OBJECTS (out);
- break;
- case 6:
- SET_6_OBJECTS (out);
- break;
- case 7:
- SET_7_OBJECTS (out);
- break;
- case 8:
- SET_8_OBJECTS (out);
- break;
- case 9:
- SET_9_OBJECTS (out);
- break;
- case 10:
- SET_10_OBJECTS (out);
- break;
- case 11:
- SET_11_OBJECTS (out);
- break;
- case 12:
- SET_12_OBJECTS (out);
- break;
- case 13:
- SET_9_OBJECTS (out);
- SET_4_OBJECTS (out);
- break;
- case 14:
- SET_12_OBJECTS (out);
- SET_2_OBJECTS (out);
- break;
- case 15:
- SET_11_OBJECTS (out);
- SET_4_OBJECTS (out);
- break;
- case 16:
- SET_16_OBJECTS (out);
- break;
- case 17:
- SET_11_OBJECTS (out);
- SET_6_OBJECTS (out);
- break;
- case 18:
- SET_9_OBJECTS (out);
- SET_9_OBJECTS (out);
- break;
- case 19:
- SET_16_OBJECTS (out);
- SET_3_OBJECTS (out);
- break;
- case 20:
- SET_16_OBJECTS (out);
- SET_4_OBJECTS (out);
- break;
- case 21:
- SET_16_OBJECTS (out);
- SET_5_OBJECTS (out);
- break;
- case 22:
- SET_16_OBJECTS (out);
- SET_6_OBJECTS (out);
- break;
- case 23:
- SET_16_OBJECTS (out);
- SET_7_OBJECTS (out);
- break;
- case 24:
- SET_16_OBJECTS (out);
- SET_8_OBJECTS (out);
- break;
- case 25:
- SET_16_OBJECTS (out);
- SET_9_OBJECTS (out);
- break;
- case 26:
- SET_16_OBJECTS (out);
- SET_10_OBJECTS (out);
- break;
- case 27:
- SET_16_OBJECTS (out);
- SET_11_OBJECTS (out);
- break;
- case 28:
- SET_16_OBJECTS (out);
- SET_8_OBJECTS (out);
- SET_4_OBJECTS (out);
- break;
- case 29:
- SET_16_OBJECTS (out);
- SET_9_OBJECTS (out);
- SET_4_OBJECTS (out);
- break;
- case 30:
- SET_16_OBJECTS (out);
- SET_12_OBJECTS (out);
- SET_2_OBJECTS (out);
- break;
- case 31:
- SET_16_OBJECTS (out);
- SET_11_OBJECTS (out);
- SET_4_OBJECTS (out);
- break;
- }
-
- /* This loop governs the asmptoptic behaviour of this algorithm, for long
- word copies. */
- count = value >> 5;
- for (loop_var = 0; loop_var < count; loop_var++)
- SET_32_OBJECTS (out);
-}
-
-
-/* Exposed interface. */
-
-void *
-memset (void *s, int c, size_t n)
-{
- void *result = s;
-
- /* None of the following handles setting zero bytes. */
- if (n != 0)
- {
- unsigned test = (unsigned) s | (unsigned) n;
-
- if (test & 1)
- __byte_memset (s, c, n);
- else if (test & 2)
- {
- short int sc = (short int) ((c << 8) + (char) c);
- __short_int_memset (s, sc, n >> 1);
- }
- else
- {
- int ic = (c << 24) + ((char) c << 16) + ((char) c << 8) + (char) c;
- __int_memset (s, ic, n >> 2);
- }
- }
-
- return result;
-}
generated by cgit v1.2.3 (git 2.25.1) at 2024-08-08 02:15:10 +0300