|
| 1 | +package dispatcher |
| 2 | + |
| 3 | +import ( |
| 4 | + "CodeSandboxAPI/config" |
| 5 | + "CodeSandboxAPI/models" |
| 6 | + "sync" |
| 7 | + "testing" |
| 8 | + "time" |
| 9 | +) |
| 10 | + |
| 11 | +func TestDispatchQueueingFIFO(t *testing.T) { |
| 12 | + originalQueue := config.Config.Globals.ENABLE_QUEUE |
| 13 | + originalGlobalRAM := config.Config.Globals.RAM_LIMIT |
| 14 | + originalDefaultMem := config.Config.Limits.DefaultMemoryLimit |
| 15 | + originalMaxMem := config.Config.Limits.MaxMemoryLimit |
| 16 | + originalReserve := reserveRAM |
| 17 | + originalRelease := releaseRAM |
| 18 | + originalExecute := execute |
| 19 | + t.Cleanup(func() { |
| 20 | + config.Config.Globals.ENABLE_QUEUE = originalQueue |
| 21 | + config.Config.Globals.RAM_LIMIT = originalGlobalRAM |
| 22 | + config.Config.Limits.DefaultMemoryLimit = originalDefaultMem |
| 23 | + config.Config.Limits.MaxMemoryLimit = originalMaxMem |
| 24 | + reserveRAM = originalReserve |
| 25 | + releaseRAM = originalRelease |
| 26 | + execute = originalExecute |
| 27 | + }) |
| 28 | + |
| 29 | + config.Config.Globals.ENABLE_QUEUE = true |
| 30 | + config.Config.Globals.RAM_LIMIT = 1 |
| 31 | + config.Config.Limits.DefaultMemoryLimit = 1 |
| 32 | + config.Config.Limits.MaxMemoryLimit = 1 |
| 33 | + resetQueueStateForTests() |
| 34 | + |
| 35 | + var memLock sync.Mutex |
| 36 | + available := uint(1) |
| 37 | + reserveRAM = func(amount uint) bool { |
| 38 | + memLock.Lock() |
| 39 | + defer memLock.Unlock() |
| 40 | + if amount > available { |
| 41 | + return false |
| 42 | + } |
| 43 | + available -= amount |
| 44 | + return true |
| 45 | + } |
| 46 | + releaseRAM = func(amount uint) { |
| 47 | + memLock.Lock() |
| 48 | + available += amount |
| 49 | + memLock.Unlock() |
| 50 | + } |
| 51 | + |
| 52 | + var orderLock sync.Mutex |
| 53 | + startOrder := make([]string, 0, 3) |
| 54 | + allowFirstToFinish := make(chan struct{}) |
| 55 | + execute = func(req models.Request) (models.Response, error) { |
| 56 | + orderLock.Lock() |
| 57 | + startOrder = append(startOrder, req.Code) |
| 58 | + orderLock.Unlock() |
| 59 | + |
| 60 | + if req.Code == "A" { |
| 61 | + <-allowFirstToFinish |
| 62 | + } |
| 63 | + |
| 64 | + return models.Response{Stdout: req.Code}, nil |
| 65 | + } |
| 66 | + |
| 67 | + resultA := make(chan models.Response, 1) |
| 68 | + errA := make(chan error, 1) |
| 69 | + go func() { |
| 70 | + resp, err := Dispatch(models.Request{Code: "A", MemoryLimit: 1}) |
| 71 | + resultA <- resp |
| 72 | + errA <- err |
| 73 | + }() |
| 74 | + |
| 75 | + // Wait until the first request starts and holds RAM. |
| 76 | + deadline := time.Now().Add(500 * time.Millisecond) |
| 77 | + for { |
| 78 | + orderLock.Lock() |
| 79 | + started := len(startOrder) == 1 && startOrder[0] == "A" |
| 80 | + orderLock.Unlock() |
| 81 | + if started { |
| 82 | + break |
| 83 | + } |
| 84 | + if time.Now().After(deadline) { |
| 85 | + t.Fatal("first request did not start in time") |
| 86 | + } |
| 87 | + time.Sleep(5 * time.Millisecond) |
| 88 | + } |
| 89 | + |
| 90 | + resultB := make(chan models.Response, 1) |
| 91 | + errB := make(chan error, 1) |
| 92 | + go func() { |
| 93 | + resp, err := Dispatch(models.Request{Code: "B", MemoryLimit: 1}) |
| 94 | + resultB <- resp |
| 95 | + errB <- err |
| 96 | + }() |
| 97 | + |
| 98 | + // Ensure B is at the front of the queue before C arrives. |
| 99 | + queueDeadline := time.Now().Add(500 * time.Millisecond) |
| 100 | + for { |
| 101 | + queueLock.Lock() |
| 102 | + ready := len(requestQueue) == 1 && requestQueue[0].req.Code == "B" |
| 103 | + queueLock.Unlock() |
| 104 | + if ready { |
| 105 | + break |
| 106 | + } |
| 107 | + if time.Now().After(queueDeadline) { |
| 108 | + t.Fatal("B was not queued in time") |
| 109 | + } |
| 110 | + time.Sleep(5 * time.Millisecond) |
| 111 | + } |
| 112 | + |
| 113 | + resultC := make(chan models.Response, 1) |
| 114 | + errC := make(chan error, 1) |
| 115 | + go func() { |
| 116 | + resp, err := Dispatch(models.Request{Code: "C", MemoryLimit: 1}) |
| 117 | + resultC <- resp |
| 118 | + errC <- err |
| 119 | + }() |
| 120 | + |
| 121 | + // B and C should be queued while A is still running. |
| 122 | + select { |
| 123 | + case <-resultB: |
| 124 | + t.Fatal("B should have stayed queued while A holds RAM") |
| 125 | + case <-time.After(40 * time.Millisecond): |
| 126 | + } |
| 127 | + |
| 128 | + select { |
| 129 | + case <-resultC: |
| 130 | + t.Fatal("C should have stayed queued while A holds RAM") |
| 131 | + case <-time.After(40 * time.Millisecond): |
| 132 | + } |
| 133 | + |
| 134 | + close(allowFirstToFinish) |
| 135 | + |
| 136 | + if err := <-errA; err != nil { |
| 137 | + t.Fatalf("A returned error: %v", err) |
| 138 | + } |
| 139 | + if resp := <-resultA; resp.Stdout != "A" { |
| 140 | + t.Fatalf("unexpected A stdout: %q", resp.Stdout) |
| 141 | + } |
| 142 | + |
| 143 | + if err := <-errB; err != nil { |
| 144 | + t.Fatalf("B returned error: %v", err) |
| 145 | + } |
| 146 | + if resp := <-resultB; resp.Stdout != "B" { |
| 147 | + t.Fatalf("unexpected B stdout: %q", resp.Stdout) |
| 148 | + } |
| 149 | + |
| 150 | + if err := <-errC; err != nil { |
| 151 | + t.Fatalf("C returned error: %v", err) |
| 152 | + } |
| 153 | + if resp := <-resultC; resp.Stdout != "C" { |
| 154 | + t.Fatalf("unexpected C stdout: %q", resp.Stdout) |
| 155 | + } |
| 156 | + |
| 157 | + orderLock.Lock() |
| 158 | + defer orderLock.Unlock() |
| 159 | + if len(startOrder) != 3 { |
| 160 | + t.Fatalf("unexpected execution count: got=%d order=%v", len(startOrder), startOrder) |
| 161 | + } |
| 162 | + if startOrder[0] != "A" || startOrder[1] != "B" || startOrder[2] != "C" { |
| 163 | + t.Fatalf("queue did not execute in FIFO order: %v", startOrder) |
| 164 | + } |
| 165 | +} |
0 commit comments