blob: c8ad1bccaa7dc7a6973ff7fa4ea193563cb1c9cd [file] [log] [blame]
Adhemerval Zanella79618e02019-08-07 09:54:33 -03001/*
2 * strncmp test.
3 *
4 * Copyright (c) 2019, Arm Limited.
5 * SPDX-License-Identifier: MIT
6 */
7
8#include <stdint.h>
9#include <stdio.h>
10#include <stdlib.h>
11#include <string.h>
12#include "stringlib.h"
Szabolcs Nagy22fd9312020-04-16 11:46:02 +010013#include "stringtest.h"
Adhemerval Zanella79618e02019-08-07 09:54:33 -030014
Szabolcs Nagy0b7d1ae2020-05-12 16:40:08 +010015#define F(x) {#x, x},
16
Adhemerval Zanella79618e02019-08-07 09:54:33 -030017static const struct fun
18{
Szabolcs Nagy0b7d1ae2020-05-12 16:40:08 +010019 const char *name;
20 int (*fun) (const char *, const char *, size_t);
Adhemerval Zanella79618e02019-08-07 09:54:33 -030021} funtab[] = {
Szabolcs Nagy0b7d1ae2020-05-12 16:40:08 +010022 // clang-format off
23 F(strncmp)
Adhemerval Zanella23b9fc52019-08-07 10:31:33 -030024#if __aarch64__
Szabolcs Nagy0b7d1ae2020-05-12 16:40:08 +010025 F(__strncmp_aarch64)
26 F(__strncmp_aarch64_mte)
Adhemerval Zanella439687a2019-08-26 16:52:08 -030027# if __ARM_FEATURE_SVE
Szabolcs Nagy0b7d1ae2020-05-12 16:40:08 +010028 F(__strncmp_aarch64_sve)
Adhemerval Zanella439687a2019-08-26 16:52:08 -030029# endif
Adhemerval Zanella23b9fc52019-08-07 10:31:33 -030030#endif
Szabolcs Nagy0b7d1ae2020-05-12 16:40:08 +010031 {0, 0}
32 // clang-format on
Adhemerval Zanella79618e02019-08-07 09:54:33 -030033};
Szabolcs Nagy0b7d1ae2020-05-12 16:40:08 +010034#undef F
Adhemerval Zanella79618e02019-08-07 09:54:33 -030035
Adhemerval Zanella79618e02019-08-07 09:54:33 -030036#define A 32
37#define LEN 250000
Szabolcs Nagy0b7d1ae2020-05-12 16:40:08 +010038static char s1buf[LEN + 2 * A + 1];
39static char s2buf[LEN + 2 * A + 1];
Adhemerval Zanella79618e02019-08-07 09:54:33 -030040
Szabolcs Nagy0b7d1ae2020-05-12 16:40:08 +010041static void *
42alignup (void *p)
Adhemerval Zanella79618e02019-08-07 09:54:33 -030043{
Szabolcs Nagy0b7d1ae2020-05-12 16:40:08 +010044 return (void *) (((uintptr_t) p + A - 1) & -A);
Adhemerval Zanella79618e02019-08-07 09:54:33 -030045}
46
Szabolcs Nagy0b7d1ae2020-05-12 16:40:08 +010047static void
48test (const struct fun *fun, int s1align, int s2align, int maxlen, int diffpos,
49 int len, int delta)
Adhemerval Zanella79618e02019-08-07 09:54:33 -030050{
Szabolcs Nagy0b7d1ae2020-05-12 16:40:08 +010051 char *src1 = alignup (s1buf);
52 char *src2 = alignup (s2buf);
53 char *s1 = src1 + s1align;
54 char *s2 = src2 + s2align;
55 int r;
Adhemerval Zanella79618e02019-08-07 09:54:33 -030056
Szabolcs Nagy0b7d1ae2020-05-12 16:40:08 +010057 if (err_count >= ERR_LIMIT)
58 return;
59 if (len > LEN || s1align >= A || s2align >= A)
60 abort ();
61 if (diffpos >= len)
62 abort ();
63 if ((diffpos < 0) != (delta == 0))
64 abort ();
Adhemerval Zanella79618e02019-08-07 09:54:33 -030065
Szabolcs Nagy0b7d1ae2020-05-12 16:40:08 +010066 for (int i = 0; i < len + A; i++)
67 src1[i] = src2[i] = '?';
68 for (int i = 0; i < len; i++)
69 s1[i] = s2[i] = 'a' + i % 23;
70 if (delta)
71 s1[diffpos] += delta;
72 s1[len] = s2[len] = '\0';
Adhemerval Zanella79618e02019-08-07 09:54:33 -030073
Szabolcs Nagy0b7d1ae2020-05-12 16:40:08 +010074 r = fun->fun (s1, s2, maxlen);
Adhemerval Zanella79618e02019-08-07 09:54:33 -030075
Szabolcs Nagy0b7d1ae2020-05-12 16:40:08 +010076 if (diffpos >= maxlen)
77 {
78 diffpos = -1;
79 delta = 0;
80 }
81 if ((delta == 0 && r != 0) || (delta > 0 && r <= 0) || (delta < 0 && r >= 0))
82 {
83 ERR (
84 "%s(align %d, align %d, %d) (len=%d, diffpos=%d) failed, returned %d\n",
85 fun->name, s1align, s2align, maxlen, len, diffpos, r);
86 quoteat ("src1", src1, len + A, diffpos);
87 quoteat ("src2", src2, len + A, diffpos);
88 }
Adhemerval Zanella79618e02019-08-07 09:54:33 -030089}
90
Szabolcs Nagy0b7d1ae2020-05-12 16:40:08 +010091int
92main ()
Adhemerval Zanella79618e02019-08-07 09:54:33 -030093{
Szabolcs Nagy0b7d1ae2020-05-12 16:40:08 +010094 int r = 0;
95 for (int i = 0; funtab[i].name; i++)
96 {
97 err_count = 0;
98 for (int d = 0; d < A; d++)
99 for (int s = 0; s < A; s++)
100 {
101 int n;
102 test (funtab + i, d, s, 0, -1, 0, 0);
103 test (funtab + i, d, s, 1, -1, 0, 0);
104 test (funtab + i, d, s, 0, -1, 1, 0);
105 test (funtab + i, d, s, 1, -1, 1, 0);
106 test (funtab + i, d, s, 2, -1, 1, 0);
107 test (funtab + i, d, s, 1, 0, 1, 1);
108 test (funtab + i, d, s, 1, 0, 1, -1);
109 for (n = 2; n < 100; n++)
110 {
111 test (funtab + i, d, s, n, -1, n, 0);
112 test (funtab + i, d, s, n, n / 2, n, 1);
113 test (funtab + i, d, s, n / 2, -1, n, 0);
114 test (funtab + i, d, s, n / 2, n / 2, n, -1);
115 }
116 for (; n < LEN; n *= 2)
117 {
118 test (funtab + i, d, s, n, -1, n, 0);
119 test (funtab + i, d, s, n, n / 2, n, -1);
120 test (funtab + i, d, s, n / 2, -1, n, 0);
121 test (funtab + i, d, s, n / 2, n / 2, n, 1);
122 }
123 }
124 printf ("%s %s\n", err_count ? "FAIL" : "PASS", funtab[i].name);
125 if (err_count)
126 r = -1;
127 }
128 return r;
Adhemerval Zanella79618e02019-08-07 09:54:33 -0300129}