X-Git-Url: https://git.lttng.org/?a=blobdiff_plain;ds=sidebyside;f=lttv%2Flttv%2Fsync%2Fdata_structures.c;h=acac9d72aaaaf9a15e68ad17e2a206f89d24f695;hb=190724cdfc53eeebfd895b594f875b53a72adf37;hp=5983eaf6d0e36a64d9a73d067629828d66c54460;hpb=66eaf2eba602c331d08677dbb59ec3f9e40f0ccc;p=lttv.git diff --git a/lttv/lttv/sync/data_structures.c b/lttv/lttv/sync/data_structures.c index 5983eaf6..acac9d72 100644 --- a/lttv/lttv/sync/data_structures.c +++ b/lttv/lttv/sync/data_structures.c @@ -1,19 +1,18 @@ /* This file is part of the Linux Trace Toolkit viewer - * Copyright (C) 2009 Benjamin Poirier + * Copyright (C) 2009, 2010 Benjamin Poirier * - * 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 . */ #ifdef HAVE_CONFIG_H @@ -34,10 +33,6 @@ #include "data_structures.h" -#ifndef g_info -#define g_info(format...) g_log (G_LOG_DOMAIN, G_LOG_LEVEL_INFO, format) -#endif - // TCP sequence numbers use clock arithmetic, these comparison functions take // that into account #define SEQ_LT(a,b) ((int32_t)((a)-(b)) < 0) @@ -45,6 +40,15 @@ #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", + [FAIL]= "Fail", +}; + /* * Compare two ConnectionKey structures @@ -238,8 +242,6 @@ void gdnTCPSegmentListDestroy(gpointer data) list= (GQueue*) data; - g_debug("XXXX gdnTCPSegmentListDestroy\n"); - g_queue_foreach(list, &gfTCPSegmentDestroy, NULL); g_queue_free(list); } @@ -254,7 +256,6 @@ void gdnTCPSegmentListDestroy(gpointer data) */ void gfTCPSegmentDestroy(gpointer data, gpointer user_data) { - g_debug("XXXX gfTCPSegmentDestroy\n"); destroyTCPSegment((Message*) data); } @@ -270,7 +271,6 @@ void destroyTCPSegment(Message* const segment) { TCPEvent* inE, *outE; - g_debug("XXXX destroyTCPSegment"); segment->print(segment); g_assert(segment->inE != NULL && segment->outE != NULL); @@ -462,9 +462,14 @@ void gdnConnectionKeyDestroy(gpointer data) 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; @@ -472,8 +477,8 @@ guint ghfDatagramKeyHash(gconstpointer key) 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; @@ -653,3 +658,103 @@ void gfAddEventToArray(gpointer data, gpointer user_data) { 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; + + if (allFactors == NULL) + { + return; + } + + 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); + } +}