diff options
| author | Anders Broman <anders.broman@ericsson.com> | 2006-03-14 05:49:15 +0000 |
|---|---|---|
| committer | Anders Broman <anders.broman@ericsson.com> | 2006-03-14 05:49:15 +0000 |
| commit | d7610e4c0ac72de3d2713c9725dd2641232a82a0 (patch) | |
| tree | 266b4e49d8ebf20c334806c7163202c68fc4389e /gtk/graph_analysis.c | |
| parent | 2f37e2de15ad79d7d8f19f4118e80631bf4a1a1d (diff) | |
| download | wireshark-d7610e4c0ac72de3d2713c9725dd2641232a82a0.tar.gz | |
From Laurent Rabret,
2 patches for the "flow graph" display. It is better not to insert invalid packets into the list than to control the list is correct while using it...
svn path=/trunk/; revision=17622
Diffstat (limited to 'gtk/graph_analysis.c')
| -rw-r--r-- | gtk/graph_analysis.c | 32 |
1 files changed, 12 insertions, 20 deletions
diff --git a/gtk/graph_analysis.c b/gtk/graph_analysis.c index c9f9f9e1ac..f67c11a2c8 100644 --- a/gtk/graph_analysis.c +++ b/gtk/graph_analysis.c @@ -1685,11 +1685,9 @@ static void get_nodes(graph_analysis_data_t* user_data) gai->src_node = NODE_OVERFLOW; break; case -1: /* not in array */ - if (MAX_NUM_NODES > user_data->num_nodes) { - COPY_ADDRESS(&(user_data->nodes[user_data->num_nodes]),&(gai->src_addr)); - gai->src_node = user_data->num_nodes; - user_data->num_nodes++; - } + COPY_ADDRESS(&(user_data->nodes[user_data->num_nodes]),&(gai->src_addr)); + gai->src_node = user_data->num_nodes; + user_data->num_nodes++; break; default: /* it is in the array, just update the src_node */ gai->src_node = (guint16)index; @@ -1702,11 +1700,9 @@ static void get_nodes(graph_analysis_data_t* user_data) gai->dst_node = NODE_OVERFLOW; break; case -1: /* not in array */ - if (MAX_NUM_NODES > user_data->num_nodes) { - COPY_ADDRESS(&(user_data->nodes[user_data->num_nodes]),&(gai->dst_addr)); - gai->dst_node = user_data->num_nodes; - user_data->num_nodes++; - } + COPY_ADDRESS(&(user_data->nodes[user_data->num_nodes]),&(gai->dst_addr)); + gai->dst_node = user_data->num_nodes; + user_data->num_nodes++; break; default: /* it is in the array, just update the dst_node */ gai->dst_node = (guint16)index; @@ -1719,11 +1715,9 @@ static void get_nodes(graph_analysis_data_t* user_data) gai->dst_node = NODE_OVERFLOW; break; case -1: /* not in array */ - if (MAX_NUM_NODES > user_data->num_nodes) { - COPY_ADDRESS(&(user_data->nodes[user_data->num_nodes]),&(gai->dst_addr)); - gai->dst_node = user_data->num_nodes; - user_data->num_nodes++; - } + COPY_ADDRESS(&(user_data->nodes[user_data->num_nodes]),&(gai->dst_addr)); + gai->dst_node = user_data->num_nodes; + user_data->num_nodes++; break; default: /* it is in the array, just update the dst_node */ gai->dst_node = (guint16)index; @@ -1736,11 +1730,9 @@ static void get_nodes(graph_analysis_data_t* user_data) gai->src_node = NODE_OVERFLOW; break; case -1: /* not in array */ - if (MAX_NUM_NODES > user_data->num_nodes) { - COPY_ADDRESS(&(user_data->nodes[user_data->num_nodes]),&(gai->src_addr)); - gai->src_node = user_data->num_nodes; - user_data->num_nodes++; - } + COPY_ADDRESS(&(user_data->nodes[user_data->num_nodes]),&(gai->src_addr)); + gai->src_node = user_data->num_nodes; + user_data->num_nodes++; break; default: /* it is in the array, just update the src_node */ gai->src_node = (guint16)index; |