Skip to content

Commit 4544450

Browse files
committed
Reduce symbol exposure
1 parent 92d96a1 commit 4544450

File tree

1 file changed

+14
-14
lines changed

1 file changed

+14
-14
lines changed

expression.c

+14-14
Original file line numberDiff line numberDiff line change
@@ -20,7 +20,7 @@
2020
* Expression data types
2121
*/
2222

23-
int GET_FRAC(int n)
23+
static int GET_FRAC(int n)
2424
{
2525
int x = n & 15;
2626
if (x & 8)
@@ -29,7 +29,7 @@ int GET_FRAC(int n)
2929
return x;
3030
}
3131

32-
int FP2INT(int n, int d)
32+
static int FP2INT(int n, int d)
3333
{
3434
while (n && n % 10 == 0) {
3535
++d;
@@ -43,7 +43,7 @@ int FP2INT(int n, int d)
4343
return ((n << 4) | (d & 15));
4444
}
4545

46-
int isNan(int x)
46+
static int isNan(int x)
4747
{
4848
return GET_FRAC(x) == GET_FRAC(NAN_INT);
4949
}
@@ -235,7 +235,7 @@ struct expr_var *expr_var(struct expr_var_list *vars, const char *s, size_t len)
235235
return v;
236236
}
237237

238-
int mult(int a, int b)
238+
static int mult(int a, int b)
239239
{
240240
int frac1 = GET_FRAC(a);
241241
int frac2 = GET_FRAC(b);
@@ -246,7 +246,7 @@ int mult(int a, int b)
246246
return FP2INT(n3, (frac1 + frac2));
247247
}
248248

249-
int divid(int a, int b)
249+
static int divid(int a, int b)
250250
{
251251
int frac1 = GET_FRAC(a);
252252
int frac2 = GET_FRAC(b);
@@ -265,7 +265,7 @@ int divid(int a, int b)
265265
return FP2INT(n3, frac3);
266266
}
267267

268-
int remain(int a, int b)
268+
static int remain(int a, int b)
269269
{
270270
int frac1 = GET_FRAC(a);
271271
int frac2 = GET_FRAC(b);
@@ -289,13 +289,13 @@ int remain(int a, int b)
289289
return FP2INT(n1, frac1);
290290
}
291291

292-
int right_shift(int a, int b)
292+
static int right_shift(int a, int b)
293293
{
294294
/* FIXME: should use 2-base? */
295295
return divid(a, mult(2 << 4, b));
296296
}
297297

298-
int power(int a, int b)
298+
static int power(int a, int b)
299299
{
300300
int frac1 = GET_FRAC(a);
301301
int frac2 = GET_FRAC(b);
@@ -322,13 +322,13 @@ int power(int a, int b)
322322
return FP2INT(n1, frac1);
323323
}
324324

325-
int left_shift(int a, int b)
325+
static int left_shift(int a, int b)
326326
{
327327
/* FIXME: should use 2-base? */
328328
return mult(a, power(2 << 4, b));
329329
}
330330

331-
int plus(int a, int b)
331+
static int plus(int a, int b)
332332
{
333333
int frac1 = GET_FRAC(a);
334334
int frac2 = GET_FRAC(b);
@@ -350,7 +350,7 @@ int plus(int a, int b)
350350
return FP2INT(n1, frac1);
351351
}
352352

353-
int minus(int a, int b)
353+
static int minus(int a, int b)
354354
{
355355
int frac1 = GET_FRAC(a);
356356
int frac2 = GET_FRAC(b);
@@ -371,7 +371,7 @@ int minus(int a, int b)
371371
return FP2INT(n1, frac1);
372372
}
373373

374-
int compare(int a, int b)
374+
static int compare(int a, int b)
375375
{
376376
int frac1 = GET_FRAC(a);
377377
int frac2 = GET_FRAC(b);
@@ -398,7 +398,7 @@ int compare(int a, int b)
398398
return flags;
399399
}
400400

401-
int bitwise_op(int a, int b, int op)
401+
static int bitwise_op(int a, int b, int op)
402402
{
403403
int frac1 = GET_FRAC(a);
404404
int frac2 = GET_FRAC(b);
@@ -443,7 +443,7 @@ int bitwise_op(int a, int b, int op)
443443
return FP2INT(n1, frac1);
444444
}
445445

446-
int not(int a)
446+
static int not(int a)
447447
{
448448
int frac = GET_FRAC(a);
449449
int n = GET_NUM(a);

0 commit comments

Comments
 (0)