Bellek Yönetimi ve Çöp Toplama (Memory Management & GC) Algoritması

1export interface BuddyBlock {
2  size: number;
3  offset: number;
4  allocated: boolean;
5}
6
7export class BuddyAllocator {
8  private memorySize: number;
9  public blocks: BuddyBlock[] = [];
10  
11  constructor(totalSize: number) {
12    this.memorySize = totalSize;
13    this.blocks.push({ size: totalSize, offset: 0, allocated: false });
14  }
15  
16  public allocate(requestSize: number): BuddyBlock | null {
17    // Find smallest power of 2 that holds requestSize
18    let powerSize = 1;
19    while (powerSize < requestSize) {
20      powerSize *= 2;
21    }
22    
23    // Find suitable block
24    let bestIdx = -1;
25    for (let i = 0; i < this.blocks.length; i++) {
26      const b = this.blocks[i];
27      if (!b.allocated && b.size >= powerSize) {
28        if (bestIdx === -1 || b.size < this.blocks[bestIdx].size) {
29          bestIdx = i;
30        }
31      }
32    }
33    
34    if (bestIdx === -1) return null; // No memory
35    
36    // Split block until size matches powerSize
37    while (this.blocks[bestIdx].size > powerSize) {
38      const b = this.blocks[bestIdx];
39      const halfSize = b.size / 2;
40      
41      // Split into two buddies
42      const left: BuddyBlock = { size: halfSize, offset: b.offset, allocated: false };
43      const right: BuddyBlock = { size: halfSize, offset: b.offset + halfSize, allocated: false };
44      
45      this.blocks.splice(bestIdx, 1, left, right);
46      // bestIdx points to left buddy now
47    }
48    
49    this.blocks[bestIdx].allocated = true;
50    return this.blocks[bestIdx];
51  }
52}