X-Git-Url: http://rtime.felk.cvut.cz/gitweb/lincan.git/blobdiff_plain/c6d6f58c34e1b6a4c03d1e86d1abf48eeb6f5624..c759ac4ffabb78a8863d9bced695980077eeb319:/lincan/include/can_queue.h diff --git a/lincan/include/can_queue.h b/lincan/include/can_queue.h index 5951186..5ed1fe4 100644 --- a/lincan/include/can_queue.h +++ b/lincan/include/can_queue.h @@ -1,7 +1,15 @@ +/* can_queue.h - CAN queues and message passing infrastructure + * Linux CAN-bus device driver. + * Written by Pavel Pisa - OCERA team member + * email:pisa@cmp.felk.cvut.cz + * This software is released under the GPL-License. + * Version lincan-0.3 17 Jun 2004 + */ + #ifndef _CAN_QUEUE_H #define _CAN_QUEUE_H -#include "./can.h" +#include "./canmsg.h" #include "./constants.h" #include "./can_sysdep.h" @@ -39,6 +47,7 @@ * @flist: pointer to list of the free slots associated with queue * @entry: pointer to the memory allocated for the list slots. * @fifo_lock: the lock to ensure atomicity of slot manipulation operations. + * @slotsnr: number of allocated slots * * This structure represents CAN FIFO queue. It is implemented as * a single linked list of slots prepared for processing. The empty slots @@ -51,7 +60,8 @@ struct canque_fifo_t { struct canque_slot_t **tail; /* points to NULL pointer for chaining */ struct canque_slot_t *flist; /* points the first entry in the free list */ struct canque_slot_t *entry; /* points to first allocated entry */ - spinlock_t fifo_lock; /* spin_lock_irqsave / spin_lock_irqrestore */ + can_spinlock_t fifo_lock; /* can_spin_lock_irqsave / can_spin_unlock_irqrestore */ + int slotsnr; }; #define CAN_FIFOF_DESTROY_b 15 @@ -65,6 +75,8 @@ struct canque_fifo_t { #define CAN_FIFOF_INACTIVE_b 7 #define CAN_FIFOF_FREEONEMPTY_b 6 #define CAN_FIFOF_READY_b 5 +#define CAN_FIFOF_NOTIFYPEND_b 4 +#define CAN_FIFOF_RTL_MEM_b 3 #define CAN_FIFOF_DESTROY (1<fifo_flags) @@ -102,21 +116,21 @@ struct canque_fifo_t { static inline int canque_fifo_get_inslot(struct canque_fifo_t *fifo, struct canque_slot_t **slotp, int cmd) { - unsigned long flags; + can_spin_irqflags_t flags; struct canque_slot_t *slot; - spin_lock_irqsave(&fifo->fifo_lock, flags); + can_spin_lock_irqsave(&fifo->fifo_lock, flags); /* get the first free slot slot from flist */ if(!(slot=fifo->flist)) { canque_fifo_set_fl(fifo,OVERRUN); canque_fifo_set_fl(fifo,FULL); - spin_unlock_irqrestore(&fifo->fifo_lock, flags); + can_spin_unlock_irqrestore(&fifo->fifo_lock, flags); *slotp=NULL; return -1; } /* adjust free slot list */ if(!(fifo->flist=slot->next)) canque_fifo_set_fl(fifo,FULL); - spin_unlock_irqrestore(&fifo->fifo_lock, flags); + can_spin_unlock_irqrestore(&fifo->fifo_lock, flags); *slotp=slot; slot->slot_flags=cmd&CAN_SLOTF_CMD; return 1; @@ -134,10 +148,10 @@ static inline int canque_fifo_put_inslot(struct canque_fifo_t *fifo, struct canque_slot_t *slot) { int ret; - unsigned long flags; + can_spin_irqflags_t flags; slot->next=NULL; - spin_lock_irqsave(&fifo->fifo_lock, flags); - if(*fifo->tail) printk(KERN_CRIT "canque_fifo_put_inslot: fifo->tail != NULL\n"); + can_spin_lock_irqsave(&fifo->fifo_lock, flags); + if(*fifo->tail) can_printk(KERN_CRIT "canque_fifo_put_inslot: fifo->tail != NULL\n"); *fifo->tail=slot; fifo->tail=&slot->next; ret=0; @@ -145,7 +159,7 @@ int canque_fifo_put_inslot(struct canque_fifo_t *fifo, struct canque_slot_t *slo ret=CAN_FIFOF_EMPTY; /* Fifo has been empty before put */ if(canque_fifo_test_and_clear_fl(fifo,INACTIVE)) ret=CAN_FIFOF_INACTIVE; /* Fifo has been empty before put */ - spin_unlock_irqrestore(&fifo->fifo_lock, flags); + can_spin_unlock_irqrestore(&fifo->fifo_lock, flags); return ret; } @@ -160,13 +174,13 @@ static inline int canque_fifo_abort_inslot(struct canque_fifo_t *fifo, struct canque_slot_t *slot) { int ret=0; - unsigned long flags; - spin_lock_irqsave(&fifo->fifo_lock, flags); + can_spin_irqflags_t flags; + can_spin_lock_irqsave(&fifo->fifo_lock, flags); slot->next=fifo->flist; fifo->flist=slot; if(canque_fifo_test_and_clear_fl(fifo,FULL)) ret=CAN_FIFOF_FULL; - spin_unlock_irqrestore(&fifo->fifo_lock, flags); + can_spin_unlock_irqrestore(&fifo->fifo_lock, flags); return ret; } @@ -184,19 +198,19 @@ int canque_fifo_abort_inslot(struct canque_fifo_t *fifo, struct canque_slot_t *s static inline int canque_fifo_test_outslot(struct canque_fifo_t *fifo, struct canque_slot_t **slotp) { - unsigned long flags; + can_spin_irqflags_t flags; int cmd; struct canque_slot_t *slot; - spin_lock_irqsave(&fifo->fifo_lock, flags); + can_spin_lock_irqsave(&fifo->fifo_lock, flags); if(!(slot=fifo->head)){; canque_fifo_set_fl(fifo,EMPTY); - spin_unlock_irqrestore(&fifo->fifo_lock, flags); + can_spin_unlock_irqrestore(&fifo->fifo_lock, flags); *slotp=NULL; return -1; } if(!(fifo->head=slot->next)) fifo->tail=&fifo->head; - spin_unlock_irqrestore(&fifo->fifo_lock, flags); + can_spin_unlock_irqrestore(&fifo->fifo_lock, flags); *slotp=slot; cmd=slot->slot_flags; @@ -218,8 +232,8 @@ static inline int canque_fifo_free_outslot(struct canque_fifo_t *fifo, struct canque_slot_t *slot) { int ret=0; - unsigned long flags; - spin_lock_irqsave(&fifo->fifo_lock, flags); + can_spin_irqflags_t flags; + can_spin_lock_irqsave(&fifo->fifo_lock, flags); slot->next=fifo->flist; fifo->flist=slot; if(canque_fifo_test_and_clear_fl(fifo,FULL)) @@ -228,7 +242,7 @@ int canque_fifo_free_outslot(struct canque_fifo_t *fifo, struct canque_slot_t *s canque_fifo_set_fl(fifo,EMPTY); ret|=CAN_FIFOF_EMPTY; } - spin_unlock_irqrestore(&fifo->fifo_lock, flags); + can_spin_unlock_irqrestore(&fifo->fifo_lock, flags); return ret; } @@ -242,20 +256,18 @@ int canque_fifo_free_outslot(struct canque_fifo_t *fifo, struct canque_slot_t *s static inline int canque_fifo_again_outslot(struct canque_fifo_t *fifo, struct canque_slot_t *slot) { - unsigned long flags; - spin_lock_irqsave(&fifo->fifo_lock, flags); + can_spin_irqflags_t flags; + can_spin_lock_irqsave(&fifo->fifo_lock, flags); if(!(slot->next=fifo->head)) fifo->tail=&slot->next; fifo->head=slot; - spin_unlock_irqrestore(&fifo->fifo_lock, flags); + can_spin_unlock_irqrestore(&fifo->fifo_lock, flags); return 1; } int canque_fifo_flush_slots(struct canque_fifo_t *fifo); -int canque_fifo_init_slots(struct canque_fifo_t *fifo, int slotsnr); - -int canque_fifo_done(struct canque_fifo_t *fifo); +int canque_fifo_init_slots(struct canque_fifo_t *fifo); #define CANQUEUE_PRIO_NR 3 @@ -269,15 +281,21 @@ struct chip_t; * @filtid: the possible CAN message identifiers filter. * @filtmask: the filter mask, the comparison considers only * @filtid bits corresponding to set bits in the @filtmask field. - * @inpeers: the lists of all peer FIFOs connected by their + * @inpeers: the lists of all peers FIFOs connected by their * input side (@inends) to the same terminal (@struct canque_ends_t). - * @outpeers: the lists of all peer FIFOs connected by their + * @outpeers: the lists of all peers FIFOs connected by their * output side (@outends) to the same terminal (@struct canque_ends_t). + * @activepeers: the lists of peers FIFOs connected by their + * output side (@outends) to the same terminal (@struct canque_ends_t) + * with same priority and active state. * @inends: the pointer to the FIFO input side terminal (@struct canque_ends_t). * @outends: the pointer to the FIFO output side terminal (@struct canque_ends_t). * @edge_used: the atomic usage counter, mainly used for safe destruction of the edge. * @edge_prio: the assigned queue priority from the range 0 to %CANQUEUE_PRIO_NR-1 * @edge_num: edge sequential number intended for debugging purposes only + * @pending_peers: edges with pending delayed events (RTL->Linux calls) + * @pending_inops: bitmask of pending operations + * @pending_outops: bitmask of pending operations * * This structure represents one direction connection from messages source * (@inends) to message consumer (@outends) fifo ends hub. The edge contains @@ -289,11 +307,17 @@ struct canque_edge_t { unsigned long filtmask; struct list_head inpeers; struct list_head outpeers; + struct list_head activepeers; struct canque_ends_t *inends; struct canque_ends_t *outends; atomic_t edge_used; int edge_prio; int edge_num; + #ifdef CAN_WITH_RTL + struct list_head pending_peers; + unsigned long pending_inops; + unsigned long pending_outops; + #endif /*CAN_WITH_RTL*/ }; /** @@ -303,6 +327,8 @@ struct canque_edge_t { * with ready messages. The array is indexed by the edges priorities. * @idle: the list of the edges directed to the ends structure with empty FIFOs. * @inlist: the list of outgoing edges input sides. + * @outlist: the list of all incoming edges output sides. Each of there edges + * is listed on one of @active or @idle lists. * @ends_lock: the lock synchronizing operations between threads accessing * same ends structure. * @notify: pointer to notify procedure. The next state changes are notified. @@ -318,6 +344,7 @@ struct canque_edge_t { * @context: space to store ends user specific information * @endinfo: space to store some other ends usage specific informations * mainly for waking-up by the notify calls. + * @dead_peers: used to chain ends wanting for postponed destruction * * Structure represents place to connect edges to for CAN communication entity. * The zero, one or more incoming and outgoing edges can be connected to @@ -328,7 +355,8 @@ struct canque_ends_t { struct list_head active[CANQUEUE_PRIO_NR]; struct list_head idle; struct list_head inlist; - spinlock_t ends_lock; /* spin_lock_irqsave / spin_lock_irqrestore */ + struct list_head outlist; + can_spinlock_t ends_lock; /* can_spin_lock_irqsave / can_spin_unlock_irqrestore */ void (*notify)(struct canque_ends_t *qends, struct canque_edge_t *qedge, int what); void *context; union { @@ -336,11 +364,30 @@ struct canque_ends_t { wait_queue_head_t readq; wait_queue_head_t writeq; wait_queue_head_t emptyq; + #ifdef CAN_ENABLE_KERN_FASYNC + struct fasync_struct *fasync; + #endif /*CAN_ENABLE_KERN_FASYNC*/ } fileinfo; + #ifdef CAN_WITH_RTL + struct { + rtl_spinlock_t rtl_lock; + rtl_wait_t rtl_readq; + atomic_t rtl_readq_age; + rtl_wait_t rtl_writeq; + atomic_t rtl_writeq_age; + rtl_wait_t rtl_emptyq; + atomic_t rtl_emptyq_age; + unsigned long pend_flags; + } rtlinfo; + #endif /*CAN_WITH_RTL*/ struct { - wait_queue_head_t daemonq; struct msgobj_t *msgobj; struct chip_t *chip; + #ifndef CAN_WITH_RTL + wait_queue_head_t daemonq; + #else /*CAN_WITH_RTL*/ + pthread_t worker_thread; + #endif /*CAN_WITH_RTL*/ } chipinfo; } endinfo; struct list_head dead_peers; @@ -359,7 +406,8 @@ struct canque_ends_t { #define CANQUEUE_NOTIFY_ERRTX_SEND 0x11002 /* tx send error */ #define CANQUEUE_NOTIFY_ERRTX_BUS 0x11003 /* tx bus error */ -#define CAN_ENDSF_DEAD (1<<0) +#define CAN_ENDSF_DEAD (1<<0) +#define CAN_ENDSF_MEM_RTL (1<<1) /** * canque_notify_inends - request to send notification to the input ends @@ -405,28 +453,26 @@ void canque_notify_bothends(struct canque_edge_t *qedge, int what) * @inends: input side of the edge * * Function call moves output side of the edge from idle onto active edges - * list. + * list. This function has to be called with edge reference count held. + * that is same as for most of other edge functions. */ static inline void canque_activate_edge(struct canque_ends_t *inends, struct canque_edge_t *qedge) { - unsigned long flags; + can_spin_irqflags_t flags; struct canque_ends_t *outends; if(qedge->edge_prio>=CANQUEUE_PRIO_NR) qedge->edge_prio=CANQUEUE_PRIO_NR-1; - spin_lock_irqsave(&inends->ends_lock, flags); if((outends=qedge->outends)){ - spin_lock(&outends->ends_lock); - spin_lock(&qedge->fifo.fifo_lock); + can_spin_lock_irqsave(&outends->ends_lock, flags); + can_spin_lock(&qedge->fifo.fifo_lock); if(!canque_fifo_test_fl(&qedge->fifo,EMPTY)){ - list_del(&qedge->outpeers); - list_add_tail(&qedge->outpeers,&outends->active[qedge->edge_prio]); + list_del(&qedge->activepeers); + list_add_tail(&qedge->activepeers,&outends->active[qedge->edge_prio]); } - spin_unlock(&qedge->fifo.fifo_lock); - spin_unlock(&outends->ends_lock); - + can_spin_unlock(&qedge->fifo.fifo_lock); + can_spin_unlock_irqrestore(&outends->ends_lock, flags); } - spin_unlock_irqrestore(&inends->ends_lock, flags); } /** @@ -479,11 +525,28 @@ int canqueue_connect_edge(struct canque_edge_t *qedge, struct canque_ends_t *ine int canqueue_ends_init_gen(struct canque_ends_t *qends); +void canqueue_block_inlist(struct canque_ends_t *qends); + +void canqueue_block_outlist(struct canque_ends_t *qends); + +int canqueue_ends_kill_inlist(struct canque_ends_t *qends, int send_rest); + +int canqueue_ends_kill_outlist(struct canque_ends_t *qends); + +int canqueue_ends_filt_conjuction(struct canque_ends_t *qends, struct canfilt_t *filt); + +int canqueue_ends_flush_inlist(struct canque_ends_t *qends); + +int canqueue_ends_flush_outlist(struct canque_ends_t *qends); /* edge reference and traversal functions */ -void canque_edge_do_dead(struct canque_edge_t *edge, int dead_fl); +void canque_edge_do_dead(struct canque_edge_t *edge); +/** + * canque_edge_incref - increments edge reference count + * @qedg: pointer to the edge structure + */ static inline void canque_edge_incref(struct canque_edge_t *edge) { @@ -491,36 +554,90 @@ void canque_edge_incref(struct canque_edge_t *edge) } static inline -void canque_edge_decref(struct canque_edge_t *edge) +can_spin_irqflags_t canque_edge_lock_both_ends(struct canque_ends_t *inends, struct canque_ends_t *outends) +{ + can_spin_irqflags_t flags; + if(inendsends_lock, flags); + can_spin_lock(&outends->ends_lock); + }else{ + can_spin_lock_irqsave(&outends->ends_lock, flags); + if(outends!=inends) can_spin_lock(&inends->ends_lock); + } + return flags; +} + +static inline +void canque_edge_unlock_both_ends(struct canque_ends_t *inends, struct canque_ends_t *outends, can_spin_irqflags_t flags) +{ + if(outends!=inends) can_spin_unlock(&outends->ends_lock); + can_spin_unlock_irqrestore(&inends->ends_lock, flags); +} + +/* Non-inlined version of edge reference decrement */ +void __canque_edge_decref(struct canque_edge_t *edge); + +static inline +void __canque_edge_decref_body(struct canque_edge_t *edge) { - unsigned long flags; + can_spin_irqflags_t flags; + int dead_fl=0; struct canque_ends_t *inends=edge->inends; struct canque_ends_t *outends=edge->outends; - int dead_fl; - spin_lock_irqsave(&inends->ends_lock, flags); - spin_lock(&outends->ends_lock); + flags=canque_edge_lock_both_ends(inends, outends); if(atomic_dec_and_test(&edge->edge_used)) { - dead_fl=canque_fifo_test_and_set_fl(&edge->fifo,DEAD); - /*This should not be there, but it cannot be outside of the lock :-(*/ - canque_notify_bothends(edge,CANQUEUE_NOTIFY_NOUSR); - spin_unlock(&outends->ends_lock); - spin_unlock_irqrestore(&inends->ends_lock, flags); - canque_edge_do_dead(edge, dead_fl); - } else { - spin_unlock(&outends->ends_lock); - spin_unlock_irqrestore(&inends->ends_lock, flags); + dead_fl=!canque_fifo_test_and_set_fl(&edge->fifo,DEAD); + /* Because of former evolution of edge references + management notify of CANQUEUE_NOTIFY_NOUSR could + be moved to canque_edge_do_dead :-) */ } + canque_edge_unlock_both_ends(inends, outends, flags); + if(dead_fl) canque_edge_do_dead(edge); } +#ifndef CAN_HAVE_ARCH_CMPXCHG +/** + * canque_edge_decref - decrements edge reference count + * @qedg: pointer to the edge structure + * + * This function has to be called without lock held for both ends of edge. + * If reference count drops to 0, function canque_edge_do_dead() + * is called. + */ +static inline +void canque_edge_decref(struct canque_edge_t *edge) +{ + __canque_edge_decref_body(edge); +} +#else +static inline +void canque_edge_decref(struct canque_edge_t *edge) +{ + int x, y; + + x = atomic_read(&edge->edge_used); + do{ + if(x<=1) + return __canque_edge_decref(edge); + y=x; + /* This code strongly depends on the definition of atomic_t !!!! */ + /* x=cmpxchg(&edge->edge_used, x, x-1); */ + /* Next alternative could be more portable */ + x=__cmpxchg(&edge->edge_used, x, x-1, sizeof(atomic_t)); + /* If even this does not help, comment out CAN_HAVE_ARCH_CMPXCHG in can_sysdep.h */ + } while(x!=y); +} +#endif + static inline struct canque_edge_t *canque_first_inedge(struct canque_ends_t *qends) { - unsigned long flags; + can_spin_irqflags_t flags; struct list_head *entry; struct canque_edge_t *edge; - spin_lock_irqsave(&qends->ends_lock, flags); + can_spin_lock_irqsave(&qends->ends_lock, flags); entry=qends->inlist.next; skip_dead: if(entry != &qends->inlist) { @@ -533,7 +650,7 @@ struct canque_edge_t *canque_first_inedge(struct canque_ends_t *qends) } else { edge=NULL; } - spin_unlock_irqrestore(&qends->ends_lock, flags); + can_spin_unlock_irqrestore(&qends->ends_lock, flags); return edge; } @@ -541,11 +658,11 @@ struct canque_edge_t *canque_first_inedge(struct canque_ends_t *qends) static inline struct canque_edge_t *canque_next_inedge(struct canque_ends_t *qends, struct canque_edge_t *edge) { - unsigned long flags; + can_spin_irqflags_t flags; struct list_head *entry; struct canque_edge_t *next; - spin_lock_irqsave(&qends->ends_lock, flags); + can_spin_lock_irqsave(&qends->ends_lock, flags); entry=edge->inpeers.next; skip_dead: if(entry != &qends->inlist) { @@ -558,7 +675,7 @@ struct canque_edge_t *canque_next_inedge(struct canque_ends_t *qends, struct can } else { next=NULL; } - spin_unlock_irqrestore(&qends->ends_lock, flags); + can_spin_unlock_irqrestore(&qends->ends_lock, flags); canque_edge_decref(edge); return next; } @@ -566,8 +683,65 @@ struct canque_edge_t *canque_next_inedge(struct canque_ends_t *qends, struct can #define canque_for_each_inedge(qends, edge) \ for(edge=canque_first_inedge(qends);edge;edge=canque_next_inedge(qends, edge)) +static inline +struct canque_edge_t *canque_first_outedge(struct canque_ends_t *qends) +{ + can_spin_irqflags_t flags; + struct list_head *entry; + struct canque_edge_t *edge; + + can_spin_lock_irqsave(&qends->ends_lock, flags); + entry=qends->outlist.next; + skip_dead: + if(entry != &qends->outlist) { + edge=list_entry(entry,struct canque_edge_t,outpeers); + if(canque_fifo_test_fl(&edge->fifo,DEAD)) { + entry=entry->next; + goto skip_dead; + } + canque_edge_incref(edge); + } else { + edge=NULL; + } + can_spin_unlock_irqrestore(&qends->ends_lock, flags); + return edge; +} + + +static inline +struct canque_edge_t *canque_next_outedge(struct canque_ends_t *qends, struct canque_edge_t *edge) +{ + can_spin_irqflags_t flags; + struct list_head *entry; + struct canque_edge_t *next; + + can_spin_lock_irqsave(&qends->ends_lock, flags); + entry=edge->outpeers.next; + skip_dead: + if(entry != &qends->outlist) { + next=list_entry(entry,struct canque_edge_t,outpeers); + if(canque_fifo_test_fl(&edge->fifo,DEAD)) { + entry=entry->next; + goto skip_dead; + } + canque_edge_incref(next); + } else { + next=NULL; + } + can_spin_unlock_irqrestore(&qends->ends_lock, flags); + canque_edge_decref(edge); + return next; +} + +#define canque_for_each_outedge(qends, edge) \ + for(edge=canque_first_outedge(qends);edge;edge=canque_next_outedge(qends, edge)) + /* Linux kernel specific functions */ +int canque_fifo_init_kern(struct canque_fifo_t *fifo, int slotsnr); + +int canque_fifo_done_kern(struct canque_fifo_t *fifo); + struct canque_edge_t *canque_new_edge_kern(int slotsnr); int canque_get_inslot4id_wait_kern(struct canque_ends_t *qends, @@ -583,7 +757,53 @@ int canqueue_ends_init_kern(struct canque_ends_t *qends); int canqueue_ends_dispose_kern(struct canque_ends_t *qends, int sync); +void canqueue_ends_dispose_postpone(struct canque_ends_t *qends); + void canqueue_kern_initialize(void); +#ifdef CAN_WITH_RTL + +extern struct tasklet_struct canque_dead_tl; /*publication required only for RTL*/ + +/* RT-Linux specific functions and variables */ + +extern int canqueue_rtl_irq; + +extern unsigned long canqueue_rtl2lin_pend; + +#define CAN_RTL2LIN_PEND_DEAD_b 0 + +void canqueue_rtl_initialize(void); +void canqueue_rtl_done(void); + +int canqueue_rtl2lin_check_and_pend(struct canque_ends_t *qends, + struct canque_edge_t *qedge, int what); + +struct canque_edge_t *canque_new_edge_rtl(int slotsnr); + +void canque_dispose_edge_rtl(struct canque_edge_t *qedge); + +int canque_get_inslot4id_wait_rtl(struct canque_ends_t *qends, + struct canque_edge_t **qedgep, struct canque_slot_t **slotp, + int cmd, unsigned long id, int prio); + +int canque_get_outslot_wait_rtl(struct canque_ends_t *qends, + struct canque_edge_t **qedgep, struct canque_slot_t **slotp); + +int canque_sync_wait_rtl(struct canque_ends_t *qends, struct canque_edge_t *qedge); + +void canque_ends_free_rtl(struct canque_ends_t *qends); + +int canqueue_ends_init_rtl(struct canque_ends_t *qends); + +int canqueue_ends_dispose_rtl(struct canque_ends_t *qends, int sync); + +#else /*CAN_WITH_RTL*/ + +static inline int canqueue_rtl2lin_check_and_pend(struct canque_ends_t *qends, + struct canque_edge_t *qedge, int what) { return 0; } + +#endif /*CAN_WITH_RTL*/ + #endif /*_CAN_QUEUE_H*/