scyther/src/latex.c

1163 lines
23 KiB
C
Raw Normal View History

2004-04-23 11:58:43 +01:00
/*
* LaTeX output component
*/
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <limits.h>
#include "runs.h"
#include "memory.h"
#include "modelchecker.h"
#include "tracebuf.h"
#include "varbuf.h"
#include "output.h"
//! Multiplication factor for distance between events in an MSC diagram.
2004-04-23 11:58:43 +01:00
#define EVENTSPACE 1
//! Similarity factor required for connecting arrows. Ranges from 0 to 1.
2004-04-23 11:58:43 +01:00
#define LINKTHRESHOLD 0.95
extern const char *progname;
extern const char *releasetag;
extern int globalLatex;
extern Term TERM_Function;
/*! Additional information for an events. */
struct traceinfo
{
int match;
int position;
2004-04-23 11:58:43 +01:00
};
/* global variables for this module */
//! Additional information for each event in the trace.
2004-04-23 11:58:43 +01:00
struct traceinfo *tinfo;
//! The maximum run number involved, plus 1.
2004-04-23 11:58:43 +01:00
int width;
//! Landscape/portrait switch. Currently not used.
2004-04-23 11:58:43 +01:00
int landscape = 0;
//! Phase of MSC production.
/**
* In pass 1, the widths of the boxes are determined.
* In pass 2 the actual MSC is constructed.
*/
int pass;
2004-04-23 11:58:43 +01:00
/* code */
//! Start the latex output.
/** Prints some headers, and
* the command line that was used, as comments.
*@param sys The system buffer.
*@param argv The command line arguments as they were passed to the tool.
*@param argc The number of arguments.
*/
void
latexInit (const System sys, int argc, char **argv)
2004-04-23 11:58:43 +01:00
{
int i;
2004-04-23 11:58:43 +01:00
printf ("%%\n");
printf ("%% LaTeX output generated by %s\n", progname);
printf ("%% Input:\n");
2004-04-23 11:58:43 +01:00
/* print command line */
printf ("%% $");
for (i = 0; i < argc; i++)
printf (" %s", argv[i]);
printf ("\n");
2004-04-23 11:58:43 +01:00
printf ("%%\n");
2004-04-23 11:58:43 +01:00
/* comment macro (used for debugging) */
printf ("\\newcommand{\\comment}[1]{}\n");
2004-04-23 11:58:43 +01:00
}
//! Close up any LaTeX output.
/**
*@param sys The system state.
*/
void
latexDone (const System sys)
2004-04-23 11:58:43 +01:00
{
/* closing of the document */
2004-04-23 11:58:43 +01:00
}
//! Print a term using LaTeX and highlighting.
/**
* Basically a recode of termPrint, now specific using latex codes and with a
* highlighting feature.
*@param term a term to be printed.
*@param highlight a list of terms to be highlighted.
*/
2004-04-23 11:58:43 +01:00
void
latexTermPrint (Term term, Termlist highlight)
{
if (term == NULL)
{
printf ("Empty term");
return;
}
2004-04-23 11:58:43 +01:00
#ifdef DEBUG
if (!DEBUGL (1))
{
term = deVar (term);
}
2004-04-23 11:58:43 +01:00
#else
term = deVar (term);
2004-04-23 11:58:43 +01:00
#endif
if (realTermLeaf (term))
{
if (inTermlist (highlight, term))
printf ("\\mathbf{");
symbolPrint (term->symb);
if (realTermVariable (term))
printf ("V");
if (term->runid >= 0)
2004-04-23 11:58:43 +01:00
{
printf ("\\sharp%i", term->runid);
2004-04-23 11:58:43 +01:00
}
if (term->subst != NULL)
2004-04-23 11:58:43 +01:00
{
printf ("\\rightarrow");
latexTermPrint (term->subst, highlight);
}
if (inTermlist (highlight, term))
printf ("}");
}
if (realTermTuple (term))
{
printf ("(");
while (realTermTuple (term))
{
latexTermPrint (term->op1, highlight);
printf (",");
term = term->op2;
if (!realTermTuple (term))
latexTermPrint (term, highlight);
2004-04-23 11:58:43 +01:00
}
printf (")");
return;
}
if (realTermEncrypt (term))
{
if (isTermLeaf (term->key)
&& inTermlist (term->key->stype, TERM_Function))
2004-04-23 11:58:43 +01:00
{
/* function application */
latexTermPrint (term->key, highlight);
printf ("(");
latexTermPrint (term->op, highlight);
printf (")");
}
else
{
/* normal encryption */
printf ("\\{");
latexTermPrint (term->op, highlight);
printf ("\\}_{");
latexTermPrint (term->key, highlight);
printf ("}");
2004-04-23 11:58:43 +01:00
}
}
2004-04-23 11:58:43 +01:00
}
//! Print a termlist in LaTeX using highlighting.
/**
* Extending LaTeX term printing to term list printing, again with highlight
* list parameter.
*@param tl A term list to print.
*@param highlight Any terms to be highlighted.
*/
2004-04-23 11:58:43 +01:00
void
latexTermlistPrint (Termlist tl, Termlist highlight)
{
if (tl == NULL)
{
printf ("\\emptyset");
2004-04-23 11:58:43 +01:00
return;
}
while (tl != NULL)
{
latexTermPrint (tl->term, highlight);
tl = tl->next;
if (tl != NULL)
printf (", ");
2004-04-23 11:58:43 +01:00
}
}
//! Display the timers and states traversed using LaTeX.
void
latexTimers (const System sys)
2004-04-23 11:58:43 +01:00
{
void endline (void)
{
printf ("\\\\ \\hline\n");
}
2004-04-23 11:58:43 +01:00
printf ("\\begin{tabular}{|r|r|c|r|} \\hline\n");
2004-04-23 11:58:43 +01:00
/* display stats, header first */
2004-04-23 11:58:43 +01:00
printf ("Time & States & Attack & st/sec");
endline ();
2004-04-23 11:58:43 +01:00
/* print time */
2004-04-23 11:58:43 +01:00
double seconds;
seconds = (double) clock () / CLOCKS_PER_SEC;
printf ("$%.3e$ &", seconds);
2004-04-23 11:58:43 +01:00
/* states traversed */
2004-04-23 11:58:43 +01:00
printf ("$");
statesPrintShort (sys);
printf ("$ &");
2004-04-23 11:58:43 +01:00
/* flag
*
* L n Attack of length <n>
* None failed claim
* NoClaim no claims
*/
2004-04-23 11:58:43 +01:00
if (sys->claims == 0)
{
printf ("NoClaim & ");
}
else
{
if (sys->failed > 0)
printf ("L:%i & ", attackLength (sys->attack));
else
printf ("None & ");
2004-04-23 11:58:43 +01:00
}
/*
printf("%.3e (%li) claims encountered.\n",(double)
sys->claims, sys->claims);
printf("%.3e (%li) claims failed.\n",(double)
sys->failed, sys->failed);
*/
2004-04-23 11:58:43 +01:00
/* states per second */
2004-04-23 11:58:43 +01:00
if (seconds > 0)
{
printf ("$%.3e$ ",
(double) (sys->statesLow +
(sys->statesHigh * ULONG_MAX)) / seconds);
}
else
{
printf ("$\\infty$ ");
2004-04-23 11:58:43 +01:00
}
endline ();
2004-04-23 11:58:43 +01:00
printf ("\\end{tabular}\n\n");
2004-04-23 11:58:43 +01:00
}
//! Start drawing MSC environment.
/**
* Includes printing title.
*@param protocolnames A termlist with protocol name terms.
*/
void
latexMSCStart (Termlist protocolnames)
2004-04-23 11:58:43 +01:00
{
if (landscape)
printf ("\\begin{landscape}\n");
2004-04-23 11:58:43 +01:00
printf ("\\begin{msc}{attack on $");
2004-05-12 16:19:40 +01:00
termlistPrint (protocolnames);
printf ("$}\n");
2004-04-23 11:58:43 +01:00
}
//! Close drawing MSC
void
latexMSCEnd ()
2004-04-23 11:58:43 +01:00
{
printf ("\\end{msc}\n");
2004-04-23 11:58:43 +01:00
if (landscape)
printf ("\\end{landscape}\n");
2004-04-23 11:58:43 +01:00
}
/**
* Declare the MSC stick for a single instance of a run participating in an
* attack.
* This involves layout of the partners roles, and the agent etc.
*@param sys System state.
*@param run The run to be declared.
*/
void
latexDeclInst (const System sys, int run)
2004-04-23 11:58:43 +01:00
{
Term myAgent;
Term myRole;
Termlist roles;
int first;
myAgent = agentOfRun (sys, run);
myRole = sys->runs[run].role->nameterm;
if (pass == 1)
{
printf ("\\maxlength{\\maxmscinst}{");
}
else
{
printf ("\\declinst{run%i}{", run);
}
/* display above assumptions */
roles = sys->runs[run].protocol->rolenames;
if (pass == 2)
{
printf ("assumes $");
first = 1;
while (roles != NULL)
{
if (!isTermEqual (myRole, roles->term))
{
if (!first)
printf (", ");
else
first = 0;
termPrint (agentOfRunRole(sys,run,roles->term));
printf(": ");
termPrint (roles->term);
}
roles = roles->next;
}
printf ("$}{");
}
/* display agent and role */
printf ("$\\mathbf{");
termPrint (myAgent);
printf("}: ");
termPrint (myRole);
printf ("$}\n");
/* cleanup */
termDelete (myAgent);
2004-04-23 11:58:43 +01:00
}
//! Add vertical space in MSC diagrams.
/**
* Make some space in the diagram by nextlevels.
* TODO: can be incorporated in nextlevel[param] without loop.
*@param amount the line integer.
*/
void
latexEventSpace (int amount)
2004-04-23 11:58:43 +01:00
{
if (pass < 2)
{
/* not printing */
return;
}
int i;
//printf("%% number of newlines: %d\n",amount);
for (i = 0; i < EVENTSPACE * amount; i++)
printf ("\\nextlevel\n");
2004-04-23 11:58:43 +01:00
}
//! MSC message print.
/**
* Print an arrow with message from event i to event j, as defined in the
* tracebuffer. If either i or j are -1, the intruder is meant.
*/
2004-04-23 11:58:43 +01:00
void
latexMessagePrint (struct tracebuf *tb, int from, int to)
2004-04-23 11:58:43 +01:00
{
Term sendTerm = NULL;
Term readTerm = NULL;
2004-04-23 11:58:43 +01:00
if (pass < 2)
{
/* no measurement of messages yet */
return;
}
if (from == -1 && to == -1)
{
return;
}
if (from != -1)
{
sendTerm = tb->event[from]->message;
}
if (to != -1)
{
readTerm = tb->event[to]->message;
}
if (from == -1 && to != -1)
{
/* message from intruder into system */
printf ("\\mess{$");
termPrint (readTerm);
printf ("$}{eve}{run%d}\n", tb->run[to]);
}
else if (from != -1 && to == -1)
{
/* message from system to intruder */
printf ("\\mess{$");
termPrint (sendTerm);
printf ("$}{run%d}{eve}\n", tb->run[from]);
}
else if (from != -1 && to != -1)
{
/* message from one agent to another, possibly transformed */
printf ("\\mess{$");
2004-04-23 11:58:43 +01:00
termPrint (sendTerm);
2004-04-23 11:58:43 +01:00
if (!isTermEqual (sendTerm, readTerm))
{
printf ("\\rightarrow");
termPrint (readTerm);
2004-04-23 11:58:43 +01:00
}
printf ("$}{run%d", tb->run[from]);
printf ("}{run%d}[%d]", tb->run[to],
EVENTSPACE * (tinfo[to].position - tinfo[from].position));
printf ("\n");
}
2004-04-23 11:58:43 +01:00
}
/**
* hmm? TODO apparently, some other variant used, with duplicate handling of
* lost and found ??? But only using lost... weirdness.
*/
void
latexMessagePrintHighlight (struct tracebuf *tb, int from, int to,
Termlist highlight)
2004-04-23 11:58:43 +01:00
{
Term sendTerm = NULL;
Term readTerm = NULL;
2004-04-23 11:58:43 +01:00
if (pass < 2)
{
/* no measurements on message width yet */
return;
}
if (from == -1 && to == -1)
{
return;
}
if (from != -1)
{
sendTerm = tb->event[from]->message;
}
if (to != -1)
{
readTerm = tb->event[to]->message;
}
if (from == -1 && to != -1)
{
/* TODO redundant */
printf ("\\found{$");
latexTermPrint (readTerm, highlight);
printf ("$}{}{run%d}\n", tb->run[to]);
}
else if (from != -1 && to == -1)
{
printf ("\\mess{$");
latexTermPrint (sendTerm, highlight);
printf ("$}{run%d}{eve}\n", tb->run[from]);
}
else if (from != -1 && to != -1)
{
printf ("\\mess{$");
2004-04-23 11:58:43 +01:00
latexTermPrint (sendTerm, highlight);
2004-04-23 11:58:43 +01:00
if (!isTermEqual (sendTerm, readTerm))
{
printf ("\\rightarrow");
latexTermPrint (readTerm, highlight);
2004-04-23 11:58:43 +01:00
}
printf ("$}{run%d", tb->run[from]);
printf ("}{run%d}[%d]", tb->run[to],
EVENTSPACE * (tinfo[to].position - tinfo[from].position));
printf ("\n");
}
2004-04-23 11:58:43 +01:00
}
//! Display claim violation.
/**
* For now, only secrecy: TODO
*/
void
latexClaim (struct tracebuf *tb, int run, Termlist tl)
2004-04-23 11:58:43 +01:00
{
if (pass == 1)
{
printf ("\\maxlength{\\maxmsccondition}{");
}
else
{
printf ("\\condition{");
}
printf ("$\\neg secret ");
termlistPrint (tl);
printf ("$}");
if (pass == 1)
{
printf ("\n");
}
else
{
printf ("{run%d}\n", run);
}
2004-04-23 11:58:43 +01:00
}
//! Determine matching send event.
/**
* Given a read event, tries to find a corresponding send event in the trace
* buffer. Currently unused.
*/
int
latexCorrespondingSend (struct tracebuf *tb, int rd)
2004-04-23 11:58:43 +01:00
{
int labelMatch = 0;
int toMatch = 0;
int fromMatch = 0;
int tofromMatch = 0;
int messageMatch = 0;
int nMatches = 0;
int maxNMatches = 0;
int readEvent = rd;
int sendEvent = -1;
int bestSendEvent = -1;
for (sendEvent = readEvent; sendEvent >= 0; sendEvent--)
{
if (tb->event[sendEvent]->type == SEND)
{
/* do all the different kind of matchings first */
labelMatch =
isTermEqual (tb->event[sendEvent]->label,
tb->event[readEvent]->label);
toMatch =
isTermEqual (tb->event[sendEvent]->to, tb->event[readEvent]->to);
fromMatch =
isTermEqual (tb->event[sendEvent]->from,
tb->event[readEvent]->from);
tofromMatch = toMatch || fromMatch;
messageMatch =
isTermEqual (tb->event[sendEvent]->message,
tb->event[readEvent]->message);
/* calculate the score */
nMatches = labelMatch + tofromMatch + messageMatch;
if (nMatches == 3)
{
/* bingo! success on all matches */
//printf("Found perfect match: %d\n", s);
bestSendEvent = sendEvent;
break;
2004-04-23 11:58:43 +01:00
}
if (nMatches > maxNMatches)
{
if (labelMatch && messageMatch)
{
/* strongest restriction: message and label should match */
2004-04-23 11:58:43 +01:00
maxNMatches = nMatches;
bestSendEvent = sendEvent;
2004-04-23 11:58:43 +01:00
}
else if (messageMatch)
{
/* if label AND message don't match: */
/* at least message should match */
2004-04-23 11:58:43 +01:00
maxNMatches = nMatches;
bestSendEvent = sendEvent;
}
else if (labelMatch)
{
/* if message doesn't match */
/* the label should matches */
2004-04-23 11:58:43 +01:00
maxNMatches = nMatches;
bestSendEvent = sendEvent;
2004-04-23 11:58:43 +01:00
}
}
}
}
//bestSendEvent = NULL;
if (bestSendEvent == -1)
{
2004-04-23 11:58:43 +01:00
int u;
2004-04-23 11:58:43 +01:00
for (u = 0; u < rd; u++)
{
if (tb->event[u]->type == SEND)
{
//knowledgePrint(sys->traceKnow[u]);
if (inKnowledge
(tb->know[u + 1], tb->event[readEvent]->message))
{
bestSendEvent = u;
break;
2004-04-23 11:58:43 +01:00
}
}
}
}
if (bestSendEvent == -1)
{
printf ("%% Could not find a matching SEND\n");
2004-04-23 11:58:43 +01:00
}
return bestSendEvent;
2004-04-23 11:58:43 +01:00
}
//! Determine matching send event.
/**
* Simplified variant of finding the matching send event.
* However, if it is introduced at a non-send event, things start to break
* done. REVIEW later.
*/
int
latexCorrespondingSend2 (struct tracebuf *tb, int readEvent)
2004-04-23 11:58:43 +01:00
{
int u;
for (u = tb->length - 1; u >= 0; u--)
{
if (tb->event[u]->type == SEND)
{
if (!inKnowledge (tb->know[u], tb->event[readEvent]->message))
{
/*
printf("%% term[");
printf("]#%d is introduced at traceEvent[%d] ",readEvent,u);
printf("\n");
*/
return u;
}
}
}
return -1;
2004-04-23 11:58:43 +01:00
}
//! Display knowledge in LaTeX.
2004-04-23 11:58:43 +01:00
void
knowledgePrintLatex (Knowledge know)
2004-04-23 11:58:43 +01:00
{
Termlist tl;
2004-04-23 11:58:43 +01:00
if (know == NULL)
2004-04-23 11:58:43 +01:00
{
printf ("\\emptyset");
2004-04-23 11:58:43 +01:00
}
else
2004-04-23 11:58:43 +01:00
{
tl = knowledgeSet (know);
2004-05-12 16:19:40 +01:00
latexTermlistPrint (tl, NULL);
termlistDelete (tl);
2004-04-23 11:58:43 +01:00
}
}
//! Display the attack in the systems attack buffer using LaTeX.
void
attackDisplayLatex (System sys)
2004-04-23 11:58:43 +01:00
{
int i;
struct tracebuf *tb;
int *runPosition;
int currRun;
int position;
int eventSize;
Termlist tl;
Termlist newtl;
Termlist claimDetails;
Termlist highlights = NULL;
int cKnowledge;
int bestSend;
tb = sys->attack;
if (tb == NULL)
{
printf ("Attack pointer empty: nothing to display.\n");
exit (1);
}
/* set variables */
varbufSet (sys, tb->variables);
/* Rebuild knowledge. Strange, this ought to be good.
* Maybe reconstruct dependencies as well. */
tracebufRebuildKnow (tb);
/* Make a comment in which the trace is displayed, for debugging etc. */
printf ("\n\\comment{ TRACE\n\n");
printf ("Length: %i\n", tb->length);
printf ("Reallength: %i\n", tb->reallength);
printf ("\n");
i = 0;
while (i <= tb->length)
{
printf ("Knowledge %i:\n", i);
knowledgePrint (tb->know[i]);
printf (" [Inverses]: ");
knowledgeInversesPrint (tb->know[i]);
printf ("\n\n");
if (i < tb->length)
{
printf ("Event %i\t[", i);
switch (tb->status[i])
{
case S_UNK:
printf ("?");
break;
case S_RED:
printf ("redundant");
break;
case S_TOD:
printf ("to do");
break;
case S_OKE:
printf ("okay");
break;
default:
printf ("illegal status code");
break;
}
printf ("]\t");
termPrint (tb->event[i]->message);
printf ("\t#%i", tb->run[i]);
printf ("\n");
roledefPrint (tb->event[i]);
printf ("\n\n");
}
i++;
}
printf ("}\n\n");
tinfo =
(struct traceinfo *) memAlloc ((tb->length + 1) *
sizeof (struct traceinfo));
/*
* Determine width, which is the 1+max(runid involved in the attack)
*/
width = 1;
for (i = 0; i < tb->length; i++)
{
// TODO: I would expect here a redundancy test
if (tb->run[i] >= width)
width = tb->run[i] + 1;
}
/*
* Initialise tinfo arrays.
*/
for (i = 0; i < tb->length; i++)
{
tb->link[i] = -1;
tinfo[i].match = -1;
tinfo[i].position = i;
}
tinfo[i].match = -1;
tinfo[i].position = i;
/*
* Init array of positions (ordering) of the MSC lines.
*/
runPosition = (int *) memAlloc (width * sizeof (int));
for (i = 0; i < width; i++)
{
runPosition[i] = 0;
}
/*
* Determine corresponding sends and thus links
*/
for (i = tb->length - 1; i >= 0; i--)
{
if (tb->status[i] != S_RED)
{
if (tb->event[i]->type == READ && !tb->event[i]->internal)
{
bestSend = latexCorrespondingSend2 (tb, i);
printf ("%% match: %d <-> %d\n", i, bestSend);
if (bestSend == -1)
continue; // TODO major ugliness
tb->link[i] = bestSend;
tb->link[bestSend] = i;
}
if (tb->event[i]->type == CLAIM)
{
claimDetails =
claimViolationDetails (sys, tb->run[i], tb->event[i],
tb->know[i]);
}
}
}
printf ("\\comment{ claimDetails :\n");
termlistPrint (claimDetails);
printf ("\n}\n");
// landscape = (width > 4); // not for the time being
/*
* Apparently unlinks things that do not meet the threshold.
*/
position = 0;
currRun = 0;
eventSize = 0;
for (i = 0; i < tb->length; i++)
{
if (tb->status[i] != S_RED)
{
tinfo[i].position = position;
eventSize = 1;
currRun = tb->run[i];
switch (tb->event[i]->type)
{
case SEND:
position++;
tinfo[i].position++;
break;
case READ:
if (tb->link[i] != -1)
2004-04-23 11:58:43 +01:00
{
if (termDistance
(tb->event[i]->message,
tb->event[tb->link[i]]->message) < LINKTHRESHOLD)
{
/* disconnect read-send */
tb->link[tb->link[i]] = -1;
tb->link[i] = -1;
}
else
{
if (runPosition[currRun] <= tinfo[tb->link[i]].position
&& currRun != tb->run[tb->link[i]])
{
printf ("\\comment{\n");
termPrint (tb->event[i]->message);
printf ("\n");
termPrint (tb->event[tb->link[i]]->message);
printf ("\n");
printf ("%% termDistance: %f\n",
termDistance (tb->event[i]->message,
tb->event[tb->link[i]]->
message));
printf ("}\n");
tinfo[i].position = tinfo[tb->link[i]].position;
eventSize = 0;
}
}
2004-04-23 11:58:43 +01:00
}
if (tb->event[i]->internal)
{
eventSize = 0;
}
break;
case CLAIM:
if (claimDetails != NULL && claimDetails != (Termlist) - 1)
{
eventSize = 2;
}
else
{
eventSize = 0;
}
break;
default:
break;
}
if (!(tb->event[i]->type == READ && tb->event[i]->internal))
runPosition[currRun] = tinfo[i].position + eventSize;
/* printf("%% Event %d at %d\n", i, position); */
position += eventSize;
}
}
/* ------------------------------------------------------
*
* Start of MSC creation (2-phase)
*
*
* ------------------------------------------------------
*/
/* 2 pass for widths */
for (pass = 1; pass <= 2; pass++)
{
printf ("%% Pass %i\n\n",pass);
if (pass == 1)
{
printf ("\\maxlength{\\maxmscaction}{knows}\n");
printf ("\\maxlength{\\maxmscaction}{creates}\n");
}
else
{
/* slightly stretch measurements */
printf ("\\addtolength{\\maxmscall}{2\\mscspacer}\n");
printf ("\\addtolength{\\maxmscaction}{\\mscspacer}\n");
printf ("\\addtolength{\\maxmscinst}{\\mscspacer}\n");
printf ("\\addtolength{\\maxmsccondition}{\\mscspacer}\n");
/* put out computed widths */
printf ("\\setlength{\\envinstdist}{0.5\\maxmscall}\n");
printf ("\\setlength{\\instdist}{\\maxmscall}\n");
printf ("\\setlength{\\actionwidth}{\\maxmscaction}\n");
printf ("\\setlength{\\instwidth}{\\maxmscinst}\n");
printf ("\\setlength{\\conditionoverlap}{0.5\\maxmsccondition}\n");
/* create MSC title, involving protocol names and such. */
Termlist protocolnames = NULL;
Term pname;
for (i = 0; i < width; i++)
{
if (runPosition[i] > 0)
{
pname = sys->runs[i].protocol->nameterm;
if (!inTermlist (protocolnames, pname))
{
protocolnames = termlistAppend (protocolnames, pname);
}
}
}
latexMSCStart (protocolnames);
termlistDelete (protocolnames);
}
/* declare instances */
for (i = 0; i < width; i++)
{
if (runPosition[i] > 0)
latexDeclInst (sys, i);
}
/* Add the intruder instance */
if (pass == 2)
printf ("\\declinst{eve}{}{");
else
printf ("\\maxlength{\\maxmscinst}{");
printf ("{\\bf Eve}: Intruder}\n\n");
/* Print the local constants for each instance */
for (i = 0; i < width; i++)
{
if (runPosition[i] > 0)
{
Termlist tl = sys->runs[i].locals;
int first = 1;
while (tl != NULL)
{
/* detect whether it's really local to this run */
Term t = deVar (tl->term);
if (isTermLeaf (t) && t->runid == i)
{
if (first)
{
if (pass == 1)
printf ("\\maxlength{\\maxmscaction}{$");
else
printf ("\\ActionBox{creates \\\\\n$");
first = 0;
}
else
{
printf (", ");
}
termPrint (tl->term);
}
tl = tl->next;
}
if (!first)
{
if (pass == 1)
printf ("$}\n");
else
printf ("$}{run%i}\n", i);
}
}
}
/* Print the initial intruder knowledge */
if (pass == 2)
{
printf ("\\ActionBox{");
printf ("knows \\\\\n$");
knowledgePrintLatex (tb->know[0]);
printf ("$}");
printf ("{eve}\n");
printf ("\\nextlevel[3]\n");
printf ("\n");
}
/* print the events in the attack */
//for (j=-1; j<=sys->step; j++)
position = 0;
cKnowledge = 0;
for (i = 0; i < tb->length; i++)
{
if (tb->status[i] != S_RED)
{
latexEventSpace (tinfo[i].position - position);
if (tinfo[i].position >= position)
{
position = tinfo[i].position;
}
switch (tb->event[i]->type)
{
case SEND:
newtl = knowledgeNew (tb->know[i], tb->know[i + 1]);
highlights = NULL;
/* Build a Termlist of terms that from the claimViolationDetails,
that appear in the knowledge */
if (newtl != NULL)
{
tl = claimDetails;
while (tl != NULL)
{
if (inTermlist (newtl, tl->term))
{
highlights = termlistAdd (highlights, tl->term);
}
tl = tl->next;
}
}
if (tb->link[i] != -1 && i < tb->length)
{
latexMessagePrintHighlight (tb, i, tb->link[i], highlights);
}
else
{
latexMessagePrintHighlight (tb, i, -1, highlights); //lost message
}
/* maybe extra knowledge? */
if (newtl != NULL)
{
/* print what was learned */
2004-05-12 16:13:21 +01:00
if (pass == 1)
{
printf ("\\maxlength{\\maxmscaction}{");
}
else
{
printf ("\\nextlevel[1]\n");
printf ("\\ActionBox{learns \\\\\n");
}
printf ("$");
cKnowledge++;
latexTermlistPrint (newtl, highlights);
printf ("$}");
if (pass == 1)
{
printf ("\n");
}
else
{
printf ("{eve}\n");
printf ("\\nextlevel[2]\n");
}
}
2004-05-12 16:19:40 +01:00
termlistDelete (highlights);
break;
case READ:
if (tb->event[i]->internal)
{
}
else if (tb->link[i] == -1)
{
latexMessagePrint (tb, -1, i); //found message
}
break;
case CLAIM:
if (claimDetails != NULL && claimDetails != (Termlist) - 1)
{
latexClaim (tb, tb->run[i], claimDetails);
}
break;
default:
break; //kannie!
}
}
}
}
/*
* close up diagrams
*/
latexEventSpace (2);
latexMSCEnd ();
/*
* free used memory
*/
memFree (runPosition, width * sizeof (int));
memFree (tinfo, (tb->length + 1) * sizeof (struct traceinfo));
2004-04-23 11:58:43 +01:00
}