1
00:00:00,060 --> 00:00:05,690
So let us first try to understand an entire application code that will be utilizing in this demonstration,

2
00:00:05,700 --> 00:00:05,940
right?

3
00:00:06,240 --> 00:00:10,950
So first thing that we need to do is to include a mandatory file so far a better controller.

4
00:00:10,950 --> 00:00:12,650
We have an expedient shortage.

5
00:00:12,750 --> 00:00:12,950
Okay.

6
00:00:12,960 --> 00:00:19,290
So this is the driver file that consists of all the EPAs, which allow us to work with the blocked memory

7
00:00:19,290 --> 00:00:20,040
controller, right?

8
00:00:20,280 --> 00:00:24,870
Then we require the next parameter to take to get any hardware related information.

9
00:00:24,870 --> 00:00:28,080
Right to the first step is to initialize IBM, right?

10
00:00:28,080 --> 00:00:29,760
And for that, we require structure.

11
00:00:29,910 --> 00:00:33,150
We have BDM config and the instant structure right.

12
00:00:33,570 --> 00:00:35,340
Then we declared on function.

13
00:00:35,340 --> 00:00:37,060
We refer to it as beta mainnet.

14
00:00:37,110 --> 00:00:41,220
OK, and this will perform an initialization of our block memory array.

15
00:00:41,310 --> 00:00:46,950
First, we call lookup config where we pass the device, Eydie, and that can read the config structure

16
00:00:46,950 --> 00:00:47,370
for us.

17
00:00:47,790 --> 00:00:53,240
Finally, we call C of G initialized where we add an instance structure, config structure and the bees

18
00:00:53,250 --> 00:00:55,960
address, and this will perform an initialization.

19
00:00:55,980 --> 00:00:59,610
It will also return the status of an initialization rate.

20
00:00:59,610 --> 00:01:03,810
So we are just verifying whether status is equal to existing success.

21
00:01:03,810 --> 00:01:09,410
And if that is the case, well, we will be sending the messages speed M and it is successful, right

22
00:01:09,420 --> 00:01:13,320
else we will just mention and it fit right.

23
00:01:13,320 --> 00:01:15,300
So this is the process of initialization.

24
00:01:16,540 --> 00:01:17,890
Now we go to a mean good.

25
00:01:17,920 --> 00:01:24,160
So after an IT platform we called Beat I minute right now the process that we will be following to demonstrate

26
00:01:24,160 --> 00:01:26,680
the usage of a memory where it's very simple.

27
00:01:26,740 --> 00:01:29,900
What we're going to do is we declare an invisible pointer.

28
00:01:29,920 --> 00:01:35,800
OK, we named it as this address and this basically store the base address of our beat em, right?

29
00:01:35,810 --> 00:01:42,520
So how you get the gist, you basically go to an experimental or take flight and then you have one of

30
00:01:42,520 --> 00:01:46,540
a type which is referred to as any x IBM controller base address.

31
00:01:46,760 --> 00:01:53,320
So this is the base address of our beta will just be adding that value to a base address rate and then

32
00:01:53,320 --> 00:01:58,030
we will be writing 15 samples to this location, right?

33
00:01:58,030 --> 00:01:58,810
So how we do that?

34
00:01:58,930 --> 00:02:05,770
So we declare an integer I initialize to a zero that will act as an iteration counter for us, right?

35
00:02:05,770 --> 00:02:12,490
And then we utilize a for loop where we are storing or generating random data, which we want to store

36
00:02:12,700 --> 00:02:15,220
in the memory rate so that it is very simple.

37
00:02:15,220 --> 00:02:16,400
It is five cross-site.

38
00:02:16,420 --> 00:02:22,270
So with each new iteration value, we will be generating a value which is multiple of right now and

39
00:02:22,270 --> 00:02:25,300
then we'll be adding that to the base interest rate.

40
00:02:25,330 --> 00:02:33,910
Now we already knew that since our memory is byte oriented, so we need to offset our next data by full

41
00:02:33,910 --> 00:02:35,820
right and that is what we did over here.

42
00:02:35,830 --> 00:02:41,990
So with each iteration value, we will be finding it will be base address plus multiple of four.

43
00:02:42,010 --> 00:02:48,490
This is how we will be implementing an address and that will basically automatically offset our new

44
00:02:48,490 --> 00:02:50,920
address value by food location data.

45
00:02:50,920 --> 00:02:54,700
And that is what we want because our memory is by doing direct.
