Blame


1 3448adb0 2022-11-02 op /* See LICENSE file for copyright and license details. */
2 3448adb0 2022-11-02 op #include <errno.h>
3 3448adb0 2022-11-02 op #include <math.h>
4 3448adb0 2022-11-02 op #include <stdint.h>
5 3448adb0 2022-11-02 op #include <stdio.h>
6 3448adb0 2022-11-02 op #include <stdlib.h>
7 3448adb0 2022-11-02 op #include <string.h>
8 3448adb0 2022-11-02 op
9 3448adb0 2022-11-02 op #include "../grapheme.h"
10 3448adb0 2022-11-02 op #include "../gen/character-test.h"
11 3448adb0 2022-11-02 op #include "util.h"
12 3448adb0 2022-11-02 op
13 3448adb0 2022-11-02 op #include <utf8proc.h>
14 3448adb0 2022-11-02 op
15 3448adb0 2022-11-02 op #define NUM_ITERATIONS 100000
16 3448adb0 2022-11-02 op
17 3448adb0 2022-11-02 op struct break_benchmark_payload {
18 3448adb0 2022-11-02 op uint_least32_t *buf;
19 3448adb0 2022-11-02 op utf8proc_int32_t *buf_utf8proc;
20 3448adb0 2022-11-02 op size_t buflen;
21 3448adb0 2022-11-02 op };
22 3448adb0 2022-11-02 op
23 3448adb0 2022-11-02 op void
24 3448adb0 2022-11-02 op libgrapheme(const void *payload)
25 3448adb0 2022-11-02 op {
26 3448adb0 2022-11-02 op uint_least16_t state = 0;
27 3448adb0 2022-11-02 op const struct break_benchmark_payload *p = payload;
28 3448adb0 2022-11-02 op size_t i;
29 3448adb0 2022-11-02 op
30 3448adb0 2022-11-02 op for (i = 0; i + 1 < p->buflen; i++) {
31 3448adb0 2022-11-02 op (void)grapheme_is_character_break(p->buf[i], p->buf[i+1],
32 3448adb0 2022-11-02 op &state);
33 3448adb0 2022-11-02 op }
34 3448adb0 2022-11-02 op }
35 3448adb0 2022-11-02 op
36 3448adb0 2022-11-02 op void
37 3448adb0 2022-11-02 op libutf8proc(const void *payload)
38 3448adb0 2022-11-02 op {
39 3448adb0 2022-11-02 op utf8proc_int32_t state = 0;
40 3448adb0 2022-11-02 op const struct break_benchmark_payload *p = payload;
41 3448adb0 2022-11-02 op size_t i;
42 3448adb0 2022-11-02 op
43 3448adb0 2022-11-02 op for (i = 0; i + 1 < p->buflen; i++) {
44 3448adb0 2022-11-02 op (void)utf8proc_grapheme_break_stateful(p->buf_utf8proc[i],
45 3448adb0 2022-11-02 op p->buf_utf8proc[i+1],
46 3448adb0 2022-11-02 op &state);
47 3448adb0 2022-11-02 op }
48 3448adb0 2022-11-02 op }
49 3448adb0 2022-11-02 op
50 3448adb0 2022-11-02 op int
51 3448adb0 2022-11-02 op main(int argc, char *argv[])
52 3448adb0 2022-11-02 op {
53 3448adb0 2022-11-02 op struct break_benchmark_payload p;
54 3448adb0 2022-11-02 op double baseline = (double)NAN;
55 3448adb0 2022-11-02 op size_t i;
56 3448adb0 2022-11-02 op
57 3448adb0 2022-11-02 op (void)argc;
58 3448adb0 2022-11-02 op
59 3448adb0 2022-11-02 op if ((p.buf = generate_cp_test_buffer(character_break_test,
60 3448adb0 2022-11-02 op LEN(character_break_test),
61 3448adb0 2022-11-02 op &(p.buflen))) == NULL) {
62 3448adb0 2022-11-02 op return 1;
63 3448adb0 2022-11-02 op }
64 3448adb0 2022-11-02 op if ((p.buf_utf8proc = malloc(p.buflen * sizeof(*(p.buf_utf8proc)))) == NULL) {
65 3448adb0 2022-11-02 op fprintf(stderr, "malloc: %s\n", strerror(errno));
66 3448adb0 2022-11-02 op exit(1);
67 3448adb0 2022-11-02 op }
68 3448adb0 2022-11-02 op for (i = 0; i < p.buflen; i++) {
69 3448adb0 2022-11-02 op /*
70 3448adb0 2022-11-02 op * there is no overflow, as we know that the maximum
71 3448adb0 2022-11-02 op * codepoint is 0x10FFFF, which is way below 2^31
72 3448adb0 2022-11-02 op */
73 3448adb0 2022-11-02 op p.buf_utf8proc[i] = (utf8proc_int32_t)p.buf[i];
74 3448adb0 2022-11-02 op }
75 3448adb0 2022-11-02 op
76 3448adb0 2022-11-02 op printf("%s\n", argv[0]);
77 3448adb0 2022-11-02 op run_benchmark(libgrapheme, &p, "libgrapheme ", NULL, "comparison",
78 3448adb0 2022-11-02 op &baseline, NUM_ITERATIONS, p.buflen - 1);
79 3448adb0 2022-11-02 op run_benchmark(libutf8proc, &p, "libutf8proc ", NULL, "comparison",
80 3448adb0 2022-11-02 op &baseline, NUM_ITERATIONS, p.buflen - 1);
81 3448adb0 2022-11-02 op
82 3448adb0 2022-11-02 op free(p.buf);
83 3448adb0 2022-11-02 op free(p.buf_utf8proc);
84 3448adb0 2022-11-02 op
85 3448adb0 2022-11-02 op return 0;
86 3448adb0 2022-11-02 op }