blob: 09ed21cf70544c1178c098ec2d1a380fe691b5f9 (
plain)
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
|
#include <timer.h>
#include <libk/stdio.h>
#include <heap.h>
#include <libk/list.h>
#include <io.h>
uint32_t tick = 0;
uint32_t seconds = 0;
struct wait_queue {
int64_t ticks;
list_t list;
};
typedef struct wait_queue wait_queue;
wait_queue timer_queue;
void timer_handler()
{
wait_queue* pos;
list_for_each_entry(pos, (&timer_queue.list), list) {
pos->ticks--;
}
tick++;
if (tick >= TICKS_PER_SECOND) {
tick = 0;
seconds++;
}
}
void wait(uint64_t ms)
{
__asm__ volatile ("cli;");
wait_queue* queue = (wait_queue*)kalloc(sizeof(wait_queue));
queue->ticks = (int64_t)ms;
add_to_list(&queue->list, &timer_queue.list, timer_queue.list.next);
__asm__ volatile ("sti;");
while (queue->ticks > 0) ;
kfree(queue);
free_node(&queue->list);
}
void init_timer(uint32_t frequency)
{
INIT_LIST(timer_queue.list);
uint32_t divisor = 1193180 / frequency;
outb(0x43, 0x36);
uint8_t l = (uint8_t)(divisor & 0xFF);
uint8_t h = (uint8_t)((divisor>>8) & 0xFF);
outb(0x40, l);
outb(0x40, h);
}
|
