HomeSort by relevance Sort by last modified time
    Searched refs:GetFromId (Results 1 - 11 of 11) sorted by null

  /art/runtime/verifier/
register_line-inl.h 29 return verifier_->GetRegTypeCache()->GetFromId(line_[vsrc]);
reg_type_cache-inl.h 38 inline const art::verifier::RegType& RegTypeCache::GetFromId(uint16_t id) const {
reg_type_cache.h 55 const art::verifier::RegType& GetFromId(uint16_t id) const;
register_line.cc 252 const RegType& type = verifier_->GetRegTypeCache()->GetFromId(result_[0]);
258 DCHECK(verifier_->GetRegTypeCache()->GetFromId(result_[1]).IsUndefined());
269 const RegType& type_l = verifier_->GetRegTypeCache()->GetFromId(result_[0]);
270 const RegType& type_h = verifier_->GetRegTypeCache()->GetFromId(result_[1]);
reg_type.cc 399 result << reg_type_cache_->GetFromId(*it).Dump();
402 result << reg_type_cache_->GetFromId(*it).Dump();
411 result << "UnresolvedSuperClass(" << reg_type_cache_->GetFromId(super_type_id).Dump() << ")";
590 const RegType& _left(reg_type_cache_->GetFromId(refs.first));
595 const_cast<RegType&>(reg_type_cache_->GetFromId(refs.second)));
612 CHECK(!reg_type_cache_->GetFromId(type).IsUnresolvedMergedReference());
  /external/srec/tools/grxmlcompile/
sub_min.cpp 55 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == currId) {
77 while (fix < numArc && arc[forwardList[fix]]->GetFromId() == firstId
80 if (fix < numArc && arc[forwardList[fix]]->GetFromId() == firstId)
81 fnxt= arc[forwardList[fix]]->GetFromId();
85 while (six < numArc && arc[forwardList[six]]->GetFromId() == secondId
88 if (six < numArc && arc[forwardList[six]]->GetFromId() == secondId)
89 snxt= arc[forwardList[six]]->GetFromId();
166 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == currId) {
193 while (vertEnd < sortNum && arc[forwardList[vertEnd]]->GetFromId() == baseId) {
200 while (fix < sortNum && arc[forwardList[fix]]->GetFromId() == baseId)
    [all...]
sub_phon.cpp 60 arcOne= CreateArc (NONE_LABEL, NONE_LABEL, arc[ii]->GetFromId(), newId);
66 // (void) CreateArc (-wordId, NONE_LABEL, arc[ii]->GetFromId(), newId);
76 currId= arc[ii]->GetFromId();
118 currId= arc[ii]->GetFromId();
179 currId= arc[ii]->GetFromId();
224 std::cout << "Intra sil: " << arc[ii]->GetFromId() << " " << arc[ii]->GetToId() << std::endl;
227 fix= FindToIndex (arc[ii]->GetFromId());
231 && arc[backwardList[fix]]->GetToId() == arc[ii]->GetFromId()) {
247 currId= arc[backwardList[fix]]->GetFromId();
269 && arc[forwardList[bix]]->GetFromId() == arc[ii]->GetToId())
    [all...]
sub_supp.cpp 212 direction= element - arc[forwardList[rix]]->GetFromId();
218 assert (arc[forwardList[rix]]->GetFromId() == element);
219 while (rix > 0 && arc[forwardList[rix-1]]->GetFromId() == element)
221 assert (arc[forwardList[rix]]->GetFromId() == element);
386 id= arc[ii]->GetFromId();
401 id= arc[ii]->GetFromId();
432 assert (arc[forwardList[lastRix]]->GetFromId() == arc[forwardList[rix]]->GetFromId());
sub_base.cpp 171 ReverseDepthData (arc[ii]->GetFromId(), depthMap, 1);
187 nextId= arc[backwardList[rix]]->GetFromId();
207 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == startId) {
251 incId= arc[ii]->GetFromId();
296 fromId= arc[ii]->GetFromId();
sub_grph.cpp 300 initialId= arc[ii]->GetFromId();
328 vertId= arc[ii]->GetFromId();
479 while (rix < sortNum && arc[forwardList[rix]]->GetFromId() == currId) {
502 while (rix < sortNum && arc[forwardList[rix]]->GetFromId() == currId) {
553 PullUpEnds (arc[backwardList[rix]]->GetFromId(), baseId,
576 PullUpEnds (arc[backwardList[rix]]->GetFromId(), currId,
579 nextId= arc[backwardList[rix]]->GetFromId();
715 while (rix < sortNum && arc[forwardList[rix]]->GetFromId() == currId) {
732 incId= arc[ii]->GetFromId();
790 if (PullUpTags (arc[backwardList[rix]]->GetFromId(), baseId, initialId
    [all...]
netw_arc.h 142 int GetFromId() { return fromId; };

Completed in 167 milliseconds