Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://www.ncbi.nlm.nih.gov/IEB/ToolBox/CPP_DOC/doxyhtml/queue__database_8cpp_source.html below:

NCBI C++ ToolKit: src/app/netschedule/queue_database.cpp Source File

max_queues,

: m_Host(server->GetBackgroundHost()),

m_MaxQueues(max_queues),

m_FreeStatusMemCnt(0),

m_LastFreeMem(time(0)),

m_PurgeStatusIndex(0),

vector<string> refuse_submit_queues =

(data_dir.

()) {

);

(!data_dir.

()) {

);

}

(!data_dir.

()) {

last_queue_load_error;

queue_load_error_count = 0;

final_dynamic_count = 0;

k = dump_dynamic_queues.begin();

k != dump_dynamic_queues.end(); ++k)

(config_static_queues.

(k->first) == config_static_queues.

())

++final_dynamic_count;

total_queues = final_dynamic_count +

config_static_queues.

();

=

+

to_string(total_queues) +

;

k != dump_queue_classes.

(); ++k) {

k = dump_dynamic_queues.begin();

k != dump_dynamic_queues.end(); ++k) {

qname = k->first;

(config_static_queues.

(qname) != config_static_queues.

())

qclass = k->second;

records =

.

(

,

)

.

(

, k->first)

.

(

,

)

.

(

, records);

}

(

exception & ex) {

last_queue_load_error = ex.what();

++queue_load_error_count;

last_queue_load_error =

+

k->first +

;

++queue_load_error_count;

}

