Subversion Repositories tendra.SVN

/*
                 Crown Copyright (c) 1997

    This TenDRA(r) Computer Program is subject to Copyright
    owned by the United Kingdom Secretary of State for Defence
    acting through the Defence Evaluation and Research Agency
    (DERA).  It is made available to Recipients with a
    royalty-free licence for its use, reproduction, transfer
    to other parties and amendment for any purpose not excluding
    product development provided that any such use et cetera
    shall be deemed to be acceptance of the following conditions:-

        (1) Its Recipients shall ensure that this Notice is
        reproduced upon any copies or amended versions of it;

        (2) Any amended version of it shall be clearly marked to
        show both the nature of and the organisation responsible
        for the relevant amendment or amendments;

        (3) Its onward transfer from a recipient to another
        party shall be deemed to be that party's acceptance of
        these conditions;

        (4) DERA gives no warranty or assurance as to its
        quality or suitability for any purpose and DERA accepts
        no liability whatsoever in relation to any use to which
        it may be put.
*/


/**********************************************************************
$Author: release $
$Date: 1998/01/17 15:55:46 $
$Revision: 1.1.1.1 $
$Log: aldefs.c,v $
 * Revision 1.1.1.1  1998/01/17  15:55:46  release
 * First version to be checked into rolling release.
 *
 * Revision 1.1  1995/04/06  10:44:05  currie
 * Initial revision
 *
***********************************************************************/



#include "config.h"
#include "common_types.h"
#include "installglob.h"
#include "basicread.h"
#include "messages_c.h"

#include "aldefs.h"

#define max(x,y) ((x)>(y)) ? (x) : (y)


/* The alignment definitions form a set of simultaneous equations
   of the form

     a1 = f1(a1,a2 .. an)
     a2 = f2(a1,a2 ... an)
     ...

   The functions f1 f2 etc. are formed entirely from f_alignment,
   which takes a shape and delivers an alignment, and unite_sets.
   f_alignment provides constants. Since the representation of
   alignments must be a homomorphism of sets under unite_sets, and
   since any program contains a finite number of basic alignments,
   these equations can be solved by iterating unite_sets until
   no further change occurs. Unite_sets is represented here by max.
*/

/* PROCEDURES */

void process_aldefs
    PROTO_Z ()
{
  aldef * my_aldef;
  int changed; /* records whether a change has been made */
  int complete;


  do  /* iterate max until no change */
   {
     my_aldef = top_aldef;
     changed = 0;
     complete = 1;
     while (my_aldef != (aldef *)0)
      {
        switch (my_aldef -> al.al_n)
         {
           case 1: break;
           case 2: {
                     alignment a1;
                     alignment a2;
                     a2 = my_aldef -> al.al_val.al_join.b;
                     a1 = my_aldef -> al.al_val.al_join.a;
                     if (a1->al.al_n == 1 && a2->al.al_n == 1)
                      {
                        my_aldef -> al.al_n = 1;
                        my_aldef -> al.al_val.al =
                            max(a1->al.al_val.al, a2->al.al_val.al);
                        changed = 1;
                      }
                     else
                        complete = 0;
                     break;
                   };
           case 3: {
                     alignment a1;
                     a1 = my_aldef -> al.al_val.al_join.a;
                     if (a1->al.al_n == 1)
                      {
                        my_aldef -> al.al_n = 1;
                        my_aldef -> al.al_val.al = a1->al.al_val.al;
                        changed = 1;
                      }
                     else
                        complete = 0;
                     break;
                   };
           default: failer(ILLEGAL_ALIGNMENT);
         };
        my_aldef = my_aldef -> next_aldef;
      };
   } while (changed) ;

  if (!complete)
    failer(INCOMPLETE_ALIGNMENT_EQS);
  return;
}