Searched refs:tries_size_ (Results 1 - 12 of 12) sorted by relevance

/art/compiler/optimizing/
H A Dbuilder.cc79 graph_->SetHasTryCatch(code_item_.tries_size_ != 0);
H A Dblock_builder.cc42 if (code_item_.tries_size_ != 0) {
47 for (size_t idx = 0; idx < code_item_.tries_size_; ++idx) {
240 if (code_item_.tries_size_ == 0) {
H A Dinliner.cc801 if (code_item->tries_size_ != 0) {
/art/compiler/
H A Dexception_test.cc130 ASSERT_EQ(2u, code_item->tries_size_);
/art/runtime/
H A Ddex_file.h288 uint16_t tries_size_; // the number of try_items for this instance. If non-zero, member in struct:art::DexFile::CodeItem
812 reinterpret_cast<const uint8_t*>(GetTryItems(code_item, code_item.tries_size_));
H A Dmonitor.cc1196 if (code_item->tries_size_ == 0) {
H A Ddex_file.cc818 int32_t max = code_item.tries_size_ - 1;
2486 switch (code_item.tries_size_) {
H A Ddex_file_verifier.cc977 uint32_t try_items_size = code_item->tries_size_;
H A Dclass_linker.cc4133 if (code_item->tries_size_ == 0) {
/art/dexdump/
H A Ddexdump.cc447 const u4 triesSize = pCode->tries_size_;
/art/runtime/verifier/
H A Dmethod_verifier.cc997 uint32_t tries_size = code_item_->tries_size_;
3695 if (code_item_->tries_size_ != 0) {
/art/compiler/driver/
H A Dcompiler_driver.cc1025 if (code_item->tries_size_ == 0) {

Completed in 339 milliseconds