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 **************************************************************************/
35 #include "trace_model.hpp"
44 * It is just like a regular std::map<T, T> container, but lookups of missing
45 * keys return the key instead of default constructor.
47 * This is necessary for several GL named objects, where one can either request
48 * the implementation to generate an unique name, or pick a value never used
51 * XXX: In some cases, instead of returning the key, it would make more sense
52 * to return an unused data value (e.g., container count).
58 typedef std::map<T, T> base_type;
63 T & operator[] (const T &key) {
64 typename base_type::iterator it;
66 if (it == base.end()) {
67 return (base[key] = key);
72 const T & operator[] (const T &key) const {
73 typename base_type::const_iterator it;
75 if (it == base.end()) {
76 return (base[key] = key);
84 * Similar to alloca(), but implemented with malloc.
102 void * * buf = static_cast<void **>(malloc(sizeof(void *) + size));
115 alloc(size_t n = 1) {
116 return static_cast<T *>(alloc(sizeof(T) * n));
122 void *temp = *static_cast<void **>(next);
131 addRegion(unsigned long long address, void *buffer, unsigned long long size);
134 delRegionByPointer(void *ptr);
137 toPointer(trace::Value &value, bool bind = false);
141 * Output verbosity when retracing files.
143 extern int verbosity;
146 * Add profiling data to the dump when retracing.
148 extern bool profiling;
151 std::ostream &warning(trace::Call &call);
154 void ignore(trace::Call &call);
155 void unsupported(trace::Call &call);
158 typedef void (*Callback)(trace::Call &call);
166 struct stringComparer {
167 bool operator() (const char *a, const char *b) const {
168 return strcmp(a, b) < 0;
173 extern const Entry stdc_callbacks[];
178 typedef std::map<const char *, Callback, stringComparer> Map;
181 std::vector<Callback> callbacks;
185 addCallbacks(stdc_callbacks);
188 virtual ~Retracer() {}
190 void addCallback(const Entry *entry);
191 void addCallbacks(const Entry *entries);
193 void retrace(trace::Call &call);
197 } /* namespace retrace */
199 #endif /* _RETRACE_HPP_ */