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

  /art/compiler/sea_ir/ir/
sea.h 94 void RenameToSSA(int reg_no, InstructionNode* definition, unsigned int predecessor_id) {
97 if (definition_edges_.size() < predecessor_id+1) {
98 definition_edges_.resize(predecessor_id+1, NULL);
100 if (NULL == definition_edges_.at(predecessor_id)) {
101 definition_edges_[predecessor_id] = new std::vector<InstructionNode*>();
103 definition_edges_[predecessor_id]->push_back(definition);
sea.cc 587 int predecessor_id = -1; local
590 predecessor_id = crt_pred_id;
593 DCHECK_NE(-1, predecessor_id);
599 phi->RenameToSSA(reg_no, definition, predecessor_id);
  /external/chromium_org/sync/syncable/
mutable_entry.h 58 // and fails if |predecessor_id| does not identify a sibling. Pass the root
60 bool PutPredecessor(const Id& predecessor_id);
mutable_entry.cc 227 bool MutableEntry::PutPredecessor(const Id& predecessor_id) {
228 MutableEntry predecessor(write_transaction(), GET_BY_ID, predecessor_id); local
  /external/chromium_org/chrome/browser/sync/
profile_sync_service_bookmark_unittest.cc 83 int64 predecessor_id) {
87 if (predecessor_id == 0) {
91 EXPECT_EQ(BaseNode::INIT_OK, predecessor.InitByIdLookup(predecessor_id));
95 EXPECT_EQ(node.GetPredecessorId(), predecessor_id);
118 int64 predecessor_id) {
120 predecessor_id);
126 int64 predecessor_id) {
127 return Add(title, std::string(), true, parent_id, predecessor_id);
132 int64 predecessor_id) {
134 predecessor_id);
    [all...]
  /external/chromium_org/sync/internal_api/
write_node.cc 499 syncable::Id predecessor_id = predecessor ? local
501 if (!entry_->PutPredecessor(predecessor_id))

Completed in 163 milliseconds