1 /*********************************************************************
3 * Copyright 2006 Keith Packard and Carl Worth
4 * Copyright 2012 Intel Corporation
5 * Copyright 2012 VMware, Inc.
8 * Permission is hereby granted, free of charge, to any person
9 * obtaining a copy of this software and associated documentation
10 * files (the "Software"), to deal in the Software without
11 * restriction, including without limitation the rights to use, copy,
12 * modify, merge, publish, distribute, sublicense, and/or sell copies
13 * of the Software, and to permit persons to whom the Software is
14 * furnished to do so, subject to the following conditions:
16 * The above copyright notice and this permission notice shall be
17 * included in all copies or substantial portions of the Software.
19 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
20 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
21 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
22 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
23 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
24 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
25 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
28 *********************************************************************/
34 #include "trace_fast_callset.hpp"
36 using namespace trace;
40 FastCallRange::FastCallRange(CallNo first, CallNo last, int level)
46 next = new FastCallRange*[level];
50 FastCallRange::contains(CallNo call_no)
52 return (first <= call_no && last >= call_no);
55 FastCallSet::FastCallSet(): head(0, 0, MAX_LEVEL)
57 head.first = std::numeric_limits<CallNo>::max();
58 head.last = std::numeric_limits<CallNo>::min();
60 for (int i = 0; i < MAX_LEVEL; i++)
67 * Generate a random level number, distributed
68 * so that each level is 1/4 as likely as the one before
70 * Note that level numbers run 1 <= level < MAX_LEVEL
75 /* tricky bit -- each bit is '1' 75% of the time */
76 long int bits = random() | random();
79 while (level < MAX_LEVEL)
91 FastCallSet::add(CallNo first, CallNo last)
93 FastCallRange **update[MAX_LEVEL];
94 FastCallRange *node, *next;
97 /* Find node immediately before insertion point. */
99 for (i = max_level - 1; i >= 0; i--) {
100 while (node->next[i] && first > node->next[i]->last) {
101 node = node->next[i];
103 update[i] = &node->next[i];
106 /* Can we contain first by expanding tail of current range by 1? */
107 if (node != &head && node->last == first - 1) {
110 goto MERGE_NODE_WITH_SUBSEQUENT_COVERED_NODES;
114 /* Current range could not contain first, look at next. */
115 node = node->next[0];
118 /* Do nothing if new range is already entirely contained. */
119 if (node->first <= first && node->last >= last) {
123 /* If last is already included, we can simply expand
124 * node->first to fully include the range. */
125 if (node->first <= last && node->last >= last) {
130 /* This is our candidate node if first is contained */
131 if (node->first <= first && node->last >= first) {
133 goto MERGE_NODE_WITH_SUBSEQUENT_COVERED_NODES;
137 /* Not possible to expand any existing node, so create a new one. */
139 level = random_level();
141 /* Handle first node of this level. */
142 if (level > max_level) {
143 level = max_level + 1;
144 update[max_level] = &head.next[max_level];
148 node = new FastCallRange(first, last, level);
150 /* Perform insertion into all lists. */
151 for (i = 0; i < level; i++) {
152 node->next[i] = *update[i];
156 MERGE_NODE_WITH_SUBSEQUENT_COVERED_NODES:
157 next = node->next[0];
158 while (next && next->first <= node->last + 1) {
159 if (next->last > node->last)
160 node->last = next->last;
162 /* Delete node 'next' */
163 for (i = 0; i < node->level && i < next->level; i++) {
164 node->next[i] = next->next[i];
167 for (; i < next->level; i++) {
168 *update[i] = next->next[i];
173 next = node->next[0];
178 FastCallSet::add(CallNo call_no)
180 this->add(call_no, call_no);
184 FastCallSet::contains(CallNo call_no)
190 for (i = max_level - 1; i >= 0; i--) {
191 while (node->next[i] && call_no > node->next[i]->last) {
192 node = node->next[i];
196 node = node->next[0];
201 return node->contains(call_no);