blob: 6975f66efa799dd35df6c97ca0cbbd6936205bee [file] [log] [blame]
Ali Saidi271b9a52006-11-23 01:42:57 -05001/*
Andreas Hanssonffb6aec2012-09-19 06:15:44 -04002 * Copyright (c) 2012 ARM Limited
3 * All rights reserved
4 *
5 * The license below extends only to copyright in the software and shall
6 * not be construed as granting a license to any other intellectual
7 * property including but not limited to intellectual property relating
8 * to a hardware implementation of the functionality of the software
9 * licensed hereunder. You may use the software subject to the license
10 * terms below provided that you ensure that this notice is replicated
11 * unmodified and in its entirety in all distributions of the software,
12 * modified or unmodified, in source code or in binary form.
13 *
Ali Saidi271b9a52006-11-23 01:42:57 -050014 * Copyright (c) 2006 The Regents of The University of Michigan
15 * All rights reserved.
16 *
17 * Redistribution and use in source and binary forms, with or without
18 * modification, are permitted provided that the following conditions are
19 * met: redistributions of source code must retain the above copyright
20 * notice, this list of conditions and the following disclaimer;
21 * redistributions in binary form must reproduce the above copyright
22 * notice, this list of conditions and the following disclaimer in the
23 * documentation and/or other materials provided with the distribution;
24 * neither the name of the copyright holders nor the names of its
25 * contributors may be used to endorse or promote products derived from
26 * this software without specific prior written permission.
27 *
28 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
29 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
30 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
31 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
32 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
33 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
34 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
35 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
36 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
37 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
38 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
39 *
40 * Authors: Ali Saidi
41 */
42
Ali Saidi271b9a52006-11-23 01:42:57 -050043#include <cassert>
Nathan Binkert39a05562011-04-15 10:44:06 -070044#include <iostream>
Nathan Binkert8d2e51c2009-05-17 14:34:52 -070045
Andreas Hanssonffb6aec2012-09-19 06:15:44 -040046#include "base/addr_range_map.hh"
Ali Saidi271b9a52006-11-23 01:42:57 -050047
48using namespace std;
49
Nathan Binkert52493b22008-10-02 11:26:59 -070050int
51main()
Ali Saidi271b9a52006-11-23 01:42:57 -050052{
Andreas Hanssonffb6aec2012-09-19 06:15:44 -040053 AddrRangeMap<int> r;
Ali Saidi271b9a52006-11-23 01:42:57 -050054
Ola Jeppsson7f169512014-01-30 12:21:58 -060055 AddrRangeMap<int>::const_iterator i;
Ali Saidi271b9a52006-11-23 01:42:57 -050056
Andreas Hanssonffb6aec2012-09-19 06:15:44 -040057 i = r.insert(RangeIn(10, 40), 5);
Ali Saidi271b9a52006-11-23 01:42:57 -050058 assert(i != r.end());
Andreas Hanssonffb6aec2012-09-19 06:15:44 -040059 i = r.insert(RangeIn(60, 90), 3);
Ali Saidi271b9a52006-11-23 01:42:57 -050060 assert(i != r.end());
61
Andreas Hanssonffb6aec2012-09-19 06:15:44 -040062 i = r.find(RangeIn(20, 30));
Ali Saidi271b9a52006-11-23 01:42:57 -050063 assert(i != r.end());
Ola Jeppsson7f169512014-01-30 12:21:58 -060064 cout << i->first.to_string() << " " << i->second << endl;
Ali Saidi271b9a52006-11-23 01:42:57 -050065
Andreas Hanssonffb6aec2012-09-19 06:15:44 -040066 i = r.find(RangeIn(55, 55));
Ali Saidi271b9a52006-11-23 01:42:57 -050067 assert(i == r.end());
Ali Saidi139519e2006-12-12 17:55:27 -050068
Andreas Hanssonffb6aec2012-09-19 06:15:44 -040069 i = r.insert(RangeIn(0, 12), 1);
Ali Saidi139519e2006-12-12 17:55:27 -050070 assert(i == r.end());
71
Andreas Hanssonffb6aec2012-09-19 06:15:44 -040072 i = r.insert(RangeIn(0, 9), 1);
Ali Saidi139519e2006-12-12 17:55:27 -050073 assert(i != r.end());
74
Andreas Hanssonffb6aec2012-09-19 06:15:44 -040075 i = r.find(RangeIn(20, 30));
Ali Saidi139519e2006-12-12 17:55:27 -050076 assert(i != r.end());
Ola Jeppsson7f169512014-01-30 12:21:58 -060077 cout << i->first.to_string() << " " << i->second << endl;
Ali Saidi139519e2006-12-12 17:55:27 -050078
Andreas Hanssonffb6aec2012-09-19 06:15:44 -040079 return 0;
Ali Saidi271b9a52006-11-23 01:42:57 -050080}