2 * Copyright (C) 2012, 2013 Apple Inc. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
7 * 1. Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
13 * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 #include "LazyOperandValueProfile.h"
29 #include "JSCInlines.h"
33 CompressedLazyOperandValueProfileHolder::CompressedLazyOperandValueProfileHolder() { }
34 CompressedLazyOperandValueProfileHolder::~CompressedLazyOperandValueProfileHolder() { }
36 void CompressedLazyOperandValueProfileHolder::computeUpdatedPredictions(const ConcurrentJITLocker
& locker
)
41 for (unsigned i
= 0; i
< m_data
->size(); ++i
)
42 m_data
->at(i
).computeUpdatedPrediction(locker
);
45 LazyOperandValueProfile
* CompressedLazyOperandValueProfileHolder::add(
46 const ConcurrentJITLocker
&, const LazyOperandValueProfileKey
& key
)
49 m_data
= adoptPtr(new LazyOperandValueProfile::List());
51 for (unsigned i
= 0; i
< m_data
->size(); ++i
) {
52 if (m_data
->at(i
).key() == key
)
53 return &m_data
->at(i
);
57 m_data
->append(LazyOperandValueProfile(key
));
58 return &m_data
->last();
61 LazyOperandValueProfileParser::LazyOperandValueProfileParser() { }
62 LazyOperandValueProfileParser::~LazyOperandValueProfileParser() { }
64 void LazyOperandValueProfileParser::initialize(
65 const ConcurrentJITLocker
&, CompressedLazyOperandValueProfileHolder
& holder
)
67 ASSERT(m_map
.isEmpty());
72 LazyOperandValueProfile::List
& data
= *holder
.m_data
;
73 for (unsigned i
= 0; i
< data
.size(); ++i
)
74 m_map
.add(data
[i
].key(), &data
[i
]);
77 LazyOperandValueProfile
* LazyOperandValueProfileParser::getIfPresent(
78 const LazyOperandValueProfileKey
& key
) const
80 HashMap
<LazyOperandValueProfileKey
, LazyOperandValueProfile
*>::const_iterator iter
=
83 if (iter
== m_map
.end())
89 SpeculatedType
LazyOperandValueProfileParser::prediction(
90 const ConcurrentJITLocker
& locker
, const LazyOperandValueProfileKey
& key
) const
92 LazyOperandValueProfile
* profile
= getIfPresent(key
);
96 return profile
->computeUpdatedPrediction(locker
);