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"
36 #include "trace_parser.hpp"
42 extern trace::Parser parser;
48 * It is just like a regular std::map<T, T> container, but lookups of missing
49 * keys return the key instead of default constructor.
51 * This is necessary for several GL named objects, where one can either request
52 * the implementation to generate an unique name, or pick a value never used
55 * XXX: In some cases, instead of returning the key, it would make more sense
56 * to return an unused data value (e.g., container count).
62 typedef std::map<T, T> base_type;
67 T & operator[] (const T &key) {
68 typename base_type::iterator it;
70 if (it == base.end()) {
71 return (base[key] = key);
76 const T & operator[] (const T &key) const {
77 typename base_type::const_iterator it;
79 if (it == base.end()) {
80 return (base[key] = key);
88 * Similar to alloca(), but implemented with malloc.
106 void * * buf = static_cast<void **>(malloc(sizeof(void *) + size));
119 alloc(size_t n = 1) {
120 return static_cast<T *>(alloc(sizeof(T) * n));
126 void *temp = *static_cast<void **>(next);
135 addRegion(unsigned long long address, void *buffer, unsigned long long size);
138 delRegionByPointer(void *ptr);
141 toPointer(trace::Value &value, bool bind = false);
145 * Output verbosity when retracing files.
147 extern int verbosity;
150 * Add profiling data to the dump when retracing.
152 extern bool profiling;
155 std::ostream &warning(trace::Call &call);
158 void ignore(trace::Call &call);
159 void unsupported(trace::Call &call);
162 typedef void (*Callback)(trace::Call &call);
170 struct stringComparer {
171 bool operator() (const char *a, const char *b) const {
172 return strcmp(a, b) < 0;
177 extern const Entry stdc_callbacks[];
182 typedef std::map<const char *, Callback, stringComparer> Map;
185 std::vector<Callback> callbacks;
189 addCallbacks(stdc_callbacks);
192 virtual ~Retracer() {}
194 void addCallback(const Entry *entry);
195 void addCallbacks(const Entry *entries);
197 void retrace(trace::Call &call);
201 } /* namespace retrace */
203 #endif /* _RETRACE_HPP_ */