1 /**************************************************************************
3 * Copyright 2011-2012 Jose Fonseca
6 * Permission is hereby granted, free of charge, to any person obtaining a copy
7 * of this software and associated documentation files (the "Software"), to deal
8 * in the Software without restriction, including without limitation the rights
9 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
10 * copies of the Software, and to permit persons to whom the Software is
11 * furnished to do so, subject to the following conditions:
13 * The above copyright notice and this permission notice shall be included in
14 * all copies or substantial portions of the Software.
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
19 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
24 **************************************************************************/
37 #include "trace_model.hpp"
38 #include "trace_parser.hpp"
44 extern trace::Parser parser;
50 * It is just like a regular std::map<T, T> container, but lookups of missing
51 * keys return the key instead of default constructor.
53 * This is necessary for several GL named objects, where one can either request
54 * the implementation to generate an unique name, or pick a value never used
57 * XXX: In some cases, instead of returning the key, it would make more sense
58 * to return an unused data value (e.g., container count).
64 typedef std::map<T, T> base_type;
69 T & operator[] (const T &key) {
70 typename base_type::iterator it;
72 if (it == base.end()) {
73 return (base[key] = key);
78 const T & operator[] (const T &key) const {
79 typename base_type::const_iterator it;
81 if (it == base.end()) {
82 return (base[key] = key);
90 * Similar to alloca(), but implemented with malloc.
104 /* Always return valid address, even when size is zero */
105 size = std::max(size, sizeof(uintptr_t));
107 uintptr_t * buf = static_cast<uintptr_t *>(malloc(sizeof(uintptr_t) + size));
113 next = reinterpret_cast<uintptr_t>(buf);
114 assert((next & 1) == 0);
116 return static_cast<void *>(&buf[1]);
121 alloc(size_t n = 1) {
122 return static_cast<T *>(alloc(sizeof(T) * n));
126 * Allocate an array with the same dimensions as the specified value.
130 alloc(const trace::Value *value) {
131 const trace::Array *array = dynamic_cast<const trace::Array *>(value);
133 return alloc<T>(array->size());
135 const trace::Null *null = dynamic_cast<const trace::Null *>(value);
144 * Prevent this pointer from being automatically freed.
150 reinterpret_cast<uintptr_t *>(ptr)[-1] |= 1;
157 uintptr_t temp = *reinterpret_cast<uintptr_t *>(next);
159 bool bind = temp & 1;
163 free(reinterpret_cast<void *>(next));
173 addRegion(unsigned long long address, void *buffer, unsigned long long size);
176 delRegionByPointer(void *ptr);
179 toPointer(trace::Value &value, bool bind = false);
183 * Output verbosity when retracing files.
185 extern int verbosity;
188 * Add profiling data to the dump when retracing.
190 extern bool profiling;
193 std::ostream &warning(trace::Call &call);
196 void ignore(trace::Call &call);
197 void unsupported(trace::Call &call);
200 typedef void (*Callback)(trace::Call &call);
208 struct stringComparer {
209 bool operator() (const char *a, const char *b) const {
210 return strcmp(a, b) < 0;
215 extern const Entry stdc_callbacks[];
220 typedef std::map<const char *, Callback, stringComparer> Map;
223 std::vector<Callback> callbacks;
227 addCallbacks(stdc_callbacks);
230 virtual ~Retracer() {}
232 void addCallback(const Entry *entry);
233 void addCallbacks(const Entry *entries);
235 void retrace(trace::Call &call);
239 } /* namespace retrace */
241 #endif /* _RETRACE_HPP_ */