blob: 0f7f9996c429aa44cd060386d99c9d3f3b869bda [file] [log] [blame]
/**
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you 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 "relational_operators/UpdateOperator.hpp"
#include <cstddef>
#include <cstdlib>
#include <ostream>
#include <utility>
#include "catalog/CatalogRelationSchema.hpp"
#include "catalog/CatalogTypedefs.hpp"
#include "query_execution/QueryContext.hpp"
#include "query_execution/QueryExecutionMessages.pb.h"
#include "query_execution/QueryExecutionUtil.hpp"
#include "query_execution/WorkOrderProtosContainer.hpp"
#include "query_execution/WorkOrdersContainer.hpp"
#include "relational_operators/WorkOrder.pb.h"
#include "storage/InsertDestination.hpp"
#include "storage/StorageBlock.hpp"
#include "storage/StorageBlockInfo.hpp"
#include "storage/StorageManager.hpp"
#include "threading/ThreadIDBasedMap.hpp"
#include "utility/Macros.hpp"
#include "glog/logging.h"
#include "tmb/id_typedefs.h"
#include "tmb/message_bus.h"
#include "tmb/tagged_message.h"
namespace quickstep {
bool UpdateOperator::getAllWorkOrders(
WorkOrdersContainer *container,
QueryContext *query_context,
StorageManager *storage_manager,
const tmb::client_id scheduler_client_id,
tmb::MessageBus *bus) {
if (started_) {
return true;
}
DCHECK(query_context != nullptr);
for (partition_id part_id = 0; part_id < num_partitions_; ++part_id) {
for (const block_id input_block_id : input_blocks_[part_id]) {
container->addNormalWorkOrder(
new UpdateWorkOrder(
query_id_,
relation_,
part_id,
input_block_id,
query_context->getPredicate(predicate_index_),
query_context->getUpdateGroup(update_group_index_),
query_context->getInsertDestination(
relocation_destination_index_),
storage_manager,
op_index_,
scheduler_client_id,
bus),
op_index_);
}
}
started_ = true;
return true;
}
bool UpdateOperator::getAllWorkOrderProtos(WorkOrderProtosContainer *container) {
if (started_) {
return true;
}
for (std::size_t part_id = 0; part_id < num_partitions_; ++part_id) {
for (const block_id input_block_id : input_blocks_[part_id]) {
serialization::WorkOrder *proto = new serialization::WorkOrder;
proto->set_work_order_type(serialization::UPDATE);
proto->set_query_id(query_id_);
proto->SetExtension(serialization::UpdateWorkOrder::operator_index, op_index_);
proto->SetExtension(serialization::UpdateWorkOrder::relation_id, relation_.getID());
proto->SetExtension(serialization::UpdateWorkOrder::insert_destination_index, relocation_destination_index_);
proto->SetExtension(serialization::UpdateWorkOrder::predicate_index, predicate_index_);
proto->SetExtension(serialization::UpdateWorkOrder::update_group_index, update_group_index_);
proto->SetExtension(serialization::UpdateWorkOrder::block_id, input_block_id);
proto->SetExtension(serialization::UpdateWorkOrder::partition_id, part_id);
container->addWorkOrderProto(proto, op_index_);
}
}
started_ = true;
return true;
}
void UpdateWorkOrder::execute() {
MutableBlockReference block(
storage_manager_->getBlockMutable(input_block_id_, relation_));
StorageBlock::UpdateResult result =
block->update(assignments_, predicate_, relocation_destination_);
if (!result.indices_consistent) {
LOG_WARNING("An UPDATE caused one or more IndexSubBlocks in StorageBlock "
<< BlockIdUtil::ToString(input_block_id_) << " to become inconsistent "
<< "(not enough space to index all tuples in block).");
}
// TODO(harshad): Stream the block ID only if the predicate returned at least
// one match in the StorageBlock.
serialization::DataPipelineMessage proto;
proto.set_operator_index(update_operator_index_);
proto.set_block_id(input_block_id_);
proto.set_relation_id(relation_.getID());
proto.set_query_id(query_id_);
proto.set_partition_id(partition_id_);
// NOTE(zuyu): Using the heap memory to serialize proto as a c-like string.
const std::size_t proto_length = proto.ByteSize();
char *proto_bytes = static_cast<char*>(std::malloc(proto_length));
CHECK(proto.SerializeToArray(proto_bytes, proto_length));
tmb::TaggedMessage tagged_message(static_cast<const void *>(proto_bytes),
proto_length,
kDataPipelineMessage);
std::free(proto_bytes);
DLOG(INFO) << "UpdateWorkOrder sent DataPipelineMessage to Scheduler with Client " << scheduler_client_id_;
const tmb::MessageBus::SendStatus send_status =
QueryExecutionUtil::SendTMBMessage(
bus_,
ClientIDMap::Instance()->getValue(),
scheduler_client_id_,
std::move(tagged_message));
CHECK(send_status == tmb::MessageBus::SendStatus::kOK);
}
} // namespace quickstep