/* This file is part of the Linux Trace Toolkit viewer
- * Copyright (C) 2009 Benjamin Poirier <benjamin.poirier@polymtl.ca>
+ * Copyright (C) 2009, 2010 Benjamin Poirier <benjamin.poirier@polymtl.ca>
*
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU General Public License Version 2 as
- * published by the Free Software Foundation;
+ * This program is free software: you can redistribute it and/or modify it
+ * under the terms of the GNU Lesser General Public License as published by
+ * the Free Software Foundation, either version 2.1 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.
+ * 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 Lesser 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.
+ * You should have received a copy of the GNU Lesser General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifdef HAVE_CONFIG_H
#define SEQ_GT(a,b) ((int32_t)((a)-(b)) > 0)
#define SEQ_GEQ(a,b) ((int32_t)((a)-(b)) >= 0)
+const char* const approxNames[]= {
+ [EXACT]= "Exact",
+ [ACCURATE]= "Accurate",
+ [APPROXIMATE]= "Approximate",
+ [INCOMPLETE]= "Incomplete",
+ [ABSENT]= "Absent",
+ [SCREWED]= "Screwed",
+};
+
/*
* Compare two ConnectionKey structures
list= (GQueue*) data;
- g_debug("XXXX gdnTCPSegmentListDestroy\n");
-
g_queue_foreach(list, &gfTCPSegmentDestroy, NULL);
g_queue_free(list);
}
*/
void gfTCPSegmentDestroy(gpointer data, gpointer user_data)
{
- g_debug("XXXX gfTCPSegmentDestroy\n");
destroyTCPSegment((Message*) data);
}
{
TCPEvent* inE, *outE;
- g_debug("XXXX destroyTCPSegment");
segment->print(segment);
g_assert(segment->inE != NULL && segment->outE != NULL);
guint ghfDatagramKeyHash(gconstpointer key)
{
DatagramKey* datagramKey;
+ union {
+ uint8_t byteKey[8];
+ uint32_t hashableKey[2];
+ } dataKey;
uint32_t a, b, c;
datagramKey= (DatagramKey*) key;
+ memcpy(dataKey.byteKey, datagramKey->dataKey, sizeof(dataKey.byteKey));
a= datagramKey->saddr;
b= datagramKey->daddr;
mix(a, b, c);
a+= datagramKey->ulen; // 16 bits left here
- b+= *((uint32_t*) datagramKey->dataKey);
- c+= *((uint32_t*) ((void*) datagramKey->dataKey + 4));
+ b+= dataKey.hashableKey[0];
+ c+= dataKey.hashableKey[1];
final(a, b, c);
return c;
{
g_array_append_val((GArray*) user_data, data);
}
+
+
+/*
+ * Free a PairFactors
+ *
+ * Args:
+ * factorsCHull: container of Factors
+ */
+void destroyPairFactors(PairFactors* pairFactors)
+{
+ if (pairFactors->min != NULL)
+ {
+ free(pairFactors->min);
+ }
+ if (pairFactors->max != NULL)
+ {
+ free(pairFactors->max);
+ }
+ if (pairFactors->approx != NULL)
+ {
+ free(pairFactors->approx);
+ }
+}
+
+
+/*
+ * Create and initialize a container of PairFactors
+ *
+ * Args:
+ * traceNb: number of traces
+ *
+ * Returns:
+ * A new array, which can be freed with freeAllFactors()
+ */
+AllFactors* createAllFactors(const unsigned int traceNb)
+{
+ AllFactors* allFactors;
+ PairFactors** factorsArray;
+ unsigned int i, j;
+
+ allFactors= malloc(sizeof(AllFactors));
+ allFactors->refCount= 1;
+ allFactors->pairFactors= malloc(traceNb * sizeof(PairFactors*));
+ factorsArray=allFactors->pairFactors;
+ for (i= 0; i < traceNb; i++)
+ {
+ factorsArray[i]= calloc(traceNb, sizeof(PairFactors));
+
+ for (j= 0; j < traceNb; j++)
+ {
+ if (i == j)
+ {
+ factorsArray[i][i].type= EXACT;
+ factorsArray[i][i].approx= malloc(sizeof(Factors));
+ factorsArray[i][i].approx->drift= 1.;
+ factorsArray[i][i].approx->offset= 0.;
+ }
+ else
+ {
+ factorsArray[i][j].type= ABSENT;
+ }
+ }
+ }
+
+ return allFactors;
+}
+
+
+/*
+ * Free a container of PairFactors
+ *
+ * Args:
+ * allFactors: container of PairFactors
+ * traceNb: number of traces
+ */
+void freeAllFactors(AllFactors* const allFactors, const unsigned int traceNb)
+{
+ unsigned int i, j;
+
+ allFactors->refCount--;
+
+ if (allFactors->refCount == 0)
+ {
+ for (i= 0; i < traceNb; i++)
+ {
+ for (j= 0; j < traceNb; j++)
+ {
+ destroyPairFactors(&allFactors->pairFactors[i][j]);
+ }
+ free(allFactors->pairFactors[i]);
+ }
+ free(allFactors->pairFactors);
+ free(allFactors);
+ }
+}