- Re-indented the output and latex files.
This commit is contained in:
ccremers
parent
0f4e6a5aba
commit
6efcbdea62
1231
src/latex.c
1231
src/latex.c
File diff suppressed because it is too large
Load Diff
863
src/output.c
863
src/output.c
@ -12,432 +12,481 @@
|
||||
#include "latex.h"
|
||||
|
||||
|
||||
void linePrint(int i)
|
||||
void
|
||||
linePrint (int i)
|
||||
{
|
||||
indent();
|
||||
while (i > 0) {
|
||||
printf("--------");
|
||||
indent ();
|
||||
while (i > 0)
|
||||
{
|
||||
printf ("--------");
|
||||
i--;
|
||||
}
|
||||
printf ("\n");
|
||||
}
|
||||
|
||||
int
|
||||
correspondingSend (System sys, int rd)
|
||||
{
|
||||
|
||||
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 (sys->traceEvent[sendEvent]->type == SEND)
|
||||
{
|
||||
/* do all the different kind of matchings first */
|
||||
|
||||
labelMatch =
|
||||
isTermEqualFn (sys->traceEvent[sendEvent]->label,
|
||||
sys->traceEvent[readEvent]->label);
|
||||
toMatch =
|
||||
isTermEqualFn (sys->traceEvent[sendEvent]->to,
|
||||
sys->traceEvent[readEvent]->to);
|
||||
fromMatch =
|
||||
isTermEqualFn (sys->traceEvent[sendEvent]->from,
|
||||
sys->traceEvent[readEvent]->from);
|
||||
tofromMatch = toMatch || fromMatch;
|
||||
messageMatch =
|
||||
isTermEqualFn (sys->traceEvent[sendEvent]->message,
|
||||
sys->traceEvent[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;
|
||||
}
|
||||
if (nMatches > maxNMatches)
|
||||
{
|
||||
/* if we found a better candidate than we already had, we'll update */
|
||||
|
||||
//printf("Comparing SEND #%d: ",s);
|
||||
//if (labelMatch) printf("label ");
|
||||
//if (toMatch) printf("to ");
|
||||
//if (fromMatch) printf("from ");
|
||||
//if (messageMatch) printf("message ");
|
||||
//printf("\n");
|
||||
|
||||
/* however, we first want to be sure that at least some matches are successful */
|
||||
|
||||
if (labelMatch && messageMatch)
|
||||
{
|
||||
/* strongest restriction: message and label should match */
|
||||
|
||||
maxNMatches = nMatches;
|
||||
bestSendEvent = sendEvent;
|
||||
|
||||
}
|
||||
else if (messageMatch)
|
||||
{
|
||||
/* if label AND message don't match: */
|
||||
/* at least message should match */
|
||||
|
||||
maxNMatches = nMatches;
|
||||
bestSendEvent = sendEvent;
|
||||
}
|
||||
else if (labelMatch)
|
||||
{
|
||||
/* if message doesn't match */
|
||||
/* the label should matches */
|
||||
|
||||
maxNMatches = nMatches;
|
||||
bestSendEvent = sendEvent;
|
||||
}
|
||||
//printf("Best match: %d maxNMatches: %d\n", s, maxNMatches);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
//bestSendEvent = NULL;
|
||||
if (bestSendEvent == -1)
|
||||
{
|
||||
/*Termlist tl;
|
||||
Term t;
|
||||
|
||||
//newtl = knowledgeNew(sys->traceKnow[i],sys->traceKnow[i+1]);
|
||||
|
||||
for (tl = sys->traceKnow[rd]->basic; tl != NULL; tl = tl->next)
|
||||
{
|
||||
t = tl->term;
|
||||
termPrint(t);
|
||||
printf(" - ");
|
||||
}
|
||||
printf("\n");
|
||||
for (tl = sys->traceKnow[rd]->encrypt; tl != NULL; tl = tl->next)
|
||||
{
|
||||
t = tl->term;
|
||||
termPrint(t);
|
||||
printf(" - ");
|
||||
}
|
||||
printf("\n");
|
||||
for (tl = sys->traceKnow[rd]->inverses; tl != NULL; tl = tl->next)
|
||||
{
|
||||
t = tl->term;
|
||||
termPrint(t);
|
||||
printf(" - ");
|
||||
}
|
||||
printf("\n"); */
|
||||
|
||||
int u;
|
||||
|
||||
for (u = 0; u < rd; u++)
|
||||
{
|
||||
if (sys->traceEvent[u]->type == SEND)
|
||||
{
|
||||
|
||||
|
||||
//termPrint(readEvent->message);
|
||||
//printf("\n");
|
||||
knowledgePrint (sys->traceKnow[u]);
|
||||
//printf("Is received message in knowledge after SEND %d? %d\n", u, inKnowledge(sys->traceKnow[u+1],readEvent->message));
|
||||
if (inKnowledge
|
||||
(sys->traceKnow[u + 1],
|
||||
sys->traceEvent[readEvent]->message))
|
||||
{
|
||||
bestSendEvent = u;
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (bestSendEvent == -1)
|
||||
{
|
||||
printf ("!! Could not find a matching SEND\n");
|
||||
}
|
||||
else
|
||||
{
|
||||
//latexMessagePrint(sys, bestSendEvent, readEvent);
|
||||
//printf("Latex: ");
|
||||
//termPrint(bestSendEvent->from);
|
||||
//printf(" -> ");
|
||||
if (!isTermEqualFn
|
||||
(sys->traceEvent[bestSendEvent]->to,
|
||||
sys->traceEvent[readEvent]->to))
|
||||
{
|
||||
//termPrint(bestSendEvent->to);
|
||||
//printf(" -> ");
|
||||
}
|
||||
if (!isTermEqualFn
|
||||
(sys->traceEvent[bestSendEvent]->from,
|
||||
sys->traceEvent[readEvent]->from))
|
||||
{
|
||||
//termPrint(readEvent->from);
|
||||
//printf(" -> ");
|
||||
}
|
||||
//termPrint(readEvent->to);
|
||||
//printf("\n");
|
||||
}
|
||||
return bestSendEvent;
|
||||
}
|
||||
|
||||
void
|
||||
tracePrint (System sys)
|
||||
{
|
||||
if (sys->latex)
|
||||
{
|
||||
//latexTracePrint(sys);
|
||||
return;
|
||||
}
|
||||
|
||||
int i, j;
|
||||
int lastrid;
|
||||
int width;
|
||||
Termlist newtl;
|
||||
|
||||
/* fix the 'next' knowledge, this is required because sometimes
|
||||
* when calling this function, the next knowledge is not stored
|
||||
* yet, but required for the general form of the output . */
|
||||
|
||||
sys->traceKnow[sys->step + 1] = sys->know;
|
||||
|
||||
|
||||
/* how wide is the trace? */
|
||||
width = 0;
|
||||
for (i = 0; i <= sys->step; i++)
|
||||
{
|
||||
if (sys->traceRun[i] >= width)
|
||||
width = sys->traceRun[i] + 1;
|
||||
}
|
||||
|
||||
linePrint (width);
|
||||
indent ();
|
||||
printf ("Dumping trace:\n");
|
||||
linePrint (width);
|
||||
|
||||
/* first some parameter issues */
|
||||
|
||||
knowledgePrint (sys->traceKnow[0]);
|
||||
/* also print inverses */
|
||||
indent ();
|
||||
printf ("Inverses: ");
|
||||
knowledgeInversesPrint (sys->traceKnow[0]);
|
||||
printf ("\n");
|
||||
|
||||
/* Trace columns header. First the run identifier and role. On the
|
||||
* second line we have the perceived agents for each partner role.
|
||||
* These are printed in the same order as the role specification in the
|
||||
* protocol. */
|
||||
|
||||
linePrint (width);
|
||||
indent ();
|
||||
|
||||
for (i = 0; i < width; i++)
|
||||
{
|
||||
termPrint (sys->runs[i].role->nameterm);
|
||||
printf ("#%i\t", i);
|
||||
}
|
||||
printf ("\n");
|
||||
for (i = 0; i < width; i++)
|
||||
{
|
||||
termPrint (agentOfRun (sys, i));
|
||||
printf ("\t");
|
||||
}
|
||||
printf ("\n");
|
||||
|
||||
for (i = 0; i < width; i++)
|
||||
{
|
||||
agentsOfRunPrint (sys, i);
|
||||
printf ("\t");
|
||||
}
|
||||
printf ("\n");
|
||||
|
||||
/* now we print the actual trace */
|
||||
|
||||
void sticks (int i)
|
||||
{
|
||||
while (i > 0)
|
||||
{
|
||||
printf ("|\t");
|
||||
i--;
|
||||
}
|
||||
printf("\n");
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
int correspondingSend(System sys, int rd)
|
||||
{
|
||||
|
||||
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 (sys->traceEvent[sendEvent]->type == SEND) {
|
||||
/* do all the different kind of matchings first */
|
||||
|
||||
labelMatch =
|
||||
isTermEqualFn(sys->traceEvent[sendEvent]->label,
|
||||
sys->traceEvent[readEvent]->label);
|
||||
toMatch =
|
||||
isTermEqualFn(sys->traceEvent[sendEvent]->to,
|
||||
sys->traceEvent[readEvent]->to);
|
||||
fromMatch =
|
||||
isTermEqualFn(sys->traceEvent[sendEvent]->from,
|
||||
sys->traceEvent[readEvent]->from);
|
||||
tofromMatch = toMatch || fromMatch;
|
||||
messageMatch =
|
||||
isTermEqualFn(sys->traceEvent[sendEvent]->message,
|
||||
sys->traceEvent[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;
|
||||
}
|
||||
if (nMatches > maxNMatches) {
|
||||
/* if we found a better candidate than we already had, we'll update */
|
||||
|
||||
//printf("Comparing SEND #%d: ",s);
|
||||
//if (labelMatch) printf("label ");
|
||||
//if (toMatch) printf("to ");
|
||||
//if (fromMatch) printf("from ");
|
||||
//if (messageMatch) printf("message ");
|
||||
//printf("\n");
|
||||
|
||||
/* however, we first want to be sure that at least some matches are successful */
|
||||
|
||||
if (labelMatch && messageMatch) {
|
||||
/* strongest restriction: message and label should match */
|
||||
|
||||
maxNMatches = nMatches;
|
||||
bestSendEvent = sendEvent;
|
||||
|
||||
} else if (messageMatch) {
|
||||
/* if label AND message don't match: */
|
||||
/* at least message should match */
|
||||
|
||||
maxNMatches = nMatches;
|
||||
bestSendEvent = sendEvent;
|
||||
} else if (labelMatch) {
|
||||
/* if message doesn't match */
|
||||
/* the label should matches */
|
||||
|
||||
maxNMatches = nMatches;
|
||||
bestSendEvent = sendEvent;
|
||||
}
|
||||
//printf("Best match: %d maxNMatches: %d\n", s, maxNMatches);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
//bestSendEvent = NULL;
|
||||
if (bestSendEvent == -1) {
|
||||
/*Termlist tl;
|
||||
Term t;
|
||||
|
||||
//newtl = knowledgeNew(sys->traceKnow[i],sys->traceKnow[i+1]);
|
||||
|
||||
for (tl = sys->traceKnow[rd]->basic; tl != NULL; tl = tl->next)
|
||||
{
|
||||
t = tl->term;
|
||||
termPrint(t);
|
||||
printf(" - ");
|
||||
}
|
||||
printf("\n");
|
||||
for (tl = sys->traceKnow[rd]->encrypt; tl != NULL; tl = tl->next)
|
||||
{
|
||||
t = tl->term;
|
||||
termPrint(t);
|
||||
printf(" - ");
|
||||
}
|
||||
printf("\n");
|
||||
for (tl = sys->traceKnow[rd]->inverses; tl != NULL; tl = tl->next)
|
||||
{
|
||||
t = tl->term;
|
||||
termPrint(t);
|
||||
printf(" - ");
|
||||
}
|
||||
printf("\n"); */
|
||||
|
||||
int u;
|
||||
|
||||
for (u = 0; u < rd; u++) {
|
||||
if (sys->traceEvent[u]->type == SEND) {
|
||||
|
||||
|
||||
//termPrint(readEvent->message);
|
||||
//printf("\n");
|
||||
knowledgePrint(sys->traceKnow[u]);
|
||||
//printf("Is received message in knowledge after SEND %d? %d\n", u, inKnowledge(sys->traceKnow[u+1],readEvent->message));
|
||||
if (inKnowledge
|
||||
(sys->traceKnow[u + 1],
|
||||
sys->traceEvent[readEvent]->message)) {
|
||||
bestSendEvent = u;
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (bestSendEvent == -1) {
|
||||
printf("!! Could not find a matching SEND\n");
|
||||
} else {
|
||||
//latexMessagePrint(sys, bestSendEvent, readEvent);
|
||||
//printf("Latex: ");
|
||||
//termPrint(bestSendEvent->from);
|
||||
//printf(" -> ");
|
||||
if (!isTermEqualFn
|
||||
(sys->traceEvent[bestSendEvent]->to,
|
||||
sys->traceEvent[readEvent]->to)) {
|
||||
//termPrint(bestSendEvent->to);
|
||||
//printf(" -> ");
|
||||
}
|
||||
if (!isTermEqualFn
|
||||
(sys->traceEvent[bestSendEvent]->from,
|
||||
sys->traceEvent[readEvent]->from)) {
|
||||
//termPrint(readEvent->from);
|
||||
//printf(" -> ");
|
||||
}
|
||||
//termPrint(readEvent->to);
|
||||
//printf("\n");
|
||||
}
|
||||
return bestSendEvent;
|
||||
}
|
||||
|
||||
void tracePrint(System sys)
|
||||
{
|
||||
if (sys->latex) {
|
||||
//latexTracePrint(sys);
|
||||
return;
|
||||
}
|
||||
|
||||
int i, j;
|
||||
int lastrid;
|
||||
int width;
|
||||
Termlist newtl;
|
||||
|
||||
/* fix the 'next' knowledge, this is required because sometimes
|
||||
* when calling this function, the next knowledge is not stored
|
||||
* yet, but required for the general form of the output . */
|
||||
|
||||
sys->traceKnow[sys->step + 1] = sys->know;
|
||||
|
||||
|
||||
/* how wide is the trace? */
|
||||
width = 0;
|
||||
for (i = 0; i <= sys->step; i++) {
|
||||
if (sys->traceRun[i] >= width)
|
||||
width = sys->traceRun[i] + 1;
|
||||
}
|
||||
|
||||
linePrint(width);
|
||||
indent();
|
||||
printf("Dumping trace:\n");
|
||||
linePrint(width);
|
||||
|
||||
/* first some parameter issues */
|
||||
|
||||
knowledgePrint(sys->traceKnow[0]);
|
||||
/* also print inverses */
|
||||
indent();
|
||||
printf("Inverses: ");
|
||||
knowledgeInversesPrint(sys->traceKnow[0]);
|
||||
printf("\n");
|
||||
|
||||
/* Trace columns header. First the run identifier and role. On the
|
||||
* second line we have the perceived agents for each partner role.
|
||||
* These are printed in the same order as the role specification in the
|
||||
* protocol. */
|
||||
|
||||
linePrint(width);
|
||||
indent();
|
||||
|
||||
for (i = 0; i < width; i++) {
|
||||
termPrint(sys->runs[i].role->nameterm);
|
||||
printf("#%i\t", i);
|
||||
}
|
||||
printf("\n");
|
||||
for (i = 0; i < width; i++) {
|
||||
termPrint(agentOfRun(sys, i));
|
||||
printf("\t");
|
||||
}
|
||||
printf("\n");
|
||||
|
||||
for (i = 0; i < width; i++) {
|
||||
agentsOfRunPrint(sys, i);
|
||||
printf("\t");
|
||||
}
|
||||
printf("\n");
|
||||
|
||||
/* now we print the actual trace */
|
||||
|
||||
void sticks(int i) {
|
||||
while (i > 0) {
|
||||
printf("|\t");
|
||||
i--;
|
||||
}
|
||||
}
|
||||
|
||||
void sticksLine(void) {
|
||||
sticks(width);
|
||||
printf("\n");
|
||||
}
|
||||
|
||||
linePrint(width);
|
||||
lastrid = -1;
|
||||
for (i = 0; i <= sys->step; i++) {
|
||||
/* yields extra newlines between switching of runs */
|
||||
|
||||
j = sys->traceRun[i];
|
||||
if (j != lastrid) {
|
||||
sticksLine();
|
||||
lastrid = j;
|
||||
}
|
||||
|
||||
/* print the actual event */
|
||||
|
||||
indent();
|
||||
sticks(j);
|
||||
roledefPrint(sys->traceEvent[i]);
|
||||
|
||||
//if (sys->traceEvent[i]->type == READ && !sys->traceEvent[i]->internal)
|
||||
//{
|
||||
/* calls routine to find the best SEND-candidate */
|
||||
/* the result is not yet being used */
|
||||
|
||||
// printf("\n");
|
||||
// correspondingSend(sys, i);
|
||||
//}
|
||||
|
||||
/* have we learnt anything new? */
|
||||
newtl = knowledgeNew(sys->traceKnow[i], sys->traceKnow[i + 1]);
|
||||
if (newtl != NULL) {
|
||||
printf("\n");
|
||||
sticksLine();
|
||||
sticks(width);
|
||||
printf("/* Intruder learns ");
|
||||
termlistPrint(newtl);
|
||||
termlistDelete(newtl);
|
||||
printf(" */");
|
||||
lastrid = -1;
|
||||
}
|
||||
|
||||
/* new line */
|
||||
printf("\n");
|
||||
}
|
||||
|
||||
switch (sys->clp) {
|
||||
case 1:
|
||||
indent();
|
||||
printf("---[ constraints ]-----\n");
|
||||
constraintlistPrint(sys->constraints);
|
||||
break;
|
||||
default:
|
||||
break;
|
||||
}
|
||||
linePrint(width);
|
||||
}
|
||||
|
||||
|
||||
|
||||
void attackDisplayAscii(System sys)
|
||||
{
|
||||
int i, j;
|
||||
int length;
|
||||
int lastrid;
|
||||
int width;
|
||||
Termlist newtl;
|
||||
struct tracebuf *tb;
|
||||
|
||||
/* attack trace buffer */
|
||||
tb = sys->attack;
|
||||
length = sys->attack->length;
|
||||
|
||||
/* set variables */
|
||||
varbufSet (sys, tb->variables);
|
||||
|
||||
/* how wide is the trace? */
|
||||
width = 0;
|
||||
for (i = 0; i < length; i++) {
|
||||
if (tb->run[i] >= width)
|
||||
width = tb->run[i] + 1;
|
||||
}
|
||||
|
||||
linePrint(width);
|
||||
indent();
|
||||
printf("Dumping trace:\n");
|
||||
linePrint(width);
|
||||
|
||||
/* first some parameter issues */
|
||||
|
||||
knowledgePrint(tb->know[0]);
|
||||
printf ("Variables: ");
|
||||
termlistPrint (sys->variables);
|
||||
void sticksLine (void)
|
||||
{
|
||||
sticks (width);
|
||||
printf ("\n");
|
||||
}
|
||||
|
||||
/* Trace columns header. First the run identifier and role. On the
|
||||
* second line we have the perceived agents for each partner role.
|
||||
* These are printed in the same order as the role specification in the
|
||||
* protocol. */
|
||||
linePrint (width);
|
||||
lastrid = -1;
|
||||
for (i = 0; i <= sys->step; i++)
|
||||
{
|
||||
/* yields extra newlines between switching of runs */
|
||||
|
||||
linePrint(width);
|
||||
indent();
|
||||
|
||||
for (i = 0; i < width; i++) {
|
||||
termPrint(sys->runs[i].role->nameterm);
|
||||
printf("#%i\t", i);
|
||||
}
|
||||
printf("\n");
|
||||
for (i = 0; i < width; i++) {
|
||||
termPrint(agentOfRun(sys, i));
|
||||
printf("\t");
|
||||
}
|
||||
printf("\n");
|
||||
|
||||
for (i = 0; i < width; i++) {
|
||||
agentsOfRunPrint(sys, i);
|
||||
printf("\t");
|
||||
}
|
||||
printf("\n");
|
||||
|
||||
/* now we print the actual trace */
|
||||
|
||||
void sticks(int i) {
|
||||
while (i > 0) {
|
||||
printf("|\t");
|
||||
i--;
|
||||
}
|
||||
}
|
||||
|
||||
void sticksLine(void) {
|
||||
sticks(width);
|
||||
printf("\n");
|
||||
}
|
||||
|
||||
linePrint(width);
|
||||
lastrid = -1;
|
||||
for (i = 0; i < length; i++) {
|
||||
/* yields extra newlines between switching of runs */
|
||||
|
||||
j = tb->run[i];
|
||||
if (j != lastrid) {
|
||||
sticksLine();
|
||||
lastrid = j;
|
||||
j = sys->traceRun[i];
|
||||
if (j != lastrid)
|
||||
{
|
||||
sticksLine ();
|
||||
lastrid = j;
|
||||
}
|
||||
|
||||
/* print the actual event */
|
||||
/* print the actual event */
|
||||
|
||||
indent();
|
||||
sticks(j);
|
||||
roledefPrint(tb->event[i]);
|
||||
indent ();
|
||||
sticks (j);
|
||||
roledefPrint (sys->traceEvent[i]);
|
||||
|
||||
//if (sys->traceEvent[i]->type == READ && !sys->traceEvent[i]->internal)
|
||||
//{
|
||||
/* calls routine to find the best SEND-candidate */
|
||||
/* the result is not yet being used */
|
||||
//if (sys->traceEvent[i]->type == READ && !sys->traceEvent[i]->internal)
|
||||
//{
|
||||
/* calls routine to find the best SEND-candidate */
|
||||
/* the result is not yet being used */
|
||||
|
||||
// printf("\n");
|
||||
// correspondingSend(sys, i);
|
||||
//}
|
||||
// printf("\n");
|
||||
// correspondingSend(sys, i);
|
||||
//}
|
||||
|
||||
/* have we learnt anything new? */
|
||||
newtl = knowledgeNew(tb->know[i], tb->know[i + 1]);
|
||||
if (newtl != NULL) {
|
||||
printf("\n");
|
||||
sticksLine();
|
||||
sticks(width);
|
||||
printf("/* Intruder learns ");
|
||||
termlistPrint(newtl);
|
||||
termlistDelete(newtl);
|
||||
printf(" */");
|
||||
lastrid = -1;
|
||||
/* have we learnt anything new? */
|
||||
newtl = knowledgeNew (sys->traceKnow[i], sys->traceKnow[i + 1]);
|
||||
if (newtl != NULL)
|
||||
{
|
||||
printf ("\n");
|
||||
sticksLine ();
|
||||
sticks (width);
|
||||
printf ("/* Intruder learns ");
|
||||
termlistPrint (newtl);
|
||||
termlistDelete (newtl);
|
||||
printf (" */");
|
||||
lastrid = -1;
|
||||
}
|
||||
|
||||
/* new line */
|
||||
printf("\n");
|
||||
/* new line */
|
||||
printf ("\n");
|
||||
}
|
||||
|
||||
linePrint(width);
|
||||
switch (sys->clp)
|
||||
{
|
||||
case 1:
|
||||
indent ();
|
||||
printf ("---[ constraints ]-----\n");
|
||||
constraintlistPrint (sys->constraints);
|
||||
break;
|
||||
default:
|
||||
break;
|
||||
}
|
||||
linePrint (width);
|
||||
}
|
||||
|
||||
|
||||
void attackDisplay(System sys)
|
||||
|
||||
void
|
||||
attackDisplayAscii (System sys)
|
||||
{
|
||||
if (sys->latex) {
|
||||
attackDisplayLatex(sys);
|
||||
} else {
|
||||
attackDisplayAscii(sys);
|
||||
int i, j;
|
||||
int length;
|
||||
int lastrid;
|
||||
int width;
|
||||
Termlist newtl;
|
||||
struct tracebuf *tb;
|
||||
|
||||
/* attack trace buffer */
|
||||
tb = sys->attack;
|
||||
length = sys->attack->length;
|
||||
|
||||
/* set variables */
|
||||
varbufSet (sys, tb->variables);
|
||||
|
||||
/* how wide is the trace? */
|
||||
width = 0;
|
||||
for (i = 0; i < length; i++)
|
||||
{
|
||||
if (tb->run[i] >= width)
|
||||
width = tb->run[i] + 1;
|
||||
}
|
||||
|
||||
linePrint (width);
|
||||
indent ();
|
||||
printf ("Dumping trace:\n");
|
||||
linePrint (width);
|
||||
|
||||
/* first some parameter issues */
|
||||
|
||||
knowledgePrint (tb->know[0]);
|
||||
printf ("Variables: ");
|
||||
termlistPrint (sys->variables);
|
||||
printf ("\n");
|
||||
|
||||
/* Trace columns header. First the run identifier and role. On the
|
||||
* second line we have the perceived agents for each partner role.
|
||||
* These are printed in the same order as the role specification in the
|
||||
* protocol. */
|
||||
|
||||
linePrint (width);
|
||||
indent ();
|
||||
|
||||
for (i = 0; i < width; i++)
|
||||
{
|
||||
termPrint (sys->runs[i].role->nameterm);
|
||||
printf ("#%i\t", i);
|
||||
}
|
||||
printf ("\n");
|
||||
for (i = 0; i < width; i++)
|
||||
{
|
||||
termPrint (agentOfRun (sys, i));
|
||||
printf ("\t");
|
||||
}
|
||||
printf ("\n");
|
||||
|
||||
for (i = 0; i < width; i++)
|
||||
{
|
||||
agentsOfRunPrint (sys, i);
|
||||
printf ("\t");
|
||||
}
|
||||
printf ("\n");
|
||||
|
||||
/* now we print the actual trace */
|
||||
|
||||
void sticks (int i)
|
||||
{
|
||||
while (i > 0)
|
||||
{
|
||||
printf ("|\t");
|
||||
i--;
|
||||
}
|
||||
}
|
||||
|
||||
void sticksLine (void)
|
||||
{
|
||||
sticks (width);
|
||||
printf ("\n");
|
||||
}
|
||||
|
||||
linePrint (width);
|
||||
lastrid = -1;
|
||||
for (i = 0; i < length; i++)
|
||||
{
|
||||
/* yields extra newlines between switching of runs */
|
||||
|
||||
j = tb->run[i];
|
||||
if (j != lastrid)
|
||||
{
|
||||
sticksLine ();
|
||||
lastrid = j;
|
||||
}
|
||||
|
||||
/* print the actual event */
|
||||
|
||||
indent ();
|
||||
sticks (j);
|
||||
roledefPrint (tb->event[i]);
|
||||
|
||||
//if (sys->traceEvent[i]->type == READ && !sys->traceEvent[i]->internal)
|
||||
//{
|
||||
/* calls routine to find the best SEND-candidate */
|
||||
/* the result is not yet being used */
|
||||
|
||||
// printf("\n");
|
||||
// correspondingSend(sys, i);
|
||||
//}
|
||||
|
||||
/* have we learnt anything new? */
|
||||
newtl = knowledgeNew (tb->know[i], tb->know[i + 1]);
|
||||
if (newtl != NULL)
|
||||
{
|
||||
printf ("\n");
|
||||
sticksLine ();
|
||||
sticks (width);
|
||||
printf ("/* Intruder learns ");
|
||||
termlistPrint (newtl);
|
||||
termlistDelete (newtl);
|
||||
printf (" */");
|
||||
lastrid = -1;
|
||||
}
|
||||
|
||||
/* new line */
|
||||
printf ("\n");
|
||||
}
|
||||
|
||||
linePrint (width);
|
||||
}
|
||||
|
||||
|
||||
void
|
||||
attackDisplay (System sys)
|
||||
{
|
||||
if (sys->latex)
|
||||
{
|
||||
attackDisplayLatex (sys);
|
||||
}
|
||||
else
|
||||
{
|
||||
attackDisplayAscii (sys);
|
||||
}
|
||||
}
|
||||
|
||||
Loading…
Reference in New Issue
Block a user