Rev 5599 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
431 | serge | 1 | ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; |
2 | ;; ;; |
||
5565 | serge | 3 | ;; Copyright (C) KolibriOS team 2004-2015. All rights reserved. ;; |
431 | serge | 4 | ;; Copyright (C) MenuetOS 2000-2004 Ville Mikael Turjanmaa ;; |
5 | ;; Distributed under terms of the GNU General Public License ;; |
||
6 | ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; |
||
7 | |||
593 | mikedld | 8 | $Revision: 5984 $ |
9 | |||
10 | |||
1 | ha | 11 | ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; |
12 | ;; IRQ0 HANDLER (TIMER INTERRUPT) ;; |
||
13 | ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; |
||
14 | |||
465 | serge | 15 | |
1 | ha | 16 | align 32 |
17 | irq0: |
||
1055 | Galkov | 18 | pushad |
5599 | serge | 19 | mov ax, app_data |
20 | mov ds, ax |
||
1055 | Galkov | 21 | mov es, ax |
22 | inc [timer_ticks] |
||
23 | mov eax, [timer_ticks] |
||
24 | call playNote ; <<<--- Speaker driver |
||
2434 | Serge | 25 | sub eax, [next_usage_update] |
26 | cmp eax, 100 |
||
1055 | Galkov | 27 | jb .nocounter |
2434 | Serge | 28 | add [next_usage_update], 100 |
1055 | Galkov | 29 | call updatecputimes |
30 | .nocounter: |
||
2434 | Serge | 31 | xor ecx, ecx ; send End Of Interrupt signal |
2166 | serge | 32 | call irq_eoi |
5201 | serge | 33 | |
3626 | Serge | 34 | mov bl, SCHEDULE_ANY_PRIORITY |
1055 | Galkov | 35 | call find_next_task |
36 | jz .return ; if there is only one running process |
||
37 | call do_change_task |
||
38 | .return: |
||
39 | popad |
||
40 | iretd |
||
1 | ha | 41 | |
101 | poddubny | 42 | align 4 |
43 | change_task: |
||
1055 | Galkov | 44 | pushfd |
45 | cli |
||
46 | pushad |
||
3626 | Serge | 47 | mov bl, SCHEDULE_ANY_PRIORITY |
1055 | Galkov | 48 | call find_next_task |
49 | jz .return ; the same task -> skip switch |
||
5201 | serge | 50 | |
1055 | Galkov | 51 | call do_change_task |
52 | .return: |
||
53 | popad |
||
54 | popfd |
||
55 | ret |
||
465 | serge | 56 | |
101 | poddubny | 57 | uglobal |
1055 | Galkov | 58 | align 4 |
59 | ; far_jump: |
||
60 | ; .offs dd ? |
||
61 | ; .sel dw ? |
||
62 | context_counter dd 0 ;noname & halyavin |
||
63 | next_usage_update dd 0 |
||
64 | timer_ticks dd 0 |
||
65 | ; prev_slot dd ? |
||
66 | ; event_sched dd ? |
||
101 | poddubny | 67 | endg |
68 | |||
1055 | Galkov | 69 | align 4 |
101 | poddubny | 70 | update_counters: |
1055 | Galkov | 71 | mov edi, [TASK_BASE] |
72 | rdtsc |
||
73 | sub eax, [edi+TASKDATA.counter_add] ; time stamp counter add |
||
74 | add [edi+TASKDATA.counter_sum], eax ; counter sum |
||
75 | ret |
||
76 | align 4 |
||
77 | updatecputimes: |
||
78 | mov ecx, [TASK_COUNT] |
||
79 | mov edi, TASK_DATA |
||
80 | .newupdate: |
||
2434 | Serge | 81 | xor eax, eax |
82 | xchg eax, [edi+TASKDATA.counter_sum] |
||
83 | mov [edi+TASKDATA.cpu_usage], eax |
||
84 | add edi, 0x20 |
||
1055 | Galkov | 85 | loop .newupdate |
86 | ret |
||
1 | ha | 87 | |
3555 | Serge | 88 | ;TODO: Надо бы убрать использование do_change_task из V86... |
89 | ; и после этого перенести обработку TASKDATA.counter_add/sum в do_change_task |
||
1 | ha | 90 | |
1055 | Galkov | 91 | align 4 |
101 | poddubny | 92 | do_change_task: |
1055 | Galkov | 93 | ;param: |
94 | ; ebx = address of the APPDATA for incoming task (new) |
||
95 | ;warning: |
||
96 | ; [CURRENT_TASK] and [TASK_BASE] must be changed before (e.g. in find_next_task) |
||
97 | ; [current_slot] is the outcoming (old), and set here to a new value (ebx) |
||
98 | ;scratched: eax,ecx,esi |
||
2434 | Serge | 99 | mov esi, ebx |
100 | xchg esi, [current_slot] |
||
1220 | serge | 101 | ; set new stack after saving old |
1055 | Galkov | 102 | mov [esi+APPDATA.saved_esp], esp |
103 | mov esp, [ebx+APPDATA.saved_esp] |
||
1220 | serge | 104 | ; set new thread io-map |
5599 | serge | 105 | mov eax, [ebx+APPDATA.io_map] |
106 | mov dword [page_tabs+((tss._io_map_0 and -4096) shr 10)], eax |
||
107 | mov eax, [ebx+APPDATA.io_map+4] |
||
108 | mov dword [page_tabs+((tss._io_map_1 and -4096) shr 10)], eax |
||
1220 | serge | 109 | ; set new thread memory-map |
5201 | serge | 110 | mov eax, [ebx+APPDATA.process] |
111 | cmp eax, [current_process] |
||
1055 | Galkov | 112 | je @f |
5201 | serge | 113 | mov [current_process], eax |
114 | mov eax, [eax+PROC.pdt_0_phys] |
||
1055 | Galkov | 115 | mov cr3, eax |
1220 | serge | 116 | @@: |
117 | ; set tss.esp0 |
||
118 | |||
5599 | serge | 119 | mov eax, [ebx+APPDATA.saved_esp0] |
120 | mov [tss._esp0], eax |
||
1220 | serge | 121 | |
2434 | Serge | 122 | mov edx, [ebx+APPDATA.tls_base] |
1220 | serge | 123 | |
2434 | Serge | 124 | mov [tls_data_l+2], dx |
125 | shr edx, 16 |
||
126 | mov [tls_data_l+4], dl |
||
127 | mov [tls_data_l+7], dh |
||
1220 | serge | 128 | |
2434 | Serge | 129 | mov dx, app_tls |
130 | mov fs, dx |
||
5565 | serge | 131 | |
1220 | serge | 132 | ; set gs selector unconditionally |
5599 | serge | 133 | Mov ax, graph_data |
134 | Mov gs, ax |
||
1055 | Galkov | 135 | ; set CR0.TS |
136 | cmp bh, byte[fpu_owner] ;bh == incoming task (new) |
||
137 | clts ;clear a task switch flag |
||
138 | je @f |
||
139 | mov eax, cr0 ;and set it again if the owner |
||
140 | or eax, CR0_TS ;of a fpu has changed |
||
141 | mov cr0, eax |
||
142 | @@: ; set context_counter (only for user pleasure ???) |
||
143 | inc [context_counter] ;noname & halyavin |
||
144 | ; set debug-registers, if it's necessary |
||
145 | test byte[ebx+APPDATA.dbg_state], 1 |
||
146 | jz @f |
||
147 | xor eax, eax |
||
148 | mov dr6, eax |
||
5201 | serge | 149 | lea esi, [ebx+APPDATA.dbg_regs] |
1055 | Galkov | 150 | cld |
151 | macro lodsReg [reg] { |
||
152 | lodsd |
||
2434 | Serge | 153 | mov reg, eax |
1055 | Galkov | 154 | } lodsReg dr0, dr1, dr2, dr3, dr7 |
155 | purge lodsReg |
||
2434 | Serge | 156 | @@: |
157 | ret |
||
1055 | Galkov | 158 | ;end. |
465 | serge | 159 | |
1434 | serge | 160 | |
161 | |||
5565 | serge | 162 | |
3555 | Serge | 163 | MAX_PRIORITY = 0 ; highest, used for kernel tasks |
164 | USER_PRIORITY = 1 ; default |
||
165 | IDLE_PRIORITY = 2 ; lowest, only IDLE thread goes here |
||
166 | NR_SCHED_QUEUES = 3 ; MUST equal IDLE_PRIORYTY + 1 |
||
167 | |||
168 | uglobal |
||
169 | ; [scheduler_current + i*4] = zero if there are no threads with priority i, |
||
170 | ; pointer to APPDATA of the current thread with priority i otherwise. |
||
171 | align 4 |
||
172 | scheduler_current rd NR_SCHED_QUEUES |
||
173 | endg |
||
174 | |||
175 | ; Add the given thread to the given priority list for the scheduler. |
||
176 | ; in: edx -> APPDATA, ecx = priority |
||
177 | proc scheduler_add_thread |
||
178 | ; 1. Acquire the lock. |
||
179 | spin_lock_irqsave SchedulerLock |
||
180 | ; 2. Store the priority in APPDATA structure. |
||
181 | mov [edx+APPDATA.priority], ecx |
||
182 | ; 3. There are two different cases: the given list is empty or not empty. |
||
183 | ; In first case, go to 6. Otherwise, advance to 4. |
||
184 | mov eax, [scheduler_current+ecx*4] |
||
185 | test eax, eax |
||
186 | jz .new_list |
||
187 | ; 4. Insert the new item immediately before the current item. |
||
188 | mov ecx, [eax+APPDATA.in_schedule.prev] |
||
189 | mov [edx+APPDATA.in_schedule.next], eax |
||
190 | mov [edx+APPDATA.in_schedule.prev], ecx |
||
191 | mov [eax+APPDATA.in_schedule.prev], edx |
||
192 | mov [ecx+APPDATA.in_schedule.next], edx |
||
193 | ; 5. Release the lock and return. |
||
194 | spin_unlock_irqrestore SchedulerLock |
||
195 | ret |
||
196 | .new_list: |
||
197 | ; 6. Initialize the list with one item and make it the current item. |
||
198 | mov [edx+APPDATA.in_schedule.next], edx |
||
199 | mov [edx+APPDATA.in_schedule.prev], edx |
||
200 | mov [scheduler_current+ecx*4], edx |
||
201 | ; 7. Release the lock and return. |
||
202 | spin_unlock_irqrestore SchedulerLock |
||
203 | ret |
||
204 | endp |
||
205 | |||
206 | ; Remove the given thread from the corresponding priority list for the scheduler. |
||
207 | ; in: edx -> APPDATA |
||
208 | proc scheduler_remove_thread |
||
209 | ; 1. Acquire the lock. |
||
210 | spin_lock_irqsave SchedulerLock |
||
211 | ; 2. Remove the item from the corresponding list. |
||
212 | mov eax, [edx+APPDATA.in_schedule.next] |
||
213 | mov ecx, [edx+APPDATA.in_schedule.prev] |
||
214 | mov [eax+APPDATA.in_schedule.prev], ecx |
||
215 | mov [ecx+APPDATA.in_schedule.next], eax |
||
216 | ; 3. If the given thread is the current item in the list, |
||
217 | ; advance the current item. |
||
218 | ; 3a. Check whether the given thread is the current item; |
||
219 | ; if no, skip the rest of this step. |
||
220 | mov ecx, [edx+APPDATA.priority] |
||
221 | cmp [scheduler_current+ecx*4], edx |
||
222 | jnz .return |
||
223 | ; 3b. Set the current item to eax; step 2 has set eax = next item. |
||
224 | mov [scheduler_current+ecx*4], eax |
||
225 | ; 3c. If there were only one item in the list, zero the current item. |
||
226 | cmp eax, edx |
||
227 | jnz .return |
||
228 | mov [scheduler_current+ecx*4], 0 |
||
229 | .return: |
||
230 | ; 4. Release the lock and return. |
||
231 | spin_unlock_irqrestore SchedulerLock |
||
232 | ret |
||
233 | endp |
||
234 | |||
3626 | Serge | 235 | SCHEDULE_ANY_PRIORITY = 0 |
236 | SCHEDULE_HIGHER_PRIORITY = 1 |
||
3555 | Serge | 237 | ;info: |
238 | ; Find next task to execute |
||
3626 | Serge | 239 | ;in: |
240 | ; bl = SCHEDULE_ANY_PRIORITY: |
||
241 | ; consider threads with any priority |
||
242 | ; bl = SCHEDULE_HIGHER_PRIORITY: |
||
243 | ; consider only threads with strictly higher priority than the current one, |
||
244 | ; keep running the current thread if other ready threads have the same or lower priority |
||
3555 | Serge | 245 | ;retval: |
246 | ; ebx = address of the APPDATA for the selected task (slot-base) |
||
247 | ; edi = address of the TASKDATA for the selected task |
||
248 | ; ZF = 1 if the task is the same |
||
249 | ;warning: |
||
250 | ; [CURRENT_TASK] = bh , [TASK_BASE] = edi -- as result |
||
251 | ; [current_slot] is not set to new value (ebx)!!! |
||
252 | ;scratched: eax,ecx |
||
253 | proc find_next_task |
||
254 | call update_counters |
||
255 | spin_lock_irqsave SchedulerLock |
||
3626 | Serge | 256 | push NR_SCHED_QUEUES |
257 | ; If bl == SCHEDULE_ANY_PRIORITY = 0, loop over all NR_SCHED lists. |
||
258 | ; Otherwise, loop over first [APPDATA.priority] lists. |
||
259 | test bl, bl |
||
260 | jz .start |
||
261 | mov ebx, [current_slot] |
||
262 | mov edi, [TASK_BASE] |
||
263 | mov eax, [ebx+APPDATA.priority] |
||
264 | test eax, eax |
||
265 | jz .unlock_found |
||
266 | mov [esp], eax |
||
267 | .start: |
||
3555 | Serge | 268 | xor ecx, ecx |
269 | .priority_loop: |
||
270 | mov ebx, [scheduler_current+ecx*4] |
||
271 | test ebx, ebx |
||
272 | jz .priority_next |
||
273 | .task_loop: |
||
274 | mov ebx, [ebx+APPDATA.in_schedule.next] |
||
275 | mov edi, ebx |
||
276 | shr edi, 3 |
||
277 | add edi, CURRENT_TASK - (SLOT_BASE shr 3) |
||
278 | mov al, [edi+TASKDATA.state] |
||
279 | test al, al |
||
280 | jz .task_found ; state == 0 |
||
281 | cmp al, 5 |
||
282 | jne .task_next ; state == 1,2,3,4,9 |
||
283 | ; state == 5 |
||
284 | pushad ; more freedom for [APPDATA.wait_test] |
||
285 | call [ebx+APPDATA.wait_test] |
||
286 | mov [esp+28], eax |
||
287 | popad |
||
5984 | serge | 288 | or eax, eax |
3555 | Serge | 289 | jnz @f |
290 | ; testing for timeout |
||
291 | mov eax, [timer_ticks] |
||
292 | sub eax, [ebx+APPDATA.wait_begin] |
||
293 | cmp eax, [ebx+APPDATA.wait_timeout] |
||
294 | jb .task_next |
||
295 | xor eax, eax |
||
296 | @@: |
||
297 | mov [ebx+APPDATA.wait_param], eax ; retval for wait |
||
298 | mov [edi+TASKDATA.state], 0 |
||
299 | .task_found: |
||
300 | mov [scheduler_current+ecx*4], ebx |
||
3626 | Serge | 301 | ; If we have selected a thread with higher priority |
302 | ; AND rescheduling is due to IRQ, |
||
303 | ; turn the current scheduler list one entry back, |
||
304 | ; so the current thread will be next after high-priority thread is done. |
||
305 | mov ecx, [esp] |
||
306 | cmp ecx, NR_SCHED_QUEUES |
||
307 | jz .unlock_found |
||
308 | mov eax, [current_slot] |
||
309 | mov eax, [eax+APPDATA.in_schedule.prev] |
||
310 | mov [scheduler_current+ecx*4], eax |
||
311 | .unlock_found: |
||
312 | pop ecx |
||
3555 | Serge | 313 | spin_unlock_irqrestore SchedulerLock |
314 | .found: |
||
315 | mov [CURRENT_TASK], bh |
||
316 | mov [TASK_BASE], edi |
||
317 | rdtsc ;call _rdtsc |
||
318 | mov [edi+TASKDATA.counter_add], eax; for next using update_counters |
||
319 | cmp ebx, [current_slot] |
||
320 | ret |
||
321 | .task_next: |
||
322 | cmp ebx, [scheduler_current+ecx*4] |
||
323 | jnz .task_loop |
||
324 | .priority_next: |
||
325 | inc ecx |
||
3626 | Serge | 326 | cmp ecx, [esp] |
3555 | Serge | 327 | jb .priority_loop |
3626 | Serge | 328 | mov ebx, [current_slot] |
329 | mov edi, [TASK_BASE] |
||
330 | jmp .unlock_found |
||
3555 | Serge | 331 | endp |
332 | |||
465 | serge | 333 | if 0 |
1434 | serge | 334 | |
465 | serge | 335 | struc TIMER |
336 | { |
||
337 | .next dd ? |
||
338 | .exp_time dd ? |
||
339 | .func dd ? |
||
1055 | Galkov | 340 | .arg dd ? |
465 | serge | 341 | } |
342 | |||
1276 | Lrz | 343 | |
344 | uglobal |
||
465 | serge | 345 | rdy_head rd 16 |
1276 | Lrz | 346 | endg |
465 | serge | 347 | |
348 | align 4 |
||
349 | pick_task: |
||
350 | |||
2434 | Serge | 351 | xor eax, eax |
1055 | Galkov | 352 | .pick: |
2434 | Serge | 353 | mov ebx, [rdy_head+eax*4] |
354 | test ebx, ebx |
||
355 | jz .next |
||
465 | serge | 356 | |
2434 | Serge | 357 | mov [next_task], ebx |
358 | test [ebx+flags.billable] |
||
359 | jz @F |
||
360 | mov [bill_task], ebx |
||
1055 | Galkov | 361 | @@: |
2434 | Serge | 362 | ret |
1055 | Galkov | 363 | .next: |
2434 | Serge | 364 | inc eax |
365 | jmp .pick |
||
465 | serge | 366 | |
367 | ; param |
||
368 | ; eax= task |
||
369 | ; |
||
370 | ; retval |
||
371 | ; eax= task |
||
372 | ; ebx= queue |
||
373 | ; ecx= front if 1 or back if 0 |
||
374 | align 4 |
||
375 | shed: |
||
2434 | Serge | 376 | cmp [eax+.tics_left], 0;signed compare |
377 | mov ebx, [eax+.priority] |
||
378 | setg ecx |
||
379 | jg @F |
||
465 | serge | 380 | |
2434 | Serge | 381 | mov edx, [eax+.tics_quantum] |
382 | mov [eax+.ticks_left], edx |
||
383 | cmp ebx, (IDLE_PRIORITY-1) |
||
384 | je @F |
||
385 | inc ebx |
||
1055 | Galkov | 386 | @@: |
2434 | Serge | 387 | ret |
465 | serge | 388 | |
389 | ; param |
||
390 | ; eax= task |
||
391 | align 4 |
||
392 | enqueue: |
||
2434 | Serge | 393 | call shed;eax |
394 | cmp [rdy_head+ebx*4], 0 |
||
395 | jnz @F |
||
465 | serge | 396 | |
2434 | Serge | 397 | mov [rdy_head+ebx*4], eax |
398 | mov [rdy_tail+ebx*4], eax |
||
399 | mov [eax+.next_ready], 0 |
||
400 | jmp .pick |
||
1055 | Galkov | 401 | @@: |
2434 | Serge | 402 | test ecx, ecx |
403 | jz .back |
||
465 | serge | 404 | |
2434 | Serge | 405 | mov ecx, [rdy_head+ebx*4] |
406 | mov [eax+.next_ready], ecx |
||
407 | mov [rdy_head+ebx*4], eax |
||
408 | jmp .pick |
||
1055 | Galkov | 409 | .back: |
2434 | Serge | 410 | mov ecx, [rdy_tail+ebx*4] |
411 | mov [ecx+.next_ready], eax |
||
412 | mov [rdy_tail+ebx*4], eax |
||
413 | mov [eax+.next_ready], 0 |
||
1055 | Galkov | 414 | .pick: |
2434 | Serge | 415 | call pick_proc;select next task |
416 | ret |
||
465 | serge | 417 | |
418 | end if---><---><<---> |