/* * Copyright ( C ) 2011 The Android Open Source Project * * Licensed under the Apache License , Version 2 . 0 ( the " License " ) ; * you may not use this file except in compliance with the License . * You may obtain a copy of the License at * * http : //www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing , software * distributed under the License is distributed on an " AS IS " BASIS , * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND , either express or implied . * See the License for the specific language governing permissions and * limitations under the License . #include "intern_table-inl.h" #include "base/hash_set.h" #include "common_runtime_test.h" #include "dex/utf.h" #include "gc_root-inl.h" #include "handle_scope-inl.h" #include "mirror/object.h" #include "mirror/string.h" #include "scoped_thread_state_change-inl.h" namespace art HIDDEN {class InternTableTest : public CommonRuntimeTest {protected :true ; // Make the Runtime creation cheaper. 10 > hs(soa.Self());3 , "foo" )));3 , "foo" )));"foo" )));3 , "bar" )));"foo" ));"foo" ));"foo" ));3 , "foo" )));3 , "bar" )));4 , "foo2" )));4 , "foo2" )));"foo2" )));4 , "bar2" )));"foo2" ));"foo2" ));"foo2" ));0 U, t.Size());3 , "foo" );1 > hs(soa.Self());"foo" )));1 U, t.Size());3 , "bar" );2 U, t.Size());// Check if table indexes match on 64 and 32 bit machines. // This is done by ensuring hash values are the same on every machine and limited to 32-bit wide. // Otherwise cross compilation can cause a table to be filled on host using one indexing algorithm // and later on a device with different sizeof(size_t) can use another indexing algorithm. // Thus the table may provide wrong data. // A string that has a negative hash value. "00000000" );// `String::GetHashCode()` ensures that the stored hash is calculated. 0 );for (InternTable::Table::InternalTable& table : t.strong_interns_.tables_) {// The negative hash value shall be 32-bit wide on every host. 32 >(table.set_.hashfn_(GcRoot<mirror::String>(str))));class TestPredicate : public IsMarkedVisitor {public :lock_) {bool erased = false ;for (auto it = expected_.begin(), end = expected_.end(); it != end; ++it) {if (*it == s) {true ;break ;return nullptr;void Expect(const mirror::String* s) {0 U, expected_.size());private :mutable std::vector<const mirror::String*> expected_;3 , "foo" );3 , "bar" );5 > hs(soa.Self());"hello" )));"world" )));4 U, t.Size());// We should traverse only the weaks... 2 U, t.Size());// Just check that we didn't corrupt the map. "still here" )));3 U, t.Size());auto ContainsWeak = [&](InternTable& t, ObjPtr<mirror::String> s)return t.LookupWeak(soa.Self(), s) == s;// Strongs are never weak. 2 > hs(soa.Self());3 , "foo" )));3 , "foo" )));// Weaks are always weak. 4 > hs(soa.Self());"foo" )));"foo" )));// A weak can be promoted to a strong. 3 > hs(soa.Self());"foo" )));3 , "foo" )));// Interning a weak after a strong gets you the strong. 3 > hs(soa.Self());3 , "foo" )));"foo" )));3 > hs(soa.Self());3 , "foo" )));3 , "bar" )));6 , "foobar" )));"foo" ));"bar" ));"foobar" ));3 , "foo" );3 , "bar" );6 , "foobar" );4 , "foox" );5 , "fooba" );6 , "foobaR" );// Try a hash conflict. "foobar" , 6 ),"foobbS" , 6 ));6 , "foobbS" );1 > hs(soa.Self());"foo" )));// namespace art
Messung V0.5 in Prozent C=88 H=95 G=91
¤ Dauer der Verarbeitung: 0.1 Sekunden
(vorverarbeitet am 2026-06-29)
¤ *© Formatika GbR, Deutschland
