1 /**************************************************************************
3 * Copyright 2012 VMware, Inc.
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 **************************************************************************/
27 * Representation of call sets.
32 * | range ( ',' ? range ) *
34 * range = interval ( '/' frequency )
38 * | start_number '-' end_number
42 * | "rendertarget" | "fbo"
47 #ifndef _TRACE_CALLSET_HPP_
48 #define _TRACE_CALLSET_HPP_
54 #include "trace_model.hpp"
60 // Should match Call::no
61 typedef unsigned CallNo;
64 // Aliases for call flags
67 FREQUENCY_FRAME = CALL_FLAG_END_FRAME,
68 FREQUENCY_RENDERTARGET = CALL_FLAG_END_FRAME | CALL_FLAG_SWAP_RENDERTARGET,
69 FREQUENCY_RENDER = CALL_FLAG_RENDER,
70 FREQUENCY_ALL = 0xffffffff
73 // A linear range of calls
82 CallRange(CallNo callNo) :
89 CallRange(CallNo _start, CallNo _stop, CallNo _step = 1, CallFlags _freq = FREQUENCY_ALL) :
97 contains(CallNo callNo, CallFlags callFlags) const {
98 return callNo >= start &&
100 ((callNo - start) % step) == 0 &&
101 ((callFlags & freq) ||
102 freq == FREQUENCY_ALL);
107 // A collection of call ranges
114 // TODO: use binary tree to speed up lookups
115 typedef std::list< CallRange > RangeList;
118 CallSet(): limits(std::numeric_limits<CallNo>::min(), std::numeric_limits<CallNo>::max()) {}
120 CallSet(CallFlags freq);
122 CallSet(const char *str);
127 return ranges.empty();
131 addRange(const CallRange & range) {
132 if (range.start <= range.stop &&
133 range.freq != FREQUENCY_NONE) {
136 limits.start = range.start;
137 limits.stop = range.stop;
139 if (range.start < limits.start)
140 limits.start = range.start;
141 if (range.stop > limits.stop)
142 limits.stop = range.stop;
145 RangeList::iterator it = ranges.begin();
146 while (it != ranges.end() && it->start < range.start) {
150 ranges.insert(it, range);
155 contains(CallNo callNo, CallFlags callFlags = FREQUENCY_ALL) const {
159 RangeList::const_iterator it;
160 for (it = ranges.begin(); it != ranges.end() && it->start <= callNo; ++it) {
161 if (it->contains(callNo, callFlags)) {
169 contains(const trace::Call &call) {
170 return contains(call.no, call.flags);
183 CallSet parse(const char *string);
186 } /* namespace trace */
189 #endif /* _TRACE_CALLSET_HPP_ */