(

exception & ex) {

last_queue_load_error = ex.what();

++queue_load_error_count;

last_queue_load_error =

;

++queue_load_error_count;

(queue_load_error_count > 0) {

+

to_string(queue_load_error_count) +

+ last_queue_load_error);

list<string> sections;

(list<string>, it, sections) {

& section_name = *it;

(queue_class.empty())

vector<string> warnings;

queue_classes[queue_class] = params;

queue_classes;

list<string> sections;

(list<string>, it, sections) {

& section_name = *it;

(queue_name.empty())

vector<string> warnings;

(params.

(reg, section_name, classes, warnings)) {

queues[queue_name] = params;

map< string, map< string, string > > section_container;

section_container new_values;

list<string> sections;

(list<string>, it, sections) {

queue_or_class;

& section_name = *it;

(queue_or_class.empty())

& entry = *k;

ref_section = reg.

(section_name,

(entry ==

)

(ref_section.empty())

(find(sections.begin(), sections.end(), ref_section) ==

(new_values.find(ref_section) != new_values.end())

list<string> linked_section_entries;

(list<string>::const_iterator j = linked_section_entries.begin();

j != linked_section_entries.end(); ++j)

new_values[ref_section] = values;

vector<string> deleted;

(new_values.find(k->first) == new_values.end())

deleted.push_back(k->first);

(!deleted.empty()) {

(vector<string>::const_iterator k(deleted.begin());

k != deleted.end(); ++k)

diff.

(

, deletedSections );

vector<string> added;

(section_container::const_iterator k(new_values.begin());

k != new_values.end(); ++k)

added.push_back(k->first);

(!added.empty()) {

(vector<string>::const_iterator k(added.begin());

k != added.end(); ++k)

diff.

(

, addedSections );

vector<string> changed;

(section_container::const_iterator k(new_values.begin());

k != new_values.end(); ++k) {

(find(added.begin(), added.end(), k->first) != added.end())

changed.push_back(k->first);

(!changed.empty()) {

(vector<string>::const_iterator k(changed.begin());

k != changed.end(); ++k)

diff.

(

, changedSections );

vector<string> deleted;

k != old_values.

(); ++k)

(new_values.

(k->first) == new_values.

())

deleted.push_back(k->first);

(!deleted.empty()) {

(vector<string>::const_iterator k(deleted.begin());

k != deleted.end(); ++k)

diff.

(

, deletedValues );

vector<string> added;

k != new_values.

(); ++k)

(old_values.

(k->first) == old_values.

())

added.push_back(k->first);

(!added.empty()) {

(vector<string>::const_iterator k(added.begin());

k != added.end(); ++k)

diff.

(

, addedValues );

vector<string> changed;

k != new_values.

(); ++k) {

(old_values.

(k->first) == old_values.

())

(old_values.

(k->first)->second ==

new_values.

(k->first)->second)

changed.push_back(k->first);

(!changed.empty()) {

(vector<string>::const_iterator k(changed.begin());

k != changed.end(); ++k) {

changedValues.

( *k, values );

diff.

(

, changedValues );

k != queues_from_ini.

(); ++k) {

+ k->first +

);

add_count = 0;

k != queues_from_ini.

(); ++k) {

has_changes =

;

vector<string> classes;

old_queue_class = k->first;

(classes_from_ini.

(old_queue_class) != classes_from_ini.

())

(k->second.delete_request)

k->second.delete_request =

;

classes.push_back(old_queue_class);

(!classes.empty()) {

(vector<string>::const_iterator k = classes.begin();

k != classes.end(); ++k)

diff.

(

, deleted_classes );

queue_class = k->first;

classes_from_ini.

(queue_class);

(new_class == classes_from_ini.

())

(k->second.delete_request) {

k->second = new_class->second;

classes.push_back(queue_class);

class_diff = k->second.Diff(new_class->second,

(class_diff.

() > 0) {

k->second = new_class->second;

class_changes.

(queue_class, class_diff);

(class_changes.

() > 0)

diff.

(

, class_changes);

k != classes_from_ini.

(); ++k) {

new_queue_class = k->first;

classes.push_back(new_queue_class);

(!classes.empty()) {

(vector<string>::const_iterator k = classes.begin();

k != classes.end(); ++k)

diff.

(

, added_classes);

has_changes =

;

vector<string> deleted_queues;

old_queue = k->first;

(queues_from_ini.

(old_queue) != queues_from_ini.

())

(k->second.first.delete_request)

queue->SetRefuseSubmits(

);

k->second.first.delete_request =

;

deleted_queues.push_back(k->first);

(!deleted_queues.empty()) {

(vector<string>::const_iterator k = deleted_queues.begin();

k != deleted_queues.end(); ++k)

diff.

(

, deleted);

> > added_queues;

k->second.second->UpdatePerfLoggingSettings(k->second.first.qclass);

queue_name = k->first;

queues_from_ini.

(queue_name);

(new_queue == queues_from_ini.

())

(k->second.first.delete_request) {

queue->SetParameters(new_queue->second);

queue->SetRefuseSubmits(

);

k->second.first = new_queue->second;

added_queues.push_back(make_pair(queue_name,

k->second.first.qclass));

queue_diff = k->second.first.Diff(new_queue->second,

(queue_diff.

() > 0) {

queue->SetParameters(new_queue->second);

k->second.first = new_queue->second;

section_changes.

(queue_name, queue_diff);

(k->second.first.delete_request ==

)

(

+ k->second.first.qclass +

+ k->first +

);

class_diff = k->second.first.Diff(queue_class->second,

(class_diff.

() > 0) {

old_class = k->second.first.qclass;

old_description = k->second.first.description;

queue->SetParameters(queue_class->second);

k->second.first = queue_class->second;

k->second.first.qclass = old_class;

k->second.first.description = old_description;

section_changes.

(k->first, class_diff);

(section_changes.

() > 0)

diff.

(

, section_changes);

k != queues_from_ini.

(); ++k) {

new_queue_name = k->first;

added_queues.push_back(make_pair(new_queue_name, k->second.qclass));

(!added_queues.empty()) {

(vector< pair<string, string> >::const_iterator

k = added_queues.begin();

k != added_queues.end(); ++k)

diff.

(

, added);

(to_add_count > available_count)

+

to_string(to_add_count) +

+

to_string(available_count) +

);

min_precision =

(min_precision,

k->second.CalculateRuntimePrecision());

min_precision =

(min_precision,

k->second.first.CalculateRuntimePrecision());

min_precision;

= 0;

+= k->second.second->CountActiveJobs();

= 0;

+= k->second.second->CountAllJobs();

(k->second.second->AnyJobs())

+ name +

);

found->second.second;

q->SetParameters(params);

[qname] = make_pair(params, q.release());

.

(

,

)

.

(

, qname)

.

(

,

);

& qname,

& qclass,

& description)

+ qname +

);

+ qclass +

+ qname +

);

(queue_class->second.delete_request)

+ qclass +

+ qname +

);

+ qname +

);

(!

.IsAdmin()) {

(!queue_class->second.subm_hosts.empty()) {

acl.

(queue_class->second.subm_hosts);

);

);

(!queue_class->second.program_name.empty()) {

);

);

& qname)

+ qname +

);

+ qname +

);

(!

.IsAdmin()) {

(!queue->IsSubmitAllowed(

.GetAddress()))

);

(!queue->IsProgramAllowed(

.GetProgramName()))

);

found_queue->second.first.delete_request =

;

queue->SetRefuseSubmits(

);

+ qname +

);

params.

= found->second.second->GetRefuseSubmits();

params.

= found->second.second->GetPauseStatus();

params.

= found->second.second->GetAffSlotsUsed();

params.

= found->second.second->GetClientsCount();

params.

= found->second.second->GetGroupsCount();

params.

= found->second.second->GetGCBacklogCount();

params.

= found->second.second->GetNotifCount();

+= k->first + sep;

aff_count = 0;

(

);

);

+=

+ k->first +

+

k->second.second->PrintTransitionCounters();

vector<string> warnings;

+=

+ k->first +

+

k->second.second->PrintJobsStat(

,

,

, warnings);

.append(

)

.append(k->second.GetPrintableParameters(

,

));

j = k->second.linked_sections.begin();

j != k->second.linked_sections.end(); ++j) {

prefix((j->first).c_str() + strlen(

));

section_name = j->second;

m != values.

(); ++m)

.append(

)

.append(k->second.ConfigSection(

));

+=

+ k->first +

+

j = k->second.first.linked_sections.begin();

j != k->second.first.linked_sections.end(); ++j) {

prefix((j->first).c_str() + strlen(

));

section_name = j->second;

m != values.

(); ++m)

+=

+ prefix +

+ m->first +

+ m->second;

+=

+ k->first +

+

k->second.first.ConfigSection(

);

+=

+ k->first +

;

j != k->second.end(); ++j) {

+= j->first +

+ j->second +

;

map< string, map<string, string> >::const_iterator found =

found->second;

pause_state = k->second.second->GetPauseStatus();

pause_states[k->first] = pause_state;

pause_states;

vector<string> refuse_submit_queues;

(k->second.second->GetRefuseSubmits())

refuse_submit_queues.push_back(k->first);

refuse_submit_queues;

(

index = 0; ; ++index) {

queue->NotifyListenersPeriodically(current_time);

k->second.second->PrintStatistics(aff_count);

k->second.second->PrintJobCounters();

(

index = 0; ; ++index) {

queue->CheckExecutionTimeout(logging);

list< pair< string, CRef< CQueue > > > candidates;

(k->second.first.delete_request)

candidates.push_back(make_pair(k->first, k->second.second));

list< pair< string, CRef< CQueue > > >::iterator

k = candidates.begin();

(k != candidates.end()) {

(k->second->IsEmpty() ==

)

k = candidates.erase(k);

(candidates.empty())

(k = candidates.begin(); k != candidates.end(); ++k) {

vector< string > classes_to_delete;

(j->second.delete_request) {

in_use =

;

(m->second.first.qclass == j->first) {

(in_use ==

)

classes_to_delete.push_back(j->first);

k != classes_to_delete.end(); ++k) {

total_scanned = 0;

total_mark_deleted = 0;

limit_reached =

;

(current_queue.

() ==

) {

max_scanned, max_mark_deleted,

total_scanned, total_mark_deleted) ==

)

(total_mark_deleted >= max_mark_deleted ||

total_scanned >= max_scanned) {

limit_reached =

;

(limit_reached ==

) {

(current_queue.

() ==

) {

(current_queue->GetQueueName() == start_queue->GetQueueName())

max_scanned, max_mark_deleted,

total_scanned, total_mark_deleted) ==

)

(total_mark_deleted >= max_mark_deleted ||

total_scanned >= max_scanned) {

limit_reached =

;

(limit_reached ==

) {

(start_queue.

() ==

) {

(start_status_index > 0) {

0, start_status_index - 1,

max_scanned, max_mark_deleted,

total_scanned, total_mark_deleted) ==

)

(limit_reached ==

) {

(start_queue.

() ==

) {

start_status_index, start_status_index,

max_scanned, max_mark_deleted,

total_scanned, total_mark_deleted) ==

)

it->second.second;

queue_num = ((rand() * 1.0) / RAND_MAX) *

.

();

it->second.second;

(it->first == current_name) {

it->second.second;

status_to_end,

start_job_id,

end_job_id,

max_mark_deleted,

& total_scanned,

& total_mark_deleted)

(; status <= status_to_end; ++status) {

purge_io.

= max_scanned - total_scanned;

purge_io.

= max_mark_deleted - total_mark_deleted;

purge_io.

= start_job_id;

total_scanned += purge_io.

;

total_mark_deleted += purge_io.

;

(total_mark_deleted >= max_mark_deleted ||

total_scanned >= max_scanned) {

(!crash_file.

()) {

(

);

(crash_file.

())

(

);

(!crash_file.

()) {

(

);

(crash_file.

())

(

);

del_rec = 0;

(

index = 0; ; ++index) {

del_rec += queue->DeleteBatch(max_deleted - del_rec);

(del_rec >= max_deleted)

kMemFree_Delay = 15 * 60;

kRecordThreshold = 1000000;

(

index = 0; ; ++index) {

queue->OptimizeMem();

sec_delay = purge_timeout;

nanosec_delay = (purge_timeout - sec_delay)*1000000000;

, *

, sec_delay, nanosec_delay,

(

index = 0; ; ++index) {

queue->PurgeAffinities();

(

index = 0; ; ++index) {

queue->PurgeGroups();

(current_time.

() == last_purge.

())

last_purge = current_time;

(

index = 0; ; ++index) {

queue->StaleNodes(current_time);

(current_time - last_time < period)

last_time = current_time;

(

index = 0; ; ++index) {

queue->PurgeBlacklistedJobs();

(current_time - last_time < period)

last_time = current_time;

(

index = 0; ; ++index) {

queue->PurgeClientRegistry(current_time);

current_index = 0;

(current_index == index)

k->second.second;

*

, 0, 100000000,

(

index = 0; ; ++index) {

from_queue = queue->NotifyExactListeners();

(from_queue <

)

run_delay.

(), run_delay.

(),

(!dump_dir.

())

dump_error =

;

lbsm_test_queue(

);

dumped_queues.

(k->first);

}

(

exception & ex) {

(

<< k->first <<

<<

(dumped_queues.

(k->first) == dumped_queues.

())

classes_to_dump.

(k->second.first.qclass);

j = k->second.first.linked_sections.begin();

j != k->second.first.linked_sections.end(); ++j)

linked_sections_to_dump.

(j->second);

dynamic_queues_to_dump.

(k->first);

(!classes_to_dump.

()) {

qclasses_dump_file_name =

+

linked_sections_dump_file_name =

+

FILE * qclasses_dump_file =

;

FILE * linked_sections_dump_file =

;

qclasses_dump_file = fopen(qclasses_dump_file_name.c_str(),

);

(qclasses_dump_file ==

)

runtime_error(

+

qclasses_dump_file_name);

setbuf(qclasses_dump_file,

);

(classes_to_dump.

() > 0 ||

dynamic_queues_to_dump.

() > 0) {

header.

(qclasses_dump_file);

k != classes_to_dump.

(); ++k) {

queue_class->second);

k = dynamic_queues_to_dump.

();

k != dynamic_queues_to_dump.

(); ++k) {

q->second.first.qclass,

,

fclose(qclasses_dump_file);

qclasses_dump_file =

;

(!linked_sections_to_dump.

()) {

linked_sections_dump_file = fopen(

linked_sections_dump_file_name.c_str(),

);

(linked_sections_dump_file ==

)

runtime_error(

+

linked_sections_dump_file_name);

setbuf(linked_sections_dump_file,

);

header.

(linked_sections_dump_file);

k = linked_sections_to_dump.

();

k != linked_sections_to_dump.

(); ++k) {

map<string, map<string, string> >::const_iterator

fclose(linked_sections_dump_file);

linked_sections_dump_file =

;

}

(

exception & ex) {

(

);

(qclasses_dump_file !=

)

fclose(qclasses_dump_file);

(linked_sections_dump_file !=

)

fclose(linked_sections_dump_file);

(access(qclasses_dump_file_name.c_str(), F_OK) != -1)

(qclasses_dump_file_name.c_str());

(access(linked_sections_dump_file_name.c_str(), F_OK) != -1)

(linked_sections_dump_file_name.c_str());

k = dynamic_queues_to_dump.

();

k != dynamic_queues_to_dump.

(); ++k) {

& qname,

& qclass,

memcpy(descr_dump.

, qname.data(), qname.size());

memcpy(descr_dump.

, qclass.data(), qclass.size());

(!prefixes.empty()) {

prefixes += k->first;

}

(

exception & ex) {

=

;

+=

+ qclass;

runtime_error(

);

k != values.

(); ++k) {

memcpy(section_dump.

, sname.data(), sname.size());

memcpy(section_dump.

, k->first.data(), k->first.size());

memcpy(section_dump.

, k->second.data(), k->second.size());

section_dump.

(

);

}

(

exception & ex) {

runtime_error(

+

sname +

+ ex.what());

}

(

exception & ex) {

(

<< ex.what());

(

);

(!data_dir.

())

(CDir::TEntries::const_iterator k =

.begin();

entryName = (*k)->GetName();

(

);

(

<<

);

(dump_dir_exists && !ver_file_exists) {

);

(dump_dir_exists && ver_file_exists) {

read_count = 0;

read_count =

.Read(

,

(

) - 1);

[read_count] =

;

vector<string> lines;

(lines.size() > 2) {

);

}

(lines.size() == 0) {

server_version = ver_info.

();

(lines.size() >= 2) {

(server_version != lines[1]) {

<< lines[1] <<

<< server_version);

}

(lines.size() == 1) {

<< server_version);

(lines.size() >= 1) {

<< lines[0] <<

(!dump_dir_exists && ver_file_exists) {

(

<<

<<

);

);

=

;

server_version = ver_info.

();

.Write(

, 1);

.Write(server_version.data(), server_version.size());

map<

,

,

> & dump_dynamic_queues,

(!dump_dir.

())

queue_desrc_file(queue_desrc_file_name);

(queue_desrc_file.

()) {

FILE *

= fopen(queue_desrc_file_name.c_str(),

);

runtime_error(

+ queue_desrc_file_name);

dump_dynamic_queues[qname] = qclass;

max_pending_read_wait_timeout);

client_registry_timeout_worker_node);

client_registry_timeout_admin);

client_registry_timeout_submitter);

client_registry_timeout_reader);

client_registry_timeout_unknown);

dump_prefs(dump_struct.

linked_section_prefixes,

linked_section_prefixes_size);

dump_names(dump_struct.

linked_section_names,

linked_section_names_size);

list<string> prefixes;

list<string>

;

list<string>::const_iterator pref_it = prefixes.begin();

list<string>::const_iterator names_it =

.begin();

( ; pref_it != prefixes.end() &&

names_it !=

.end(); ++pref_it, ++names_it)

dump_queue_classes[qclass] = p;

}

(

exception & ex) {

(CDir::TEntries::const_iterator k =

.begin();

entry_name = (*k)->GetName();

(dump_dynamic_queues.find(qname) == dump_dynamic_queues.end())

dump_static_queues.

(qname);

list<string> sections;

(list<string>::const_iterator k = sections.begin();

k != sections.end(); ++k) {

& section_name = *k;

(queue_name.empty())

queues.

(queue_name);

(!dump_dir.

())

linked_sections_file(linked_sections_file_name);

(linked_sections_file.

()) {

FILE *

= fopen(linked_sections_file_name.c_str(),

);

runtime_error(

+ linked_sections_file_name);

map<string, map<string, string> > dump_sections;

dump_sections[sname][vname] =

;

}

(

exception & ex) {

(!dump_dir.

())

backup_number = 0;

backup_dir_name;

+ to_string(backup_number);

(!

(backup_dir_name).Exists())

dump_dir.

(backup_dir_name);

}

(

exception & ex) {

(

<< ex.what());

(

);

(space_file.

()) {

}

(

exception & ex) {

=

+

(!dump_dir.

()) {

}

(

exception & ex) {

=

+

(ex.what());

(space_file ==

) {

=

+

=

;

=

+

(fwrite(

, space, 1, space_file) != 1) {

=

+

k != paused_queues.

(); ++k) {

queue_name = k->first;

pause_mode = k->second;

(

<<

queue_name <<

);

existing->second.second->RestorePauseStatus(pause_mode);

vector<string> & refuse_submit_queues)

(vector<string>::const_iterator k = refuse_submit_queues.begin();

k != refuse_submit_queues.end(); ++k) {

queue_name = *k;

(

<<

queue_name <<

);

existing->second.second->SetRefuseSubmits(

);

Class for support low level input/output for files.

size_t GetSize() const

For a container node (that is, either an array or an object), return the number of elements in the co...

static CJsonNode NewArrayNode()

Create a new JSON array node.

void AppendString(const string &value)

For an array node, add a string node at the end of the array.

void SetByKey(const string &key, CJsonNode::TInstance value)

For a JSON object node, insert a new element or update an existing element.

static CJsonNode NewStringNode(const string &value)

Create a new JSON string node.

static CJsonNode NewObjectNode()

Create a new JSON object node.

static CNSPreciseTime Current(void)

static CNcbiApplication * Instance(void)

Singleton method.

bool IsAllowed(unsigned int ha) const

CJsonNode SetHosts(const string &host_names)

NetSchedule internal exception.

NetScheduler threaded server.

unsigned int GetReserveDumpSpace(void) const

unsigned GetScanBatchSize(void) const

bool GetRefuseSubmits() const

void RegisterAlert(EAlertType alert_type, const string &message)

const bool & IsLogNotificationThread() const

const bool & IsLogExecutionWatcherThread() const

SNSRegistryParameters GetAffRegistrySettings(void) const

const unsigned int & GetJobCountersInterval() const

const unsigned int & GetStatInterval() const

const bool & IsLogCleaningThread() const

unsigned GetMarkdelBatchSize(void) const

unsigned GetDeleteBatchSize(void) const

void LoadJobsStartIDs(void)

bool WasDBDrained(void) const

bool IsDrainShutdown(void) const

double GetPurgeTimeout(void) const

void SetRefuseSubmits(bool val)

void InitNodeID(const string &db_path)

const bool & IsLogStatisticsThread() const

SNSRegistryParameters GetScopeRegistrySettings(void) const

void SerializeJobsStartIDs(void)

SNSRegistryParameters GetGroupRegistrySettings(void) const

All clients registered to connect.

bool IsMatchingClient(const CQueueClientInfo &cinfo) const

void AddClientInfo(const CQueueClientInfo &cinfo)

string PrintJobsStat(const CNSClientId &client)

CRef< CServiceThread > m_ServiceThread

set< string, PNocase > x_GetConfigQueues(void)

SQueueParameters QueueInfo(const string &qname) const

void RunServiceThread(void)

CQueueDataBase(CNetScheduleServer *server, const string &path, unsigned int max_queues, bool diskless, bool reinit)

string GetQueueConfig(void) const

time_t Configure(const IRegistry &reg, CJsonNode &diff)

void RunExecutionWatcherThread(const CNSPreciseTime &run_delay)

void PrintStatistics(size_t &aff_count)

void RunNotifThread(void)

CRef< CQueue > x_GetNext(const string &current_name)

unsigned int x_CountQueuesToAdd(const TQueueParams &queues_from_ini) const

unsigned int m_FreeStatusMemCnt

void x_AppendDumpLinkedSections(void)

void WakeupNotifThread(void)

CFastMutex m_ConfigureLock

CRef< CQueue > x_GetQueueAt(unsigned int index)

size_t m_PurgeStatusIndex

bool x_RemoveSpaceReserveFile(void)

void CreateDynamicQueue(const CNSClientId &client, const string &qname, const string &qclass, const string &description="")

void x_CreateDumpErrorFlagFile(void)

TQueueParams x_ReadIniFileQueueClassDescriptions(const IRegistry &reg)

bool x_CheckStopPurge(void)

string GetQueueInfo(void) const

void x_DeleteQueuesAndClasses(void)

void PurgeClientRegistry(void)

void x_ValidateConfiguration(const TQueueParams &queues_from_ini) const

bool x_DoesDumpErrorFlagFileExist(void) const

void StopNotifThread(void)

void DeleteDynamicQueue(const CNSClientId &client, const string &qname)

void StopPurgeThread(void)

void x_ReadLinkedSections(const IRegistry &reg, CJsonNode &diff)

CJsonNode x_DetectChangesInLinkedSection(const map< string, string > &old_values, const map< string, string > &new_values)

map< string, int > GetPauseQueues(void) const

string GetQueueClassesConfig(void) const

void x_DumpQueueOrClass(FILE *f, const string &qname, const string &qclass, bool is_queue, const SQueueParameters &params)

void StopServiceThread(void)

void RunPurgeThread(void)

void StopExecutionWatcherThread(void)

bool QueueExists(const string &qname) const

CNSPreciseTime SendExactNotifications(void)

bool x_CheckOpenPreconditions(bool reinit)

map< string, map< string, string > > m_LinkedSections

void PurgeAffinities(void)

vector< string > GetRefuseSubmitQueues(void) const

void x_RemoveDumpErrorFlagFile(void)

bool x_DoesCrashFlagFileExist(void) const

bool x_ConfigureQueues(const TQueueParams &queues_from_ini, CJsonNode &diff)

void x_OptimizeStatusMatrix(const CNSPreciseTime &current_time)

CRef< CJobQueueCleanerThread > m_PurgeThread

CNetScheduleServer * m_Server

TQueueParams x_ReadIniFileQueueDescriptions(const IRegistry &reg, const TQueueParams &classes)

void x_RemoveDataFiles(void)

CNSPreciseTime CalculateRuntimePrecision(void) const

void x_CreateSpaceReserveFile(void)

unsigned int m_PurgeJobScanned

SQueueParameters x_SingleQueueInfo(TQueueInfo::const_iterator found) const

void x_CreateCrashFlagFile(void)

string GetQueueNames(const string &sep) const

void x_RestoreRefuseSubmitState(const vector< string > &refuse_submit_queues)

string PrintTransitionCounters(void)

void NotifyListeners(void)

CFastMutex m_LinkedSectionsGuard

map< string, string > GetLinkedSection(const string &section_name) const

string x_GetDumpSpaceFileName(void) const

void x_CreateStorageVersionFile(void)

CRef< CQueue > x_GetLastPurged(void)

unsigned x_PurgeUnconditional(void)

void x_RestorePauseState(const map< string, int > &paused_queues)

string GetLinkedSectionConfig(void) const

unsigned int CountActiveJobs(void) const

unsigned int CountAllJobs(void) const

CRef< CQueue > x_GetFirst(void)

void PrintJobCounters(void)

bool x_PurgeQueue(CQueue &queue, size_t status_to_start, size_t status_to_end, unsigned int start_job_id, unsigned int end_job_id, size_t max_scanned, size_t max_mark_deleted, const CNSPreciseTime &current_time, size_t &total_scanned, size_t &total_mark_deleted)

void x_DumpLinkedSection(FILE *f, const string &sname, const map< string, string > &values)

CRef< CJobQueueExecutionWatcherThread > m_ExeWatchThread

CRef< CQueue > OpenQueue(const string &name)

void x_ReadDumpQueueDesrc(set< string, PNocase > &dump_static_queues, map< string, string, PNocase > &dump_dynamic_queues, TQueueParams &dump_queue_classes)

void PurgeBlacklistedJobs(void)

string GetQueueClassesInfo(void) const

void CheckExecutionTimeout(bool logging)

bool x_ConfigureQueueClasses(const TQueueParams &classes_from_ini, CJsonNode &diff)

CRef< CGetJobNotificationThread > m_NotifThread

TQueueParams m_QueueClasses

void x_CreateAndMountQueue(const string &qname, const SQueueParameters &params)

void x_RemoveCrashFlagFile(void)

SPurgeAttributes CheckJobsExpiry(const CNSPreciseTime &current_time, SPurgeAttributes attributes, unsigned int last_job, TJobStatus status)

static void PrintServerWide(size_t affinities)

void RequestStop()

Schedule thread Stop.

container_type::const_iterator const_iterator

container_type::iterator iterator

const_iterator begin() const

const_iterator end() const

iterator_bool insert(const value_type &val)

const_iterator find(const key_type &key) const

iterator_bool insert(const value_type &val)

const_iterator begin() const

const_iterator find(const key_type &key) const

const_iterator end() const

parent_type::const_iterator const_iterator

static const struct name_t names[]

static DLIST_TYPE *DLIST_NAME() next(DLIST_LIST_TYPE *list, DLIST_TYPE *item)

static void DLIST_NAME() remove(DLIST_LIST_TYPE *list, DLIST_TYPE *item)

static SQLCHAR output[256]

const CNcbiRegistry & GetConfig(void) const

Get the application's cached configuration parameters (read-only).

CVersionInfo GetVersion(void) const

Get the program version information.

#define ITERATE(Type, Var, Cont)

ITERATE macro to sequence through container elements.

CDiagContext_Extra & Print(const string &name, const string &value)

The method does not print the argument, but adds it to the string.

CDiagContext & GetDiagContext(void)

Get diag context instance.

CDiagContext_Extra Extra(void) const

Create a temporary CDiagContext_Extra object.

#define ERR_POST(message)

Error posting with file, line number information but without error codes.

#define LOG_POST(message)

This macro is deprecated and it's strongly recomended to move in all projects (except tests) to macro...

void Critical(CExceptionArgs_Base &args)

#define NCBI_THROW(exception_class, err_code, message)

Generic macro to throw an exception, given the exception class, error code and message string.

void Warning(CExceptionArgs_Base &args)

TEntries GetEntries(const string &mask=kEmptyStr, TGetEntriesFlags flags=0) const

Get directory entries based on the specified "mask".

static string DeleteTrailingPathSeparator(const string &path)

Delete trailing path separator, if any.

bool Rename(const string &new_path, TRenameFlags flags=fRF_Default)

Rename entry.

virtual bool Remove(TRemoveFlags flags=eRecursive) const

Remove a directory entry.

static string MakePath(const string &dir=kEmptyStr, const string &base=kEmptyStr, const string &ext=kEmptyStr)

Assemble a path from basic components.

static string AddTrailingPathSeparator(const string &path)

Add trailing path separator, if needed.

virtual bool Exists(void) const

Check if directory "dirname" exists.

bool Create(TCreateFlags flags=fCreate_Default) const

Create the directory using "dirname" passed in the constructor.

virtual bool Remove(TRemoveFlags flags=eRecursive) const

Delete existing directory.

virtual bool Exists(void) const

Check existence of file.

@ eRead

File can be read.

@ eReadWrite

File can be read and written.

@ eOpen

Open an existing file, or create a new one.

@ eCreate

Create a new file, or truncate an existing one.

@ fIgnoreRecursive

Suppress "self recursive" elements (the directories "." and "..").

EJobStatus

Job status codes.

@ eDone

Job is ready (computed successfully)

@ eConfirmed

Final state - read confirmed.

@ eCanceled

Explicitly canceled.

@ ePending

Waiting for execution.

@ eReadFailed

Final state - read failed.

@ eFailed

Failed to run (execution timeout)

void Reset(void)

Reset reference object.

bool IsNull(void) const THROWS_NONE

Check if pointer is null – same effect as Empty().

TObjectType & GetObject(void)

Get object.

bool Empty(void) const THROWS_NONE

Check if CRef is empty – not pointing to any object, which means having a null value.

virtual void EnumerateSections(list< string > *sections, TFlags flags=fAllLayers) const

Enumerate section names.

virtual void EnumerateEntries(const string &section, list< string > *entries, TFlags flags=fAllLayers) const

Enumerate parameter names for a specified section.

virtual string GetString(const string &section, const string &name, const string &default_value, TFlags flags=0) const

Get the parameter string value.

#define END_NCBI_SCOPE

End previously defined NCBI scope.

#define BEGIN_NCBI_SCOPE

Define ncbi namespace.

static int CompareNocase(const CTempString s1, SIZE_TYPE pos, SIZE_TYPE n, const char *s2)

Case-insensitive compare of a substring with another string.

static list< string > & Split(const CTempString str, const CTempString delim, list< string > &arr, TSplitFlags flags=0, vector< SIZE_TYPE > *token_pos=NULL)

Split a string using specified delimiters.

static bool StartsWith(const CTempString str, const CTempString start, ECase use_case=eCase)

Check if a string starts with a specified prefix value.

static bool SplitInTwo(const CTempString str, const CTempString delim, string &str1, string &str2, TSplitFlags flags=0)

Split a string into two pieces using the specified delimiters.

@ fSplit_MergeDelimiters

Merge adjacent delimiters.

@ eCase

Case sensitive compare.

bool Run(TRunMode flags=fRunDefault)

Run the thread.

void Join(void **exit_data=0)

Wait for the thread termination.

void ParseVersionString(const string &vstr, string *program_name, CVersionInfo *ver)

Parse string, extract version info and program name (case insensitive)

virtual string Print(void) const

Print version information.

where both of them are integers Note

for(len=0;yy_str[len];++len)

Process information in the NCBI Registry, including working with configuration files.

NetSchedule client specs.

#define NETSCHEDULED_STORAGE_VERSION

const CNSPreciseTime kTimeNever

vector< string > DeserializeRefuseSubmitState(const string &data_path, bool diskless)

void SerializePauseState(CNetScheduleServer *server)

map< string, int > DeserializePauseState(const string &data_path, bool diskless)

void SerializeRefuseSubmitState(CNetScheduleServer *server)

const string kPausedQueuesFilesName("PAUSED_QUEUES")

const string kDumpReservedSpaceFileName("space_keeper.dat")

const string kCrashFlagFileName("CRASH_FLAG")

const string kDBStorageVersionFileName("DB_STORAGE_VER")

const string kLinkedSectionsFileName("linked_sections.dump")

const size_t kDumpReservedSpaceFileBuffer

const string kDumpErrorFlagFileName("DUMP_ERROR_FLAG")

static string kNewLine("\n")

const string kDumpSubdirName("dump")

const string kNodeIDFileName("NODE_ID")

const string kRefuseSubmitFileName("REFUSE_SUBMIT")

const string kStartJobIDsFileName("STARTJOBIDS")

const string kQClassDescriptionFileName("qclass_descr.dump")

const unsigned kMaxQueueNameSize

const size_t kStatusesSize

static CNetScheduleAPI::EJobStatus statuses_to_delete_from[]

static SLJIT_INLINE sljit_ins msg(sljit_gpr r, sljit_s32 d, sljit_gpr x, sljit_gpr b)

static CNamedPipeClient * client

Netschedule queue client info.

CVersionInfo version_info

char section[kLinkedSectionValueNameSize]

char value_name[kLinkedSectionValueNameSize]

char value[kLinkedSectionValueSize]

int Read(FILE *f, size_t fixed_size_from_header)

Uint4 client_registry_min_worker_nodes

char reader_hosts[kMaxQueueLimitsSize]

int Read(FILE *f, size_t fixed_size_from_header)

double read_blacklist_time

char qclass[kMaxQueueNameSize]

double client_registry_timeout_admin

double client_registry_timeout_unknown

char subm_hosts[kMaxQueueLimitsSize]

Uint4 dump_aff_buffer_size

double client_registry_timeout_submitter

char linked_section_prefixes[kLinkedSectionsList]

Uint4 client_registry_min_unknowns

double client_registry_timeout_reader

char wnode_hosts[kMaxQueueLimitsSize]

char linked_section_names[kLinkedSectionsList]

Uint4 dump_client_buffer_size

Uint4 read_failed_retries

Uint4 client_registry_min_submitters

Uint4 client_registry_min_admins

Uint4 dump_group_buffer_size

double max_pending_read_wait_timeout

double client_registry_timeout_worker_node

Uint4 max_jobs_per_client

char qname[kMaxQueueNameSize]

char program_name[kMaxQueueLimitsSize]

double notif_hifreq_interval

double max_pending_wait_timeout

char description[kMaxDescriptionSize]

Uint4 linked_section_prefixes_size

Uint4 linked_section_names_size

double notif_hifreq_period

Uint4 client_registry_min_readers

unsigned int dump_buffer_size

unsigned int client_registry_min_submitters

CNSPreciseTime blacklist_time

map< string, string > linked_sections

CNSPreciseTime read_timeout

unsigned int client_registry_min_unknowns

CNSPreciseTime notif_hifreq_interval

unsigned int dump_aff_buffer_size

CNSPreciseTime notif_hifreq_period

unsigned int max_output_size

CNSPreciseTime read_blacklist_time

CNSPreciseTime pending_timeout

unsigned int max_input_size

CNSPreciseTime notif_handicap

unsigned int max_jobs_per_client

CNSPreciseTime client_registry_timeout_submitter

unsigned int read_failed_retries

CNSPreciseTime client_registry_timeout_unknown

unsigned int notif_lofreq_mult

unsigned int dump_client_buffer_size

CNSPreciseTime reader_timeout

unsigned int failed_retries

CNSPreciseTime max_pending_read_wait_timeout

unsigned int dump_group_buffer_size

unsigned int client_registry_min_worker_nodes

CNSPreciseTime max_pending_wait_timeout

CNSPreciseTime client_registry_timeout_admin

bool ReadQueueClass(const IRegistry &reg, const string &sname, vector< string > &warnings)

CNSPreciseTime client_registry_timeout_reader

bool ReadQueue(const IRegistry &reg, const string &sname, const map< string, SQueueParameters, PNocase > &queue_classes, vector< string > &warnings)

string GetPrintableParameters(bool include_class, bool url_encoded) const

CNSPreciseTime run_timeout

CNSPreciseTime client_registry_timeout_worker_node

CNSPreciseTime wnode_timeout

unsigned int client_registry_min_admins

unsigned int client_registry_min_readers

static wxAcceleratorEntry entries[3]

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4