tlds
Transactional Operations for Linked Data Structures
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
packet.h
Go to the documentation of this file.
1 /* =============================================================================
2  *
3  * packet.h
4  *
5  * =============================================================================
6  *
7  * Copyright (C) Stanford University, 2006. All Rights Reserved.
8  * Author: Chi Cao Minh
9  *
10  * =============================================================================
11  *
12  * For the license of bayes/sort.h and bayes/sort.c, please see the header
13  * of the files.
14  *
15  * ------------------------------------------------------------------------
16  *
17  * For the license of kmeans, please see kmeans/LICENSE.kmeans
18  *
19  * ------------------------------------------------------------------------
20  *
21  * For the license of ssca2, please see ssca2/COPYRIGHT
22  *
23  * ------------------------------------------------------------------------
24  *
25  * For the license of lib/mt19937ar.c and lib/mt19937ar.h, please see the
26  * header of the files.
27  *
28  * ------------------------------------------------------------------------
29  *
30  * For the license of lib/rbtree.h and lib/rbtree.c, please see
31  * lib/LEGALNOTICE.rbtree and lib/LICENSE.rbtree
32  *
33  * ------------------------------------------------------------------------
34  *
35  * Unless otherwise noted, the following license applies to STAMP files:
36  *
37  * Copyright (c) 2007, Stanford University
38  * All rights reserved.
39  *
40  * Redistribution and use in source and binary forms, with or without
41  * modification, are permitted provided that the following conditions are
42  * met:
43  *
44  * * Redistributions of source code must retain the above copyright
45  * notice, this list of conditions and the following disclaimer.
46  *
47  * * Redistributions in binary form must reproduce the above copyright
48  * notice, this list of conditions and the following disclaimer in
49  * the documentation and/or other materials provided with the
50  * distribution.
51  *
52  * * Neither the name of Stanford University nor the names of its
53  * contributors may be used to endorse or promote products derived
54  * from this software without specific prior written permission.
55  *
56  * THIS SOFTWARE IS PROVIDED BY STANFORD UNIVERSITY ``AS IS'' AND ANY
57  * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
58  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
59  * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL STANFORD UNIVERSITY BE LIABLE
60  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
61  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
62  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
63  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
64  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
65  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
66  * THE POSSIBILITY OF SUCH DAMAGE.
67  *
68  * =============================================================================
69  */
70 
71 
72 #ifndef PACKET_H
73 #define PACKET_H 1
74 
75 #include "tm.h"
76 
77 typedef struct packet {
78  long flowId;
79  long fragmentId;
80  long numFragment;
81  long length;
82 #ifdef STM_CC_SUN
83  char data[0];
84 #else
85  char data[];
86 #endif
87 } packet_t;
88 
89 
90 #define PACKET_HEADER_LENGTH (sizeof(packet_t)) /* no data */
91 
92 
93 /* =============================================================================
94  * packet_compareFlowId
95  * =============================================================================
96  */
97 long
98 packet_compareFlowId (const void* aPtr, const void* bPtr);
99 
100 
101 /* =============================================================================
102  * packet_compareFragmentId
103  * =============================================================================
104  */
105 long
106 packet_compareFragmentId (const void* aPtr, const void* bPtr);
107 long
108 TMpacket_compareFragmentId (TM_ARGDECL const void* aPtr, const void* bPtr);
109 
110 
111 #endif /* PACKET_H */
112 
113 
114 /* =============================================================================
115  *
116  * End of packet.h
117  *
118  * =============================================================================
119  */
packet_compareFragmentId
long packet_compareFragmentId(const void *aPtr, const void *bPtr)
Definition: packet.c:95
packet_t
struct packet packet_t
packet::flowId
long flowId
Definition: packet.h:78
TM_ARGDECL
#define TM_ARGDECL
Definition: tm.h:532
packet
Definition: packet.h:77
TMpacket_compareFragmentId
long TMpacket_compareFragmentId(TM_ARGDECL const void *aPtr, const void *bPtr)
Definition: packet.c:103
packet::length
long length
Definition: packet.h:81
packet_compareFlowId
long packet_compareFlowId(const void *aPtr, const void *bPtr)
Definition: packet.c:81
packet::numFragment
long numFragment
Definition: packet.h:80
packet::fragmentId
long fragmentId
Definition: packet.h:79
data
Definition: data.h:80