/
cganom_plugin.cpp
171 lines (112 loc) · 3.94 KB
/
cganom_plugin.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
/*
==CTraps -- A GCC Plugin to instrument shared memory accesses==
Copyright (C) 2012 Brandon Lucia
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 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.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <stdio.h>
#include <stdlib.h>
#include <hash_map>
#include <unistd.h>
#include <set>
#include "ct_plugin.h"
using namespace std;
__thread __gnu_cxx::hash_map<unsigned long, set< unsigned long> > *graph;
int is_gone = 0;
extern "C" void *queryLWT_PC_plugin(void *addr);
void load_graph(){
graph = new __gnu_cxx::hash_map<unsigned long, set< unsigned long > >();
char *p = getenv("CGTEST_GRAPH");
if( p != NULL ){
unsigned long src;
unsigned long sink;
FILE *gf = fopen(p,"r");
while( fscanf(gf,"%lx %lx\n",&src,&sink) != EOF ){
auto ct_iter = graph->find( (unsigned long)src);
if( ct_iter == graph->end() ){
((*graph)[ (unsigned long)src ]) = set<unsigned long>();
(*graph)[ (unsigned long)src ].insert( (unsigned long) sink);
}else{
if( (ct_iter->second ).find( (unsigned long)sink ) == (ct_iter->second).end() ){
(ct_iter->second ).insert( (unsigned long)sink );
}
}
}
}else{
fprintf(stderr,"Couldn't load the graph from %s\n",p);
abort();
}
}
extern "C"{
void global_init(){
fprintf(stderr,"CTRAPS: CGAnom Plugin Startup\n");
is_gone = 0;
}
}
extern "C" {
void thread_init(){
load_graph();
}
}
extern "C" {
void global_deinit(){
fprintf(stderr,"CTRAPS: CGAnom Plugin Shutdown\n");
}
}
extern "C" {
void thread_deinit(){
fprintf(stderr,"CTRAPS: CGAnom Plugin Thread Deinit (T=%lu)\n",(unsigned long)pthread_self());
delete graph;
}
}
#define MAX_DELAY 100000
#define DELAY_STEP 1
extern "C" {
void read_trap(void *addr, void *oldPC, unsigned long oldTid, void *newPC, unsigned long newTid){
auto srcIter = graph->find( (unsigned long)oldPC );
if( srcIter == graph->end() ){
fprintf(stderr,"{Communication Anomaly - New SRC} M[%p]: T%lu,W@%p -> T%lu,R@%p\n",addr,oldTid,oldPC,newTid,newPC);
//((*graph)[ (unsigned long)oldPC])();
((*graph)[ (unsigned long)oldPC]) = set<unsigned long>();
(*graph)[ (unsigned long)oldPC ].insert( (unsigned long)newPC );
return;
} else {
auto sinkIter = srcIter->second.find( (unsigned long)newPC );
if( sinkIter == srcIter->second.end() ){
fprintf(stderr,"{Communication Anomaly} M[%p]: T%lu,W@%p -> T%lu,R@%p\n",addr,oldTid,oldPC,newTid,newPC);
srcIter->second.insert( (unsigned long)newPC );
return;
} else {
return;
}
}
}
}
extern "C" {
void write_trap(void *addr, void *oldPC, unsigned long oldTid, void *newPC, unsigned long newTid){
auto srcIter = graph->find( (unsigned long)oldPC );
if( srcIter == graph->end() ){
fprintf(stderr,"{Communication Anomaly - NEW SRC} M[%p]: T%lu,W@%p -> T%lu,W@%p\n",addr,oldTid,oldPC,newTid,newPC);
((*graph)[ (unsigned long)oldPC]) = set<unsigned long>();
(*graph)[ (unsigned long)oldPC ].insert( (unsigned long)newPC );
return;
} else {
auto sinkIter = srcIter->second.find( (unsigned long)newPC );
if( sinkIter == srcIter->second.end() ){
fprintf(stderr,"{Communication Anomaly} M[%p]: T%lu,W@%p -> T%lu,W@%p\n",addr,oldTid,oldPC,newTid,newPC);
srcIter->second.insert( (unsigned long)newPC );
return;
} else {
return;
}
}
}
}