1 | /* SPDX-License-Identifier: BSD-2-Clause */ |
---|
2 | |
---|
3 | /* |
---|
4 | * Copyright (c) 2016 embedded brains GmbH & Co. KG |
---|
5 | * |
---|
6 | * Redistribution and use in source and binary forms, with or without |
---|
7 | * modification, are permitted provided that the following conditions |
---|
8 | * are met: |
---|
9 | * 1. Redistributions of source code must retain the above copyright |
---|
10 | * notice, this list of conditions and the following disclaimer. |
---|
11 | * 2. Redistributions in binary form must reproduce the above copyright |
---|
12 | * notice, this list of conditions and the following disclaimer in the |
---|
13 | * documentation and/or other materials provided with the distribution. |
---|
14 | * |
---|
15 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
---|
16 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
---|
17 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
---|
18 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
---|
19 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
---|
20 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
---|
21 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
---|
22 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
---|
23 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
---|
24 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
---|
25 | * POSSIBILITY OF SUCH DAMAGE. |
---|
26 | */ |
---|
27 | |
---|
28 | #ifdef HAVE_CONFIG_H |
---|
29 | #include "config.h" |
---|
30 | #endif |
---|
31 | |
---|
32 | #include <rtems/assoc.h> |
---|
33 | |
---|
34 | #include <stdbool.h> |
---|
35 | #include <string.h> |
---|
36 | |
---|
37 | static size_t space( size_t buffer_size, size_t len ) |
---|
38 | { |
---|
39 | if ( len < buffer_size ) { |
---|
40 | return buffer_size - len; |
---|
41 | } else { |
---|
42 | return 0; |
---|
43 | } |
---|
44 | } |
---|
45 | |
---|
46 | size_t rtems_assoc_32_to_string( |
---|
47 | uint32_t value, |
---|
48 | char *buffer, |
---|
49 | size_t buffer_size, |
---|
50 | const rtems_assoc_32_pair *pairs, |
---|
51 | size_t pair_count, |
---|
52 | const char *separator, |
---|
53 | const char *fallback |
---|
54 | ) |
---|
55 | { |
---|
56 | size_t len; |
---|
57 | size_t i; |
---|
58 | |
---|
59 | len = 0; |
---|
60 | |
---|
61 | for ( i = 0; i < pair_count ; ++i ) { |
---|
62 | const rtems_assoc_32_pair *p; |
---|
63 | |
---|
64 | p = &pairs[ i ]; |
---|
65 | |
---|
66 | if ( ( value & p->bits ) != 0 ) { |
---|
67 | if ( len > 0 ) { |
---|
68 | len += strlcpy( &buffer[ len ], separator, space( buffer_size, len ) ); |
---|
69 | } |
---|
70 | |
---|
71 | len += strlcpy( &buffer[ len ], p->name, space( buffer_size, len ) ); |
---|
72 | } |
---|
73 | } |
---|
74 | |
---|
75 | if ( len == 0 ) { |
---|
76 | len += strlcpy( buffer, fallback, buffer_size ); |
---|
77 | } |
---|
78 | |
---|
79 | return len; |
---|
80 | } |
---|