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 **************************************************************************/
26 #ifndef _RETRACE_SWIZZLE_HPP_
27 #define _RETRACE_SWIZZLE_HPP_
32 #include "trace_model.hpp"
41 * It is just like a regular std::map<T, T> container, but lookups of missing
42 * keys return the key instead of default constructor.
44 * This is necessary for several GL named objects, where one can either request
45 * the implementation to generate an unique name, or pick a value never used
48 * XXX: In some cases, instead of returning the key, it would make more sense
49 * to return an unused data value (e.g., container count).
55 typedef std::map<T, T> base_type;
60 T & operator[] (const T &key) {
61 typename base_type::iterator it;
63 if (it == base.end()) {
64 return (base[key] = key);
69 const T & operator[] (const T &key) const {
70 typename base_type::const_iterator it;
72 if (it == base.end()) {
73 return (base[key] = key);
81 addRegion(unsigned long long address, void *buffer, unsigned long long size);
84 delRegionByPointer(void *ptr);
87 toPointer(trace::Value &value, bool bind = false);
91 addObj(trace::Call &call, trace::Value &value, void *obj);
94 delObj(trace::Value &value);
97 toObjPointer(trace::Call &call, trace::Value &value);
100 } /* namespace retrace */
102 #endif /* _RETRACE_SWIZZLE_HPP_ */