-
Notifications
You must be signed in to change notification settings - Fork 6
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
93d0b6d
commit 97e296b
Showing
50 changed files
with
1,718 additions
and
774 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,117 @@ | ||
/* | ||
* GS1 Syntax Dictionary. Copyright (c) 2022-2024 GS1 AISBL. | ||
* | ||
* Licensed under the Apache License, Version 2.0 (the "License"); | ||
* you may not use this file except in compliance with the License. | ||
* | ||
* You may obtain a copy of the License at | ||
* | ||
* http://www.apache.org/licenses/LICENSE-2.0 | ||
* | ||
* Unless required by applicable law or agreed to in writing, software | ||
* distributed under the License is distributed on an "AS IS" BASIS, | ||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
* See the License for the specific language governing permissions and | ||
* limitations under the License. | ||
* | ||
*/ | ||
|
||
/** | ||
* @file gs1syntaxdictionary-utils.h | ||
* | ||
* @brief This header provides utility macros used by the reference linter | ||
* functions. | ||
* | ||
*/ | ||
|
||
#ifndef GS1_SYNTAXDICTIONARY_UTILS_H | ||
#define GS1_SYNTAXDICTIONARY_UTILS_H | ||
|
||
#include "gs1syntaxdictionary.h" | ||
#include <limits.h> | ||
|
||
|
||
/** | ||
* @brief Return from a linter indicating that no problem was detected with the | ||
* given data. | ||
* | ||
* @note For many linters this does not guarantee that the data is valid, only | ||
* that it satisfies all of the checks performed by the linter. | ||
* | ||
*/ | ||
#define GS1_LINTER_RETURN_OK \ | ||
do { \ | ||
return GS1_LINTER_OK; \ | ||
} while (0) | ||
|
||
|
||
/** | ||
* @brief Return from a linter indicating that a problem was detected with the | ||
* given data. | ||
* | ||
* @param [in] error An error of type ::gs1_lint_err_t to return. | ||
* @param [in] position The starting position of the invalid data. | ||
* @param [in] length The length of the invalid data segment. | ||
* | ||
*/ | ||
#define GS1_LINTER_RETURN_ERROR(error, position, length) \ | ||
do { \ | ||
if (err_pos) *err_pos = position; \ | ||
if (err_len) *err_len = length; \ | ||
return error; \ | ||
} while (0) | ||
|
||
|
||
/** | ||
* @brief Perform a lookup of a position in a bit field | ||
* | ||
* @param [in] bit The bit position in the field to lookup. The position | ||
* must be in the field otherwise the behaviour is undefined. | ||
* @param [in] field An array whose elements (of type with arbitrary size) when | ||
* concatinated produce a single bit field whose positions | ||
* are numbered from left to right (MSB of first element to | ||
* LSB of last element). | ||
* | ||
* The macro's effect is to set the value of the variable `valid` to `1` if | ||
* the position numbered `bit` is set in the `field`. | ||
* | ||
*/ | ||
#define GS1_LINTER_BITFIELD_LOOKUP(bit, field) \ | ||
do { \ | ||
int w = CHAR_BIT * sizeof(field[0]); \ | ||
assert((size_t)(bit/w) < sizeof(field) / sizeof(field[0])); \ | ||
if (field[bit/w] & (1ull << (w-1) >> (bit%w))) \ | ||
valid = 1; \ | ||
} while (0) | ||
|
||
|
||
/** | ||
* @brief Perform a binary search for a search term in a sorted set of strings. | ||
* | ||
* @param [in] needle A search term string to be exactly matched. | ||
* @param [in] haystack A array of strings to be searched. The array must be | ||
* otherwise the matching behaviour is undefined. | ||
* | ||
* The macro's effect is to set the value of the variable `valid` to `1` if | ||
* `needle` is found in `haystack`. | ||
* | ||
*/ | ||
#define GS1_LINTER_BINARY_SEARCH(needle, haystack) \ | ||
do { \ | ||
size_t s = 0; \ | ||
size_t e = sizeof(haystack) / sizeof(haystack[0]); \ | ||
while (s < e) { \ | ||
const size_t m = s + (e - s) / 2; \ | ||
const int cmp = strcmp(haystack[m], needle); \ | ||
if (cmp < 0) \ | ||
s = m + 1; \ | ||
else if (cmp > 0) \ | ||
e = m; \ | ||
else { \ | ||
valid = 1; \ | ||
break; \ | ||
} \ | ||
} \ | ||
} while (0) | ||
|
||
#endif /* GS1_SYNTAXDICTIONARY_UTILS_H */ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.