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

  /art/runtime/verifier/
register_line-inl.h 31 return verifier_->GetRegTypeCache()->GetFromId(line_[vsrc]);
reg_type_cache-inl.h 27 inline RegType& RegTypeCache::GetFromId(uint16_t id) const {
register_line.cc 253 RegType& type = verifier_->GetRegTypeCache()->GetFromId(result_[0]);
259 DCHECK(verifier_->GetRegTypeCache()->GetFromId(result_[1]).IsUndefined());
270 RegType& type_l = verifier_->GetRegTypeCache()->GetFromId(result_[0]);
271 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() << ")";
591 RegType& _left(reg_type_cache_->GetFromId(refs.first));
594 RegType& _right(reg_type_cache_->GetFromId(refs.second));
611 CHECK(!reg_type_cache_->GetFromId(type).IsUnresolvedMergedReference());
reg_type_cache.h 54 RegType& GetFromId(uint16_t id) const;
  /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);
387 id= arc[ii]->GetFromId();
402 id= arc[ii]->GetFromId();
433 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; };
  /external/chromium_org/ui/accessibility/
ax_tree_source.h 32 virtual AXNodeSource GetFromId(int32 id) const = 0;
ax_serializable_tree.cc 27 virtual AXNode* GetFromId(int32 id) const OVERRIDE {
28 return tree_->GetFromId(id);
ax_tree.cc 74 AXNode* AXTree::GetFromId(int32 id) const {
84 AXNode* node = GetFromId(update.node_id_to_clear);
118 AXNode* node = GetFromId(update.nodes[i].id);
155 AXNode* node = GetFromId(src.id);
243 AXNode* child = GetFromId(child_id);
ax_tree.h 78 virtual AXNode* GetFromId(int32 id) const;
ax_tree_serializer_unittest.cc 87 serializer_->SerializeChanges(tree1_->GetFromId(1), &update);
124 serializer_->SerializeChanges(tree1_->GetFromId(4), &update);
170 serializer_->SerializeChanges(tree1_->GetFromId(4), &update);
ax_generated_tree_unittest.cc 145 serializer.SerializeChanges(tree1.GetFromId(id), &update);
  /external/chromium_org/chrome/browser/ui/ash/accessibility/
ax_tree_source_ash.h 35 virtual views::AXAuraObjWrapper* GetFromId(int32 id) const OVERRIDE;
ax_tree_source_ash.cc 52 AXAuraObjWrapper* AXTreeSourceAsh::GetFromId(int32 id) const {
  /external/chromium_org/content/renderer/accessibility/
blink_ax_tree_source.h 34 virtual blink::WebAXObject GetFromId(int32 id) const OVERRIDE;
blink_ax_tree_source.cc 136 blink::WebAXObject BlinkAXTreeSource::GetFromId(int32 id) const {
  /external/chromium_org/chrome/browser/extensions/api/automation/
automation_apitest.cc 375 source_serializer->SerializeChanges(target_tree->GetFromId(id), &update);
  /external/chromium_org/content/browser/accessibility/
browser_accessibility_manager.cc 125 return GetFromID(node->id());
128 BrowserAccessibility* BrowserAccessibilityManager::GetFromID(int32 id) {
192 ui::AXNode* node = tree_->GetFromId(param.id);
219 BrowserAccessibility* obj = GetFromID(params[i].id);
238 node->manager()->GetFromID(active_descendant_id);

Completed in 915 milliseconds