Skip to content
Snippets Groups Projects
Commit cbb207ff authored by Eric Cano's avatar Eric Cano
Browse files

Cleaned up leftover array in ArchiveJob protobuf.

parent 42d4f178
No related branches found
No related tags found
No related merge requests found
...@@ -69,17 +69,17 @@ void ArchiveQueue::commit() { ...@@ -69,17 +69,17 @@ void ArchiveQueue::commit() {
ValueCountMap maxDriveAllowedMap(m_payload.mutable_maxdrivesallowedmap()); ValueCountMap maxDriveAllowedMap(m_payload.mutable_maxdrivesallowedmap());
ValueCountMap priorityMap(m_payload.mutable_prioritymap()); ValueCountMap priorityMap(m_payload.mutable_prioritymap());
ValueCountMap minArchiveRequestAgeMap(m_payload.mutable_minarchiverequestagemap()); ValueCountMap minArchiveRequestAgeMap(m_payload.mutable_minarchiverequestagemap());
if (maxDriveAllowedMap.total() != (uint64_t)m_payload.pendingarchivejobs_size() || if (maxDriveAllowedMap.total() != (uint64_t)m_payload.archivejobs_size() ||
priorityMap.total() != (uint64_t)m_payload.pendingarchivejobs_size() || priorityMap.total() != (uint64_t)m_payload.archivejobs_size() ||
minArchiveRequestAgeMap.total() != (uint64_t)m_payload.pendingarchivejobs_size()) { minArchiveRequestAgeMap.total() != (uint64_t)m_payload.archivejobs_size()) {
// The maps counts are off: recompute them. // The maps counts are off: recompute them.
maxDriveAllowedMap.clear(); maxDriveAllowedMap.clear();
priorityMap.clear(); priorityMap.clear();
minArchiveRequestAgeMap.clear(); minArchiveRequestAgeMap.clear();
for (size_t i=0; i<(size_t)m_payload.pendingarchivejobs_size(); i++) { for (size_t i=0; i<(size_t)m_payload.archivejobs_size(); i++) {
maxDriveAllowedMap.incCount(m_payload.pendingarchivejobs(i).maxdrivesallowed()); maxDriveAllowedMap.incCount(m_payload.archivejobs(i).maxdrivesallowed());
priorityMap.incCount(m_payload.pendingarchivejobs(i).priority()); priorityMap.incCount(m_payload.archivejobs(i).priority());
minArchiveRequestAgeMap.incCount(m_payload.pendingarchivejobs(i).priority()); minArchiveRequestAgeMap.incCount(m_payload.archivejobs(i).priority());
} }
m_payload.set_mapsrebuildcount(m_payload.mapsrebuildcount()+1); m_payload.set_mapsrebuildcount(m_payload.mapsrebuildcount()+1);
} }
...@@ -90,9 +90,7 @@ void ArchiveQueue::commit() { ...@@ -90,9 +90,7 @@ void ArchiveQueue::commit() {
bool ArchiveQueue::isEmpty() { bool ArchiveQueue::isEmpty() {
checkPayloadReadable(); checkPayloadReadable();
// Check we have no archive jobs pending // Check we have no archive jobs pending
if (m_payload.pendingarchivejobs_size() if (m_payload.archivejobs_size())
|| m_payload.orphanedarchivejobsnscreation_size()
|| m_payload.orphanedarchivejobsnsdeletion_size())
return false; return false;
// If we made it to here, it seems the pool is indeed empty. // If we made it to here, it seems the pool is indeed empty.
return true; return true;
...@@ -154,7 +152,7 @@ void ArchiveQueue::addJobsAndCommit(std::list<JobToAdd> & jobsToAdd) { ...@@ -154,7 +152,7 @@ void ArchiveQueue::addJobsAndCommit(std::list<JobToAdd> & jobsToAdd) {
priorityMap.incCount(jta.policy.archivePriority); priorityMap.incCount(jta.policy.archivePriority);
ValueCountMap minArchiveRequestAgeMap(m_payload.mutable_minarchiverequestagemap()); ValueCountMap minArchiveRequestAgeMap(m_payload.mutable_minarchiverequestagemap());
minArchiveRequestAgeMap.incCount(jta.policy.archiveMinRequestAge); minArchiveRequestAgeMap.incCount(jta.policy.archiveMinRequestAge);
if (m_payload.pendingarchivejobs_size()) { if (m_payload.archivejobs_size()) {
if ((uint64_t)jta.startTime < m_payload.oldestjobcreationtime()) if ((uint64_t)jta.startTime < m_payload.oldestjobcreationtime())
m_payload.set_oldestjobcreationtime(jta.startTime); m_payload.set_oldestjobcreationtime(jta.startTime);
m_payload.set_archivejobstotalsize(m_payload.archivejobstotalsize() + jta.fileSize); m_payload.set_archivejobstotalsize(m_payload.archivejobstotalsize() + jta.fileSize);
...@@ -162,7 +160,7 @@ void ArchiveQueue::addJobsAndCommit(std::list<JobToAdd> & jobsToAdd) { ...@@ -162,7 +160,7 @@ void ArchiveQueue::addJobsAndCommit(std::list<JobToAdd> & jobsToAdd) {
m_payload.set_archivejobstotalsize(jta.fileSize); m_payload.set_archivejobstotalsize(jta.fileSize);
m_payload.set_oldestjobcreationtime(jta.startTime); m_payload.set_oldestjobcreationtime(jta.startTime);
} }
auto * j = m_payload.add_pendingarchivejobs(); auto * j = m_payload.add_archivejobs();
j->set_address(jta.archiveRequestAddress); j->set_address(jta.archiveRequestAddress);
j->set_size(jta.fileSize); j->set_size(jta.fileSize);
j->set_fileid(jta.archiveFileId); j->set_fileid(jta.archiveFileId);
...@@ -177,7 +175,7 @@ void ArchiveQueue::addJobsAndCommit(std::list<JobToAdd> & jobsToAdd) { ...@@ -177,7 +175,7 @@ void ArchiveQueue::addJobsAndCommit(std::list<JobToAdd> & jobsToAdd) {
auto ArchiveQueue::getJobsSummary() -> JobsSummary { auto ArchiveQueue::getJobsSummary() -> JobsSummary {
checkPayloadReadable(); checkPayloadReadable();
JobsSummary ret; JobsSummary ret;
ret.files = m_payload.pendingarchivejobs_size(); ret.files = m_payload.archivejobs_size();
ret.bytes = m_payload.archivejobstotalsize(); ret.bytes = m_payload.archivejobstotalsize();
ret.oldestJobStartTime = m_payload.oldestjobcreationtime(); ret.oldestJobStartTime = m_payload.oldestjobcreationtime();
if (ret.files) { if (ret.files) {
...@@ -202,7 +200,7 @@ ArchiveQueue::AdditionSummary ArchiveQueue::addJobsIfNecessaryAndCommit(std::lis ...@@ -202,7 +200,7 @@ ArchiveQueue::AdditionSummary ArchiveQueue::addJobsIfNecessaryAndCommit(std::lis
ValueCountMap minArchiveRequestAgeMap(m_payload.mutable_minarchiverequestagemap()); ValueCountMap minArchiveRequestAgeMap(m_payload.mutable_minarchiverequestagemap());
AdditionSummary ret; AdditionSummary ret;
for (auto & jta: jobsToAdd) { for (auto & jta: jobsToAdd) {
auto & jl=m_payload.pendingarchivejobs(); auto & jl=m_payload.archivejobs();
for (auto j=jl.begin(); j!= jl.end(); j++) { for (auto j=jl.begin(); j!= jl.end(); j++) {
if (j->address() == jta.archiveRequestAddress) if (j->address() == jta.archiveRequestAddress)
goto skipInsertion; goto skipInsertion;
...@@ -212,7 +210,7 @@ ArchiveQueue::AdditionSummary ArchiveQueue::addJobsIfNecessaryAndCommit(std::lis ...@@ -212,7 +210,7 @@ ArchiveQueue::AdditionSummary ArchiveQueue::addJobsIfNecessaryAndCommit(std::lis
maxDriveAllowedMap.incCount(jta.policy.maxDrivesAllowed); maxDriveAllowedMap.incCount(jta.policy.maxDrivesAllowed);
priorityMap.incCount(jta.policy.archivePriority); priorityMap.incCount(jta.policy.archivePriority);
minArchiveRequestAgeMap.incCount(jta.policy.archiveMinRequestAge); minArchiveRequestAgeMap.incCount(jta.policy.archiveMinRequestAge);
if (m_payload.pendingarchivejobs_size()) { if (m_payload.archivejobs_size()) {
if ((uint64_t)jta.startTime < m_payload.oldestjobcreationtime()) if ((uint64_t)jta.startTime < m_payload.oldestjobcreationtime())
m_payload.set_oldestjobcreationtime(jta.startTime); m_payload.set_oldestjobcreationtime(jta.startTime);
m_payload.set_archivejobstotalsize(m_payload.archivejobstotalsize() + jta.fileSize); m_payload.set_archivejobstotalsize(m_payload.archivejobstotalsize() + jta.fileSize);
...@@ -220,7 +218,7 @@ ArchiveQueue::AdditionSummary ArchiveQueue::addJobsIfNecessaryAndCommit(std::lis ...@@ -220,7 +218,7 @@ ArchiveQueue::AdditionSummary ArchiveQueue::addJobsIfNecessaryAndCommit(std::lis
m_payload.set_archivejobstotalsize(jta.fileSize); m_payload.set_archivejobstotalsize(jta.fileSize);
m_payload.set_oldestjobcreationtime(jta.startTime); m_payload.set_oldestjobcreationtime(jta.startTime);
} }
auto * j = m_payload.add_pendingarchivejobs(); auto * j = m_payload.add_archivejobs();
j->set_address(jta.archiveRequestAddress); j->set_address(jta.archiveRequestAddress);
j->set_size(jta.fileSize); j->set_size(jta.fileSize);
j->set_fileid(jta.archiveFileId); j->set_fileid(jta.archiveFileId);
...@@ -243,7 +241,7 @@ void ArchiveQueue::removeJobsAndCommit(const std::list<std::string>& requestsToR ...@@ -243,7 +241,7 @@ void ArchiveQueue::removeJobsAndCommit(const std::list<std::string>& requestsToR
ValueCountMap maxDriveAllowedMap(m_payload.mutable_maxdrivesallowedmap()); ValueCountMap maxDriveAllowedMap(m_payload.mutable_maxdrivesallowedmap());
ValueCountMap priorityMap(m_payload.mutable_prioritymap()); ValueCountMap priorityMap(m_payload.mutable_prioritymap());
ValueCountMap minArchiveRequestAgeMap(m_payload.mutable_minarchiverequestagemap()); ValueCountMap minArchiveRequestAgeMap(m_payload.mutable_minarchiverequestagemap());
auto * jl=m_payload.mutable_pendingarchivejobs(); auto * jl=m_payload.mutable_archivejobs();
bool jobRemoved=false; bool jobRemoved=false;
for (auto &rrt: requestsToRemove) { for (auto &rrt: requestsToRemove) {
bool found = false; bool found = false;
...@@ -275,7 +273,7 @@ void ArchiveQueue::removeJobsAndCommit(const std::list<std::string>& requestsToR ...@@ -275,7 +273,7 @@ void ArchiveQueue::removeJobsAndCommit(const std::list<std::string>& requestsToR
auto ArchiveQueue::dumpJobs() -> std::list<JobDump> { auto ArchiveQueue::dumpJobs() -> std::list<JobDump> {
checkPayloadReadable(); checkPayloadReadable();
std::list<JobDump> ret; std::list<JobDump> ret;
auto & jl=m_payload.pendingarchivejobs(); auto & jl=m_payload.archivejobs();
for (auto j=jl.begin(); j!=jl.end(); j++) { for (auto j=jl.begin(); j!=jl.end(); j++) {
ret.push_back(JobDump()); ret.push_back(JobDump());
JobDump & jd = ret.back(); JobDump & jd = ret.back();
...@@ -290,8 +288,8 @@ auto ArchiveQueue::getCandidateList(uint64_t maxBytes, uint64_t maxFiles, std::s ...@@ -290,8 +288,8 @@ auto ArchiveQueue::getCandidateList(uint64_t maxBytes, uint64_t maxFiles, std::s
checkPayloadReadable(); checkPayloadReadable();
CandidateJobList ret; CandidateJobList ret;
ret.remainingBytesAfterCandidates = m_payload.archivejobstotalsize(); ret.remainingBytesAfterCandidates = m_payload.archivejobstotalsize();
ret.remainingFilesAfterCandidates = m_payload.pendingarchivejobs_size(); ret.remainingFilesAfterCandidates = m_payload.archivejobs_size();
for (auto & j: m_payload.pendingarchivejobs()) { for (auto & j: m_payload.archivejobs()) {
if (!archiveRequestsToSkip.count(j.address())) { if (!archiveRequestsToSkip.count(j.address())) {
ret.candidates.push_back({j.size(), j.address(), (uint16_t)j.copynb()}); ret.candidates.push_back({j.size(), j.address(), (uint16_t)j.copynb()});
ret.candidateBytes += j.size(); ret.candidateBytes += j.size();
......
...@@ -389,9 +389,7 @@ message ValueCountPair { ...@@ -389,9 +389,7 @@ message ValueCountPair {
message ArchiveQueue { message ArchiveQueue {
required string tapepool = 10000; required string tapepool = 10000;
repeated ArchiveJobPointer pendingarchivejobs = 10010; repeated ArchiveJobPointer archivejobs = 10010;
repeated ArchiveJobPointer orphanedarchivejobsnscreation = 10020;
repeated ArchiveJobPointer orphanedarchivejobsnsdeletion = 10030;
repeated ValueCountPair prioritymap = 10031; repeated ValueCountPair prioritymap = 10031;
repeated ValueCountPair minarchiverequestagemap = 10032; repeated ValueCountPair minarchiverequestagemap = 10032;
repeated ValueCountPair maxdrivesallowedmap = 10033; repeated ValueCountPair maxdrivesallowedmap = 10033;
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment