| 33,6 → 33,13 |
|---|
| #include <fcntl.h> |
| #include <limits.h> |
| |
| /* this file implement a fixed queue, that is simply an array that |
| is filled with the events until it is full. After that, all the other |
| events are discarded. */ |
| |
| |
| |
| |
| typedef struct TAGfixed_queue_t { |
| int size; |
| int index; |
| 39,9 → 46,13 |
|---|
| char *filename; |
| int uniq; |
| |
| trc_event_t table[0]; |
| trc_event_t table[0]; |
| /* Yes, 0!... the elements are allocated |
| in a dirty way into the kern_alloc into fixed_create */ |
| } fixed_queue_t; |
| |
| /* This function simply return an event to fill (only if the fixed table |
| is not yet full) */ |
| static trc_event_t *fixed_get(fixed_queue_t *queue) |
| { |
| if (queue->index>=queue->size) return NULL; |
| 48,6 → 59,8 |
|---|
| return &queue->table[queue->index++]; |
| } |
| |
| /* since get returns the correct event address, |
| the post function does nothing... */ |
| static int fixed_post(fixed_queue_t *queue) |
| { |
| return 0; |
| 60,6 → 73,7 |
|---|
| { |
| fixed_queue_t *ptr; |
| |
| /* initialize the default arguments for the fixed queue */ |
| if (!once) { |
| /* well... this func is called when the system is not running! */ |
| once=1; |
| 67,11 → 81,12 |
|---|
| } |
| if (args==NULL) args=&defaultargs; |
| |
| /* allocate the fixed queue data structure plus the array of events */ |
| ptr=(fixed_queue_t*)kern_alloc(sizeof(fixed_queue_t)+ |
| sizeof(trc_event_t)*(args->size+1)); |
| if (ptr==NULL) return -1; |
| |
| |
| /* set the current queue pointers and data */ |
| queue->get=(trc_event_t*(*)(void*))fixed_get; |
| queue->post=(int(*)(void*))fixed_post; |
| queue->data=ptr; |
| 92,9 → 107,6 |
|---|
| if (queue->filename==NULL) trc_create_name("fix",queue->uniq,pathname); |
| else trc_create_name(queue->filename,0,pathname); |
| |
| //sys_status(SCHED_STATUS); |
| //task_delay(250000); |
| |
| h=open("/TEMP/FIX1",O_CREAT|O_TRUNC|O_WRONLY); |
| if (h!=-1) { |
| write(h,queue->table,queue->index*sizeof(trc_event_t)); |