Machine_Project_2/frame_pool.C at master · arjunjm/Machine_Project_2 · GitHub

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
#include "frame_pool.H"
#include "utils.H"
#include "console.H"

#define IS_SET(var, pos) ((var) & (1<<(pos)))
#define SET_BIT(var, pos) ((var) |= (1<<(pos)))
#define TOGGLE_BIT(var, pos) ((var) ^= (1<<(pos)))

unsigned long* FramePool::frame_map;

FramePool::FramePool(unsigned long _base_frame_no,
                     unsigned long _nframes,
                     unsigned long _info_frame_no)
{
    base_frame_number        = _base_frame_no;
    number_of_frames_managed = _nframes;
    managament_frame_number  = _info_frame_no;

   /*
     * Add the physical addresses of free frames to the frame pool list.
     * The get_frame routine will allocate frames from this list
     */
   if (_info_frame_no == 0)
   {
       /*
        * We initialize the bit map pointer here. Since it is static,
        * it will be accessible to both the frame pools.
        */
        frame_map = reinterpret_cast <unsigned long*> (base_frame_number * FramePool::FRAME_SIZE);
        memset(frame_map, 0, FramePool::FRAME_SIZE);
        get_frame();
   }
}

unsigned long FramePool::get_frame()
{
   /*
    * This function will traverse through the array of structures and
    * returns the first frame which is accessible and has not been
    * allocated to any other process.
    */
    int bit_map_index = (base_frame_number - START_OFFSET) / 32;
    bool frame_found = false;
    int i, j;
    unsigned long frame_number;
    int limit;
    if(managament_frame_number == 0)
        limit = base_frame_number - START_OFFSET + number_of_frames_managed;
    else
    {
        limit = base_frame_number + number_of_frames_managed;
    }

    for ( i = bit_map_index ; i < limit / 32; i++)
    {
        if (frame_map[i] != 0xFFFFFFFF)
        /* This check is made to check if there are any free frames.
         * If the map is set to all ones, this would mean there are no free frames
         * in this bitmap array
         */
        {
            for ( j = 0; j <= 31; j++ )
            {
                if (IS_SET(frame_map[i], j))
                    continue;
                else
                {
                    frame_map[i] = TOGGLE_BIT(frame_map[i], j);
                    frame_found = true;
                    break;
                }
            }
            if (frame_found)
                break;
        }
    }
    if (frame_found)
    {
        frame_number = j + i*32 + START_OFFSET;
        return frame_number;
    }
    else
    {
        return 0;
    }
}

void FramePool::mark_inaccessible(unsigned long _base_frame_no,
                                  unsigned long _nframes)
{
    int index_of_frame = (_base_frame_no - START_OFFSET) / 32;
    for (int i = index_of_frame; i < (_base_frame_no + _nframes - START_OFFSET) / 32 ; i++)
    {
        // Setting all Ones
        frame_map[i] = 0xFFFFFFFF;
    }

}

void FramePool::release_frame(unsigned long _frame_no)
{
    int bit_position = _frame_no % 32;
    int index_of_frame = (_frame_no - START_OFFSET) / 32;
    if (IS_SET (frame_map[index_of_frame], bit_position))
        frame_map[index_of_frame] = TOGGLE_BIT(frame_map[index_of_frame], bit_position);
}