|
|
/*------------------------------------------------------------------------------
|
|
|
-- Solar Orbiter's Low Frequency Receiver Flight Software (LFR FSW),
|
|
|
-- This file is a part of the LFR FSW
|
|
|
-- Copyright (C) 2012-2018, Plasma Physics Laboratory - CNRS
|
|
|
--
|
|
|
-- 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
|
|
|
-------------------------------------------------------------------------------*/
|
|
|
/*-- Author : Paul Leroy
|
|
|
-- Contact : Alexis Jeandet
|
|
|
-- Mail : alexis.jeandet@lpp.polytechnique.fr
|
|
|
----------------------------------------------------------------------------*/
|
|
|
|
|
|
/** Functions related to data processing.
|
|
|
*
|
|
|
* @file
|
|
|
* @author P. LEROY
|
|
|
*
|
|
|
* These function are related to data processing, i.e. spectral matrices averaging and basic parameters computation.
|
|
|
*
|
|
|
*/
|
|
|
|
|
|
#include "fsw_processing.h"
|
|
|
#include "fsw_processing_globals.c"
|
|
|
#include "fsw_init.h"
|
|
|
|
|
|
unsigned int nb_sm_f0 = 0;
|
|
|
unsigned int nb_sm_f0_aux_f1= 0;
|
|
|
unsigned int nb_sm_f1 = 0;
|
|
|
unsigned int nb_sm_f0_aux_f2= 0;
|
|
|
|
|
|
typedef enum restartState_t
|
|
|
{
|
|
|
WAIT_FOR_F2,
|
|
|
WAIT_FOR_F1,
|
|
|
WAIT_FOR_F0
|
|
|
} restartState;
|
|
|
|
|
|
//************************
|
|
|
// spectral matrices rings
|
|
|
ring_node sm_ring_f0[ NB_RING_NODES_SM_F0 ] = {0};
|
|
|
ring_node sm_ring_f1[ NB_RING_NODES_SM_F1 ] = {0};
|
|
|
ring_node sm_ring_f2[ NB_RING_NODES_SM_F2 ] = {0};
|
|
|
ring_node *current_ring_node_sm_f0 = NULL;
|
|
|
ring_node *current_ring_node_sm_f1 = NULL;
|
|
|
ring_node *current_ring_node_sm_f2 = NULL;
|
|
|
ring_node *ring_node_for_averaging_sm_f0= NULL;
|
|
|
ring_node *ring_node_for_averaging_sm_f1= NULL;
|
|
|
ring_node *ring_node_for_averaging_sm_f2= NULL;
|
|
|
|
|
|
//
|
|
|
ring_node * getRingNodeForAveraging( unsigned char frequencyChannel)
|
|
|
{
|
|
|
ring_node *node;
|
|
|
|
|
|
node = NULL;
|
|
|
switch ( frequencyChannel ) {
|
|
|
case CHANNELF0:
|
|
|
node = ring_node_for_averaging_sm_f0;
|
|
|
break;
|
|
|
case CHANNELF1:
|
|
|
node = ring_node_for_averaging_sm_f1;
|
|
|
break;
|
|
|
case CHANNELF2:
|
|
|
node = ring_node_for_averaging_sm_f2;
|
|
|
break;
|
|
|
default:
|
|
|
break;
|
|
|
}
|
|
|
|
|
|
return node;
|
|
|
}
|
|
|
|
|
|
//***********************************************************
|
|
|
// Interrupt Service Routine for spectral matrices processing
|
|
|
|
|
|
void spectral_matrices_isr_f0( int statusReg )
|
|
|
{
|
|
|
unsigned char status;
|
|
|
rtems_status_code status_code;
|
|
|
ring_node *full_ring_node;
|
|
|
|
|
|
status = (unsigned char) (statusReg & BITS_STATUS_F0); // [0011] get the status_ready_matrix_f0_x bits
|
|
|
|
|
|
switch(status)
|
|
|
{
|
|
|
case 0:
|
|
|
break;
|
|
|
case BIT_READY_0_1:
|
|
|
// UNEXPECTED VALUE
|
|
|
spectral_matrix_regs->status = BIT_READY_0_1; // [0011]
|
|
|
status_code = rtems_event_send( Task_id[TASKID_DUMB], RTEMS_EVENT_11 );
|
|
|
break;
|
|
|
case BIT_READY_0:
|
|
|
full_ring_node = current_ring_node_sm_f0->previous;
|
|
|
full_ring_node->coarseTime = spectral_matrix_regs->f0_0_coarse_time;
|
|
|
full_ring_node->fineTime = spectral_matrix_regs->f0_0_fine_time;
|
|
|
current_ring_node_sm_f0 = current_ring_node_sm_f0->next;
|
|
|
spectral_matrix_regs->f0_0_address = current_ring_node_sm_f0->buffer_address;
|
|
|
// if there are enough ring nodes ready, wake up an AVFx task
|
|
|
nb_sm_f0 = nb_sm_f0 + 1;
|
|
|
if (nb_sm_f0 == NB_SM_BEFORE_AVF0_F1)
|
|
|
{
|
|
|
ring_node_for_averaging_sm_f0 = full_ring_node;
|
|
|
if (rtems_event_send( Task_id[TASKID_AVF0], RTEMS_EVENT_0 ) != RTEMS_SUCCESSFUL)
|
|
|
{
|
|
|
status_code = rtems_event_send( Task_id[TASKID_DUMB], RTEMS_EVENT_3 );
|
|
|
}
|
|
|
nb_sm_f0 = 0;
|
|
|
}
|
|
|
spectral_matrix_regs->status = BIT_READY_0; // [0000 0001]
|
|
|
break;
|
|
|
case BIT_READY_1:
|
|
|
full_ring_node = current_ring_node_sm_f0->previous;
|
|
|
full_ring_node->coarseTime = spectral_matrix_regs->f0_1_coarse_time;
|
|
|
full_ring_node->fineTime = spectral_matrix_regs->f0_1_fine_time;
|
|
|
current_ring_node_sm_f0 = current_ring_node_sm_f0->next;
|
|
|
spectral_matrix_regs->f0_1_address = current_ring_node_sm_f0->buffer_address;
|
|
|
// if there are enough ring nodes ready, wake up an AVFx task
|
|
|
nb_sm_f0 = nb_sm_f0 + 1;
|
|
|
if (nb_sm_f0 == NB_SM_BEFORE_AVF0_F1)
|
|
|
{
|
|
|
ring_node_for_averaging_sm_f0 = full_ring_node;
|
|
|
if (rtems_event_send( Task_id[TASKID_AVF0], RTEMS_EVENT_0 ) != RTEMS_SUCCESSFUL)
|
|
|
{
|
|
|
status_code = rtems_event_send( Task_id[TASKID_DUMB], RTEMS_EVENT_3 );
|
|
|
}
|
|
|
nb_sm_f0 = 0;
|
|
|
}
|
|
|
spectral_matrix_regs->status = BIT_READY_1; // [0000 0010]
|
|
|
break;
|
|
|
default:
|
|
|
break;
|
|
|
}
|
|
|
}
|
|
|
|
|
|
void spectral_matrices_isr_f1( int statusReg )
|
|
|
{
|
|
|
rtems_status_code status_code;
|
|
|
unsigned char status;
|
|
|
ring_node *full_ring_node;
|
|
|
|
|
|
status = (unsigned char) ((statusReg & BITS_STATUS_F1) >> SHIFT_2_BITS); // [1100] get the status_ready_matrix_f1_x bits
|
|
|
|
|
|
switch(status)
|
|
|
{
|
|
|
case 0:
|
|
|
break;
|
|
|
case BIT_READY_0_1:
|
|
|
// UNEXPECTED VALUE
|
|
|
spectral_matrix_regs->status = BITS_STATUS_F1; // [1100]
|
|
|
status_code = rtems_event_send( Task_id[TASKID_DUMB], RTEMS_EVENT_11 );
|
|
|
break;
|
|
|
case BIT_READY_0:
|
|
|
full_ring_node = current_ring_node_sm_f1->previous;
|
|
|
full_ring_node->coarseTime = spectral_matrix_regs->f1_0_coarse_time;
|
|
|
full_ring_node->fineTime = spectral_matrix_regs->f1_0_fine_time;
|
|
|
current_ring_node_sm_f1 = current_ring_node_sm_f1->next;
|
|
|
spectral_matrix_regs->f1_0_address = current_ring_node_sm_f1->buffer_address;
|
|
|
// if there are enough ring nodes ready, wake up an AVFx task
|
|
|
nb_sm_f1 = nb_sm_f1 + 1;
|
|
|
if (nb_sm_f1 == NB_SM_BEFORE_AVF0_F1)
|
|
|
{
|
|
|
ring_node_for_averaging_sm_f1 = full_ring_node;
|
|
|
if (rtems_event_send( Task_id[TASKID_AVF1], RTEMS_EVENT_0 ) != RTEMS_SUCCESSFUL)
|
|
|
{
|
|
|
status_code = rtems_event_send( Task_id[TASKID_DUMB], RTEMS_EVENT_3 );
|
|
|
}
|
|
|
nb_sm_f1 = 0;
|
|
|
}
|
|
|
spectral_matrix_regs->status = BIT_STATUS_F1_0; // [0000 0100]
|
|
|
break;
|
|
|
case BIT_READY_1:
|
|
|
full_ring_node = current_ring_node_sm_f1->previous;
|
|
|
full_ring_node->coarseTime = spectral_matrix_regs->f1_1_coarse_time;
|
|
|
full_ring_node->fineTime = spectral_matrix_regs->f1_1_fine_time;
|
|
|
current_ring_node_sm_f1 = current_ring_node_sm_f1->next;
|
|
|
spectral_matrix_regs->f1_1_address = current_ring_node_sm_f1->buffer_address;
|
|
|
// if there are enough ring nodes ready, wake up an AVFx task
|
|
|
nb_sm_f1 = nb_sm_f1 + 1;
|
|
|
if (nb_sm_f1 == NB_SM_BEFORE_AVF0_F1)
|
|
|
{
|
|
|
ring_node_for_averaging_sm_f1 = full_ring_node;
|
|
|
if (rtems_event_send( Task_id[TASKID_AVF1], RTEMS_EVENT_0 ) != RTEMS_SUCCESSFUL)
|
|
|
{
|
|
|
status_code = rtems_event_send( Task_id[TASKID_DUMB], RTEMS_EVENT_3 );
|
|
|
}
|
|
|
nb_sm_f1 = 0;
|
|
|
}
|
|
|
spectral_matrix_regs->status = BIT_STATUS_F1_1; // [1000 0000]
|
|
|
break;
|
|
|
default:
|
|
|
break;
|
|
|
}
|
|
|
}
|
|
|
|
|
|
void spectral_matrices_isr_f2( int statusReg )
|
|
|
{
|
|
|
unsigned char status;
|
|
|
rtems_status_code status_code;
|
|
|
|
|
|
status = (unsigned char) ((statusReg & BITS_STATUS_F2) >> SHIFT_4_BITS); // [0011 0000] get the status_ready_matrix_f2_x bits
|
|
|
|
|
|
switch(status)
|
|
|
{
|
|
|
case 0:
|
|
|
break;
|
|
|
case BIT_READY_0_1:
|
|
|
// UNEXPECTED VALUE
|
|
|
spectral_matrix_regs->status = BITS_STATUS_F2; // [0011 0000]
|
|
|
status_code = rtems_event_send( Task_id[TASKID_DUMB], RTEMS_EVENT_11 );
|
|
|
break;
|
|
|
case BIT_READY_0:
|
|
|
ring_node_for_averaging_sm_f2 = current_ring_node_sm_f2->previous;
|
|
|
current_ring_node_sm_f2 = current_ring_node_sm_f2->next;
|
|
|
ring_node_for_averaging_sm_f2->coarseTime = spectral_matrix_regs->f2_0_coarse_time;
|
|
|
ring_node_for_averaging_sm_f2->fineTime = spectral_matrix_regs->f2_0_fine_time;
|
|
|
spectral_matrix_regs->f2_0_address = current_ring_node_sm_f2->buffer_address;
|
|
|
spectral_matrix_regs->status = BIT_STATUS_F2_0; // [0001 0000]
|
|
|
if (rtems_event_send( Task_id[TASKID_AVF2], RTEMS_EVENT_0 ) != RTEMS_SUCCESSFUL)
|
|
|
{
|
|
|
status_code = rtems_event_send( Task_id[TASKID_DUMB], RTEMS_EVENT_3 );
|
|
|
}
|
|
|
break;
|
|
|
case BIT_READY_1:
|
|
|
ring_node_for_averaging_sm_f2 = current_ring_node_sm_f2->previous;
|
|
|
current_ring_node_sm_f2 = current_ring_node_sm_f2->next;
|
|
|
ring_node_for_averaging_sm_f2->coarseTime = spectral_matrix_regs->f2_1_coarse_time;
|
|
|
ring_node_for_averaging_sm_f2->fineTime = spectral_matrix_regs->f2_1_fine_time;
|
|
|
spectral_matrix_regs->f2_1_address = current_ring_node_sm_f2->buffer_address;
|
|
|
spectral_matrix_regs->status = BIT_STATUS_F2_1; // [0010 0000]
|
|
|
if (rtems_event_send( Task_id[TASKID_AVF2], RTEMS_EVENT_0 ) != RTEMS_SUCCESSFUL)
|
|
|
{
|
|
|
status_code = rtems_event_send( Task_id[TASKID_DUMB], RTEMS_EVENT_3 );
|
|
|
}
|
|
|
break;
|
|
|
default:
|
|
|
break;
|
|
|
}
|
|
|
}
|
|
|
|
|
|
void spectral_matrix_isr_error_handler( int statusReg )
|
|
|
{
|
|
|
// STATUS REGISTER
|
|
|
// input_fifo_write(2) *** input_fifo_write(1) *** input_fifo_write(0)
|
|
|
// 10 9 8
|
|
|
// buffer_full ** [bad_component_err] ** f2_1 ** f2_0 ** f1_1 ** f1_0 ** f0_1 ** f0_0
|
|
|
// 7 6 5 4 3 2 1 0
|
|
|
// [bad_component_err] not defined in the last version of the VHDL code
|
|
|
|
|
|
rtems_status_code status_code;
|
|
|
|
|
|
//***************************************************
|
|
|
// the ASM status register is copied in the HK packet
|
|
|
housekeeping_packet.hk_lfr_vhdl_aa_sm = (unsigned char) ((statusReg & BITS_HK_AA_SM) >> SHIFT_7_BITS); // [0111 1000 0000]
|
|
|
|
|
|
if (statusReg & BITS_SM_ERR) // [0111 1100 0000]
|
|
|
{
|
|
|
status_code = rtems_event_send( Task_id[TASKID_DUMB], RTEMS_EVENT_8 );
|
|
|
}
|
|
|
|
|
|
spectral_matrix_regs->status = spectral_matrix_regs->status & BITS_SM_ERR;
|
|
|
|
|
|
}
|
|
|
|
|
|
rtems_isr spectral_matrices_isr( rtems_vector_number vector )
|
|
|
{
|
|
|
// STATUS REGISTER
|
|
|
// input_fifo_write(2) *** input_fifo_write(1) *** input_fifo_write(0)
|
|
|
// 10 9 8
|
|
|
// buffer_full ** bad_component_err ** f2_1 ** f2_0 ** f1_1 ** f1_0 ** f0_1 ** f0_0
|
|
|
// 7 6 5 4 3 2 1 0
|
|
|
|
|
|
int statusReg;
|
|
|
|
|
|
static restartState state = WAIT_FOR_F2;
|
|
|
|
|
|
statusReg = spectral_matrix_regs->status;
|
|
|
|
|
|
if (thisIsAnASMRestart == 0)
|
|
|
{ // this is not a restart sequence, process incoming matrices normally
|
|
|
spectral_matrices_isr_f0( statusReg );
|
|
|
|
|
|
spectral_matrices_isr_f1( statusReg );
|
|
|
|
|
|
spectral_matrices_isr_f2( statusReg );
|
|
|
}
|
|
|
else
|
|
|
{ // a restart sequence has to be launched
|
|
|
switch (state) {
|
|
|
case WAIT_FOR_F2:
|
|
|
if ((statusReg & BITS_STATUS_F2) != INIT_CHAR) // [0011 0000] check the status_ready_matrix_f2_x bits
|
|
|
{
|
|
|
state = WAIT_FOR_F1;
|
|
|
}
|
|
|
break;
|
|
|
case WAIT_FOR_F1:
|
|
|
if ((statusReg & BITS_STATUS_F1) != INIT_CHAR) // [0000 1100] check the status_ready_matrix_f1_x bits
|
|
|
{
|
|
|
state = WAIT_FOR_F0;
|
|
|
}
|
|
|
break;
|
|
|
case WAIT_FOR_F0:
|
|
|
if ((statusReg & BITS_STATUS_F0) != INIT_CHAR) // [0000 0011] check the status_ready_matrix_f0_x bits
|
|
|
{
|
|
|
state = WAIT_FOR_F2;
|
|
|
thisIsAnASMRestart = 0;
|
|
|
}
|
|
|
break;
|
|
|
default:
|
|
|
break;
|
|
|
}
|
|
|
reset_sm_status();
|
|
|
}
|
|
|
|
|
|
spectral_matrix_isr_error_handler( statusReg );
|
|
|
|
|
|
}
|
|
|
|
|
|
//******************
|
|
|
// Spectral Matrices
|
|
|
|
|
|
void reset_nb_sm( void )
|
|
|
{
|
|
|
nb_sm_f0 = 0;
|
|
|
nb_sm_f0_aux_f1 = 0;
|
|
|
nb_sm_f0_aux_f2 = 0;
|
|
|
|
|
|
nb_sm_f1 = 0;
|
|
|
}
|
|
|
|
|
|
void SM_init_rings( void )
|
|
|
{
|
|
|
init_ring( sm_ring_f0, NB_RING_NODES_SM_F0, sm_f0, TOTAL_SIZE_SM );
|
|
|
init_ring( sm_ring_f1, NB_RING_NODES_SM_F1, sm_f1, TOTAL_SIZE_SM );
|
|
|
init_ring( sm_ring_f2, NB_RING_NODES_SM_F2, sm_f2, TOTAL_SIZE_SM );
|
|
|
|
|
|
DEBUG_PRINTF1("sm_ring_f0 @%x\n", (unsigned int) sm_ring_f0)
|
|
|
DEBUG_PRINTF1("sm_ring_f1 @%x\n", (unsigned int) sm_ring_f1)
|
|
|
DEBUG_PRINTF1("sm_ring_f2 @%x\n", (unsigned int) sm_ring_f2)
|
|
|
DEBUG_PRINTF1("sm_f0 @%x\n", (unsigned int) sm_f0)
|
|
|
DEBUG_PRINTF1("sm_f1 @%x\n", (unsigned int) sm_f1)
|
|
|
DEBUG_PRINTF1("sm_f2 @%x\n", (unsigned int) sm_f2)
|
|
|
}
|
|
|
|
|
|
void ASM_generic_init_ring( ring_node_asm *ring, unsigned char nbNodes )
|
|
|
{
|
|
|
unsigned char i;
|
|
|
|
|
|
ring[ nbNodes - 1 ].next
|
|
|
= (ring_node_asm*) &ring[ 0 ];
|
|
|
|
|
|
for(i=0; i<nbNodes-1; i++)
|
|
|
{
|
|
|
ring[ i ].next = (ring_node_asm*) &ring[ i + 1 ];
|
|
|
}
|
|
|
}
|
|
|
|
|
|
void SM_reset_current_ring_nodes( void )
|
|
|
{
|
|
|
current_ring_node_sm_f0 = sm_ring_f0[0].next;
|
|
|
current_ring_node_sm_f1 = sm_ring_f1[0].next;
|
|
|
current_ring_node_sm_f2 = sm_ring_f2[0].next;
|
|
|
|
|
|
ring_node_for_averaging_sm_f0 = NULL;
|
|
|
ring_node_for_averaging_sm_f1 = NULL;
|
|
|
ring_node_for_averaging_sm_f2 = NULL;
|
|
|
}
|
|
|
|
|
|
//*****************
|
|
|
// Basic Parameters
|
|
|
|
|
|
void BP_init_header( bp_packet *packet,
|
|
|
unsigned int apid, unsigned char sid,
|
|
|
unsigned int packetLength, unsigned char blkNr )
|
|
|
{
|
|
|
packet->targetLogicalAddress = CCSDS_DESTINATION_ID;
|
|
|
packet->protocolIdentifier = CCSDS_PROTOCOLE_ID;
|
|
|
packet->reserved = INIT_CHAR;
|
|
|
packet->userApplication = CCSDS_USER_APP;
|
|
|
packet->packetID[0] = (unsigned char) (apid >> SHIFT_1_BYTE);
|
|
|
packet->packetID[1] = (unsigned char) (apid);
|
|
|
packet->packetSequenceControl[0] = TM_PACKET_SEQ_CTRL_STANDALONE;
|
|
|
packet->packetSequenceControl[1] = INIT_CHAR;
|
|
|
packet->packetLength[0] = (unsigned char) (packetLength >> SHIFT_1_BYTE);
|
|
|
packet->packetLength[1] = (unsigned char) (packetLength);
|
|
|
// DATA FIELD HEADER
|
|
|
packet->spare1_pusVersion_spare2 = SPARE1_PUSVERSION_SPARE2;
|
|
|
packet->serviceType = TM_TYPE_LFR_SCIENCE; // service type
|
|
|
packet->serviceSubType = TM_SUBTYPE_LFR_SCIENCE_3; // service subtype
|
|
|
packet->destinationID = TM_DESTINATION_ID_GROUND;
|
|
|
packet->time[BYTE_0] = INIT_CHAR;
|
|
|
packet->time[BYTE_1] = INIT_CHAR;
|
|
|
packet->time[BYTE_2] = INIT_CHAR;
|
|
|
packet->time[BYTE_3] = INIT_CHAR;
|
|
|
packet->time[BYTE_4] = INIT_CHAR;
|
|
|
packet->time[BYTE_5] = INIT_CHAR;
|
|
|
// AUXILIARY DATA HEADER
|
|
|
packet->sid = sid;
|
|
|
packet->pa_bia_status_info = INIT_CHAR;
|
|
|
packet->sy_lfr_common_parameters_spare = INIT_CHAR;
|
|
|
packet->sy_lfr_common_parameters = INIT_CHAR;
|
|
|
packet->acquisitionTime[BYTE_0] = INIT_CHAR;
|
|
|
packet->acquisitionTime[BYTE_1] = INIT_CHAR;
|
|
|
packet->acquisitionTime[BYTE_2] = INIT_CHAR;
|
|
|
packet->acquisitionTime[BYTE_3] = INIT_CHAR;
|
|
|
packet->acquisitionTime[BYTE_4] = INIT_CHAR;
|
|
|
packet->acquisitionTime[BYTE_5] = INIT_CHAR;
|
|
|
packet->pa_lfr_bp_blk_nr[0] = INIT_CHAR; // BLK_NR MSB
|
|
|
packet->pa_lfr_bp_blk_nr[1] = blkNr; // BLK_NR LSB
|
|
|
}
|
|
|
|
|
|
void BP_init_header_with_spare( bp_packet_with_spare *packet,
|
|
|
unsigned int apid, unsigned char sid,
|
|
|
unsigned int packetLength , unsigned char blkNr)
|
|
|
{
|
|
|
packet->targetLogicalAddress = CCSDS_DESTINATION_ID;
|
|
|
packet->protocolIdentifier = CCSDS_PROTOCOLE_ID;
|
|
|
packet->reserved = INIT_CHAR;
|
|
|
packet->userApplication = CCSDS_USER_APP;
|
|
|
packet->packetID[0] = (unsigned char) (apid >> SHIFT_1_BYTE);
|
|
|
packet->packetID[1] = (unsigned char) (apid);
|
|
|
packet->packetSequenceControl[0] = TM_PACKET_SEQ_CTRL_STANDALONE;
|
|
|
packet->packetSequenceControl[1] = INIT_CHAR;
|
|
|
packet->packetLength[0] = (unsigned char) (packetLength >> SHIFT_1_BYTE);
|
|
|
packet->packetLength[1] = (unsigned char) (packetLength);
|
|
|
// DATA FIELD HEADER
|
|
|
packet->spare1_pusVersion_spare2 = SPARE1_PUSVERSION_SPARE2;
|
|
|
packet->serviceType = TM_TYPE_LFR_SCIENCE; // service type
|
|
|
packet->serviceSubType = TM_SUBTYPE_LFR_SCIENCE_3; // service subtype
|
|
|
packet->destinationID = TM_DESTINATION_ID_GROUND;
|
|
|
// AUXILIARY DATA HEADER
|
|
|
packet->sid = sid;
|
|
|
packet->pa_bia_status_info = INIT_CHAR;
|
|
|
packet->sy_lfr_common_parameters_spare = INIT_CHAR;
|
|
|
packet->sy_lfr_common_parameters = INIT_CHAR;
|
|
|
packet->time[BYTE_0] = INIT_CHAR;
|
|
|
packet->time[BYTE_1] = INIT_CHAR;
|
|
|
packet->time[BYTE_2] = INIT_CHAR;
|
|
|
packet->time[BYTE_3] = INIT_CHAR;
|
|
|
packet->time[BYTE_4] = INIT_CHAR;
|
|
|
packet->time[BYTE_5] = INIT_CHAR;
|
|
|
packet->source_data_spare = INIT_CHAR;
|
|
|
packet->pa_lfr_bp_blk_nr[0] = INIT_CHAR; // BLK_NR MSB
|
|
|
packet->pa_lfr_bp_blk_nr[1] = blkNr; // BLK_NR LSB
|
|
|
}
|
|
|
|
|
|
void BP_send(char *data, rtems_id queue_id, unsigned int nbBytesToSend, unsigned int sid )
|
|
|
{
|
|
|
rtems_status_code status;
|
|
|
|
|
|
// SEND PACKET
|
|
|
status = rtems_message_queue_send( queue_id, data, nbBytesToSend);
|
|
|
if (status != RTEMS_SUCCESSFUL)
|
|
|
{
|
|
|
PRINTF1("ERR *** in BP_send *** ERR %d\n", (int) status)
|
|
|
}
|
|
|
}
|
|
|
|
|
|
void BP_send_s1_s2(char *data, rtems_id queue_id, unsigned int nbBytesToSend, unsigned int sid )
|
|
|
{
|
|
|
/** This function is used to send the BP paquets when needed.
|
|
|
*
|
|
|
* @param transitionCoarseTime is the requested transition time contained in the TC_LFR_ENTER_MODE
|
|
|
*
|
|
|
* @return void
|
|
|
*
|
|
|
* SBM1 and SBM2 paquets are sent depending on the type of the LFR mode transition.
|
|
|
* BURST paquets are sent everytime.
|
|
|
*
|
|
|
*/
|
|
|
|
|
|
rtems_status_code status;
|
|
|
|
|
|
// SEND PACKET
|
|
|
// before lastValidTransitionDate, the data are drops even if they are ready
|
|
|
// this guarantees that no SBM packets will be received before the requested enter mode time
|
|
|
if ( time_management_regs->coarse_time >= lastValidEnterModeTime)
|
|
|
{
|
|
|
status = rtems_message_queue_send( queue_id, data, nbBytesToSend);
|
|
|
if (status != RTEMS_SUCCESSFUL)
|
|
|
{
|
|
|
PRINTF1("ERR *** in BP_send *** ERR %d\n", (int) status)
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
|
|
|
//******************
|
|
|
// general functions
|
|
|
|
|
|
void reset_sm_status( void )
|
|
|
{
|
|
|
// error
|
|
|
// 10 --------------- 9 ---------------- 8 ---------------- 7 ---------
|
|
|
// input_fif0_write_2 input_fifo_write_1 input_fifo_write_0 buffer_full
|
|
|
// ---------- 5 -- 4 -- 3 -- 2 -- 1 -- 0 --
|
|
|
// ready bits f2_1 f2_0 f1_1 f1_1 f0_1 f0_0
|
|
|
|
|
|
spectral_matrix_regs->status = BITS_STATUS_REG; // [0111 1111 1111]
|
|
|
}
|
|
|
|
|
|
void reset_spectral_matrix_regs( void )
|
|
|
{
|
|
|
/** This function resets the spectral matrices module registers.
|
|
|
*
|
|
|
* The registers affected by this function are located at the following offset addresses:
|
|
|
*
|
|
|
* - 0x00 config
|
|
|
* - 0x04 status
|
|
|
* - 0x08 matrixF0_Address0
|
|
|
* - 0x10 matrixFO_Address1
|
|
|
* - 0x14 matrixF1_Address
|
|
|
* - 0x18 matrixF2_Address
|
|
|
*
|
|
|
*/
|
|
|
|
|
|
set_sm_irq_onError( 0 );
|
|
|
|
|
|
set_sm_irq_onNewMatrix( 0 );
|
|
|
|
|
|
reset_sm_status();
|
|
|
|
|
|
// F1
|
|
|
spectral_matrix_regs->f0_0_address = current_ring_node_sm_f0->previous->buffer_address;
|
|
|
spectral_matrix_regs->f0_1_address = current_ring_node_sm_f0->buffer_address;
|
|
|
// F2
|
|
|
spectral_matrix_regs->f1_0_address = current_ring_node_sm_f1->previous->buffer_address;
|
|
|
spectral_matrix_regs->f1_1_address = current_ring_node_sm_f1->buffer_address;
|
|
|
// F3
|
|
|
spectral_matrix_regs->f2_0_address = current_ring_node_sm_f2->previous->buffer_address;
|
|
|
spectral_matrix_regs->f2_1_address = current_ring_node_sm_f2->buffer_address;
|
|
|
|
|
|
spectral_matrix_regs->matrix_length = DEFAULT_MATRIX_LENGTH; // 25 * 128 / 16 = 200 = 0xc8
|
|
|
}
|
|
|
|
|
|
void set_time( unsigned char *time, unsigned char * timeInBuffer )
|
|
|
{
|
|
|
time[BYTE_0] = timeInBuffer[BYTE_0];
|
|
|
time[BYTE_1] = timeInBuffer[BYTE_1];
|
|
|
time[BYTE_2] = timeInBuffer[BYTE_2];
|
|
|
time[BYTE_3] = timeInBuffer[BYTE_3];
|
|
|
time[BYTE_4] = timeInBuffer[BYTE_6];
|
|
|
time[BYTE_5] = timeInBuffer[BYTE_7];
|
|
|
}
|
|
|
|
|
|
unsigned long long int get_acquisition_time( unsigned char *timePtr )
|
|
|
{
|
|
|
unsigned long long int acquisitionTimeAslong;
|
|
|
acquisitionTimeAslong = INIT_CHAR;
|
|
|
acquisitionTimeAslong =
|
|
|
( (unsigned long long int) (timePtr[BYTE_0] & SYNC_BIT_MASK) << SHIFT_5_BYTES ) // [0111 1111] mask the synchronization bit
|
|
|
+ ( (unsigned long long int) timePtr[BYTE_1] << SHIFT_4_BYTES )
|
|
|
+ ( (unsigned long long int) timePtr[BYTE_2] << SHIFT_3_BYTES )
|
|
|
+ ( (unsigned long long int) timePtr[BYTE_3] << SHIFT_2_BYTES )
|
|
|
+ ( (unsigned long long int) timePtr[BYTE_6] << SHIFT_1_BYTE )
|
|
|
+ ( (unsigned long long int) timePtr[BYTE_7] );
|
|
|
return acquisitionTimeAslong;
|
|
|
}
|
|
|
|
|
|
unsigned char getSID( rtems_event_set event )
|
|
|
{
|
|
|
unsigned char sid;
|
|
|
|
|
|
rtems_event_set eventSetBURST;
|
|
|
rtems_event_set eventSetSBM;
|
|
|
|
|
|
sid = 0;
|
|
|
|
|
|
//******
|
|
|
// BURST
|
|
|
eventSetBURST = RTEMS_EVENT_BURST_BP1_F0
|
|
|
| RTEMS_EVENT_BURST_BP1_F1
|
|
|
| RTEMS_EVENT_BURST_BP2_F0
|
|
|
| RTEMS_EVENT_BURST_BP2_F1;
|
|
|
|
|
|
//****
|
|
|
// SBM
|
|
|
eventSetSBM = RTEMS_EVENT_SBM_BP1_F0
|
|
|
| RTEMS_EVENT_SBM_BP1_F1
|
|
|
| RTEMS_EVENT_SBM_BP2_F0
|
|
|
| RTEMS_EVENT_SBM_BP2_F1;
|
|
|
|
|
|
if (event & eventSetBURST)
|
|
|
{
|
|
|
sid = SID_BURST_BP1_F0;
|
|
|
}
|
|
|
else if (event & eventSetSBM)
|
|
|
{
|
|
|
sid = SID_SBM1_BP1_F0;
|
|
|
}
|
|
|
else
|
|
|
{
|
|
|
sid = 0;
|
|
|
}
|
|
|
|
|
|
return sid;
|
|
|
}
|
|
|
|
|
|
/**
|
|
|
* @brief extractReImVectors converts a given ASM component from interleaved to split representation
|
|
|
* @param inputASM
|
|
|
* @param outputASM
|
|
|
* @param asmComponent
|
|
|
*/
|
|
|
void extractReImVectors( float *inputASM, float *outputASM, unsigned int asmComponent )
|
|
|
{
|
|
|
unsigned int i;
|
|
|
float re;
|
|
|
float im;
|
|
|
|
|
|
for (i=0; i<NB_BINS_PER_SM; i++){
|
|
|
re = inputASM[ (asmComponent*NB_BINS_PER_SM) + (i * SM_BYTES_PER_VAL) ];
|
|
|
im = inputASM[ (asmComponent*NB_BINS_PER_SM) + (i * SM_BYTES_PER_VAL) + 1];
|
|
|
outputASM[ ( asmComponent *NB_BINS_PER_SM) + i] = re;
|
|
|
outputASM[ ((asmComponent+1)*NB_BINS_PER_SM) + i] = im;
|
|
|
}
|
|
|
}
|
|
|
|
|
|
/**
|
|
|
* @brief copyReVectors copies real part of a given ASM from inputASM to outputASM
|
|
|
* @param inputASM
|
|
|
* @param outputASM
|
|
|
* @param asmComponent
|
|
|
*/
|
|
|
void copyReVectors( float *inputASM, float *outputASM, unsigned int asmComponent )
|
|
|
{
|
|
|
unsigned int i;
|
|
|
float re;
|
|
|
|
|
|
for (i=0; i<NB_BINS_PER_SM; i++){
|
|
|
re = inputASM[ (asmComponent*NB_BINS_PER_SM) + i];
|
|
|
outputASM[ (asmComponent*NB_BINS_PER_SM) + i] = re;
|
|
|
}
|
|
|
}
|
|
|
|
|
|
/**
|
|
|
* @brief ASM_patch, converts ASM from interleaved to split representation
|
|
|
* @param inputASM
|
|
|
* @param outputASM
|
|
|
* @note inputASM and outputASM must be different, in other words this function can't do in place convertion
|
|
|
* @see extractReImVectors
|
|
|
*/
|
|
|
void ASM_patch( float *inputASM, float *outputASM )
|
|
|
{
|
|
|
extractReImVectors( inputASM, outputASM, ASM_COMP_B1B2); // b1b2
|
|
|
extractReImVectors( inputASM, outputASM, ASM_COMP_B1B3 ); // b1b3
|
|
|
extractReImVectors( inputASM, outputASM, ASM_COMP_B1E1 ); // b1e1
|
|
|
extractReImVectors( inputASM, outputASM, ASM_COMP_B1E2 ); // b1e2
|
|
|
extractReImVectors( inputASM, outputASM, ASM_COMP_B2B3 ); // b2b3
|
|
|
extractReImVectors( inputASM, outputASM, ASM_COMP_B2E1 ); // b2e1
|
|
|
extractReImVectors( inputASM, outputASM, ASM_COMP_B2E2 ); // b2e2
|
|
|
extractReImVectors( inputASM, outputASM, ASM_COMP_B3E1 ); // b3e1
|
|
|
extractReImVectors( inputASM, outputASM, ASM_COMP_B3E2 ); // b3e2
|
|
|
extractReImVectors( inputASM, outputASM, ASM_COMP_E1E2 ); // e1e2
|
|
|
|
|
|
copyReVectors(inputASM, outputASM, ASM_COMP_B1B1 ); // b1b1
|
|
|
copyReVectors(inputASM, outputASM, ASM_COMP_B2B2 ); // b2b2
|
|
|
copyReVectors(inputASM, outputASM, ASM_COMP_B3B3); // b3b3
|
|
|
copyReVectors(inputASM, outputASM, ASM_COMP_E1E1); // e1e1
|
|
|
copyReVectors(inputASM, outputASM, ASM_COMP_E2E2); // e2e2
|
|
|
}
|
|
|
|
|
|
void ASM_compress_reorganize_and_divide_mask(float *averaged_spec_mat, float *compressed_spec_mat , float divider,
|
|
|
unsigned char nbBinsCompressedMatrix, unsigned char nbBinsToAverage,
|
|
|
unsigned char ASMIndexStart,
|
|
|
unsigned char channel )
|
|
|
{
|
|
|
//*************
|
|
|
// input format
|
|
|
// component0[0 .. 127] component1[0 .. 127] .. component24[0 .. 127]
|
|
|
//**************
|
|
|
// output format
|
|
|
// matr0[0 .. 24] matr1[0 .. 24] .. matr127[0 .. 24]
|
|
|
//************
|
|
|
// compression
|
|
|
// matr0[0 .. 24] matr1[0 .. 24] .. matr11[0 .. 24] => f0 NORM
|
|
|
// matr0[0 .. 24] matr1[0 .. 24] .. matr22[0 .. 24] => f0 BURST, SBM
|
|
|
|
|
|
int frequencyBin;
|
|
|
int asmComponent;
|
|
|
int offsetASM;
|
|
|
int offsetCompressed;
|
|
|
int offsetFBin;
|
|
|
int fBinMask;
|
|
|
int k;
|
|
|
|
|
|
// BUILD DATA
|
|
|
for (asmComponent = 0; asmComponent < NB_VALUES_PER_SM; asmComponent++)
|
|
|
{
|
|
|
for( frequencyBin = 0; frequencyBin < nbBinsCompressedMatrix; frequencyBin++ )
|
|
|
{
|
|
|
offsetCompressed = // NO TIME OFFSET
|
|
|
(frequencyBin * NB_VALUES_PER_SM)
|
|
|
+ asmComponent;
|
|
|
offsetASM = // NO TIME OFFSET
|
|
|
(asmComponent * NB_BINS_PER_SM)
|
|
|
+ ASMIndexStart
|
|
|
+ (frequencyBin * nbBinsToAverage);
|
|
|
offsetFBin = ASMIndexStart
|
|
|
+ (frequencyBin * nbBinsToAverage);
|
|
|
compressed_spec_mat[ offsetCompressed ] = 0;
|
|
|
for ( k = 0; k < nbBinsToAverage; k++ )
|
|
|
{
|
|
|
fBinMask = getFBinMask( offsetFBin + k, channel );
|
|
|
compressed_spec_mat[offsetCompressed ] = compressed_spec_mat[ offsetCompressed ]
|
|
|
+ (averaged_spec_mat[ offsetASM + k ] * fBinMask);
|
|
|
}
|
|
|
if (divider != 0)
|
|
|
{
|
|
|
compressed_spec_mat[ offsetCompressed ] = compressed_spec_mat[ offsetCompressed ] / (divider * nbBinsToAverage);
|
|
|
}
|
|
|
else
|
|
|
{
|
|
|
compressed_spec_mat[ offsetCompressed ] = INIT_FLOAT;
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
int getFBinMask( int index, unsigned char channel )
|
|
|
{
|
|
|
unsigned int indexInChar;
|
|
|
unsigned int indexInTheChar;
|
|
|
int fbin;
|
|
|
unsigned char *sy_lfr_fbins_fx_word1;
|
|
|
|
|
|
sy_lfr_fbins_fx_word1 = parameter_dump_packet.sy_lfr_fbins_f0_word1;
|
|
|
|
|
|
switch(channel)
|
|
|
{
|
|
|
case CHANNELF0:
|
|
|
sy_lfr_fbins_fx_word1 = fbins_masks.merged_fbins_mask_f0;
|
|
|
break;
|
|
|
case CHANNELF1:
|
|
|
sy_lfr_fbins_fx_word1 = fbins_masks.merged_fbins_mask_f1;
|
|
|
break;
|
|
|
case CHANNELF2:
|
|
|
sy_lfr_fbins_fx_word1 = fbins_masks.merged_fbins_mask_f2;
|
|
|
break;
|
|
|
default:
|
|
|
PRINTF("ERR *** in getFBinMask, wrong frequency channel")
|
|
|
}
|
|
|
|
|
|
indexInChar = index >> SHIFT_3_BITS;
|
|
|
indexInTheChar = index - (indexInChar * BITS_PER_BYTE);
|
|
|
|
|
|
fbin = (int) ((sy_lfr_fbins_fx_word1[ BYTES_PER_MASK - 1 - indexInChar] >> indexInTheChar) & 1);
|
|
|
|
|
|
return fbin;
|
|
|
}
|
|
|
|
|
|
/**
|
|
|
* @brief isPolluted returns MATRIX_IS_POLLUTED if there is any overlap between t0:t1 and tbad0:tbad1 ranges
|
|
|
* @param t0 Start acquisition time
|
|
|
* @param t1 End of acquisition time
|
|
|
* @param tbad0 Start time of poluting signal
|
|
|
* @param tbad1 End time of poluting signal
|
|
|
* @return
|
|
|
*/
|
|
|
unsigned char isPolluted( u_int64_t t0, u_int64_t t1, u_int64_t tbad0, u_int64_t tbad1 )
|
|
|
{
|
|
|
unsigned char polluted;
|
|
|
|
|
|
polluted = MATRIX_IS_NOT_POLLUTED;
|
|
|
|
|
|
if ( ((tbad0 < t0) && (t0 < tbad1)) // t0 is inside the polluted range
|
|
|
|| ((tbad0 < t1) && (t1 < tbad1)) // t1 is inside the polluted range
|
|
|
|| ((t0 < tbad0) && (tbad1 < t1)) // the polluted range is inside the signal range
|
|
|
|| ((tbad0 < t0) && (t1 < tbad1))) // the signal range is inside the polluted range
|
|
|
{
|
|
|
polluted = MATRIX_IS_POLLUTED;
|
|
|
}
|
|
|
|
|
|
return polluted;
|
|
|
}
|
|
|
|
|
|
/**
|
|
|
* @brief acquisitionTimeIsValid checks if the given acquisition time is poluted by PAS
|
|
|
* @param coarseTime Coarse acquisition time of the given SM
|
|
|
* @param fineTime Fine acquisition time of the given ASM
|
|
|
* @param channel Frequency channel to check, will impact SM time footprint
|
|
|
* @return MATRIX_IS_POLLUTED if there is any time overlap between SM and PAS poluting signal
|
|
|
*/
|
|
|
unsigned char acquisitionTimeIsValid( unsigned int coarseTime, unsigned int fineTime, unsigned char channel)
|
|
|
{
|
|
|
u_int64_t t0;
|
|
|
u_int64_t t1;
|
|
|
u_int64_t tc;
|
|
|
u_int64_t tbad0;
|
|
|
u_int64_t tbad1;
|
|
|
|
|
|
u_int64_t modulusInFineTime;
|
|
|
u_int64_t offsetInFineTime;
|
|
|
u_int64_t shiftInFineTime;
|
|
|
u_int64_t tbadInFineTime;
|
|
|
|
|
|
u_int64_t timecodeReference;
|
|
|
|
|
|
unsigned char pasFilteringIsEnabled;
|
|
|
unsigned char ret;
|
|
|
|
|
|
// compute acquisition time from caoarseTime and fineTime
|
|
|
t0 = ( ((u_int64_t)coarseTime) << SHIFT_2_BYTES ) + (u_int64_t) fineTime;
|
|
|
t1 = t0;
|
|
|
tc = t0;
|
|
|
tbad0 = t0;
|
|
|
tbad1 = t0;
|
|
|
|
|
|
switch(channel)
|
|
|
{
|
|
|
case CHANNELF0:
|
|
|
t1 = t0 + ACQUISITION_DURATION_F0;
|
|
|
tc = t0 + HALF_ACQUISITION_DURATION_F0;
|
|
|
break;
|
|
|
case CHANNELF1:
|
|
|
t1 = t0 + ACQUISITION_DURATION_F1;
|
|
|
tc = t0 + HALF_ACQUISITION_DURATION_F1;
|
|
|
break;
|
|
|
case CHANNELF2:
|
|
|
t1 = t0 + ACQUISITION_DURATION_F2;
|
|
|
tc = t0 + HALF_ACQUISITION_DURATION_F2;
|
|
|
break;
|
|
|
default:
|
|
|
break;
|
|
|
}
|
|
|
|
|
|
// compute the acquitionTime range
|
|
|
modulusInFineTime = filterPar.modulus_in_finetime;
|
|
|
offsetInFineTime = filterPar.offset_in_finetime;
|
|
|
shiftInFineTime = filterPar.shift_in_finetime;
|
|
|
tbadInFineTime = filterPar.tbad_in_finetime;
|
|
|
timecodeReference = INIT_INT;
|
|
|
|
|
|
pasFilteringIsEnabled = (filterPar.spare_sy_lfr_pas_filter_enabled & 1); // [0000 0001]
|
|
|
ret = MATRIX_IS_NOT_POLLUTED;
|
|
|
|
|
|
if ( (tbadInFineTime == 0) || (pasFilteringIsEnabled == 0) )
|
|
|
{
|
|
|
ret = MATRIX_IS_NOT_POLLUTED;
|
|
|
}
|
|
|
else
|
|
|
{
|
|
|
// INTERSECTION TEST #1
|
|
|
timecodeReference = (tc - (tc % modulusInFineTime)) - modulusInFineTime ;
|
|
|
tbad0 = timecodeReference + offsetInFineTime + shiftInFineTime;
|
|
|
tbad1 = timecodeReference + offsetInFineTime + shiftInFineTime + tbadInFineTime;
|
|
|
ret = isPolluted( t0, t1, tbad0, tbad1 );
|
|
|
|
|
|
// INTERSECTION TEST #2
|
|
|
if (ret == MATRIX_IS_NOT_POLLUTED)
|
|
|
{
|
|
|
timecodeReference = (tc - (tc % modulusInFineTime)) ;
|
|
|
tbad0 = timecodeReference + offsetInFineTime + shiftInFineTime;
|
|
|
tbad1 = timecodeReference + offsetInFineTime + shiftInFineTime + tbadInFineTime;
|
|
|
ret = isPolluted( t0, t1, tbad0, tbad1 );
|
|
|
}
|
|
|
|
|
|
// INTERSECTION TEST #3
|
|
|
if (ret == MATRIX_IS_NOT_POLLUTED)
|
|
|
{
|
|
|
timecodeReference = (tc - (tc % modulusInFineTime)) + modulusInFineTime ;
|
|
|
tbad0 = timecodeReference + offsetInFineTime + shiftInFineTime;
|
|
|
tbad1 = timecodeReference + offsetInFineTime + shiftInFineTime + tbadInFineTime;
|
|
|
ret = isPolluted( t0, t1, tbad0, tbad1 );
|
|
|
}
|
|
|
}
|
|
|
|
|
|
return ret;
|
|
|
}
|
|
|
|
|
|
void init_kcoeff_sbm_from_kcoeff_norm(float *input_kcoeff, float *output_kcoeff, unsigned char nb_bins_norm)
|
|
|
{
|
|
|
unsigned char bin;
|
|
|
unsigned char kcoeff;
|
|
|
|
|
|
for (bin=0; bin<nb_bins_norm; bin++)
|
|
|
{
|
|
|
for (kcoeff=0; kcoeff<NB_K_COEFF_PER_BIN; kcoeff++)
|
|
|
{
|
|
|
output_kcoeff[ ( (bin * NB_K_COEFF_PER_BIN) + kcoeff ) * SBM_COEFF_PER_NORM_COEFF ]
|
|
|
= input_kcoeff[ (bin*NB_K_COEFF_PER_BIN) + kcoeff ];
|
|
|
output_kcoeff[ ( ( (bin * NB_K_COEFF_PER_BIN ) + kcoeff) * SBM_COEFF_PER_NORM_COEFF ) + 1 ]
|
|
|
= input_kcoeff[ (bin*NB_K_COEFF_PER_BIN) + kcoeff ];
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
|
