-
Notifications
You must be signed in to change notification settings - Fork 21
/
Copy pathpsi_common_math_pkg.vhd
632 lines (546 loc) · 16.9 KB
/
psi_common_math_pkg.vhd
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
------------------------------------------------------------------------------
-- Copyright (c) 2018 by Paul Scherrer Institute, Switzerland
-- All rights reserved.
-- Authors: Oliver Bruendler, Benoit Stef
------------------------------------------------------------------------------
library ieee;
use ieee.std_logic_1164.all;
use ieee.numeric_std.all;
use ieee.math_real.all;
use work.psi_common_array_pkg.all;
------------------------------------------------------------------------------
-- Package Header
------------------------------------------------------------------------------
package psi_common_math_pkg is
function log2(arg : in natural) return natural;
function log2ceil(arg : in natural) return natural;
function log2ceil(arg : in real) return natural;
function isLog2(arg : in natural) return boolean;
function max(a : in integer;
b : in integer) return integer;
function min(a : in integer;
b : in integer) return integer;
function max(a : in real;
b : in real) return real;
function min(a : in real;
b : in real) return real;
-- choose t if s=true else f
function choose(s : in boolean;
t : in std_logic;
f : in std_logic) return std_logic;
function choose(s : in boolean;
t : in std_logic_vector;
f : in std_logic_vector) return std_logic_vector;
function choose(s : in boolean;
t : in integer;
f : in integer) return integer;
function choose(s : in boolean;
t : in string;
f : in string) return string;
function choose(s : in boolean;
t : in real;
f : in real) return real;
function choose(s : in boolean;
t : in unsigned;
f : in unsigned) return unsigned;
function choose(s : in boolean;
t : in boolean;
f : in boolean) return boolean;
function choose(s : in boolean;
t : in t_areal;
f : in t_areal) return t_areal;
-- count occurence of a value inside an array
function count(a : in t_ainteger;
v : in integer) return integer;
function count(a : in t_abool;
v : in boolean) return integer;
function count(a : in std_logic_vector;
v : in std_logic) return integer;
-- conversion function int to slv
function to_uslv(input : integer;
len : integer) return std_logic_vector;
function to_sslv(input : integer;
len : integer) return std_logic_vector;
-- conversion function slv to int
function from_uslv(input : std_logic_vector) return integer;
function from_sslv(input : std_logic_vector) return integer;
-- convert string to real
function from_str(input : string) return real;
-- convert string to real array
function from_str(input : string) return t_areal;
-- get ratio constant for counter max value
function ratio(ina : real;
inb : real) return integer;
function ratio(ina : integer;
inb : integer) return integer;
-- get max/min from array type interger /real
function max_a(a : in t_ainteger) return integer;
function max_a(a : in t_areal) return real;
function min_a(a : in t_ainteger) return integer;
function min_a(a : in t_areal) return real;
-- function to determine if ratio clock/strobe is an integer
function is_int_ratio(a : in real; b : in real) return boolean;
function is_int_ratio(a : in integer; b : in integer) return boolean;
-- function to find closest power of 2, used for RegCount finding on AXI, no synth
function nearest_pow2(a: integer) return integer;
end package;
------------------------------------------------------------------------------
-- Package Body
------------------------------------------------------------------------------
package body psi_common_math_pkg is
-- *************************************************************************
-- Helpers
-- *************************************************************************
-- Coun the number of elements in a array string (separated by ",")
function count_array_str_elements(input : string) return natural is
variable count : natural := 1;
variable idx : integer := input'low;
begin
while idx <= input'high loop
if input(idx) = ',' then
count := count + 1;
end if;
idx := idx + 1;
end loop;
return count;
end function;
-- *************************************************************************
-- Public Functions
-- *************************************************************************
-- *** Log2 integer ***
function log2(arg : in natural) return natural is
variable v : natural := arg;
variable r : natural := 0;
begin
while v > 1 loop
v := v / 2;
r := r + 1;
end loop;
return r;
end function;
-- *** Log2Ceil integer ***
function log2ceil(arg : in natural) return natural is
begin
if arg = 0 then
return 0;
end if;
return log2(arg * 2 - 1);
end function;
-- *** Log2Ceil real ***
function log2ceil(arg : in real) return natural is
variable v : real := arg;
variable r : natural := 0;
begin
while v > 1.0 loop
v := v / 2.0;
r := r + 1;
end loop;
return r;
end function;
-- *** isLog2 ***
function isLog2(arg : in natural) return boolean is
begin
if log2(arg) = log2ceil(arg) then
return true;
else
return false;
end if;
end function;
-- *** Max ***
function max(a : in integer;
b : in integer) return integer is
begin
if a > b then
return a;
else
return b;
end if;
end function;
function max(a : in real;
b : in real) return real is
begin
if a > b then
return a;
else
return b;
end if;
end function;
-- *** Min ***
function min(a : in integer;
b : in integer) return integer is
begin
if a > b then
return b;
else
return a;
end if;
end function;
function min(a : in real;
b : in real) return real is
begin
if a > b then
return b;
else
return a;
end if;
end function;
-- *** Choose (std_logic) ***
function choose(s : in boolean;
t : in std_logic;
f : in std_logic) return std_logic is
begin
if s then
return t;
else
return f;
end if;
end function;
-- *** Choose (std_logic_vector) ***
function choose(s : in boolean;
t : in std_logic_vector;
f : in std_logic_vector) return std_logic_vector is
begin
if s then
return t;
else
return f;
end if;
end function;
-- *** Choose (integer) ***
function choose(s : in boolean;
t : in integer;
f : in integer) return integer is
begin
if s then
return t;
else
return f;
end if;
end function;
-- *** Choose (string) ***
function choose(s : in boolean;
t : in string;
f : in string) return string is
begin
if s then
return t;
else
return f;
end if;
end function;
-- *** Choose (real) ***
function choose(s : in boolean;
t : in real;
f : in real) return real is
begin
if s then
return t;
else
return f;
end if;
end function;
-- *** Choose (unsigned) ***
function choose(s : in boolean;
t : in unsigned;
f : in unsigned) return unsigned is
begin
if s then
return t;
else
return f;
end if;
end function;
-- *** Choose (boolean) ***
function choose(s : in boolean;
t : in boolean;
f : in boolean) return boolean is
begin
if s then
return t;
else
return f;
end if;
end function;
-- *** Choose (t_areal) ***
function choose(s : in boolean;
t : in t_areal;
f : in t_areal) return t_areal is
begin
if s then
return t;
else
return f;
end if;
end function;
-- *** count (integer) ***
function count(a : in t_ainteger;
v : in integer) return integer is
variable cnt_v : integer := 0;
begin
for idx in a'low to a'high loop
if a(idx) = v then
cnt_v := cnt_v + 1;
end if;
end loop;
return cnt_v;
end function;
-- *** count (bool) ***
function count(a : in t_abool;
v : in boolean) return integer is
variable cnt_v : integer := 0;
begin
for idx in a'low to a'high loop
if a(idx) = v then
cnt_v := cnt_v + 1;
end if;
end loop;
return cnt_v;
end function;
-- *** count (std_logic) ***
function count(a : in std_logic_vector;
v : in std_logic) return integer is
variable cnt_v : integer := 0;
begin
for idx in a'low to a'high loop
if a(idx) = v then
cnt_v := cnt_v + 1;
end if;
end loop;
return cnt_v;
end function;
-- *** integer to unsigned slv ***
function to_uslv(input : integer;
len : integer) return std_logic_vector is
begin
return std_logic_vector(to_unsigned(input, len));
end function;
-- *** integer to signed slv ***
function to_sslv(input : integer;
len : integer) return std_logic_vector is
begin
return std_logic_vector(to_signed(input, len));
end function;
-- *** integer to unsigned slv ***
function from_uslv(input : std_logic_vector) return integer is
begin
return to_integer(unsigned(input));
end function;
-- *** integer to signed slv ***
function from_sslv(input : std_logic_vector) return integer is
begin
return to_integer(signed(input));
end function;
-- convert string to real
function from_str(input : string) return real is
constant Nbsp_c : character := character'val(160);
variable Idx_v : integer := input'low;
variable IsNeg_v : boolean := false;
variable ValInt_v : integer := 0;
variable ValFrac_v : real := 0.0;
variable FracDigits_v : integer := 0;
variable Exp_v : integer := 0;
variable ExpNeg_v : boolean := false;
variable ValAbs_v : real := 0.0;
begin
-- skip leading white-spaces (space, non-breaking space or horizontal tab)
while (Idx_v <= input'high) and (input(Idx_v) = ' ' or input(Idx_v) = Nbsp_c or input(Idx_v) = HT) loop
Idx_v := Idx_v + 1;
end loop;
-- Check sign
if (Idx_v <= input'high) and ((input(Idx_v) = '-') or (input(Idx_v) = '+')) then
IsNeg_v := (input(Idx_v) = '-');
Idx_v := Idx_v + 1;
end if;
-- Parse Integer
while (Idx_v <= input'high) and (input(Idx_v) <= '9') and (input(Idx_v) >= '0') loop
ValInt_v := ValInt_v * 10 + (character'pos(input(Idx_v)) - character'pos('0'));
Idx_v := Idx_v + 1;
end loop;
-- Check decimal point
if (Idx_v <= input'high) then
if input(Idx_v) = '.' then
Idx_v := Idx_v + 1;
-- Parse Fractional
while (Idx_v <= input'high) and (input(Idx_v) <= '9') and (input(Idx_v) >= '0') loop
ValFrac_v := ValFrac_v * 10.0 + real((character'pos(input(Idx_v)) - character'pos('0')));
FracDigits_v := FracDigits_v + 1;
Idx_v := Idx_v + 1;
end loop;
end if;
end if;
-- Check exponent
if (Idx_v <= input'high) then
if (input(Idx_v) = 'E') or (input(Idx_v) = 'e') then
Idx_v := Idx_v + 1;
-- Check sign
if (Idx_v <= input'high) and ((input(Idx_v) = '-') or (input(Idx_v) = '+')) then
ExpNeg_v := (input(Idx_v) = '-');
Idx_v := Idx_v + 1;
end if;
-- Parse Integer
while (Idx_v <= input'high) and (input(Idx_v) <= '9') and (input(Idx_v) >= '0') loop
Exp_v := Exp_v * 10 + (character'pos(input(Idx_v)) - character'pos('0'));
Idx_v := Idx_v + 1;
end loop;
if ExpNeg_v then
Exp_v := -Exp_v;
end if;
end if;
end if;
-- Return
ValAbs_v := (real(ValInt_v) + ValFrac_v / 10.0**real(FracDigits_v)) * 10.0**real(Exp_v);
if IsNeg_v then
return -ValAbs_v;
else
return ValAbs_v;
end if;
end function;
-- convert string to real array
function from_str(input : string) return t_areal is
variable arr : t_areal(0 to count_array_str_elements(input) - 1) := (others => 0.0);
variable aIdx : natural := 0;
variable startIdx : natural := 1;
variable endIdx : natural := 1;
variable idx : natural := input'low;
begin
while idx <= input'high loop
if input(idx) = ',' then
endIdx := idx - 1;
arr(aIdx) := from_str(input(startIdx to endIdx));
aIdx := aIdx + 1;
startIdx := idx + 1;
end if;
idx := idx + 1;
end loop;
if startIdx <= input'high then
arr(aIdx) := from_str(input(startIdx to input'high));
end if;
return arr;
end function;
--*** get ratio value between two values REAL, used for counter max ***
function ratio(ina : real; inb : real) return integer is
variable res : integer;
begin
if ina > inb then
res := integer(ceil(ina / inb));
elsif ina = inb then
assert false report "both freq. are similar" severity warning;
res := 1;
else
res := integer(ceil(inb / ina));
end if;
return res;
end function;
--*** get ratio value between two values INT, used for counter max ***
function ratio(ina : integer; inb : integer) return integer is
variable res : integer;
begin
if ina > inb then
res := integer(ceil(real(ina) / real(inb)));
elsif ina = inb then
assert false report "both freq. are similar" severity warning;
res := 1;
else
res := integer(ceil(real(inb) / real(ina)));
end if;
return res;
end function;
--*** get the maximum out of an array of integer ***
function max_a(a : in t_ainteger) return integer is
variable max_v : integer := 0;
begin
for idx in a'low to a'high loop
if max(max_v, a(idx)) > max_v then
max_v := a(idx);
end if;
end loop;
return max_v;
end function;
--*** get the maximum out of an array of real ***
function max_a(a : in t_areal) return real is
variable max_v : real := 0.0;
begin
for idx in a'low to a'high loop
if max(max_v, a(idx)) > max_v then
max_v := a(idx);
end if;
end loop;
return max_v;
end function;
--*** get the minimum out of an array of integer ***
function min_a(a : in t_ainteger) return integer is
variable min_v : integer := 0;
begin
for idx in a'low to a'high loop
if min(min_v, a(idx)) < min_v then
min_v := a(idx);
end if;
end loop;
return min_v;
end function;
--*** get the minimum out of an array of real ***
function min_a(a : in t_areal) return real is
variable min_v : real := 0.0;
begin
for idx in a'low to a'high loop
if min(min_v, a(idx)) < min_v then
min_v := a(idx);
end if;
end loop;
return min_v;
end function;
--*** is ratio an integer REAL ***
function is_int_ratio(a : in real; b : in real) return boolean is
variable a_v, b_v : real := 0.0;
begin
-- check > < prior to eval
if a > b then
a_v := real(a);
b_v := real(b);
else
a_v := real(b);
b_v := real(a);
end if;
--eval val
if a_v / b_v = ceil(a_v / b_v) or a_v / b_v = floor(a_v / b_v) then
return true;
else
return false;
end if;
end function;
--*** is ratio an integer REAL ***
function is_int_ratio(a : in integer; b : in integer) return boolean is
variable a_v, b_v : real := 0.0;
begin
-- check > < prior to eval
if a > b then
a_v := real(a);
b_v := real(b);
else
a_v := real(b);
b_v := real(a);
end if;
--eval val
if a_v / b_v = ceil(a_v / b_v) or a_v / b_v = floor(a_v / b_v) then
return true;
else
return false;
end if;
end function;
--*** find the nearest power 2, used for AXI register count not synth***
function nearest_pow2(a: integer) return integer is
variable power_of_two : unsigned(31 downto 0); -- Adjust size if needed
variable num_bits : integer;
begin
num_bits := 32;
power_of_two := (others => '0');
for i in 0 to num_bits-1 loop
if (2**i >= a) then
power_of_two := (others => '0');
power_of_two(i) := '1';
exit;
end if;
end loop;
return to_integer(power_of_two);
end function;
end psi_common_math_pkg;