mirror of
https://git.code.sf.net/p/zint/code
synced 2025-05-21 02:35:14 -04:00
libzint.so: suppress exporting INTERNAL functions to the shared library; ZINT_TEST
This commit is contained in:
parent
c524d32227
commit
bca82ecc0d
58 changed files with 489 additions and 491 deletions
|
@ -29,13 +29,14 @@
|
|||
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||
SUCH DAMAGE.
|
||||
*/
|
||||
/* vim: set ts=4 sw=4 et : */
|
||||
|
||||
#include <stdio.h>
|
||||
#include <string.h>
|
||||
#include "common.h"
|
||||
#include "large.h"
|
||||
|
||||
void binary_add(short int accumulator[], short int input_buffer[]) { /* Binary addition */
|
||||
INTERNAL void binary_add(short int accumulator[], short int input_buffer[]) { /* Binary addition */
|
||||
int i, carry;
|
||||
carry = 0;
|
||||
|
||||
|
@ -92,7 +93,7 @@ void binary_add(short int accumulator[], short int input_buffer[]) { /* Binary a
|
|||
}
|
||||
}
|
||||
|
||||
void binary_subtract(short int accumulator[], short int input_buffer[]) {
|
||||
INTERNAL void binary_subtract(short int accumulator[], short int input_buffer[]) {
|
||||
/* 2's compliment subtraction */
|
||||
/* take input_buffer from accumulator and put answer in accumulator */
|
||||
int i;
|
||||
|
@ -115,7 +116,7 @@ void binary_subtract(short int accumulator[], short int input_buffer[]) {
|
|||
binary_add(accumulator, sub_buffer);
|
||||
}
|
||||
|
||||
void binary_multiply(short int reg[], char data[]) {
|
||||
INTERNAL void binary_multiply(short int reg[], char data[]) {
|
||||
/* Multiply the contents of reg[] by a number */
|
||||
short int temp[112] = {0};
|
||||
short int accum[112] = {0};
|
||||
|
@ -135,7 +136,7 @@ void binary_multiply(short int reg[], char data[]) {
|
|||
}
|
||||
}
|
||||
|
||||
void shiftdown(short int buffer[]) {
|
||||
INTERNAL void shiftdown(short int buffer[]) {
|
||||
int i;
|
||||
|
||||
buffer[102] = 0;
|
||||
|
@ -146,7 +147,7 @@ void shiftdown(short int buffer[]) {
|
|||
}
|
||||
}
|
||||
|
||||
void shiftup(short int buffer[]) {
|
||||
INTERNAL void shiftup(short int buffer[]) {
|
||||
int i;
|
||||
|
||||
for (i = 102; i > 0; i--) {
|
||||
|
@ -156,7 +157,7 @@ void shiftup(short int buffer[]) {
|
|||
buffer[0] = 0;
|
||||
}
|
||||
|
||||
short int islarger(short int accum[], short int reg[]) {
|
||||
INTERNAL short int islarger(short int accum[], short int reg[]) {
|
||||
/* Returns 1 if accum[] is larger than reg[], else 0 */
|
||||
int i, latch, larger;
|
||||
latch = 0;
|
||||
|
@ -178,7 +179,7 @@ short int islarger(short int accum[], short int reg[]) {
|
|||
return larger;
|
||||
}
|
||||
|
||||
void binary_load(short int reg[], char data[], const size_t src_len) {
|
||||
INTERNAL void binary_load(short int reg[], char data[], const size_t src_len) {
|
||||
size_t read;
|
||||
int i;
|
||||
short int temp[112] = {0};
|
||||
|
@ -208,5 +209,3 @@ void binary_load(short int reg[], char data[], const size_t src_len) {
|
|||
binary_add(reg, temp);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue