/shark/tags/rel_0_2/include/kernel/func.h |
---|
21,11 → 21,11 |
/** |
------------ |
CVS : $Id: func.h,v 1.1.1.1 2002-03-29 14:12:51 pj Exp $ |
CVS : $Id: func.h,v 1.2 2002-11-11 08:36:01 pj Exp $ |
File: $File$ |
Revision: $Revision: 1.1.1.1 $ |
Last update: $Date: 2002-03-29 14:12:51 $ |
Revision: $Revision: 1.2 $ |
Last update: $Date: 2002-11-11 08:36:01 $ |
------------ |
Kernel functions: |
89,15 → 89,6 |
/* if a source use printk() it should include log.h not func.h */ |
#include <kernel/log.h> |
#if 0 |
#ifdef __DEBUG_ON__ |
#define printk(fmt,args...) \ |
VM_printf(fmt,##args) |
#else |
#define printk(fmt,args...) |
#endif |
#endif |
/*---------------------------------------------------------------------*/ |
/* Kernel global functions: initialization & termination... */ |
/*---------------------------------------------------------------------*/ |
145,7 → 136,7 |
int set_exchandler_text(); |
/*---------------------------------------------------------------------*/ |
/* Kernel global functions: scheduler, queues */ |
/* Kernel global functions: scheduler, */ |
/*---------------------------------------------------------------------*/ |
/*+ This is the generic scheduler. |
157,26 → 148,6 |
the end of an event list +*/ |
void event_need_reschedule(); |
/* Simple QUEUE management functions */ |
void q_insert (PID p, QUEUE *q); |
void q_timespec_insert (PID p, QUEUE *q); |
void q_extract (PID p, QUEUE *q); |
PID q_getfirst ( QUEUE *q); |
void q_insertfirst (PID p, QUEUE *q); |
/* QQUEUE management functions */ |
void qq_init ( QQUEUE *q); |
void qq_insert (PID p, QQUEUE *q); |
void qq_timespec_insert (PID p, QQUEUE *q); |
void qq_extract (PID p, QQUEUE *q); |
PID qq_getfirst ( QQUEUE *q); |
void qq_insertfirst (PID p, QQUEUE *q); |
void qq_insertlast (PID p, QQUEUE *q); |
PID qq_queryfirst ( QQUEUE *q); |
PID qq_querylast ( QQUEUE *q); |
void task_makefree(void *ret); |
void check_killed_async(void); |
221,15 → 192,6 |
return ll_context_from(); |
} |
#ifdef __TEST1__ |
extern int useds; |
extern int testactive; |
extern struct timespec s_send[]; |
#endif |
/*+ this functions are called every time a context is changed +*/ |
void kern_after_dispatch(void); |
243,10 → 205,6 |
{ |
ll_context_to(c); |
kern_after_dispatch(); |
#ifdef __TEST1__ |
if (testactive) ll_gettime(TIME_EXACT,&s_send[useds-1] ); |
#endif |
sti(); |
} |
539,9 → 497,6 |
Pending activations are discarded +*/ |
void task_sleep(void); |
/*+ This function suspend the actual task for a minimum delay time +*/ |
void task_delay(DWORD delay); |
/*+ This primitives refers the group id which is supplied |
by the application, not by the kernel +*/ |
int group_activate(WORD g); |
/shark/tags/rel_0_2/include/kernel/iqueue.h |
---|
0,0 → 1,197 |
/* |
* Project: S.Ha.R.K. |
* |
* Coordinators: |
* Giorgio Buttazzo <giorgio@sssup.it> |
* Paolo Gai <pj@gandalf.sssup.it> |
* |
* Authors : |
* Paolo Gai <pj@gandalf.sssup.it> |
* (see the web pages for full authors list) |
* |
* ReTiS Lab (Scuola Superiore S.Anna - Pisa - Italy) |
* |
* http://www.sssup.it |
* http://retis.sssup.it |
* http://shark.sssup.it |
*/ |
/* |
------------ |
CVS : $Id: iqueue.h,v 1.1 2002-11-11 08:36:01 pj Exp $ |
File: $File$ |
Revision: $Revision: 1.1 $ |
Last update: $Date: 2002-11-11 08:36:01 $ |
------------ |
*/ |
/* |
* Copyright (C) 2002 Paolo Gai |
* |
* This program is free software; you can redistribute it and/or modify |
* it under the terms of the GNU General Public License as published by |
* the Free Software Foundation; either version 2 of the License, or |
* (at your option) any later version. |
* |
* This program is distributed in the hope that it will be useful, |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
* GNU General Public License for more details. |
* |
* You should have received a copy of the GNU General Public License |
* along with this program; if not, write to the Free Software |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
* |
*/ |
/* |
IQUEUEs |
This file contains functions that helps to manage task queues. |
These functions are different from the functions that manages the |
QUEUE and QQUEUE types. In particular, these functions no more relies |
on the prev & next fields of the task descriptor. In that way, tasks |
can be inserted in more than one queue at a time. |
Basically, an IQUEUE has an "I"nternal prev/next structure, that may |
be shared between one or more queue. Of course, the user MUST |
guarantee that the same task will not be inserted in two IQUEUEs that |
share the same prev/next buffer. |
The queue insertion is made by the following functions: |
iq_insert -> insertion based on the priority field. |
iq_timespec_insert -> same as above but use the timespec_priority field |
iq_insertfirst -> insert in the first position of the queue |
*/ |
#include <ll/ll.h> |
#include <kernel/const.h> |
#include <kernel/types.h> |
#ifndef __KERNEL_IQUEUE_H__ |
#define __KERNEL_IQUEUE_H__ |
#define IQUEUE_NO_PRIORITY 1 |
#define IQUEUE_NO_TIMESPEC 2 |
struct IQUEUE_shared { |
PID prev[MAX_PROC]; |
PID next[MAX_PROC]; |
struct timespec *timespec_priority; |
DWORD *priority; |
}; |
typedef struct { |
PID first; |
PID last; |
struct IQUEUE_shared *s; |
} IQUEUE; |
/* Internal queue initialization: |
share = &x -> the internal data structure of the IQUEUE x is used |
to enqueue the tasks. |
share = NULL -> an internal data structure to handle prev/next |
pairs is dynamically allocated (The amount of |
memory that is allocated can be reduced using the |
flags). |
flags can be used to reduce the memory usage of an IQUEUE when share=NULL: |
IQUEUE_NO_PRIORITY -> the iqueue do not provide internally a priority field |
IQUEUE_NO_TIMESPEC -> the iqueue do not provide internally a timespec field |
- note that, if these flags are used, the corresponding insert |
functions will not work! |
- the default value for the flags is, of course, 0 |
*/ |
void iq_init (IQUEUE *q, IQUEUE *share, int flags); |
/* Queue insert functions: |
- inserts a p into the q. p must not be already inserted into q. |
- four versions of the function; |
- iq_priority_insert -> ordered insertion using the priority field |
- iq_timespec_insert -> ordered insertion using the timespec field |
- iq_insertfirst -> insert at the first position of the queue |
- iq_insertlast -> insert at the last position of the queue |
*/ |
void iq_priority_insert (PID p, IQUEUE *q); |
void iq_timespec_insert (PID p, IQUEUE *q); |
void iq_insertfirst (PID p, IQUEUE *q); |
void iq_insertlast (PID p, IQUEUE *q); |
/* Queue extract functions: |
- extracts a task p from the queue q. |
- three versions of the function; |
- iq_extract -> extracts given a task p |
(that must be inserted in the queue) |
- iq_getfirst -> extracts the first task in the queue, |
NIL if the queue is empty |
- iq_getlast -> extracts the last task in the queue, |
NIL if the queue is empty |
*/ |
void iq_extract (PID p, IQUEUE *q); |
PID iq_getfirst ( IQUEUE *q); |
PID iq_getlast ( IQUEUE *q); |
/* Queue query functions: |
The first two functions return the first and the last task in the queue, |
NIL if the queue is empty. |
The second two functions can be used to get/set the priority or the |
timespec field used when queuing. |
*/ |
static __inline__ PID iq_query_first(IQUEUE *q) |
{ |
return q->first; |
} |
static __inline__ PID iq_query_last(IQUEUE *q) |
{ |
return q->last; |
} |
static __inline__ struct timespec *iq_query_timespec(PID p, IQUEUE *q) |
{ |
return &q->s->timespec_priority[p]; |
} |
static __inline__ DWORD *iq_query_priority (PID p, IQUEUE *q) |
{ |
return &q->s->priority[p]; |
} |
/* Queue iterators */ |
/* sometimes it is useful to go through the list. For that reason |
You can use the following two functions... */ |
static __inline__ PID iq_query_next (PID p, IQUEUE *q) |
{ |
return q->s->next[p]; |
} |
static __inline__ PID iq_query_prev (PID p, IQUEUE *q) |
{ |
return q->s->prev[p]; |
} |
/* Queue test functions */ |
static __inline__ int iq_isempty (IQUEUE *q) |
{ |
return q->first == NIL; |
} |
#endif |
/shark/tags/rel_0_2/include/kernel/int_sem.h |
---|
21,11 → 21,11 |
/** |
------------ |
CVS : $Id: int_sem.h,v 1.1.1.1 2002-03-29 14:12:51 pj Exp $ |
CVS : $Id: int_sem.h,v 1.2 2002-11-11 08:36:01 pj Exp $ |
File: $File$ |
Revision: $Revision: 1.1.1.1 $ |
Last update: $Date: 2002-03-29 14:12:51 $ |
Revision: $Revision: 1.2 $ |
Last update: $Date: 2002-11-11 08:36:01 $ |
------------ |
Internal semaphores. |
63,12 → 63,13 |
#define __INT_SEM_H__ |
#include <kernel/types.h> |
#include <kernel/iqueue.h> |
/* this is the structure normally pointed by the opt field in the |
mutex_t structure */ |
typedef struct { |
int count; |
QQUEUE blocked; |
IQUEUE blocked; |
} internal_sem_t; |
/shark/tags/rel_0_2/include/kernel/kern.h |
---|
21,11 → 21,11 |
/** |
------------ |
CVS : $Id: kern.h,v 1.1.1.1 2002-03-29 14:12:51 pj Exp $ |
CVS : $Id: kern.h,v 1.2 2002-11-11 08:36:01 pj Exp $ |
File: $File$ |
Revision: $Revision: 1.1.1.1 $ |
Last update: $Date: 2002-03-29 14:12:51 $ |
Revision: $Revision: 1.2 $ |
Last update: $Date: 2002-11-11 08:36:01 $ |
------------ |
Main kernel include file. |
67,6 → 67,8 |
//#include <kernel/err.h> |
//#include <kernel/exc.h> |
#include <kernel/var.h> |
#include <kernel/iqueue.h> |
#include <kernel/func.h> |
/shark/tags/rel_0_2/include/kernel/descr.h |
---|
21,11 → 21,11 |
/** |
------------ |
CVS : $Id: descr.h,v 1.1.1.1 2002-03-29 14:12:51 pj Exp $ |
CVS : $Id: descr.h,v 1.2 2002-11-11 08:36:01 pj Exp $ |
File: $File$ |
Revision: $Revision: 1.1.1.1 $ |
Last update: $Date: 2002-03-29 14:12:51 $ |
Revision: $Revision: 1.2 $ |
Last update: $Date: 2002-11-11 08:36:01 $ |
------------ |
Kernel main data structures |
70,6 → 70,7 |
#include <ll/ll.h> |
#include <kernel/model.h> |
#include <kernel/types.h> |
#include <kernel/iqueue.h> |
#include <limits.h> |
/*+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ |
140,8 → 141,8 |
struct _task_handler_rec *cleanup_stack; |
/*+ The cleanup stack +*/ |
QUEUE next,prev; /*+ Next/Prev Index in the queue +*/ |
int errnumber; |
/* Job Execution Time fields */ |
174,8 → 175,7 |
* the generic kernel, with exclusion of delay_timer that is used |
* also in cond_timedwait |
*/ |
DWORD priority; /*+ A priority field +*/ |
struct timespec timespec_priority; /*+ Another priority field +*/ |
int delay_timer; /*+ A field useful to store the delay timer +*/ |
int wcet; /*+ a worst case time execution +*/ |
219,8 → 219,6 |
0 if the level can manage the model, |
-1 if not +*/ |
// void (*level_init)(); /*+ initialization of the level module +*/ |
// void (*level_end)(); /*+ level termination (at system end... +*/ |
void (*level_status)(LEVEL l);/*+ print level statistics... +*/ |
PID (*level_scheduler)(LEVEL l); |
286,9 → 284,6 |
task in the EXE state. +*/ |
void (*task_delay)(LEVEL l, PID p,DWORD tickdelay); |
/* guest CALLS: |
these functions are called from an Aperiodic Server Level for the task |
that are inserted in the local queues */ |
324,7 → 319,6 |
/*+ the task is killed +*/ |
void (*guest_sleep)(LEVEL l, PID p); |
void (*guest_delay)(LEVEL l, PID p, TIME tickdelay); |
} level_des; |
438,7 → 432,7 |
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/ |
typedef struct condition_struct { |
QUEUE waiters; /*+ queue for tasks waiting on the condition +*/ |
IQUEUE waiters; /*+ queue for tasks waiting on the condition +*/ |
mutex_t *used_for_waiting; |
} cond_t; |
/shark/tags/rel_0_2/include/kernel/types.h |
---|
21,11 → 21,11 |
/** |
------------ |
CVS : $Id: types.h,v 1.1.1.1 2002-03-29 14:12:51 pj Exp $ |
CVS : $Id: types.h,v 1.2 2002-11-11 08:36:01 pj Exp $ |
File: $File$ |
Revision: $Revision: 1.1.1.1 $ |
Last update: $Date: 2002-03-29 14:12:51 $ |
Revision: $Revision: 1.2 $ |
Last update: $Date: 2002-11-11 08:36:01 $ |
------------ |
**/ |
49,27 → 49,9 |
* |
*/ |
/* +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ |
HARTIK SYSTEM TYPES |
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ */ |
#ifndef __KERNEL_TYPES_H__ |
#define __KERNEL_TYPES_H__ |
/*+ Used to manage task queues +*/ |
typedef int QUEUE; |
/*+ Used to manage task queues with tail +*/ |
typedef struct { |
int first; /*+ first element of a task queue, NIL if empty +*/ |
int last; /*+ last element of a task qqueue, NIL if empty +*/ |
} QQUEUE; |
/*+ Used to manage mutex queues +*/ |
//typedef int MQUEUE; |
#define TASK void * |
/*+ ... a task index +*/ |
/shark/tags/rel_0_2/include/kernel/config.h |
---|
21,11 → 21,11 |
/** |
------------ |
CVS : $Id: config.h,v 1.1.1.1 2002-03-29 14:12:51 pj Exp $ |
CVS : $Id: config.h,v 1.2 2002-11-11 08:36:01 pj Exp $ |
File: $File$ |
Revision: $Revision: 1.1.1.1 $ |
Last update: $Date: 2002-03-29 14:12:51 $ |
Revision: $Revision: 1.2 $ |
Last update: $Date: 2002-11-11 08:36:01 $ |
------------ |
Kernel configuration macros: |
57,28 → 57,6 |
#ifndef __KERNEL_CONFIG_H__ |
#define __KERNEL_CONFIG_H__ |
/*+ Define this if you use the CABs... +*/ |
#define __CAB__ |
/*+ Define this if you use the ports... +*/ |
#define __PORT__ |
/*+ Define this if you use the tracer... +*/ |
#define __TRACE__ |
//#undef __TRACE__ |
/*+ Define this if you want the printk messages... +*/ |
#define __DEBUG_ON__ |
#undef __DEBUG_ON__ |
/*+ checks the Memory at the kern_mem_init... +*/ |
#undef __MEM_DEBUG__ |
/*+ defined if we are compiling test1.c with init1.c +*/ |
//#define __TEST1__ |
/*+ defined if we are compiling testG.c +*/ |
//#define TESTG |
/shark/tags/rel_0_2/include/kernel/var.h |
---|
21,11 → 21,11 |
/** |
------------ |
CVS : $Id: var.h,v 1.1.1.1 2002-03-29 14:12:51 pj Exp $ |
CVS : $Id: var.h,v 1.2 2002-11-11 08:36:01 pj Exp $ |
File: $File$ |
Revision: $Revision: 1.1.1.1 $ |
Last update: $Date: 2002-03-29 14:12:51 $ |
Revision: $Revision: 1.2 $ |
Last update: $Date: 2002-11-11 08:36:01 $ |
------------ |
Kernel global variables |
70,7 → 70,7 |
extern PID exec; /*+ task suggested by the scheduler +*/ |
extern PID exec_shadow; /*+ task really executed +*/ |
extern QUEUE freedesc; /*+ Free descriptor handled as a queue +*/ |
extern IQUEUE freedesc; /*+ Free descriptor handled as a queue +*/ |
extern TIME sys_tick; /*+ System tick (in usec) +*/ |
extern struct timespec schedule_time; |
/shark/tags/rel_0_2/include/trace/qudp.h |
---|
21,16 → 21,26 |
#ifndef __TRACE_QUDP_H |
#define __TRACE_QUDP_H |
#include <kernel/model.h> |
#include <drivers/udpip.h> |
typedef struct TAGtrc_udp_queue_args_t { |
UDP_ADDR addr; |
int size; |
UDP_ADDR local,remote; |
TASK_MODEL *model; |
} TRC_UDP_PARMS; |
#define trc_udp_default_parms(m) |
#define trc_udp_default_parms(m,l,r) (m).size=8192, \ |
(m).model = NULL, \ |
(m).local = (l), \ |
(m).remote = (r); |
#define trc_udp_def_addr(m,addr) |
#define trc_udp_def_size(m,s) (m).size=(s) |
#define trc_udp_def_local(m,l) (m).local=(l) |
#define trc_udp_def_remote(m,r) (m).remote=(r) |
#define trc_udp_def_model(m,mod) (m).model=(mod) |
int trc_register_udp_queue(void); |
#endif |
/shark/tags/rel_0_2/include/trace/queues.h |
---|
38,11 → 38,11 |
*/ |
/* |
* CVS : $Id: queues.h,v 1.1.1.1 2002-03-29 14:12:51 pj Exp $ |
* CVS : $Id: queues.h,v 1.3 2002-10-28 07:53:40 pj Exp $ |
* |
* File: $File$ |
* Revision: $Revision: 1.1.1.1 $ |
* Last update: $Date: 2002-03-29 14:12:51 $ |
* Revision: $Revision: 1.3 $ |
* Last update: $Date: 2002-10-28 07:53:40 $ |
*/ |
#ifndef __TRACE_QUEUES_H |
62,15 → 62,16 |
#include <trace/qdummy.h> |
#define TRC_FIXED_QUEUE 1 |
#define TRC_DOSFS_FIXED_QUEUE 2 |
#include <trace/qfixed.h> |
#define TRC_CIRCULAR_QUEUE 2 |
#define TRC_CIRCULAR_QUEUE 3 |
#include <trace/qcirc.h> |
#define TRC_UDP_QUEUE 3 |
#define TRC_UDP_QUEUE 4 |
#include <trace/qudp.h> |
#define TRC_QUEUETYPESNUMBER 4 |
#define TRC_QUEUETYPESNUMBER 5 |
/* uniq!=0 append a this unique number to name */ |
void trc_create_name(char *basename, int uniq, char *pathname); |
/shark/tags/rel_0_2/include/trace/trace.h |
---|
38,11 → 38,11 |
*/ |
/* |
* CVS : $Id: trace.h,v 1.1.1.1 2002-03-29 14:12:51 pj Exp $ |
* CVS : $Id: trace.h,v 1.2 2002-10-21 10:17:26 pj Exp $ |
* |
* File: $File$ |
* Revision: $Revision: 1.1.1.1 $ |
* Last update: $Date: 2002-03-29 14:12:51 $ |
* Revision: $Revision: 1.2 $ |
* Last update: $Date: 2002-10-21 10:17:26 $ |
*/ |
#ifndef __TRACE_TRACE_H |
68,6 → 68,8 |
/* -- */ |
/* Register a "standard" tracer configuration; requires FAT16 filesystem |
(see documentation) */ |
int TRC_init_phase1_standard(void); |
int TRC_init_phase2_standard(void); |
/shark/tags/rel_0_2/include/trace/qfixed.h |
---|
31,7 → 31,12 |
#define trc_fixed_def_filename(m,s) (m).filename=(s) |
#define trc_fixed_def_size(m,s) (m).size=(s) |
/* Fixed queue, FAT16 filesystem (see kernel/modules/trcfixed.c) */ |
int trc_register_fixed_queue(void); |
/* Fixed queue, DOSFS filesystem (see kernel/modules/trcdfix.c) |
Note: You MUST specify a valid filename... */ |
int trc_register_dosfs_fixed_queue(void); |
#endif |
/shark/tags/rel_0_2/include/bits/errno.h |
---|
20,11 → 20,11 |
/** |
------------ |
CVS : $Id: errno.h,v 1.1.1.1 2002-03-29 14:12:51 pj Exp $ |
CVS : $Id: errno.h,v 1.2 2002-10-28 07:53:00 pj Exp $ |
File: $File$ |
Revision: $Revision: 1.1.1.1 $ |
Last update: $Date: 2002-03-29 14:12:51 $ |
Revision: $Revision: 1.2 $ |
Last update: $Date: 2002-10-28 07:53:00 $ |
------------ |
- error codes used as values for errno |
105,10 → 105,10 |
#define LAST_EXC_NUMBER 19 |
#define XDOUBLE_EXCEPTION 1 /* in act_exc */ |
#define XUNVALID_KILL_SHADOW 2 /* task_makefree */ |
#define XINVALID_KILL_SHADOW 2 /* task_makefree */ |
#define XNOMORE_CLEANUPS 3 /* task_cleanup_push */ |
#define XUNVALID_TASK 4 /* invalid operation for a task */ |
#define XUNVALID_GUEST 5 /* invalid operation for a guest task */ |
#define XINVALID_TASK 4 /* invalid operation for a task */ |
#define XINVALID_GUEST 5 /* invalid operation for a guest task */ |
#define XNOMORE_EVENTS 6 /* too many events posted... */ |
#define XDEADLINE_MISS 7 /* PERIODIC_PCLASS, SPORADIC_PCLASS */ |
116,10 → 116,10 |
#define XACTIVATION 9 /* PERIODIC_PCLASS, SPORADIC_PCLASS */ |
#define XMUTEX_OWNER_KILLED 10 /* Mutex */ |
#define XSRP_UNVALID_LOCK 11 /* SRP */ |
#define XSRP_INVALID_LOCK 11 /* SRP */ |
#define XUNVALID_DUMMY_OP 12 /* dummy.h hope it will never called... */ |
#define XUNVALID_SS_REPLENISH 13 /* kernel/mosules/ss.c */ |
#define XINVALID_DUMMY_OP 12 /* dummy.h hope it will never called... */ |
#define XINVALID_SS_REPLENISH 13 /* kernel/mosules/ss.c */ |
#define XARP_TABLE_FULL 14 /* drivers/net/arp.c */ |
154,9 → 154,9 |
#define ENO_GUARANTEE (10 + LAST_STDERRNO) /* task_create */ |
#define ENO_AVAIL_STACK_MEM (11 + LAST_STDERRNO) /* task_create */ |
#define ENO_AVAIL_TSS (12 + LAST_STDERRNO) /* task_create */ |
#define EUNVALID_KILL (13 + LAST_STDERRNO) /* task_kill */ |
#define EUNVALID_TASK_ID (14 + LAST_STDERRNO) /* task_activate */ |
#define EUNVALID_GROUP (15 + LAST_STDERRNO) /* group_activate e group_kill */ |
#define EINVALID_KILL (13 + LAST_STDERRNO) /* task_kill */ |
#define EINVALID_TASK_ID (14 + LAST_STDERRNO) /* task_activate */ |
#define EINVALID_GROUP (15 + LAST_STDERRNO) /* group_activate e group_kill */ |
#define EPORT_NO_MORE_DESCR (16 + LAST_STDERRNO) |
#define EPORT_NO_MORE_INTERF (17 + LAST_STDERRNO) |
167,11 → 167,11 |
#define EPORT_UNSUPPORTED_ACC (22 + LAST_STDERRNO) |
#define EPORT_WRONG_OP (23 + LAST_STDERRNO) |
#define EPORT_WRONG_TYPE (24 + LAST_STDERRNO) |
#define EPORT_UNVALID_DESCR (25 + LAST_STDERRNO) |
#define EPORT_INVALID_DESCR (25 + LAST_STDERRNO) |
#define ECAB_UNVALID_ID (26 + LAST_STDERRNO) |
#define ECAB_INVALID_ID (26 + LAST_STDERRNO) |
#define ECAB_CLOSED (27 + LAST_STDERRNO) |
#define ECAB_UNVALID_MSG_NUM (28 + LAST_STDERRNO) |
#define ECAB_INVALID_MSG_NUM (28 + LAST_STDERRNO) |
#define ECAB_NO_MORE_ENTRY (29 + LAST_STDERRNO) |
#define ECAB_TOO_MUCH_MSG (30 + LAST_STDERRNO) |
/shark/tags/rel_0_2/include/drivers/parport.h |
---|
0,0 → 1,241 |
/* |
* Project: |
* Parallel Port S.Ha.R.K. Project |
* |
* Module: |
* ppDrv.h |
* |
* Description: |
* file contents description |
* |
* Coordinators: |
* Giorgio Buttazzo <giorgio@sssup.it> |
* Paolo Gai <pj@gandalf.sssup.it> |
* |
* Authors: |
* Andrea Battistotti <btandrea@libero.it> |
* Armando Leggio <a_leggio@hotmail.com> |
* |
* |
* http://www.sssup.it |
* http://retis.sssup.it |
* http://shark.sssup.it |
* |
*/ |
/* PPDrv.h |
header file for par port communication... |
*/ |
/* |
* Copyright (C) 2002 Andrea Battistotti , Armando Leggio |
* |
* This program is free software; you can redistribute it and/or modify |
* it under the terms of the GNU General Public License as published by |
* the Free Software Foundation; either version 2 of the License, or |
* (at your option) any later version. |
* |
* This program is distributed in the hope that it will be useful, |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
* GNU General Public License for more details. |
* |
* You should have received a copy of the GNU General Public License |
* along with this program; if not, write to the Free Software |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
* |
* CVS : $Id: parport.h,v 1.1 2002-10-28 07:52:11 pj Exp $ |
*/ |
#include <kernel/kern.h> |
#include <drivers/glib.h> |
#include <drivers/keyb.h> |
#include <time.h> |
#include <stdio.h> |
#include <stdlib.h> |
#include <kernel/func.h> |
#include <string.h> |
#include <ll/ll.h> |
#include <kernel/types.h> |
#include <kernel/descr.h> |
#include <math.h> |
/* general defs... */ |
#define PP_DEBUG 1 /* 1/0 Activate/Disactive internal debugs... */ |
#define PP_STATS 1 /* 1/0 Activate/Disactive internal statistics... */ |
/* return value... */ |
#define FALSE 0 |
#define TRUE 1 |
#define TIMEOUT 2 |
#define PP_BASE_ADR 0x0378 /* std addr for LPT1 */ |
#define BYTE unsigned char |
#define BOOL unsigned char |
#define BUF_IDX unsigned int |
#define BUF_PNTR unsigned int |
#define PIN_MASK unsigned int |
#define clock() sys_gettime(NULL) |
enum PIN_STATUS { PIN_OFF , PIN_ON } ; /* positive logic: off==0, on==1 */ |
/*********************************************************************************/ |
/* PART 1 : LOW LIVEL FUNC */ |
/* defs used in ppPinDrv....*/ |
/* for std & pin use of pp... */ |
#define PP_DATA_REG (PP_BASE_ADR+0) // address of data register |
#define PP_STATUS_REG (PP_BASE_ADR+1) // address of status register |
#define PP_CONTR_REG (PP_BASE_ADR+2) // address of control regist |
/* out data pins... */ |
#define PP_PIN_D0 0x01 /* pin 2 */ |
#define PP_PIN_D1 0x02 /* pin 3 */ |
#define PP_PIN_D2 0x04 /* pin 4 */ |
#define PP_PIN_D3 0x08 /* pin 5 */ |
#define PP_PIN_D4 0x10 /* pin 6 */ |
#define PP_PIN_D5 0x20 /* pin 7 */ |
#define PP_PIN_D6 0x40 /* pin 8 */ |
#define PP_PIN_D7 0x80 /* pin 9 */ |
/* status pins... */ |
#define PP_PIN_ERROR 0x08 /* pin 15 */ |
#define PP_PIN_SELECTED 0x10 /* pin 13 */ |
#define PP_PIN_PAPEROUT 0x20 /* pin 12 */ |
#define PP_PIN_ACK 0x40 /* pin 10 */ |
#define PP_PIN_BUSY 0x80 /* pin 11 */ |
/* control pins... */ |
#define PP_PIN_DATASTROBE 0x01 /* pin 1 */ |
#define PP_PIN_AUTOFEED 0x02 /* pin 14 */ |
#define PP_PIN_INITOUT 0x04 /* pin 16 */ |
#define PP_PIN_SELECT 0x08 /* pin 17 */ |
/* Data i/o */ |
#define ppSetDataByte(a) outp(PP_DATA_REG,a) |
#define ppReadDataByte() inp(PP_DATA_REG) |
/* this is NOT bidirectional actually: simply read value that I myself wrote on parport early...*/ |
/* in std lpt you cannot lay down electric pin D0,D1,..D7 from extern and read value in pc...*/ |
/* this (in std lpt) will broke down lpt port!... */ |
/* there are obviously also bi-dir port on 8 bit (ECC & ECP) but ctrl & status pins have */ |
/* different meaning so we don't manage them... See docs. */ |
/* Data pins */ |
void ppSetDataPin(int state, PIN_MASK pin); /* in ppPinDrv.c */ |
#define ppSetPin_D0(a) ppSetDataPin(a,PP_PIN_D0) /* On ==1 , Off == 0 */ |
#define ppSetPin_D1(a) ppSetDataPin(a,PP_PIN_D1) |
#define ppSetPin_D2(a) ppSetDataPin(a,PP_PIN_D2) |
#define ppSetPin_D3(a) ppSetDataPin(a,PP_PIN_D3) |
#define ppSetPin_D4(a) ppSetDataPin(a,PP_PIN_D4) |
#define ppSetPin_D5(a) ppSetDataPin(a,PP_PIN_D5) |
#define ppSetPin_D6(a) ppSetDataPin(a,PP_PIN_D6) |
#define ppSetPin_D7(a) ppSetDataPin(a,PP_PIN_D7) |
/* Status pins */ |
#define ppCheckPin_Error() (inp(PP_STATUS_REG & PP_PIN_ERROR)!=0?1:0) |
#define ppCheckPin_Selected() (inp(PP_STATUS_REG & PP_PIN_SELECTED)!=0?1:0) |
#define ppCheckPin_PaperOut() (inp(PP_STATUS_REG & PP_PIN_PAPEROUT)!=0?1:0) |
#define ppCheckPin_Acknowledge() (inp(PP_STATUS_REG & PP_PIN_ACK)!=0?1:0) |
#define ppCheckPin_Busy() (inp(PP_STATUS_REG & PP_PIN_BUSY)!=0?0:1) /* act low...*/ |
/* Control pins */ |
/* Control i/o */ |
#define ppSetCtrlByte(a) outp(PP_CONTR_REG,a) |
#define ppReadCtrlByte() inp(PP_CONTR_REG) |
/* idem...*/ |
void ppSetCtrlPin(int state, PIN_MASK pin); /* in ppPinDrv.c */ |
#define ppSetPin_DataStrobe(a) ppSetCtrlPin(!a,PP_PIN_DATASTROBE) /* low active...*/ |
#define ppSetPin_Autofeed(a) ppSetCtrlPin(!a,PP_PIN_AUTOFEED) /* low active...*/ |
#define ppSetPin_InitOut(a) ppSetCtrlPin(a,PP_PIN_INITOUT) |
#define ppSetPin_Select(a) ppSetCtrlPin(!a,PP_PIN_SELECT) /* low active...*/ |
/*********************************************************************************/ |
/* PART 2 : DATA TRANSFER BETWEEN PC */ |
/* defs used in ppDrv & ppNRTDrv... */ |
#define PPDRV_PERIOD 1000 /* 300000 ok for debug...*/ |
#define PPDRV_WCET 150 /* lower bound: 120; more if debug & stats are on...*/ |
#define PP_BUF_LEN 1024 /* between 2^2 and 2^16 (64k) */ |
#define CLK_TIMEOUT 55000 /* timeout for sync pc-pc...*/ |
/* for laplink use of std pp... */ |
#define TX_PORT PP_BASE_ADR /* transmit port */ |
#define RX_PORT TX_PORT+1 /* receive port */ |
/* laplink bit mask */ |
#define TX_DATA 0x0F /* 0000 1111 pin 2,3,4,5 */ |
#define TX_CTR 0x10 /* 0001 0000 bit 4 port TX pin 6*/ |
#define RX_DATA 0x78 /* 0111 1000 pin 15,13,12,10 */ |
#define RX_CTR 0x80 /* 1000 0000 bit 7 port RX pin 11*/ |
#define LSN 0x0F /* 0000 1111 low significative nibble */ |
#define MSN 0xF0 /* 1111 0000 most significative nibble */ |
#define BYTE_CTR 0xAF /* 1010 1111 control char */ |
/* comm protocol */ |
#define ppSendRTS() ppSetOnPinTX_CTR() |
#define ppIsRTS() ppReadIfPinRX_CTRIsOn() |
#define ppSendOTS() ppSetOnPinTX_CTR() |
#define ppIsOTS() ppReadIfPinRX_CTRIsOn() |
#define ppSendDR() ppSetOffPinTX_CTR() |
#define ppIsDR() ppReadIfPinRX_CTRIsOff() |
#define ppSendER() ppSetOffPinTX_CTR() |
#define ppIsER() ppReadIfPinRX_CTRIsOff() |
#define ppSetOnPinTX_CTR() outp(TX_PORT,(inp(TX_PORT)|TX_CTR)) /* used by: ppSendRTS ppSendOTS */ |
#define ppSetOffPinTX_CTR() outp(TX_PORT,(inp(TX_PORT)&(~TX_CTR))) /* used by: ppSendDR ppSendER */ |
#define ppReadIfPinRX_CTRIsOn() ((((~inp(RX_PORT))&RX_CTR)==0)?FALSE:TRUE) |
#define ppReadIfPinRX_CTRIsOff() (((BYTE)((~RX_CTR)|(~inp(RX_PORT)))==0x7F)?TRUE:FALSE) |
/* Funct Return Code */ |
enum PP_COMM_RTR_CODE { |
PP_COMM_OK, |
PP_COMM_NOREADYBYTES_EXC, |
PP_COMM_NOFREEBYTES_EXC |
}; |
/* Funct Return Code */ |
enum PP_SYSMSG_RTR_CODE { |
PP_SYSMSG_OK, |
PP_NOSYSMSG_EXC, |
PP_NOFREEMSG_EXC |
}; |
/* NON REAL TIME (== BLOCK) functions...*/ |
/* from ppNRTDrv.c...*/ |
BOOL ppNRTOpenComm(void); |
BOOL ppNRTWaitRTS(void); |
BOOL ppNRTWaitDR(void); |
BOOL ppNRTWaitOTS(void); |
BOOL ppNRTWaitER(void); |
BOOL ppNRTTxOneByte(BYTE c); |
BOOL ppNRTRxOneByte(BYTE *c); |
/* REAL TIME (== NON BLOCK) POLLING SERVER */ |
/* from ppDrv.c... */ |
void ppInitDrv(void (*pf)(char *)); /* NRT: to be called before start ppPollingSrv...*/ |
TASK ppPollingSvr(void *arg); /* periodic task to be started before any call to Rx/Tx...*/ |
/* input output function */ |
int ppRxOneByte(BYTE *c); /* retrive 1 byte */ |
int ppTxOneByte(BYTE c); /* send 1 byte */ |
int ppRxBytes(BYTE *c, unsigned int nbyte); /* retrive n byte... */ |
int ppTxBytes(BYTE *c, unsigned int nbyte); /* send n byte... */ |
/* System msg */ |
#define SYS_MSG_COLS 33 |
#define SYS_MSG_LINS 15 |
int ppReadSysMsg(char * buf); |
int ppWriteSysMsg(char * buf, ...); |