commit
stringlengths 40
40
| old_file
stringlengths 2
205
| new_file
stringlengths 2
205
| old_contents
stringlengths 0
32.9k
| new_contents
stringlengths 1
38.9k
| subject
stringlengths 3
9.4k
| message
stringlengths 6
9.84k
| lang
stringlengths 3
13
| license
stringclasses 13
values | repos
stringlengths 6
115k
|
|---|---|---|---|---|---|---|---|---|---|
d3da5552fcb668c8030a67fab9e0b9ef0e0769a5
|
DispatchQueueTest.cpp
|
DispatchQueueTest.cpp
|
// Copyright (c) 2010 - 2013 Leap Motion. All rights reserved. Proprietary and confidential.
#include "stdafx.h"
#include "DispatchQueueTest.h"
#include "DispatchQueue.h"
using namespace std;
class EventMaker:
public CoreThread
{
public:
EventMaker():
CoreThread("EventMaker")
{
AcceptDispatchDelivery();
}
};
class ThreadBase:
public CoreThread
{
public:
ThreadBase(){
AcceptDispatchDelivery();
}
};
template<int N>
class Thread:
public ThreadBase
{};
TEST_F(DispatchQueueTest, SimpleEvents) {
int count = 0;
*this += [&count] () {
++count;
};
*this += [&count] () {
count += 5 ;
};
int num = DispatchAllEvents();
*this += [&count] () {
count += 5 ;
};
EXPECT_EQ(2, num);
EXPECT_EQ(6, count);
}
TEST_F(DispatchQueueTest, SingleThreadCommits){
int count = 0;
{
Commision com = *this += [&count] () {
count+=1;
};
DispatchAllEvents();
*this += [&count] () {
count+=2;
};
DispatchAllEvents();
Commision com2 = *this += [&count] {
count+=4;
};
DispatchAllEvents();
EXPECT_EQ(0, count);
com.Commit();
DispatchAllEvents();
EXPECT_EQ(3, count);
}
DispatchAllEvents();
EXPECT_EQ(7, count);
}
TEST_F(DispatchQueueTest, MultiThreadCommits){
AutoRequired<EventMaker> eventMaker;
int count = 0;
boost::mutex mut;
boost::unique_lock<boost::mutex> lk(mut);
boost::condition_variable cond;
m_create->InitiateCoreThreads();
*eventMaker += [&count, &cond, &mut] () {
boost::unique_lock<boost::mutex> lk(mut);
count += 1;
cond.notify_all();
};
Commision com1 = *eventMaker += [&count, &cond, &mut] () {
boost::unique_lock<boost::mutex> lk(mut);
count += 2;
};
*eventMaker += [&count, &cond, &mut] () {
boost::unique_lock<boost::mutex> lk(mut);
count += 4;
cond.notify_all();
};
EXPECT_FALSE( boost::cv_status::timeout == cond.wait_for(lk,boost::chrono::microseconds(500)) )
<< "Waited more than 500ms on condition variable";
EXPECT_EQ(1, count);
com1.Commit();
EXPECT_FALSE( boost::cv_status::timeout == cond.wait_for(lk,boost::chrono::microseconds(500)) )
<< "Waited more than 500ms on condition variable";
EXPECT_EQ(7, count);
}
TEST_F(DispatchQueueTest, PathologicalStartAndStop){
AutoRequired<Thread<1>> t1;
AutoRequired<Thread<2>> t2;
AutoRequired<Thread<3>> t3;
AutoRequired<Thread<4>> t4;
m_create->InitiateCoreThreads();
t1->Stop(true);
EXPECT_TRUE(t1->WaitFor(boost::chrono::microseconds(200)));
t2->Stop(true);
EXPECT_TRUE(t2->WaitFor(boost::chrono::microseconds(200)));
t3->Stop(true);
EXPECT_TRUE(t3->WaitFor(boost::chrono::microseconds(200)));
t4->Stop(true);
EXPECT_TRUE(t4->WaitFor(boost::chrono::microseconds(200)));
}
|
// Copyright (c) 2010 - 2013 Leap Motion. All rights reserved. Proprietary and confidential.
#include "stdafx.h"
#include "DispatchQueueTest.h"
#include "DispatchQueue.h"
using namespace std;
class EventMaker:
public CoreThread
{
public:
EventMaker():
CoreThread("EventMaker")
{
AcceptDispatchDelivery();
}
};
class ThreadBase:
public CoreThread
{
public:
ThreadBase(){
AcceptDispatchDelivery();
}
};
template<int N>
class Thread:
public ThreadBase
{};
TEST_F(DispatchQueueTest, SimpleEvents) {
int count = 0;
*this += [&count] () {
++count;
};
*this += [&count] () {
count += 5 ;
};
int num = DispatchAllEvents();
*this += [&count] () {
count += 5 ;
};
EXPECT_EQ(2, num);
EXPECT_EQ(6, count);
}
TEST_F(DispatchQueueTest, SingleThreadCommits){
int count = 0;
{
Commision com = *this += [&count] () {
count+=1;
};
DispatchAllEvents();
*this += [&count] () {
count+=2;
};
DispatchAllEvents();
Commision com2 = *this += [&count] {
count+=4;
};
DispatchAllEvents();
EXPECT_EQ(0, count);
com.Commit();
DispatchAllEvents();
EXPECT_EQ(3, count);
}
DispatchAllEvents();
EXPECT_EQ(7, count);
}
#if _WIN32
TEST_F(DispatchQueueTest, DISABLED_MultiThreadCommits)
#else
TEST_F(DispatchQueueTest, MultiThreadCommits)
#endif
{
AutoRequired<EventMaker> eventMaker;
int count = 0;
boost::mutex mut;
boost::unique_lock<boost::mutex> lk(mut);
boost::condition_variable cond;
m_create->InitiateCoreThreads();
*eventMaker += [&count, &cond, &mut] () {
boost::unique_lock<boost::mutex> lk(mut);
count += 1;
cond.notify_all();
};
Commision com1 = *eventMaker += [&count, &cond, &mut] () {
boost::unique_lock<boost::mutex> lk(mut);
count += 2;
};
*eventMaker += [&count, &cond, &mut] () {
boost::unique_lock<boost::mutex> lk(mut);
count += 4;
cond.notify_all();
};
EXPECT_FALSE( boost::cv_status::timeout == cond.wait_for(lk,boost::chrono::microseconds(500)) )
<< "Waited more than 500ms on condition variable";
EXPECT_EQ(1, count);
com1.Commit();
EXPECT_FALSE( boost::cv_status::timeout == cond.wait_for(lk,boost::chrono::microseconds(500)) )
<< "Waited more than 500ms on condition variable";
EXPECT_EQ(7, count);
}
TEST_F(DispatchQueueTest, PathologicalStartAndStop){
AutoRequired<Thread<1>> t1;
AutoRequired<Thread<2>> t2;
AutoRequired<Thread<3>> t3;
AutoRequired<Thread<4>> t4;
m_create->InitiateCoreThreads();
t1->Stop(true);
EXPECT_TRUE(t1->WaitFor(boost::chrono::microseconds(200)));
t2->Stop(true);
EXPECT_TRUE(t2->WaitFor(boost::chrono::microseconds(200)));
t3->Stop(true);
EXPECT_TRUE(t3->WaitFor(boost::chrono::microseconds(200)));
t4->Stop(true);
EXPECT_TRUE(t4->WaitFor(boost::chrono::microseconds(200)));
}
|
Disable DispatchQueueTest.MultiThreadCommits for now. redmine #8560
|
Disable DispatchQueueTest.MultiThreadCommits for now. redmine #8560
|
C++
|
apache-2.0
|
codemercenary/autowiring,leapmotion/autowiring,leapmotion/autowiring,codemercenary/autowiring,codemercenary/autowiring,leapmotion/autowiring,leapmotion/autowiring,codemercenary/autowiring,codemercenary/autowiring,leapmotion/autowiring,codemercenary/autowiring,leapmotion/autowiring
|
df44159cfad195c07d9c08d656282328f07b81f5
|
src/loader.cpp
|
src/loader.cpp
|
/*
Copyright 2016 Nervana Systems Inc.
Licensed 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 <vector>
#include <cstdio>
#include <iostream>
#include <chrono>
#include <utility>
#include <algorithm>
#include <sox.h>
#include <memory>
#include "loader.hpp"
#include "log.hpp"
#include "web_app.hpp"
using namespace std;
using namespace nervana;
loader_config::loader_config(nlohmann::json js)
{
if (js.is_null())
{
throw std::runtime_error("missing loader config in json config");
}
for (auto& info : config_list)
{
info->parse(js);
}
verify_config("loader", config_list, js);
if (block_size == 0)
{
block_size = 2 * batch_size;
}
set_global_random_seed(random_seed);
validate();
}
void loader_config::validate()
{
if (iteration_mode == "ONCE")
{
}
else if (iteration_mode == "INFINITE")
{
}
else if (iteration_mode == "COUNT")
{
if (iteration_mode_count <= 0)
{
throw invalid_argument("iteration_mode_count must be a positive integer");
}
}
else
{
throw invalid_argument("iteration_mode must be one of ONCE, COUNT, or INFINITE");
}
}
loader::loader(const std::string& config_string)
: m_current_iter(*this, false)
, m_end_iter(*this, true)
{
auto tmp = nlohmann::json::parse(config_string);
initialize(tmp);
}
loader::loader(nlohmann::json& config_json)
: m_current_iter(*this, false)
, m_end_iter(*this, true)
{
initialize(config_json);
}
loader::~loader()
{
if (m_debug_web_app)
{
m_debug_web_app->deregister_loader(this);
}
}
void loader::initialize(nlohmann::json& config_json)
{
string config_string = config_json.dump();
m_current_config = config_json;
loader_config lcfg(config_json);
m_batch_size = lcfg.batch_size;
// shared_ptr<manifest> base_manifest;
sox_format_init();
// the manifest defines which data should be included in the dataset
m_manifest = make_shared<manifest_file>(
lcfg.manifest_filename, lcfg.shuffle_manifest, lcfg.manifest_root, lcfg.subset_fraction);
// TODO: make the constructor throw this error
if (m_manifest->record_count() == 0)
{
throw std::runtime_error("manifest file is empty");
}
// Default ceil div to get number of batches
m_batch_count_value = (m_manifest->record_count() + m_batch_size - 1) / m_batch_size;
if (lcfg.iteration_mode == "ONCE")
{
m_batch_mode = BatchMode::ONCE;
}
else if (lcfg.iteration_mode == "INFINITE")
{
m_batch_mode = BatchMode::INFINITE;
}
else if (lcfg.iteration_mode == "COUNT")
{
m_batch_mode = BatchMode::COUNT;
m_batch_count_value = lcfg.iteration_mode_count;
}
m_block_loader = make_shared<block_loader_file>(m_manifest.get(), lcfg.block_size);
m_block_manager = make_shared<block_manager>(
m_block_loader.get(), lcfg.block_size, lcfg.cache_directory, lcfg.shuffle_enable);
m_provider = provider_factory::create(config_json);
if (lcfg.batch_size > std::thread::hardware_concurrency() * m_increase_input_size_coefficient )
{
m_batch_iterator = make_shared<batch_iterator>(m_block_manager.get(), lcfg.batch_size);
m_final_stage = make_shared<batch_decoder>(m_batch_iterator.get(),
static_cast<size_t>(lcfg.batch_size),
lcfg.decode_thread_count,
lcfg.pinned,
m_provider);
}
else
{
const int decode_size = std::thread::hardware_concurrency() * m_input_multiplier;
m_batch_iterator = make_shared<batch_iterator>(m_block_manager.get(), decode_size);
m_decoder = make_shared<batch_decoder>(m_batch_iterator.get(),
decode_size,
lcfg.decode_thread_count,
lcfg.pinned,
m_provider);
m_final_stage = make_shared<batch_iterator_fbm>(m_decoder.get(), lcfg.batch_size, m_provider);
}
m_output_buffer_ptr = m_final_stage->next();
if (lcfg.web_server_port != 0)
{
m_debug_web_app = make_shared<web_app>(lcfg.web_server_port);
m_debug_web_app->register_loader(this);
}
m_current_iter.m_empty_buffer.add_items(get_names_and_shapes(), (size_t)batch_size());
}
const vector<string>& loader::get_buffer_names() const
{
return m_provider->get_buffer_names();
}
const map<string, shape_type>& loader::get_names_and_shapes() const
{
return m_provider->get_output_shapes();
}
const shape_t& loader::get_shape(const string& name) const
{
return m_provider->get_output_shape(name).get_shape();
}
loader::iterator::iterator(loader& ld, bool is_end)
: m_current_loader(ld)
, m_is_end{is_end}
{
}
loader::iterator::iterator(const iterator& other)
: m_current_loader{other.m_current_loader}
, m_is_end{other.m_is_end}
{
}
loader::iterator& loader::iterator::operator++()
{
m_current_loader.increment_position();
return *this;
}
loader::iterator& loader::iterator::operator++(int)
{
iterator& rc = *this;
++rc;
return rc;
}
bool loader::iterator::operator==(const iterator& other) const
{
bool res = &m_current_loader == &other.m_current_loader;
res &= (other.m_is_end && positional_end()) || (m_is_end && other.positional_end());
return res;
}
bool loader::iterator::operator!=(const iterator& other) const
{
return !(*this == other);
}
// Whether or not this strictly positional iterator has reached the end
bool loader::iterator::positional_end() const
{
return !m_is_end && (position() >= m_current_loader.m_batch_count_value);
}
const fixed_buffer_map& loader::iterator::operator*() const
{
const fixed_buffer_map* rc = nullptr;
if (m_current_loader.m_output_buffer_ptr)
{
rc = m_current_loader.m_output_buffer_ptr;
}
else
{
rc = &m_empty_buffer;
}
return *rc;
}
void loader::increment_position()
{
m_output_buffer_ptr = m_final_stage->next();
m_position++;
// Wrap around if this is an infinite iterator
if (m_batch_mode == BatchMode::INFINITE && m_position == m_batch_count_value)
{
m_position = 0;
}
}
|
/*
Copyright 2016 Nervana Systems Inc.
Licensed 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 <vector>
#include <cstdio>
#include <iostream>
#include <chrono>
#include <utility>
#include <algorithm>
#include <sox.h>
#include <memory>
#include "loader.hpp"
#include "log.hpp"
#include "web_app.hpp"
using namespace std;
using namespace nervana;
loader_config::loader_config(nlohmann::json js)
{
if (js.is_null())
{
throw std::runtime_error("missing loader config in json config");
}
for (auto& info : config_list)
{
info->parse(js);
}
verify_config("loader", config_list, js);
if (block_size == 0)
{
block_size = 2 * batch_size;
}
set_global_random_seed(random_seed);
validate();
}
void loader_config::validate()
{
if (iteration_mode == "ONCE")
{
}
else if (iteration_mode == "INFINITE")
{
}
else if (iteration_mode == "COUNT")
{
if (iteration_mode_count <= 0)
{
throw invalid_argument("iteration_mode_count must be a positive integer");
}
}
else
{
throw invalid_argument("iteration_mode must be one of ONCE, COUNT, or INFINITE");
}
}
loader::loader(const std::string& config_string)
: m_current_iter(*this, false)
, m_end_iter(*this, true)
{
auto tmp = nlohmann::json::parse(config_string);
initialize(tmp);
}
loader::loader(nlohmann::json& config_json)
: m_current_iter(*this, false)
, m_end_iter(*this, true)
{
initialize(config_json);
}
loader::~loader()
{
if (m_debug_web_app)
{
m_debug_web_app->deregister_loader(this);
}
}
void loader::initialize(nlohmann::json& config_json)
{
string config_string = config_json.dump();
m_current_config = config_json;
loader_config lcfg(config_json);
m_batch_size = lcfg.batch_size;
// shared_ptr<manifest> base_manifest;
sox_format_init();
// the manifest defines which data should be included in the dataset
m_manifest = make_shared<manifest_file>(
lcfg.manifest_filename, lcfg.shuffle_manifest, lcfg.manifest_root, lcfg.subset_fraction);
// TODO: make the constructor throw this error
if (m_manifest->record_count() == 0)
{
throw std::runtime_error("manifest file is empty");
}
// Default ceil div to get number of batches
m_batch_count_value = (m_manifest->record_count() + m_batch_size - 1) / m_batch_size;
if (lcfg.iteration_mode == "ONCE")
{
m_batch_mode = BatchMode::ONCE;
}
else if (lcfg.iteration_mode == "INFINITE")
{
m_batch_mode = BatchMode::INFINITE;
}
else if (lcfg.iteration_mode == "COUNT")
{
m_batch_mode = BatchMode::COUNT;
m_batch_count_value = lcfg.iteration_mode_count;
}
m_block_loader = make_shared<block_loader_file>(m_manifest.get(), lcfg.block_size);
m_block_manager = make_shared<block_manager>(
m_block_loader.get(), lcfg.block_size, lcfg.cache_directory, lcfg.shuffle_enable);
m_provider = provider_factory::create(config_json);
unsigned int threads_num = lcfg.decode_thread_count != 0 ? lcfg.decode_thread_count
: std::thread::hardware_concurrency();
if (lcfg.batch_size > threads_num * m_increase_input_size_coefficient)
{
m_batch_iterator = make_shared<batch_iterator>(m_block_manager.get(), lcfg.batch_size);
m_final_stage = make_shared<batch_decoder>(m_batch_iterator.get(),
static_cast<size_t>(lcfg.batch_size),
lcfg.decode_thread_count,
lcfg.pinned,
m_provider);
}
else
{
const int decode_size = threads_num * m_input_multiplier;
m_batch_iterator = make_shared<batch_iterator>(m_block_manager.get(), decode_size);
m_decoder = make_shared<batch_decoder>(m_batch_iterator.get(),
decode_size,
lcfg.decode_thread_count,
lcfg.pinned,
m_provider);
m_final_stage = make_shared<batch_iterator_fbm>(m_decoder.get(), lcfg.batch_size, m_provider);
}
m_output_buffer_ptr = m_final_stage->next();
if (lcfg.web_server_port != 0)
{
m_debug_web_app = make_shared<web_app>(lcfg.web_server_port);
m_debug_web_app->register_loader(this);
}
m_current_iter.m_empty_buffer.add_items(get_names_and_shapes(), (size_t)batch_size());
}
const vector<string>& loader::get_buffer_names() const
{
return m_provider->get_buffer_names();
}
const map<string, shape_type>& loader::get_names_and_shapes() const
{
return m_provider->get_output_shapes();
}
const shape_t& loader::get_shape(const string& name) const
{
return m_provider->get_output_shape(name).get_shape();
}
loader::iterator::iterator(loader& ld, bool is_end)
: m_current_loader(ld)
, m_is_end{is_end}
{
}
loader::iterator::iterator(const iterator& other)
: m_current_loader{other.m_current_loader}
, m_is_end{other.m_is_end}
{
}
loader::iterator& loader::iterator::operator++()
{
m_current_loader.increment_position();
return *this;
}
loader::iterator& loader::iterator::operator++(int)
{
iterator& rc = *this;
++rc;
return rc;
}
bool loader::iterator::operator==(const iterator& other) const
{
bool res = &m_current_loader == &other.m_current_loader;
res &= (other.m_is_end && positional_end()) || (m_is_end && other.positional_end());
return res;
}
bool loader::iterator::operator!=(const iterator& other) const
{
return !(*this == other);
}
// Whether or not this strictly positional iterator has reached the end
bool loader::iterator::positional_end() const
{
return !m_is_end && (position() >= m_current_loader.m_batch_count_value);
}
const fixed_buffer_map& loader::iterator::operator*() const
{
return m_current_loader.m_output_buffer_ptr ? *m_current_loader.m_output_buffer_ptr
: m_empty_buffer;
}
void loader::increment_position()
{
m_output_buffer_ptr = m_final_stage->next();
m_position++;
// Wrap around if this is an infinite iterator
if (m_batch_mode == BatchMode::INFINITE && m_position == m_batch_count_value)
{
m_position = 0;
}
}
|
fix bug with calculation decode_size for case when user set number of thread (#116)
|
fix bug with calculation decode_size for case when user set number of thread (#116)
|
C++
|
apache-2.0
|
NervanaSystems/aeon,NervanaSystems/aeon,NervanaSystems/aeon,NervanaSystems/aeon
|
2111cf8b11ac446353b86734edb635fdbf312d23
|
src/log2esd.cc
|
src/log2esd.cc
|
/* ==================================================================================================
# Copyright 2014 vpon, Inc.
# --------------------------------------------------------------------------------------------------
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this work except in compliance with the License.
# You may obtain a copy of the License in the LICENSE file, or 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 <unistd.h>
#include <stdio.h>
#include <string>
#include <vector>
#include <fstream>
#include "producer/capture.h"
#include "agent/els.h"
#include "public/daemonize.h"
#include "err/err.h"
#include "log/log.h"
using std::string;
using std::vector;
using std::ofstream;
using log2esd::producer::Capture;
using log2esd::agent::ELS;
using log2esd::pub::Daemon;
using log2esd::log::FileHandle;
using log2esd::ERR_ELS_PUSH_DOC_NO_RESPONSE;
struct AppConfig {
string host_;
string log_home_;
string level_;
string daemon_log_;
string pid_file_;
string written_file_;
string rm_;
int lines_;
int line_size_;
int interval_;
AppConfig() : host_("localhost:9200"), log_home_("./log"), level_("INFO"), daemon_log_("/data/logs/log2esd/"), pid_file_(""), written_file_(".written_file.txt"), rm_("yes"), lines_(2), line_size_(2048), interval_(10) {}
};
void Help(char ** argv) {
printf("##########################################\n\n");
printf("Usage: %s -p <file.ini>"
"\n"
"Options:\n"
"-h <192.168.0.1:9200> els service (default: localhost:9200)\n"
"-s <app_logs> directory of app's logs (default: ./log)\n"
"-n <lines> lines of read once (default: 2)\n"
"-b <line_size> size of line (default: 2048)\n"
"-i <interval> waiting interval (default: 2)\n"
"-w <daemon log> directory of daemon logs (default: /data/logs/log2esd)\n"
"-l <level> level of daemon logs (default: INFO)\n"
"-r <yes/no> remove log file after send all datas (default yes)\n"
"-d <pid_file> daemonize log2esd\n"
"-H Show this help\n"
"\n",
argv[0]
);
printf("##########################################\n\n");
}
void GetParam(AppConfig * conf, int argc, char ** argv) {
char opt;
while (-1 != (opt = ::getopt(argc, argv, "h:s:d:n:b:i:w:l:r:H"))) {
switch (opt) {
case 'h':
if (NULL != optarg) {
conf->host_ = optarg;
}
break;
case 's':
if (NULL != optarg) {
conf->log_home_ = optarg;
}
break;
case 'd':
if (NULL != optarg) {
conf->pid_file_ = optarg;
}
break;
case 'n':
if (NULL != optarg) {
conf->lines_ = ::atoi(optarg);
}
break;
case 'b':
if (NULL != optarg) {
conf->line_size_ = ::atoi(optarg);
}
break;
case 'i':
if (NULL != optarg) {
conf->interval_ = ::atoi(optarg);
}
break;
case 'w':
if (NULL != optarg) {
conf->daemon_log_ = optarg;
}
break;
case 'l':
if (NULL != optarg) {
conf->level_ = optarg;
}
break;
case 'r':
if (NULL != optarg) {
conf->rm_ = optarg;
}
break;
case 'H':
default:
Help(argv);
::_exit(0);
break;
}
}
printf("###########################################\n");
printf("host:%s\n", conf->host_.c_str());
printf("log home:%s\n", conf->log_home_.c_str());
printf("read lines:%d\n", conf->lines_);
printf("line size:%d\n", conf->line_size_);
printf("waiting interval:%d\n", conf->interval_);
printf("deamon log:%s\n", conf->daemon_log_.c_str());
printf("log level:%s\n", conf->level_.c_str());
printf("pid file:%s\n", conf->pid_file_.c_str());
printf("remove log file: %s\n", conf->rm_.c_str());
printf("###########################################\n");
return;
}
int ReadLines(Capture & capture, int lines, char * block, int max_size) {
int used = 0;
while (lines) {
int unused = max_size - used;
int cmd_size = capture.EncodeCmd(block + used, unused);
if (0 >= cmd_size) {
break;
}
used += cmd_size;
unused = max_size - used;
int size = capture.GetLine(block + used, unused);
if (0 < size) {
used += size;
unused = max_size - used;
lines--;
} else {
used -= cmd_size;
break;
}
}
return used;
}
int PushToELS(ELS & els, const string & data) {
return els.PushDocs(data);
}
int RetryPush(ELS & els, const string & data, int times, int interval) {
while (times) {
if (0 == PushToELS(els, data)) {
return 0;
}
--times;
LOG_WARN("retry push to els times " << times);
::sleep(interval);
}
return -1;
}
void LogToErrDoc(const string & log_home, const string & json) {
uint now = ::time(NULL);
::srand(now);
int random = ::rand()%1000;
char file[1024] = {0};
::snprintf(file, sizeof(file) - 1, ".written_error_%u_%d.json", now, random);
const string path = log_home + "/" + file;
int result = ::access(path.c_str(), F_OK);
if (0 == result) {
LOG_WARN("agent log to err doc file name is exists");
}
ofstream os(path.c_str());
if (os.is_open()) {
os << json;
os.flush();
os.close();
}
}
int main(int argc, char ** argv) {
if (1 >= argc) {
Help(argv);
::_exit(0);
}
AppConfig conf;
GetParam(&conf, argc, argv);
int block_size = conf.lines_*conf.line_size_;
FileHandle * logger = FileHandle::Instance(conf.daemon_log_, FileHandle::GetLevel(conf.level_));
if (NULL == logger) {
printf("log2esd initial log failed");
return -1;
}
LOG_DEBUG("log2esd initial log successed");
if (conf.pid_file_.length()) {
if (0 != Daemon::Daemonize(1, 1, false, conf.pid_file_.c_str())) {
printf("log2esd daemonize failed");
::_exit(-1);
}
}
LOG_DEBUG("log2esd daemonize successed");
vector<char> mem(block_size);
char * block = &mem.front();
bool rm = true;
if (0 == ::strncasecmp("no", conf.rm_.c_str(), 2)) {
rm = false;
}
Capture capture(conf.log_home_, conf.written_file_, rm);
LOG_DEBUG("log2esd initial capture successed");
capture.FindLogs();
LOG_DEBUG("log2esd search log files successed");
ELS els(conf.host_);
LOG_DEBUG("log2esd initial els successed");
while (true) {
int size = 0;
if (0 >= (size = ReadLines(capture, conf.lines_, block, block_size))) {
::sleep(conf.interval_);
continue;
}
block[size] = 0x00;
if (5 > conf.lines_) {
LOG_DEBUG("send to els:" << block);
}
int result = PushToELS(els, block);
if (0 == result) {
capture.Flush();
} else if (ERR_ELS_PUSH_DOC_NO_RESPONSE == result) {
if (0 != RetryPush(els, block, 3*600 , 2)) {
LogToErrDoc(conf.log_home_, block);
}
} else {
LOG_WARN("log to els failed data size:" << size);
LogToErrDoc(conf.log_home_, block);
::sleep(60);
}
}
vector<char>().swap(mem);
delete logger;
return 0;
}
|
/* ==================================================================================================
# Copyright 2014 vpon, Inc.
# --------------------------------------------------------------------------------------------------
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this work except in compliance with the License.
# You may obtain a copy of the License in the LICENSE file, or 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 <unistd.h>
#include <stdio.h>
#include <string>
#include <vector>
#include <fstream>
#include "producer/capture.h"
#include "agent/els.h"
#include "public/daemonize.h"
#include "err/err.h"
#include "log/log.h"
using std::string;
using std::vector;
using std::ofstream;
using log2esd::producer::Capture;
using log2esd::agent::ELS;
using log2esd::pub::Daemon;
using log2esd::log::FileHandle;
using log2esd::ERR_ELS_PUSH_DOC_NO_RESPONSE;
struct AppConfig {
string host_;
string log_home_;
string level_;
string daemon_log_;
string pid_file_;
string written_file_;
string rm_;
int lines_;
int line_size_;
int interval_;
AppConfig() : host_("localhost:9200"), log_home_("./log"), level_("INFO"), daemon_log_("/data/logs/log2esd/"), pid_file_(""), written_file_(".written_file.txt"), rm_("yes"), lines_(2), line_size_(2048), interval_(10) {}
};
void Help(char ** argv) {
printf("##########################################\n\n");
printf("Usage: %s -p <file.ini>"
"\n"
"Options:\n"
"-h <192.168.0.1:9200> els service (default: localhost:9200)\n"
"-s <app_logs> directory of app's logs (default: ./log)\n"
"-n <lines> lines of read once (default: 2)\n"
"-b <line_size> size of line (default: 2048)\n"
"-i <interval> waiting interval (default: 10)\n"
"-w <daemon log> directory of daemon logs (default: /data/logs/log2esd)\n"
"-l <level> level of daemon logs (default: INFO)\n"
"-r <yes/no> remove log file after send all datas (default yes)\n"
"-d <pid_file> daemonize log2esd\n"
"-H Show this help\n"
"\n",
argv[0]
);
printf("##########################################\n\n");
}
void GetParam(AppConfig * conf, int argc, char ** argv) {
char opt;
while (-1 != (opt = ::getopt(argc, argv, "h:s:d:n:b:i:w:l:r:H"))) {
switch (opt) {
case 'h':
if (NULL != optarg) {
conf->host_ = optarg;
}
break;
case 's':
if (NULL != optarg) {
conf->log_home_ = optarg;
}
break;
case 'd':
if (NULL != optarg) {
conf->pid_file_ = optarg;
}
break;
case 'n':
if (NULL != optarg) {
conf->lines_ = ::atoi(optarg);
}
break;
case 'b':
if (NULL != optarg) {
conf->line_size_ = ::atoi(optarg);
}
break;
case 'i':
if (NULL != optarg) {
conf->interval_ = ::atoi(optarg);
}
break;
case 'w':
if (NULL != optarg) {
conf->daemon_log_ = optarg;
}
break;
case 'l':
if (NULL != optarg) {
conf->level_ = optarg;
}
break;
case 'r':
if (NULL != optarg) {
conf->rm_ = optarg;
}
break;
case 'H':
default:
Help(argv);
::_exit(0);
break;
}
}
printf("###########################################\n");
printf("host:%s\n", conf->host_.c_str());
printf("log home:%s\n", conf->log_home_.c_str());
printf("read lines:%d\n", conf->lines_);
printf("line size:%d\n", conf->line_size_);
printf("waiting interval:%d\n", conf->interval_);
printf("deamon log:%s\n", conf->daemon_log_.c_str());
printf("log level:%s\n", conf->level_.c_str());
printf("pid file:%s\n", conf->pid_file_.c_str());
printf("remove log file: %s\n", conf->rm_.c_str());
printf("###########################################\n");
return;
}
int ReadLines(Capture & capture, int lines, char * block, int max_size) {
int used = 0;
while (lines) {
int unused = max_size - used;
int cmd_size = capture.EncodeCmd(block + used, unused);
if (0 >= cmd_size) {
break;
}
used += cmd_size;
unused = max_size - used;
int size = capture.GetLine(block + used, unused);
if (0 < size) {
used += size;
unused = max_size - used;
lines--;
} else {
used -= cmd_size;
break;
}
}
return used;
}
int PushToELS(ELS & els, const string & data) {
return els.PushDocs(data);
}
int RetryPush(ELS & els, const string & data, int times, int interval) {
while (times) {
if (0 == PushToELS(els, data)) {
return 0;
}
--times;
LOG_WARN("retry push to els times " << times);
::sleep(interval);
}
return -1;
}
void LogToErrDoc(const string & log_home, const string & json) {
uint now = ::time(NULL);
::srand(now);
int random = ::rand()%1000;
char file[1024] = {0};
::snprintf(file, sizeof(file) - 1, ".written_error_%u_%d.json", now, random);
const string path = log_home + "/" + file;
int result = ::access(path.c_str(), F_OK);
if (0 == result) {
LOG_WARN("agent log to err doc file name is exists");
}
ofstream os(path.c_str());
if (os.is_open()) {
os << json;
os.flush();
os.close();
}
}
int main(int argc, char ** argv) {
if (1 >= argc) {
Help(argv);
::_exit(0);
}
AppConfig conf;
GetParam(&conf, argc, argv);
int block_size = conf.lines_*conf.line_size_;
FileHandle * logger = FileHandle::Instance(conf.daemon_log_, FileHandle::GetLevel(conf.level_));
if (NULL == logger) {
printf("log2esd initial log failed");
return -1;
}
LOG_DEBUG("log2esd initial log successed");
if (conf.pid_file_.length()) {
if (0 != Daemon::Daemonize(1, 1, false, conf.pid_file_.c_str())) {
printf("log2esd daemonize failed");
::_exit(-1);
}
}
LOG_DEBUG("log2esd daemonize successed");
vector<char> mem(block_size);
char * block = &mem.front();
bool rm = true;
if (0 == ::strncasecmp("no", conf.rm_.c_str(), 2)) {
rm = false;
}
Capture capture(conf.log_home_, conf.written_file_, rm);
LOG_DEBUG("log2esd initial capture successed");
capture.FindLogs();
LOG_DEBUG("log2esd search log files successed");
ELS els(conf.host_);
LOG_DEBUG("log2esd initial els successed");
while (true) {
int size = 0;
if (0 >= (size = ReadLines(capture, conf.lines_, block, block_size))) {
::sleep(conf.interval_);
continue;
}
block[size] = 0x00;
if (5 > conf.lines_) {
LOG_DEBUG("send to els:" << block);
}
int result = PushToELS(els, block);
if (0 == result) {
capture.Flush();
} else if (ERR_ELS_PUSH_DOC_NO_RESPONSE == result) {
if (0 != RetryPush(els, block, 3*600 , 2)) {
LogToErrDoc(conf.log_home_, block);
}
} else {
LOG_WARN("log to els failed data size:" << size);
LogToErrDoc(conf.log_home_, block);
::sleep(60);
}
}
vector<char>().swap(mem);
delete logger;
return 0;
}
|
modify help info
|
modify help info
|
C++
|
apache-2.0
|
vpon/log2esd,vpon/log2esd
|
d2b5084d972d3742e725d6d87d0ece9ea4e5ae9e
|
gm/dftext.cpp
|
gm/dftext.cpp
|
/*
* Copyright 2011 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "Resources.h"
#include "SkCanvas.h"
#include "SkStream.h"
#include "SkSurface.h"
#include "SkTo.h"
#include "SkTypeface.h"
#include "gm.h"
#include "sk_tool_utils.h"
class DFTextGM : public skiagm::GM {
public:
DFTextGM() {
this->setBGColor(0xFFFFFFFF);
}
protected:
void onOnceBeforeDraw() override {
fEmojiTypeface = sk_tool_utils::emoji_typeface();
fEmojiText = sk_tool_utils::emoji_sample_text();
}
SkString onShortName() override {
SkString name("dftext");
name.append(sk_tool_utils::platform_font_manager());
return name;
}
SkISize onISize() override {
return SkISize::Make(1024, 768);
}
virtual void onDraw(SkCanvas* inputCanvas) override {
SkScalar textSizes[] = { 9.0f, 9.0f*2.0f, 9.0f*5.0f, 9.0f*2.0f*5.0f };
SkScalar scales[] = { 2.0f*5.0f, 5.0f, 2.0f, 1.0f };
// set up offscreen rendering with distance field text
GrContext* ctx = inputCanvas->getGrContext();
SkISize size = onISize();
SkImageInfo info = SkImageInfo::MakeN32(size.width(), size.height(), kPremul_SkAlphaType,
inputCanvas->imageInfo().refColorSpace());
SkSurfaceProps props(SkSurfaceProps::kUseDeviceIndependentFonts_Flag,
SkSurfaceProps::kLegacyFontHost_InitType);
auto surface(SkSurface::MakeRenderTarget(ctx, SkBudgeted::kNo, info, 0, &props));
SkCanvas* canvas = surface ? surface->getCanvas() : inputCanvas;
// init our new canvas with the old canvas's matrix
canvas->setMatrix(inputCanvas->getTotalMatrix());
// apply global scale to test glyph positioning
canvas->scale(1.05f, 1.05f);
canvas->clear(0xffffffff);
SkPaint paint;
paint.setAntiAlias(true);
paint.setSubpixelText(true);
sk_tool_utils::set_portable_typeface(&paint, "serif");
const char* text = "Hamburgefons";
const size_t textLen = strlen(text);
// check scaling up
SkScalar x = SkIntToScalar(0);
SkScalar y = SkIntToScalar(78);
for (size_t i = 0; i < SK_ARRAY_COUNT(textSizes); ++i) {
SkAutoCanvasRestore acr(canvas, true);
canvas->translate(x, y);
canvas->scale(scales[i], scales[i]);
paint.setTextSize(textSizes[i]);
canvas->drawText(text, textLen, 0, 0, paint);
y += paint.getFontMetrics(nullptr)*scales[i];
}
// check rotation
for (size_t i = 0; i < 5; ++i) {
SkScalar rotX = SkIntToScalar(10);
SkScalar rotY = y;
SkAutoCanvasRestore acr(canvas, true);
canvas->translate(SkIntToScalar(10 + i * 200), -80);
canvas->rotate(SkIntToScalar(i * 5), rotX, rotY);
for (int ps = 6; ps <= 32; ps += 3) {
paint.setTextSize(SkIntToScalar(ps));
canvas->drawText(text, textLen, rotX, rotY, paint);
rotY += paint.getFontMetrics(nullptr);
}
}
// check scaling down
paint.setLCDRenderText(true);
x = SkIntToScalar(680);
y = SkIntToScalar(20);
size_t arraySize = SK_ARRAY_COUNT(textSizes);
for (size_t i = 0; i < arraySize; ++i) {
SkAutoCanvasRestore acr(canvas, true);
canvas->translate(x, y);
SkScalar scaleFactor = SkScalarInvert(scales[arraySize - i - 1]);
canvas->scale(scaleFactor, scaleFactor);
paint.setTextSize(textSizes[i]);
canvas->drawText(text, textLen, 0, 0, paint);
y += paint.getFontMetrics(nullptr)*scaleFactor;
}
// check pos text
{
SkAutoCanvasRestore acr(canvas, true);
canvas->scale(2.0f, 2.0f);
SkAutoTArray<SkPoint> pos(SkToInt(textLen));
SkAutoTArray<SkScalar> widths(SkToInt(textLen));
paint.setTextSize(textSizes[0]);
paint.getTextWidths(text, textLen, &widths[0]);
SkScalar x = SkIntToScalar(340);
SkScalar y = SkIntToScalar(75);
for (unsigned int i = 0; i < textLen; ++i) {
pos[i].set(x, y);
x += widths[i];
}
canvas->drawPosText(text, textLen, &pos[0], paint);
}
// check gamma-corrected blending
const SkColor fg[] = {
0xFFFFFFFF,
0xFFFFFF00, 0xFFFF00FF, 0xFF00FFFF,
0xFFFF0000, 0xFF00FF00, 0xFF0000FF,
0xFF000000,
};
paint.setColor(0xFFF7F3F7);
SkRect r = SkRect::MakeLTRB(670, 215, 820, 397);
canvas->drawRect(r, paint);
x = SkIntToScalar(680);
y = SkIntToScalar(235);
paint.setTextSize(SkIntToScalar(19));
for (size_t i = 0; i < SK_ARRAY_COUNT(fg); ++i) {
paint.setColor(fg[i]);
canvas->drawText(text, textLen, x, y, paint);
y += paint.getFontMetrics(nullptr);
}
paint.setColor(0xFF181C18);
r = SkRect::MakeLTRB(820, 215, 970, 397);
canvas->drawRect(r, paint);
x = SkIntToScalar(830);
y = SkIntToScalar(235);
paint.setTextSize(SkIntToScalar(19));
for (size_t i = 0; i < SK_ARRAY_COUNT(fg); ++i) {
paint.setColor(fg[i]);
canvas->drawText(text, textLen, x, y, paint);
y += paint.getFontMetrics(nullptr);
}
// check skew
{
paint.setLCDRenderText(false);
SkAutoCanvasRestore acr(canvas, true);
canvas->skew(0.0f, 0.151515f);
paint.setTextSize(SkIntToScalar(32));
canvas->drawText(text, textLen, 745, 70, paint);
}
{
paint.setLCDRenderText(true);
SkAutoCanvasRestore acr(canvas, true);
canvas->skew(0.5f, 0.0f);
paint.setTextSize(SkIntToScalar(32));
canvas->drawText(text, textLen, 580, 125, paint);
}
// check perspective
{
paint.setLCDRenderText(false);
SkAutoCanvasRestore acr(canvas, true);
SkMatrix persp;
persp.setAll(0.9839f, 0, 0,
0.2246f, 0.6829f, 0,
0.0002352f, -0.0003844f, 1);
canvas->concat(persp);
canvas->translate(1100, -295);
canvas->scale(375, 375);
paint.setTextSize(0.1f);
canvas->drawText(text, textLen, 0, 0, paint);
}
{
paint.setSubpixelText(false);
paint.setAntiAlias(false);
SkAutoCanvasRestore acr(canvas, true);
SkMatrix persp;
persp.setAll(0.9839f, 0, 0,
0.2246f, 0.6829f, 0,
0.0002352f, -0.0003844f, 1);
canvas->concat(persp);
canvas->translate(1075, -245);
canvas->scale(375, 375);
paint.setTextSize(0.1f);
canvas->drawText(text, textLen, 0, 0, paint);
}
// check color emoji
if (fEmojiTypeface) {
SkPaint emojiPaint;
emojiPaint.setSubpixelText(true);
emojiPaint.setAntiAlias(true);
emojiPaint.setTypeface(fEmojiTypeface);
emojiPaint.setTextSize(SkIntToScalar(19));
canvas->drawString(fEmojiText, 670, 90, emojiPaint);
}
// render offscreen buffer
if (surface) {
SkAutoCanvasRestore acr(inputCanvas, true);
// since we prepended this matrix already, we blit using identity
inputCanvas->resetMatrix();
inputCanvas->drawImage(surface->makeImageSnapshot().get(), 0, 0, nullptr);
}
}
private:
sk_sp<SkTypeface> fEmojiTypeface;
const char* fEmojiText;
typedef skiagm::GM INHERITED;
};
DEF_GM(return new DFTextGM;)
|
/*
* Copyright 2011 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "Resources.h"
#include "SkCanvas.h"
#include "SkStream.h"
#include "SkSurface.h"
#include "SkTo.h"
#include "SkTypeface.h"
#include "gm.h"
#include "sk_tool_utils.h"
class DFTextGM : public skiagm::GM {
public:
DFTextGM() {
this->setBGColor(0xFFFFFFFF);
}
protected:
void onOnceBeforeDraw() override {
fEmojiTypeface = sk_tool_utils::emoji_typeface();
fEmojiText = sk_tool_utils::emoji_sample_text();
}
SkString onShortName() override {
SkString name("dftext");
name.append(sk_tool_utils::platform_font_manager());
return name;
}
SkISize onISize() override {
return SkISize::Make(1024, 768);
}
virtual void onDraw(SkCanvas* inputCanvas) override {
SkScalar textSizes[] = { 9.0f, 9.0f*2.0f, 9.0f*5.0f, 9.0f*2.0f*5.0f };
SkScalar scales[] = { 2.0f*5.0f, 5.0f, 2.0f, 1.0f };
// set up offscreen rendering with distance field text
GrContext* ctx = inputCanvas->getGrContext();
SkISize size = onISize();
SkImageInfo info = SkImageInfo::MakeN32(size.width(), size.height(), kPremul_SkAlphaType,
inputCanvas->imageInfo().refColorSpace());
SkSurfaceProps props(SkSurfaceProps::kUseDeviceIndependentFonts_Flag,
SkSurfaceProps::kLegacyFontHost_InitType);
auto surface(SkSurface::MakeRenderTarget(ctx, SkBudgeted::kNo, info, 0, &props));
SkCanvas* canvas = surface ? surface->getCanvas() : inputCanvas;
// init our new canvas with the old canvas's matrix
canvas->setMatrix(inputCanvas->getTotalMatrix());
// apply global scale to test glyph positioning
canvas->scale(1.05f, 1.05f);
canvas->clear(0xffffffff);
SkPaint paint;
paint.setAntiAlias(true);
paint.setSubpixelText(true);
sk_tool_utils::set_portable_typeface(&paint, "serif");
const char* text = "Hamburgefons";
const size_t textLen = strlen(text);
// check scaling up
SkScalar x = SkIntToScalar(0);
SkScalar y = SkIntToScalar(78);
for (size_t i = 0; i < SK_ARRAY_COUNT(textSizes); ++i) {
SkAutoCanvasRestore acr(canvas, true);
canvas->translate(x, y);
canvas->scale(scales[i], scales[i]);
paint.setTextSize(textSizes[i]);
canvas->drawText(text, textLen, 0, 0, paint);
y += paint.getFontMetrics(nullptr)*scales[i];
}
// check rotation
for (size_t i = 0; i < 5; ++i) {
SkScalar rotX = SkIntToScalar(10);
SkScalar rotY = y;
SkAutoCanvasRestore acr(canvas, true);
canvas->translate(SkIntToScalar(10 + i * 200), -80);
canvas->rotate(SkIntToScalar(i * 5), rotX, rotY);
for (int ps = 6; ps <= 32; ps += 3) {
paint.setTextSize(SkIntToScalar(ps));
canvas->drawText(text, textLen, rotX, rotY, paint);
rotY += paint.getFontMetrics(nullptr);
}
}
// check scaling down
paint.setLCDRenderText(true);
x = SkIntToScalar(680);
y = SkIntToScalar(20);
size_t arraySize = SK_ARRAY_COUNT(textSizes);
for (size_t i = 0; i < arraySize; ++i) {
SkAutoCanvasRestore acr(canvas, true);
canvas->translate(x, y);
SkScalar scaleFactor = SkScalarInvert(scales[arraySize - i - 1]);
canvas->scale(scaleFactor, scaleFactor);
paint.setTextSize(textSizes[i]);
canvas->drawText(text, textLen, 0, 0, paint);
y += paint.getFontMetrics(nullptr)*scaleFactor;
}
// check pos text
{
SkAutoCanvasRestore acr(canvas, true);
canvas->scale(2.0f, 2.0f);
SkAutoTArray<SkPoint> pos(SkToInt(textLen));
SkAutoTArray<SkScalar> widths(SkToInt(textLen));
paint.setTextSize(textSizes[0]);
paint.getTextWidths(text, textLen, &widths[0]);
SkScalar x = SkIntToScalar(340);
SkScalar y = SkIntToScalar(75);
for (unsigned int i = 0; i < textLen; ++i) {
pos[i].set(x, y);
x += widths[i];
}
canvas->drawPosText(text, textLen, &pos[0], paint);
}
// check gamma-corrected blending
const SkColor fg[] = {
0xFFFFFFFF,
0xFFFFFF00, 0xFFFF00FF, 0xFF00FFFF,
0xFFFF0000, 0xFF00FF00, 0xFF0000FF,
0xFF000000,
};
paint.setColor(0xFFF7F3F7);
SkRect r = SkRect::MakeLTRB(670, 215, 820, 397);
canvas->drawRect(r, paint);
x = SkIntToScalar(680);
y = SkIntToScalar(235);
paint.setTextSize(SkIntToScalar(19));
for (size_t i = 0; i < SK_ARRAY_COUNT(fg); ++i) {
paint.setColor(fg[i]);
canvas->drawText(text, textLen, x, y, paint);
y += paint.getFontMetrics(nullptr);
}
paint.setColor(0xFF181C18);
r = SkRect::MakeLTRB(820, 215, 970, 397);
canvas->drawRect(r, paint);
x = SkIntToScalar(830);
y = SkIntToScalar(235);
paint.setTextSize(SkIntToScalar(19));
for (size_t i = 0; i < SK_ARRAY_COUNT(fg); ++i) {
paint.setColor(fg[i]);
canvas->drawText(text, textLen, x, y, paint);
y += paint.getFontMetrics(nullptr);
}
// check skew
{
paint.setLCDRenderText(false);
SkAutoCanvasRestore acr(canvas, true);
canvas->skew(0.0f, 0.151515f);
paint.setTextSize(SkIntToScalar(32));
canvas->drawText(text, textLen, 745, 70, paint);
}
{
paint.setLCDRenderText(true);
SkAutoCanvasRestore acr(canvas, true);
canvas->skew(0.5f, 0.0f);
paint.setTextSize(SkIntToScalar(32));
canvas->drawText(text, textLen, 580, 125, paint);
}
// check perspective
{
paint.setLCDRenderText(false);
SkAutoCanvasRestore acr(canvas, true);
SkMatrix persp;
persp.setAll(0.9839f, 0, 0,
0.2246f, 0.6829f, 0,
0.0002352f, -0.0003844f, 1);
canvas->concat(persp);
canvas->translate(1100, -295);
paint.setTextSize(37.5f);
canvas->drawText(text, textLen, 0, 0, paint);
}
{
paint.setSubpixelText(false);
paint.setAntiAlias(false);
SkAutoCanvasRestore acr(canvas, true);
SkMatrix persp;
persp.setAll(0.9839f, 0, 0,
0.2246f, 0.6829f, 0,
0.0002352f, -0.0003844f, 1);
canvas->concat(persp);
canvas->translate(1075, -245);
canvas->scale(375, 375);
paint.setTextSize(0.1f);
canvas->drawText(text, textLen, 0, 0, paint);
}
// check color emoji
if (fEmojiTypeface) {
SkPaint emojiPaint;
emojiPaint.setSubpixelText(true);
emojiPaint.setAntiAlias(true);
emojiPaint.setTypeface(fEmojiTypeface);
emojiPaint.setTextSize(SkIntToScalar(19));
canvas->drawString(fEmojiText, 670, 90, emojiPaint);
}
// render offscreen buffer
if (surface) {
SkAutoCanvasRestore acr(inputCanvas, true);
// since we prepended this matrix already, we blit using identity
inputCanvas->resetMatrix();
inputCanvas->drawImage(surface->makeImageSnapshot().get(), 0, 0, nullptr);
}
}
private:
sk_sp<SkTypeface> fEmojiTypeface;
const char* fEmojiText;
typedef skiagm::GM INHERITED;
};
DEF_GM(return new DFTextGM;)
|
Change scaling of antialiased perspective text in dftext to help glitches.
|
Change scaling of antialiased perspective text in dftext to help glitches.
Bug: skia:
Change-Id: I499c04949ddd957404cda6b34ab0073b539f6dd3
Reviewed-on: https://skia-review.googlesource.com/133582
Reviewed-by: Greg Daniel <[email protected]>
Commit-Queue: Jim Van Verth <[email protected]>
|
C++
|
bsd-3-clause
|
aosp-mirror/platform_external_skia,google/skia,Hikari-no-Tenshi/android_external_skia,aosp-mirror/platform_external_skia,HalCanary/skia-hc,Hikari-no-Tenshi/android_external_skia,aosp-mirror/platform_external_skia,rubenvb/skia,google/skia,rubenvb/skia,HalCanary/skia-hc,Hikari-no-Tenshi/android_external_skia,aosp-mirror/platform_external_skia,google/skia,rubenvb/skia,rubenvb/skia,aosp-mirror/platform_external_skia,google/skia,HalCanary/skia-hc,HalCanary/skia-hc,rubenvb/skia,HalCanary/skia-hc,Hikari-no-Tenshi/android_external_skia,google/skia,aosp-mirror/platform_external_skia,HalCanary/skia-hc,Hikari-no-Tenshi/android_external_skia,rubenvb/skia,HalCanary/skia-hc,Hikari-no-Tenshi/android_external_skia,Hikari-no-Tenshi/android_external_skia,aosp-mirror/platform_external_skia,google/skia,Hikari-no-Tenshi/android_external_skia,google/skia,google/skia,rubenvb/skia,rubenvb/skia,rubenvb/skia,HalCanary/skia-hc,HalCanary/skia-hc,aosp-mirror/platform_external_skia,aosp-mirror/platform_external_skia,rubenvb/skia,google/skia,google/skia,aosp-mirror/platform_external_skia,HalCanary/skia-hc
|
2522ad1a9c665485a2397fe39987c880a4947657
|
src/logger.cpp
|
src/logger.cpp
|
#include "blackhole/logger.hpp"
#include <atomic>
namespace blackhole {
struct logger_t::inner_t {
filter_type filter;
std::vector<std::unique_ptr<handler_t>> handlers;
inner_t():
filter([](const record_t&) -> bool { return true; })
{}
};
logger_t::logger_t(std::vector<std::unique_ptr<handler_t>> handlers):
inner(std::make_shared<inner_t>())
{
inner->handlers = std::move(handlers);
}
logger_t::~logger_t() {}
auto
logger_t::filter(filter_type fn) -> void {
auto inner = std::atomic_load(&this->inner);
// TODO: Here the RC! Use RCU for function to avoid this.
inner->filter = std::move(fn);
std::atomic_store(&this->inner, std::move(inner));
}
void
logger_t::info(string_view message) {
const auto inner = std::atomic_load(&this->inner);
record_t record;
if (inner->filter(record)) {
for (auto& handler : inner->handlers) {
handler->execute(record);
}
}
}
void
logger_t::info(string_view message, const attributes_t& attributes) {
const auto inner = std::atomic_load(&this->inner);
record_t record;
for (auto& handler : inner->handlers) {
handler->execute(record);
}
}
} // namespace blackhole
|
#include "blackhole/logger.hpp"
#include <atomic>
namespace blackhole {
struct logger_t::inner_t {
filter_type filter;
const std::vector<std::unique_ptr<handler_t>> handlers;
inner_t(std::vector<std::unique_ptr<handler_t>> handlers):
filter([](const record_t&) -> bool { return true; }),
handlers(std::move(handlers))
{}
};
logger_t::logger_t(std::vector<std::unique_ptr<handler_t>> handlers):
inner(std::make_shared<inner_t>(std::move(handlers)))
{}
logger_t::~logger_t() {}
auto
logger_t::filter(filter_type fn) -> void {
auto inner = std::atomic_load(&this->inner);
// TODO: Here the RC! Use RCU for function to avoid this.
inner->filter = std::move(fn);
std::atomic_store(&this->inner, std::move(inner));
}
void
logger_t::info(string_view message) {
const auto inner = std::atomic_load(&this->inner);
record_t record;
if (inner->filter(record)) {
for (auto& handler : inner->handlers) {
handler->execute(record);
}
}
}
void
logger_t::info(string_view message, const attributes_t& attributes) {
const auto inner = std::atomic_load(&this->inner);
record_t record;
for (auto& handler : inner->handlers) {
handler->execute(record);
}
}
} // namespace blackhole
|
make handlers immutable
|
chore(logger): make handlers immutable
To change handlers set for the given logger the user must create
another logger and perform assignment.
|
C++
|
mit
|
noxiouz/blackhole,3Hren/blackhole
|
c72049f4c54fc70f4014b0ea51db05c0da335da4
|
src/matrix.hpp
|
src/matrix.hpp
|
#ifndef matrix_hpp
#define matrix_hpp
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <stdint.h>
#include "util.hpp"
#include "vector.hpp"
#ifndef debug
#define debug(X) X
#endif
#define MATRIX_FOREACH(I, J) \
for(auto I = 0; I < this->h; I++) \
for(auto J = 0; J < this->h; J++)
#define MATRIX_SIZE_MATCH(M) \
((M)->w != this->w || (M)->h != this->h)
#define MATRIX_SIZE_SHOULD_BE_SAME(M) \
if(MATRIX_SIZE_MATCH((M))) \
fatal("matrix size mismatch");
#define MATRIX_WIDTH_VECTOR_SIZE_MATCH_P(V) \
(this->w == V->size)
using namespace std;
template<class T>
class Matrix
{
private:
T *data;
void allocate_buffer() {
if(this->h == 0 || this->w == 0)
fatal("neither `h` or `w` can be zero");
this->data = new T[this->h * this->w];
//debug({ fprintf(stderr, "[+] Matrix allocaed at %p, Buffer allocated at %p\n", this, this->data); })
}
void free_buffer() {
if(this->data == NULL)
fatal("buffer is NULL, can not be freed");
debug({ fprintf(stderr, "[+] Buffer freed %p\n", this->data); })
delete [] (char *)this->data;
this->data = NULL;
}
public:
const uint32_t h, w;
// constructor and destructor
Matrix(uint32_t h, uint32_t w) : h(h), w(w)
{
this->allocate_buffer();
this->zero();
}
Matrix(Matrix& m) : h(m.h), w(m.w)
{
this->allocate_buffer();
this->copy_from(&m);
}
Matrix(Matrix *m) : h(m->h), w(m->w)
{
this->allocate_buffer();
this->copy_from(m);
}
~Matrix() {
this->free_buffer();
}
void copy_from(Matrix *m) {
MATRIX_SIZE_SHOULD_BE_SAME(m);
memcpy(&this->cell(0, 0), &m->cell(0, 0), sizeof(T) * this->w * this->h);
}
// data accessor
T& operator() (int x, int y) {
return this->data[x * this->h + y];
}
T& cell(int x, int y) {
return this->data[x * this->h + y];
}
// data manipulation
Matrix& add(Matrix &m) {
MATRIX_SIZE_SHOULD_BE_SAME(&m);
MATRIX_FOREACH(x, y) {
this->cell(x, y) += m(x, y);
}
return *this;
}
Matrix& sub(Matrix &m) {
MATRIX_SIZE_SHOULD_BE_SAME(&m);
MATRIX_FOREACH(x, y) {
this->cell(x, y) -= m(x, y);
}
return &this;
}
Matrix& mul(Matrix *m) {
if(this->w != m->h)
fatal("matrix size mismatch (mul)");
// result height, result width
auto r_h = this->h, r_w = m->w, len = this->w;
Matrix result = Matrix(r_h, r_w);
for(auto x = 0; x < r_h; x++) {
for(auto y = 0; y < r_w; y++) {
T sum = 0;
for(auto j = 0; j < len; j++)
sum += this->cell(x, j) * m->cell(j, y);
result(x, y) = sum;
}
}
return result;
}
Matrix& mul(T v) {
MATRIX_FOREACH(x, y) {
this->cell(x, y) *= v;
}
return *this;
}
Matrix& div(T v) {
MATRIX_FOREACH(x, y) {
this->cell(x, y) /= v;
}
return *this;
}
// operator overloading, all size check is perfrom in named functions
Matrix& operator= (const Matrix& m) {
return *this->copy_from(&m);
}
Matrix& operator+= (Matrix& m) { return *this->add(m); }
Matrix& operator+= (Matrix *m) { return *this->add(m); }
Matrix& operator-= (Matrix& m) { return *this->sub(m); }
Matrix& operator-= (Matrix *m) { return *this->sub(m); }
// these operator will return new Matrix instance
Matrix& operator+ (Matrix& m) {
Matrix result(this);
return result.add(m);
}
void fill(T value) {
MATRIX_FOREACH(x, y) {
this->cell(x, y) = value;
}
}
void zero() {
MATRIX_FOREACH(x, y) {
this->cell(x, y) = 0;
}
}
void one() {
MATRIX_FOREACH(x, y) {
this->cell(x, y) = x == y ? 1 : 0;
}
}
string str() {
stringstream buffer;
buffer << "Matrix(" << h << ", " << w << ") {\n";
for(auto x = 0; x < this->h; x++) {
if(x) buffer << ",\n";
buffer << " (";
for(auto y = 0; y < this->w; y++) {
if(y) buffer << ", ";
buffer << this->cell(x, y);
}
buffer << ")";
}
buffer << "\n}";
return buffer.str();
}
//matrix multiply vector
myVecD * mul(myVecD * v){
if(!MATRIX_WIDTH_VECTOR_SIZE_MATCH_P(v))
fatal("matrix's width != vector's length");
myVecD * result = new myVecD(this->h);
for (int index = 0; index < this->h; index++) {
(*result)[index] = 0.0;
}
for (int index = 0; index < this->h; index++) {
for (int indexa = 0; indexa < this->w; indexa ++) {
(*result)[index] += (this->cell(index,indexa) * (*v)[indexa]);
}
}
return result;
}
myVecD * mul(myVecD & v){
return this->mul(&v);
}
//TODO
static Matrix<double> * merge_by_vectors(int merge_type, int number, myVecD ** vectors){
if(number <= 0)
fatal("invalid number of vectors");
int size = vectors[0]->size;
for (int index = 0; index < number; index++) {
if(vectors[index]->size != size)
fatal("vectors with different dimension can't be merged to one matrix");
}
Matrix<double> * result;
int column, row;
switch(merge_type){
case AS_COLUMN:
column = number;
row = size;
result = new Matrix<double>(row, column);
for (int indexa = 0; indexa < column; indexa++) {
for (int indexb = 0; indexb < row; indexb++) {
(*result)(indexb, indexa) = 1.0;
}
}
break;
case AS_ROW:
break;
default:
fatal("invalid merge type");
}
return result;
}
};
#endif
|
#ifndef matrix_hpp
#define matrix_hpp
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <stdint.h>
#include "util.hpp"
#include "vector.hpp"
#define debug(X) X
#define MATRIX_FOREACH(I, J) \
for(auto I = 0; I < this->h; I++) \
for(auto J = 0; J < this->h; J++)
#define MATRIX_SIZE_MATCH(M) \
((M)->w != this->w || (M)->h != this->h)
#define MATRIX_SIZE_SHOULD_BE_SAME(M) \
if(MATRIX_SIZE_MATCH((M))) \
fatal("matrix size mismatch");
#define MATRIX_WIDTH_VECTOR_SIZE_MATCH_P(V) \
(this->w == V->size)
using namespace std;
template<class T>
class Matrix
{
private:
T *data;
void allocate_buffer() {
if(this->h == 0 || this->w == 0)
fatal("neither `h` or `w` can be zero");
this->data = new T[this->h * this->w];
//debug({ fprintf(stderr, "[+] Matrix allocaed at %p, Buffer allocated at %p\n", this, this->data); })
}
void free_buffer() {
if(this->data == NULL)
fatal("buffer is NULL, can not be freed");
debug({ fprintf(stderr, "[+] Buffer freed %p\n", this->data); })
delete [] (char *)this->data;
this->data = NULL;
}
public:
const uint32_t h, w;
// constructor and destructor
Matrix(uint32_t h, uint32_t w) : h(h), w(w)
{
this->allocate_buffer();
this->zero();
}
Matrix(Matrix& m) : h(m.h), w(m.w)
{
this->allocate_buffer();
this->copy_from(&m);
}
Matrix(Matrix *m) : h(m->h), w(m->w)
{
this->allocate_buffer();
this->copy_from(m);
}
~Matrix() {
this->free_buffer();
}
// data accessor
T& operator() (int x, int y) {
return this->data[x * this->h + y];
}
T& cell(int x, int y) {
return this->data[x * this->h + y];
}
// data manipulation
Matrix* copy_from(Matrix *m) {
MATRIX_SIZE_SHOULD_BE_SAME(m);
memcpy(&this->cell(0, 0), &m->cell(0, 0), sizeof(T) * this->w * this->h);
return this;
}
Matrix* add(Matrix *m) {
MATRIX_SIZE_SHOULD_BE_SAME(m);
MATRIX_FOREACH(x, y) {
this->cell(x, y) += m->cell(x, y);
}
return this;
}
Matrix* add(Matrix& m) {
return this->add(&m);
}
Matrix* sub(Matrix *m) {
MATRIX_SIZE_SHOULD_BE_SAME(m);
MATRIX_FOREACH(x, y) {
this->cell(x, y) -= m->cell(x, y);
}
return this;
}
Matrix* sub(Matrix& m) {
return this->sub(&m);
}
Matrix* mul(Matrix *m) {
if(this->w != m->h)
fatal("matrix size mismatch (mul)");
// result height, result width
auto r_h = this->h, r_w = m->w, len = this->w;
Matrix *result = new Matrix(r_h, r_w);
for(auto x = 0; x < r_h; x++) {
for(auto y = 0; y < r_w; y++) {
T sum = 0;
for(auto j = 0; j < len; j++)
sum += this->cell(x, j) * m->cell(j, y);
result->cell(x, y) = sum;
}
}
return result;
}
Matrix* mul(T v) {
MATRIX_FOREACH(x, y) {
this->cell(x, y) *= v;
}
return this;
}
Matrix* div(T v) {
MATRIX_FOREACH(x, y) {
this->cell(x, y) /= v;
}
return this;
}
// operator overloading, all size check is perfrom in named functions
Matrix* operator= (const Matrix& m) {
return this->copy_from(&m);
}
Matrix* operator+= (Matrix& m) { return this->add(m); }
Matrix* operator+= (Matrix *m) { return this->add(m); }
Matrix* operator-= (Matrix& m) { return this->sub(m); }
Matrix* operator-= (Matrix *m) { return this->sub(m); }
// these operator will return new Matrix instance
Matrix* operator+ (Matrix& m) {
Matrix *result = new Matrix(this);
result->add(m);
return result;
}
Matrix* fill(T value) {
MATRIX_FOREACH(x, y) {
this->cell(x, y) = value;
}
return this;
}
Matrix* zero() {
MATRIX_FOREACH(x, y) {
this->cell(x, y) = 0;
}
return this;
}
Matrix* one() {
MATRIX_FOREACH(x, y) {
this->cell(x, y) = x == y ? 1 : 0;
}
return this;
}
string str() {
stringstream buffer;
buffer << "Matrix(" << h << ", " << w << ") {\n";
for(auto x = 0; x < this->h; x++) {
if(x) buffer << ",\n";
buffer << " (";
for(auto y = 0; y < this->w; y++) {
if(y) buffer << ", ";
buffer << this->cell(x, y);
}
buffer << ")";
}
buffer << "\n}";
return buffer.str();
}
//matrix multiply vector
myVecD * mul(myVecD * v){
if(!MATRIX_WIDTH_VECTOR_SIZE_MATCH_P(v))
fatal("matrix's width != vector's length");
myVecD * result = new myVecD(this->h);
for (int index = 0; index < this->h; index++) {
(*result)[index] = 0.0;
}
for (int index = 0; index < this->h; index++) {
for (int indexa = 0; indexa < this->w; indexa ++) {
(*result)[index] += (this->cell(index,indexa) * (*v)[indexa]);
}
}
return result;
}
myVecD * mul(myVecD & v){
return this->mul(&v);
}
// static method
static Matrix* one(int h, int w) {
return (new Matrix(h, w))->one();
}
//TODO
static Matrix<double> * merge_by_vectors(int merge_type, int number, myVecD ** vectors){
if(number <= 0)
fatal("invalid number of vectors");
int size = vectors[0]->size;
for (int index = 0; index < number; index++) {
if(vectors[index]->size != size)
fatal("vectors with different dimension can't be merged to one matrix");
}
Matrix<double> * result;
int column, row;
switch(merge_type){
case AS_COLUMN:
column = number;
row = size;
result = new Matrix<double>(row, column);
for (int indexa = 0; indexa < column; indexa++) {
for (int indexb = 0; indexb < row; indexb++) {
(*result)(indexb, indexa) = 1.0;
}
}
break;
case AS_ROW:
break;
default:
fatal("invalid merge type");
}
return result;
}
};
#endif
|
Revert "New API, no pointer anymore"
|
Revert "New API, no pointer anymore"
This reverts commit 8ef0ec9009a1c721d31f322ae4009ba9480adcae.
|
C++
|
mit
|
Inndy/libabc
|
28bd67a3f914e411a228abe9222b8c23467ea333
|
src/certdb/CertDatabase.hxx
|
src/certdb/CertDatabase.hxx
|
/*
* author: Max Kellermann <[email protected]>
*/
#ifndef CERT_DATABASE_HXX
#define CERT_DATABASE_HXX
#include "pg/Connection.hxx"
#include "ssl/Unique.hxx"
#include <string>
typedef struct aes_key_st AES_KEY;
struct CertDatabaseConfig;
class CertDatabase {
const CertDatabaseConfig &config;
PgConnection conn;
public:
typedef unsigned id_t;
explicit CertDatabase(const CertDatabaseConfig &_config);
ConnStatusType GetStatus() const {
return conn.GetStatus();
}
gcc_pure
const char *GetErrorMessage() const {
return conn.GetErrorMessage();
}
bool CheckConnected();
void EnsureConnected();
gcc_pure
int GetSocket() const {
return conn.GetSocket();
}
void ConsumeInput() {
conn.ConsumeInput();
}
PgNotify GetNextNotify() {
return conn.GetNextNotify();
}
PgResult ListenModified();
PgResult NotifyModified();
gcc_pure
std::string GetCurrentTimestamp() {
const auto result = conn.Execute("SELECT CURRENT_TIMESTAMP");
return result.GetOnlyStringChecked();
}
gcc_pure
std::string GetLastModified() {
const auto result = conn.Execute("SELECT MAX(modified) FROM server_certificate");
return result.GetOnlyStringChecked();
}
bool BeginSerializable() {
return conn.BeginSerializable();
}
bool Commit() {
return conn.Commit();
}
void Migrate();
id_t GetIdByHandle(const char *handle);
void InsertServerCertificate(const char *handle,
const char *common_name,
const char *issuer_common_name,
const char *not_before,
const char *not_after,
X509 &cert, ConstBuffer<void> key,
const char *key_wrap_name);
/**
* @return true when new certificate has been inserted, false when an
* existing certificate has been updated
*/
bool LoadServerCertificate(const char *handle,
X509 &cert, EVP_PKEY &key,
const char *key_wrap_name,
AES_KEY *wrap_key);
/**
* Delete *.acme.invalid for alt_names of the given certificate.
*/
unsigned DeleteAcmeInvalidAlt(X509 &cert);
UniqueX509 GetServerCertificateByHandle(const char *handle);
UniqueX509 GetServerCertificate(const char *name);
/**
* Throws std:;runtime_error on error.
*
* @return a pair of certificate and key, or {nullptr, nullptr} if
* no matching certificate was found
*/
std::pair<UniqueX509, UniqueEVP_PKEY> GetServerCertificateKeyByHandle(const char *handle);
std::pair<UniqueX509, UniqueEVP_PKEY> GetServerCertificateKey(const char *name);
std::pair<UniqueX509, UniqueEVP_PKEY> GetServerCertificateKey(id_t id);
private:
PgResult InsertServerCertificate(const char *handle,
const char *common_name,
const char *issuer_common_name,
const char *not_before,
const char *not_after,
PgBinaryValue cert, PgBinaryValue key,
const char *key_wrap_name) {
return conn.ExecuteBinary("INSERT INTO server_certificate("
"handle, common_name, issuer_common_name, "
"not_before, not_after, "
"certificate_der, key_der, key_wrap_name) "
"VALUES($1, $2, $3, $4, $5, $6, $7, $8)"
" RETURNING id",
handle, common_name, issuer_common_name,
not_before, not_after,
cert, key, key_wrap_name);
}
PgResult UpdateServerCertificate(const char *handle,
const char *common_name,
const char *issuer_common_name,
const char *not_before,
const char *not_after,
PgBinaryValue cert, PgBinaryValue key,
const char *key_wrap_name) {
return conn.ExecuteBinary("UPDATE server_certificate SET "
"common_name=$1, "
"not_before=$2, not_after=$3, "
"certificate_der=$4, key_der=$5, "
"key_wrap_name=$6, "
"issuer_common_name=$7, "
"modified=CURRENT_TIMESTAMP, deleted=FALSE "
"WHERE handle=$8"
" RETURNING id",
common_name, not_before, not_after,
cert, key, key_wrap_name,
issuer_common_name, handle);
}
PgResult DeleteAltNames(const char *server_certificate_id) {
return conn.ExecuteParams("DELETE FROM server_certificate_alt_name"
" WHERE server_certificate_id=$1",
server_certificate_id);
}
PgResult InsertAltName(const char *server_certificate_id,
const char *name) {
return conn.ExecuteParams("INSERT INTO server_certificate_alt_name"
"(server_certificate_id, name)"
" VALUES($1, $2)",
server_certificate_id, name);
}
public:
PgResult DeleteServerCertificateByHandle(const char *handle) {
return conn.ExecuteParams(true,
"UPDATE server_certificate SET "
"modified=CURRENT_TIMESTAMP, deleted=TRUE "
"WHERE handle=$1 AND NOT deleted",
handle);
}
private:
template<typename T>
PgResult DeleteAcmeInvalidByNames(const T &names) {
return conn.ExecuteParams(true,
"UPDATE server_certificate SET "
"modified=CURRENT_TIMESTAMP, deleted=TRUE "
"WHERE NOT deleted AND common_name = ANY($1)"
" AND EXISTS("
"SELECT id FROM server_certificate_alt_name"
" WHERE server_certificate_id=server_certificate.id"
" AND name LIKE '%.acme.invalid')",
names);
}
PgResult FindServerCertificateByHandle(const char *handle) {
return conn.ExecuteParams(true,
"SELECT certificate_der "
"FROM server_certificate "
"WHERE NOT deleted AND handle=$1"
"LIMIT 1",
handle);
}
PgResult FindServerCertificateByName(const char *common_name) {
return conn.ExecuteParams(true,
"SELECT certificate_der "
"FROM server_certificate "
"WHERE NOT deleted AND "
"(common_name=$1 OR EXISTS("
"SELECT id FROM server_certificate_alt_name"
" WHERE server_certificate_id=server_certificate.id"
" AND name=$1))"
"ORDER BY"
/* prefer certificates which expire later */
" not_after DESC,"
/* prefer exact match in common_name: */
" common_name=$1 DESC "
"LIMIT 1",
common_name);
}
PgResult FindServerCertificateKeyByHandle(const char *handle) {
return conn.ExecuteParams(true,
"SELECT certificate_der, key_der, key_wrap_name "
"FROM server_certificate "
"WHERE handle=$1 AND NOT deleted "
"LIMIT 1",
handle);
}
PgResult FindServerCertificateKeyByName(const char *common_name) {
return conn.ExecuteParams(true,
"SELECT certificate_der, key_der, key_wrap_name "
"FROM server_certificate "
"WHERE NOT deleted AND "
"(common_name=$1 OR EXISTS("
"SELECT id FROM server_certificate_alt_name"
" WHERE server_certificate_id=server_certificate.id"
" AND name=$1))"
"ORDER BY"
/* prefer certificates which expire later */
" not_after DESC,"
/* prefer exact match in common_name: */
" common_name=$1 DESC "
"LIMIT 1",
common_name);
}
PgResult FindServerCertificateKeyById(id_t id) {
return conn.ExecuteParams(true,
"SELECT certificate_der, key_der, key_wrap_name "
"FROM server_certificate "
"WHERE id=$1",
id);
}
public:
PgResult GetModifiedServerCertificatesMeta(const char *since) {
return conn.ExecuteParams("SELECT deleted, modified, common_name "
"FROM server_certificate "
"WHERE modified>$1",
since);
}
PgResult TailModifiedServerCertificatesMeta() {
return conn.Execute("SELECT deleted, modified, common_name "
"FROM server_certificate "
"ORDER BY modified LIMIT 20");
}
};
#endif
|
/*
* author: Max Kellermann <[email protected]>
*/
#ifndef CERT_DATABASE_HXX
#define CERT_DATABASE_HXX
#include "pg/Connection.hxx"
#include "ssl/Unique.hxx"
#include <string>
typedef struct aes_key_st AES_KEY;
struct CertDatabaseConfig;
class CertDatabase {
const CertDatabaseConfig &config;
PgConnection conn;
public:
typedef unsigned id_t;
explicit CertDatabase(const CertDatabaseConfig &_config);
ConnStatusType GetStatus() const {
return conn.GetStatus();
}
gcc_pure
const char *GetErrorMessage() const {
return conn.GetErrorMessage();
}
bool CheckConnected();
void EnsureConnected();
gcc_pure
int GetSocket() const {
return conn.GetSocket();
}
void ConsumeInput() {
conn.ConsumeInput();
}
PgNotify GetNextNotify() {
return conn.GetNextNotify();
}
PgResult ListenModified();
PgResult NotifyModified();
gcc_pure
std::string GetCurrentTimestamp() {
const auto result = conn.Execute("SELECT CURRENT_TIMESTAMP");
return result.GetOnlyStringChecked();
}
gcc_pure
std::string GetLastModified() {
const auto result = conn.Execute("SELECT MAX(modified) FROM server_certificate");
return result.GetOnlyStringChecked();
}
bool BeginSerializable() {
return conn.BeginSerializable();
}
bool Commit() {
return conn.Commit();
}
void Migrate();
id_t GetIdByHandle(const char *handle);
void InsertServerCertificate(const char *handle,
const char *common_name,
const char *issuer_common_name,
const char *not_before,
const char *not_after,
X509 &cert, ConstBuffer<void> key,
const char *key_wrap_name);
/**
* @return true when new certificate has been inserted, false when an
* existing certificate has been updated
*/
bool LoadServerCertificate(const char *handle,
X509 &cert, EVP_PKEY &key,
const char *key_wrap_name,
AES_KEY *wrap_key);
/**
* Delete *.acme.invalid for alt_names of the given certificate.
*/
unsigned DeleteAcmeInvalidAlt(X509 &cert);
UniqueX509 GetServerCertificateByHandle(const char *handle);
UniqueX509 GetServerCertificate(const char *name);
/**
* Throws std::runtime_error on error.
*
* @return a pair of certificate and key, or {nullptr, nullptr} if
* no matching certificate was found
*/
std::pair<UniqueX509, UniqueEVP_PKEY> GetServerCertificateKeyByHandle(const char *handle);
std::pair<UniqueX509, UniqueEVP_PKEY> GetServerCertificateKey(const char *name);
std::pair<UniqueX509, UniqueEVP_PKEY> GetServerCertificateKey(id_t id);
private:
PgResult InsertServerCertificate(const char *handle,
const char *common_name,
const char *issuer_common_name,
const char *not_before,
const char *not_after,
PgBinaryValue cert, PgBinaryValue key,
const char *key_wrap_name) {
return conn.ExecuteBinary("INSERT INTO server_certificate("
"handle, common_name, issuer_common_name, "
"not_before, not_after, "
"certificate_der, key_der, key_wrap_name) "
"VALUES($1, $2, $3, $4, $5, $6, $7, $8)"
" RETURNING id",
handle, common_name, issuer_common_name,
not_before, not_after,
cert, key, key_wrap_name);
}
PgResult UpdateServerCertificate(const char *handle,
const char *common_name,
const char *issuer_common_name,
const char *not_before,
const char *not_after,
PgBinaryValue cert, PgBinaryValue key,
const char *key_wrap_name) {
return conn.ExecuteBinary("UPDATE server_certificate SET "
"common_name=$1, "
"not_before=$2, not_after=$3, "
"certificate_der=$4, key_der=$5, "
"key_wrap_name=$6, "
"issuer_common_name=$7, "
"modified=CURRENT_TIMESTAMP, deleted=FALSE "
"WHERE handle=$8"
" RETURNING id",
common_name, not_before, not_after,
cert, key, key_wrap_name,
issuer_common_name, handle);
}
PgResult DeleteAltNames(const char *server_certificate_id) {
return conn.ExecuteParams("DELETE FROM server_certificate_alt_name"
" WHERE server_certificate_id=$1",
server_certificate_id);
}
PgResult InsertAltName(const char *server_certificate_id,
const char *name) {
return conn.ExecuteParams("INSERT INTO server_certificate_alt_name"
"(server_certificate_id, name)"
" VALUES($1, $2)",
server_certificate_id, name);
}
public:
PgResult DeleteServerCertificateByHandle(const char *handle) {
return conn.ExecuteParams(true,
"UPDATE server_certificate SET "
"modified=CURRENT_TIMESTAMP, deleted=TRUE "
"WHERE handle=$1 AND NOT deleted",
handle);
}
private:
template<typename T>
PgResult DeleteAcmeInvalidByNames(const T &names) {
return conn.ExecuteParams(true,
"UPDATE server_certificate SET "
"modified=CURRENT_TIMESTAMP, deleted=TRUE "
"WHERE NOT deleted AND common_name = ANY($1)"
" AND EXISTS("
"SELECT id FROM server_certificate_alt_name"
" WHERE server_certificate_id=server_certificate.id"
" AND name LIKE '%.acme.invalid')",
names);
}
PgResult FindServerCertificateByHandle(const char *handle) {
return conn.ExecuteParams(true,
"SELECT certificate_der "
"FROM server_certificate "
"WHERE NOT deleted AND handle=$1"
"LIMIT 1",
handle);
}
PgResult FindServerCertificateByName(const char *common_name) {
return conn.ExecuteParams(true,
"SELECT certificate_der "
"FROM server_certificate "
"WHERE NOT deleted AND "
"(common_name=$1 OR EXISTS("
"SELECT id FROM server_certificate_alt_name"
" WHERE server_certificate_id=server_certificate.id"
" AND name=$1))"
"ORDER BY"
/* prefer certificates which expire later */
" not_after DESC,"
/* prefer exact match in common_name: */
" common_name=$1 DESC "
"LIMIT 1",
common_name);
}
PgResult FindServerCertificateKeyByHandle(const char *handle) {
return conn.ExecuteParams(true,
"SELECT certificate_der, key_der, key_wrap_name "
"FROM server_certificate "
"WHERE handle=$1 AND NOT deleted "
"LIMIT 1",
handle);
}
PgResult FindServerCertificateKeyByName(const char *common_name) {
return conn.ExecuteParams(true,
"SELECT certificate_der, key_der, key_wrap_name "
"FROM server_certificate "
"WHERE NOT deleted AND "
"(common_name=$1 OR EXISTS("
"SELECT id FROM server_certificate_alt_name"
" WHERE server_certificate_id=server_certificate.id"
" AND name=$1))"
"ORDER BY"
/* prefer certificates which expire later */
" not_after DESC,"
/* prefer exact match in common_name: */
" common_name=$1 DESC "
"LIMIT 1",
common_name);
}
PgResult FindServerCertificateKeyById(id_t id) {
return conn.ExecuteParams(true,
"SELECT certificate_der, key_der, key_wrap_name "
"FROM server_certificate "
"WHERE id=$1",
id);
}
public:
PgResult GetModifiedServerCertificatesMeta(const char *since) {
return conn.ExecuteParams("SELECT deleted, modified, common_name "
"FROM server_certificate "
"WHERE modified>$1",
since);
}
PgResult TailModifiedServerCertificatesMeta() {
return conn.Execute("SELECT deleted, modified, common_name "
"FROM server_certificate "
"ORDER BY modified LIMIT 20");
}
};
#endif
|
fix typo
|
certdb/CertDatabase: fix typo
|
C++
|
bsd-2-clause
|
CM4all/beng-proxy,CM4all/beng-proxy,CM4all/beng-proxy,CM4all/beng-proxy,CM4all/beng-proxy,CM4all/beng-proxy
|
96351651873d1f5bffce5593f9484b14696befe1
|
src/module.hpp
|
src/module.hpp
|
#ifndef MODULE_HPP_
#define MODULE_HPP_
#include "symbol.hpp"
#include "parse.hpp"
#include <string>
#include <vector>
struct module
{
std::string file_name;
std::vector<std::string> required_modules;
symbol::list syntax_tree;
};
module read_module(const std::string& file_name);
#endif
|
#ifndef MODULE_HPP_
#define MODULE_HPP_
#include "symbol.hpp"
#include "parse.hpp"
#include <string>
#include <vector>
struct module
{
std::vector<std::string> required_modules;
symbol::list syntax_tree;
};
module read_module(const std::string& file_name);
#endif
|
remove unused variable
|
remove unused variable
|
C++
|
mit
|
mbid/asm-lisp
|
ea0606f8f9acb90f4813f0458e9af6143c58dc6b
|
src/mp_sqr.cpp
|
src/mp_sqr.cpp
|
/*************************************************
* Karatsuba Squaring Source File *
* (C) 1999-2006 The Botan Project *
*************************************************/
#include <botan/mp_core.h>
#include <botan/mem_ops.h>
namespace Botan {
namespace {
/*************************************************
* Karatsuba Squaring Operation *
*************************************************/
void karatsuba_sqr(word z[], const word x[], u32bit N, word workspace[])
{
const u32bit KARATSUBA_SQR_LOWER_SIZE = BOTAN_KARAT_SQR_THRESHOLD;
if(N == 6)
bigint_comba_sqr6(z, x);
else if(N == 8)
bigint_comba_sqr8(z, x);
else if(N < KARATSUBA_SQR_LOWER_SIZE || N % 2)
bigint_simple_mul(z, x, N, x, N);
else
{
const u32bit N2 = N / 2;
const word* x0 = x;
const word* x1 = x + N2;
word* z0 = z;
word* z1 = z + N;
const s32bit cmp = bigint_cmp(x0, N2, x1, N2);
clear_mem(workspace, 2*N);
if(cmp)
{
if(cmp > 0)
bigint_sub3(z0, x0, N2, x1, N2);
else
bigint_sub3(z0, x1, N2, x0, N2);
karatsuba_sqr(workspace, z0, N2, workspace+N);
}
karatsuba_sqr(z0, x0, N2, workspace+N);
karatsuba_sqr(z1, x1, N2, workspace+N);
word carry = bigint_add3_nc(workspace+N, z0, N, z1, N);
carry += bigint_add2_nc(z + N2, N, workspace + N, N);
bigint_add2_nc(z + N + N2, N2, &carry, 1);
if(cmp == 0)
bigint_add2(z + N2, 2*N-N2, workspace, N);
else
bigint_sub2(z + N2, 2*N-N2, workspace, N);
}
}
/*************************************************
* Pick a good size for the Karatsuba squaring *
*************************************************/
u32bit karatsuba_size(u32bit z_size, u32bit x_size, u32bit x_sw)
{
if(x_sw == x_size)
{
if(x_sw % 2)
return 0;
return x_sw;
}
for(u32bit j = x_sw; j <= x_size; ++j)
{
if(j % 2)
continue;
if(2*j > z_size)
return 0;
if(j % 4 == 2 && (j+2) <= x_size && 2*(j+2) <= z_size)
return j+2;
return j;
}
return 0;
}
/*************************************************
* Handle small operand squarings *
*************************************************/
void handle_small_sqr(word z[], u32bit z_size,
const word x[], u32bit x_size, u32bit x_sw)
{
if(x_sw == 1)
bigint_linmul3(z, x, x_sw, x[0]);
else if(x_sw <= 4 && x_size >= 4 && z_size >= 8)
bigint_comba_sqr4(z, x);
else if(x_sw <= 6 && x_size >= 6 && z_size >= 12)
bigint_comba_sqr6(z, x);
else if(x_sw <= 8 && x_size >= 8 && z_size >= 16)
bigint_comba_sqr8(z, x);
else
bigint_simple_mul(z, x, x_sw, x, x_sw);
}
}
/*************************************************
* Squaring Algorithm Dispatcher *
*************************************************/
void bigint_sqr(word z[], u32bit z_size, word workspace[],
const word x[], u32bit x_size, u32bit x_sw)
{
if(x_size <= 8 || x_size <= 8)
{
handle_small_sqr(z, z_size, x, x_size, x_sw);
return;
}
const u32bit N = karatsuba_size(z_size, x_size, x_sw);
if(N)
{
clear_mem(workspace, 2*N);
karatsuba_sqr(z, x, N, workspace);
}
else
bigint_simple_mul(z, x, x_sw, x, x_sw);
}
}
|
/*************************************************
* Karatsuba Squaring Source File *
* (C) 1999-2006 The Botan Project *
*************************************************/
#include <botan/mp_core.h>
#include <botan/mem_ops.h>
namespace Botan {
namespace {
/*************************************************
* Karatsuba Squaring Operation *
*************************************************/
void karatsuba_sqr(word z[], const word x[], u32bit N, word workspace[])
{
const u32bit KARATSUBA_SQR_LOWER_SIZE = BOTAN_KARAT_SQR_THRESHOLD;
if(N == 6)
bigint_comba_sqr6(z, x);
else if(N == 8)
bigint_comba_sqr8(z, x);
else if(N < KARATSUBA_SQR_LOWER_SIZE || N % 2)
bigint_simple_mul(z, x, N, x, N);
else
{
const u32bit N2 = N / 2;
const word* x0 = x;
const word* x1 = x + N2;
word* z0 = z;
word* z1 = z + N;
const s32bit cmp = bigint_cmp(x0, N2, x1, N2);
clear_mem(workspace, 2*N);
if(cmp)
{
if(cmp > 0)
bigint_sub3(z0, x0, N2, x1, N2);
else
bigint_sub3(z0, x1, N2, x0, N2);
karatsuba_sqr(workspace, z0, N2, workspace+N);
}
karatsuba_sqr(z0, x0, N2, workspace+N);
karatsuba_sqr(z1, x1, N2, workspace+N);
word carry = bigint_add3_nc(workspace+N, z0, N, z1, N);
carry += bigint_add2_nc(z + N2, N, workspace + N, N);
bigint_add2_nc(z + N + N2, N2, &carry, 1);
if(cmp == 0)
bigint_add2(z + N2, 2*N-N2, workspace, N);
else
bigint_sub2(z + N2, 2*N-N2, workspace, N);
}
}
/*************************************************
* Pick a good size for the Karatsuba squaring *
*************************************************/
u32bit karatsuba_size(u32bit z_size, u32bit x_size, u32bit x_sw)
{
if(x_sw == x_size)
{
if(x_sw % 2)
return 0;
return x_sw;
}
for(u32bit j = x_sw; j <= x_size; ++j)
{
if(j % 2)
continue;
if(2*j > z_size)
return 0;
if(j % 4 == 2 && (j+2) <= x_size && 2*(j+2) <= z_size)
return j+2;
return j;
}
return 0;
}
/*************************************************
* Handle small operand squarings *
*************************************************/
void handle_small_sqr(word z[], u32bit z_size,
const word x[], u32bit x_size, u32bit x_sw)
{
if(x_sw == 1)
bigint_linmul3(z, x, x_sw, x[0]);
else if(x_sw <= 4 && x_size >= 4 && z_size >= 8)
bigint_comba_sqr4(z, x);
else if(x_sw <= 6 && x_size >= 6 && z_size >= 12)
bigint_comba_sqr6(z, x);
else if(x_sw <= 8 && x_size >= 8 && z_size >= 16)
bigint_comba_sqr8(z, x);
else
bigint_simple_mul(z, x, x_sw, x, x_sw);
}
}
/*************************************************
* Squaring Algorithm Dispatcher *
*************************************************/
void bigint_sqr(word z[], u32bit z_size, word workspace[],
const word x[], u32bit x_size, u32bit x_sw)
{
if(x_size <= 8 || x_sw <= 8)
{
handle_small_sqr(z, z_size, x, x_size, x_sw);
return;
}
const u32bit N = karatsuba_size(z_size, x_size, x_sw);
if(N)
{
clear_mem(workspace, 2*N);
karatsuba_sqr(z, x, N, workspace);
}
else
bigint_simple_mul(z, x, x_sw, x, x_sw);
}
}
|
Fix typo that was preventing the use of the best squaring routine with smaller operands.
|
Fix typo that was preventing the use of the best squaring routine
with smaller operands.
|
C++
|
bsd-2-clause
|
Rohde-Schwarz-Cybersecurity/botan,Rohde-Schwarz-Cybersecurity/botan,Rohde-Schwarz-Cybersecurity/botan,randombit/botan,webmaster128/botan,Rohde-Schwarz-Cybersecurity/botan,randombit/botan,randombit/botan,webmaster128/botan,Rohde-Schwarz-Cybersecurity/botan,Rohde-Schwarz-Cybersecurity/botan,webmaster128/botan,webmaster128/botan,randombit/botan,randombit/botan,webmaster128/botan
|
8cb131a86af184eed4195a6c76c0dd06398d86c5
|
src/mune04.cpp
|
src/mune04.cpp
|
/*
* Create classes to test streaming of audio buffers using primitives
* in our target API: step(), reset(), seek(). Implements mu:Transport,
* mu:Node, mu:TestNode.
*/
#include "Stk.h"
#include "RtAudio.h"
#include "FileRead.h"
#include "Mutex.h"
#include <signal.h>
namespace mu {
using namespace stk;
// #define TRACE(s)
#define TRACE(s) fprintf(stderr, (s))
typedef double MuTime;
// ================================================================
// ================================================================
// Node (virtual)
// .h ================
class Node {
public:
const static int INDEFINITE = -1;
//! Write upto nFrames of interleaved sample data into buffer.
//! Returns number of frames written into the buffer.
virtual Node& step(stk::StkFrames& buffer,
unsigned int frame_count,
unsigned int channel_count) = 0;
//! reset the Node to time 0, reinitialize state.
Node& reset() {
TRACE("Node::reset()\n");
releaseResources();
acquireResources();
seek(0.0);
return *this;
}
//! allocate resources required by this node.
virtual Node& acquireResources() = 0;
//! release any resources used by this node
virtual Node& releaseResources() = 0;
//! condition the Node so the next call to step() will fetch samples
//! starting at \c time.
virtual Node& seek(MuTime time) = 0;
//! Return the number of frames remaining in this stream, or
//! INDEFINITE if the stream has an infinite or indeterminate
//! number of frames.
virtual long int framesRemaining() = 0;
};
// ================================================================
// ================================================================
// TestNode
// .h ================
class TestNode : public Node {
public:
TestNode();
~TestNode( void );
TestNode& step(stk::StkFrames& buffer, unsigned int frame_count, unsigned int channel_count);
TestNode& acquireResources();
TestNode& releaseResources();
TestNode& seek(MuTime time);
long int framesRemaining();
protected:
long int frameIndex_;
}; // class TestNode
// .cpp ================
TestNode::TestNode() {
TRACE("TestNode::TestNode()\n");
}
TestNode::~TestNode() {
TRACE("TestNode::~TestNode()\n");
}
TestNode& TestNode::step(stk::StkFrames& buffer,
unsigned int frame_count,
unsigned int channel_count) {
TRACE("~");
buffer[0] = 1.0; // exciting waveform...
// fprintf(stderr, "step: %p %d %d\r", &buffer, frame_count, channel_count);
return *this;
}
long int TestNode::framesRemaining() {
TRACE("TestNode::framesRemaining()\n");
return INDEFINITE;
}
TestNode& TestNode::acquireResources() {
TRACE("TestNode::acquireResources()\n");
return *this;
}
TestNode& TestNode::releaseResources() {
TRACE("TestNode::releaseResources()\n");
return *this;
}
TestNode& TestNode::seek(MuTime time) {
TRACE("TestNode::seek()\n");
return *this;
}
// ================
// instance methods specific to this class
// ================================================================
// ================================================================
// Transport is the root of the directed acyclic graph of Nodes. It
// requests samples from nodes via the step() method (called in a
// separate thread) and passes them to the DAC for playback.
//
// Transport implements start, stop, seek methods to start (or
// resume) and stop playback. It is responsible for allocating and
// configuring the RtAudio object that handles the real-time
// playback.
class Transport {
// .h ================
public:
// Streaming status states.
typedef enum { RUNNING, EMPTYING, FINISHED } TransportState;
static const unsigned int kDefaultChannelCount = 2u;
// static const StkFloat kDefaultSampleRate = 44100.0;
static const int kDefaultDeviceNumber = 0;
static const unsigned int kDefaultFrameSize = 512u;
inline Transport()
: channel_count_ (kDefaultChannelCount),
sample_rate_ (44100.0 /* kDefaultSampleRate */),
device_number_ (kDefaultDeviceNumber),
frame_size_ (kDefaultFrameSize),
source_ (NULL),
is_running_ (false) {
TRACE("Transport::Transport()\n");
}
inline Transport& channelCount(unsigned int channel_count) {
TRACE("Transport::channelCount()\n");
channel_count_ = channel_count; return *this;
}
inline Transport& sampleRate(StkFloat sample_rate) {
TRACE("Transport::sampleRate()\n");
sample_rate_ = sample_rate; return *this;
}
inline Transport& deviceNumber(int device_number) {
TRACE("Transport::deviceNumber()\n");
device_number_ = device_number; return *this;
}
inline Transport& frameSize(unsigned int frame_size) {
TRACE("Transport::frameSize()\n");
frame_size_ = frame_size; return *this;
}
inline Transport& source(Node *source) {
TRACE("Transport::source()\n");
source_ = source; return *this;
}
~Transport(void);
// Start the transport if not already running. Does not rewind
// before starting.
Transport& start();
// Stop the transport if not already stopped. If \c immediately is
// true, immediately stops the transport, otherwise gives time for
// already queued samples to finish.
Transport& stop(bool immediately = false);
// Seek so the next sample played will be from \c time (in score
// time). If the transport is currently running, the change will
// happen after the currently queued samples have played.
Transport& seek(MuTime time);
// callback method
int readBuffer( void *buffer, unsigned int frame_count );
// Get/set source of samples
inline Node *source() { return source_; }
protected:
unsigned int channel_count_;
StkFloat sample_rate_;
int device_number_;
unsigned int frame_size_;
RtAudio dac_;
Mutex mutex_;
Node *source_;
bool is_running_;
StkFrames stk_frames_;
}; // class Transport
// .cpp ================
// Callback function for RtAudio when requesting more data for playback.
// NOTE: see tarballs/stk-4.4.4/src/RtWvOut.cpp
int dac_callback( void *outputBuffer,
void *inputBuffer,
unsigned int nBufferFrames,
double streamTime,
RtAudioStreamStatus status,
void *dataPointer ) {
return ( (Transport *) dataPointer )->Transport::readBuffer( outputBuffer, nBufferFrames );
}
// Callback method for RtAudio. buffer is an array of StkFloat
// values, interleaved (if multichannel). frame_count is the number
// of sample frames.
//
// Note that this is called in a separate thread, so care must be
// taken in reading or writing any state here.
//
// Implementation note: RtAudio expects to receive samples in an
// array of doubles. Node objects expect to be called with an
// StkFrames object. The main work in this method is to copy data
// out of the StkFrames object into RtAudio's buffer object.
//
// See also:
// ~/Projects/Mune/tarballs/stk-4.4.4/src/RtWvOut.cpp Line::36
//
int Transport::readBuffer( void *buffer, unsigned int frame_count ) {
TRACE(".");
if (source_ == NULL) { return 0; };
// grow the stkFrames buffer as needed
stk_frames_.resize(frame_count, channel_count_);
// ask the source to generate samples
source_->step(stk_frames_, frame_count, channel_count_);
// copy the samples to RtAudio's buffer
StkFloat *input = (StkFloat *)&stk_frames_[0];
StkFloat *output = (StkFloat *)buffer;
unsigned int sample_count = frame_count * channel_count_;
for (unsigned int i=0; i<sample_count; i++) {
*output++ = *input++;
}
return 0;
}
Transport::~Transport() {
TRACE("Transport::~Transport()\n");
}
// Start the transport if not already running. Does not rewind
// before starting.
Transport& Transport::start() {
TRACE("Transport::start()\n");
if (!is_running_) {
RtAudio::StreamParameters dac_parameters;
if ( device_number_ == 0 ) {
dac_parameters.deviceId = dac_.getDefaultOutputDevice();
} else {
dac_parameters.deviceId = device_number_ - 1;
}
dac_parameters.nChannels = channel_count_;
dac_.openStream( &dac_parameters,
NULL,
((sizeof(StkFloat) == 8) ? RTAUDIO_FLOAT64 : RTAUDIO_FLOAT32),
sample_rate_,
&frame_size_,
&dac_callback,
(void *)this);
dac_.startStream();
is_running_ = true;
}
return *this;
}
// Stop the transport if not already stopped. If \c immediately is
// true, immediately stops the transport, otherwise gives time for
// already queued samples to finish.
Transport& Transport::stop(bool immediately) {
TRACE("Transport::stop()\n");
if (is_running_) {
// dac_.isStreamRunning() ?
dac_.closeStream();
is_running_ = false;
}
return *this;
}
// Seek so the next sample played will be from \c time (in score
// time). If the transport is currently running, the change will
// happen after the currently queued samples have played.
Transport& Transport::seek(MuTime time) {
TRACE("Transport::seek()\n");
if (source_ != NULL) source_->seek(time);
return *this;
}
} // namespace mu
int main() {
mu::Transport t1;
mu::TestNode tn1;
t1.source(&tn1);
t1.start();
sleep(5);
t1.stop();
return 0;
}
|
/*
* Create classes to test streaming of audio buffers using primitives
* in our target API: step(), reset(), seek(). Implements mu:Transport,
* mu:Node, mu:TestNode.
*/
#include "Stk.h"
#include "RtAudio.h"
#include "FileRead.h"
#include "Mutex.h"
#include <signal.h>
namespace mu {
using namespace stk;
// #define TRACE(s)
#define TRACE(s) fprintf(stderr, (s))
typedef double MuTime;
// ================================================================
// ================================================================
// Node (virtual)
// .h ================
class Node {
public:
const static int INDEFINITE = -1;
//! Write upto nFrames of interleaved sample data into buffer.
//! Returns number of frames written into the buffer.
virtual Node& step(stk::StkFrames& buffer,
unsigned int frame_count,
unsigned int channel_count) = 0;
//! reset the Node to time 0, reinitialize state.
Node& reset() {
TRACE("Node::reset()\n");
releaseResources();
acquireResources();
seek(0.0);
return *this;
}
//! allocate resources required by this node.
virtual Node& acquireResources() = 0;
//! release any resources used by this node
virtual Node& releaseResources() = 0;
//! condition the Node so the next call to step() will fetch samples
//! starting at \c time.
virtual Node& seek(MuTime time) = 0;
//! Return the number of frames remaining in this stream, or
//! INDEFINITE if the stream has an infinite or indeterminate
//! number of frames.
virtual long int framesRemaining() = 0;
};
// ================================================================
// ================================================================
// TestNode
// .h ================
class TestNode : public Node {
public:
TestNode();
~TestNode( void );
TestNode& step(stk::StkFrames& buffer, unsigned int frame_count, unsigned int channel_count);
TestNode& acquireResources();
TestNode& releaseResources();
TestNode& seek(MuTime time);
long int framesRemaining();
protected:
long int frame_index_;
}; // class TestNode
// .cpp ================
TestNode::TestNode()
: frame_index_ (0) {
TRACE("TestNode::TestNode()\n");
}
TestNode::~TestNode() {
TRACE("TestNode::~TestNode()\n");
}
TestNode& TestNode::step(stk::StkFrames& buffer,
unsigned int frame_count,
unsigned int channel_count) {
int i = ((frame_index_ * 2) + 1) % (frame_count * channel_count);
TRACE("~");
// Verify that frame_count and channel_count args match that of
// the StackFrames buffer.
// printf("fc=%d, cc=%d, b.fc=%d, b.cc=%d\n",
// frame_count, channel_count, buffer.frames(), buffer.channels());
// Yes, the buffer does not arrive zeroed out...
bzero(&(buffer[0]), frame_count * channel_count * sizeof(StkFloat));
buffer[0] = 0.9; // exciting waveform...
buffer[i] = 0.9;
frame_index_ += 3;
// fprintf(stderr, "step: %p %d %d\r", &buffer, frame_count, channel_count);
return *this;
}
long int TestNode::framesRemaining() {
TRACE("TestNode::framesRemaining()\n");
return INDEFINITE;
}
TestNode& TestNode::acquireResources() {
TRACE("TestNode::acquireResources()\n");
return *this;
}
TestNode& TestNode::releaseResources() {
TRACE("TestNode::releaseResources()\n");
return *this;
}
TestNode& TestNode::seek(MuTime time) {
TRACE("TestNode::seek()\n");
return *this;
}
// ================
// instance methods specific to this class
// ================================================================
// ================================================================
// Transport is the root of the directed acyclic graph of Nodes. It
// requests samples from nodes via the step() method (called in a
// separate thread) and passes them to the DAC for playback.
//
// Transport implements start, stop, seek methods to start (or
// resume) and stop playback. It is responsible for allocating and
// configuring the RtAudio object that handles the real-time
// playback.
class Transport {
// .h ================
public:
// Streaming status states.
typedef enum { RUNNING, EMPTYING, FINISHED } TransportState;
static const unsigned int kDefaultChannelCount = 2u;
// static const StkFloat kDefaultSampleRate = 44100.0;
static const int kDefaultDeviceNumber = 0;
static const unsigned int kDefaultFrameSize = 512u;
inline Transport()
: channel_count_ (kDefaultChannelCount),
sample_rate_ (44100.0 /* kDefaultSampleRate */),
device_number_ (kDefaultDeviceNumber),
frame_size_ (kDefaultFrameSize),
source_ (NULL),
is_running_ (false) {
TRACE("Transport::Transport()\n");
}
inline Transport& channelCount(unsigned int channel_count) {
TRACE("Transport::channelCount()\n");
channel_count_ = channel_count; return *this;
}
inline Transport& sampleRate(StkFloat sample_rate) {
TRACE("Transport::sampleRate()\n");
sample_rate_ = sample_rate; return *this;
}
inline Transport& deviceNumber(int device_number) {
TRACE("Transport::deviceNumber()\n");
device_number_ = device_number; return *this;
}
inline Transport& frameSize(unsigned int frame_size) {
TRACE("Transport::frameSize()\n");
frame_size_ = frame_size; return *this;
}
inline Transport& source(Node *source) {
TRACE("Transport::source()\n");
source_ = source; return *this;
}
~Transport(void);
// Start the transport if not already running. Does not rewind
// before starting.
Transport& start();
// Stop the transport if not already stopped. If \c immediately is
// true, immediately stops the transport, otherwise gives time for
// already queued samples to finish.
Transport& stop(bool immediately = false);
// Seek so the next sample played will be from \c time (in score
// time). If the transport is currently running, the change will
// happen after the currently queued samples have played.
Transport& seek(MuTime time);
// callback method
int readBuffer( void *buffer, unsigned int frame_count );
// Get/set source of samples
inline Node *source() { return source_; }
protected:
unsigned int channel_count_;
StkFloat sample_rate_;
int device_number_;
unsigned int frame_size_;
RtAudio dac_;
Mutex mutex_;
Node *source_;
bool is_running_;
StkFrames stk_frames_;
}; // class Transport
// .cpp ================
// Callback function for RtAudio when requesting more data for playback.
// NOTE: see tarballs/stk-4.4.4/src/RtWvOut.cpp
int dac_callback( void *outputBuffer,
void *inputBuffer,
unsigned int nBufferFrames,
double streamTime,
RtAudioStreamStatus status,
void *dataPointer ) {
return ( (Transport *) dataPointer )->Transport::readBuffer( outputBuffer, nBufferFrames );
}
// Callback method for RtAudio. buffer is an array of StkFloat
// values, interleaved (if multichannel). frame_count is the number
// of sample frames.
//
// Note that this is called in a separate thread, so care must be
// taken in reading or writing any state here.
//
// Implementation note: RtAudio expects to receive samples in an
// array of doubles. Node objects expect to be called with an
// StkFrames object. The main work in this method is to copy data
// out of the StkFrames object into RtAudio's buffer object.
//
// See also:
// ~/Projects/Mune/tarballs/stk-4.4.4/src/RtWvOut.cpp Line::36
//
int Transport::readBuffer( void *buffer, unsigned int frame_count ) {
TRACE(".");
if (source_ == NULL) { return 0; };
// grow the stkFrames buffer as needed
stk_frames_.resize(frame_count, channel_count_);
// ask the source to generate samples
source_->step(stk_frames_, frame_count, channel_count_);
// copy the samples to RtAudio's buffer
StkFloat *input = (StkFloat *)&stk_frames_[0];
StkFloat *output = (StkFloat *)buffer;
unsigned int sample_count = frame_count * channel_count_;
for (unsigned int i=0; i<sample_count; i++) {
*output++ = *input++;
}
return 0;
}
Transport::~Transport() {
TRACE("Transport::~Transport()\n");
}
// Start the transport if not already running. Does not rewind
// before starting.
Transport& Transport::start() {
TRACE("Transport::start()\n");
if (!is_running_) {
RtAudio::StreamParameters dac_parameters;
if ( device_number_ == 0 ) {
dac_parameters.deviceId = dac_.getDefaultOutputDevice();
} else {
dac_parameters.deviceId = device_number_ - 1;
}
dac_parameters.nChannels = channel_count_;
dac_.openStream( &dac_parameters,
NULL,
((sizeof(StkFloat) == 8) ? RTAUDIO_FLOAT64 : RTAUDIO_FLOAT32),
sample_rate_,
&frame_size_,
&dac_callback,
(void *)this);
dac_.startStream();
is_running_ = true;
}
return *this;
}
// Stop the transport if not already stopped. If \c immediately is
// true, immediately stops the transport, otherwise gives time for
// already queued samples to finish.
Transport& Transport::stop(bool immediately) {
TRACE("Transport::stop()\n");
if (is_running_) {
// dac_.isStreamRunning() ?
dac_.closeStream();
is_running_ = false;
}
return *this;
}
// Seek so the next sample played will be from \c time (in score
// time). If the transport is currently running, the change will
// happen after the currently queued samples have played.
Transport& Transport::seek(MuTime time) {
TRACE("Transport::seek()\n");
if (source_ != NULL) source_->seek(time);
return *this;
}
} // namespace mu
int main() {
mu::Transport t1;
mu::TestNode tn1;
t1.source(&tn1);
t1.start();
sleep(5);
t1.stop();
return 0;
}
|
make the waveform epsilon more interesting. and zero out the buffer.
|
make the waveform epsilon more interesting. and zero out the buffer.
|
C++
|
mit
|
rdpoor/mu,rdpoor/mu,rdpoor/mu,rdpoor/mu,rdpoor/mu
|
4a8a7a2ac02eed6b84f257ba8ca893de65dc39bb
|
urbackupserver/serverinterface/create_zip.cpp
|
urbackupserver/serverinterface/create_zip.cpp
|
/*************************************************************************
* UrBackup - Client/Server backup system
* Copyright (C) 2011-2016 Martin Raiber
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*
**************************************************************************/
#include "action_header.h"
#include "../../urbackupcommon/os_functions.h"
#include "../../Interface/File.h"
#include "backups.h"
#define MINIZ_NO_ZLIB_COMPATIBLE_NAMES
#include "../../common/miniz/miniz.h"
#include "../../common/miniz/miniz_zip.h"
#ifndef _WIN32
#define _fdopen fdopen
#else
#include <io.h>
#include <fcntl.h>
#endif
namespace
{
struct MiniZFileInfo
{
uint64 file_offset;
THREAD_ID tid;
};
size_t my_mz_write_func(void *pOpaque, mz_uint64 file_ofs, const void *pBuf, size_t n)
{
MiniZFileInfo* fileInfo = reinterpret_cast<MiniZFileInfo*>(pOpaque);
if(fileInfo->file_offset!=file_ofs)
{
return 0;
}
fileInfo->file_offset=file_ofs+n;
bool b=Server->WriteRaw(fileInfo->tid, reinterpret_cast<const char*>(pBuf), n, false);
return b?n:0;
}
bool my_miniz_init(mz_zip_archive *pZip, MiniZFileInfo* fileInfo)
{
pZip->m_pWrite = my_mz_write_func;
pZip->m_pIO_opaque = fileInfo;
if (!mz_zip_writer_init(pZip, 0, MZ_ZIP_FLAG_CASE_SENSITIVE))
return false;
return true;
}
bool add_dir(mz_zip_archive& zip_archive, const std::string& archivefoldername, const std::string& folderbase, const std::string& foldername, const std::string& hashfolderbase, const std::string& hashfoldername, const std::string& filter,
bool token_authentication, const std::vector<backupaccess::SToken> &backup_tokens, const std::vector<std::string> &tokens, bool skip_special)
{
bool has_error=false;
const std::vector<SFile> files = getFiles(os_file_prefix(foldername), &has_error);
if (has_error)
{
Server->Log("Error while adding files to ZIP file. Error listing files in folder \""
+ foldername+"\". " + os_last_error_str(), LL_ERROR);
return false;
}
for(size_t i=0;i<files.size();++i)
{
const SFile& file=files[i];
if(skip_special
&& (file.name==".hashes" || file.name=="user_views" || next(files[i].name, 0, ".symlink_") ) )
{
continue;
}
std::string archivename = archivefoldername + (archivefoldername.empty()?"":"/") + file.name;
std::string metadataname = hashfoldername + os_file_sep() + escape_metadata_fn(file.name);
std::string filename = foldername + os_file_sep() + file.name;
std::string next_hashfoldername = metadataname;
if(!filter.empty() && archivename!=filter)
continue;
bool is_dir_link = false;
if(file.isdir)
{
if (!os_directory_exists(os_file_prefix(metadataname)))
{
is_dir_link = true;
}
else
{
metadataname += os_file_sep() + metadata_dir_fn;
}
}
if (is_dir_link
|| (!file.isdir && os_get_file_type(os_file_prefix(filename)) & EFileType_Symlink) )
{
std::string symlink_target;
if (os_get_symlink_target(os_file_prefix(filename), symlink_target))
{
std::string upone = ".." + os_file_sep();
while (next(symlink_target, 0, upone))
{
symlink_target = symlink_target.substr(upone.size());
}
std::string filename_old = filename;
filename = folderbase + os_file_sep() + symlink_target;
if (os_get_file_type(os_file_prefix(filename)) == 0)
{
Server->Log("Error opening symlink target \""+filename+"\" of symlink at \"" + filename_old + "\"", LL_INFO);
continue;
}
if (is_dir_link)
{
metadataname = hashfolderbase + os_file_sep() + symlink_target + os_file_sep() + metadata_dir_fn;
next_hashfoldername = hashfolderbase + os_file_sep() + symlink_target;
}
else
{
metadataname = hashfolderbase + os_file_sep() + symlink_target;
}
}
else
{
Server->Log("Error getting symlink target of \"" + filename + "\". "+os_last_error_str(), LL_ERROR);
continue;
}
}
bool has_metadata = false;
FileMetadata metadata;
if(token_authentication &&
( !read_metadata(metadataname, metadata) ||
!backupaccess::checkFileToken(backup_tokens, tokens, metadata) ) )
{
continue;
}
else if(!token_authentication)
{
has_metadata = read_metadata(metadataname, metadata);
}
else
{
has_metadata = true;
}
time_t* last_modified=NULL;
time_t last_modified_wt;
if(has_metadata)
{
#ifdef _WIN32
last_modified_wt=static_cast<time_t>(metadata.last_modified);
#else
last_modified_wt=static_cast<time_t>(metadata.last_modified);
#endif
last_modified=&last_modified_wt;
}
mz_bool rc;
if(file.isdir)
{
rc = mz_zip_writer_add_mem_ex(&zip_archive, (archivename + "/").c_str(), NULL, 0, NULL, 0, MZ_DEFAULT_LEVEL,
0, 0, 1<<11, last_modified);
}
else
{
std::auto_ptr<IFsFile> add_file(Server->openFile(os_file_prefix(filename)));
if (add_file.get() == NULL)
{
Server->Log("Error opening file \"" + filename + "\" for ZIP file download." + os_last_error_str(), LL_ERROR);
return false;
}
#ifndef _WIN32
int fd = reinterpret_cast<int>(add_file->getOsHandle());
#else
int fd =_open_osfhandle(reinterpret_cast<intptr_t>(add_file->getOsHandle()), _O_RDONLY);
if (fd == -1)
{
Server->Log("Error opening file fd for \"" + filename + "\" for ZIP file download." + os_last_error_str(), LL_ERROR);
return false;
}
#endif
FILE* file = _fdopen(fd, "r");
if (file != NULL)
{
rc = mz_zip_writer_add_cfile(&zip_archive, archivename.c_str(), file, add_file->Size(), last_modified, NULL, 0, MZ_DEFAULT_LEVEL);
fclose(file);
}
else
{
Server->Log("Error opening FILE handle for \"" + filename + "\" for ZIP file download." + os_last_error_str(), LL_ERROR);
return false;
}
}
if(rc==MZ_FALSE)
{
Server->Log("Error while adding file \""+filename+"\" to ZIP file. RC="+convert((int)rc), LL_ERROR);
return false;
}
if(file.isdir)
{
add_dir(zip_archive, archivename, folderbase, filename, hashfolderbase, next_hashfoldername, filter,
token_authentication, backup_tokens, tokens, false);
}
}
return true;
}
}
bool create_zip_to_output(const std::string& folderbase, const std::string& foldername, const std::string& hashfolderbase,
const std::string& hashfoldername, const std::string& filter, bool token_authentication,
const std::vector<backupaccess::SToken> &backup_tokens, const std::vector<std::string> &tokens, bool skip_hashes)
{
mz_zip_archive zip_archive;
memset(&zip_archive, 0, sizeof(zip_archive));
MiniZFileInfo file_info = {};
file_info.tid=Server->getThreadID();
if(!my_miniz_init(&zip_archive, &file_info))
{
Server->Log("Error while initializing ZIP archive", LL_ERROR);
return false;
}
if(!add_dir(zip_archive, "", folderbase, foldername, hashfolderbase,
hashfoldername, filter, token_authentication, backup_tokens, tokens, skip_hashes))
{
Server->Log("Error while adding files and folders to ZIP archive", LL_ERROR);
return false;
}
if(!mz_zip_writer_finalize_archive(&zip_archive))
{
Server->Log("Error while finalizing ZIP archive", LL_ERROR);
return false;
}
if(!mz_zip_writer_end(&zip_archive))
{
Server->Log("Error while ending ZIP archive writer", LL_ERROR);
return false;
}
return true;
}
|
/*************************************************************************
* UrBackup - Client/Server backup system
* Copyright (C) 2011-2016 Martin Raiber
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*
**************************************************************************/
#include "action_header.h"
#include "../../urbackupcommon/os_functions.h"
#include "../../Interface/File.h"
#include "backups.h"
#include <memory>
#define MINIZ_NO_ZLIB_COMPATIBLE_NAMES
#include "../../common/miniz/miniz.h"
#include "../../common/miniz/miniz_zip.h"
#ifndef _WIN32
#define _fdopen fdopen
#else
#include <io.h>
#include <fcntl.h>
#endif
namespace
{
struct MiniZFileInfo
{
uint64 file_offset;
THREAD_ID tid;
};
size_t my_mz_write_func(void *pOpaque, mz_uint64 file_ofs, const void *pBuf, size_t n)
{
MiniZFileInfo* fileInfo = reinterpret_cast<MiniZFileInfo*>(pOpaque);
if(fileInfo->file_offset!=file_ofs)
{
return 0;
}
fileInfo->file_offset=file_ofs+n;
bool b=Server->WriteRaw(fileInfo->tid, reinterpret_cast<const char*>(pBuf), n, false);
return b?n:0;
}
bool my_miniz_init(mz_zip_archive *pZip, MiniZFileInfo* fileInfo)
{
pZip->m_pWrite = my_mz_write_func;
pZip->m_pIO_opaque = fileInfo;
if (!mz_zip_writer_init(pZip, 0, MZ_ZIP_FLAG_CASE_SENSITIVE))
return false;
return true;
}
bool add_dir(mz_zip_archive& zip_archive, const std::string& archivefoldername, const std::string& folderbase, const std::string& foldername, const std::string& hashfolderbase, const std::string& hashfoldername, const std::string& filter,
bool token_authentication, const std::vector<backupaccess::SToken> &backup_tokens, const std::vector<std::string> &tokens, bool skip_special)
{
bool has_error=false;
const std::vector<SFile> files = getFiles(os_file_prefix(foldername), &has_error);
if (has_error)
{
Server->Log("Error while adding files to ZIP file. Error listing files in folder \""
+ foldername+"\". " + os_last_error_str(), LL_ERROR);
return false;
}
for(size_t i=0;i<files.size();++i)
{
const SFile& file=files[i];
if(skip_special
&& (file.name==".hashes" || file.name=="user_views" || next(files[i].name, 0, ".symlink_") ) )
{
continue;
}
std::string archivename = archivefoldername + (archivefoldername.empty()?"":"/") + file.name;
std::string metadataname = hashfoldername + os_file_sep() + escape_metadata_fn(file.name);
std::string filename = foldername + os_file_sep() + file.name;
std::string next_hashfoldername = metadataname;
if(!filter.empty() && archivename!=filter)
continue;
bool is_dir_link = false;
if(file.isdir)
{
if (!os_directory_exists(os_file_prefix(metadataname)))
{
is_dir_link = true;
}
else
{
metadataname += os_file_sep() + metadata_dir_fn;
}
}
if (is_dir_link
|| (!file.isdir && os_get_file_type(os_file_prefix(filename)) & EFileType_Symlink) )
{
std::string symlink_target;
if (os_get_symlink_target(os_file_prefix(filename), symlink_target))
{
std::string upone = ".." + os_file_sep();
while (next(symlink_target, 0, upone))
{
symlink_target = symlink_target.substr(upone.size());
}
std::string filename_old = filename;
filename = folderbase + os_file_sep() + symlink_target;
if (os_get_file_type(os_file_prefix(filename)) == 0)
{
Server->Log("Error opening symlink target \""+filename+"\" of symlink at \"" + filename_old + "\"", LL_INFO);
continue;
}
if (is_dir_link)
{
metadataname = hashfolderbase + os_file_sep() + symlink_target + os_file_sep() + metadata_dir_fn;
next_hashfoldername = hashfolderbase + os_file_sep() + symlink_target;
}
else
{
metadataname = hashfolderbase + os_file_sep() + symlink_target;
}
}
else
{
Server->Log("Error getting symlink target of \"" + filename + "\". "+os_last_error_str(), LL_ERROR);
continue;
}
}
bool has_metadata = false;
FileMetadata metadata;
if(token_authentication &&
( !read_metadata(metadataname, metadata) ||
!backupaccess::checkFileToken(backup_tokens, tokens, metadata) ) )
{
continue;
}
else if(!token_authentication)
{
has_metadata = read_metadata(metadataname, metadata);
}
else
{
has_metadata = true;
}
time_t* last_modified=NULL;
time_t last_modified_wt;
if(has_metadata)
{
#ifdef _WIN32
last_modified_wt=static_cast<time_t>(metadata.last_modified);
#else
last_modified_wt=static_cast<time_t>(metadata.last_modified);
#endif
last_modified=&last_modified_wt;
}
mz_bool rc;
if(file.isdir)
{
rc = mz_zip_writer_add_mem_ex(&zip_archive, (archivename + "/").c_str(), NULL, 0, NULL, 0, MZ_DEFAULT_LEVEL,
0, 0, 1<<11, last_modified);
}
else
{
std::auto_ptr<IFsFile> add_file(Server->openFile(os_file_prefix(filename)));
if (add_file.get() == NULL)
{
Server->Log("Error opening file \"" + filename + "\" for ZIP file download." + os_last_error_str(), LL_ERROR);
return false;
}
#ifndef _WIN32
int fd = reinterpret_cast<int>(add_file->getOsHandle());
#else
int fd =_open_osfhandle(reinterpret_cast<intptr_t>(add_file->getOsHandle()), _O_RDONLY);
if (fd == -1)
{
Server->Log("Error opening file fd for \"" + filename + "\" for ZIP file download." + os_last_error_str(), LL_ERROR);
return false;
}
#endif
FILE* file = _fdopen(fd, "r");
if (file != NULL)
{
rc = mz_zip_writer_add_cfile(&zip_archive, archivename.c_str(), file, add_file->Size(), last_modified, NULL, 0, MZ_DEFAULT_LEVEL);
fclose(file);
}
else
{
Server->Log("Error opening FILE handle for \"" + filename + "\" for ZIP file download." + os_last_error_str(), LL_ERROR);
return false;
}
}
if(rc==MZ_FALSE)
{
Server->Log("Error while adding file \""+filename+"\" to ZIP file. RC="+convert((int)rc), LL_ERROR);
return false;
}
if(file.isdir)
{
add_dir(zip_archive, archivename, folderbase, filename, hashfolderbase, next_hashfoldername, filter,
token_authentication, backup_tokens, tokens, false);
}
}
return true;
}
}
bool create_zip_to_output(const std::string& folderbase, const std::string& foldername, const std::string& hashfolderbase,
const std::string& hashfoldername, const std::string& filter, bool token_authentication,
const std::vector<backupaccess::SToken> &backup_tokens, const std::vector<std::string> &tokens, bool skip_hashes)
{
mz_zip_archive zip_archive;
memset(&zip_archive, 0, sizeof(zip_archive));
MiniZFileInfo file_info = {};
file_info.tid=Server->getThreadID();
if(!my_miniz_init(&zip_archive, &file_info))
{
Server->Log("Error while initializing ZIP archive", LL_ERROR);
return false;
}
if(!add_dir(zip_archive, "", folderbase, foldername, hashfolderbase,
hashfoldername, filter, token_authentication, backup_tokens, tokens, skip_hashes))
{
Server->Log("Error while adding files and folders to ZIP archive", LL_ERROR);
return false;
}
if(!mz_zip_writer_finalize_archive(&zip_archive))
{
Server->Log("Error while finalizing ZIP archive", LL_ERROR);
return false;
}
if(!mz_zip_writer_end(&zip_archive))
{
Server->Log("Error while ending ZIP archive writer", LL_ERROR);
return false;
}
return true;
}
|
Fix build
|
Fix build
|
C++
|
agpl-3.0
|
uroni/urbackup_backend,uroni/urbackup_backend,uroni/urbackup_backend,uroni/urbackup_backend,uroni/urbackup_backend,uroni/urbackup_backend,uroni/urbackup_backend
|
ae36c26e34eb67c7bcaf970cb0347d620c636363
|
bsp-gonk/vendor/silk/silk-audioplayer/src/BufferedDataSource.cpp
|
bsp-gonk/vendor/silk/silk-audioplayer/src/BufferedDataSource.cpp
|
/**
* This class provides a data source implementation that uses ABuffers to feed
* data to MediaExtractor and MediaCodec
*/
// #define LOG_NDEBUG 0
#define LOG_TAG "BufferedDataSource"
#include <utils/Log.h>
#include "BufferedDataSource.h"
#include <media/stagefright/foundation/ABuffer.h>
#include <media/stagefright/foundation/ADebug.h>
// Don't wait for data that is larger that these many bytes to avoid having
// to buffer the stream for a long time
const off64_t HIGH_WATERMARK = 10000;
off64_t MAX_OFF_64_T = (off64_t)1 << ((sizeof(off64_t) * 8) - 2);
namespace android {
BufferedDataSource::BufferedDataSource() :
mEraseOnRead(false),
mOffset(0),
mFinalResult(OK),
mLength(0) {
}
BufferedDataSource::~BufferedDataSource() {
mBufferQueue.clear();
}
status_t BufferedDataSource::getSize(off64_t *size) {
Mutex::Autolock autoLock(mLock);
// Streams have unknown duration so return max value that can
// be held by off64_t
*size = MAX_OFF_64_T;
return OK;
}
status_t BufferedDataSource::initCheck() const {
return OK;
}
size_t BufferedDataSource::countQueuedBuffers() {
Mutex::Autolock autoLock(mLock);
return mBufferQueue.size();
}
void BufferedDataSource::doneSniffing() {
ALOGD("Done sniffing data");
// We are done sniffing the data to find the mime type
// No need to keep the data around that has been read anymore
mEraseOnRead = true;
}
status_t BufferedDataSource::deleteUpTo(off64_t offset) {
off64_t newOffset = offset - mOffset;
ALOGV("new offset %lld", newOffset);
if (waitForData(0, newOffset) != OK) {
if (newOffset >= mLength) {
return ERROR_END_OF_STREAM;
}
}
off64_t offsetInBuffer = newOffset;
sp<ABuffer> buffer = NULL;
for (List<sp<ABuffer> >::iterator it = mBufferQueue.begin();
it != mBufferQueue.end(); it = mBufferQueue.erase(it)) {
sp<ABuffer> b = *it;
if (offsetInBuffer < b->size()) {
buffer = b;
break;
} else {
offsetInBuffer -= b->size();
mLength -= b->size();
}
}
mLength -= offsetInBuffer;
if (buffer != NULL) {
buffer->setRange(buffer->offset() + offsetInBuffer, buffer->size() - offsetInBuffer);
if (buffer->size() == 0) {
mBufferQueue.erase(mBufferQueue.begin());
}
}
mOffset = offset;
return OK;
}
ssize_t BufferedDataSource::readAt(off64_t offset, void *data, size_t size) {
Mutex::Autolock autoLock(mLock);
return readAt_l(offset, data, size);
}
ssize_t BufferedDataSource::readAt_l(off64_t offset, void *data, size_t size) {
ALOGV("***%s ", __FUNCTION__);
ALOGV("offset %lld", offset);
ALOGV("size %d", size);
ALOGV("mLength %lld", mLength);
if (mEraseOnRead) {
// Seek the buffer queue to the given offset and delete the rest
if (deleteUpTo(offset) != OK) {
ALOGW("deleteUpTo failed due to end of stream");
return 0;
}
// All the data up to the offset has been deleted by the deleteUpTo
// function, so set the offset to 0
offset = 0;
}
size_t sizeDone = 0;
while (sizeDone < size) {
if (waitForData(offset, (size - sizeDone)) != OK) {
if (offset >= mLength) {
ALOGW("Returning early %d", sizeDone);
return sizeDone;
} else {
// Try to return as much as we can
size = mLength - offset;
}
}
size_t copy = size - sizeDone;
off64_t offsetInBuffer = offset;
sp<ABuffer> buffer = NULL;
for (List<sp<ABuffer> >::iterator it = mBufferQueue.begin();
it != mBufferQueue.end(); ++it) {
sp<ABuffer> b = *it;
if (offsetInBuffer < b->size()) {
buffer = b;
break;
} else {
offsetInBuffer -= b->size();
}
}
if (copy > (buffer->size() - offsetInBuffer)) {
copy = buffer->size() - offsetInBuffer;
}
memcpy((uint8_t *)data + sizeDone, buffer->data() + offsetInBuffer, copy);
sizeDone += copy;
offset += copy;
}
ALOGV("sizeDone %d", sizeDone);
return sizeDone;
}
/**
* Block until size bytes starting at offset are available to read
*/
status_t BufferedDataSource::waitForData(off64_t offset, size_t size) {
off64_t watermark = (offset + size - mLength);
while (((mLength - offset) < size) &&
(mFinalResult != ERROR_END_OF_STREAM) &&
(watermark < HIGH_WATERMARK)) {
mCondition.wait(mLock);
}
// High watermark reached; return early
if (watermark >= HIGH_WATERMARK) {
ALOGV("Reached watermark %lld", watermark);
return ERROR_OUT_OF_RANGE;
}
// Read beyond EOF
if ((mFinalResult == ERROR_END_OF_STREAM) && (offset >= mLength)) {
ALOGW("Read beyond EOF total: %lld", mLength);
return ERROR_END_OF_STREAM;
}
return OK;
}
void BufferedDataSource::queueBuffer(const sp<ABuffer> &buffer) {
Mutex::Autolock autoLock(mLock);
if (mFinalResult != OK) {
return;
}
mBufferQueue.push_back(buffer);
mLength += buffer->size();
mCondition.broadcast();
}
void BufferedDataSource::queueEOS(status_t finalResult) {
ALOGV("%s %d", __FUNCTION__, finalResult);
CHECK_NE(finalResult, (status_t)OK);
Mutex::Autolock autoLock(mLock);
mFinalResult = finalResult;
mCondition.broadcast();
}
void BufferedDataSource::reset() {
Mutex::Autolock autoLock(mLock);
mFinalResult = OK;
mBufferQueue.clear();
}
} // namespace android
|
/**
* This class provides a data source implementation that uses ABuffers to feed
* data to MediaExtractor and MediaCodec
*/
// #define LOG_NDEBUG 0
#define LOG_TAG "BufferedDataSource"
#include <utils/Log.h>
#include "BufferedDataSource.h"
#include <media/stagefright/foundation/ABuffer.h>
#include <media/stagefright/foundation/ADebug.h>
// Don't wait for data that is larger that these many bytes to avoid having
// to buffer the stream for a long time
// AAC requires 8K worth of data to correctly parse the header
const off64_t HIGH_WATERMARK = 8202;
off64_t MAX_OFF_64_T = (off64_t)1 << ((sizeof(off64_t) * 8) - 2);
namespace android {
BufferedDataSource::BufferedDataSource() :
mEraseOnRead(false),
mOffset(0),
mFinalResult(OK),
mLength(0) {
}
BufferedDataSource::~BufferedDataSource() {
mBufferQueue.clear();
}
status_t BufferedDataSource::getSize(off64_t *size) {
Mutex::Autolock autoLock(mLock);
// Streams have unknown duration so return max value that can
// be held by off64_t
*size = MAX_OFF_64_T;
return OK;
}
status_t BufferedDataSource::initCheck() const {
return OK;
}
size_t BufferedDataSource::countQueuedBuffers() {
Mutex::Autolock autoLock(mLock);
return mBufferQueue.size();
}
void BufferedDataSource::doneSniffing() {
ALOGD("Done sniffing data");
// We are done sniffing the data to find the mime type
// No need to keep the data around that has been read anymore
mEraseOnRead = true;
}
status_t BufferedDataSource::deleteUpTo(off64_t offset) {
off64_t newOffset = offset - mOffset;
ALOGV("new offset %lld", newOffset);
if (waitForData(0, newOffset) != OK) {
if (newOffset >= mLength) {
return ERROR_END_OF_STREAM;
}
}
off64_t offsetInBuffer = newOffset;
sp<ABuffer> buffer = NULL;
for (List<sp<ABuffer> >::iterator it = mBufferQueue.begin();
it != mBufferQueue.end(); it = mBufferQueue.erase(it)) {
sp<ABuffer> b = *it;
if (offsetInBuffer < b->size()) {
buffer = b;
break;
} else {
offsetInBuffer -= b->size();
mLength -= b->size();
}
}
mLength -= offsetInBuffer;
if (buffer != NULL) {
buffer->setRange(buffer->offset() + offsetInBuffer, buffer->size() - offsetInBuffer);
if (buffer->size() == 0) {
mBufferQueue.erase(mBufferQueue.begin());
}
}
mOffset = offset;
return OK;
}
ssize_t BufferedDataSource::readAt(off64_t offset, void *data, size_t size) {
Mutex::Autolock autoLock(mLock);
return readAt_l(offset, data, size);
}
ssize_t BufferedDataSource::readAt_l(off64_t offset, void *data, size_t size) {
ALOGV("***%s ", __FUNCTION__);
ALOGV("offset %lld", offset);
ALOGV("size %d", size);
ALOGV("mLength %lld", mLength);
if (mEraseOnRead) {
// Seek the buffer queue to the given offset and delete the rest
if (deleteUpTo(offset) != OK) {
ALOGW("deleteUpTo failed due to end of stream");
return 0;
}
// All the data up to the offset has been deleted by the deleteUpTo
// function, so set the offset to 0
offset = 0;
}
size_t sizeDone = 0;
while (sizeDone < size) {
if (waitForData(offset, (size - sizeDone)) != OK) {
if (offset >= mLength) {
ALOGW("Returning early %d", sizeDone);
return sizeDone;
} else {
// Try to return as much as we can
size = mLength - offset;
}
}
size_t copy = size - sizeDone;
off64_t offsetInBuffer = offset;
sp<ABuffer> buffer = NULL;
for (List<sp<ABuffer> >::iterator it = mBufferQueue.begin();
it != mBufferQueue.end(); ++it) {
sp<ABuffer> b = *it;
if (offsetInBuffer < b->size()) {
buffer = b;
break;
} else {
offsetInBuffer -= b->size();
}
}
if (copy > (buffer->size() - offsetInBuffer)) {
copy = buffer->size() - offsetInBuffer;
}
memcpy((uint8_t *)data + sizeDone, buffer->data() + offsetInBuffer, copy);
sizeDone += copy;
offset += copy;
}
ALOGV("sizeDone %d", sizeDone);
return sizeDone;
}
/**
* Block until size bytes starting at offset are available to read
*/
status_t BufferedDataSource::waitForData(off64_t offset, size_t size) {
while (((mLength - offset) < size) &&
(mFinalResult != ERROR_END_OF_STREAM) &&
(mEraseOnRead || (mLength < HIGH_WATERMARK))) {
mCondition.wait(mLock);
}
// High watermark reached; return early
// Only check for watermark when sniffing data to avoid delay in starting
// the audio stream
if (((mLength - offset) < size) &&
(mFinalResult != ERROR_END_OF_STREAM) &&
(!mEraseOnRead && (mLength >= HIGH_WATERMARK))) {
ALOGV("Reached watermark");
return ERROR_OUT_OF_RANGE;
}
// Read beyond EOF
if ((mFinalResult == ERROR_END_OF_STREAM) && (offset >= mLength)) {
ALOGW("Read beyond EOF total: %lld", mLength);
return ERROR_END_OF_STREAM;
}
return OK;
}
void BufferedDataSource::queueBuffer(const sp<ABuffer> &buffer) {
Mutex::Autolock autoLock(mLock);
if (mFinalResult != OK) {
return;
}
mBufferQueue.push_back(buffer);
mLength += buffer->size();
mCondition.broadcast();
}
void BufferedDataSource::queueEOS(status_t finalResult) {
ALOGV("%s %d", __FUNCTION__, finalResult);
CHECK_NE(finalResult, (status_t)OK);
Mutex::Autolock autoLock(mLock);
mFinalResult = finalResult;
mCondition.broadcast();
}
void BufferedDataSource::reset() {
Mutex::Autolock autoLock(mLock);
mFinalResult = OK;
mBufferQueue.clear();
}
} // namespace android
|
Fix delay in starting an AAC stream
|
Fix delay in starting an AAC stream
|
C++
|
mit
|
silklabs/silk,silklabs/silk,silklabs/silk,silklabs/silk,silklabs/silk,silklabs/silk
|
a40723a7c4037217b72e495d5c01f8ea260f5723
|
chrome/browser/chromeos/notifications/balloon_collection_impl.cc
|
chrome/browser/chromeos/notifications/balloon_collection_impl.cc
|
// Copyright (c) 2011 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/chromeos/notifications/balloon_collection_impl.h"
#include <algorithm>
#include "base/logging.h"
#include "chrome/browser/chromeos/notifications/balloon_view.h"
#include "chrome/browser/chromeos/notifications/notification_panel.h"
#include "chrome/browser/notifications/balloon.h"
#include "chrome/browser/notifications/notification.h"
#include "chrome/browser/ui/browser_list.h"
#include "chrome/browser/ui/window_sizer.h"
#include "content/common/notification_service.h"
#include "ui/gfx/rect.h"
#include "ui/gfx/size.h"
namespace {
// Margin from the edge of the work area
const int kVerticalEdgeMargin = 5;
const int kHorizontalEdgeMargin = 5;
} // namespace
namespace chromeos {
BalloonCollectionImpl::BalloonCollectionImpl()
: notification_ui_(new NotificationPanel()) {
registrar_.Add(this, NotificationType::BROWSER_CLOSED,
NotificationService::AllSources());
}
BalloonCollectionImpl::~BalloonCollectionImpl() {
Shutdown();
}
void BalloonCollectionImpl::Add(const Notification& notification,
Profile* profile) {
Balloon* new_balloon = MakeBalloon(notification, profile);
base_.Add(new_balloon);
new_balloon->Show();
notification_ui_->Add(new_balloon);
// There may be no listener in a unit test.
if (space_change_listener_)
space_change_listener_->OnBalloonSpaceChanged();
}
bool BalloonCollectionImpl::AddWebUIMessageCallback(
const Notification& notification,
const std::string& message,
MessageCallback* callback) {
Balloon* balloon = FindBalloon(notification);
if (!balloon) {
delete callback;
return false;
}
BalloonViewHost* host =
static_cast<BalloonViewHost*>(balloon->view()->GetHost());
return host->AddWebUIMessageCallback(message, callback);
}
void BalloonCollectionImpl::AddSystemNotification(
const Notification& notification,
Profile* profile,
bool sticky,
bool control) {
Balloon* new_balloon = new Balloon(notification, profile, this);
new_balloon->set_view(
new chromeos::BalloonViewImpl(sticky, control, true));
base_.Add(new_balloon);
new_balloon->Show();
notification_ui_->Add(new_balloon);
// There may be no listener in a unit test.
if (space_change_listener_)
space_change_listener_->OnBalloonSpaceChanged();
}
bool BalloonCollectionImpl::UpdateNotification(
const Notification& notification) {
Balloon* balloon = FindBalloon(notification);
if (!balloon)
return false;
balloon->Update(notification);
notification_ui_->Update(balloon);
return true;
}
bool BalloonCollectionImpl::UpdateAndShowNotification(
const Notification& notification) {
Balloon* balloon = FindBalloon(notification);
if (!balloon)
return false;
balloon->Update(notification);
bool updated = notification_ui_->Update(balloon);
DCHECK(updated);
notification_ui_->Show(balloon);
return true;
}
bool BalloonCollectionImpl::RemoveById(const std::string& id) {
return base_.CloseById(id);
}
bool BalloonCollectionImpl::RemoveBySourceOrigin(const GURL& origin) {
return base_.CloseAllBySourceOrigin(origin);
}
void BalloonCollectionImpl::RemoveAll() {
base_.CloseAll();
}
bool BalloonCollectionImpl::HasSpace() const {
return true;
}
void BalloonCollectionImpl::ResizeBalloon(Balloon* balloon,
const gfx::Size& size) {
notification_ui_->ResizeNotification(balloon, size);
}
void BalloonCollectionImpl::OnBalloonClosed(Balloon* source) {
notification_ui_->Remove(source);
base_.Remove(source);
// There may be no listener in a unit test.
if (space_change_listener_)
space_change_listener_->OnBalloonSpaceChanged();
}
const BalloonCollectionImpl::Balloons&
BalloonCollectionImpl::GetActiveBalloons() {
return base_.balloons();
}
void BalloonCollectionImpl::Observe(NotificationType type,
const NotificationSource& source,
const NotificationDetails& details) {
DCHECK(type == NotificationType::BROWSER_CLOSED);
bool app_closing = *Details<bool>(details).ptr();
// When exiting, we need to shutdown all renderers in
// BalloonViewImpl before IO thread gets deleted in the
// BrowserProcessImpl's destructor. See http://crbug.com/40810
// for details.
if (app_closing)
RemoveAll();
}
void BalloonCollectionImpl::Shutdown() {
// We need to remove the panel first because deleting
// views that are not owned by parent will not remove
// themselves from the parent.
DVLOG(1) << "Shutting down notification UI";
notification_ui_.reset();
}
Balloon* BalloonCollectionImpl::MakeBalloon(const Notification& notification,
Profile* profile) {
Balloon* new_balloon = new Balloon(notification, profile, this);
new_balloon->set_view(new chromeos::BalloonViewImpl(false, true, false));
return new_balloon;
}
} // namespace chromeos
// static
BalloonCollection* BalloonCollection::Create() {
return new chromeos::BalloonCollectionImpl();
}
|
// Copyright (c) 2011 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/chromeos/notifications/balloon_collection_impl.h"
#include <algorithm>
#include "base/logging.h"
#include "chrome/browser/chromeos/notifications/balloon_view.h"
#include "chrome/browser/chromeos/notifications/notification_panel.h"
#include "chrome/browser/notifications/balloon.h"
#include "chrome/browser/notifications/notification.h"
#include "chrome/browser/ui/browser_list.h"
#include "chrome/browser/ui/window_sizer.h"
#include "content/common/notification_service.h"
#include "ui/gfx/rect.h"
#include "ui/gfx/size.h"
namespace {
// Margin from the edge of the work area
const int kVerticalEdgeMargin = 5;
const int kHorizontalEdgeMargin = 5;
} // namespace
namespace chromeos {
BalloonCollectionImpl::BalloonCollectionImpl()
: notification_ui_(new NotificationPanel()) {
registrar_.Add(this, NotificationType::BROWSER_CLOSED,
NotificationService::AllSources());
}
BalloonCollectionImpl::~BalloonCollectionImpl() {
Shutdown();
}
void BalloonCollectionImpl::Add(const Notification& notification,
Profile* profile) {
Balloon* new_balloon = MakeBalloon(notification, profile);
base_.Add(new_balloon);
new_balloon->Show();
notification_ui_->Add(new_balloon);
// There may be no listener in a unit test.
if (space_change_listener_)
space_change_listener_->OnBalloonSpaceChanged();
// This is used only for testing.
if (on_collection_changed_callback_.get())
on_collection_changed_callback_->Run();
}
bool BalloonCollectionImpl::AddWebUIMessageCallback(
const Notification& notification,
const std::string& message,
MessageCallback* callback) {
Balloon* balloon = FindBalloon(notification);
if (!balloon) {
delete callback;
return false;
}
BalloonViewHost* host =
static_cast<BalloonViewHost*>(balloon->view()->GetHost());
return host->AddWebUIMessageCallback(message, callback);
}
void BalloonCollectionImpl::AddSystemNotification(
const Notification& notification,
Profile* profile,
bool sticky,
bool control) {
Balloon* new_balloon = new Balloon(notification, profile, this);
new_balloon->set_view(
new chromeos::BalloonViewImpl(sticky, control, true));
base_.Add(new_balloon);
new_balloon->Show();
notification_ui_->Add(new_balloon);
// There may be no listener in a unit test.
if (space_change_listener_)
space_change_listener_->OnBalloonSpaceChanged();
}
bool BalloonCollectionImpl::UpdateNotification(
const Notification& notification) {
Balloon* balloon = FindBalloon(notification);
if (!balloon)
return false;
balloon->Update(notification);
notification_ui_->Update(balloon);
return true;
}
bool BalloonCollectionImpl::UpdateAndShowNotification(
const Notification& notification) {
Balloon* balloon = FindBalloon(notification);
if (!balloon)
return false;
balloon->Update(notification);
bool updated = notification_ui_->Update(balloon);
DCHECK(updated);
notification_ui_->Show(balloon);
return true;
}
bool BalloonCollectionImpl::RemoveById(const std::string& id) {
return base_.CloseById(id);
}
bool BalloonCollectionImpl::RemoveBySourceOrigin(const GURL& origin) {
return base_.CloseAllBySourceOrigin(origin);
}
void BalloonCollectionImpl::RemoveAll() {
base_.CloseAll();
}
bool BalloonCollectionImpl::HasSpace() const {
return true;
}
void BalloonCollectionImpl::ResizeBalloon(Balloon* balloon,
const gfx::Size& size) {
notification_ui_->ResizeNotification(balloon, size);
}
void BalloonCollectionImpl::OnBalloonClosed(Balloon* source) {
notification_ui_->Remove(source);
base_.Remove(source);
// There may be no listener in a unit test.
if (space_change_listener_)
space_change_listener_->OnBalloonSpaceChanged();
// This is used only for testing.
if (on_collection_changed_callback_.get())
on_collection_changed_callback_->Run();
}
const BalloonCollectionImpl::Balloons&
BalloonCollectionImpl::GetActiveBalloons() {
return base_.balloons();
}
void BalloonCollectionImpl::Observe(NotificationType type,
const NotificationSource& source,
const NotificationDetails& details) {
DCHECK(type == NotificationType::BROWSER_CLOSED);
bool app_closing = *Details<bool>(details).ptr();
// When exiting, we need to shutdown all renderers in
// BalloonViewImpl before IO thread gets deleted in the
// BrowserProcessImpl's destructor. See http://crbug.com/40810
// for details.
if (app_closing)
RemoveAll();
}
void BalloonCollectionImpl::Shutdown() {
// We need to remove the panel first because deleting
// views that are not owned by parent will not remove
// themselves from the parent.
DVLOG(1) << "Shutting down notification UI";
notification_ui_.reset();
}
Balloon* BalloonCollectionImpl::MakeBalloon(const Notification& notification,
Profile* profile) {
Balloon* new_balloon = new Balloon(notification, profile, this);
new_balloon->set_view(new chromeos::BalloonViewImpl(false, true, false));
return new_balloon;
}
} // namespace chromeos
// static
BalloonCollection* BalloonCollection::Create() {
return new chromeos::BalloonCollectionImpl();
}
|
Call on_collection_changed_callback_ on chromeos
|
Call on_collection_changed_callback_ on chromeos
BUG=81624,chromium-os:15176
TEST=pyauto notification will pass
Review URL: http://codereview.chromium.org/7146027
git-svn-id: de016e52bd170d2d4f2344f9bf92d50478b649e0@89368 0039d316-1c4b-4281-b951-d872f2087c98
|
C++
|
bsd-3-clause
|
rogerwang/chromium,Fireblend/chromium-crosswalk,anirudhSK/chromium,axinging/chromium-crosswalk,markYoungH/chromium.src,zcbenz/cefode-chromium,rogerwang/chromium,krieger-od/nwjs_chromium.src,axinging/chromium-crosswalk,rogerwang/chromium,krieger-od/nwjs_chromium.src,ChromiumWebApps/chromium,pozdnyakov/chromium-crosswalk,markYoungH/chromium.src,M4sse/chromium.src,PeterWangIntel/chromium-crosswalk,Fireblend/chromium-crosswalk,ondra-novak/chromium.src,keishi/chromium,ChromiumWebApps/chromium,jaruba/chromium.src,ondra-novak/chromium.src,dushu1203/chromium.src,Just-D/chromium-1,timopulkkinen/BubbleFish,fujunwei/chromium-crosswalk,anirudhSK/chromium,timopulkkinen/BubbleFish,littlstar/chromium.src,PeterWangIntel/chromium-crosswalk,Fireblend/chromium-crosswalk,Just-D/chromium-1,Fireblend/chromium-crosswalk,Pluto-tv/chromium-crosswalk,patrickm/chromium.src,junmin-zhu/chromium-rivertrail,bright-sparks/chromium-spacewalk,jaruba/chromium.src,robclark/chromium,zcbenz/cefode-chromium,crosswalk-project/chromium-crosswalk-efl,bright-sparks/chromium-spacewalk,rogerwang/chromium,patrickm/chromium.src,ChromiumWebApps/chromium,Jonekee/chromium.src,robclark/chromium,hgl888/chromium-crosswalk-efl,littlstar/chromium.src,junmin-zhu/chromium-rivertrail,zcbenz/cefode-chromium,Pluto-tv/chromium-crosswalk,pozdnyakov/chromium-crosswalk,ltilve/chromium,mogoweb/chromium-crosswalk,crosswalk-project/chromium-crosswalk-efl,littlstar/chromium.src,krieger-od/nwjs_chromium.src,PeterWangIntel/chromium-crosswalk,PeterWangIntel/chromium-crosswalk,mohamed--abdel-maksoud/chromium.src,Fireblend/chromium-crosswalk,M4sse/chromium.src,ltilve/chromium,mohamed--abdel-maksoud/chromium.src,keishi/chromium,zcbenz/cefode-chromium,anirudhSK/chromium,Just-D/chromium-1,Chilledheart/chromium,zcbenz/cefode-chromium,nacl-webkit/chrome_deps,TheTypoMaster/chromium-crosswalk,robclark/chromium,patrickm/chromium.src,rogerwang/chromium,ltilve/chromium,TheTypoMaster/chromium-crosswalk,crosswalk-project/chromium-crosswalk-efl,jaruba/chromium.src,bright-sparks/chromium-spacewalk,Pluto-tv/chromium-crosswalk,Jonekee/chromium.src,mohamed--abdel-maksoud/chromium.src,jaruba/chromium.src,hgl888/chromium-crosswalk,junmin-zhu/chromium-rivertrail,dednal/chromium.src,dednal/chromium.src,anirudhSK/chromium,hgl888/chromium-crosswalk-efl,anirudhSK/chromium,mogoweb/chromium-crosswalk,bright-sparks/chromium-spacewalk,M4sse/chromium.src,mogoweb/chromium-crosswalk,littlstar/chromium.src,Jonekee/chromium.src,chuan9/chromium-crosswalk,dednal/chromium.src,dushu1203/chromium.src,Pluto-tv/chromium-crosswalk,patrickm/chromium.src,zcbenz/cefode-chromium,junmin-zhu/chromium-rivertrail,Pluto-tv/chromium-crosswalk,pozdnyakov/chromium-crosswalk,ChromiumWebApps/chromium,Just-D/chromium-1,jaruba/chromium.src,M4sse/chromium.src,pozdnyakov/chromium-crosswalk,timopulkkinen/BubbleFish,mogoweb/chromium-crosswalk,Just-D/chromium-1,keishi/chromium,Chilledheart/chromium,Jonekee/chromium.src,rogerwang/chromium,Chilledheart/chromium,axinging/chromium-crosswalk,pozdnyakov/chromium-crosswalk,anirudhSK/chromium,hujiajie/pa-chromium,mogoweb/chromium-crosswalk,littlstar/chromium.src,hgl888/chromium-crosswalk,hgl888/chromium-crosswalk,Fireblend/chromium-crosswalk,ChromiumWebApps/chromium,axinging/chromium-crosswalk,mohamed--abdel-maksoud/chromium.src,anirudhSK/chromium,jaruba/chromium.src,junmin-zhu/chromium-rivertrail,Pluto-tv/chromium-crosswalk,mohamed--abdel-maksoud/chromium.src,robclark/chromium,robclark/chromium,chuan9/chromium-crosswalk,chuan9/chromium-crosswalk,fujunwei/chromium-crosswalk,junmin-zhu/chromium-rivertrail,krieger-od/nwjs_chromium.src,Just-D/chromium-1,chuan9/chromium-crosswalk,mogoweb/chromium-crosswalk,PeterWangIntel/chromium-crosswalk,hujiajie/pa-chromium,crosswalk-project/chromium-crosswalk-efl,Jonekee/chromium.src,Fireblend/chromium-crosswalk,markYoungH/chromium.src,hgl888/chromium-crosswalk-efl,markYoungH/chromium.src,axinging/chromium-crosswalk,ltilve/chromium,timopulkkinen/BubbleFish,keishi/chromium,chuan9/chromium-crosswalk,hujiajie/pa-chromium,timopulkkinen/BubbleFish,dushu1203/chromium.src,nacl-webkit/chrome_deps,axinging/chromium-crosswalk,crosswalk-project/chromium-crosswalk-efl,fujunwei/chromium-crosswalk,jaruba/chromium.src,crosswalk-project/chromium-crosswalk-efl,robclark/chromium,timopulkkinen/BubbleFish,PeterWangIntel/chromium-crosswalk,M4sse/chromium.src,Chilledheart/chromium,mohamed--abdel-maksoud/chromium.src,hgl888/chromium-crosswalk,krieger-od/nwjs_chromium.src,rogerwang/chromium,PeterWangIntel/chromium-crosswalk,dushu1203/chromium.src,dednal/chromium.src,krieger-od/nwjs_chromium.src,hgl888/chromium-crosswalk-efl,mogoweb/chromium-crosswalk,Chilledheart/chromium,Chilledheart/chromium,keishi/chromium,M4sse/chromium.src,axinging/chromium-crosswalk,krieger-od/nwjs_chromium.src,markYoungH/chromium.src,fujunwei/chromium-crosswalk,markYoungH/chromium.src,pozdnyakov/chromium-crosswalk,ChromiumWebApps/chromium,axinging/chromium-crosswalk,ltilve/chromium,nacl-webkit/chrome_deps,patrickm/chromium.src,ChromiumWebApps/chromium,crosswalk-project/chromium-crosswalk-efl,markYoungH/chromium.src,PeterWangIntel/chromium-crosswalk,fujunwei/chromium-crosswalk,robclark/chromium,TheTypoMaster/chromium-crosswalk,robclark/chromium,nacl-webkit/chrome_deps,hgl888/chromium-crosswalk-efl,patrickm/chromium.src,keishi/chromium,TheTypoMaster/chromium-crosswalk,rogerwang/chromium,robclark/chromium,patrickm/chromium.src,timopulkkinen/BubbleFish,hgl888/chromium-crosswalk,keishi/chromium,anirudhSK/chromium,Jonekee/chromium.src,junmin-zhu/chromium-rivertrail,Pluto-tv/chromium-crosswalk,patrickm/chromium.src,ltilve/chromium,Fireblend/chromium-crosswalk,markYoungH/chromium.src,hujiajie/pa-chromium,bright-sparks/chromium-spacewalk,crosswalk-project/chromium-crosswalk-efl,mohamed--abdel-maksoud/chromium.src,nacl-webkit/chrome_deps,hujiajie/pa-chromium,timopulkkinen/BubbleFish,keishi/chromium,Just-D/chromium-1,bright-sparks/chromium-spacewalk,fujunwei/chromium-crosswalk,nacl-webkit/chrome_deps,timopulkkinen/BubbleFish,dushu1203/chromium.src,pozdnyakov/chromium-crosswalk,Pluto-tv/chromium-crosswalk,hgl888/chromium-crosswalk-efl,anirudhSK/chromium,keishi/chromium,Chilledheart/chromium,M4sse/chromium.src,Jonekee/chromium.src,junmin-zhu/chromium-rivertrail,ondra-novak/chromium.src,bright-sparks/chromium-spacewalk,ChromiumWebApps/chromium,chuan9/chromium-crosswalk,dushu1203/chromium.src,hgl888/chromium-crosswalk,dushu1203/chromium.src,ondra-novak/chromium.src,hgl888/chromium-crosswalk,chuan9/chromium-crosswalk,bright-sparks/chromium-spacewalk,anirudhSK/chromium,rogerwang/chromium,pozdnyakov/chromium-crosswalk,patrickm/chromium.src,junmin-zhu/chromium-rivertrail,Jonekee/chromium.src,axinging/chromium-crosswalk,ondra-novak/chromium.src,robclark/chromium,mogoweb/chromium-crosswalk,dushu1203/chromium.src,krieger-od/nwjs_chromium.src,mogoweb/chromium-crosswalk,Pluto-tv/chromium-crosswalk,keishi/chromium,TheTypoMaster/chromium-crosswalk,dednal/chromium.src,zcbenz/cefode-chromium,ChromiumWebApps/chromium,Jonekee/chromium.src,mogoweb/chromium-crosswalk,ondra-novak/chromium.src,PeterWangIntel/chromium-crosswalk,anirudhSK/chromium,dednal/chromium.src,TheTypoMaster/chromium-crosswalk,dednal/chromium.src,pozdnyakov/chromium-crosswalk,jaruba/chromium.src,Fireblend/chromium-crosswalk,ltilve/chromium,TheTypoMaster/chromium-crosswalk,littlstar/chromium.src,ondra-novak/chromium.src,Chilledheart/chromium,TheTypoMaster/chromium-crosswalk,mohamed--abdel-maksoud/chromium.src,nacl-webkit/chrome_deps,jaruba/chromium.src,fujunwei/chromium-crosswalk,mohamed--abdel-maksoud/chromium.src,zcbenz/cefode-chromium,timopulkkinen/BubbleFish,nacl-webkit/chrome_deps,ltilve/chromium,zcbenz/cefode-chromium,hgl888/chromium-crosswalk-efl,nacl-webkit/chrome_deps,littlstar/chromium.src,axinging/chromium-crosswalk,timopulkkinen/BubbleFish,dushu1203/chromium.src,crosswalk-project/chromium-crosswalk-efl,ChromiumWebApps/chromium,junmin-zhu/chromium-rivertrail,Jonekee/chromium.src,hujiajie/pa-chromium,M4sse/chromium.src,Jonekee/chromium.src,keishi/chromium,markYoungH/chromium.src,dednal/chromium.src,jaruba/chromium.src,hujiajie/pa-chromium,bright-sparks/chromium-spacewalk,zcbenz/cefode-chromium,hujiajie/pa-chromium,ltilve/chromium,jaruba/chromium.src,hgl888/chromium-crosswalk,junmin-zhu/chromium-rivertrail,Chilledheart/chromium,chuan9/chromium-crosswalk,dednal/chromium.src,markYoungH/chromium.src,dednal/chromium.src,markYoungH/chromium.src,chuan9/chromium-crosswalk,hgl888/chromium-crosswalk-efl,M4sse/chromium.src,fujunwei/chromium-crosswalk,ondra-novak/chromium.src,krieger-od/nwjs_chromium.src,krieger-od/nwjs_chromium.src,mohamed--abdel-maksoud/chromium.src,pozdnyakov/chromium-crosswalk,hujiajie/pa-chromium,ChromiumWebApps/chromium,dednal/chromium.src,zcbenz/cefode-chromium,M4sse/chromium.src,ChromiumWebApps/chromium,rogerwang/chromium,nacl-webkit/chrome_deps,Just-D/chromium-1,hgl888/chromium-crosswalk-efl,axinging/chromium-crosswalk,ondra-novak/chromium.src,hujiajie/pa-chromium,anirudhSK/chromium,nacl-webkit/chrome_deps,dushu1203/chromium.src,Just-D/chromium-1,M4sse/chromium.src,fujunwei/chromium-crosswalk,hgl888/chromium-crosswalk,hujiajie/pa-chromium,littlstar/chromium.src,hgl888/chromium-crosswalk-efl,dushu1203/chromium.src,TheTypoMaster/chromium-crosswalk,pozdnyakov/chromium-crosswalk,krieger-od/nwjs_chromium.src,mohamed--abdel-maksoud/chromium.src
|
5414620759a9765b48020f4cd75ba07070f31d75
|
Modules/ModelFit/src/Models/mitkExpDecayOffsetModel.cpp
|
Modules/ModelFit/src/Models/mitkExpDecayOffsetModel.cpp
|
/*============================================================================
The Medical Imaging Interaction Toolkit (MITK)
Copyright (c) German Cancer Research Center (DKFZ)
All rights reserved.
Use of this source code is governed by a 3-clause BSD license that can be
found in the LICENSE file.
============================================================================*/
#include "mitkExpDecayOffsetModel.h"
std::string mitk::ExpDecayOffsetModel::GetModelDisplayName() const
{
return "Exponential Decay Offset Model";
};
std::string mitk::ExpDecayOffsetModel::GetModelType() const
{
return "MRSignal";
};
mitk::ExpDecayOffsetModel::FunctionStringType mitk::ExpDecayOffsetModel::GetFunctionString() const
{
return "a*exp(-1.0*x*b)+c";
};
std::string mitk::ExpDecayOffsetModel::GetXName() const
{
return "x";
};
mitk::ExpDecayOffsetModel::ParameterNamesType
mitk::ExpDecayOffsetModel::GetParameterNames() const
{
ParameterNamesType result;
result.push_back("a");
result.push_back("b");
result.push_back("c");
return result;
};
mitk::ExpDecayOffsetModel::ParametersSizeType
mitk::ExpDecayOffsetModel::GetNumberOfParameters() const
{
return 3;
};
mitk::ExpDecayOffsetModel::ModelResultType
mitk::ExpDecayOffsetModel::ComputeModelfunction(const ParametersType& parameters) const
{
ModelResultType signal(m_TimeGrid.GetSize());
const auto timeGridEnd = m_TimeGrid.end();
ModelResultType::iterator signalPos = signal.begin();
for (auto gridPos = m_TimeGrid.begin(); gridPos != timeGridEnd;
++gridPos, ++signalPos)
{
*signalPos = parameters[0] * exp(-1.0 * (*gridPos) * parameters[1]) + parameters[2];
}
return signal;
};
mitk::ExpDecayOffsetModel::ParameterNamesType mitk::ExpDecayOffsetModel::GetStaticParameterNames() const
{
return {};
}
mitk::ExpDecayOffsetModel::ParametersSizeType mitk::ExpDecayOffsetModel::GetNumberOfStaticParameters() const
{
return 0;
}
void mitk::ExpDecayOffsetModel::SetStaticParameter(const ParameterNameType& /*name*/,
const StaticParameterValuesType& /*values*/)
{
//do nothing
};
mitk::ExpDecayOffsetModel::StaticParameterValuesType mitk::ExpDecayOffsetModel::GetStaticParameterValue(
const ParameterNameType& /*name*/) const
{
StaticParameterValuesType result;
//do nothing
return result;
};
itk::LightObject::Pointer mitk::ExpDecayOffsetModel::InternalClone() const
{
ExpDecayOffsetModel::Pointer newClone = ExpDecayOffsetModel::New();
newClone->SetTimeGrid(this->m_TimeGrid);
return newClone.GetPointer();
};
|
/*============================================================================
The Medical Imaging Interaction Toolkit (MITK)
Copyright (c) German Cancer Research Center (DKFZ)
All rights reserved.
Use of this source code is governed by a 3-clause BSD license that can be
found in the LICENSE file.
============================================================================*/
#include "mitkExpDecayOffsetModel.h"
std::string mitk::ExpDecayOffsetModel::GetModelDisplayName() const
{
return "Exponential Decay Offset Model";
};
std::string mitk::ExpDecayOffsetModel::GetModelType() const
{
return "Generic";
};
mitk::ExpDecayOffsetModel::FunctionStringType mitk::ExpDecayOffsetModel::GetFunctionString() const
{
return "a*exp(-1.0*x*b)+c";
};
std::string mitk::ExpDecayOffsetModel::GetXName() const
{
return "x";
};
mitk::ExpDecayOffsetModel::ParameterNamesType
mitk::ExpDecayOffsetModel::GetParameterNames() const
{
ParameterNamesType result;
result.push_back("a");
result.push_back("b");
result.push_back("c");
return result;
};
mitk::ExpDecayOffsetModel::ParametersSizeType
mitk::ExpDecayOffsetModel::GetNumberOfParameters() const
{
return 3;
};
mitk::ExpDecayOffsetModel::ModelResultType
mitk::ExpDecayOffsetModel::ComputeModelfunction(const ParametersType& parameters) const
{
ModelResultType signal(m_TimeGrid.GetSize());
const auto timeGridEnd = m_TimeGrid.end();
ModelResultType::iterator signalPos = signal.begin();
for (auto gridPos = m_TimeGrid.begin(); gridPos != timeGridEnd;
++gridPos, ++signalPos)
{
*signalPos = parameters[0] * exp(-1.0 * (*gridPos) * parameters[1]) + parameters[2];
}
return signal;
};
mitk::ExpDecayOffsetModel::ParameterNamesType mitk::ExpDecayOffsetModel::GetStaticParameterNames() const
{
return {};
}
mitk::ExpDecayOffsetModel::ParametersSizeType mitk::ExpDecayOffsetModel::GetNumberOfStaticParameters() const
{
return 0;
}
void mitk::ExpDecayOffsetModel::SetStaticParameter(const ParameterNameType& /*name*/,
const StaticParameterValuesType& /*values*/)
{
//do nothing
};
mitk::ExpDecayOffsetModel::StaticParameterValuesType mitk::ExpDecayOffsetModel::GetStaticParameterValue(
const ParameterNameType& /*name*/) const
{
StaticParameterValuesType result;
//do nothing
return result;
};
itk::LightObject::Pointer mitk::ExpDecayOffsetModel::InternalClone() const
{
ExpDecayOffsetModel::Pointer newClone = ExpDecayOffsetModel::New();
newClone->SetTimeGrid(this->m_TimeGrid);
return newClone.GetPointer();
};
|
make ModelType of ExpDecayOffsetModel Generic
|
make ModelType of ExpDecayOffsetModel Generic
|
C++
|
bsd-3-clause
|
MITK/MITK,MITK/MITK,MITK/MITK,MITK/MITK,MITK/MITK,MITK/MITK
|
36bc608a8d477f27556ed65b5f530f882145c16f
|
src/plugin.cpp
|
src/plugin.cpp
|
/*
Copyright (c) 2011, The Mineserver Project
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the The Mineserver Project nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "sys/stat.h"
#include "mineserver.h"
#ifdef WIN32
#include <windows.h>
#else
#include <dlfcn.h>
#endif
#include "constants.h"
#include "logger.h"
#include "plugin.h"
#include "blocks/default.h"
#include "blocks/falling.h"
#include "blocks/torch.h"
#include "blocks/plant.h"
#include "blocks/snow.h"
#include "blocks/liquid.h"
#include "blocks/fire.h"
#include "blocks/stair.h"
#include "blocks/door.h"
#include "blocks/sign.h"
#include "blocks/tracks.h"
#include "blocks/chest.h"
#include "blocks/ladder.h"
#include "blocks/leaves.h"
#include "blocks/cake.h"
#include "blocks/note.h"
#include "blocks/blockfurnace.h"
#include "blocks/workbench.h"
#include "blocks/wood.h"
#include "blocks/redstone.h"
#include "blocks/pumpkin.h"
#include "blocks/step.h"
#include "blocks/bed.h"
#include "blocks/wool.h"
#include "blocks/jackolantern.h"
#include "items/food.h"
#include "items/projectile.h"
void Plugin::init()
{
// Create Block* objects and put them away so we can delete them later
BlockRedstone* redstoneblock = new BlockRedstone();
BlockCB.push_back(redstoneblock);
BlockWood* woodblock = new BlockWood();
BlockCB.push_back(woodblock);
BlockFalling* fallingblock = new BlockFalling();
BlockCB.push_back(fallingblock);
BlockTorch* torchblock = new BlockTorch();
BlockCB.push_back(torchblock);
BlockPlant* plantblock = new BlockPlant();
BlockCB.push_back(plantblock);
BlockSnow* snowblock = new BlockSnow();
BlockCB.push_back(snowblock);
BlockLiquid* liquidblock = new BlockLiquid();
BlockCB.push_back(liquidblock);
BlockFire* fireblock = new BlockFire();
BlockCB.push_back(fireblock);
BlockStair* stairblock = new BlockStair();
BlockCB.push_back(stairblock);
BlockChest* chestblock = new BlockChest();
BlockCB.push_back(chestblock);
BlockDoor* doorblock = new BlockDoor();
BlockCB.push_back(doorblock);
BlockSign* signblock = new BlockSign();
BlockCB.push_back(signblock);
BlockTracks* tracksblock = new BlockTracks();
BlockCB.push_back(tracksblock);
BlockLadder* ladderblock = new BlockLadder();
BlockCB.push_back(ladderblock);
BlockLeaves* leavesblock = new BlockLeaves();
BlockCB.push_back(leavesblock);
BlockCake* cakeblock = new BlockCake();
BlockCB.push_back(cakeblock);
BlockNote* noteblock = new BlockNote();
BlockCB.push_back(noteblock);
BlockFurnace* furnaceblock = new BlockFurnace();
BlockCB.push_back(furnaceblock);
BlockWorkbench* workbenchblock = new BlockWorkbench();
BlockCB.push_back(workbenchblock);
BlockPumpkin* pumpkinblock = new BlockPumpkin();
BlockCB.push_back(pumpkinblock);
BlockStep* stepblock = new BlockStep();
BlockCB.push_back(stepblock);
BlockBed* bedblock = new BlockBed();
BlockCB.push_back(bedblock);
BlockWool* woolblock = new BlockWool();
BlockCB.push_back(woolblock);
Blockjackolantern* jackolanternblock = new Blockjackolantern();
BlockCB.push_back(jackolanternblock);
BlockDefault* defaultblock = new BlockDefault();
BlockCB.push_back(defaultblock);
ItemFood* fooditem = new ItemFood();
ItemCB.push_back(fooditem);
ItemProjectile* projectileitem = new ItemProjectile();
ItemCB.push_back(projectileitem);
}
void Plugin::free()
{
std::vector<BlockBasic*>::iterator it = BlockCB.begin();
for (; it != BlockCB.end(); ++it)
{
delete *it;
}
}
typedef void (*pfms)(mineserver_pointer_struct*);
typedef void (*pfv)();
bool Plugin::loadPlugin(const std::string& name, const std::string& path, std::string alias)
{
LIBRARY_HANDLE lhandle = NULL;
pfms fhandle = NULL;
if (name.empty()
|| (name.find('/') != std::string::npos)
|| (name.find('\\') != std::string::npos))
{
LOG(INFO, "Plugin", "Invalid name: " + name);
return false;
}
if (alias.empty())
{
alias = name;
}
if (!path.empty())
{
std::string file;
file = path + '/' + name + LIBRARY_EXTENSION;
struct stat st;
int statr = stat(file.c_str(), &st);
if ((statr == 0) && !(st.st_mode & S_IFDIR))
{
LOG(INFO, "Plugin", "Loading: " + file);
lhandle = LIBRARY_LOAD(file.c_str());
}
else
{
LOG(INFO, "Plugin", "Could not find: " + file);
return false;
}
}
else
{
LOG(INFO, "Plugin", "Loading built-in: " + name);
lhandle = LIBRARY_SELF();
}
if (lhandle == NULL)
{
LOG(INFO, "Plugin", "Could not load: " + name);
LOG(INFO, "Plugin", LIBRARY_ERROR());
return false;
}
m_libraryHandles[alias] = lhandle;
*reinterpret_cast<void**>(&fhandle) = LIBRARY_SYMBOL(lhandle, (name + "_init").c_str());
if (fhandle == NULL)
{
LOG(INFO, "Plugin", "Could not get init function handle!");
unloadPlugin(alias);
return false;
}
fhandle(&plugin_api_pointers);
return true;
}
void Plugin::unloadPlugin(const std::string name)
{
LIBRARY_HANDLE lhandle = NULL;
pfv fhandle = NULL;
if (m_pluginVersions.find(name) != m_pluginVersions.end())
{
LOG(INFO, "Plugin", "Unloading: " + name);
if (m_libraryHandles[name] != NULL)
{
lhandle = m_libraryHandles[name];
m_libraryHandles.erase(name);
}
else
{
lhandle = LIBRARY_SELF();
}
*reinterpret_cast<void**>(&fhandle) = LIBRARY_SYMBOL(lhandle, (name + "_shutdown").c_str());
if (fhandle == NULL)
{
LOG(INFO, "Plugin", "Could not get shutdown function handle!");
}
else
{
LOG(INFO, "Plugin", "Calling shutdown function for: " + name);
fhandle();
}
LIBRARY_CLOSE(m_libraryHandles[name]);
}
else
{
LOG(WARNING, "Plugin", name + " is not loaded!");
}
}
bool Plugin::hasHook(const std::string& name) const
{
return m_hooks.find(name) != m_hooks.end();
}
Hook* Plugin::getHook(const std::string& name) const
{
std::map<std::string, Hook*>::const_iterator hook = m_hooks.find(name);
if (hook == m_hooks.end())
{
return NULL;
}
return hook->second;
}
void Plugin::setHook(const std::string& name, Hook* hook)
{
m_hooks[name] = hook;
}
void Plugin::remHook(const std::string& name)
{
if (hasHook(name))
{
m_hooks.erase(name);
}
}
bool Plugin::hasPluginVersion(const std::string& name) const
{
return m_pluginVersions.find(name) != m_pluginVersions.end();
}
float Plugin::getPluginVersion(const std::string& name) const
{
std::map<std::string, float>::const_iterator pluginVersion = m_pluginVersions.find(name);
if (pluginVersion == m_pluginVersions.end())
{
return 0.0f;
}
return pluginVersion->second;
}
void Plugin::setPluginVersion(const std::string& name, float version)
{
m_pluginVersions[name] = version;
}
void Plugin::remPluginVersion(const std::string& name)
{
if (hasPluginVersion(name))
{
m_pluginVersions.erase(name);
}
}
bool Plugin::hasPointer(const std::string& name) const
{
return m_pointers.find(name) != m_pointers.end();
}
void* Plugin::getPointer(const std::string& name) const
{
std::map<std::string, void*>::const_iterator pointer = m_pointers.find(name);
if (pointer == m_pointers.end())
{
return NULL;
}
return pointer->second;
}
void Plugin::setPointer(const std::string& name, void* pointer)
{
m_pointers[name] = pointer;
}
void Plugin::remPointer(const std::string& name)
{
if (hasPointer(name))
{
m_pointers.erase(name);
}
}
|
/*
Copyright (c) 2011, The Mineserver Project
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the The Mineserver Project nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "sys/stat.h"
#include "mineserver.h"
#ifdef WIN32
#include <windows.h>
#else
#include <dlfcn.h>
#endif
#include "constants.h"
#include "logger.h"
#include "plugin.h"
#include "blocks/default.h"
#include "blocks/falling.h"
#include "blocks/torch.h"
#include "blocks/plant.h"
#include "blocks/snow.h"
#include "blocks/liquid.h"
#include "blocks/fire.h"
#include "blocks/stair.h"
#include "blocks/door.h"
#include "blocks/sign.h"
#include "blocks/tracks.h"
#include "blocks/chest.h"
#include "blocks/ladder.h"
#include "blocks/leaves.h"
#include "blocks/cake.h"
#include "blocks/note.h"
#include "blocks/blockfurnace.h"
#include "blocks/workbench.h"
#include "blocks/wood.h"
#include "blocks/redstone.h"
#include "blocks/pumpkin.h"
#include "blocks/step.h"
#include "blocks/bed.h"
#include "blocks/wool.h"
#include "blocks/jackolantern.h"
#include "items/food.h"
#include "items/projectile.h"
void Plugin::init()
{
// Create Block* objects and put them away so we can delete them later
BlockRedstone* redstoneblock = new BlockRedstone();
BlockCB.push_back(redstoneblock);
BlockWood* woodblock = new BlockWood();
BlockCB.push_back(woodblock);
BlockFalling* fallingblock = new BlockFalling();
BlockCB.push_back(fallingblock);
BlockTorch* torchblock = new BlockTorch();
BlockCB.push_back(torchblock);
BlockPlant* plantblock = new BlockPlant();
BlockCB.push_back(plantblock);
BlockSnow* snowblock = new BlockSnow();
BlockCB.push_back(snowblock);
BlockLiquid* liquidblock = new BlockLiquid();
BlockCB.push_back(liquidblock);
BlockFire* fireblock = new BlockFire();
BlockCB.push_back(fireblock);
BlockStair* stairblock = new BlockStair();
BlockCB.push_back(stairblock);
BlockChest* chestblock = new BlockChest();
BlockCB.push_back(chestblock);
BlockDoor* doorblock = new BlockDoor();
BlockCB.push_back(doorblock);
BlockSign* signblock = new BlockSign();
BlockCB.push_back(signblock);
BlockTracks* tracksblock = new BlockTracks();
BlockCB.push_back(tracksblock);
BlockLadder* ladderblock = new BlockLadder();
BlockCB.push_back(ladderblock);
BlockLeaves* leavesblock = new BlockLeaves();
BlockCB.push_back(leavesblock);
BlockCake* cakeblock = new BlockCake();
BlockCB.push_back(cakeblock);
BlockNote* noteblock = new BlockNote();
BlockCB.push_back(noteblock);
BlockFurnace* furnaceblock = new BlockFurnace();
BlockCB.push_back(furnaceblock);
BlockWorkbench* workbenchblock = new BlockWorkbench();
BlockCB.push_back(workbenchblock);
BlockPumpkin* pumpkinblock = new BlockPumpkin();
BlockCB.push_back(pumpkinblock);
BlockStep* stepblock = new BlockStep();
BlockCB.push_back(stepblock);
BlockBed* bedblock = new BlockBed();
BlockCB.push_back(bedblock);
BlockWool* woolblock = new BlockWool();
BlockCB.push_back(woolblock);
Blockjackolantern* jackolanternblock = new Blockjackolantern();
BlockCB.push_back(jackolanternblock);
BlockDefault* defaultblock = new BlockDefault();
BlockCB.push_back(defaultblock);
ItemFood* fooditem = new ItemFood();
ItemCB.push_back(fooditem);
ItemProjectile* projectileitem = new ItemProjectile();
ItemCB.push_back(projectileitem);
}
void Plugin::free()
{
std::vector<BlockBasic*>::iterator it = BlockCB.begin();
for (; it != BlockCB.end(); ++it)
{
delete *it;
}
}
typedef void (*pfms)(mineserver_pointer_struct*);
typedef void (*pfv)();
bool Plugin::loadPlugin(const std::string& name, const std::string& path, std::string alias)
{
LIBRARY_HANDLE lhandle = NULL;
pfms fhandle = NULL;
if (name.empty()
|| (name.find('/') != std::string::npos)
|| (name.find('\\') != std::string::npos))
{
LOG(INFO, "Plugin", "Invalid name: " + name);
return false;
}
if (alias.empty())
{
alias = name;
}
if (!path.empty())
{
std::string file;
file = path + '/' + name + LIBRARY_EXTENSION;
struct stat st;
int statr = stat(file.c_str(), &st);
if ((statr == 0) && !(st.st_mode & S_IFDIR))
{
LOG(INFO, "Plugin", "Loading: " + file);
lhandle = LIBRARY_LOAD(file.c_str());
}
else
{
LOG(INFO, "Plugin", "Could not find: " + file);
return false;
}
}
else
{
LOG(INFO, "Plugin", "Loading built-in: " + name);
lhandle = LIBRARY_SELF();
}
if (lhandle == NULL)
{
LOG(INFO, "Plugin", "Could not load: " + name);
LOG(INFO, "Plugin", LIBRARY_ERROR());
return false;
}
m_libraryHandles[alias] = lhandle;
*reinterpret_cast<void**>(&fhandle) = (void*)LIBRARY_SYMBOL(lhandle, (name + "_init").c_str());
if (fhandle == NULL)
{
LOG(INFO, "Plugin", "Could not get init function handle!");
unloadPlugin(alias);
return false;
}
fhandle(&plugin_api_pointers);
return true;
}
void Plugin::unloadPlugin(const std::string name)
{
LIBRARY_HANDLE lhandle = NULL;
pfv fhandle = NULL;
if (m_pluginVersions.find(name) != m_pluginVersions.end())
{
LOG(INFO, "Plugin", "Unloading: " + name);
if (m_libraryHandles[name] != NULL)
{
lhandle = m_libraryHandles[name];
m_libraryHandles.erase(name);
}
else
{
lhandle = LIBRARY_SELF();
}
*reinterpret_cast<void**>(&fhandle) = (void*)LIBRARY_SYMBOL(lhandle, (name + "_shutdown").c_str());
if (fhandle == NULL)
{
LOG(INFO, "Plugin", "Could not get shutdown function handle!");
}
else
{
LOG(INFO, "Plugin", "Calling shutdown function for: " + name);
fhandle();
}
LIBRARY_CLOSE(m_libraryHandles[name]);
}
else
{
LOG(WARNING, "Plugin", name + " is not loaded!");
}
}
bool Plugin::hasHook(const std::string& name) const
{
return m_hooks.find(name) != m_hooks.end();
}
Hook* Plugin::getHook(const std::string& name) const
{
std::map<std::string, Hook*>::const_iterator hook = m_hooks.find(name);
if (hook == m_hooks.end())
{
return NULL;
}
return hook->second;
}
void Plugin::setHook(const std::string& name, Hook* hook)
{
m_hooks[name] = hook;
}
void Plugin::remHook(const std::string& name)
{
if (hasHook(name))
{
m_hooks.erase(name);
}
}
bool Plugin::hasPluginVersion(const std::string& name) const
{
return m_pluginVersions.find(name) != m_pluginVersions.end();
}
float Plugin::getPluginVersion(const std::string& name) const
{
std::map<std::string, float>::const_iterator pluginVersion = m_pluginVersions.find(name);
if (pluginVersion == m_pluginVersions.end())
{
return 0.0f;
}
return pluginVersion->second;
}
void Plugin::setPluginVersion(const std::string& name, float version)
{
m_pluginVersions[name] = version;
}
void Plugin::remPluginVersion(const std::string& name)
{
if (hasPluginVersion(name))
{
m_pluginVersions.erase(name);
}
}
bool Plugin::hasPointer(const std::string& name) const
{
return m_pointers.find(name) != m_pointers.end();
}
void* Plugin::getPointer(const std::string& name) const
{
std::map<std::string, void*>::const_iterator pointer = m_pointers.find(name);
if (pointer == m_pointers.end())
{
return NULL;
}
return pointer->second;
}
void Plugin::setPointer(const std::string& name, void* pointer)
{
m_pointers[name] = pointer;
}
void Plugin::remPointer(const std::string& name)
{
if (hasPointer(name))
{
m_pointers.erase(name);
}
}
|
fix compilation for mingw-w64
|
fix compilation for mingw-w64
|
C++
|
bsd-3-clause
|
fador/mineserver,chtisgit/mine152,chtisgit/mine152,chtisgit/mine152,fador/mineserver,fador/mineserver,fador/mineserver,chtisgit/mine152
|
93f2c9c8064176880a897542a9fab7f473035a86
|
src/core/xs_mesh_region.hpp
|
src/core/xs_mesh_region.hpp
|
/*
Copyright 2016 Mitchell Young
Licensed 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.
*/
#pragma once
#include "constants.hpp"
#include "fp_utils.hpp"
#include "global_config.hpp"
#include "scattering_matrix.hpp"
namespace mocc {
class XSMeshRegion {
friend class XSMesh;
public:
XSMeshRegion():
is_fissile_(false)
{
return;
}
XSMeshRegion( const VecI &fsrs, real_t *xstr,
real_t *xsnf,
real_t *xsch,
real_t *xsf,
real_t *xsrm,
const ScatteringMatrix& xssc );
int n_group() const {
return xsmacsc_.n_group();
}
bool is_fissile() const {
return is_fissile_;
}
const real_t &xsmactr(int ig) const {
return xsmactr_[ig];
}
const real_t* xsmactr() const {
return xsmactr_;
}
const real_t &xsmacnf(int ig) const {
return xsmacnf_[ig];
}
const real_t* xsmacnf() const {
return xsmacnf_;
}
const real_t &xsmacf(int ig) const {
return xsmacf_[ig];
}
const real_t* xsmacf() const {
return xsmacf_;
}
const real_t &xsmacch(int ig) const {
return xsmacch_[ig];
}
const real_t* xsmacch() const {
return xsmacch_;
}
const real_t &xsmacrm(int ig) const {
return xsmacrm_[ig];
}
const real_t* xsmacrm() const {
return xsmacrm_;
}
const ScatteringMatrix& xsmacsc() const {
return xsmacsc_;
}
const ScatteringRow& xsmacsc(int ig) const {
return xsmacsc_.to(ig);
}
VecF reaction_cdf( int ig ) const {
VecF cdf(3, 0.0);
real_t scale = 1.0/xsmactr_[ig];
cdf[(int)Reaction::SCATTER] = xsmacsc_.out(ig)*scale;
cdf[(int)Reaction::FISSION] = cdf[(int)Reaction::SCATTER] +
xsmacf_[ig] * scale;
cdf[(int)Reaction::CAPTURE] = 1.0;
return cdf;
}
/**
* \brief Return a vector containing the Chi distribution as a
* cumulative distribution function.
*
* For now we are calculating this on the fly, since that is easier,. In
* the future, to speed up the MC stuff, it might be nice to have this
* precomputed.
*/
std::vector<real_t> chi_cdf() const {
std::vector<real_t> cdf;
cdf.reserve(this->n_group());
real_t sum = 0.0;
for( int ig=0; ig<this->n_group(); ig++ ) {
sum += xsmacch_[ig];
cdf.push_back(sum);
}
// Calculate reciprocal to reduce strength of the operation from
// division to multiplication
sum = 1.0/sum;
// Scale the CDF to unity
for( auto &v: cdf ) {
v *= sum;
}
return cdf;
}
/**
* Return a vector containing ALL of the FSRs that are filled with this
* material.
*/
const VecI& reg() const {
return reg_;
}
/**
* \brief Update the cross sections referenced by the \ref XSMeshRegion
*/
void update( const VecF &xstr, const VecF &xsnf, const VecF &xsch,
const VecF &xsf, const ScatteringMatrix &xssc )
{
for( int ig=0; ig<(int)xssc.n_group(); ig++ ) {
xsmactr_[ig] = xstr[ig];
xsmacnf_[ig] = xsnf[ig];
xsmacch_[ig] = xsch[ig];
xsmacf_[ig] = xsf[ig];
xsmacrm_[ig] = xstr[ig] - xssc.self_scat(ig);
}
xsmacsc_ = xssc;
return;
}
bool operator==( const XSMeshRegion &other ) const {
// Short-circuit true if checking self-equivalence
if( this == &other ) {
return true;
}
// Return false on any discrepancy, otherwise fall through to return
// true;
if( this->n_group() != other.n_group() ) {
return false;
}
for( int ig=0; ig<this->n_group(); ig++ ) {
if( !fp_equiv_ulp(this->xsmactr(ig),
other.xsmactr(ig)) )
{
return false;
}
if( !fp_equiv_ulp(this->xsmacnf(ig),
other.xsmacnf(ig)) )
{
return false;
}
if( !fp_equiv_ulp(this->xsmacf(ig),
other.xsmacf(ig)) )
{
return false;
}
if( !fp_equiv_ulp(this->xsmacrm(ig),
other.xsmacrm(ig)) )
{
return false;
}
if( xsmacsc_ != other.xsmacsc_ ) {
return false;
}
}
return true;
}
bool operator!=( const XSMeshRegion &other ) const {
return !( *this == other );
}
friend std::ostream& operator<<(std::ostream& os,
const XSMeshRegion &xsr );
private:
// List of FSR indices that use this XS mesh region
VecI reg_;
// Whether or not the region is fissile
bool is_fissile_;
// Actual group constants for this XS mesh region
real_t *xsmactr_;
real_t *xsmacnf_;
real_t *xsmacf_;
real_t *xsmacch_;
real_t *xsmacrm_;
// Scattering matrix
ScatteringMatrix xsmacsc_;
};
}
|
/*
Copyright 2016 Mitchell Young
Licensed 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.
*/
#pragma once
#include "constants.hpp"
#include "fp_utils.hpp"
#include "global_config.hpp"
#include "scattering_matrix.hpp"
namespace mocc {
class XSMeshRegion {
friend class XSMesh;
public:
XSMeshRegion():
is_fissile_(false)
{
return;
}
XSMeshRegion( const VecI &fsrs, real_t *xstr,
real_t *xsnf,
real_t *xsch,
real_t *xsf,
real_t *xsrm,
const ScatteringMatrix& xssc );
int n_group() const {
return xsmacsc_.n_group();
}
bool is_fissile() const {
return is_fissile_;
}
const real_t &xsmactr(int ig) const {
return xsmactr_[ig];
}
const real_t* xsmactr() const {
return xsmactr_;
}
const real_t &xsmacnf(int ig) const {
return xsmacnf_[ig];
}
const real_t* xsmacnf() const {
return xsmacnf_;
}
const real_t &xsmacf(int ig) const {
return xsmacf_[ig];
}
const real_t* xsmacf() const {
return xsmacf_;
}
const real_t &xsmacch(int ig) const {
return xsmacch_[ig];
}
const real_t* xsmacch() const {
return xsmacch_;
}
const real_t &xsmacrm(int ig) const {
return xsmacrm_[ig];
}
const real_t* xsmacrm() const {
return xsmacrm_;
}
const ScatteringMatrix& xsmacsc() const {
return xsmacsc_;
}
const ScatteringRow& xsmacsc(int ig) const {
return xsmacsc_.to(ig);
}
VecF reaction_cdf( int ig ) const {
VecF cdf(3, 0.0);
real_t scale = 1.0/xsmactr_[ig];
cdf[(int)Reaction::SCATTER] = xsmacsc_.out(ig)*scale;
cdf[(int)Reaction::FISSION] = cdf[(int)Reaction::SCATTER] +
xsmacf_[ig] * scale;
cdf[(int)Reaction::CAPTURE] = 1.0;
return cdf;
}
/**
* \brief Return a vector containing the Chi distribution as a
* cumulative distribution function.
*
* For now we are calculating this on the fly, since that is easier,. In
* the future, to speed up the MC stuff, it might be nice to have this
* precomputed.
*/
std::vector<real_t> chi_cdf() const {
std::vector<real_t> cdf;
cdf.reserve(this->n_group());
real_t sum = 0.0;
for( int ig=0; ig<this->n_group(); ig++ ) {
sum += xsmacch_[ig];
cdf.push_back(sum);
}
// Shouldnt have to scale this CDF, since it started as a proper
// PDF to begin with
return cdf;
}
/**
* Return a vector containing ALL of the FSRs that are filled with this
* material.
*/
const VecI& reg() const {
return reg_;
}
/**
* \brief Update the cross sections referenced by the \ref XSMeshRegion
*/
void update( const VecF &xstr, const VecF &xsnf, const VecF &xsch,
const VecF &xsf, const ScatteringMatrix &xssc )
{
for( int ig=0; ig<(int)xssc.n_group(); ig++ ) {
xsmactr_[ig] = xstr[ig];
xsmacnf_[ig] = xsnf[ig];
xsmacch_[ig] = xsch[ig];
xsmacf_[ig] = xsf[ig];
xsmacrm_[ig] = xstr[ig] - xssc.self_scat(ig);
}
xsmacsc_ = xssc;
return;
}
bool operator==( const XSMeshRegion &other ) const {
// Short-circuit true if checking self-equivalence
if( this == &other ) {
return true;
}
// Return false on any discrepancy, otherwise fall through to return
// true;
if( this->n_group() != other.n_group() ) {
return false;
}
for( int ig=0; ig<this->n_group(); ig++ ) {
if( !fp_equiv_ulp(this->xsmactr(ig),
other.xsmactr(ig)) )
{
return false;
}
if( !fp_equiv_ulp(this->xsmacnf(ig),
other.xsmacnf(ig)) )
{
return false;
}
if( !fp_equiv_ulp(this->xsmacf(ig),
other.xsmacf(ig)) )
{
return false;
}
if( !fp_equiv_ulp(this->xsmacrm(ig),
other.xsmacrm(ig)) )
{
return false;
}
if( xsmacsc_ != other.xsmacsc_ ) {
return false;
}
}
return true;
}
bool operator!=( const XSMeshRegion &other ) const {
return !( *this == other );
}
friend std::ostream& operator<<(std::ostream& os,
const XSMeshRegion &xsr );
private:
// List of FSR indices that use this XS mesh region
VecI reg_;
// Whether or not the region is fissile
bool is_fissile_;
// Actual group constants for this XS mesh region
real_t *xsmactr_;
real_t *xsmacnf_;
real_t *xsmacf_;
real_t *xsmacch_;
real_t *xsmacrm_;
// Scattering matrix
ScatteringMatrix xsmacsc_;
};
}
|
Remove superfluous CDF scaling in XSMeshRegion
|
Remove superfluous CDF scaling in XSMeshRegion
The CDF is already coming from and assumed-valid probability density function,
so a straight summation should suffice
|
C++
|
apache-2.0
|
youngmit/mocc,youngmit/mocc,youngmit/mocc,youngmit/mocc
|
77fdec0459bd1d944c87df0771530b4438191eab
|
src/coverage_exec_filter.cc
|
src/coverage_exec_filter.cc
|
/*
* fMBT, free Model Based Testing tool
* Copyright (c) 2012, Intel Corporation.
*
* This program is free software; you can redistribute it and/or modify it
* under the terms and conditions of the GNU Lesser General Public License,
* version 2.1, as published by the Free Software Foundation.
*
* This program is distributed in the hope it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for
* more details.
*
* You should have received a copy of the GNU Lesser General Public License along with
* this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin St - Fifth Floor, Boston, MA 02110-1301 USA.
*
*/
#include "coverage_exec_filter.hh"
#include "model.hh"
#include "helper.hh"
#include "history.hh"
// Coverage_exec_filter::Coverage_exec_filter(Log& l, std::string params):
// Coverage(l),online(false) {
// // Ok. Se need to parse the parameters ?
// // Or would it be better to do parsing in the factory create method?
// }
std::string Coverage_exec_filter::stringify()
{
return std::string("");
}
void Coverage_exec_filter::set_model(Model* _model)
{
Coverage::set_model(_model);
printf("%s\n",__func__);
std::vector<std::string>& sp(model->getSPNames());
printf("from size == %i\n",
from.size());
for(unsigned i=0;i<from.size();i++) {
int pos=find(sp,*from[i]);
printf("Looking for %s (%i)\n",
from[i]->c_str(),pos);
if (sp.size() && *from[i]!=sp[pos]) {
pos=model->action_number(*from[i]);
if (pos>0) {
start_action.push_back(pos);
} else {
printf("\"%s\" not an tag or an action.\n",from[i]->c_str());
}
} else {
start_tag.push_back(pos);
}
}
for(unsigned i=0;i<to.size();i++) {
int pos=find(sp,*to[i]);
if (sp.size() && *to[i]!=sp[pos]) {
pos=model->action_number(*to[i]);
if (pos>0) {
end_action.push_back(pos);
} else {
printf("\"%s\" not an tag or an action.\n",to[i]->c_str());
}
} else {
end_tag.push_back(pos);
}
}
for(unsigned i=0;i<drop.size();i++) {
int pos=find(sp,*drop[i]);
if (sp.size() && *drop[i]!=sp[pos]) {
pos=model->action_number(*drop[i]);
if (pos>0) {
rollback_action.push_back(pos);
} else {
printf("\"%s\" not an tag or an action.\n",drop[i]->c_str());
}
} else {
rollback_tag.push_back(pos);
}
}
}
bool Coverage_exec_filter::prop_set(std::vector<int> p,int npro,
int* props)
{
for(unsigned i=0;i<p.size();i++) {
for(int j=0;j<npro;j++) {
if (p[i]==props[j]) {
return true;
}
}
}
return false;
}
bool Coverage_exec_filter::execute(int action)
{
int* props;
int npro;
if (online) {
executed.push_back(action);
etime.push_back(History::current_time);
}
npro=model->getprops(&props);
if (npro==0) {
return true;
}
if (online) {
/* Ok. Let's search for drop. */
if (prop_set(rollback_tag,npro,props) ||
prop_set(rollback_action,1,&action)) {
on_drop();
online=false;
executed.clear();
etime.clear();
} else {
/* No drop? Let's search for to */
if (prop_set(end_tag,npro,props) ||
prop_set(end_action,1,&action)) {
on_find();
online=false;
executed.clear();
etime.clear();
}
}
}
if (!online) {
/* Let's search for from */
if (prop_set(start_tag,npro,props) ||
prop_set(start_action,1,&action)) {
online=true;
etime.push_back(History::current_time);
on_start();
}
}
return true;
}
|
/*
* fMBT, free Model Based Testing tool
* Copyright (c) 2012, Intel Corporation.
*
* This program is free software; you can redistribute it and/or modify it
* under the terms and conditions of the GNU Lesser General Public License,
* version 2.1, as published by the Free Software Foundation.
*
* This program is distributed in the hope it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for
* more details.
*
* You should have received a copy of the GNU Lesser General Public License along with
* this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin St - Fifth Floor, Boston, MA 02110-1301 USA.
*
*/
#include "coverage_exec_filter.hh"
#include "model.hh"
#include "helper.hh"
#include "history.hh"
// Coverage_exec_filter::Coverage_exec_filter(Log& l, std::string params):
// Coverage(l),online(false) {
// // Ok. Se need to parse the parameters ?
// // Or would it be better to do parsing in the factory create method?
// }
std::string Coverage_exec_filter::stringify()
{
return std::string("");
}
void Coverage_exec_filter::set_model(Model* _model)
{
Coverage::set_model(_model);
printf("%s\n",__func__);
std::vector<std::string>& sp(model->getSPNames());
printf("from size == %i\n",
from.size());
for(unsigned i=0;i<from.size();i++) {
int pos=find(sp,*from[i]);
printf("Looking for %s (%i)\n",
from[i]->c_str(),pos);
if (sp.size() && *from[i]!=sp[pos]) {
pos=model->action_number(*from[i]);
if (pos>0) {
start_action.push_back(pos);
} else {
printf("\"%s\" not an tag or an action.\n",from[i]->c_str());
}
} else {
start_tag.push_back(pos);
}
}
for(unsigned i=0;i<to.size();i++) {
int pos=find(sp,*to[i]);
if (sp.size() && *to[i]!=sp[pos]) {
pos=model->action_number(*to[i]);
if (pos>0) {
end_action.push_back(pos);
} else {
printf("\"%s\" not an tag or an action.\n",to[i]->c_str());
}
} else {
end_tag.push_back(pos);
}
}
for(unsigned i=0;i<drop.size();i++) {
int pos=find(sp,*drop[i]);
if (sp.size() && *drop[i]!=sp[pos]) {
pos=model->action_number(*drop[i]);
if (pos>0) {
rollback_action.push_back(pos);
} else {
printf("\"%s\" not an tag or an action.\n",drop[i]->c_str());
}
} else {
rollback_tag.push_back(pos);
}
}
}
bool Coverage_exec_filter::prop_set(std::vector<int> p,int npro,
int* props)
{
for(unsigned i=0;i<p.size();i++) {
for(int j=0;j<npro;j++) {
if (p[i]==props[j]) {
return true;
}
}
}
return false;
}
bool Coverage_exec_filter::execute(int action)
{
int* props;
int npro;
if (online) {
executed.push_back(action);
etime.push_back(History::current_time);
}
npro=model->getprops(&props);
if (online) {
/* Ok. Let's search for drop. */
if (prop_set(rollback_tag,npro,props) ||
prop_set(rollback_action,1,&action)) {
on_drop();
online=false;
executed.clear();
etime.clear();
} else {
/* No drop? Let's search for to */
if (prop_set(end_tag,npro,props) ||
prop_set(end_action,1,&action)) {
on_find();
online=false;
executed.clear();
etime.clear();
}
}
}
if (!online) {
/* Let's search for from */
if (prop_set(start_tag,npro,props) ||
prop_set(start_action,1,&action)) {
online=true;
etime.push_back(History::current_time);
on_start();
}
}
return true;
}
|
Fix coverage exec filter bug
|
Fix coverage exec filter bug
|
C++
|
lgpl-2.1
|
acozzette/fMBT,CosminNiculae/fMBT,yoonkiss/fMBT,mlq/fMBT,giantpinkwalrus/fMBT,acozzette/fMBT,pombreda/fMBT,01org/fMBT,pyykkis/fMBT,mixu-/fMBT,acozzette/fMBT,giantpinkwalrus/fMBT,rseymour/fMBT,mlq/fMBT,pablovirolainen/fMBT,mixu-/fMBT,pablovirolainen/fMBT,pyykkis/fMBT,heivi/fMBT,mlq/fMBT,pombreda/fMBT,01org/fMBT,pyykkis/fMBT,giantpinkwalrus/fMBT,rseymour/fMBT,mixu-/fMBT,01org/fMBT,violep01/fMBT,OMKR/fMBT,mlq/fMBT,CosminNiculae/fMBT,acozzette/fMBT,heivi/fMBT,rseymour/fMBT,heivi/fMBT,mixu-/fMBT,heivi/fMBT,CosminNiculae/fMBT,pablovirolainen/fMBT,yoonkiss/fMBT,violep01/fMBT,heivi/fMBT,mlq/fMBT,pyykkis/fMBT,OMKR/fMBT,pombreda/fMBT,OMKR/fMBT,OMKR/fMBT,mixu-/fMBT,pombreda/fMBT,acozzette/fMBT,rseymour/fMBT,rseymour/fMBT,heivi/fMBT,pablovirolainen/fMBT,giantpinkwalrus/fMBT,pablovirolainen/fMBT,pyykkis/fMBT,pablovirolainen/fMBT,pyykkis/fMBT,mlq/fMBT,CosminNiculae/fMBT,heivi/fMBT,rseymour/fMBT,OMKR/fMBT,mlq/fMBT,CosminNiculae/fMBT,yoonkiss/fMBT,rseymour/fMBT,pombreda/fMBT,CosminNiculae/fMBT,yoonkiss/fMBT,CosminNiculae/fMBT,yoonkiss/fMBT,violep01/fMBT,01org/fMBT,01org/fMBT,pombreda/fMBT,violep01/fMBT,violep01/fMBT,pombreda/fMBT,giantpinkwalrus/fMBT,OMKR/fMBT
|
a07d24b7c47bf35b32f8bad95a7a6e847f5af06f
|
src/il/AllocFunction.cpp
|
src/il/AllocFunction.cpp
|
//=======================================================================
// Copyright Baptiste Wicht 2011.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
#include <iostream>
#include "il/AllocFunction.hpp"
#include "AssemblyFileWriter.hpp"
using namespace eddic;
void AllocFunction::write(AssemblyFileWriter& writer){
writer.stream() << std::endl;
writer.stream() << "eddi_alloc:" << std::endl
<< "pushl %ebp" << std::endl
<< "movl %esp, %ebp" << std::endl
<< "movl 8(%ebp), %eax" << std::endl
<< "leave" << std::endl
<< "ret" << std::endl;
}
|
//=======================================================================
// Copyright Baptiste Wicht 2011.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
#include <iostream>
#include "il/AllocFunction.hpp"
#include "AssemblyFileWriter.hpp"
using namespace eddic;
void AllocFunction::write(AssemblyFileWriter& writer){
writer.stream() << std::endl;
writer.stream() << "eddi_alloc:" << std::endl
<< "pushl %ebp" << std::endl
<< "movl %esp, %ebp" << std::endl
<< "movl 8(%ebp), %ecx" << std::endl
<< "movl VIeddi_remaining, %ebx" << std::endl
<< "cmpl %ebx, %ecx" << std::endl
<< "jle alloc_normal" << std::endl
//Alloc new block
<< "movl $45, %eax" << std::endl //45 = sys_brk
<< "movl $16384, %ebx" << std::endl //alloc 16K
<< "int $0x80" << std::endl
<< "movl $16384, VIeddi_remaining" << std::endl
<< "movl %eax, VIeddi_current" << std::endl
<< "jmp alloc_end" << std::endl
<< "alloc_normal:" << std::endl
//old = current
<< "movl VIeddi_current, %eax" << std::endl
<< "alloc_end:" << std::endl
<< "leave" << std::endl
<< "ret" << std::endl;
}
|
Implement the eddi_malloc function
|
Implement the eddi_malloc function
|
C++
|
mit
|
vogelsgesang/eddic,vogelsgesang/eddic,wichtounet/eddic,wichtounet/eddic,vogelsgesang/eddic,wichtounet/eddic
|
28e22769068fc41f8c87349a180e76565a2c297b
|
ice40/main.cc
|
ice40/main.cc
|
/*
* nextpnr -- Next Generation Place and Route
*
* Copyright (C) 2018 Clifford Wolf <[email protected]>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*
*/
#include "design.h"
#include "mainwindow.h"
#include <QApplication>
#include <iostream>
#include "version.h"
#include <boost/program_options.hpp>
#include "pybindings.h"
int main(int argc, char *argv[])
{
namespace po = boost::program_options;
std::string str;
po::options_description options("Allowed options");
options.add_options()("help,h","show help");
options.add_options()("test","just a check");
options.add_options()("gui","start gui");
options.add_options()("file", po::value<std::string>(), "python file to execute");
options.add_options()("version,v","show version");
po::positional_options_description pos;
pos.add("file", -1);
po::variables_map vm;
try {
po::parsed_options parsed = po::command_line_parser(argc, argv).
options(options).
positional(pos).
run();
po::store(parsed, vm);
po::notify(vm);
}
catch(std::exception& e)
{
std::cout << e.what() << "\n";
return 1;
}
if (vm.count("help") || argc == 1)
{
std::cout << basename(argv[0]) << " -- Next Generation Place and Route (git sha1 " GIT_COMMIT_HASH_STR ")\n";
std::cout << "\n";
std::cout << options << "\n";
return 1;
}
if (vm.count("version"))
{
std::cout << basename(argv[0]) << " -- Next Generation Place and Route (git sha1 " GIT_COMMIT_HASH_STR ")\n";
return 1;
}
if (vm.count("gui"))
{
QApplication a(argc, argv);
MainWindow w;
w.show();
return a.exec();
}
if (vm.count("test"))
{
ChipArgs chipArgs;
chipArgs.type = ChipArgs::LP384;
Design design(chipArgs);
int bel_count = 0, wire_count = 0, pip_count = 0;
std::cout << "Checking bel names.\n";
for (auto bel : design.chip.getBels()) {
auto name = design.chip.getBelName(bel);
assert(bel == design.chip.getBelByName(name));
bel_count++;
}
std::cout << " checked " << bel_count << " bels.\n";
std::cout << "Checking wire names.\n";
for (auto wire : design.chip.getWires()) {
auto name = design.chip.getWireName(wire);
assert(wire == design.chip.getWireByName(name));
wire_count++;
}
std::cout << " checked " << wire_count << " wires.\n";
std::cout << "Checking pip names.\n";
for (auto pip : design.chip.getPips()) {
auto name = design.chip.getPipName(pip);
assert(pip == design.chip.getPipByName(name));
pip_count++;
}
std::cout << " checked " << pip_count << " pips.\n";
std::cout << "Checking uphill -> downhill consistency.\n";
for (auto dst : design.chip.getWires()) {
for (auto uphill_pip : design.chip.getPipsUphill(dst)) {
bool found_downhill = false;
for (auto downhill_pip : design.chip.getPipsDownhill(design.chip.getPipSrcWire(uphill_pip))) {
if (uphill_pip == downhill_pip) {
assert(!found_downhill);
found_downhill = true;
}
}
assert(found_downhill);
}
}
std::cout << "Checking downhill -> uphill consistency.\n";
for (auto dst : design.chip.getWires()) {
for (auto downhill_pip : design.chip.getPipsDownhill(dst)) {
bool found_uphill = false;
for (auto uphill_pip : design.chip.getPipsUphill(design.chip.getPipDstWire(downhill_pip))) {
if (uphill_pip == downhill_pip) {
assert(!found_uphill);
found_uphill = true;
}
}
assert(found_uphill);
}
}
return 0;
}
if (vm.count("file"))
{
std::string filename = vm["file"].as<std::string>();
execute_python_file(argv[0],filename.c_str());
}
return 0;
}
|
/*
* nextpnr -- Next Generation Place and Route
*
* Copyright (C) 2018 Clifford Wolf <[email protected]>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*
*/
#include "design.h"
#include "mainwindow.h"
#include <QApplication>
#include <iostream>
#include "version.h"
#include <boost/program_options.hpp>
#include "pybindings.h"
void svg_dump_el(const GraphicElement &el)
{
float scale = 10.0;
std::string style = "stroke=\"black\" stroke-width=\"0.1\" fill=\"none\"";
if (el.type == GraphicElement::G_BOX) {
std::cout << "<rect x=\"" << (scale*el.x1) << "\" y=\"" << (scale*el.y1) <<
"\" height=\"" << (scale*(el.y2-el.y1)) << "\" width=\"" << (scale*(el.x2-el.x1)) << "\" " << style << "/>\n";
}
if (el.type == GraphicElement::G_LINE) {
std::cout << "<line x1=\"" << (scale*el.x1) << "\" y1=\"" << (scale*el.y1) <<
"\" x2=\"" << (scale*el.x2) << "\" y2=\"" << (scale*el.y2) << "\" " << style << "/>\n";
}
}
int main(int argc, char *argv[])
{
namespace po = boost::program_options;
std::string str;
po::options_description options("Allowed options");
options.add_options()("help,h","show help");
options.add_options()("test","just a check");
options.add_options()("gui","start gui");
options.add_options()("svg","dump SVG file");
options.add_options()("file", po::value<std::string>(), "python file to execute");
options.add_options()("version,v","show version");
po::positional_options_description pos;
pos.add("file", -1);
po::variables_map vm;
try {
po::parsed_options parsed = po::command_line_parser(argc, argv).
options(options).
positional(pos).
run();
po::store(parsed, vm);
po::notify(vm);
}
catch(std::exception& e)
{
std::cout << e.what() << "\n";
return 1;
}
if (vm.count("help") || argc == 1)
{
std::cout << basename(argv[0]) << " -- Next Generation Place and Route (git sha1 " GIT_COMMIT_HASH_STR ")\n";
std::cout << "\n";
std::cout << options << "\n";
return 1;
}
if (vm.count("version"))
{
std::cout << basename(argv[0]) << " -- Next Generation Place and Route (git sha1 " GIT_COMMIT_HASH_STR ")\n";
return 1;
}
ChipArgs chipArgs;
chipArgs.type = ChipArgs::LP384;
Design design(chipArgs);
if (vm.count("gui"))
{
QApplication a(argc, argv);
MainWindow w;
w.show();
return a.exec();
}
if (vm.count("test"))
{
int bel_count = 0, wire_count = 0, pip_count = 0;
std::cout << "Checking bel names.\n";
for (auto bel : design.chip.getBels()) {
auto name = design.chip.getBelName(bel);
assert(bel == design.chip.getBelByName(name));
bel_count++;
}
std::cout << " checked " << bel_count << " bels.\n";
std::cout << "Checking wire names.\n";
for (auto wire : design.chip.getWires()) {
auto name = design.chip.getWireName(wire);
assert(wire == design.chip.getWireByName(name));
wire_count++;
}
std::cout << " checked " << wire_count << " wires.\n";
std::cout << "Checking pip names.\n";
for (auto pip : design.chip.getPips()) {
auto name = design.chip.getPipName(pip);
assert(pip == design.chip.getPipByName(name));
pip_count++;
}
std::cout << " checked " << pip_count << " pips.\n";
std::cout << "Checking uphill -> downhill consistency.\n";
for (auto dst : design.chip.getWires()) {
for (auto uphill_pip : design.chip.getPipsUphill(dst)) {
bool found_downhill = false;
for (auto downhill_pip : design.chip.getPipsDownhill(design.chip.getPipSrcWire(uphill_pip))) {
if (uphill_pip == downhill_pip) {
assert(!found_downhill);
found_downhill = true;
}
}
assert(found_downhill);
}
}
std::cout << "Checking downhill -> uphill consistency.\n";
for (auto dst : design.chip.getWires()) {
for (auto downhill_pip : design.chip.getPipsDownhill(dst)) {
bool found_uphill = false;
for (auto uphill_pip : design.chip.getPipsUphill(design.chip.getPipDstWire(downhill_pip))) {
if (uphill_pip == downhill_pip) {
assert(!found_uphill);
found_uphill = true;
}
}
assert(found_uphill);
}
}
return 0;
}
if (vm.count("svg"))
{
std::cout << "<svg xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">\n";
for (auto bel : design.chip.getBels()) {
std::cout << "<!-- " << design.chip.getBelName(bel) << " -->\n";
for (auto &el : design.chip.getBelGraphics(bel))
svg_dump_el(el);
}
std::cout << "<!-- Frame -->\n";
for (auto &el : design.chip.getFrameGraphics())
svg_dump_el(el);
std::cout << "</svg>\n";
}
if (vm.count("file"))
{
std::string filename = vm["file"].as<std::string>();
execute_python_file(argv[0],filename.c_str());
}
return 0;
}
|
Add simple SVG generator to ice40 main
|
Add simple SVG generator to ice40 main
Signed-off-by: Clifford Wolf <[email protected]>
|
C++
|
isc
|
SymbiFlow/nextpnr,YosysHQ/nextpnr,YosysHQ/nextpnr,YosysHQ/nextpnr,SymbiFlow/nextpnr,SymbiFlow/nextpnr,SymbiFlow/nextpnr,YosysHQ/nextpnr
|
1b854345d38f30bfa65e9afe42effa8cc5e46fd7
|
TelepathyQt4Yell/Models/abstract-conversation-model.cpp
|
TelepathyQt4Yell/Models/abstract-conversation-model.cpp
|
/*
* This file is part of TelepathyQt4
*
* Copyright (C) 2010 Collabora Ltd. <http://www.collabora.co.uk/>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <TelepathyQt4Yell/Models/AbstractConversationModel>
#include "TelepathyQt4Yell/Models/_gen/abstract-conversation-model.moc.hpp"
#include <TelepathyQt4Yell/Models/ConversationItem>
#include <TelepathyQt4/AvatarData>
#include <TelepathyQt4/PendingReady>
#include <TelepathyQt4/ReceivedMessage>
#include <QPixmap>
#include <QtAlgorithms>
namespace Tpy
{
struct TELEPATHY_QT4_YELL_MODELS_NO_EXPORT AbstractConversationModel::Private
{
Private()
{
}
QList<const ConversationItem *> mItems;
};
AbstractConversationModel::AbstractConversationModel(QObject *parent)
: QAbstractListModel(parent),
mPriv(new Private())
{
QHash<int, QByteArray> roles;
roles[TextRole] = "text";
roles[ContactRole] = "contact";
roles[ContactAvatarRole] = "contactAvatar";
roles[TimeRole] = "time";
roles[TypeRole] = "type";
roles[ItemRole] = "item";
setRoleNames(roles);
}
AbstractConversationModel::~AbstractConversationModel()
{
qDeleteAll(mPriv->mItems);
mPriv->mItems.clear();
delete mPriv;
}
QVariant AbstractConversationModel::data(const QModelIndex &index, int role) const
{
if (!index.isValid()) {
return QVariant();
}
if (index.row() >= mPriv->mItems.count()) {
return QVariant();
}
const ConversationItem *item = mPriv->mItems[index.row()];
switch (role) {
case TextRole:
return item->text();
case ContactRole:
return item->contact()->alias();
case ContactAvatarRole:
return item->contact()->avatarData().fileName;
case TimeRole:
return item->time();
case TypeRole:
switch (item->type()) {
case ConversationItem::INCOMING_MESSAGE:
return QString::fromLatin1("incoming_message");
case ConversationItem::OUTGOING_MESSAGE:
return QString::fromLatin1("outgoing_message");
case ConversationItem::EVENT:
return QString::fromLatin1("event");
default:
return QString();
}
case ItemRole:
return QVariant::fromValue(
const_cast<QObject *>(
static_cast<const QObject *>(item)));
default:
return QVariant();
}
}
int AbstractConversationModel::rowCount(const QModelIndex &parent) const
{
return mPriv->mItems.count();
}
void AbstractConversationModel::addItem(const ConversationItem *item)
{
beginInsertRows(QModelIndex(), mPriv->mItems.count(), mPriv->mItems.count());
mPriv->mItems.append(item);
endInsertRows();
}
bool AbstractConversationModel::deleteItem(const ConversationItem *item)
{
int num = mPriv->mItems.indexOf(item);
if (num != -1) {
beginRemoveRows(QModelIndex(), num, num);
mPriv->mItems.removeAt(num);
endRemoveRows();
return true;
}
return false;
}
QModelIndex AbstractConversationModel::index(const ConversationItem *item) const
{
int num = mPriv->mItems.indexOf(item);
if (num != -1) {
return QAbstractListModel::index(num);
}
return QModelIndex();
}
void AbstractConversationModel::insertItems(QList<const ConversationItem *> items, int index)
{
beginInsertRows(QModelIndex(), index, index + items.count() - 1);
const Tpy::ConversationItem *item;
int i = 0;
foreach(item, items) {
mPriv->mItems.insert(index + i, item);
}
endInsertRows();
}
}
|
/*
* This file is part of TelepathyQt4
*
* Copyright (C) 2010 Collabora Ltd. <http://www.collabora.co.uk/>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <TelepathyQt4Yell/Models/AbstractConversationModel>
#include "TelepathyQt4Yell/Models/_gen/abstract-conversation-model.moc.hpp"
#include <TelepathyQt4Yell/Models/ConversationItem>
#include <TelepathyQt4/AvatarData>
#include <TelepathyQt4/PendingReady>
#include <TelepathyQt4/ReceivedMessage>
#include <QPixmap>
#include <QtAlgorithms>
namespace Tpy
{
struct TELEPATHY_QT4_YELL_MODELS_NO_EXPORT AbstractConversationModel::Private
{
Private()
{
}
QList<const ConversationItem *> mItems;
};
AbstractConversationModel::AbstractConversationModel(QObject *parent)
: QAbstractListModel(parent),
mPriv(new Private())
{
QHash<int, QByteArray> roles;
roles[TextRole] = "text";
roles[ContactRole] = "contact";
roles[ContactAvatarRole] = "contactAvatar";
roles[TimeRole] = "time";
roles[TypeRole] = "type";
roles[ItemRole] = "item";
setRoleNames(roles);
}
AbstractConversationModel::~AbstractConversationModel()
{
qDeleteAll(mPriv->mItems);
mPriv->mItems.clear();
delete mPriv;
}
QVariant AbstractConversationModel::data(const QModelIndex &index, int role) const
{
if (!index.isValid()) {
return QVariant();
}
if (index.row() >= mPriv->mItems.count()) {
return QVariant();
}
const ConversationItem *item = mPriv->mItems[index.row()];
switch (role) {
case TextRole:
return item->text();
case ContactRole:
return item->contact()->alias();
case ContactAvatarRole:
return item->contact()->avatarData().fileName;
case TimeRole:
return item->time();
case TypeRole:
switch (item->type()) {
case ConversationItem::INCOMING_MESSAGE:
return QString::fromLatin1("incoming_message");
case ConversationItem::OUTGOING_MESSAGE:
return QString::fromLatin1("outgoing_message");
case ConversationItem::EVENT:
return QString::fromLatin1("event");
default:
return QString();
}
case ItemRole:
return QVariant::fromValue(
const_cast<QObject *>(
static_cast<const QObject *>(item)));
default:
return QVariant();
}
}
int AbstractConversationModel::rowCount(const QModelIndex &parent) const
{
return mPriv->mItems.count();
}
void AbstractConversationModel::addItem(const ConversationItem *item)
{
beginInsertRows(QModelIndex(), mPriv->mItems.count(), mPriv->mItems.count());
mPriv->mItems.append(item);
endInsertRows();
}
bool AbstractConversationModel::deleteItem(const ConversationItem *item)
{
int num = mPriv->mItems.indexOf(item);
if (num != -1) {
beginRemoveRows(QModelIndex(), num, num);
mPriv->mItems.removeAt(num);
endRemoveRows();
return true;
}
return false;
}
QModelIndex AbstractConversationModel::index(const ConversationItem *item) const
{
int num = mPriv->mItems.indexOf(item);
if (num != -1) {
return QAbstractListModel::index(num);
}
return QModelIndex();
}
void AbstractConversationModel::insertItems(QList<const ConversationItem *> items, int index)
{
beginInsertRows(QModelIndex(), index, index + items.count() - 1);
const Tpy::ConversationItem *item;
int i = 0;
foreach(item, items) {
mPriv->mItems.insert(index + i++, item);
}
endInsertRows();
}
}
|
Fix bug order of inserted items was reversed
|
Models: Fix bug order of inserted items was reversed
|
C++
|
lgpl-2.1
|
freedesktop-unofficial-mirror/telepathy__telepathy-qt4-yell,freedesktop-unofficial-mirror/telepathy__telepathy-qt4-yell,freedesktop-unofficial-mirror/telepathy__telepathy-qt4-yell,freedesktop-unofficial-mirror/telepathy__telepathy-qt4-yell
|
477c5853f1410d5f0392c92bd13035dfaf3ddc69
|
bench/bench-string-2.cpp
|
bench/bench-string-2.cpp
|
/*
* M*LIB - String Bench
*
* Copyright (c) 2017-2020, Patrick Pelissier
* All rights reserved.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* + Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* + Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <string>
#include <sstream>
#include <string>
#include <vector>
#include "common.h"
#include "m-string.h"
#ifdef BENCH_CAN_USE_SDS
extern "C" {
#include "sds.h"
};
#endif
#ifdef BENCH_CAN_USE_RAPIDSTRING
#include "rapidstring.h"
#endif
#ifdef BENCH_CAN_USE_BSTRLIB
#include "bstrlib.h"
#include "bstrwrap.h"
#include "bstraux.h"
#endif
/*
* BENCH
* 2000000
* 1. Generate N strings of random numbers 32 bits.
* 2. Concat all strings in a string usigned a random permutation of N.
* 3. Replace "1234" in the string into "WELL" until nothing remains.
* 4. Replace "56789" in the string into "DONE" until nothing remains.
* Return the final string length.
*/
unsigned *permutation_tab = NULL;
void random_permutation(unsigned n)
{
if (permutation_tab) free(permutation_tab);
permutation_tab = (unsigned *) malloc(n * sizeof(unsigned));
if (permutation_tab == NULL) abort();
for(unsigned i = 0; i < n; i++)
permutation_tab[i] = i;
for(unsigned i = 0; i < n; i++) {
unsigned j = rand_get() % n;
unsigned k = rand_get() % n;
unsigned l = permutation_tab[j];
permutation_tab[j] = permutation_tab[k];
permutation_tab[k] = l;
}
}
using namespace std;
size_t bench_stl(unsigned n)
{
vector<string> tab;
tab.resize(n);
for(unsigned i = 0; i < n; i++)
tab[i] = to_string(rand_get());
string str;
for(unsigned i = 0; i < n; i++) {
str += tab[permutation_tab[i]];
}
size_t pos = 0;
do {
pos = str.find("1234", pos);
if (pos != string::npos) {
str.replace (pos, 4, "WELL");
}
} while (pos != string::npos);
pos = 0;
do {
pos = str.find("56789", pos);
if (pos != string::npos) {
str.replace (pos, 5, "DONE");
}
} while (pos != string::npos);
return str.length();
}
size_t bench_mlib(unsigned n)
{
string_t *tab = (string_t*) malloc (n * sizeof (string_t));
assert (tab != 0);
// P1
for(unsigned i = 0; i < n; i++) {
string_init(tab[i]);
string_printf(tab[i], "%u", rand_get());
}
// P2
string_t str;
string_init(str);
for(unsigned i = 0; i < n; i++) {
string_cat(str, tab[permutation_tab[i]]);
}
// P3
size_t i = 0;
do {
i = string_replace_str(str, "1234", "WELL", i);
} while (i != STRING_FAILURE);
// P4
i = 0;
do {
i = string_replace_str(str, "56789", "DONE", i);
} while (i != STRING_FAILURE);
size_t length = string_size(str);
// Clean
string_clear(str);
for(unsigned i = 0; i < n; i++) {
string_clear(tab[i]);
}
free(tab);
return length;
}
#ifdef BENCH_CAN_USE_BSTRLIB
size_t bench_bstrlib(unsigned n)
{
vector<CBString> tab;
tab.resize(n);
for(unsigned i = 0; i < n; i++) {
char tmp[10];
sprintf(tmp, "%u", rand_get());
tab[i] = tmp;
}
CBString str;
for(unsigned i = 0; i < n; i++) {
str += tab[permutation_tab[i]];
}
size_t pos = 0;
do {
pos = str.find("1234", pos);
if (pos != string::npos) {
str.replace (pos, 4, "WELL");
}
} while (pos != string::npos);
pos = 0;
do {
pos = str.find("56789", pos);
if (pos != string::npos) {
str.replace (pos, 5, "DONE");
}
} while (pos != string::npos);
return str.length();
}
#endif
#ifdef BENCH_CAN_USE_SDS
sds SDS_replace_at(sds str, size_t pos, size_t len, const char str2[])
{
// simple implementation as replace is not available
sds a = sdsnewlen((const void*) str, pos);
a = sdscat(a, str2);
a = sdscat(a, &str[pos+len]);
sdsfree(str);
return a;
}
size_t bench_sds(unsigned n)
{
sds *tab = (sds*) malloc (n * sizeof (sds));
assert (tab != 0);
// P1
for(unsigned i = 0; i < n; i++) {
tab[i] = sdsfromlonglong(rand_get());
}
// P2
sds str = sdsempty();
for(unsigned i = 0; i < n; i++) {
str = sdscat(str, tab[permutation_tab[i]]);
}
// P3
size_t pos = 0;
do {
char *p = strstr(&str[pos], "1234");
pos = p == NULL ? -1U : (p - str);
if (pos != -1U) {
str = SDS_replace_at(str, pos, 4, "WELL");
}
} while (pos != -1U);
// P4
pos = 0;
do {
char *p = strstr(&str[pos], "56789");
pos = p == NULL ? -1U : (p - str);
if (pos != -1U) {
str = SDS_replace_at(str, pos, 5, "DONE");
}
} while (pos != -1U);
size_t length = sdslen(str);
// Clean
sdsfree(str);
for(unsigned i = 0; i < n; i++) {
sdsfree(tab[i]);
}
free(tab);
return length;
}
#endif
#ifdef BENCH_CAN_USE_RAPIDSTRING
void RAPIDSTRING_replace_at(rapidstring *str, size_t pos, size_t len, const char str2[])
{
// simple implementation as replace is not available
rapidstring a;
rs_init_w_n(&a, rs_data(str), pos);
rs_cat(&a, str2);
rs_cat(&a, &rs_data(str)[pos+len] );
rs_free(str);
*str = a;
}
size_t bench_rapidstring(unsigned n)
{
rapidstring *tab = (rapidstring*) malloc (n * sizeof (rapidstring));
assert (tab != 0);
// P1
for(unsigned i = 0; i < n; i++) {
char tmp[10];
sprintf(tmp, "%u", rand_get());
rs_init_w(&tab[i], tmp);
}
// P2
rapidstring str;
rs_init(&str);
for(unsigned i = 0; i < n; i++) {
rs_cat_rs(&str, &tab[permutation_tab[i]]);
}
// P3
size_t pos = 0;
do {
char *p = strstr(&rs_data(&str)[pos], "1234");
pos = p == NULL ? -1U : (p - rs_data(&str));
if (pos != -1U) {
RAPIDSTRING_replace_at(&str, pos, 4, "WELL");
}
} while (pos != -1U);
// P4
pos = 0;
do {
char *p = strstr(&rs_data(&str)[pos], "56789");
pos = p == NULL ? -1U : (p - rs_data(&str));
if (pos != -1U) {
RAPIDSTRING_replace_at(&str, pos, 5, "DONE");
}
} while (pos != -1U);
size_t length = rs_len(&str);
// Clean
rs_free(&str);
for(unsigned i = 0; i < n; i++) {
rs_free(&tab[i]);
}
free(tab);
return length;
}
#endif
int main(int argc, const char *argv[])
{
unsigned length, n = atoi(argv[1]);
unsigned select = atoi(argv[2]);
const char *name;
random_permutation(n);
rand_init();
unsigned long long t0 = cputime();
switch (select) {
case 0:
length = bench_mlib(n);
name = "MLIB";
break;
case 1:
length = bench_stl(n);
name = "STL";
break;
#ifdef BENCH_CAN_USE_SDS
case 2:
length = bench_sds(n);
name = "SDS";
break;
#endif
#ifdef BENCH_CAN_USE_RAPIDSTRING
case 3:
length = bench_rapidstring(n);
name = "RAPID";
break;
#endif
#ifdef BENCH_CAN_USE_BSTRLIB
case 4:
length = bench_bstrlib(n);
name = "BSTRLIB";
break;
#endif
default:
exit(0);
}
unsigned long long t1 = cputime();
printf("%5.5s LENGTH=%u T= %f s\n", name, length, (t1-t0) / 1000000.0 );
return 0;
}
|
/*
* M*LIB - String Bench
*
* Copyright (c) 2017-2020, Patrick Pelissier
* All rights reserved.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* + Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* + Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <string>
#include <sstream>
#include <string>
#include <vector>
#include "common.h"
#include "m-string.h"
#ifdef BENCH_CAN_USE_SDS
extern "C" {
#include "sds.h"
};
#endif
#ifdef BENCH_CAN_USE_RAPIDSTRING
#include "rapidstring.h"
#endif
#ifdef BENCH_CAN_USE_BSTRLIB
#include "bstrlib.h"
#include "bstrwrap.h"
#include "bstraux.h"
#endif
/*
* BENCH
* 2000000
* 1. Generate N strings of random numbers 32 bits.
* 2. Concat all strings in a string usigned a random permutation of N.
* 3. Replace "1234" in the string into "WELL" until nothing remains.
* 4. Replace "56789" in the string into "DONE" until nothing remains.
* Return the final string length.
*/
unsigned *permutation_tab = NULL;
void random_permutation(unsigned n)
{
if (permutation_tab) free(permutation_tab);
permutation_tab = (unsigned *) malloc(n * sizeof(unsigned));
if (permutation_tab == NULL) abort();
for(unsigned i = 0; i < n; i++)
permutation_tab[i] = i;
for(unsigned i = 0; i < n; i++) {
unsigned j = rand_get() % n;
unsigned k = rand_get() % n;
unsigned l = permutation_tab[j];
permutation_tab[j] = permutation_tab[k];
permutation_tab[k] = l;
}
}
using namespace std;
size_t bench_stl(unsigned n)
{
vector<string> tab;
tab.resize(n);
for(unsigned i = 0; i < n; i++)
tab[i] = to_string(rand_get());
string str;
for(unsigned i = 0; i < n; i++) {
str += tab[permutation_tab[i]];
}
size_t pos = 0;
do {
pos = str.find("1234", pos);
if (pos != string::npos) {
str.replace (pos, 4, "WELL");
}
} while (pos != string::npos);
pos = 0;
do {
pos = str.find("56789", pos);
if (pos != string::npos) {
str.replace (pos, 5, "DONE");
}
} while (pos != string::npos);
return str.length();
}
size_t bench_mlib(unsigned n)
{
string_t *tab = (string_t*) malloc (n * sizeof (string_t));
assert (tab != 0);
// P1
for(unsigned i = 0; i < n; i++) {
string_init(tab[i]);
string_printf(tab[i], "%u", rand_get());
}
// P2
string_t str;
string_init(str);
for(unsigned i = 0; i < n; i++) {
string_cat(str, tab[permutation_tab[i]]);
}
// P3
string_replace_all_str(str, "1234", "WELL");
string_replace_all_str(str, "56789", "DONE");
size_t length = string_size(str);
// Clean
string_clear(str);
for(unsigned i = 0; i < n; i++) {
string_clear(tab[i]);
}
free(tab);
return length;
}
#ifdef BENCH_CAN_USE_BSTRLIB
size_t bench_bstrlib(unsigned n)
{
vector<CBString> tab;
tab.resize(n);
for(unsigned i = 0; i < n; i++) {
char tmp[10];
sprintf(tmp, "%u", rand_get());
tab[i] = tmp;
}
CBString str;
for(unsigned i = 0; i < n; i++) {
str += tab[permutation_tab[i]];
}
size_t pos = 0;
do {
pos = str.find("1234", pos);
if (pos != string::npos) {
str.replace (pos, 4, "WELL");
}
} while (pos != string::npos);
pos = 0;
do {
pos = str.find("56789", pos);
if (pos != string::npos) {
str.replace (pos, 5, "DONE");
}
} while (pos != string::npos);
return str.length();
}
#endif
#ifdef BENCH_CAN_USE_SDS
sds SDS_replace_at(sds str, size_t pos, size_t len, const char str2[])
{
// simple implementation as replace is not available
sds a = sdsnewlen((const void*) str, pos);
a = sdscat(a, str2);
a = sdscat(a, &str[pos+len]);
sdsfree(str);
return a;
}
size_t bench_sds(unsigned n)
{
sds *tab = (sds*) malloc (n * sizeof (sds));
assert (tab != 0);
// P1
for(unsigned i = 0; i < n; i++) {
tab[i] = sdsfromlonglong(rand_get());
}
// P2
sds str = sdsempty();
for(unsigned i = 0; i < n; i++) {
str = sdscat(str, tab[permutation_tab[i]]);
}
// P3
size_t pos = 0;
do {
char *p = strstr(&str[pos], "1234");
pos = p == NULL ? -1U : (p - str);
if (pos != -1U) {
str = SDS_replace_at(str, pos, 4, "WELL");
}
} while (pos != -1U);
// P4
pos = 0;
do {
char *p = strstr(&str[pos], "56789");
pos = p == NULL ? -1U : (p - str);
if (pos != -1U) {
str = SDS_replace_at(str, pos, 5, "DONE");
}
} while (pos != -1U);
size_t length = sdslen(str);
// Clean
sdsfree(str);
for(unsigned i = 0; i < n; i++) {
sdsfree(tab[i]);
}
free(tab);
return length;
}
#endif
#ifdef BENCH_CAN_USE_RAPIDSTRING
void RAPIDSTRING_replace_at(rapidstring *str, size_t pos, size_t len, const char str2[])
{
// simple implementation as replace is not available
rapidstring a;
rs_init_w_n(&a, rs_data(str), pos);
rs_cat(&a, str2);
rs_cat(&a, &rs_data(str)[pos+len] );
rs_free(str);
*str = a;
}
size_t bench_rapidstring(unsigned n)
{
rapidstring *tab = (rapidstring*) malloc (n * sizeof (rapidstring));
assert (tab != 0);
// P1
for(unsigned i = 0; i < n; i++) {
char tmp[10];
sprintf(tmp, "%u", rand_get());
rs_init_w(&tab[i], tmp);
}
// P2
rapidstring str;
rs_init(&str);
for(unsigned i = 0; i < n; i++) {
rs_cat_rs(&str, &tab[permutation_tab[i]]);
}
// P3
size_t pos = 0;
do {
char *p = strstr(&rs_data(&str)[pos], "1234");
pos = p == NULL ? -1U : (p - rs_data(&str));
if (pos != -1U) {
RAPIDSTRING_replace_at(&str, pos, 4, "WELL");
}
} while (pos != -1U);
// P4
pos = 0;
do {
char *p = strstr(&rs_data(&str)[pos], "56789");
pos = p == NULL ? -1U : (p - rs_data(&str));
if (pos != -1U) {
RAPIDSTRING_replace_at(&str, pos, 5, "DONE");
}
} while (pos != -1U);
size_t length = rs_len(&str);
// Clean
rs_free(&str);
for(unsigned i = 0; i < n; i++) {
rs_free(&tab[i]);
}
free(tab);
return length;
}
#endif
int main(int argc, const char *argv[])
{
unsigned length, n = atoi(argv[1]);
unsigned select = atoi(argv[2]);
const char *name;
random_permutation(n);
rand_init();
unsigned long long t0 = cputime();
switch (select) {
case 0:
length = bench_mlib(n);
name = "MLIB";
break;
case 1:
length = bench_stl(n);
name = "STL";
break;
#ifdef BENCH_CAN_USE_SDS
case 2:
length = bench_sds(n);
name = "SDS";
break;
#endif
#ifdef BENCH_CAN_USE_RAPIDSTRING
case 3:
length = bench_rapidstring(n);
name = "RAPID";
break;
#endif
#ifdef BENCH_CAN_USE_BSTRLIB
case 4:
length = bench_bstrlib(n);
name = "BSTRLIB";
break;
#endif
default:
exit(0);
}
unsigned long long t1 = cputime();
printf("%5.5s LENGTH=%u T= %f s\n", name, length, (t1-t0) / 1000000.0 );
return 0;
}
|
Update bench to use new function.
|
Update bench to use new function.
|
C++
|
bsd-2-clause
|
P-p-H-d/mlib,P-p-H-d/mlib
|
4518cbc2dfc7c5c0145dbac3359ece7f9640ba6d
|
bench/formatter/json.cpp
|
bench/formatter/json.cpp
|
#include <benchmark/benchmark.h>
#include <blackhole/attributes.hpp>
#include <blackhole/cpp17/string_view.hpp>
#include <blackhole/extensions/writer.hpp>
#include <blackhole/formatter/json.hpp>
#include <blackhole/record.hpp>
namespace blackhole {
namespace benchmark {
static void format_json_0(::benchmark::State& state) {
formatter::json_t formatter(formatter::routing_t().spec("/fields", {"endpoint"}));
const string_view message("value");
const attribute_list attributes{{"endpoint", "127.0.0.1:8080"}};
const attribute_pack pack{};
record_t record(0, message, pack);
writer_t writer;
while (state.KeepRunning()) {
formatter.format(record, writer);
}
state.SetItemsProcessed(state.iterations());
}
static void format_json_1(::benchmark::State& state) {
formatter::json_t formatter(formatter::routing_t().spec("/fields", {"endpoint"}));
const string_view message("value");
const attribute_list attributes{{"endpoint", "127.0.0.1:8080"}};
const attribute_pack pack{attributes};
record_t record(0, message, pack);
writer_t writer;
while (state.KeepRunning()) {
formatter.format(record, writer);
}
state.SetItemsProcessed(state.iterations());
}
BENCHMARK(format_json_0);
BENCHMARK(format_json_1);
} // namespace benchmark
} // namespace blackhole
|
#include <benchmark/benchmark.h>
#include <blackhole/attributes.hpp>
#include <blackhole/cpp17/string_view.hpp>
#include <blackhole/extensions/writer.hpp>
#include <blackhole/formatter/json.hpp>
#include <blackhole/record.hpp>
namespace blackhole {
namespace benchmark {
static void format_json(::benchmark::State& state) {
formatter::json_t formatter;;
const string_view message("value");
const attribute_pack pack;
record_t record(0, message, pack);
writer_t writer;
while (state.KeepRunning()) {
formatter.format(record, writer);
}
state.SetItemsProcessed(state.iterations());
}
static void format_json_message_routed(::benchmark::State& state) {
formatter::json_t formatter(formatter::routing_t().spec("/fields", {"message"}));
const string_view message("value");
const attribute_pack pack;
record_t record(0, message, pack);
writer_t writer;
while (state.KeepRunning()) {
formatter.format(record, writer);
}
state.SetItemsProcessed(state.iterations());
}
static void format_json_1(::benchmark::State& state) {
formatter::json_t formatter(formatter::routing_t().spec("/fields", {"endpoint"}));
const string_view message("value");
const attribute_list attributes{{"endpoint", "127.0.0.1:8080"}};
const attribute_pack pack{attributes};
record_t record(0, message, pack);
writer_t writer;
while (state.KeepRunning()) {
formatter.format(record, writer);
}
state.SetItemsProcessed(state.iterations());
}
BENCHMARK(format_json);
BENCHMARK(format_json_message_routed);
BENCHMARK(format_json_1);
} // namespace benchmark
} // namespace blackhole
|
add more benchmarks
|
chore(bench): add more benchmarks
|
C++
|
mit
|
noxiouz/blackhole,3Hren/blackhole
|
d8d79961e01f32037c6b00def31584598c858627
|
src/hipoc/hipoc_program.cpp
|
src/hipoc/hipoc_program.cpp
|
#include <mlopen/hipoc_program.hpp>
#include <mlopen/kernel.hpp>
#include <mlopen/errors.hpp>
#include <unistd.h>
namespace mlopen {
std::string GetFileName(const HIPOCProgram::FilePtr& f)
{
auto fd = fileno(f.get());
std::string path = "/proc/self/fd/" + std::to_string(fd);
std::array<char, 256> buffer{};
readlink(path.c_str(), buffer.data(), buffer.size());
return buffer.data();
}
hipModulePtr CreateModule(const std::string& program_name, std::string params)
{
HIPOCProgram::FilePtr tmpsrc{std::tmpfile()};
std::string src = GetKernelSrc(program_name);
std::string src_name = GetFileName(tmpsrc);
if (std::fwrite(src.c_str(), src.size(), 1, tmpsrc.get()) != src.size())
MLOPEN_THROW("Failed to write to src file");
std::system((HIP_OC_COMPILER +
std::string(" -march=hsail64 -mdevice=Fiji -cl-denorms-are-zero -save-temps=dump -nobin ") +
params + " " +
src_name).c_str());
std::string obj_file = src_name + "_obj";
std::system((HIP_OC_FINALIZER +
std::string("-target=8:0:3 -hsail dump_0_Fiji.hsail -output=") +
obj_file
).c_str());
hipModule_t raw_m;
auto status = hipModuleLoad(&raw_m, obj_file.c_str());
hipModulePtr m{raw_m};
std::remove(obj_file.c_str());
if (status != hipSuccess) MLOPEN_THROW("Failed creating module");
return m;
}
HIPOCProgram::HIPOCProgram()
{}
HIPOCProgram::HIPOCProgram(const std::string &program_name, std::string params)
{
this->module = CreateModule(program_name, params);
}
}
|
#include <mlopen/hipoc_program.hpp>
#include <mlopen/kernel.hpp>
#include <mlopen/errors.hpp>
#include <unistd.h>
namespace mlopen {
std::string GetFileName(const HIPOCProgram::FilePtr& f)
{
auto fd = fileno(f.get());
std::string path = "/proc/self/fd/" + std::to_string(fd);
std::array<char, 256> buffer{};
readlink(path.c_str(), buffer.data(), buffer.size());
return buffer.data();
}
hipModulePtr CreateModule(const std::string& program_name, std::string params)
{
HIPOCProgram::FilePtr tmpsrc{std::tmpfile()};
std::string src = GetKernelSrc(program_name);
std::string src_name = GetFileName(tmpsrc);
if (std::fwrite(src.c_str(), 1, src.size(), tmpsrc.get()) != src.size())
MLOPEN_THROW("Failed to write to src file");
std::system((HIP_OC_COMPILER +
std::string(" -march=hsail64 -mdevice=Fiji -cl-denorms-are-zero -save-temps=dump -nobin ") +
params + " " +
src_name).c_str());
std::string obj_file = src_name + "_obj";
std::system((HIP_OC_FINALIZER +
std::string("-target=8:0:3 -hsail dump_0_Fiji.hsail -output=") +
obj_file
).c_str());
hipModule_t raw_m;
auto status = hipModuleLoad(&raw_m, obj_file.c_str());
hipModulePtr m{raw_m};
std::remove(obj_file.c_str());
if (status != hipSuccess) MLOPEN_THROW("Failed creating module");
return m;
}
HIPOCProgram::HIPOCProgram()
{}
HIPOCProgram::HIPOCProgram(const std::string &program_name, std::string params)
{
this->module = CreateModule(program_name, params);
}
}
|
Fix error with writing to src file
|
Fix error with writing to src file
|
C++
|
mit
|
ROCmSoftwarePlatform/MIOpen,ROCmSoftwarePlatform/MIOpen,ROCmSoftwarePlatform/MIOpen,ROCmSoftwarePlatform/MIOpen,ROCmSoftwarePlatform/MIOpen
|
bf178a7f0f5c156e4bba53923ec4286a72e98816
|
src/image/SkImageShader.cpp
|
src/image/SkImageShader.cpp
|
/*
* Copyright 2015 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "SkBitmapProcShader.h"
#include "SkBitmapProvider.h"
#include "SkColorShader.h"
#include "SkColorTable.h"
#include "SkEmptyShader.h"
#include "SkFixedAlloc.h"
#include "SkImage_Base.h"
#include "SkImageShader.h"
#include "SkPM4fPriv.h"
#include "SkReadBuffer.h"
#include "SkWriteBuffer.h"
SkImageShader::SkImageShader(sk_sp<SkImage> img, TileMode tmx, TileMode tmy, const SkMatrix* matrix)
: INHERITED(matrix)
, fImage(std::move(img))
, fTileModeX(tmx)
, fTileModeY(tmy)
{}
sk_sp<SkFlattenable> SkImageShader::CreateProc(SkReadBuffer& buffer) {
const TileMode tx = (TileMode)buffer.readUInt();
const TileMode ty = (TileMode)buffer.readUInt();
SkMatrix matrix;
buffer.readMatrix(&matrix);
sk_sp<SkImage> img = buffer.readImage();
if (!img) {
return nullptr;
}
return SkImageShader::Make(std::move(img), tx, ty, &matrix);
}
void SkImageShader::flatten(SkWriteBuffer& buffer) const {
buffer.writeUInt(fTileModeX);
buffer.writeUInt(fTileModeY);
buffer.writeMatrix(this->getLocalMatrix());
buffer.writeImage(fImage.get());
}
bool SkImageShader::isOpaque() const {
return fImage->isOpaque();
}
size_t SkImageShader::onContextSize(const ContextRec& rec) const {
return SkBitmapProcLegacyShader::ContextSize(rec, as_IB(fImage)->onImageInfo());
}
SkShader::Context* SkImageShader::onCreateContext(const ContextRec& rec, void* storage) const {
return SkBitmapProcLegacyShader::MakeContext(*this, fTileModeX, fTileModeY,
SkBitmapProvider(fImage.get()), rec, storage);
}
SkImage* SkImageShader::onIsAImage(SkMatrix* texM, TileMode xy[]) const {
if (texM) {
*texM = this->getLocalMatrix();
}
if (xy) {
xy[0] = (TileMode)fTileModeX;
xy[1] = (TileMode)fTileModeY;
}
return const_cast<SkImage*>(fImage.get());
}
#ifdef SK_SUPPORT_LEGACY_SHADER_ISABITMAP
bool SkImageShader::onIsABitmap(SkBitmap* texture, SkMatrix* texM, TileMode xy[]) const {
const SkBitmap* bm = as_IB(fImage)->onPeekBitmap();
if (!bm) {
return false;
}
if (texture) {
*texture = *bm;
}
if (texM) {
*texM = this->getLocalMatrix();
}
if (xy) {
xy[0] = (TileMode)fTileModeX;
xy[1] = (TileMode)fTileModeY;
}
return true;
}
#endif
static bool bitmap_is_too_big(int w, int h) {
// SkBitmapProcShader stores bitmap coordinates in a 16bit buffer, as it
// communicates between its matrix-proc and its sampler-proc. Until we can
// widen that, we have to reject bitmaps that are larger.
//
static const int kMaxSize = 65535;
return w > kMaxSize || h > kMaxSize;
}
// returns true and set color if the bitmap can be drawn as a single color
// (for efficiency)
static bool can_use_color_shader(const SkImage* image, SkColor* color) {
#ifdef SK_BUILD_FOR_ANDROID_FRAMEWORK
// HWUI does not support color shaders (see b/22390304)
return false;
#endif
if (1 != image->width() || 1 != image->height()) {
return false;
}
SkPixmap pmap;
if (!image->peekPixels(&pmap)) {
return false;
}
switch (pmap.colorType()) {
case kN32_SkColorType:
*color = SkUnPreMultiply::PMColorToColor(*pmap.addr32(0, 0));
return true;
case kRGB_565_SkColorType:
*color = SkPixel16ToColor(*pmap.addr16(0, 0));
return true;
case kIndex_8_SkColorType: {
const SkColorTable& ctable = *pmap.ctable();
*color = SkUnPreMultiply::PMColorToColor(ctable[*pmap.addr8(0, 0)]);
return true;
}
default: // just skip the other configs for now
break;
}
return false;
}
sk_sp<SkShader> SkImageShader::Make(sk_sp<SkImage> image, TileMode tx, TileMode ty,
const SkMatrix* localMatrix,
SkTBlitterAllocator* allocator) {
SkShader* shader;
SkColor color;
if (!image || bitmap_is_too_big(image->width(), image->height())) {
if (nullptr == allocator) {
shader = new SkEmptyShader;
} else {
shader = allocator->createT<SkEmptyShader>();
}
} else if (can_use_color_shader(image.get(), &color)) {
if (nullptr == allocator) {
shader = new SkColorShader(color);
} else {
shader = allocator->createT<SkColorShader>(color);
}
} else {
if (nullptr == allocator) {
shader = new SkImageShader(image, tx, ty, localMatrix);
} else {
shader = allocator->createT<SkImageShader>(image, tx, ty, localMatrix);
}
}
return sk_sp<SkShader>(shader);
}
#ifndef SK_IGNORE_TO_STRING
void SkImageShader::toString(SkString* str) const {
const char* gTileModeName[SkShader::kTileModeCount] = {
"clamp", "repeat", "mirror"
};
str->appendf("ImageShader: ((%s %s) ", gTileModeName[fTileModeX], gTileModeName[fTileModeY]);
fImage->toString(str);
this->INHERITED::toString(str);
str->append(")");
}
#endif
///////////////////////////////////////////////////////////////////////////////////////////////////
#if SK_SUPPORT_GPU
#include "SkGr.h"
#include "SkGrPriv.h"
#include "effects/GrSimpleTextureEffect.h"
#include "effects/GrBicubicEffect.h"
#include "effects/GrSimpleTextureEffect.h"
sk_sp<GrFragmentProcessor> SkImageShader::asFragmentProcessor(const AsFPArgs& args) const {
SkMatrix matrix;
matrix.setIDiv(fImage->width(), fImage->height());
SkMatrix lmInverse;
if (!this->getLocalMatrix().invert(&lmInverse)) {
return nullptr;
}
if (args.fLocalMatrix) {
SkMatrix inv;
if (!args.fLocalMatrix->invert(&inv)) {
return nullptr;
}
lmInverse.postConcat(inv);
}
matrix.preConcat(lmInverse);
SkShader::TileMode tm[] = { fTileModeX, fTileModeY };
// Must set wrap and filter on the sampler before requesting a texture. In two places below
// we check the matrix scale factors to determine how to interpret the filter quality setting.
// This completely ignores the complexity of the drawVertices case where explicit local coords
// are provided by the caller.
bool doBicubic;
GrSamplerParams::FilterMode textureFilterMode =
GrSkFilterQualityToGrFilterMode(args.fFilterQuality, *args.fViewMatrix, this->getLocalMatrix(),
&doBicubic);
GrSamplerParams params(tm, textureFilterMode);
sk_sp<GrTexture> texture(as_IB(fImage)->asTextureRef(args.fContext, params, args.fColorMode));
if (!texture) {
return nullptr;
}
SkImageInfo info = as_IB(fImage)->onImageInfo();
sk_sp<GrColorSpaceXform> colorSpaceXform = GrColorSpaceXform::Make(info.colorSpace(),
args.fDstColorSpace);
sk_sp<GrFragmentProcessor> inner;
if (doBicubic) {
inner = GrBicubicEffect::Make(texture.get(), std::move(colorSpaceXform), matrix, tm);
} else {
inner = GrSimpleTextureEffect::Make(texture.get(), std::move(colorSpaceXform),
matrix, params);
}
if (GrPixelConfigIsAlphaOnly(texture->config())) {
return inner;
}
return sk_sp<GrFragmentProcessor>(GrFragmentProcessor::MulOutputByInputAlpha(std::move(inner)));
}
#endif
///////////////////////////////////////////////////////////////////////////////////////////////////
#include "SkImagePriv.h"
sk_sp<SkShader> SkMakeBitmapShader(const SkBitmap& src, SkShader::TileMode tmx,
SkShader::TileMode tmy, const SkMatrix* localMatrix,
SkCopyPixelsMode cpm, SkTBlitterAllocator* allocator) {
// Until we learn otherwise, it seems that any caller that is passing an allocator must be
// assuming that the returned shader will have a stack-frame lifetime, so we assert that
// they are also asking for kNever_SkCopyPixelsMode. If that proves otherwise, we can remove
// or modify this assert.
SkASSERT(!allocator || (kNever_SkCopyPixelsMode == cpm));
return SkImageShader::Make(SkMakeImageFromRasterBitmap(src, cpm, allocator),
tmx, tmy, localMatrix, allocator);
}
static sk_sp<SkFlattenable> SkBitmapProcShader_CreateProc(SkReadBuffer& buffer) {
SkMatrix lm;
buffer.readMatrix(&lm);
sk_sp<SkImage> image = buffer.readBitmapAsImage();
SkShader::TileMode mx = (SkShader::TileMode)buffer.readUInt();
SkShader::TileMode my = (SkShader::TileMode)buffer.readUInt();
return image ? image->makeShader(mx, my, &lm) : nullptr;
}
SK_DEFINE_FLATTENABLE_REGISTRAR_GROUP_START(SkShader)
SK_DEFINE_FLATTENABLE_REGISTRAR_ENTRY(SkImageShader)
SkFlattenable::Register("SkBitmapProcShader", SkBitmapProcShader_CreateProc, kSkShader_Type);
SK_DEFINE_FLATTENABLE_REGISTRAR_GROUP_END
bool SkImageShader::onAppendStages(SkRasterPipeline* p, SkColorSpace* dst, SkFallbackAlloc* scratch,
const SkMatrix& ctm, SkFilterQuality quality) const {
SkPixmap pm;
if (!fImage->peekPixels(&pm)) {
return false;
}
auto info = pm.info();
auto matrix = SkMatrix::Concat(ctm, this->getLocalMatrix());
if (!matrix.invert(&matrix)) {
return false;
}
// TODO: perspective
if (!matrix.asAffine(nullptr)) {
return false;
}
// TODO: all formats
switch (info.colorType()) {
case kRGBA_8888_SkColorType:
case kBGRA_8888_SkColorType:
// case kRGB_565_SkColorType:
// case kRGBA_F16_SkColorType:
break;
default: return false;
}
// TODO: all tile modes
if (fTileModeX != kClamp_TileMode || fTileModeY != kClamp_TileMode) {
return false;
}
// When the matrix is just an integer translate, bilerp == nearest neighbor.
if (matrix.getType() <= SkMatrix::kTranslate_Mask &&
matrix.getTranslateX() == (int)matrix.getTranslateX() &&
matrix.getTranslateY() == (int)matrix.getTranslateY()) {
quality = kNone_SkFilterQuality;
}
// TODO: bilerp
if (quality != kNone_SkFilterQuality) {
return false;
}
// TODO: mtklein doesn't understand why we do this.
if (quality == kNone_SkFilterQuality) {
if (matrix.getScaleX() >= 0) {
matrix.setTranslateX(nextafterf(matrix.getTranslateX(),
floorf(matrix.getTranslateX())));
}
if (matrix.getScaleY() >= 0) {
matrix.setTranslateY(nextafterf(matrix.getTranslateY(),
floorf(matrix.getTranslateY())));
}
}
struct context {
const void* pixels;
int stride;
int width;
int height;
float matrix[6];
};
auto ctx = scratch->make<context>();
ctx->pixels = pm.addr();
ctx->stride = pm.rowBytesAsPixels();
ctx->width = pm.width();
ctx->height = pm.height();
SkAssertResult(matrix.asAffine(ctx->matrix));
p->append(SkRasterPipeline::matrix_2x3, &ctx->matrix);
switch (fTileModeX) {
case kClamp_TileMode: p->append(SkRasterPipeline::clamp_x, &ctx->width); break;
case kMirror_TileMode: p->append(SkRasterPipeline::mirror_x, &ctx->width); break;
case kRepeat_TileMode: p->append(SkRasterPipeline::repeat_x, &ctx->width); break;
}
switch (fTileModeY) {
case kClamp_TileMode: p->append(SkRasterPipeline::clamp_y, &ctx->height); break;
case kMirror_TileMode: p->append(SkRasterPipeline::mirror_y, &ctx->height); break;
case kRepeat_TileMode: p->append(SkRasterPipeline::repeat_y, &ctx->height); break;
}
switch(info.colorType()) {
case kRGBA_8888_SkColorType:
case kBGRA_8888_SkColorType:
if (info.gammaCloseToSRGB() && dst) {
p->append(SkRasterPipeline::nearest_srgb, ctx);
} else {
p->append(SkRasterPipeline::nearest_8888, ctx);
}
break;
case kRGBA_F16_SkColorType:
p->append(SkRasterPipeline::nearest_f16, ctx);
break;
case kRGB_565_SkColorType:
p->append(SkRasterPipeline::nearest_565, ctx);
break;
default:
SkASSERT(false);
break;
}
if (info.colorType() == kBGRA_8888_SkColorType) {
p->append(SkRasterPipeline::swap_rb);
}
if (info.alphaType() == kUnpremul_SkAlphaType) {
p->append(SkRasterPipeline::premul);
}
return append_gamut_transform(p, scratch, info.colorSpace(), dst);
}
|
/*
* Copyright 2015 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "SkBitmapProcShader.h"
#include "SkBitmapProvider.h"
#include "SkColorShader.h"
#include "SkColorTable.h"
#include "SkEmptyShader.h"
#include "SkFixedAlloc.h"
#include "SkImage_Base.h"
#include "SkImageShader.h"
#include "SkPM4fPriv.h"
#include "SkReadBuffer.h"
#include "SkWriteBuffer.h"
SkImageShader::SkImageShader(sk_sp<SkImage> img, TileMode tmx, TileMode tmy, const SkMatrix* matrix)
: INHERITED(matrix)
, fImage(std::move(img))
, fTileModeX(tmx)
, fTileModeY(tmy)
{}
sk_sp<SkFlattenable> SkImageShader::CreateProc(SkReadBuffer& buffer) {
const TileMode tx = (TileMode)buffer.readUInt();
const TileMode ty = (TileMode)buffer.readUInt();
SkMatrix matrix;
buffer.readMatrix(&matrix);
sk_sp<SkImage> img = buffer.readImage();
if (!img) {
return nullptr;
}
return SkImageShader::Make(std::move(img), tx, ty, &matrix);
}
void SkImageShader::flatten(SkWriteBuffer& buffer) const {
buffer.writeUInt(fTileModeX);
buffer.writeUInt(fTileModeY);
buffer.writeMatrix(this->getLocalMatrix());
buffer.writeImage(fImage.get());
}
bool SkImageShader::isOpaque() const {
return fImage->isOpaque();
}
size_t SkImageShader::onContextSize(const ContextRec& rec) const {
return SkBitmapProcLegacyShader::ContextSize(rec, as_IB(fImage)->onImageInfo());
}
SkShader::Context* SkImageShader::onCreateContext(const ContextRec& rec, void* storage) const {
return SkBitmapProcLegacyShader::MakeContext(*this, fTileModeX, fTileModeY,
SkBitmapProvider(fImage.get()), rec, storage);
}
SkImage* SkImageShader::onIsAImage(SkMatrix* texM, TileMode xy[]) const {
if (texM) {
*texM = this->getLocalMatrix();
}
if (xy) {
xy[0] = (TileMode)fTileModeX;
xy[1] = (TileMode)fTileModeY;
}
return const_cast<SkImage*>(fImage.get());
}
#ifdef SK_SUPPORT_LEGACY_SHADER_ISABITMAP
bool SkImageShader::onIsABitmap(SkBitmap* texture, SkMatrix* texM, TileMode xy[]) const {
const SkBitmap* bm = as_IB(fImage)->onPeekBitmap();
if (!bm) {
return false;
}
if (texture) {
*texture = *bm;
}
if (texM) {
*texM = this->getLocalMatrix();
}
if (xy) {
xy[0] = (TileMode)fTileModeX;
xy[1] = (TileMode)fTileModeY;
}
return true;
}
#endif
static bool bitmap_is_too_big(int w, int h) {
// SkBitmapProcShader stores bitmap coordinates in a 16bit buffer, as it
// communicates between its matrix-proc and its sampler-proc. Until we can
// widen that, we have to reject bitmaps that are larger.
//
static const int kMaxSize = 65535;
return w > kMaxSize || h > kMaxSize;
}
// returns true and set color if the bitmap can be drawn as a single color
// (for efficiency)
static bool can_use_color_shader(const SkImage* image, SkColor* color) {
#ifdef SK_BUILD_FOR_ANDROID_FRAMEWORK
// HWUI does not support color shaders (see b/22390304)
return false;
#endif
if (1 != image->width() || 1 != image->height()) {
return false;
}
SkPixmap pmap;
if (!image->peekPixels(&pmap)) {
return false;
}
switch (pmap.colorType()) {
case kN32_SkColorType:
*color = SkUnPreMultiply::PMColorToColor(*pmap.addr32(0, 0));
return true;
case kRGB_565_SkColorType:
*color = SkPixel16ToColor(*pmap.addr16(0, 0));
return true;
case kIndex_8_SkColorType: {
const SkColorTable& ctable = *pmap.ctable();
*color = SkUnPreMultiply::PMColorToColor(ctable[*pmap.addr8(0, 0)]);
return true;
}
default: // just skip the other configs for now
break;
}
return false;
}
sk_sp<SkShader> SkImageShader::Make(sk_sp<SkImage> image, TileMode tx, TileMode ty,
const SkMatrix* localMatrix,
SkTBlitterAllocator* allocator) {
SkShader* shader;
SkColor color;
if (!image || bitmap_is_too_big(image->width(), image->height())) {
if (nullptr == allocator) {
shader = new SkEmptyShader;
} else {
shader = allocator->createT<SkEmptyShader>();
}
} else if (can_use_color_shader(image.get(), &color)) {
if (nullptr == allocator) {
shader = new SkColorShader(color);
} else {
shader = allocator->createT<SkColorShader>(color);
}
} else {
if (nullptr == allocator) {
shader = new SkImageShader(image, tx, ty, localMatrix);
} else {
shader = allocator->createT<SkImageShader>(image, tx, ty, localMatrix);
}
}
return sk_sp<SkShader>(shader);
}
#ifndef SK_IGNORE_TO_STRING
void SkImageShader::toString(SkString* str) const {
const char* gTileModeName[SkShader::kTileModeCount] = {
"clamp", "repeat", "mirror"
};
str->appendf("ImageShader: ((%s %s) ", gTileModeName[fTileModeX], gTileModeName[fTileModeY]);
fImage->toString(str);
this->INHERITED::toString(str);
str->append(")");
}
#endif
///////////////////////////////////////////////////////////////////////////////////////////////////
#if SK_SUPPORT_GPU
#include "SkGr.h"
#include "SkGrPriv.h"
#include "effects/GrSimpleTextureEffect.h"
#include "effects/GrBicubicEffect.h"
#include "effects/GrSimpleTextureEffect.h"
sk_sp<GrFragmentProcessor> SkImageShader::asFragmentProcessor(const AsFPArgs& args) const {
SkMatrix matrix;
matrix.setIDiv(fImage->width(), fImage->height());
SkMatrix lmInverse;
if (!this->getLocalMatrix().invert(&lmInverse)) {
return nullptr;
}
if (args.fLocalMatrix) {
SkMatrix inv;
if (!args.fLocalMatrix->invert(&inv)) {
return nullptr;
}
lmInverse.postConcat(inv);
}
matrix.preConcat(lmInverse);
SkShader::TileMode tm[] = { fTileModeX, fTileModeY };
// Must set wrap and filter on the sampler before requesting a texture. In two places below
// we check the matrix scale factors to determine how to interpret the filter quality setting.
// This completely ignores the complexity of the drawVertices case where explicit local coords
// are provided by the caller.
bool doBicubic;
GrSamplerParams::FilterMode textureFilterMode =
GrSkFilterQualityToGrFilterMode(args.fFilterQuality, *args.fViewMatrix, this->getLocalMatrix(),
&doBicubic);
GrSamplerParams params(tm, textureFilterMode);
sk_sp<GrTexture> texture(as_IB(fImage)->asTextureRef(args.fContext, params, args.fColorMode));
if (!texture) {
return nullptr;
}
SkImageInfo info = as_IB(fImage)->onImageInfo();
sk_sp<GrColorSpaceXform> colorSpaceXform = GrColorSpaceXform::Make(info.colorSpace(),
args.fDstColorSpace);
sk_sp<GrFragmentProcessor> inner;
if (doBicubic) {
inner = GrBicubicEffect::Make(texture.get(), std::move(colorSpaceXform), matrix, tm);
} else {
inner = GrSimpleTextureEffect::Make(texture.get(), std::move(colorSpaceXform),
matrix, params);
}
if (GrPixelConfigIsAlphaOnly(texture->config())) {
return inner;
}
return sk_sp<GrFragmentProcessor>(GrFragmentProcessor::MulOutputByInputAlpha(std::move(inner)));
}
#endif
///////////////////////////////////////////////////////////////////////////////////////////////////
#include "SkImagePriv.h"
sk_sp<SkShader> SkMakeBitmapShader(const SkBitmap& src, SkShader::TileMode tmx,
SkShader::TileMode tmy, const SkMatrix* localMatrix,
SkCopyPixelsMode cpm, SkTBlitterAllocator* allocator) {
// Until we learn otherwise, it seems that any caller that is passing an allocator must be
// assuming that the returned shader will have a stack-frame lifetime, so we assert that
// they are also asking for kNever_SkCopyPixelsMode. If that proves otherwise, we can remove
// or modify this assert.
SkASSERT(!allocator || (kNever_SkCopyPixelsMode == cpm));
return SkImageShader::Make(SkMakeImageFromRasterBitmap(src, cpm, allocator),
tmx, tmy, localMatrix, allocator);
}
static sk_sp<SkFlattenable> SkBitmapProcShader_CreateProc(SkReadBuffer& buffer) {
SkMatrix lm;
buffer.readMatrix(&lm);
sk_sp<SkImage> image = buffer.readBitmapAsImage();
SkShader::TileMode mx = (SkShader::TileMode)buffer.readUInt();
SkShader::TileMode my = (SkShader::TileMode)buffer.readUInt();
return image ? image->makeShader(mx, my, &lm) : nullptr;
}
SK_DEFINE_FLATTENABLE_REGISTRAR_GROUP_START(SkShader)
SK_DEFINE_FLATTENABLE_REGISTRAR_ENTRY(SkImageShader)
SkFlattenable::Register("SkBitmapProcShader", SkBitmapProcShader_CreateProc, kSkShader_Type);
SK_DEFINE_FLATTENABLE_REGISTRAR_GROUP_END
bool SkImageShader::onAppendStages(SkRasterPipeline* p, SkColorSpace* dst, SkFallbackAlloc* scratch,
const SkMatrix& ctm, SkFilterQuality quality) const {
SkPixmap pm;
if (!fImage->peekPixels(&pm)) {
return false;
}
auto info = pm.info();
auto matrix = SkMatrix::Concat(ctm, this->getLocalMatrix());
if (!matrix.invert(&matrix)) {
return false;
}
// TODO: perspective
if (!matrix.asAffine(nullptr)) {
return false;
}
// TODO: all formats
switch (info.colorType()) {
case kRGBA_8888_SkColorType:
case kBGRA_8888_SkColorType:
// case kRGB_565_SkColorType:
// case kRGBA_F16_SkColorType:
break;
default: return false;
}
// TODO: all tile modes
if (fTileModeX != kClamp_TileMode || fTileModeY != kClamp_TileMode) {
return false;
}
// When the matrix is just an integer translate, bilerp == nearest neighbor.
if (matrix.getType() <= SkMatrix::kTranslate_Mask &&
matrix.getTranslateX() == (int)matrix.getTranslateX() &&
matrix.getTranslateY() == (int)matrix.getTranslateY()) {
quality = kNone_SkFilterQuality;
}
// TODO: bilerp
if (quality != kNone_SkFilterQuality) {
return false;
}
// See skia:4649 and the GM image_scale_aligned.
if (quality == kNone_SkFilterQuality) {
if (matrix.getScaleX() >= 0) {
matrix.setTranslateX(nextafterf(matrix.getTranslateX(),
floorf(matrix.getTranslateX())));
}
if (matrix.getScaleY() >= 0) {
matrix.setTranslateY(nextafterf(matrix.getTranslateY(),
floorf(matrix.getTranslateY())));
}
}
struct context {
const void* pixels;
int stride;
int width;
int height;
float matrix[6];
};
auto ctx = scratch->make<context>();
ctx->pixels = pm.addr();
ctx->stride = pm.rowBytesAsPixels();
ctx->width = pm.width();
ctx->height = pm.height();
SkAssertResult(matrix.asAffine(ctx->matrix));
p->append(SkRasterPipeline::matrix_2x3, &ctx->matrix);
switch (fTileModeX) {
case kClamp_TileMode: p->append(SkRasterPipeline::clamp_x, &ctx->width); break;
case kMirror_TileMode: p->append(SkRasterPipeline::mirror_x, &ctx->width); break;
case kRepeat_TileMode: p->append(SkRasterPipeline::repeat_x, &ctx->width); break;
}
switch (fTileModeY) {
case kClamp_TileMode: p->append(SkRasterPipeline::clamp_y, &ctx->height); break;
case kMirror_TileMode: p->append(SkRasterPipeline::mirror_y, &ctx->height); break;
case kRepeat_TileMode: p->append(SkRasterPipeline::repeat_y, &ctx->height); break;
}
switch(info.colorType()) {
case kRGBA_8888_SkColorType:
case kBGRA_8888_SkColorType:
if (info.gammaCloseToSRGB() && dst) {
p->append(SkRasterPipeline::nearest_srgb, ctx);
} else {
p->append(SkRasterPipeline::nearest_8888, ctx);
}
break;
case kRGBA_F16_SkColorType:
p->append(SkRasterPipeline::nearest_f16, ctx);
break;
case kRGB_565_SkColorType:
p->append(SkRasterPipeline::nearest_565, ctx);
break;
default:
SkASSERT(false);
break;
}
if (info.colorType() == kBGRA_8888_SkColorType) {
p->append(SkRasterPipeline::swap_rb);
}
if (info.alphaType() == kUnpremul_SkAlphaType) {
p->append(SkRasterPipeline::premul);
}
return append_gamut_transform(p, scratch, info.colorSpace(), dst);
}
|
Replace my confusion with a pointer to the explanation.
|
Replace my confusion with a pointer to the explanation.
NOTRY=true
GOLD_TRYBOT_URL= https://gold.skia.org/search?issue=4982
Change-Id: I9f1686519ea1dd5b50dce2e6ecef22741468e9d6
Reviewed-on: https://skia-review.googlesource.com/4982
Reviewed-by: Herb Derby <[email protected]>
|
C++
|
bsd-3-clause
|
rubenvb/skia,google/skia,aosp-mirror/platform_external_skia,google/skia,HalCanary/skia-hc,google/skia,Hikari-no-Tenshi/android_external_skia,HalCanary/skia-hc,Hikari-no-Tenshi/android_external_skia,Hikari-no-Tenshi/android_external_skia,aosp-mirror/platform_external_skia,HalCanary/skia-hc,Hikari-no-Tenshi/android_external_skia,google/skia,rubenvb/skia,google/skia,HalCanary/skia-hc,google/skia,google/skia,HalCanary/skia-hc,rubenvb/skia,rubenvb/skia,rubenvb/skia,aosp-mirror/platform_external_skia,rubenvb/skia,aosp-mirror/platform_external_skia,rubenvb/skia,google/skia,aosp-mirror/platform_external_skia,google/skia,aosp-mirror/platform_external_skia,rubenvb/skia,aosp-mirror/platform_external_skia,Hikari-no-Tenshi/android_external_skia,Hikari-no-Tenshi/android_external_skia,aosp-mirror/platform_external_skia,rubenvb/skia,HalCanary/skia-hc,rubenvb/skia,aosp-mirror/platform_external_skia,HalCanary/skia-hc,HalCanary/skia-hc,Hikari-no-Tenshi/android_external_skia,aosp-mirror/platform_external_skia,Hikari-no-Tenshi/android_external_skia,HalCanary/skia-hc,HalCanary/skia-hc,google/skia
|
b0820f4fca43e7a2e31f5c92245075bdc4082210
|
data-student.cpp
|
data-student.cpp
|
#include "data-student.hpp"
using namespace std;
void Student::init(string n, int s, int g, string m) {
name = n;
startingYear = s;
gradutationYear = g;
addMajors(m);
}
Student::Student() {
init("", 2000, 2004, "");
}
Student::Student(string n, string s, string e, string m) {
int startYear = stringToInt(s), endYear = stringToInt(e);
init(n, startYear, endYear, m);
}
Student::Student(string fn) {
string yearS, yearE;
ifstream infile(fn.c_str());
string nextLine;
vector<string> lines;
// load the entire file
while (infile.peek() != -1) {
getline(infile, nextLine);
lines.push_back(nextLine);
}
string previousHeading;
for (vector<string>::iterator i = lines.begin(); i != lines.end(); ++i) {
string str = *i;
if (str[0] == '#') {
previousHeading = *i;
continue;
}
else if (str != "") {
if (previousHeading == "# NAME")
name = str;
else if (previousHeading == "# MAJORS")
addMajor(Major(str));
else if (previousHeading == "# CONCENTRATIONS")
addMajor(Major(str));
else if (previousHeading == "# COURSES")
addCourse(Course(str));
}
}
}
void Student::addMajor(const Major& m) {
majors.push_back(m);
}
void Student::addMajors(string str) {
vector<string> record = split(str, ',');
for (vector<string>::iterator i = record.begin(); i != record.end(); ++i)
addMajor(*i);
}
void Student::addCourse(const Course& c) {
courses.push_back(c);
}
void Student::addCourses(string str) {
vector<string> record = split(str, ',');
for (vector<string>::iterator i = record.begin(); i != record.end(); ++i)
addCourse(Course(*i));
}
bool Student::hasTakenCourse(string str) {
bool userHasTaken = false;
Course checkAgainst = getCourse(str);
for (std::vector<Course>::iterator i = courses.begin(); i != courses.end(); ++i)
if (*i == checkAgainst)
userHasTaken = true;
return userHasTaken;
}
ostream& Student::getData(ostream &os) {
os << name << ", ";
os << "you are majoring in ";
for (vector<Major>::iterator i = majors.begin(); i != majors.end(); ++i){
if (majors.size() == 2) {
if (i != majors.end()-1)
os << *i << " and ";
else
os << *i << " ";
}
else {
if (i != majors.end()-1)
os << *i << ", ";
else
os << "and " << *i << ", ";
}
}
os << "while taking:" << endl;
for (vector<Course>::iterator i = courses.begin(); i != courses.end(); ++i)
os << *i << endl;
return os;
}
void Student::display() {
cout << *this << endl;
};
ostream& operator<<(ostream& os, Student& item) {
os << item.getData(os);
return os;
}
|
#include "data-student.hpp"
using namespace std;
void Student::init(string n, int s, int g, string m) {
name = n;
startingYear = s;
gradutationYear = g;
addMajors(m);
}
Student::Student() {
init("", 2000, 2004, "");
}
Student::Student(string n, string s, string e, string m) {
int startYear = stringToInt(s), endYear = stringToInt(e);
init(n, startYear, endYear, m);
}
Student::Student(string fn) {
string yearS, yearE;
ifstream infile(fn.c_str());
string nextLine;
vector<string> lines;
// load the entire file
while (infile.peek() != -1) {
getline(infile, nextLine);
lines.push_back(nextLine);
}
string previousHeading;
for (vector<string>::iterator i = lines.begin(); i != lines.end(); ++i) {
string str = *i;
if (str[0] == '#') {
previousHeading = *i;
continue;
}
else if (str != "") {
if (previousHeading == "# NAME")
name = str;
else if (previousHeading == "# MAJORS")
addMajor(Major(str));
else if (previousHeading == "# CONCENTRATIONS")
addMajor(Major(str));
else if (previousHeading == "# COURSES")
addCourse(Course(str));
}
}
}
void Student::addMajor(const Major& m) {
majors.push_back(m);
}
void Student::addMajors(string str) {
vector<string> record = split(str, ',');
for (vector<string>::iterator i = record.begin(); i != record.end(); ++i)
addMajor(*i);
}
void Student::addCourse(const Course& c) {
courses.push_back(c);
}
void Student::addCourses(string str) {
vector<string> record = split(str, ',');
for (vector<string>::iterator i = record.begin(); i != record.end(); ++i)
addCourse(Course(*i));
}
bool Student::hasTakenCourse(string str) {
bool userHasTaken = false;
Course checkAgainst = getCourse(str);
for (std::vector<Course>::iterator i = courses.begin(); i != courses.end(); ++i)
if (*i == checkAgainst)
userHasTaken = true;
return userHasTaken;
}
ostream& Student::getData(ostream &os) {
os << name << ", ";
os << "you are majoring in ";
for (vector<Major>::iterator i = majors.begin(); i != majors.end(); ++i){
if (majors.size() == 2) {
if (i != majors.end()-1)
os << *i << " and ";
else
os << *i << " ";
}
else {
if (i != majors.end()-1)
os << *i << ", ";
else
os << "and " << *i << ", ";
}
}
os << "while taking:" << endl;
for (vector<Course>::iterator i = courses.begin(); i != courses.end(); ++i)
os << *i << endl;
return os;
}
void Student::display() {
cout << *this << endl;
};
ostream& operator<<(ostream& os, Student& item) {
return item.getData(os);
}
|
Simplify << operator override for Student
|
Simplify << operator override for Student
|
C++
|
agpl-3.0
|
hawkrives/gobbldygook,hawkrives/gobbldygook,hawkrives/gobbldygook
|
601e4bfb2533aac64f97ab860a00c2b22ca83666
|
x_client_chooser.cpp
|
x_client_chooser.cpp
|
#include "x_client_chooser.hpp"
#include <algorithm>
#include <X11/keysym.h>
x_client_chooser::x_client_chooser(const x_connection & c,
const layout_t * layout,
x_client_container & x_clients,
xcb_keysym_t action_keysym,
xcb_mod_mask_t action_modmask)
: _c(c), _layout(layout), _x_clients(x_clients)
, _action_modmask(action_modmask)
{
_c.grab_key(_action_modmask, action_keysym);
_action_keycode = _c.keysym_to_keycode(action_keysym);
_modifier_map = _c.modifier_mapping();
}
void x_client_chooser::handle(xcb_generic_event_t * ge)
{
if (XCB_KEY_PRESS == (ge->response_type & ~0x80)) {
xcb_key_press_event_t * e = (xcb_key_press_event_t *)ge;
xcb_keysym_t keysym = _c.keycode_to_keysym(e->detail);
if (keysym == XK_Escape && e->state == 0) {
_active = false;
} else if (keysym == _action_keycode
&& (e->state == _action_modmask
|| e->state == (_action_modmask | XCB_MOD_MASK_SHIFT))) {
if (_active) {
_current_client->update_preview(false);
move_client(e->state == _action_modmask);
_current_client->update_preview(true);
} else {
_x_clients.update();
if (_x_clients.size() == 0) { return; }
_active = true;
_c.grab_keyboard();
_active_window = _c.net_active_window();
configure_clients_preview();
_current_client =
std::find(_x_clients.begin(), _x_clients.end(), _active_window);
move_client(e->state == _action_modmask);
for (auto & client : _x_clients) {
client.show_preview(client == _current_client->window());
}
}
}
} else if (XCB_KEY_RELEASE == (ge->response_type & ~0x80)) {
xcb_key_release_event_t * e = (xcb_key_release_event_t *)ge;
for (auto & keycode : _modifier_map[_action_modmask]) {
if (e->detail == keycode) {
for (auto & client : _x_clients) {
client.hide_preview();
}
_c.request_change_active_window(_current_client->window());
_active = false;
_c.ungrab_keyboard();
}
break;
}
}
}
void x_client_chooser::move_client(bool next)
{
if (next) {
if (++_current_client == _x_clients.end()) {
_current_client = _x_clients.begin();
}
} else {
if (_current_client == _x_clients.begin()) {
_current_client = _x_clients.end();
}
--_current_client;
}
}
void
x_client_chooser::configure_clients_preview(void)
{
int i = 0;
auto rects = _layout->arrange(_c.current_screen(), _x_clients.size());
for (auto & client : _x_clients) {
double scale_x = (double)rects[i].width()
/ (double)client.rectangle().width();
double scale_y = (double)rects[i].height()
/ (double)client.rectangle().height();
client.preview_scale() = std::min(scale_x, scale_y);
client.preview_position().x = rects[i].x();
client.preview_position().y = rects[i].y();
unsigned int realwidth = client.rectangle().width()
* client.preview_scale();
unsigned int realheight = client.rectangle().height()
* client.preview_scale();
if (realwidth < rects[i].width()) {
client.preview_position().x += (rects[i].width() - realwidth) / 2;
}
if (realheight < rects[i].height()) {
client.preview_position().y += (rects[i].height() - realheight) / 2;
}
i++;
}
}
|
#include "x_client_chooser.hpp"
#include <algorithm>
#include <X11/keysym.h>
x_client_chooser::x_client_chooser(const x_connection & c,
const layout_t * layout,
x_client_container & x_clients,
xcb_keysym_t action_keysym,
xcb_mod_mask_t action_modmask)
: _c(c), _layout(layout), _x_clients(x_clients)
, _action_modmask(action_modmask)
{
_c.grab_key(_action_modmask, action_keysym);
_action_keycode = _c.keysym_to_keycode(action_keysym);
_modifier_map = _c.modifier_mapping();
}
void x_client_chooser::handle(xcb_generic_event_t * ge)
{
if (XCB_KEY_PRESS == (ge->response_type & ~0x80)) {
xcb_key_press_event_t * e = (xcb_key_press_event_t *)ge;
if (e->detail == _action_keycode
&& (e->state == _action_modmask
|| e->state == (_action_modmask | XCB_MOD_MASK_SHIFT))) {
if (_active) {
_current_client->update_preview(false);
move_client(e->state == _action_modmask);
_current_client->update_preview(true);
} else {
_x_clients.update();
if (_x_clients.size() == 0) { return; }
_active = true;
_c.grab_keyboard();
_active_window = _c.net_active_window();
configure_clients_preview();
_current_client =
std::find(_x_clients.begin(), _x_clients.end(), _active_window);
move_client(e->state == _action_modmask);
for (auto & client : _x_clients) {
client.show_preview(client == _current_client->window());
}
}
}
} else if (XCB_KEY_RELEASE == (ge->response_type & ~0x80)) {
xcb_key_release_event_t * e = (xcb_key_release_event_t *)ge;
for (auto & keycode : _modifier_map[_action_modmask]) {
if (e->detail == keycode) {
for (auto & client : _x_clients) {
client.hide_preview();
}
_c.request_change_active_window(_current_client->window());
_active = false;
_c.ungrab_keyboard();
}
break;
}
}
}
void x_client_chooser::move_client(bool next)
{
if (next) {
if (++_current_client == _x_clients.end()) {
_current_client = _x_clients.begin();
}
} else {
if (_current_client == _x_clients.begin()) {
_current_client = _x_clients.end();
}
--_current_client;
}
}
void
x_client_chooser::configure_clients_preview(void)
{
int i = 0;
auto rects = _layout->arrange(_c.current_screen(), _x_clients.size());
for (auto & client : _x_clients) {
double scale_x = (double)rects[i].width()
/ (double)client.rectangle().width();
double scale_y = (double)rects[i].height()
/ (double)client.rectangle().height();
client.preview_scale() = std::min(scale_x, scale_y);
client.preview_position().x = rects[i].x();
client.preview_position().y = rects[i].y();
unsigned int realwidth = client.rectangle().width()
* client.preview_scale();
unsigned int realheight = client.rectangle().height()
* client.preview_scale();
if (realwidth < rects[i].width()) {
client.preview_position().x += (rects[i].width() - realwidth) / 2;
}
if (realheight < rects[i].height()) {
client.preview_position().y += (rects[i].height() - realheight) / 2;
}
i++;
}
}
|
Make modifier + key configurable through constructor
|
Make modifier + key configurable through constructor
|
C++
|
bsd-3-clause
|
jotrk/x-choyce,jotrk/x-choyce
|
01bd2bd371051e9dcab0cd15db43a607d5f12b63
|
desktop/qa/gtktiledviewer/gtktiledviewer.cxx
|
desktop/qa/gtktiledviewer/gtktiledviewer.cxx
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*/
#include <stdio.h>
#include <string.h>
#include <gdk/gdk.h>
#include <gdk/gdkx.h>
#include <gtk/gtk.h>
#include <X11/extensions/Xrender.h>
// Only for the SystemGraphicsData struct, and hopefully we can find some better
// replacement for that at some point.
#include <vcl/sysdata.hxx>
#define LOK_USE_UNSTABLE_API
#include <LibreOfficeKit/LibreOfficeKit.hxx>
using namespace ::lok;
static int help()
{
fprintf( stderr, "Usage: gtktiledviewer <absolute-path-to-libreoffice-install> [path to document]\n" );
return 1;
}
static GtkWidget* ourCanvas;
bool drawCallback(GtkWidget* /* The eventbox */, void* /* cairo_t* cr */, gpointer pData)
{
fprintf(stderr, "attempting to draw tile");
Document* pDocument = static_cast< Document* >( pData );
long nWidth, nHeight;
pDocument->getDocumentSize( &nWidth, &nHeight );
// Draw the whole document at once (for now)
int nRenderWidth = nWidth / 10;
int nRenderHeight = nHeight / 10;
int nRowStride;
unsigned char* pBuffer = pDocument->paintTile( nRenderWidth, nRenderHeight,
&nRowStride,
0, 0, // origin
nWidth, nHeight );
GdkPixbuf* pBixBuf = gdk_pixbuf_new_from_data( pBuffer, GDK_COLORSPACE_RGB,
false, 8,
nRenderWidth, nRenderHeight,
nRowStride,
0, 0 );
pBixBuf = gdk_pixbuf_flip( pBixBuf, false );
gtk_image_set_from_pixbuf( GTK_IMAGE(ourCanvas), pBixBuf );
// TODO: we need to keep track of and cleanup these buffers etc.
return true;
}
int main( int argc, char* argv[] )
{
if( argc < 2 ||
( argc > 1 && ( !strcmp( argv[1], "--help" ) || !strcmp( argv[1], "-h" ) ) ) )
return help();
if ( argv[1][0] != '/' )
{
fprintf(stderr, "Absolute path required to libreoffice install\n");
return 1;
}
::lok::Office *pOffice = ::lok::lok_cpp_init( argv[1] );
if( !pOffice )
{
fprintf( stderr, "Failed to initialize\n" );
return -1;
}
::lok::Document* pDocument = pOffice->documentLoad( argv[2] );
gtk_init( &argc, &argv );
GtkWidget *pWindow = gtk_window_new( GTK_WINDOW_TOPLEVEL );
gtk_window_set_title( GTK_WINDOW(pWindow), "LibreOffice GTK Tiled Viewer" );
gtk_window_set_default_size(GTK_WINDOW(pWindow), 800, 600);
g_signal_connect( pWindow, "destroy", G_CALLBACK(gtk_main_quit), NULL );
GtkWidget* pScroller = gtk_scrolled_window_new( 0, 0 );
gtk_container_add( GTK_CONTAINER(pWindow), pScroller );
GtkWidget* pEventBox = gtk_event_box_new();
gtk_scrolled_window_add_with_viewport( GTK_SCROLLED_WINDOW(pScroller), pEventBox );
GtkWidget* pCanvas = gtk_image_new();
ourCanvas = pCanvas;
gtk_container_add( GTK_CONTAINER( pEventBox ), pCanvas );
g_signal_connect( G_OBJECT(pEventBox), "button-press-event", G_CALLBACK(drawCallback), pDocument);
gtk_widget_show( pCanvas );
gtk_widget_show( pEventBox );
gtk_widget_show( pScroller );
gtk_widget_show( pWindow );
drawCallback( pCanvas, 0, pDocument );
gtk_main();
return 0;
}
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*/
#include <stdio.h>
#include <string.h>
#include <gdk/gdk.h>
#include <gdk/gdkx.h>
#include <gtk/gtk.h>
#include <X11/extensions/Xrender.h>
// Only for the SystemGraphicsData struct, and hopefully we can find some better
// replacement for that at some point.
#include <vcl/sysdata.hxx>
#define LOK_USE_UNSTABLE_API
#include <LibreOfficeKit/LibreOfficeKit.hxx>
using namespace ::lok;
static int help()
{
fprintf( stderr, "Usage: gtktiledviewer <absolute-path-to-libreoffice-install> [path to document]\n" );
return 1;
}
static GtkWidget* ourCanvas;
bool drawCallback(GtkWidget* /* The eventbox */, void* /* cairo_t* cr */, gpointer pData)
{
fprintf(stderr, "attempting to draw tile");
Document* pDocument = static_cast< Document* >( pData );
long nWidth, nHeight;
pDocument->getDocumentSize( &nWidth, &nHeight );
// Draw the whole document at once (for now)
int nRenderWidth = nWidth / 10;
int nRenderHeight = nHeight / 10;
int nRowStride;
unsigned char* pBuffer = pDocument->paintTile( nRenderWidth, nRenderHeight,
&nRowStride,
0, 0, // origin
nWidth, nHeight );
for (int i = 3; i < nRowStride*nRenderHeight; i += 4)
{
pBuffer[i] = 0xFF;
}
GdkPixbuf* pBixBuf = gdk_pixbuf_new_from_data( pBuffer, GDK_COLORSPACE_RGB,
true, 8,
nRenderWidth, nRenderHeight,
nRowStride,
0, 0 );
pBixBuf = gdk_pixbuf_flip( pBixBuf, false );
gtk_image_set_from_pixbuf( GTK_IMAGE(ourCanvas), pBixBuf );
// TODO: we need to keep track of and cleanup these buffers etc.
return true;
}
int main( int argc, char* argv[] )
{
if( argc < 2 ||
( argc > 1 && ( !strcmp( argv[1], "--help" ) || !strcmp( argv[1], "-h" ) ) ) )
return help();
if ( argv[1][0] != '/' )
{
fprintf(stderr, "Absolute path required to libreoffice install\n");
return 1;
}
::lok::Office *pOffice = ::lok::lok_cpp_init( argv[1] );
if( !pOffice )
{
fprintf( stderr, "Failed to initialize\n" );
return -1;
}
::lok::Document* pDocument = pOffice->documentLoad( argv[2] );
gtk_init( &argc, &argv );
GtkWidget *pWindow = gtk_window_new( GTK_WINDOW_TOPLEVEL );
gtk_window_set_title( GTK_WINDOW(pWindow), "LibreOffice GTK Tiled Viewer" );
gtk_window_set_default_size(GTK_WINDOW(pWindow), 800, 600);
g_signal_connect( pWindow, "destroy", G_CALLBACK(gtk_main_quit), NULL );
GtkWidget* pScroller = gtk_scrolled_window_new( 0, 0 );
gtk_container_add( GTK_CONTAINER(pWindow), pScroller );
GtkWidget* pEventBox = gtk_event_box_new();
gtk_scrolled_window_add_with_viewport( GTK_SCROLLED_WINDOW(pScroller), pEventBox );
GtkWidget* pCanvas = gtk_image_new();
ourCanvas = pCanvas;
gtk_container_add( GTK_CONTAINER( pEventBox ), pCanvas );
g_signal_connect( G_OBJECT(pEventBox), "button-press-event", G_CALLBACK(drawCallback), pDocument);
gtk_widget_show( pCanvas );
gtk_widget_show( pEventBox );
gtk_widget_show( pScroller );
gtk_widget_show( pWindow );
drawCallback( pCanvas, 0, pDocument );
gtk_main();
return 0;
}
|
Upgrade gtktiledviewer to RGBA.
|
Upgrade gtktiledviewer to RGBA.
The Alpha channel seems to be set incorrectly by LO, hence
we need to manually set it here for now.
Change-Id: I1f9091b8b6f88c1dba6653dfb7bf51f9fe14b3fc
|
C++
|
mpl-2.0
|
JurassicWordExcel/core,JurassicWordExcel/core,JurassicWordExcel/core,JurassicWordExcel/core,JurassicWordExcel/core,JurassicWordExcel/core,JurassicWordExcel/core,JurassicWordExcel/core,JurassicWordExcel/core,JurassicWordExcel/core
|
168619bd57edb473eda190692a90a591d321840a
|
include/Cats/Corecat/System/Environment.hpp
|
include/Cats/Corecat/System/Environment.hpp
|
/*
*
* MIT License
*
* Copyright (c) 2016-2018 The Cats Project
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*
*/
#ifndef CATS_CORECAT_SYSTEM_ENVIRONMENT_HPP
#define CATS_CORECAT_SYSTEM_ENVIRONMENT_HPP
#include "OS.hpp"
#include "../Data/Array.hpp"
#include "../Text/String.hpp"
#include "../Util/Exception.hpp"
#if defined(CORECAT_OS_WINDOWS)
# include "../Win32/Windows.hpp"
#elif defined(CORECAT_OS_LINUX) || defined(CORECAT_OS_MACOS)
# include <limits.h>
# include <unistd.h>
# if defined(CORECAT_OS_MACOS)
# include <crt_externs.h>
# define environ (*_NSGetEnviron())
# endif
#else
# error Unknown OS
#endif
namespace Cats {
namespace Corecat {
inline namespace System {
class Environment {
public:
static Array<String8> getEnvironmentVariable() {
#if defined(CORECAT_OS_WINDOWS)
std::size_t count = 0;
auto env = ::GetEnvironmentStringsW();
if(!env) return {};
for(auto p = env; *p; ++count, ++p)
while(*++p);
Array<String8> data;
data.reserve(count);
for(auto p = env; *p; ++p) {
data.push(WString(p));
while(*++p);
}
::FreeEnvironmentStringsW(env);
return data;
#else
std::size_t count = 0;
for(auto p = environ; *p; ++count, ++p);
Array<String8> data;
data.reserve(count);
for(auto p = environ; *p; ++p)
data.push(WString(*p));
return data;
#endif
}
static String8 getCurrentDirectory() {
#if defined(CORECAT_OS_WINDOWS)
WString path;
path.setLength(::GetCurrentDirectoryW(0, nullptr));
::GetCurrentDirectoryW(DWORD(path.getLength() + 1), path.getData());
return String8(path);
#else
char path[PATH_MAX];
if(!::getcwd(path, sizeof(path)))
throw SystemException("::getcwd failed");
return path;
#endif
}
};
}
}
}
#endif
|
/*
*
* MIT License
*
* Copyright (c) 2016-2018 The Cats Project
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*
*/
#ifndef CATS_CORECAT_SYSTEM_ENVIRONMENT_HPP
#define CATS_CORECAT_SYSTEM_ENVIRONMENT_HPP
#include "OS.hpp"
#include "../Data/Array.hpp"
#include "../Text/String.hpp"
#include "../Util/Exception.hpp"
#if defined(CORECAT_OS_WINDOWS)
# include "../Win32/Windows.hpp"
#elif defined(CORECAT_OS_LINUX) || defined(CORECAT_OS_MACOS)
# include <limits.h>
# include <unistd.h>
# if defined(CORECAT_OS_MACOS)
# include <crt_externs.h>
# define environ (*_NSGetEnviron())
# endif
#else
# error Unknown OS
#endif
namespace Cats {
namespace Corecat {
inline namespace System {
class Environment {
public:
static Array<String8> getEnvironmentVariable() {
#if defined(CORECAT_OS_WINDOWS)
std::size_t count = 0;
auto env = ::GetEnvironmentStringsW();
if(!env) return {};
for(auto p = env; *p; ++count, ++p)
while(*++p);
Array<String8> data;
data.reserve(count);
for(auto p = env; *p; ++p) {
data.push(WString(p));
while(*++p);
}
::FreeEnvironmentStringsW(env);
return data;
#else
std::size_t count = 0;
for(auto p = environ; *p; ++count, ++p);
Array<String8> data;
data.reserve(count);
for(auto p = environ; *p; ++p)
data.push(WString(*p));
return data;
#endif
}
static Array<String8> getEnvironmentVariable(StringView8 name) {
}
static String8 getCurrentDirectory() {
#if defined(CORECAT_OS_WINDOWS)
WString path;
path.setLength(::GetCurrentDirectoryW(0, nullptr));
::GetCurrentDirectoryW(DWORD(path.getLength() + 1), path.getData());
return String8(path);
#else
char path[PATH_MAX];
if(!::getcwd(path, sizeof(path)))
throw SystemException("::getcwd failed");
return path;
#endif
}
};
}
}
}
#endif
|
Update Environment
|
Update Environment
|
C++
|
mit
|
SuperSodaSea/Corecat
|
cf45718ecced3c92d3069f05c6de13e4ebd1f205
|
include/Cats/Corecat/System/Environment.hpp
|
include/Cats/Corecat/System/Environment.hpp
|
/*
*
* MIT License
*
* Copyright (c) 2016-2018 The Cats Project
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*
*/
#ifndef CATS_CORECAT_SYSTEM_ENVIRONMENT_HPP
#define CATS_CORECAT_SYSTEM_ENVIRONMENT_HPP
#include "OS.hpp"
#include "../Data/Array.hpp"
#include "../Text/String.hpp"
#include "../Util/Exception.hpp"
#if defined(CORECAT_OS_WINDOWS)
# include "../Win32/Windows.hpp"
#elif defined(CORECAT_OS_LINUX) || defined(CORECAT_OS_MACOS)
# include <limits.h>
# include <unistd.h>
# if defined(CORECAT_OS_MACOS)
# include <crt_externs.h>
# define environ (*_NSGetEnviron())
# endif
#else
# error Unknown OS
#endif
namespace Cats {
namespace Corecat {
inline namespace System {
class Environment {
public:
static Array<String8> getEnvironmentVariable() {
#if defined(CORECAT_OS_WINDOWS)
std::size_t count = 0;
auto env = ::GetEnvironmentStringsW();
if(!env) return {};
for(auto p = env; *p; ++count, ++p)
while(*++p);
Array<String8> data;
data.reserve(count);
for(auto p = env; *p; ++p) {
data.push(WString(p));
while(*++p);
}
::FreeEnvironmentStringsW(env);
return data;
#else
std::size_t count = 0;
for(auto p = environ; *p; ++count, ++p);
Array<String8> data;
data.reserve(count);
for(auto p = environ; *p; ++p)
data.push(WString(*p));
return data;
#endif
}
static Array<String8> getEnvironmentVariable(StringView8 name) {
#if defined(CORECAT_OS_WINDOWS)
#else
#endif
}
static String8 getCurrentDirectory() {
#if defined(CORECAT_OS_WINDOWS)
WString path;
path.setLength(::GetCurrentDirectoryW(0, nullptr));
::GetCurrentDirectoryW(DWORD(path.getLength() + 1), path.getData());
return String8(path);
#else
char path[PATH_MAX];
if(!::getcwd(path, sizeof(path)))
throw SystemException("::getcwd failed");
return path;
#endif
}
};
}
}
}
#endif
|
/*
*
* MIT License
*
* Copyright (c) 2016-2018 The Cats Project
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*
*/
#ifndef CATS_CORECAT_SYSTEM_ENVIRONMENT_HPP
#define CATS_CORECAT_SYSTEM_ENVIRONMENT_HPP
#include "OS.hpp"
#include "../Data/Array.hpp"
#include "../Text/String.hpp"
#include "../Util/Exception.hpp"
#if defined(CORECAT_OS_WINDOWS)
# include "../Win32/Windows.hpp"
#elif defined(CORECAT_OS_LINUX) || defined(CORECAT_OS_MACOS)
# include <limits.h>
# include <unistd.h>
# if defined(CORECAT_OS_MACOS)
# include <crt_externs.h>
# define environ (*_NSGetEnviron())
# endif
#else
# error Unknown OS
#endif
namespace Cats {
namespace Corecat {
inline namespace System {
class Environment {
public:
static Array<String8> getEnvironmentVariable() {
#if defined(CORECAT_OS_WINDOWS)
std::size_t count = 0;
auto env = ::GetEnvironmentStringsW();
if(!env) return {};
for(auto p = env; *p; ++count, ++p)
while(*++p);
Array<String8> data;
data.reserve(count);
for(auto p = env; *p; ++p) {
data.push(WString(p));
while(*++p);
}
::FreeEnvironmentStringsW(env);
return data;
#else
std::size_t count = 0;
for(auto p = environ; *p; ++count, ++p);
Array<String8> data;
data.reserve(count);
for(auto p = environ; *p; ++p)
data.push(WString(*p));
return data;
#endif
}
static Array<String8> getEnvironmentVariable(StringView8 name) {
#if defined(CORECAT_OS_WINDOWS)
#else
#endif
}
static Array<String8> setEnvironmentVariable(StringView8 name) {
}
static String8 getCurrentDirectory() {
#if defined(CORECAT_OS_WINDOWS)
WString path;
path.setLength(::GetCurrentDirectoryW(0, nullptr));
::GetCurrentDirectoryW(DWORD(path.getLength() + 1), path.getData());
return String8(path);
#else
char path[PATH_MAX];
if(!::getcwd(path, sizeof(path)))
throw SystemException("::getcwd failed");
return path;
#endif
}
};
}
}
}
#endif
|
Update Environment
|
Update Environment
|
C++
|
mit
|
SuperSodaSea/Corecat
|
198a6bd281ceede20481f57e41170b715d109ec4
|
tutorials/graphs/labels1.C
|
tutorials/graphs/labels1.C
|
//Setting alphanumeric labels in a 1-d histogram
//Author; Rene Brun
void labels1()
{
const Int_t nx = 20;
char *people[nx] = {"Jean","Pierre","Marie","Odile","Sebastien","Fons","Rene",
"Nicolas","Xavier","Greg","Bjarne","Anton","Otto","Eddy","Peter","Pasha",
"Philippe","Suzanne","Jeff","Valery"};
TCanvas *c1 = new TCanvas("c1","demo bin labels",10,10,900,500);
c1->SetGrid();
c1->SetBottomMargin(0.15);
TH1F *h = new TH1F("h","test",nx,0,nx);
h->SetFillColor(38);
for (Int_t i=0;i<5000;i++) {
h->Fill(gRandom->Gaus(0.5*nx,0.2*nx));
}
h->SetStats(0);
for (i=1;i<=nx;i++) {
h->GetXaxis()->SetBinLabel(i,people[i-1]);
}
h->Draw();
TPaveText *pt = new TPaveText(0.6,0.7,0.98,0.98,"brNDC");
pt->SetFillColor(18);
pt->SetTextAlign(12);
pt->AddText("Use the axis Context Menu LabelsOption");
pt->AddText(" \"a\" to sort by alphabetic order");
pt->AddText(" \">\" to sort by decreasing vakues");
pt->AddText(" \"<\" to sort by increasing vakues");
pt->Draw();
}
|
//Setting alphanumeric labels in a 1-d histogram
//Author; Rene Brun
void labels1()
{
const Int_t nx = 20;
char *people[nx] = {"Jean","Pierre","Marie","Odile","Sebastien","Fons","Rene",
"Nicolas","Xavier","Greg","Bjarne","Anton","Otto","Eddy","Peter","Pasha",
"Philippe","Suzanne","Jeff","Valery"};
TCanvas *c1 = new TCanvas("c1","demo bin labels",10,10,900,500);
c1->SetGrid();
c1->SetBottomMargin(0.15);
TH1F *h = new TH1F("h","test",nx,0,nx);
h->SetFillColor(38);
for (Int_t i=0;i<5000;i++) {
h->Fill(gRandom->Gaus(0.5*nx,0.2*nx));
}
h->SetStats(0);
for (i=1;i<=nx;i++) {
h->GetXaxis()->SetBinLabel(i,people[i-1]);
}
h->Draw();
TPaveText *pt = new TPaveText(0.6,0.7,0.98,0.98,"brNDC");
pt->SetFillColor(18);
pt->SetTextAlign(12);
pt->AddText("Use the axis Context Menu LabelsOption");
pt->AddText(" \"a\" to sort by alphabetic order");
pt->AddText(" \">\" to sort by decreasing values");
pt->AddText(" \"<\" to sort by increasing values");
pt->Draw();
}
|
Fix typos
|
Fix typos
git-svn-id: acec3fd5b7ea1eb9e79d6329d318e8118ee2e14f@23791 27541ba8-7e3a-0410-8455-c3a389f83636
|
C++
|
lgpl-2.1
|
veprbl/root,esakellari/my_root_for_test,buuck/root,krafczyk/root,sbinet/cxx-root,abhinavmoudgil95/root,perovic/root,Dr15Jones/root,arch1tect0r/root,beniz/root,CristinaCristescu/root,CristinaCristescu/root,sirinath/root,agarciamontoro/root,mkret2/root,bbockelm/root,olifre/root,kirbyherm/root-r-tools,root-mirror/root,zzxuanyuan/root,gganis/root,esakellari/root,alexschlueter/cern-root,karies/root,tc3t/qoot,0x0all/ROOT,kirbyherm/root-r-tools,omazapa/root-old,karies/root,arch1tect0r/root,tc3t/qoot,vukasinmilosevic/root,CristinaCristescu/root,esakellari/my_root_for_test,Dr15Jones/root,veprbl/root,nilqed/root,mattkretz/root,cxx-hep/root-cern,pspe/root,arch1tect0r/root,pspe/root,smarinac/root,krafczyk/root,dfunke/root,bbockelm/root,georgtroska/root,omazapa/root,root-mirror/root,olifre/root,satyarth934/root,beniz/root,jrtomps/root,tc3t/qoot,krafczyk/root,simonpf/root,0x0all/ROOT,perovic/root,evgeny-boger/root,davidlt/root,pspe/root,mattkretz/root,Y--/root,davidlt/root,root-mirror/root,omazapa/root-old,dfunke/root,bbockelm/root,davidlt/root,davidlt/root,jrtomps/root,tc3t/qoot,zzxuanyuan/root-compressor-dummy,gbitzes/root,cxx-hep/root-cern,BerserkerTroll/root,gbitzes/root,sirinath/root,tc3t/qoot,georgtroska/root,root-mirror/root,karies/root,Y--/root,satyarth934/root,omazapa/root,tc3t/qoot,buuck/root,gbitzes/root,ffurano/root5,veprbl/root,sirinath/root,abhinavmoudgil95/root,0x0all/ROOT,krafczyk/root,alexschlueter/cern-root,Duraznos/root,abhinavmoudgil95/root,jrtomps/root,perovic/root,jrtomps/root,smarinac/root,zzxuanyuan/root-compressor-dummy,mattkretz/root,smarinac/root,0x0all/ROOT,kirbyherm/root-r-tools,satyarth934/root,zzxuanyuan/root,smarinac/root,gganis/root,ffurano/root5,BerserkerTroll/root,omazapa/root-old,nilqed/root,strykejern/TTreeReader,Duraznos/root,karies/root,cxx-hep/root-cern,agarciamontoro/root,omazapa/root,olifre/root,sawenzel/root,davidlt/root,sbinet/cxx-root,omazapa/root,buuck/root,root-mirror/root,evgeny-boger/root,alexschlueter/cern-root,nilqed/root,cxx-hep/root-cern,buuck/root,bbockelm/root,buuck/root,Duraznos/root,ffurano/root5,esakellari/root,nilqed/root,lgiommi/root,gganis/root,pspe/root,vukasinmilosevic/root,vukasinmilosevic/root,abhinavmoudgil95/root,sbinet/cxx-root,esakellari/root,georgtroska/root,CristinaCristescu/root,nilqed/root,zzxuanyuan/root,esakellari/root,bbockelm/root,georgtroska/root,mhuwiler/rootauto,sirinath/root,omazapa/root-old,abhinavmoudgil95/root,zzxuanyuan/root-compressor-dummy,gbitzes/root,pspe/root,simonpf/root,mkret2/root,bbockelm/root,sirinath/root,olifre/root,zzxuanyuan/root,gganis/root,beniz/root,mhuwiler/rootauto,CristinaCristescu/root,thomaskeck/root,ffurano/root5,esakellari/root,mkret2/root,alexschlueter/cern-root,sawenzel/root,olifre/root,vukasinmilosevic/root,sbinet/cxx-root,evgeny-boger/root,omazapa/root,strykejern/TTreeReader,simonpf/root,satyarth934/root,0x0all/ROOT,karies/root,kirbyherm/root-r-tools,beniz/root,beniz/root,strykejern/TTreeReader,mhuwiler/rootauto,arch1tect0r/root,Dr15Jones/root,gganis/root,dfunke/root,vukasinmilosevic/root,jrtomps/root,nilqed/root,beniz/root,satyarth934/root,satyarth934/root,mkret2/root,sbinet/cxx-root,Y--/root,omazapa/root,root-mirror/root,mkret2/root,perovic/root,satyarth934/root,Duraznos/root,arch1tect0r/root,arch1tect0r/root,zzxuanyuan/root,sbinet/cxx-root,georgtroska/root,evgeny-boger/root,sirinath/root,satyarth934/root,gganis/root,olifre/root,veprbl/root,lgiommi/root,ffurano/root5,simonpf/root,esakellari/my_root_for_test,thomaskeck/root,thomaskeck/root,arch1tect0r/root,jrtomps/root,strykejern/TTreeReader,mkret2/root,Duraznos/root,mattkretz/root,lgiommi/root,veprbl/root,Duraznos/root,thomaskeck/root,BerserkerTroll/root,bbockelm/root,karies/root,mhuwiler/rootauto,sawenzel/root,krafczyk/root,perovic/root,georgtroska/root,vukasinmilosevic/root,nilqed/root,Duraznos/root,simonpf/root,thomaskeck/root,mkret2/root,smarinac/root,buuck/root,omazapa/root-old,georgtroska/root,jrtomps/root,beniz/root,dfunke/root,esakellari/my_root_for_test,smarinac/root,esakellari/my_root_for_test,BerserkerTroll/root,lgiommi/root,agarciamontoro/root,bbockelm/root,zzxuanyuan/root-compressor-dummy,sirinath/root,simonpf/root,sawenzel/root,esakellari/root,esakellari/root,perovic/root,zzxuanyuan/root,mattkretz/root,simonpf/root,gbitzes/root,lgiommi/root,agarciamontoro/root,gbitzes/root,Y--/root,davidlt/root,agarciamontoro/root,gbitzes/root,smarinac/root,veprbl/root,sawenzel/root,dfunke/root,satyarth934/root,zzxuanyuan/root-compressor-dummy,omazapa/root,mhuwiler/rootauto,arch1tect0r/root,lgiommi/root,simonpf/root,pspe/root,sirinath/root,BerserkerTroll/root,buuck/root,agarciamontoro/root,smarinac/root,alexschlueter/cern-root,zzxuanyuan/root-compressor-dummy,davidlt/root,davidlt/root,olifre/root,Dr15Jones/root,CristinaCristescu/root,lgiommi/root,beniz/root,pspe/root,sawenzel/root,krafczyk/root,BerserkerTroll/root,mkret2/root,nilqed/root,zzxuanyuan/root,esakellari/root,krafczyk/root,0x0all/ROOT,jrtomps/root,lgiommi/root,strykejern/TTreeReader,BerserkerTroll/root,arch1tect0r/root,perovic/root,strykejern/TTreeReader,karies/root,sawenzel/root,georgtroska/root,mattkretz/root,karies/root,zzxuanyuan/root-compressor-dummy,mattkretz/root,evgeny-boger/root,lgiommi/root,sbinet/cxx-root,BerserkerTroll/root,zzxuanyuan/root-compressor-dummy,abhinavmoudgil95/root,krafczyk/root,gbitzes/root,omazapa/root,agarciamontoro/root,alexschlueter/cern-root,nilqed/root,veprbl/root,omazapa/root-old,zzxuanyuan/root-compressor-dummy,Y--/root,omazapa/root-old,mkret2/root,thomaskeck/root,beniz/root,dfunke/root,root-mirror/root,tc3t/qoot,veprbl/root,mattkretz/root,BerserkerTroll/root,buuck/root,georgtroska/root,bbockelm/root,evgeny-boger/root,georgtroska/root,gganis/root,omazapa/root-old,strykejern/TTreeReader,mkret2/root,evgeny-boger/root,esakellari/root,veprbl/root,jrtomps/root,CristinaCristescu/root,evgeny-boger/root,mkret2/root,root-mirror/root,jrtomps/root,Dr15Jones/root,kirbyherm/root-r-tools,satyarth934/root,agarciamontoro/root,veprbl/root,gganis/root,olifre/root,CristinaCristescu/root,evgeny-boger/root,Duraznos/root,CristinaCristescu/root,omazapa/root,gganis/root,dfunke/root,agarciamontoro/root,Dr15Jones/root,olifre/root,lgiommi/root,zzxuanyuan/root,buuck/root,abhinavmoudgil95/root,mhuwiler/rootauto,nilqed/root,thomaskeck/root,zzxuanyuan/root,thomaskeck/root,Y--/root,tc3t/qoot,beniz/root,dfunke/root,zzxuanyuan/root,mhuwiler/rootauto,abhinavmoudgil95/root,sbinet/cxx-root,dfunke/root,jrtomps/root,Dr15Jones/root,tc3t/qoot,omazapa/root,simonpf/root,pspe/root,dfunke/root,esakellari/my_root_for_test,gganis/root,agarciamontoro/root,mhuwiler/rootauto,arch1tect0r/root,evgeny-boger/root,simonpf/root,cxx-hep/root-cern,cxx-hep/root-cern,nilqed/root,sawenzel/root,esakellari/root,Y--/root,root-mirror/root,root-mirror/root,krafczyk/root,beniz/root,abhinavmoudgil95/root,esakellari/my_root_for_test,BerserkerTroll/root,sirinath/root,omazapa/root-old,simonpf/root,CristinaCristescu/root,pspe/root,olifre/root,veprbl/root,smarinac/root,abhinavmoudgil95/root,abhinavmoudgil95/root,omazapa/root-old,sbinet/cxx-root,cxx-hep/root-cern,vukasinmilosevic/root,satyarth934/root,mhuwiler/rootauto,ffurano/root5,davidlt/root,buuck/root,Y--/root,esakellari/my_root_for_test,perovic/root,sawenzel/root,vukasinmilosevic/root,vukasinmilosevic/root,georgtroska/root,pspe/root,sbinet/cxx-root,kirbyherm/root-r-tools,thomaskeck/root,alexschlueter/cern-root,karies/root,Y--/root,omazapa/root-old,karies/root,karies/root,Duraznos/root,mattkretz/root,dfunke/root,vukasinmilosevic/root,krafczyk/root,sawenzel/root,ffurano/root5,evgeny-boger/root,gbitzes/root,perovic/root,esakellari/my_root_for_test,gganis/root,mattkretz/root,arch1tect0r/root,Duraznos/root,root-mirror/root,bbockelm/root,gbitzes/root,olifre/root,BerserkerTroll/root,bbockelm/root,sirinath/root,CristinaCristescu/root,mhuwiler/rootauto,0x0all/ROOT,mhuwiler/rootauto,agarciamontoro/root,pspe/root,zzxuanyuan/root,tc3t/qoot,esakellari/my_root_for_test,esakellari/root,sbinet/cxx-root,kirbyherm/root-r-tools,Duraznos/root,Y--/root,thomaskeck/root,sawenzel/root,gbitzes/root,zzxuanyuan/root,perovic/root,sirinath/root,Y--/root,davidlt/root,vukasinmilosevic/root,zzxuanyuan/root-compressor-dummy,zzxuanyuan/root-compressor-dummy,0x0all/ROOT,lgiommi/root,buuck/root,mattkretz/root,krafczyk/root,perovic/root,0x0all/ROOT,smarinac/root,cxx-hep/root-cern,davidlt/root,omazapa/root
|
51ea3c704cd4fb159ddf658a0b98d59cb133e2b7
|
views/controls/native/native_view_host_gtk.cc
|
views/controls/native/native_view_host_gtk.cc
|
// Copyright (c) 2009 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "views/controls/native/native_view_host_gtk.h"
#include <gtk/gtk.h>
#include "base/logging.h"
#include "views/controls/native/native_view_host.h"
#include "views/widget/widget_gtk.h"
namespace views {
////////////////////////////////////////////////////////////////////////////////
// NativeViewHostGtk, public:
NativeViewHostGtk::NativeViewHostGtk(NativeViewHost* host)
: host_(host),
installed_clip_(false),
destroy_signal_id_(0),
fixed_(NULL) {
CreateFixed(false);
}
NativeViewHostGtk::~NativeViewHostGtk() {
if (fixed_)
gtk_widget_destroy(fixed_);
}
////////////////////////////////////////////////////////////////////////////////
// NativeViewHostGtk, NativeViewHostWrapper implementation:
void NativeViewHostGtk::NativeViewAttached() {
DCHECK(host_->native_view());
if (gtk_widget_get_parent(host_->native_view()))
gtk_widget_reparent(host_->native_view(), fixed_);
else
gtk_container_add(GTK_CONTAINER(fixed_), host_->native_view());
if (!destroy_signal_id_) {
destroy_signal_id_ = g_signal_connect(G_OBJECT(host_->native_view()),
"destroy", G_CALLBACK(CallDestroy),
this);
}
// Always layout though.
host_->Layout();
// TODO(port): figure out focus.
}
void NativeViewHostGtk::NativeViewDetaching() {
DCHECK(host_->native_view());
g_signal_handler_disconnect(G_OBJECT(host_->native_view()),
destroy_signal_id_);
destroy_signal_id_ = 0;
// TODO(port): focus.
// FocusManager::UninstallFocusSubclass(native_view());
installed_clip_ = false;
}
void NativeViewHostGtk::AddedToWidget() {
if (gtk_widget_get_parent(fixed_))
GetHostWidget()->ReparentChild(fixed_);
else
GetHostWidget()->AddChild(fixed_);
if (!host_->native_view())
return;
if (gtk_widget_get_parent(host_->native_view()))
gtk_widget_reparent(host_->native_view(), fixed_);
else
gtk_container_add(GTK_CONTAINER(fixed_), host_->native_view());
if (host_->IsVisibleInRootView())
gtk_widget_show(fixed_);
else
gtk_widget_hide(fixed_);
host_->Layout();
}
void NativeViewHostGtk::RemovedFromWidget() {
if (!host_->native_view())
return;
// TODO(beng): We leak host_->native_view() here. Fix: make all widgets not be
// refcounted.
DestroyFixed();
}
void NativeViewHostGtk::InstallClip(int x, int y, int w, int h) {
DCHECK(w > 0 && h > 0);
installed_clip_bounds_.SetRect(x, y, w, h);
installed_clip_ = true;
// We only re-create the fixed with a window when a cliprect is installed.
// Because the presence of a X Window will prevent transparency from working
// properly, we only want it to be active for the duration of a clip
// (typically during animations and scrolling.)
CreateFixed(true);
}
bool NativeViewHostGtk::HasInstalledClip() {
return installed_clip_;
}
void NativeViewHostGtk::UninstallClip() {
installed_clip_ = false;
// We now re-create the fixed without a X Window so transparency works again.
CreateFixed(false);
}
void NativeViewHostGtk::ShowWidget(int x, int y, int w, int h) {
// x and y are the desired position of host_ in WidgetGtk coordiantes.
int fixed_x = x;
int fixed_y = y;
int fixed_w = w;
int fixed_h = h;
int child_x = 0;
int child_y = 0;
int child_w = w;
int child_h = h;
if (installed_clip_) {
child_x = -installed_clip_bounds_.x();
child_y = -installed_clip_bounds_.y();
fixed_x += -child_x;
fixed_y += -child_y;
fixed_w = std::min(installed_clip_bounds_.width(), w);
fixed_h = std::min(installed_clip_bounds_.height(), h);
}
// Size and place the fixed_.
GetHostWidget()->PositionChild(fixed_, fixed_x, fixed_y, fixed_w, fixed_h);
// Size and place the hosted NativeView.
gtk_widget_set_size_request(host_->native_view(), child_w, child_h);
gtk_fixed_move(GTK_FIXED(fixed_), host_->native_view(), child_x, child_y);
gtk_widget_show(fixed_);
}
void NativeViewHostGtk::HideWidget() {
gtk_widget_hide(fixed_);
}
void NativeViewHostGtk::SetFocus() {
NOTIMPLEMENTED();
}
////////////////////////////////////////////////////////////////////////////////
// NativeViewHostGtk, private:
void NativeViewHostGtk::CreateFixed(bool needs_window) {
bool native_view_addrefed = DestroyFixed();
fixed_ = gtk_fixed_new();
gtk_fixed_set_has_window(GTK_FIXED(fixed_), needs_window);
// Defeat refcounting. We need to own the fixed.
gtk_widget_ref(fixed_);
WidgetGtk* widget_gtk = GetHostWidget();
if (widget_gtk)
widget_gtk->AddChild(fixed_);
if (host_->native_view())
gtk_container_add(GTK_CONTAINER(fixed_), host_->native_view());
if (native_view_addrefed)
gtk_widget_unref(host_->native_view());
}
bool NativeViewHostGtk::DestroyFixed() {
bool native_view_addrefed = false;
if (!fixed_)
return native_view_addrefed;
gtk_widget_hide(fixed_);
GetHostWidget()->RemoveChild(fixed_);
if (host_->native_view()) {
// We can't allow the hosted NativeView's refcount to drop to zero.
gtk_widget_ref(host_->native_view());
native_view_addrefed = true;
gtk_container_remove(GTK_CONTAINER(fixed_), host_->native_view());
}
gtk_widget_destroy(fixed_);
fixed_ = NULL;
return native_view_addrefed;
}
WidgetGtk* NativeViewHostGtk::GetHostWidget() const {
return static_cast<WidgetGtk*>(host_->GetWidget());
}
// static
void NativeViewHostGtk::CallDestroy(GtkObject* object,
NativeViewHostGtk* host) {
return host->host_->NativeViewDestroyed();
}
////////////////////////////////////////////////////////////////////////////////
// NativeViewHostWrapper, public:
// static
NativeViewHostWrapper* NativeViewHostWrapper::CreateWrapper(
NativeViewHost* host) {
return new NativeViewHostGtk(host);
}
} // namespace views
|
// Copyright (c) 2009 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "views/controls/native/native_view_host_gtk.h"
#include <gtk/gtk.h>
#include "base/logging.h"
#include "views/controls/native/native_view_host.h"
#include "views/widget/widget_gtk.h"
namespace views {
////////////////////////////////////////////////////////////////////////////////
// NativeViewHostGtk, public:
NativeViewHostGtk::NativeViewHostGtk(NativeViewHost* host)
: host_(host),
installed_clip_(false),
destroy_signal_id_(0),
fixed_(NULL) {
CreateFixed(false);
}
NativeViewHostGtk::~NativeViewHostGtk() {
if (fixed_)
gtk_widget_destroy(fixed_);
}
////////////////////////////////////////////////////////////////////////////////
// NativeViewHostGtk, NativeViewHostWrapper implementation:
void NativeViewHostGtk::NativeViewAttached() {
DCHECK(host_->native_view());
if (gtk_widget_get_parent(host_->native_view()))
gtk_widget_reparent(host_->native_view(), fixed_);
else
gtk_container_add(GTK_CONTAINER(fixed_), host_->native_view());
if (!destroy_signal_id_) {
destroy_signal_id_ = g_signal_connect(G_OBJECT(host_->native_view()),
"destroy", G_CALLBACK(CallDestroy),
this);
}
// Always layout though.
host_->Layout();
// TODO(port): figure out focus.
}
void NativeViewHostGtk::NativeViewDetaching() {
DCHECK(host_->native_view());
g_signal_handler_disconnect(G_OBJECT(host_->native_view()),
destroy_signal_id_);
destroy_signal_id_ = 0;
// TODO(port): focus.
// FocusManager::UninstallFocusSubclass(native_view());
installed_clip_ = false;
}
void NativeViewHostGtk::AddedToWidget() {
if (gtk_widget_get_parent(fixed_))
GetHostWidget()->ReparentChild(fixed_);
else
GetHostWidget()->AddChild(fixed_);
if (!host_->native_view())
return;
if (gtk_widget_get_parent(host_->native_view()))
gtk_widget_reparent(host_->native_view(), fixed_);
else
gtk_container_add(GTK_CONTAINER(fixed_), host_->native_view());
if (host_->IsVisibleInRootView())
gtk_widget_show(fixed_);
else
gtk_widget_hide(fixed_);
host_->Layout();
}
void NativeViewHostGtk::RemovedFromWidget() {
if (!host_->native_view())
return;
// TODO(beng): We leak host_->native_view() here. Fix: make all widgets not be
// refcounted.
DestroyFixed();
}
void NativeViewHostGtk::InstallClip(int x, int y, int w, int h) {
DCHECK(w > 0 && h > 0);
installed_clip_bounds_.SetRect(x, y, w, h);
installed_clip_ = true;
// We only re-create the fixed with a window when a cliprect is installed.
// Because the presence of a X Window will prevent transparency from working
// properly, we only want it to be active for the duration of a clip
// (typically during animations and scrolling.)
CreateFixed(true);
}
bool NativeViewHostGtk::HasInstalledClip() {
return installed_clip_;
}
void NativeViewHostGtk::UninstallClip() {
installed_clip_ = false;
// We now re-create the fixed without a X Window so transparency works again.
CreateFixed(false);
}
void NativeViewHostGtk::ShowWidget(int x, int y, int w, int h) {
// x and y are the desired position of host_ in WidgetGtk coordiantes.
int fixed_x = x;
int fixed_y = y;
int fixed_w = w;
int fixed_h = h;
int child_x = 0;
int child_y = 0;
int child_w = w;
int child_h = h;
if (installed_clip_) {
child_x = -installed_clip_bounds_.x();
child_y = -installed_clip_bounds_.y();
fixed_x += -child_x;
fixed_y += -child_y;
fixed_w = std::min(installed_clip_bounds_.width(), w);
fixed_h = std::min(installed_clip_bounds_.height(), h);
}
// Size and place the fixed_.
GetHostWidget()->PositionChild(fixed_, fixed_x, fixed_y, fixed_w, fixed_h);
// Size and place the hosted NativeView.
gtk_widget_set_size_request(host_->native_view(), child_w, child_h);
gtk_fixed_move(GTK_FIXED(fixed_), host_->native_view(), child_x, child_y);
gtk_widget_show(fixed_);
gtk_widget_show(host_->native_view());
}
void NativeViewHostGtk::HideWidget() {
gtk_widget_hide(fixed_);
}
void NativeViewHostGtk::SetFocus() {
NOTIMPLEMENTED();
}
////////////////////////////////////////////////////////////////////////////////
// NativeViewHostGtk, private:
void NativeViewHostGtk::CreateFixed(bool needs_window) {
bool native_view_addrefed = DestroyFixed();
fixed_ = gtk_fixed_new();
gtk_fixed_set_has_window(GTK_FIXED(fixed_), needs_window);
// Defeat refcounting. We need to own the fixed.
gtk_widget_ref(fixed_);
WidgetGtk* widget_gtk = GetHostWidget();
if (widget_gtk)
widget_gtk->AddChild(fixed_);
if (host_->native_view())
gtk_container_add(GTK_CONTAINER(fixed_), host_->native_view());
if (native_view_addrefed)
gtk_widget_unref(host_->native_view());
}
bool NativeViewHostGtk::DestroyFixed() {
bool native_view_addrefed = false;
if (!fixed_)
return native_view_addrefed;
gtk_widget_hide(fixed_);
GetHostWidget()->RemoveChild(fixed_);
if (host_->native_view()) {
// We can't allow the hosted NativeView's refcount to drop to zero.
gtk_widget_ref(host_->native_view());
native_view_addrefed = true;
gtk_container_remove(GTK_CONTAINER(fixed_), host_->native_view());
}
gtk_widget_destroy(fixed_);
fixed_ = NULL;
return native_view_addrefed;
}
WidgetGtk* NativeViewHostGtk::GetHostWidget() const {
return static_cast<WidgetGtk*>(host_->GetWidget());
}
// static
void NativeViewHostGtk::CallDestroy(GtkObject* object,
NativeViewHostGtk* host) {
return host->host_->NativeViewDestroyed();
}
////////////////////////////////////////////////////////////////////////////////
// NativeViewHostWrapper, public:
// static
NativeViewHostWrapper* NativeViewHostWrapper::CreateWrapper(
NativeViewHost* host) {
return new NativeViewHostGtk(host);
}
} // namespace views
|
Fix bug introduced by my clipping changes - when you switched tabs the tab area would blank out - we weren't showing the NativeView in calls to ShowWidget, only the fixed.
|
Fix bug introduced by my clipping changes - when you switched tabs the tab area would blank out - we weren't showing the NativeView in calls to ShowWidget, only the fixed.
BUG=none
TEST=none
Review URL: http://codereview.chromium.org/160049
git-svn-id: dd90618784b6a4b323ea0c23a071cb1c9e6f2ac7@21452 4ff67af0-8c30-449e-8e8b-ad334ec8d88c
|
C++
|
bsd-3-clause
|
wistoch/meego-app-browser,wistoch/meego-app-browser,wistoch/meego-app-browser,wistoch/meego-app-browser,wistoch/meego-app-browser,wistoch/meego-app-browser,wistoch/meego-app-browser,wistoch/meego-app-browser,wistoch/meego-app-browser,wistoch/meego-app-browser
|
37359dec0b47a9f2d891e02e90c1883c1fe6a821
|
include/continuable/detail/utility/util.hpp
|
include/continuable/detail/utility/util.hpp
|
/*
/~` _ _ _|_. _ _ |_ | _
\_,(_)| | | || ||_|(_||_)|(/_
https://github.com/Naios/continuable
v4.0.0
Copyright(c) 2015 - 2019 Denis Blank <denis.blank at outlook dot com>
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files(the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and / or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions :
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
**/
#ifndef CONTINUABLE_DETAIL_UTIL_HPP_INCLUDED
#define CONTINUABLE_DETAIL_UTIL_HPP_INCLUDED
#include <cassert>
#include <cstdlib>
#include <tuple>
#include <type_traits>
#include <utility>
#include <continuable/detail/features.hpp>
#include <continuable/detail/utility/traits.hpp>
/// Hint for the compiler that this point should be unreachable
#if defined(_MSC_VER)
// NOLINTNEXTLINE(cppcoreguidelines-macro-usage)
#define CTI_DETAIL_UNREACHABLE_INTRINSIC() __assume(false)
#elif defined(__GNUC__)
// NOLINTNEXTLINE(cppcoreguidelines-macro-usage)
#define CTI_DETAIL_UNREACHABLE_INTRINSIC() __builtin_unreachable()
#elif defined(__has_builtin) && __has_builtin(__builtin_unreachable)
// NOLINTNEXTLINE(cppcoreguidelines-macro-usage)
#define CTI_DETAIL_UNREACHABLE_INTRINSIC() __builtin_unreachable()
#else
// NOLINTNEXTLINE(cppcoreguidelines-macro-usage)
#define CTI_DETAIL_UNREACHABLE_INTRINSIC() abort()
#endif
/// Causes the application to exit abnormally
#if defined(_MSC_VER)
// NOLINTNEXTLINE(cppcoreguidelines-macro-usage)
#define CTI_DETAIL_TRAP() __debugbreak()
#elif defined(__GNUC__)
// NOLINTNEXTLINE(cppcoreguidelines-macro-usage)
#define CTI_DETAIL_TRAP() __builtin_trap()
#elif defined(__has_builtin) && __has_builtin(__builtin_trap)
// NOLINTNEXTLINE(cppcoreguidelines-macro-usage)
#define CTI_DETAIL_TRAP() __builtin_trap()
#else
// NOLINTNEXTLINE(cppcoreguidelines-macro-usage)
#define CTI_DETAIL_TRAP() *(volatile int*)0x11 = 0
#endif
namespace cti {
namespace detail {
/// Utility namespace which provides useful meta-programming support
namespace util {
/// Helper to trick compilers about that a parameter pack is used
template <typename... T>
constexpr void unused(T&&...) noexcept {
}
namespace detail {
template <typename T, std::size_t... I>
auto forward_except_last_impl(T&& tuple,
std::integer_sequence<std::size_t, I...>) {
(void)tuple;
return std::forward_as_tuple(std::get<I>(std::forward<T>(tuple))...);
}
/// Forwards every element in the tuple except the last one
template <typename T>
auto forward_except_last(T&& sequenceable) {
constexpr auto const size = std::tuple_size<std::decay_t<T>>::value - 1U;
constexpr auto const sequence = std::make_index_sequence<size>();
return forward_except_last_impl(std::forward<T>(sequenceable), sequence);
}
template <std::size_t Keep>
struct invocation_env {
/// We are able to call the callable with the arguments given in the tuple
template <typename T, typename... Args>
static auto partial_invoke_impl(std::true_type, T&& callable,
std::tuple<Args...> args) {
return traits::unpack(std::forward<T>(callable), std::move(args));
}
/// We were unable to call the callable with the arguments in the tuple.
/// Remove the last argument from the tuple and try it again.
template <typename T, typename... Args>
static auto partial_invoke_impl(std::false_type, T&& callable,
std::tuple<Args...> args) {
// If you are encountering this assertion you tried to attach a callback
// which can't accept the arguments of the continuation.
//
// ```cpp
// continuable<int, int> c;
// std::move(c).then([](std::vector<int> v) { /*...*/ })
// ```
static_assert(
sizeof...(Args) > Keep,
"There is no way to call the given object with these arguments!");
// Remove the last argument from the tuple
auto next = forward_except_last(std::move(args));
// Test whether we are able to call the function with the given tuple
traits::is_invocable_from_tuple<decltype(callable), decltype(next)>
is_invocable;
return partial_invoke_impl(is_invocable, std::forward<T>(callable),
std::move(next));
}
/// Shortcut - we can call the callable directly
template <typename T, typename... Args>
static auto partial_invoke_impl_shortcut(std::true_type, T&& callable,
Args&&... args) {
return std::forward<T>(callable)(std::forward<Args>(args)...);
}
/// Failed shortcut - we were unable to invoke the callable with the
/// original arguments.
template <typename T, typename... Args>
static auto partial_invoke_impl_shortcut(std::false_type failed, T&& callable,
Args&&... args) {
// Our shortcut failed, convert the arguments into a forwarding tuple
return partial_invoke_impl(
failed, std::forward<T>(callable),
std::forward_as_tuple(std::forward<Args>(args)...));
}
};
} // namespace detail
/// Partially invokes the given callable with the given arguments.
///
/// \note This function will assert statically if there is no way to call the
/// given object with less arguments.
template <std::size_t KeepArgs, typename T, typename... Args>
/*keep this inline*/ inline auto
partial_invoke(std::integral_constant<std::size_t, KeepArgs>, T&& callable,
Args&&... args) {
// Test whether we are able to call the function with the given arguments.
constexpr traits::is_invocable_from_tuple<decltype(callable),
std::tuple<Args...>>
is_invocable;
// The implementation is done in a shortcut way so there are less
// type instantiations needed to call the callable with its full signature.
using env = detail::invocation_env<KeepArgs>;
return env::partial_invoke_impl_shortcut(
is_invocable, std::forward<T>(callable), std::forward<Args>(args)...);
}
/// Invokes the given callable object with the given arguments
template <typename Callable, typename... Args>
constexpr auto invoke(Callable&& callable, Args&&... args) noexcept(
noexcept(std::forward<Callable>(callable)(std::forward<Args>(args)...)))
-> decltype(std::forward<Callable>(callable)(std::forward<Args>(args)...)) {
return std::forward<Callable>(callable)(std::forward<Args>(args)...);
}
/// Invokes the given member function pointer by reference
template <typename T, typename Type, typename Self, typename... Args>
constexpr auto invoke(Type T::*member, Self&& self, Args&&... args) noexcept(
noexcept((std::forward<Self>(self).*member)(std::forward<Args>(args)...)))
-> decltype((std::forward<Self>(self).*
member)(std::forward<Args>(args)...)) {
return (std::forward<Self>(self).*member)(std::forward<Args>(args)...);
}
/// Invokes the given member function pointer by pointer
template <typename T, typename Type, typename Self, typename... Args>
constexpr auto invoke(Type T::*member, Self&& self, Args&&... args) noexcept(
noexcept((std::forward<Self>(self)->*member)(std::forward<Args>(args)...)))
-> decltype(
(std::forward<Self>(self)->*member)(std::forward<Args>(args)...)) {
return (std::forward<Self>(self)->*member)(std::forward<Args>(args)...);
}
/// Returns a constant view on the object
template <typename T>
constexpr std::add_const_t<T>& as_const(T& object) noexcept {
return object;
}
// Class for making child classes non copyable
struct non_copyable {
constexpr non_copyable() = default;
non_copyable(non_copyable const&) = delete;
constexpr non_copyable(non_copyable&&) = default;
non_copyable& operator=(non_copyable const&) = delete;
non_copyable& operator=(non_copyable&&) = default;
};
// Class for making child classes non copyable and movable
struct non_movable {
constexpr non_movable() = default;
non_movable(non_movable const&) = delete;
constexpr non_movable(non_movable&&) = delete;
non_movable& operator=(non_movable const&) = delete;
non_movable& operator=(non_movable&&) = delete;
};
/// This class is responsible for holding an abstract copy- and
/// move-able ownership that is invalidated when the object
/// is moved to another instance.
class ownership {
explicit constexpr ownership(bool acquired, bool frozen)
: acquired_(acquired), frozen_(frozen) {
}
public:
constexpr ownership() : acquired_(true), frozen_(false) {
}
constexpr ownership(ownership const&) = default;
ownership(ownership&& right) noexcept
: acquired_(right.consume()), frozen_(right.is_frozen()) {
}
ownership& operator=(ownership const&) = default;
ownership& operator=(ownership&& right) noexcept {
acquired_ = right.consume();
frozen_ = right.is_frozen();
return *this;
}
// Merges both ownerships together
ownership operator|(ownership const& right) const noexcept {
return ownership(is_acquired() && right.is_acquired(),
is_frozen() || right.is_frozen());
}
constexpr bool is_acquired() const noexcept {
return acquired_;
}
constexpr bool is_frozen() const noexcept {
return frozen_;
}
void release() noexcept {
assert(is_acquired() && "Tried to release the ownership twice!");
acquired_ = false;
}
void freeze(bool enabled = true) noexcept {
assert(is_acquired() && "Tried to freeze a released object!");
frozen_ = enabled;
}
private:
bool consume() noexcept {
if (is_acquired()) {
release();
return true;
}
return false;
}
/// Is true when the object is in a valid state
bool acquired_ : 1;
/// Is true when the automatic invocation on destruction is disabled
bool frozen_ : 1;
};
#ifndef NDEBUG
[[noreturn]] inline void unreachable_debug() {
CTI_DETAIL_TRAP();
std::abort();
}
#endif
} // namespace util
} // namespace detail
} // namespace cti
#ifndef NDEBUG
// NOLINTNEXTLINE(cppcoreguidelines-macro-usage)
#define CTI_DETAIL_UNREACHABLE() ::cti::detail::util::unreachable_debug()
#else
// NOLINTNEXTLINE(cppcoreguidelines-macro-usage)
#define CTI_DETAIL_UNREACHABLE() CTI_DETAIL_UNREACHABLE_INTRINSIC()
#endif
#endif // CONTINUABLE_DETAIL_UTIL_HPP_INCLUDED
|
/*
/~` _ _ _|_. _ _ |_ | _
\_,(_)| | | || ||_|(_||_)|(/_
https://github.com/Naios/continuable
v4.0.0
Copyright(c) 2015 - 2019 Denis Blank <denis.blank at outlook dot com>
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files(the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and / or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions :
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
**/
#ifndef CONTINUABLE_DETAIL_UTIL_HPP_INCLUDED
#define CONTINUABLE_DETAIL_UTIL_HPP_INCLUDED
#include <cassert>
#include <cstdlib>
#include <tuple>
#include <type_traits>
#include <utility>
#include <continuable/detail/features.hpp>
#include <continuable/detail/utility/traits.hpp>
/// Hint for the compiler that this point should be unreachable
#if defined(_MSC_VER)
// NOLINTNEXTLINE(cppcoreguidelines-macro-usage)
#define CTI_DETAIL_UNREACHABLE_INTRINSIC() __assume(false)
#elif defined(__GNUC__)
// NOLINTNEXTLINE(cppcoreguidelines-macro-usage)
#define CTI_DETAIL_UNREACHABLE_INTRINSIC() __builtin_unreachable()
#elif defined(__has_builtin) && __has_builtin(__builtin_unreachable)
// NOLINTNEXTLINE(cppcoreguidelines-macro-usage)
#define CTI_DETAIL_UNREACHABLE_INTRINSIC() __builtin_unreachable()
#else
// NOLINTNEXTLINE(cppcoreguidelines-macro-usage)
#define CTI_DETAIL_UNREACHABLE_INTRINSIC() abort()
#endif
/// Causes the application to exit abnormally
#if defined(_MSC_VER)
// NOLINTNEXTLINE(cppcoreguidelines-macro-usage)
#define CTI_DETAIL_TRAP() __debugbreak()
#elif defined(__GNUC__)
// NOLINTNEXTLINE(cppcoreguidelines-macro-usage)
#define CTI_DETAIL_TRAP() __builtin_trap()
#elif defined(__has_builtin) && __has_builtin(__builtin_trap)
// NOLINTNEXTLINE(cppcoreguidelines-macro-usage)
#define CTI_DETAIL_TRAP() __builtin_trap()
#else
// NOLINTNEXTLINE(cppcoreguidelines-macro-usage)
#define CTI_DETAIL_TRAP() *(volatile int*)0x11 = 0
#endif
#ifndef NDEBUG
// NOLINTNEXTLINE(cppcoreguidelines-macro-usage)
#define CTI_DETAIL_UNREACHABLE() ::cti::detail::util::unreachable_debug()
#else
// NOLINTNEXTLINE(cppcoreguidelines-macro-usage)
#define CTI_DETAIL_UNREACHABLE() CTI_DETAIL_UNREACHABLE_INTRINSIC()
#endif
namespace cti {
namespace detail {
/// Utility namespace which provides useful meta-programming support
namespace util {
#ifndef NDEBUG
[[noreturn]] inline void unreachable_debug() {
CTI_DETAIL_TRAP();
std::abort();
}
#endif
/// Helper to trick compilers about that a parameter pack is used
template <typename... T>
constexpr void unused(T&&...) noexcept {
}
namespace detail {
template <typename T, std::size_t... I>
auto forward_except_last_impl(T&& tuple,
std::integer_sequence<std::size_t, I...>) {
(void)tuple;
return std::forward_as_tuple(std::get<I>(std::forward<T>(tuple))...);
}
template <std::size_t Size>
constexpr auto make_decreased_index_sequence(
std::integral_constant<std::size_t, Size>) noexcept {
return std::make_index_sequence<Size - 1>();
}
inline void make_decreased_index_sequence(
std::integral_constant<std::size_t, 0U>) noexcept {
// This function is only instantiated on a compiler error and
// should not be included in valid code.
// See https://github.com/Naios/continuable/issues/21 for details.
CTI_DETAIL_UNREACHABLE();
}
/// Forwards every element in the tuple except the last one
template <typename T>
auto forward_except_last(T&& sequenceable) {
static_assert(
std::tuple_size<std::decay_t<T>>::value > 0U,
"Attempt to remove a parameter from an empty tuple like type! If you see "
"this your compiler could run into possible infinite recursion! Open a "
"ticket at https://github.com/Naios/continuable/issues with a small "
"reproducible example if your compiler doesn't stop!");
constexpr auto size = std::tuple_size<std::decay_t<T>>::value;
constexpr auto sequence = make_decreased_index_sequence(
std::integral_constant<std::size_t, size>{});
return forward_except_last_impl(std::forward<T>(sequenceable), sequence);
}
template <std::size_t Keep>
struct invocation_env {
/// We are able to call the callable with the arguments given in the tuple
template <typename T, typename... Args>
static auto partial_invoke_impl(std::true_type, T&& callable,
std::tuple<Args...> args) {
return traits::unpack(std::forward<T>(callable), std::move(args));
}
/// We were unable to call the callable with the arguments in the tuple.
/// Remove the last argument from the tuple and try it again.
template <typename T, typename... Args>
static auto partial_invoke_impl(std::false_type, T&& callable,
std::tuple<Args...> args) {
// If you are encountering this assertion you tried to attach a callback
// which can't accept the arguments of the continuation.
//
// ```cpp
// continuable<int, int> c;
// std::move(c).then([](std::vector<int> v) { /*...*/ })
// ```
static_assert(
sizeof...(Args) > Keep,
"There is no way to call the given object with these arguments!");
// Remove the last argument from the tuple
auto next = forward_except_last(std::move(args));
// Test whether we are able to call the function with the given tuple
constexpr std::integral_constant<
bool, traits::is_invocable_from_tuple<decltype(callable),
decltype(next)>::value ||
(sizeof...(Args) <= Keep)>
is_callable;
return partial_invoke_impl(is_callable, std::forward<T>(callable),
std::move(next));
}
/// Shortcut - we can call the callable directly
template <typename T, typename... Args>
static auto partial_invoke_impl_shortcut(std::true_type, T&& callable,
Args&&... args) {
return std::forward<T>(callable)(std::forward<Args>(args)...);
}
/// Failed shortcut - we were unable to invoke the callable with the
/// original arguments.
template <typename T, typename... Args>
static auto partial_invoke_impl_shortcut(std::false_type failed, T&& callable,
Args&&... args) {
// Our shortcut failed, convert the arguments into a forwarding tuple
return partial_invoke_impl(
failed, std::forward<T>(callable),
std::forward_as_tuple(std::forward<Args>(args)...));
}
};
} // namespace detail
/// Partially invokes the given callable with the given arguments.
///
/// \note This function will assert statically if there is no way to call the
/// given object with less arguments.
template <std::size_t KeepArgs, typename T, typename... Args>
/*keep this inline*/ inline auto
partial_invoke(std::integral_constant<std::size_t, KeepArgs>, T&& callable,
Args&&... args) {
// Test whether we are able to call the function with the given arguments.
constexpr traits::is_invocable_from_tuple<decltype(callable),
std::tuple<Args...>>
is_invocable;
// The implementation is done in a shortcut way so there are less
// type instantiations needed to call the callable with its full signature.
using env = detail::invocation_env<KeepArgs>;
return env::partial_invoke_impl_shortcut(
is_invocable, std::forward<T>(callable), std::forward<Args>(args)...);
}
/// Invokes the given callable object with the given arguments
template <typename Callable, typename... Args>
constexpr auto invoke(Callable&& callable, Args&&... args) noexcept(
noexcept(std::forward<Callable>(callable)(std::forward<Args>(args)...)))
-> decltype(std::forward<Callable>(callable)(std::forward<Args>(args)...)) {
return std::forward<Callable>(callable)(std::forward<Args>(args)...);
}
/// Invokes the given member function pointer by reference
template <typename T, typename Type, typename Self, typename... Args>
constexpr auto invoke(Type T::*member, Self&& self, Args&&... args) noexcept(
noexcept((std::forward<Self>(self).*member)(std::forward<Args>(args)...)))
-> decltype((std::forward<Self>(self).*
member)(std::forward<Args>(args)...)) {
return (std::forward<Self>(self).*member)(std::forward<Args>(args)...);
}
/// Invokes the given member function pointer by pointer
template <typename T, typename Type, typename Self, typename... Args>
constexpr auto invoke(Type T::*member, Self&& self, Args&&... args) noexcept(
noexcept((std::forward<Self>(self)->*member)(std::forward<Args>(args)...)))
-> decltype(
(std::forward<Self>(self)->*member)(std::forward<Args>(args)...)) {
return (std::forward<Self>(self)->*member)(std::forward<Args>(args)...);
}
/// Returns a constant view on the object
template <typename T>
constexpr std::add_const_t<T>& as_const(T& object) noexcept {
return object;
}
// Class for making child classes non copyable
struct non_copyable {
constexpr non_copyable() = default;
non_copyable(non_copyable const&) = delete;
constexpr non_copyable(non_copyable&&) = default;
non_copyable& operator=(non_copyable const&) = delete;
non_copyable& operator=(non_copyable&&) = default;
};
// Class for making child classes non copyable and movable
struct non_movable {
constexpr non_movable() = default;
non_movable(non_movable const&) = delete;
constexpr non_movable(non_movable&&) = delete;
non_movable& operator=(non_movable const&) = delete;
non_movable& operator=(non_movable&&) = delete;
};
/// This class is responsible for holding an abstract copy- and
/// move-able ownership that is invalidated when the object
/// is moved to another instance.
class ownership {
explicit constexpr ownership(bool acquired, bool frozen)
: acquired_(acquired), frozen_(frozen) {
}
public:
constexpr ownership() : acquired_(true), frozen_(false) {
}
constexpr ownership(ownership const&) = default;
ownership(ownership&& right) noexcept
: acquired_(right.consume()), frozen_(right.is_frozen()) {
}
ownership& operator=(ownership const&) = default;
ownership& operator=(ownership&& right) noexcept {
acquired_ = right.consume();
frozen_ = right.is_frozen();
return *this;
}
// Merges both ownerships together
ownership operator|(ownership const& right) const noexcept {
return ownership(is_acquired() && right.is_acquired(),
is_frozen() || right.is_frozen());
}
constexpr bool is_acquired() const noexcept {
return acquired_;
}
constexpr bool is_frozen() const noexcept {
return frozen_;
}
void release() noexcept {
assert(is_acquired() && "Tried to release the ownership twice!");
acquired_ = false;
}
void freeze(bool enabled = true) noexcept {
assert(is_acquired() && "Tried to freeze a released object!");
frozen_ = enabled;
}
private:
bool consume() noexcept {
if (is_acquired()) {
release();
return true;
}
return false;
}
/// Is true when the object is in a valid state
bool acquired_ : 1;
/// Is true when the automatic invocation on destruction is disabled
bool frozen_ : 1;
};
} // namespace util
} // namespace detail
} // namespace cti
#endif // CONTINUABLE_DETAIL_UTIL_HPP_INCLUDED
|
Fix infinite recursion on Clang if the compiler attempts to continue on best effort * The library triggers a static_assert correctly if a callable can't be called with a subset of its arguments but it seems like this is not enough to make the compiler stop causing the generation of a 0 - 1 -> std::size_t::max length index sequence which obviously causes infinite work. * Reproducible with: ``` cti::make_continuable<std::string>([](cti::promise<std::string> promise) { promise.set_value("hello"); }).then([](int num) { // }); ``` * Closes #21
|
Fix infinite recursion on Clang if the compiler attempts to continue on best effort
* The library triggers a static_assert correctly if a callable
can't be called with a subset of its arguments but it seems like this is
not enough to make the compiler stop causing the generation
of a 0 - 1 -> std::size_t::max length index sequence which obviously
causes infinite work.
* Reproducible with:
```
cti::make_continuable<std::string>([](cti::promise<std::string> promise) {
promise.set_value("hello");
}).then([](int num) {
//
});
```
* Closes #21
|
C++
|
apache-2.0
|
Naios/Continuable
|
44515dd00e4457a6201c3788d4a19b3fc1c79a14
|
include/dirl/dataset/DynamicDatasetFile.hpp
|
include/dirl/dataset/DynamicDatasetFile.hpp
|
/*
* Copyright (C) 2013 Silvio Traversaro
* CopyPolicy: Released under the terms of the LGPLv2.1 or later, see LGPL.TXT
*/
#ifndef __DIRL_DATASET_FILE__
#define __DIRL_DATASET_FILE__
#include <dirl/dataset/DynamicDatasetInterfaces.hpp>
#include <dirl/dataset/DynamicSample.hpp>
#include <boost/iterator/iterator_concepts.hpp>
namespace dirl {
class DynamicDatasetFile : public IBatchDynamicDataset
{
private:
int nrOfDOFs;
int nrOfMeasuredWrenches;
int nrOfMeasuredTorques;
int nrOfMeasured3AxisFT;
std::vector<DynamicSample> dynamic_samples;
public:
DynamicDatasetFile();
bool loadFromFile(std::string filename, const bool append=false);
~DynamicDatasetFile();
int getNrOfSamples() const;
bool getSample(const int sample_n,DynamicSample & sample) const;
};
class DynamicDatasetFileCollection : public std::vector<DynamicDatasetFile>, public IBatchDynamicDataset
{
private:
int nrOfDOFs;
int nrOfMeasuredWrenches;
int nrOfMeasuredTorques;
int nrOfMeasured3AxisFT;
std::vector<int> datasets_samples;
int nr_of_samples;
public:
DynamicDatasetFileCollection();
~DynamicDatasetFileCollection();
bool loadDatasetFilesFromFilenameVector(const std::vector<std::string> & filenames);
bool loadDatasetFilesFromFile(const std::string & file_name);
int getNrOfSamples() const;
bool getSample(const int sample_n,DynamicSample & sample) const;
};
}
#endif
|
/*
* Copyright (C) 2013 Silvio Traversaro
* CopyPolicy: Released under the terms of the LGPLv2.1 or later, see LGPL.TXT
*/
#ifndef __DIRL_DATASET_FILE__
#define __DIRL_DATASET_FILE__
#include <dirl/dataset/DynamicDatasetInterfaces.hpp>
#include <dirl/dataset/DynamicSample.hpp>
namespace dirl {
class DynamicDatasetFile : public IBatchDynamicDataset
{
private:
int nrOfDOFs;
int nrOfMeasuredWrenches;
int nrOfMeasuredTorques;
int nrOfMeasured3AxisFT;
std::vector<DynamicSample> dynamic_samples;
public:
DynamicDatasetFile();
bool loadFromFile(std::string filename, const bool append=false);
~DynamicDatasetFile();
int getNrOfSamples() const;
bool getSample(const int sample_n,DynamicSample & sample) const;
};
class DynamicDatasetFileCollection : public std::vector<DynamicDatasetFile>, public IBatchDynamicDataset
{
private:
int nrOfDOFs;
int nrOfMeasuredWrenches;
int nrOfMeasuredTorques;
int nrOfMeasured3AxisFT;
std::vector<int> datasets_samples;
int nr_of_samples;
public:
DynamicDatasetFileCollection();
~DynamicDatasetFileCollection();
bool loadDatasetFilesFromFilenameVector(const std::vector<std::string> & filenames);
bool loadDatasetFilesFromFile(const std::string & file_name);
int getNrOfSamples() const;
bool getSample(const int sample_n,DynamicSample & sample) const;
};
}
#endif
|
remove spurious header
|
remove spurious header
|
C++
|
lgpl-2.1
|
robotology/idyntree,robotology/idyntree,robotology/idyntree,robotology/idyntree,robotology/idyntree
|
4d08cf3b28b1ccce599755b31ecd193a58bbf984
|
include/distortos/StaticRawMessageQueue.hpp
|
include/distortos/StaticRawMessageQueue.hpp
|
/**
* \file
* \brief StaticRawMessageQueue class header
*
* \author Copyright (C) 2015-2019 Kamil Szczygiel http://www.distortec.com http://www.freddiechopin.info
*
* \par License
* This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not
* distributed with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
*/
#ifndef INCLUDE_DISTORTOS_STATICRAWMESSAGEQUEUE_HPP_
#define INCLUDE_DISTORTOS_STATICRAWMESSAGEQUEUE_HPP_
#include "distortos/RawMessageQueue.hpp"
#include "distortos/internal/memory/dummyDeleter.hpp"
namespace distortos
{
/**
* \brief StaticRawMessageQueue class is a variant of RawMessageQueue that has automatic storage for queue's contents.
*
* This class is a replacement for StaticRawMessageQueue with old API and removed StaticRawMessageQueueFromSize. To use
* this new API modify your code in following way:
* - old `"StaticRawMessageQueue<T, QueueSize>"` -> `"StaticRawMessageQueue<sizeof(T), QueueSize>"`;
* - removed `"StaticRawMessageQueueFromSize<ElementSize, QueueSize>"` ->
* `"StaticRawMessageQueue<ElementSize, QueueSize>"`;
*
* Transition schedule:
* 1. v0.5.0 - `StaticRawMessageQueue<T, QueueSize>` and `StaticRawMessageQueueFromSize<ElementSize, QueueSize>` are
* converted to deprecated aliases to `StaticRawMessageQueue2<ElementSize, QueueSize>`;
* 2. v0.6.0 - "old" `StaticRawMessageQueue<T, QueueSize>` and `StaticRawMessageQueueFromSize<ElementSize, QueueSize>`
* aliases are removed, `StaticRawMessageQueue2<ElementSize, QueueSize>` is renamed to
* `StaticRawMessageQueue<ElementSize, QueueSize>`, deprecated `StaticRawMessageQueue2<ElementSize, QueueSize>` alias is
* added;
* 3. v0.7.0 - deprecated `StaticRawMessageQueue2<ElementSize, QueueSize>` alias is removed;
*
* \tparam ElementSize is the size of single queue element, bytes
* \tparam QueueSize is the maximum number of elements in queue
*
* \ingroup queues
*/
template<size_t ElementSize, size_t QueueSize>
class StaticRawMessageQueue : public RawMessageQueue
{
public:
/**
* \brief StaticRawMessageQueue's constructor
*/
explicit StaticRawMessageQueue() :
RawMessageQueue{{entryStorage_.data(), internal::dummyDeleter<EntryStorage>},
{valueStorage_.data(), internal::dummyDeleter<uint8_t>}, ElementSize, QueueSize}
{
}
/**
* \return maximum number of elements in queue
*/
constexpr static size_t getCapacity()
{
return QueueSize;
}
/**
* \return size of single queue element, bytes
*/
constexpr static size_t getElementSize()
{
return ElementSize;
}
private:
/// storage for queue's entries
std::array<EntryStorage, QueueSize> entryStorage_;
/// storage for queue's contents
std::array<uint8_t, ElementSize * QueueSize> valueStorage_;
};
/**
* \brief StaticRawMessageQueue2 class is a variant of RawMessageQueue that has automatic storage for queue's contents.
*
* \deprecated scheduled to be removed after v0.6.0, use `StaticRawMessageQueue<ElementSize, QueueSize>`
*
* \tparam ElementSize is the size of single queue element, bytes
* \tparam QueueSize is the maximum number of elements in queue
*
* \ingroup queues
*/
template<size_t ElementSize, size_t QueueSize>
using StaticRawMessageQueue2 __attribute__ ((deprecated("Use StaticRawMessageQueue<ElementSize, QueueSize>"))) =
StaticRawMessageQueue<ElementSize, QueueSize>;
} // namespace distortos
#endif // INCLUDE_DISTORTOS_STATICRAWMESSAGEQUEUE_HPP_
|
/**
* \file
* \brief StaticRawMessageQueue class header
*
* \author Copyright (C) 2015-2019 Kamil Szczygiel http://www.distortec.com http://www.freddiechopin.info
*
* \par License
* This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not
* distributed with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
*/
#ifndef INCLUDE_DISTORTOS_STATICRAWMESSAGEQUEUE_HPP_
#define INCLUDE_DISTORTOS_STATICRAWMESSAGEQUEUE_HPP_
#include "distortos/RawMessageQueue.hpp"
#include "distortos/internal/memory/dummyDeleter.hpp"
namespace distortos
{
/**
* \brief StaticRawMessageQueue class is a variant of RawMessageQueue that has automatic storage for queue's contents.
*
* \tparam ElementSize is the size of single queue element, bytes
* \tparam QueueSize is the maximum number of elements in queue
*
* \ingroup queues
*/
template<size_t ElementSize, size_t QueueSize>
class StaticRawMessageQueue : public RawMessageQueue
{
public:
/**
* \brief StaticRawMessageQueue's constructor
*/
explicit StaticRawMessageQueue() :
RawMessageQueue{{entryStorage_.data(), internal::dummyDeleter<EntryStorage>},
{valueStorage_.data(), internal::dummyDeleter<uint8_t>}, ElementSize, QueueSize}
{
}
/**
* \return maximum number of elements in queue
*/
constexpr static size_t getCapacity()
{
return QueueSize;
}
/**
* \return size of single queue element, bytes
*/
constexpr static size_t getElementSize()
{
return ElementSize;
}
private:
/// storage for queue's entries
std::array<EntryStorage, QueueSize> entryStorage_;
/// storage for queue's contents
std::array<uint8_t, ElementSize * QueueSize> valueStorage_;
};
} // namespace distortos
#endif // INCLUDE_DISTORTOS_STATICRAWMESSAGEQUEUE_HPP_
|
Remove deprecated StaticRawMessageQueue2 type alias
|
Remove deprecated StaticRawMessageQueue2 type alias
|
C++
|
mpl-2.0
|
DISTORTEC/distortos,DISTORTEC/distortos,DISTORTEC/distortos,DISTORTEC/distortos
|
0f2689dc786c33ae60e0c1f3b3a4be9c77de9c2c
|
include/tudocomp/lzss/LZSSESACompressor.hpp
|
include/tudocomp/lzss/LZSSESACompressor.hpp
|
#ifndef _INCLUDED_LZSS_ESA_COMPRESSOR_HPP_
#define _INCLUDED_LZSS_ESA_COMPRESSOR_HPP_
#include <tudocomp/sdslex/int_vector_wrapper.hpp>
#include <tudocomp/util.h>
#include <tudocomp/lzss/LZSSCompressor.hpp>
#include <tudocomp/lzss/esacomp/ESACompBulldozer.hpp>
#include <tudocomp/lzss/esacomp/ESACompMaxLCP.hpp>
#include <tudocomp/ds/TextDS.hpp>
namespace tudocomp {
namespace lzss {
/// Factorizes the input by finding redundant phrases in a re-ordered version
/// of the LCP table.
template<typename S, typename C>
class LZSSESACompressor : public LZSSCompressor<C> {
public:
inline static Meta meta() {
Meta m("compressor", "esacomp");
m.option("coder").templated<C>();
m.option("strategy").templated<S, ESACompMaxLCP>();
return m;
}
/// Default constructor (not supported).
inline LZSSESACompressor() = delete;
/// Construct the class with an environment.
inline LZSSESACompressor(Env&& env) :
LZSSCompressor<C>(std::move(env)) {}
/// \copydoc
inline virtual bool pre_factorize(Input& input) override {
auto& env = this->env();
auto in = input.as_view();
//Use strategy to generate factors
size_t fact_min = 3; //factor threshold
std::vector<LZSSFactor>& factors = this->m_factors;
//Construct SA, ISA and LCP
{
TextDS t(in);
env.begin_stat_phase("Construct text ds");
t.require(TextDS::SA | TextDS::ISA | TextDS::LCP);
env.end_stat_phase();
//Factorize
env.begin_stat_phase("Factorize using strategy");
S interval_selector(env.env_for_option("strategy"));
interval_selector.factorize(t, fact_min, factors);
env.log_stat("threshold", fact_min);
env.log_stat("factors", factors.size());
env.end_stat_phase();
}
//sort
env.begin_stat_phase("Sort factors");
std::sort(factors.begin(), factors.end());
env.end_stat_phase();
return true;
}
/// \copydoc
inline virtual LZSSCoderOpts coder_opts(Input& input) override {
return LZSSCoderOpts(false, bitsFor(input.size()));
}
/// \copydoc
inline virtual void factorize(Input& input) override {
}
virtual Env create_decoder_env() override {
return this->env().env_for_option("coder");
}
};
}}
#endif
|
#ifndef _INCLUDED_LZSS_ESA_COMPRESSOR_HPP_
#define _INCLUDED_LZSS_ESA_COMPRESSOR_HPP_
#include <tudocomp/sdslex/int_vector_wrapper.hpp>
#include <tudocomp/util.h>
#include <tudocomp/lzss/LZSSCompressor.hpp>
#include <tudocomp/lzss/esacomp/ESACompBulldozer.hpp>
#include <tudocomp/lzss/esacomp/ESACompMaxLCP.hpp>
#include <tudocomp/ds/TextDS.hpp>
namespace tudocomp {
namespace lzss {
/// Factorizes the input by finding redundant phrases in a re-ordered version
/// of the LCP table.
template<typename S, typename C>
class LZSSESACompressor : public LZSSCompressor<C> {
public:
inline static Meta meta() {
Meta m("compressor", "esacomp");
m.option("coder").templated<C>();
m.option("strategy").templated<S, ESACompMaxLCP>();
m.option("threshold").dynamic("6");
return m;
}
/// Default constructor (not supported).
inline LZSSESACompressor() = delete;
/// Construct the class with an environment.
inline LZSSESACompressor(Env&& env) :
LZSSCompressor<C>(std::move(env)) {}
/// \copydoc
inline virtual bool pre_factorize(Input& input) override {
auto& env = this->env();
auto in = input.as_view();
//Use strategy to generate factors
size_t fact_min = env.option("threshold").as_integer(); //factor threshold
DLOG(INFO) << "fact_min = " << fact_min;
std::vector<LZSSFactor>& factors = this->m_factors;
//Construct SA, ISA and LCP
{
TextDS t(in);
env.begin_stat_phase("Construct text ds");
t.require(TextDS::SA | TextDS::ISA | TextDS::LCP);
env.end_stat_phase();
//Factorize
env.begin_stat_phase("Factorize using strategy");
S interval_selector(env.env_for_option("strategy"));
interval_selector.factorize(t, fact_min, factors);
env.log_stat("threshold", fact_min);
env.log_stat("factors", factors.size());
env.end_stat_phase();
}
//sort
env.begin_stat_phase("Sort factors");
std::sort(factors.begin(), factors.end());
env.end_stat_phase();
return true;
}
/// \copydoc
inline virtual LZSSCoderOpts coder_opts(Input& input) override {
return LZSSCoderOpts(false, bitsFor(input.size()));
}
/// \copydoc
inline virtual void factorize(Input& input) override {
}
virtual Env create_decoder_env() override {
return this->env().env_for_option("coder");
}
};
}}
#endif
|
Make ESAComp threshold optional
|
Make ESAComp threshold optional
|
C++
|
apache-2.0
|
tudocomp/tudocomp,tudocomp/tudocomp,tudocomp/tudocomp,tudocomp/tudocomp,tudocomp/tudocomp
|
d3b2d9201327bda749514fe0cca5a63adb3c291c
|
include/vsmc/opencl/internal/cl_wrapper.hpp
|
include/vsmc/opencl/internal/cl_wrapper.hpp
|
//============================================================================
// include/vsmc/opencl/internal/cl_wrapper.hpp
//----------------------------------------------------------------------------
//
// vSMC: Scalable Monte Carlo
//
// This file is distributed under the 2-clauses BSD License.
// See LICENSE for details.
//============================================================================
#ifndef VSMC_OPENCL_INTERNAL_CL_WRAPPER_HPP
#define VSMC_OPENCL_INTERNAL_CL_WRAPPER_HPP
#if defined(VSMC_GCC) && VSMC_GCC_VERSION >= 40600
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wdeprecated-declarations"
#elif defined(VSMC_MSVC)
#pragma warning(push)
#pragma warning(disable:4996)
#endif
#include <cl.hpp>
#ifndef __CL_ENABLE_EXCEPTIONS
#error __CL_ENABLE_EXCEPTIONS not defined before #include<cl.hpp>
#endif
#if defined(VSMC_GCC) && VSMC_GCC_VERSION >= 40600
#pragma GCC diagnostic pop
#elif defined(VSM_MSVC)
#pragma warning(pop)
#endif
#if defined(CL_VERSION_2_0)
#define VSMC_OPENCL_VERSION 200
#elif defined(CL_VERSION_1_2)
#define VSMC_OPENCL_VERSION 120
#elif defined(CL_VERSION_1_1)
#define VSMC_OPENCL_VERSION 110
#else
#define VSMC_OPENCL_VERSION 100
#endif
#endif // VSMC_OPENCL_INTERNAL_CL_WRAPPER_HPP
|
//============================================================================
// include/vsmc/opencl/internal/cl_wrapper.hpp
//----------------------------------------------------------------------------
//
// vSMC: Scalable Monte Carlo
//
// This file is distributed under the 2-clauses BSD License.
// See LICENSE for details.
//============================================================================
#ifndef VSMC_OPENCL_INTERNAL_CL_WRAPPER_HPP
#define VSMC_OPENCL_INTERNAL_CL_WRAPPER_HPP
#if defined(VSMC_GCC)
#if VSMC_GCC_VERSION >= 40600
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wdeprecated-declarations"
#endif
#elif defined(VSMC_MSVC)
#pragma warning(push)
#pragma warning(disable:4996)
#endif
#include <cl.hpp>
#ifndef __CL_ENABLE_EXCEPTIONS
#error __CL_ENABLE_EXCEPTIONS not defined before #include<cl.hpp>
#endif
#if defined(VSMC_GCC)
#if VSMC_GCC_VERSION >= 40600
#pragma GCC diagnostic pop
#endif
#elif defined(VSM_MSVC)
#pragma warning(pop)
#endif
#if defined(CL_VERSION_2_0)
#define VSMC_OPENCL_VERSION 200
#elif defined(CL_VERSION_1_2)
#define VSMC_OPENCL_VERSION 120
#elif defined(CL_VERSION_1_1)
#define VSMC_OPENCL_VERSION 110
#else
#define VSMC_OPENCL_VERSION 100
#endif
#endif // VSMC_OPENCL_INTERNAL_CL_WRAPPER_HPP
|
fix GCC version check
|
fix GCC version check
|
C++
|
bsd-2-clause
|
zhouyan/vSMC,zhouyan/vSMC,zhouyan/vSMC,zhouyan/vSMC
|
26cfec82e5c55d997d0f132adf96e2dabca0b29d
|
routing/routing_tests/astar_algorithm_test.cpp
|
routing/routing_tests/astar_algorithm_test.cpp
|
#include "testing/testing.hpp"
#include "routing/base/astar_algorithm.hpp"
#include "routing/base/routing_result.hpp"
#include "std/map.hpp"
#include "std/utility.hpp"
#include "std/vector.hpp"
namespace routing_test
{
using namespace routing;
struct Edge
{
Edge(unsigned v, double w) : v(v), w(w) {}
unsigned GetTarget() const { return v; }
double GetWeight() const { return w; }
unsigned v;
double w;
};
class UndirectedGraph
{
public:
using Vertex = unsigned;
using Edge = Edge;
using Weight = double;
void AddEdge(unsigned u, unsigned v, unsigned w)
{
m_adjs[u].push_back(Edge(v, w));
m_adjs[v].push_back(Edge(u, w));
}
void GetAdjacencyList(unsigned v, vector<Edge> & adj) const
{
adj.clear();
auto const it = m_adjs.find(v);
if (it != m_adjs.end())
adj = it->second;
}
void GetIngoingEdgesList(unsigned v, vector<Edge> & adj) const
{
GetAdjacencyList(v, adj);
}
void GetOutgoingEdgesList(unsigned v, vector<Edge> & adj) const
{
GetAdjacencyList(v, adj);
}
double HeuristicCostEstimate(unsigned v, unsigned w) const { return 0; }
private:
map<unsigned, vector<Edge>> m_adjs;
};
using TAlgorithm = AStarAlgorithm<UndirectedGraph>;
void TestAStar(UndirectedGraph & graph, vector<unsigned> const & expectedRoute, double const & expectedDistance)
{
TAlgorithm algo;
RoutingResult<unsigned /* Vertex */, double /* Weight */> actualRoute;
TEST_EQUAL(TAlgorithm::Result::OK, algo.FindPath(graph, 0u, 4u, actualRoute), ());
TEST_EQUAL(expectedRoute, actualRoute.m_path, ());
TEST_ALMOST_EQUAL_ULPS(expectedDistance, actualRoute.m_distance, ());
actualRoute.m_path.clear();
TEST_EQUAL(TAlgorithm::Result::OK, algo.FindPathBidirectional(graph, 0u, 4u, actualRoute), ());
TEST_EQUAL(expectedRoute, actualRoute.m_path, ());
TEST_ALMOST_EQUAL_ULPS(expectedDistance, actualRoute.m_distance, ());
}
UNIT_TEST(AStarAlgorithm_Sample)
{
UndirectedGraph graph;
// Inserts edges in a format: <source, target, weight>.
graph.AddEdge(0, 1, 10);
graph.AddEdge(1, 2, 5);
graph.AddEdge(2, 3, 5);
graph.AddEdge(2, 4, 10);
graph.AddEdge(3, 4, 3);
vector<unsigned> const expectedRoute = {0, 1, 2, 3, 4};
TestAStar(graph, expectedRoute, 23);
}
UNIT_TEST(AStarAlgorithm_CheckLength)
{
UndirectedGraph graph;
// Inserts edges in a format: <source, target, weight>.
graph.AddEdge(0, 1, 10);
graph.AddEdge(1, 2, 5);
graph.AddEdge(2, 3, 5);
graph.AddEdge(2, 4, 10);
graph.AddEdge(3, 4, 3);
TAlgorithm algo;
RoutingResult<unsigned /* Vertex */, double /* Weight */> routingResult;
TAlgorithm::Result result =
algo.FindPath(graph, 0u, 4u, routingResult, {} /* cancellable */,
{} /* onVisitedVertexCallback */, [](double weight) { return weight < 23; });
// Best route weight is 23 so we expect to find no route with restriction |weight < 23|.
TEST_EQUAL(result, TAlgorithm::Result::NoPath, ());
routingResult = {};
result = algo.FindPathBidirectional(graph, 0u, 4u, routingResult, {} /* cancellable */,
{} /* onVisitedVertexCallback */,
[](double weight) { return weight < 23; });
// Best route weight is 23 so we expect to find no route with restriction |weight < 23|.
TEST_EQUAL(result, TAlgorithm::Result::NoPath, ());
}
UNIT_TEST(AdjustRoute)
{
UndirectedGraph graph;
for (unsigned int i = 0; i < 5; ++i)
graph.AddEdge(i /* from */, i + 1 /* to */, 1 /* weight */);
graph.AddEdge(6, 0, 1);
graph.AddEdge(6, 1, 1);
graph.AddEdge(6, 2, 1);
// Each edge contains {vertexId, weight}.
vector<Edge> const prevRoute = {{0, 0}, {1, 1}, {2, 1}, {3, 1}, {4, 1}, {5, 1}};
TAlgorithm algo;
RoutingResult<unsigned /* Vertex */, double /* Weight */> result;
auto code = algo.AdjustRoute(graph, 6 /* start */, prevRoute, result,
my::Cancellable(), nullptr /* onVisitedVertexCallback */,
[](double weight){ return weight <= 1.0; });
vector<unsigned> const expectedRoute = {6, 2, 3, 4, 5};
TEST_EQUAL(code, TAlgorithm::Result::OK, ());
TEST_EQUAL(result.m_path, expectedRoute, ());
TEST_EQUAL(result.m_distance, 4.0, ());
}
UNIT_TEST(AdjustRouteNoPath)
{
UndirectedGraph graph;
for (unsigned int i = 0; i < 5; ++i)
graph.AddEdge(i /* from */, i + 1 /* to */, 1 /* weight */);
// Each edge contains {vertexId, weight}.
vector<Edge> const prevRoute = {{0, 0}, {1, 1}, {2, 1}, {3, 1}, {4, 1}, {5, 1}};
TAlgorithm algo;
RoutingResult<unsigned /* Vertex */, double /* Weight */> result;
auto code = algo.AdjustRoute(graph, 6 /* start */, prevRoute, result,
my::Cancellable(), nullptr /* onVisitedVertexCallback */,
[](double weight){ return weight <= 1.0; });
TEST_EQUAL(code, TAlgorithm::Result::NoPath, ());
TEST(result.m_path.empty(), ());
}
UNIT_TEST(AdjustRouteOutOfLimit)
{
UndirectedGraph graph;
for (unsigned int i = 0; i < 5; ++i)
graph.AddEdge(i /* from */, i + 1 /* to */, 1 /* weight */);
graph.AddEdge(6, 2, 2);
// Each edge contains {vertexId, weight}.
vector<Edge> const prevRoute = {{0, 0}, {1, 1}, {2, 1}, {3, 1}, {4, 1}, {5, 1}};
TAlgorithm algo;
RoutingResult<unsigned /* Vertex */, double /* Weight */> result;
auto code = algo.AdjustRoute(graph, 6 /* start */, prevRoute, result,
my::Cancellable(), nullptr /* onVisitedVertexCallback */,
[](double weight){ return weight <= 1.0; });
TEST_EQUAL(code, TAlgorithm::Result::NoPath, ());
TEST(result.m_path.empty(), ());
}
} // namespace routing_test
|
#include "testing/testing.hpp"
#include "routing/base/astar_algorithm.hpp"
#include "routing/base/routing_result.hpp"
#include "std/map.hpp"
#include "std/utility.hpp"
#include "std/vector.hpp"
namespace routing_test
{
using namespace routing;
struct Edge
{
Edge(unsigned v, double w) : v(v), w(w) {}
unsigned GetTarget() const { return v; }
double GetWeight() const { return w; }
unsigned v;
double w;
};
class UndirectedGraph
{
public:
using Vertex = unsigned;
using Edge = routing_test::Edge;
using Weight = double;
void AddEdge(unsigned u, unsigned v, unsigned w)
{
m_adjs[u].push_back(Edge(v, w));
m_adjs[v].push_back(Edge(u, w));
}
void GetAdjacencyList(unsigned v, vector<Edge> & adj) const
{
adj.clear();
auto const it = m_adjs.find(v);
if (it != m_adjs.end())
adj = it->second;
}
void GetIngoingEdgesList(unsigned v, vector<Edge> & adj) const
{
GetAdjacencyList(v, adj);
}
void GetOutgoingEdgesList(unsigned v, vector<Edge> & adj) const
{
GetAdjacencyList(v, adj);
}
double HeuristicCostEstimate(unsigned v, unsigned w) const { return 0; }
private:
map<unsigned, vector<Edge>> m_adjs;
};
using TAlgorithm = AStarAlgorithm<UndirectedGraph>;
void TestAStar(UndirectedGraph & graph, vector<unsigned> const & expectedRoute, double const & expectedDistance)
{
TAlgorithm algo;
RoutingResult<unsigned /* Vertex */, double /* Weight */> actualRoute;
TEST_EQUAL(TAlgorithm::Result::OK, algo.FindPath(graph, 0u, 4u, actualRoute), ());
TEST_EQUAL(expectedRoute, actualRoute.m_path, ());
TEST_ALMOST_EQUAL_ULPS(expectedDistance, actualRoute.m_distance, ());
actualRoute.m_path.clear();
TEST_EQUAL(TAlgorithm::Result::OK, algo.FindPathBidirectional(graph, 0u, 4u, actualRoute), ());
TEST_EQUAL(expectedRoute, actualRoute.m_path, ());
TEST_ALMOST_EQUAL_ULPS(expectedDistance, actualRoute.m_distance, ());
}
UNIT_TEST(AStarAlgorithm_Sample)
{
UndirectedGraph graph;
// Inserts edges in a format: <source, target, weight>.
graph.AddEdge(0, 1, 10);
graph.AddEdge(1, 2, 5);
graph.AddEdge(2, 3, 5);
graph.AddEdge(2, 4, 10);
graph.AddEdge(3, 4, 3);
vector<unsigned> const expectedRoute = {0, 1, 2, 3, 4};
TestAStar(graph, expectedRoute, 23);
}
UNIT_TEST(AStarAlgorithm_CheckLength)
{
UndirectedGraph graph;
// Inserts edges in a format: <source, target, weight>.
graph.AddEdge(0, 1, 10);
graph.AddEdge(1, 2, 5);
graph.AddEdge(2, 3, 5);
graph.AddEdge(2, 4, 10);
graph.AddEdge(3, 4, 3);
TAlgorithm algo;
RoutingResult<unsigned /* Vertex */, double /* Weight */> routingResult;
TAlgorithm::Result result =
algo.FindPath(graph, 0u, 4u, routingResult, {} /* cancellable */,
{} /* onVisitedVertexCallback */, [](double weight) { return weight < 23; });
// Best route weight is 23 so we expect to find no route with restriction |weight < 23|.
TEST_EQUAL(result, TAlgorithm::Result::NoPath, ());
routingResult = {};
result = algo.FindPathBidirectional(graph, 0u, 4u, routingResult, {} /* cancellable */,
{} /* onVisitedVertexCallback */,
[](double weight) { return weight < 23; });
// Best route weight is 23 so we expect to find no route with restriction |weight < 23|.
TEST_EQUAL(result, TAlgorithm::Result::NoPath, ());
}
UNIT_TEST(AdjustRoute)
{
UndirectedGraph graph;
for (unsigned int i = 0; i < 5; ++i)
graph.AddEdge(i /* from */, i + 1 /* to */, 1 /* weight */);
graph.AddEdge(6, 0, 1);
graph.AddEdge(6, 1, 1);
graph.AddEdge(6, 2, 1);
// Each edge contains {vertexId, weight}.
vector<Edge> const prevRoute = {{0, 0}, {1, 1}, {2, 1}, {3, 1}, {4, 1}, {5, 1}};
TAlgorithm algo;
RoutingResult<unsigned /* Vertex */, double /* Weight */> result;
auto code = algo.AdjustRoute(graph, 6 /* start */, prevRoute, result,
my::Cancellable(), nullptr /* onVisitedVertexCallback */,
[](double weight){ return weight <= 1.0; });
vector<unsigned> const expectedRoute = {6, 2, 3, 4, 5};
TEST_EQUAL(code, TAlgorithm::Result::OK, ());
TEST_EQUAL(result.m_path, expectedRoute, ());
TEST_EQUAL(result.m_distance, 4.0, ());
}
UNIT_TEST(AdjustRouteNoPath)
{
UndirectedGraph graph;
for (unsigned int i = 0; i < 5; ++i)
graph.AddEdge(i /* from */, i + 1 /* to */, 1 /* weight */);
// Each edge contains {vertexId, weight}.
vector<Edge> const prevRoute = {{0, 0}, {1, 1}, {2, 1}, {3, 1}, {4, 1}, {5, 1}};
TAlgorithm algo;
RoutingResult<unsigned /* Vertex */, double /* Weight */> result;
auto code = algo.AdjustRoute(graph, 6 /* start */, prevRoute, result,
my::Cancellable(), nullptr /* onVisitedVertexCallback */,
[](double weight){ return weight <= 1.0; });
TEST_EQUAL(code, TAlgorithm::Result::NoPath, ());
TEST(result.m_path.empty(), ());
}
UNIT_TEST(AdjustRouteOutOfLimit)
{
UndirectedGraph graph;
for (unsigned int i = 0; i < 5; ++i)
graph.AddEdge(i /* from */, i + 1 /* to */, 1 /* weight */);
graph.AddEdge(6, 2, 2);
// Each edge contains {vertexId, weight}.
vector<Edge> const prevRoute = {{0, 0}, {1, 1}, {2, 1}, {3, 1}, {4, 1}, {5, 1}};
TAlgorithm algo;
RoutingResult<unsigned /* Vertex */, double /* Weight */> result;
auto code = algo.AdjustRoute(graph, 6 /* start */, prevRoute, result,
my::Cancellable(), nullptr /* onVisitedVertexCallback */,
[](double weight){ return weight <= 1.0; });
TEST_EQUAL(code, TAlgorithm::Result::NoPath, ());
TEST(result.m_path.empty(), ());
}
} // namespace routing_test
|
Fix linux build
|
Fix linux build
|
C++
|
apache-2.0
|
bykoianko/omim,alexzatsepin/omim,VladiMihaylenko/omim,milchakov/omim,trashkalmar/omim,mgsergio/omim,milchakov/omim,milchakov/omim,goblinr/omim,mpimenov/omim,matsprea/omim,VladiMihaylenko/omim,matsprea/omim,mpimenov/omim,trashkalmar/omim,milchakov/omim,goblinr/omim,ygorshenin/omim,trashkalmar/omim,mapsme/omim,rokuz/omim,ygorshenin/omim,mapsme/omim,mapsme/omim,ygorshenin/omim,alexzatsepin/omim,trashkalmar/omim,ygorshenin/omim,bykoianko/omim,alexzatsepin/omim,mgsergio/omim,ygorshenin/omim,trashkalmar/omim,milchakov/omim,darina/omim,milchakov/omim,mpimenov/omim,mpimenov/omim,VladiMihaylenko/omim,mgsergio/omim,mpimenov/omim,ygorshenin/omim,mpimenov/omim,goblinr/omim,mpimenov/omim,bykoianko/omim,ygorshenin/omim,milchakov/omim,trashkalmar/omim,darina/omim,VladiMihaylenko/omim,mapsme/omim,trashkalmar/omim,matsprea/omim,goblinr/omim,darina/omim,mgsergio/omim,rokuz/omim,alexzatsepin/omim,darina/omim,trashkalmar/omim,mapsme/omim,ygorshenin/omim,rokuz/omim,mapsme/omim,rokuz/omim,bykoianko/omim,mapsme/omim,VladiMihaylenko/omim,mgsergio/omim,rokuz/omim,rokuz/omim,matsprea/omim,matsprea/omim,goblinr/omim,goblinr/omim,mapsme/omim,darina/omim,bykoianko/omim,milchakov/omim,mpimenov/omim,alexzatsepin/omim,trashkalmar/omim,darina/omim,alexzatsepin/omim,matsprea/omim,mgsergio/omim,mgsergio/omim,trashkalmar/omim,darina/omim,matsprea/omim,milchakov/omim,ygorshenin/omim,mgsergio/omim,alexzatsepin/omim,rokuz/omim,goblinr/omim,alexzatsepin/omim,matsprea/omim,bykoianko/omim,bykoianko/omim,milchakov/omim,mpimenov/omim,darina/omim,milchakov/omim,mgsergio/omim,goblinr/omim,mpimenov/omim,mpimenov/omim,rokuz/omim,alexzatsepin/omim,ygorshenin/omim,VladiMihaylenko/omim,trashkalmar/omim,VladiMihaylenko/omim,mapsme/omim,mpimenov/omim,VladiMihaylenko/omim,ygorshenin/omim,mgsergio/omim,goblinr/omim,goblinr/omim,trashkalmar/omim,alexzatsepin/omim,mpimenov/omim,mapsme/omim,bykoianko/omim,bykoianko/omim,rokuz/omim,bykoianko/omim,alexzatsepin/omim,alexzatsepin/omim,VladiMihaylenko/omim,matsprea/omim,rokuz/omim,darina/omim,VladiMihaylenko/omim,rokuz/omim,mgsergio/omim,darina/omim,alexzatsepin/omim,darina/omim,bykoianko/omim,milchakov/omim,goblinr/omim,bykoianko/omim,goblinr/omim,milchakov/omim,darina/omim,VladiMihaylenko/omim,ygorshenin/omim,darina/omim,rokuz/omim,goblinr/omim,mgsergio/omim,mapsme/omim,VladiMihaylenko/omim,VladiMihaylenko/omim,mapsme/omim,bykoianko/omim,matsprea/omim,mapsme/omim,rokuz/omim
|
b11f0c694504e14ca96edc106ade880ddc7fefe1
|
src/Editor/GUI/ComponentEditor/LensEditor.hpp
|
src/Editor/GUI/ComponentEditor/LensEditor.hpp
|
#pragma once
#include "ComponentEditor.hpp"
class Entity;
class Font;
namespace GUI {
class FloatEditor;
/// Used to edit a lens component.
class LensEditor : public ComponentEditor {
public:
/// Create new transform editor.
/**
* @param parent Parent widget.
*/
LensEditor(Widget* parent);
/// Destructor.
~LensEditor() override;
/// Set the entity to edit the transform component of.
/**
* @param entity %Entity to edit.
*/
void SetEntity(Entity* entity) override;
private:
Font* font;
FloatEditor* fieldOfViewEditor;
FloatEditor* zNearEditor;
FloatEditor* zFarEditor;
};
}
|
#pragma once
#include "ComponentEditor.hpp"
class Entity;
class Font;
namespace GUI {
class FloatEditor;
/// Used to edit a lens component.
class LensEditor : public ComponentEditor {
public:
/// Create new lens editor.
/**
* @param parent Parent widget.
*/
LensEditor(Widget* parent);
/// Destructor.
~LensEditor() override;
/// Set the entity to edit the lens component of.
/**
* @param entity %Entity to edit.
*/
void SetEntity(Entity* entity) override;
private:
Font* font;
FloatEditor* fieldOfViewEditor;
FloatEditor* zNearEditor;
FloatEditor* zFarEditor;
};
}
|
Fix lens editor documentation.
|
Fix lens editor documentation.
|
C++
|
mit
|
Chainsawkitten/LargeGameProjectEngine,Chainsawkitten/LargeGameProjectEngine,Chainsawkitten/HymnToBeauty,Chainsawkitten/HymnToBeauty
|
324c82d98e7dc0cca93bf1349f873225159b1fc3
|
Examples/Benchmark.cc
|
Examples/Benchmark.cc
|
/* Copyright (c) 2012-2014 Stanford University
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR(S) DISCLAIM ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL AUTHORS BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
/**
* \file
* This is a basic latency/bandwidth benchmark of LogCabin.
*/
// std::atomic header file renamed in gcc 4.5.
// Clang uses <atomic> but has defines like gcc 4.2.
#if __GNUC__ == 4 && __GNUC_MINOR__ < 5 && !__clang__
#include <cstdatomic>
#else
#include <atomic>
#endif
#include <cassert>
#include <ctime>
#include <getopt.h>
#include <iostream>
#include <thread>
#include <unistd.h>
#include <algorithm>
#include <string>
#include <sstream>
#include <vector>
#include <LogCabin/Client.h>
#include <LogCabin/Debug.h>
#include <LogCabin/Util.h>
#include "Core/StringUtil.h"
namespace {
using LogCabin::Client::Cluster;
using LogCabin::Client::Result;
using LogCabin::Client::Status;
using LogCabin::Client::Tree;
using LogCabin::Client::Util::parseNonNegativeDuration;
using LogCabin::Core::StringUtil::format;
uint64_t timeNanos(void);
std::vector<uint64_t> stats;
std::mutex statsMutex;
void split(const std::string &s, char delim, std::vector<std::string> &elems) {
std::stringstream ss;
ss.str(s);
std::string item;
while (std::getline(ss, item, delim)) {
elems.push_back(item);
}
}
std::vector<std::string> split(const std::string &s, char delim) {
std::vector<std::string> elems;
split(s, delim, elems);
return elems;
}
/**
* Parses argv for the main function.
*/
class OptionParser {
public:
OptionParser(int& argc, char**& argv)
: argc(argc)
, argv(argv)
, cluster("127.0.0.1:5254")
, cluster2("")
, logPolicy("")
, size(1024)
, writers(1)
, totalWrites(1000)
, timeout(parseNonNegativeDuration("30s"))
{
while (true) {
static struct option longOptions[] = {
{"cluster", required_argument, NULL, 'c'},
{"cluster2", required_argument, NULL, 'C'},
{"help", no_argument, NULL, 'h'},
{"size", required_argument, NULL, 's'},
{"threads", required_argument, NULL, 't'},
{"timeout", required_argument, NULL, 'd'},
{"writes", required_argument, NULL, 'w'},
{"verbose", no_argument, NULL, 'v'},
{"verbosity", required_argument, NULL, 256},
{0, 0, 0, 0}
};
int c = getopt_long(argc, argv, "c:hs:t:w:vC:", longOptions, NULL);
// Detect the end of the options.
if (c == -1)
break;
switch (c) {
case 'c':
cluster = optarg;
break;
case 'd':
timeout = parseNonNegativeDuration(optarg);
break;
case 'h':
usage();
exit(0);
case 's':
size = uint64_t(atol(optarg));
break;
case 't':
writers = uint64_t(atol(optarg));
break;
case 'w':
totalWrites = uint64_t(atol(optarg));
break;
case 'v':
logPolicy = "VERBOSE";
break;
case 256:
logPolicy = optarg;
break;
case 'C':
cluster2 = optarg;
break;
case '?':
default:
// getopt_long already printed an error message.
usage();
exit(1);
}
}
}
void usage() {
std::cout
<< "Writes repeatedly to LogCabin. Stops once it reaches "
<< "the given number of"
<< std::endl
<< "writes or the timeout, whichever comes first."
<< std::endl
<< std::endl
<< "This program is subject to change (it is not part of "
<< "LogCabin's stable API)."
<< std::endl
<< std::endl
<< "Usage: " << argv[0] << " [options]"
<< std::endl
<< std::endl
<< "Options:"
<< std::endl
<< " -c <addresses>, --cluster=<addresses> "
<< "Network addresses of the LogCabin"
<< std::endl
<< " "
<< "servers, comma-separated"
<< std::endl
<< " "
<< "[default: 127.0.0.1:5254]"
<< std::endl
<< " -C <address>, --cluster2=<address> "
<< "second server"
<< std::endl
<< " -h, --help "
<< "Print this usage information"
<< std::endl
<< " --size <bytes> "
<< "Size of value in each write [default: 1024]"
<< std::endl
<< " --threads <num> "
<< "Number of concurrent writers [default: 1]"
<< std::endl
<< " --timeout <time> "
<< "Time after which to exit [default: 30s]"
<< std::endl
<< " --writes <num> "
<< "Number of total writes [default: 1000]"
<< std::endl
<< " -v, --verbose "
<< "Same as --verbosity=VERBOSE"
<< std::endl
<< " --verbosity=<policy> "
<< "Set which log messages are shown."
<< std::endl
<< " "
<< "Comma-separated LEVEL or PATTERN@LEVEL rules."
<< std::endl
<< " "
<< "Levels: SILENT, ERROR, WARNING, NOTICE, VERBOSE."
<< std::endl
<< " "
<< "Patterns match filename prefixes or suffixes."
<< std::endl
<< " "
<< "Example: Client@NOTICE,Test.cc@SILENT,VERBOSE."
<< std::endl;
}
int& argc;
char**& argv;
std::string cluster;
std::string cluster2;
std::string logPolicy;
uint64_t size;
uint64_t writers;
uint64_t totalWrites;
uint64_t timeout;
};
/**
* The main function for a single client thread.
* \param id
* Unique ID for this thread, counting from 0.
* \param options
* Arguments describing benchmark.
* \param tree
* Interface to LogCabin.
* \param key
* Key to write repeatedly.
* \param value
* Value to write at key repeatedly.
* \param exit
* When this becomes true, this thread should exit.
* \param[out] writesDone
* The number of writes this thread has completed.
*/
void
writeThreadMain(uint64_t id,
const OptionParser& options,
Tree tree,
const std::string& key,
const std::string& value,
std::atomic<bool>& exit,
uint64_t& writesDone)
{
uint64_t numWrites = options.totalWrites / options.writers;
// assign any odd leftover writes in a balanced way
if (options.totalWrites - numWrites * options.writers > id)
numWrites += 1;
for (uint64_t i = 0; i < numWrites; ++i) {
if (exit)
break;
uint64_t startNanos = timeNanos();
tree.writeEx(format("%s-%ld", key.c_str(), i), value);
uint64_t endNanos = timeNanos();
{
std::lock_guard<std::mutex> lock(statsMutex);
stats.push_back(endNanos - startNanos);
}
writesDone = i + 1;
}
}
/**
* Return the time since the Unix epoch in nanoseconds.
*/
uint64_t timeNanos()
{
struct timespec now;
int r = clock_gettime(CLOCK_REALTIME, &now);
assert(r == 0);
return uint64_t(now.tv_sec) * 1000 * 1000 * 1000 + uint64_t(now.tv_nsec);
}
/**
* Main function for the timer thread, whose job is to wait until a particular
* timeout elapses and then set 'exit' to true.
* \param timeout
* Seconds to wait before setting exit to true.
* \param[in,out] exit
* If this is set to true from another thread, the timer thread will exit
* soonish. Also, if the timeout elapses, the timer thread will set this
* to true and exit.
*/
void
timerThreadMain(uint64_t timeout, std::atomic<bool>& exit)
{
uint64_t start = timeNanos();
while (!exit) {
usleep(50 * 1000);
if ((timeNanos() - start) > timeout) {
exit = true;
}
}
}
void statsThreadMain(std::atomic<bool>& exit) {
uint64_t min, max, mid, dot99;
const uint64_t unit = 1000;
std::cout << std::endl << "unit is microsecond" << std::endl;
while (!exit) {
usleep(10 * 1000 * 1000);
std::cout << "stats vector size: " << stats.size() << std::endl;
{
std::lock_guard<std::mutex> lock(statsMutex);
std::sort(stats.begin(), stats.end());
min = stats.front() / unit;
max = stats.back() / unit ;
mid = stats.at(stats.size() / 2) / unit;
dot99 = stats.at(stats.size() * 99 / 100) / unit;
}
std::cout << "min: " << min
<< " max: " << max
<< " mid: " << mid
<< " .99: " << dot99
<< std::endl;
}
}
} // anonymous namespace
int
main(int argc, char** argv)
{
try {
OptionParser options(argc, argv);
LogCabin::Client::Debug::setLogPolicy(
LogCabin::Client::Debug::logPolicyFromString(
options.logPolicy));
// std::vector<Cluster> clusters;
std::vector<Tree*> trees;
std::vector<std::string> clusters_opt = split(options.clusterEx, ',');
for(auto const& cluster_opt: clusters_opt) {
Cluster *cluster = new Cluster(cluster_opt);
Tree *tree = new Tree(cluster->getTree());
trees.push_back(tree);
}
Cluster cluster = Cluster(options.cluster);
Tree tree = cluster.getTree();
bool has_cluster2 = options.cluster2 == "" ? false : true;
Cluster *cluster2 = NULL;
Tree *tree2 = NULL;
if (has_cluster2) {
cluster2 = new Cluster(options.cluster2);
tree2 = new Tree(cluster2->getTree());
}
uint64_t writers_count = has_cluster2
? options.writers * 2
: options.writers;
std::string key("/bench");
std::string value(options.size, 'v');
uint64_t startNanos = timeNanos();
std::atomic<bool> exit(false);
std::vector<uint64_t> writesDonePerThread(writers_count);
uint64_t totalWritesDone = 0;
std::vector<std::thread> threads;
std::thread timer(timerThreadMain, options.timeout, std::ref(exit));
uint64_t i = 0;
for (i = 0; i < options.writers; ++i) {
threads.emplace_back(writeThreadMain, i, std::ref(options),
tree, std::ref(key), std::ref(value),
std::ref(exit),
std::ref(writesDonePerThread.at(i)));
}
std::thread statsThread(statsThreadMain, std::ref(exit));
if (has_cluster2) {
for (uint64_t i = options.writers; i < writers_count; ++i) {
threads.emplace_back(writeThreadMain, i, std::ref(options),
*tree2, std::ref(key), std::ref(value),
std::ref(exit),
std::ref(writesDonePerThread.at(i)));
}
}
for (uint64_t i = 0; i < writers_count; ++i) {
threads.at(i).join();
totalWritesDone += writesDonePerThread.at(i);
}
uint64_t endNanos = timeNanos();
exit = true;
timer.join();
statsThread.join();
tree.removeFile(key);
if (tree2) tree2->removeFile(key);
std::cout << "Benchmark took "
<< static_cast<double>(endNanos - startNanos) / 1e6
<< " ms to write "
<< totalWritesDone
<< " objects"
<< std::endl;
std::cout << "ops: "
<< static_cast<double>(totalWritesDone)
/ (static_cast<double>(endNanos - startNanos) / 1e9)
<< std::endl;
return 0;
} catch (const LogCabin::Client::Exception& e) {
std::cerr << "Exiting due to LogCabin::Client::Exception: "
<< e.what()
<< std::endl;
exit(1);
}
}
|
/* Copyright (c) 2012-2014 Stanford University
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR(S) DISCLAIM ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL AUTHORS BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
/**
* \file
* This is a basic latency/bandwidth benchmark of LogCabin.
*/
// std::atomic header file renamed in gcc 4.5.
// Clang uses <atomic> but has defines like gcc 4.2.
#if __GNUC__ == 4 && __GNUC_MINOR__ < 5 && !__clang__
#include <cstdatomic>
#else
#include <atomic>
#endif
#include <cassert>
#include <ctime>
#include <getopt.h>
#include <iostream>
#include <thread>
#include <unistd.h>
#include <algorithm>
#include <string>
#include <sstream>
#include <vector>
#include <LogCabin/Client.h>
#include <LogCabin/Debug.h>
#include <LogCabin/Util.h>
#include "Core/StringUtil.h"
namespace {
using LogCabin::Client::Cluster;
using LogCabin::Client::Result;
using LogCabin::Client::Status;
using LogCabin::Client::Tree;
using LogCabin::Client::Util::parseNonNegativeDuration;
using LogCabin::Core::StringUtil::format;
uint64_t timeNanos(void);
std::vector<uint64_t> stats;
std::mutex statsMutex;
void split(const std::string &s, char delim, std::vector<std::string> &elems) {
std::stringstream ss;
ss.str(s);
std::string item;
while (std::getline(ss, item, delim)) {
elems.push_back(item);
}
}
std::vector<std::string> split(const std::string &s, char delim) {
std::vector<std::string> elems;
split(s, delim, elems);
return elems;
}
/**
* Parses argv for the main function.
*/
class OptionParser {
public:
OptionParser(int& argc, char**& argv)
: argc(argc)
, argv(argv)
, cluster("127.0.0.1:5254")
, cluster2("")
, logPolicy("")
, size(1024)
, writers(1)
, totalWrites(1000)
, timeout(parseNonNegativeDuration("30s"))
{
while (true) {
static struct option longOptions[] = {
{"cluster", required_argument, NULL, 'c'},
{"cluster2", required_argument, NULL, 'C'},
{"help", no_argument, NULL, 'h'},
{"size", required_argument, NULL, 's'},
{"threads", required_argument, NULL, 't'},
{"timeout", required_argument, NULL, 'd'},
{"writes", required_argument, NULL, 'w'},
{"verbose", no_argument, NULL, 'v'},
{"verbosity", required_argument, NULL, 256},
{0, 0, 0, 0}
};
int c = getopt_long(argc, argv, "c:hs:t:w:vC:", longOptions, NULL);
// Detect the end of the options.
if (c == -1)
break;
switch (c) {
case 'c':
cluster = optarg;
break;
case 'd':
timeout = parseNonNegativeDuration(optarg);
break;
case 'h':
usage();
exit(0);
case 's':
size = uint64_t(atol(optarg));
break;
case 't':
writers = uint64_t(atol(optarg));
break;
case 'w':
totalWrites = uint64_t(atol(optarg));
break;
case 'v':
logPolicy = "VERBOSE";
break;
case 256:
logPolicy = optarg;
break;
case 'C':
cluster2 = optarg;
break;
case '?':
default:
// getopt_long already printed an error message.
usage();
exit(1);
}
}
}
void usage() {
std::cout
<< "Writes repeatedly to LogCabin. Stops once it reaches "
<< "the given number of"
<< std::endl
<< "writes or the timeout, whichever comes first."
<< std::endl
<< std::endl
<< "This program is subject to change (it is not part of "
<< "LogCabin's stable API)."
<< std::endl
<< std::endl
<< "Usage: " << argv[0] << " [options]"
<< std::endl
<< std::endl
<< "Options:"
<< std::endl
<< " -c <addresses>, --cluster=<addresses> "
<< "Network addresses of the LogCabin"
<< std::endl
<< " "
<< "servers, comma-separated"
<< std::endl
<< " "
<< "[default: 127.0.0.1:5254]"
<< std::endl
<< " -C <address>, --cluster2=<address> "
<< "second server"
<< std::endl
<< " -h, --help "
<< "Print this usage information"
<< std::endl
<< " --size <bytes> "
<< "Size of value in each write [default: 1024]"
<< std::endl
<< " --threads <num> "
<< "Number of concurrent writers [default: 1]"
<< std::endl
<< " --timeout <time> "
<< "Time after which to exit [default: 30s]"
<< std::endl
<< " --writes <num> "
<< "Number of total writes [default: 1000]"
<< std::endl
<< " -v, --verbose "
<< "Same as --verbosity=VERBOSE"
<< std::endl
<< " --verbosity=<policy> "
<< "Set which log messages are shown."
<< std::endl
<< " "
<< "Comma-separated LEVEL or PATTERN@LEVEL rules."
<< std::endl
<< " "
<< "Levels: SILENT, ERROR, WARNING, NOTICE, VERBOSE."
<< std::endl
<< " "
<< "Patterns match filename prefixes or suffixes."
<< std::endl
<< " "
<< "Example: Client@NOTICE,Test.cc@SILENT,VERBOSE."
<< std::endl;
}
int& argc;
char**& argv;
std::string cluster;
std::string cluster2;
std::string logPolicy;
uint64_t size;
uint64_t writers;
uint64_t totalWrites;
uint64_t timeout;
};
/**
* The main function for a single client thread.
* \param id
* Unique ID for this thread, counting from 0.
* \param options
* Arguments describing benchmark.
* \param tree
* Interface to LogCabin.
* \param key
* Key to write repeatedly.
* \param value
* Value to write at key repeatedly.
* \param exit
* When this becomes true, this thread should exit.
* \param[out] writesDone
* The number of writes this thread has completed.
*/
void
writeThreadMain(uint64_t id,
const OptionParser& options,
Tree tree,
const std::string& key,
const std::string& value,
std::atomic<bool>& exit,
uint64_t& writesDone)
{
uint64_t numWrites = options.totalWrites / options.writers;
// assign any odd leftover writes in a balanced way
if (options.totalWrites - numWrites * options.writers > id)
numWrites += 1;
for (uint64_t i = 0; i < numWrites; ++i) {
if (exit)
break;
uint64_t startNanos = timeNanos();
tree.writeEx(format("%s-%ld", key.c_str(), i), value);
uint64_t endNanos = timeNanos();
{
std::lock_guard<std::mutex> lock(statsMutex);
stats.push_back(endNanos - startNanos);
}
writesDone = i + 1;
}
}
/**
* Return the time since the Unix epoch in nanoseconds.
*/
uint64_t timeNanos()
{
struct timespec now;
int r = clock_gettime(CLOCK_REALTIME, &now);
assert(r == 0);
return uint64_t(now.tv_sec) * 1000 * 1000 * 1000 + uint64_t(now.tv_nsec);
}
/**
* Main function for the timer thread, whose job is to wait until a particular
* timeout elapses and then set 'exit' to true.
* \param timeout
* Seconds to wait before setting exit to true.
* \param[in,out] exit
* If this is set to true from another thread, the timer thread will exit
* soonish. Also, if the timeout elapses, the timer thread will set this
* to true and exit.
*/
void
timerThreadMain(uint64_t timeout, std::atomic<bool>& exit)
{
uint64_t start = timeNanos();
while (!exit) {
usleep(50 * 1000);
if ((timeNanos() - start) > timeout) {
exit = true;
}
}
}
void statsThreadMain(std::atomic<bool>& exit) {
uint64_t min, max, mid, dot99;
const uint64_t unit = 1000;
std::cout << std::endl << "unit is microsecond" << std::endl;
while (!exit) {
usleep(10 * 1000 * 1000);
std::cout << "stats vector size: " << stats.size() << std::endl;
{
std::lock_guard<std::mutex> lock(statsMutex);
std::sort(stats.begin(), stats.end());
min = stats.front() / unit;
max = stats.back() / unit ;
mid = stats.at(stats.size() / 2) / unit;
dot99 = stats.at(stats.size() * 99 / 100) / unit;
}
std::cout << "min: " << min
<< " max: " << max
<< " mid: " << mid
<< " .99: " << dot99
<< std::endl;
}
}
} // anonymous namespace
int
main(int argc, char** argv)
{
try {
OptionParser options(argc, argv);
LogCabin::Client::Debug::setLogPolicy(
LogCabin::Client::Debug::logPolicyFromString(
options.logPolicy));
// std::vector<Cluster> clusters;
std::vector<Tree*> trees;
std::vector<std::string> clusters_opt = split(options.cluster2, ',');
for(auto const& cluster_opt: clusters_opt) {
Cluster *cluster = new Cluster(cluster_opt);
Tree *tree = new Tree(cluster->getTree());
trees.push_back(tree);
}
Cluster cluster = Cluster(options.cluster);
Tree tree = cluster.getTree();
bool has_cluster2 = options.cluster2 == "" ? false : true;
Cluster *cluster2 = NULL;
Tree *tree2 = NULL;
if (has_cluster2) {
cluster2 = new Cluster(options.cluster2);
tree2 = new Tree(cluster2->getTree());
}
uint64_t writers_count = has_cluster2
? options.writers * 2
: options.writers;
std::string key("/bench");
std::string value(options.size, 'v');
uint64_t startNanos = timeNanos();
std::atomic<bool> exit(false);
std::vector<uint64_t> writesDonePerThread(writers_count);
uint64_t totalWritesDone = 0;
std::vector<std::thread> threads;
std::thread timer(timerThreadMain, options.timeout, std::ref(exit));
uint64_t i = 0;
for (i = 0; i < options.writers; ++i) {
threads.emplace_back(writeThreadMain, i, std::ref(options),
tree, std::ref(key), std::ref(value),
std::ref(exit),
std::ref(writesDonePerThread.at(i)));
}
std::thread statsThread(statsThreadMain, std::ref(exit));
if (has_cluster2) {
for (uint64_t i = options.writers; i < writers_count; ++i) {
threads.emplace_back(writeThreadMain, i, std::ref(options),
*tree2, std::ref(key), std::ref(value),
std::ref(exit),
std::ref(writesDonePerThread.at(i)));
}
}
for (uint64_t i = 0; i < writers_count; ++i) {
threads.at(i).join();
totalWritesDone += writesDonePerThread.at(i);
}
uint64_t endNanos = timeNanos();
exit = true;
timer.join();
statsThread.join();
tree.removeFile(key);
if (tree2) tree2->removeFile(key);
std::cout << "Benchmark took "
<< static_cast<double>(endNanos - startNanos) / 1e6
<< " ms to write "
<< totalWritesDone
<< " objects"
<< std::endl;
std::cout << "ops: "
<< static_cast<double>(totalWritesDone)
/ (static_cast<double>(endNanos - startNanos) / 1e9)
<< std::endl;
return 0;
} catch (const LogCabin::Client::Exception& e) {
std::cerr << "Exiting due to LogCabin::Client::Exception: "
<< e.what()
<< std::endl;
exit(1);
}
}
|
fix error
|
fix error
|
C++
|
isc
|
TigerZhang/logcabin,TigerZhang/logcabin,TigerZhang/logcabin,TigerZhang/logcabin
|
7c8bf80a3f75624231f8e7cc077cfdb9c9a8839d
|
src/test/unit-distribution/univariate/discrete/neg_binomial_2/neg_binomial_2_cdf_test.hpp
|
src/test/unit-distribution/univariate/discrete/neg_binomial_2/neg_binomial_2_cdf_test.hpp
|
// Arguments: Ints, Doubles, Doubles
#include <stan/prob/distributions/univariate/discrete/neg_binomial_2.hpp>
#include <boost/math/special_functions/binomial.hpp>
#include <stan/math/functions/binomial_coefficient_log.hpp>
#include <stan/math/functions/multiply_log.hpp>
using std::vector;
using std::numeric_limits;
using stan::agrad::var;
class AgradCdfNegBinomial2 : public AgradCdfTest {
public:
void valid_values(vector<vector<double> >& parameters,
vector<double>& cdf) {
vector<double> param(3);
param[0] = 3; // n
param[1] = 10; // mu
param[2] = 20; // phi
parameters.push_back(param);
cdf.push_back(0.02647526); // expected cdf
param[0] = 7; // n
param[1] = 15; // mu
param[2] = 10; // phi
parameters.push_back(param);
cdf.push_back(0.09189925); // expected cdf
param[0] = 0; // n
param[1] = 15; // mu
param[2] = 10; // phi
parameters.push_back(param);
cdf.push_back(0.0001048576); // expected ccdf
param[0] = 1; // n
param[1] = 15; // mu
param[2] = 10; // phi
parameters.push_back(param);
cdf.push_back(0.0007340032); // expected ccdf
param[0] = 0; // n
param[1] = 10; // mu
param[2] = 1; // phi
parameters.push_back(param);
cdf.push_back(0.09090909); // expected ccdf
param[0] = -1; // n
param[1] = 10; // mu
param[2] = 1; // phi
parameters.push_back(param);
cdf.push_back(0); // expected ccdf
param[0] = -89; // n
param[1] = 10; // mu
param[2] = 1; // phi
parameters.push_back(param);
cdf.push_back(0); // expected ccdf
}
void invalid_values(vector<size_t>& index,
vector<double>& value) {
// mu
index.push_back(1U);
value.push_back(-1);
// phi
index.push_back(2U);
value.push_back(-1);
}
bool has_lower_bound() {
return false;
}
bool has_upper_bound() {
return false;
}
template <typename T_n, typename T_location, typename T_precision,
typename T3, typename T4, typename T5,
typename T6, typename T7, typename T8,
typename T9>
typename stan::return_type<T_location, T_precision>::type
cdf(const T_n& n, const T_location& alpha, const T_precision& beta,
const T3&, const T4&, const T5&, const T6&, const T7&, const T8&, const T9&) {
return stan::prob::neg_binomial_2_cdf(n, alpha, beta);
}
template <typename T_n, typename T_location, typename T_precision,
typename T3, typename T4, typename T5,
typename T6, typename T7, typename T8,
typename T9>
var
cdf_function(const T_n& nn, const T_location& mu, const T_precision& phi,
const T3&, const T4&, const T5&, const T6&, const T7&, const T8&, const T9&) {
using std::log;
using std::exp;
using stan::math::binomial_coefficient_log;
using stan::math::multiply_log;
var cdf(0);
for (int n = 0; n <= nn; n++) {
var lp(0);
if (n != 0)
lp += binomial_coefficient_log<typename stan::scalar_type<T_precision>::type>
(n + phi - 1.0, n);
lp += multiply_log(n, mu) + multiply_log(phi, phi) - (n+phi)*log(mu + phi);
cdf += exp(lp);
}
return cdf;
}
};
|
// Arguments: Ints, Doubles, Doubles
#include <stan/prob/distributions/univariate/discrete/neg_binomial_2.hpp>
#include <boost/math/special_functions/binomial.hpp>
#include <stan/math/functions/binomial_coefficient_log.hpp>
#include <stan/math/functions/multiply_log.hpp>
using std::vector;
using std::numeric_limits;
using stan::agrad::var;
class AgradCdfNegBinomial2 : public AgradCdfTest {
public:
void valid_values(vector<vector<double> >& parameters,
vector<double>& cdf) {
vector<double> param(3);
param[0] = 3; // n
param[1] = 10; // mu
param[2] = 20; // phi
parameters.push_back(param);
cdf.push_back(0.02647526); // expected cdf
param[0] = 7; // n
param[1] = 15; // mu
param[2] = 10; // phi
parameters.push_back(param);
cdf.push_back(0.09189925); // expected cdf
param[0] = 0; // n
param[1] = 15; // mu
param[2] = 10; // phi
parameters.push_back(param);
cdf.push_back(0.0001048576); // expected ccdf
param[0] = 1; // n
param[1] = 15; // mu
param[2] = 10; // phi
parameters.push_back(param);
cdf.push_back(0.0007340032); // expected ccdf
param[0] = 0; // n
param[1] = 10; // mu
param[2] = 1; // phi
parameters.push_back(param);
cdf.push_back(0.09090909); // expected ccdf
param[0] = -1; // n
param[1] = 10; // mu
param[2] = 1; // phi
parameters.push_back(param);
cdf.push_back(0); // expected ccdf
param[0] = -89; // n
param[1] = 10; // mu
param[2] = 1; // phi
parameters.push_back(param);
cdf.push_back(0); // expected ccdf
}
void invalid_values(vector<size_t>& index,
vector<double>& value) {
// mu
index.push_back(1U);
value.push_back(-1);
// phi
index.push_back(2U);
value.push_back(-1);
}
bool has_lower_bound() {
return false;
}
bool has_upper_bound() {
return false;
}
template <typename T_n, typename T_location, typename T_precision,
typename T3, typename T4, typename T5>
typename stan::return_type<T_location, T_precision>::type
cdf(const T_n& n, const T_location& alpha, const T_precision& beta,
const T3&, const T4&, const T5&) {
return stan::prob::neg_binomial_2_cdf(n, alpha, beta);
}
template <typename T_n, typename T_location, typename T_precision,
typename T3, typename T4, typename T5>
typename stan::return_type<T_location, T_precision>::type
cdf_function(const T_n& nn, const T_location& mu, const T_precision& phi,
const T3&, const T4&, const T5&) {
using std::log;
using std::exp;
using stan::math::binomial_coefficient_log;
using stan::math::multiply_log;
typename stan::return_type<T_location, T_precision>::type cdf(0);
for (int n = 0; n <= nn; n++) {
typename stan::return_type<T_location, T_precision>::type lp(0);
if (n != 0)
lp += binomial_coefficient_log<typename stan::scalar_type<T_precision>::type>
(n + phi - 1.0, n);
lp += multiply_log(n, mu) + multiply_log(phi, phi) - (n+phi)*log(mu + phi);
cdf += exp(lp);
}
return cdf;
}
};
|
Update negative_binomial_2_cdf to use proper metaprogrammed return type instead of raw var
|
Update negative_binomial_2_cdf to use proper metaprogrammed return type instead of raw var
|
C++
|
bsd-3-clause
|
stan-dev/math,stan-dev/stan,stan-dev/stan,stan-dev/math,stan-dev/math,stan-dev/math,stan-dev/stan,stan-dev/math,stan-dev/math,stan-dev/stan,stan-dev/math,stan-dev/math,stan-dev/stan,stan-dev/math
|
16662549eeae842b71b052e60c5d27f4f0e13b54
|
korganizer/komailclient.cpp
|
korganizer/komailclient.cpp
|
/*
This file is part of KOrganizer.
Copyright (c) 1998 Barry D Benowitz
Copyright (c) 2001 Cornelius Schumacher <[email protected]>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
As a special exception, permission is given to link this program
with any edition of Qt, and distribute the resulting executable,
without including the source code for Qt in the source distribution.
*/
// $Id$
#include <unistd.h>
#include <stdio.h>
#include <klocale.h>
#include <kstandarddirs.h>
#include <kdebug.h>
#include <kmessagebox.h>
#include <kurl.h>
#include <kapplication.h>
#include <dcopclient.h>
#include <libkcal/event.h>
#include "version.h"
#include "koprefs.h"
#include "komailclient.h"
KOMailClient::KOMailClient()
{
}
KOMailClient::~KOMailClient()
{
}
bool KOMailClient::mailAttendees(IncidenceBase *incidence,const QString &attachment)
{
QPtrList<Attendee> attendees = incidence->attendees();
if (attendees.count() == 0) return false;
QString to;
for(uint i=0; i<attendees.count();++i) {
to += attendees.at(i)->email();
if (i != attendees.count()-1) to += ", ";
}
QString from = KOPrefs::instance()->email();
QString subject;
if(incidence->type()!="FreeBusy") {
Incidence *inc = static_cast<Incidence *>(incidence);
subject = inc->summary();
} else {
subject = "Free Busy Object";
}
QString body = createBody(incidence);
bool bcc = KOPrefs::instance()->mBcc;
return send(from,to,subject,body,bcc,attachment);
}
bool KOMailClient::mailOrganizer(IncidenceBase *incidence,const QString &attachment)
{
QString to = incidence->organizer();
QString from = KOPrefs::instance()->email();
QString subject;
if(incidence->type()!="FreeBusy") {
Incidence *inc = static_cast<Incidence *>(incidence);
subject = inc->summary();
} else {
subject = "Free Busy Message";
}
QString body = createBody(incidence);
bool bcc = KOPrefs::instance()->mBcc;
return send(from,to,subject,body,bcc,attachment);
}
bool KOMailClient::mailTo(IncidenceBase *incidence,const QString &recipients,
const QString &attachment)
{
QString from = KOPrefs::instance()->email();
QString subject;
if(incidence->type()!="FreeBusy") {
Incidence *inc = static_cast<Incidence *>(incidence);
subject = inc->summary();
} else {
subject = "Free Busy Message";
}
QString body = createBody(incidence);
bool bcc = KOPrefs::instance()->mBcc;
kdDebug () << "KOMailClient::mailTo " << recipients << endl;
return send(from,recipients,subject,body,bcc,attachment);
}
bool KOMailClient::send(const QString &from,const QString &to,
const QString &subject,const QString &body,bool bcc,
const QString &attachment)
{
kdDebug() << "KOMailClient::sendMail():\nFrom: " << from << "\nTo: " << to
<< "\nSubject: " << subject << "\nBody: \n" << body
<< "\nAttachment:\n" << attachment << endl;
if (KOPrefs::instance()->mMailClient == KOPrefs::MailClientSendmail) {
bool needHeaders = true;
QString command = KStandardDirs::findExe(QString::fromLatin1("sendmail"),
QString::fromLatin1("/sbin:/usr/sbin:/usr/lib"));
if (!command.isNull()) command += QString::fromLatin1(" -oi -t");
else {
command = KStandardDirs::findExe(QString::fromLatin1("mail"));
if (command.isNull()) return false; // give up
command.append(QString::fromLatin1(" -s \x22"));
command.append(subject);
command.append(QString::fromLatin1("\x22"));
if (bcc) {
command.append(QString::fromLatin1(" -b "));
command.append(from);
}
command.append(" ");
command.append(to);
needHeaders = false;
}
FILE * fd = popen(command.local8Bit(),"w");
if (!fd)
{
kdError() << "Unable to open a pipe to " << command << endl;
return false;
}
QString textComplete;
if (needHeaders)
{
textComplete += QString::fromLatin1("From: ") + from + '\n';
textComplete += QString::fromLatin1("To: ") + to + '\n';
if (bcc) textComplete += QString::fromLatin1("Bcc: ") + from + '\n';
textComplete += QString::fromLatin1("Subject: ") + subject + '\n';
textComplete += QString::fromLatin1("X-Mailer: KOrganizer") + korgVersion + '\n';
}
textComplete += '\n'; // end of headers
textComplete += body;
textComplete += '\n';
textComplete += attachment;
fwrite(textComplete.local8Bit(),textComplete.length(),1,fd);
pclose(fd);
} else {
if (!kapp->dcopClient()->isApplicationRegistered("kmail")) {
if (KApplication::startServiceByDesktopName("kmail")) {
KMessageBox::error(0,i18n("No running instance of KMail found."));
return false;
}
}
if (attachment.isEmpty()) {
if (!kMailOpenComposer(to,"",from,subject,body,0,KURL())) return false;
} else {
if (!kMailOpenComposer(to,"",from,subject,body,0,"cal.ics","7bit",
attachment.utf8(),"text","calendar","method","publish",
"attachment")) return false;
}
}
return true;
}
int KOMailClient::kMailOpenComposer(const QString& arg0,const QString& arg1,
const QString& arg2,const QString& arg3,const QString& arg4,int arg5,
const KURL& arg6)
{
int result = 0;
QByteArray data, replyData;
QCString replyType;
QDataStream arg( data, IO_WriteOnly );
arg << arg0;
arg << arg1;
arg << arg2;
arg << arg3;
arg << arg4;
arg << arg5;
arg << arg6;
if (kapp->dcopClient()->call("kmail","KMailIface","openComposer(QString,QString,QString,QString,QString,int,KURL)", data, replyType, replyData ) ) {
if ( replyType == "int" ) {
QDataStream _reply_stream( replyData, IO_ReadOnly );
_reply_stream >> result;
} else {
kdDebug() << "kMailOpenComposer() call failed." << endl;
}
} else {
kdDebug() << "kMailOpenComposer() call failed." << endl;
}
return result;
}
int KOMailClient::kMailOpenComposer( const QString& arg0, const QString& arg1,
const QString& arg2, const QString& arg3,
const QString& arg4, int arg5, const QString& arg6,
const QCString& arg7, const QCString& arg8,
const QCString& arg9, const QCString& arg10,
const QCString& arg11, const QString& arg12,
const QCString& arg13 )
{
int result = 0;
QByteArray data, replyData;
QCString replyType;
QDataStream arg( data, IO_WriteOnly );
arg << arg0;
arg << arg1;
arg << arg2;
arg << arg3;
arg << arg4;
arg << arg5;
arg << arg6;
arg << arg7;
arg << arg8;
arg << arg9;
arg << arg10;
arg << arg11;
arg << arg12;
arg << arg13;
if ( kapp->dcopClient()->call("kmail","KMailIface","openComposer(QString,QString,QString,QString,QString,int,QString,QCString,QCString,QCString,QCString,QCString,QString,QCString)", data, replyType, replyData ) ) {
if ( replyType == "int" ) {
QDataStream _reply_stream( replyData, IO_ReadOnly );
_reply_stream >> result;
} else {
kdDebug() << "kMailOpenComposer() call failed." << endl;
}
} else {
kdDebug() << "kMailOpenComposer() call failed." << endl;
}
return result;
}
QString KOMailClient::createBody(IncidenceBase *incidence)
{
QString CR = ("\n");
QString body;
if (incidence->type()=="Event") {
Event *selectedEvent = static_cast<Event *>(incidence);
QString recurrence[]= {"None","Daily","Weekly","Monthly Same Day",
"Monthly Same Position","Yearly","Yearly"};
if (selectedEvent->organizer() != "") {
body += i18n("Organizer: %1").arg(selectedEvent->organizer());
body += CR;
}
body += i18n("Summary: %1").arg(selectedEvent->summary());
if (!selectedEvent->doesFloat()) {
body += CR;
body += i18n("Start Date: %1").arg(selectedEvent->dtStartDateStr());
body += CR;
body += i18n("Start Time: %1").arg(selectedEvent->dtStartTimeStr());
body += CR;
if (selectedEvent->recurrence()->doesRecur()) {
body += i18n("Recurs: %1")
.arg(recurrence[selectedEvent->recurrence()->frequency()]);
body += CR;
if (selectedEvent->recurrence()->duration() > 0 ) {
body += i18n ("Repeats %1 times")
.arg(QString::number(selectedEvent->recurrence()->duration()));
body += CR;
} else {
if (selectedEvent->recurrence()->duration() != -1) {
body += i18n("End Date: %1")
.arg(selectedEvent->recurrence()->endDateStr());
body += CR;
} else {
body += i18n("Repeats forever");
body += CR;
}
}
}
body += i18n("End Time: %1").arg(selectedEvent->dtEndTimeStr());
body += CR;
QString details = selectedEvent->description();
if (!details.isEmpty()) {
body += i18n("Details:");
body += CR;
body += details;
}
}
}
if(incidence->type()=="FreeBusy") {
body = i18n("This is a Free Busy Object");
}
if(incidence->type()=="ToDo" || incidence->type()=="Journal") {
Incidence *inc = static_cast<Incidence *>(incidence);
body = inc->summary();
body += CR;
body += inc->description();
}
return body;
}
|
/*
This file is part of KOrganizer.
Copyright (c) 1998 Barry D Benowitz
Copyright (c) 2001 Cornelius Schumacher <[email protected]>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
As a special exception, permission is given to link this program
with any edition of Qt, and distribute the resulting executable,
without including the source code for Qt in the source distribution.
*/
// $Id$
#include <unistd.h>
#include <stdio.h>
#include <klocale.h>
#include <kstandarddirs.h>
#include <kdebug.h>
#include <kmessagebox.h>
#include <kurl.h>
#include <kapplication.h>
#include <dcopclient.h>
#include <libkcal/event.h>
#include "version.h"
#include "koprefs.h"
#include "komailclient.h"
KOMailClient::KOMailClient()
{
}
KOMailClient::~KOMailClient()
{
}
bool KOMailClient::mailAttendees(IncidenceBase *incidence,const QString &attachment)
{
QPtrList<Attendee> attendees = incidence->attendees();
if (attendees.count() == 0) return false;
QString to;
for(uint i=0; i<attendees.count();++i) {
to += attendees.at(i)->email();
if (i != attendees.count()-1) to += ", ";
}
QString from = KOPrefs::instance()->email();
QString subject;
if(incidence->type()!="FreeBusy") {
Incidence *inc = static_cast<Incidence *>(incidence);
subject = inc->summary();
} else {
subject = "Free Busy Object";
}
QString body = createBody(incidence);
bool bcc = KOPrefs::instance()->mBcc;
return send(from,to,subject,body,bcc,attachment);
}
bool KOMailClient::mailOrganizer(IncidenceBase *incidence,const QString &attachment)
{
QString to = incidence->organizer();
QString from = KOPrefs::instance()->email();
QString subject;
if(incidence->type()!="FreeBusy") {
Incidence *inc = static_cast<Incidence *>(incidence);
subject = inc->summary();
} else {
subject = "Free Busy Message";
}
QString body = createBody(incidence);
bool bcc = KOPrefs::instance()->mBcc;
return send(from,to,subject,body,bcc,attachment);
}
bool KOMailClient::mailTo(IncidenceBase *incidence,const QString &recipients,
const QString &attachment)
{
QString from = KOPrefs::instance()->email();
QString subject;
if(incidence->type()!="FreeBusy") {
Incidence *inc = static_cast<Incidence *>(incidence);
subject = inc->summary();
} else {
subject = "Free Busy Message";
}
QString body = createBody(incidence);
bool bcc = KOPrefs::instance()->mBcc;
kdDebug () << "KOMailClient::mailTo " << recipients << endl;
return send(from,recipients,subject,body,bcc,attachment);
}
bool KOMailClient::send(const QString &from,const QString &to,
const QString &subject,const QString &body,bool bcc,
const QString &attachment)
{
kdDebug() << "KOMailClient::sendMail():\nFrom: " << from << "\nTo: " << to
<< "\nSubject: " << subject << "\nBody: \n" << body
<< "\nAttachment:\n" << attachment << endl;
if (KOPrefs::instance()->mMailClient == KOPrefs::MailClientSendmail) {
bool needHeaders = true;
QString command = KStandardDirs::findExe(QString::fromLatin1("sendmail"),
QString::fromLatin1("/sbin:/usr/sbin:/usr/lib"));
if (!command.isNull()) command += QString::fromLatin1(" -oi -t");
else {
command = KStandardDirs::findExe(QString::fromLatin1("mail"));
if (command.isNull()) return false; // give up
command.append(QString::fromLatin1(" -s \x22"));
command.append(subject);
command.append(QString::fromLatin1("\x22"));
if (bcc) {
command.append(QString::fromLatin1(" -b "));
command.append(from);
}
command.append(" ");
command.append(to);
needHeaders = false;
}
FILE * fd = popen(command.local8Bit(),"w");
if (!fd)
{
kdError() << "Unable to open a pipe to " << command << endl;
return false;
}
QString textComplete;
if (needHeaders)
{
textComplete += QString::fromLatin1("From: ") + from + '\n';
textComplete += QString::fromLatin1("To: ") + to + '\n';
if (bcc) textComplete += QString::fromLatin1("Bcc: ") + from + '\n';
textComplete += QString::fromLatin1("Subject: ") + subject + '\n';
textComplete += QString::fromLatin1("X-Mailer: KOrganizer") + korgVersion + '\n';
}
textComplete += '\n'; // end of headers
textComplete += body;
textComplete += '\n';
textComplete += attachment;
fwrite(textComplete.local8Bit(),textComplete.length(),1,fd);
pclose(fd);
} else {
if (!kapp->dcopClient()->isApplicationRegistered("kmail")) {
if (KApplication::startServiceByDesktopName("kmail")) {
KMessageBox::error(0,i18n("No running instance of KMail found."));
return false;
}
}
if (attachment.isEmpty()) {
if (!kMailOpenComposer(to,"",from,subject,body,0,KURL())) return false;
} else {
if (!kMailOpenComposer(to,"",from,subject,body,0,"cal.ics","7bit",
attachment.utf8(),"text","calendar","method","publish",
"attachment")) return false;
}
}
return true;
}
int KOMailClient::kMailOpenComposer(const QString& arg0,const QString& arg1,
const QString& arg2,const QString& arg3,const QString& arg4,int arg5,
const KURL& arg6)
{
int result = 0;
QByteArray data, replyData;
QCString replyType;
QDataStream arg( data, IO_WriteOnly );
arg << arg0;
arg << arg1;
arg << arg2;
arg << arg3;
arg << arg4;
arg << arg5;
arg << arg6;
if (kapp->dcopClient()->call("kmail","KMailIface","openComposer(QString,QString,QString,QString,QString,int,KURL)", data, replyType, replyData ) ) {
if ( replyType == "int" ) {
QDataStream _reply_stream( replyData, IO_ReadOnly );
_reply_stream >> result;
} else {
kdDebug() << "kMailOpenComposer() call failed." << endl;
}
} else {
kdDebug() << "kMailOpenComposer() call failed." << endl;
}
return result;
}
int KOMailClient::kMailOpenComposer( const QString& arg0, const QString& arg1,
const QString& arg2, const QString& arg3,
const QString& arg4, int arg5, const QString& arg6,
const QCString& arg7, const QCString& arg8,
const QCString& arg9, const QCString& arg10,
const QCString& arg11, const QString& arg12,
const QCString& arg13 )
{
int result = 0;
QByteArray data, replyData;
QCString replyType;
QDataStream arg( data, IO_WriteOnly );
arg << arg0;
arg << arg1;
arg << arg2;
arg << arg3;
arg << arg4;
arg << arg5;
arg << arg6;
arg << arg7;
arg << arg8;
arg << arg9;
arg << arg10;
arg << arg11;
arg << arg12;
arg << arg13;
if ( kapp->dcopClient()->call("kmail","KMailIface","openComposer(QString,QString,QString,QString,QString,int,QString,QCString,QCString,QCString,QCString,QCString,QString,QCString)", data, replyType, replyData ) ) {
if ( replyType == "int" ) {
QDataStream _reply_stream( replyData, IO_ReadOnly );
_reply_stream >> result;
} else {
kdDebug() << "kMailOpenComposer() call failed." << endl;
}
} else {
kdDebug() << "kMailOpenComposer() call failed." << endl;
}
return result;
}
QString KOMailClient::createBody(IncidenceBase *incidence)
{
QString CR = ("\n");
QString body;
if (incidence->type()=="Event") {
Event *selectedEvent = static_cast<Event *>(incidence);
QString recurrence[]= {"None","Daily","Weekly","Monthly Same Day",
"Monthly Same Position","Yearly","Yearly"};
if (selectedEvent->organizer() != "") {
body += i18n("Organizer: %1").arg(selectedEvent->organizer());
body += CR;
}
body += i18n("Summary: %1").arg(selectedEvent->summary());
if (!selectedEvent->location().isEmpty()) {
body += CR;
body += i18n("Location: %1").arg(selectedEvent->location());
}
if (!selectedEvent->doesFloat()) {
body += CR;
body += i18n("Start Date: %1").arg(selectedEvent->dtStartDateStr());
body += CR;
body += i18n("Start Time: %1").arg(selectedEvent->dtStartTimeStr());
body += CR;
if (selectedEvent->recurrence()->doesRecur()) {
body += i18n("Recurs: %1")
.arg(recurrence[selectedEvent->recurrence()->frequency()]);
body += CR;
if (selectedEvent->recurrence()->duration() > 0 ) {
body += i18n ("Repeats %1 times")
.arg(QString::number(selectedEvent->recurrence()->duration()));
body += CR;
} else {
if (selectedEvent->recurrence()->duration() != -1) {
body += i18n("End Date: %1")
.arg(selectedEvent->recurrence()->endDateStr());
body += CR;
} else {
body += i18n("Repeats forever");
body += CR;
}
}
}
body += i18n("End Time: %1").arg(selectedEvent->dtEndTimeStr());
body += CR;
QString details = selectedEvent->description();
if (!details.isEmpty()) {
body += i18n("Details:");
body += CR;
body += details;
}
}
}
if(incidence->type()=="FreeBusy") {
body = i18n("This is a Free Busy Object");
}
if(incidence->type()=="ToDo" || incidence->type()=="Journal") {
Incidence *inc = static_cast<Incidence *>(incidence);
body = inc->summary();
body += CR;
body += inc->description();
}
return body;
}
|
write loaction into mail-body
|
write loaction into mail-body
svn path=/trunk/kdepim/; revision=157596
|
C++
|
lgpl-2.1
|
lefou/kdepim-noakonadi,lefou/kdepim-noakonadi,lefou/kdepim-noakonadi,lefou/kdepim-noakonadi,lefou/kdepim-noakonadi,lefou/kdepim-noakonadi
|
4d48603926845950ab46173aeaf963061a887efb
|
content/shell/shell_browser_main.cc
|
content/shell/shell_browser_main.cc
|
// Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "content/shell/shell_browser_main.h"
#include <iostream>
#include "base/command_line.h"
#include "base/file_path.h"
#include "base/file_util.h"
#include "base/logging.h"
#include "base/memory/scoped_ptr.h"
#include "base/threading/thread_restrictions.h"
#include "content/public/browser/browser_main_runner.h"
#include "content/shell/shell_switches.h"
#include "content/shell/webkit_test_runner_host.h"
#include "net/base/net_util.h"
#include "webkit/support/webkit_support.h"
namespace {
GURL GetURLForLayoutTest(const char* test_name,
bool* enable_pixel_dumping,
std::string* expected_pixel_hash) {
// A test name is formated like file:///path/to/test'--pixel-test'pixelhash
std::string path_or_url = test_name;
std::string pixel_switch;
std::string pixel_hash;
std::string::size_type separator_position = path_or_url.find('\'');
if (separator_position != std::string::npos) {
pixel_switch = path_or_url.substr(separator_position + 1);
path_or_url.erase(separator_position);
}
separator_position = pixel_switch.find('\'');
if (separator_position != std::string::npos) {
pixel_hash = pixel_switch.substr(separator_position + 1);
pixel_switch.erase(separator_position);
}
if (enable_pixel_dumping) {
*enable_pixel_dumping =
(pixel_switch == "--pixel-test" || pixel_switch == "-p");
}
if (expected_pixel_hash)
*expected_pixel_hash = pixel_hash;
GURL test_url(path_or_url);
if (!(test_url.is_valid() && test_url.has_scheme()))
test_url = net::FilePathToFileURL(FilePath(path_or_url));
FilePath local_path;
if (net::FileURLToFilePath(test_url, &local_path)) {
// We're outside of the message loop here, and this is a test.
base::ThreadRestrictions::ScopedAllowIO allow_io;
file_util::SetCurrentDirectory(local_path.DirName());
}
return test_url;
}
} // namespace
// Main routine for running as the Browser process.
int ShellBrowserMain(const content::MainFunctionParams& parameters) {
scoped_ptr<content::BrowserMainRunner> main_runner_(
content::BrowserMainRunner::Create());
int exit_code = main_runner_->Initialize(parameters);
if (exit_code >= 0)
return exit_code;
if (CommandLine::ForCurrentProcess()->HasSwitch(
switches::kCheckLayoutTestSysDeps)) {
return 0;
}
bool layout_test_mode =
CommandLine::ForCurrentProcess()->HasSwitch(switches::kDumpRenderTree);
if (layout_test_mode) {
content::WebKitTestController test_controller;
char test_string[2048];
#if defined(OS_ANDROID)
std::cout << "#READY\n";
std::cout.flush();
#endif
while (fgets(test_string, sizeof(test_string), stdin)) {
char *new_line_position = strchr(test_string, '\n');
if (new_line_position)
*new_line_position = '\0';
if (test_string[0] == '\0')
continue;
if (!strcmp(test_string, "QUIT"))
break;
bool enable_pixel_dumps;
std::string pixel_hash;
GURL test_url = GetURLForLayoutTest(
test_string, &enable_pixel_dumps, &pixel_hash);
if (!content::WebKitTestController::Get()->PrepareForLayoutTest(
test_url, enable_pixel_dumps, pixel_hash)) {
break;
}
main_runner_->Run();
if (!content::WebKitTestController::Get()->ResetAfterLayoutTest())
break;
}
exit_code = 0;
} else {
exit_code = main_runner_->Run();
}
main_runner_->Shutdown();
return exit_code;
}
|
// Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "content/shell/shell_browser_main.h"
#include <iostream>
#include "base/command_line.h"
#include "base/logging.h"
#include "base/memory/scoped_ptr.h"
#include "base/threading/thread_restrictions.h"
#include "content/public/browser/browser_main_runner.h"
#include "content/shell/shell_switches.h"
#include "content/shell/webkit_test_runner_host.h"
#include "webkit/support/webkit_support.h"
namespace {
GURL GetURLForLayoutTest(const char* test_name,
bool* enable_pixel_dumping,
std::string* expected_pixel_hash) {
// A test name is formated like file:///path/to/test'--pixel-test'pixelhash
std::string path_or_url = test_name;
std::string pixel_switch;
std::string pixel_hash;
std::string::size_type separator_position = path_or_url.find('\'');
if (separator_position != std::string::npos) {
pixel_switch = path_or_url.substr(separator_position + 1);
path_or_url.erase(separator_position);
}
separator_position = pixel_switch.find('\'');
if (separator_position != std::string::npos) {
pixel_hash = pixel_switch.substr(separator_position + 1);
pixel_switch.erase(separator_position);
}
if (enable_pixel_dumping) {
*enable_pixel_dumping =
(pixel_switch == "--pixel-test" || pixel_switch == "-p");
}
if (expected_pixel_hash)
*expected_pixel_hash = pixel_hash;
GURL test_url = webkit_support::CreateURLForPathOrURL(path_or_url);
{
// We're outside of the message loop here, and this is a test.
base::ThreadRestrictions::ScopedAllowIO allow_io;
webkit_support::SetCurrentDirectoryForFileURL(test_url);
}
return test_url;
}
} // namespace
// Main routine for running as the Browser process.
int ShellBrowserMain(const content::MainFunctionParams& parameters) {
scoped_ptr<content::BrowserMainRunner> main_runner_(
content::BrowserMainRunner::Create());
int exit_code = main_runner_->Initialize(parameters);
if (exit_code >= 0)
return exit_code;
if (CommandLine::ForCurrentProcess()->HasSwitch(
switches::kCheckLayoutTestSysDeps)) {
return 0;
}
bool layout_test_mode =
CommandLine::ForCurrentProcess()->HasSwitch(switches::kDumpRenderTree);
if (layout_test_mode) {
content::WebKitTestController test_controller;
char test_string[2048];
#if defined(OS_ANDROID)
std::cout << "#READY\n";
std::cout.flush();
#endif
while (fgets(test_string, sizeof(test_string), stdin)) {
char *new_line_position = strchr(test_string, '\n');
if (new_line_position)
*new_line_position = '\0';
if (test_string[0] == '\0')
continue;
if (!strcmp(test_string, "QUIT"))
break;
bool enable_pixel_dumps;
std::string pixel_hash;
GURL test_url = GetURLForLayoutTest(
test_string, &enable_pixel_dumps, &pixel_hash);
if (!content::WebKitTestController::Get()->PrepareForLayoutTest(
test_url, enable_pixel_dumps, pixel_hash)) {
break;
}
main_runner_->Run();
if (!content::WebKitTestController::Get()->ResetAfterLayoutTest())
break;
}
exit_code = 0;
} else {
exit_code = main_runner_->Run();
}
main_runner_->Shutdown();
return exit_code;
}
|
Revert 161839 - [content shell] don't use webkit_support functions to manipulate URLs
|
Revert 161839 - [content shell] don't use webkit_support functions to manipulate URLs
In single-process mode, WebKit isn't yet initialized before we start a renderer,
so we can't pass around WebURLs
BUG=111316
TEST=content_shell --dump-render-tree --single-process doesn't crash
Review URL: https://codereview.chromium.org/11151007
[email protected]
Review URL: https://codereview.chromium.org/11143013
git-svn-id: de016e52bd170d2d4f2344f9bf92d50478b649e0@161844 0039d316-1c4b-4281-b951-d872f2087c98
|
C++
|
bsd-3-clause
|
fujunwei/chromium-crosswalk,mohamed--abdel-maksoud/chromium.src,ltilve/chromium,anirudhSK/chromium,chuan9/chromium-crosswalk,TheTypoMaster/chromium-crosswalk,Pluto-tv/chromium-crosswalk,ondra-novak/chromium.src,Just-D/chromium-1,krieger-od/nwjs_chromium.src,zcbenz/cefode-chromium,mogoweb/chromium-crosswalk,nacl-webkit/chrome_deps,bright-sparks/chromium-spacewalk,bright-sparks/chromium-spacewalk,pozdnyakov/chromium-crosswalk,dednal/chromium.src,ChromiumWebApps/chromium,Just-D/chromium-1,M4sse/chromium.src,pozdnyakov/chromium-crosswalk,anirudhSK/chromium,krieger-od/nwjs_chromium.src,M4sse/chromium.src,ondra-novak/chromium.src,mohamed--abdel-maksoud/chromium.src,jaruba/chromium.src,crosswalk-project/chromium-crosswalk-efl,Chilledheart/chromium,chuan9/chromium-crosswalk,mogoweb/chromium-crosswalk,hujiajie/pa-chromium,anirudhSK/chromium,TheTypoMaster/chromium-crosswalk,M4sse/chromium.src,crosswalk-project/chromium-crosswalk-efl,junmin-zhu/chromium-rivertrail,patrickm/chromium.src,M4sse/chromium.src,dednal/chromium.src,ondra-novak/chromium.src,ChromiumWebApps/chromium,dednal/chromium.src,M4sse/chromium.src,Chilledheart/chromium,ondra-novak/chromium.src,dushu1203/chromium.src,nacl-webkit/chrome_deps,M4sse/chromium.src,pozdnyakov/chromium-crosswalk,ltilve/chromium,ChromiumWebApps/chromium,littlstar/chromium.src,anirudhSK/chromium,TheTypoMaster/chromium-crosswalk,Fireblend/chromium-crosswalk,anirudhSK/chromium,Fireblend/chromium-crosswalk,timopulkkinen/BubbleFish,PeterWangIntel/chromium-crosswalk,mohamed--abdel-maksoud/chromium.src,dushu1203/chromium.src,jaruba/chromium.src,pozdnyakov/chromium-crosswalk,ChromiumWebApps/chromium,Pluto-tv/chromium-crosswalk,chuan9/chromium-crosswalk,dednal/chromium.src,TheTypoMaster/chromium-crosswalk,dushu1203/chromium.src,dednal/chromium.src,junmin-zhu/chromium-rivertrail,ChromiumWebApps/chromium,nacl-webkit/chrome_deps,chuan9/chromium-crosswalk,Just-D/chromium-1,zcbenz/cefode-chromium,jaruba/chromium.src,zcbenz/cefode-chromium,dednal/chromium.src,bright-sparks/chromium-spacewalk,PeterWangIntel/chromium-crosswalk,mogoweb/chromium-crosswalk,zcbenz/cefode-chromium,patrickm/chromium.src,TheTypoMaster/chromium-crosswalk,Fireblend/chromium-crosswalk,patrickm/chromium.src,hujiajie/pa-chromium,littlstar/chromium.src,PeterWangIntel/chromium-crosswalk,anirudhSK/chromium,PeterWangIntel/chromium-crosswalk,patrickm/chromium.src,hujiajie/pa-chromium,hujiajie/pa-chromium,markYoungH/chromium.src,Fireblend/chromium-crosswalk,mohamed--abdel-maksoud/chromium.src,dushu1203/chromium.src,Pluto-tv/chromium-crosswalk,anirudhSK/chromium,dushu1203/chromium.src,dushu1203/chromium.src,hujiajie/pa-chromium,Chilledheart/chromium,jaruba/chromium.src,markYoungH/chromium.src,markYoungH/chromium.src,markYoungH/chromium.src,axinging/chromium-crosswalk,markYoungH/chromium.src,ltilve/chromium,chuan9/chromium-crosswalk,fujunwei/chromium-crosswalk,M4sse/chromium.src,mogoweb/chromium-crosswalk,hgl888/chromium-crosswalk-efl,markYoungH/chromium.src,Just-D/chromium-1,patrickm/chromium.src,markYoungH/chromium.src,Jonekee/chromium.src,fujunwei/chromium-crosswalk,bright-sparks/chromium-spacewalk,ltilve/chromium,timopulkkinen/BubbleFish,anirudhSK/chromium,Pluto-tv/chromium-crosswalk,markYoungH/chromium.src,dednal/chromium.src,Just-D/chromium-1,hgl888/chromium-crosswalk-efl,Jonekee/chromium.src,anirudhSK/chromium,ondra-novak/chromium.src,junmin-zhu/chromium-rivertrail,Pluto-tv/chromium-crosswalk,pozdnyakov/chromium-crosswalk,pozdnyakov/chromium-crosswalk,axinging/chromium-crosswalk,littlstar/chromium.src,hgl888/chromium-crosswalk,dednal/chromium.src,ondra-novak/chromium.src,anirudhSK/chromium,hgl888/chromium-crosswalk-efl,Jonekee/chromium.src,Jonekee/chromium.src,mohamed--abdel-maksoud/chromium.src,krieger-od/nwjs_chromium.src,PeterWangIntel/chromium-crosswalk,hujiajie/pa-chromium,zcbenz/cefode-chromium,patrickm/chromium.src,mogoweb/chromium-crosswalk,Pluto-tv/chromium-crosswalk,jaruba/chromium.src,ChromiumWebApps/chromium,chuan9/chromium-crosswalk,mogoweb/chromium-crosswalk,Jonekee/chromium.src,junmin-zhu/chromium-rivertrail,junmin-zhu/chromium-rivertrail,junmin-zhu/chromium-rivertrail,jaruba/chromium.src,pozdnyakov/chromium-crosswalk,bright-sparks/chromium-spacewalk,hgl888/chromium-crosswalk,hgl888/chromium-crosswalk,ChromiumWebApps/chromium,Just-D/chromium-1,littlstar/chromium.src,crosswalk-project/chromium-crosswalk-efl,hujiajie/pa-chromium,junmin-zhu/chromium-rivertrail,mohamed--abdel-maksoud/chromium.src,krieger-od/nwjs_chromium.src,M4sse/chromium.src,dednal/chromium.src,bright-sparks/chromium-spacewalk,dushu1203/chromium.src,krieger-od/nwjs_chromium.src,Fireblend/chromium-crosswalk,Chilledheart/chromium,hgl888/chromium-crosswalk,anirudhSK/chromium,jaruba/chromium.src,ltilve/chromium,zcbenz/cefode-chromium,PeterWangIntel/chromium-crosswalk,bright-sparks/chromium-spacewalk,zcbenz/cefode-chromium,Chilledheart/chromium,Chilledheart/chromium,zcbenz/cefode-chromium,crosswalk-project/chromium-crosswalk-efl,pozdnyakov/chromium-crosswalk,timopulkkinen/BubbleFish,jaruba/chromium.src,Jonekee/chromium.src,patrickm/chromium.src,Jonekee/chromium.src,Fireblend/chromium-crosswalk,hgl888/chromium-crosswalk,Just-D/chromium-1,fujunwei/chromium-crosswalk,krieger-od/nwjs_chromium.src,TheTypoMaster/chromium-crosswalk,hgl888/chromium-crosswalk-efl,timopulkkinen/BubbleFish,axinging/chromium-crosswalk,Just-D/chromium-1,timopulkkinen/BubbleFish,ChromiumWebApps/chromium,crosswalk-project/chromium-crosswalk-efl,ChromiumWebApps/chromium,bright-sparks/chromium-spacewalk,hgl888/chromium-crosswalk,fujunwei/chromium-crosswalk,M4sse/chromium.src,krieger-od/nwjs_chromium.src,anirudhSK/chromium,patrickm/chromium.src,krieger-od/nwjs_chromium.src,dushu1203/chromium.src,hgl888/chromium-crosswalk-efl,chuan9/chromium-crosswalk,zcbenz/cefode-chromium,fujunwei/chromium-crosswalk,timopulkkinen/BubbleFish,pozdnyakov/chromium-crosswalk,ondra-novak/chromium.src,krieger-od/nwjs_chromium.src,axinging/chromium-crosswalk,mohamed--abdel-maksoud/chromium.src,ltilve/chromium,markYoungH/chromium.src,M4sse/chromium.src,hujiajie/pa-chromium,Jonekee/chromium.src,littlstar/chromium.src,hgl888/chromium-crosswalk,hujiajie/pa-chromium,Jonekee/chromium.src,PeterWangIntel/chromium-crosswalk,axinging/chromium-crosswalk,chuan9/chromium-crosswalk,hgl888/chromium-crosswalk,jaruba/chromium.src,axinging/chromium-crosswalk,dushu1203/chromium.src,hgl888/chromium-crosswalk-efl,crosswalk-project/chromium-crosswalk-efl,Just-D/chromium-1,bright-sparks/chromium-spacewalk,mohamed--abdel-maksoud/chromium.src,timopulkkinen/BubbleFish,chuan9/chromium-crosswalk,littlstar/chromium.src,Fireblend/chromium-crosswalk,nacl-webkit/chrome_deps,dednal/chromium.src,PeterWangIntel/chromium-crosswalk,hgl888/chromium-crosswalk-efl,hgl888/chromium-crosswalk-efl,pozdnyakov/chromium-crosswalk,crosswalk-project/chromium-crosswalk-efl,M4sse/chromium.src,dushu1203/chromium.src,Chilledheart/chromium,Chilledheart/chromium,nacl-webkit/chrome_deps,mogoweb/chromium-crosswalk,TheTypoMaster/chromium-crosswalk,crosswalk-project/chromium-crosswalk-efl,timopulkkinen/BubbleFish,PeterWangIntel/chromium-crosswalk,hgl888/chromium-crosswalk,ondra-novak/chromium.src,zcbenz/cefode-chromium,ChromiumWebApps/chromium,Pluto-tv/chromium-crosswalk,Fireblend/chromium-crosswalk,Pluto-tv/chromium-crosswalk,Jonekee/chromium.src,krieger-od/nwjs_chromium.src,junmin-zhu/chromium-rivertrail,axinging/chromium-crosswalk,hgl888/chromium-crosswalk-efl,hujiajie/pa-chromium,axinging/chromium-crosswalk,Fireblend/chromium-crosswalk,junmin-zhu/chromium-rivertrail,TheTypoMaster/chromium-crosswalk,TheTypoMaster/chromium-crosswalk,hujiajie/pa-chromium,ChromiumWebApps/chromium,fujunwei/chromium-crosswalk,mohamed--abdel-maksoud/chromium.src,fujunwei/chromium-crosswalk,junmin-zhu/chromium-rivertrail,nacl-webkit/chrome_deps,zcbenz/cefode-chromium,jaruba/chromium.src,timopulkkinen/BubbleFish,nacl-webkit/chrome_deps,nacl-webkit/chrome_deps,littlstar/chromium.src,patrickm/chromium.src,axinging/chromium-crosswalk,axinging/chromium-crosswalk,markYoungH/chromium.src,timopulkkinen/BubbleFish,littlstar/chromium.src,krieger-od/nwjs_chromium.src,jaruba/chromium.src,nacl-webkit/chrome_deps,ltilve/chromium,mogoweb/chromium-crosswalk,nacl-webkit/chrome_deps,timopulkkinen/BubbleFish,axinging/chromium-crosswalk,hgl888/chromium-crosswalk-efl,fujunwei/chromium-crosswalk,mohamed--abdel-maksoud/chromium.src,mohamed--abdel-maksoud/chromium.src,mogoweb/chromium-crosswalk,markYoungH/chromium.src,ondra-novak/chromium.src,dednal/chromium.src,ChromiumWebApps/chromium,ltilve/chromium,crosswalk-project/chromium-crosswalk-efl,pozdnyakov/chromium-crosswalk,nacl-webkit/chrome_deps,ltilve/chromium,Pluto-tv/chromium-crosswalk,junmin-zhu/chromium-rivertrail,dushu1203/chromium.src,mogoweb/chromium-crosswalk,Jonekee/chromium.src,Chilledheart/chromium
|
8b0d95a552f7e426e96e368987d749091f784387
|
prolog.cpp
|
prolog.cpp
|
#include"prolog.hpp"
using namespace std;
struct expression_parser;
template <typename Range>
int parse(Range const &r, program& prog) {
decltype(parser)::result_type a {};
typename Range::iterator i = r.first;
inherited_attributes st(prog.names);
profile<expression_parser> p;
if (parser(i, r, &prog.db, &st)) {
cout << "OK" << endl;
} else {
cout << "FAIL" << endl;
}
return i - r.first;
}
//----------------------------------------------------------------------------
// The stream_range allows file iterators to be used like random_iterators
// and abstracts the difference between C++ stdlib streams and file_vectors.
int main(int const argc, char const *argv[]) {
if (argc < 1) {
cerr << "no input files" << endl;
} else {
for (int i = 1; i < argc; ++i) {
profile<expression_parser>::reset();
stream_range in(argv[i]);
cout << argv[i] << endl;
program prog;
int const chars_read = parse(in, prog);
cout << prog << endl;
//double const mb_per_s = static_cast<double>(chars_read) / static_cast<double>(profile<expression_parser>::report());
//cout << "parsed: " << mb_per_s << "MB/s" << endl;
}
}
}
|
#include"prolog.hpp"
using namespace std;
struct expression_parser;
template <typename Range>
int parse(Range const &r, program& prog) {
decltype(parser)::result_type a {};
typename Range::iterator i = r.first;
inherited_attributes st(prog.names);
profile<expression_parser> p;
if (parser(i, r, &prog.db, &st)) {
cout << "OK" << endl;
} else {
cout << "FAIL" << endl;
}
return i - r.first;
}
//----------------------------------------------------------------------------
// The stream_range allows file iterators to be used like random_iterators
// and abstracts the difference between C++ stdlib streams and file_vectors.
int main(int const argc, char const *argv[]) {
if (argc < 1) {
cerr << "no input files" << endl;
} else {
for (int i = 1; i < argc; ++i) {
profile<expression_parser>::reset();
stream_range in(argv[i]);
cout << argv[i] << endl;
program prog;
int const chars_read = parse(in, prog);
cout << prog << endl;
double const mb_per_s = static_cast<double>(chars_read) / static_cast<double>(profile<expression_parser>::report());
cout << "parsed: " << mb_per_s << "MB/s" << endl;
}
}
}
|
add back timing
|
add back timing
|
C++
|
mit
|
keean/Parser-Combinators,seckcoder/Parser-Combinators
|
94cf345b33f2a5ce7434421c86bdb39534cf70dd
|
src/asp/Sessions/tests/TestStereoSessionDG.cxx
|
src/asp/Sessions/tests/TestStereoSessionDG.cxx
|
// __BEGIN_LICENSE__
// Copyright (c) 2009-2013, United States Government as represented by the
// Administrator of the National Aeronautics and Space Administration. All
// rights reserved.
//
// The NGT platform is licensed 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.
// __END_LICENSE__
#include <asp/Sessions/DG/StereoSessionDG.h>
#include <asp/Sessions/DG/XML.h>
#include <asp/Sessions/RPC/RPCModel.h>
#include <boost/scoped_ptr.hpp>
#include <test/Helpers.h>
#include <vw/Stereo/StereoModel.h>
#include <vw/Cartography/GeoTransform.h>
using namespace vw;
using namespace asp;
using namespace xercesc;
using namespace vw::test;
TEST(StereoSessionDG, XMLReading) {
XMLPlatformUtils::Initialize();
GeometricXML geo;
AttitudeXML att;
EphemerisXML eph;
ImageXML img;
RPCXML rpc;
EXPECT_FALSE( geo.is_good() );
EXPECT_FALSE( att.is_good() );
EXPECT_FALSE( eph.is_good() );
EXPECT_FALSE( img.is_good() );
EXPECT_FALSE( rpc.is_good() );
read_xml( "dg_example1.xml", geo, att, eph, img, rpc );
EXPECT_TRUE( geo.is_good() );
EXPECT_TRUE( att.is_good() );
EXPECT_TRUE( eph.is_good() );
EXPECT_TRUE( img.is_good() );
EXPECT_TRUE( rpc.is_good() );
// Checking GEO
EXPECT_NEAR( 7949.165, geo.principal_distance, 1e-6 );
EXPECT_EQ( 0, geo.optical_polyorder );
EXPECT_VECTOR_NEAR( Vector3(), geo.perspective_center, 1e-6 );
EXPECT_NEAR( 0, geo.camera_attitude.x(), 1e-6 );
EXPECT_NEAR( 1, geo.camera_attitude.w(), 1e-6 );
EXPECT_VECTOR_NEAR( Vector2(.05372,140.71193), geo.detector_origin, 1e-6 );
EXPECT_NEAR( 0, geo.detector_rotation, 1e-6 );
EXPECT_NEAR( .008, geo.detector_pixel_pitch, 1e-6 );
// Checking ATT
EXPECT_FALSE( att.start_time.empty() );
EXPECT_NEAR( .02, att.time_interval, 1e-6 );
EXPECT_EQ( 840, att.quat_vec.size() );
EXPECT_EQ( 840, att.covariance_vec.size() );
for ( size_t i = 0; i < 840; i++ ) {
EXPECT_NE( 0, att.quat_vec[i].w() );
EXPECT_NE( 0, att.covariance_vec[i][5] );
}
EXPECT_VECTOR_NEAR( Vector3(3.72e-12, 3.51e-12, 1.12e-13),
subvector(att.covariance_vec[0],0,3), 1e-20 );
// Checking EPH
EXPECT_FALSE( eph.start_time.empty() );
EXPECT_NEAR( .02, eph.time_interval, 1e-6 );
EXPECT_EQ( 840, eph.position_vec.size() );
EXPECT_EQ( 840, eph.velocity_vec.size() );
EXPECT_EQ( 840, eph.covariance_vec.size() );
for ( size_t i = 0; i < 840; i++ ) {
EXPECT_NE( 0, eph.position_vec[i].x() ) << i;
EXPECT_NE( 0, eph.velocity_vec[i].x() );
EXPECT_NE( 0, eph.covariance_vec[i][3] );
}
EXPECT_VECTOR_NEAR( Vector3(-1.150529111070304e+06,
-4.900037170821411e+06,
4.673402253879593e+06),
eph.position_vec[0], 1e-6 );
// Checking IMG
EXPECT_FALSE( img.tlc_start_time.empty() );
EXPECT_FALSE( img.first_line_start_time.empty() );
EXPECT_EQ( 2, img.tlc_vec.size() );
EXPECT_NEAR( 0, img.tlc_vec[0].first, 1e-8 );
EXPECT_NEAR( 0, img.tlc_vec[0].second, 1e-8 );
EXPECT_NEAR( 23708, img.tlc_vec[1].first, 1e-8 );
EXPECT_NEAR( 1.975667, img.tlc_vec[1].second, 1e-8 );
EXPECT_EQ( 23708, img.image_size.y() );
EXPECT_EQ( 35170, img.image_size.x() );
XMLPlatformUtils::Terminate();
}
TEST(StereoSessionDG, CreateCamera) {
StereoSessionDG session;
boost::shared_ptr<camera::CameraModel> cam1( session.camera_model("", "dg_example1.xml") ),
cam2( session.camera_model("", "dg_example2.xml") );
ASSERT_TRUE( cam1.get() != 0 );
ASSERT_TRUE( cam2.get() != 0 );
Vector2 m1(13864, 5351), m2(15045, 5183);
m1 *= 2; m2 *= 2;
stereo::StereoModel sm(cam1.get(), cam2.get());
double error;
Vector3 pos = sm(m1,m2,error);
EXPECT_LT( error, 5.0 ); // Triangulation should be better than 5 meters.
EXPECT_LT( norm_2(pos), norm_2(cam1->camera_center(m1)) ); // Point should be below camera.
// Verify that projection back into the camera hits the right
// spot. It will slightly be wrong due to the above triangulation
// error.
EXPECT_VECTOR_NEAR( m1, cam1->point_to_pixel( pos ), 4 );
EXPECT_VECTOR_NEAR( m2, cam2->point_to_pixel( pos ), 4 );
// A more accurate test is just to project out and back into the
// same camera
for ( size_t i = 0; i < 30000; i += 500 ) {
for ( size_t j = 0; j < 24000; j += 500 ) {
EXPECT_VECTOR_NEAR( Vector2(i,j),
cam1->point_to_pixel( cam1->camera_center(Vector2(i,j)) +
2e4 * cam1->pixel_to_vector( Vector2(i,j) ) ),
1e-1 /*pixels*/);
}
}
// Create a camera that only has a single TLC entry. It will throw
// an error in the event that first line time and TLC entry lookup
// don't agree. That should be good enough for a test.
EXPECT_NO_THROW( boost::shared_ptr<camera::CameraModel> cam3( session.camera_model("", "dg_example3.xml") ) );
}
TEST(StereoSessionDG, ReadRPC) {
XMLPlatformUtils::Initialize();
RPCXML xml;
EXPECT_FALSE( xml.is_good() );
xml.read_from_file( "dg_example1.xml" );
EXPECT_TRUE( xml.is_good() );
EXPECT_VECTOR_NEAR( Vector2(17564,11856), xml.rpc_ptr()->xy_offset(), 1e-6 );
EXPECT_VECTOR_NEAR( Vector2(17927,12384), xml.rpc_ptr()->xy_scale(), 1e-6 );
EXPECT_VECTOR_NEAR( Vector3(-105.2903,39.7454,2281), xml.rpc_ptr()->lonlatheight_offset(), 1e-6 );
EXPECT_VECTOR_NEAR( Vector3(.1345,.1003,637), xml.rpc_ptr()->lonlatheight_scale(), 1e-6 );
EXPECT_NEAR( 4.683662e-3, xml.rpc_ptr()->line_num_coeff()[0], 1e-6 );
EXPECT_NEAR( 4.395393e-6, xml.rpc_ptr()->line_num_coeff()[19], 1e-6 );
EXPECT_NEAR( 1, xml.rpc_ptr()->line_den_coeff()[0], 1e-6 );
EXPECT_NEAR( -3.71156e-8, xml.rpc_ptr()->line_den_coeff()[19], 1e-6 );
EXPECT_NEAR( -7.306375e-3, xml.rpc_ptr()->sample_num_coeff()[0], 1e-6 );
EXPECT_NEAR( -1.585929e-6, xml.rpc_ptr()->sample_num_coeff()[19], 1e-6 );
EXPECT_NEAR( 1, xml.rpc_ptr()->sample_den_coeff()[0], 1e-6 );
EXPECT_NEAR( -1.211995e-7, xml.rpc_ptr()->sample_den_coeff()[19], 1e-6 );
}
TEST(StereoSessionDG, ProjectRPC) {
XMLPlatformUtils::Initialize();
// Read the RPC
RPCXML xml;
xml.read_from_file( "dg_example1.xml" );
boost::scoped_ptr<RPCModel> rpc_model( new RPCModel(*xml.rpc_ptr()) );
// Read the Digital Globe camera model
StereoSessionDG session;
boost::shared_ptr<camera::CameraModel> dg_model( session.camera_model("", "dg_example1.xml") );
// Verify the measurement between the two cameras
cartography::Datum datum("WGS84");
// This should be 0,0
Vector3 xyz = datum.geodetic_to_cartesian( Vector3(-105.42399,39.833107,2595.9) );
EXPECT_VECTOR_NEAR( rpc_model->point_to_pixel( xyz ),
dg_model->point_to_pixel( xyz ), 25 );
// This should be 35170, 0
xyz = datum.geodetic_to_cartesian( Vector3(-105.35823,39.842179,2441.3) );
EXPECT_VECTOR_NEAR( rpc_model->point_to_pixel( xyz ),
dg_model->point_to_pixel( xyz ), 25 );
// This should be 35170, 23708
xyz = datum.geodetic_to_cartesian( Vector3(-105.35795,39.803541,2612.6) );
EXPECT_VECTOR_NEAR( rpc_model->point_to_pixel( xyz ),
dg_model->point_to_pixel( xyz ), 25 );
// This should be 0, 23708
xyz = datum.geodetic_to_cartesian( Vector3(-105.42418,39.793464,2801.8) );
EXPECT_VECTOR_NEAR( rpc_model->point_to_pixel( xyz ),
dg_model->point_to_pixel( xyz ), 25 );
}
|
// __BEGIN_LICENSE__
// Copyright (c) 2009-2013, United States Government as represented by the
// Administrator of the National Aeronautics and Space Administration. All
// rights reserved.
//
// The NGT platform is licensed 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.
// __END_LICENSE__
#include <asp/Sessions/DG/StereoSessionDG.h>
#include <asp/Sessions/DG/XML.h>
#include <asp/Sessions/RPC/RPCModel.h>
#include <boost/scoped_ptr.hpp>
#include <test/Helpers.h>
#include <vw/Stereo/StereoModel.h>
#include <vw/Cartography/GeoTransform.h>
using namespace vw;
using namespace asp;
using namespace xercesc;
using namespace vw::test;
TEST(StereoSessionDG, XMLReading) {
XMLPlatformUtils::Initialize();
GeometricXML geo;
AttitudeXML att;
EphemerisXML eph;
ImageXML img;
RPCXML rpc;
EXPECT_FALSE( geo.is_good() );
EXPECT_FALSE( att.is_good() );
EXPECT_FALSE( eph.is_good() );
EXPECT_FALSE( img.is_good() );
EXPECT_FALSE( rpc.is_good() );
read_xml( "dg_example1.xml", geo, att, eph, img, rpc );
EXPECT_TRUE( geo.is_good() );
EXPECT_TRUE( att.is_good() );
EXPECT_TRUE( eph.is_good() );
EXPECT_TRUE( img.is_good() );
EXPECT_TRUE( rpc.is_good() );
// Checking GEO
EXPECT_NEAR( 7949.165, geo.principal_distance, 1e-6 );
EXPECT_EQ( 0, geo.optical_polyorder );
EXPECT_VECTOR_NEAR( Vector3(), geo.perspective_center, 1e-6 );
EXPECT_NEAR( 0, geo.camera_attitude.x(), 1e-6 );
EXPECT_NEAR( 1, geo.camera_attitude.w(), 1e-6 );
EXPECT_VECTOR_NEAR( Vector2(.05372,140.71193), geo.detector_origin, 1e-6 );
EXPECT_NEAR( 0, geo.detector_rotation, 1e-6 );
EXPECT_NEAR( .008, geo.detector_pixel_pitch, 1e-6 );
// Checking ATT
EXPECT_FALSE( att.start_time.empty() );
EXPECT_NEAR( .02, att.time_interval, 1e-6 );
EXPECT_EQ( 840, att.quat_vec.size() );
EXPECT_EQ( 840, att.covariance_vec.size() );
for ( size_t i = 0; i < 840; i++ ) {
EXPECT_NE( 0, att.quat_vec[i].w() );
EXPECT_NE( 0, att.covariance_vec[i][5] );
}
EXPECT_VECTOR_NEAR( Vector3(3.72e-12, 3.51e-12, 1.12e-13),
subvector(att.covariance_vec[0],0,3), 1e-20 );
// Checking EPH
EXPECT_FALSE( eph.start_time.empty() );
EXPECT_NEAR( .02, eph.time_interval, 1e-6 );
EXPECT_EQ( 840, eph.position_vec.size() );
EXPECT_EQ( 840, eph.velocity_vec.size() );
EXPECT_EQ( 840, eph.covariance_vec.size() );
for ( size_t i = 0; i < 840; i++ ) {
EXPECT_NE( 0, eph.position_vec[i].x() ) << i;
EXPECT_NE( 0, eph.velocity_vec[i].x() );
EXPECT_NE( 0, eph.covariance_vec[i][3] );
}
EXPECT_VECTOR_NEAR( Vector3(-1.150529111070304e+06,
-4.900037170821411e+06,
4.673402253879593e+06),
eph.position_vec[0], 1e-6 );
// Checking IMG
EXPECT_FALSE( img.tlc_start_time.empty() );
EXPECT_FALSE( img.first_line_start_time.empty() );
EXPECT_EQ( 2, img.tlc_vec.size() );
EXPECT_NEAR( 0, img.tlc_vec[0].first, 1e-8 );
EXPECT_NEAR( 0, img.tlc_vec[0].second, 1e-8 );
EXPECT_NEAR( 23708, img.tlc_vec[1].first, 1e-8 );
EXPECT_NEAR( 1.975667, img.tlc_vec[1].second, 1e-8 );
EXPECT_EQ( 23708, img.image_size.y() );
EXPECT_EQ( 35170, img.image_size.x() );
XMLPlatformUtils::Terminate();
}
TEST(StereoSessionDG, CreateCamera) {
StereoSessionDG session;
boost::shared_ptr<camera::CameraModel> cam1( session.camera_model("", "dg_example1.xml") ),
cam2( session.camera_model("", "dg_example2.xml") );
ASSERT_TRUE( cam1.get() != 0 );
ASSERT_TRUE( cam2.get() != 0 );
Vector2 m1(13864, 5351), m2(15045, 5183);
m1 *= 2; m2 *= 2;
stereo::StereoModel sm(cam1.get(), cam2.get());
double error;
Vector3 pos = sm(m1,m2,error);
EXPECT_LT( error, 5.0 ); // Triangulation should be better than 5 meters.
EXPECT_LT( norm_2(pos), norm_2(cam1->camera_center(m1)) ); // Point should be below camera.
// Verify that projection back into the camera hits the right
// spot. It will slightly be wrong due to the above triangulation
// error.
#if __GNUC__
#if __x86_64__ || __ppc64__
EXPECT_VECTOR_NEAR( m1, cam1->point_to_pixel( pos ), 4 );
EXPECT_VECTOR_NEAR( m2, cam2->point_to_pixel( pos ), 4 );
#else
EXPECT_VECTOR_NEAR( m1, cam1->point_to_pixel( pos ), 9 );
EXPECT_VECTOR_NEAR( m2, cam2->point_to_pixel( pos ), 25 );
#endif
#endif
// A more accurate test is just to project out and back into the
// same camera
for ( size_t i = 0; i < 30000; i += 500 ) {
for ( size_t j = 0; j < 24000; j += 500 ) {
EXPECT_VECTOR_NEAR( Vector2(i,j),
cam1->point_to_pixel( cam1->camera_center(Vector2(i,j)) +
2e4 * cam1->pixel_to_vector( Vector2(i,j) ) ),
1e-1 /*pixels*/);
}
}
// Create a camera that only has a single TLC entry. It will throw
// an error in the event that first line time and TLC entry lookup
// don't agree. That should be good enough for a test.
EXPECT_NO_THROW( boost::shared_ptr<camera::CameraModel> cam3( session.camera_model("", "dg_example3.xml") ) );
}
TEST(StereoSessionDG, ReadRPC) {
XMLPlatformUtils::Initialize();
RPCXML xml;
EXPECT_FALSE( xml.is_good() );
xml.read_from_file( "dg_example1.xml" );
EXPECT_TRUE( xml.is_good() );
EXPECT_VECTOR_NEAR( Vector2(17564,11856), xml.rpc_ptr()->xy_offset(), 1e-6 );
EXPECT_VECTOR_NEAR( Vector2(17927,12384), xml.rpc_ptr()->xy_scale(), 1e-6 );
EXPECT_VECTOR_NEAR( Vector3(-105.2903,39.7454,2281), xml.rpc_ptr()->lonlatheight_offset(), 1e-6 );
EXPECT_VECTOR_NEAR( Vector3(.1345,.1003,637), xml.rpc_ptr()->lonlatheight_scale(), 1e-6 );
EXPECT_NEAR( 4.683662e-3, xml.rpc_ptr()->line_num_coeff()[0], 1e-6 );
EXPECT_NEAR( 4.395393e-6, xml.rpc_ptr()->line_num_coeff()[19], 1e-6 );
EXPECT_NEAR( 1, xml.rpc_ptr()->line_den_coeff()[0], 1e-6 );
EXPECT_NEAR( -3.71156e-8, xml.rpc_ptr()->line_den_coeff()[19], 1e-6 );
EXPECT_NEAR( -7.306375e-3, xml.rpc_ptr()->sample_num_coeff()[0], 1e-6 );
EXPECT_NEAR( -1.585929e-6, xml.rpc_ptr()->sample_num_coeff()[19], 1e-6 );
EXPECT_NEAR( 1, xml.rpc_ptr()->sample_den_coeff()[0], 1e-6 );
EXPECT_NEAR( -1.211995e-7, xml.rpc_ptr()->sample_den_coeff()[19], 1e-6 );
}
TEST(StereoSessionDG, ProjectRPC) {
XMLPlatformUtils::Initialize();
// Read the RPC
RPCXML xml;
xml.read_from_file( "dg_example1.xml" );
boost::scoped_ptr<RPCModel> rpc_model( new RPCModel(*xml.rpc_ptr()) );
// Read the Digital Globe camera model
StereoSessionDG session;
boost::shared_ptr<camera::CameraModel> dg_model( session.camera_model("", "dg_example1.xml") );
// Verify the measurement between the two cameras
cartography::Datum datum("WGS84");
// This should be 0,0
Vector3 xyz = datum.geodetic_to_cartesian( Vector3(-105.42399,39.833107,2595.9) );
EXPECT_VECTOR_NEAR( rpc_model->point_to_pixel( xyz ),
dg_model->point_to_pixel( xyz ), 25 );
// This should be 35170, 0
xyz = datum.geodetic_to_cartesian( Vector3(-105.35823,39.842179,2441.3) );
EXPECT_VECTOR_NEAR( rpc_model->point_to_pixel( xyz ),
dg_model->point_to_pixel( xyz ), 25 );
// This should be 35170, 23708
xyz = datum.geodetic_to_cartesian( Vector3(-105.35795,39.803541,2612.6) );
EXPECT_VECTOR_NEAR( rpc_model->point_to_pixel( xyz ),
dg_model->point_to_pixel( xyz ), 25 );
// This should be 0, 23708
xyz = datum.geodetic_to_cartesian( Vector3(-105.42418,39.793464,2801.8) );
EXPECT_VECTOR_NEAR( rpc_model->point_to_pixel( xyz ),
dg_model->point_to_pixel( xyz ), 25 );
}
|
Make it pass on 32 bit
|
TestStereoSessionDG.cxx: Make it pass on 32 bit
|
C++
|
apache-2.0
|
ScottMcMichael/StereoPipeline,oleg-alexandrov/StereoPipeline,oleg-alexandrov/StereoPipeline,NeoGeographyToolkit/StereoPipeline,DougFirErickson/StereoPipeline,aaronknister/StereoPipeline,NeoGeographyToolkit/StereoPipeline,oleg-alexandrov/StereoPipeline,njwilson23/StereoPipeline,DougFirErickson/StereoPipeline,njwilson23/StereoPipeline,aaronknister/StereoPipeline,NeoGeographyToolkit/StereoPipeline,njwilson23/StereoPipeline,ScottMcMichael/StereoPipeline,aaronknister/StereoPipeline,ScottMcMichael/StereoPipeline,ScottMcMichael/StereoPipeline,oleg-alexandrov/StereoPipeline,NeoGeographyToolkit/StereoPipeline,njwilson23/StereoPipeline,NeoGeographyToolkit/StereoPipeline,ScottMcMichael/StereoPipeline,DougFirErickson/StereoPipeline,njwilson23/StereoPipeline,aaronknister/StereoPipeline,aaronknister/StereoPipeline,DougFirErickson/StereoPipeline,njwilson23/StereoPipeline,NeoGeographyToolkit/StereoPipeline,oleg-alexandrov/StereoPipeline,oleg-alexandrov/StereoPipeline,DougFirErickson/StereoPipeline,DougFirErickson/StereoPipeline,ScottMcMichael/StereoPipeline
|
ca349712f4ba072b96c5013a48b6011aebc2c9f8
|
src/ompl/extensions/ode/src/ODEEnvironment.cpp
|
src/ompl/extensions/ode/src/ODEEnvironment.cpp
|
/*********************************************************************
* Software License Agreement (BSD License)
*
* Copyright (c) 2010, Rice University
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
* * Neither the name of the Rice University nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*********************************************************************/
/* Author: Ioan Sucan */
#include "ompl/extensions/ode/ODEEnvironment.h"
#include <boost/lexical_cast.hpp>
unsigned int ompl::control::ODEEnvironment::getMaxContacts(dGeomID geom1, dGeomID geom2) const
{
return maxContacts_;
}
bool ompl::control::ODEEnvironment::isValidCollision(dGeomID geom1, dGeomID geom2, const dContact& contact) const
{
return false;
}
void ompl::control::ODEEnvironment::setupContact(dGeomID geom1, dGeomID geom2, dContact &contact) const
{
contact.surface.mode = dContactBounce | dContactSoftCFM;
contact.surface.mu = 0.1;
contact.surface.mu2 = 0;
contact.surface.bounce = 0.01;
contact.surface.bounce_vel = 0.001;
contact.surface.soft_cfm = 0.01;
}
std::string ompl::control::ODEEnvironment::getGeomName(dGeomID geom) const
{
std::map<dGeomID, std::string>::const_iterator it = geomNames_.find(geom);
if (it == geomNames_.end())
return boost::lexical_cast<std::string>(geom);
else
return it->second;
}
void ompl::control::ODEEnvironment::setGeomName(dGeomID geom, const std::string &name)
{
geomNames_[geom] = name;
}
|
/*********************************************************************
* Software License Agreement (BSD License)
*
* Copyright (c) 2010, Rice University
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
* * Neither the name of the Rice University nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*********************************************************************/
/* Author: Ioan Sucan */
#include "ompl/extensions/ode/ODEEnvironment.h"
#include <boost/lexical_cast.hpp>
unsigned int ompl::control::ODEEnvironment::getMaxContacts(dGeomID geom1, dGeomID geom2) const
{
return maxContacts_;
}
bool ompl::control::ODEEnvironment::isValidCollision(dGeomID geom1, dGeomID geom2, const dContact& contact) const
{
return false;
}
void ompl::control::ODEEnvironment::setupContact(dGeomID geom1, dGeomID geom2, dContact &contact) const
{
contact.surface.mode = dContactBounce | dContactSoftCFM;
contact.surface.mu = 0.1;
contact.surface.mu2 = 0;
contact.surface.bounce = 0.01;
contact.surface.bounce_vel = 0.001;
contact.surface.soft_cfm = 0.01;
}
std::string ompl::control::ODEEnvironment::getGeomName(dGeomID geom) const
{
std::map<dGeomID, std::string>::const_iterator it = geomNames_.find(geom);
if (it == geomNames_.end())
return boost::lexical_cast<std::string>(reinterpret_cast<unsigned long>(geom));
else
return it->second;
}
void ompl::control::ODEEnvironment::setGeomName(dGeomID geom, const std::string &name)
{
geomNames_[geom] = name;
}
|
fix for boost 1.48
|
fix for boost 1.48
|
C++
|
bsd-3-clause
|
sonny-tarbouriech/ompl,jvgomez/ompl,davetcoleman/ompl,davetcoleman/ompl,florianhauer/ompl,davetcoleman/ompl,utiasASRL/batch-informed-trees,davetcoleman/ompl,florianhauer/ompl,davetcoleman/ompl,utiasASRL/batch-informed-trees,sonny-tarbouriech/ompl,florianhauer/ompl,jvgomez/ompl,jvgomez/ompl,sonny-tarbouriech/ompl,sonny-tarbouriech/ompl,utiasASRL/batch-informed-trees,jvgomez/ompl,florianhauer/ompl,florianhauer/ompl,jvgomez/ompl,utiasASRL/batch-informed-trees,davetcoleman/ompl,sonny-tarbouriech/ompl,florianhauer/ompl,utiasASRL/batch-informed-trees,utiasASRL/batch-informed-trees,jvgomez/ompl,sonny-tarbouriech/ompl
|
f74ec706b29f65c85eb0b121ef67c9b1aa955be2
|
pyMOOS.cpp
|
pyMOOS.cpp
|
#include <boost/python.hpp>
#include <boost/python/suite/indexing/vector_indexing_suite.hpp>
#include "MOOS/libMOOS/Comms/MOOSMsg.h"
#include "MOOS/libMOOS/Comms/MOOSCommClient.h"
#include "MOOS/libMOOS/Comms/MOOSAsyncCommClient.h"
#include <exception>
namespace bp = boost::python;
struct pyMOOSException : std::exception
{
pyMOOSException(){s_="boo";};
virtual ~pyMOOSException() throw(){};
pyMOOSException(const std::string & s) :s_(s){}
char const* what() const throw() { return s_.c_str(); return "lala";/*return s_.c_str();*/ }
std::string s_;
};
void MOOSExceptionTranslator(const pyMOOSException & e)
{
// Use the Python 'C' API to set up an exception object
PyErr_SetString(PyExc_RuntimeError, e.what());
}
namespace MOOS
{
class AsyncCommsWrapper : public MOOS::MOOSAsyncCommClient
{
private:
typedef MOOSAsyncCommClient BASE;
public:
bool Run(const std::string & sServer, int Port, const std::string & sMyName)
{
return BASE::Run(sServer,Port,sMyName,0);//Comms Tick not used in Async version
}
std::vector<CMOOSMsg> FetchMailAsVector()
{
std::vector<CMOOSMsg> v;
MOOSMSG_LIST M;
if(Fetch(M))
{
std::copy(M.begin(),M.end(),std::back_inserter(v));
}
return v;
}
bool NotifyBinary(const std::string& sKey,const std::string & sData, double dfTime)
{
CMOOSMsg M(MOOS_NOTIFY,sKey, sData.size(),(void *) sData.data(), dfTime);
return BASE::Post( M );
}
static bool on_connect_delegate(void * pParam)
{
MOOS::AsyncCommsWrapper * pMe = static_cast<MOOS::AsyncCommsWrapper*> (pParam);
return pMe->on_connect();
}
bool SetOnConnectCallback(bp::object func)
{
BASE:SetOnConnectCallBack(on_connect_delegate,this);
on_connect_object_ = func;
return true;
}
bool on_connect()
{
bool bResult=false;
PyGILState_STATE gstate = PyGILState_Ensure();
try
{
bp::object result = on_connect_object_();
bResult = bp::extract<bool>(result);
}
catch (const bp::error_already_set& e)
{
PyGILState_Release(gstate);
throw pyMOOSException("OnConnect:: caught an exception thrown in python callback");
}
PyGILState_Release(gstate);
return bResult;
}
bool SetOnMailCallback(bp::object func)
{
BASE:SetOnMailCallBack(on_mail_delegate,this);
on_mail_object_ = func;
return true;
}
static bool on_mail_delegate(void * pParam)
{
MOOS::AsyncCommsWrapper * pMe = static_cast<MOOS::AsyncCommsWrapper*> (pParam);
return pMe->on_mail();
}
bool on_mail()
{
bool bResult=false;
PyGILState_STATE gstate = PyGILState_Ensure();
try
{
bp::object result = on_mail_object_();
bResult = bp::extract<bool>(result);
}
catch (const bp::error_already_set& e)
{
PyGILState_Release(gstate);
throw pyMOOSException("OnMail:: caught an exception thrown in python callback");
}
PyGILState_Release(gstate);
return bResult;
}
static bool active_queue_delegate(CMOOSMsg & M, void* pParam)
{
MeAndQueue * maq = static_cast<MeAndQueue*> (pParam);
return maq->me_->OnQueue(M,maq->queue_name_);
}
bool OnQueue(CMOOSMsg & M, const std::string & sQueueName)
{
std::map<std::string, MeAndQueue*>::iterator q ;
{
MOOS::ScopedLock L(queue_api_lock_);
q = active_queue_details_.find(sQueueName);
if(q==active_queue_details_.end())
return false;
}
bool bResult=false;
PyGILState_STATE gstate = PyGILState_Ensure();
try
{
bp::object result = q->second->func_(M);
bResult = bp::extract<bool>(result);
}
catch (const bp::error_already_set& e)
{
PyGILState_Release(gstate);
throw pyMOOSException("ActiveQueue:: caught an exception thrown in python callback");
}
PyGILState_Release(gstate);
return bResult;
}
virtual bool AddActiveQueue(const std::string & sQueueName,
bp::object func)
{
MOOS::ScopedLock L(queue_api_lock_);
MeAndQueue* maq = new MeAndQueue;
maq->me_=this;
maq->queue_name_=sQueueName;
maq->func_=func;
std::cerr<<"adding active queue OK\n";
active_queue_details_[sQueueName]=maq;
return BASE::AddActiveQueue(sQueueName,active_queue_delegate,maq);
}
struct MeAndQueue
{
AsyncCommsWrapper* me_;
std::string queue_name_;
bp::object func_;
};
private:
bp::object on_connect_object_;
bp::object on_mail_object_;
std::map<std::string, MeAndQueue*> active_queue_details_;
CMOOSLock queue_api_lock_;
};
};
typedef std::vector<CMOOSMsg> MsgVector;
typedef std::vector<MOOS::ClientCommsStatus> CommsStatusVector;
BOOST_PYTHON_MEMBER_FUNCTION_OVERLOADS(f_overloads, f, 1, 2);
BOOST_PYTHON_FUNCTION_OVERLOADS(time_overloads, MOOSTime, 0, 1);
BOOST_PYTHON_MEMBER_FUNCTION_OVERLOADS(notify_overloads_2_3, Notify, 2,3);
BOOST_PYTHON_MEMBER_FUNCTION_OVERLOADS(notify_overloads_3_4, Notify, 3,4);
BOOST_PYTHON_MODULE(pymoos)
{
PyEval_InitThreads();
bp::class_<CMOOSMsg>("moos_msg")
.def("time", &CMOOSMsg::GetTime)
.def("trace", &CMOOSMsg::Trace)
.def("name", &CMOOSMsg::GetKey)
.def("key", &CMOOSMsg::GetKey)
.def("is_name", &CMOOSMsg::IsName)
.def("is_double", &CMOOSMsg::IsDouble)
.def("double", &CMOOSMsg::GetDouble)
.def("double_aux", &CMOOSMsg::GetDoubleAux)
.def("is_string", &CMOOSMsg::IsString)
.def("string", &CMOOSMsg::GetString)
.def("is_binary", &CMOOSMsg::IsBinary)
.def("binary_data",&CMOOSMsg::GetString)
.def("binary_data_size", &CMOOSMsg::GetBinaryDataSize)
.def("mark_as_binary", &CMOOSMsg::MarkAsBinary)
;
bp::class_<MsgVector>("moos_msg_list")
.def(bp::vector_indexing_suite<MsgVector>() )
;
bp::class_<MOOS::ClientCommsStatus>("moos_comms_status")
.def("appraise", &MOOS::ClientCommsStatus::Appraise)
.def("print", &MOOS::ClientCommsStatus::Write)
;
bp::class_<CommsStatusVector>("moos_comms_status_list")
.def(bp::vector_indexing_suite<CommsStatusVector>() )
;
bp::class_<CMOOSCommObject >("base_comms_object",bp::no_init);
bp::class_<CMOOSCommClient, bp::bases<CMOOSCommObject>, boost::noncopyable >("base_sync_comms",bp::no_init)
.def("register", static_cast< bool (CMOOSCommClient::*)(const std::string& ,double) > (&CMOOSCommClient::Register))
.def("register", static_cast< bool (CMOOSCommClient::*)(const std::string&,const std::string&,double) > (&CMOOSCommClient::Register))
.def("is_registered_for", &CMOOSCommClient::IsRegisteredFor)
.def("notify", static_cast< bool (CMOOSCommClient::*)(const std::string&,const std::string&,double) > (&CMOOSCommClient::Notify),notify_overloads_2_3())
.def("notify", static_cast< bool (CMOOSCommClient::*)(const std::string&,const std::string&,const std::string&,double) > (&CMOOSCommClient::Notify),notify_overloads_2_3())
.def("notify", static_cast< bool (CMOOSCommClient::*)(const std::string&,const char *,double) > (&CMOOSCommClient::Notify))
.def("notify", static_cast< bool (CMOOSCommClient::*)(const std::string&,const char *,const std::string&,double) > (&CMOOSCommClient::Notify))
.def("notify", static_cast< bool (CMOOSCommClient::*)(const std::string&,double,double) > (&CMOOSCommClient::Notify))
.def("notify", static_cast< bool (CMOOSCommClient::*)(const std::string&,double,const std::string&,double) > (&CMOOSCommClient::Notify))
.def("get_community_name", &CMOOSCommClient::GetCommunityName)
.def("get_moos_name", &CMOOSCommClient::GetMOOSName)
.def("close", &CMOOSCommClient::Close)
.def("get_published", &CMOOSCommClient::GetPublished)
.def("get_registered", &CMOOSCommClient::GetRegistered)
.def("get_description", &CMOOSCommClient::GetDescription)
.def("is_running", &CMOOSCommClient::IsRunning)
.def("is_asynchronous", &CMOOSCommClient::IsAsynchronous)
.def("is_connected", &CMOOSCommClient::IsConnected)
.def("wait_until_connected", &CMOOSCommClient::WaitUntilConnected)
.def("get_number_of_unread_messages", &CMOOSCommClient::GetNumberOfUnreadMessages)
.def("get_number_of_unsent_messages", &CMOOSCommClient::GetNumberOfUnsentMessages)
.def("get_number_bytes_sent", &CMOOSCommClient::GetNumBytesSent)
.def("get_number_bytes_read", &CMOOSCommClient::GetNumBytesReceived)
.def("get_number_messages_sent", &CMOOSCommClient::GetNumMsgsSent)
.def("get_number_message_read", &CMOOSCommClient::GetNumMsgsReceived)
.def("set_comms_control_timewarp_scale_factor", &CMOOSCommClient::SetCommsControlTimeWarpScaleFactor)
.def("get_comms_control_timewarp_scale_factor", &CMOOSCommClient::GetCommsControlTimeWarpScaleFactor)
.def("do_local_time_correction", &CMOOSCommClient::DoLocalTimeCorrection)
.def("set_verbose_debug", &CMOOSCommClient::SetVerboseDebug)
.def("set_comms_tick", &CMOOSCommClient::SetCommsTick)
.def("set_quiet", &CMOOSCommClient::SetQuiet)
.def("enable_comms_status_monitoring", &CMOOSCommClient::EnableCommsStatusMonitoring)
.def("get_client_comms_status", &CMOOSCommClient::GetClientCommsStatus)
.def("get_client_comms_statuses", &CMOOSCommClient::GetClientCommsStatuses)
;
bp::class_<MOOS::MOOSAsyncCommClient, bp::bases<CMOOSCommClient>, boost::noncopyable >("base_async_comms",bp::no_init)
.def("run", &MOOS::MOOSAsyncCommClient::Run)
;
//this is the one to use
bp::class_<MOOS::AsyncCommsWrapper, bp::bases<MOOS::MOOSAsyncCommClient>, boost::noncopyable >("comms")
.def("run", &MOOS::AsyncCommsWrapper::Run)
.def("fetch", &MOOS::AsyncCommsWrapper::FetchMailAsVector)
.def("set_on_connect_callback", &MOOS::AsyncCommsWrapper::SetOnConnectCallback)
.def("set_on_mail_callback", &MOOS::AsyncCommsWrapper::SetOnMailCallback)
.def("notify_binary", &MOOS::AsyncCommsWrapper::NotifyBinary)
.def("add_active_queue", &MOOS::AsyncCommsWrapper::AddActiveQueue)
.def("remove_message_route_to_active_queue",&MOOS::AsyncCommsWrapper::RemoveMessageRouteToActiveQueue)
.def("remove_active_queue",&MOOS::AsyncCommsWrapper::RemoveActiveQueue)
.def("has_active_queue",&MOOS::AsyncCommsWrapper::HasActiveQueue)
.def("print_message_to_active_queue_routing",&MOOS::AsyncCommsWrapper::PrintMessageToActiveQueueRouting)
.def("add_message_route_to_active_queue",
static_cast< bool (CMOOSCommClient::*)(const std::string & ,const std::string & ) >
(&MOOS::AsyncCommsWrapper::AddMessageRouteToActiveQueue))
;
bp::def("time",&MOOSTime,time_overloads());
bp::def("local_time",&MOOSLocalTime,time_overloads());
bp::def("is_little_end_in",&IsLittleEndian);
bp::register_exception_translator<pyMOOSException>(&MOOSExceptionTranslator);
}
|
#include <exception>
#include "MOOS/libMOOS/Comms/MOOSMsg.h"
#include "MOOS/libMOOS/Comms/MOOSCommClient.h"
#include "MOOS/libMOOS/Comms/MOOSAsyncCommClient.h"
#include <boost/python.hpp>
#include <boost/python/suite/indexing/vector_indexing_suite.hpp>
typedef std::vector<CMOOSMsg> MsgVector;
typedef std::vector<MOOS::ClientCommsStatus> CommsStatusVector;
namespace bp = boost::python;
struct pyMOOSException : std::exception {
pyMOOSException() {
}
;
virtual ~pyMOOSException() throw () {
}
;
pyMOOSException(const std::string & s) :
s_(s) {
}
char const* what() const throw () {
return s_.c_str();
return "lala";/*return s_.c_str();*/
}
std::string s_;
};
void MOOSExceptionTranslator(const pyMOOSException & e) {
// Use the Python 'C' API to set up an exception object
PyErr_SetString(PyExc_RuntimeError, e.what());
}
namespace MOOS {
/** this is a class which wraps MOOS::MOOSAsyncCommClient to provide
* and interface more suitable for python wrapping
*/
class AsyncCommsWrapper : public MOOS::MOOSAsyncCommClient {
private:
typedef MOOSAsyncCommClient BASE;
public:
bool Run(const std::string & sServer, int Port, const std::string & sMyName) {
return BASE::Run(sServer, Port, sMyName, 0);//Comms Tick not used in Async version
}
//we can support vectors of objects by not lists so
//here we have a funtion which copies a list to vector
MsgVector FetchMailAsVector() {
MsgVector v;
MOOSMSG_LIST M;
if (Fetch(M)) {
std::copy(M.begin(), M.end(), std::back_inserter(v));
}
return v;
}
/* python strings can be binary lets make this specific*/
bool NotifyBinary(const std::string& sKey, const std::string & sData,
double dfTime) {
CMOOSMsg M(MOOS_NOTIFY, sKey, sData.size(), (void *) sData.data(),
dfTime);
return BASE::Post(M);
}
static bool on_connect_delegate(void * pParam) {
MOOS::AsyncCommsWrapper * pMe =
static_cast<MOOS::AsyncCommsWrapper*> (pParam);
return pMe->on_connect();
}
bool SetOnConnectCallback(bp::object func) {
BASE: SetOnConnectCallBack(on_connect_delegate, this);
on_connect_object_ = func;
return true;
}
bool on_connect() {
bool bResult = false;
PyGILState_STATE gstate = PyGILState_Ensure();
try {
bp::object result = on_connect_object_();
bResult = bp::extract<bool>(result);
} catch (const bp::error_already_set& e) {
PyGILState_Release(gstate);
throw pyMOOSException(
"OnConnect:: caught an exception thrown in python callback");
}
PyGILState_Release(gstate);
return bResult;
}
bool SetOnMailCallback(bp::object func) {
BASE: SetOnMailCallBack(on_mail_delegate, this);
on_mail_object_ = func;
return true;
}
static bool on_mail_delegate(void * pParam) {
MOOS::AsyncCommsWrapper * pMe =
static_cast<MOOS::AsyncCommsWrapper*> (pParam);
return pMe->on_mail();
}
bool on_mail() {
bool bResult = false;
PyGILState_STATE gstate = PyGILState_Ensure();
try {
bp::object result = on_mail_object_();
bResult = bp::extract<bool>(result);
} catch (const bp::error_already_set& e) {
PyGILState_Release(gstate);
throw pyMOOSException(
"OnMail:: caught an exception thrown in python callback");
}
PyGILState_Release(gstate);
return bResult;
}
static bool active_queue_delegate(CMOOSMsg & M, void* pParam) {
MeAndQueue * maq = static_cast<MeAndQueue*> (pParam);
return maq->me_->OnQueue(M, maq->queue_name_);
}
bool OnQueue(CMOOSMsg & M, const std::string & sQueueName) {
std::map<std::string, MeAndQueue*>::iterator q;
{
MOOS::ScopedLock L(queue_api_lock_);
q = active_queue_details_.find(sQueueName);
if (q == active_queue_details_.end())
return false;
}
bool bResult = false;
PyGILState_STATE gstate = PyGILState_Ensure();
try {
bp::object result = q->second->func_(M);
bResult = bp::extract<bool>(result);
} catch (const bp::error_already_set& e) {
PyGILState_Release(gstate);
throw pyMOOSException(
"ActiveQueue:: caught an exception thrown in python callback");
}
PyGILState_Release(gstate);
return bResult;
}
virtual bool AddActiveQueue(const std::string & sQueueName, bp::object func) {
MOOS::ScopedLock L(queue_api_lock_);
MeAndQueue* maq = new MeAndQueue;
maq->me_ = this;
maq->queue_name_ = sQueueName;
maq->func_ = func;
std::cerr << "adding active queue OK\n";
active_queue_details_[sQueueName] = maq;
return BASE::AddActiveQueue(sQueueName, active_queue_delegate, maq);
}
private:
/** this is a structure which is used to dispatch
* active queue callbacks
*/
struct MeAndQueue {
AsyncCommsWrapper* me_;
std::string queue_name_;
bp::object func_;
};
std::map<std::string, MeAndQueue*> active_queue_details_;
CMOOSLock queue_api_lock_;
/** callback functions (stored) */
bp::object on_connect_object_;
bp::object on_mail_object_;
};
}
;//namesapce
////////////////////////////////////////////////////////////////////////////////////////////
/** here comes the boost python stuff */
////////////////////////////////////////////////////////////////////////////////////////////
BOOST_PYTHON_MEMBER_FUNCTION_OVERLOADS(f_overloads, f, 1, 2)
;
BOOST_PYTHON_FUNCTION_OVERLOADS(time_overloads, MOOSTime, 0, 1)
;
BOOST_PYTHON_MEMBER_FUNCTION_OVERLOADS(notify_overloads_2_3, Notify, 2,3)
;
BOOST_PYTHON_MEMBER_FUNCTION_OVERLOADS(notify_overloads_3_4, Notify, 3,4)
;
BOOST_PYTHON_MODULE(pymoos)
{
PyEval_InitThreads();
/*********************************************************************
MOOSMsg e class
*********************************************************************/
bp::class_<CMOOSMsg>("moos_msg")
.def("time", &CMOOSMsg::GetTime)
.def("trace",&CMOOSMsg::Trace)
.def("name", &CMOOSMsg::GetKey)
.def("key", &CMOOSMsg::GetKey)
.def("is_name", &CMOOSMsg::IsName)
.def("is_double", &CMOOSMsg::IsDouble)
.def("double", &CMOOSMsg::GetDouble)
.def("double_aux",&CMOOSMsg::GetDoubleAux)
.def("is_string", &CMOOSMsg::IsString)
.def("string", &CMOOSMsg::GetString)
.def("is_binary", &CMOOSMsg::IsBinary)
.def("binary_data",&CMOOSMsg::GetString)
.def("binary_data_size",&CMOOSMsg::GetBinaryDataSize)
.def("mark_as_binary",&CMOOSMsg::MarkAsBinary);
/*********************************************************************
vector of messages
*********************************************************************/
bp::class_<MsgVector>("moos_msg_list")
.def(bp::vector_indexing_suite<MsgVector>());
/*********************************************************************
communications status class
*********************************************************************/
bp::class_<MOOS::ClientCommsStatus>("moos_comms_status")
.def("appraise",&MOOS::ClientCommsStatus::Appraise)
.def("print",&MOOS::ClientCommsStatus::Write);
/*********************************************************************
vector of communications status classes
*********************************************************************/
bp::class_<CommsStatusVector>("moos_comms_status_list")
.def(bp::vector_indexing_suite<CommsStatusVector>());
/*********************************************************************
comms base class
*********************************************************************/
bp::class_<CMOOSCommObject>("base_comms_object", bp::no_init);
/*********************************************************************
synchronous comms base class
*********************************************************************/
bp::class_<CMOOSCommClient, bp::bases<CMOOSCommObject>, boost::noncopyable>("base_sync_comms",bp::no_init)
.def("register",static_cast<bool(CMOOSCommClient::*)(const std::string&, double)> (&CMOOSCommClient::Register))
.def("register",static_cast<bool(CMOOSCommClient::*)(const std::string&,const std::string&,double)> (&CMOOSCommClient::Register))
.def("is_registered_for",&CMOOSCommClient::IsRegisteredFor)
.def("notify",static_cast<bool(CMOOSCommClient::*)(const std::string&,const std::string&, double)> (&CMOOSCommClient::Notify),notify_overloads_2_3())
.def("notify",static_cast<bool(CMOOSCommClient::*)(const std::string&,const std::string&,const std::string&,double)> (&CMOOSCommClient::Notify),notify_overloads_2_3())
.def("notify",static_cast<bool(CMOOSCommClient::*)(const std::string&,const char *,double)> (&CMOOSCommClient::Notify))
.def("notify",static_cast<bool(CMOOSCommClient::*)(const std::string&,const char *,const std::string&,double)> (&CMOOSCommClient::Notify))
.def("notify",static_cast<bool(CMOOSCommClient::*)(const std::string&,double,double)> (&CMOOSCommClient::Notify))
.def("notify",static_cast<bool(CMOOSCommClient::*)(const std::string&,double,const std::string&,double)> (&CMOOSCommClient::Notify))
.def("get_community_name", &CMOOSCommClient::GetCommunityName)
.def("get_moos_name",&CMOOSCommClient::GetMOOSName)
.def("close", &CMOOSCommClient::Close)
.def("get_published", &CMOOSCommClient::GetPublished)
.def("get_registered",&CMOOSCommClient::GetRegistered)
.def("get_description",&CMOOSCommClient::GetDescription)
.def("is_running", &CMOOSCommClient::IsRunning)
.def("is_asynchronous",&CMOOSCommClient::IsAsynchronous)
.def("is_connected",&CMOOSCommClient::IsConnected)
.def("wait_until_connected",&CMOOSCommClient::WaitUntilConnected)
.def("get_number_of_unread_messages",&CMOOSCommClient::GetNumberOfUnreadMessages)
.def("get_number_of_unsent_messages",&CMOOSCommClient::GetNumberOfUnsentMessages)
.def("get_number_bytes_sent",&CMOOSCommClient::GetNumBytesSent)
.def("get_number_bytes_read",&CMOOSCommClient::GetNumBytesReceived)
.def("get_number_messages_sent",&CMOOSCommClient::GetNumMsgsSent)
.def("get_number_message_read",&CMOOSCommClient::GetNumMsgsReceived)
.def("set_comms_control_timewarp_scale_factor",&CMOOSCommClient::SetCommsControlTimeWarpScaleFactor)
.def("get_comms_control_timewarp_scale_factor", &CMOOSCommClient::GetCommsControlTimeWarpScaleFactor)
.def("do_local_time_correction",&CMOOSCommClient::DoLocalTimeCorrection)
.def("set_verbose_debug", &CMOOSCommClient::SetVerboseDebug)
.def("set_comms_tick",&CMOOSCommClient::SetCommsTick)
.def("set_quiet",&CMOOSCommClient::SetQuiet)
.def("enable_comms_status_monitoring",&CMOOSCommClient::EnableCommsStatusMonitoring)
.def("get_client_comms_status",&CMOOSCommClient::GetClientCommsStatus)
.def("get_client_comms_statuses",&CMOOSCommClient::GetClientCommsStatuses)
;
/*********************************************************************
Asynchronous comms base class
*********************************************************************/
bp::class_<MOOS::MOOSAsyncCommClient, bp::bases<CMOOSCommClient>,boost::noncopyable>("base_async_comms", bp::no_init)
.def("run",&MOOS::MOOSAsyncCommClient::Run);
/*********************************************************************/
/** FINALLY HERE IS THE CLASS WE EXPECT TO BE INSTANTIATED IN PYTHON */
/*********************************************************************/
//this is the one to use
bp::class_<MOOS::AsyncCommsWrapper, bp::bases<MOOS::MOOSAsyncCommClient>,boost::noncopyable>("comms")
.def("run", &MOOS::AsyncCommsWrapper::Run)
.def("fetch",&MOOS::AsyncCommsWrapper::FetchMailAsVector)
.def("set_on_connect_callback",&MOOS::AsyncCommsWrapper::SetOnConnectCallback)
.def("set_on_mail_callback",&MOOS::AsyncCommsWrapper::SetOnMailCallback)
.def("notify_binary",&MOOS::AsyncCommsWrapper::NotifyBinary)
.def("add_active_queue",&MOOS::AsyncCommsWrapper::AddActiveQueue)
.def("remove_message_route_to_active_queue",&MOOS::AsyncCommsWrapper::RemoveMessageRouteToActiveQueue)
.def("remove_active_queue",&MOOS::AsyncCommsWrapper::RemoveActiveQueue)
.def("has_active_queue",&MOOS::AsyncCommsWrapper::HasActiveQueue)
.def("print_message_to_active_queue_routing",&MOOS::AsyncCommsWrapper::PrintMessageToActiveQueueRouting)
.def("add_message_route_to_active_queue",static_cast<bool(CMOOSCommClient::*)(const std::string &,const std::string &)> (&MOOS::AsyncCommsWrapper::AddMessageRouteToActiveQueue))
;
/*********************************************************************
some MOOS Utilities
*********************************************************************/
/** here are some global help functions */
bp::def("time", &MOOSTime, time_overloads());
bp::def("local_time", &MOOSLocalTime, time_overloads());
bp::def("is_little_end_in", &IsLittleEndian);
bp::register_exception_translator<pyMOOSException>(&MOOSExceptionTranslator);
}
|
tidy up, reformat
|
tidy up, reformat
|
C++
|
lgpl-2.1
|
mandad/python-moos,themoos/python-moos
|
6534a1b9a2fab04730750f6e014621492b569f5e
|
Source/Native/CtrlrLinux.cpp
|
Source/Native/CtrlrLinux.cpp
|
#include "stdafx.h"
#ifdef LINUX
// https://github.com/RomanKubiak/ctrlr/issues/38
#define PACKAGE "Ctrlr"
#include "CtrlrMacros.h"
#include "CtrlrLinux.h"
#include "CtrlrPanel/CtrlrPanel.h"
#include "CtrlrManager/CtrlrManager.h"
#include <sys/types.h>
#include <sys/stat.h>
#include "keys.h"
extern "C"
{
#include "libr.h"
}
CtrlrLinux::CtrlrLinux(CtrlrManager &_owner) : owner(_owner)
{
}
CtrlrLinux::~CtrlrLinux()
{
}
const Result CtrlrLinux::exportWithDefaultPanel(CtrlrPanel *panelToWrite, const bool isRestricted, const bool signPanel)
{
_DBG("CtrlrLinux::exportWithDefaultPanel");
if (panelToWrite == nullptr)
{
return (Result::fail("Linux native, panel pointer is invalid"));
}
File me = File::getSpecialLocation(File::currentApplicationFile);
File newMe;
libr_file *outputHandle;
MemoryBlock panelExportData;
MemoryBlock panelResourcesData;
String error;
FileChooser fc(CTRLR_NEW_INSTANCE_DIALOG_TITLE,
me.getParentDirectory().getChildFile(File::createLegalFileName(panelToWrite->getProperty(Ids::name))).withFileExtension(me.getFileExtension()),
me.getFileExtension(),
panelToWrite->getOwner().getProperty(Ids::ctrlrNativeFileDialogs));
if (fc.browseForFileToSave (true))
{
_DBG("CtrlrLinux::exportWithDefaultPanel chosen file: "+fc.getResult().getFullPathName());
newMe = fc.getResult();
if (!me.copyFileTo (newMe))
{
return (Result::fail("Linux native, copyFileTo from \""+me.getFullPathName()+"\" to \""+newMe.getFullPathName()+"\" failed"));
}
}
else
{
return (Result::fail("Linux native, browse for save file dialog failed"));
}
outputHandle = libr_open (newMe.getFullPathName().toUTF8().getAddress(), LIBR_READ_WRITE);
if (outputHandle == nullptr)
{
return (Result::fail ("Linux native, can't open output binary ["+newMe.getFullPathName()+"] using libr_open()"));
}
else
{
_DBG("CtrlrLinux::exportWithDefaultPanel libr_open success on: "+newMe.getFullPathName());
}
if ( (error = CtrlrPanel::exportPanel (panelToWrite, File(), newMe, &panelExportData, &panelResourcesData, isRestricted)) == "")
{
if (!libr_write (outputHandle, (char *)CTRLR_INTERNAL_PANEL_SECTION, (char *)panelExportData.getData(), panelExportData.getSize(), LIBR_UNCOMPRESSED, LIBR_OVERWRITE))
{
return (Result::fail ("Linux native, failed to write panel data to binary ["+newMe.getFullPathName()+"], size ["+STR((int32)panelExportData.getSize())+"]"));
libr_close (outputHandle);
}
_DBG ("CtrlrLinux::exportWithDefaultPanel wrote panel data to binary size ["+STR((int32)panelExportData.getSize())+"]");
if (panelResourcesData.getSize() > 0)
{
if (!libr_write (outputHandle, (char *)CTRLR_INTERNAL_RESOURCES_SECTION, (char *)panelResourcesData.getData(), panelResourcesData.getSize(), LIBR_UNCOMPRESSED, LIBR_OVERWRITE))
{
libr_close (outputHandle);
return (Result::fail ("Linux native, failed to write panel resource data to binary ["+newMe.getFullPathName()+"], size ["+STR((int32)panelResourcesData.getSize())+"]"));
}
else
{
_DBG("CtrlrLinux::exportWithDefaultPanel wrote resources, size: "+_STR((int)panelResourcesData.getSize()));
}
}
}
/* We need to move the temporary file to the new destination, libr won't do that for us */
libr_close (outputHandle);
if (File (outputHandle->tempfile).moveFileTo (newMe))
{
_DBG("CtrlrLinux::exportWithDefaultPanel file: "+_STR(outputHandle->tempfile)+" move to: "+newMe.getFullPathName());
if (chmod (newMe.getFullPathName().toUTF8().getAddress(), S_IRUSR|S_IWUSR|S_IXUSR|S_IRGRP|S_IXGRP|S_IROTH))
{
return (Result::fail ("Linux native, chmod failed on destination binary ["+newMe.getFullPathName()+"]"));
}
else
{
_DBG("CtrlrLinux::exportWithDefaultPanel file: "+_STR(newMe.getFullPathName())+" made executable");
}
}
else
{
return (Result::fail("Can't move file: "+_STR(outputHandle->tempfile)+" move to: "+newMe.getFullPathName()));
}
return (Result::ok());
}
const Result CtrlrLinux::getDefaultPanel(MemoryBlock& dataToWrite)
{
#ifdef DEBUG_INSTANCE
File temp("/home/r.kubiak/devel/debug.bpanelz");
temp.loadFileAsData (dataToWrite);
return (Result::ok());
#endif
libr_file *handle = libr_open (nullptr, LIBR_READ);
if (handle == nullptr)
{
return (Result::fail ("Linux native, libr_open failed to open binary [self]"));
}
else
{
_DBG("CtrlrLinux::getDefaultPanel, libr_open succeeded for binary [self]");
}
size_t panelDataSize;
char *panelData = (char *)libr_malloc (handle, (char *)CTRLR_INTERNAL_PANEL_SECTION, &panelDataSize);
if (panelData == nullptr)
{
libr_close (handle);
return (Result::fail ("Linux native, libr_malloc didn't fint embedded panel in binary"));
}
else
{
_DBG("CtrlrLinux::getDefaultPanel, libr_malloc returned data for panel size ["+STR((int32)panelDataSize)+"]");
}
dataToWrite.append (panelData, panelDataSize);
libr_close (handle);
return (Result::ok());
}
const Result CtrlrLinux::getDefaultResources(MemoryBlock& dataToWrite)
{
#ifdef DEBUG_INSTANCE
File temp("/home/r.kubiak/devel/debug.bpanelz");
MemoryBlock data;
{
ScopedPointer <FileInputStream> fis (temp.createInputStream());
fis->readIntoMemoryBlock (data);
}
ValueTree t = ValueTree::readFromGZIPData(data.getData(), data.getSize());
if (t.isValid())
{
ValueTree r = t.getChildWithName (Ids::resourceExportList);
if (r.isValid())
{
MemoryOutputStream mos (dataToWrite, false);
{
GZIPCompressorOutputStream gzipOutputStream (&mos);
r.writeToStream(gzipOutputStream);
gzipOutputStream.flush();
}
return (Result::ok());
}
}
else
{
return (Result::fail("Linux Native: getDefaultResources got data but couldn't parse it as a compressed ValueTree"));
}
#endif
libr_file *handle = libr_open (nullptr, LIBR_READ);
if (handle == nullptr)
{
return (Result::fail ("Linux native, libr_open failed to open binary [self]"));
}
else
{
_DBG("CtrlrLinux::getDefaultResources, libr_open succeeded for binary [self]");
}
size_t panelResourcesDataSize;
char *panelResourcesData = (char *)libr_malloc (handle, (char *)CTRLR_INTERNAL_RESOURCES_SECTION, &panelResourcesDataSize);
if (panelResourcesData == nullptr)
{
libr_close (handle);
return (Result::fail ("Linux native, libr_malloc didn't find embedded panel resources in binary"));
}
else
{
_DBG("CtrlrLinux::getDefaultResources, libr_malloc returned data for panel size ["+STR((int32)panelResourcesDataSize)+"]");
}
dataToWrite.append (panelResourcesData, panelResourcesDataSize);
libr_close (handle);
return (Result::ok());
}
const Result CtrlrLinux::getSignature(MemoryBlock &dataToWrite)
{
libr_file *handle = libr_open (nullptr, LIBR_READ);
if (handle == nullptr)
{
return (Result::fail ("Linux native, libr_open failed to open binary [self]"));
}
else
{
_DBG("CtrlrLinux::getSignature, libr_open succeeded for binary [self]");
}
size_t signatureDataSize;
char *signatureData = (char *)libr_malloc (handle, (char *)CTRLR_INTERNAL_RESOURCES_SECTION, &signatureDataSize);
if (signatureData == nullptr)
{
libr_close (handle);
return (Result::fail ("Linux native, libr_malloc didn't find embedded signature in binary"));
}
else
{
_DBG("CtrlrLinux::getSignature, libr_malloc returned data for signature size ["+STR((int32)signatureDataSize)+"]");
}
dataToWrite.append (signatureData, signatureDataSize);
libr_close (handle);
return (Result::ok());
}
const Result CtrlrLinux::sendKeyPressEvent(const KeyPress &event)
{
return (ctrlr_sendKeyPressEvent (event));
}
#endif
|
#include "stdafx.h"
#ifdef LINUX
// https://github.com/RomanKubiak/ctrlr/issues/38
#define PACKAGE "Ctrlr"
#include "CtrlrMacros.h"
#include "CtrlrLinux.h"
#include "CtrlrPanel/CtrlrPanel.h"
#include "CtrlrManager/CtrlrManager.h"
#include <sys/types.h>
#include <sys/stat.h>
#include "keys.h"
extern "C"
{
#include "libr.h"
}
CtrlrLinux::CtrlrLinux(CtrlrManager &_owner) : owner(_owner)
{
}
CtrlrLinux::~CtrlrLinux()
{
}
const Result CtrlrLinux::exportWithDefaultPanel(CtrlrPanel *panelToWrite, const bool isRestricted, const bool signPanel)
{
_DBG("CtrlrLinux::exportWithDefaultPanel");
if (panelToWrite == nullptr)
{
return (Result::fail("Linux native, panel pointer is invalid"));
}
File me = File::getSpecialLocation(File::currentApplicationFile);
File newMe;
libr_file *outputHandle;
MemoryBlock panelExportData;
MemoryBlock panelResourcesData;
String error;
FileChooser fc(CTRLR_NEW_INSTANCE_DIALOG_TITLE,
me.getParentDirectory().getChildFile(File::createLegalFileName(panelToWrite->getProperty(Ids::name))).withFileExtension(me.getFileExtension()),
me.getFileExtension(),
panelToWrite->getOwner().getProperty(Ids::ctrlrNativeFileDialogs));
if (fc.browseForFileToSave (true))
{
_DBG("CtrlrLinux::exportWithDefaultPanel chosen file: "+fc.getResult().getFullPathName());
newMe = fc.getResult();
if (!me.copyFileTo (newMe))
{
return (Result::fail("Linux native, copyFileTo from \""+me.getFullPathName()+"\" to \""+newMe.getFullPathName()+"\" failed"));
}
}
else
{
return (Result::fail("Linux native, browse for save file dialog failed"));
}
outputHandle = libr_open (newMe.getFullPathName().toUTF8().getAddress(), LIBR_READ_WRITE);
if (outputHandle == nullptr)
{
return (Result::fail ("Linux native, can't open output binary ["+newMe.getFullPathName()+"] using libr_open()"));
}
else
{
_DBG("CtrlrLinux::exportWithDefaultPanel libr_open success on: "+newMe.getFullPathName());
}
if ( (error = CtrlrPanel::exportPanel (panelToWrite, File(), newMe, &panelExportData, &panelResourcesData, isRestricted)) == "")
{
if (!libr_write (outputHandle, (char *)CTRLR_INTERNAL_PANEL_SECTION, (char *)panelExportData.getData(), panelExportData.getSize(), LIBR_UNCOMPRESSED, LIBR_OVERWRITE))
{
return (Result::fail ("Linux native, failed to write panel data to binary ["+newMe.getFullPathName()+"], size ["+STR((int32)panelExportData.getSize())+"]"));
libr_close (outputHandle);
}
_DBG ("CtrlrLinux::exportWithDefaultPanel wrote panel data to binary size ["+STR((int32)panelExportData.getSize())+"]");
if (panelResourcesData.getSize() > 0)
{
if (!libr_write (outputHandle, (char *)CTRLR_INTERNAL_RESOURCES_SECTION, (char *)panelResourcesData.getData(), panelResourcesData.getSize(), LIBR_UNCOMPRESSED, LIBR_OVERWRITE))
{
libr_close (outputHandle);
return (Result::fail ("Linux native, failed to write panel resource data to binary ["+newMe.getFullPathName()+"], size ["+STR((int32)panelResourcesData.getSize())+"]"));
}
else
{
_DBG("CtrlrLinux::exportWithDefaultPanel wrote resources, size: "+_STR((int)panelResourcesData.getSize()));
}
}
}
/* We need to move the temporary file to the new destination, libr won't do that for us */
libr_close (outputHandle);
if (File (outputHandle->tempfile).moveFileTo (newMe))
{
_DBG("CtrlrLinux::exportWithDefaultPanel file: "+_STR(outputHandle->tempfile)+" move to: "+newMe.getFullPathName());
if (chmod (newMe.getFullPathName().toUTF8().getAddress(), S_IRUSR|S_IWUSR|S_IXUSR|S_IRGRP|S_IXGRP|S_IROTH))
{
return (Result::fail ("Linux native, chmod failed on destination binary ["+newMe.getFullPathName()+"]"));
}
else
{
_DBG("CtrlrLinux::exportWithDefaultPanel file: "+_STR(newMe.getFullPathName())+" made executable");
}
}
else
{
return (Result::fail("Can't move file: "+_STR(outputHandle->tempfile)+" move to: "+newMe.getFullPathName()));
}
return (Result::ok());
}
const Result CtrlrLinux::getDefaultPanel(MemoryBlock& dataToWrite)
{
#ifdef DEBUG_INSTANCE
File temp("/home/r.kubiak/devel/debug.bpanelz");
temp.loadFileAsData (dataToWrite);
return (Result::ok());
#endif
libr_file *handle = libr_open ( File::getSpecialLocation(File::hostApplicationPath).getFullPathName().toUTF8().getAddress(),
LIBR_READ);
if (handle == nullptr)
{
return (Result::fail ("Linux native, libr_open failed to open binary [self]"));
}
else
{
_DBG("CtrlrLinux::getDefaultPanel, libr_open succeeded for binary [self]");
}
size_t panelDataSize;
char *panelData = (char *)libr_malloc (handle, (char *)CTRLR_INTERNAL_PANEL_SECTION, &panelDataSize);
if (panelData == nullptr)
{
libr_close (handle);
return (Result::fail ("Linux native, libr_malloc didn't fint embedded panel in binary"));
}
else
{
_DBG("CtrlrLinux::getDefaultPanel, libr_malloc returned data for panel size ["+STR((int32)panelDataSize)+"]");
}
dataToWrite.append (panelData, panelDataSize);
libr_close (handle);
return (Result::ok());
}
const Result CtrlrLinux::getDefaultResources(MemoryBlock& dataToWrite)
{
#ifdef DEBUG_INSTANCE
File temp("/home/r.kubiak/devel/debug.bpanelz");
MemoryBlock data;
{
ScopedPointer <FileInputStream> fis (temp.createInputStream());
fis->readIntoMemoryBlock (data);
}
ValueTree t = ValueTree::readFromGZIPData(data.getData(), data.getSize());
if (t.isValid())
{
ValueTree r = t.getChildWithName (Ids::resourceExportList);
if (r.isValid())
{
MemoryOutputStream mos (dataToWrite, false);
{
GZIPCompressorOutputStream gzipOutputStream (&mos);
r.writeToStream(gzipOutputStream);
gzipOutputStream.flush();
}
return (Result::ok());
}
}
else
{
return (Result::fail("Linux Native: getDefaultResources got data but couldn't parse it as a compressed ValueTree"));
}
#endif
libr_file *handle = libr_open (File::getSpecialLocation(File::hostApplicationPath).getFullPathName().toUTF8().getAddress(),
LIBR_READ);
if (handle == nullptr)
{
return (Result::fail ("Linux native, libr_open failed to open binary [self]"));
}
else
{
_DBG("CtrlrLinux::getDefaultResources, libr_open succeeded for binary [self]");
}
size_t panelResourcesDataSize;
char *panelResourcesData = (char *)libr_malloc (handle, (char *)CTRLR_INTERNAL_RESOURCES_SECTION, &panelResourcesDataSize);
if (panelResourcesData == nullptr)
{
libr_close (handle);
return (Result::fail ("Linux native, libr_malloc didn't find embedded panel resources in binary"));
}
else
{
_DBG("CtrlrLinux::getDefaultResources, libr_malloc returned data for panel size ["+STR((int32)panelResourcesDataSize)+"]");
}
dataToWrite.append (panelResourcesData, panelResourcesDataSize);
libr_close (handle);
return (Result::ok());
}
const Result CtrlrLinux::getSignature(MemoryBlock &dataToWrite)
{
libr_file *handle = libr_open (File::getSpecialLocation(File::hostApplicationPath).getFullPathName().toUTF8().getAddress(), LIBR_READ);
if (handle == nullptr)
{
return (Result::fail ("Linux native, libr_open failed to open binary [self]"));
}
else
{
_DBG("CtrlrLinux::getSignature, libr_open succeeded for binary [self]");
}
size_t signatureDataSize;
char *signatureData = (char *)libr_malloc (handle, (char *)CTRLR_INTERNAL_RESOURCES_SECTION, &signatureDataSize);
if (signatureData == nullptr)
{
libr_close (handle);
return (Result::fail ("Linux native, libr_malloc didn't find embedded signature in binary"));
}
else
{
_DBG("CtrlrLinux::getSignature, libr_malloc returned data for signature size ["+STR((int32)signatureDataSize)+"]");
}
dataToWrite.append (signatureData, signatureDataSize);
libr_close (handle);
return (Result::ok());
}
const Result CtrlrLinux::sendKeyPressEvent(const KeyPress &event)
{
return (ctrlr_sendKeyPressEvent (event));
}
#endif
|
Use JUCE to resolve the executable file name.
|
Use JUCE to resolve the executable file name.
|
C++
|
bsd-3-clause
|
RomanKubiak/ctrlr,RomanKubiak/ctrlr,RomanKubiak/ctrlr,RomanKubiak/ctrlr,RomanKubiak/ctrlr,RomanKubiak/ctrlr
|
76b6a2e2fe00685a8cf30453a18004e263e90bb3
|
cpp/var.cc
|
cpp/var.cc
|
// Copyright (c) 2010 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ppapi/cpp/var.h"
#include <string.h>
#include <algorithm>
#include "ppapi/c/pp_var.h"
#include "ppapi/c/ppb_var.h"
#include "ppapi/cpp/logging.h"
#include "ppapi/cpp/module.h"
#include "ppapi/cpp/module_impl.h"
#include "ppapi/cpp/scriptable_object.h"
// Defining snprintf
#include <stdio.h>
#if defined(_MSC_VER)
# define snprintf _snprintf_s
#endif
// Defining PRId32
#if defined(__native_client__)
# define PRId32 "ld"
#elif defined(_WIN64)
# define PRId32 "I64d"
#elif defined(_WIN32)
# define PRId32 "ld"
#else
# include <inttypes.h>
#endif
namespace {
DeviceFuncs<PPB_Var> ppb_var_f(PPB_VAR_INTERFACE);
// Technically you can call AddRef and Release on any Var, but it may involve
// cross-process calls depending on the plugin. This is an optimization so we
// only do refcounting on the necessary objects.
inline bool NeedsRefcounting(const PP_Var& var) {
return var.type == PP_VARTYPE_STRING || var.type == PP_VARTYPE_OBJECT;
}
} // namespace
namespace pp {
Var::Var() {
var_.type = PP_VARTYPE_VOID;
needs_release_ = false;
}
Var::Var(Null) {
var_.type = PP_VARTYPE_NULL;
needs_release_ = false;
}
Var::Var(bool b) {
var_.type = PP_VARTYPE_BOOL;
var_.value.as_bool = b;
needs_release_ = false;
}
Var::Var(int32_t i) {
var_.type = PP_VARTYPE_INT32;
var_.value.as_int = i;
needs_release_ = false;
}
Var::Var(double d) {
var_.type = PP_VARTYPE_DOUBLE;
var_.value.as_double = d;
needs_release_ = false;
}
Var::Var(const char* utf8_str) {
if (ppb_var_f) {
var_ = ppb_var_f->VarFromUtf8(utf8_str,
static_cast<uint32_t>(strlen(utf8_str)));
} else {
var_.type = PP_VARTYPE_NULL;
}
needs_release_ = (var_.type == PP_VARTYPE_STRING);
}
Var::Var(const std::string& utf8_str) {
if (ppb_var_f) {
var_ = ppb_var_f->VarFromUtf8(utf8_str.c_str(),
static_cast<uint32_t>(utf8_str.size()));
} else {
var_.type = PP_VARTYPE_NULL;
}
needs_release_ = (var_.type == PP_VARTYPE_STRING);
}
Var::Var(ScriptableObject* object) {
if (ppb_var_f) {
var_ = ppb_var_f->CreateObject(object->GetClass(), object);
needs_release_ = true;
} else {
var_.type = PP_VARTYPE_NULL;
needs_release_ = false;
}
}
Var::Var(const Var& other) {
var_ = other.var_;
if (NeedsRefcounting(var_) && other.needs_release_) {
if (ppb_var_f) {
needs_release_ = true;
ppb_var_f->AddRef(var_);
} else {
var_.type = PP_VARTYPE_NULL;
needs_release_ = false;
}
} else {
needs_release_ = false;
}
}
Var::~Var() {
if (needs_release_ && ppb_var_f)
ppb_var_f->Release(var_);
}
Var& Var::operator=(const Var& other) {
// Use the copy constructor to make a copy, then swap into that. This makes
// sure we call the correct init and destruct for everything, without actually
// needing to write the refcounting code here.
Var copy(other);
swap(copy);
return *this;
}
void Var::swap(Var& other) {
std::swap(var_, other.var_);
std::swap(needs_release_, other.needs_release_);
}
bool Var::AsBool() const {
if (!is_bool()) {
PP_NOTREACHED();
return false;
}
return var_.value.as_bool;
}
int32_t Var::AsInt() const {
if (is_int())
return var_.value.as_int;
if (is_double())
return static_cast<int>(var_.value.as_double);
PP_NOTREACHED();
return 0;
}
double Var::AsDouble() const {
if (is_double())
return var_.value.as_double;
if (is_int())
return static_cast<double>(var_.value.as_int);
PP_NOTREACHED();
return 0.0;
}
std::string Var::AsString() const {
if (!is_string()) {
PP_NOTREACHED();
return std::string();
}
if (!ppb_var_f)
return std::string();
uint32_t len;
const char* str = ppb_var_f->VarToUtf8(var_, &len);
return std::string(str, len);
}
ScriptableObject* Var::AsScriptableObject() const {
if (!is_object()) {
PP_NOTREACHED();
} else if (ppb_var_f) {
void* object = NULL;
if (ppb_var_f->IsInstanceOf(var_, ScriptableObject::GetClass(), &object)) {
return reinterpret_cast<ScriptableObject*>(object);
}
}
return NULL;
}
bool Var::HasProperty(const Var& name, Var* exception) const {
if (!ppb_var_f)
return false;
return ppb_var_f->HasProperty(var_, name.var_, OutException(exception));
}
Var Var::GetProperty(const Var& name, Var* exception) const {
if (!ppb_var_f)
return Var();
return Var(PassRef(), ppb_var_f->GetProperty(var_, name.var_,
OutException(exception)));
}
void Var::GetAllPropertyNames(std::vector<Var>* properties,
Var* exception) const {
if (!ppb_var_f)
return;
PP_Var* props = NULL;
uint32_t prop_count = 0;
ppb_var_f->GetAllPropertyNames(var_, &prop_count, &props,
OutException(exception));
if (!prop_count)
return;
properties->resize(prop_count);
for (uint32_t i = 0; i < prop_count; ++i) {
Var temp(PassRef(), props[i]);
(*properties)[i].swap(temp);
}
Module::Get()->core()->MemFree(props);
}
void Var::SetProperty(const Var& name, const Var& value, Var* exception) {
if (!ppb_var_f)
return;
ppb_var_f->SetProperty(var_, name.var_, value.var_, OutException(exception));
}
void Var::RemoveProperty(const Var& name, Var* exception) {
if (!ppb_var_f)
return;
ppb_var_f->RemoveProperty(var_, name.var_, OutException(exception));
}
Var Var::Call(const Var& method_name, uint32_t argc, Var* argv,
Var* exception) {
if (!ppb_var_f)
return Var();
if (argc > 0) {
std::vector<PP_Var> args;
args.reserve(argc);
for (size_t i = 0; i < argc; i++)
args.push_back(argv[i].var_);
return Var(PassRef(), ppb_var_f->Call(var_, method_name.var_,
argc, &args[0],
OutException(exception)));
} else {
// Don't try to get the address of a vector if it's empty.
return Var(PassRef(), ppb_var_f->Call(var_, method_name.var_, 0, NULL,
OutException(exception)));
}
}
Var Var::Construct(uint32_t argc, Var* argv, Var* exception) const {
if (!ppb_var_f)
return Var();
if (argc > 0) {
std::vector<PP_Var> args;
args.reserve(argc);
for (size_t i = 0; i < argc; i++)
args.push_back(argv[i].var_);
return Var(PassRef(), ppb_var_f->Construct(var_, argc, &args[0],
OutException(exception)));
} else {
// Don't try to get the address of a vector if it's empty.
return Var(PassRef(), ppb_var_f->Construct(var_, 0, NULL,
OutException(exception)));
}
}
Var Var::Call(const Var& method_name, const Var& arg1, Var* exception) {
if (!ppb_var_f)
return Var();
PP_Var args[1] = {arg1.var_};
return Var(PassRef(), ppb_var_f->Call(var_, method_name.var_, 1, args,
OutException(exception)));
}
Var Var::Call(const Var& method_name, const Var& arg1, const Var& arg2,
Var* exception) {
if (!ppb_var_f)
return Var();
PP_Var args[2] = {arg1.var_, arg2.var_};
return Var(PassRef(), ppb_var_f->Call(var_, method_name.var_, 2, args,
OutException(exception)));
}
Var Var::Call(const Var& method_name, const Var& arg1, const Var& arg2,
const Var& arg3, Var* exception) {
if (!ppb_var_f)
return Var();
PP_Var args[3] = {arg1.var_, arg2.var_, arg3.var_};
return Var(PassRef(), ppb_var_f->Call(var_, method_name.var_, 3, args,
OutException(exception)));
}
Var Var::Call(const Var& method_name, const Var& arg1, const Var& arg2,
const Var& arg3, const Var& arg4, Var* exception) {
if (!ppb_var_f)
return Var();
PP_Var args[4] = {arg1.var_, arg2.var_, arg3.var_, arg4.var_};
return Var(PassRef(), ppb_var_f->Call(var_, method_name.var_, 4, args,
OutException(exception)));
}
std::string Var::DebugString() const {
char buf[256];
if (is_void())
snprintf(buf, sizeof(buf), "Var<VOID>");
else if (is_null())
snprintf(buf, sizeof(buf), "Var<NULL>");
else if (is_bool())
snprintf(buf, sizeof(buf), AsBool() ? "Var<true>" : "Var<false>");
else if (is_int())
snprintf(buf, sizeof(buf), "Var<%"PRId32">", AsInt());
else if (is_double())
snprintf(buf, sizeof(buf), "Var<%f>", AsDouble());
else if (is_string())
snprintf(buf, sizeof(buf), "Var<'%s'>", AsString().c_str());
else if (is_object())
snprintf(buf, sizeof(buf), "Var<OBJECT>");
return buf;
}
} // namespace pp
|
// Copyright (c) 2010 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ppapi/cpp/var.h"
#include <string.h>
#include <algorithm>
#include "ppapi/c/pp_var.h"
#include "ppapi/c/ppb_var.h"
#include "ppapi/cpp/logging.h"
#include "ppapi/cpp/module.h"
#include "ppapi/cpp/module_impl.h"
#include "ppapi/cpp/scriptable_object.h"
// Defining snprintf
#include <stdio.h>
#if defined(_MSC_VER)
# define snprintf _snprintf_s
#endif
// Defining PRId32
#if defined(__native_client__)
# define PRId32 "ld"
#elif defined(_WIN64)
# define PRId32 "I64d"
#elif defined(_WIN32)
# define PRId32 "ld"
#else
# include <inttypes.h>
#endif
namespace {
DeviceFuncs<PPB_Var> ppb_var_f(PPB_VAR_INTERFACE);
// Technically you can call AddRef and Release on any Var, but it may involve
// cross-process calls depending on the plugin. This is an optimization so we
// only do refcounting on the necessary objects.
inline bool NeedsRefcounting(const PP_Var& var) {
return var.type == PP_VARTYPE_STRING || var.type == PP_VARTYPE_OBJECT;
}
} // namespace
namespace pp {
Var::Var() {
var_.type = PP_VARTYPE_VOID;
needs_release_ = false;
}
Var::Var(Null) {
var_.type = PP_VARTYPE_NULL;
needs_release_ = false;
}
Var::Var(bool b) {
var_.type = PP_VARTYPE_BOOL;
var_.value.as_bool = b;
needs_release_ = false;
}
Var::Var(int32_t i) {
var_.type = PP_VARTYPE_INT32;
var_.value.as_int = i;
needs_release_ = false;
}
Var::Var(double d) {
var_.type = PP_VARTYPE_DOUBLE;
var_.value.as_double = d;
needs_release_ = false;
}
Var::Var(const char* utf8_str) {
if (ppb_var_f) {
var_ = ppb_var_f->VarFromUtf8(utf8_str,
static_cast<uint32_t>(strlen(utf8_str)));
} else {
var_.type = PP_VARTYPE_NULL;
}
needs_release_ = (var_.type == PP_VARTYPE_STRING);
}
Var::Var(const std::string& utf8_str) {
if (ppb_var_f) {
var_ = ppb_var_f->VarFromUtf8(utf8_str.c_str(),
static_cast<uint32_t>(utf8_str.size()));
} else {
var_.type = PP_VARTYPE_NULL;
}
needs_release_ = (var_.type == PP_VARTYPE_STRING);
}
Var::Var(ScriptableObject* object) {
if (ppb_var_f) {
var_ = ppb_var_f->CreateObject(object->GetClass(), object);
needs_release_ = true;
} else {
var_.type = PP_VARTYPE_NULL;
needs_release_ = false;
}
}
Var::Var(const Var& other) {
var_ = other.var_;
if (NeedsRefcounting(var_)) {
if (ppb_var_f) {
needs_release_ = true;
ppb_var_f->AddRef(var_);
} else {
var_.type = PP_VARTYPE_NULL;
needs_release_ = false;
}
} else {
needs_release_ = false;
}
}
Var::~Var() {
if (needs_release_ && ppb_var_f)
ppb_var_f->Release(var_);
}
Var& Var::operator=(const Var& other) {
// Use the copy constructor to make a copy, then swap into that. This makes
// sure we call the correct init and destruct for everything, without actually
// needing to write the refcounting code here.
Var copy(other);
swap(copy);
return *this;
}
void Var::swap(Var& other) {
std::swap(var_, other.var_);
std::swap(needs_release_, other.needs_release_);
}
bool Var::AsBool() const {
if (!is_bool()) {
PP_NOTREACHED();
return false;
}
return var_.value.as_bool;
}
int32_t Var::AsInt() const {
if (is_int())
return var_.value.as_int;
if (is_double())
return static_cast<int>(var_.value.as_double);
PP_NOTREACHED();
return 0;
}
double Var::AsDouble() const {
if (is_double())
return var_.value.as_double;
if (is_int())
return static_cast<double>(var_.value.as_int);
PP_NOTREACHED();
return 0.0;
}
std::string Var::AsString() const {
if (!is_string()) {
PP_NOTREACHED();
return std::string();
}
if (!ppb_var_f)
return std::string();
uint32_t len;
const char* str = ppb_var_f->VarToUtf8(var_, &len);
return std::string(str, len);
}
ScriptableObject* Var::AsScriptableObject() const {
if (!is_object()) {
PP_NOTREACHED();
} else if (ppb_var_f) {
void* object = NULL;
if (ppb_var_f->IsInstanceOf(var_, ScriptableObject::GetClass(), &object)) {
return reinterpret_cast<ScriptableObject*>(object);
}
}
return NULL;
}
bool Var::HasProperty(const Var& name, Var* exception) const {
if (!ppb_var_f)
return false;
return ppb_var_f->HasProperty(var_, name.var_, OutException(exception));
}
Var Var::GetProperty(const Var& name, Var* exception) const {
if (!ppb_var_f)
return Var();
return Var(PassRef(), ppb_var_f->GetProperty(var_, name.var_,
OutException(exception)));
}
void Var::GetAllPropertyNames(std::vector<Var>* properties,
Var* exception) const {
if (!ppb_var_f)
return;
PP_Var* props = NULL;
uint32_t prop_count = 0;
ppb_var_f->GetAllPropertyNames(var_, &prop_count, &props,
OutException(exception));
if (!prop_count)
return;
properties->resize(prop_count);
for (uint32_t i = 0; i < prop_count; ++i) {
Var temp(PassRef(), props[i]);
(*properties)[i].swap(temp);
}
Module::Get()->core()->MemFree(props);
}
void Var::SetProperty(const Var& name, const Var& value, Var* exception) {
if (!ppb_var_f)
return;
ppb_var_f->SetProperty(var_, name.var_, value.var_, OutException(exception));
}
void Var::RemoveProperty(const Var& name, Var* exception) {
if (!ppb_var_f)
return;
ppb_var_f->RemoveProperty(var_, name.var_, OutException(exception));
}
Var Var::Call(const Var& method_name, uint32_t argc, Var* argv,
Var* exception) {
if (!ppb_var_f)
return Var();
if (argc > 0) {
std::vector<PP_Var> args;
args.reserve(argc);
for (size_t i = 0; i < argc; i++)
args.push_back(argv[i].var_);
return Var(PassRef(), ppb_var_f->Call(var_, method_name.var_,
argc, &args[0],
OutException(exception)));
} else {
// Don't try to get the address of a vector if it's empty.
return Var(PassRef(), ppb_var_f->Call(var_, method_name.var_, 0, NULL,
OutException(exception)));
}
}
Var Var::Construct(uint32_t argc, Var* argv, Var* exception) const {
if (!ppb_var_f)
return Var();
if (argc > 0) {
std::vector<PP_Var> args;
args.reserve(argc);
for (size_t i = 0; i < argc; i++)
args.push_back(argv[i].var_);
return Var(PassRef(), ppb_var_f->Construct(var_, argc, &args[0],
OutException(exception)));
} else {
// Don't try to get the address of a vector if it's empty.
return Var(PassRef(), ppb_var_f->Construct(var_, 0, NULL,
OutException(exception)));
}
}
Var Var::Call(const Var& method_name, const Var& arg1, Var* exception) {
if (!ppb_var_f)
return Var();
PP_Var args[1] = {arg1.var_};
return Var(PassRef(), ppb_var_f->Call(var_, method_name.var_, 1, args,
OutException(exception)));
}
Var Var::Call(const Var& method_name, const Var& arg1, const Var& arg2,
Var* exception) {
if (!ppb_var_f)
return Var();
PP_Var args[2] = {arg1.var_, arg2.var_};
return Var(PassRef(), ppb_var_f->Call(var_, method_name.var_, 2, args,
OutException(exception)));
}
Var Var::Call(const Var& method_name, const Var& arg1, const Var& arg2,
const Var& arg3, Var* exception) {
if (!ppb_var_f)
return Var();
PP_Var args[3] = {arg1.var_, arg2.var_, arg3.var_};
return Var(PassRef(), ppb_var_f->Call(var_, method_name.var_, 3, args,
OutException(exception)));
}
Var Var::Call(const Var& method_name, const Var& arg1, const Var& arg2,
const Var& arg3, const Var& arg4, Var* exception) {
if (!ppb_var_f)
return Var();
PP_Var args[4] = {arg1.var_, arg2.var_, arg3.var_, arg4.var_};
return Var(PassRef(), ppb_var_f->Call(var_, method_name.var_, 4, args,
OutException(exception)));
}
std::string Var::DebugString() const {
char buf[256];
if (is_void())
snprintf(buf, sizeof(buf), "Var<VOID>");
else if (is_null())
snprintf(buf, sizeof(buf), "Var<NULL>");
else if (is_bool())
snprintf(buf, sizeof(buf), AsBool() ? "Var<true>" : "Var<false>");
else if (is_int())
snprintf(buf, sizeof(buf), "Var<%"PRId32">", AsInt());
else if (is_double())
snprintf(buf, sizeof(buf), "Var<%f>", AsDouble());
else if (is_string())
snprintf(buf, sizeof(buf), "Var<'%s'>", AsString().c_str());
else if (is_object())
snprintf(buf, sizeof(buf), "Var<OBJECT>");
return buf;
}
} // namespace pp
|
Remove hack around Linux dynamic shared object mess. Review URL: http://codereview.chromium.org/3220003
|
Remove hack around Linux dynamic shared object mess.
Review URL: http://codereview.chromium.org/3220003
|
C++
|
bsd-3-clause
|
nanox/ppapi,fubaydullaev/ppapi,dralves/ppapi,nanox/ppapi,xinghaizhou/ppapi,c1soju96/ppapi,huqingyu/ppapi,dingdayong/ppapi,dralves/ppapi,gwobay/ppapi,xuesongzhu/ppapi,xiaozihui/ppapi,rise-worlds/ppapi,whitewolfm/ppapi,phisixersai/ppapi,ruder/ppapi,huochetou999/ppapi,phisixersai/ppapi,huochetou999/ppapi,gwobay/ppapi,HAfsari/ppapi,ruder/ppapi,huochetou999/ppapi,ruder/ppapi,thdtjsdn/ppapi,qwop/ppapi,huochetou999/ppapi,stefanie924/ppapi,phisixersai/ppapi,fubaydullaev/ppapi,Xelemsta/ppapi,YachaoLiu/ppapi,Xelemsta/ppapi,qwop/ppapi,xuesongzhu/ppapi,gwobay/ppapi,tiaolong/ppapi,gwobay/ppapi,tonyjoule/ppapi,xuesongzhu/ppapi,HAfsari/ppapi,rise-worlds/ppapi,qwop/ppapi,thdtjsdn/ppapi,lag945/ppapi,CharlesHuimin/ppapi,xinghaizhou/ppapi,thdtjsdn/ppapi,YachaoLiu/ppapi,cacpssl/ppapi,xuesongzhu/ppapi,c1soju96/ppapi,fubaydullaev/ppapi,Xelemsta/ppapi,huqingyu/ppapi,ruder/ppapi,xinghaizhou/ppapi,cacpssl/ppapi,JustRight/ppapi,chenfeng8742/ppapi,chenfeng8742/ppapi,CharlesHuimin/ppapi,siweilvxing/ppapi,siweilvxing/ppapi,chenfeng8742/ppapi,qwop/ppapi,tiaolong/ppapi,CharlesHuimin/ppapi,siweilvxing/ppapi,huqingyu/ppapi,lag945/ppapi,nanox/ppapi,dingdayong/ppapi,siweilvxing/ppapi,JustRight/ppapi,xinghaizhou/ppapi,thdtjsdn/ppapi,phisixersai/ppapi,JustRight/ppapi,lag945/ppapi,tonyjoule/ppapi,Xelemsta/ppapi,xinghaizhou/ppapi,tonyjoule/ppapi,huqingyu/ppapi,nanox/ppapi,ruder/ppapi,YachaoLiu/ppapi,fubaydullaev/ppapi,dingdayong/ppapi,huqingyu/ppapi,HAfsari/ppapi,tiaolong/ppapi,chenfeng8742/ppapi,HAfsari/ppapi,stefanie924/ppapi,dralves/ppapi,YachaoLiu/ppapi,CharlesHuimin/ppapi,dralves/ppapi,tonyjoule/ppapi,xiaozihui/ppapi,c1soju96/ppapi,c1soju96/ppapi,c1soju96/ppapi,CharlesHuimin/ppapi,tiaolong/ppapi,rise-worlds/ppapi,whitewolfm/ppapi,whitewolfm/ppapi,cacpssl/ppapi,qwop/ppapi,nanox/ppapi,thdtjsdn/ppapi,stefanie924/ppapi,chenfeng8742/ppapi,tiaolong/ppapi,JustRight/ppapi,YachaoLiu/ppapi,tonyjoule/ppapi,HAfsari/ppapi,lag945/ppapi,xiaozihui/ppapi,xiaozihui/ppapi,dingdayong/ppapi,JustRight/ppapi,dralves/ppapi,whitewolfm/ppapi,dingdayong/ppapi,Xelemsta/ppapi,phisixersai/ppapi,whitewolfm/ppapi,gwobay/ppapi,huochetou999/ppapi,cacpssl/ppapi,fubaydullaev/ppapi,rise-worlds/ppapi,siweilvxing/ppapi,cacpssl/ppapi,xuesongzhu/ppapi,xiaozihui/ppapi,lag945/ppapi,stefanie924/ppapi,stefanie924/ppapi,rise-worlds/ppapi
|
395cfbcda952b52b9b882b538ff28c14be322141
|
content/browser/gpu/webgl_conformance_test.cc
|
content/browser/gpu/webgl_conformance_test.cc
|
// Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "base/command_line.h"
#include "base/file_util.h"
#include "base/path_service.h"
#include "base/utf_string_conversions.h"
#include "content/public/browser/web_contents.h"
#include "content/public/common/content_paths.h"
#include "content/public/common/content_switches.h"
#include "content/public/test/browser_test_utils.h"
#include "content/shell/shell.h"
#include "content/test/content_browser_test.h"
#include "content/test/content_browser_test_utils.h"
#include "content/test/gpu/gpu_test_config.h"
#include "content/test/gpu/gpu_test_expectations_parser.h"
#include "net/base/net_util.h"
namespace content {
class WebGLConformanceTest : public ContentBrowserTest {
public:
WebGLConformanceTest() {}
virtual void SetUpCommandLine(CommandLine* command_line) {
// Allow privileged WebGL extensions.
command_line->AppendSwitch(switches::kEnablePrivilegedWebGLExtensions);
}
virtual void SetUpInProcessBrowserTestFixture() {
base::FilePath webgl_conformance_path;
PathService::Get(base::DIR_SOURCE_ROOT, &webgl_conformance_path);
webgl_conformance_path = webgl_conformance_path.Append(
FILE_PATH_LITERAL("third_party"));
webgl_conformance_path = webgl_conformance_path.Append(
FILE_PATH_LITERAL("webgl_conformance"));
ASSERT_TRUE(file_util::DirectoryExists(webgl_conformance_path))
<< "Missing conformance tests: " << webgl_conformance_path.value();
PathService::Get(DIR_TEST_DATA, &test_path_);
test_path_ = test_path_.Append(FILE_PATH_LITERAL("gpu"));
test_path_ = test_path_.Append(FILE_PATH_LITERAL("webgl_conformance.html"));
#if !defined(OS_WIN)
ASSERT_TRUE(bot_config_.LoadCurrentConfig(NULL))
<< "Fail to load bot configuration";
ASSERT_TRUE(bot_config_.IsValid())
<< "Invalid bot configuration";
ASSERT_TRUE(test_expectations_.LoadTestExpectations(
GPUTestExpectationsParser::kWebGLConformanceTest));
#endif
}
void RunTest(const std::string& url) {
std::string test_name =
testing::UnitTest::GetInstance()->current_test_info()->name();
if (StartsWithASCII(test_name, "MANUAL_", true))
test_name = test_name.substr(strlen("MANUAL_"));
#if defined(OS_WIN)
return;
#endif
int32 expectation =
test_expectations_.GetTestExpectation(test_name, bot_config_);
if (expectation != GPUTestExpectationsParser::kGpuTestPass) {
LOG(WARNING) << "Test " << test_name << " is bypassed";
return;
}
DOMMessageQueue message_queue;
NavigateToURL(shell(), net::FilePathToFileURL(test_path_));
std::string message;
NavigateToURL(shell(), GURL("javascript:start('" + url + "');"));
ASSERT_TRUE(message_queue.WaitForMessage(&message));
EXPECT_STREQ("\"SUCCESS\"", message.c_str()) << message;
}
private:
base::FilePath test_path_;
GPUTestBotConfig bot_config_;
GPUTestExpectationsParser test_expectations_;
};
#define CONFORMANCE_TEST(name, url) \
IN_PROC_BROWSER_TEST_F(WebGLConformanceTest, MANUAL_##name) { \
RunTest(url); \
}
// The test declarations are located in webgl_conformance_test_list_autogen.h,
// because the list is automatically generated by a script.
// See: generate_webgl_conformance_test_list.py
#include "webgl_conformance_test_list_autogen.h"
} // namespace content
|
// Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "base/command_line.h"
#include "base/file_util.h"
#include "base/path_service.h"
#include "base/utf_string_conversions.h"
#include "content/public/browser/web_contents.h"
#include "content/public/common/content_paths.h"
#include "content/public/common/content_switches.h"
#include "content/public/test/browser_test_utils.h"
#include "content/shell/shell.h"
#include "content/test/content_browser_test.h"
#include "content/test/content_browser_test_utils.h"
#include "content/test/gpu/gpu_test_config.h"
#include "content/test/gpu/gpu_test_expectations_parser.h"
#include "net/base/net_util.h"
namespace content {
class WebGLConformanceTest : public ContentBrowserTest {
public:
WebGLConformanceTest() {}
virtual void SetUpCommandLine(CommandLine* command_line) {
// Allow privileged WebGL extensions.
command_line->AppendSwitch(switches::kEnablePrivilegedWebGLExtensions);
}
virtual void SetUpInProcessBrowserTestFixture() {
#if !defined(OS_WIN)
base::FilePath webgl_conformance_path;
PathService::Get(base::DIR_SOURCE_ROOT, &webgl_conformance_path);
webgl_conformance_path = webgl_conformance_path.Append(
FILE_PATH_LITERAL("third_party"));
webgl_conformance_path = webgl_conformance_path.Append(
FILE_PATH_LITERAL("webgl_conformance"));
ASSERT_TRUE(file_util::DirectoryExists(webgl_conformance_path))
<< "Missing conformance tests: " << webgl_conformance_path.value();
#endif
PathService::Get(DIR_TEST_DATA, &test_path_);
test_path_ = test_path_.Append(FILE_PATH_LITERAL("gpu"));
test_path_ = test_path_.Append(FILE_PATH_LITERAL("webgl_conformance.html"));
#if !defined(OS_WIN)
ASSERT_TRUE(bot_config_.LoadCurrentConfig(NULL))
<< "Fail to load bot configuration";
ASSERT_TRUE(bot_config_.IsValid())
<< "Invalid bot configuration";
ASSERT_TRUE(test_expectations_.LoadTestExpectations(
GPUTestExpectationsParser::kWebGLConformanceTest));
#endif
}
void RunTest(const std::string& url) {
std::string test_name =
testing::UnitTest::GetInstance()->current_test_info()->name();
if (StartsWithASCII(test_name, "MANUAL_", true))
test_name = test_name.substr(strlen("MANUAL_"));
#if defined(OS_WIN)
return;
#endif
int32 expectation =
test_expectations_.GetTestExpectation(test_name, bot_config_);
if (expectation != GPUTestExpectationsParser::kGpuTestPass) {
LOG(WARNING) << "Test " << test_name << " is bypassed";
return;
}
DOMMessageQueue message_queue;
NavigateToURL(shell(), net::FilePathToFileURL(test_path_));
std::string message;
NavigateToURL(shell(), GURL("javascript:start('" + url + "');"));
ASSERT_TRUE(message_queue.WaitForMessage(&message));
EXPECT_STREQ("\"SUCCESS\"", message.c_str()) << message;
}
private:
base::FilePath test_path_;
GPUTestBotConfig bot_config_;
GPUTestExpectationsParser test_expectations_;
};
#define CONFORMANCE_TEST(name, url) \
IN_PROC_BROWSER_TEST_F(WebGLConformanceTest, MANUAL_##name) { \
RunTest(url); \
}
// The test declarations are located in webgl_conformance_test_list_autogen.h,
// because the list is automatically generated by a script.
// See: generate_webgl_conformance_test_list.py
#include "webgl_conformance_test_list_autogen.h"
} // namespace content
|
Remove path check for webgl conformance tests.
|
Remove path check for webgl conformance tests.
We removed most of the steps, but random crashes are still happening.
This will be reverted after we finish the experimentation.
BUG=165269
TEST=win gpu bots
TBR=kbr
Review URL: https://codereview.chromium.org/12207088
git-svn-id: de016e52bd170d2d4f2344f9bf92d50478b649e0@181584 0039d316-1c4b-4281-b951-d872f2087c98
|
C++
|
bsd-3-clause
|
Jonekee/chromium.src,mogoweb/chromium-crosswalk,anirudhSK/chromium,TheTypoMaster/chromium-crosswalk,Pluto-tv/chromium-crosswalk,PeterWangIntel/chromium-crosswalk,bright-sparks/chromium-spacewalk,timopulkkinen/BubbleFish,Chilledheart/chromium,anirudhSK/chromium,Chilledheart/chromium,ChromiumWebApps/chromium,krieger-od/nwjs_chromium.src,mohamed--abdel-maksoud/chromium.src,jaruba/chromium.src,jaruba/chromium.src,markYoungH/chromium.src,ltilve/chromium,ondra-novak/chromium.src,Pluto-tv/chromium-crosswalk,patrickm/chromium.src,PeterWangIntel/chromium-crosswalk,dushu1203/chromium.src,Fireblend/chromium-crosswalk,Jonekee/chromium.src,Jonekee/chromium.src,ltilve/chromium,hgl888/chromium-crosswalk,fujunwei/chromium-crosswalk,hgl888/chromium-crosswalk-efl,zcbenz/cefode-chromium,Chilledheart/chromium,fujunwei/chromium-crosswalk,timopulkkinen/BubbleFish,pozdnyakov/chromium-crosswalk,hujiajie/pa-chromium,ChromiumWebApps/chromium,krieger-od/nwjs_chromium.src,anirudhSK/chromium,littlstar/chromium.src,crosswalk-project/chromium-crosswalk-efl,pozdnyakov/chromium-crosswalk,ondra-novak/chromium.src,hgl888/chromium-crosswalk-efl,dednal/chromium.src,Jonekee/chromium.src,markYoungH/chromium.src,timopulkkinen/BubbleFish,PeterWangIntel/chromium-crosswalk,PeterWangIntel/chromium-crosswalk,jaruba/chromium.src,Chilledheart/chromium,dednal/chromium.src,zcbenz/cefode-chromium,Jonekee/chromium.src,markYoungH/chromium.src,Chilledheart/chromium,chuan9/chromium-crosswalk,ChromiumWebApps/chromium,hgl888/chromium-crosswalk-efl,ltilve/chromium,bright-sparks/chromium-spacewalk,axinging/chromium-crosswalk,patrickm/chromium.src,crosswalk-project/chromium-crosswalk-efl,fujunwei/chromium-crosswalk,M4sse/chromium.src,ChromiumWebApps/chromium,Pluto-tv/chromium-crosswalk,mohamed--abdel-maksoud/chromium.src,littlstar/chromium.src,crosswalk-project/chromium-crosswalk-efl,TheTypoMaster/chromium-crosswalk,timopulkkinen/BubbleFish,zcbenz/cefode-chromium,Pluto-tv/chromium-crosswalk,Fireblend/chromium-crosswalk,mohamed--abdel-maksoud/chromium.src,anirudhSK/chromium,patrickm/chromium.src,dushu1203/chromium.src,hgl888/chromium-crosswalk-efl,anirudhSK/chromium,ltilve/chromium,markYoungH/chromium.src,Pluto-tv/chromium-crosswalk,Pluto-tv/chromium-crosswalk,Pluto-tv/chromium-crosswalk,patrickm/chromium.src,littlstar/chromium.src,hgl888/chromium-crosswalk,chuan9/chromium-crosswalk,dushu1203/chromium.src,M4sse/chromium.src,Fireblend/chromium-crosswalk,hgl888/chromium-crosswalk-efl,M4sse/chromium.src,zcbenz/cefode-chromium,pozdnyakov/chromium-crosswalk,Fireblend/chromium-crosswalk,jaruba/chromium.src,littlstar/chromium.src,patrickm/chromium.src,Just-D/chromium-1,littlstar/chromium.src,dushu1203/chromium.src,ChromiumWebApps/chromium,ondra-novak/chromium.src,TheTypoMaster/chromium-crosswalk,M4sse/chromium.src,ondra-novak/chromium.src,bright-sparks/chromium-spacewalk,Jonekee/chromium.src,krieger-od/nwjs_chromium.src,fujunwei/chromium-crosswalk,markYoungH/chromium.src,timopulkkinen/BubbleFish,TheTypoMaster/chromium-crosswalk,mogoweb/chromium-crosswalk,fujunwei/chromium-crosswalk,krieger-od/nwjs_chromium.src,hujiajie/pa-chromium,Jonekee/chromium.src,Just-D/chromium-1,Fireblend/chromium-crosswalk,Chilledheart/chromium,hujiajie/pa-chromium,ChromiumWebApps/chromium,Chilledheart/chromium,axinging/chromium-crosswalk,hgl888/chromium-crosswalk,hgl888/chromium-crosswalk-efl,chuan9/chromium-crosswalk,hujiajie/pa-chromium,chuan9/chromium-crosswalk,dushu1203/chromium.src,dushu1203/chromium.src,timopulkkinen/BubbleFish,PeterWangIntel/chromium-crosswalk,crosswalk-project/chromium-crosswalk-efl,timopulkkinen/BubbleFish,mohamed--abdel-maksoud/chromium.src,crosswalk-project/chromium-crosswalk-efl,bright-sparks/chromium-spacewalk,crosswalk-project/chromium-crosswalk-efl,krieger-od/nwjs_chromium.src,littlstar/chromium.src,Just-D/chromium-1,chuan9/chromium-crosswalk,ChromiumWebApps/chromium,ChromiumWebApps/chromium,zcbenz/cefode-chromium,hgl888/chromium-crosswalk-efl,ondra-novak/chromium.src,axinging/chromium-crosswalk,littlstar/chromium.src,pozdnyakov/chromium-crosswalk,hgl888/chromium-crosswalk,anirudhSK/chromium,Just-D/chromium-1,ltilve/chromium,mogoweb/chromium-crosswalk,hgl888/chromium-crosswalk-efl,ltilve/chromium,hujiajie/pa-chromium,timopulkkinen/BubbleFish,hgl888/chromium-crosswalk,patrickm/chromium.src,bright-sparks/chromium-spacewalk,markYoungH/chromium.src,jaruba/chromium.src,Just-D/chromium-1,anirudhSK/chromium,mogoweb/chromium-crosswalk,pozdnyakov/chromium-crosswalk,chuan9/chromium-crosswalk,PeterWangIntel/chromium-crosswalk,dushu1203/chromium.src,timopulkkinen/BubbleFish,axinging/chromium-crosswalk,mohamed--abdel-maksoud/chromium.src,dednal/chromium.src,dushu1203/chromium.src,anirudhSK/chromium,patrickm/chromium.src,anirudhSK/chromium,hgl888/chromium-crosswalk,TheTypoMaster/chromium-crosswalk,krieger-od/nwjs_chromium.src,mohamed--abdel-maksoud/chromium.src,pozdnyakov/chromium-crosswalk,fujunwei/chromium-crosswalk,hujiajie/pa-chromium,pozdnyakov/chromium-crosswalk,M4sse/chromium.src,Jonekee/chromium.src,TheTypoMaster/chromium-crosswalk,jaruba/chromium.src,M4sse/chromium.src,mogoweb/chromium-crosswalk,M4sse/chromium.src,dednal/chromium.src,ChromiumWebApps/chromium,mohamed--abdel-maksoud/chromium.src,TheTypoMaster/chromium-crosswalk,fujunwei/chromium-crosswalk,mohamed--abdel-maksoud/chromium.src,timopulkkinen/BubbleFish,jaruba/chromium.src,krieger-od/nwjs_chromium.src,M4sse/chromium.src,crosswalk-project/chromium-crosswalk-efl,Chilledheart/chromium,dushu1203/chromium.src,markYoungH/chromium.src,TheTypoMaster/chromium-crosswalk,Just-D/chromium-1,dednal/chromium.src,ChromiumWebApps/chromium,jaruba/chromium.src,ondra-novak/chromium.src,ChromiumWebApps/chromium,hujiajie/pa-chromium,axinging/chromium-crosswalk,mohamed--abdel-maksoud/chromium.src,M4sse/chromium.src,mogoweb/chromium-crosswalk,dednal/chromium.src,jaruba/chromium.src,hujiajie/pa-chromium,chuan9/chromium-crosswalk,axinging/chromium-crosswalk,chuan9/chromium-crosswalk,bright-sparks/chromium-spacewalk,crosswalk-project/chromium-crosswalk-efl,zcbenz/cefode-chromium,jaruba/chromium.src,Just-D/chromium-1,dednal/chromium.src,hgl888/chromium-crosswalk-efl,ondra-novak/chromium.src,Just-D/chromium-1,axinging/chromium-crosswalk,axinging/chromium-crosswalk,littlstar/chromium.src,PeterWangIntel/chromium-crosswalk,Pluto-tv/chromium-crosswalk,zcbenz/cefode-chromium,axinging/chromium-crosswalk,dushu1203/chromium.src,Fireblend/chromium-crosswalk,dednal/chromium.src,TheTypoMaster/chromium-crosswalk,mogoweb/chromium-crosswalk,crosswalk-project/chromium-crosswalk-efl,chuan9/chromium-crosswalk,ltilve/chromium,patrickm/chromium.src,zcbenz/cefode-chromium,mohamed--abdel-maksoud/chromium.src,Chilledheart/chromium,dushu1203/chromium.src,Jonekee/chromium.src,Jonekee/chromium.src,hgl888/chromium-crosswalk-efl,markYoungH/chromium.src,Jonekee/chromium.src,markYoungH/chromium.src,bright-sparks/chromium-spacewalk,timopulkkinen/BubbleFish,Fireblend/chromium-crosswalk,M4sse/chromium.src,anirudhSK/chromium,krieger-od/nwjs_chromium.src,Pluto-tv/chromium-crosswalk,ondra-novak/chromium.src,PeterWangIntel/chromium-crosswalk,krieger-od/nwjs_chromium.src,PeterWangIntel/chromium-crosswalk,ltilve/chromium,bright-sparks/chromium-spacewalk,fujunwei/chromium-crosswalk,ChromiumWebApps/chromium,hgl888/chromium-crosswalk,hgl888/chromium-crosswalk,jaruba/chromium.src,zcbenz/cefode-chromium,Fireblend/chromium-crosswalk,markYoungH/chromium.src,dednal/chromium.src,patrickm/chromium.src,dednal/chromium.src,dednal/chromium.src,ondra-novak/chromium.src,axinging/chromium-crosswalk,mogoweb/chromium-crosswalk,bright-sparks/chromium-spacewalk,hujiajie/pa-chromium,anirudhSK/chromium,ltilve/chromium,hujiajie/pa-chromium,axinging/chromium-crosswalk,pozdnyakov/chromium-crosswalk,mogoweb/chromium-crosswalk,zcbenz/cefode-chromium,mogoweb/chromium-crosswalk,pozdnyakov/chromium-crosswalk,hgl888/chromium-crosswalk,krieger-od/nwjs_chromium.src,hujiajie/pa-chromium,anirudhSK/chromium,krieger-od/nwjs_chromium.src,M4sse/chromium.src,Fireblend/chromium-crosswalk,mohamed--abdel-maksoud/chromium.src,markYoungH/chromium.src,fujunwei/chromium-crosswalk,zcbenz/cefode-chromium,Just-D/chromium-1,pozdnyakov/chromium-crosswalk,pozdnyakov/chromium-crosswalk
|
51d41a24f07a99ebf212916b859b79cb29345de1
|
Sources/hspp/Cards/Cards.cpp
|
Sources/hspp/Cards/Cards.cpp
|
// Copyright (c) 2018 Chris Ohk, Youngjoong Kim, SeungHyun Jeon
// We are making my contributions/submissions to this project solely in our
// personal capacity and are not conveying any rights to any intellectual
// property of any third parties.
#include <hspp/Cards/Card.h>
#include <hspp/Cards/Cards.h>
#include <hspp/Cards/Character.h>
#include <hspp/Commons/Macros.h>
#include <hspp/Loaders/CardLoader.h>
#include <hspp/Loaders/PowerLoader.h>
namespace Hearthstonepp
{
Cards* Cards::m_instance = nullptr;
Cards::Cards()
{
CardLoader cardLoader;
cardLoader.Load(m_cards);
PowerLoader powerLoader;
powerLoader.Load(m_cards);
}
Cards::~Cards()
{
for (auto card : m_cards)
{
delete card;
}
m_cards.clear();
}
Cards* Cards::GetInstance()
{
if (m_instance == nullptr)
{
m_instance = new Cards();
}
return m_instance;
}
const std::vector<Card*>& Cards::GetAllCards() const
{
return m_cards;
}
const Card* Cards::FindCardByID(const std::string& id)
{
for (auto card : m_cards)
{
if (card->id == id)
{
return card;
}
}
return nullptr;
}
std::vector<Card*> Cards::FindCardByRarity(Rarity rarity)
{
std::vector<Card*> result;
for (auto card : m_cards)
{
if (card->rarity == rarity)
{
result.emplace_back(card);
}
}
return result;
}
std::vector<Card*> Cards::FindCardByClass(CardClass cardClass)
{
std::vector<Card*> result;
for (auto card : m_cards)
{
if (card->cardClass == cardClass)
{
result.emplace_back(card);
}
}
return result;
}
std::vector<Card*> Cards::FindCardBySet(CardSet cardSet)
{
std::vector<Card*> result;
for (auto card : m_cards)
{
if (card->cardSet == cardSet)
{
result.emplace_back(card);
}
}
return result;
}
std::vector<Card*> Cards::FindCardByType(CardType cardType)
{
std::vector<Card*> result;
for (auto card : m_cards)
{
if (card->cardType == cardType)
{
result.emplace_back(card);
}
}
return result;
}
std::vector<Card*> Cards::FindCardByRace(Race race)
{
std::vector<Card*> result;
for (auto card : m_cards)
{
if (card->race == race)
{
result.emplace_back(card);
}
}
return result;
}
Card* Cards::FindCardByName(const std::string& name)
{
for (auto card : m_cards)
{
if (card->name == name)
{
return card;
}
}
return nullptr;
}
std::vector<Card*> Cards::FindCardByCost(size_t minVal, size_t maxVal)
{
std::vector<Card*> result;
for (auto card : m_cards)
{
if (card->cost >= minVal && card->cost <= maxVal)
{
result.emplace_back(card);
}
}
return result;
}
std::vector<Card*> Cards::FindCardByAttack(size_t minVal, size_t maxVal)
{
std::vector<Card*> result;
for (auto card : m_cards)
{
#ifndef HEARTHSTONEPP_MACOSX
if (!card->attack.has_value())
#else
if (card->attack == std::experimental::nullopt)
#endif
{
continue;
}
#ifndef HEARTHSTONEPP_MACOSX
if (card->attack.value() >= minVal && card->attack.value() <= maxVal)
#else
if (*(card->attack) >= minVal && *(card->attack) <= maxVal)
#endif
{
result.emplace_back(card);
}
}
return result;
}
std::vector<Card*> Cards::FindCardByHealth(size_t minVal, size_t maxVal)
{
std::vector<Card*> result;
for (auto card : m_cards)
{
#ifndef HEARTHSTONEPP_MACOSX
if (!card->health.has_value())
#else
if (card->health == std::experimental::nullopt)
#endif
{
continue;
}
#ifndef HEARTHSTONEPP_MACOSX
if (card->health.value() >= minVal && card->health.value() <= maxVal)
#else
if (*(card->health) >= minVal && *(card->health) <= maxVal)
#endif
{
result.emplace_back(card);
}
}
return result;
}
std::vector<Card*> Cards::FindCardBySpellDamage(size_t minVal, size_t maxVal)
{
std::vector<Card*> result;
for (auto card : m_cards)
{
#ifndef HEARTHSTONEPP_MACOSX
if (!card->spellDamage.has_value())
#else
if (card->spellDamage == std::experimental::nullopt)
#endif
{
continue;
}
#ifndef HEARTHSTONEPP_MACOSX
if (card->spellDamage.value() >= minVal &&
card->spellDamage.value() <= maxVal)
#else
if (*(card->spellDamage) >= minVal && *(card->spellDamage) <= maxVal)
#endif
{
result.emplace_back(card);
}
}
return result;
}
std::vector<Card*> Cards::FindCardByMechanics(std::vector<GameTag> mechanics)
{
std::vector<Card*> result;
for (auto card : m_cards)
{
auto mechanicsInCard = card->mechanics;
for (const auto mechanic : mechanics)
{
if (std::find(mechanicsInCard.begin(), mechanicsInCard.end(),
mechanic) != mechanicsInCard.end())
{
result.emplace_back(card);
}
}
}
return result;
}
const Card* Cards::GetHeroCard(CardClass cardClass)
{
switch (cardClass)
{
case CardClass::DRUID:
return FindCardByID("HERO_06");
case CardClass::HUNTER:
return FindCardByID("HERO_05");
case CardClass::MAGE:
return FindCardByID("HERO_08");
case CardClass::PALADIN:
return FindCardByID("HERO_04");
case CardClass::PRIEST:
return FindCardByID("HERO_09");
case CardClass::ROGUE:
return FindCardByID("HERO_03");
case CardClass::SHAMAN:
return FindCardByID("HERO_02");
case CardClass::WARLOCK:
return FindCardByID("HERO_07");
case CardClass::WARRIOR:
return FindCardByID("HERO_01");
default:
return nullptr;
}
}
const Card* Cards::GetDefaultHeroPower(CardClass cardClass)
{
switch (cardClass)
{
case CardClass::DRUID:
return FindCardByID("CS2_017");
case CardClass::HUNTER:
return FindCardByID("DS1h_292");
case CardClass::MAGE:
return FindCardByID("CS2_034");
case CardClass::PALADIN:
return FindCardByID("CS2_101");
case CardClass::PRIEST:
return FindCardByID("CS1h_001");
case CardClass::ROGUE:
return FindCardByID("CS2_083b");
case CardClass::SHAMAN:
return FindCardByID("CS2_049");
case CardClass::WARLOCK:
return FindCardByID("CS2_056");
case CardClass::WARRIOR:
return FindCardByID("CS2_102");
default:
return nullptr;
}
}
} // namespace Hearthstonepp
|
// Copyright (c) 2018 Chris Ohk, Youngjoong Kim, SeungHyun Jeon
// We are making my contributions/submissions to this project solely in our
// personal capacity and are not conveying any rights to any intellectual
// property of any third parties.
#include <hspp/Cards/Card.h>
#include <hspp/Cards/Cards.h>
#include <hspp/Cards/Character.h>
#include <hspp/Commons/Macros.h>
#include <hspp/Loaders/CardLoader.h>
#include <hspp/Loaders/PowerLoader.h>
namespace Hearthstonepp
{
Cards* Cards::m_instance = nullptr;
Cards::Cards()
{
CardLoader cardLoader;
cardLoader.Load(m_cards);
PowerLoader powerLoader;
powerLoader.Load(m_cards);
}
Cards::~Cards()
{
for (auto card : m_cards)
{
delete card;
}
m_cards.clear();
}
Cards* Cards::GetInstance()
{
if (m_instance == nullptr)
{
m_instance = new Cards();
}
return m_instance;
}
const std::vector<Card*>& Cards::GetAllCards() const
{
return m_cards;
}
const Card* Cards::FindCardByID(const std::string& id)
{
for (auto card : m_cards)
{
if (card->id == id)
{
return new Card(*card);
}
}
return nullptr;
}
std::vector<Card*> Cards::FindCardByRarity(Rarity rarity)
{
std::vector<Card*> result;
for (auto card : m_cards)
{
if (card->rarity == rarity)
{
result.emplace_back(new Card(*card));
}
}
return result;
}
std::vector<Card*> Cards::FindCardByClass(CardClass cardClass)
{
std::vector<Card*> result;
for (auto card : m_cards)
{
if (card->cardClass == cardClass)
{
result.emplace_back(new Card(*card));
}
}
return result;
}
std::vector<Card*> Cards::FindCardBySet(CardSet cardSet)
{
std::vector<Card*> result;
for (auto card : m_cards)
{
if (card->cardSet == cardSet)
{
result.emplace_back(new Card(*card));
}
}
return result;
}
std::vector<Card*> Cards::FindCardByType(CardType cardType)
{
std::vector<Card*> result;
for (auto card : m_cards)
{
if (card->cardType == cardType)
{
result.emplace_back(new Card(*card));
}
}
return result;
}
std::vector<Card*> Cards::FindCardByRace(Race race)
{
std::vector<Card*> result;
for (auto card : m_cards)
{
if (card->race == race)
{
result.emplace_back(new Card(*card));
}
}
return result;
}
Card* Cards::FindCardByName(const std::string& name)
{
for (auto card : m_cards)
{
if (card->name == name)
{
return new Card(*card);
}
}
return nullptr;
}
std::vector<Card*> Cards::FindCardByCost(size_t minVal, size_t maxVal)
{
std::vector<Card*> result;
for (auto card : m_cards)
{
if (card->cost >= minVal && card->cost <= maxVal)
{
result.emplace_back(new Card(*card));
}
}
return result;
}
std::vector<Card*> Cards::FindCardByAttack(size_t minVal, size_t maxVal)
{
std::vector<Card*> result;
for (auto card : m_cards)
{
#ifndef HEARTHSTONEPP_MACOSX
if (!card->attack.has_value())
#else
if (card->attack == std::experimental::nullopt)
#endif
{
continue;
}
#ifndef HEARTHSTONEPP_MACOSX
if (card->attack.value() >= minVal && card->attack.value() <= maxVal)
#else
if (*(card->attack) >= minVal && *(card->attack) <= maxVal)
#endif
{
result.emplace_back(new Card(*card));
}
}
return result;
}
std::vector<Card*> Cards::FindCardByHealth(size_t minVal, size_t maxVal)
{
std::vector<Card*> result;
for (auto card : m_cards)
{
#ifndef HEARTHSTONEPP_MACOSX
if (!card->health.has_value())
#else
if (card->health == std::experimental::nullopt)
#endif
{
continue;
}
#ifndef HEARTHSTONEPP_MACOSX
if (card->health.value() >= minVal && card->health.value() <= maxVal)
#else
if (*(card->health) >= minVal && *(card->health) <= maxVal)
#endif
{
result.emplace_back(new Card(*card));
}
}
return result;
}
std::vector<Card*> Cards::FindCardBySpellDamage(size_t minVal, size_t maxVal)
{
std::vector<Card*> result;
for (auto card : m_cards)
{
#ifndef HEARTHSTONEPP_MACOSX
if (!card->spellDamage.has_value())
#else
if (card->spellDamage == std::experimental::nullopt)
#endif
{
continue;
}
#ifndef HEARTHSTONEPP_MACOSX
if (card->spellDamage.value() >= minVal &&
card->spellDamage.value() <= maxVal)
#else
if (*(card->spellDamage) >= minVal && *(card->spellDamage) <= maxVal)
#endif
{
result.emplace_back(new Card(*card));
}
}
return result;
}
std::vector<Card*> Cards::FindCardByMechanics(std::vector<GameTag> mechanics)
{
std::vector<Card*> result;
for (auto card : m_cards)
{
auto mechanicsInCard = card->mechanics;
for (const auto mechanic : mechanics)
{
if (std::find(mechanicsInCard.begin(), mechanicsInCard.end(),
mechanic) != mechanicsInCard.end())
{
result.emplace_back(new Card(*card));
}
}
}
return result;
}
const Card* Cards::GetHeroCard(CardClass cardClass)
{
switch (cardClass)
{
case CardClass::DRUID:
return FindCardByID("HERO_06");
case CardClass::HUNTER:
return FindCardByID("HERO_05");
case CardClass::MAGE:
return FindCardByID("HERO_08");
case CardClass::PALADIN:
return FindCardByID("HERO_04");
case CardClass::PRIEST:
return FindCardByID("HERO_09");
case CardClass::ROGUE:
return FindCardByID("HERO_03");
case CardClass::SHAMAN:
return FindCardByID("HERO_02");
case CardClass::WARLOCK:
return FindCardByID("HERO_07");
case CardClass::WARRIOR:
return FindCardByID("HERO_01");
default:
return nullptr;
}
}
const Card* Cards::GetDefaultHeroPower(CardClass cardClass)
{
switch (cardClass)
{
case CardClass::DRUID:
return FindCardByID("CS2_017");
case CardClass::HUNTER:
return FindCardByID("DS1h_292");
case CardClass::MAGE:
return FindCardByID("CS2_034");
case CardClass::PALADIN:
return FindCardByID("CS2_101");
case CardClass::PRIEST:
return FindCardByID("CS1h_001");
case CardClass::ROGUE:
return FindCardByID("CS2_083b");
case CardClass::SHAMAN:
return FindCardByID("CS2_049");
case CardClass::WARLOCK:
return FindCardByID("CS2_056");
case CardClass::WARRIOR:
return FindCardByID("CS2_102");
default:
return nullptr;
}
}
} // namespace Hearthstonepp
|
Change card search result to dynamically allocated card using 'new'
|
fix: Change card search result to dynamically allocated card using 'new'
|
C++
|
mit
|
Hearthstonepp/Hearthstonepp,Hearthstonepp/Hearthstonepp
|
2829eac4343204ac572aba9f01f5e368e745bff7
|
src/process.cc
|
src/process.cc
|
#include "../include/memory.h"
#include "../include/process.h"
#include <dirent.h>
using std::array;
using std::string;
using std::unique_ptr;
using std::vector;
int Spawner::NormalTimer::cpid;
std::mutex Spawner::NormalTimer::lock;
string Spawner::receiveErrorMessage(int status, int fd) {
string message;
array<char, 4096> buff;
// Read errors from fd
ssize_t rc;
while ((rc = read(fd, buff.data(), buff.size())) > 0)
message.append(buff.data(), rc);
if (message.size()) // Error in tracee
THROW(message);
if (WIFEXITED(status))
message = concat("returned ",
toString(WEXITSTATUS(status)));
else if (WIFSIGNALED(status))
message = concat("killed by signal ", toString(WTERMSIG(status)), " - ",
strsignal(WTERMSIG(status)));
return message;
};
string getCWD() {
array<char, PATH_MAX> buff;
if (getcwd(buff.data(), buff.size()))
THROW("Failed to get CWD", error(errno));
if (buff[0] != '/') {
errno = ENOENT; // Improper path, but getcwd() succeed
THROW("Failed to get CWD", error(errno));
}
string res(buff.data());
if (res.back() != '/')
res += '/';
return res;
}
string getExec(pid_t pid) {
array<char, 4096> buff;
string path = concat("/proc/", toString(pid), "/exe");
ssize_t rc = readlink(path.c_str(), buff.data(), buff.size());
if ((rc == -1 && errno == ENAMETOOLONG)
|| rc >= static_cast<int>(buff.size()))
{
array<char, 65536> buff2;
rc = readlink(path.c_str(), buff2.data(), buff2.size());
if (rc == -1 || rc >= static_cast<int>(buff2.size()))
THROW("Failed: readlink()", error(errno));
return string(buff2.data(), rc);
} else if (rc == -1)
THROW("Failed: readlink()", error(errno));
return string(buff.data(), rc);
}
vector<pid_t> findProcessesByExec(string exec, bool include_me) {
if (exec.empty())
return {};
if (exec.front() != '/')
exec = concat(getCWD(), exec);
// Make exec absolute
exec = abspath(exec);
pid_t pid, my_pid = (include_me ? -1 : getpid());
DIR *dir = opendir("/proc");
if (dir == nullptr)
THROW("Cannot open /proc directory", error(errno));
// Process with deleted exec will have " (deleted)" suffix in result of
// readlink(2)
string exec_deleted = concat(exec, " (deleted)");
ssize_t buff_size = exec_deleted.size() + 1; // +1 - for terminating null
dirent *file;
vector<pid_t> res;
while ((file = readdir(dir)) != nullptr) {
if (!isDigit(file->d_name))
continue; // Not a process
pid = atoi(file->d_name);
if (pid == my_pid)
continue; // Do not need to check myself
// Process exe_path (/proc/pid/exe)
string exe_path = concat("/proc/", file->d_name, "/exe");
char buff[buff_size];
ssize_t len = readlink(exe_path.c_str(), buff, buff_size);
if (len == -1 || len >= buff_size)
continue; // Error or name too long
buff[len] = '\0';
if (exec == buff || exec_deleted == buff)
res.push_back(pid); // We have a match
}
closedir(dir);
return res;
}
string chdirToExecDir() {
string exec = getExec(getpid());
// Erase file component
size_t slash = exec.rfind('/');
if (slash < exec.size())
exec.erase(exec.begin() + slash + 1, exec.end()); // Erase filename
if (chdir(exec.c_str()) == -1)
THROW("chdir()", error(errno));
return exec;
}
int8_t detectArchitecture(pid_t pid) {
string filename = concat("/proc/", toString(pid), "/exe");
int fd = open(filename.c_str(), O_RDONLY | O_LARGEFILE);
if (fd == -1)
THROW("open('", filename, "')", error(errno));
Closer closer(fd);
// Read fourth byte and detect if 32 or 64 bit
unsigned char c;
if (lseek(fd, 4, SEEK_SET) == (off_t)-1)
THROW("lseek()", error(errno));
if (read(fd, &c, 1) != 1)
THROW("read()", error(errno));
if (c == 1)
return ARCH_i386;
if (c == 2)
return ARCH_x86_64;
THROW("Unsupported architecture");
}
|
#include "../include/memory.h"
#include "../include/process.h"
#include <dirent.h>
using std::array;
using std::string;
using std::unique_ptr;
using std::vector;
int Spawner::NormalTimer::cpid;
std::mutex Spawner::NormalTimer::lock;
string Spawner::receiveErrorMessage(int status, int fd) {
string message;
array<char, 4096> buff;
// Read errors from fd
ssize_t rc;
while ((rc = read(fd, buff.data(), buff.size())) > 0)
message.append(buff.data(), rc);
if (message.size()) // Error in tracee
THROW(message);
if (WIFEXITED(status))
message = concat("returned ",
toString(WEXITSTATUS(status)));
else if (WIFSIGNALED(status))
message = concat("killed by signal ", toString(WTERMSIG(status)), " - ",
strsignal(WTERMSIG(status)));
return message;
};
string getCWD() {
array<char, PATH_MAX> buff;
if (!getcwd(buff.data(), buff.size()))
THROW("Failed to get CWD", error(errno));
if (buff[0] != '/') {
errno = ENOENT; // Improper path, but getcwd() succeed
THROW("Failed to get CWD", error(errno));
}
string res(buff.data());
if (res.back() != '/')
res += '/';
return res;
}
string getExec(pid_t pid) {
array<char, 4096> buff;
string path = concat("/proc/", toString(pid), "/exe");
ssize_t rc = readlink(path.c_str(), buff.data(), buff.size());
if ((rc == -1 && errno == ENAMETOOLONG)
|| rc >= static_cast<int>(buff.size()))
{
array<char, 65536> buff2;
rc = readlink(path.c_str(), buff2.data(), buff2.size());
if (rc == -1 || rc >= static_cast<int>(buff2.size()))
THROW("Failed: readlink()", error(errno));
return string(buff2.data(), rc);
} else if (rc == -1)
THROW("Failed: readlink()", error(errno));
return string(buff.data(), rc);
}
vector<pid_t> findProcessesByExec(string exec, bool include_me) {
if (exec.empty())
return {};
if (exec.front() != '/')
exec = concat(getCWD(), exec);
// Make exec absolute
exec = abspath(exec);
pid_t pid, my_pid = (include_me ? -1 : getpid());
DIR *dir = opendir("/proc");
if (dir == nullptr)
THROW("Cannot open /proc directory", error(errno));
// Process with deleted exec will have " (deleted)" suffix in result of
// readlink(2)
string exec_deleted = concat(exec, " (deleted)");
ssize_t buff_size = exec_deleted.size() + 1; // +1 - for terminating null
dirent *file;
vector<pid_t> res;
while ((file = readdir(dir)) != nullptr) {
if (!isDigit(file->d_name))
continue; // Not a process
pid = atoi(file->d_name);
if (pid == my_pid)
continue; // Do not need to check myself
// Process exe_path (/proc/pid/exe)
string exe_path = concat("/proc/", file->d_name, "/exe");
char buff[buff_size];
ssize_t len = readlink(exe_path.c_str(), buff, buff_size);
if (len == -1 || len >= buff_size)
continue; // Error or name too long
buff[len] = '\0';
if (exec == buff || exec_deleted == buff)
res.push_back(pid); // We have a match
}
closedir(dir);
return res;
}
string chdirToExecDir() {
string exec = getExec(getpid());
// Erase file component
size_t slash = exec.rfind('/');
if (slash < exec.size())
exec.erase(exec.begin() + slash + 1, exec.end()); // Erase filename
if (chdir(exec.c_str()) == -1)
THROW("chdir()", error(errno));
return exec;
}
int8_t detectArchitecture(pid_t pid) {
string filename = concat("/proc/", toString(pid), "/exe");
int fd = open(filename.c_str(), O_RDONLY | O_LARGEFILE);
if (fd == -1)
THROW("open('", filename, "')", error(errno));
Closer closer(fd);
// Read fourth byte and detect if 32 or 64 bit
unsigned char c;
if (lseek(fd, 4, SEEK_SET) == (off_t)-1)
THROW("lseek()", error(errno));
if (read(fd, &c, 1) != 1)
THROW("read()", error(errno));
if (c == 1)
return ARCH_i386;
if (c == 2)
return ARCH_x86_64;
THROW("Unsupported architecture");
}
|
Fix regression
|
Fix regression
|
C++
|
mit
|
varqox/simlib,varqox/simlib,krzyk240/simlib,varqox/simlib,varqox/simlib,krzyk240/simlib
|
17e284569a2bd97abba050cbd3a3de3f4ce697b0
|
src/project.cc
|
src/project.cc
|
// Copyright 2014 Toggl Desktop developers.
#include "./project.h"
#include <sstream>
#include <ctime>
#include "Poco/String.h"
#include "Poco/NumberParser.h"
#include "./formatter.h"
namespace kopsik {
const char *known_colors[] = {
"#4dc3ff", "#bc85e6", "#df7baa", "#f68d38", "#b27636",
"#8ab734", "#14a88e", "#268bb5", "#6668b4", "#a4506c",
"#67412c", "#3c6526", "#094558", "#bc2d07", "#999999"
};
template<typename T, size_t N> T *end(T (&ra)[N]) {
return ra + N;
}
std::vector<std::string> Project::color_codes(known_colors, end(known_colors));
std::string Project::String() const {
std::stringstream ss;
ss << "ID=" << ID()
<< " local_id=" << LocalID()
<< " name=" << name_
<< " wid=" << wid_
<< " guid=" << GUID()
<< " active=" << active_;
return ss.str();
}
std::string Project::UppercaseName() const {
return Poco::toUpper(name_);
}
void Project::SetActive(const bool value) {
if (active_ != value) {
active_ = value;
SetDirty();
}
}
void Project::SetName(const std::string value) {
if (name_ != value) {
name_ = value;
SetDirty();
}
}
void Project::SetBillable(const bool value) {
if (billable_ != value) {
billable_ = value;
SetDirty();
}
}
void Project::SetColor(const std::string value) {
if (color_ != value) {
color_ = value;
SetDirty();
}
}
std::string Project::ColorCode() const {
int index(0);
if (!Poco::NumberParser::tryParse(Color(), index)) {
return color_codes.back();
}
if (!index) {
return color_codes.back();
}
return color_codes[index % color_codes.size()];
}
void Project::SetWID(const Poco::UInt64 value) {
if (wid_ != value) {
wid_ = value;
SetDirty();
}
}
void Project::SetCID(const Poco::UInt64 value) {
if (cid_ != value) {
cid_ = value;
SetDirty();
}
}
void Project::LoadFromJSONNode(JSONNODE * const data) {
poco_assert(data);
JSONNODE_ITERATOR current_node = json_begin(data);
JSONNODE_ITERATOR last_node = json_end(data);
while (current_node != last_node) {
json_char *node_name = json_name(*current_node);
if (strcmp(node_name, "id") == 0) {
SetID(json_as_int(*current_node));
} else if (strcmp(node_name, "name") == 0) {
SetName(std::string(json_as_string(*current_node)));
} else if (strcmp(node_name, "guid") == 0) {
SetGUID(std::string(json_as_string(*current_node)));
} else if (strcmp(node_name, "wid") == 0) {
SetWID(json_as_int(*current_node));
} else if (strcmp(node_name, "cid") == 0) {
SetCID(json_as_int(*current_node));
} else if (strcmp(node_name, "color") == 0) {
SetColor(std::string(json_as_string(*current_node)));
} else if (strcmp(node_name, "active") == 0) {
SetActive(json_as_bool(*current_node));
} else if (strcmp(node_name, "billable") == 0) {
SetBillable(json_as_bool(*current_node));
}
++current_node;
}
}
JSONNODE *Project::SaveToJSONNode() const {
JSONNODE *n = json_new(JSON_NODE);
json_set_name(n, ModelName().c_str());
if (ID()) {
json_push_back(n, json_new_i("id", (json_int_t)ID()));
}
json_push_back(n, json_new_a("name",
Formatter::EscapeJSONString(Name()).c_str()));
json_push_back(n, json_new_i("wid", (json_int_t)WID()));
json_push_back(n, json_new_a("guid", GUID().c_str()));
json_push_back(n, json_new_i("cid", (json_int_t)CID()));
json_push_back(n, json_new_b("billable", Billable()));
json_push_back(n, json_new_i("ui_modified_at",
(json_int_t)UIModifiedAt()));
return n;
}
bool Project::IsDuplicateResourceError(const kopsik::error err) const {
return (std::string::npos !=
std::string(err).find("Name has already been taken"));
}
} // namespace kopsik
|
// Copyright 2014 Toggl Desktop developers.
#include "./project.h"
#include <sstream>
#include <ctime>
#include "Poco/String.h"
#include "Poco/NumberParser.h"
#include "./formatter.h"
namespace kopsik {
const char *known_colors[] = {
"#4dc3ff", "#bc85e6", "#df7baa", "#f68d38", "#b27636",
"#8ab734", "#14a88e", "#268bb5", "#6668b4", "#a4506c",
"#67412c", "#3c6526", "#094558", "#bc2d07", "#999999"
};
template<typename T, size_t N> T *end(T (&ra)[N]) {
return ra + N;
}
std::vector<std::string> Project::color_codes(known_colors, end(known_colors));
std::string Project::String() const {
std::stringstream ss;
ss << "ID=" << ID()
<< " local_id=" << LocalID()
<< " name=" << name_
<< " wid=" << wid_
<< " guid=" << GUID()
<< " active=" << active_
<< " billable=" << billable_;
return ss.str();
}
std::string Project::UppercaseName() const {
return Poco::toUpper(name_);
}
void Project::SetActive(const bool value) {
if (active_ != value) {
active_ = value;
SetDirty();
}
}
void Project::SetName(const std::string value) {
if (name_ != value) {
name_ = value;
SetDirty();
}
}
void Project::SetBillable(const bool value) {
if (billable_ != value) {
billable_ = value;
SetDirty();
}
}
void Project::SetColor(const std::string value) {
if (color_ != value) {
color_ = value;
SetDirty();
}
}
std::string Project::ColorCode() const {
int index(0);
if (!Poco::NumberParser::tryParse(Color(), index)) {
return color_codes.back();
}
if (!index) {
return color_codes.back();
}
return color_codes[index % color_codes.size()];
}
void Project::SetWID(const Poco::UInt64 value) {
if (wid_ != value) {
wid_ = value;
SetDirty();
}
}
void Project::SetCID(const Poco::UInt64 value) {
if (cid_ != value) {
cid_ = value;
SetDirty();
}
}
void Project::LoadFromJSONNode(JSONNODE * const data) {
poco_assert(data);
JSONNODE_ITERATOR current_node = json_begin(data);
JSONNODE_ITERATOR last_node = json_end(data);
while (current_node != last_node) {
json_char *node_name = json_name(*current_node);
if (strcmp(node_name, "id") == 0) {
SetID(json_as_int(*current_node));
} else if (strcmp(node_name, "name") == 0) {
SetName(std::string(json_as_string(*current_node)));
} else if (strcmp(node_name, "guid") == 0) {
SetGUID(std::string(json_as_string(*current_node)));
} else if (strcmp(node_name, "wid") == 0) {
SetWID(json_as_int(*current_node));
} else if (strcmp(node_name, "cid") == 0) {
SetCID(json_as_int(*current_node));
} else if (strcmp(node_name, "color") == 0) {
SetColor(std::string(json_as_string(*current_node)));
} else if (strcmp(node_name, "active") == 0) {
SetActive(json_as_bool(*current_node));
} else if (strcmp(node_name, "billable") == 0) {
SetBillable(json_as_bool(*current_node));
}
++current_node;
}
}
JSONNODE *Project::SaveToJSONNode() const {
JSONNODE *n = json_new(JSON_NODE);
json_set_name(n, ModelName().c_str());
if (ID()) {
json_push_back(n, json_new_i("id", (json_int_t)ID()));
}
json_push_back(n, json_new_a("name",
Formatter::EscapeJSONString(Name()).c_str()));
json_push_back(n, json_new_i("wid", (json_int_t)WID()));
json_push_back(n, json_new_a("guid", GUID().c_str()));
json_push_back(n, json_new_i("cid", (json_int_t)CID()));
json_push_back(n, json_new_b("billable", Billable()));
json_push_back(n, json_new_i("ui_modified_at",
(json_int_t)UIModifiedAt()));
return n;
}
bool Project::IsDuplicateResourceError(const kopsik::error err) const {
return (std::string::npos !=
std::string(err).find("Name has already been taken"));
}
} // namespace kopsik
|
Print project billable flag
|
Print project billable flag
|
C++
|
bsd-3-clause
|
codeman38/toggldesktop,codeman38/toggldesktop,codeman38/toggldesktop,codeman38/toggldesktop,codeman38/toggldesktop,codeman38/toggldesktop
|
97af98678cc943050cf23951a66c89e922cf21c4
|
lib/CodeGen/SlotIndexes.cpp
|
lib/CodeGen/SlotIndexes.cpp
|
//===-- SlotIndexes.cpp - Slot Indexes Pass ------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#define DEBUG_TYPE "slotindexes"
#include "llvm/CodeGen/SlotIndexes.h"
#include "llvm/CodeGen/MachineFunction.h"
#include "llvm/Support/Debug.h"
#include "llvm/Support/raw_ostream.h"
#include "llvm/Support/ManagedStatic.h"
#include "llvm/Target/TargetInstrInfo.h"
using namespace llvm;
// Yep - these are thread safe. See the header for details.
namespace {
class EmptyIndexListEntry : public IndexListEntry {
public:
EmptyIndexListEntry() : IndexListEntry(EMPTY_KEY) {}
};
class TombstoneIndexListEntry : public IndexListEntry {
public:
TombstoneIndexListEntry() : IndexListEntry(TOMBSTONE_KEY) {}
};
// The following statics are thread safe. They're read only, and you
// can't step from them to any other list entries.
ManagedStatic<EmptyIndexListEntry> IndexListEntryEmptyKey;
ManagedStatic<TombstoneIndexListEntry> IndexListEntryTombstoneKey;
}
char SlotIndexes::ID = 0;
INITIALIZE_PASS(SlotIndexes, "slotindexes",
"Slot index numbering", false, false)
IndexListEntry* IndexListEntry::getEmptyKeyEntry() {
return &*IndexListEntryEmptyKey;
}
IndexListEntry* IndexListEntry::getTombstoneKeyEntry() {
return &*IndexListEntryTombstoneKey;
}
void SlotIndexes::getAnalysisUsage(AnalysisUsage &au) const {
au.setPreservesAll();
MachineFunctionPass::getAnalysisUsage(au);
}
void SlotIndexes::releaseMemory() {
mi2iMap.clear();
mbb2IdxMap.clear();
idx2MBBMap.clear();
clearList();
}
bool SlotIndexes::runOnMachineFunction(MachineFunction &fn) {
// Compute numbering as follows:
// Grab an iterator to the start of the index list.
// Iterate over all MBBs, and within each MBB all MIs, keeping the MI
// iterator in lock-step (though skipping it over indexes which have
// null pointers in the instruction field).
// At each iteration assert that the instruction pointed to in the index
// is the same one pointed to by the MI iterator. This
// FIXME: This can be simplified. The mi2iMap_, Idx2MBBMap, etc. should
// only need to be set up once after the first numbering is computed.
mf = &fn;
initList();
// Check that the list contains only the sentinal.
assert(indexListHead->getNext() == 0 &&
"Index list non-empty at initial numbering?");
assert(idx2MBBMap.empty() &&
"Index -> MBB mapping non-empty at initial numbering?");
assert(mbb2IdxMap.empty() &&
"MBB -> Index mapping non-empty at initial numbering?");
assert(mi2iMap.empty() &&
"MachineInstr -> Index mapping non-empty at initial numbering?");
functionSize = 0;
unsigned index = 0;
push_back(createEntry(0, index));
// Iterate over the function.
for (MachineFunction::iterator mbbItr = mf->begin(), mbbEnd = mf->end();
mbbItr != mbbEnd; ++mbbItr) {
MachineBasicBlock *mbb = &*mbbItr;
// Insert an index for the MBB start.
SlotIndex blockStartIndex(back(), SlotIndex::LOAD);
index += SlotIndex::NUM;
for (MachineBasicBlock::iterator miItr = mbb->begin(), miEnd = mbb->end();
miItr != miEnd; ++miItr) {
MachineInstr *mi = miItr;
if (mi->isDebugValue())
continue;
// Insert a store index for the instr.
push_back(createEntry(mi, index));
// Save this base index in the maps.
mi2iMap.insert(
std::make_pair(mi, SlotIndex(back(), SlotIndex::LOAD)));
++functionSize;
unsigned Slots = mi->getDesc().getNumDefs();
if (Slots == 0)
Slots = 1;
index += (Slots + 1) * SlotIndex::NUM;
}
// We insert two blank instructions between basic blocks.
// One to represent live-out registers and one to represent live-ins.
push_back(createEntry(0, index));
index += SlotIndex::NUM;
push_back(createEntry(0, index));
SlotIndex blockEndIndex(back(), SlotIndex::LOAD);
mbb2IdxMap.insert(
std::make_pair(mbb, std::make_pair(blockStartIndex, blockEndIndex)));
idx2MBBMap.push_back(IdxMBBPair(blockStartIndex, mbb));
}
// Sort the Idx2MBBMap
std::sort(idx2MBBMap.begin(), idx2MBBMap.end(), Idx2MBBCompare());
DEBUG(dump());
// And we're done!
return false;
}
void SlotIndexes::renumberIndexes() {
// Renumber updates the index of every element of the index list.
// If all instrs in the function have been allocated an index (which has been
// placed in the index list in the order of instruction iteration) then the
// resulting numbering will match what would have been generated by the
// pass during the initial numbering of the function if the new instructions
// had been present.
functionSize = 0;
unsigned index = 0;
for (IndexListEntry *curEntry = front(); curEntry != getTail();
curEntry = curEntry->getNext()) {
curEntry->setIndex(index);
if (curEntry->getInstr() == 0) {
// MBB start entry. Just step index by 1.
index += SlotIndex::NUM;
}
else {
++functionSize;
unsigned Slots = curEntry->getInstr()->getDesc().getNumDefs();
if (Slots == 0)
Slots = 1;
index += (Slots + 1) * SlotIndex::NUM;
}
}
}
void SlotIndexes::dump() const {
for (const IndexListEntry *itr = front(); itr != getTail();
itr = itr->getNext()) {
dbgs() << itr->getIndex() << " ";
if (itr->getInstr() != 0) {
dbgs() << *itr->getInstr();
} else {
dbgs() << "\n";
}
}
for (MBB2IdxMap::const_iterator itr = mbb2IdxMap.begin();
itr != mbb2IdxMap.end(); ++itr) {
dbgs() << "MBB " << itr->first->getNumber() << " (" << itr->first << ") - ["
<< itr->second.first << ", " << itr->second.second << "]\n";
}
}
// Print a SlotIndex to a raw_ostream.
void SlotIndex::print(raw_ostream &os) const {
os << entry().getIndex() << "LudS"[getSlot()];
}
// Dump a SlotIndex to stderr.
void SlotIndex::dump() const {
print(dbgs());
dbgs() << "\n";
}
|
//===-- SlotIndexes.cpp - Slot Indexes Pass ------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#define DEBUG_TYPE "slotindexes"
#include "llvm/CodeGen/SlotIndexes.h"
#include "llvm/CodeGen/MachineFunction.h"
#include "llvm/Support/Debug.h"
#include "llvm/Support/raw_ostream.h"
#include "llvm/Support/ManagedStatic.h"
#include "llvm/Target/TargetInstrInfo.h"
using namespace llvm;
// Yep - these are thread safe. See the header for details.
namespace {
class EmptyIndexListEntry : public IndexListEntry {
public:
EmptyIndexListEntry() : IndexListEntry(EMPTY_KEY) {}
};
class TombstoneIndexListEntry : public IndexListEntry {
public:
TombstoneIndexListEntry() : IndexListEntry(TOMBSTONE_KEY) {}
};
// The following statics are thread safe. They're read only, and you
// can't step from them to any other list entries.
ManagedStatic<EmptyIndexListEntry> IndexListEntryEmptyKey;
ManagedStatic<TombstoneIndexListEntry> IndexListEntryTombstoneKey;
}
char SlotIndexes::ID = 0;
INITIALIZE_PASS(SlotIndexes, "slotindexes",
"Slot index numbering", false, false)
IndexListEntry* IndexListEntry::getEmptyKeyEntry() {
return &*IndexListEntryEmptyKey;
}
IndexListEntry* IndexListEntry::getTombstoneKeyEntry() {
return &*IndexListEntryTombstoneKey;
}
void SlotIndexes::getAnalysisUsage(AnalysisUsage &au) const {
au.setPreservesAll();
MachineFunctionPass::getAnalysisUsage(au);
}
void SlotIndexes::releaseMemory() {
mi2iMap.clear();
mbb2IdxMap.clear();
idx2MBBMap.clear();
clearList();
}
bool SlotIndexes::runOnMachineFunction(MachineFunction &fn) {
// Compute numbering as follows:
// Grab an iterator to the start of the index list.
// Iterate over all MBBs, and within each MBB all MIs, keeping the MI
// iterator in lock-step (though skipping it over indexes which have
// null pointers in the instruction field).
// At each iteration assert that the instruction pointed to in the index
// is the same one pointed to by the MI iterator. This
// FIXME: This can be simplified. The mi2iMap_, Idx2MBBMap, etc. should
// only need to be set up once after the first numbering is computed.
mf = &fn;
initList();
// Check that the list contains only the sentinal.
assert(indexListHead->getNext() == 0 &&
"Index list non-empty at initial numbering?");
assert(idx2MBBMap.empty() &&
"Index -> MBB mapping non-empty at initial numbering?");
assert(mbb2IdxMap.empty() &&
"MBB -> Index mapping non-empty at initial numbering?");
assert(mi2iMap.empty() &&
"MachineInstr -> Index mapping non-empty at initial numbering?");
functionSize = 0;
unsigned index = 0;
push_back(createEntry(0, index));
// Iterate over the function.
for (MachineFunction::iterator mbbItr = mf->begin(), mbbEnd = mf->end();
mbbItr != mbbEnd; ++mbbItr) {
MachineBasicBlock *mbb = &*mbbItr;
// Insert an index for the MBB start.
SlotIndex blockStartIndex(back(), SlotIndex::LOAD);
index += SlotIndex::NUM;
for (MachineBasicBlock::iterator miItr = mbb->begin(), miEnd = mbb->end();
miItr != miEnd; ++miItr) {
MachineInstr *mi = miItr;
if (mi->isDebugValue())
continue;
// Insert a store index for the instr.
push_back(createEntry(mi, index));
// Save this base index in the maps.
mi2iMap.insert(
std::make_pair(mi, SlotIndex(back(), SlotIndex::LOAD)));
++functionSize;
unsigned Slots = mi->getDesc().getNumDefs();
if (Slots == 0)
Slots = 1;
index += (Slots + 1) * SlotIndex::NUM;
}
// We insert two blank instructions between basic blocks.
// One to represent live-out registers and one to represent live-ins.
push_back(createEntry(0, index));
index += SlotIndex::NUM;
push_back(createEntry(0, index));
SlotIndex blockEndIndex(back(), SlotIndex::LOAD);
mbb2IdxMap.insert(
std::make_pair(mbb, std::make_pair(blockStartIndex, blockEndIndex)));
idx2MBBMap.push_back(IdxMBBPair(blockStartIndex, mbb));
}
// Sort the Idx2MBBMap
std::sort(idx2MBBMap.begin(), idx2MBBMap.end(), Idx2MBBCompare());
DEBUG(dump());
// And we're done!
return false;
}
void SlotIndexes::renumberIndexes() {
// Renumber updates the index of every element of the index list.
// If all instrs in the function have been allocated an index (which has been
// placed in the index list in the order of instruction iteration) then the
// resulting numbering will match what would have been generated by the
// pass during the initial numbering of the function if the new instructions
// had been present.
DEBUG(dbgs() << "\n*** Renumbering SlotIndexes ***\n");
functionSize = 0;
unsigned index = 0;
for (IndexListEntry *curEntry = front(); curEntry != getTail();
curEntry = curEntry->getNext()) {
curEntry->setIndex(index);
if (curEntry->getInstr() == 0) {
// MBB start entry. Just step index by 1.
index += SlotIndex::NUM;
}
else {
++functionSize;
unsigned Slots = curEntry->getInstr()->getDesc().getNumDefs();
if (Slots == 0)
Slots = 1;
index += (Slots + 1) * SlotIndex::NUM;
}
}
}
void SlotIndexes::dump() const {
for (const IndexListEntry *itr = front(); itr != getTail();
itr = itr->getNext()) {
dbgs() << itr->getIndex() << " ";
if (itr->getInstr() != 0) {
dbgs() << *itr->getInstr();
} else {
dbgs() << "\n";
}
}
for (MBB2IdxMap::const_iterator itr = mbb2IdxMap.begin();
itr != mbb2IdxMap.end(); ++itr) {
dbgs() << "MBB " << itr->first->getNumber() << " (" << itr->first << ") - ["
<< itr->second.first << ", " << itr->second.second << "]\n";
}
}
// Print a SlotIndex to a raw_ostream.
void SlotIndex::print(raw_ostream &os) const {
if (isValid())
os << entry().getIndex() << "LudS"[getSlot()];
else
os << "invalid";
}
// Dump a SlotIndex to stderr.
void SlotIndex::dump() const {
print(dbgs());
dbgs() << "\n";
}
|
Tweak debug output from SlotIndexes.
|
Tweak debug output from SlotIndexes.
git-svn-id: 0ff597fd157e6f4fc38580e8d64ab130330d2411@124814 91177308-0d34-0410-b5e6-96231b3b80d8
|
C++
|
bsd-2-clause
|
dslab-epfl/asap,dslab-epfl/asap,dslab-epfl/asap,chubbymaggie/asap,llvm-mirror/llvm,apple/swift-llvm,llvm-mirror/llvm,dslab-epfl/asap,llvm-mirror/llvm,apple/swift-llvm,apple/swift-llvm,GPUOpen-Drivers/llvm,llvm-mirror/llvm,dslab-epfl/asap,chubbymaggie/asap,GPUOpen-Drivers/llvm,GPUOpen-Drivers/llvm,llvm-mirror/llvm,GPUOpen-Drivers/llvm,GPUOpen-Drivers/llvm,llvm-mirror/llvm,GPUOpen-Drivers/llvm,chubbymaggie/asap,llvm-mirror/llvm,llvm-mirror/llvm,chubbymaggie/asap,GPUOpen-Drivers/llvm,GPUOpen-Drivers/llvm,chubbymaggie/asap,apple/swift-llvm,apple/swift-llvm,apple/swift-llvm,llvm-mirror/llvm,apple/swift-llvm,dslab-epfl/asap,chubbymaggie/asap,dslab-epfl/asap,apple/swift-llvm
|
b6380006ba9395d30a2263a0a3467fc8bc9f52ba
|
src/lib/VSDFieldList.cpp
|
src/lib/VSDFieldList.cpp
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/*
* This file is part of the libvisio project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*/
#include <time.h>
#include "VSDCollector.h"
#include "VSDFieldList.h"
void libvisio::VSDTextField::handle(VSDCollector *collector) const
{
collector->collectTextField(m_id, m_level, m_nameId, m_formatStringId);
}
libvisio::VSDFieldListElement *libvisio::VSDTextField::clone()
{
return new VSDTextField(m_id, m_level, m_nameId, m_formatStringId);
}
librevenge::RVNGString libvisio::VSDTextField::getString(const std::map<unsigned, librevenge::RVNGString> &strVec)
{
auto iter = strVec.find(m_nameId);
if (iter != strVec.end())
return iter->second;
else
return librevenge::RVNGString();
}
void libvisio::VSDTextField::setNameId(int nameId)
{
m_nameId = nameId;
}
void libvisio::VSDNumericField::handle(VSDCollector *collector) const
{
collector->collectNumericField(m_id, m_level, m_format, m_number, m_formatStringId);
}
libvisio::VSDFieldListElement *libvisio::VSDNumericField::clone()
{
return new VSDNumericField(m_id, m_level, m_format, m_number, m_formatStringId);
}
#define MAX_BUFFER 1024
librevenge::RVNGString libvisio::VSDNumericField::datetimeToString(const char *format, double datetime)
{
librevenge::RVNGString result;
char buffer[MAX_BUFFER];
auto timer = (time_t)(86400 * datetime - 2209161600.0);
const struct tm *const time = gmtime(&timer);
if (time)
{
strftime(&buffer[0], MAX_BUFFER-1, format, time);
result.append(&buffer[0]);
}
return result;
}
librevenge::RVNGString libvisio::VSDNumericField::getString(const std::map<unsigned, librevenge::RVNGString> &)
{
if (m_format == 0xffff)
return librevenge::RVNGString();
switch (m_format)
{
case VSD_FIELD_FORMAT_DateMDYY:
case VSD_FIELD_FORMAT_DateMMDDYY:
case VSD_FIELD_FORMAT_DateMmmDYYYY:
case VSD_FIELD_FORMAT_DateMmmmDYYYY:
case VSD_FIELD_FORMAT_DateDMYY:
case VSD_FIELD_FORMAT_DateDDMMYY:
case VSD_FIELD_FORMAT_DateDMMMYYYY:
case VSD_FIELD_FORMAT_DateDMMMMYYYY:
case VSD_FIELD_FORMAT_Dateyyyymd:
case VSD_FIELD_FORMAT_Dateyymmdd:
case VSD_FIELD_FORMAT_DateTWNfYYYYMMDDD_C:
case VSD_FIELD_FORMAT_DateTWNsYYYYMMDDD_C:
case VSD_FIELD_FORMAT_DateTWNfyyyymmddww_C:
case VSD_FIELD_FORMAT_DateTWNfyyyymmdd_C:
case VSD_FIELD_FORMAT_Dategggemdww_J:
case VSD_FIELD_FORMAT_Dateyyyymdww_J:
case VSD_FIELD_FORMAT_Dategggemd_J:
case VSD_FIELD_FORMAT_Dateyyyymd_J:
case VSD_FIELD_FORMAT_DateYYYYMMMDDDWWW_C:
case VSD_FIELD_FORMAT_DateYYYYMMMDDD_C:
case VSD_FIELD_FORMAT_DategeMMMMddddww_K:
case VSD_FIELD_FORMAT_Dateyyyymdww_K:
case VSD_FIELD_FORMAT_DategeMMMMddd_K:
case VSD_FIELD_FORMAT_Dateyyyymd_K:
case VSD_FIELD_FORMAT_Dateyyyy_m_d:
case VSD_FIELD_FORMAT_Dateyy_mm_dd:
case VSD_FIELD_FORMAT_Dateyyyymd_S:
case VSD_FIELD_FORMAT_Dateyyyymmdd_S:
case VSD_FIELD_FORMAT_Datewwyyyymmdd_S:
case VSD_FIELD_FORMAT_Datewwyyyymd_S:
case VSD_FIELD_FORMAT_MsoDateShort:
case VSD_FIELD_FORMAT_MsoDateLongDay:
case VSD_FIELD_FORMAT_MsoDateLong:
case VSD_FIELD_FORMAT_MsoDateShortAlt:
case VSD_FIELD_FORMAT_MsoDateISO:
case VSD_FIELD_FORMAT_MsoDateShortMon:
case VSD_FIELD_FORMAT_MsoDateShortSlash:
case VSD_FIELD_FORMAT_MsoDateShortAbb:
case VSD_FIELD_FORMAT_MsoDateEnglish:
case VSD_FIELD_FORMAT_MsoDateMonthYr:
case VSD_FIELD_FORMAT_MsoDateMon_Yr:
return datetimeToString("%x", m_number);
case VSD_FIELD_FORMAT_TimeGen:
case VSD_FIELD_FORMAT_TimeHMM:
case VSD_FIELD_FORMAT_TimeHHMM:
case VSD_FIELD_FORMAT_TimeHMM24:
case VSD_FIELD_FORMAT_TimeHHMM24:
case VSD_FIELD_FORMAT_TimeHMMAMPM:
case VSD_FIELD_FORMAT_TimeHHMMAMPM:
case VSD_FIELD_FORMAT_TimeAMPMhmm_J:
case VSD_FIELD_FORMAT_TimeAMPMhmm_C:
case VSD_FIELD_FORMAT_TimeAMPMhmm_K:
case VSD_FIELD_FORMAT_TimeAMPM_hmm_J:
case VSD_FIELD_FORMAT_Timehmm_J:
case VSD_FIELD_FORMAT_TimeAMPM_hmm_C:
case VSD_FIELD_FORMAT_Timehmm_C:
case VSD_FIELD_FORMAT_TimeAMPM_hmm_K:
case VSD_FIELD_FORMAT_Timehmm_K:
case VSD_FIELD_FORMAT_TimeHMMAMPM_E:
case VSD_FIELD_FORMAT_TimeHHMMAMPM_E:
case VSD_FIELD_FORMAT_TimeAMPMhmm_S:
case VSD_FIELD_FORMAT_TimeAMPMhhmm_S:
case VSD_FIELD_FORMAT_MsoTimePM:
case VSD_FIELD_FORMAT_MsoTimeSecPM:
case VSD_FIELD_FORMAT_MsoTime24:
case VSD_FIELD_FORMAT_MsoTimeSec24:
return datetimeToString("%X", m_number);
case VSD_FIELD_FORMAT_MsoTimeDatePM:
case VSD_FIELD_FORMAT_MsoTimeDateSecPM:
return datetimeToString("%x %X", m_number);
default:
{
librevenge::RVNGString result;
librevenge::RVNGProperty *pProp = librevenge::RVNGPropertyFactory::newDoubleProp(m_number);
if (pProp)
{
result = pProp->getStr();
delete pProp;
}
return result;
}
}
}
void libvisio::VSDNumericField::setFormat(unsigned short format)
{
m_format = format;
}
void libvisio::VSDNumericField::setValue(double number)
{
m_number = number;
}
libvisio::VSDFieldList::VSDFieldList() :
m_elements(),
m_elementsOrder(),
m_id(0),
m_level(0)
{
}
libvisio::VSDFieldList::VSDFieldList(const libvisio::VSDFieldList &fieldList) :
m_elements(),
m_elementsOrder(fieldList.m_elementsOrder),
m_id(fieldList.m_id),
m_level(fieldList.m_level)
{
for (auto iter = fieldList.m_elements.begin(); iter != fieldList.m_elements.end(); ++iter)
m_elements[iter->first] = iter->second->clone();
}
libvisio::VSDFieldList &libvisio::VSDFieldList::operator=(const libvisio::VSDFieldList &fieldList)
{
if (this != &fieldList)
{
clear();
for (auto iter = fieldList.m_elements.begin(); iter != fieldList.m_elements.end(); ++iter)
m_elements[iter->first] = iter->second->clone();
m_elementsOrder = fieldList.m_elementsOrder;
m_id = fieldList.m_id;
m_level = fieldList.m_level;
}
return *this;
}
libvisio::VSDFieldList::~VSDFieldList()
{
clear();
}
void libvisio::VSDFieldList::setElementsOrder(const std::vector<unsigned> &elementsOrder)
{
m_elementsOrder.clear();
for (unsigned int i : elementsOrder)
m_elementsOrder.push_back(i);
}
void libvisio::VSDFieldList::addFieldList(unsigned id, unsigned level)
{
m_id = id;
m_level = level;
}
void libvisio::VSDFieldList::addTextField(unsigned id, unsigned level, int nameId, int formatStringId)
{
if (m_elements.find(id) == m_elements.end())
m_elements[id] = new VSDTextField(id, level, nameId, formatStringId);
}
void libvisio::VSDFieldList::addNumericField(unsigned id, unsigned level, unsigned short format, double number, int formatStringId)
{
if (m_elements.find(id) == m_elements.end())
m_elements[id] = new VSDNumericField(id, level, format, number, formatStringId);
}
void libvisio::VSDFieldList::handle(VSDCollector *collector) const
{
if (empty())
return;
collector->collectFieldList(m_id, m_level);
std::map<unsigned, VSDFieldListElement *>::const_iterator iter;
if (!m_elementsOrder.empty())
{
for (unsigned int i : m_elementsOrder)
{
iter = m_elements.find(i);
if (iter != m_elements.end())
iter->second->handle(collector);
}
}
else
{
for (iter = m_elements.begin(); iter != m_elements.end(); ++iter)
iter->second->handle(collector);
}
}
void libvisio::VSDFieldList::clear()
{
for (auto &element : m_elements)
delete element.second;
m_elements.clear();
m_elementsOrder.clear();
}
libvisio::VSDFieldListElement *libvisio::VSDFieldList::getElement(unsigned index)
{
if (m_elementsOrder.size() > index)
index = m_elementsOrder[index];
std::map<unsigned, VSDFieldListElement *>::const_iterator iter = m_elements.find(index);
if (iter != m_elements.end())
return iter->second;
else
return nullptr;
}
/* vim:set shiftwidth=2 softtabstop=2 expandtab: */
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/*
* This file is part of the libvisio project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*/
#include <time.h>
#include "VSDCollector.h"
#include "VSDFieldList.h"
void libvisio::VSDTextField::handle(VSDCollector *collector) const
{
collector->collectTextField(m_id, m_level, m_nameId, m_formatStringId);
}
libvisio::VSDFieldListElement *libvisio::VSDTextField::clone()
{
return new VSDTextField(m_id, m_level, m_nameId, m_formatStringId);
}
librevenge::RVNGString libvisio::VSDTextField::getString(const std::map<unsigned, librevenge::RVNGString> &strVec)
{
auto iter = strVec.find(m_nameId);
if (iter != strVec.end())
return iter->second;
else
return librevenge::RVNGString();
}
void libvisio::VSDTextField::setNameId(int nameId)
{
m_nameId = nameId;
}
void libvisio::VSDNumericField::handle(VSDCollector *collector) const
{
collector->collectNumericField(m_id, m_level, m_format, m_number, m_formatStringId);
}
libvisio::VSDFieldListElement *libvisio::VSDNumericField::clone()
{
return new VSDNumericField(m_id, m_level, m_format, m_number, m_formatStringId);
}
#define MAX_BUFFER 1024
librevenge::RVNGString libvisio::VSDNumericField::datetimeToString(const char *format, double datetime)
{
librevenge::RVNGString result;
char buffer[MAX_BUFFER];
auto timer = (time_t)(86400 * datetime - 2209161600.0);
const struct tm *const time = gmtime(&timer);
if (time)
{
strftime(&buffer[0], MAX_BUFFER-1, format, time);
result.append(&buffer[0]);
}
return result;
}
librevenge::RVNGString libvisio::VSDNumericField::getString(const std::map<unsigned, librevenge::RVNGString> &)
{
if (m_format == 0xffff)
return librevenge::RVNGString();
switch (m_format)
{
case VSD_FIELD_FORMAT_DateMDYY:
case VSD_FIELD_FORMAT_DateMMDDYY:
case VSD_FIELD_FORMAT_DateMmmDYYYY:
case VSD_FIELD_FORMAT_DateMmmmDYYYY:
case VSD_FIELD_FORMAT_DateDMYY:
case VSD_FIELD_FORMAT_DateDDMMYY:
case VSD_FIELD_FORMAT_DateDMMMYYYY:
case VSD_FIELD_FORMAT_DateDMMMMYYYY:
case VSD_FIELD_FORMAT_Dateyyyymd:
case VSD_FIELD_FORMAT_Dateyymmdd:
case VSD_FIELD_FORMAT_DateTWNfYYYYMMDDD_C:
case VSD_FIELD_FORMAT_DateTWNsYYYYMMDDD_C:
case VSD_FIELD_FORMAT_DateTWNfyyyymmddww_C:
case VSD_FIELD_FORMAT_DateTWNfyyyymmdd_C:
case VSD_FIELD_FORMAT_Dategggemdww_J:
case VSD_FIELD_FORMAT_Dateyyyymdww_J:
case VSD_FIELD_FORMAT_Dategggemd_J:
case VSD_FIELD_FORMAT_Dateyyyymd_J:
case VSD_FIELD_FORMAT_DateYYYYMMMDDDWWW_C:
case VSD_FIELD_FORMAT_DateYYYYMMMDDD_C:
case VSD_FIELD_FORMAT_DategeMMMMddddww_K:
case VSD_FIELD_FORMAT_Dateyyyymdww_K:
case VSD_FIELD_FORMAT_DategeMMMMddd_K:
case VSD_FIELD_FORMAT_Dateyyyymd_K:
case VSD_FIELD_FORMAT_Dateyyyy_m_d:
case VSD_FIELD_FORMAT_Dateyy_mm_dd:
case VSD_FIELD_FORMAT_Dateyyyymd_S:
case VSD_FIELD_FORMAT_Dateyyyymmdd_S:
case VSD_FIELD_FORMAT_Datewwyyyymmdd_S:
case VSD_FIELD_FORMAT_Datewwyyyymd_S:
case VSD_FIELD_FORMAT_MsoDateShort:
case VSD_FIELD_FORMAT_MsoDateLongDay:
case VSD_FIELD_FORMAT_MsoDateLong:
case VSD_FIELD_FORMAT_MsoDateShortAlt:
case VSD_FIELD_FORMAT_MsoDateISO:
case VSD_FIELD_FORMAT_MsoDateShortMon:
case VSD_FIELD_FORMAT_MsoDateShortSlash:
case VSD_FIELD_FORMAT_MsoDateShortAbb:
case VSD_FIELD_FORMAT_MsoDateEnglish:
case VSD_FIELD_FORMAT_MsoDateMonthYr:
case VSD_FIELD_FORMAT_MsoDateMon_Yr:
return datetimeToString("%x", m_number);
case VSD_FIELD_FORMAT_TimeGen:
case VSD_FIELD_FORMAT_TimeHMM:
case VSD_FIELD_FORMAT_TimeHHMM:
case VSD_FIELD_FORMAT_TimeHMM24:
case VSD_FIELD_FORMAT_TimeHHMM24:
case VSD_FIELD_FORMAT_TimeHMMAMPM:
case VSD_FIELD_FORMAT_TimeHHMMAMPM:
case VSD_FIELD_FORMAT_TimeAMPMhmm_J:
case VSD_FIELD_FORMAT_TimeAMPMhmm_C:
case VSD_FIELD_FORMAT_TimeAMPMhmm_K:
case VSD_FIELD_FORMAT_TimeAMPM_hmm_J:
case VSD_FIELD_FORMAT_Timehmm_J:
case VSD_FIELD_FORMAT_TimeAMPM_hmm_C:
case VSD_FIELD_FORMAT_Timehmm_C:
case VSD_FIELD_FORMAT_TimeAMPM_hmm_K:
case VSD_FIELD_FORMAT_Timehmm_K:
case VSD_FIELD_FORMAT_TimeHMMAMPM_E:
case VSD_FIELD_FORMAT_TimeHHMMAMPM_E:
case VSD_FIELD_FORMAT_TimeAMPMhmm_S:
case VSD_FIELD_FORMAT_TimeAMPMhhmm_S:
case VSD_FIELD_FORMAT_MsoTimePM:
case VSD_FIELD_FORMAT_MsoTimeSecPM:
case VSD_FIELD_FORMAT_MsoTime24:
case VSD_FIELD_FORMAT_MsoTimeSec24:
return datetimeToString("%X", m_number);
case VSD_FIELD_FORMAT_MsoTimeDatePM:
case VSD_FIELD_FORMAT_MsoTimeDateSecPM:
return datetimeToString("%x %X", m_number);
default:
{
librevenge::RVNGString result;
std::unique_ptr<librevenge::RVNGProperty> pProp{librevenge::RVNGPropertyFactory::newDoubleProp(m_number)};
if (pProp)
result = pProp->getStr();
return result;
}
}
}
void libvisio::VSDNumericField::setFormat(unsigned short format)
{
m_format = format;
}
void libvisio::VSDNumericField::setValue(double number)
{
m_number = number;
}
libvisio::VSDFieldList::VSDFieldList() :
m_elements(),
m_elementsOrder(),
m_id(0),
m_level(0)
{
}
libvisio::VSDFieldList::VSDFieldList(const libvisio::VSDFieldList &fieldList) :
m_elements(),
m_elementsOrder(fieldList.m_elementsOrder),
m_id(fieldList.m_id),
m_level(fieldList.m_level)
{
for (auto iter = fieldList.m_elements.begin(); iter != fieldList.m_elements.end(); ++iter)
m_elements[iter->first] = iter->second->clone();
}
libvisio::VSDFieldList &libvisio::VSDFieldList::operator=(const libvisio::VSDFieldList &fieldList)
{
if (this != &fieldList)
{
clear();
for (auto iter = fieldList.m_elements.begin(); iter != fieldList.m_elements.end(); ++iter)
m_elements[iter->first] = iter->second->clone();
m_elementsOrder = fieldList.m_elementsOrder;
m_id = fieldList.m_id;
m_level = fieldList.m_level;
}
return *this;
}
libvisio::VSDFieldList::~VSDFieldList()
{
clear();
}
void libvisio::VSDFieldList::setElementsOrder(const std::vector<unsigned> &elementsOrder)
{
m_elementsOrder.clear();
for (unsigned int i : elementsOrder)
m_elementsOrder.push_back(i);
}
void libvisio::VSDFieldList::addFieldList(unsigned id, unsigned level)
{
m_id = id;
m_level = level;
}
void libvisio::VSDFieldList::addTextField(unsigned id, unsigned level, int nameId, int formatStringId)
{
if (m_elements.find(id) == m_elements.end())
m_elements[id] = new VSDTextField(id, level, nameId, formatStringId);
}
void libvisio::VSDFieldList::addNumericField(unsigned id, unsigned level, unsigned short format, double number, int formatStringId)
{
if (m_elements.find(id) == m_elements.end())
m_elements[id] = new VSDNumericField(id, level, format, number, formatStringId);
}
void libvisio::VSDFieldList::handle(VSDCollector *collector) const
{
if (empty())
return;
collector->collectFieldList(m_id, m_level);
std::map<unsigned, VSDFieldListElement *>::const_iterator iter;
if (!m_elementsOrder.empty())
{
for (unsigned int i : m_elementsOrder)
{
iter = m_elements.find(i);
if (iter != m_elements.end())
iter->second->handle(collector);
}
}
else
{
for (iter = m_elements.begin(); iter != m_elements.end(); ++iter)
iter->second->handle(collector);
}
}
void libvisio::VSDFieldList::clear()
{
for (auto &element : m_elements)
delete element.second;
m_elements.clear();
m_elementsOrder.clear();
}
libvisio::VSDFieldListElement *libvisio::VSDFieldList::getElement(unsigned index)
{
if (m_elementsOrder.size() > index)
index = m_elementsOrder[index];
std::map<unsigned, VSDFieldListElement *>::const_iterator iter = m_elements.find(index);
if (iter != m_elements.end())
return iter->second;
else
return nullptr;
}
/* vim:set shiftwidth=2 softtabstop=2 expandtab: */
|
use unique_ptr
|
use unique_ptr
Change-Id: I15a0ece5b4a71fa82f23bff85ad9e5011129edf6
|
C++
|
mpl-2.0
|
LibreOffice/libvisio,LibreOffice/libvisio,LibreOffice/libvisio
|
0fc7a60186319088a8a609e9e65257136b00ea0b
|
c++/src/capnp/benchmark/capnproto-catrank.c++
|
c++/src/capnp/benchmark/capnproto-catrank.c++
|
// Copyright (c) 2013, Kenton Varda <[email protected]>
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// 1. Redistributions of source code must retain the above copyright notice, this
// list of conditions and the following disclaimer.
// 2. Redistributions in binary form must reproduce the above copyright notice,
// this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
// ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
// DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
// ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
// (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
// ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#include "catrank.capnp.h"
#include "capnproto-common.h"
namespace capnp {
namespace benchmark {
namespace capnp {
struct ScoredResult {
double score;
SearchResult::Reader result;
ScoredResult() = default;
ScoredResult(double score, SearchResult::Reader result): score(score), result(result) {}
inline bool operator<(const ScoredResult& other) const { return score > other.score; }
};
class CatRankTestCase {
public:
typedef SearchResultList Request;
typedef SearchResultList Response;
typedef int Expectation;
static int setupRequest(SearchResultList::Builder request) {
int count = fastRand(1000);
int goodCount = 0;
auto list = request.initResults(count);
for (int i = 0; i < count; i++) {
SearchResult::Builder result = list[i];
result.setScore(1000 - i);
int urlSize = fastRand(100);
static const char URL_PREFIX[] = "http://example.com/";
auto url = result.initUrl(urlSize + sizeof(URL_PREFIX));
strcpy(url.begin(), URL_PREFIX);
char* pos = url.begin() + strlen(URL_PREFIX);
for (int j = 0; j < urlSize; j++) {
*pos++ = 'a' + fastRand(26);
}
bool isCat = fastRand(8) == 0;
bool isDog = fastRand(8) == 0;
goodCount += isCat && !isDog;
static std::string snippet;
snippet.clear();
snippet.push_back(' ');
int prefix = fastRand(20);
for (int j = 0; j < prefix; j++) {
snippet.append(WORDS[fastRand(WORDS_COUNT)]);
}
if (isCat) snippet.append("cat ");
if (isDog) snippet.append("dog ");
int suffix = fastRand(20);
for (int j = 0; j < suffix; j++) {
snippet.append(WORDS[fastRand(WORDS_COUNT)]);
}
result.setSnippet(Text::Reader(snippet.c_str(), snippet.size()));
}
return goodCount;
}
static void handleRequest(SearchResultList::Reader request, SearchResultList::Builder response) {
std::vector<ScoredResult> scoredResults;
for (auto result: request.getResults()) {
double score = result.getScore();
if (strstr(result.getSnippet().cStr(), " cat ") != nullptr) {
score *= 10000;
}
if (strstr(result.getSnippet().cStr(), " dog ") != nullptr) {
score /= 10000;
}
scoredResults.emplace_back(score, result);
}
std::sort(scoredResults.begin(), scoredResults.end());
auto list = response.initResults(scoredResults.size());
auto iter = list.begin();
for (auto result: scoredResults) {
iter->setScore(result.score);
iter->setUrl(result.result.getUrl());
iter->setSnippet(result.result.getSnippet());
++iter;
}
}
static bool checkResponse(SearchResultList::Reader response, int expectedGoodCount) {
int goodCount = 0;
for (auto result: response.getResults()) {
if (result.getScore() > 1001) {
++goodCount;
} else {
break;
}
}
return goodCount == expectedGoodCount;
}
};
} // namespace capnp
} // namespace benchmark
} // namespace capnp
int main(int argc, char* argv[]) {
return capnp::benchmark::benchmarkMain<
capnp::benchmark::capnp::BenchmarkTypes,
capnp::benchmark::capnp::CatRankTestCase>(argc, argv);
}
|
// Copyright (c) 2013, Kenton Varda <[email protected]>
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// 1. Redistributions of source code must retain the above copyright notice, this
// list of conditions and the following disclaimer.
// 2. Redistributions in binary form must reproduce the above copyright notice,
// this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
// ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
// DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
// ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
// (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
// ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#include "catrank.capnp.h"
#include "capnproto-common.h"
namespace capnp {
namespace benchmark {
namespace capnp {
struct ScoredResult {
double score;
SearchResult::Reader result;
ScoredResult() = default;
ScoredResult(double score, SearchResult::Reader result): score(score), result(result) {}
inline bool operator<(const ScoredResult& other) const { return score > other.score; }
};
class CatRankTestCase {
public:
typedef SearchResultList Request;
typedef SearchResultList Response;
typedef int Expectation;
static int setupRequest(SearchResultList::Builder request) {
int count = fastRand(1000);
int goodCount = 0;
auto list = request.initResults(count);
for (int i = 0; i < count; i++) {
SearchResult::Builder result = list[i];
result.setScore(1000 - i);
int urlSize = fastRand(100);
static const char URL_PREFIX[] = "http://example.com/";
size_t urlPrefixLength = strlen(URL_PREFIX);
auto url = result.initUrl(urlSize + urlPrefixLength);
strcpy(url.begin(), URL_PREFIX);
char* pos = url.begin() + urlPrefixLength;
for (int j = 0; j < urlSize; j++) {
*pos++ = 'a' + fastRand(26);
}
bool isCat = fastRand(8) == 0;
bool isDog = fastRand(8) == 0;
goodCount += isCat && !isDog;
static std::string snippet;
snippet.clear();
snippet.push_back(' ');
int prefix = fastRand(20);
for (int j = 0; j < prefix; j++) {
snippet.append(WORDS[fastRand(WORDS_COUNT)]);
}
if (isCat) snippet.append("cat ");
if (isDog) snippet.append("dog ");
int suffix = fastRand(20);
for (int j = 0; j < suffix; j++) {
snippet.append(WORDS[fastRand(WORDS_COUNT)]);
}
result.setSnippet(Text::Reader(snippet.c_str(), snippet.size()));
}
return goodCount;
}
static void handleRequest(SearchResultList::Reader request, SearchResultList::Builder response) {
std::vector<ScoredResult> scoredResults;
for (auto result: request.getResults()) {
double score = result.getScore();
if (strstr(result.getSnippet().cStr(), " cat ") != nullptr) {
score *= 10000;
}
if (strstr(result.getSnippet().cStr(), " dog ") != nullptr) {
score /= 10000;
}
scoredResults.emplace_back(score, result);
}
std::sort(scoredResults.begin(), scoredResults.end());
auto list = response.initResults(scoredResults.size());
auto iter = list.begin();
for (auto result: scoredResults) {
iter->setScore(result.score);
iter->setUrl(result.result.getUrl());
iter->setSnippet(result.result.getSnippet());
++iter;
}
}
static bool checkResponse(SearchResultList::Reader response, int expectedGoodCount) {
int goodCount = 0;
for (auto result: response.getResults()) {
if (result.getScore() > 1001) {
++goodCount;
} else {
break;
}
}
return goodCount == expectedGoodCount;
}
};
} // namespace capnp
} // namespace benchmark
} // namespace capnp
int main(int argc, char* argv[]) {
return capnp::benchmark::benchmarkMain<
capnp::benchmark::capnp::BenchmarkTypes,
capnp::benchmark::capnp::CatRankTestCase>(argc, argv);
}
|
remove superfluous null terminator
|
remove superfluous null terminator
|
C++
|
mit
|
kamalmarhubi/capnproto,mologie/capnproto,ligzy/capnproto,ocdtrekkie/capnproto,bsn069/capnproto,modulexcite/capnproto,pjulien/capnproto,Fraser999/capnproto,zarvox/capnproto,khklau/capnproto,ocdtrekkie/capnproto,johnkdoe/capnproto,geofft/capnproto,rcrowder/capnproto,maurer/capnproto,Fraser999/capnproto,a-richardson/capnproto,artillery/capnproto,nagyistoce/capnproto,modulexcite/capnproto,mrdomino/capnproto,vladon/capnproto,khklau/capnproto,jparyani/capnproto,vladon/capnproto,jparyani/capnproto,nagyistoce/capnproto,mologie/capnproto,artillery/capnproto,hntrmrrs/capnproto,a-richardson/capnproto,johnkdoe/capnproto,bsn069/capnproto,artillery/capnproto,bryce-gibson/capnproto,kamalmarhubi/capnproto,rcrowder/capnproto,maurer/capnproto,MarPiRK/capnproto,pjulien/capnproto,martindale/capnproto,hntrmrrs/capnproto,zarvox/capnproto,joliss/capnproto,rcrowder/capnproto,modulexcite/capnproto,bryce-gibson/capnproto,khklau/capnproto,jparyani/capnproto,johnkdoe/capnproto,bsn069/capnproto,maurer/capnproto,MarPiRK/capnproto,bryce-gibson/capnproto,joliss/capnproto,nagyistoce/capnproto,a-richardson/capnproto,geofft/capnproto,mrdomino/capnproto,mologie/capnproto,ocdtrekkie/capnproto,hntrmrrs/capnproto,vladon/capnproto,MarPiRK/capnproto,Fraser999/capnproto,martindale/capnproto,joliss/capnproto,geofft/capnproto,mrdomino/capnproto,martindale/capnproto,pjulien/capnproto,zarvox/capnproto,kamalmarhubi/capnproto,ligzy/capnproto,ligzy/capnproto
|
deae38674d5a5a280b68b8cdd149cfab4b5bcaac
|
src/qt/researcher/researcherwizardmodepage.cpp
|
src/qt/researcher/researcherwizardmodepage.cpp
|
// Copyright (c) 2014-2021 The Gridcoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or https://opensource.org/licenses/mit-license.php.
#include "qt/decoration.h"
#include "qt/forms/ui_researcherwizardmodepage.h"
#include "qt/researcher/researchermodel.h"
#include "qt/researcher/researcherwizard.h"
#include "qt/researcher/researcherwizardmodepage.h"
// -----------------------------------------------------------------------------
// Class: ResearcherWizardModePage
// -----------------------------------------------------------------------------
ResearcherWizardModePage::ResearcherWizardModePage(QWidget *parent)
: QWizardPage(parent)
, ui(new Ui::ResearcherWizardModePage)
, m_researcher_model(nullptr)
{
ui->setupUi(this);
GRC::ScaleFontPointSize(ui->titleLabel, 16);
}
ResearcherWizardModePage::~ResearcherWizardModePage()
{
delete ui;
}
void ResearcherWizardModePage::setModel(ResearcherModel *model)
{
this->m_researcher_model = model;
}
void ResearcherWizardModePage::initializePage()
{
if (!m_researcher_model) {
return;
}
ui->modeButtonGroup->setId(ui->soloRadioButton, ResearcherWizard::ModeSolo);
ui->modeButtonGroup->setId(ui->poolRadioButton, ResearcherWizard::ModePool);
ui->modeButtonGroup->setId(ui->investorRadioButton, ResearcherWizard::ModeInvestor);
connect(ui->soloIconLabel, &ClickLabel::clicked, this, static_cast<void (ResearcherWizardModePage::*)()>(&ResearcherWizardModePage::selectSolo));
connect(ui->soloRadioButton, &QRadioButton::toggled, this, static_cast<void (ResearcherWizardModePage::*)(bool)>(&ResearcherWizardModePage::selectSolo));
connect(ui->poolIconLabel, &ClickLabel::clicked, this, static_cast<void (ResearcherWizardModePage::*)()>(&ResearcherWizardModePage::selectPool));
connect(ui->poolRadioButton, &QRadioButton::toggled, this, static_cast<void (ResearcherWizardModePage::*)(bool)>(&ResearcherWizardModePage::selectPool));
connect(ui->investorIconLabel, &ClickLabel::clicked, this, static_cast<void (ResearcherWizardModePage::*)()>(&ResearcherWizardModePage::selectInvestor));
connect(ui->investorRadioButton, &QRadioButton::toggled, this, static_cast<void (ResearcherWizardModePage::*)()>(&ResearcherWizardModePage::selectInvestor));
if (m_researcher_model->configuredForInvestorMode()) {
selectInvestor();
} else if (m_researcher_model->hasEligibleProjects()) {
selectSolo();
} else if (m_researcher_model->hasPoolProjects()) {
selectPool();
}
}
bool ResearcherWizardModePage::isComplete() const
{
return ui->modeButtonGroup->checkedId() != ResearcherWizard::ModeUnknown;
}
int ResearcherWizardModePage::nextId() const
{
return ResearcherWizard::GetNextIdByMode(ui->modeButtonGroup->checkedId());
}
void ResearcherWizardModePage::selectSolo()
{
ui->soloRadioButton->setChecked(true);
}
void ResearcherWizardModePage::selectSolo(bool checked)
{
const int icon_size = ui->soloIconLabel->width();
QIcon icon;
if (checked) {
icon = QIcon(":/images/ic_solo_active");
} else {
icon = QIcon(":/images/ic_solo_inactive");
}
ui->soloIconLabel->setPixmap(icon.pixmap(icon_size, icon_size));
emit completeChanged();
}
void ResearcherWizardModePage::selectPool()
{
ui->poolRadioButton->setChecked(true);
}
void ResearcherWizardModePage::selectPool(bool checked)
{
const int icon_size = ui->poolIconLabel->width();
QIcon icon;
if (checked) {
icon = QIcon(":/images/ic_pool_active");
} else {
icon = QIcon(":/images/ic_pool_inactive");
}
ui->poolIconLabel->setPixmap(icon.pixmap(icon_size, icon_size));
emit completeChanged();
}
void ResearcherWizardModePage::selectInvestor()
{
ui->investorRadioButton->setChecked(true);
}
void ResearcherWizardModePage::selectInvestor(bool checked)
{
const int icon_size = ui->investorIconLabel->width();
QIcon icon;
if (checked) {
icon = QIcon(":/images/ic_investor_active");
} else {
icon = QIcon(":/images/ic_investor_inactive");
}
ui->investorIconLabel->setPixmap(icon.pixmap(icon_size, icon_size));
emit completeChanged();
}
void ResearcherWizardModePage::on_detailLinkButton_clicked()
{
// This enables the page's beacon "renew" button to switch the current page
// back to beacon page. Since a wizard page cannot set the wizard's current
// index directly, this emits a signal that the wizard connects to the slot
// that changes the page for us:
//
emit detailLinkButtonClicked();
}
|
// Copyright (c) 2014-2021 The Gridcoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or https://opensource.org/licenses/mit-license.php.
#include "qt/decoration.h"
#include "qt/forms/ui_researcherwizardmodepage.h"
#include "qt/researcher/researchermodel.h"
#include "qt/researcher/researcherwizard.h"
#include "qt/researcher/researcherwizardmodepage.h"
// -----------------------------------------------------------------------------
// Class: ResearcherWizardModePage
// -----------------------------------------------------------------------------
ResearcherWizardModePage::ResearcherWizardModePage(QWidget *parent)
: QWizardPage(parent)
, ui(new Ui::ResearcherWizardModePage)
, m_researcher_model(nullptr)
{
ui->setupUi(this);
GRC::ScaleFontPointSize(ui->titleLabel, 16);
}
ResearcherWizardModePage::~ResearcherWizardModePage()
{
delete ui;
}
void ResearcherWizardModePage::setModel(ResearcherModel *model)
{
this->m_researcher_model = model;
}
void ResearcherWizardModePage::initializePage()
{
if (!m_researcher_model) {
return;
}
ui->modeButtonGroup->setId(ui->soloRadioButton, ResearcherWizard::ModeSolo);
ui->modeButtonGroup->setId(ui->poolRadioButton, ResearcherWizard::ModePool);
ui->modeButtonGroup->setId(ui->investorRadioButton, ResearcherWizard::ModeInvestor);
connect(ui->soloIconLabel, &ClickLabel::clicked, this, static_cast<void (ResearcherWizardModePage::*)()>(&ResearcherWizardModePage::selectSolo));
connect(ui->soloRadioButton, &QRadioButton::toggled, this, static_cast<void (ResearcherWizardModePage::*)(bool)>(&ResearcherWizardModePage::selectSolo));
connect(ui->poolIconLabel, &ClickLabel::clicked, this, static_cast<void (ResearcherWizardModePage::*)()>(&ResearcherWizardModePage::selectPool));
connect(ui->poolRadioButton, &QRadioButton::toggled, this, static_cast<void (ResearcherWizardModePage::*)(bool)>(&ResearcherWizardModePage::selectPool));
connect(ui->investorIconLabel, &ClickLabel::clicked, this, static_cast<void (ResearcherWizardModePage::*)()>(&ResearcherWizardModePage::selectInvestor));
connect(ui->investorRadioButton, &QRadioButton::toggled, this, static_cast<void (ResearcherWizardModePage::*)(bool)>(&ResearcherWizardModePage::selectInvestor));
if (m_researcher_model->configuredForInvestorMode()) {
selectInvestor();
} else if (m_researcher_model->hasEligibleProjects()) {
selectSolo();
} else if (m_researcher_model->hasPoolProjects()) {
selectPool();
}
}
bool ResearcherWizardModePage::isComplete() const
{
return ui->modeButtonGroup->checkedId() != ResearcherWizard::ModeUnknown;
}
int ResearcherWizardModePage::nextId() const
{
return ResearcherWizard::GetNextIdByMode(ui->modeButtonGroup->checkedId());
}
void ResearcherWizardModePage::selectSolo()
{
ui->soloRadioButton->setChecked(true);
}
void ResearcherWizardModePage::selectSolo(bool checked)
{
const int icon_size = ui->soloIconLabel->width();
QIcon icon;
if (checked) {
icon = QIcon(":/images/ic_solo_active");
} else {
icon = QIcon(":/images/ic_solo_inactive");
}
ui->soloIconLabel->setPixmap(icon.pixmap(icon_size, icon_size));
emit completeChanged();
}
void ResearcherWizardModePage::selectPool()
{
ui->poolRadioButton->setChecked(true);
}
void ResearcherWizardModePage::selectPool(bool checked)
{
const int icon_size = ui->poolIconLabel->width();
QIcon icon;
if (checked) {
icon = QIcon(":/images/ic_pool_active");
} else {
icon = QIcon(":/images/ic_pool_inactive");
}
ui->poolIconLabel->setPixmap(icon.pixmap(icon_size, icon_size));
emit completeChanged();
}
void ResearcherWizardModePage::selectInvestor()
{
ui->investorRadioButton->setChecked(true);
}
void ResearcherWizardModePage::selectInvestor(bool checked)
{
const int icon_size = ui->investorIconLabel->width();
QIcon icon;
if (checked) {
icon = QIcon(":/images/ic_investor_active");
} else {
icon = QIcon(":/images/ic_investor_inactive");
}
ui->investorIconLabel->setPixmap(icon.pixmap(icon_size, icon_size));
emit completeChanged();
}
void ResearcherWizardModePage::on_detailLinkButton_clicked()
{
// This enables the page's beacon "renew" button to switch the current page
// back to beacon page. Since a wizard page cannot set the wizard's current
// index directly, this emits a signal that the wizard connects to the slot
// that changes the page for us:
//
emit detailLinkButtonClicked();
}
|
fix broken research wizard signal
|
qt: fix broken research wizard signal
|
C++
|
mit
|
caraka/gridcoinresearch,caraka/gridcoinresearch,caraka/gridcoinresearch,caraka/gridcoinresearch,caraka/gridcoinresearch,caraka/gridcoinresearch
|
151adcff274b9d3d38c706eb4f3ec204450d0c8d
|
src/lib/simplex_noise.cc
|
src/lib/simplex_noise.cc
|
/*
* Copyright (c) 2014, Julien Bernard
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <mm/simplex_noise.h>
#include <cassert>
#include <cmath>
#include <mm/curve.h>
namespace mm {
simplex_noise::simplex_noise(random_engine& engine)
{
// initialize permutation
for (uint8_t i = 0; i < 255; ++i) {
m_perm[i] = i;
}
m_perm[255] = 255; // to avoid an infinite loop in the previous for loop
// generate permutation
std::uniform_int_distribution<uint8_t> dist_perm(0, 255);
for (unsigned i = 0; i < 2560; ++i) {
uint8_t j = dist_perm(engine);
uint8_t k = dist_perm(engine);
std::swap(m_perm[j], m_perm[k]);
}
}
static const vector2 s_gradients[12] = {
{ -1.0, -1.0 },
{ 1.0, 0.0 },
{ -1.0, 0.0 },
{ 1.0, 1.0 },
{ -1.0, 1.0 },
{ 0.0, -1.0 },
{ 0.0, 1.0 },
{ 1.0, -1.0 }
};
const vector2& simplex_noise::grid(uint8_t i, uint8_t j) const {
uint8_t index = i + m_perm.at(j);
return s_gradients[index % 12];
}
static const double K = .366025403784438646763723170752; // (sqrt(3) - 1) / 2
static const double C = .211324865405187117745425609748; // K / (1 + 2 * K)
double simplex_noise::operator()(double x, double y) const {
double s = (x + y) * K;
double i = x + s;
double j = y + s;
i = std::floor(i);
j = std::floor(j);
double t = (i + j) * C;
double X0 = i - t;
double Y0 = j - t;
double x0 = x - X0;
double y0 = y - Y0;
uint8_t i1 = 0;
uint8_t j1 = 0;
if (x0 > y0) {
i1 = 1;
} else {
j1 = 1;
}
double x1 = x0 - i1 + C;
double y1 = y0 - j1 + C;
double x2 = x0 - 1 + 2.0 * C;
double y2 = y0 - 1 + 2.0 * C;
uint8_t ii = static_cast<uint8_t>(i);
uint8_t jj = static_cast<uint8_t>(j);
double res = 0.0;
double d0 = 0.5 - x0*x0 - y0*y0;
if (d0 > 0) {
d0 *= d0;
res += d0 * d0 * dot(grid(ii, jj), { x0, y0 });
}
double d1 = 0.5 - x1*x1 - y1*y1;
if (d1 > 0) {
d1 *= d1;
res += d1 * d1 * dot(grid(ii + i1, jj + j1), { x1, y1 });
}
double d2 = 0.5 - x2*x2 - y2*y2;
if (d2 > 0) {
d2 *= d2;
res += d2 * d2 * dot(grid(ii + 1, jj + 1), { x2, y2 });
}
return 60 * res;
}
}
|
/*
* Copyright (c) 2014, Julien Bernard
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <mm/simplex_noise.h>
#include <cassert>
#include <cmath>
#include <mm/curve.h>
namespace mm {
simplex_noise::simplex_noise(random_engine& engine)
{
// initialize permutation
for (uint8_t i = 0; i < 255; ++i) {
m_perm[i] = i;
}
m_perm[255] = 255; // to avoid an infinite loop in the previous for loop
// generate permutation
std::uniform_int_distribution<uint8_t> dist_perm(0, 255);
for (unsigned i = 0; i < 2560; ++i) {
uint8_t j = dist_perm(engine);
uint8_t k = dist_perm(engine);
std::swap(m_perm[j], m_perm[k]);
}
}
static const vector2 s_gradients[8] = {
{ -1.0, -1.0 },
{ 1.0, 0.0 },
{ -1.0, 0.0 },
{ 1.0, 1.0 },
{ -1.0, 1.0 },
{ 0.0, -1.0 },
{ 0.0, 1.0 },
{ 1.0, -1.0 }
};
const vector2& simplex_noise::grid(uint8_t i, uint8_t j) const {
uint8_t index = i + m_perm.at(j);
return s_gradients[index % 8];
}
static const double K = .366025403784438646763723170752; // (sqrt(3) - 1) / 2
static const double C = .211324865405187117745425609748; // K / (1 + 2 * K)
double simplex_noise::operator()(double x, double y) const {
double s = (x + y) * K;
double i = x + s;
double j = y + s;
i = std::floor(i);
j = std::floor(j);
double t = (i + j) * C;
double X0 = i - t;
double Y0 = j - t;
double x0 = x - X0;
double y0 = y - Y0;
uint8_t i1 = 0;
uint8_t j1 = 0;
if (x0 > y0) {
i1 = 1;
} else {
j1 = 1;
}
double x1 = x0 - i1 + C;
double y1 = y0 - j1 + C;
double x2 = x0 - 1 + 2.0 * C;
double y2 = y0 - 1 + 2.0 * C;
uint8_t ii = static_cast<uint8_t>(i);
uint8_t jj = static_cast<uint8_t>(j);
double res = 0.0;
double d0 = 0.5 - x0*x0 - y0*y0;
if (d0 > 0) {
d0 *= d0;
res += d0 * d0 * dot(grid(ii, jj), { x0, y0 });
}
double d1 = 0.5 - x1*x1 - y1*y1;
if (d1 > 0) {
d1 *= d1;
res += d1 * d1 * dot(grid(ii + i1, jj + j1), { x1, y1 });
}
double d2 = 0.5 - x2*x2 - y2*y2;
if (d2 > 0) {
d2 *= d2;
res += d2 * d2 * dot(grid(ii + 1, jj + 1), { x2, y2 });
}
return 60 * res;
}
}
|
Fix the wrong size of the array of gradients
|
Fix the wrong size of the array of gradients
- s_gradients array was specified of size 12, and used with a modulus 12,
but is only filled with 8 gradient vectors !
=> if the rest of the array is filled with zeros,
this degrades the variety of the noise produced
- I believe the error comes from having converted a 3D implementation,
where 12 gradients are used (for standard implementation)
- And by the way, using a modulus 8 is much more optimzed by the compiler :)
|
C++
|
isc
|
jube/mapmaker,jube/mapmaker
|
373181981e925aa135b65d0417802c9c2d3b44a5
|
src/python.cpp
|
src/python.cpp
|
/*********************************
** Tsunagari Tile Engine **
** python.cpp **
** Copyright 2011-2012 OmegaSDG **
*********************************/
#include <algorithm> // for std::replace
#include <signal.h> // for SIGINT and SIG_DFL
#include <string.h> // for strrchr
#include <boost/python.hpp>
#include "log.h"
#include "python.h"
#include "python_bindings.h" // for pythonInitBindings
#include "resourcer.h"
// Include libpython after everything else so it doesn't mess with Windows'
// namespace.
#include <Python.h>
#include <grammar.h> // for struct grammar
#include <node.h> // for struct node
#include <parsetok.h> // for PyParser_ParseStringFlags
namespace bp = boost::python;
static bp::object modMain, modBltin;
static bp::object dictMain, dictBltin;
//! List of known safe Python modules allowed for importing.
static std::string moduleWhitelist[] = {
"__builtin__",
"__main__",
"math",
"sys",
"time",
"traceback",
"",
};
static bool inWhitelist(const std::string& name)
{
for (int i = 0; moduleWhitelist[i].size(); i++)
if (name == moduleWhitelist[i])
return true;
return false;
}
static void pythonIncludeModule(const char* name)
{
bp::object module(bp::handle<>(PyImport_ImportModule(name)));
dictMain[name] = module;
}
static void pythonSetDefaultEncoding(const char* enc)
{
if (PyUnicode_SetDefaultEncoding(enc) != 0) {
PyErr_Format(PyExc_SystemError,
"encoding %s not found", enc);
bp::throw_error_already_set();
}
}
static PyObject*
safeImport(PyObject*, PyObject* args, PyObject* kwds)
{
static const char* kwlist[] = {"name", "globals", "locals", "fromlist",
"level", 0};
char* _name;
std::string name;
PyObject* globals, *locals, *fromList;
int level = -1;
// Validate args from Python.
if (!PyArg_ParseTupleAndKeywords(args, kwds, "s|OOOi:__import__",
(char**)kwlist, &_name, &globals, &locals, &fromList,
&level))
return NULL;
name = _name;
// Search whitelisted Python modules.
if (inWhitelist(name))
return PyImport_ImportModuleLevel(_name, globals, locals,
fromList, level);
Log::info("Python", "import " + name);
// Search Python scripts inside World.
std::replace(name.begin(), name.end(), '.', '/');
name += ".py";
Resourcer* rc = Resourcer::instance();
if (rc->resourceExists(name)) {
rc->runPythonScript(name);
return modMain.ptr(); // We have to return a module...
}
// Nothing acceptable found.
std::string msg = std::string("Module '") + _name + "' not found or "
"not allowed. Note that Tsunagari runs in a sandbox and does "
"not allow most external modules.";
PyErr_Format(PyExc_ImportError, msg.c_str());
return NULL;
}
static PyObject* nullExecfile(PyObject*, PyObject*)
{
PyErr_SetString(PyExc_RuntimeError,
"file(): Tsunagari runs scripts in a sandbox and "
"does not allow accessing the standard filesystem");
return NULL;
}
static PyObject* nullFile(PyObject*, PyObject*)
{
PyErr_SetString(PyExc_RuntimeError,
"file(): Tsunagari runs scripts in a sandbox and "
"does not allow accessing the standard filesystem");
return NULL;
}
static PyObject* nullOpen(PyObject*, PyObject*)
{
PyErr_SetString(PyExc_RuntimeError,
"open(): Tsunagari runs scripts in a sandbox and "
"does not allow accessing the standard filesystem");
return NULL;
}
static PyObject* nullReload(PyObject*, PyObject*)
{
PyErr_SetString(PyExc_RuntimeError,
"reload(): Tsunagari does not allow module reloading");
return NULL;
}
PyMethodDef nullMethods[] = {
{"__import__", (PyCFunction)safeImport, METH_VARARGS | METH_KEYWORDS, ""},
{"execfile", nullExecfile, METH_VARARGS, ""},
{"file", nullFile, METH_VARARGS, ""},
{"open", nullOpen, METH_VARARGS, ""},
{"reload", nullReload, METH_O, ""},
{NULL, NULL, 0, NULL},
};
bool pythonInit()
{
try {
PyImport_AppendInittab("tsunagari", &pythonInitBindings);
Py_Initialize();
pythonSetDefaultEncoding("utf-8");
modMain = bp::import("__main__");
dictMain = modMain.attr("__dict__");
modBltin = bp::import("__builtin__");
dictBltin = modBltin.attr("__dict__");
pythonIncludeModule("tsunagari");
// Hack in some rough safety. Disable external scripts and IO.
// InitModule doesn't remove existing modules, so we can use it to
// insert new methods into a pre-existing module.
PyObject* module = Py_InitModule("__builtin__", nullMethods);
if (module == NULL)
bp::throw_error_already_set();
// Restore the default SIGINT handler.
// Python messes with it. >:(
PyOS_setsig(SIGINT, SIG_DFL);
} catch (bp::error_already_set) {
Log::fatal("Python", "An error occured while populating the "
"Python modules:");
Log::setVerbosity(V_NORMAL); // Assure message can be seen.
pythonErr();
return false;
}
return true;
}
void pythonFinalize()
{
Py_Finalize();
}
std::string extractException(PyObject* exc, PyObject* val, PyObject* tb)
{
using namespace boost::python;
handle<> hexc(exc), hval(allow_null(val)), htb(allow_null(tb));
if (!hval) {
return extract<std::string>(str(hexc));
}
else {
object traceback(import("traceback"));
object format_exception(traceback.attr("format_exception"));
object formatted_list(format_exception(hexc, hval, htb));
object formatted(str("").join(formatted_list));
return extract<std::string>(formatted);
}
}
std::string extractException2(PyObject* exc, PyObject* val, PyObject* tb)
{
char* type = PyExceptionClass_Name(exc);
char* dot = strrchr(type, '.');
if (dot)
type = dot + 1;
char* value = PyString_AsString(val);
std::string msg = type;
if (value)
msg.append(": ").append(value);
return msg;
}
void pythonErr()
{
// Something bad happened. Error is already set in Python.
PyObject* exc, *val, *tb;
PyErr_Fetch(&exc, &val, &tb);
PyErr_NormalizeException(&exc, &val, &tb);
Log::err("Python", extractException(exc, val, tb));
}
bp::object pythonGlobals()
{
return dictMain;
}
extern grammar _PyParser_Grammar; // From Python's graminit.c
PyCodeObject* pythonCompile(const char* fn, const char* code)
{
// FIXME: memory leaks
// XXX: there's already a compile function in Python somewhere
perrdetail err;
node* n = PyParser_ParseStringFlagsFilename(
code, fn, &_PyParser_Grammar,
Py_file_input, &err, 0
);
if (!n) {
PyParser_SetError(&err);
pythonErr();
return NULL;
}
PyCodeObject* pco = PyNode_Compile(n, fn);
if (!pco) {
Log::err("Python",
std::string(fn) + ": possibly unknown compile error");
pythonErr();
return NULL;
}
return pco;
}
bool pythonExec(PyCodeObject* code)
{
if (!code)
return false;
PyObject* globals = dictMain.ptr();
PyObject* result = PyEval_EvalCode(code, globals, globals);
if (!result)
pythonErr();
return result;
}
|
/*********************************
** Tsunagari Tile Engine **
** python.cpp **
** Copyright 2011-2012 OmegaSDG **
*********************************/
#include <algorithm> // for std::replace
#include <signal.h> // for SIGINT and SIG_DFL
#include <string.h> // for strrchr
#include <boost/python.hpp>
#include "log.h"
#include "python.h"
#include "python_bindings.h" // for pythonInitBindings
#include "resourcer.h"
// Include libpython after everything else so it doesn't mess with Windows'
// namespace.
#include <Python.h>
#include <grammar.h> // for struct grammar
#include <node.h> // for struct node
#include <parsetok.h> // for PyParser_ParseStringFlags
namespace bp = boost::python;
static bp::object modMain, modBltin;
static bp::object dictMain, dictBltin;
//! List of known safe Python modules allowed for importing.
static std::string moduleWhitelist[] = {
"__builtin__",
"__main__",
"math",
"sys",
"time",
"traceback",
"",
};
static bool inWhitelist(const std::string& name)
{
for (int i = 0; moduleWhitelist[i].size(); i++)
if (name == moduleWhitelist[i])
return true;
return false;
}
static void pythonIncludeModule(const char* name)
{
bp::object module(bp::handle<>(PyImport_ImportModule(name)));
dictMain[name] = module;
}
static void pythonSetDefaultEncoding(const char* enc)
{
if (PyUnicode_SetDefaultEncoding(enc) != 0) {
PyErr_Format(PyExc_SystemError,
"encoding %s not found", enc);
bp::throw_error_already_set();
}
}
static PyObject*
safeImport(PyObject*, PyObject* args, PyObject* kwds)
{
static const char* kwlist[] = {"name", "globals", "locals", "fromlist",
"level", 0};
char* _name;
std::string name;
PyObject* globals, *locals, *fromList;
int level = -1;
// Validate args from Python.
if (!PyArg_ParseTupleAndKeywords(args, kwds, "s|OOOi:__import__",
(char**)kwlist, &_name, &globals, &locals, &fromList,
&level))
return NULL;
name = _name;
// Search whitelisted Python modules.
if (inWhitelist(name))
return PyImport_ImportModuleLevel(_name, globals, locals,
fromList, level);
Log::info("Python", "import " + name);
// Search Python scripts inside World.
std::replace(name.begin(), name.end(), '.', '/');
name += ".py";
Resourcer* rc = Resourcer::instance();
if (rc->resourceExists(name)) {
rc->runPythonScript(name);
return modMain.ptr(); // We have to return a module...
}
// Nothing acceptable found.
std::string msg = std::string("Module '") + _name + "' not found or "
"not allowed. Note that Tsunagari runs in a sandbox and does "
"not allow most external modules.";
PyErr_Format(PyExc_ImportError, msg.c_str());
return NULL;
}
static PyObject* nullExecfile(PyObject*, PyObject*)
{
PyErr_SetString(PyExc_RuntimeError,
"file(): Tsunagari runs scripts in a sandbox and "
"does not allow accessing the standard filesystem");
return NULL;
}
static PyObject* nullFile(PyObject*, PyObject*)
{
PyErr_SetString(PyExc_RuntimeError,
"file(): Tsunagari runs scripts in a sandbox and "
"does not allow accessing the standard filesystem");
return NULL;
}
static PyObject* nullOpen(PyObject*, PyObject*)
{
PyErr_SetString(PyExc_RuntimeError,
"open(): Tsunagari runs scripts in a sandbox and "
"does not allow accessing the standard filesystem");
return NULL;
}
static PyObject* nullReload(PyObject*, PyObject*)
{
PyErr_SetString(PyExc_RuntimeError,
"reload(): Tsunagari does not allow module reloading");
return NULL;
}
PyMethodDef nullMethods[] = {
{"__import__", (PyCFunction)safeImport, METH_VARARGS | METH_KEYWORDS, ""},
{"execfile", nullExecfile, METH_VARARGS, ""},
{"file", nullFile, METH_VARARGS, ""},
{"open", nullOpen, METH_VARARGS, ""},
{"reload", nullReload, METH_O, ""},
{NULL, NULL, 0, NULL},
};
bool pythonInit()
{
try {
PyImport_AppendInittab("tsunagari", &pythonInitBindings);
Py_Initialize();
pythonSetDefaultEncoding("utf-8");
modMain = bp::import("__main__");
dictMain = modMain.attr("__dict__");
modBltin = bp::import("__builtin__");
dictBltin = modBltin.attr("__dict__");
pythonIncludeModule("tsunagari");
// Hack in some rough safety. Disable external scripts and IO.
// InitModule doesn't remove existing modules, so we can use it to
// insert new methods into a pre-existing module.
PyObject* module = Py_InitModule("__builtin__", nullMethods);
if (module == NULL)
bp::throw_error_already_set();
// Restore the default SIGINT handler.
// Python messes with it. >:(
PyOS_setsig(SIGINT, SIG_DFL);
} catch (bp::error_already_set) {
Log::fatal("Python", "An error occured while populating the "
"Python modules:");
Log::setVerbosity(V_NORMAL); // Assure message can be seen.
pythonErr();
return false;
}
return true;
}
void pythonFinalize()
{
Py_Finalize();
}
std::string extractException(PyObject* exc, PyObject* val, PyObject* tb)
{
using namespace boost::python;
handle<> hexc(exc), hval(allow_null(val)), htb(allow_null(tb));
if (!hval) {
return extract<std::string>(str(hexc));
}
else {
object traceback(import("traceback"));
object format_exception(traceback.attr("format_exception"));
object formatted_list(format_exception(hexc, hval, htb));
object formatted(str("").join(formatted_list));
return extract<std::string>(formatted);
}
}
std::string extractException2(PyObject* exc, PyObject* val, PyObject* tb)
{
char* type = PyExceptionClass_Name(exc);
char* dot = strrchr(type, '.');
if (dot)
type = dot + 1;
char* value = PyString_AsString(val);
std::string msg = type;
if (value)
msg.append(": ").append(value);
return msg;
}
void pythonErr()
{
// Something bad happened. Error is already set in Python.
PyObject* exc, *val, *tb;
PyErr_Fetch(&exc, &val, &tb);
if (!exc) {
Log::err("Python",
"pythonErr() called, but no exception thrown");
return;
}
PyErr_NormalizeException(&exc, &val, &tb);
Log::err("Python", extractException(exc, val, tb));
}
bp::object pythonGlobals()
{
return dictMain;
}
extern grammar _PyParser_Grammar; // From Python's graminit.c
PyCodeObject* pythonCompile(const char* fn, const char* code)
{
// FIXME: memory leaks
// XXX: there's already a compile function in Python somewhere
perrdetail err;
node* n = PyParser_ParseStringFlagsFilename(
code, fn, &_PyParser_Grammar,
Py_file_input, &err, 0
);
if (!n) {
PyParser_SetError(&err);
pythonErr();
return NULL;
}
PyCodeObject* pco = PyNode_Compile(n, fn);
if (!pco) {
Log::err("Python",
std::string(fn) + ": possibly unknown compile error");
pythonErr();
return NULL;
}
return pco;
}
bool pythonExec(PyCodeObject* code)
{
if (!code)
return false;
PyObject* globals = dictMain.ptr();
PyObject* result = PyEval_EvalCode(code, globals, globals);
if (!result)
pythonErr();
return result;
}
|
add check to pythonErr
|
add check to pythonErr
|
C++
|
mit
|
pariahsoft/TsunagariC,pariahsoft/Tsunagari,pariahsoft/Tsunagari,pariahsoft/Tsunagari,pariahsoft/Tsunagari,pariahsoft/TsunagariC,pariahsoft/TsunagariC,pmer/TsunagariC,pmer/TsunagariC,pmer/TsunagariC
|
5bbc9661ec5f975ef4e330324b39b3b30c66be64
|
test/Driver/gcc-toolchain.cpp
|
test/Driver/gcc-toolchain.cpp
|
// Test that gcc-toolchain option is working correctly
//
// RUN: %clangxx -no-canonical-prefixes %s -### -o %t 2>&1 \
// RUN: -target i386-unknown-linux \
// RUN: -gcc-toolchain %S/Inputs/ubuntu_11.04_multiarch_tree/usr \
// RUN: | FileCheck %s
// CHECK: "-internal-isystem"
// CHECK: "[[TOOLCHAIN:.*]]/usr/lib/i386-linux-gnu/gcc/i686-linux-gnu/4.5/../../../../../include/c++/4.5"
// CHECK: "-internal-isystem"
// CHECK: "[[TOOLCHAIN]]/usr/lib/i386-linux-gnu/gcc/i686-linux-gnu/4.5/../../../../../include/c++/4.5/i686-linux-gnu"
// CHECK: "-internal-isystem"
// CHECK: "[[TOOLCHAIN]]/usr/lib/i386-linux-gnu/gcc/i686-linux-gnu/4.5/../../../../../include/c++/4.5/backward"
// CHECK: "-internal-isystem"
// CHECK: "/usr/local/include"
// CHECK: "-internal-isystem"
// CHECK: lib/clang/3.1/include"
// CHECK: "-internal-externc-isystem"
// CHECK: "/include"
// CHECK: "-internal-externc-isystem"
// CHECK: "/usr/include"
// CHECK: "{{.*}}/ld
// CHECK: "[[TOOLCHAIN2:.*]]/usr/lib/i386-linux-gnu/gcc/i686-linux-gnu/4.5/crtbegin.o"
// CHECK: "-L[[TOOLCHAIN2]]/usr/lib/i386-linux-gnu/gcc/i686-linux-gnu/4.5"
// CHECK: "-L[[TOOLCHAIN2]]/usr/lib/i386-linux-gnu/gcc/i686-linux-gnu/4.5/../../../.."
// CHECK: "-L/lib"
// CHECK: "-L/usr/lib"
|
// Test that gcc-toolchain option is working correctly
//
// RUN: %clangxx -no-canonical-prefixes %s -### -o %t 2>&1 \
// RUN: -target i386-unknown-linux \
// RUN: -gcc-toolchain %S/Inputs/ubuntu_11.04_multiarch_tree/usr \
// RUN: | FileCheck %s
// CHECK: "-internal-isystem"
// CHECK: "[[TOOLCHAIN:.*]]/usr/lib/i386-linux-gnu/gcc/i686-linux-gnu/4.5/../../../../../include/c++/4.5"
// CHECK: "-internal-isystem"
// CHECK: "[[TOOLCHAIN]]/usr/lib/i386-linux-gnu/gcc/i686-linux-gnu/4.5/../../../../../include/c++/4.5/i686-linux-gnu"
// CHECK: "-internal-isystem"
// CHECK: "[[TOOLCHAIN]]/usr/lib/i386-linux-gnu/gcc/i686-linux-gnu/4.5/../../../../../include/c++/4.5/backward"
// CHECK: "-internal-isystem"
// CHECK: "/usr/local/include"
// CHECK: "-internal-isystem"
// CHECK: lib/clang/3.1/include"
// CHECK: "-internal-externc-isystem"
// CHECK: "/include"
// CHECK: "-internal-externc-isystem"
// CHECK: "/usr/include"
// CHECK: "{{.*}}/ld{{(.exe)?}}"
// CHECK: "crti.o"
// CHECK: "[[TOOLCHAIN2:.*]]/usr/lib/i386-linux-gnu/gcc/i686-linux-gnu/4.5/crtbegin.o"
// CHECK: "-L[[TOOLCHAIN2]]/usr/lib/i386-linux-gnu/gcc/i686-linux-gnu/4.5"
// CHECK: "-L[[TOOLCHAIN2]]/usr/lib/i386-linux-gnu/gcc/i686-linux-gnu/4.5/../../../.."
// CHECK: "-L/lib"
// CHECK: "-L/usr/lib"
|
Add an extra CHECK line to make sure TOOLCHAIN2 matches just the path prefix.
|
Add an extra CHECK line to make sure TOOLCHAIN2 matches just the path
prefix.
git-svn-id: ffe668792ed300d6c2daa1f6eba2e0aa28d7ec6c@150905 91177308-0d34-0410-b5e6-96231b3b80d8
|
C++
|
apache-2.0
|
apple/swift-clang,llvm-mirror/clang,llvm-mirror/clang,llvm-mirror/clang,llvm-mirror/clang,apple/swift-clang,apple/swift-clang,apple/swift-clang,llvm-mirror/clang,llvm-mirror/clang,llvm-mirror/clang,apple/swift-clang,apple/swift-clang,llvm-mirror/clang,llvm-mirror/clang,apple/swift-clang,apple/swift-clang,llvm-mirror/clang,apple/swift-clang,apple/swift-clang
|
615911dba9c84341297c246835dbf59028341bde
|
lib/BuildSystem/LaneBasedExecutionQueue.cpp
|
lib/BuildSystem/LaneBasedExecutionQueue.cpp
|
//===-- LaneBasedExecutionQueue.cpp ---------------------------------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2015 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See http://swift.org/LICENSE.txt for license information
// See http://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
//
//===----------------------------------------------------------------------===//
#include "llbuild/BuildSystem/BuildExecutionQueue.h"
#include "llbuild/Basic/LLVM.h"
#include "llvm/ADT/ArrayRef.h"
#include "llvm/ADT/SmallString.h"
#include "llvm/Support/Path.h"
#include "llvm/Support/Program.h"
#include <atomic>
#include <condition_variable>
#include <deque>
#include <mutex>
#include <memory>
#include <thread>
#include <vector>
#include <string>
#include <fcntl.h>
#include <unistd.h>
#include <signal.h>
#include <spawn.h>
#include <sys/wait.h>
using namespace llbuild;
using namespace llbuild::buildsystem;
extern "C" {
extern char **environ;
}
namespace {
struct LaneBasedExecutionQueueJobContext {
QueueJob& job;
};
/// Build execution queue.
//
// FIXME: Consider trying to share this with the Ninja implementation.
class LaneBasedExecutionQueue : public BuildExecutionQueue {
/// The number of lanes the queue was configured with.
unsigned numLanes;
/// A thread for each lane.
std::vector<std::unique_ptr<std::thread>> lanes;
/// The ready queue of jobs to execute.
std::deque<QueueJob> readyJobs;
std::mutex readyJobsMutex;
std::condition_variable readyJobsCondition;
void executeLane(unsigned laneNumber) {
// Execute items from the queue until shutdown.
while (true) {
// Take a job from the ready queue.
QueueJob job{};
{
std::unique_lock<std::mutex> lock(readyJobsMutex);
// While the queue is empty, wait for an item.
while (readyJobs.empty()) {
readyJobsCondition.wait(lock);
}
// Take an item according to the chosen policy.
job = readyJobs.front();
readyJobs.pop_front();
}
// If we got an empty job, the queue is shutting down.
if (!job.getForCommand())
break;
// Process the job.
LaneBasedExecutionQueueJobContext context{ job };
getDelegate().commandJobStarted(job.getForCommand());
job.execute(reinterpret_cast<QueueJobContext*>(&context));
getDelegate().commandJobFinished(job.getForCommand());
}
}
public:
LaneBasedExecutionQueue(BuildExecutionQueueDelegate& delegate,
unsigned numLanes)
: BuildExecutionQueue(delegate), numLanes(numLanes)
{
for (unsigned i = 0; i != numLanes; ++i) {
lanes.push_back(std::unique_ptr<std::thread>(
new std::thread(
&LaneBasedExecutionQueue::executeLane, this, i)));
}
}
virtual ~LaneBasedExecutionQueue() {
// Shut down the lanes.
for (unsigned i = 0; i != numLanes; ++i) {
addJob({});
}
for (unsigned i = 0; i != numLanes; ++i) {
lanes[i]->join();
}
}
virtual void addJob(QueueJob job) override {
std::lock_guard<std::mutex> guard(readyJobsMutex);
readyJobs.push_back(job);
readyJobsCondition.notify_one();
}
virtual bool
executeProcess(QueueJobContext* opaqueContext,
ArrayRef<StringRef> commandLine,
ArrayRef<std::pair<StringRef,
StringRef>> environment) override {
// Assign a process handle, which just needs to be unique for as long as we
// are communicating with the delegate.
struct BuildExecutionQueueDelegate::ProcessHandle handle;
handle.id = reinterpret_cast<uintptr_t>(&handle);
// Whether or not we are capturing output.
const bool shouldCaptureOutput = true;
LaneBasedExecutionQueueJobContext& context =
*reinterpret_cast<LaneBasedExecutionQueueJobContext*>(opaqueContext);
getDelegate().commandProcessStarted(context.job.getForCommand(), handle);
// Initialize the spawn attributes.
posix_spawnattr_t attributes;
posix_spawnattr_init(&attributes);
// Unmask all signals.
sigset_t noSignals;
sigemptyset(&noSignals);
posix_spawnattr_setsigmask(&attributes, &noSignals);
// Reset all signals to default behavior.
//
// On Linux, this can only be used to reset signals that are legal to
// modify, so we have to take care about the set we use.
#if defined(__linux__)
sigset_t mostSignals;
sigemptyset(&mostSignals);
for (int i = 1; i < SIGUNUSED; ++i) {
if (i == SIGKILL || i == SIGSTOP) continue;
sigaddset(&mostSignals, i);
}
posix_spawnattr_setsigdefault(&attributes, &mostSignals);
#else
sigset_t mostSignals;
sigfillset(&mostSignals);
sigdelset(&mostSignals, SIGKILL);
sigdelset(&mostSignals, SIGSTOP);
posix_spawnattr_setsigdefault(&attributes, &mostSignals);
#endif
// Establish a separate process group.
posix_spawnattr_setpgroup(&attributes, 0);
// Set the attribute flags.
unsigned flags = POSIX_SPAWN_SETSIGMASK | POSIX_SPAWN_SETSIGDEF;
flags |= POSIX_SPAWN_SETPGROUP;
// Close all other files by default.
//
// FIXME: Note that this is an Apple-specific extension, and we will have to
// do something else on other platforms (and unfortunately, there isn't
// really an easy answer other than using a stub executable).
#ifdef __APPLE__
flags |= POSIX_SPAWN_CLOEXEC_DEFAULT;
#endif
posix_spawnattr_setflags(&attributes, flags);
// Setup the file actions.
posix_spawn_file_actions_t fileActions;
posix_spawn_file_actions_init(&fileActions);
// Open /dev/null as stdin.
posix_spawn_file_actions_addopen(
&fileActions, 0, "/dev/null", O_RDONLY, 0);
// If we are capturing output, create a pipe and appropriate spawn actions.
int outputPipe[2]{ -1, -1 };
if (shouldCaptureOutput) {
if (::pipe(outputPipe) < 0) {
getDelegate().commandProcessHadError(
context.job.getForCommand(), handle,
Twine("unable to open output pipe (") + strerror(errno) + ")");
getDelegate().commandProcessFinished(context.job.getForCommand(),
handle, -1);
return false;
}
// Open the write end of the pipe as stdout and stderr.
posix_spawn_file_actions_adddup2(&fileActions, outputPipe[1], 1);
posix_spawn_file_actions_adddup2(&fileActions, outputPipe[1], 2);
// Close the read and write ends of the pipe.
posix_spawn_file_actions_addclose(&fileActions, outputPipe[0]);
posix_spawn_file_actions_addclose(&fileActions, outputPipe[1]);
} else {
// Otherwise, propagate the current stdout/stderr.
posix_spawn_file_actions_adddup2(&fileActions, 1, 1);
posix_spawn_file_actions_adddup2(&fileActions, 2, 2);
}
// Form the complete C-string command line.
std::vector<std::string> argsStorage(
commandLine.begin(), commandLine.end());
std::vector<const char*> args(argsStorage.size() + 1);
for (size_t i = 0; i != argsStorage.size(); ++i) {
args[i] = argsStorage[i].c_str();
}
args[argsStorage.size()] = nullptr;
// Form the complete environment.
std::vector<std::string> envStorage;
for (const auto& entry: environment) {
SmallString<256> assignment;
assignment += entry.first;
assignment += '=';
assignment += entry.second;
assignment += '\0';
envStorage.emplace_back(assignment.str());
}
std::vector<const char*> env(environment.size() + 1);
char* const* envp = nullptr;
if (environment.empty()) {
envp = ::environ;
} else {
for (size_t i = 0; i != envStorage.size(); ++i) {
env[i] = envStorage[i].c_str();
}
env[envStorage.size()] = nullptr;
envp = const_cast<char**>(env.data());
}
// Resolve the executable path, if necessary.
//
// FIXME: This should be cached.
if (!llvm::sys::path::is_absolute(args[0])) {
auto res = llvm::sys::findProgramByName(args[0]);
if (!res.getError()) {
argsStorage[0] = *res;
args[0] = argsStorage[0].c_str();
}
}
// Spawn the command.
//
// FIXME: Need to track spawned processes for the purposes of cancellation.
pid_t pid;
if (posix_spawn(&pid, args[0], /*file_actions=*/&fileActions,
/*attrp=*/&attributes, const_cast<char**>(args.data()),
envp) != 0) {
getDelegate().commandProcessHadError(
context.job.getForCommand(), handle,
Twine("unable to spawn process (") + strerror(errno) + ")");
getDelegate().commandProcessFinished(context.job.getForCommand(), handle,
-1);
return false;
}
posix_spawn_file_actions_destroy(&fileActions);
posix_spawnattr_destroy(&attributes);
// Read the command output, if capturing.
SmallString<1024> outputData;
if (shouldCaptureOutput) {
// Close the write end of the output pipe.
::close(outputPipe[1]);
// Read all the data from the output pipe.
while (true) {
char buf[4096];
ssize_t numBytes = read(outputPipe[0], buf, sizeof(buf));
if (numBytes < 0) {
getDelegate().commandProcessHadError(
context.job.getForCommand(), handle,
Twine("unable to read process output (") + strerror(errno) + ")");
break;
}
if (numBytes == 0)
break;
outputData.insert(outputData.end(), &buf[0], &buf[numBytes]);
}
// Close the read end of the pipe.
::close(outputPipe[0]);
}
// Wait for the command to complete.
int status, result = waitpid(pid, &status, 0);
while (result == -1 && errno == EINTR)
result = waitpid(pid, &status, 0);
if (result == -1) {
getDelegate().commandProcessHadError(
context.job.getForCommand(), handle,
Twine("unable to wait for process (") + strerror(errno) + ")");
getDelegate().commandProcessFinished(context.job.getForCommand(), handle,
-1);
return false;
}
// Notify the client of the output, if buffering.
if (shouldCaptureOutput) {
getDelegate().commandProcessHadOutput(context.job.getForCommand(), handle,
outputData);
}
// Notify of the process completion.
//
// FIXME: Need to communicate more information on the process exit status.
getDelegate().commandProcessFinished(context.job.getForCommand(), handle,
status);
return (status == 0);
}
};
}
BuildExecutionQueue*
llbuild::buildsystem::createLaneBasedExecutionQueue(
BuildExecutionQueueDelegate& delegate, int numLanes) {
return new LaneBasedExecutionQueue(delegate, numLanes);
}
|
//===-- LaneBasedExecutionQueue.cpp ---------------------------------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2015 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See http://swift.org/LICENSE.txt for license information
// See http://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
//
//===----------------------------------------------------------------------===//
#include "llbuild/BuildSystem/BuildExecutionQueue.h"
#include "llbuild/Basic/LLVM.h"
#include "llvm/ADT/ArrayRef.h"
#include "llvm/ADT/SmallString.h"
#include "llvm/ADT/Twine.h"
#include "llvm/Support/Path.h"
#include "llvm/Support/Program.h"
#include <atomic>
#include <condition_variable>
#include <deque>
#include <mutex>
#include <memory>
#include <thread>
#include <vector>
#include <string>
#include <fcntl.h>
#include <pthread.h>
#include <unistd.h>
#include <signal.h>
#include <spawn.h>
#include <sys/wait.h>
using namespace llbuild;
using namespace llbuild::buildsystem;
extern "C" {
extern char **environ;
}
namespace {
struct LaneBasedExecutionQueueJobContext {
QueueJob& job;
};
/// Build execution queue.
//
// FIXME: Consider trying to share this with the Ninja implementation.
class LaneBasedExecutionQueue : public BuildExecutionQueue {
/// The number of lanes the queue was configured with.
unsigned numLanes;
/// A thread for each lane.
std::vector<std::unique_ptr<std::thread>> lanes;
/// The ready queue of jobs to execute.
std::deque<QueueJob> readyJobs;
std::mutex readyJobsMutex;
std::condition_variable readyJobsCondition;
void executeLane(unsigned laneNumber) {
// Set the thread name, if available.
#if defined(__APPLE__)
pthread_setname_np(
(llvm::Twine("org.swift.llbuild Lane-") +
llvm::Twine(laneNumber)).str().c_str());
#elif defined(__linux__)
pthread_setname_np(
pthread_self(),
(llvm::Twine("org.swift.llbuild Lane-") +
llvm::Twine(laneNumber)).str().c_str());
#endif
// Execute items from the queue until shutdown.
while (true) {
// Take a job from the ready queue.
QueueJob job{};
{
std::unique_lock<std::mutex> lock(readyJobsMutex);
// While the queue is empty, wait for an item.
while (readyJobs.empty()) {
readyJobsCondition.wait(lock);
}
// Take an item according to the chosen policy.
job = readyJobs.front();
readyJobs.pop_front();
}
// If we got an empty job, the queue is shutting down.
if (!job.getForCommand())
break;
// Process the job.
LaneBasedExecutionQueueJobContext context{ job };
getDelegate().commandJobStarted(job.getForCommand());
job.execute(reinterpret_cast<QueueJobContext*>(&context));
getDelegate().commandJobFinished(job.getForCommand());
}
}
public:
LaneBasedExecutionQueue(BuildExecutionQueueDelegate& delegate,
unsigned numLanes)
: BuildExecutionQueue(delegate), numLanes(numLanes)
{
for (unsigned i = 0; i != numLanes; ++i) {
lanes.push_back(std::unique_ptr<std::thread>(
new std::thread(
&LaneBasedExecutionQueue::executeLane, this, i)));
}
}
virtual ~LaneBasedExecutionQueue() {
// Shut down the lanes.
for (unsigned i = 0; i != numLanes; ++i) {
addJob({});
}
for (unsigned i = 0; i != numLanes; ++i) {
lanes[i]->join();
}
}
virtual void addJob(QueueJob job) override {
std::lock_guard<std::mutex> guard(readyJobsMutex);
readyJobs.push_back(job);
readyJobsCondition.notify_one();
}
virtual bool
executeProcess(QueueJobContext* opaqueContext,
ArrayRef<StringRef> commandLine,
ArrayRef<std::pair<StringRef,
StringRef>> environment) override {
// Assign a process handle, which just needs to be unique for as long as we
// are communicating with the delegate.
struct BuildExecutionQueueDelegate::ProcessHandle handle;
handle.id = reinterpret_cast<uintptr_t>(&handle);
// Whether or not we are capturing output.
const bool shouldCaptureOutput = true;
LaneBasedExecutionQueueJobContext& context =
*reinterpret_cast<LaneBasedExecutionQueueJobContext*>(opaqueContext);
getDelegate().commandProcessStarted(context.job.getForCommand(), handle);
// Initialize the spawn attributes.
posix_spawnattr_t attributes;
posix_spawnattr_init(&attributes);
// Unmask all signals.
sigset_t noSignals;
sigemptyset(&noSignals);
posix_spawnattr_setsigmask(&attributes, &noSignals);
// Reset all signals to default behavior.
//
// On Linux, this can only be used to reset signals that are legal to
// modify, so we have to take care about the set we use.
#if defined(__linux__)
sigset_t mostSignals;
sigemptyset(&mostSignals);
for (int i = 1; i < SIGUNUSED; ++i) {
if (i == SIGKILL || i == SIGSTOP) continue;
sigaddset(&mostSignals, i);
}
posix_spawnattr_setsigdefault(&attributes, &mostSignals);
#else
sigset_t mostSignals;
sigfillset(&mostSignals);
sigdelset(&mostSignals, SIGKILL);
sigdelset(&mostSignals, SIGSTOP);
posix_spawnattr_setsigdefault(&attributes, &mostSignals);
#endif
// Establish a separate process group.
posix_spawnattr_setpgroup(&attributes, 0);
// Set the attribute flags.
unsigned flags = POSIX_SPAWN_SETSIGMASK | POSIX_SPAWN_SETSIGDEF;
flags |= POSIX_SPAWN_SETPGROUP;
// Close all other files by default.
//
// FIXME: Note that this is an Apple-specific extension, and we will have to
// do something else on other platforms (and unfortunately, there isn't
// really an easy answer other than using a stub executable).
#ifdef __APPLE__
flags |= POSIX_SPAWN_CLOEXEC_DEFAULT;
#endif
posix_spawnattr_setflags(&attributes, flags);
// Setup the file actions.
posix_spawn_file_actions_t fileActions;
posix_spawn_file_actions_init(&fileActions);
// Open /dev/null as stdin.
posix_spawn_file_actions_addopen(
&fileActions, 0, "/dev/null", O_RDONLY, 0);
// If we are capturing output, create a pipe and appropriate spawn actions.
int outputPipe[2]{ -1, -1 };
if (shouldCaptureOutput) {
if (::pipe(outputPipe) < 0) {
getDelegate().commandProcessHadError(
context.job.getForCommand(), handle,
Twine("unable to open output pipe (") + strerror(errno) + ")");
getDelegate().commandProcessFinished(context.job.getForCommand(),
handle, -1);
return false;
}
// Open the write end of the pipe as stdout and stderr.
posix_spawn_file_actions_adddup2(&fileActions, outputPipe[1], 1);
posix_spawn_file_actions_adddup2(&fileActions, outputPipe[1], 2);
// Close the read and write ends of the pipe.
posix_spawn_file_actions_addclose(&fileActions, outputPipe[0]);
posix_spawn_file_actions_addclose(&fileActions, outputPipe[1]);
} else {
// Otherwise, propagate the current stdout/stderr.
posix_spawn_file_actions_adddup2(&fileActions, 1, 1);
posix_spawn_file_actions_adddup2(&fileActions, 2, 2);
}
// Form the complete C-string command line.
std::vector<std::string> argsStorage(
commandLine.begin(), commandLine.end());
std::vector<const char*> args(argsStorage.size() + 1);
for (size_t i = 0; i != argsStorage.size(); ++i) {
args[i] = argsStorage[i].c_str();
}
args[argsStorage.size()] = nullptr;
// Form the complete environment.
std::vector<std::string> envStorage;
for (const auto& entry: environment) {
SmallString<256> assignment;
assignment += entry.first;
assignment += '=';
assignment += entry.second;
assignment += '\0';
envStorage.emplace_back(assignment.str());
}
std::vector<const char*> env(environment.size() + 1);
char* const* envp = nullptr;
if (environment.empty()) {
envp = ::environ;
} else {
for (size_t i = 0; i != envStorage.size(); ++i) {
env[i] = envStorage[i].c_str();
}
env[envStorage.size()] = nullptr;
envp = const_cast<char**>(env.data());
}
// Resolve the executable path, if necessary.
//
// FIXME: This should be cached.
if (!llvm::sys::path::is_absolute(args[0])) {
auto res = llvm::sys::findProgramByName(args[0]);
if (!res.getError()) {
argsStorage[0] = *res;
args[0] = argsStorage[0].c_str();
}
}
// Spawn the command.
//
// FIXME: Need to track spawned processes for the purposes of cancellation.
pid_t pid;
if (posix_spawn(&pid, args[0], /*file_actions=*/&fileActions,
/*attrp=*/&attributes, const_cast<char**>(args.data()),
envp) != 0) {
getDelegate().commandProcessHadError(
context.job.getForCommand(), handle,
Twine("unable to spawn process (") + strerror(errno) + ")");
getDelegate().commandProcessFinished(context.job.getForCommand(), handle,
-1);
return false;
}
posix_spawn_file_actions_destroy(&fileActions);
posix_spawnattr_destroy(&attributes);
// Read the command output, if capturing.
SmallString<1024> outputData;
if (shouldCaptureOutput) {
// Close the write end of the output pipe.
::close(outputPipe[1]);
// Read all the data from the output pipe.
while (true) {
char buf[4096];
ssize_t numBytes = read(outputPipe[0], buf, sizeof(buf));
if (numBytes < 0) {
getDelegate().commandProcessHadError(
context.job.getForCommand(), handle,
Twine("unable to read process output (") + strerror(errno) + ")");
break;
}
if (numBytes == 0)
break;
outputData.insert(outputData.end(), &buf[0], &buf[numBytes]);
}
// Close the read end of the pipe.
::close(outputPipe[0]);
}
// Wait for the command to complete.
int status, result = waitpid(pid, &status, 0);
while (result == -1 && errno == EINTR)
result = waitpid(pid, &status, 0);
if (result == -1) {
getDelegate().commandProcessHadError(
context.job.getForCommand(), handle,
Twine("unable to wait for process (") + strerror(errno) + ")");
getDelegate().commandProcessFinished(context.job.getForCommand(), handle,
-1);
return false;
}
// Notify the client of the output, if buffering.
if (shouldCaptureOutput) {
getDelegate().commandProcessHadOutput(context.job.getForCommand(), handle,
outputData);
}
// Notify of the process completion.
//
// FIXME: Need to communicate more information on the process exit status.
getDelegate().commandProcessFinished(context.job.getForCommand(), handle,
status);
return (status == 0);
}
};
}
BuildExecutionQueue*
llbuild::buildsystem::createLaneBasedExecutionQueue(
BuildExecutionQueueDelegate& delegate, int numLanes) {
return new LaneBasedExecutionQueue(delegate, numLanes);
}
|
Set thread names on lanes, for debugging.
|
[BuildSystem] Set thread names on lanes, for debugging.
|
C++
|
apache-2.0
|
apple/swift-llbuild,apple/swift-llbuild,apple/swift-llbuild,apple/swift-llbuild,apple/swift-llbuild,apple/swift-llbuild,apple/swift-llbuild
|
2172b94056ce947ecfb689bdce76806999fc51c4
|
src/rshell.cpp
|
src/rshell.cpp
|
#include <fcntl.h>
#include <algorithm>
#include <boost/tokenizer.hpp>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <sys/types.h>
#include <sys/wait.h>
#include <unistd.h>
#include <vector>
#include <pwd.h>
enum class RedirectionTypes {
OUT_TRUNC,
OUT_APPEND,
IN,
PIPE,
NONE
};
void Redirect(RedirectionTypes r, std::string target);
const std::multimap<std::string, int> DEFINED_OPS = { std::make_pair("&", 2),
std::make_pair("|", 2),
std::make_pair(";", 1),
std::make_pair("<", 1),
std::make_pair(">", 2) };
const std::vector<std::string> IMPLEMENTED_OPS{ "&&", "||", ";", "|", ">>", ">", "<" };
RedirectionTypes PeekForRedirection(std::list<std::string> input);
// handles what to do with finalized input state
void Execute(std::list<std::string> &input);
// assumes an operator in the first position of the input list
// extracts and pops it for determination of shell command flow
bool UseOperator(std::list<std::string> &input, bool prevcommandstate);
// used when an UseOperator returns false ie asdf && ls
// the first command is false and && must force a properly inputted second
// command
// to not execute. the command is extracted from the input list and nothing
// is done with it.
void DumpCommand(std::list<std::string> &input);
// assumes non operator in first position of the list
// tokens are extracted from the list until an operator or the end of
// the list is reached. the command is forked and execvp'd
bool UseCommand(std::list<std::string> &input);
// helper function that searched through global const IMPLEMENTED_OPS
// checks inputted string to see if it matches any within the vector
bool ContainsImplementedOp(std::string token);
// Returns true on >1 operators occuring back to back
// e.g. "&&&&&", ";;", etc.
bool FoundRepeat(const std::list<std::string> &input);
// assumes all like-operators have been merged together
// this finds 'strings' of operators that are too long
// rebuilds a std pair from the global const map DEFINED_OPS
// uses it as param to string::find on each element of the input list
// if its found that means it CONTAINS the operator. checking if it
// doesn't equal at this point means it's using operator symbols of an
// incorrect type.
bool InvalidRepeatOp(const std::list<std::string> &input,
std::pair<std::string, int> op);
// helper function that calls with each element of global const
// DEFINED_OPS as 2nd parameter (the single instances of & | ;)
void CombineDefinedOps(std::list<std::string> &input);
// unused check for unimplemented operators
bool UnimplementedOp(const std::list<std::string> &input, std::string op);
// uses unix calls to get username and hostname
// returns 'shellish' formatted str ie usrname@host:~$
std::string UserHostInfo();
// output username@hostname$ and wait for command input
std::string Prompt();
// separates string by delimeters into vector elements
// if # is found it excludes it and anything beyond in the string
std::list<std::string> Split(const std::string &input);
// debugging inputlist outputter
void Output(std::list<std::string> &input);
// takes the input list and an operator character and merges all repeating
// instances of that character within the list
// operators in shell can use the same symbol a different amount of times to
// represent different things
// ie bitwise & vs and &&
// the delimiter method I used to separate the arguments in the first place only
// had single character delimiting available
// since the function is general it will:
// avoid having to create new handcrafted parses when more features have to be
// added
// make bug checking general and simple (is & implemented? is &&& implemented?
// if not theyre bugs)
void RebuildOps(std::list<std::string> &input, std::string op);
// does a search in input list for a known operator and checks if the next
// element is also
// a known operator.
bool FoundAdjOp(std::list<std::string> &input);
int main() {
while (true) {
auto cmd = Prompt();
auto input = Split(cmd);
CombineDefinedOps(input);
Execute(input);
}
}
std::string UserHostInfo() {
auto userinfo = getpwuid(getuid());
if (errno != 0) {
perror("error in getpwuid");
exit(1);
}
std::string login(userinfo->pw_name);
char *rawhost = new char[100];
auto status = gethostname(rawhost, 100);
if (status == -1) {
perror("gethostname failed");
}
std::string hostname(rawhost);
delete[] rawhost;
char *rawpwd = get_current_dir_name();
if (rawpwd == NULL) {
perror("get_current_dir_name returned NULL");
exit(1);
}
std::string pwd(rawpwd);
delete rawpwd;
// handles /home/username -> ~/ shortcut
std::string target = userinfo->pw_dir;
if (pwd.find(target) == 0) {
pwd.erase(0, target.size());
pwd = "~" + pwd;
}
return login + "@" + hostname + ":" + pwd + "$ ";
}
std::string Prompt() {
std::cout << "->" << UserHostInfo();
std::string input;
std::getline(std::cin, input);
return input;
}
std::list<std::string> Split(const std::string &input) {
using namespace boost;
using namespace std;
list<string> input_split;
char_separator<char> sep(" ", "#&|;><");
typedef tokenizer<char_separator<char> > tokener;
tokener tokens(input, sep);
// complexity increases if I handle # as bash does.
for (const auto &t : tokens) {
if (t == "#")
break;
input_split.push_back(t);
}
return input_split;
}
void Output(std::list<std::string> &input) {
using namespace std;
for (const auto &e : input)
cout << e << endl;
}
void RebuildOps(std::list<std::string> &input, std::string op) {
using namespace std;
auto front = input.begin();
auto back = input.end();
while (front != back) {
auto element = find(front, back, op);
int count = 0;
while (element != back) {
if (*element == op) {
element = input.erase(element);
count++;
} else {
break;
}
}
std::string tempstr = "";
while (count--) {
tempstr += op;
}
if (!tempstr.empty())
front = input.insert(element, tempstr);
front++;
}
}
void CombineDefinedOps(std::list<std::string> &input) {
for (const auto &op : DEFINED_OPS) {
RebuildOps(input, op.first);
}
}
bool FoundRepeat(const std::list<std::string> &input) {
using namespace std;
for (const auto &op : DEFINED_OPS) {
if (InvalidRepeatOp(input, op)) {
cout << "Invalid '" << op.first << "' usage found" << endl
<< "known operator used an invalid amount of consecutive" << endl
<< "times: e.g. '&&&' -> '&&' ?" << endl;
return true;
}
}
return false;
}
bool InvalidRepeatOp(const std::list<std::string> &input,
std::pair<std::string, int> pair) {
std::string rebuilt_op = "";
auto op_size = pair.second;
while (op_size--) {
rebuilt_op += pair.first;
}
auto front = input.begin();
auto back = input.end();
while (front != back) {
auto itr = std::find_if(front, back, [&](std::string elem) {
if (elem.find(rebuilt_op) == std::string::npos)
return false;
else
return true;
});
if (itr == back)
return false;
else if (*itr != rebuilt_op)
break;
else {
front = itr;
front++;
}
}
return true;
}
bool UnimplementedOp(const std::list<std::string> &input, std::string op) {
using namespace std;
auto itr = find(input.begin(), input.end(), op);
if (itr == input.end()) {
cout << "operator '" << op << "' is unimplemented" << endl;
return false;
}
return true;
}
bool UseCommand(std::list<std::string> &input) {
using namespace std;
// Take list of strings, make copies of their c_strs, and put into vector
// a vector of char* can be used as char** if used as such
vector<char *> vectorcommand;
while (!input.empty() && !ContainsImplementedOp(input.front())) {
string transferstr = input.front();
input.pop_front();
char *cstrcopy = new char[transferstr.size() + 1];
memcpy(cstrcopy, transferstr.c_str(), transferstr.size() + 1);
cstrcopy[transferstr.size()] = 0;
vectorcommand.push_back(cstrcopy);
}
vectorcommand.push_back(NULL);
char **rawcommand = &vectorcommand[0];
int exitvalue = 0;
//look ahead for redirection operators
RedirectionTypes r = RedirectionTypes::NONE;
if (!input.empty()) {
r = PeekForRedirection(input);
}
//drop the operator + RHS of the redirection from input list
//if a redir op is found. has to be done from outside the fork
//or state isn't preserved in parent process
std::string target;
if (r != RedirectionTypes::NONE) {
input.pop_front();
target = input.front();
input.pop_front();
}
auto pid = fork();
if (pid == -1) {
perror("Error on fork");
exit(1);
}
// child state
else if (pid == 0) {
Redirect(r, target);
execvp(rawcommand[0], rawcommand);
if (errno != 0) {
perror("Error in execvp. Likely a nonexisting command?");
exit(1);
}
for (size_t i = 0; i < vectorcommand.size(); i++)
delete[] rawcommand[i];
}
// parent
else {
int status;
auto wait_val = wait(&status);
if (wait_val == -1) {
perror("Error on waiting for child process to finish");
exit(1);
}
exitvalue = WEXITSTATUS(status);
for (size_t i = 0; i < vectorcommand.size(); i++)
delete[] rawcommand[i];
}
if (exitvalue == 0)
return true;
else
return false;
}
bool ContainsImplementedOp(std::string token) {
auto match = find(IMPLEMENTED_OPS.begin(), IMPLEMENTED_OPS.end(), token);
if (match != IMPLEMENTED_OPS.end())
return true;
return false;
}
bool UseOperator(std::list<std::string> &input, bool prevcommandstate) {
using namespace std;
if (input.empty())
return false;
string op = input.front();
input.pop_front();
if (prevcommandstate == true) {
if (op == ";")
return true;
else if (op == "&&")
return true;
else if (op == "||")
return false;
} else {
if (op == ";")
return true;
else if (op == "&&")
return false;
else if (op == "||")
return true;
}
// proper input ensures we never get down here, so im killing warning message
// fixing this 'properly' would make it annoying to add more operators later
//TODO make that not wrong^
return true;
}
void Execute(std::list<std::string> &input) {
if (input.empty() || FoundRepeat(input) || FoundAdjOp(input))
return;
bool cmdstate = true;
while (!input.empty()) {
if (input.front() == "exit")
exit(0);
if (cmdstate) {
cmdstate = UseCommand(input);
}
else
DumpCommand(input);
cmdstate = UseOperator(input, cmdstate);
}
}
void DumpCommand(std::list<std::string> &input) {
while (!input.empty() && !ContainsImplementedOp(input.front())) {
input.pop_front();
}
}
bool FoundAdjOp(std::list<std::string> &input) {
using namespace std;
for (const auto &op : IMPLEMENTED_OPS) {
auto element = input.begin();
auto front = input.begin();
auto next = input.begin();
auto back = input.end();
while (element != input.end()) {
element = find(front, back, op);
if (element == input.end())
continue;
next = element;
next++;
if (next == input.end())
continue;
else if (find(IMPLEMENTED_OPS.begin(), IMPLEMENTED_OPS.end(), *next) !=
IMPLEMENTED_OPS.end()) {
cout << "Two operators are adjacent to each other e.g. '&&;' ?" << endl;
return true;
}
front = next;
front++;
}
}
return false;
}
RedirectionTypes PeekForRedirection(std::list<std::string> input) {
std::string op = input.front();
input.pop_front();
std::string target = input.front();
input.pop_front();
if (op == ">") {
return RedirectionTypes::OUT_TRUNC;
}
else if (op == ">>") {
return RedirectionTypes::OUT_APPEND;
}
else if (op == "<") {
return RedirectionTypes::IN;
}
return RedirectionTypes::NONE;
}
void Redirect(RedirectionTypes r, std::string target) {
int fd = -1;
if (r == RedirectionTypes::OUT_TRUNC) {
fd = open(target.c_str(), O_RDWR | O_CREAT | O_TRUNC, 0644);
close(1);
dup2(fd, 1);
}
else if (r == RedirectionTypes::OUT_APPEND) {
fd = open(target.c_str(), O_RDWR | O_CREAT | O_APPEND, 0644);
close(1);
dup2(fd, 1);
}
else if (r == RedirectionTypes::IN) {
fd = open(target.c_str(), O_RDONLY, 0644);
close(0);
dup2(fd, 0);
}
}
|
#include <fcntl.h>
#include <algorithm>
#include <boost/tokenizer.hpp>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <sys/types.h>
#include <sys/wait.h>
#include <unistd.h>
#include <vector>
#include <pwd.h>
enum class RedirectionTypes {
OUT_TRUNC,
OUT_APPEND,
IN,
PIPE,
NONE
};
std::vector<char*> RebuildCommand(std::list<std::string> &input);
std::list<std::string> InputSegment(std::list<std::string> &input);
void Redirect(std::list<std::string> &input);
const std::multimap<std::string, int> DEFINED_OPS = { std::make_pair("&", 2),
std::make_pair("|", 2),
std::make_pair(";", 1),
std::make_pair("<", 1),
std::make_pair(">", 2) };
const std::vector<std::string> IMPLEMENTED_OPS{ "&&", "||", ";", "|", ">>", ">", "<" };
RedirectionTypes PeekForRedirection(std::list<std::string> input);
// handles what to do with finalized input state
void Execute(std::list<std::string> &input);
// assumes an operator in the first position of the input list
// extracts and pops it for determination of shell command flow
bool UseOperator(std::list<std::string> &input, bool prevcommandstate);
// used when an UseOperator returns false ie asdf && ls
// the first command is false and && must force a properly inputted second
// command
// to not execute. the command is extracted from the input list and nothing
// is done with it.
void DumpCommand(std::list<std::string> &input);
// assumes non operator in first position of the list
// tokens are extracted from the list until an operator or the end of
// the list is reached. the command is forked and execvp'd
bool UseCommand(std::list<std::string> &input);
// helper function that searched through global const IMPLEMENTED_OPS
// checks inputted string to see if it matches any within the vector
bool ContainsImplementedOp(std::string token);
// Returns true on >1 operators occuring back to back
// e.g. "&&&&&", ";;", etc.
bool FoundRepeat(const std::list<std::string> &input);
// assumes all like-operators have been merged together
// this finds 'strings' of operators that are too long
// rebuilds a std pair from the global const map DEFINED_OPS
// uses it as param to string::find on each element of the input list
// if its found that means it CONTAINS the operator. checking if it
// doesn't equal at this point means it's using operator symbols of an
// incorrect type.
bool InvalidRepeatOp(const std::list<std::string> &input,
std::pair<std::string, int> op);
// helper function that calls with each element of global const
// DEFINED_OPS as 2nd parameter (the single instances of & | ;)
void CombineDefinedOps(std::list<std::string> &input);
// unused check for unimplemented operators
bool UnimplementedOp(const std::list<std::string> &input, std::string op);
// uses unix calls to get username and hostname
// returns 'shellish' formatted str ie usrname@host:~$
std::string UserHostInfo();
// output username@hostname$ and wait for command input
std::string Prompt();
// separates string by delimeters into vector elements
// if # is found it excludes it and anything beyond in the string
std::list<std::string> Split(const std::string &input);
// debugging inputlist outputter
void Output(std::list<std::string> &input);
// takes the input list and an operator character and merges all repeating
// instances of that character within the list
// operators in shell can use the same symbol a different amount of times to
// represent different things
// ie bitwise & vs and &&
// the delimiter method I used to separate the arguments in the first place only
// had single character delimiting available
// since the function is general it will:
// avoid having to create new handcrafted parses when more features have to be
// added
// make bug checking general and simple (is & implemented? is &&& implemented?
// if not theyre bugs)
void RebuildOps(std::list<std::string> &input, std::string op);
// does a search in input list for a known operator and checks if the next
// element is also
// a known operator.
bool FoundAdjOp(std::list<std::string> &input);
int main() {
while (true) {
auto cmd = Prompt();
auto input = Split(cmd);
CombineDefinedOps(input);
Execute(input);
}
}
std::string UserHostInfo() {
auto userinfo = getpwuid(getuid());
if (errno != 0) {
perror("error in getpwuid");
exit(1);
}
std::string login(userinfo->pw_name);
char *rawhost = new char[100];
auto status = gethostname(rawhost, 100);
if (status == -1) {
perror("gethostname failed");
}
std::string hostname(rawhost);
delete[] rawhost;
char *rawpwd = get_current_dir_name();
if (rawpwd == NULL) {
perror("get_current_dir_name returned NULL");
exit(1);
}
std::string pwd(rawpwd);
delete rawpwd;
// handles /home/username -> ~/ shortcut
std::string target = userinfo->pw_dir;
if (pwd.find(target) == 0) {
pwd.erase(0, target.size());
pwd = "~" + pwd;
}
return login + "@" + hostname + ":" + pwd + "$ ";
}
std::string Prompt() {
std::cout << "->" << UserHostInfo();
std::string input;
std::getline(std::cin, input);
return input;
}
std::list<std::string> Split(const std::string &input) {
using namespace boost;
using namespace std;
list<string> input_split;
char_separator<char> sep(" ", "#&|;><");
typedef tokenizer<char_separator<char> > tokener;
tokener tokens(input, sep);
// complexity increases if I handle # as bash does.
for (const auto &t : tokens) {
if (t == "#")
break;
input_split.push_back(t);
}
return input_split;
}
void Output(std::list<std::string> &input) {
using namespace std;
for (const auto &e : input)
cout << e << endl;
}
void RebuildOps(std::list<std::string> &input, std::string op) {
using namespace std;
auto front = input.begin();
auto back = input.end();
while (front != back) {
auto element = find(front, back, op);
int count = 0;
while (element != back) {
if (*element == op) {
element = input.erase(element);
count++;
} else {
break;
}
}
std::string tempstr = "";
while (count--) {
tempstr += op;
}
if (!tempstr.empty())
front = input.insert(element, tempstr);
front++;
}
}
void CombineDefinedOps(std::list<std::string> &input) {
for (const auto &op : DEFINED_OPS) {
RebuildOps(input, op.first);
}
}
bool FoundRepeat(const std::list<std::string> &input) {
using namespace std;
for (const auto &op : DEFINED_OPS) {
if (InvalidRepeatOp(input, op)) {
cout << "Invalid '" << op.first << "' usage found" << endl
<< "known operator used an invalid amount of consecutive" << endl
<< "times: e.g. '&&&' -> '&&' ?" << endl;
return true;
}
}
return false;
}
bool InvalidRepeatOp(const std::list<std::string> &input,
std::pair<std::string, int> pair) {
std::string rebuilt_op = "";
auto op_size = pair.second;
while (op_size--) {
rebuilt_op += pair.first;
}
auto front = input.begin();
auto back = input.end();
while (front != back) {
auto itr = std::find_if(front, back, [&](std::string elem) {
if (elem.find(rebuilt_op) == std::string::npos)
return false;
else
return true;
});
if (itr == back)
return false;
else if (*itr != rebuilt_op)
break;
else {
front = itr;
front++;
}
}
return true;
}
bool UnimplementedOp(const std::list<std::string> &input, std::string op) {
using namespace std;
auto itr = find(input.begin(), input.end(), op);
if (itr == input.end()) {
cout << "operator '" << op << "' is unimplemented" << endl;
return false;
}
return true;
}
bool UseCommand(std::list<std::string> &input) {
using namespace std;
int exitvalue = 0;
auto segment = InputSegment(input);
auto pid = fork();
cout << "countem: " << pid << endl;
if (pid == -1) {
perror("Error on fork");
exit(1);
}
// child state
else if (pid == 0) {
cout << pid << endl;
Redirect(segment);
if (errno != 0) {
perror("Error in execvp. Likely a nonexisting command?");
exit(1);
}
}
// parent
else {
int status;
auto wait_val = wait(&status);
if (wait_val == -1) {
perror("Error on waiting for child process to finish");
exit(1);
}
exitvalue = WEXITSTATUS(status);
}
if (exitvalue == 0)
return true;
else
return false;
}
bool ContainsImplementedOp(std::string token) {
auto match = find(IMPLEMENTED_OPS.begin(), IMPLEMENTED_OPS.end(), token);
if (match != IMPLEMENTED_OPS.end())
return true;
return false;
}
bool UseOperator(std::list<std::string> &input, bool prevcommandstate) {
using namespace std;
if (input.empty())
return false;
string op = input.front();
input.pop_front();
if (prevcommandstate == true) {
if (op == ";")
return true;
else if (op == "&&")
return true;
else if (op == "||")
return false;
} else {
if (op == ";")
return true;
else if (op == "&&")
return false;
else if (op == "||")
return true;
}
// proper input ensures we never get down here, so im killing warning message
// fixing this 'properly' would make it annoying to add more operators later
//TODO make that not wrong^
return true;
}
void Execute(std::list<std::string> &input) {
std::cout << "exec" << std::endl;
if (input.empty() || FoundRepeat(input) || FoundAdjOp(input))
return;
bool cmdstate = true;
while (!input.empty()) {
if (input.front() == "exit")
exit(0);
if (cmdstate) {
cmdstate = UseCommand(input);
}
else
DumpCommand(input);
cmdstate = UseOperator(input, cmdstate);
}
}
void DumpCommand(std::list<std::string> &input) {
while (!input.empty() && !ContainsImplementedOp(input.front())) {
input.pop_front();
}
}
bool FoundAdjOp(std::list<std::string> &input) {
using namespace std;
for (const auto &op : IMPLEMENTED_OPS) {
auto element = input.begin();
auto front = input.begin();
auto next = input.begin();
auto back = input.end();
while (element != input.end()) {
element = find(front, back, op);
if (element == input.end())
continue;
next = element;
next++;
if (next == input.end())
continue;
else if (find(IMPLEMENTED_OPS.begin(), IMPLEMENTED_OPS.end(), *next) !=
IMPLEMENTED_OPS.end()) {
cout << "Two operators are adjacent to each other e.g. '&&;' ?" << endl;
return true;
}
front = next;
front++;
}
}
return false;
}
RedirectionTypes PeekForRedirection(std::list<std::string> input) {
std::string op = input.front();
input.pop_front();
std::string target = input.front();
input.pop_front();
if (op == ">") {
return RedirectionTypes::OUT_TRUNC;
}
else if (op == ">>") {
return RedirectionTypes::OUT_APPEND;
}
else if (op == "<") {
return RedirectionTypes::IN;
}
return RedirectionTypes::NONE;
}
void Redirect(std::list<std::string> &input) {
using namespace std;
// Take list of strings, make copies of their c_strs, and put into vector
// a vector of char* can be used as char** if used as such
vector<char *> vectorcommand = RebuildCommand(input);
cout << "input: " << endl;
for (const auto ele : input)
cout << ele << endl;
cout << "veccmd: " << endl;
for (const auto ele : vectorcommand)
cout << ele << endl;
auto itr = input.begin();
while (itr != input.end()) {
int fd = -1;
if (*itr == ">") {
itr++;
auto target = *itr;
fd = open(target.c_str(), O_RDWR | O_CREAT | O_TRUNC, 0644);
if (errno != 0) {
perror("Error in dup open or close. Likely a nonexisting command?");
exit(1);
}
close(1);
if (errno != 0) {
perror("Error in dup open or close. Likely a nonexisting command?");
exit(1);
}
dup2(fd, 1);
if (errno != 0) {
perror("Error in dup open or close. Likely a nonexisting command?");
exit(1);
}
continue;
} else if (*itr == ">>") {
itr++;
auto target = *itr;
fd = open(target.c_str(), O_RDWR | O_CREAT | O_APPEND, 0644);
if (errno != 0) {
perror("Error in dup open or close. Likely a nonexisting command?");
exit(1);
}
close(1);
if (errno != 0) {
perror("Error in dup open or close. Likely a nonexisting command?");
exit(1);
}
dup2(fd, 1);
if (errno != 0) {
perror("Error in dup open or close. Likely a nonexisting command?");
exit(1);
}
continue;
} else if (*itr == "<") {
itr++;
auto target = *itr;
fd = open(target.c_str(), O_RDONLY, 0644);
if (errno != 0) {
perror("Error in dup open or close. Likely a nonexisting command?");
exit(1);
}
close(0);
if (errno != 0) {
perror("Error in dup open or close. Likely a nonexisting command?");
exit(1);
}
dup2(fd, 0);
if (errno != 0) {
perror("Error in dup open or close. Likely a nonexisting command?");
exit(1);
}
continue;
}
else if (*itr == "|") {
}
itr++;
}
execvp(vectorcommand[0],&vectorcommand[0]);
}
std::list<std::string> InputSegment(std::list<std::string> &input) {
//[first, last) !
using namespace std;
auto stopping_point = input.begin();
stopping_point++;
while (stopping_point != input.end()) {
if (*stopping_point == ">" || *stopping_point == ">>" ||
*stopping_point == "<" || *stopping_point == "|") {
;//idk man
} else if (*stopping_point == ";" || *stopping_point == "&&" ||
*stopping_point == "||") {
break;
}
stopping_point++;
}
list<string> segment(input.begin(), stopping_point);
cout << "segment: " << endl;
for (auto s : segment)
cout << s << " ";
cout<<endl<<"left_overs"<<endl;
list<string> left_overs(stopping_point, input.end());
for (auto l : left_overs)
cout << l << " ";
input = left_overs;
return segment;
}
std::vector<char*> RebuildCommand(std::list<std::string> &input) {
using namespace std;
vector<char *> vectorcommand;
while (!input.empty() && !ContainsImplementedOp(input.front())) {
string transferstr = input.front();
input.pop_front();
char *cstrcopy = new char[transferstr.size() + 1];
memcpy(cstrcopy, transferstr.c_str(), transferstr.size() + 1);
cstrcopy[transferstr.size()] = 0;
vectorcommand.push_back(cstrcopy);
}
vectorcommand.push_back(NULL);
return vectorcommand;
}
|
reimplement > >> < so that combinations work
|
reimplement > >> < so that combinations work
|
C++
|
bsd-3-clause
|
2c2c/rshell
|
86c45dfe0304bfca4ca6efd11785a92ea71113db
|
src/rshell.cpp
|
src/rshell.cpp
|
#include <iostream>
#include <string.h>
#include <boost/tokenizer.hpp>
#include <vector>
#include <unistd.h>
#include <stdlib.h>
#include <stdio.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <algorithm>
#include <ctype.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <time.h>
#include <errno.h>
using namespace std;
using namespace boost;
class Connector
{
public:
Connector();
~Connector();
bool run;
int type;
bool runNext();
};
Connector::Connector()
{
// the semicolon connector allows the next command to be execute always
run = true;
type = 0; // semicolon connector set to 0
}
Connector::~Connector()
{
}
bool Connector::runNext()
{
if (type == 1) // && connector
{
if (!run) // if the first command doesn't succeed it wont run the next command
{
return false;
}
}
else if (type == 2) // || connector
{
if (run) // if the first command succeed it wont run the next command
{
return false;
}
}
return true;
}
void parseinator(vector<string> input, string& command, string& argument, int& position, Connector& connect, string& flag);
void commandifier(string command, string argument, Connector& connect, string flag);
int main()
{
string flag;
string str;
string command;
string argument;
Connector connect;
char hostname[100];
int position = 0;
while (true)
{
printf("%s",getlogin()); // returns string containing name of user logged in
gethostname(hostname, sizeof hostname); // returns the standard host name for the current machine
cout << "@" << hostname << "$ ";
getline(cin, str);
if (str == "exit") // special command of exit
{
break;
}
vector<string> instruction; // vector of strings
typedef tokenizer<boost::char_separator<char> > Tok;
char_separator<char> sep; // default constructed
Tok tok(str, sep);;
for (Tok::iterator tok_iter = tok.begin(); tok_iter != tok.end(); ++tok_iter) // parses the input into a command and argument
{
instruction.push_back(*tok_iter);
}
if (instruction[0] != "#") // checks for user input except for comments (#)
{
parseinator(instruction, command, argument, position, connect, flag); // parses the input into a command and argument
commandifier(command, argument, connect, flag); // runs a command with a given argument
command = "";
argument = "";
int vector_size = instruction.size();
for (; position < vector_size;) // run until the end of the instruction
{
parseinator(instruction, command, argument, position, connect, flag);
if (connect.runNext()) // checks connector to see if the next command should be ran
{
commandifier(command, argument, connect, flag);
}
else
{
connect.run = true;
command = "";
}
command = "";
argument = "";
}
position = 0;
}
}
return 0;
}
void parseinator(vector<string> input, string& command, string& argument, int& position, Connector& connect, string& flag)
{
if (input[position] == "&") // check if string is equal to & connector
{
connect.type = 1; // set & connector to 1
position += 2; // +=2 in order to take && connect
}
if (input[position] == "|")
{
connect.type = 2; // set | connector to 2
position += 2; // +=2 in order to take || connector
}
if (input[position] == ";")
{
connect.type = 0; // set ; connector to 0
position ++;
}
if (input[position] != "#")
{
command = input[position];
position++;
}
int input_size = input.size();
for (; position < input_size; position++)
{
if (input[position] == ")")
{
connect.precedence = false;
position++;
break;
}
if(command == "echo" && input[position] == "\"")
{
position++;
while(input[position] != "\"" && position <= input_size)
{
argument += input[position];
if(!isalnum(input[position].at(0)) && !isalnum(input[position+1].at(0)))
{
}
else
{
argument += " ";
}
position++;
}
position++;
break;
}
if (input[position] == "#")
{
position = input.size();
break;
}
if (input[position] == "&" || input[position] == "|" || input[position] == ";")
{
break;
}
argument += input[position];
int input_size1 = input.size();
if (position+1 != input_size1 && command == "echo")
{
//adds spaces when echoing
argument += " ";
}
}
}
void commandifier(string command, string argument, Connector& connect, string flag)
{
const char * const_command = command.c_str();
char * char_command = new char[command.size()];
const char * const_argument = argument.c_str();
char * char_argument = new char[argument.size()];
strcpy (char_command, const_command);
strcpy (char_argument, const_argument);
char * args[2]; // char pointer array that holds command, and NULL
char * args1[3]; // char pointer array that holds command, argument, and NULL
bool no_arg = true;
bool failed = false;
// exit command
if(command == "exit" || argument == "exit")
{
exit(1);
}
if (argument.size() == 0) // no arguments
{
args[0] = char_command; // args will contain the command
args[1] = NULL;
}
else
{
no_arg = false; // sets bool no_arg to false
args1[0] = char_command; // args1 contains command and argument
args1[1] = char_argument;
args1[2] = NULL;
}
pid_t c_pid, pid; // data type to reporesent process ID's
int status;
c_pid = fork(); // create our fork
if (c_pid < 0) // indicates the fork has fail if its less than 0
{
perror("fork failed");
exit(1);
}
else if (c_pid == 0) // in child process
{
if (no_arg) // no argument
{
execvp( args[0], args); // execvp the char pointer array that holds the command only
if (execvp(args[0], args) == -1) // if it returns -1 it failed
{
perror("execvp failed");
connect.run = false;
failed = true;
}
exit(3);
}
else // with command and argument
{
execvp(args1[0], args1); // execvp the char pointer array that holds the command, and argument
if (execvp(args1[0], args1) == -1) // if it returns -1 it failed
{
perror("execvp failed");
connect.run = false;
failed = true;
}
exit(3);
}
}
else if (c_pid > 0) // parent process
{
if((pid = wait(&status)) < 0 )
{
perror("wait");
exit(3);
}
if (WIFEXITED(status)) //Evaluates to a non-zero value if status was returned for a child process that terminated normally.
{
if (WEXITSTATUS(status) != 0)
{
connect.run = false;
}
else
{
connect.run = true;
}
}
else
{
connect.run = true;
}
}
}
|
#include <iostream>
#include <string.h>
#include <boost/tokenizer.hpp>
#include <vector>
#include <unistd.h>
#include <stdlib.h>
#include <stdio.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <algorithm>
#include <ctype.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <time.h>
#include <errno.h>
using namespace std;
using namespace boost;
class Connector
{
public:
Connector();
~Connector();
bool run;
int type;
bool runNext();
};
Connector::Connector()
{
// the semicolon connector allows the next command to be execute always
run = true;
type = 0; // semicolon connector set to 0
}
Connector::~Connector()
{
}
bool Connector::runNext()
{
if (type == 1) // && connector
{
if (!run) // if the first command doesn't succeed it wont run the next command
{
return false;
}
}
else if (type == 2) // || connector
{
if (run) // if the first command succeed it wont run the next command
{
return false;
}
}
return true;
}
void parseinator(vector<string> input, string& command, string& argument, int& position, Connector& connect, string& flag);
void commandifier(string command, string argument, Connector& connect, string flag);
void test_function(string command, string flag, string argument, Connector& connect);
int main()
{
string flag;
string str;
string command;
string argument;
Connector connect;
char hostname[100];
int position = 0;
while (true)
{
printf("%s",getlogin()); // returns string containing name of user logged in
gethostname(hostname, sizeof hostname); // returns the standard host name for the current machine
cout << "@" << hostname << "$ ";
getline(cin, str);
if (str == "exit") // special command of exit
{
break;
}
vector<string> instruction; // vector of strings
typedef tokenizer<boost::char_separator<char> > Tok;
char_separator<char> sep; // default constructed
Tok tok(str, sep);;
for (Tok::iterator tok_iter = tok.begin(); tok_iter != tok.end(); ++tok_iter) // parses the input into a command and argument
{
instruction.push_back(*tok_iter);
}
if (instruction[0] != "#") // checks for user input except for comments (#)
{
parseinator(instruction, command, argument, position, connect, flag); // parses the input into a command and argument
commandifier(command, argument, connect, flag); // runs a command with a given argument
command = "";
argument = "";
int vector_size = instruction.size();
for (; position < vector_size;) // run until the end of the instruction
{
parseinator(instruction, command, argument, position, connect, flag);
if (connect.runNext()) // checks connector to see if the next command should be ran
{
commandifier(command, argument, connect, flag);
}
else
{
connect.run = true;
command = "";
}
command = "";
argument = "";
}
position = 0;
}
}
return 0;
}
void parseinator(vector<string> input, string& command, string& argument, int& position, Connector& connect, string& flag)
{
if (input[position] == "&") // check if string is equal to & connector
{
connect.type = 1; // set & connector to 1
position += 2; // +=2 in order to take && connect
}
if (input[position] == "|")
{
connect.type = 2; // set | connector to 2
position += 2; // +=2 in order to take || connector
}
if (input[position] == ";")
{
connect.type = 0; // set ; connector to 0
position ++;
}
if (input[position] != "#")
{
command = input[position];
position++;
}
if (command == "test")
{
if(input[position] == "-")
{
position++;
if (input[position] == "f")
{
flag = "-e";
position++;
}
else if (input[position] == "d")
{
flag = "-d";
position++;
}
else // DEFAULT E
{
flag = "-e";
position++;
}
}
}
int input_size = input.size();
for (; position < input_size; position++)
{
if(command == "echo" && input[position] == "\"")
{
position++;
while(input[position] != "\"" && position <= input_size)
{
argument += input[position];
if(!isalnum(input[position].at(0)) && !isalnum(input[position+1].at(0)))
{
}
else
{
argument += " ";
}
position++;
}
position++;
break;
}
if (input[position] == "#")
{
position = input.size();
break;
}
if (input[position] == "&" || input[position] == "|" || input[position] == ";")
{
break;
}
argument += input[position];
int input_size1 = input.size();
if (position+1 != input_size1 && command == "echo")
{
//adds spaces when echoing
argument += " ";
}
}
}
void commandifier(string command, string argument, Connector& connect, string flag)
{
const char * const_command = command.c_str();
char * char_command = new char[command.size()];
const char * const_argument = argument.c_str();
char * char_argument = new char[argument.size()];
strcpy (char_command, const_command);
strcpy (char_argument, const_argument);
char * args[2]; // char pointer array that holds command, and NULL
char * args1[3]; // char pointer array that holds command, argument, and NULL
bool no_arg = true;
bool failed = false;
if(command == "test" || command == "[")
{
test_function(command,flag,argument,connect);
return;
}
// exit command
if(command == "exit" || argument == "exit")
{
exit(1);
}
if (argument.size() == 0) // no arguments
{
args[0] = char_command; // args will contain the command
args[1] = NULL;
}
else
{
no_arg = false; // sets bool no_arg to false
args1[0] = char_command; // args1 contains command and argument
args1[1] = char_argument;
args1[2] = NULL;
}
pid_t c_pid, pid; // data type to reporesent process ID's
int status;
c_pid = fork(); // create our fork
if (c_pid < 0) // indicates the fork has fail if its less than 0
{
perror("fork failed");
exit(1);
}
else if (c_pid == 0) // in child process
{
if (no_arg) // no argument
{
execvp( args[0], args); // execvp the char pointer array that holds the command only
if (execvp(args[0], args) == -1) // if it returns -1 it failed
{
perror("execvp failed");
connect.run = false;
failed = true;
}
exit(3);
}
else // with command and argument
{
execvp(args1[0], args1); // execvp the char pointer array that holds the command, and argument
if (execvp(args1[0], args1) == -1) // if it returns -1 it failed
{
perror("execvp failed");
connect.run = false;
failed = true;
}
exit(3);
}
}
else if (c_pid > 0) // parent process
{
if((pid = wait(&status)) < 0 )
{
perror("wait");
exit(3);
}
if (WIFEXITED(status)) //Evaluates to a non-zero value if status was returned for a child process that terminated normally.
{
if (WEXITSTATUS(status) != 0)
{
connect.run = false;
}
else
{
connect.run = true;
}
}
else
{
connect.run = true;
}
}
}
void test_function(string command, string flag, string argument, Connector &connect)
{
const char * arg = argument.c_str();
struct stat sb;
if(flag == "-f")
{
switch (sb.st_mode & S_IFMT){
case S_IFREG: connect.run = true;
}
}
if(flag == "-d")
{
switch(sb.st_mode & S_IFMT){
case S_IFDIR: connect.run = true;
}
}
if(stat(arg,&sb)==0)
{
connect.run = true;
}
else
{
connect.run = false;
}
}
|
Update rshell.cpp
|
Update rshell.cpp
Added Test Function
|
C++
|
bsd-3-clause
|
davidzhu94/rshell
|
aceb7d8b97d258a6789cd78a5932709d9b6dbe3d
|
lib/Target/SparcV9/SparcV9TargetMachine.cpp
|
lib/Target/SparcV9/SparcV9TargetMachine.cpp
|
//===-- SparcV9TargetMachine.cpp - SparcV9 Target Machine Implementation --===//
//
// The LLVM Compiler Infrastructure
//
// This file was developed by the LLVM research group and is distributed under
// the University of Illinois Open Source License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// Primary interface to machine description for the UltraSPARC. Primarily just
// initializes machine-dependent parameters in class TargetMachine, and creates
// machine-dependent subclasses for classes such as TargetInstrInfo.
//
//===----------------------------------------------------------------------===//
#include "llvm/Function.h"
#include "llvm/PassManager.h"
#include "llvm/Assembly/PrintModulePass.h"
#include "llvm/CodeGen/InstrSelection.h"
#include "llvm/CodeGen/InstrScheduling.h"
#include "llvm/CodeGen/IntrinsicLowering.h"
#include "llvm/CodeGen/MachineFunction.h"
#include "llvm/CodeGen/MachineFunctionInfo.h"
#include "llvm/CodeGen/MachineCodeForInstruction.h"
#include "llvm/CodeGen/Passes.h"
#include "llvm/Target/TargetOptions.h"
#include "llvm/Target/TargetMachineRegistry.h"
#include "llvm/Transforms/Scalar.h"
#include "MappingInfo.h"
#include "SparcV9Internals.h"
#include "SparcV9TargetMachine.h"
#include "Support/CommandLine.h"
using namespace llvm;
static const unsigned ImplicitRegUseList[] = { 0 }; /* not used yet */
// Build the MachineInstruction Description Array...
const TargetInstrDescriptor llvm::SparcV9MachineInstrDesc[] = {
#define I(ENUM, OPCODESTRING, NUMOPERANDS, RESULTPOS, MAXIMM, IMMSE, \
NUMDELAYSLOTS, LATENCY, SCHEDCLASS, INSTFLAGS) \
{ OPCODESTRING, NUMOPERANDS, RESULTPOS, MAXIMM, IMMSE, \
NUMDELAYSLOTS, LATENCY, SCHEDCLASS, INSTFLAGS, 0, \
ImplicitRegUseList, ImplicitRegUseList },
#include "SparcV9Instr.def"
};
//---------------------------------------------------------------------------
// Command line options to control choice of code generation passes.
//---------------------------------------------------------------------------
namespace {
cl::opt<bool> DisableSched("disable-sched",
cl::desc("Disable local scheduling pass"));
cl::opt<bool> DisablePeephole("disable-peephole",
cl::desc("Disable peephole optimization pass"));
cl::opt<bool> EmitMappingInfo("enable-maps",
cl::desc("Emit LLVM-to-MachineCode mapping info to assembly"));
cl::opt<bool> DisableStrip("disable-strip",
cl::desc("Do not strip the LLVM bytecode in executable"));
// Register the target.
RegisterTarget<SparcV9TargetMachine> X("sparcv9", " SPARC V9");
}
unsigned SparcV9TargetMachine::getJITMatchQuality() {
#if defined(sparc) || defined(__sparc__) || defined(__sparcv9)
return 10;
#else
return 0;
#endif
}
unsigned SparcV9TargetMachine::getModuleMatchQuality(const Module &M) {
if (M.getEndianness() == Module::BigEndian &&
M.getPointerSize() == Module::Pointer64)
return 10; // Direct match
else if (M.getEndianness() != Module::AnyEndianness ||
M.getPointerSize() != Module::AnyPointerSize)
return 0; // Match for some other target
return getJITMatchQuality()/2;
}
//===---------------------------------------------------------------------===//
// Code generation/destruction passes
//===---------------------------------------------------------------------===//
namespace {
class ConstructMachineFunction : public FunctionPass {
TargetMachine &Target;
public:
ConstructMachineFunction(TargetMachine &T) : Target(T) {}
const char *getPassName() const {
return "ConstructMachineFunction";
}
bool runOnFunction(Function &F) {
MachineFunction::construct(&F, Target).getInfo()->CalculateArgSize();
return false;
}
};
struct DestroyMachineFunction : public FunctionPass {
const char *getPassName() const { return "DestroyMachineFunction"; }
static void freeMachineCode(Instruction &I) {
MachineCodeForInstruction::destroy(&I);
}
bool runOnFunction(Function &F) {
for (Function::iterator FI = F.begin(), FE = F.end(); FI != FE; ++FI)
for (BasicBlock::iterator I = FI->begin(), E = FI->end(); I != E; ++I)
MachineCodeForInstruction::get(I).dropAllReferences();
for (Function::iterator FI = F.begin(), FE = F.end(); FI != FE; ++FI)
for_each(FI->begin(), FI->end(), freeMachineCode);
MachineFunction::destruct(&F);
return false;
}
};
FunctionPass *createMachineCodeConstructionPass(TargetMachine &Target) {
return new ConstructMachineFunction(Target);
}
}
FunctionPass *llvm::createSparcV9MachineCodeDestructionPass() {
return new DestroyMachineFunction();
}
SparcV9TargetMachine::SparcV9TargetMachine(const Module &M,
IntrinsicLowering *il)
: TargetMachine("UltraSparcV9-Native", il, false),
schedInfo(*this),
regInfo(*this),
frameInfo(*this),
jitInfo(*this) {
}
/// addPassesToEmitAssembly - This method controls the entire code generation
/// process for the ultra sparc.
///
bool
SparcV9TargetMachine::addPassesToEmitAssembly(PassManager &PM, std::ostream &Out)
{
// FIXME: Implement efficient support for garbage collection intrinsics.
PM.add(createLowerGCPass());
// Replace malloc and free instructions with library calls.
PM.add(createLowerAllocationsPass());
// FIXME: implement the switch instruction in the instruction selector.
PM.add(createLowerSwitchPass());
// FIXME: implement the invoke/unwind instructions!
PM.add(createLowerInvokePass());
// decompose multi-dimensional array references into single-dim refs
PM.add(createDecomposeMultiDimRefsPass());
// Lower LLVM code to the form expected by the SPARCv9 instruction selector.
PM.add(createPreSelectionPass(*this));
PM.add(createLowerSelectPass());
// Run basic LLVM dataflow optimizations, to clean up after pre-selection.
PM.add(createReassociatePass());
PM.add(createLICMPass());
PM.add(createGCSEPass());
// If the user's trying to read the generated code, they'll need to see the
// transformed input.
if (PrintMachineCode)
PM.add(new PrintModulePass());
// Construct and initialize the MachineFunction object for this fn.
PM.add(createMachineCodeConstructionPass(*this));
// Insert empty stackslots in the stack frame of each function
// so %fp+offset-8 and %fp+offset-16 are empty slots now!
PM.add(createStackSlotsPass(*this));
PM.add(createInstructionSelectionPass(*this));
if (!DisableSched)
PM.add(createInstructionSchedulingWithSSAPass(*this));
if (PrintMachineCode)
PM.add(createMachineFunctionPrinterPass(&std::cerr, "Before reg alloc:\n"));
PM.add(getRegisterAllocator(*this));
if (PrintMachineCode)
PM.add(createMachineFunctionPrinterPass(&std::cerr, "After reg alloc:\n"));
PM.add(createPrologEpilogInsertionPass());
if (!DisablePeephole)
PM.add(createPeepholeOptsPass(*this));
if (PrintMachineCode)
PM.add(createMachineFunctionPrinterPass(&std::cerr, "Final code:\n"));
if (EmitMappingInfo) {
PM.add(createInternalGlobalMapperPass());
PM.add(getMappingInfoAsmPrinterPass(Out));
}
// Output assembly language to the .s file. Assembly emission is split into
// two parts: Function output and Global value output. This is because
// function output is pipelined with all of the rest of code generation stuff,
// allowing machine code representations for functions to be free'd after the
// function has been emitted.
PM.add(createAsmPrinterPass(Out, *this));
// Free machine-code IR which is no longer needed:
PM.add(createSparcV9MachineCodeDestructionPass());
// Emit bytecode to the assembly file into its special section next
if (EmitMappingInfo) {
// Strip all of the symbols from the bytecode so that it will be smaller...
if (!DisableStrip)
PM.add(createSymbolStrippingPass());
PM.add(createBytecodeAsmPrinterPass(Out));
}
return false;
}
/// addPassesToJITCompile - This method controls the JIT method of code
/// generation for the UltraSparcV9.
///
void SparcV9JITInfo::addPassesToJITCompile(FunctionPassManager &PM) {
// FIXME: Implement efficient support for garbage collection intrinsics.
PM.add(createLowerGCPass());
// Replace malloc and free instructions with library calls.
PM.add(createLowerAllocationsPass());
// FIXME: implement the switch instruction in the instruction selector.
PM.add(createLowerSwitchPass());
// FIXME: implement the invoke/unwind instructions!
PM.add(createLowerInvokePass());
// decompose multi-dimensional array references into single-dim refs
PM.add(createDecomposeMultiDimRefsPass());
// Lower LLVM code to the form expected by the SPARCv9 instruction selector.
PM.add(createPreSelectionPass(TM));
PM.add(createLowerSelectPass());
// Run basic LLVM dataflow optimizations, to clean up after pre-selection.
PM.add(createReassociatePass());
// FIXME: these passes crash the FunctionPassManager when being added...
//PM.add(createLICMPass());
//PM.add(createGCSEPass());
// If the user's trying to read the generated code, they'll need to see the
// transformed input.
if (PrintMachineCode)
PM.add(new PrintFunctionPass());
// Construct and initialize the MachineFunction object for this fn.
PM.add(createMachineCodeConstructionPass(TM));
PM.add(createInstructionSelectionPass(TM));
if (PrintMachineCode)
PM.add(createMachineFunctionPrinterPass(&std::cerr, "Before reg alloc:\n"));
PM.add(getRegisterAllocator(TM));
if (PrintMachineCode)
PM.add(createMachineFunctionPrinterPass(&std::cerr, "After reg alloc:\n"));
PM.add(createPrologEpilogInsertionPass());
if (!DisablePeephole)
PM.add(createPeepholeOptsPass(TM));
if (PrintMachineCode)
PM.add(createMachineFunctionPrinterPass(&std::cerr, "Final code:\n"));
}
|
//===-- SparcV9TargetMachine.cpp - SparcV9 Target Machine Implementation --===//
//
// The LLVM Compiler Infrastructure
//
// This file was developed by the LLVM research group and is distributed under
// the University of Illinois Open Source License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// Primary interface to machine description for the UltraSPARC. Primarily just
// initializes machine-dependent parameters in class TargetMachine, and creates
// machine-dependent subclasses for classes such as TargetInstrInfo.
//
//===----------------------------------------------------------------------===//
#include "llvm/Function.h"
#include "llvm/PassManager.h"
#include "llvm/Assembly/PrintModulePass.h"
#include "llvm/CodeGen/InstrScheduling.h"
#include "llvm/CodeGen/IntrinsicLowering.h"
#include "llvm/CodeGen/MachineFunction.h"
#include "llvm/CodeGen/MachineFunctionInfo.h"
#include "llvm/CodeGen/MachineCodeForInstruction.h"
#include "llvm/CodeGen/Passes.h"
#include "llvm/Target/TargetOptions.h"
#include "llvm/Target/TargetMachineRegistry.h"
#include "llvm/Transforms/Scalar.h"
#include "MappingInfo.h"
#include "SparcV9Internals.h"
#include "SparcV9TargetMachine.h"
#include "SparcV9BurgISel.h"
#include "Support/CommandLine.h"
using namespace llvm;
static const unsigned ImplicitRegUseList[] = { 0 }; /* not used yet */
// Build the MachineInstruction Description Array...
const TargetInstrDescriptor llvm::SparcV9MachineInstrDesc[] = {
#define I(ENUM, OPCODESTRING, NUMOPERANDS, RESULTPOS, MAXIMM, IMMSE, \
NUMDELAYSLOTS, LATENCY, SCHEDCLASS, INSTFLAGS) \
{ OPCODESTRING, NUMOPERANDS, RESULTPOS, MAXIMM, IMMSE, \
NUMDELAYSLOTS, LATENCY, SCHEDCLASS, INSTFLAGS, 0, \
ImplicitRegUseList, ImplicitRegUseList },
#include "SparcV9Instr.def"
};
//---------------------------------------------------------------------------
// Command line options to control choice of code generation passes.
//---------------------------------------------------------------------------
namespace {
cl::opt<bool> DisableSched("disable-sched",
cl::desc("Disable local scheduling pass"));
cl::opt<bool> DisablePeephole("disable-peephole",
cl::desc("Disable peephole optimization pass"));
cl::opt<bool> EmitMappingInfo("enable-maps",
cl::desc("Emit LLVM-to-MachineCode mapping info to assembly"));
cl::opt<bool> DisableStrip("disable-strip",
cl::desc("Do not strip the LLVM bytecode in executable"));
// Register the target.
RegisterTarget<SparcV9TargetMachine> X("sparcv9", " SPARC V9");
}
unsigned SparcV9TargetMachine::getJITMatchQuality() {
#if defined(sparc) || defined(__sparc__) || defined(__sparcv9)
return 10;
#else
return 0;
#endif
}
unsigned SparcV9TargetMachine::getModuleMatchQuality(const Module &M) {
if (M.getEndianness() == Module::BigEndian &&
M.getPointerSize() == Module::Pointer64)
return 10; // Direct match
else if (M.getEndianness() != Module::AnyEndianness ||
M.getPointerSize() != Module::AnyPointerSize)
return 0; // Match for some other target
return getJITMatchQuality()/2;
}
//===---------------------------------------------------------------------===//
// Code generation/destruction passes
//===---------------------------------------------------------------------===//
namespace {
class ConstructMachineFunction : public FunctionPass {
TargetMachine &Target;
public:
ConstructMachineFunction(TargetMachine &T) : Target(T) {}
const char *getPassName() const {
return "ConstructMachineFunction";
}
bool runOnFunction(Function &F) {
MachineFunction::construct(&F, Target).getInfo()->CalculateArgSize();
return false;
}
};
struct DestroyMachineFunction : public FunctionPass {
const char *getPassName() const { return "DestroyMachineFunction"; }
static void freeMachineCode(Instruction &I) {
MachineCodeForInstruction::destroy(&I);
}
bool runOnFunction(Function &F) {
for (Function::iterator FI = F.begin(), FE = F.end(); FI != FE; ++FI)
for (BasicBlock::iterator I = FI->begin(), E = FI->end(); I != E; ++I)
MachineCodeForInstruction::get(I).dropAllReferences();
for (Function::iterator FI = F.begin(), FE = F.end(); FI != FE; ++FI)
for_each(FI->begin(), FI->end(), freeMachineCode);
MachineFunction::destruct(&F);
return false;
}
};
FunctionPass *createMachineCodeConstructionPass(TargetMachine &Target) {
return new ConstructMachineFunction(Target);
}
}
FunctionPass *llvm::createSparcV9MachineCodeDestructionPass() {
return new DestroyMachineFunction();
}
SparcV9TargetMachine::SparcV9TargetMachine(const Module &M,
IntrinsicLowering *il)
: TargetMachine("UltraSparcV9-Native", il, false),
schedInfo(*this),
regInfo(*this),
frameInfo(*this),
jitInfo(*this) {
}
/// addPassesToEmitAssembly - This method controls the entire code generation
/// process for the ultra sparc.
///
bool
SparcV9TargetMachine::addPassesToEmitAssembly(PassManager &PM, std::ostream &Out)
{
// FIXME: Implement efficient support for garbage collection intrinsics.
PM.add(createLowerGCPass());
// Replace malloc and free instructions with library calls.
PM.add(createLowerAllocationsPass());
// FIXME: implement the switch instruction in the instruction selector.
PM.add(createLowerSwitchPass());
// FIXME: implement the invoke/unwind instructions!
PM.add(createLowerInvokePass());
// decompose multi-dimensional array references into single-dim refs
PM.add(createDecomposeMultiDimRefsPass());
// Lower LLVM code to the form expected by the SPARCv9 instruction selector.
PM.add(createPreSelectionPass(*this));
PM.add(createLowerSelectPass());
// Run basic LLVM dataflow optimizations, to clean up after pre-selection.
PM.add(createReassociatePass());
PM.add(createLICMPass());
PM.add(createGCSEPass());
// If the user's trying to read the generated code, they'll need to see the
// transformed input.
if (PrintMachineCode)
PM.add(new PrintModulePass());
// Construct and initialize the MachineFunction object for this fn.
PM.add(createMachineCodeConstructionPass(*this));
// Insert empty stackslots in the stack frame of each function
// so %fp+offset-8 and %fp+offset-16 are empty slots now!
PM.add(createStackSlotsPass(*this));
PM.add(createSparcV9BurgInstSelector(*this));
if (!DisableSched)
PM.add(createInstructionSchedulingWithSSAPass(*this));
if (PrintMachineCode)
PM.add(createMachineFunctionPrinterPass(&std::cerr, "Before reg alloc:\n"));
PM.add(getRegisterAllocator(*this));
if (PrintMachineCode)
PM.add(createMachineFunctionPrinterPass(&std::cerr, "After reg alloc:\n"));
PM.add(createPrologEpilogInsertionPass());
if (!DisablePeephole)
PM.add(createPeepholeOptsPass(*this));
if (PrintMachineCode)
PM.add(createMachineFunctionPrinterPass(&std::cerr, "Final code:\n"));
if (EmitMappingInfo) {
PM.add(createInternalGlobalMapperPass());
PM.add(getMappingInfoAsmPrinterPass(Out));
}
// Output assembly language to the .s file. Assembly emission is split into
// two parts: Function output and Global value output. This is because
// function output is pipelined with all of the rest of code generation stuff,
// allowing machine code representations for functions to be free'd after the
// function has been emitted.
PM.add(createAsmPrinterPass(Out, *this));
// Free machine-code IR which is no longer needed:
PM.add(createSparcV9MachineCodeDestructionPass());
// Emit bytecode to the assembly file into its special section next
if (EmitMappingInfo) {
// Strip all of the symbols from the bytecode so that it will be smaller...
if (!DisableStrip)
PM.add(createSymbolStrippingPass());
PM.add(createBytecodeAsmPrinterPass(Out));
}
return false;
}
/// addPassesToJITCompile - This method controls the JIT method of code
/// generation for the UltraSparcV9.
///
void SparcV9JITInfo::addPassesToJITCompile(FunctionPassManager &PM) {
// FIXME: Implement efficient support for garbage collection intrinsics.
PM.add(createLowerGCPass());
// Replace malloc and free instructions with library calls.
PM.add(createLowerAllocationsPass());
// FIXME: implement the switch instruction in the instruction selector.
PM.add(createLowerSwitchPass());
// FIXME: implement the invoke/unwind instructions!
PM.add(createLowerInvokePass());
// decompose multi-dimensional array references into single-dim refs
PM.add(createDecomposeMultiDimRefsPass());
// Lower LLVM code to the form expected by the SPARCv9 instruction selector.
PM.add(createPreSelectionPass(TM));
PM.add(createLowerSelectPass());
// Run basic LLVM dataflow optimizations, to clean up after pre-selection.
PM.add(createReassociatePass());
// FIXME: these passes crash the FunctionPassManager when being added...
//PM.add(createLICMPass());
//PM.add(createGCSEPass());
// If the user's trying to read the generated code, they'll need to see the
// transformed input.
if (PrintMachineCode)
PM.add(new PrintFunctionPass());
// Construct and initialize the MachineFunction object for this fn.
PM.add(createMachineCodeConstructionPass(TM));
PM.add(createSparcV9BurgInstSelector(TM));
if (PrintMachineCode)
PM.add(createMachineFunctionPrinterPass(&std::cerr, "Before reg alloc:\n"));
PM.add(getRegisterAllocator(TM));
if (PrintMachineCode)
PM.add(createMachineFunctionPrinterPass(&std::cerr, "After reg alloc:\n"));
PM.add(createPrologEpilogInsertionPass());
if (!DisablePeephole)
PM.add(createPeepholeOptsPass(TM));
if (PrintMachineCode)
PM.add(createMachineFunctionPrinterPass(&std::cerr, "Final code:\n"));
}
|
Include SparcV9BurgISel.h, to pick up the definition of createSparcV9BurgInstSelector().
|
Include SparcV9BurgISel.h, to pick up the definition of
createSparcV9BurgInstSelector().
git-svn-id: 0ff597fd157e6f4fc38580e8d64ab130330d2411@15474 91177308-0d34-0410-b5e6-96231b3b80d8
|
C++
|
apache-2.0
|
llvm-mirror/llvm,apple/swift-llvm,chubbymaggie/asap,llvm-mirror/llvm,dslab-epfl/asap,apple/swift-llvm,chubbymaggie/asap,chubbymaggie/asap,chubbymaggie/asap,apple/swift-llvm,llvm-mirror/llvm,chubbymaggie/asap,dslab-epfl/asap,llvm-mirror/llvm,GPUOpen-Drivers/llvm,llvm-mirror/llvm,apple/swift-llvm,GPUOpen-Drivers/llvm,dslab-epfl/asap,llvm-mirror/llvm,GPUOpen-Drivers/llvm,apple/swift-llvm,llvm-mirror/llvm,dslab-epfl/asap,GPUOpen-Drivers/llvm,llvm-mirror/llvm,chubbymaggie/asap,GPUOpen-Drivers/llvm,dslab-epfl/asap,GPUOpen-Drivers/llvm,dslab-epfl/asap,apple/swift-llvm,apple/swift-llvm,GPUOpen-Drivers/llvm,llvm-mirror/llvm,GPUOpen-Drivers/llvm,apple/swift-llvm,dslab-epfl/asap
|
5788bca1c217934b884712b1bfa9441fb4a3557d
|
lib/Transforms/Utils/BreakCriticalEdges.cpp
|
lib/Transforms/Utils/BreakCriticalEdges.cpp
|
//===- BreakCriticalEdges.cpp - Critical Edge Elimination Pass ------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// BreakCriticalEdges pass - Break all of the critical edges in the CFG by
// inserting a dummy basic block. This pass may be "required" by passes that
// cannot deal with critical edges. For this usage, the structure type is
// forward declared. This pass obviously invalidates the CFG, but can update
// forward dominator (set, immediate dominators, tree, and frontier)
// information.
//
//===----------------------------------------------------------------------===//
#define DEBUG_TYPE "break-crit-edges"
#include "llvm/Transforms/Scalar.h"
#include "llvm/Transforms/Utils/BasicBlockUtils.h"
#include "llvm/Analysis/Dominators.h"
#include "llvm/Analysis/LoopInfo.h"
#include "llvm/Function.h"
#include "llvm/Instructions.h"
#include "llvm/Type.h"
#include "llvm/Support/CFG.h"
#include "llvm/Support/Compiler.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/ADT/Statistic.h"
using namespace llvm;
STATISTIC(NumBroken, "Number of blocks inserted");
namespace {
struct VISIBILITY_HIDDEN BreakCriticalEdges : public FunctionPass {
static char ID; // Pass identification, replacement for typeid
BreakCriticalEdges() : FunctionPass((intptr_t)&ID) {}
virtual bool runOnFunction(Function &F);
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
AU.addPreserved<DominatorTree>();
AU.addPreserved<DominanceFrontier>();
AU.addPreserved<LoopInfo>();
// No loop canonicalization guarantees are broken by this pass.
AU.addPreservedID(LoopSimplifyID);
}
};
char BreakCriticalEdges::ID = 0;
RegisterPass<BreakCriticalEdges> X("break-crit-edges",
"Break critical edges in CFG");
}
// Publically exposed interface to pass...
const PassInfo *llvm::BreakCriticalEdgesID = X.getPassInfo();
FunctionPass *llvm::createBreakCriticalEdgesPass() {
return new BreakCriticalEdges();
}
// runOnFunction - Loop over all of the edges in the CFG, breaking critical
// edges as they are found.
//
bool BreakCriticalEdges::runOnFunction(Function &F) {
bool Changed = false;
for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I) {
TerminatorInst *TI = I->getTerminator();
if (TI->getNumSuccessors() > 1)
for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
if (SplitCriticalEdge(TI, i, this)) {
++NumBroken;
Changed = true;
}
}
return Changed;
}
//===----------------------------------------------------------------------===//
// Implementation of the external critical edge manipulation functions
//===----------------------------------------------------------------------===//
// isCriticalEdge - Return true if the specified edge is a critical edge.
// Critical edges are edges from a block with multiple successors to a block
// with multiple predecessors.
//
bool llvm::isCriticalEdge(const TerminatorInst *TI, unsigned SuccNum,
bool AllowIdenticalEdges) {
assert(SuccNum < TI->getNumSuccessors() && "Illegal edge specification!");
if (TI->getNumSuccessors() == 1) return false;
const BasicBlock *Dest = TI->getSuccessor(SuccNum);
pred_const_iterator I = pred_begin(Dest), E = pred_end(Dest);
// If there is more than one predecessor, this is a critical edge...
assert(I != E && "No preds, but we have an edge to the block?");
const BasicBlock *FirstPred = *I;
++I; // Skip one edge due to the incoming arc from TI.
if (!AllowIdenticalEdges)
return I != E;
// If AllowIdenticalEdges is true, then we allow this edge to be considered
// non-critical iff all preds come from TI's block.
while (I != E) {
pred_const_iterator E1 = E;
if (*I != FirstPred)
return true;
// Note: leave this as is until no one ever compiles with either gcc 4.0.1
// or Xcode 2. This seems to work around the pred_iterator assert in PR 2207
E = pred_end(*I);
++I;
}
return false;
}
// SplitCriticalEdge - If this edge is a critical edge, insert a new node to
// split the critical edge. This will update DominatorTree, and DominatorFrontier
// information if it is available, thus calling this pass will not invalidate
// any of them. This returns true if the edge was split, false otherwise.
// This ensures that all edges to that dest go to one block instead of each
// going to a different block.
//
bool llvm::SplitCriticalEdge(TerminatorInst *TI, unsigned SuccNum, Pass *P,
bool MergeIdenticalEdges) {
if (!isCriticalEdge(TI, SuccNum, MergeIdenticalEdges)) return false;
BasicBlock *TIBB = TI->getParent();
BasicBlock *DestBB = TI->getSuccessor(SuccNum);
// Create a new basic block, linking it into the CFG.
BasicBlock *NewBB = BasicBlock::Create(TIBB->getName() + "." +
DestBB->getName() + "_crit_edge");
// Create our unconditional branch...
BranchInst::Create(DestBB, NewBB);
// Branch to the new block, breaking the edge.
TI->setSuccessor(SuccNum, NewBB);
// Insert the block into the function... right after the block TI lives in.
Function &F = *TIBB->getParent();
Function::iterator FBBI = TIBB;
F.getBasicBlockList().insert(++FBBI, NewBB);
// If there are any PHI nodes in DestBB, we need to update them so that they
// merge incoming values from NewBB instead of from TIBB.
//
for (BasicBlock::iterator I = DestBB->begin(); isa<PHINode>(I); ++I) {
PHINode *PN = cast<PHINode>(I);
// We no longer enter through TIBB, now we come in through NewBB. Revector
// exactly one entry in the PHI node that used to come from TIBB to come
// from NewBB.
int BBIdx = PN->getBasicBlockIndex(TIBB);
PN->setIncomingBlock(BBIdx, NewBB);
}
// If there are any other edges from TIBB to DestBB, update those to go
// through the split block, making those edges non-critical as well (and
// reducing the number of phi entries in the DestBB if relevant).
if (MergeIdenticalEdges) {
for (unsigned i = SuccNum+1, e = TI->getNumSuccessors(); i != e; ++i) {
if (TI->getSuccessor(i) != DestBB) continue;
// Remove an entry for TIBB from DestBB phi nodes.
DestBB->removePredecessor(TIBB);
// We found another edge to DestBB, go to NewBB instead.
TI->setSuccessor(i, NewBB);
}
}
// If we don't have a pass object, we can't update anything...
if (P == 0) return true;
// Now update analysis information. Since the only predecessor of NewBB is
// the TIBB, TIBB clearly dominates NewBB. TIBB usually doesn't dominate
// anything, as there are other successors of DestBB. However, if all other
// predecessors of DestBB are already dominated by DestBB (e.g. DestBB is a
// loop header) then NewBB dominates DestBB.
SmallVector<BasicBlock*, 8> OtherPreds;
for (pred_iterator I = pred_begin(DestBB), E = pred_end(DestBB); I != E; ++I)
if (*I != NewBB)
OtherPreds.push_back(*I);
bool NewBBDominatesDestBB = true;
// Should we update DominatorTree information?
if (DominatorTree *DT = P->getAnalysisToUpdate<DominatorTree>()) {
DomTreeNode *TINode = DT->getNode(TIBB);
// The new block is not the immediate dominator for any other nodes, but
// TINode is the immediate dominator for the new node.
//
if (TINode) { // Don't break unreachable code!
DomTreeNode *NewBBNode = DT->addNewBlock(NewBB, TIBB);
DomTreeNode *DestBBNode = 0;
// If NewBBDominatesDestBB hasn't been computed yet, do so with DT.
if (!OtherPreds.empty()) {
DestBBNode = DT->getNode(DestBB);
while (!OtherPreds.empty() && NewBBDominatesDestBB) {
if (DomTreeNode *OPNode = DT->getNode(OtherPreds.back()))
NewBBDominatesDestBB = DT->dominates(DestBBNode, OPNode);
OtherPreds.pop_back();
}
OtherPreds.clear();
}
// If NewBBDominatesDestBB, then NewBB dominates DestBB, otherwise it
// doesn't dominate anything.
if (NewBBDominatesDestBB) {
if (!DestBBNode) DestBBNode = DT->getNode(DestBB);
DT->changeImmediateDominator(DestBBNode, NewBBNode);
}
}
}
// Should we update DominanceFrontier information?
if (DominanceFrontier *DF = P->getAnalysisToUpdate<DominanceFrontier>()) {
// If NewBBDominatesDestBB hasn't been computed yet, do so with DF.
if (!OtherPreds.empty()) {
// FIXME: IMPLEMENT THIS!
assert(0 && "Requiring domfrontiers but not idom/domtree/domset."
" not implemented yet!");
}
// Since the new block is dominated by its only predecessor TIBB,
// it cannot be in any block's dominance frontier. If NewBB dominates
// DestBB, its dominance frontier is the same as DestBB's, otherwise it is
// just {DestBB}.
DominanceFrontier::DomSetType NewDFSet;
if (NewBBDominatesDestBB) {
DominanceFrontier::iterator I = DF->find(DestBB);
if (I != DF->end()) {
DF->addBasicBlock(NewBB, I->second);
// However NewBB's frontier does not include DestBB.
DominanceFrontier::iterator NF = DF->find(NewBB);
DF->removeFromFrontier(NF, DestBB);
}
else
DF->addBasicBlock(NewBB, DominanceFrontier::DomSetType());
} else {
DominanceFrontier::DomSetType NewDFSet;
NewDFSet.insert(DestBB);
DF->addBasicBlock(NewBB, NewDFSet);
}
}
// Update LoopInfo if it is around.
if (LoopInfo *LI = P->getAnalysisToUpdate<LoopInfo>()) {
// If one or the other blocks were not in a loop, the new block is not
// either, and thus LI doesn't need to be updated.
if (Loop *TIL = LI->getLoopFor(TIBB))
if (Loop *DestLoop = LI->getLoopFor(DestBB)) {
if (TIL == DestLoop) {
// Both in the same loop, the NewBB joins loop.
DestLoop->addBasicBlockToLoop(NewBB, LI->getBase());
} else if (TIL->contains(DestLoop->getHeader())) {
// Edge from an outer loop to an inner loop. Add to the outer loop.
TIL->addBasicBlockToLoop(NewBB, LI->getBase());
} else if (DestLoop->contains(TIL->getHeader())) {
// Edge from an inner loop to an outer loop. Add to the outer loop.
DestLoop->addBasicBlockToLoop(NewBB, LI->getBase());
} else {
// Edge from two loops with no containment relation. Because these
// are natural loops, we know that the destination block must be the
// header of its loop (adding a branch into a loop elsewhere would
// create an irreducible loop).
assert(DestLoop->getHeader() == DestBB &&
"Should not create irreducible loops!");
if (Loop *P = DestLoop->getParentLoop())
P->addBasicBlockToLoop(NewBB, LI->getBase());
}
}
}
return true;
}
|
//===- BreakCriticalEdges.cpp - Critical Edge Elimination Pass ------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// BreakCriticalEdges pass - Break all of the critical edges in the CFG by
// inserting a dummy basic block. This pass may be "required" by passes that
// cannot deal with critical edges. For this usage, the structure type is
// forward declared. This pass obviously invalidates the CFG, but can update
// forward dominator (set, immediate dominators, tree, and frontier)
// information.
//
//===----------------------------------------------------------------------===//
#define DEBUG_TYPE "break-crit-edges"
#include "llvm/Transforms/Scalar.h"
#include "llvm/Transforms/Utils/BasicBlockUtils.h"
#include "llvm/Analysis/Dominators.h"
#include "llvm/Analysis/LoopInfo.h"
#include "llvm/Function.h"
#include "llvm/Instructions.h"
#include "llvm/Type.h"
#include "llvm/Support/CFG.h"
#include "llvm/Support/Compiler.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/ADT/Statistic.h"
using namespace llvm;
STATISTIC(NumBroken, "Number of blocks inserted");
namespace {
struct VISIBILITY_HIDDEN BreakCriticalEdges : public FunctionPass {
static char ID; // Pass identification, replacement for typeid
BreakCriticalEdges() : FunctionPass((intptr_t)&ID) {}
virtual bool runOnFunction(Function &F);
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
AU.addPreserved<DominatorTree>();
AU.addPreserved<DominanceFrontier>();
AU.addPreserved<LoopInfo>();
// No loop canonicalization guarantees are broken by this pass.
AU.addPreservedID(LoopSimplifyID);
}
};
char BreakCriticalEdges::ID = 0;
RegisterPass<BreakCriticalEdges> X("break-crit-edges",
"Break critical edges in CFG");
}
// Publically exposed interface to pass...
const PassInfo *llvm::BreakCriticalEdgesID = X.getPassInfo();
FunctionPass *llvm::createBreakCriticalEdgesPass() {
return new BreakCriticalEdges();
}
// runOnFunction - Loop over all of the edges in the CFG, breaking critical
// edges as they are found.
//
bool BreakCriticalEdges::runOnFunction(Function &F) {
bool Changed = false;
for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I) {
TerminatorInst *TI = I->getTerminator();
if (TI->getNumSuccessors() > 1)
for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
if (SplitCriticalEdge(TI, i, this)) {
++NumBroken;
Changed = true;
}
}
return Changed;
}
//===----------------------------------------------------------------------===//
// Implementation of the external critical edge manipulation functions
//===----------------------------------------------------------------------===//
// isCriticalEdge - Return true if the specified edge is a critical edge.
// Critical edges are edges from a block with multiple successors to a block
// with multiple predecessors.
//
bool llvm::isCriticalEdge(const TerminatorInst *TI, unsigned SuccNum,
bool AllowIdenticalEdges) {
assert(SuccNum < TI->getNumSuccessors() && "Illegal edge specification!");
if (TI->getNumSuccessors() == 1) return false;
const BasicBlock *Dest = TI->getSuccessor(SuccNum);
pred_const_iterator I = pred_begin(Dest), E = pred_end(Dest);
// If there is more than one predecessor, this is a critical edge...
assert(I != E && "No preds, but we have an edge to the block?");
const BasicBlock *FirstPred = *I;
++I; // Skip one edge due to the incoming arc from TI.
if (!AllowIdenticalEdges)
return I != E;
// If AllowIdenticalEdges is true, then we allow this edge to be considered
// non-critical iff all preds come from TI's block.
while (I != E) {
if (*I != FirstPred)
return true;
// Note: leave this as is until no one ever compiles with either gcc 4.0.1
// or Xcode 2. This seems to work around the pred_iterator assert in PR 2207
E = pred_end(*I);
++I;
}
return false;
}
// SplitCriticalEdge - If this edge is a critical edge, insert a new node to
// split the critical edge. This will update DominatorTree, and DominatorFrontier
// information if it is available, thus calling this pass will not invalidate
// any of them. This returns true if the edge was split, false otherwise.
// This ensures that all edges to that dest go to one block instead of each
// going to a different block.
//
bool llvm::SplitCriticalEdge(TerminatorInst *TI, unsigned SuccNum, Pass *P,
bool MergeIdenticalEdges) {
if (!isCriticalEdge(TI, SuccNum, MergeIdenticalEdges)) return false;
BasicBlock *TIBB = TI->getParent();
BasicBlock *DestBB = TI->getSuccessor(SuccNum);
// Create a new basic block, linking it into the CFG.
BasicBlock *NewBB = BasicBlock::Create(TIBB->getName() + "." +
DestBB->getName() + "_crit_edge");
// Create our unconditional branch...
BranchInst::Create(DestBB, NewBB);
// Branch to the new block, breaking the edge.
TI->setSuccessor(SuccNum, NewBB);
// Insert the block into the function... right after the block TI lives in.
Function &F = *TIBB->getParent();
Function::iterator FBBI = TIBB;
F.getBasicBlockList().insert(++FBBI, NewBB);
// If there are any PHI nodes in DestBB, we need to update them so that they
// merge incoming values from NewBB instead of from TIBB.
//
for (BasicBlock::iterator I = DestBB->begin(); isa<PHINode>(I); ++I) {
PHINode *PN = cast<PHINode>(I);
// We no longer enter through TIBB, now we come in through NewBB. Revector
// exactly one entry in the PHI node that used to come from TIBB to come
// from NewBB.
int BBIdx = PN->getBasicBlockIndex(TIBB);
PN->setIncomingBlock(BBIdx, NewBB);
}
// If there are any other edges from TIBB to DestBB, update those to go
// through the split block, making those edges non-critical as well (and
// reducing the number of phi entries in the DestBB if relevant).
if (MergeIdenticalEdges) {
for (unsigned i = SuccNum+1, e = TI->getNumSuccessors(); i != e; ++i) {
if (TI->getSuccessor(i) != DestBB) continue;
// Remove an entry for TIBB from DestBB phi nodes.
DestBB->removePredecessor(TIBB);
// We found another edge to DestBB, go to NewBB instead.
TI->setSuccessor(i, NewBB);
}
}
// If we don't have a pass object, we can't update anything...
if (P == 0) return true;
// Now update analysis information. Since the only predecessor of NewBB is
// the TIBB, TIBB clearly dominates NewBB. TIBB usually doesn't dominate
// anything, as there are other successors of DestBB. However, if all other
// predecessors of DestBB are already dominated by DestBB (e.g. DestBB is a
// loop header) then NewBB dominates DestBB.
SmallVector<BasicBlock*, 8> OtherPreds;
for (pred_iterator I = pred_begin(DestBB), E = pred_end(DestBB); I != E; ++I)
if (*I != NewBB)
OtherPreds.push_back(*I);
bool NewBBDominatesDestBB = true;
// Should we update DominatorTree information?
if (DominatorTree *DT = P->getAnalysisToUpdate<DominatorTree>()) {
DomTreeNode *TINode = DT->getNode(TIBB);
// The new block is not the immediate dominator for any other nodes, but
// TINode is the immediate dominator for the new node.
//
if (TINode) { // Don't break unreachable code!
DomTreeNode *NewBBNode = DT->addNewBlock(NewBB, TIBB);
DomTreeNode *DestBBNode = 0;
// If NewBBDominatesDestBB hasn't been computed yet, do so with DT.
if (!OtherPreds.empty()) {
DestBBNode = DT->getNode(DestBB);
while (!OtherPreds.empty() && NewBBDominatesDestBB) {
if (DomTreeNode *OPNode = DT->getNode(OtherPreds.back()))
NewBBDominatesDestBB = DT->dominates(DestBBNode, OPNode);
OtherPreds.pop_back();
}
OtherPreds.clear();
}
// If NewBBDominatesDestBB, then NewBB dominates DestBB, otherwise it
// doesn't dominate anything.
if (NewBBDominatesDestBB) {
if (!DestBBNode) DestBBNode = DT->getNode(DestBB);
DT->changeImmediateDominator(DestBBNode, NewBBNode);
}
}
}
// Should we update DominanceFrontier information?
if (DominanceFrontier *DF = P->getAnalysisToUpdate<DominanceFrontier>()) {
// If NewBBDominatesDestBB hasn't been computed yet, do so with DF.
if (!OtherPreds.empty()) {
// FIXME: IMPLEMENT THIS!
assert(0 && "Requiring domfrontiers but not idom/domtree/domset."
" not implemented yet!");
}
// Since the new block is dominated by its only predecessor TIBB,
// it cannot be in any block's dominance frontier. If NewBB dominates
// DestBB, its dominance frontier is the same as DestBB's, otherwise it is
// just {DestBB}.
DominanceFrontier::DomSetType NewDFSet;
if (NewBBDominatesDestBB) {
DominanceFrontier::iterator I = DF->find(DestBB);
if (I != DF->end()) {
DF->addBasicBlock(NewBB, I->second);
// However NewBB's frontier does not include DestBB.
DominanceFrontier::iterator NF = DF->find(NewBB);
DF->removeFromFrontier(NF, DestBB);
}
else
DF->addBasicBlock(NewBB, DominanceFrontier::DomSetType());
} else {
DominanceFrontier::DomSetType NewDFSet;
NewDFSet.insert(DestBB);
DF->addBasicBlock(NewBB, NewDFSet);
}
}
// Update LoopInfo if it is around.
if (LoopInfo *LI = P->getAnalysisToUpdate<LoopInfo>()) {
// If one or the other blocks were not in a loop, the new block is not
// either, and thus LI doesn't need to be updated.
if (Loop *TIL = LI->getLoopFor(TIBB))
if (Loop *DestLoop = LI->getLoopFor(DestBB)) {
if (TIL == DestLoop) {
// Both in the same loop, the NewBB joins loop.
DestLoop->addBasicBlockToLoop(NewBB, LI->getBase());
} else if (TIL->contains(DestLoop->getHeader())) {
// Edge from an outer loop to an inner loop. Add to the outer loop.
TIL->addBasicBlockToLoop(NewBB, LI->getBase());
} else if (DestLoop->contains(TIL->getHeader())) {
// Edge from an inner loop to an outer loop. Add to the outer loop.
DestLoop->addBasicBlockToLoop(NewBB, LI->getBase());
} else {
// Edge from two loops with no containment relation. Because these
// are natural loops, we know that the destination block must be the
// header of its loop (adding a branch into a loop elsewhere would
// create an irreducible loop).
assert(DestLoop->getHeader() == DestBB &&
"Should not create irreducible loops!");
if (Loop *P = DestLoop->getParentLoop())
P->addBasicBlockToLoop(NewBB, LI->getBase());
}
}
}
return true;
}
|
Remove unused variable
|
Remove unused variable
git-svn-id: 0ff597fd157e6f4fc38580e8d64ab130330d2411@49838 91177308-0d34-0410-b5e6-96231b3b80d8
|
C++
|
apache-2.0
|
llvm-mirror/llvm,chubbymaggie/asap,dslab-epfl/asap,dslab-epfl/asap,GPUOpen-Drivers/llvm,dslab-epfl/asap,chubbymaggie/asap,dslab-epfl/asap,GPUOpen-Drivers/llvm,dslab-epfl/asap,llvm-mirror/llvm,GPUOpen-Drivers/llvm,chubbymaggie/asap,apple/swift-llvm,GPUOpen-Drivers/llvm,GPUOpen-Drivers/llvm,llvm-mirror/llvm,llvm-mirror/llvm,apple/swift-llvm,llvm-mirror/llvm,llvm-mirror/llvm,apple/swift-llvm,chubbymaggie/asap,llvm-mirror/llvm,llvm-mirror/llvm,apple/swift-llvm,dslab-epfl/asap,chubbymaggie/asap,apple/swift-llvm,GPUOpen-Drivers/llvm,apple/swift-llvm,chubbymaggie/asap,apple/swift-llvm,dslab-epfl/asap,llvm-mirror/llvm,GPUOpen-Drivers/llvm,GPUOpen-Drivers/llvm,apple/swift-llvm
|
5c3464e155d1b81b396b5a5ab69e36a3d26d11dd
|
tdbread/source/tdbread.cpp
|
tdbread/source/tdbread.cpp
|
#include "libtdb/include/database.hpp"
#include "libtdb/include/conditions.hpp"
#include "libgibbs/include/equilibrium.hpp"
#include <iostream>
int main(int argc, char* argv[])
{
if (argc < 2)
{
std::cout << "Usage: tdbread path\n";
return 1;
}
evalconditions mainconditions;
mainconditions.statevars['T'] = 1500;
mainconditions.statevars['P'] = 101325;
mainconditions.statevars['N'] = 1;
mainconditions.xfrac["NI"] = 0.7;
mainconditions.xfrac["AL"] = 0.2;
mainconditions.xfrac["CR"] = 0.05;
mainconditions.xfrac["CO"] = 0.05;
//mainconditions.xfrac["VA"] = 0;
mainconditions.elements.push_back("NI");
mainconditions.elements.push_back("AL");
mainconditions.elements.push_back("CR");
mainconditions.elements.push_back("CO");
mainconditions.elements.push_back("VA");
mainconditions.phases["FCC_A1"] = true;
mainconditions.phases["LIQUID"] = true;
// init the database by reading from the .TDB specified on the command line
Database maindb(argv[1]);
std::cout << maindb.get_info() << std::endl; // read out database infostring
// calculate the minimum Gibbs energy by constructing an equilibrium
Equilibrium myeq(maindb,mainconditions);
// print the resulting equilibrium
std::cout << std::endl << myeq << std::endl;
return 0;
// to test, enumerate all phases in database
/*
for (auto i = maindb.get_phase_iterator(); i != maindb.get_phase_iterator_end(); ++i) {
Phase curphase = (*i).second;
std::cout << curphase.name() << std::endl;
Sublattice_Collection subls = curphase.sublattices();
for (auto j = subls.begin(); j != subls.end(); ++j) {
std::cout << "\tSublattice " << std::distance(subls.begin(),j)+1 << " coefficient: " << (*j).stoi_coef << std::endl;
std::cout << "\tSublattice species: ";
for (auto k = (*j).constituents.begin(); k != (*j).constituents.end(); ++k) {
const std::string spec_name = (*k);
std::cout << (*k);
if (std::distance(k,(*j).constituents.end()) > 1) { // not yet at the last element
std::cout << ", ";
}
}
std::cout << std::endl;
}
}*/
/*
// to test, enumerate all species in database
Species_Collection testspec = maindb.get_all_species();
for (Species_Collection::const_iterator i = testspec.begin(); i != testspec.end(); ++i) {
Species curspec = (*i).second;
std::cout << "Species name: " << curspec.name() << std::endl;
chemical_formula form = curspec.get_formula();
for (chemical_formula::const_iterator j = form.begin(); j != form.end(); ++j) {
Element cur_ele = maindb.get_element((*j).first);
std::cout << "\t" << cur_ele.get_name() << ": " << (*j).second << std::endl;
}
}*/
// do nothing else for now
return 0;
}
|
#include "libtdb/include/database.hpp"
#include "libtdb/include/conditions.hpp"
#include "libgibbs/include/equilibrium.hpp"
#include <iostream>
int main(int argc, char* argv[])
{
if (argc < 2)
{
std::cout << "Usage: tdbread path\n";
return 1;
}
evalconditions mainconditions;
mainconditions.statevars['T'] = 1500;
mainconditions.statevars['P'] = 101325;
mainconditions.statevars['N'] = 1;
mainconditions.xfrac["NI"] = 0.7;
mainconditions.xfrac["AL"] = 0.2;
mainconditions.xfrac["CR"] = 0.05;
mainconditions.xfrac["CO"] = 0.05;
mainconditions.elements.push_back("NI");
mainconditions.elements.push_back("AL");
mainconditions.elements.push_back("CR");
mainconditions.elements.push_back("CO");
mainconditions.elements.push_back("VA");
mainconditions.phases["FCC_A1"] = true;
mainconditions.phases["LIQUID"] = true;
// init the database by reading from the .TDB specified on the command line
Database maindb(argv[1]);
std::cout << maindb.get_info() << std::endl; // read out database infostring
// calculate the minimum Gibbs energy by constructing an equilibrium
Equilibrium myeq(maindb,mainconditions);
// print the resulting equilibrium
std::cout << std::endl << myeq << std::endl;
return 0;
// to test, enumerate all phases in database
/*
for (auto i = maindb.get_phase_iterator(); i != maindb.get_phase_iterator_end(); ++i) {
Phase curphase = (*i).second;
std::cout << curphase.name() << std::endl;
Sublattice_Collection subls = curphase.sublattices();
for (auto j = subls.begin(); j != subls.end(); ++j) {
std::cout << "\tSublattice " << std::distance(subls.begin(),j)+1 << " coefficient: " << (*j).stoi_coef << std::endl;
std::cout << "\tSublattice species: ";
for (auto k = (*j).constituents.begin(); k != (*j).constituents.end(); ++k) {
const std::string spec_name = (*k);
std::cout << (*k);
if (std::distance(k,(*j).constituents.end()) > 1) { // not yet at the last element
std::cout << ", ";
}
}
std::cout << std::endl;
}
}*/
/*
// to test, enumerate all species in database
Species_Collection testspec = maindb.get_all_species();
for (Species_Collection::const_iterator i = testspec.begin(); i != testspec.end(); ++i) {
Species curspec = (*i).second;
std::cout << "Species name: " << curspec.name() << std::endl;
chemical_formula form = curspec.get_formula();
for (chemical_formula::const_iterator j = form.begin(); j != form.end(); ++j) {
Element cur_ele = maindb.get_element((*j).first);
std::cout << "\t" << cur_ele.get_name() << ": " << (*j).second << std::endl;
}
}*/
// do nothing else for now
return 0;
}
|
Remove extraneous commented code
|
Remove extraneous commented code
|
C++
|
mit
|
tkphd/pycalphad,tkphd/pycalphad,tkphd/pycalphad
|
37ba985dab7bb9b64719561f5c1bae40ffbb4968
|
test/linearelliptic-swipdg.hh
|
test/linearelliptic-swipdg.hh
|
// This file is part of the dune-hdd project:
// http://users.dune-project.org/projects/dune-hdd
// Copyright holders: Felix Schindler
// License: BSD 2-Clause License (http://opensource.org/licenses/BSD-2-Clause)
#ifndef DUNE_HDD_TEST_LINEARELLIPTIC_SWIPDG_HH
#define DUNE_HDD_TEST_LINEARELLIPTIC_SWIPDG_HH
#if HAVE_ALUGRID
# include <dune/grid/alugrid.hh>
#endif
#include <dune/stuff/common/exceptions.hh>
#include <dune/gdt/products/l2.hh>
#include <dune/gdt/products/h1.hh>
#include <dune/gdt/playground/products/elliptic.hh>
#include <dune/hdd/linearelliptic/discretizations/swipdg.hh>
#include <dune/hdd/playground/linearelliptic/testcases/ESV2007.hh>
#include <dune/hdd/playground/linearelliptic/testcases/OS2014.hh>
#include "linearelliptic.hh"
namespace Dune {
namespace HDD {
namespace LinearElliptic {
namespace Tests {
namespace internal {
template< class TestCaseType, int polOrder, GDT::ChooseSpaceBackend space_backend, Stuff::LA::ChooseBackend la_backend >
class DiscretizationSWIPDG
{
typedef typename TestCaseType::GridType GridType;
typedef typename TestCaseType::RangeFieldType RangeFieldType;
static const unsigned int dimRange = TestCaseType::dimRange;
public:
typedef Discretizations::SWIPDG
< GridType, Stuff::Grid::ChooseLayer::level, RangeFieldType, dimRange, polOrder, space_backend, la_backend > Type;
}; // class DiscretizationSWIPDG
} // namespace internal
template< class TestCaseType, int polOrder, GDT::ChooseSpaceBackend space_backend, Stuff::LA::ChooseBackend la_backend >
class EocStudySWIPDG
: public EocStudyBase< TestCaseType,
typename internal::DiscretizationSWIPDG< TestCaseType,
polOrder,
space_backend,
la_backend >::Type >
{
typedef EocStudyBase< TestCaseType,
typename internal::DiscretizationSWIPDG< TestCaseType,
polOrder,
space_backend,
la_backend >::Type > BaseType;
typedef EocStudySWIPDG< TestCaseType, polOrder, space_backend, la_backend > ThisType;
typedef typename BaseType::DiscretizationType DiscretizationType;
typedef typename BaseType::GridViewType GridViewType;
typedef typename BaseType::FunctionType FunctionType;
typedef typename BaseType::VectorType VectorType;
public:
EocStudySWIPDG(const TestCaseType& test_case, const std::vector< std::string > only_these_norms = {})
: BaseType(test_case, only_these_norms)
{}
virtual ~EocStudySWIPDG() {}
virtual std::string identifier() const DS_OVERRIDE DS_FINAL
{
return DiscretizationType::static_id() + " (polorder " + Stuff::Common::toString(polOrder) + ")";
}
virtual size_t expected_rate(const std::string type) const DS_OVERRIDE DS_FINAL
{
if (type == "L2")
return polOrder + 1;
else if (type == "H1_semi")
return polOrder;
else if (type == "energy")
return polOrder;
else if (type == "eta_NC")
return polOrder;
else if (type == "eta_R")
return polOrder + 1;
else if (type == "eta_DF")
return polOrder;
else if (type == "eta")
return polOrder;
else if (type == "efficiency")
return 0;
else
DUNE_THROW(Stuff::Exceptions::wrong_input_given, "Wrong type '" << type << "' requested!");
} // ... expected_rate(...)
virtual std::vector< double > expected_results(const std::string type) const DS_OVERRIDE DS_FINAL
{
#if HAVE_ALUGRID
if (std::is_same< TestCaseType, TestCases::ESV2007< ALUConformGrid< 2, 2 > > >::value
|| std::is_same< TestCaseType, TestCases::ESV2007< ALUGrid< 2, 2, simplex, conforming > > >::value) {
if (polOrder == 1) {
if (type == "L2")
return {1.84e-02, 4.54e-03, 1.13e-03, 2.79e-04};
else if (type == "H1_semi")
return {3.29e-01, 1.63e-01, 8.05e-02, 4.02e-02};
else if (type == "energy")
return {3.29e-01, 1.63e-01, 8.05e-02, 4.02e-02};
else if (type == "eta_NC")
return {1.90e-1, 9.73e-2, 4.90e-2, 2.46e-2};
else if (type == "eta_R")
return {7.24e-2, 1.83e-2, 4.55e-3, 1.15e-3};
else if (type == "eta_DF") {
// these are the values reported in the paper
// return {3.39e-1, 1.70e-1, 8.40e-2, 4.19e-2};
// but we do not want the test to fail each time, so we report these
return {3.56e-1, 1.77e-1, 8.74e-2, 4.36e-2};
} else if (type == "eta")
return {4.50e-01, 2.08e-01, 9.92e-02, 4.86e-02};
else if (type == "efficiency")
return {1.21, 1.21, 1.21, 1.21};
else
DUNE_THROW(Stuff::Exceptions::wrong_input_given, "Wrong type '" << type << "' requested!");
} else
DUNE_THROW(NotImplemented, "Please record the expected results for this polOrder!");
} else if (std::is_same< TestCaseType, TestCases::OS2014< ALUConformGrid< 2, 2 > > >::value
|| std::is_same< TestCaseType, TestCases::OS2014< ALUGrid< 2, 2, simplex, conforming > > >::value) {
if (polOrder == 1) {
if (type == "energy")
return {4.75e-01, 2.63e-01, 1.28e-01, 5.62e-02};
else if (type == "eta_NC")
return {2.39e-01, 1.43e-01, 6.83e-02, 3.14e-02};
else if (type == "eta_R")
return {8.19e-02, 1.99e-02, 4.84e-03, 1.20e-03};
else if (type == "eta_DF") {
return {6.35e-01, 3.62e-01, 1.88e-01, 9.18e-02};
} else if (type == "eta")
return {7.51e-01, 4.06e-01, 2.01e-01, 9.80e-02};
else
DUNE_THROW(Stuff::Exceptions::wrong_input_given, "Wrong type '" << type << "' requested!");
} else
DUNE_THROW(NotImplemented, "Please record the expected results for this polOrder!");
} else
#endif // HAVE_ALUGRID
DUNE_THROW(NotImplemented, "Please record the expected results for this TestCaseType/GridType combination!");
} // ... expected_results(...)
private:
virtual std::vector< std::string > available_norms_() const DS_OVERRIDE DS_FINAL
{
return {
"L2"
, "H1_semi"
, "energy"
};
}
virtual double compute_norm_(const GridViewType& grid_view,
const FunctionType& function,
const std::string type) const DS_OVERRIDE DS_FINAL
{
using namespace GDT;
typedef typename TestCaseType::ProblemType::DiffusionFactorType::NonparametricType DiffusionFactorType;
typedef typename TestCaseType::ProblemType::DiffusionTensorType::NonparametricType DiffusionTensorType;
if (type == "L2") {
return Products::L2< GridViewType >(grid_view).induced_norm(function);
} else if (type == "H1_semi") {
return Products::H1SemiGeneric< GridViewType >(grid_view).induced_norm(function);
} else if (type == "energy") {
const auto& diffusion_factor = *(this->test_case_.problem().diffusion_factor());
assert(!diffusion_factor.parametric());
assert(diffusion_factor.has_affine_part());
const auto& diffusion_tensor = *(this->test_case_.problem().diffusion_tensor());
assert(!diffusion_tensor.parametric());
assert(diffusion_tensor.has_affine_part());
Products::Elliptic< DiffusionFactorType, GridViewType, double, DiffusionTensorType >
elliptic_product(*diffusion_factor.affine_part(), *diffusion_tensor.affine_part(), grid_view);
return elliptic_product.induced_norm(function);
} else
DUNE_THROW(Stuff::Exceptions::wrong_input_given, "Wrong type '" << type << "' requested!");
} // ... compute_norm_(...)
virtual std::vector< std::string > available_estimators_() const DS_OVERRIDE DS_FINAL
{
return DiscretizationType::available_estimators();
}
virtual double estimate_(const VectorType& vector, const std::string type) const DS_OVERRIDE DS_FINAL
{
assert(this->current_discretization_);
return this->current_discretization_->estimate(vector, type);
}
}; // class EocStudySWIPDG
} // namespace Tests
} // namespace LinearElliptic
} // namespace HDD
} // namespace Dune
#endif // DUNE_HDD_TEST_LINEARELLIPTIC_SWIPDG_HH
|
// This file is part of the dune-hdd project:
// http://users.dune-project.org/projects/dune-hdd
// Copyright holders: Felix Schindler
// License: BSD 2-Clause License (http://opensource.org/licenses/BSD-2-Clause)
#ifndef DUNE_HDD_TEST_LINEARELLIPTIC_SWIPDG_HH
#define DUNE_HDD_TEST_LINEARELLIPTIC_SWIPDG_HH
#if HAVE_ALUGRID
# include <dune/grid/alugrid.hh>
#endif
#include <dune/stuff/common/exceptions.hh>
#include <dune/gdt/products/l2.hh>
#include <dune/gdt/products/h1.hh>
#include <dune/gdt/playground/products/elliptic.hh>
#include <dune/hdd/linearelliptic/discretizations/swipdg.hh>
#include <dune/hdd/playground/linearelliptic/testcases/ESV2007.hh>
#include <dune/hdd/playground/linearelliptic/testcases/OS2014.hh>
#include "linearelliptic.hh"
namespace Dune {
namespace HDD {
namespace LinearElliptic {
namespace Tests {
namespace internal {
template< class TestCaseType, int polOrder, GDT::ChooseSpaceBackend space_backend, Stuff::LA::ChooseBackend la_backend >
class DiscretizationSWIPDG
{
typedef typename TestCaseType::GridType GridType;
typedef typename TestCaseType::RangeFieldType RangeFieldType;
static const unsigned int dimRange = TestCaseType::dimRange;
public:
typedef Discretizations::SWIPDG
< GridType, Stuff::Grid::ChooseLayer::level, RangeFieldType, dimRange, polOrder, space_backend, la_backend > Type;
}; // class DiscretizationSWIPDG
} // namespace internal
template< class TestCaseType, int polOrder, GDT::ChooseSpaceBackend space_backend, Stuff::LA::ChooseBackend la_backend >
class EocStudySWIPDG
: public EocStudyBase< TestCaseType,
typename internal::DiscretizationSWIPDG< TestCaseType,
polOrder,
space_backend,
la_backend >::Type >
{
typedef EocStudyBase< TestCaseType,
typename internal::DiscretizationSWIPDG< TestCaseType,
polOrder,
space_backend,
la_backend >::Type > BaseType;
typedef EocStudySWIPDG< TestCaseType, polOrder, space_backend, la_backend > ThisType;
typedef typename BaseType::DiscretizationType DiscretizationType;
typedef typename BaseType::GridViewType GridViewType;
typedef typename BaseType::FunctionType FunctionType;
typedef typename BaseType::VectorType VectorType;
public:
EocStudySWIPDG(const TestCaseType& test_case, const std::vector< std::string > only_these_norms = {})
: BaseType(test_case, only_these_norms)
{}
virtual ~EocStudySWIPDG() {}
virtual std::string identifier() const DS_OVERRIDE DS_FINAL
{
return DiscretizationType::static_id() + " (polorder " + Stuff::Common::toString(polOrder) + ")";
}
virtual size_t expected_rate(const std::string type) const DS_OVERRIDE DS_FINAL
{
if (type == "L2")
return polOrder + 1;
else if (type == "H1_semi")
return polOrder;
else if (type == "energy")
return polOrder;
else if (type == "eta_NC_ESV2007")
return polOrder;
else if (type == "eta_R_ESV2007")
return polOrder + 1;
else if (type == "eta_DF_ESV2007")
return polOrder;
else if (type == "eta_ESV2007")
return polOrder;
else if (type == "effectivity_ESV2007")
return 0;
else
DUNE_THROW(Stuff::Exceptions::wrong_input_given, "Wrong type '" << type << "' requested!");
} // ... expected_rate(...)
virtual std::vector< double > expected_results(const std::string type) const DS_OVERRIDE DS_FINAL
{
#if HAVE_ALUGRID
if (std::is_same< TestCaseType, TestCases::ESV2007< ALUConformGrid< 2, 2 > > >::value
|| std::is_same< TestCaseType, TestCases::ESV2007< ALUGrid< 2, 2, simplex, conforming > > >::value) {
if (polOrder == 1) {
if (type == "L2")
return {1.84e-02, 4.54e-03, 1.13e-03, 2.79e-04};
else if (type == "H1_semi")
return {3.29e-01, 1.63e-01, 8.05e-02, 4.02e-02};
else if (type == "energy")
return {3.29e-01, 1.63e-01, 8.05e-02, 4.02e-02};
else if (type == "eta_NC_ESV2007")
return {1.90e-1, 9.73e-2, 4.90e-2, 2.46e-2};
else if (type == "eta_R_ESV2007")
return {7.24e-2, 1.83e-2, 4.55e-3, 1.15e-3};
else if (type == "eta_DF_ESV2007") {
// these are the values reported in the ESV2007 preprint:
// return {3.39e-1, 1.70e-1, 8.40e-2, 4.19e-2};
// but we do not want the test to fail each time, so we expect these:
return {3.56e-1, 1.77e-1, 8.74e-2, 4.36e-2};
} else if (type == "eta_ESV2007")
return {4.50e-01, 2.08e-01, 9.92e-02, 4.86e-02};
else if (type == "effectivity_ESV2007") {
// these are the values reported in the ESV2007 preprint:
// return {1.21, 1.21, 1.21, 1.21};
// but we do not want the test to fail each time, so we expect these:
return {1.38, 1.29, 1.24, 1.22};
} else
DUNE_THROW(Stuff::Exceptions::wrong_input_given, "Wrong type '" << type << "' requested!");
} else
DUNE_THROW(NotImplemented, "Please record the expected results for this polOrder!");
} else if (std::is_same< TestCaseType, TestCases::OS2014< ALUConformGrid< 2, 2 > > >::value
|| std::is_same< TestCaseType, TestCases::OS2014< ALUGrid< 2, 2, simplex, conforming > > >::value) {
if (polOrder == 1) {
if (type == "energy")
return {4.75e-01, 2.63e-01, 1.28e-01, 5.62e-02};
else if (type == "eta_NC")
return {2.39e-01, 1.43e-01, 6.83e-02, 3.14e-02};
else if (type == "eta_R")
return {8.19e-02, 1.99e-02, 4.84e-03, 1.20e-03};
else if (type == "eta_DF") {
return {6.35e-01, 3.62e-01, 1.88e-01, 9.18e-02};
} else if (type == "eta")
return {7.51e-01, 4.06e-01, 2.01e-01, 9.80e-02};
else
DUNE_THROW(Stuff::Exceptions::wrong_input_given, "Wrong type '" << type << "' requested!");
} else
DUNE_THROW(NotImplemented, "Please record the expected results for this polOrder!");
} else
#endif // HAVE_ALUGRID
DUNE_THROW(NotImplemented, "Please record the expected results for this TestCaseType/GridType combination!");
} // ... expected_results(...)
private:
virtual std::vector< std::string > available_norms_() const DS_OVERRIDE DS_FINAL
{
return {
"L2"
, "H1_semi"
, "energy"
};
} // ... available_norms_(...)
virtual double compute_norm_(const GridViewType& grid_view,
const FunctionType& function,
const std::string type) const DS_OVERRIDE DS_FINAL
{
using namespace GDT;
typedef typename TestCaseType::ProblemType::DiffusionFactorType::NonparametricType DiffusionFactorType;
typedef typename TestCaseType::ProblemType::DiffusionTensorType::NonparametricType DiffusionTensorType;
if (type == "L2") {
return Products::L2< GridViewType >(grid_view).induced_norm(function);
} else if (type == "H1_semi") {
return Products::H1SemiGeneric< GridViewType >(grid_view).induced_norm(function);
} else if (type == "energy") {
const auto& diffusion_factor = *(this->test_case_.problem().diffusion_factor());
assert(!diffusion_factor.parametric());
assert(diffusion_factor.has_affine_part());
const auto& diffusion_tensor = *(this->test_case_.problem().diffusion_tensor());
assert(!diffusion_tensor.parametric());
assert(diffusion_tensor.has_affine_part());
Products::Elliptic< DiffusionFactorType, GridViewType, double, DiffusionTensorType >
elliptic_product(*diffusion_factor.affine_part(), *diffusion_tensor.affine_part(), grid_view);
return elliptic_product.induced_norm(function);
} else
DUNE_THROW(Stuff::Exceptions::wrong_input_given, "Wrong type '" << type << "' requested!");
} // ... compute_norm_(...)
virtual std::vector< std::string > available_estimators_() const DS_OVERRIDE DS_FINAL
{
auto ret = DiscretizationType::available_estimators();
ret.push_back("effectivity_ESV2007");
return ret;
}
virtual double estimate_(const VectorType& vector, const std::string type) const DS_OVERRIDE DS_FINAL
{
if (type == "effectivity_ESV2007") {
return estimate_(vector, "eta_ESV2007") / const_cast< ThisType& >(*this).current_error_norm("energy");
}
else {
assert(this->current_discretization_);
return this->current_discretization_->estimate(vector, type);
}
} // ... estimate_(...)
}; // class EocStudySWIPDG
} // namespace Tests
} // namespace LinearElliptic
} // namespace HDD
} // namespace Dune
#endif // DUNE_HDD_TEST_LINEARELLIPTIC_SWIPDG_HH
|
update ids, expected results, ...
|
[test.linearelliptic-swipdg] update ids, expected results, ...
|
C++
|
bsd-2-clause
|
tobiasleibner/dune-hdd,pymor/dune-hdd,tobiasleibner/dune-hdd,pymor/dune-hdd
|
edfa7f9c01573a38cf9dad8c0a5fcecfbd1429a6
|
libpfkutil/childprocessmanager.cc
|
libpfkutil/childprocessmanager.cc
|
#if 0
set -e -x
g++ -g3 -DCHILDPROCESSMANAGERTESTMAIN childprocessmanager.cc LockWait.cc -o cpm -lpthread
exit 0
#endif
/* -*- Mode:c++; eval:(c-set-style "BSD"); c-basic-offset:4; indent-tabs-mode:nil; tab-width:8 -*- */
#include "childprocessmanager.h"
#include "bufprintf.h"
#include <stdlib.h>
#include <unistd.h>
#include <signal.h>
#include <fcntl.h>
#include <errno.h>
#include <string.h>
#include <sys/wait.h>
#include <pthread.h>
#include <iostream>
using namespace std;
namespace ChildProcessManager {
/************************ Handle ******************************/
Handle :: Handle(void)
{
pipe(fromChildPipe);
pipe(toChildPipe);
open = false;
fds[0] = fromChildPipe[0];
fds[1] = toChildPipe[1];
pid = -1;
inManager = false;
}
Handle :: ~Handle(void)
{
if (inManager)
cerr << "ChildProcessManager::~Handle: still in Manager's map! "
<< "did you delete Handle before child had exited?"
<< endl;
open = false;
#define CLOSEFD(fd) if (fd != -1) { close(fd); fd = -1; }
CLOSEFD(fromChildPipe[0]);
CLOSEFD(fromChildPipe[1]);
CLOSEFD(toChildPipe[0]);
CLOSEFD(toChildPipe[1]);
}
bool
Handle :: createChild(void)
{
return Manager::instance()->createChild(this);
}
/************************ Manager ******************************/
Manager * Manager::_instance = NULL;
Manager * Manager::instance(void)
{
if (_instance == NULL)
_instance = new Manager();
return _instance;
}
void
Manager :: cleanup(void)
{
if (_instance != NULL)
{
delete _instance;
_instance = NULL;
}
}
Manager :: Manager(void)
{
struct sigaction sa;
sa.sa_handler = &Manager::sigChildHandler;
sigfillset(&sa.sa_mask);
sa.sa_flags = SA_NOCLDSTOP | SA_RESTART;
sigaction(SIGCHLD, &sa, &sigChildOact);
pipe(signalFds);
pipe(rebuildFds);
pthread_attr_t attr;
pthread_attr_init(&attr);
pthread_create(¬ifyThreadId, &attr,
&Manager::notifyThread, (void*) this);
pthread_attr_destroy(&attr);
}
Manager :: ~Manager(void)
{
char dummy = 2; // code 2 means die
write(rebuildFds[1], &dummy, 1);
sigaction(SIGCHLD, &sigChildOact, NULL);
void *threadRet = NULL;
pthread_join(notifyThreadId, &threadRet);
close(signalFds[0]);
close(signalFds[1]);
close(rebuildFds[0]);
close(rebuildFds[1]);
}
bool
Manager :: createChild(Handle *handle)
{
int forkErrorPipe[2];
pipe(forkErrorPipe);
sigset_t oldset, newset;
sigfillset(&newset);
pthread_sigmask(SIG_SETMASK, &newset, &oldset);
// google "vfork considered dangerous". the article on
// EWONTFIX is particularly informative.
handle->pid = fork();
if (handle->pid < 0)
{
int e = errno;
cerr << "fork: " << e << ": " << strerror(errno) << endl;
sigprocmask(SIG_SETMASK, &oldset, NULL);
return false;
}
if (handle->pid == 0)
{
// child
// move pipe ends we do use to the
// fd numbers where they're used by
// the child.
dup2(handle->toChildPipe[0], 0);
dup2(handle->fromChildPipe[1], 1);
dup2(handle->fromChildPipe[1], 2);
// don't allow the child to inhert any
// "interesting" file descriptors. note this
// also closes all the pipe ends we don't use in the child.
for (int i = 3; i < sysconf(_SC_OPEN_MAX); i++)
if (i != forkErrorPipe[1])
close(i);
// mark the 'fork error' pipe as close-on-exec,
// so if the exec succeeds, the parent gets a zero
// read, but if it fails, it gets a 1-read.
fcntl(forkErrorPipe[1], F_SETFD, FD_CLOEXEC);
execvp(handle->cmd[0], (char *const*)handle->cmd.data());
// dont print stuff! fork is weird, don't trust anything
// to work.
// send the errno to parent.
int e = errno;
write(forkErrorPipe[1], &e, sizeof(int));
// call _exit because we dont want to call any atexit handlers.
_exit(99);
}
//parent
// close pipe ends we don't use.
CLOSEFD(handle->fromChildPipe[1]);
CLOSEFD(handle->toChildPipe[0]);
close(forkErrorPipe[1]);
bool ret = false;
int e;
int cc = read(forkErrorPipe[0], &e, sizeof(e));
close(forkErrorPipe[0]);
pthread_sigmask(SIG_SETMASK, &oldset, NULL);
if (cc == 0)
{
// zero read means the pipe was closed-on-exec,
// so child success.
handle->open = true;
{
WaitUtil::Lock key(&handleLock);
openHandles[handle->pid] = handle;
handle->inManager = true;
} // key destroyed here
// wake up notify thread so it knows to
// rebuild its fd_sets to include the
// new handle.
char dummy = 1; // code 1 means rebuild
(void) write(rebuildFds[1], &dummy, 1);
ret = true;
}
else
{
// nonzero read means exec failed in the child.
cerr << "execvp " << handle->cmd[0]
<< " failed with error " << e << ": "
<< strerror(e) << endl;
}
return ret;
}
//static
void
Manager :: sigChildHandler(int s)
{
struct signalMsg msg;
do {
msg.pid = waitpid(/*wait for any child*/-1,
&msg.status, WNOHANG);
if (msg.pid > 0)
{
if (0) // debug
{
Bufprintf<80> bufp;
bufp.print("sig handler got pid %d died, status %d\n",
msg.pid, msg.status);
bufp.write(1);
}
if (_instance != NULL)
// dont do any data structure manipulations here;
// it is difficult to mutex between threads and
// signal handlers. (it can be done with sigprocmask but
// that is expensive.) instead send a message to the
// notify thread and let it deal with it in thread
// context.
(void) write(_instance->signalFds[1], &msg, sizeof(msg));
}
} while (msg.pid > 0);
}
//static
void *
Manager :: notifyThread(void *arg)
{
Manager * mgr = (Manager *) arg;
mgr->_notifyThread();
return NULL;
}
void
Manager :: _notifyThread(void)
{
bool done = false;
std::vector<Handle*> handles;
char buffer[4096];
int cc;
fd_set rfds;
int maxfd;
HandleMap::iterator it;
Handle * h;
struct signalMsg msg;
char dummy;
while (!done)
{
FD_ZERO(&rfds);
maxfd = signalFds[0];
FD_SET(signalFds[0], &rfds);
if (maxfd < rebuildFds[0])
maxfd = rebuildFds[0];
FD_SET(rebuildFds[0], &rfds);
{ // add fds for all open handles to the fd_set.
WaitUtil::Lock key(&handleLock);
for (it = openHandles.begin();
it != openHandles.end();
it++)
{
h = it->second;
if (h->open)
{
if (maxfd < h->fds[0])
maxfd = h->fds[0];
FD_SET(h->fds[0], &rfds);
}
}
} // key destroyed here
select(maxfd+1, &rfds, NULL, NULL, NULL);
if (FD_ISSET(rebuildFds[0], &rfds))
{
if (read(rebuildFds[0], &dummy, 1) != 1)
done = true;
else
if (dummy == 2) // die code
// must be the manager destructor
done = true;
if (0) // debug
{
Bufprintf<80> bufp;
bufp.print("thread awakened on rebuild fd, done = %d\n",
done);
bufp.write(1);
}
// otherwise this is just meant to make sure we rebuild
// our fd_sets because the openHandles map has changed.
}
if (!done && FD_ISSET(signalFds[0], &rfds))
{
// the sigchld handler has sent us a pid and status.
cc = read(signalFds[0], &msg, sizeof(msg));
if (cc <= 0)
done = true;
else
{
if (0) // debug
{
Bufprintf<80> bufp;
bufp.print("got msg pid %d died status %d\n",
msg.pid, msg.status);
bufp.write(1);
}
WaitUtil::Lock key(&handleLock);
it = openHandles.find(msg.pid);
if (it != openHandles.end())
{
h = it->second;
h->open = false;
h->inManager = false;
openHandles.erase(it);
h->processExited(msg.status);
}
} // key destroyed here
}
if (!done)
{ // check all open handles
// dont hold the key while calling h->handleOutput.
// build the list of all handles that need servicing
// first, then release the key.
{
WaitUtil::Lock key(&handleLock);
for (it = openHandles.begin();
it != openHandles.end();
it++)
{
h = it->second;
if (FD_ISSET(h->fds[0], &rfds))
handles.push_back(h);
}
} // key destroyed here
for (unsigned int ind = 0; ind < handles.size(); ind++)
{
h = handles[ind];
cc = read(h->fds[0], buffer, sizeof(buffer));
if (cc > 0)
// call user's virtual method to handle the data.
h->handleOutput(buffer, cc);
else
h->open = false;
}
handles.clear();
}
}
}
}; /* namespace ChildProcessManager */
|
#if 0
set -e -x
g++ -g3 -DCHILDPROCESSMANAGERTESTMAIN childprocessmanager.cc LockWait.cc -o cpm -lpthread
exit 0
#endif
/* -*- Mode:c++; eval:(c-set-style "BSD"); c-basic-offset:4; indent-tabs-mode:nil; tab-width:8 -*- */
#include "childprocessmanager.h"
#include "bufprintf.h"
#include "pfkposix.h"
#include <stdlib.h>
#include <unistd.h>
#include <signal.h>
#include <fcntl.h>
#include <errno.h>
#include <string.h>
#include <sys/wait.h>
#include <pthread.h>
#include <iostream>
using namespace std;
namespace ChildProcessManager {
/************************ Handle ******************************/
Handle :: Handle(void)
{
pipe(fromChildPipe);
pipe(toChildPipe);
open = false;
fds[0] = fromChildPipe[0];
fds[1] = toChildPipe[1];
pid = -1;
inManager = false;
}
Handle :: ~Handle(void)
{
if (inManager)
cerr << "ChildProcessManager::~Handle: still in Manager's map! "
<< "did you delete Handle before child had exited?"
<< endl;
open = false;
#define CLOSEFD(fd) if (fd != -1) { close(fd); fd = -1; }
CLOSEFD(fromChildPipe[0]);
CLOSEFD(fromChildPipe[1]);
CLOSEFD(toChildPipe[0]);
CLOSEFD(toChildPipe[1]);
}
bool
Handle :: createChild(void)
{
return Manager::instance()->createChild(this);
}
/************************ Manager ******************************/
Manager * Manager::_instance = NULL;
Manager * Manager::instance(void)
{
if (_instance == NULL)
_instance = new Manager();
return _instance;
}
void
Manager :: cleanup(void)
{
if (_instance != NULL)
{
delete _instance;
_instance = NULL;
}
}
Manager :: Manager(void)
{
struct sigaction sa;
sa.sa_handler = &Manager::sigChildHandler;
sigfillset(&sa.sa_mask);
sa.sa_flags = SA_NOCLDSTOP | SA_RESTART;
sigaction(SIGCHLD, &sa, &sigChildOact);
pipe(signalFds);
pipe(rebuildFds);
pthread_attr_t attr;
pthread_attr_init(&attr);
pthread_create(¬ifyThreadId, &attr,
&Manager::notifyThread, (void*) this);
pthread_attr_destroy(&attr);
}
Manager :: ~Manager(void)
{
char dummy = 2; // code 2 means die
write(rebuildFds[1], &dummy, 1);
sigaction(SIGCHLD, &sigChildOact, NULL);
void *threadRet = NULL;
pthread_join(notifyThreadId, &threadRet);
close(signalFds[0]);
close(signalFds[1]);
close(rebuildFds[0]);
close(rebuildFds[1]);
}
bool
Manager :: createChild(Handle *handle)
{
int forkErrorPipe[2];
pipe(forkErrorPipe);
sigset_t oldset, newset;
sigfillset(&newset);
pthread_sigmask(SIG_SETMASK, &newset, &oldset);
// google "vfork considered dangerous". the article on
// EWONTFIX is particularly informative.
handle->pid = fork();
if (handle->pid < 0)
{
int e = errno;
cerr << "fork: " << e << ": " << strerror(errno) << endl;
sigprocmask(SIG_SETMASK, &oldset, NULL);
return false;
}
if (handle->pid == 0)
{
// child
// move pipe ends we do use to the
// fd numbers where they're used by
// the child.
dup2(handle->toChildPipe[0], 0);
dup2(handle->fromChildPipe[1], 1);
dup2(handle->fromChildPipe[1], 2);
// don't allow the child to inhert any
// "interesting" file descriptors. note this
// also closes all the pipe ends we don't use in the child.
for (int i = 3; i < sysconf(_SC_OPEN_MAX); i++)
if (i != forkErrorPipe[1])
close(i);
// mark the 'fork error' pipe as close-on-exec,
// so if the exec succeeds, the parent gets a zero
// read, but if it fails, it gets a 1-read.
fcntl(forkErrorPipe[1], F_SETFD, FD_CLOEXEC);
execvp(handle->cmd[0], (char *const*)handle->cmd.data());
// dont print stuff! fork is weird, don't trust anything
// to work.
// send the errno to parent.
int e = errno;
write(forkErrorPipe[1], &e, sizeof(int));
// call _exit because we dont want to call any atexit handlers.
_exit(99);
}
//parent
// close pipe ends we don't use.
CLOSEFD(handle->fromChildPipe[1]);
CLOSEFD(handle->toChildPipe[0]);
close(forkErrorPipe[1]);
bool ret = false;
int e;
int cc = read(forkErrorPipe[0], &e, sizeof(e));
close(forkErrorPipe[0]);
pthread_sigmask(SIG_SETMASK, &oldset, NULL);
if (cc == 0)
{
// zero read means the pipe was closed-on-exec,
// so child success.
handle->open = true;
{
WaitUtil::Lock key(&handleLock);
openHandles[handle->pid] = handle;
handle->inManager = true;
} // key destroyed here
// wake up notify thread so it knows to
// rebuild its fd_sets to include the
// new handle.
char dummy = 1; // code 1 means rebuild
(void) write(rebuildFds[1], &dummy, 1);
ret = true;
}
else
{
// nonzero read means exec failed in the child.
cerr << "execvp " << handle->cmd[0]
<< " failed with error " << e << ": "
<< strerror(e) << endl;
}
return ret;
}
//static
void
Manager :: sigChildHandler(int s)
{
struct signalMsg msg;
do {
msg.pid = waitpid(/*wait for any child*/-1,
&msg.status, WNOHANG);
if (msg.pid > 0)
{
if (0) // debug
{
Bufprintf<80> bufp;
bufp.print("sig handler got pid %d died, status %d\n",
msg.pid, msg.status);
bufp.write(1);
}
if (_instance != NULL)
// dont do any data structure manipulations here;
// it is difficult to mutex between threads and
// signal handlers. (it can be done with sigprocmask but
// that is expensive.) instead send a message to the
// notify thread and let it deal with it in thread
// context.
(void) write(_instance->signalFds[1], &msg, sizeof(msg));
}
} while (msg.pid > 0);
}
//static
void *
Manager :: notifyThread(void *arg)
{
Manager * mgr = (Manager *) arg;
mgr->_notifyThread();
return NULL;
}
void
Manager :: _notifyThread(void)
{
bool done = false;
std::vector<Handle*> handles;
char buffer[4096];
int cc;
int maxfd;
HandleMap::iterator it;
Handle * h;
struct signalMsg msg;
char dummy;
while (!done)
{
pfk_select sel;
sel.rfds.set(signalFds[0]);
sel.rfds.set(rebuildFds[0]);
{ // add fds for all open handles to the fd_set.
WaitUtil::Lock key(&handleLock);
for (it = openHandles.begin();
it != openHandles.end();
it++)
{
h = it->second;
if (h->open)
sel.rfds.set(h->fds[0]);
}
} // key destroyed here
sel.tv.set(10,0);
sel.select();
if (sel.rfds.isset(rebuildFds[0]))
{
if (read(rebuildFds[0], &dummy, 1) != 1)
done = true;
else
if (dummy == 2) // die code
// must be the manager destructor
done = true;
if (0) // debug
{
Bufprintf<80> bufp;
bufp.print("thread awakened on rebuild fd, done = %d\n",
done);
bufp.write(1);
}
// otherwise this is just meant to make sure we rebuild
// our fd_sets because the openHandles map has changed.
}
if (!done && sel.rfds.isset(signalFds[0]))
{
// the sigchld handler has sent us a pid and status.
cc = read(signalFds[0], &msg, sizeof(msg));
if (cc <= 0)
done = true;
else
{
if (0) // debug
{
Bufprintf<80> bufp;
bufp.print("got msg pid %d died status %d\n",
msg.pid, msg.status);
bufp.write(1);
}
WaitUtil::Lock key(&handleLock);
it = openHandles.find(msg.pid);
if (it != openHandles.end())
{
h = it->second;
h->open = false;
h->inManager = false;
openHandles.erase(it);
h->processExited(msg.status);
}
} // key destroyed here
}
if (!done)
{ // check all open handles
// dont hold the key while calling h->handleOutput.
// build the list of all handles that need servicing
// first, then release the key.
{
WaitUtil::Lock key(&handleLock);
for (it = openHandles.begin();
it != openHandles.end();
it++)
{
h = it->second;
if (sel.rfds.isset(h->fds[0]))
handles.push_back(h);
}
} // key destroyed here
for (unsigned int ind = 0; ind < handles.size(); ind++)
{
h = handles[ind];
cc = read(h->fds[0], buffer, sizeof(buffer));
if (cc > 0)
// call user's virtual method to handle the data.
h->handleOutput(buffer, cc);
else
h->open = false;
}
handles.clear();
}
}
}
}; /* namespace ChildProcessManager */
|
simplify cpm using pfk_select
|
simplify cpm using pfk_select
|
C++
|
unlicense
|
flipk/pfkutils,flipk/pfkutils,flipk/pfkutils,flipk/pfkutils,flipk/pfkutils,flipk/pfkutils,flipk/pfkutils
|
df9db2adca3410df8d6b15b6d1591bb1aa10f003
|
utils/prepare-builtins.cpp
|
utils/prepare-builtins.cpp
|
#include "llvm/Bitcode/BitcodeReader.h"
#include "llvm/Bitcode/BitcodeWriter.h"
#include "llvm/IR/Function.h"
#include "llvm/IR/GlobalVariable.h"
#include "llvm/IR/LLVMContext.h"
#include "llvm/IR/Module.h"
#include "llvm/Support/CommandLine.h"
#include "llvm/Support/ManagedStatic.h"
#include "llvm/Support/MemoryBuffer.h"
#include "llvm/Support/FileSystem.h"
#include "llvm/Support/raw_ostream.h"
#include "llvm/Support/ErrorOr.h"
#include "llvm/Support/ToolOutputFile.h"
#include "llvm/Config/llvm-config.h"
#include <system_error>
using namespace llvm;
static cl::opt<std::string>
InputFilename(cl::Positional, cl::desc("<input bitcode>"), cl::init("-"));
static cl::opt<std::string>
OutputFilename("o", cl::desc("Output filename"),
cl::value_desc("filename"));
int main(int argc, char **argv) {
LLVMContext Context;
llvm_shutdown_obj Y; // Call llvm_shutdown() on exit.
cl::ParseCommandLineOptions(argc, argv, "libclc builtin preparation tool\n");
std::string ErrorMessage;
Module *M = nullptr;
{
ErrorOr<std::unique_ptr<MemoryBuffer>> BufferOrErr =
MemoryBuffer::getFile(InputFilename);
if (std::error_code ec = BufferOrErr.getError()) {
ErrorMessage = ec.message();
} else {
std::unique_ptr<MemoryBuffer> &BufferPtr = BufferOrErr.get();
ErrorOr<std::unique_ptr<Module>> ModuleOrErr =
expectedToErrorOrAndEmitErrors(Context,
parseBitcodeFile(BufferPtr.get()->getMemBufferRef(), Context));
if (std::error_code ec = ModuleOrErr.getError())
ErrorMessage = ec.message();
M = ModuleOrErr.get().release();
}
}
if (!M) {
errs() << argv[0] << ": ";
if (ErrorMessage.size())
errs() << ErrorMessage << "\n";
else
errs() << "bitcode didn't read correctly.\n";
return 1;
}
// Strip the OpenCL version metadata. There are a lot of linked
// modules in the library build, each spamming the same
// version. This may also report a different version than the user
// program is using. This should probably be uniqued when linking.
if (NamedMDNode *OCLVersion = M->getNamedMetadata("opencl.ocl.version"))
M->eraseNamedMetadata(OCLVersion);
// Set linkage of every external definition to linkonce_odr.
for (Module::iterator i = M->begin(), e = M->end(); i != e; ++i) {
if (!i->isDeclaration() && i->getLinkage() == GlobalValue::ExternalLinkage)
i->setLinkage(GlobalValue::LinkOnceODRLinkage);
}
for (Module::global_iterator i = M->global_begin(), e = M->global_end();
i != e; ++i) {
if (!i->isDeclaration() && i->getLinkage() == GlobalValue::ExternalLinkage)
i->setLinkage(GlobalValue::LinkOnceODRLinkage);
}
if (OutputFilename.empty()) {
errs() << "no output file\n";
return 1;
}
std::error_code EC;
std::unique_ptr<tool_output_file> Out
(new tool_output_file(OutputFilename, EC, sys::fs::F_None));
if (EC) {
errs() << EC.message() << '\n';
exit(1);
}
WriteBitcodeToFile(M, Out->os());
// Declare success.
Out->keep();
return 0;
}
|
#include "llvm/Bitcode/BitcodeReader.h"
#include "llvm/Bitcode/BitcodeWriter.h"
#include "llvm/IR/Function.h"
#include "llvm/IR/GlobalVariable.h"
#include "llvm/IR/LLVMContext.h"
#include "llvm/IR/Module.h"
#include "llvm/Support/CommandLine.h"
#include "llvm/Support/ManagedStatic.h"
#include "llvm/Support/MemoryBuffer.h"
#include "llvm/Support/FileSystem.h"
#include "llvm/Support/raw_ostream.h"
#include "llvm/Support/ErrorOr.h"
#include "llvm/Support/ToolOutputFile.h"
#include "llvm/Config/llvm-config.h"
#include <system_error>
using namespace llvm;
static cl::opt<std::string>
InputFilename(cl::Positional, cl::desc("<input bitcode>"), cl::init("-"));
static cl::opt<std::string>
OutputFilename("o", cl::desc("Output filename"),
cl::value_desc("filename"));
int main(int argc, char **argv) {
LLVMContext Context;
llvm_shutdown_obj Y; // Call llvm_shutdown() on exit.
cl::ParseCommandLineOptions(argc, argv, "libclc builtin preparation tool\n");
std::string ErrorMessage;
Module *M = nullptr;
{
ErrorOr<std::unique_ptr<MemoryBuffer>> BufferOrErr =
MemoryBuffer::getFile(InputFilename);
if (std::error_code ec = BufferOrErr.getError()) {
ErrorMessage = ec.message();
} else {
std::unique_ptr<MemoryBuffer> &BufferPtr = BufferOrErr.get();
ErrorOr<std::unique_ptr<Module>> ModuleOrErr =
expectedToErrorOrAndEmitErrors(Context,
parseBitcodeFile(BufferPtr.get()->getMemBufferRef(), Context));
if (std::error_code ec = ModuleOrErr.getError())
ErrorMessage = ec.message();
M = ModuleOrErr.get().release();
}
}
if (!M) {
errs() << argv[0] << ": ";
if (ErrorMessage.size())
errs() << ErrorMessage << "\n";
else
errs() << "bitcode didn't read correctly.\n";
return 1;
}
// Strip the OpenCL version metadata. There are a lot of linked
// modules in the library build, each spamming the same
// version. This may also report a different version than the user
// program is using. This should probably be uniqued when linking.
if (NamedMDNode *OCLVersion = M->getNamedMetadata("opencl.ocl.version"))
M->eraseNamedMetadata(OCLVersion);
// Set linkage of every external definition to linkonce_odr.
for (Module::iterator i = M->begin(), e = M->end(); i != e; ++i) {
if (!i->isDeclaration() && i->getLinkage() == GlobalValue::ExternalLinkage)
i->setLinkage(GlobalValue::LinkOnceODRLinkage);
}
for (Module::global_iterator i = M->global_begin(), e = M->global_end();
i != e; ++i) {
if (!i->isDeclaration() && i->getLinkage() == GlobalValue::ExternalLinkage)
i->setLinkage(GlobalValue::LinkOnceODRLinkage);
}
if (OutputFilename.empty()) {
errs() << "no output file\n";
return 1;
}
std::error_code EC;
std::unique_ptr<ToolOutputFile> Out(
new ToolOutputFile(OutputFilename, EC, sys::fs::F_None));
if (EC) {
errs() << EC.message() << '\n';
exit(1);
}
WriteBitcodeToFile(M, Out->os());
// Declare success.
Out->keep();
return 0;
}
|
Rename tool_output_file to ToolOutputFile, NFC
|
[Support] Rename tool_output_file to ToolOutputFile, NFC
This class isn't similar to anything from the STL, so it shouldn't use
the STL naming conventions.
git-svn-id: e7f1ab7c2a259259587475a3e7520e757882f167@314050 91177308-0d34-0410-b5e6-96231b3b80d8
|
C++
|
apache-2.0
|
llvm-mirror/libclc,llvm-mirror/libclc,llvm-mirror/libclc,llvm-mirror/libclc,llvm-mirror/libclc,llvm-mirror/libclc,llvm-mirror/libclc
|
59f68aed530bebe52f8e6252ed5b939f74b87ec1
|
libproxy/modules/config_gnome.cpp
|
libproxy/modules/config_gnome.cpp
|
/*******************************************************************************
* libproxy - A library for proxy configuration
* Copyright (C) 2006 Nathaniel McCallum <[email protected]>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
******************************************************************************/
#include <cstdio> // For fileno(), fread(), pclose(), popen(), sscanf()
#include <sys/select.h> // For select(...)
#include <fcntl.h> // For fcntl(...)
#include "xhasclient.cpp" // For xhasclient(...)
/*
int popen2(const char *program, FILE **read, FILE **write) {
int wpipe[2];
if (!read || !write || !program || !*program)
return EINVAL;
*read = NULL;
*write = NULL;
if (pipe(wpipe) < 0)
return errno;
switch (pid = vfork()) {
case -1: // Error
close(wpipe[0]);
close(wpipe[1]);
return ASOIMWE;
case 0: // Child
close(wpipe[1]);
dup2(wpipe[0], STDIN_FILENO);
close(wpipe[0]);
execl(_PATH_BSHELL, "sh", "-c", program, (char *)NULL);
_exit(127);
// NOTREACHED
}
}
// Parent; assume fdopen can't fail.
if (*type == 'r') {
iop = fdopen(pdes[0], type);
(void)close(pdes[1]);
} else {
iop = fdopen(pdes[1], type);
(void)close(pdes[0]);
}
// Link into list of file descriptors.
cur->fp = iop;
cur->pid = pid;
cur->next = pidlist;
pidlist = cur;
return (iop);
}*/
#include "../module_types.hpp"
using namespace com::googlecode::libproxy;
static const char *_all_keys[] = {
"/system/proxy/mode", "/system/proxy/autoconfig_url",
"/system/http_proxy/host", "/system/http_proxy/port",
"/system/proxy/secure_host", "/system/proxy/secure_port",
"/system/proxy/ftp_host", "/system/proxy/ftp_port",
"/system/proxy/socks_host", "/system/proxy/socks_port",
"/system/http_proxy/ignore_hosts",
"/system/http_proxy/use_authentication",
"/system/http_proxy/authentication_user",
"/system/http_proxy/authentication_password",
NULL
};
class gnome_config_module : public config_module {
public:
PX_MODULE_ID(NULL);
PX_MODULE_CONFIG_CATEGORY(config_module::CATEGORY_SESSION);
gnome_config_module() {
int count;
string cmd = LIBEXECDIR "pxgconf";
for (count=0 ; _all_keys[count] ; count++)
cmd += string(" ", 1) + _all_keys[count];
this->pipe = popen(cmd.c_str(), "r");
if (!this->pipe)
throw io_error("Unable to open gconf helper!");
if (fcntl(fileno(this->pipe), F_SETFL, FNONBLOCK) == -1) {
pclose(this->pipe);
throw io_error("Unable to set pipe to non-blocking!");
}
this->update_data(count);
}
~gnome_config_module() {
if (this->pipe)
pclose(this->pipe);
}
url get_config(url dest) throw (runtime_error) {
// Check for changes in the config
if (this->pipe) this->update_data();
// Mode is wpad:// or pac+http://...
if (this->data["/system/proxy/mode"] == "auto") {
string pac = this->data["/system/proxy/autoconfig_url"];
return url::is_valid(pac) ? url(string("pac+") + pac) : url("wpad://");
}
// Mode is http://... or socks://...
else if (this->data["/system/proxy/mode"] == "manual") {
string type = "http", host, port;
bool auth = this->data["/system/http_proxy/use_authentication"] == "true";
string username = this->data["/system/http_proxy/authentication_user"];
string password = this->data["/system/http_proxy/authentication_password"];
uint16_t p = 0;
// Get the per-scheme proxy settings
if (dest.get_scheme() == "https") {
host = this->data["/system/proxy/secure_host"];
port = this->data["/system/proxy/secure_port"];
if (sscanf(port.c_str(), "%hu", &p) != 1) p = 0;
}
else if (dest.get_scheme() == "ftp") {
host = this->data["/system/proxy/ftp_host"];
port = this->data["/system/proxy/ftp_port"];
if (sscanf(port.c_str(), "%hu", &p) != 1) p = 0;
}
if (host == "" || p == 0)
{
host = this->data["/system/http_proxy/host"];
port = this->data["/system/http_proxy/port"];
if (sscanf(port.c_str(), "%hu", &p) != 1) p = 0;
}
// If http(s)/ftp proxy is not set, try socks
if (host == "" || p == 0)
{
host = this->data["/system/proxy/socks_host"];
port = this->data["/system/proxy/socks_port"];
if (sscanf(port.c_str(), "%hu", &p) != 1) p = 0;
}
// If host and port were found, build config url
if (host != "" && p != 0) {
string tmp = type + "://";
if (auth)
tmp += username + ":" + password + "@";
tmp += host + ":" + port;
return url(tmp);
}
}
// Mode is direct://
return url("direct://");
}
string get_ignore(url) {
return this->data["/system/http_proxy/ignore_hosts"];
}
private:
FILE *pipe;
map<string, string> data;
string readline(string buffer="") {
char c;
// If the fread() call would block, an error occurred or
// we are at the end of the line, we're done
if (fread(&c, sizeof(char), 1, this->pipe) != 1 || c == '\n')
return buffer;
// Process the next character
return this->readline(buffer + string(&c, 1));
}
// This method attempts to update data
// If called with no arguments, it will check for new data (sleeping for <=1000
// useconds) and returning true or false depending on if at least one line of
// data was found.
// However, if req > 0, we will keep checking for new lines (at 1000 usec ivals)
// until enough lines are found. This allows us to wait for *all* the initial
// values to be read in before we start processing gconf requests.
bool update_data(int req=0, int found=0) {
// If we have collected the correct number of lines, return true
if (req > 0 && found >= req)
return true;
// We need the pipe to be open
if (!this->pipe) return false;
fd_set rfds;
struct timeval timeout = { 0, 1000 };
FD_ZERO(&rfds);
FD_SET(fileno(this->pipe), &rfds);
if (select(fileno(this->pipe)+1, &rfds, NULL, NULL, &timeout) < 1)
return req > 0 ? this->update_data(req, found) : false; // If we still haven't met
// our req quota, try again
bool retval = false;
for (string line = this->readline() ; line != "" ; line = this->readline()) {
string key = line.substr(0, line.find("\t"));
string val = line.substr(line.find("\t")+1);
this->data[key] = val;
retval = ++found > req;
}
return (this->update_data(req, found) || retval);
}
};
// If we are running in GNOME, then make sure this plugin is registered.
extern "C" bool px_module_load(module_manager& mm) {
if (xhasclient("gnome-session", "gnome-settings-daemon", "gnome-panel", NULL)) {
try { return mm.register_module<config_module>(new gnome_config_module); }
catch (io_error) {}
}
return false;
}
|
/*******************************************************************************
* libproxy - A library for proxy configuration
* Copyright (C) 2006 Nathaniel McCallum <[email protected]>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
******************************************************************************/
#include <cstdio> // For fileno(), fread(), pclose(), popen(), sscanf()
#include <sys/select.h> // For select(...)
#include <fcntl.h> // For fcntl(...)
#include <errno.h> // For errno stuff
#include <unistd.h> // For pipe(), close(), fork(), dup(), execl(), _exit()
#include <signal.h> // For kill()
#include "xhasclient.cpp" // For xhasclient(...)
static int popen2(const char *program, FILE** read, FILE** write, pid_t* pid) {
if (!read || !write || !pid || !program || !*program)
return EINVAL;
*read = NULL;
*write = NULL;
*pid = 0;
// Open the pipes
int rpipe[2];
int wpipe[2];
if (pipe(rpipe) < 0)
return errno;
if (pipe(wpipe) < 0) {
close(rpipe[0]);
close(rpipe[1]);
return errno;
}
switch (*pid = fork()) {
case -1: // Error
close(rpipe[0]);
close(rpipe[1]);
close(wpipe[0]);
close(wpipe[1]);
return errno;
case 0: // Child
close(STDIN_FILENO); // Close stdin
close(STDOUT_FILENO); // Close stdout
dup(wpipe[0]); // Dup the read end of the write pipe to stdin
dup(rpipe[1]); // Dup the write end of the read pipe to stdout
// Close unneeded fds
close(rpipe[0]);
close(rpipe[1]);
close(wpipe[0]);
close(wpipe[1]);
// Exec
execl("/bin/sh", "sh", "-c", program, (char*) NULL);
_exit(127); // Whatever we do, don't return
default: // Parent
close(rpipe[1]);
close(wpipe[0]);
if (!(*read = fdopen(rpipe[0], "r"))) {
kill(*pid, SIGTERM);
close(rpipe[0]);
close(wpipe[1]);
return errno;
}
if (!(*write = fdopen(wpipe[1], "w"))) {
kill(*pid, SIGTERM);
fclose(*read);
close(wpipe[1]);
return errno;
}
return 0;
}
}
#include "../module_types.hpp"
using namespace com::googlecode::libproxy;
static const char *_all_keys[] = {
"/system/proxy/mode", "/system/proxy/autoconfig_url",
"/system/http_proxy/host", "/system/http_proxy/port",
"/system/proxy/secure_host", "/system/proxy/secure_port",
"/system/proxy/ftp_host", "/system/proxy/ftp_port",
"/system/proxy/socks_host", "/system/proxy/socks_port",
"/system/http_proxy/ignore_hosts",
"/system/http_proxy/use_authentication",
"/system/http_proxy/authentication_user",
"/system/http_proxy/authentication_password",
NULL
};
class gnome_config_module : public config_module {
public:
PX_MODULE_ID(NULL);
PX_MODULE_CONFIG_CATEGORY(config_module::CATEGORY_SESSION);
gnome_config_module() {
// Build the command
int count;
string cmd = LIBEXECDIR "pxgconf";
for (count=0 ; _all_keys[count] ; count++)
cmd += string(" ", 1) + _all_keys[count];
// Get our pipes
if (popen2(cmd.c_str(), &this->read, &this->write, &this->pid) != 0)
throw io_error("Unable to open gconf helper!");
// Set the write pipe to non-blocking
if (fcntl(fileno(this->write), F_SETFL, FNONBLOCK) == -1) {
fclose(this->read);
fclose(this->write);
kill(this->pid, SIGTERM);
throw io_error("Unable to set pipe to non-blocking!");
}
// Read in the first print-out of all our keys
this->update_data(count);
}
~gnome_config_module() {
if (this->read)
fclose(this->read);
if (this->write)
fclose(this->write);
kill(this->pid, SIGTERM);
}
url get_config(url dest) throw (runtime_error) {
// Check for changes in the config
this->update_data();
// Mode is wpad:// or pac+http://...
if (this->data["/system/proxy/mode"] == "auto") {
string pac = this->data["/system/proxy/autoconfig_url"];
return url::is_valid(pac) ? url(string("pac+") + pac) : url("wpad://");
}
// Mode is http://... or socks://...
else if (this->data["/system/proxy/mode"] == "manual") {
string type = "http", host, port;
bool auth = this->data["/system/http_proxy/use_authentication"] == "true";
string username = this->data["/system/http_proxy/authentication_user"];
string password = this->data["/system/http_proxy/authentication_password"];
uint16_t p = 0;
// Get the per-scheme proxy settings
if (dest.get_scheme() == "https") {
host = this->data["/system/proxy/secure_host"];
port = this->data["/system/proxy/secure_port"];
if (sscanf(port.c_str(), "%hu", &p) != 1) p = 0;
}
else if (dest.get_scheme() == "ftp") {
host = this->data["/system/proxy/ftp_host"];
port = this->data["/system/proxy/ftp_port"];
if (sscanf(port.c_str(), "%hu", &p) != 1) p = 0;
}
if (host == "" || p == 0)
{
host = this->data["/system/http_proxy/host"];
port = this->data["/system/http_proxy/port"];
if (sscanf(port.c_str(), "%hu", &p) != 1) p = 0;
}
// If http(s)/ftp proxy is not set, try socks
if (host == "" || p == 0)
{
host = this->data["/system/proxy/socks_host"];
port = this->data["/system/proxy/socks_port"];
if (sscanf(port.c_str(), "%hu", &p) != 1) p = 0;
}
// If host and port were found, build config url
if (host != "" && p != 0) {
string tmp = type + "://";
if (auth)
tmp += username + ":" + password + "@";
tmp += host + ":" + port;
return url(tmp);
}
}
// Mode is direct://
return url("direct://");
}
string get_ignore(url) {
return this->data["/system/http_proxy/ignore_hosts"];
}
private:
FILE* read;
FILE* write;
pid_t pid;
map<string, string> data;
string readline(string buffer="") {
char c;
// If the fread() call would block, an error occurred or
// we are at the end of the line, we're done
if (fread(&c, sizeof(char), 1, this->read) != 1 || c == '\n')
return buffer;
// Process the next character
return this->readline(buffer + string(&c, 1));
}
// This method attempts to update data
// If called with no arguments, it will check for new data (sleeping for <=1000
// useconds) and returning true or false depending on if at least one line of
// data was found.
// However, if req > 0, we will keep checking for new lines (at 1000 usec ivals)
// until enough lines are found. This allows us to wait for *all* the initial
// values to be read in before we start processing gconf requests.
bool update_data(int req=0, int found=0) {
// If we have collected the correct number of lines, return true
if (req > 0 && found >= req)
return true;
// We need the pipe to be open
if (!this->read) return false;
fd_set rfds;
struct timeval timeout = { 0, 1000 }; // select() for 1/1000th of a second
FD_ZERO(&rfds);
FD_SET(fileno(this->read), &rfds);
if (select(fileno(this->read)+1, &rfds, NULL, NULL, &timeout) < 1)
return req > 0 ? this->update_data(req, found) : false; // If we still haven't met
// our req quota, try again
bool retval = false;
for (string line = this->readline() ; line != "" ; line = this->readline()) {
string key = line.substr(0, line.find("\t"));
string val = line.substr(line.find("\t")+1);
this->data[key] = val;
retval = ++found > req;
}
return (this->update_data(req, found) || retval);
}
};
// If we are running in GNOME, then make sure this plugin is registered.
extern "C" bool px_module_load(module_manager& mm) {
if (xhasclient("gnome-session", "gnome-settings-daemon", "gnome-panel", NULL)) {
try { return mm.register_module<config_module>(new gnome_config_module); }
catch (io_error) {}
}
return false;
}
|
fix config_gnome's io stuff
|
fix config_gnome's io stuff
|
C++
|
lgpl-2.1
|
cicku/libproxy,markcox/libproxy,markcox/libproxy,libproxy/libproxy,maxinbjohn/libproxy,maxinbjohn/libproxy,markcox/libproxy,anonymous2ch/libproxy,binarycrusader/libproxy,libproxy/libproxy,codegooglecom/libproxy,codegooglecom/libproxy,binarycrusader/libproxy,horar/libproxy,markcox/libproxy,maxinbjohn/libproxy,markcox/libproxy,codegooglecom/libproxy,cicku/libproxy,horar/libproxy,libproxy/libproxy,horar/libproxy,libproxy/libproxy,codegooglecom/libproxy,libproxy/libproxy,binarycrusader/libproxy,anonymous2ch/libproxy,cicku/libproxy,codegooglecom/libproxy,anonymous2ch/libproxy,horar/libproxy,horar/libproxy,binarycrusader/libproxy,anonymous2ch/libproxy,markcox/libproxy,cicku/libproxy,binarycrusader/libproxy,anonymous2ch/libproxy,markcox/libproxy,libproxy/libproxy,codegooglecom/libproxy,binarycrusader/libproxy,codegooglecom/libproxy,horar/libproxy,binarycrusader/libproxy,maxinbjohn/libproxy,binarycrusader/libproxy,maxinbjohn/libproxy,cicku/libproxy,maxinbjohn/libproxy,cicku/libproxy,anonymous2ch/libproxy,markcox/libproxy,anonymous2ch/libproxy,maxinbjohn/libproxy,libproxy/libproxy,horar/libproxy,cicku/libproxy
|
bfef440968e98219612a9bbd24e715e8835ad975
|
libraries/chain/fork_database.cpp
|
libraries/chain/fork_database.cpp
|
/*
* Copyright (c) 2015, Cryptonomex, Inc.
* All rights reserved.
*
* This source code is provided for evaluation in private test networks only, until September 8, 2015. After this date, this license expires and
* the code may not be used, modified or distributed for any purpose. Redistribution and use in source and binary forms, with or without modification,
* are permitted until September 8, 2015, provided that the following conditions are met:
*
* 1. The code and/or derivative works are used only for private test networks consisting of no more than 10 P2P nodes.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <graphene/chain/fork_database.hpp>
#include <graphene/chain/exceptions.hpp>
#include <graphene/chain/protocol/fee_schedule.hpp>
#include <fc/smart_ref_impl.hpp>
namespace graphene { namespace chain {
fork_database::fork_database()
{
}
void fork_database::reset()
{
_head.reset();
_index.clear();
}
void fork_database::pop_block()
{
if( _head ) _head = _head->prev.lock();
}
void fork_database::start_block(signed_block b)
{
auto item = std::make_shared<fork_item>(std::move(b));
_index.insert(item);
_head = item;
}
/**
* Pushes the block into the fork database and caches it if it doesn't link
*
*/
shared_ptr<fork_item> fork_database::push_block(const signed_block& b)
{
auto item = std::make_shared<fork_item>(b);
try {
_push_block(item);
}
catch ( const unlinkable_block_exception& e )
{
wlog( "Pushing block to fork database that failed to link: ${id}, ${num}", ("id",b.id())("num",b.block_num()) );
wlog( "Head: ${num}, ${id}", ("num",_head->data.block_num())("id",_head->data.id()) );
throw;
_unlinked_index.insert( item );
}
return _head;
}
void fork_database::_push_block(const item_ptr& item)
{
if( _head ) // make sure the block is within the range that we are caching
{
FC_ASSERT( item->num > std::max<int64_t>( 0, int64_t(_head->num) - (_max_size) ),
"attempting to push a block that is too old",
("item->num",item->num)("head",_head->num)("max_size",_max_size));
}
if( _head && item->previous_id() != block_id_type() )
{
auto& index = _index.get<block_id>();
auto itr = index.find(item->previous_id());
GRAPHENE_ASSERT(itr != index.end(), unlinkable_block_exception, "block does not link to known chain");
FC_ASSERT(!(*itr)->invalid);
item->prev = *itr;
}
_index.insert(item);
if( !_head ) _head = item;
else if( item->num > _head->num )
{
_head = item;
auto min_num = _head->num - _max_size;
// ilog( "min block in fork DB ${n}, max_size: ${m}", ("n",min_num)("m",_max_size) );
auto& num_idx = _index.get<block_num>();
while( num_idx.size() && (*num_idx.begin())->num < min_num )
num_idx.erase( num_idx.begin() );
_unlinked_index.get<block_num>().erase(_head->num - _max_size);
}
//_push_next( item );
}
/**
* Iterate through the unlinked cache and insert anything that
* links to the newly inserted item. This will start a recursive
* set of calls performing a depth-first insertion of pending blocks as
* _push_next(..) calls _push_block(...) which will in turn call _push_next
*/
void fork_database::_push_next( const item_ptr& new_item )
{
auto& prev_idx = _unlinked_index.get<by_previous>();
auto itr = prev_idx.find( new_item->id );
while( itr != prev_idx.end() )
{
auto tmp = *itr;
prev_idx.erase( itr );
_push_block( tmp );
itr = prev_idx.find( new_item->id );
}
}
void fork_database::set_max_size( uint32_t s )
{
_max_size = s;
if( !_head ) return;
{ /// index
auto& by_num_idx = _index.get<block_num>();
auto itr = by_num_idx.begin();
while( itr != by_num_idx.end() )
{
if( (*itr)->num < std::max(int64_t(0),int64_t(_head->num) - _max_size) )
by_num_idx.erase(itr);
else
break;
itr = by_num_idx.begin();
}
}
{ /// unlinked_index
auto& by_num_idx = _unlinked_index.get<block_num>();
auto itr = by_num_idx.begin();
while( itr != by_num_idx.end() )
{
if( (*itr)->num < std::max(int64_t(0),int64_t(_head->num) - _max_size) )
by_num_idx.erase(itr);
else
break;
itr = by_num_idx.begin();
}
}
}
bool fork_database::is_known_block(const block_id_type& id)const
{
auto& index = _index.get<block_id>();
auto itr = index.find(id);
if( itr != index.end() )
return true;
auto& unlinked_index = _unlinked_index.get<block_id>();
auto unlinked_itr = unlinked_index.find(id);
return unlinked_itr != unlinked_index.end();
}
item_ptr fork_database::fetch_block(const block_id_type& id)const
{
auto& index = _index.get<block_id>();
auto itr = index.find(id);
if( itr != index.end() )
return *itr;
auto& unlinked_index = _unlinked_index.get<block_id>();
auto unlinked_itr = unlinked_index.find(id);
if( unlinked_itr != unlinked_index.end() )
return *unlinked_itr;
return item_ptr();
}
vector<item_ptr> fork_database::fetch_block_by_number(uint32_t num)const
{
vector<item_ptr> result;
auto itr = _index.get<block_num>().find(num);
while( itr != _index.get<block_num>().end() )
{
if( (*itr)->num == num )
result.push_back( *itr );
else
break;
++itr;
}
return result;
}
pair<fork_database::branch_type,fork_database::branch_type>
fork_database::fetch_branch_from(block_id_type first, block_id_type second)const
{ try {
// This function gets a branch (i.e. vector<fork_item>) leading
// back to the most recent common ancestor.
pair<branch_type,branch_type> result;
auto first_branch_itr = _index.get<block_id>().find(first);
FC_ASSERT(first_branch_itr != _index.get<block_id>().end());
auto first_branch = *first_branch_itr;
auto second_branch_itr = _index.get<block_id>().find(second);
FC_ASSERT(second_branch_itr != _index.get<block_id>().end());
auto second_branch = *second_branch_itr;
while( first_branch->data.block_num() > second_branch->data.block_num() )
{
result.first.push_back(first_branch);
first_branch = first_branch->prev.lock();
FC_ASSERT(first_branch);
}
while( second_branch->data.block_num() > first_branch->data.block_num() )
{
result.second.push_back( second_branch );
second_branch = second_branch->prev.lock();
FC_ASSERT(second_branch);
}
while( first_branch->data.previous != second_branch->data.previous )
{
result.first.push_back(first_branch);
result.second.push_back(second_branch);
first_branch = first_branch->prev.lock();
FC_ASSERT(first_branch);
second_branch = second_branch->prev.lock();
FC_ASSERT(second_branch);
}
if( first_branch && second_branch )
{
result.first.push_back(first_branch);
result.second.push_back(second_branch);
}
return result;
} FC_CAPTURE_AND_RETHROW( (first)(second) ) }
void fork_database::set_head(shared_ptr<fork_item> h)
{
_head = h;
}
void fork_database::remove(block_id_type id)
{
_index.get<block_id>().erase(id);
}
} } // graphene::chain
|
/*
* Copyright (c) 2015, Cryptonomex, Inc.
* All rights reserved.
*
* This source code is provided for evaluation in private test networks only, until September 8, 2015. After this date, this license expires and
* the code may not be used, modified or distributed for any purpose. Redistribution and use in source and binary forms, with or without modification,
* are permitted until September 8, 2015, provided that the following conditions are met:
*
* 1. The code and/or derivative works are used only for private test networks consisting of no more than 10 P2P nodes.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <graphene/chain/fork_database.hpp>
#include <graphene/chain/exceptions.hpp>
#include <graphene/chain/protocol/fee_schedule.hpp>
#include <fc/smart_ref_impl.hpp>
namespace graphene { namespace chain {
fork_database::fork_database()
{
}
void fork_database::reset()
{
_head.reset();
_index.clear();
}
void fork_database::pop_block()
{
if( _head ) _head = _head->prev.lock();
}
void fork_database::start_block(signed_block b)
{
auto item = std::make_shared<fork_item>(std::move(b));
_index.insert(item);
_head = item;
}
/**
* Pushes the block into the fork database and caches it if it doesn't link
*
*/
shared_ptr<fork_item> fork_database::push_block(const signed_block& b)
{
auto item = std::make_shared<fork_item>(b);
try {
_push_block(item);
}
catch ( const unlinkable_block_exception& e )
{
wlog( "Pushing block to fork database that failed to link: ${id}, ${num}", ("id",b.id())("num",b.block_num()) );
wlog( "Head: ${num}, ${id}", ("num",_head->data.block_num())("id",_head->data.id()) );
throw;
_unlinked_index.insert( item );
}
return _head;
}
void fork_database::_push_block(const item_ptr& item)
{
if( _head ) // make sure the block is within the range that we are caching
{
FC_ASSERT( item->num > std::max<int64_t>( 0, int64_t(_head->num) - (_max_size) ),
"attempting to push a block that is too old",
("item->num",item->num)("head",_head->num)("max_size",_max_size));
}
if( _head && item->previous_id() != block_id_type() )
{
auto& index = _index.get<block_id>();
auto itr = index.find(item->previous_id());
GRAPHENE_ASSERT(itr != index.end(), unlinkable_block_exception, "block does not link to known chain");
FC_ASSERT(!(*itr)->invalid);
item->prev = *itr;
}
_index.insert(item);
if( !_head ) _head = item;
else if( item->num > _head->num )
{
_head = item;
uint32_t min_num = _head->num - std::min( _max_size, _head->num );
// ilog( "min block in fork DB ${n}, max_size: ${m}", ("n",min_num)("m",_max_size) );
auto& num_idx = _index.get<block_num>();
while( num_idx.size() && (*num_idx.begin())->num < min_num )
num_idx.erase( num_idx.begin() );
_unlinked_index.get<block_num>().erase(_head->num - _max_size);
}
//_push_next( item );
}
/**
* Iterate through the unlinked cache and insert anything that
* links to the newly inserted item. This will start a recursive
* set of calls performing a depth-first insertion of pending blocks as
* _push_next(..) calls _push_block(...) which will in turn call _push_next
*/
void fork_database::_push_next( const item_ptr& new_item )
{
auto& prev_idx = _unlinked_index.get<by_previous>();
auto itr = prev_idx.find( new_item->id );
while( itr != prev_idx.end() )
{
auto tmp = *itr;
prev_idx.erase( itr );
_push_block( tmp );
itr = prev_idx.find( new_item->id );
}
}
void fork_database::set_max_size( uint32_t s )
{
_max_size = s;
if( !_head ) return;
{ /// index
auto& by_num_idx = _index.get<block_num>();
auto itr = by_num_idx.begin();
while( itr != by_num_idx.end() )
{
if( (*itr)->num < std::max(int64_t(0),int64_t(_head->num) - _max_size) )
by_num_idx.erase(itr);
else
break;
itr = by_num_idx.begin();
}
}
{ /// unlinked_index
auto& by_num_idx = _unlinked_index.get<block_num>();
auto itr = by_num_idx.begin();
while( itr != by_num_idx.end() )
{
if( (*itr)->num < std::max(int64_t(0),int64_t(_head->num) - _max_size) )
by_num_idx.erase(itr);
else
break;
itr = by_num_idx.begin();
}
}
}
bool fork_database::is_known_block(const block_id_type& id)const
{
auto& index = _index.get<block_id>();
auto itr = index.find(id);
if( itr != index.end() )
return true;
auto& unlinked_index = _unlinked_index.get<block_id>();
auto unlinked_itr = unlinked_index.find(id);
return unlinked_itr != unlinked_index.end();
}
item_ptr fork_database::fetch_block(const block_id_type& id)const
{
auto& index = _index.get<block_id>();
auto itr = index.find(id);
if( itr != index.end() )
return *itr;
auto& unlinked_index = _unlinked_index.get<block_id>();
auto unlinked_itr = unlinked_index.find(id);
if( unlinked_itr != unlinked_index.end() )
return *unlinked_itr;
return item_ptr();
}
vector<item_ptr> fork_database::fetch_block_by_number(uint32_t num)const
{
vector<item_ptr> result;
auto itr = _index.get<block_num>().find(num);
while( itr != _index.get<block_num>().end() )
{
if( (*itr)->num == num )
result.push_back( *itr );
else
break;
++itr;
}
return result;
}
pair<fork_database::branch_type,fork_database::branch_type>
fork_database::fetch_branch_from(block_id_type first, block_id_type second)const
{ try {
// This function gets a branch (i.e. vector<fork_item>) leading
// back to the most recent common ancestor.
pair<branch_type,branch_type> result;
auto first_branch_itr = _index.get<block_id>().find(first);
FC_ASSERT(first_branch_itr != _index.get<block_id>().end());
auto first_branch = *first_branch_itr;
auto second_branch_itr = _index.get<block_id>().find(second);
FC_ASSERT(second_branch_itr != _index.get<block_id>().end());
auto second_branch = *second_branch_itr;
while( first_branch->data.block_num() > second_branch->data.block_num() )
{
result.first.push_back(first_branch);
first_branch = first_branch->prev.lock();
FC_ASSERT(first_branch);
}
while( second_branch->data.block_num() > first_branch->data.block_num() )
{
result.second.push_back( second_branch );
second_branch = second_branch->prev.lock();
FC_ASSERT(second_branch);
}
while( first_branch->data.previous != second_branch->data.previous )
{
result.first.push_back(first_branch);
result.second.push_back(second_branch);
first_branch = first_branch->prev.lock();
FC_ASSERT(first_branch);
second_branch = second_branch->prev.lock();
FC_ASSERT(second_branch);
}
if( first_branch && second_branch )
{
result.first.push_back(first_branch);
result.second.push_back(second_branch);
}
return result;
} FC_CAPTURE_AND_RETHROW( (first)(second) ) }
void fork_database::set_head(shared_ptr<fork_item> h)
{
_head = h;
}
void fork_database::remove(block_id_type id)
{
_index.get<block_id>().erase(id);
}
} } // graphene::chain
|
Fix overflow
|
fork_database.cpp: Fix overflow
|
C++
|
mit
|
abitmore/bitshares-2,pmconrad/graphene,peertracksinc/muse,pmconrad/graphene,oxarbitrage/bitshares-core,bigoc/openchain,peertracksinc/muse,bitshares/bitshares-2,bitsuperlab/cpp-play2,bitshares/bitshares-2,bigoc/openchain,cryptonomex/graphene,oxarbitrage/bitshares-core,peertracksinc/muse,abitmore/bitshares-2,bitsuperlab/cpp-play2,oxarbitrage/bitshares-core,pmconrad/graphene,pmconrad/graphene,bitsuperlab/cpp-play2,bigoc/openchain,bitshares/bitshares-2,bitshares/bitshares-2,cryptonomex/graphene,peertracksinc/muse,oxarbitrage/bitshares-core,abitmore/bitshares-2,abitmore/bitshares-2,bigoc/openchain,cryptonomex/graphene
|
e79505beba15200295e4f22bea76a3729ad7ac4d
|
app/resource_bundle_win.cc
|
app/resource_bundle_win.cc
|
// Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "app/resource_bundle.h"
#include <atlbase.h>
#include "app/app_paths.h"
#include "app/gfx/font.h"
#include "app/l10n_util.h"
#include "base/file_util.h"
#include "base/logging.h"
#include "base/path_service.h"
#include "base/resource_util.h"
#include "base/string_piece.h"
#include "base/win_util.h"
namespace {
// Returns the flags that should be passed to LoadLibraryEx.
DWORD GetDataDllLoadFlags() {
if (win_util::GetWinVersion() >= win_util::WINVERSION_VISTA)
return LOAD_LIBRARY_AS_DATAFILE_EXCLUSIVE | LOAD_LIBRARY_AS_IMAGE_RESOURCE;
return DONT_RESOLVE_DLL_REFERENCES;
}
} // end anonymous namespace
ResourceBundle::~ResourceBundle() {
FreeImages();
if (locale_resources_data_) {
BOOL rv = FreeLibrary(locale_resources_data_);
DCHECK(rv);
}
if (theme_data_) {
BOOL rv = FreeLibrary(theme_data_);
DCHECK(rv);
}
}
void ResourceBundle::LoadResources(const std::wstring& pref_locale) {
// As a convenience, set resources_data_ to the current module.
resources_data_ = _AtlBaseModule.GetModuleInstance();
DCHECK(NULL == locale_resources_data_) << "locale dll already loaded";
const FilePath& locale_path = GetLocaleFilePath(pref_locale);
if (locale_path.value().empty()) {
// It's possible that there are no locale dlls found, in which case we just
// return.
NOTREACHED();
return;
}
// The dll should only have resources, not executable code.
locale_resources_data_ = LoadLibraryEx(locale_path.value().c_str(), NULL,
GetDataDllLoadFlags());
DCHECK(locale_resources_data_ != NULL) <<
"unable to load generated resources";
}
FilePath ResourceBundle::GetLocaleFilePath(const std::wstring& pref_locale) {
FilePath locale_path;
PathService::Get(app::DIR_LOCALES, &locale_path);
const std::string app_locale = l10n_util::GetApplicationLocale(pref_locale);
if (app_locale.empty())
return FilePath();
return locale_path.AppendASCII(app_locale + ".dll");
}
void ResourceBundle::LoadThemeResources() {
DCHECK(NULL == theme_data_) << "theme dll already loaded";
FilePath theme_data_path;
PathService::Get(app::DIR_THEMES, &theme_data_path);
theme_data_path = theme_data_path.AppendASCII("default.dll");
// The dll should only have resources, not executable code.
theme_data_ = LoadLibraryEx(theme_data_path.value().c_str(), NULL,
GetDataDllLoadFlags());
DCHECK(theme_data_ != NULL) << "unable to load " << theme_data_path.value();
}
/* static */
bool ResourceBundle::LoadResourceBytes(
DataHandle module,
int resource_id,
std::vector<unsigned char>* bytes) {
void* data_ptr;
size_t data_size;
if (base::GetDataResourceFromModule(module, resource_id, &data_ptr,
&data_size)) {
bytes->resize(data_size);
memcpy(&(bytes->front()), data_ptr, data_size);
return true;
} else {
return false;
}
}
HICON ResourceBundle::LoadThemeIcon(int icon_id) {
return ::LoadIcon(theme_data_, MAKEINTRESOURCE(icon_id));
}
base::StringPiece ResourceBundle::GetRawDataResource(int resource_id) {
void* data_ptr;
size_t data_size;
if (base::GetDataResourceFromModule(_AtlBaseModule.GetModuleInstance(),
resource_id,
&data_ptr,
&data_size)) {
return base::StringPiece(static_cast<const char*>(data_ptr), data_size);
} else if (locale_resources_data_ &&
base::GetDataResourceFromModule(locale_resources_data_,
resource_id,
&data_ptr,
&data_size)) {
return base::StringPiece(static_cast<const char*>(data_ptr), data_size);
}
return base::StringPiece();
}
// Loads and returns a cursor from the current module.
HCURSOR ResourceBundle::LoadCursor(int cursor_id) {
return ::LoadCursor(_AtlBaseModule.GetModuleInstance(),
MAKEINTRESOURCE(cursor_id));
}
string16 ResourceBundle::GetLocalizedString(int message_id) {
// If for some reason we were unable to load a resource dll, return an empty
// string (better than crashing).
if (!locale_resources_data_) {
LOG(WARNING) << "locale resources are not loaded";
return string16();
}
DCHECK(IS_INTRESOURCE(message_id));
// Get a reference directly to the string resource.
HINSTANCE hinstance = locale_resources_data_;
const ATLSTRINGRESOURCEIMAGE* image = AtlGetStringResourceImage(hinstance,
message_id);
if (!image) {
// Fall back on the current module (shouldn't be any strings here except
// in unittests).
image = AtlGetStringResourceImage(_AtlBaseModule.GetModuleInstance(),
message_id);
if (!image) {
NOTREACHED() << "unable to find resource: " << message_id;
return std::wstring();
}
}
// Copy into a string16 and return.
return string16(image->achString, image->nLength);
}
|
// Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "app/resource_bundle.h"
#include <atlbase.h>
#include "app/app_paths.h"
#include "app/gfx/font.h"
#include "app/l10n_util.h"
#include "base/debug_util.h"
#include "base/file_util.h"
#include "base/logging.h"
#include "base/path_service.h"
#include "base/resource_util.h"
#include "base/string_piece.h"
#include "base/win_util.h"
namespace {
// Returns the flags that should be passed to LoadLibraryEx.
DWORD GetDataDllLoadFlags() {
if (win_util::GetWinVersion() >= win_util::WINVERSION_VISTA)
return LOAD_LIBRARY_AS_DATAFILE_EXCLUSIVE | LOAD_LIBRARY_AS_IMAGE_RESOURCE;
return DONT_RESOLVE_DLL_REFERENCES;
}
} // end anonymous namespace
ResourceBundle::~ResourceBundle() {
FreeImages();
if (locale_resources_data_) {
BOOL rv = FreeLibrary(locale_resources_data_);
DCHECK(rv);
}
if (theme_data_) {
BOOL rv = FreeLibrary(theme_data_);
DCHECK(rv);
}
}
void ResourceBundle::LoadResources(const std::wstring& pref_locale) {
// As a convenience, set resources_data_ to the current module.
resources_data_ = _AtlBaseModule.GetModuleInstance();
DCHECK(NULL == locale_resources_data_) << "locale dll already loaded";
const FilePath& locale_path = GetLocaleFilePath(pref_locale);
if (locale_path.value().empty()) {
// It's possible that there are no locale dlls found, in which case we just
// return.
NOTREACHED();
return;
}
// The dll should only have resources, not executable code.
locale_resources_data_ = LoadLibraryEx(locale_path.value().c_str(), NULL,
GetDataDllLoadFlags());
DCHECK(locale_resources_data_ != NULL) <<
"unable to load generated resources";
}
FilePath ResourceBundle::GetLocaleFilePath(const std::wstring& pref_locale) {
FilePath locale_path;
PathService::Get(app::DIR_LOCALES, &locale_path);
const std::string app_locale = l10n_util::GetApplicationLocale(pref_locale);
if (app_locale.empty())
return FilePath();
return locale_path.AppendASCII(app_locale + ".dll");
}
void ResourceBundle::LoadThemeResources() {
DCHECK(NULL == theme_data_) << "theme dll already loaded";
FilePath theme_data_path;
PathService::Get(app::DIR_THEMES, &theme_data_path);
theme_data_path = theme_data_path.AppendASCII("default.dll");
// The dll should only have resources, not executable code.
theme_data_ = LoadLibraryEx(theme_data_path.value().c_str(), NULL,
GetDataDllLoadFlags());
DCHECK(theme_data_ != NULL) << "unable to load " << theme_data_path.value();
}
/* static */
bool ResourceBundle::LoadResourceBytes(
DataHandle module,
int resource_id,
std::vector<unsigned char>* bytes) {
void* data_ptr;
size_t data_size;
if (base::GetDataResourceFromModule(module, resource_id, &data_ptr,
&data_size)) {
bytes->resize(data_size);
memcpy(&(bytes->front()), data_ptr, data_size);
return true;
} else {
return false;
}
}
HICON ResourceBundle::LoadThemeIcon(int icon_id) {
return ::LoadIcon(theme_data_, MAKEINTRESOURCE(icon_id));
}
base::StringPiece ResourceBundle::GetRawDataResource(int resource_id) {
void* data_ptr;
size_t data_size;
if (base::GetDataResourceFromModule(_AtlBaseModule.GetModuleInstance(),
resource_id,
&data_ptr,
&data_size)) {
return base::StringPiece(static_cast<const char*>(data_ptr), data_size);
} else if (locale_resources_data_ &&
base::GetDataResourceFromModule(locale_resources_data_,
resource_id,
&data_ptr,
&data_size)) {
return base::StringPiece(static_cast<const char*>(data_ptr), data_size);
}
return base::StringPiece();
}
// Loads and returns a cursor from the current module.
HCURSOR ResourceBundle::LoadCursor(int cursor_id) {
return ::LoadCursor(_AtlBaseModule.GetModuleInstance(),
MAKEINTRESOURCE(cursor_id));
}
string16 ResourceBundle::GetLocalizedString(int message_id) {
// If for some reason we were unable to load a resource dll, return an empty
// string (better than crashing).
if (!locale_resources_data_) {
StackTrace().PrintBacktrace(); // See http://crbug.com/21925.
LOG(WARNING) << "locale resources are not loaded";
return string16();
}
DCHECK(IS_INTRESOURCE(message_id));
// Get a reference directly to the string resource.
HINSTANCE hinstance = locale_resources_data_;
const ATLSTRINGRESOURCEIMAGE* image = AtlGetStringResourceImage(hinstance,
message_id);
if (!image) {
// Fall back on the current module (shouldn't be any strings here except
// in unittests).
image = AtlGetStringResourceImage(_AtlBaseModule.GetModuleInstance(),
message_id);
if (!image) {
StackTrace().PrintBacktrace(); // See http://crbug.com/21925.
NOTREACHED() << "unable to find resource: " << message_id;
return std::wstring();
}
}
// Copy into a string16 and return.
return string16(image->achString, image->nLength);
}
|
Print a stacktrace when we can't find a string resource (on Windows).
|
Print a stacktrace when we can't find a string resource (on Windows).
This should help debug the linked bug, or at least rule out some possibilities.
TEST=none
BUG=21925
Review URL: http://codereview.chromium.org/196132
git-svn-id: dd90618784b6a4b323ea0c23a071cb1c9e6f2ac7@26297 4ff67af0-8c30-449e-8e8b-ad334ec8d88c
|
C++
|
bsd-3-clause
|
wistoch/meego-app-browser,wistoch/meego-app-browser,wistoch/meego-app-browser,wistoch/meego-app-browser,wistoch/meego-app-browser,wistoch/meego-app-browser,wistoch/meego-app-browser,wistoch/meego-app-browser,wistoch/meego-app-browser,wistoch/meego-app-browser
|
bf092a8d8414cdd302bca07ad356d4d2b97ccfdd
|
lib/tests/ut_dcpappletdb/ut_dcpappletdb.cpp
|
lib/tests/ut_dcpappletdb/ut_dcpappletdb.cpp
|
#include <QObject>
#include <QGraphicsSceneMouseEvent>
#include <QDir>
#include <QMap>
#include "dcpappletdb.h"
#include "dcpappletmetadata.h"
#include "ut_dcpappletdb.h"
// mocking DcpAppletMetadata functions
static QMap<const DcpAppletMetadata *, int> appletStat;
void DcpAppletMetadata::slotClicked()
{
++appletStat[this];
}
int DcpAppletMetadata::usage() const
{
return appletStat.value(this);
}
///////////////////////////////////////////////////////////////
void Ut_DcpAppletDb::initTestCase()
{
static int c = 0;
static QByteArray arg("dummyarg");
char *argp = arg.data();
qap = new QCoreApplication(c, &argp);
QString dataDir(qApp->applicationDirPath() +
"/ut_dcpappletdb-data/");
emptyDesktopDir = dataDir + "emptyDesktopDir/"; // a non-existent dir
testDesktopDir = dataDir + "desktops/";
testDesktopDir2 = dataDir + "desktops2/";
testDesktopDir3 = dataDir + "desktops3/";
desktopTestFile = testDesktopDir+"test.desktop";
desktopTestFile2 = testDesktopDir+"test2.desktop";
desktopDateTimeFile = testDesktopDir2+"datetime.desktop";
desktopDisplayFile = testDesktopDir2+"display.desktop";
browserEntryName="Browser";
datetimeEntryName="Date & Time";
displayEntryName="Display";
}
void Ut_DcpAppletDb::cleanupTestCase()
{
delete qap;
}
void Ut_DcpAppletDb::init()
{
QVERIFY((m_subject=DcpAppletDb::initInstance(emptyDesktopDir)));
}
void Ut_DcpAppletDb::cleanup()
{
DcpAppletDb::destroy();
}
void Ut_DcpAppletDb::testCreateAndDestroy()
{
if (QTest::currentTestFailed()) return;
}
void Ut_DcpAppletDb::testInstance()
{
if (QTest::currentTestFailed()) return;
QVERIFY((m_subject==DcpAppletDb::instance()));
}
void Ut_DcpAppletDb::testAddContainNameFile()
{
if (QTest::currentTestFailed()) return;
QVERIFY(!m_subject->containsFile(desktopTestFile));
QVERIFY(m_subject->addFile(desktopTestFile));
QVERIFY(m_subject->containsFile(desktopTestFile));
QVERIFY(!m_subject->addFile(desktopTestFile));
/* this test was commented out because current implementation
* requires that two applets with same name can be loaded.
* eg. display language for controlpanel and for suw */
// QVERIFY(!m_subject->addFile(desktopTestFile2));
QVERIFY(m_subject->containsName(browserEntryName));
QVERIFY(!m_subject->containsName(browserEntryName)+"x");
}
void Ut_DcpAppletDb::testAddPath()
{
if (QTest::currentTestFailed()) return;
QVERIFY(m_subject->addPath(testDesktopDir2));
QVERIFY(m_subject->containsFile(desktopDateTimeFile));
QVERIFY(m_subject->containsFile(desktopDisplayFile));
}
void Ut_DcpAppletDb::testAppletNames()
{
if (QTest::currentTestFailed()) return;
QVERIFY(m_subject->addPath(testDesktopDir2));
QVERIFY(m_subject->appletNames().length()==2);
QVERIFY(m_subject->appletNames().contains(datetimeEntryName));
QVERIFY(m_subject->appletNames().contains(displayEntryName));
}
void Ut_DcpAppletDb::testApplet()
{
if (QTest::currentTestFailed()) return;
QVERIFY(m_subject->addPath(testDesktopDir2));
QWARN("\n\t ---- Expected QWARN : No such applet: 'xxx' ----");
QVERIFY(m_subject->applet(displayEntryName));
QVERIFY(m_subject->applet(datetimeEntryName));
QVERIFY(!m_subject->applet("xxx"));
}
void Ut_DcpAppletDb::testEraseEntry()
{
if (QTest::currentTestFailed()) return;
DcpAppletMetadata *metadata;
QVERIFY(m_subject->addPath(testDesktopDir2));
QVERIFY(m_subject->appletNames().length()==2);
QVERIFY((metadata=m_subject->applet(datetimeEntryName)));
m_subject->eraseEntry(metadata);
QVERIFY(m_subject->appletNames().length()==1);
}
void Ut_DcpAppletDb::testListByCategory()
{
if (QTest::currentTestFailed()) return;
QVERIFY(m_subject->addPath(testDesktopDir3));
QVERIFY(m_subject->listByCategory("Application").length()==1);
QVERIFY(m_subject->listByCategory("Connectivity").length()==1);
QVERIFY(m_subject->listByCategory("Device utilities").length()==1);
QVERIFY(m_subject->listByCategory("Look & Feel").length()==3);
QVERIFY(m_subject->listByCategory("Regional settings").length()==3);
QVERIFY(m_subject->listByCategory("Sound").length()==2);
QVERIFY(m_subject->listByCategory("Startup").length()==4);
}
void Ut_DcpAppletDb::testListMostUsed()
{
m_subject->addPath(testDesktopDir3);
DcpAppletMetadataList applets = m_subject->list();
const int maxN = 10;
int n = 0;
for (DcpAppletMetadataList::iterator iter = applets.begin();
iter != applets.end() && n < maxN; ++iter) {
// "activate" applet n times
for (int i = 0; i < n; ++i) {
(*iter)->slotClicked();
}
++n;
}
// most used list shall reverse the first n applets in the list
DcpAppletMetadataList mostUsed = m_subject->listMostUsed();
DcpAppletMetadataList::iterator orig = applets.begin() + n - 1;
for (DcpAppletMetadataList::iterator iter = mostUsed.begin();
iter != mostUsed.end() && orig != applets.end(); ++iter) {
QCOMPARE(*iter, *orig);
--orig;
}
}
void Ut_DcpAppletDb::testRefresh()
{
if (QTest::currentTestFailed()) return;
QSKIP("!!!! Some things are missing, waiting for Lgal !!!!",SkipSingle);
}
QTEST_APPLESS_MAIN(Ut_DcpAppletDb)
|
#include <QObject>
#include <QGraphicsSceneMouseEvent>
#include <QDir>
#include <QMap>
#include "dcpappletdb.h"
#include "dcpappletmetadata.h"
#include "ut_dcpappletdb.h"
// mocking DcpAppletMetadata functions
static QMap<const DcpAppletMetadata *, int> appletStat;
void DcpAppletMetadata::slotClicked()
{
++appletStat[this];
}
int DcpAppletMetadata::usage() const
{
return appletStat.value(this);
}
///////////////////////////////////////////////////////////////
void Ut_DcpAppletDb::initTestCase()
{
static int c = 0;
static QByteArray arg("dummyarg");
char *argp = arg.data();
qap = new QCoreApplication(c, &argp);
QString dataDir(qApp->applicationDirPath() +
"/ut_dcpappletdb-data/");
emptyDesktopDir = dataDir + "emptyDesktopDir/"; // a non-existent dir
testDesktopDir = dataDir + "desktops/";
testDesktopDir2 = dataDir + "desktops2/";
testDesktopDir3 = dataDir + "desktops3/";
desktopTestFile = testDesktopDir+"test.desktop";
desktopTestFile2 = testDesktopDir+"test2.desktop";
desktopDateTimeFile = testDesktopDir2+"datetime.desktop";
desktopDisplayFile = testDesktopDir2+"display.desktop";
browserEntryName="Browser";
datetimeEntryName="Date & Time";
displayEntryName="Display";
}
void Ut_DcpAppletDb::cleanupTestCase()
{
delete qap;
}
void Ut_DcpAppletDb::init()
{
QVERIFY((m_subject=DcpAppletDb::initInstance(emptyDesktopDir)));
}
void Ut_DcpAppletDb::cleanup()
{
DcpAppletDb::destroy();
}
void Ut_DcpAppletDb::testCreateAndDestroy()
{
if (QTest::currentTestFailed()) return;
}
void Ut_DcpAppletDb::testInstance()
{
if (QTest::currentTestFailed()) return;
QVERIFY((m_subject==DcpAppletDb::instance()));
}
void Ut_DcpAppletDb::testAddContainNameFile()
{
if (QTest::currentTestFailed()) return;
QVERIFY(!m_subject->containsFile(desktopTestFile));
QVERIFY(m_subject->addFile(desktopTestFile));
QVERIFY(m_subject->containsFile(desktopTestFile));
QVERIFY(!m_subject->addFile(desktopTestFile));
/* this test was commented out because current implementation
* requires that two applets with same name can be loaded.
* eg. display language for controlpanel and for suw */
// QVERIFY(!m_subject->addFile(desktopTestFile2));
QVERIFY(m_subject->containsName(browserEntryName));
QVERIFY(!m_subject->containsName(browserEntryName)+"x");
}
void Ut_DcpAppletDb::testAddPath()
{
if (QTest::currentTestFailed()) return;
QVERIFY(m_subject->addPath(testDesktopDir2));
QVERIFY(m_subject->containsFile(desktopDateTimeFile));
QVERIFY(m_subject->containsFile(desktopDisplayFile));
}
void Ut_DcpAppletDb::testAppletNames()
{
if (QTest::currentTestFailed()) return;
QVERIFY(m_subject->addPath(testDesktopDir2));
QVERIFY(m_subject->appletNames().length()==2);
QVERIFY(m_subject->appletNames().contains(datetimeEntryName));
QVERIFY(m_subject->appletNames().contains(displayEntryName));
}
void Ut_DcpAppletDb::testApplet()
{
if (QTest::currentTestFailed()) return;
QVERIFY(m_subject->addPath(testDesktopDir2));
QWARN("\n\t ---- Expected QWARN : No such applet: 'xxx' ----");
QVERIFY(m_subject->applet(displayEntryName));
QVERIFY(m_subject->applet(datetimeEntryName));
QVERIFY(!m_subject->applet("xxx"));
}
void Ut_DcpAppletDb::testEraseEntry()
{
if (QTest::currentTestFailed()) return;
DcpAppletMetadata *metadata;
QVERIFY(m_subject->addPath(testDesktopDir2));
QVERIFY(m_subject->appletNames().length()==2);
QVERIFY((metadata=m_subject->applet(datetimeEntryName)));
m_subject->eraseEntry(metadata);
QVERIFY(m_subject->appletNames().length()==1);
}
void Ut_DcpAppletDb::testListByCategory()
{
if (QTest::currentTestFailed()) return;
QVERIFY(m_subject->addPath(testDesktopDir3));
QVERIFY(m_subject->listByCategory("Application").length()==1);
QVERIFY(m_subject->listByCategory("Connectivity").length()==1);
QVERIFY(m_subject->listByCategory("Device utilities").length()==1);
QVERIFY(m_subject->listByCategory("Look & Feel").length()==3);
QVERIFY(m_subject->listByCategory("Regional settings").length()==3);
QVERIFY(m_subject->listByCategory("Sound").length()==2);
QVERIFY(m_subject->listByCategory("Startup").length()==4);
}
void Ut_DcpAppletDb::testListMostUsed()
{
m_subject->addPath(testDesktopDir3);
DcpAppletMetadataList applets = m_subject->list();
const int maxN = 10;
int n = 0;
for (DcpAppletMetadataList::iterator iter = applets.begin();
iter != applets.end() && n < maxN; ++iter) {
// "activate" applet n times
for (int i = 0; i < n; ++i) {
(*iter)->slotClicked();
}
++n;
}
// most used list shall reverse the first maxN applets in the list
DcpAppletMetadataList mostUsed = m_subject->listMostUsed();
DcpAppletMetadataList::iterator orig = applets.begin() + n - 1;
for (DcpAppletMetadataList::iterator iter = mostUsed.begin();
iter != mostUsed.end() && orig != applets.end(); ++iter) {
QCOMPARE(*iter, *orig);
--orig;
}
}
void Ut_DcpAppletDb::testRefresh()
{
if (QTest::currentTestFailed()) return;
QSKIP("!!!! Some things are missing, waiting for Lgal !!!!",SkipSingle);
}
QTEST_APPLESS_MAIN(Ut_DcpAppletDb)
|
make comment clearer
|
make comment clearer
|
C++
|
lgpl-2.1
|
arcean/controlpanel,harmattan/meegotouch-controlpanel,arcean/controlpanel,harmattan/meegotouch-controlpanel,harmattan/meegotouch-controlpanel,arcean/controlpanel,arcean/controlpanel,arcean/controlpanel,harmattan/meegotouch-controlpanel
|
3b736c7f5982a01d7f30f8c2904c2da280b06dad
|
libqimessaging/qt/src/qitransportsocket.cpp
|
libqimessaging/qt/src/qitransportsocket.cpp
|
/*
** Author(s):
** - Laurent LEC <[email protected]>
**
** Copyright (C) 2012 Aldebaran Robotics
*/
#include <qi/log.hpp>
#include <qimessaging/qt/QiTransportSocket>
#include "src/qitransportsocket_p.h"
#include <QTcpSocket>
#include <QHostAddress>
#include <qimessaging/message.hpp>
#include <qimessaging/buffer.hpp>
#include "../src/message_p.hpp"
QiTransportSocketPrivate::QiTransportSocketPrivate(QiTransportSocket* self)
: _self(self)
, _device(0)
, _msg(0)
{
}
QiTransportSocketPrivate::~QiTransportSocketPrivate()
{
if (_msg)
{
delete _msg;
}
foreach (qi::Message* msg, _pendingMessages)
{
delete msg;
}
delete _device;
}
void QiTransportSocketPrivate::read()
{
while (true)
{
if (_msg == 0)
{
_msg = new qi::Message();
_readHdr = true;
}
if (_readHdr)
{
if (_device->bytesAvailable() >= sizeof(qi::MessagePrivate::MessageHeader))
{
_device->read(static_cast<char*>(_msg->_p->getHeader()),
sizeof(qi::MessagePrivate::MessageHeader));
if (!_msg->isValid())
{
qiLogError("QiTransportSocket") << "incorrect message, dropped";
// TODO: implement error recovery...
return;
}
_readHdr = false;
}
else
{
break;
}
}
if (!_readHdr)
{
qint64 bufferSize = static_cast<qi::MessagePrivate::MessageHeader*>(_msg->_p->getHeader())->size;
if (_device->bytesAvailable() >= bufferSize)
{
qi::Buffer buffer;
buffer.reserve(bufferSize);
_msg->setBuffer(buffer);
_device->read(static_cast<char*>(buffer.data()), bufferSize);
_pendingMessages.append(_msg);
_readHdr = true;
emit readyRead();
}
else
{
break;
}
}
}
}
QiTransportSocket::QiTransportSocket(QObject *parent)
: QObject(parent)
, _p(new QiTransportSocketPrivate(this))
{
connect(_p, SIGNAL(readyRead()), this, SIGNAL(readyRead()));
}
QiTransportSocket::~QiTransportSocket()
{
close();
delete _p;
}
void QiTransportSocket::close()
{
if (_p->_device)
{
_p->_device->close();
}
}
void QiTransportSocket::write(const qi::Message& message)
{
qint64 writtenSize = 0;
message._p->complete();
writtenSize = _p->_device->write(static_cast<char*>(message._p->getHeader()),
sizeof(qi::MessagePrivate::MessageHeader));
if (writtenSize != sizeof(qi::MessagePrivate::MessageHeader))
{
qiLogError("QiTransportSocket") << "write error, (" << writtenSize << ")" << _p->_device->errorString().toUtf8().constData();
}
writtenSize = _p->_device->write(static_cast<char*>(message._p->buffer.data()),
message._p->buffer.size());
if (writtenSize != message._p->buffer.size())
{
qiLogError("QiTransportSocket") << "write error, (" << writtenSize << ")";
}
}
qi::Message *QiTransportSocket::read()
{
return _p->_pendingMessages.empty() ? 0 : _p->_pendingMessages.dequeue();
}
void QiTransportSocket::connectToHost(const QUrl& address)
{
if (address.scheme() == "tcp")
{
QTcpSocket* socket = new QTcpSocket(this);
connect(socket, SIGNAL(connected()), this, SIGNAL(connected()));
connect(socket, SIGNAL(disconnected()), this, SIGNAL(disconnected()));
connect(socket, SIGNAL(readyRead()), _p, SLOT(read()));
QHostAddress host(address.host());
socket->connectToHost(host, address.port());
_p->_peer = address;
_p->_device = socket;
}
}
QUrl QiTransportSocket::peer()
{
return _p->_peer;
}
QiTransportSocket::SocketState QiTransportSocket::state() const
{
if (!_p->_device)
{
return SocketState_Unconnected;
}
/*
* This function must return a SocketState, which is mirroring the values
* of QAbstractSocket.
* If the socket is a QAbstractSocket, we can directly return the state
* given by the API.
*/
QAbstractSocket *socket;
if ((socket = dynamic_cast<QAbstractSocket*>(_p->_device)))
{
return static_cast<SocketState>(socket->state());
}
/*
* Just in case...
*/
return SocketState_Unknown;
}
|
/*
** Author(s):
** - Laurent LEC <[email protected]>
**
** Copyright (C) 2012 Aldebaran Robotics
*/
#include <qi/log.hpp>
#include <qimessaging/qt/QiTransportSocket>
#include "src/qitransportsocket_p.h"
#include <QTcpSocket>
#include <QHostAddress>
#include <qimessaging/message.hpp>
#include <qimessaging/buffer.hpp>
#include "../src/message_p.hpp"
QiTransportSocketPrivate::QiTransportSocketPrivate(QiTransportSocket* self)
: _self(self)
, _device(0)
, _msg(0)
{
}
QiTransportSocketPrivate::~QiTransportSocketPrivate()
{
if (_msg)
{
delete _msg;
_msg = 0;
}
foreach (qi::Message* msg, _pendingMessages)
{
delete msg;
msg = 0;
}
delete _device;
_device = 0;
}
void QiTransportSocketPrivate::read()
{
while (true)
{
if (_msg == 0)
{
_msg = new qi::Message();
_readHdr = true;
}
if (_readHdr)
{
if (_device->bytesAvailable() >= sizeof(qi::MessagePrivate::MessageHeader))
{
_device->read(static_cast<char*>(_msg->_p->getHeader()),
sizeof(qi::MessagePrivate::MessageHeader));
if (!_msg->isValid())
{
qiLogError("QiTransportSocket") << "incorrect message, dropped";
// TODO: implement error recovery...
return;
}
_readHdr = false;
}
else
{
break;
}
}
if (!_readHdr)
{
qint64 bufferSize = static_cast<qi::MessagePrivate::MessageHeader*>(_msg->_p->getHeader())->size;
if (_device->bytesAvailable() >= bufferSize)
{
qi::Buffer buffer;
buffer.reserve(bufferSize);
_msg->setBuffer(buffer);
_device->read(static_cast<char*>(buffer.data()), bufferSize);
_pendingMessages.append(_msg);
_readHdr = true;
_msg = 0;
emit readyRead();
}
else
{
break;
}
}
}
}
QiTransportSocket::QiTransportSocket(QObject *parent)
: QObject(parent)
, _p(new QiTransportSocketPrivate(this))
{
connect(_p, SIGNAL(readyRead()), this, SIGNAL(readyRead()));
}
QiTransportSocket::~QiTransportSocket()
{
close();
delete _p;
}
void QiTransportSocket::close()
{
if (_p->_device)
{
_p->_device->close();
}
}
void QiTransportSocket::write(const qi::Message& message)
{
qint64 writtenSize = 0;
message._p->complete();
writtenSize = _p->_device->write(static_cast<char*>(message._p->getHeader()),
sizeof(qi::MessagePrivate::MessageHeader));
if (writtenSize != sizeof(qi::MessagePrivate::MessageHeader))
{
qiLogError("QiTransportSocket") << "write error, (" << writtenSize << ")" << _p->_device->errorString().toUtf8().constData();
}
writtenSize = _p->_device->write(static_cast<char*>(message._p->buffer.data()),
message._p->buffer.size());
if (writtenSize != message._p->buffer.size())
{
qiLogError("QiTransportSocket") << "write error, (" << writtenSize << ")";
}
}
qi::Message *QiTransportSocket::read()
{
return _p->_pendingMessages.empty() ? 0 : _p->_pendingMessages.dequeue();
}
void QiTransportSocket::connectToHost(const QUrl& address)
{
if (address.scheme() == "tcp")
{
QTcpSocket* socket = new QTcpSocket(this);
connect(socket, SIGNAL(connected()), this, SIGNAL(connected()));
connect(socket, SIGNAL(disconnected()), this, SIGNAL(disconnected()));
connect(socket, SIGNAL(readyRead()), _p, SLOT(read()));
QHostAddress host(address.host());
socket->connectToHost(host, address.port());
_p->_peer = address;
_p->_device = socket;
}
}
QUrl QiTransportSocket::peer()
{
return _p->_peer;
}
QiTransportSocket::SocketState QiTransportSocket::state() const
{
if (!_p->_device)
{
return SocketState_Unconnected;
}
/*
* This function must return a SocketState, which is mirroring the values
* of QAbstractSocket.
* If the socket is a QAbstractSocket, we can directly return the state
* given by the API.
*/
QAbstractSocket *socket;
if ((socket = dynamic_cast<QAbstractSocket*>(_p->_device)))
{
return static_cast<SocketState>(socket->state());
}
/*
* Just in case...
*/
return SocketState_Unknown;
}
|
Fix segfault
|
Fix segfault
Change-Id: I3c43e4f13fbcdeeea0dd55c65d574fb143f59924
Reviewed-on: http://gerrit.aldebaran.lan:8080/4777
Reviewed-by: llec <[email protected]>
Tested-by: llec <[email protected]>
|
C++
|
bsd-3-clause
|
aldebaran/libqi,aldebaran/libqi-java,bsautron/libqi,aldebaran/libqi-java,vbarbaresi/libqi,aldebaran/libqi-java,aldebaran/libqi,aldebaran/libqi
|
2cc735baef23bfdb69c610c99d5e6a4b905ea8ef
|
tests/api/operations_test.cpp
|
tests/api/operations_test.cpp
|
/*******************************************************************************
* tests/api/operations_test.cpp
*
* Part of Project c7a.
*
*
* This file has no license. Only Chuck Norris can compile it.
******************************************************************************/
#include <c7a/api/dia_base.hpp>
#include <c7a/net/endpoint.hpp>
#include <c7a/core/job_manager.hpp>
#include <c7a/core/stage_builder.hpp>
#include <c7a/api/dia.hpp>
#include <c7a/api/reduce_node.hpp>
#include <c7a/api/sum_node.hpp>
#include <c7a/api/bootstrap.hpp>
#include <algorithm>
#include <random>
#include "gtest/gtest.h"
using namespace c7a::core;
using namespace c7a::net;
TEST(Operations, GenerateFromFileCorrectAmountOfCorrectIntegers) {
using c7a::Context;
Context ctx;
std::vector<std::string> self = { "127.0.0.1:1234" };
ctx.job_manager().Connect(0, Endpoint::ParseEndpointList(self));
std::random_device random_device;
std::default_random_engine generator(random_device());
std::uniform_int_distribution<int> distribution(1000, 10000);
size_t generate_size = distribution(generator);
auto input = GenerateFromFile(
ctx,
"test1",
[](const std::string& line) {
return std::stoi(line);
},
generate_size);
size_t writer_size = 0;
input.WriteToFileSystem("test1.out",
[&writer_size](const int& item) {
//file contains ints between 1 and 15
//fails if wrong integer is generated
EXPECT_GE(item, 1);
EXPECT_GE(16, item);
writer_size++;
return std::to_string(item);
});
ASSERT_EQ(generate_size, writer_size);
}
TEST(Operations, ReadAndAllGatherElementsCorrect) {
std::random_device random_device;
std::default_random_engine generator(random_device());
std::uniform_int_distribution<int> distribution(2, 4);
size_t workers = distribution(generator);
size_t port_base = 8080;
std::function<void(c7a::Context&)> start_func = [](c7a::Context& ctx) {
auto integers = ReadLines(
ctx,
"test1",
[](const std::string& line) {
return std::stoi(line);
});
std::vector<int> out_vec;
integers.AllGather(&out_vec);
std::sort(out_vec.begin(), out_vec.end());
int i = 1;
for (int element : out_vec) {
ASSERT_EQ(element, i++);
}
ASSERT_EQ((size_t) 16, out_vec.size());
};
c7a::ExecuteThreads(workers, port_base, start_func);
}
TEST(Operations, MapResultsCorrectChangingType) {
std::random_device random_device;
std::default_random_engine generator(random_device());
std::uniform_int_distribution<int> distribution(2, 4);
size_t workers = distribution(generator);
size_t port_base = 8080;
std::function<void(c7a::Context&)> start_func = [](c7a::Context& ctx) {
auto integers = ReadLines(
ctx,
"test1",
[](const std::string& line) {
return std::stoi(line);
});
std::function<double(int)> double_elements = [](int in) {
return (double) 2 * in;
};
auto doubled = integers.Map(double_elements);
std::vector<double> out_vec;
doubled.AllGather(&out_vec);
std::sort(out_vec.begin(), out_vec.end());
int i = 1;
for (int element : out_vec) {
ASSERT_DOUBLE_EQ(element, (i++ * 2));
}
ASSERT_EQ((size_t) 16, out_vec.size());
};
c7a::ExecuteThreads(workers, port_base, start_func);
}
TEST(Operations, FlatMapResultsCorrectChangingType) {
std::random_device random_device;
std::default_random_engine generator(random_device());
std::uniform_int_distribution<int> distribution(2, 4);
size_t workers = distribution(generator);
size_t port_base = 8080;
std::function<void(c7a::Context&)> start_func = [](c7a::Context& ctx) {
auto integers = ReadLines(
ctx,
"test1",
[](const std::string& line) {
return std::stoi(line);
});
auto flatmap_double = [](int in, auto emit) {
emit((double) 2 * in);
emit((double) 2 * (in + 16));
};
auto doubled = integers.FlatMap(flatmap_double);
std::vector<int> out_vec;
doubled.AllGather(&out_vec);
std::sort(out_vec.begin(), out_vec.end());
int i = 1;
for (int element : out_vec) {
ASSERT_DOUBLE_EQ(element, (i++ * 2));
}
ASSERT_EQ((size_t) 32, out_vec.size());
};
c7a::ExecuteThreads(workers, port_base, start_func);
}
TEST(Operations, FilterResultsCorrectly) {
std::random_device random_device;
std::default_random_engine generator(random_device());
std::uniform_int_distribution<int> distribution(2, 4);
size_t workers = distribution(generator);
size_t port_base = 8080;
std::function<void(c7a::Context&)> start_func = [](c7a::Context& ctx) {
auto integers = ReadLines(
ctx,
"test1",
[](const std::string& line) {
return std::stoi(line);
});
std::function<double(int)> even = [](int in) {
return (in % 2 == 0);
};
auto doubled = integers.Filter(even);
std::vector<int> out_vec;
doubled.AllGather(&out_vec);
std::sort(out_vec.begin(), out_vec.end());
int i = 1;
for (int element : out_vec) {
ASSERT_DOUBLE_EQ(element, (i++ * 2));
}
ASSERT_EQ((size_t) 8, out_vec.size());
};
c7a::ExecuteThreads(workers, port_base, start_func);
}
TEST(Operations, ReduceModulo2CorrectResults) {
std::random_device random_device;
std::default_random_engine generator(random_device());
std::uniform_int_distribution<int> distribution(2, 4);
size_t workers = distribution(generator);
size_t port_base = 8080;
std::function<void(c7a::Context&)> start_func = [](c7a::Context& ctx) {
auto integers = ReadLines(
ctx,
"test1",
[](const std::string& line) {
return std::stoi(line);
});
auto modulo_two = [](int in) {
return (in / 2);
};
auto add_function = [](int in1, int in2) {
return in1 + in2;
};
auto reduced = integers.ReduceBy(modulo_two, add_function);
std::vector<int> out_vec;
std::cout << "starting" << std::endl;
reduced.AllGather(&out_vec);
std::cout << "testing" << std::endl;
std::sort(out_vec.begin(), out_vec.end());
std::cout << "[";
for (int element : out_vec) {
std::cout << element << ",";
}
std::cout<<"]"<<std::endl;
int i = 1;
for (int element : out_vec) {
ASSERT_EQ(element, 56 + (8 * i++));
}
ASSERT_EQ((size_t) 2, out_vec.size());
};
c7a::ExecuteThreads(workers, port_base, start_func);
}
TEST(Operations, DISABLED_GenerateAndSumHaveEqualAmount) {
std::random_device random_device;
std::default_random_engine generator(random_device());
std::uniform_int_distribution<int> distribution(2, 4);
size_t workers = distribution(generator);
size_t port_base = 8080;
std::uniform_int_distribution<int> distribution2(1000, 10000);
size_t generate_size = distribution2(generator);
std::function<void(c7a::Context&)> start_func = [generate_size](c7a::Context& ctx) {
auto input = GenerateFromFile(
ctx,
"test1",
[](const std::string& line) {
return std::stoi(line);
},
generate_size);
auto ones = input.Map([](int){
return 1;
});
auto add_function = [](int in1, int in2) {
return in1 + in2;
};
ASSERT_EQ((int) generate_size, ones.Sum(add_function));
};
c7a::ExecuteThreads(workers, port_base, start_func);
}
/******************************************************************************/
|
/*******************************************************************************
* tests/api/operations_test.cpp
*
* Part of Project c7a.
*
*
* This file has no license. Only Chuck Norris can compile it.
******************************************************************************/
#include <c7a/api/dia_base.hpp>
#include <c7a/net/endpoint.hpp>
#include <c7a/core/job_manager.hpp>
#include <c7a/core/stage_builder.hpp>
#include <c7a/api/dia.hpp>
#include <c7a/api/reduce_node.hpp>
#include <c7a/api/sum_node.hpp>
#include <c7a/api/bootstrap.hpp>
#include <algorithm>
#include <random>
#include "gtest/gtest.h"
using namespace c7a::core;
using namespace c7a::net;
TEST(Operations, GenerateFromFileCorrectAmountOfCorrectIntegers) {
using c7a::Context;
Context ctx;
std::vector<std::string> self = { "127.0.0.1:1234" };
ctx.job_manager().Connect(0, Endpoint::ParseEndpointList(self));
std::random_device random_device;
std::default_random_engine generator(random_device());
std::uniform_int_distribution<int> distribution(1000, 10000);
size_t generate_size = distribution(generator);
auto input = GenerateFromFile(
ctx,
"test1",
[](const std::string& line) {
return std::stoi(line);
},
generate_size);
size_t writer_size = 0;
input.WriteToFileSystem("test1.out",
[&writer_size](const int& item) {
//file contains ints between 1 and 15
//fails if wrong integer is generated
EXPECT_GE(item, 1);
EXPECT_GE(16, item);
writer_size++;
return std::to_string(item);
});
ASSERT_EQ(generate_size, writer_size);
}
TEST(Operations, ReadAndAllGatherElementsCorrect) {
std::random_device random_device;
std::default_random_engine generator(random_device());
std::uniform_int_distribution<int> distribution(2, 4);
size_t workers = distribution(generator);
size_t port_base = 8080;
std::function<void(c7a::Context&)> start_func = [](c7a::Context& ctx) {
auto integers = ReadLines(
ctx,
"test1",
[](const std::string& line) {
return std::stoi(line);
});
std::vector<int> out_vec;
integers.AllGather(&out_vec);
std::sort(out_vec.begin(), out_vec.end());
int i = 1;
for (int element : out_vec) {
ASSERT_EQ(element, i++);
}
ASSERT_EQ((size_t) 16, out_vec.size());
};
c7a::ExecuteThreads(workers, port_base, start_func);
}
TEST(Operations, MapResultsCorrectChangingType) {
std::random_device random_device;
std::default_random_engine generator(random_device());
std::uniform_int_distribution<int> distribution(2, 4);
size_t workers = distribution(generator);
size_t port_base = 8080;
std::function<void(c7a::Context&)> start_func = [](c7a::Context& ctx) {
auto integers = ReadLines(
ctx,
"test1",
[](const std::string& line) {
return std::stoi(line);
});
std::function<double(int)> double_elements = [](int in) {
return (double) 2 * in;
};
auto doubled = integers.Map(double_elements);
std::vector<double> out_vec;
doubled.AllGather(&out_vec);
std::sort(out_vec.begin(), out_vec.end());
int i = 1;
for (int element : out_vec) {
ASSERT_DOUBLE_EQ(element, (i++ * 2));
}
ASSERT_EQ((size_t) 16, out_vec.size());
};
c7a::ExecuteThreads(workers, port_base, start_func);
}
TEST(Operations, FlatMapResultsCorrectChangingType) {
std::random_device random_device;
std::default_random_engine generator(random_device());
std::uniform_int_distribution<int> distribution(2, 4);
size_t workers = distribution(generator);
size_t port_base = 8080;
std::function<void(c7a::Context&)> start_func = [](c7a::Context& ctx) {
auto integers = ReadLines(
ctx,
"test1",
[](const std::string& line) {
return std::stoi(line);
});
auto flatmap_double = [](int in, auto emit) {
emit((double) 2 * in);
emit((double) 2 * (in + 16));
};
auto doubled = integers.FlatMap(flatmap_double);
std::vector<int> out_vec;
doubled.AllGather(&out_vec);
std::sort(out_vec.begin(), out_vec.end());
int i = 1;
for (int element : out_vec) {
ASSERT_DOUBLE_EQ(element, (i++ * 2));
}
ASSERT_EQ((size_t) 32, out_vec.size());
};
c7a::ExecuteThreads(workers, port_base, start_func);
}
TEST(Operations, FilterResultsCorrectly) {
std::random_device random_device;
std::default_random_engine generator(random_device());
std::uniform_int_distribution<int> distribution(2, 4);
size_t workers = distribution(generator);
size_t port_base = 8080;
std::function<void(c7a::Context&)> start_func = [](c7a::Context& ctx) {
auto integers = ReadLines(
ctx,
"test1",
[](const std::string& line) {
return std::stoi(line);
});
std::function<double(int)> even = [](int in) {
return (in % 2 == 0);
};
auto doubled = integers.Filter(even);
std::vector<int> out_vec;
doubled.AllGather(&out_vec);
std::sort(out_vec.begin(), out_vec.end());
int i = 1;
for (int element : out_vec) {
ASSERT_DOUBLE_EQ(element, (i++ * 2));
}
ASSERT_EQ((size_t) 8, out_vec.size());
};
c7a::ExecuteThreads(workers, port_base, start_func);
}
TEST(Operations, DISABLED_ReduceModulo2CorrectResults) {
std::random_device random_device;
std::default_random_engine generator(random_device());
std::uniform_int_distribution<int> distribution(2, 4);
size_t workers = distribution(generator);
size_t port_base = 8080;
std::function<void(c7a::Context&)> start_func = [](c7a::Context& ctx) {
auto integers = ReadLines(
ctx,
"test1",
[](const std::string& line) {
return std::stoi(line);
});
auto modulo_two = [](int in) {
return (in / 2);
};
auto add_function = [](int in1, int in2) {
return in1 + in2;
};
auto reduced = integers.ReduceBy(modulo_two, add_function);
std::vector<int> out_vec;
std::cout << "starting" << std::endl;
reduced.AllGather(&out_vec);
std::cout << "testing" << std::endl;
std::sort(out_vec.begin(), out_vec.end());
std::cout << "[";
for (int element : out_vec) {
std::cout << element << ",";
}
std::cout<<"]"<<std::endl;
int i = 1;
for (int element : out_vec) {
ASSERT_EQ(element, 56 + (8 * i++));
}
ASSERT_EQ((size_t) 2, out_vec.size());
};
c7a::ExecuteThreads(workers, port_base, start_func);
}
TEST(Operations, DISABLED_GenerateAndSumHaveEqualAmount) {
std::random_device random_device;
std::default_random_engine generator(random_device());
std::uniform_int_distribution<int> distribution(2, 4);
size_t workers = distribution(generator);
size_t port_base = 8080;
std::uniform_int_distribution<int> distribution2(1000, 10000);
size_t generate_size = distribution2(generator);
std::function<void(c7a::Context&)> start_func = [generate_size](c7a::Context& ctx) {
auto input = GenerateFromFile(
ctx,
"test1",
[](const std::string& line) {
return std::stoi(line);
},
generate_size);
auto ones = input.Map([](int){
return 1;
});
auto add_function = [](int in1, int in2) {
return in1 + in2;
};
ASSERT_EQ((int) generate_size, ones.Sum(add_function));
};
c7a::ExecuteThreads(workers, port_base, start_func);
}
/******************************************************************************/
|
disable the test again
|
disable the test again
|
C++
|
bsd-2-clause
|
manpen/thrill,manpen/thrill,manpen/thrill,manpen/thrill,manpen/thrill
|
1d0b003312bce6556c5a9eacb55e8004fb6794c9
|
tests/check_serialization.cpp
|
tests/check_serialization.cpp
|
#include "toml.hpp"
#include <iostream>
#include <iomanip>
int main(int argc, char **argv)
{
if(argc != 2)
{
std::cerr << "usage: ./check [filename]" << std::endl;
return 1;
}
const std::string filename(argv[1]);
{
const auto data = toml::parse(filename);
{
std::ofstream ofs("tmp.toml");
ofs << std::setprecision(16) << std::setw(80) << data;
}
const auto serialized = toml::parse("tmp.toml");
if(data != serialized)
{
std::cerr << "============================================================\n";
std::cerr << "result (w/o comment) different: " << filename << std::endl;
std::cerr << "------------------------------------------------------------\n";
std::cerr << "# serialized\n";
std::cerr << serialized;
std::cerr << "------------------------------------------------------------\n";
std::cerr << "# data\n";
std::cerr << data;
return 1;
}
}
{
const auto data = toml::parse<toml::preserve_comments>(filename);
{
std::ofstream ofs("tmp.toml");
ofs << std::setprecision(16) << std::setw(80) << data;
}
const auto serialized = toml::parse<toml::preserve_comments>("tmp.toml");
if(data != serialized)
{
std::cerr << "============================================================\n";
std::cerr << "result (w/ comment) different: " << filename << std::endl;
std::cerr << "------------------------------------------------------------\n";
std::cerr << "# serialized\n";
std::cerr << serialized;
std::cerr << "------------------------------------------------------------\n";
std::cerr << "# data\n";
std::cerr << data;
return 1;
}
}
return 0;
}
|
#include "toml.hpp"
#include <iostream>
#include <iomanip>
int main(int argc, char **argv)
{
if(argc != 2)
{
std::cerr << "usage: ./check [filename]" << std::endl;
return 1;
}
const std::string filename(argv[1]);
{
const auto data = toml::parse(filename);
{
std::ofstream ofs("tmp.toml");
ofs << std::setprecision(16) << std::setw(80) << data;
}
const auto serialized = toml::parse("tmp.toml");
if(data != serialized)
{
// this is really a ditry hack, but is the easiest way...
// TODO: cleanup by adding comparison function to check if a value is NaN or not
if(filename.substr(filename.size() - 22, 22) == "float-inf-and-nan.toml" &&
std::isnan (toml::find<double>(serialized, "nan")) &&
!std::signbit (toml::find<double>(serialized, "nan")) &&
std::isnan (toml::find<double>(serialized, "nan_plus")) &&
!std::signbit (toml::find<double>(serialized, "nan_plus")) &&
std::isnan (toml::find<double>(serialized, "nan_neg")) &&
std::signbit (toml::find<double>(serialized, "nan_neg")) &&
!std::isnan (toml::find<double>(serialized, "infinity")) &&
!std::isfinite(toml::find<double>(serialized, "infinity")) &&
!std::signbit (toml::find<double>(serialized, "infinity")) &&
!std::isnan (toml::find<double>(serialized, "infinity_plus")) &&
!std::isfinite(toml::find<double>(serialized, "infinity_plus")) &&
!std::signbit (toml::find<double>(serialized, "infinity_plus")) &&
!std::isnan (toml::find<double>(serialized, "infinity_neg")) &&
!std::isfinite(toml::find<double>(serialized, "infinity_neg")) &&
std::signbit (toml::find<double>(serialized, "infinity_neg")))
{
// then it is correctly serialized.
// Note that, the result of (nan == nan) is false. so `data == serialized` is false.
}
else
{
std::cerr << "============================================================\n";
std::cerr << "result (w/o comment) different: " << filename << std::endl;
std::cerr << "------------------------------------------------------------\n";
std::cerr << "# serialized\n";
std::cerr << serialized;
std::cerr << "------------------------------------------------------------\n";
std::cerr << "# data\n";
std::cerr << data;
return 1;
}
}
}
{
const auto data = toml::parse<toml::preserve_comments>(filename);
{
std::ofstream ofs("tmp.toml");
ofs << std::setprecision(16) << std::setw(80) << data;
}
const auto serialized = toml::parse<toml::preserve_comments>("tmp.toml");
if(data != serialized)
{
// this is really a ditry hack, but is the easiest way...
// TODO: cleanup by adding comparison function to check if a value is NaN or not
if(filename.substr(filename.size() - 22, 22) == "float-inf-and-nan.toml" &&
std::isnan (toml::find<double>(serialized, "nan")) &&
!std::signbit (toml::find<double>(serialized, "nan")) &&
std::isnan (toml::find<double>(serialized, "nan_plus")) &&
!std::signbit (toml::find<double>(serialized, "nan_plus")) &&
std::isnan (toml::find<double>(serialized, "nan_neg")) &&
std::signbit (toml::find<double>(serialized, "nan_neg")) &&
!std::isnan (toml::find<double>(serialized, "infinity")) &&
!std::isfinite(toml::find<double>(serialized, "infinity")) &&
!std::signbit (toml::find<double>(serialized, "infinity")) &&
!std::isnan (toml::find<double>(serialized, "infinity_plus")) &&
!std::isfinite(toml::find<double>(serialized, "infinity_plus")) &&
!std::signbit (toml::find<double>(serialized, "infinity_plus")) &&
!std::isnan (toml::find<double>(serialized, "infinity_neg")) &&
!std::isfinite(toml::find<double>(serialized, "infinity_neg")) &&
std::signbit (toml::find<double>(serialized, "infinity_neg")) &&
toml::find(data, "nan").comments() == toml::find(serialized, "nan").comments() &&
toml::find(data, "nan_plus").comments() == toml::find(serialized, "nan_plus").comments() &&
toml::find(data, "nan_neg").comments() == toml::find(serialized, "nan_neg").comments() &&
toml::find(data, "infinity").comments() == toml::find(serialized, "infinity").comments() &&
toml::find(data, "infinity_plus").comments() == toml::find(serialized, "infinity_plus").comments() &&
toml::find(data, "infinity_neg").comments() == toml::find(serialized, "infinity_neg").comments() )
{
// then it is correctly serialized.
// Note that, the result of (nan == nan) is false. so `data == serialized` is false.
}
else
{
std::cerr << "============================================================\n";
std::cerr << "result (w/ comment) different: " << filename << std::endl;
std::cerr << "------------------------------------------------------------\n";
std::cerr << "# serialized\n";
std::cerr << serialized;
std::cerr << "------------------------------------------------------------\n";
std::cerr << "# data\n";
std::cerr << data;
return 1;
}
}
}
return 0;
}
|
add a patch to avoid nan comparison
|
ci: add a patch to avoid nan comparison
|
C++
|
mit
|
ToruNiina/toml11
|
b655fadff6ae58d2b62541441396dc8d57f9b086
|
core/meta/src/TClassGenerator.cxx
|
core/meta/src/TClassGenerator.cxx
|
// @(#)root/base:$Id$
// Author: Philippe Canal 24/06/2003
/*************************************************************************
* Copyright (C) 1995-2003, Rene Brun and Fons Rademakers. *
* All rights reserved. *
* *
* For the licensing terms see $ROOTSYS/LICENSE. *
* For the list of contributors see $ROOTSYS/README/CREDITS. *
*************************************************************************/
//////////////////////////////////////////////////////////////////////////
// //
// TClassGenerator //
// //
// Objects following this interface can be passed onto the TROOT object //
// to implement a user customized way to create the TClass objects. //
// //
// Use TROOT::AddClassGenerator to register a concrete instance. //
// //
//////////////////////////////////////////////////////////////////////////
#include "TClassGenerator.h"
ClassImp(TClassGenerator);
//////////////////////////////////////////////////////////////////////////
TClass *TClassGenerator::GetClass(const char* classname, Bool_t load, Bool_t silent)
{
// Default implementation for backward compatibility ignoring the value of 'silent'
return GetClass(classname,load);
}
//////////////////////////////////////////////////////////////////////////
TClass *TClassGenerator::GetClass(const type_info& typeinfo, Bool_t load, Bool_t silent)
{
// Default implementation for backward compatibility ignoring the value of 'silent'
return GetClass(typeinfo,load);
}
|
// @(#)root/base:$Id$
// Author: Philippe Canal 24/06/2003
/*************************************************************************
* Copyright (C) 1995-2003, Rene Brun and Fons Rademakers. *
* All rights reserved. *
* *
* For the licensing terms see $ROOTSYS/LICENSE. *
* For the list of contributors see $ROOTSYS/README/CREDITS. *
*************************************************************************/
//////////////////////////////////////////////////////////////////////////
// //
// TClassGenerator //
// //
// Objects following this interface can be passed onto the TROOT object //
// to implement a user customized way to create the TClass objects. //
// //
// Use TROOT::AddClassGenerator to register a concrete instance. //
// //
//////////////////////////////////////////////////////////////////////////
#include "TClassGenerator.h"
ClassImp(TClassGenerator);
//////////////////////////////////////////////////////////////////////////
TClass *TClassGenerator::GetClass(const char* classname, Bool_t load, Bool_t /* silent */)
{
// Default implementation for backward compatibility ignoring the value of 'silent'
return GetClass(classname,load);
}
//////////////////////////////////////////////////////////////////////////
TClass *TClassGenerator::GetClass(const type_info& typeinfo, Bool_t load, Bool_t /* silent */)
{
// Default implementation for backward compatibility ignoring the value of 'silent'
return GetClass(typeinfo,load);
}
|
Fix a compilation warning
|
Fix a compilation warning
git-svn-id: acec3fd5b7ea1eb9e79d6329d318e8118ee2e14f@30784 27541ba8-7e3a-0410-8455-c3a389f83636
|
C++
|
lgpl-2.1
|
georgtroska/root,cxx-hep/root-cern,pspe/root,gbitzes/root,ffurano/root5,esakellari/root,davidlt/root,CristinaCristescu/root,tc3t/qoot,esakellari/root,Duraznos/root,omazapa/root,krafczyk/root,Duraznos/root,satyarth934/root,strykejern/TTreeReader,mkret2/root,jrtomps/root,karies/root,bbockelm/root,gganis/root,omazapa/root,evgeny-boger/root,0x0all/ROOT,vukasinmilosevic/root,olifre/root,BerserkerTroll/root,veprbl/root,pspe/root,jrtomps/root,esakellari/my_root_for_test,satyarth934/root,smarinac/root,perovic/root,kirbyherm/root-r-tools,Y--/root,sawenzel/root,mattkretz/root,olifre/root,veprbl/root,CristinaCristescu/root,alexschlueter/cern-root,georgtroska/root,veprbl/root,mkret2/root,CristinaCristescu/root,dfunke/root,simonpf/root,arch1tect0r/root,georgtroska/root,vukasinmilosevic/root,sbinet/cxx-root,jrtomps/root,tc3t/qoot,sawenzel/root,CristinaCristescu/root,evgeny-boger/root,beniz/root,sirinath/root,gbitzes/root,gganis/root,dfunke/root,CristinaCristescu/root,agarciamontoro/root,esakellari/root,agarciamontoro/root,simonpf/root,perovic/root,davidlt/root,mkret2/root,lgiommi/root,krafczyk/root,pspe/root,sawenzel/root,gganis/root,tc3t/qoot,nilqed/root,georgtroska/root,sbinet/cxx-root,alexschlueter/cern-root,Dr15Jones/root,vukasinmilosevic/root,ffurano/root5,mkret2/root,esakellari/root,buuck/root,root-mirror/root,zzxuanyuan/root-compressor-dummy,krafczyk/root,krafczyk/root,pspe/root,sbinet/cxx-root,mattkretz/root,0x0all/ROOT,mkret2/root,alexschlueter/cern-root,agarciamontoro/root,bbockelm/root,abhinavmoudgil95/root,perovic/root,Y--/root,strykejern/TTreeReader,alexschlueter/cern-root,agarciamontoro/root,dfunke/root,veprbl/root,sirinath/root,Y--/root,satyarth934/root,omazapa/root-old,zzxuanyuan/root,karies/root,BerserkerTroll/root,sirinath/root,veprbl/root,olifre/root,omazapa/root,root-mirror/root,simonpf/root,BerserkerTroll/root,perovic/root,pspe/root,arch1tect0r/root,esakellari/my_root_for_test,olifre/root,CristinaCristescu/root,mhuwiler/rootauto,agarciamontoro/root,davidlt/root,CristinaCristescu/root,zzxuanyuan/root,tc3t/qoot,karies/root,sbinet/cxx-root,davidlt/root,omazapa/root,arch1tect0r/root,abhinavmoudgil95/root,jrtomps/root,mhuwiler/rootauto,nilqed/root,zzxuanyuan/root,omazapa/root,pspe/root,zzxuanyuan/root-compressor-dummy,tc3t/qoot,Y--/root,krafczyk/root,agarciamontoro/root,sawenzel/root,nilqed/root,evgeny-boger/root,buuck/root,olifre/root,simonpf/root,krafczyk/root,root-mirror/root,dfunke/root,perovic/root,olifre/root,abhinavmoudgil95/root,BerserkerTroll/root,evgeny-boger/root,ffurano/root5,bbockelm/root,esakellari/my_root_for_test,zzxuanyuan/root,Duraznos/root,arch1tect0r/root,agarciamontoro/root,nilqed/root,BerserkerTroll/root,vukasinmilosevic/root,sbinet/cxx-root,vukasinmilosevic/root,root-mirror/root,beniz/root,zzxuanyuan/root,sawenzel/root,abhinavmoudgil95/root,mkret2/root,omazapa/root,zzxuanyuan/root-compressor-dummy,agarciamontoro/root,cxx-hep/root-cern,lgiommi/root,esakellari/my_root_for_test,gganis/root,esakellari/my_root_for_test,mkret2/root,evgeny-boger/root,smarinac/root,tc3t/qoot,sirinath/root,omazapa/root-old,evgeny-boger/root,Duraznos/root,lgiommi/root,georgtroska/root,esakellari/root,perovic/root,abhinavmoudgil95/root,lgiommi/root,veprbl/root,zzxuanyuan/root-compressor-dummy,satyarth934/root,0x0all/ROOT,zzxuanyuan/root,esakellari/root,mhuwiler/rootauto,CristinaCristescu/root,sirinath/root,olifre/root,veprbl/root,lgiommi/root,karies/root,Y--/root,BerserkerTroll/root,mattkretz/root,bbockelm/root,abhinavmoudgil95/root,krafczyk/root,thomaskeck/root,esakellari/my_root_for_test,simonpf/root,root-mirror/root,beniz/root,root-mirror/root,abhinavmoudgil95/root,perovic/root,sbinet/cxx-root,ffurano/root5,abhinavmoudgil95/root,simonpf/root,cxx-hep/root-cern,gganis/root,mkret2/root,lgiommi/root,buuck/root,Y--/root,arch1tect0r/root,agarciamontoro/root,strykejern/TTreeReader,sirinath/root,vukasinmilosevic/root,esakellari/root,root-mirror/root,sawenzel/root,Duraznos/root,BerserkerTroll/root,vukasinmilosevic/root,dfunke/root,beniz/root,arch1tect0r/root,tc3t/qoot,gganis/root,gganis/root,esakellari/root,beniz/root,esakellari/my_root_for_test,pspe/root,Dr15Jones/root,cxx-hep/root-cern,gbitzes/root,jrtomps/root,bbockelm/root,tc3t/qoot,sbinet/cxx-root,mkret2/root,Y--/root,buuck/root,esakellari/root,karies/root,lgiommi/root,BerserkerTroll/root,zzxuanyuan/root,davidlt/root,smarinac/root,mhuwiler/rootauto,davidlt/root,mattkretz/root,root-mirror/root,georgtroska/root,georgtroska/root,arch1tect0r/root,zzxuanyuan/root,omazapa/root,davidlt/root,bbockelm/root,evgeny-boger/root,satyarth934/root,0x0all/ROOT,0x0all/ROOT,arch1tect0r/root,Duraznos/root,thomaskeck/root,nilqed/root,tc3t/qoot,alexschlueter/cern-root,omazapa/root,mhuwiler/rootauto,Duraznos/root,omazapa/root-old,smarinac/root,jrtomps/root,krafczyk/root,olifre/root,beniz/root,Dr15Jones/root,georgtroska/root,satyarth934/root,beniz/root,jrtomps/root,arch1tect0r/root,sbinet/cxx-root,gbitzes/root,sirinath/root,omazapa/root-old,krafczyk/root,davidlt/root,BerserkerTroll/root,davidlt/root,bbockelm/root,mkret2/root,esakellari/root,jrtomps/root,Y--/root,Duraznos/root,omazapa/root,cxx-hep/root-cern,Y--/root,karies/root,satyarth934/root,Y--/root,beniz/root,strykejern/TTreeReader,satyarth934/root,sawenzel/root,thomaskeck/root,zzxuanyuan/root-compressor-dummy,BerserkerTroll/root,krafczyk/root,mattkretz/root,simonpf/root,alexschlueter/cern-root,karies/root,Dr15Jones/root,evgeny-boger/root,nilqed/root,pspe/root,sawenzel/root,strykejern/TTreeReader,bbockelm/root,dfunke/root,davidlt/root,lgiommi/root,0x0all/ROOT,mhuwiler/rootauto,mhuwiler/rootauto,lgiommi/root,esakellari/root,perovic/root,sbinet/cxx-root,arch1tect0r/root,vukasinmilosevic/root,gganis/root,mattkretz/root,beniz/root,Dr15Jones/root,satyarth934/root,smarinac/root,bbockelm/root,gbitzes/root,Duraznos/root,0x0all/ROOT,jrtomps/root,beniz/root,zzxuanyuan/root-compressor-dummy,0x0all/ROOT,pspe/root,zzxuanyuan/root,abhinavmoudgil95/root,mhuwiler/rootauto,esakellari/my_root_for_test,bbockelm/root,jrtomps/root,buuck/root,gganis/root,evgeny-boger/root,gbitzes/root,simonpf/root,simonpf/root,zzxuanyuan/root,karies/root,veprbl/root,perovic/root,0x0all/ROOT,zzxuanyuan/root-compressor-dummy,arch1tect0r/root,krafczyk/root,simonpf/root,gbitzes/root,mattkretz/root,sirinath/root,mhuwiler/rootauto,smarinac/root,karies/root,beniz/root,omazapa/root,georgtroska/root,sbinet/cxx-root,omazapa/root-old,sbinet/cxx-root,strykejern/TTreeReader,thomaskeck/root,olifre/root,sirinath/root,smarinac/root,zzxuanyuan/root-compressor-dummy,buuck/root,dfunke/root,abhinavmoudgil95/root,BerserkerTroll/root,nilqed/root,mattkretz/root,Duraznos/root,nilqed/root,sirinath/root,lgiommi/root,omazapa/root,kirbyherm/root-r-tools,gganis/root,pspe/root,dfunke/root,gganis/root,sawenzel/root,gbitzes/root,CristinaCristescu/root,buuck/root,olifre/root,zzxuanyuan/root-compressor-dummy,omazapa/root-old,cxx-hep/root-cern,buuck/root,mhuwiler/rootauto,mattkretz/root,omazapa/root-old,Dr15Jones/root,satyarth934/root,kirbyherm/root-r-tools,buuck/root,evgeny-boger/root,gbitzes/root,sawenzel/root,simonpf/root,CristinaCristescu/root,gbitzes/root,smarinac/root,perovic/root,thomaskeck/root,sirinath/root,abhinavmoudgil95/root,zzxuanyuan/root-compressor-dummy,root-mirror/root,karies/root,sawenzel/root,olifre/root,thomaskeck/root,omazapa/root-old,agarciamontoro/root,georgtroska/root,ffurano/root5,omazapa/root-old,nilqed/root,CristinaCristescu/root,georgtroska/root,bbockelm/root,Dr15Jones/root,nilqed/root,thomaskeck/root,kirbyherm/root-r-tools,esakellari/my_root_for_test,omazapa/root-old,lgiommi/root,Y--/root,dfunke/root,vukasinmilosevic/root,dfunke/root,ffurano/root5,mkret2/root,root-mirror/root,mattkretz/root,thomaskeck/root,veprbl/root,dfunke/root,mattkretz/root,karies/root,veprbl/root,Duraznos/root,perovic/root,vukasinmilosevic/root,omazapa/root-old,kirbyherm/root-r-tools,veprbl/root,cxx-hep/root-cern,esakellari/my_root_for_test,smarinac/root,davidlt/root,root-mirror/root,mhuwiler/rootauto,evgeny-boger/root,cxx-hep/root-cern,thomaskeck/root,smarinac/root,zzxuanyuan/root,agarciamontoro/root,buuck/root,strykejern/TTreeReader,pspe/root,alexschlueter/cern-root,kirbyherm/root-r-tools,buuck/root,thomaskeck/root,nilqed/root,vukasinmilosevic/root,zzxuanyuan/root,tc3t/qoot,jrtomps/root,kirbyherm/root-r-tools,gbitzes/root,zzxuanyuan/root-compressor-dummy,ffurano/root5,satyarth934/root
|
e428ad136fd9007e45ddcdcce6bcf3913038b492
|
src/search.cpp
|
src/search.cpp
|
#include <cstdio>
#include <fcntl.h>
#include <termios.h>
#include <unistd.h>
#include "filefinder.h"
#include "options.h"
#include "query_string.h"
#include "terminal.h"
std::vector<node> files;
std::vector<node> search(query_string qstr){
std::vector<node> result;
std::string str(qstr.get_str());
if( str != ""){
int count = 1;
for(std::size_t i=0; i < files.size() && count <=options.number_of_result_lines; ++i){
if(files[i].filename.find(qstr.get_str()) != std::string::npos){
result.push_back(files[i]);
count++;
}
}
}
return result;
}
void print_result(const terminal& term, query_string qstr, std::size_t selected){
term.restore_cursor_pos();
for(int i=0; i < options.number_of_result_lines; ++i){
fprintf(stderr,"\n");
term.erase_line();
}
term.restore_cursor_pos();
std::vector<node> result = search(qstr);
for(std::size_t i=1; i < result.size(); ++i){
fprintf(stderr,"\n");
if(i-1==selected) fprintf(stderr,"\033[7m");
fprintf(stderr,"%lu: %s%s",i,result[i].location.c_str(), result[i].filename.c_str());
if(i-1==selected) fprintf(stderr,"\033[0m");
}
}
int main(int argc, char* argv[]){
if(!get_options(argc, argv)){
return 1;
}
if(options.show_help){
print_help();
return 0;
}
if(options.show_version){
print_version();
return 0;
}
find_files(files);
query_string qstr;
terminal term;
int c;
int selected = 0;
term.print_search_line(qstr.get_str(),qstr.get_pos());
while(1){
c = getchar();
if(c == 27){ // esc
c=getchar();
if(c == '['){
c=getchar();
if(c == 'A'){ // up
selected--;
if(selected < 0){
selected = 0;
}
print_result(term, qstr, selected);
term.restore_cursor_pos();
term.cursor_right(qstr.get_pos()+1);
}else if(c == 'B'){ // down
selected++;
if(selected > options.number_of_result_lines-1){
// TODO: should be number of results.
selected = options.number_of_result_lines-1;
}
print_result(term, qstr, selected);
term.restore_cursor_pos();
term.cursor_right(qstr.get_pos()+1);
}else if(c == 'C'){ // right
term.cursor_right();
qstr.cursor_right();
}else if(c == 'D'){ // left
term.cursor_left();
qstr.cursor_left();
}
}
}else if(c == 9){
// tab
}else if(c == 10){ // enter
fprintf(stderr,"\n");
return 0;
}else if(c == 127){ //backspace
qstr.remove();
term.print_search_line(qstr.get_str(),qstr.get_pos());
print_result(term, qstr, selected);
term.restore_cursor_pos();
term.cursor_right(qstr.get_pos()+1);
}else{
qstr.add(c);
term.print_search_line(qstr.get_str(),qstr.get_pos());
print_result(term, qstr, selected);
term.restore_cursor_pos();
term.cursor_right(qstr.get_pos()+1);
}
}
}
|
#include <cstdio>
#include <fcntl.h>
#include <termios.h>
#include <unistd.h>
#include "filefinder.h"
#include "options.h"
#include "query_string.h"
#include "terminal.h"
std::vector<node> files;
std::vector<node> search(query_string qstr){
std::vector<node> result;
std::string str(qstr.get_str());
if( str != ""){
int count = 1;
for(std::size_t i=0; i < files.size() && count <=options.number_of_result_lines; ++i){
if(files[i].filename.find(qstr.get_str()) != std::string::npos){
result.push_back(files[i]);
count++;
}
}
}
return result;
}
void print_result(const terminal& term,const std::vector<node>& result, std::size_t selected){
term.restore_cursor_pos();
for(int i=0; i < options.number_of_result_lines; ++i){
fprintf(stderr,"\n");
term.erase_line();
}
term.restore_cursor_pos();
for(std::size_t i=1; i <= result.size(); ++i){
fprintf(stderr,"\n");
if(i-1==selected) fprintf(stderr,"\033[7m");
fprintf(stderr,"%lu: %s%s",i,result[i-1].location.c_str(), result[i-1].filename.c_str());
if(i-1==selected) fprintf(stderr,"\033[0m");
}
}
int main(int argc, char* argv[]){
if(!get_options(argc, argv)){
return 1;
}
if(options.show_help){
print_help();
return 0;
}
if(options.show_version){
print_version();
return 0;
}
find_files(files);
query_string qstr;
terminal term;
int c;
int selected = 0;
std::vector<node> results;
term.print_search_line(qstr.get_str(),qstr.get_pos());
while(1){
c = getchar();
if(c == 27){ // esc
c=getchar();
if(c == '['){
c=getchar();
if(c == 'A'){ // up
selected--;
if(selected < 0){
selected = 0;
}
print_result(term, results, selected);
term.restore_cursor_pos();
term.cursor_right(qstr.get_pos()+1);
}else if(c == 'B'){ // down
selected++;
if(selected > options.number_of_result_lines-1){
// TODO: should be number of results.
selected = options.number_of_result_lines-1;
}
print_result(term, results, selected);
term.restore_cursor_pos();
term.cursor_right(qstr.get_pos()+1);
}else if(c == 'C'){ // right
term.cursor_right();
qstr.cursor_right();
}else if(c == 'D'){ // left
term.cursor_left();
qstr.cursor_left();
}
}
}else if(c == 9){
// tab
}else if(c == 10){ // enter
fprintf(stderr,"\n");
return 0;
}else if(c == 127){ //backspace
qstr.remove();
term.print_search_line(qstr.get_str(),qstr.get_pos());
results = search(qstr);
print_result(term, results, selected);
term.restore_cursor_pos();
term.cursor_right(qstr.get_pos()+1);
}else{
qstr.add(c);
term.print_search_line(qstr.get_str(),qstr.get_pos());
results = search(qstr);
print_result(term, results, selected);
term.restore_cursor_pos();
term.cursor_right(qstr.get_pos()+1);
}
}
}
|
Move search out of print_result. So results are accessable outside of print_result.
|
Move search out of print_result.
So results are accessable outside of print_result.
|
C++
|
mit
|
actinium/search,actinium/search
|
dae38fcf88b41760f028c6fc026116994fd94c63
|
src/nvtt/cuda/CudaUtils.cpp
|
src/nvtt/cuda/CudaUtils.cpp
|
// Copyright NVIDIA Corporation 2007 -- Ignacio Castano <[email protected]>
//
// Permission is hereby granted, free of charge, to any person
// obtaining a copy of this software and associated documentation
// files (the "Software"), to deal in the Software without
// restriction, including without limitation the rights to use,
// copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the
// Software is furnished to do so, subject to the following
// conditions:
//
// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
// OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
// HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
// WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
// OTHER DEALINGS IN THE SOFTWARE.
#include <nvcore/Debug.h>
#include <nvcore/Library.h>
#include "CudaUtils.h"
#if defined HAVE_CUDA
#include <cuda_runtime.h>
#endif
using namespace nv;
using namespace cuda;
#if NV_OS_WIN32
#define WINDOWS_LEAN_AND_MEAN
#include <windows.h>
static bool isWindowsVista()
{
OSVERSIONINFO osvi;
osvi.dwOSVersionInfoSize = sizeof(OSVERSIONINFO);
::GetVersionEx(&osvi);
return osvi.dwMajorVersion >= 6;
}
typedef BOOL (WINAPI *LPFN_ISWOW64PROCESS) (HANDLE, PBOOL);
static bool isWow32()
{
LPFN_ISWOW64PROCESS fnIsWow64Process = (LPFN_ISWOW64PROCESS)GetProcAddress(GetModuleHandle("kernel32"), "IsWow64Process");
BOOL bIsWow64 = FALSE;
if (NULL != fnIsWow64Process)
{
if (!fnIsWow64Process(GetCurrentProcess(), &bIsWow64))
{
// Assume 32 bits.
return true;
}
}
return !bIsWow64;
}
#endif
static bool isCudaDriverAvailable(uint version)
{
#if NV_OS_WIN32
Library nvcuda("nvcuda.dll");
#else
Library nvcuda(NV_LIBRARY_NAME(cuda));
#endif
if (!nvcuda.isValid())
{
return false;
}
if (version > 2000)
{
void * address = nvcuda.bindSymbol("cuStreamCreate");
if (address == NULL) return false;
}
if (version > 2010)
{
void * address = nvcuda.bindSymbol("cuLoadDataEx");
if (address == NULL) return false;
}
return true;
}
/// Determine if CUDA is available.
bool nv::cuda::isHardwarePresent()
{
#if defined HAVE_CUDA
#if NV_OS_WIN32
//if (isWindowsVista()) return false;
//if (isWindowsVista() || !isWow32()) return false;
#endif
int count = deviceCount();
if (count == 1)
{
// Make sure it's not an emulation device.
cudaDeviceProp deviceProp;
cudaGetDeviceProperties(&deviceProp, 0);
// deviceProp.name != Device Emulation (CPU)
if (deviceProp.major == -1 || deviceProp.minor == -1)
{
return false;
}
// Make sure that CUDA driver matches CUDA runtime.
if (!isCudaDriverAvailable(CUDART_VERSION))
{
return false;
}
// @@ Make sure that warp size == 32
}
return count > 0;
#else
return false;
#endif
}
/// Get number of CUDA enabled devices.
int nv::cuda::deviceCount()
{
#if defined HAVE_CUDA
int gpuCount = 0;
cudaError_t result = cudaGetDeviceCount(&gpuCount);
if (result == cudaSuccess)
{
return gpuCount;
}
#endif
return 0;
}
int nv::cuda::getFastestDevice()
{
int max_gflops_device = 0;
#if defined HAVE_CUDA
int max_gflops = 0;
const int device_count = deviceCount();
int current_device = 0;
while (current_device < device_count)
{
cudaDeviceProp device_properties;
cudaGetDeviceProperties(&device_properties, current_device);
int gflops = device_properties.multiProcessorCount * device_properties.clockRate;
if (device_properties.major != -1 && device_properties.minor != -1)
{
if( gflops > max_gflops )
{
max_gflops = gflops;
max_gflops_device = current_device;
}
}
current_device++;
}
#endif
return max_gflops_device;
}
/// Activate the given devices.
bool nv::cuda::setDevice(int i)
{
nvCheck(i < deviceCount());
#if defined HAVE_CUDA
cudaError_t result = cudaSetDevice(i);
return result == cudaSuccess;
#else
return false;
#endif
}
|
// Copyright NVIDIA Corporation 2007 -- Ignacio Castano <[email protected]>
//
// Permission is hereby granted, free of charge, to any person
// obtaining a copy of this software and associated documentation
// files (the "Software"), to deal in the Software without
// restriction, including without limitation the rights to use,
// copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the
// Software is furnished to do so, subject to the following
// conditions:
//
// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
// OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
// HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
// WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
// OTHER DEALINGS IN THE SOFTWARE.
#include <nvcore/Debug.h>
#include <nvcore/Library.h>
#include "CudaUtils.h"
#if defined HAVE_CUDA
#include <cuda_runtime.h>
#endif
using namespace nv;
using namespace cuda;
#if NV_OS_WIN32
#define WINDOWS_LEAN_AND_MEAN
#include <windows.h>
static bool isWindowsVista()
{
OSVERSIONINFO osvi;
osvi.dwOSVersionInfoSize = sizeof(OSVERSIONINFO);
::GetVersionEx(&osvi);
return osvi.dwMajorVersion >= 6;
}
typedef BOOL (WINAPI *LPFN_ISWOW64PROCESS) (HANDLE, PBOOL);
static bool isWow32()
{
LPFN_ISWOW64PROCESS fnIsWow64Process = (LPFN_ISWOW64PROCESS)GetProcAddress(GetModuleHandle("kernel32"), "IsWow64Process");
BOOL bIsWow64 = FALSE;
if (NULL != fnIsWow64Process)
{
if (!fnIsWow64Process(GetCurrentProcess(), &bIsWow64))
{
// Assume 32 bits.
return true;
}
}
return !bIsWow64;
}
#endif
static bool isCudaDriverAvailable(uint version)
{
#if NV_OS_WIN32
Library nvcuda("nvcuda.dll");
#else
Library nvcuda(NV_LIBRARY_NAME(cuda));
#endif
if (!nvcuda.isValid())
{
return false;
}
if (version >= 2000)
{
void * address = nvcuda.bindSymbol("cuStreamCreate");
if (address == NULL) return false;
}
if (version >= 2010)
{
void * address = nvcuda.bindSymbol("cuLoadDataEx");
if (address == NULL) return false;
}
return true;
}
/// Determine if CUDA is available.
bool nv::cuda::isHardwarePresent()
{
#if defined HAVE_CUDA
#if NV_OS_WIN32
//if (isWindowsVista()) return false;
//if (isWindowsVista() || !isWow32()) return false;
#endif
int count = deviceCount();
if (count == 1)
{
// Make sure it's not an emulation device.
cudaDeviceProp deviceProp;
cudaGetDeviceProperties(&deviceProp, 0);
// deviceProp.name != Device Emulation (CPU)
if (deviceProp.major == -1 || deviceProp.minor == -1)
{
return false;
}
// Make sure that CUDA driver matches CUDA runtime.
if (!isCudaDriverAvailable(CUDART_VERSION))
{
return false;
}
// @@ Make sure that warp size == 32
}
return count > 0;
#else
return false;
#endif
}
/// Get number of CUDA enabled devices.
int nv::cuda::deviceCount()
{
#if defined HAVE_CUDA
int gpuCount = 0;
cudaError_t result = cudaGetDeviceCount(&gpuCount);
if (result == cudaSuccess)
{
return gpuCount;
}
#endif
return 0;
}
int nv::cuda::getFastestDevice()
{
int max_gflops_device = 0;
#if defined HAVE_CUDA
int max_gflops = 0;
const int device_count = deviceCount();
int current_device = 0;
while (current_device < device_count)
{
cudaDeviceProp device_properties;
cudaGetDeviceProperties(&device_properties, current_device);
int gflops = device_properties.multiProcessorCount * device_properties.clockRate;
if (device_properties.major != -1 && device_properties.minor != -1)
{
if( gflops > max_gflops )
{
max_gflops = gflops;
max_gflops_device = current_device;
}
}
current_device++;
}
#endif
return max_gflops_device;
}
/// Activate the given devices.
bool nv::cuda::setDevice(int i)
{
nvCheck(i < deviceCount());
#if defined HAVE_CUDA
cudaError_t result = cudaSetDevice(i);
return result == cudaSuccess;
#else
return false;
#endif
}
|
Check version properly.
|
Check version properly.
git-svn-id: bd2008fbba0f7d30fd6598b54f2cd88503fdd2e4@785 95f4ed2b-212e-0410-8b90-d31948207fce
|
C++
|
mit
|
svn2github/nvidia-texture-tools,hymerman/nvidia-texture-tools,salamanderrake/nvidia-texture-tools,svn2github/nvidia-texture-tools,casseveritt/nvidia-texture-tools,casseveritt/nvidia-texture-tools,svn2github/nvidia-texture-tools,hymerman/nvidia-texture-tools,casseveritt/nvidia-texture-tools,hymerman/nvidia-texture-tools,hymerman/nvidia-texture-tools,salamanderrake/nvidia-texture-tools,svn2github/nvidia-texture-tools,salamanderrake/nvidia-texture-tools,salamanderrake/nvidia-texture-tools
|
8961b6799bdf802025d75e7dc1e30bb311378ff7
|
src/socket.cxx
|
src/socket.cxx
|
// Module: Log4CPLUS
// File: socket-win32.cxx
// Created: 4/2003
// Author: Tad E. Smith
//
//
// Copyright 2003-2014 Tad E. Smith
//
// Licensed 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 <log4cplus/helpers/loglog.h>
#include <log4cplus/internal/socket.h>
namespace log4cplus { namespace helpers {
extern LOG4CPLUS_EXPORT SOCKET_TYPE const INVALID_SOCKET_VALUE
#if defined(_WIN32)
= static_cast<SOCKET_TYPE>(INVALID_SOCKET);
#else
= static_cast<SOCKET_TYPE>(-1);
#endif
//////////////////////////////////////////////////////////////////////////////
// AbstractSocket ctors and dtor
//////////////////////////////////////////////////////////////////////////////
AbstractSocket::AbstractSocket()
: sock(INVALID_SOCKET_VALUE),
state(not_opened),
err(0)
{
}
AbstractSocket::AbstractSocket(SOCKET_TYPE sock_, SocketState state_, int err_)
: sock(sock_),
state(state_),
err(err_)
{
}
AbstractSocket::AbstractSocket(AbstractSocket && rhs)
: AbstractSocket ()
{
swap (rhs);
}
AbstractSocket::~AbstractSocket()
{
close();
}
//////////////////////////////////////////////////////////////////////////////
// AbstractSocket methods
//////////////////////////////////////////////////////////////////////////////
void
AbstractSocket::close()
{
if (sock != INVALID_SOCKET_VALUE)
{
closeSocket(sock);
sock = INVALID_SOCKET_VALUE;
state = not_opened;
}
}
void
AbstractSocket::shutdown()
{
if (sock != INVALID_SOCKET_VALUE)
shutdownSocket(sock);
}
bool
AbstractSocket::isOpen() const
{
return sock != INVALID_SOCKET_VALUE;
}
AbstractSocket &
AbstractSocket::operator = (AbstractSocket && rhs)
{
swap (rhs);
return *this;
}
void
AbstractSocket::swap (AbstractSocket & rhs)
{
using std::swap;
swap (sock, rhs.sock);
swap (state, rhs.state);
swap (err, rhs.err);
}
//////////////////////////////////////////////////////////////////////////////
// Socket ctors and dtor
//////////////////////////////////////////////////////////////////////////////
Socket::Socket()
: AbstractSocket()
{ }
Socket::Socket(const tstring& address, unsigned short port, bool udp /*= false*/)
: AbstractSocket()
{
sock = connectSocket(address, port, udp, state);
if (sock == INVALID_SOCKET_VALUE)
goto error;
if (! udp && setTCPNoDelay (sock, true) != 0)
goto error;
return;
error:
err = get_last_socket_error ();
}
Socket::Socket(SOCKET_TYPE sock_, SocketState state_, int err_)
: AbstractSocket(sock_, state_, err_)
{ }
Socket::Socket (Socket && other)
: AbstractSocket (std::move (other))
{ }
Socket::~Socket()
{ }
Socket &
Socket::operator = (Socket && other)
{
swap (other);
return *this;
}
//////////////////////////////////////////////////////////////////////////////
// Socket methods
//////////////////////////////////////////////////////////////////////////////
bool
Socket::read(SocketBuffer& buffer)
{
long retval = helpers::read(sock, buffer);
if(retval <= 0) {
close();
}
else {
buffer.setSize(retval);
}
return (retval > 0);
}
bool
Socket::write(const SocketBuffer& buffer)
{
long retval = helpers::write(sock, buffer);
if(retval <= 0) {
close();
}
return (retval > 0);
}
bool
Socket::write(const std::string & buffer)
{
long retval = helpers::write (sock, buffer);
if (retval <= 0)
close();
return retval > 0;
}
//
//
//
ServerSocket::ServerSocket (ServerSocket && other)
: AbstractSocket (std::move (other))
, interruptHandles { -1, -1 }
{
interruptHandles.swap (other.interruptHandles);
}
ServerSocket &
ServerSocket::operator = (ServerSocket && other)
{
swap (other);
return *this;
}
void
ServerSocket::swap (ServerSocket & other)
{
AbstractSocket::swap (other);
interruptHandles.swap (other.interruptHandles);
}
} } // namespace log4cplus { namespace helpers {
|
// Module: Log4CPLUS
// File: socket-win32.cxx
// Created: 4/2003
// Author: Tad E. Smith
//
//
// Copyright 2003-2014 Tad E. Smith
//
// Licensed 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 <log4cplus/helpers/loglog.h>
#include <log4cplus/internal/socket.h>
namespace log4cplus { namespace helpers {
extern LOG4CPLUS_EXPORT SOCKET_TYPE const INVALID_SOCKET_VALUE
#if defined(_WIN32)
= static_cast<SOCKET_TYPE>(INVALID_SOCKET);
#else
= static_cast<SOCKET_TYPE>(-1);
#endif
//////////////////////////////////////////////////////////////////////////////
// AbstractSocket ctors and dtor
//////////////////////////////////////////////////////////////////////////////
AbstractSocket::AbstractSocket()
: sock(INVALID_SOCKET_VALUE),
state(not_opened),
err(0)
{
}
AbstractSocket::AbstractSocket(SOCKET_TYPE sock_, SocketState state_, int err_)
: sock(sock_),
state(state_),
err(err_)
{
}
AbstractSocket::AbstractSocket(AbstractSocket && rhs)
: AbstractSocket ()
{
swap (rhs);
}
AbstractSocket::~AbstractSocket()
{
close();
}
//////////////////////////////////////////////////////////////////////////////
// AbstractSocket methods
//////////////////////////////////////////////////////////////////////////////
void
AbstractSocket::close()
{
if (sock != INVALID_SOCKET_VALUE)
{
closeSocket(sock);
sock = INVALID_SOCKET_VALUE;
state = not_opened;
}
}
void
AbstractSocket::shutdown()
{
if (sock != INVALID_SOCKET_VALUE)
shutdownSocket(sock);
}
bool
AbstractSocket::isOpen() const
{
return sock != INVALID_SOCKET_VALUE;
}
AbstractSocket &
AbstractSocket::operator = (AbstractSocket && rhs)
{
swap (rhs);
return *this;
}
void
AbstractSocket::swap (AbstractSocket & rhs)
{
using std::swap;
swap (sock, rhs.sock);
swap (state, rhs.state);
swap (err, rhs.err);
}
//////////////////////////////////////////////////////////////////////////////
// Socket ctors and dtor
//////////////////////////////////////////////////////////////////////////////
Socket::Socket()
: AbstractSocket()
{ }
Socket::Socket(const tstring& address, unsigned short port, bool udp /*= false*/)
: AbstractSocket()
{
sock = connectSocket(address, port, udp, state);
if (sock == INVALID_SOCKET_VALUE)
goto error;
if (! udp && setTCPNoDelay (sock, true) != 0)
goto error;
return;
error:
err = get_last_socket_error ();
}
Socket::Socket(SOCKET_TYPE sock_, SocketState state_, int err_)
: AbstractSocket(sock_, state_, err_)
{ }
Socket::Socket (Socket && other)
: AbstractSocket (std::move (other))
{ }
Socket::~Socket()
{ }
Socket &
Socket::operator = (Socket && other)
{
swap (other);
return *this;
}
//////////////////////////////////////////////////////////////////////////////
// Socket methods
//////////////////////////////////////////////////////////////////////////////
bool
Socket::read(SocketBuffer& buffer)
{
long retval = helpers::read(sock, buffer);
if(retval <= 0) {
close();
}
else {
buffer.setSize(retval);
}
return (retval > 0);
}
bool
Socket::write(const SocketBuffer& buffer)
{
long retval = helpers::write(sock, buffer);
if(retval <= 0) {
close();
}
return (retval > 0);
}
bool
Socket::write(const std::string & buffer)
{
long retval = helpers::write (sock, buffer);
if (retval <= 0)
close();
return retval > 0;
}
//
//
//
ServerSocket::ServerSocket (ServerSocket && other)
: AbstractSocket (std::move (other))
#if defined (_MSC_VER)
, interruptHandles {{ -1, -1 }}
#else
, interruptHandles { -1, -1 }
#endif
{
interruptHandles.swap (other.interruptHandles);
}
ServerSocket &
ServerSocket::operator = (ServerSocket && other)
{
swap (other);
return *this;
}
void
ServerSocket::swap (ServerSocket & other)
{
AbstractSocket::swap (other);
interruptHandles.swap (other.interruptHandles);
}
} } // namespace log4cplus { namespace helpers {
|
Work around for std::array<> initialization with MSVC issue.
|
socket.cxx: Work around for std::array<> initialization with MSVC issue.
|
C++
|
apache-2.0
|
csuideal/log4cplus,csuideal/log4cplus,ccpaging/log4cplus,ccpaging/log4cplus,ccpaging/log4cplus,csuideal/log4cplus,csuideal/log4cplus,ccpaging/log4cplus
|
8f1f7844fbf3184230ba2b87048056d007cd1254
|
src/solver.cpp
|
src/solver.cpp
|
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
/* Internal dependencies */
#include "structure.h"
#include "solver.h"
#include "utils.h"
#define SIZE 100
using namespace std;
int main() {
char input[SIZE] = "";
char* indent = (char*) malloc(sizeof(char) * 4);
// Display logo
logo();
// Ask for equation
cout << "\nEnter a system to solve : ";
fgets(input, SIZE, stdin);
// Remove new line of stop if empty
if(input[0] != '\n'){
size_t len = strlen(input);
if (len > 0 && input[len-1] == '\n')
input[--len] = '\0';
} else {
cout << "No system..." << endl;
return 0;
}
///////////////////
// Explore
/////
Equation *head;
Equation *tail;
Array *systems = cut(input, hook, ',', 0);
if(systems == NULL){
cout << input << endl;
cout << " ^ No systems detected..." << endl;
return 0;
}
while(systems != NULL) {
cout << endl << "+- System : " << systems->value << endl;
strcpy(indent, " ");
systems->value = substr(systems->value, 1, strlen(systems->value) - 2);
// Reset if old value
head = tail = NULL;
bool br = false;
Array *equations = cut(systems->value, hook, ',', 0);
while(equations != NULL) {
cout << indent << "+- Equation : " << equations->value << endl;
if(equations->next != NULL)
indent = addChar(indent, "| ");
else
indent = addChar(indent, " ");
equations->value = substr(equations->value, 1, strlen(equations->value) - 2);
Equation *equation = new Equation;
equation->next = NULL;
Array *arbres = cut(equations->value, bracket, ',', 0);
int i = size(arbres);
if(i != 2) {
if(i < 2)
error(" ^ Missing arguments (Two expected)", strlen(indent));
else
error(" ^ Too many arguments (Two expected)", strlen(indent));
br = true;
break;
}
bool valid = true;
int j = 0;
while(arbres != NULL) {
Arbre *arbre = get_structure(arbres->value);
equation->args[j++] = arbre;
if(arbre->typ_terme == 0)
valid = false;
explore(arbre, 0, indent, arbres->next != NULL);
arbres = arbres->next;
}
// Ignore if not a valid equation (f > 3 for exemple)
if(valid) {
if(tail != NULL)
tail->next = equation;
tail = equation;
if(head == NULL)
head = equation;
}
indent = substr(indent, 0, strlen(indent) - 3);
equations = equations->next;
}
if(br){
systems = systems->next;
continue;
}
cout << indent << endl;
indent = substr(indent, 0, strlen(indent) - 3);
///////////////////
// Solve
/////
cout << "Equation : +- ";
printEquation(head);
cout << endl;
// Resolve the system
Arguments *result = resolve(head);
cout << "Solution : +- ";
if(result == NULL)
cout << "The system has no solution." << endl;
else {
int i = 1;
Arguments *temp = result;
cout << "{";
while(temp != NULL) {
if(temp->value != NULL){
cout << "x" << i++ << "=";
printArbre(temp->value);
}
temp = temp->next;
if(temp != NULL)
cout << "; ";
}
cout << "}" << endl;
// Simplifie the result
temp = simplify(result);
i = 1;
cout << " +- " << "{";
while(temp != NULL) {
if(temp->value != NULL){
cout << "x" << i++ << "=";
printArbre(temp->value);
}
temp = temp->next;
if(temp != NULL)
cout << "; ";
}
cout << "}" << endl << endl;
}
freeSystems(head);
systems = systems->next;
}
if(indent)
free(indent);
return 0;
}
/**
* Display error message
*/
void error(const char* message, int space) {
char spacer[space];
for(int i = 0; i < space; i++)
spacer[i] = ' ';
cout << spacer << message << endl;
}
/**
* Display main logo
*/
void logo(){
cout << "#----------------------------------------------# \n";
cout << " __ __ _ _ ___ _ \n";
cout << " | \\/ |__ _| |_| |_ / __| ___| |_ _____ _ _ \n";
cout << " | |\\/| / _` | _| ' \\ \\__ \\/ _ \\ \\ V / -_) '_|\n";
cout << " |_| |_\\__,_|\\__|_||_|_|___/\\___/_|\\_/\\___|_| \n";
cout << " |___| \n";
cout << "#----------------------------------------------# \n";
}
|
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
/* Internal dependencies */
#include "structure.h"
#include "solver.h"
#include "utils.h"
#define SIZE 100
using namespace std;
int main(int argc, char *argv[]) {
char input[SIZE] = "";
char* indent = (char*) malloc(sizeof(char) * 4);
// Display logo
logo();
// Detect arguments
if(argc >= 2){
strcpy(input, argv[1]);
for(int i = 2; i < argc; i++){
strcpy(input, argv[1]);
strcat(input, argv[i]);
}
} else {
// Ask for equation
printf("\nEnter a system to solve : ");
fgets(input, SIZE, stdin);
}
// Remove new line of stop if empty
if(input[0] != '\n'){
size_t len = strlen(input);
if (len > 0 && input[len-1] == '\n')
input[--len] = '\0';
} else {
cout << "No system..." << endl;
return 0;
}
///////////////////
// Explore
/////
Equation *head;
Equation *tail;
Array *systems = cut(input, hook, ',', 0);
if(systems == NULL){
cout << input << endl;
cout << " ^ No systems detected..." << endl;
return 0;
}
while(systems != NULL) {
cout << endl << "+- System : " << systems->value << endl;
strcpy(indent, " ");
systems->value = substr(systems->value, 1, strlen(systems->value) - 2);
// Reset if old value
head = tail = NULL;
bool br = false;
Array *equations = cut(systems->value, hook, ',', 0);
while(equations != NULL) {
cout << indent << "+- Equation : " << equations->value << endl;
if(equations->next != NULL)
indent = addChar(indent, "| ");
else
indent = addChar(indent, " ");
equations->value = substr(equations->value, 1, strlen(equations->value) - 2);
Equation *equation = new Equation;
equation->next = NULL;
Array *arbres = cut(equations->value, bracket, ',', 0);
int i = size(arbres);
if(i != 2) {
if(i < 2)
error(" ^ Missing arguments (Two expected)", strlen(indent));
else
error(" ^ Too many arguments (Two expected)", strlen(indent));
br = true;
break;
}
bool valid = true;
int j = 0;
while(arbres != NULL) {
Arbre *arbre = get_structure(arbres->value);
equation->args[j++] = arbre;
if(arbre->typ_terme == 0)
valid = false;
explore(arbre, 0, indent, arbres->next != NULL);
arbres = arbres->next;
}
// Ignore if not a valid equation (f > 3 for exemple)
if(valid) {
if(tail != NULL)
tail->next = equation;
tail = equation;
if(head == NULL)
head = equation;
}
indent = substr(indent, 0, strlen(indent) - 3);
equations = equations->next;
}
if(br){
systems = systems->next;
continue;
}
cout << indent << endl;
indent = substr(indent, 0, strlen(indent) - 3);
///////////////////
// Solve
/////
cout << "Equation : +- ";
printEquation(head);
cout << endl;
// Resolve the system
Arguments *result = resolve(head);
cout << "Solution : +- ";
if(result == NULL)
cout << "The system has no solution." << endl;
else {
int i = 1;
Arguments *temp = result;
cout << "{";
while(temp != NULL) {
if(temp->value != NULL){
cout << "x" << i++ << "=";
printArbre(temp->value);
}
temp = temp->next;
if(temp != NULL)
cout << "; ";
}
cout << "}" << endl;
// Simplifie the result
temp = simplify(result);
i = 1;
cout << " +- " << "{";
while(temp != NULL) {
if(temp->value != NULL){
cout << "x" << i++ << "=";
printArbre(temp->value);
}
temp = temp->next;
if(temp != NULL)
cout << "; ";
}
cout << "}" << endl << endl;
}
freeSystems(head);
systems = systems->next;
}
if(indent)
free(indent);
return 0;
}
/**
* Display error message
*/
void error(const char* message, int space) {
char spacer[space];
for(int i = 0; i < space; i++)
spacer[i] = ' ';
cout << spacer << message << endl;
}
/**
* Display main logo
*/
void logo(){
cout << "#----------------------------------------------# \n";
cout << " __ __ _ _ ___ _ \n";
cout << " | \\/ |__ _| |_| |_ / __| ___| |_ _____ _ _ \n";
cout << " | |\\/| / _` | _| ' \\ \\__ \\/ _ \\ \\ V / -_) '_|\n";
cout << " |_| |_\\__,_|\\__|_||_|_|___/\\___/_|\\_/\\___|_| \n";
cout << " |___| \n";
cout << "#----------------------------------------------# \n";
}
|
Add arguments to main
|
Add arguments to main
|
C++
|
apache-2.0
|
Farrael/Math_Solver,Farrael/Math_Solver
|
9a99fd2c7b795d7a4fd962dfd657eff11ee58d08
|
src/stream.cpp
|
src/stream.cpp
|
/*
* ALURE OpenAL utility library
* Copyright (c) 2009 by Chris Robinson.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to
* deal in the Software without restriction, including without limitation the
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
* sell copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
* IN THE SOFTWARE.
*/
/* Title: Streaming */
#include "config.h"
#include "main.h"
#include <string.h>
#include <memory>
static bool SizeIsUS = false;
static alureStream *InitStream(alureStream *instream, ALsizei chunkLength, ALsizei numBufs, ALuint *bufs)
{
std::auto_ptr<alureStream> stream(instream);
ALenum format;
ALuint freq, blockAlign;
if(!stream->GetFormat(&format, &freq, &blockAlign))
{
SetError("Could not get stream format");
return NULL;
}
if(format == AL_NONE)
{
SetError("No valid format");
return NULL;
}
if(blockAlign == 0)
{
SetError("Invalid block size");
return NULL;
}
if(freq == 0)
{
SetError("Invalid sample rate");
return NULL;
}
ALuint framesPerBlock;
DetectCompressionRate(format, &framesPerBlock);
alureUInt64 len64 = (SizeIsUS ? (alureUInt64)chunkLength * freq / 1000000 / framesPerBlock * blockAlign :
(alureUInt64)chunkLength);
if(len64 > 0xFFFFFFFF)
{
SetError("Chunk length too large");
return NULL;
}
chunkLength = len64 - (len64%blockAlign);
if(chunkLength <= 0)
{
SetError("Chunk length too small");
return NULL;
}
stream->chunkLen = chunkLength;
stream->dataChunk = new ALubyte[stream->chunkLen];
alGenBuffers(numBufs, bufs);
if(alGetError() != AL_NO_ERROR)
{
SetError("Buffer creation failed");
return NULL;
}
ALsizei filled;
for(filled = 0;filled < numBufs;filled++)
{
ALuint got = stream->GetData(stream->dataChunk, stream->chunkLen);
got -= got%blockAlign;
if(got == 0) break;
alBufferData(bufs[filled], format, stream->dataChunk, got, freq);
}
while(filled < numBufs)
{
alBufferData(bufs[filled], format, stream->dataChunk, 0, freq);
filled++;
}
if(alGetError() != AL_NO_ERROR)
{
alDeleteBuffers(numBufs, bufs);
alGetError();
SetError("Buffering error");
return NULL;
}
return stream.release();
}
extern "C" {
/* Function: alureStreamSizeIsMicroSec
*
* Specifies if the chunk size value given to the alureCreateStream functions
* is in bytes (default) or microseconds. Specifying the size in microseconds
* can help manage the time needed in between needed updates (since the format
* and sample rate of the stream may not be known), while specifying the size
* in bytes can help control memory usage.
*
* Returns:
* Previously set value.
*
* *Version Added*: 1.1
*
* See Also:
* <alureCreateStreamFromFile>, <alureCreateStreamFromMemory>,
* <alureCreateStreamFromStaticMemory>, <alureCreateStreamFromCallback>
*/
ALURE_API ALboolean ALURE_APIENTRY alureStreamSizeIsMicroSec(ALboolean useUS)
{
ALboolean old = (SizeIsUS ? AL_TRUE : AL_FALSE);
SizeIsUS = !!useUS;
return old;
}
/* Function: alureCreateStreamFromFile
*
* Opens a file and sets it up for streaming. The given chunkLength is the
* number of bytes, or microseconds worth of bytes if
* <alureStreamSizeIsMicroSec> was last called with AL_TRUE, each buffer will
* fill with. ALURE will optionally generate the specified number of buffer
* objects, fill them with the beginning of the data, then place the new IDs
* into the provided storage, before returning. Requires an active context.
*
* Returns:
* An opaque handle used to control the opened stream, or NULL on error.
*
* See Also:
* <alureStreamSizeIsMicroSec>, <alureCreateStreamFromMemory>,
* <alureCreateStreamFromStaticMemory>, <alureCreateStreamFromCallback>
*/
ALURE_API alureStream* ALURE_APIENTRY alureCreateStreamFromFile(const ALchar *fname, ALsizei chunkLength, ALsizei numBufs, ALuint *bufs)
{
if(alGetError() != AL_NO_ERROR)
{
SetError("Existing OpenAL error");
return NULL;
}
if(chunkLength < 0)
{
SetError("Invalid chunk length");
return NULL;
}
if(numBufs < 0)
{
SetError("Invalid buffer count");
return NULL;
}
alureStream *stream = create_stream(fname);
if(!stream->IsValid())
{
delete stream;
return NULL;
}
return InitStream(stream, chunkLength, numBufs, bufs);
}
/* Function: alureCreateStreamFromMemory
*
* Opens a file image from memory and sets it up for streaming, similar to
* <alureCreateStreamFromFile>. The given data buffer can be safely deleted
* after calling this function. Requires an active context.
*
* Returns:
* An opaque handle used to control the opened stream, or NULL on error.
*
* See Also:
* <alureStreamSizeIsMicroSec>, <alureCreateStreamFromFile>,
* <alureCreateStreamFromStaticMemory>, <alureCreateStreamFromCallback>
*/
ALURE_API alureStream* ALURE_APIENTRY alureCreateStreamFromMemory(const ALubyte *fdata, ALuint length, ALsizei chunkLength, ALsizei numBufs, ALuint *bufs)
{
if(alGetError() != AL_NO_ERROR)
{
SetError("Existing OpenAL error");
return NULL;
}
if(chunkLength < 0)
{
SetError("Invalid chunk length");
return NULL;
}
if(numBufs < 0)
{
SetError("Invalid buffer count");
return NULL;
}
if(length <= 0)
{
SetError("Invalid data length");
return NULL;
}
ALubyte *streamData = new ALubyte[length];
memcpy(streamData, fdata, length);
MemDataInfo memData;
memData.Data = streamData;
memData.Length = length;
memData.Pos = 0;
alureStream *stream = create_stream(memData);
stream->data = streamData;
if(!stream->IsValid())
{
delete stream;
return NULL;
}
return InitStream(stream, chunkLength, numBufs, bufs);
}
/* Function: alureCreateStreamFromStaticMemory
*
* Identical to <alureCreateStreamFromMemory>, except the given memory is used
* directly and not duplicated. As a consequence, the data buffer must remain
* valid while the stream is alive. Requires an active context.
*
* Returns:
* An opaque handle used to control the opened stream, or NULL on error.
*
* See Also:
* <alureStreamSizeIsMicroSec>, <alureCreateStreamFromFile>,
* <alureCreateStreamFromMemory>, <alureCreateStreamFromCallback>
*/
ALURE_API alureStream* ALURE_APIENTRY alureCreateStreamFromStaticMemory(const ALubyte *fdata, ALuint length, ALsizei chunkLength, ALsizei numBufs, ALuint *bufs)
{
if(alGetError() != AL_NO_ERROR)
{
SetError("Existing OpenAL error");
return NULL;
}
if(chunkLength < 0)
{
SetError("Invalid chunk length");
return NULL;
}
if(numBufs < 0)
{
SetError("Invalid buffer count");
return NULL;
}
if(length <= 0)
{
SetError("Invalid data length");
return NULL;
}
MemDataInfo memData;
memData.Data = fdata;
memData.Length = length;
memData.Pos = 0;
alureStream *stream = create_stream(memData);
if(!stream->IsValid())
{
delete stream;
return NULL;
}
return InitStream(stream, chunkLength, numBufs, bufs);
}
/* Function: alureCreateStreamFromCallback
*
* Creates a stream using the specified callback to retrieve data. Requires an
* active context.
*
* Parameters:
* callback - This is called when more data is needed from the stream. Up to
* the specified number of bytes should be written to the data
* pointer, and the number of bytes actually written should be
* returned. The number of bytes written must be block aligned for
* the format (eg. a multiple of 4 for AL_FORMAT_STEREO16), or an
* OpenAL error may occur during buffering.
* userdata - A handle passed through to the callback.
* format - The format of the data the callback will be giving. The format must
* be valid for the context.
* samplerate - The sample rate (frequency) of the stream
*
* Returns:
* An opaque handle used to control the opened stream, or NULL on error.
*
* See Also:
* <alureStreamSizeIsMicroSec>, <alureCreateStreamFromFile>,
* <alureCreateStreamFromMemory>, <alureCreateStreamFromStaticMemory>
*/
ALURE_API alureStream* ALURE_APIENTRY alureCreateStreamFromCallback(
ALuint (*callback)(void *userdata, ALubyte *data, ALuint bytes),
void *userdata, ALenum format, ALuint samplerate,
ALsizei chunkLength, ALsizei numBufs, ALuint *bufs)
{
if(alGetError() != AL_NO_ERROR)
{
SetError("Existing OpenAL error");
return NULL;
}
if(callback == NULL)
{
SetError("Invalid callback");
return NULL;
}
if(chunkLength < 0)
{
SetError("Invalid chunk length");
return NULL;
}
if(numBufs < 0)
{
SetError("Invalid buffer count");
return NULL;
}
UserCallbacks newcb;
newcb.open_file = NULL;
newcb.open_mem = NULL;
newcb.get_fmt = NULL;
newcb.decode = callback;
newcb.rewind = NULL;
newcb.close = NULL;
alureStream *stream = create_stream(userdata, format, samplerate, newcb);
return InitStream(stream, chunkLength, numBufs, bufs);
}
/* Function: alureGetStreamFormat
*
* Retrieves the format, frequency, and block-alignment used for the given
* stream. If a parameter is NULL, that value will not be returned.
*
* Returns:
* AL_FALSE on error.
*
* *Version Added*: 1.1
*/
ALURE_API ALboolean ALURE_APIENTRY alureGetStreamFormat(alureStream *stream,
ALenum *format, ALuint *frequency, ALuint *blockAlign)
{
ALenum _fmt;
ALuint _rate, _balign;
if(!alureStream::Verify(stream))
{
SetError("Invalid stream pointer");
return AL_FALSE;
}
if(!format) format = &_fmt;
if(!frequency) frequency = &_rate;
if(!blockAlign) blockAlign = &_balign;
if(!stream->GetFormat(format, frequency, blockAlign))
{
SetError("Could not get stream format");
return AL_FALSE;
}
return AL_TRUE;
}
/* Function: alureBufferDataFromStream
*
* Buffers the given buffer objects with the next chunks of data from the
* stream. The given buffer objects do not need to be ones given by the
* alureCreateStreamFrom* functions. Requires an active context.
*
* Returns:
* The number of buffers filled with new data, or -1 on error. If the value
* returned is less than the number requested, the end of the stream has been
* reached.
*/
ALURE_API ALsizei ALURE_APIENTRY alureBufferDataFromStream(alureStream *stream, ALsizei numBufs, ALuint *bufs)
{
if(alGetError() != AL_NO_ERROR)
{
SetError("Existing OpenAL error");
return -1;
}
if(!alureStream::Verify(stream))
{
SetError("Invalid stream pointer");
return -1;
}
if(numBufs < 0)
{
SetError("Invalid buffer count");
return -1;
}
ALenum format;
ALuint freq, blockAlign;
if(!stream->GetFormat(&format, &freq, &blockAlign))
{
SetError("Could not get stream format");
return -1;
}
ALsizei filled;
for(filled = 0;filled < numBufs;filled++)
{
ALuint got = stream->GetData(stream->dataChunk, stream->chunkLen);
got -= got%blockAlign;
if(got == 0) break;
alBufferData(bufs[filled], format, stream->dataChunk, got, freq);
if(alGetError() != AL_NO_ERROR)
{
SetError("Buffer load failed");
return -1;
}
}
return filled;
}
/* Function: alureRewindStream
*
* Rewinds the stream so that the next alureBufferDataFromStream call will
* restart from the beginning of the audio file.
*
* Returns:
* AL_FALSE on error.
*
* See Also:
* <alureSetStreamOrder>
*/
ALURE_API ALboolean ALURE_APIENTRY alureRewindStream(alureStream *stream)
{
if(!alureStream::Verify(stream))
{
SetError("Invalid stream pointer");
return AL_FALSE;
}
return stream->Rewind();
}
/* Function: alureSetStreamOrder
*
* Skips the module decoder to the specified order, so following buffering
* calls will decode from the specified order. For non-module formats, setting
* order 0 is identical to rewinding the stream (other orders will fail).
*
* Returns:
* AL_FALSE on error.
*
* *Version Added*: 1.1
*
* See Also:
* <alureRewindStream>
*/
ALURE_API ALboolean ALURE_APIENTRY alureSetStreamOrder(alureStream *stream, ALuint order)
{
if(!alureStream::Verify(stream))
{
SetError("Invalid stream pointer");
return AL_FALSE;
}
return stream->SetOrder(order);
}
/* Function: alureDestroyStream
*
* Closes an opened stream. For convenience, it will also delete the given
* buffer objects. The given buffer objects do not need to be ones given by the
* alureCreateStreamFrom* functions. Requires an active context.
*
* Returns:
* AL_FALSE on error.
*/
ALURE_API ALboolean ALURE_APIENTRY alureDestroyStream(alureStream *stream, ALsizei numBufs, ALuint *bufs)
{
if(alGetError() != AL_NO_ERROR)
{
SetError("Existing OpenAL error");
return AL_FALSE;
}
if(numBufs < 0)
{
SetError("Invalid buffer count");
return AL_FALSE;
}
if(stream && !alureStream::Verify(stream))
{
SetError("Invalid stream pointer");
return AL_FALSE;
}
alDeleteBuffers(numBufs, bufs);
if(alGetError() != AL_NO_ERROR)
{
SetError("Buffer deletion failed");
return AL_FALSE;
}
if(stream)
{
StopStream(stream);
std::istream *f = stream->fstream;
delete stream;
delete f;
}
return AL_TRUE;
}
}
|
/*
* ALURE OpenAL utility library
* Copyright (c) 2009 by Chris Robinson.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to
* deal in the Software without restriction, including without limitation the
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
* sell copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
* IN THE SOFTWARE.
*/
/* Title: Streaming */
#include "config.h"
#include "main.h"
#include <string.h>
#include <memory>
static bool SizeIsUS = false;
static alureStream *InitStream(alureStream *instream, ALsizei chunkLength, ALsizei numBufs, ALuint *bufs)
{
std::auto_ptr<alureStream> stream(instream);
ALenum format;
ALuint freq, blockAlign;
if(!stream->GetFormat(&format, &freq, &blockAlign))
{
SetError("Could not get stream format");
return NULL;
}
if(format == AL_NONE)
{
SetError("No valid format");
return NULL;
}
if(blockAlign == 0)
{
SetError("Invalid block size");
return NULL;
}
if(freq == 0)
{
SetError("Invalid sample rate");
return NULL;
}
alureUInt64 len64 = chunkLength;
if(SizeIsUS)
{
ALuint framesPerBlock;
DetectCompressionRate(format, &framesPerBlock);
len64 = len64 * freq / 1000000 / framesPerBlock * blockAlign;
if(len64 > 0xFFFFFFFF)
{
SetError("Chunk length too large");
return NULL;
}
}
chunkLength = len64 - (len64%blockAlign);
if(chunkLength <= 0)
{
SetError("Chunk length too small");
return NULL;
}
stream->chunkLen = chunkLength;
stream->dataChunk = new ALubyte[stream->chunkLen];
alGenBuffers(numBufs, bufs);
if(alGetError() != AL_NO_ERROR)
{
SetError("Buffer creation failed");
return NULL;
}
ALsizei filled;
for(filled = 0;filled < numBufs;filled++)
{
ALuint got = stream->GetData(stream->dataChunk, stream->chunkLen);
got -= got%blockAlign;
if(got == 0) break;
alBufferData(bufs[filled], format, stream->dataChunk, got, freq);
}
while(filled < numBufs)
{
alBufferData(bufs[filled], format, stream->dataChunk, 0, freq);
filled++;
}
if(alGetError() != AL_NO_ERROR)
{
alDeleteBuffers(numBufs, bufs);
alGetError();
SetError("Buffering error");
return NULL;
}
return stream.release();
}
extern "C" {
/* Function: alureStreamSizeIsMicroSec
*
* Specifies if the chunk size value given to the alureCreateStream functions
* is in bytes (default) or microseconds. Specifying the size in microseconds
* can help manage the time needed in between needed updates (since the format
* and sample rate of the stream may not be known), while specifying the size
* in bytes can help control memory usage.
*
* Returns:
* Previously set value.
*
* *Version Added*: 1.1
*
* See Also:
* <alureCreateStreamFromFile>, <alureCreateStreamFromMemory>,
* <alureCreateStreamFromStaticMemory>, <alureCreateStreamFromCallback>
*/
ALURE_API ALboolean ALURE_APIENTRY alureStreamSizeIsMicroSec(ALboolean useUS)
{
ALboolean old = (SizeIsUS ? AL_TRUE : AL_FALSE);
SizeIsUS = !!useUS;
return old;
}
/* Function: alureCreateStreamFromFile
*
* Opens a file and sets it up for streaming. The given chunkLength is the
* number of bytes, or microseconds worth of bytes if
* <alureStreamSizeIsMicroSec> was last called with AL_TRUE, each buffer will
* fill with. ALURE will optionally generate the specified number of buffer
* objects, fill them with the beginning of the data, then place the new IDs
* into the provided storage, before returning. Requires an active context.
*
* Returns:
* An opaque handle used to control the opened stream, or NULL on error.
*
* See Also:
* <alureStreamSizeIsMicroSec>, <alureCreateStreamFromMemory>,
* <alureCreateStreamFromStaticMemory>, <alureCreateStreamFromCallback>
*/
ALURE_API alureStream* ALURE_APIENTRY alureCreateStreamFromFile(const ALchar *fname, ALsizei chunkLength, ALsizei numBufs, ALuint *bufs)
{
if(alGetError() != AL_NO_ERROR)
{
SetError("Existing OpenAL error");
return NULL;
}
if(chunkLength < 0)
{
SetError("Invalid chunk length");
return NULL;
}
if(numBufs < 0)
{
SetError("Invalid buffer count");
return NULL;
}
alureStream *stream = create_stream(fname);
if(!stream->IsValid())
{
delete stream;
return NULL;
}
return InitStream(stream, chunkLength, numBufs, bufs);
}
/* Function: alureCreateStreamFromMemory
*
* Opens a file image from memory and sets it up for streaming, similar to
* <alureCreateStreamFromFile>. The given data buffer can be safely deleted
* after calling this function. Requires an active context.
*
* Returns:
* An opaque handle used to control the opened stream, or NULL on error.
*
* See Also:
* <alureStreamSizeIsMicroSec>, <alureCreateStreamFromFile>,
* <alureCreateStreamFromStaticMemory>, <alureCreateStreamFromCallback>
*/
ALURE_API alureStream* ALURE_APIENTRY alureCreateStreamFromMemory(const ALubyte *fdata, ALuint length, ALsizei chunkLength, ALsizei numBufs, ALuint *bufs)
{
if(alGetError() != AL_NO_ERROR)
{
SetError("Existing OpenAL error");
return NULL;
}
if(chunkLength < 0)
{
SetError("Invalid chunk length");
return NULL;
}
if(numBufs < 0)
{
SetError("Invalid buffer count");
return NULL;
}
if(length <= 0)
{
SetError("Invalid data length");
return NULL;
}
ALubyte *streamData = new ALubyte[length];
memcpy(streamData, fdata, length);
MemDataInfo memData;
memData.Data = streamData;
memData.Length = length;
memData.Pos = 0;
alureStream *stream = create_stream(memData);
stream->data = streamData;
if(!stream->IsValid())
{
delete stream;
return NULL;
}
return InitStream(stream, chunkLength, numBufs, bufs);
}
/* Function: alureCreateStreamFromStaticMemory
*
* Identical to <alureCreateStreamFromMemory>, except the given memory is used
* directly and not duplicated. As a consequence, the data buffer must remain
* valid while the stream is alive. Requires an active context.
*
* Returns:
* An opaque handle used to control the opened stream, or NULL on error.
*
* See Also:
* <alureStreamSizeIsMicroSec>, <alureCreateStreamFromFile>,
* <alureCreateStreamFromMemory>, <alureCreateStreamFromCallback>
*/
ALURE_API alureStream* ALURE_APIENTRY alureCreateStreamFromStaticMemory(const ALubyte *fdata, ALuint length, ALsizei chunkLength, ALsizei numBufs, ALuint *bufs)
{
if(alGetError() != AL_NO_ERROR)
{
SetError("Existing OpenAL error");
return NULL;
}
if(chunkLength < 0)
{
SetError("Invalid chunk length");
return NULL;
}
if(numBufs < 0)
{
SetError("Invalid buffer count");
return NULL;
}
if(length <= 0)
{
SetError("Invalid data length");
return NULL;
}
MemDataInfo memData;
memData.Data = fdata;
memData.Length = length;
memData.Pos = 0;
alureStream *stream = create_stream(memData);
if(!stream->IsValid())
{
delete stream;
return NULL;
}
return InitStream(stream, chunkLength, numBufs, bufs);
}
/* Function: alureCreateStreamFromCallback
*
* Creates a stream using the specified callback to retrieve data. Requires an
* active context.
*
* Parameters:
* callback - This is called when more data is needed from the stream. Up to
* the specified number of bytes should be written to the data
* pointer, and the number of bytes actually written should be
* returned. The number of bytes written must be block aligned for
* the format (eg. a multiple of 4 for AL_FORMAT_STEREO16), or an
* OpenAL error may occur during buffering.
* userdata - A handle passed through to the callback.
* format - The format of the data the callback will be giving. The format must
* be valid for the context.
* samplerate - The sample rate (frequency) of the stream
*
* Returns:
* An opaque handle used to control the opened stream, or NULL on error.
*
* See Also:
* <alureStreamSizeIsMicroSec>, <alureCreateStreamFromFile>,
* <alureCreateStreamFromMemory>, <alureCreateStreamFromStaticMemory>
*/
ALURE_API alureStream* ALURE_APIENTRY alureCreateStreamFromCallback(
ALuint (*callback)(void *userdata, ALubyte *data, ALuint bytes),
void *userdata, ALenum format, ALuint samplerate,
ALsizei chunkLength, ALsizei numBufs, ALuint *bufs)
{
if(alGetError() != AL_NO_ERROR)
{
SetError("Existing OpenAL error");
return NULL;
}
if(callback == NULL)
{
SetError("Invalid callback");
return NULL;
}
if(chunkLength < 0)
{
SetError("Invalid chunk length");
return NULL;
}
if(numBufs < 0)
{
SetError("Invalid buffer count");
return NULL;
}
UserCallbacks newcb;
newcb.open_file = NULL;
newcb.open_mem = NULL;
newcb.get_fmt = NULL;
newcb.decode = callback;
newcb.rewind = NULL;
newcb.close = NULL;
alureStream *stream = create_stream(userdata, format, samplerate, newcb);
return InitStream(stream, chunkLength, numBufs, bufs);
}
/* Function: alureGetStreamFormat
*
* Retrieves the format, frequency, and block-alignment used for the given
* stream. If a parameter is NULL, that value will not be returned.
*
* Returns:
* AL_FALSE on error.
*
* *Version Added*: 1.1
*/
ALURE_API ALboolean ALURE_APIENTRY alureGetStreamFormat(alureStream *stream,
ALenum *format, ALuint *frequency, ALuint *blockAlign)
{
ALenum _fmt;
ALuint _rate, _balign;
if(!alureStream::Verify(stream))
{
SetError("Invalid stream pointer");
return AL_FALSE;
}
if(!format) format = &_fmt;
if(!frequency) frequency = &_rate;
if(!blockAlign) blockAlign = &_balign;
if(!stream->GetFormat(format, frequency, blockAlign))
{
SetError("Could not get stream format");
return AL_FALSE;
}
return AL_TRUE;
}
/* Function: alureBufferDataFromStream
*
* Buffers the given buffer objects with the next chunks of data from the
* stream. The given buffer objects do not need to be ones given by the
* alureCreateStreamFrom* functions. Requires an active context.
*
* Returns:
* The number of buffers filled with new data, or -1 on error. If the value
* returned is less than the number requested, the end of the stream has been
* reached.
*/
ALURE_API ALsizei ALURE_APIENTRY alureBufferDataFromStream(alureStream *stream, ALsizei numBufs, ALuint *bufs)
{
if(alGetError() != AL_NO_ERROR)
{
SetError("Existing OpenAL error");
return -1;
}
if(!alureStream::Verify(stream))
{
SetError("Invalid stream pointer");
return -1;
}
if(numBufs < 0)
{
SetError("Invalid buffer count");
return -1;
}
ALenum format;
ALuint freq, blockAlign;
if(!stream->GetFormat(&format, &freq, &blockAlign))
{
SetError("Could not get stream format");
return -1;
}
ALsizei filled;
for(filled = 0;filled < numBufs;filled++)
{
ALuint got = stream->GetData(stream->dataChunk, stream->chunkLen);
got -= got%blockAlign;
if(got == 0) break;
alBufferData(bufs[filled], format, stream->dataChunk, got, freq);
if(alGetError() != AL_NO_ERROR)
{
SetError("Buffer load failed");
return -1;
}
}
return filled;
}
/* Function: alureRewindStream
*
* Rewinds the stream so that the next alureBufferDataFromStream call will
* restart from the beginning of the audio file.
*
* Returns:
* AL_FALSE on error.
*
* See Also:
* <alureSetStreamOrder>
*/
ALURE_API ALboolean ALURE_APIENTRY alureRewindStream(alureStream *stream)
{
if(!alureStream::Verify(stream))
{
SetError("Invalid stream pointer");
return AL_FALSE;
}
return stream->Rewind();
}
/* Function: alureSetStreamOrder
*
* Skips the module decoder to the specified order, so following buffering
* calls will decode from the specified order. For non-module formats, setting
* order 0 is identical to rewinding the stream (other orders will fail).
*
* Returns:
* AL_FALSE on error.
*
* *Version Added*: 1.1
*
* See Also:
* <alureRewindStream>
*/
ALURE_API ALboolean ALURE_APIENTRY alureSetStreamOrder(alureStream *stream, ALuint order)
{
if(!alureStream::Verify(stream))
{
SetError("Invalid stream pointer");
return AL_FALSE;
}
return stream->SetOrder(order);
}
/* Function: alureDestroyStream
*
* Closes an opened stream. For convenience, it will also delete the given
* buffer objects. The given buffer objects do not need to be ones given by the
* alureCreateStreamFrom* functions. Requires an active context.
*
* Returns:
* AL_FALSE on error.
*/
ALURE_API ALboolean ALURE_APIENTRY alureDestroyStream(alureStream *stream, ALsizei numBufs, ALuint *bufs)
{
if(alGetError() != AL_NO_ERROR)
{
SetError("Existing OpenAL error");
return AL_FALSE;
}
if(numBufs < 0)
{
SetError("Invalid buffer count");
return AL_FALSE;
}
if(stream && !alureStream::Verify(stream))
{
SetError("Invalid stream pointer");
return AL_FALSE;
}
alDeleteBuffers(numBufs, bufs);
if(alGetError() != AL_NO_ERROR)
{
SetError("Buffer deletion failed");
return AL_FALSE;
}
if(stream)
{
StopStream(stream);
std::istream *f = stream->fstream;
delete stream;
delete f;
}
return AL_TRUE;
}
}
|
Reorganize code to detect byte length from time length
|
Reorganize code to detect byte length from time length
|
C++
|
mit
|
NickNick/alure,NickNick/alure,NickNick/alure
|
c6b5418cdf8ddf866df68ef7bd2639bf7532b6f5
|
src/pcre_check/db_setup.cpp
|
src/pcre_check/db_setup.cpp
|
// include LiteSQL's header file and generated header file
#include <fstream>
#include <iostream>
#include <vector>
#include <map>
#include "db_setup.h"
#include "PcreChecker.h"
// std namespace aliases
using std::cout;
using std::cerr;
using std::endl;
using std::string;
void parseRules(PcreCheckDb& db, const Json::Value& rules)
{
if (!rules.isArray()) {
throw std::runtime_error("rules should be array type");
}
// name : string (32)
// content : blob
// desc : string (2048)
for (const auto& rule: rules) {
if (rule["name"].empty() || !rule["name"].isString())
throw std::runtime_error("rule name must be specfied (as string)");
const auto &name = rule["name"].asString();
if (rule["content"].empty() || !rule["content"].isString())
throw std::runtime_error("rule content must be specfied (as string)");
const auto &content = rule["content"].asString();
DbRule rule_db(db);
try {
select<DbRule>(db, DbRule::Name == name).one();
cerr << "rule entry with name " << name
<< " already exists in DB (skipping this)" << endl;
continue;
} catch (NotFound) {
rule_db.name = name;
}
rule_db.content = Blob(content.data(), content.size());
if (!rule["desc"].empty())
rule_db.desc = rule["desc"].asString();
rule_db.update();
}
}
void parseGrammars(PcreCheckDb& db, const Json::Value& grammars)
{
if (!grammars.isArray()) {
throw std::runtime_error("grammars should be array type");
}
// name : string (32)
// desc : string (2048)
for (const auto& grammar: grammars) {
if (grammar["name"].empty() || !grammar["name"].isString())
throw std::runtime_error("grammar name must be specfied (as string)");
const auto &name = grammar["name"].asString();
Grammar grammar_db(db);
try {
select<Grammar>(db, Grammar::Name == name).one();
cerr << "grammar entry with name " << name
<< " already exists in DB (skipping this)" << endl;
continue;
} catch (NotFound) {
grammar_db.name = name;
}
if (!grammar["desc"].empty())
grammar_db.desc = grammar["desc"].asString();
grammar_db.update();
}
}
void parsePatterns(PcreCheckDb& db, const Json::Value& patterns)
{
if (!patterns.isArray()) {
throw std::runtime_error("patterns should be array type");
}
// name : string (32)
// content : blob
// desc : string (2048)
for (const auto& pattern: patterns) {
if (pattern["name"].empty() || !pattern["name"].isString())
throw std::runtime_error("pattern name must be specfied (as string)");
const auto &name = pattern["name"].asString();
if (pattern["content"].empty() || !pattern["content"].isString())
throw std::runtime_error("pattern content must be specfied (as string)");
const auto &content = pattern["content"].asString();
if (!pattern["ctype"].empty()) {
if (pattern["ctype"] != "hex" && pattern["ctype"] != "str") {
throw std::runtime_error(
"pattern content type must be specfied (as string)");
}
}
Pattern pattern_db(db);
try {
select<Pattern>(db, Pattern::Name == name).one();
cerr << "pattern entry with name " << name
<< " already exists in DB (skipping this)" << endl;
continue;
} catch (NotFound) {
pattern_db.name = name;
}
if (pattern["ctype"].empty()) {
pattern_db.ctype = "str";
pattern_db.content = Blob(content.data(), content.size());
} else {
pattern_db.ctype = pattern["ctype"].asString();
if (pattern_db.ctype == "hex") {
std::string tmp = ConvertHexData(content.data());
pattern_db.content = Blob(tmp.data(), content.size());
}
if (pattern_db.ctype == "str") {
pattern_db.content = Blob(content.data(), content.size());
} // need unicode type
}
if (!pattern["desc"].empty())
pattern_db.desc = pattern["desc"].asString();
pattern_db.update();
}
}
void parseTests(PcreCheckDb& db, const Json::Value& tests)
{
if (!tests.isArray()) {
throw std::runtime_error("tests should be array type");
}
std::map<string, int> engineMap;
std::map<string, int> resultMap;
std::vector<Engine> engineSels = select<Engine>(db).all();
for (const auto &e : engineSels) {
engineMap[e.name.value()] = e.id.value();
}
std::vector<Result> resultSels = select<Result>(db).all();
for (const auto &r : resultSels) {
resultMap[r.name.value()] = r.id.value();
}
// rule => DbRule name
// pattern => Pattern name
// grammars => array of Grammar names
// result => json object of result for each engine
for (const auto& test: tests) {
if (test["rule"].empty() || !test["rule"].isString())
throw std::runtime_error("test rule name must be specfied (as string)");
if (test["pattern"].empty() || !test["pattern"].isString())
throw std::runtime_error("test pattern name must be specfied (as string)");
const auto &rulename = test["rule"].asString();
const auto &patternname = test["pattern"].asString();
// find ids of rule, pattern, grammar
int rule_id;
int pattern_id;
try {
const auto& rule_db = select<DbRule>(db, DbRule::Name == rulename).one();
rule_id = rule_db.id.value();
const auto& pattern_db = select<Pattern>(db, Pattern::Name == patternname).one();
pattern_id = pattern_db.id.value();
} catch (NotFound e) {
cerr << "rule(" << rulename << ") or pattern(" << patternname
<< ") not found (" << e << ") (skipping this)" << endl;
continue;
}
// find expect id : this is actually a result id
int expect_id = 0;
if (!test["expect"].empty() && test["expect"].isString()) {
if (resultMap.count(test["expect"].asString()))
expect_id = resultMap.at(test["expect"].asString());
}
// now rule_id, pattern_id, expect_id are valid
// find out Test table id if any or create one
int test_id;
try {
const auto& test_db = select<Test>(db, Test::Ruleid == rule_id &&
Test::Patternid == pattern_id)
.one();
test_id = test_db.id.value();
} catch (NotFound) {
Test test_db(db);
test_db.ruleid = rule_id;
test_db.patternid = pattern_id;
test_db.expectid = expect_id;
test_db.update();
test_id = test_db.id.value();
}
std::vector<int> grammar_ids;
if (!test["grammars"].empty()) {
const auto& grammars = test["grammars"];
for (const auto& gr : grammars) {
if (!gr.isString())
continue; // TODO
try {
const auto& gr_db = select<Grammar>(db, Grammar::Name == gr.asString()).one();
grammar_ids.push_back(gr_db.id.value());
} catch (NotFound) {
// just register this grammar on the fly (w/o description)
Grammar new_gr(db);
new_gr.name = gr.asString();
new_gr.update();
grammar_ids.push_back(new_gr.id.value());
}
}
}
for (auto gid : grammar_ids) {
try {
select<TestGrammar>(db, TestGrammar::Testid == test_id &&
TestGrammar::Grammarid == gid).one();
} catch (NotFound) {
TestGrammar tg(db);
tg.testid = test_id;
tg.grammarid = gid;
tg.update();
}
}
std::map<string, string> verdictMap;
if (!test["result"].empty() && test["result"].isObject()) {
const auto& result = test["result"];
for (const auto& engine : result.getMemberNames()) {
if (engineMap.find(engine) != engineMap.end()) { // engine names
const auto& verdict = result[engine].asString();
if (result[engine].isString() &&
resultMap.find(verdict) != resultMap.end()) {
verdictMap[engine] = verdict;
} else {
cerr << "result for engine " << engine << " set incorrectly"
<< endl;
}
} else {
cerr << "unknown engine " << engine << " for result" << endl;
}
}
}
for (auto e2V : verdictMap) {
try {
auto resEntry =
*(select<TestResult>(db, TestResult::Testid == test_id &&
TestResult::Engineid ==
engineMap[e2V.first])
.cursor());
resEntry.resultid = resultMap[e2V.second];
resEntry.update();
} catch (NotFound) {
TestResult resEntry(db);
resEntry.testid = test_id;
resEntry.engineid = engineMap[e2V.first];
resEntry.resultid = resultMap[e2V.second];
resEntry.update();
}
}
}
}
|
// include LiteSQL's header file and generated header file
#include <fstream>
#include <iostream>
#include <map>
#include <vector>
#include "PcreChecker.h"
#include "db_setup.h"
// std namespace aliases
using std::cout;
using std::cerr;
using std::endl;
using std::string;
void parseRules(PcreCheckDb& db, const Json::Value& rules)
{
if (!rules.isArray()) {
throw std::runtime_error("rules should be array type");
}
// name : string (32)
// content : blob
// desc : string (2048)
for (const auto& rule : rules) {
if (rule["name"].empty() || !rule["name"].isString())
throw std::runtime_error("rule name must be specfied (as string)");
const auto& name = rule["name"].asString();
if (rule["content"].empty() || !rule["content"].isString())
throw std::runtime_error("rule content must be specfied (as string)");
const auto& content = rule["content"].asString();
DbRule rule_db(db);
try {
select<DbRule>(db, DbRule::Name == name).one();
cerr << "rule entry with name " << name
<< " already exists in DB (skipping this)" << endl;
continue;
} catch (NotFound) {
rule_db.name = name;
}
rule_db.content = Blob(content.data(), content.size());
if (!rule["desc"].empty())
rule_db.desc = rule["desc"].asString();
rule_db.update();
}
}
void parseGrammars(PcreCheckDb& db, const Json::Value& grammars)
{
if (!grammars.isArray()) {
throw std::runtime_error("grammars should be array type");
}
// name : string (32)
// desc : string (2048)
for (const auto& grammar : grammars) {
if (grammar["name"].empty() || !grammar["name"].isString())
throw std::runtime_error("grammar name must be specfied (as string)");
const auto& name = grammar["name"].asString();
Grammar grammar_db(db);
try {
select<Grammar>(db, Grammar::Name == name).one();
cerr << "grammar entry with name " << name
<< " already exists in DB (skipping this)" << endl;
continue;
} catch (NotFound) {
grammar_db.name = name;
}
if (!grammar["desc"].empty())
grammar_db.desc = grammar["desc"].asString();
grammar_db.update();
}
}
void parsePatterns(PcreCheckDb& db, const Json::Value& patterns)
{
if (!patterns.isArray()) {
throw std::runtime_error("patterns should be array type");
}
// name : string (32)
// content : blob
// desc : string (2048)
for (const auto& pattern : patterns) {
if (pattern["name"].empty() || !pattern["name"].isString())
throw std::runtime_error("pattern name must be specfied (as string)");
const auto& name = pattern["name"].asString();
if (pattern["content"].empty() || !pattern["content"].isString())
throw std::runtime_error("pattern content must be specfied (as string)");
const auto& content = pattern["content"].asString();
if (!pattern["ctype"].empty()) {
if (pattern["ctype"] != "hex" && pattern["ctype"] != "str") {
throw std::runtime_error(
"pattern content type must be specfied (as string)");
}
}
Pattern pattern_db(db);
try {
select<Pattern>(db, Pattern::Name == name).one();
cerr << "pattern entry with name " << name
<< " already exists in DB (skipping this)" << endl;
continue;
} catch (NotFound) {
pattern_db.name = name;
}
if (pattern["ctype"].empty()) {
pattern_db.ctype = "str";
pattern_db.content = Blob(content.data(), content.size());
} else {
pattern_db.ctype = pattern["ctype"].asString();
if (pattern_db.ctype == "hex") {
std::string tmp = convertHexData(content.data());
pattern_db.content = Blob(tmp.data(), content.size());
}
if (pattern_db.ctype == "str") {
pattern_db.content = Blob(content.data(), content.size());
} // need unicode type
}
if (!pattern["desc"].empty())
pattern_db.desc = pattern["desc"].asString();
pattern_db.update();
}
}
void parseTests(PcreCheckDb& db, const Json::Value& tests)
{
if (!tests.isArray()) {
throw std::runtime_error("tests should be array type");
}
std::map<string, int> engineMap;
std::map<string, int> resultMap;
std::vector<Engine> engineSels = select<Engine>(db).all();
for (const auto& e : engineSels) {
engineMap[e.name.value()] = e.id.value();
}
std::vector<Result> resultSels = select<Result>(db).all();
for (const auto& r : resultSels) {
resultMap[r.name.value()] = r.id.value();
}
// rule => DbRule name
// pattern => Pattern name
// grammars => array of Grammar names
// result => json object of result for each engine
for (const auto& test : tests) {
if (test["rule"].empty() || !test["rule"].isString())
throw std::runtime_error("test rule name must be specfied (as string)");
if (test["pattern"].empty() || !test["pattern"].isString())
throw std::runtime_error(
"test pattern name must be specfied (as string)");
const auto& rulename = test["rule"].asString();
const auto& patternname = test["pattern"].asString();
// find ids of rule, pattern, grammar
int rule_id;
int pattern_id;
try {
const auto& rule_db = select<DbRule>(db, DbRule::Name == rulename).one();
rule_id = rule_db.id.value();
const auto& pattern_db =
select<Pattern>(db, Pattern::Name == patternname).one();
pattern_id = pattern_db.id.value();
} catch (NotFound e) {
cerr << "rule(" << rulename << ") or pattern(" << patternname
<< ") not found (" << e << ") (skipping this)" << endl;
continue;
}
// find expect id : this is actually a result id
int expect_id = 0;
if (!test["expect"].empty() && test["expect"].isString()) {
if (resultMap.count(test["expect"].asString()))
expect_id = resultMap.at(test["expect"].asString());
}
// now rule_id, pattern_id, expect_id are valid
// find out Test table id if any or create one
int test_id;
try {
const auto& test_db =
select<Test>(db,
Test::Ruleid == rule_id && Test::Patternid == pattern_id)
.one();
test_id = test_db.id.value();
} catch (NotFound) {
Test test_db(db);
test_db.ruleid = rule_id;
test_db.patternid = pattern_id;
test_db.expectid = expect_id;
test_db.update();
test_id = test_db.id.value();
}
std::vector<int> grammar_ids;
if (!test["grammars"].empty()) {
const auto& grammars = test["grammars"];
for (const auto& gr : grammars) {
if (!gr.isString())
continue; // TODO
try {
const auto& gr_db =
select<Grammar>(db, Grammar::Name == gr.asString()).one();
grammar_ids.push_back(gr_db.id.value());
} catch (NotFound) {
// just register this grammar on the fly (w/o description)
Grammar new_gr(db);
new_gr.name = gr.asString();
new_gr.update();
grammar_ids.push_back(new_gr.id.value());
}
}
}
for (auto gid : grammar_ids) {
try {
select<TestGrammar>(
db, TestGrammar::Testid == test_id && TestGrammar::Grammarid == gid)
.one();
} catch (NotFound) {
TestGrammar tg(db);
tg.testid = test_id;
tg.grammarid = gid;
tg.update();
}
}
std::map<string, string> verdictMap;
if (!test["result"].empty() && test["result"].isObject()) {
const auto& result = test["result"];
for (const auto& engine : result.getMemberNames()) {
if (engineMap.find(engine) != engineMap.end()) { // engine names
const auto& verdict = result[engine].asString();
if (result[engine].isString() &&
resultMap.find(verdict) != resultMap.end()) {
verdictMap[engine] = verdict;
} else {
cerr << "result for engine " << engine << " set incorrectly"
<< endl;
}
} else {
cerr << "unknown engine " << engine << " for result" << endl;
}
}
}
for (auto e2V : verdictMap) {
try {
auto resEntry = *(
select<TestResult>(db,
TestResult::Testid == test_id &&
TestResult::Engineid == engineMap[e2V.first])
.cursor());
resEntry.resultid = resultMap[e2V.second];
resEntry.update();
} catch (NotFound) {
TestResult resEntry(db);
resEntry.testid = test_id;
resEntry.engineid = engineMap[e2V.first];
resEntry.resultid = resultMap[e2V.second];
resEntry.update();
}
}
}
}
|
Fix function reference type
|
Fix function reference type
Which was mistakenly not done in a previous function name change commit.
And apply clang-format.
|
C++
|
apache-2.0
|
petabi/regexbench,petabi/regexbench,petabi/regexbench,petabi/regexbench
|
42275f93d3f0bc0e0f995de360e5b4d1ebfd891b
|
src/platform/qt/ObjView.cpp
|
src/platform/qt/ObjView.cpp
|
/* Copyright (c) 2013-2016 Jeffrey Pfau
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "ObjView.h"
#include "CoreController.h"
#include "GBAApp.h"
#include <QAction>
#include <QClipboard>
#include <QListWidgetItem>
#include <QTimer>
#include "LogController.h"
#include "VFileDevice.h"
#ifdef M_CORE_GBA
#include <mgba/internal/gba/gba.h>
#endif
#ifdef M_CORE_GB
#include <mgba/internal/gb/gb.h>
#endif
#include <mgba-util/vfs.h>
using namespace QGBA;
ObjView::ObjView(std::shared_ptr<CoreController> controller, QWidget* parent)
: AssetView(controller, parent)
, m_controller(controller)
{
m_ui.setupUi(this);
m_ui.tile->setController(controller);
const QFont font = GBAApp::app()->monospaceFont();
m_ui.x->setFont(font);
m_ui.y->setFont(font);
m_ui.w->setFont(font);
m_ui.h->setFont(font);
m_ui.address->setFont(font);
m_ui.priority->setFont(font);
m_ui.palette->setFont(font);
m_ui.transform->setFont(font);
m_ui.xformPA->setFont(font);
m_ui.xformPB->setFont(font);
m_ui.xformPC->setFont(font);
m_ui.xformPD->setFont(font);
m_ui.mode->setFont(font);
connect(m_ui.tiles, &TilePainter::indexPressed, this, &ObjView::translateIndex);
connect(m_ui.tiles, &TilePainter::needsRedraw, this, [this]() {
updateTiles(true);
});
connect(m_ui.objId, static_cast<void (QSpinBox::*)(int)>(&QSpinBox::valueChanged), this, &ObjView::selectObj);
connect(m_ui.magnification, static_cast<void (QSpinBox::*)(int)>(&QSpinBox::valueChanged), [this]() {
updateTiles(true);
});
connect(m_ui.exportButton, &QAbstractButton::clicked, this, &ObjView::exportObj);
connect(m_ui.copyButton, &QAbstractButton::clicked, this, &ObjView::copyObj);
connect(m_ui.objList, &QListWidget::currentItemChanged, [this]() {
QListWidgetItem* item = m_ui.objList->currentItem();
if (item) {
selectObj(item->data(Qt::UserRole).toInt());
}
});
QAction* exportAction = new QAction(this);
exportAction->setShortcut(QKeySequence::Save);
connect(exportAction, &QAction::triggered, this, &ObjView::exportObj);
addAction(exportAction);
QAction* copyAction = new QAction(this);
copyAction->setShortcut(QKeySequence::Copy);
connect(copyAction, &QAction::triggered, this, &ObjView::copyObj);
addAction(copyAction);
}
void ObjView::selectObj(int obj) {
m_objId = obj;
bool blocked = m_ui.objId->blockSignals(true);
m_ui.objId->setValue(m_objId);
m_ui.objId->blockSignals(blocked);
if (m_objs.size() > obj) {
blocked = m_ui.objList->blockSignals(true);
m_ui.objList->setCurrentItem(m_objs[obj]);
m_ui.objList->blockSignals(blocked);
}
updateTiles(true);
}
void ObjView::translateIndex(int index) {
unsigned x = index % m_objInfo.width;
unsigned y = index / m_objInfo.width;
m_ui.tile->selectIndex(x + y * m_objInfo.stride + m_tileOffset + m_boundary);
}
#ifdef M_CORE_GBA
void ObjView::updateTilesGBA(bool force) {
m_ui.objId->setMaximum(127);
const GBA* gba = static_cast<const GBA*>(m_controller->thread()->core->board);
const GBAObj* obj = &gba->video.oam.obj[m_objId];
updateObjList(128);
ObjInfo newInfo;
lookupObj(m_objId, &newInfo);
m_ui.tiles->setTileCount(newInfo.width * newInfo.height);
m_ui.tiles->setMinimumSize(QSize(newInfo.width * 8, newInfo.height * 8) * m_ui.magnification->value());
m_ui.tiles->resize(QSize(newInfo.width * 8, newInfo.height * 8) * m_ui.magnification->value());
unsigned tileBase = newInfo.tile;
unsigned tile = newInfo.tile;
if (GBAObjAttributesAIs256Color(obj->a)) {
m_ui.palette->setText("256-color");
m_ui.tile->setBoundary(1024, 1, 3);
m_ui.tile->setPalette(0);
m_boundary = 1024;
tileBase *= 2;
} else {
m_ui.palette->setText(QString::number(newInfo.paletteId));
m_ui.tile->setBoundary(2048, 0, 2);
m_ui.tile->setPalette(newInfo.paletteId);
m_boundary = 2048;
}
if (newInfo != m_objInfo) {
force = true;
}
m_objInfo = newInfo;
m_tileOffset = newInfo.tile;
mTileCache* tileCache = mTileCacheSetGetPointer(&m_cacheSet->tiles, newInfo.paletteSet);
unsigned maxTiles = mTileCacheSystemInfoGetMaxTiles(tileCache->sysConfig);
int i = 0;
for (unsigned y = 0; y < newInfo.height; ++y) {
for (unsigned x = 0; x < newInfo.width; ++x, ++i, ++tile, ++tileBase) {
if (tile < maxTiles) {
const color_t* data = mTileCacheGetTileIfDirty(tileCache, &m_tileStatus[16 * tileBase], tile, newInfo.paletteId);
if (data) {
m_ui.tiles->setTile(i, data);
} else if (force) {
m_ui.tiles->setTile(i, mTileCacheGetTile(tileCache, tile, newInfo.paletteId));
}
} else {
m_ui.tiles->clearTile(i);
}
}
tile += newInfo.stride - newInfo.width;
tileBase += newInfo.stride - newInfo.width;
}
m_ui.x->setText(QString::number(newInfo.x));
m_ui.y->setText(QString::number(newInfo.y));
m_ui.w->setText(QString::number(newInfo.width * 8));
m_ui.h->setText(QString::number(newInfo.height * 8));
m_ui.address->setText(tr("0x%0").arg(BASE_OAM + m_objId * sizeof(*obj), 8, 16, QChar('0')));
m_ui.priority->setText(QString::number(newInfo.priority));
m_ui.flippedH->setChecked(newInfo.hflip);
m_ui.flippedV->setChecked(newInfo.vflip);
m_ui.enabled->setChecked(newInfo.enabled);
m_ui.doubleSize->setChecked(GBAObjAttributesAIsDoubleSize(obj->a) && GBAObjAttributesAIsTransformed(obj->a));
m_ui.mosaic->setChecked(GBAObjAttributesAIsMosaic(obj->a));
if (GBAObjAttributesAIsTransformed(obj->a)) {
int mtxId = GBAObjAttributesBGetMatIndex(obj->b);
struct GBAOAMMatrix mat;
LOAD_16LE(mat.a, 0, &gba->video.oam.mat[mtxId].a);
LOAD_16LE(mat.b, 0, &gba->video.oam.mat[mtxId].b);
LOAD_16LE(mat.c, 0, &gba->video.oam.mat[mtxId].c);
LOAD_16LE(mat.d, 0, &gba->video.oam.mat[mtxId].d);
m_ui.transform->setText(QString::number(mtxId));
m_ui.xformPA->setText(QString("%0").arg(mat.a / 256., 5, 'f', 2));
m_ui.xformPB->setText(QString("%0").arg(mat.b / 256., 5, 'f', 2));
m_ui.xformPC->setText(QString("%0").arg(mat.c / 256., 5, 'f', 2));
m_ui.xformPD->setText(QString("%0").arg(mat.d / 256., 5, 'f', 2));
} else {
m_ui.transform->setText(tr("Off"));
m_ui.xformPA->setText(tr("---"));
m_ui.xformPB->setText(tr("---"));
m_ui.xformPC->setText(tr("---"));
m_ui.xformPD->setText(tr("---"));
}
switch (GBAObjAttributesAGetMode(obj->a)) {
case OBJ_MODE_NORMAL:
m_ui.mode->setText(tr("Normal"));
break;
case OBJ_MODE_SEMITRANSPARENT:
m_ui.mode->setText(tr("Trans"));
break;
case OBJ_MODE_OBJWIN:
m_ui.mode->setText(tr("OBJWIN"));
break;
default:
m_ui.mode->setText(tr("Invalid"));
break;
}
}
#endif
#ifdef M_CORE_GB
void ObjView::updateTilesGB(bool force) {
m_ui.objId->setMaximum(39);
const GB* gb = static_cast<const GB*>(m_controller->thread()->core->board);
const GBObj* obj = &gb->video.oam.obj[m_objId];
updateObjList(40);
ObjInfo newInfo;
lookupObj(m_objId, &newInfo);
mTileCache* tileCache = mTileCacheSetGetPointer(&m_cacheSet->tiles, 0);
unsigned tile = newInfo.tile;
m_ui.tiles->setTileCount(newInfo.height);
m_ui.tile->setBoundary(1024, 0, 0);
m_ui.tiles->setMinimumSize(QSize(8, newInfo.height * 8) * m_ui.magnification->value());
m_ui.tiles->resize(QSize(8, newInfo.height * 8) * m_ui.magnification->value());
m_ui.palette->setText(QString::number(newInfo.paletteId - 8));
if (newInfo != m_objInfo) {
force = true;
}
m_objInfo = newInfo;
m_tileOffset = tile;
m_boundary = 1024;
int i = 0;
m_ui.tile->setPalette(newInfo.paletteId);
for (unsigned y = 0; y < newInfo.height; ++y, ++i) {
unsigned t = tile + i;
const color_t* data = mTileCacheGetTileIfDirty(tileCache, &m_tileStatus[8 * t], t, newInfo.paletteId);
if (data) {
m_ui.tiles->setTile(i, data);
} else if (force) {
m_ui.tiles->setTile(i, mTileCacheGetTile(tileCache, t, newInfo.paletteId));
}
}
m_ui.x->setText(QString::number(newInfo.x));
m_ui.y->setText(QString::number(newInfo.y));
m_ui.w->setText(QString::number(8));
m_ui.h->setText(QString::number(newInfo.height * 8));
m_ui.address->setText(tr("0x%0").arg(GB_BASE_OAM + m_objId * sizeof(*obj), 4, 16, QChar('0')));
m_ui.priority->setText(QString::number(newInfo.priority));
m_ui.flippedH->setChecked(newInfo.hflip);
m_ui.flippedV->setChecked(newInfo.vflip);
m_ui.enabled->setChecked(newInfo.enabled);
m_ui.doubleSize->setChecked(false);
m_ui.mosaic->setChecked(false);
m_ui.transform->setText(tr("N/A"));
m_ui.xformPA->setText(tr("---"));
m_ui.xformPB->setText(tr("---"));
m_ui.xformPC->setText(tr("---"));
m_ui.xformPD->setText(tr("---"));
m_ui.mode->setText(tr("N/A"));
}
#endif
void ObjView::updateObjList(int maxObj) {
for (int i = 0; i < maxObj; ++i) {
if (m_objs.size() <= i) {
QListWidgetItem* item = new QListWidgetItem;
item->setText(QString::number(i));
item->setData(Qt::UserRole, i);
item->setSizeHint(QSize(64, 96));
if (m_objId == i) {
item->setSelected(true);
}
m_objs.append(item);
m_ui.objList->addItem(item);
}
QListWidgetItem* item = m_objs[i];
ObjInfo info;
lookupObj(i, &info);
item->setIcon(QPixmap::fromImage(compositeObj(info)));
}
}
void ObjView::exportObj() {
QString filename = GBAApp::app()->getSaveFileName(this, tr("Export sprite"),
tr("Portable Network Graphics (*.png)"));
if (filename.isNull()) {
return;
}
CoreController::Interrupter interrupter(m_controller);
QImage obj = compositeObj(m_objInfo);
obj.save(filename, "PNG");
}
void ObjView::copyObj() {
CoreController::Interrupter interrupter(m_controller);
GBAApp::app()->clipboard()->setImage(compositeObj(m_objInfo));
}
|
/* Copyright (c) 2013-2016 Jeffrey Pfau
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "ObjView.h"
#include "CoreController.h"
#include "GBAApp.h"
#include <QAction>
#include <QClipboard>
#include <QListWidgetItem>
#include <QTimer>
#include "LogController.h"
#include "VFileDevice.h"
#ifdef M_CORE_GBA
#include <mgba/internal/gba/gba.h>
#endif
#ifdef M_CORE_GB
#include <mgba/internal/gb/gb.h>
#endif
#include <mgba-util/vfs.h>
using namespace QGBA;
ObjView::ObjView(std::shared_ptr<CoreController> controller, QWidget* parent)
: AssetView(controller, parent)
, m_controller(controller)
{
m_ui.setupUi(this);
m_ui.tile->setController(controller);
const QFont font = GBAApp::app()->monospaceFont();
m_ui.x->setFont(font);
m_ui.y->setFont(font);
m_ui.w->setFont(font);
m_ui.h->setFont(font);
m_ui.address->setFont(font);
m_ui.priority->setFont(font);
m_ui.palette->setFont(font);
m_ui.transform->setFont(font);
m_ui.xformPA->setFont(font);
m_ui.xformPB->setFont(font);
m_ui.xformPC->setFont(font);
m_ui.xformPD->setFont(font);
m_ui.mode->setFont(font);
connect(m_ui.tiles, &TilePainter::indexPressed, this, &ObjView::translateIndex);
connect(m_ui.tiles, &TilePainter::needsRedraw, this, [this]() {
updateTiles(true);
});
connect(m_ui.objId, static_cast<void (QSpinBox::*)(int)>(&QSpinBox::valueChanged), this, &ObjView::selectObj);
connect(m_ui.magnification, static_cast<void (QSpinBox::*)(int)>(&QSpinBox::valueChanged), [this]() {
updateTiles(true);
});
connect(m_ui.exportButton, &QAbstractButton::clicked, this, &ObjView::exportObj);
connect(m_ui.copyButton, &QAbstractButton::clicked, this, &ObjView::copyObj);
connect(m_ui.objList, &QListWidget::currentItemChanged, [this]() {
QListWidgetItem* item = m_ui.objList->currentItem();
if (item) {
selectObj(item->data(Qt::UserRole).toInt());
}
});
QAction* exportAction = new QAction(this);
exportAction->setShortcut(QKeySequence::Save);
connect(exportAction, &QAction::triggered, this, &ObjView::exportObj);
addAction(exportAction);
QAction* copyAction = new QAction(this);
copyAction->setShortcut(QKeySequence::Copy);
connect(copyAction, &QAction::triggered, this, &ObjView::copyObj);
addAction(copyAction);
}
void ObjView::selectObj(int obj) {
m_objId = obj;
bool blocked = m_ui.objId->blockSignals(true);
m_ui.objId->setValue(m_objId);
m_ui.objId->blockSignals(blocked);
if (m_objs.size() > obj) {
blocked = m_ui.objList->blockSignals(true);
m_ui.objList->setCurrentItem(m_objs[obj]);
m_ui.objList->blockSignals(blocked);
}
updateTiles(true);
}
void ObjView::translateIndex(int index) {
unsigned x = index % m_objInfo.width;
unsigned y = index / m_objInfo.width;
m_ui.tile->selectIndex(x + y * m_objInfo.stride + m_tileOffset + m_boundary);
}
#ifdef M_CORE_GBA
void ObjView::updateTilesGBA(bool force) {
m_ui.objId->setMaximum(127);
const GBA* gba = static_cast<const GBA*>(m_controller->thread()->core->board);
const GBAObj* obj = &gba->video.oam.obj[m_objId];
updateObjList(128);
ObjInfo newInfo;
lookupObj(m_objId, &newInfo);
m_ui.tiles->setTileCount(newInfo.width * newInfo.height);
m_ui.tiles->setMinimumSize(QSize(newInfo.width * 8, newInfo.height * 8) * m_ui.magnification->value());
m_ui.tiles->resize(QSize(newInfo.width * 8, newInfo.height * 8) * m_ui.magnification->value());
unsigned tileBase = newInfo.tile;
unsigned tile = newInfo.tile;
if (GBAObjAttributesAIs256Color(obj->a)) {
m_ui.palette->setText("256-color");
m_ui.tile->setBoundary(1024, 1, 3);
m_ui.tile->setPalette(0);
m_boundary = 1024;
tileBase *= 2;
} else {
m_ui.palette->setText(QString::number(newInfo.paletteId));
m_ui.tile->setBoundary(2048, 0, 2);
m_ui.tile->setPalette(newInfo.paletteId);
m_boundary = 2048;
}
if (newInfo != m_objInfo) {
force = true;
}
m_objInfo = newInfo;
m_tileOffset = newInfo.tile;
mTileCache* tileCache = mTileCacheSetGetPointer(&m_cacheSet->tiles, newInfo.paletteSet);
unsigned maxTiles = mTileCacheSystemInfoGetMaxTiles(tileCache->sysConfig);
int i = 0;
for (unsigned y = 0; y < newInfo.height; ++y) {
for (unsigned x = 0; x < newInfo.width; ++x, ++i, ++tile, ++tileBase) {
if (tile < maxTiles) {
const color_t* data = mTileCacheGetTileIfDirty(tileCache, &m_tileStatus[16 * tileBase], tile, newInfo.paletteId);
if (data) {
m_ui.tiles->setTile(i, data);
} else if (force) {
m_ui.tiles->setTile(i, mTileCacheGetTile(tileCache, tile, newInfo.paletteId));
}
} else {
m_ui.tiles->clearTile(i);
}
}
tile += newInfo.stride - newInfo.width;
tileBase += newInfo.stride - newInfo.width;
}
m_ui.x->setText(QString::number(newInfo.x));
m_ui.y->setText(QString::number(newInfo.y));
m_ui.w->setText(QString::number(newInfo.width * 8));
m_ui.h->setText(QString::number(newInfo.height * 8));
m_ui.address->setText(tr("0x%0").arg(BASE_OAM + m_objId * sizeof(*obj), 8, 16, QChar('0')));
m_ui.priority->setText(QString::number(newInfo.priority));
m_ui.flippedH->setChecked(newInfo.hflip);
m_ui.flippedV->setChecked(newInfo.vflip);
m_ui.enabled->setChecked(newInfo.enabled);
m_ui.doubleSize->setChecked(GBAObjAttributesAIsDoubleSize(obj->a) && GBAObjAttributesAIsTransformed(obj->a));
m_ui.mosaic->setChecked(GBAObjAttributesAIsMosaic(obj->a));
if (GBAObjAttributesAIsTransformed(obj->a)) {
int mtxId = GBAObjAttributesBGetMatIndex(obj->b);
struct GBAOAMMatrix mat;
LOAD_16LE(mat.a, 0, &gba->video.oam.mat[mtxId].a);
LOAD_16LE(mat.b, 0, &gba->video.oam.mat[mtxId].b);
LOAD_16LE(mat.c, 0, &gba->video.oam.mat[mtxId].c);
LOAD_16LE(mat.d, 0, &gba->video.oam.mat[mtxId].d);
m_ui.transform->setText(QString::number(mtxId));
m_ui.xformPA->setText(QString("%0").arg(mat.a / 256., 5, 'f', 2));
m_ui.xformPB->setText(QString("%0").arg(mat.b / 256., 5, 'f', 2));
m_ui.xformPC->setText(QString("%0").arg(mat.c / 256., 5, 'f', 2));
m_ui.xformPD->setText(QString("%0").arg(mat.d / 256., 5, 'f', 2));
} else {
m_ui.transform->setText(tr("Off"));
m_ui.xformPA->setText(tr("---"));
m_ui.xformPB->setText(tr("---"));
m_ui.xformPC->setText(tr("---"));
m_ui.xformPD->setText(tr("---"));
}
switch (GBAObjAttributesAGetMode(obj->a)) {
case OBJ_MODE_NORMAL:
m_ui.mode->setText(tr("Normal"));
break;
case OBJ_MODE_SEMITRANSPARENT:
m_ui.mode->setText(tr("Trans"));
break;
case OBJ_MODE_OBJWIN:
m_ui.mode->setText(tr("OBJWIN"));
break;
default:
m_ui.mode->setText(tr("Invalid"));
break;
}
}
#endif
#ifdef M_CORE_GB
void ObjView::updateTilesGB(bool force) {
m_ui.objId->setMaximum(39);
const GB* gb = static_cast<const GB*>(m_controller->thread()->core->board);
const GBObj* obj = &gb->video.oam.obj[m_objId];
updateObjList(40);
ObjInfo newInfo;
lookupObj(m_objId, &newInfo);
mTileCache* tileCache = mTileCacheSetGetPointer(&m_cacheSet->tiles, 0);
unsigned tile = newInfo.tile;
m_ui.tiles->setTileCount(newInfo.height);
m_ui.tile->setBoundary(1024, 0, 0);
m_ui.tiles->setMinimumSize(QSize(8, newInfo.height * 8) * m_ui.magnification->value());
m_ui.tiles->resize(QSize(8, newInfo.height * 8) * m_ui.magnification->value());
m_ui.palette->setText(QString::number(newInfo.paletteId - 8));
if (newInfo != m_objInfo) {
force = true;
}
m_objInfo = newInfo;
m_tileOffset = tile;
m_boundary = 1024;
int i = 0;
m_ui.tile->setPalette(newInfo.paletteId);
for (unsigned y = 0; y < newInfo.height; ++y, ++i) {
unsigned t = tile + i;
const color_t* data = mTileCacheGetTileIfDirty(tileCache, &m_tileStatus[8 * t], t, newInfo.paletteId);
if (data) {
m_ui.tiles->setTile(i, data);
} else if (force) {
m_ui.tiles->setTile(i, mTileCacheGetTile(tileCache, t, newInfo.paletteId));
}
}
m_ui.x->setText(QString::number(newInfo.x));
m_ui.y->setText(QString::number(newInfo.y));
m_ui.w->setText(QString::number(8));
m_ui.h->setText(QString::number(newInfo.height * 8));
m_ui.address->setText(tr("0x%0").arg(GB_BASE_OAM + m_objId * sizeof(*obj), 4, 16, QChar('0')));
m_ui.priority->setText(QString::number(newInfo.priority));
m_ui.flippedH->setChecked(newInfo.hflip);
m_ui.flippedV->setChecked(newInfo.vflip);
m_ui.enabled->setChecked(newInfo.enabled);
m_ui.doubleSize->setChecked(false);
m_ui.mosaic->setChecked(false);
m_ui.transform->setText(tr("N/A"));
m_ui.xformPA->setText(tr("---"));
m_ui.xformPB->setText(tr("---"));
m_ui.xformPC->setText(tr("---"));
m_ui.xformPD->setText(tr("---"));
m_ui.mode->setText(tr("N/A"));
}
#endif
void ObjView::updateObjList(int maxObj) {
for (int i = 0; i < maxObj; ++i) {
if (m_objs.size() <= i) {
QListWidgetItem* item = new QListWidgetItem;
item->setText(QString::number(i));
item->setData(Qt::UserRole, i);
item->setSizeHint(QSize(64, 96));
item->setFlags(Qt::ItemIsSelectable | Qt::ItemIsEnabled);
if (m_objId == i) {
item->setSelected(true);
}
m_objs.append(item);
m_ui.objList->addItem(item);
}
QListWidgetItem* item = m_objs[i];
ObjInfo info;
lookupObj(i, &info);
item->setIcon(QPixmap::fromImage(compositeObj(info)));
}
}
void ObjView::exportObj() {
QString filename = GBAApp::app()->getSaveFileName(this, tr("Export sprite"),
tr("Portable Network Graphics (*.png)"));
if (filename.isNull()) {
return;
}
CoreController::Interrupter interrupter(m_controller);
QImage obj = compositeObj(m_objInfo);
obj.save(filename, "PNG");
}
void ObjView::copyObj() {
CoreController::Interrupter interrupter(m_controller);
GBAApp::app()->clipboard()->setImage(compositeObj(m_objInfo));
}
|
Fix OBJ view item flags
|
Qt: Fix OBJ view item flags
|
C++
|
mpl-2.0
|
Iniquitatis/mgba,Iniquitatis/mgba,mgba-emu/mgba,Iniquitatis/mgba,mgba-emu/mgba,libretro/mgba,libretro/mgba,mgba-emu/mgba,mgba-emu/mgba,libretro/mgba,libretro/mgba,Iniquitatis/mgba,libretro/mgba
|
09a8ae10cd60e518cd9d80c9c06d00e6f6ccf874
|
src/stream_coder/socks5_server_stream_coder.cc
|
src/stream_coder/socks5_server_stream_coder.cc
|
// MIT License
// Copyright (c) 2017 Zhuhao Wang
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
#include <cassert>
#include "nekit/stream_coder/socks5_server_stream_coder.h"
namespace nekit {
namespace stream_coder {
Socks5ServerStreamCoder::Socks5ServerStreamCoder()
: status_(Status::ReadingVersion) {}
ActionRequest Socks5ServerStreamCoder::Negotiate() {
return ActionRequest::WantRead;
}
utils::BufferReserveSize Socks5ServerStreamCoder::DecodeReserve() const {
switch (status_) {
case Status::Forwarding:
case Status::ReadingVersion:
case Status::ReadingRequest:
return {0, 0};
default:
assert(false);
}
}
ActionRequest Socks5ServerStreamCoder::Decode(utils::Buffer *buffer) {
switch (status_) {
case Status::Forwarding:
return ActionRequest::Continue;
case Status::ReadingVersion: {
if (buffer->capacity() <= 2) {
last_error_ = ErrorCode::RequestIncomplete;
return ActionRequest::ErrorHappened;
}
auto data = static_cast<uint8_t *>(buffer->buffer());
if (*data++ != 5) {
last_error_ = ErrorCode::UnsupportedVersion;
return ActionRequest::ErrorHappened;
}
auto len = *data++;
if (buffer->capacity() != 2 + len) {
last_error_ = ErrorCode::RequestIncomplete;
return ActionRequest::ErrorHappened;
}
bool supported = false;
while (len--) {
// Only no auth is supported
if (*data++ == 0) {
supported = true;
break;
}
}
if (!supported) {
last_error_ = ErrorCode::UnsupportedAuthenticationMethod;
return ActionRequest::ErrorHappened;
}
return ActionRequest::WantWrite;
} break;
case Status::ReadingRequest: {
if (buffer->capacity() < 10) {
last_error_ = ErrorCode::RequestIncomplete;
return ActionRequest::ErrorHappened;
}
auto data = static_cast<uint8_t *>(buffer->buffer());
if (*data++ != 5) {
last_error_ = ErrorCode::UnsupportedVersion;
return ActionRequest::ErrorHappened;
}
if (*data++ != 1) {
last_error_ = ErrorCode::UnsupportedCommand;
return ActionRequest::ErrorHappened;
}
data++;
switch (*data++) {
case 1: {
if (buffer->capacity() != 4 + 4 + 2) {
last_error_ = ErrorCode::RequestIncomplete;
return ActionRequest::ErrorHappened;
}
auto bytes = boost::asio::ip::address_v4::bytes_type();
std::memcpy(bytes.data(), data, bytes.size());
session_.reset(
new utils::Session(boost::asio::ip::address_v4(bytes)));
data += 4;
} break;
case 3: {
auto len = *data++;
if (buffer->capacity() != 4 + 1 + len + 2) {
last_error_ = ErrorCode::RequestIncomplete;
return ActionRequest::ErrorHappened;
}
session_.reset(new utils::Session(
std::string(reinterpret_cast<char *>(data), len)));
data += len;
} break;
case 4: {
if (buffer->capacity() != 4 + 16 + 2) {
last_error_ = ErrorCode::RequestIncomplete;
return ActionRequest::ErrorHappened;
}
auto bytes = boost::asio::ip::address_v6::bytes_type();
std::memcpy(bytes.data(), data, bytes.size());
session_.reset(
new utils::Session(boost::asio::ip::address_v6(bytes)));
data += 16;
} break;
default: {
last_error_ = ErrorCode::UnsupportedAddressType;
return ActionRequest::ErrorHappened;
}
}
session_->setPort(ntohs(*reinterpret_cast<uint16_t *>(data)));
return ActionRequest::Event;
}
}
}
utils::BufferReserveSize Socks5ServerStreamCoder::EncodeReserve() const {
switch (status_) {
case Status::Forwarding:
return {0, 0};
case Status::ReadingVersion:
return {0, 2};
case Status::ReadingRequest:
switch (session_->type()) {
case utils::Session::Type::Domain:
return {0, 10};
case utils::Session::Type::Address:
if (session_->address().is_v4()) {
return {0, 10};
} else {
return {0, 22};
}
}
}
}
ActionRequest Socks5ServerStreamCoder::Encode(utils::Buffer *buffer) {
switch (status_) {
case Status::Forwarding:
return ActionRequest::Continue;
case Status::ReadingVersion: {
buffer->ReleaseBack(2);
assert(buffer->capacity() >= 2);
auto data = static_cast<uint8_t *>(buffer->buffer());
*data = 5;
*(data + 1) = 0;
status_ = Status::ReadingRequest;
return ActionRequest::WantRead;
}
case Status::ReadingRequest: {
std::size_t len;
uint8_t type;
switch (session_->type()) {
case utils::Session::Type::Domain:
len = 10;
type = 1;
break;
case utils::Session::Type::Address:
if (session_->address().is_v4()) {
len = 10;
type = 1;
} else {
len = 22;
type = 4;
}
break;
}
buffer->ReleaseBack(len);
auto data = static_cast<uint8_t *>(buffer->buffer());
*data = 5;
*(data + 1) = 0;
*(data + 2) = 0;
*(data + 3) = type;
std::memset(data + 4, 0, len - 4);
return ActionRequest::Ready;
}
}
}
std::error_code Socks5ServerStreamCoder::GetLastError() const {
return last_error_;
}
bool Socks5ServerStreamCoder::forwarding() const {
return status_ == Status::Forwarding;
}
ActionRequest Socks5ServerStreamCoder::ReportError(std::error_code error) {
// It is possible to report it elegantly.
last_error_ = error;
return ActionRequest::ErrorHappened;
}
ActionRequest Socks5ServerStreamCoder::Continue() {
return ActionRequest::WantWrite;
}
std::shared_ptr<utils::Session> Socks5ServerStreamCoder::session() const {
return session_;
}
namespace {
struct Socks5ServerStreamCoderErrorCategory : std::error_category {
const char *name() const noexcept override;
std::string message(int) const override;
};
const char *Socks5ServerStreamCoderErrorCategory::name() const BOOST_NOEXCEPT {
return "SOCKS5 server stream coder";
}
std::string Socks5ServerStreamCoderErrorCategory::message(
int error_code) const {
switch (static_cast<Socks5ServerStreamCoder::ErrorCode>(error_code)) {
case Socks5ServerStreamCoder::ErrorCode::NoError:
return "no error";
case Socks5ServerStreamCoder::ErrorCode::RequestIncomplete:
return "client send incomplete request";
case Socks5ServerStreamCoder::ErrorCode::UnsupportedAuthenticationMethod:
return "all client requested authentication methods are not "
"supported";
case Socks5ServerStreamCoder::ErrorCode::UnsupportedCommand:
return "unknown command";
case Socks5ServerStreamCoder::ErrorCode::UnsupportedAddressType:
return "unknown address type";
case Socks5ServerStreamCoder::ErrorCode::UnsupportedVersion:
return "SOCKS version is not supported";
}
}
const Socks5ServerStreamCoderErrorCategory
socks5ServerStreamCoderErrorCategory{};
} // namespace
std::error_code make_error_code(Socks5ServerStreamCoder::ErrorCode ec) {
return {static_cast<int>(ec), socks5ServerStreamCoderErrorCategory};
}
std::unique_ptr<ServerStreamCoderInterface>
Socks5ServerStreamCoderFactory::Build() {
return std::make_unique<Socks5ServerStreamCoder>();
}
} // namespace stream_coder
} // namespace nekit
|
// MIT License
// Copyright (c) 2017 Zhuhao Wang
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
#include <cassert>
#include "nekit/stream_coder/socks5_server_stream_coder.h"
namespace nekit {
namespace stream_coder {
Socks5ServerStreamCoder::Socks5ServerStreamCoder()
: status_(Status::ReadingVersion) {}
ActionRequest Socks5ServerStreamCoder::Negotiate() {
return ActionRequest::WantRead;
}
utils::BufferReserveSize Socks5ServerStreamCoder::DecodeReserve() const {
switch (status_) {
case Status::Forwarding:
case Status::ReadingVersion:
case Status::ReadingRequest:
return {0, 0};
default:
assert(false);
}
}
ActionRequest Socks5ServerStreamCoder::Decode(utils::Buffer *buffer) {
switch (status_) {
case Status::Forwarding:
return ActionRequest::Continue;
case Status::ReadingVersion: {
if (buffer->capacity() <= 2) {
last_error_ = ErrorCode::RequestIncomplete;
return ActionRequest::ErrorHappened;
}
auto data = static_cast<uint8_t *>(buffer->buffer());
if (*data++ != 5) {
last_error_ = ErrorCode::UnsupportedVersion;
return ActionRequest::ErrorHappened;
}
auto len = *data++;
if (buffer->capacity() != 2 + len) {
last_error_ = ErrorCode::RequestIncomplete;
return ActionRequest::ErrorHappened;
}
bool supported = false;
while (len--) {
// Only no auth is supported
if (*data++ == 0) {
supported = true;
break;
}
}
if (!supported) {
last_error_ = ErrorCode::UnsupportedAuthenticationMethod;
return ActionRequest::ErrorHappened;
}
return ActionRequest::WantWrite;
} break;
case Status::ReadingRequest: {
if (buffer->capacity() < 10) {
last_error_ = ErrorCode::RequestIncomplete;
return ActionRequest::ErrorHappened;
}
auto data = static_cast<uint8_t *>(buffer->buffer());
if (*data++ != 5) {
last_error_ = ErrorCode::UnsupportedVersion;
return ActionRequest::ErrorHappened;
}
if (*data++ != 1) {
last_error_ = ErrorCode::UnsupportedCommand;
return ActionRequest::ErrorHappened;
}
data++;
switch (*data++) {
case 1: {
if (buffer->capacity() != 4 + 4 + 2) {
last_error_ = ErrorCode::RequestIncomplete;
return ActionRequest::ErrorHappened;
}
auto bytes = boost::asio::ip::address_v4::bytes_type();
std::memcpy(bytes.data(), data, bytes.size());
session_.reset(
new utils::Session(boost::asio::ip::address_v4(bytes)));
data += 4;
} break;
case 3: {
auto len = *data++;
if (buffer->capacity() != 4 + 1 + len + 2) {
last_error_ = ErrorCode::RequestIncomplete;
return ActionRequest::ErrorHappened;
}
session_.reset(new utils::Session(
std::string(reinterpret_cast<char *>(data), len)));
data += len;
} break;
case 4: {
if (buffer->capacity() != 4 + 16 + 2) {
last_error_ = ErrorCode::RequestIncomplete;
return ActionRequest::ErrorHappened;
}
auto bytes = boost::asio::ip::address_v6::bytes_type();
std::memcpy(bytes.data(), data, bytes.size());
session_.reset(
new utils::Session(boost::asio::ip::address_v6(bytes)));
data += 16;
} break;
default: {
last_error_ = ErrorCode::UnsupportedAddressType;
return ActionRequest::ErrorHappened;
}
}
session_->setPort(ntohs(*reinterpret_cast<uint16_t *>(data)));
return ActionRequest::Event;
}
}
}
utils::BufferReserveSize Socks5ServerStreamCoder::EncodeReserve() const {
switch (status_) {
case Status::Forwarding:
return {0, 0};
case Status::ReadingVersion:
return {0, 2};
case Status::ReadingRequest:
switch (session_->type()) {
case utils::Session::Type::Domain:
return {0, 10};
case utils::Session::Type::Address:
if (session_->address().is_v4()) {
return {0, 10};
} else {
return {0, 22};
}
}
}
}
ActionRequest Socks5ServerStreamCoder::Encode(utils::Buffer *buffer) {
switch (status_) {
case Status::Forwarding:
return ActionRequest::Continue;
case Status::ReadingVersion: {
buffer->ReleaseBack(2);
assert(buffer->capacity() >= 2);
auto data = static_cast<uint8_t *>(buffer->buffer());
*data = 5;
*(data + 1) = 0;
status_ = Status::ReadingRequest;
return ActionRequest::WantRead;
}
case Status::ReadingRequest: {
std::size_t len;
uint8_t type;
switch (session_->type()) {
case utils::Session::Type::Domain:
len = 10;
type = 1;
break;
case utils::Session::Type::Address:
if (session_->address().is_v4()) {
len = 10;
type = 1;
} else {
len = 22;
type = 4;
}
break;
}
buffer->ReleaseBack(len);
auto data = static_cast<uint8_t *>(buffer->buffer());
*data = 5;
*(data + 1) = 0;
*(data + 2) = 0;
*(data + 3) = type;
std::memset(data + 4, 0, len - 4);
status_ = Status::Forwarding;
return ActionRequest::Ready;
}
}
}
std::error_code Socks5ServerStreamCoder::GetLastError() const {
return last_error_;
}
bool Socks5ServerStreamCoder::forwarding() const {
return status_ == Status::Forwarding;
}
ActionRequest Socks5ServerStreamCoder::ReportError(std::error_code error) {
// It is possible to report it elegantly.
last_error_ = error;
return ActionRequest::ErrorHappened;
}
ActionRequest Socks5ServerStreamCoder::Continue() {
return ActionRequest::WantWrite;
}
std::shared_ptr<utils::Session> Socks5ServerStreamCoder::session() const {
return session_;
}
namespace {
struct Socks5ServerStreamCoderErrorCategory : std::error_category {
const char *name() const noexcept override;
std::string message(int) const override;
};
const char *Socks5ServerStreamCoderErrorCategory::name() const BOOST_NOEXCEPT {
return "SOCKS5 server stream coder";
}
std::string Socks5ServerStreamCoderErrorCategory::message(
int error_code) const {
switch (static_cast<Socks5ServerStreamCoder::ErrorCode>(error_code)) {
case Socks5ServerStreamCoder::ErrorCode::NoError:
return "no error";
case Socks5ServerStreamCoder::ErrorCode::RequestIncomplete:
return "client send incomplete request";
case Socks5ServerStreamCoder::ErrorCode::UnsupportedAuthenticationMethod:
return "all client requested authentication methods are not "
"supported";
case Socks5ServerStreamCoder::ErrorCode::UnsupportedCommand:
return "unknown command";
case Socks5ServerStreamCoder::ErrorCode::UnsupportedAddressType:
return "unknown address type";
case Socks5ServerStreamCoder::ErrorCode::UnsupportedVersion:
return "SOCKS version is not supported";
}
}
const Socks5ServerStreamCoderErrorCategory
socks5ServerStreamCoderErrorCategory{};
} // namespace
std::error_code make_error_code(Socks5ServerStreamCoder::ErrorCode ec) {
return {static_cast<int>(ec), socks5ServerStreamCoderErrorCategory};
}
std::unique_ptr<ServerStreamCoderInterface>
Socks5ServerStreamCoderFactory::Build() {
return std::make_unique<Socks5ServerStreamCoder>();
}
} // namespace stream_coder
} // namespace nekit
|
Fix that the status is not updated in socks5 server socket
|
FIX: Fix that the status is not updated in socks5 server socket
|
C++
|
mit
|
zhuhaow/libnekit,zhuhaow/libnekit,zhuhaow/libnekit,zhuhaow/libnekit
|
92e29dc5b0474c073b0f05d60629fc6c3decfca4
|
src/gallium/auxiliary/gallivm/lp_bld_debug.cpp
|
src/gallium/auxiliary/gallivm/lp_bld_debug.cpp
|
/**************************************************************************
*
* Copyright 2009-2011 VMware, Inc.
* All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sub license, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice (including the
* next paragraph) shall be included in all copies or substantial portions
* of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
* IN NO EVENT SHALL VMWARE AND/OR ITS SUPPLIERS BE LIABLE FOR
* ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
**************************************************************************/
#include <llvm-c/Core.h>
#include <llvm/Target/TargetMachine.h>
#include <llvm/Target/TargetRegistry.h>
#include <llvm/Target/TargetSelect.h>
#include <llvm/Target/TargetInstrInfo.h>
#include <llvm/Support/raw_ostream.h>
#include <llvm/Support/MemoryObject.h>
#if HAVE_LLVM >= 0x0209
#include <llvm/Support/Host.h>
#else
#include <llvm/System/Host.h>
#endif
#if HAVE_LLVM >= 0x0207
#include <llvm/MC/MCDisassembler.h>
#include <llvm/MC/MCAsmInfo.h>
#include <llvm/MC/MCInst.h>
#include <llvm/MC/MCInstPrinter.h>
#endif /* HAVE_LLVM >= 0x0207 */
#include "util/u_math.h"
#include "util/u_debug.h"
#include "lp_bld_debug.h"
/**
* Check alignment.
*
* It is important that this check is not implemented as a macro or inlined
* function, as the compiler assumptions in respect to alignment of global
* and stack variables would often make the check a no op, defeating the
* whole purpose of the exercise.
*/
extern "C" boolean
lp_check_alignment(const void *ptr, unsigned alignment)
{
assert(util_is_power_of_two(alignment));
return ((uintptr_t)ptr & (alignment - 1)) == 0;
}
class raw_debug_ostream :
public llvm::raw_ostream
{
uint64_t pos;
void write_impl(const char *Ptr, size_t Size);
uint64_t current_pos() { return pos; }
uint64_t current_pos() const { return pos; }
#if HAVE_LLVM >= 0x207
uint64_t preferred_buffer_size() { return 512; }
#else
size_t preferred_buffer_size() { return 512; }
#endif
};
void
raw_debug_ostream::write_impl(const char *Ptr, size_t Size)
{
if (Size > 0) {
char *lastPtr = (char *)&Ptr[Size];
char last = *lastPtr;
*lastPtr = 0;
_debug_printf("%*s", Size, Ptr);
*lastPtr = last;
pos += Size;
}
}
/**
* Same as LLVMDumpValue, but through our debugging channels.
*/
extern "C" void
lp_debug_dump_value(LLVMValueRef value)
{
#if (defined(PIPE_OS_WINDOWS) && !defined(PIPE_CC_MSVC)) || defined(PIPE_OS_EMBDDED)
raw_debug_ostream os;
llvm::unwrap(value)->print(os);
os.flush();
#else
LLVMDumpValue(value);
#endif
}
#if HAVE_LLVM >= 0x0207
/*
* MemoryObject wrapper around a buffer of memory, to be used by MC
* disassembler.
*/
class BufferMemoryObject:
public llvm::MemoryObject
{
private:
const uint8_t *Bytes;
uint64_t Length;
public:
BufferMemoryObject(const uint8_t *bytes, uint64_t length) :
Bytes(bytes), Length(length)
{
}
uint64_t getBase() const
{
return 0;
}
uint64_t getExtent() const
{
return Length;
}
int readByte(uint64_t addr, uint8_t *byte) const
{
if (addr > getExtent())
return -1;
*byte = Bytes[addr];
return 0;
}
};
#endif /* HAVE_LLVM >= 0x0207 */
/*
* Disassemble a function, using the LLVM MC disassembler.
*
* See also:
* - http://blog.llvm.org/2010/01/x86-disassembler.html
* - http://blog.llvm.org/2010/04/intro-to-llvm-mc-project.html
*/
extern "C" void
lp_disassemble(const void* func)
{
#if HAVE_LLVM >= 0x0207
using namespace llvm;
const uint8_t *bytes = (const uint8_t *)func;
/*
* Limit disassembly to this extent
*/
const uint64_t extent = 0x10000;
uint64_t max_pc = 0;
/*
* Initialize all used objects.
*/
std::string Triple = sys::getHostTriple();
std::string Error;
const Target *T = TargetRegistry::lookupTarget(Triple, Error);
#if HAVE_LLVM >= 0x0208
InitializeNativeTargetAsmPrinter();
#else
InitializeAllAsmPrinters();
#endif
InitializeAllDisassemblers();
OwningPtr<const MCAsmInfo> AsmInfo(T->createAsmInfo(Triple));
if (!AsmInfo) {
debug_printf("error: no assembly info for target %s\n", Triple.c_str());
return;
}
OwningPtr<const MCDisassembler> DisAsm(T->createMCDisassembler());
if (!DisAsm) {
debug_printf("error: no disassembler for target %s\n", Triple.c_str());
return;
}
raw_debug_ostream Out;
TargetMachine *TM = T->createTargetMachine(Triple, "");
#if HAVE_LLVM >= 0x0209
unsigned int AsmPrinterVariant = AsmInfo->getAssemblerDialect();
#else
int AsmPrinterVariant = AsmInfo->getAssemblerDialect();
#endif
#if HAVE_LLVM >= 0x0209
OwningPtr<MCInstPrinter> Printer(
T->createMCInstPrinter(*TM, AsmPrinterVariant, *AsmInfo));
#elif HAVE_LLVM >= 0x0208
OwningPtr<MCInstPrinter> Printer(
T->createMCInstPrinter(AsmPrinterVariant, *AsmInfo));
#else
OwningPtr<MCInstPrinter> Printer(
T->createMCInstPrinter(AsmPrinterVariant, *AsmInfo, Out));
#endif
if (!Printer) {
debug_printf("error: no instruction printer for target %s\n", Triple.c_str());
return;
}
const TargetInstrInfo *TII = TM->getInstrInfo();
/*
* Wrap the data in a MemoryObject
*/
BufferMemoryObject memoryObject((const uint8_t *)bytes, extent);
uint64_t pc;
pc = 0;
while (true) {
MCInst Inst;
uint64_t Size;
/*
* Print address. We use addresses relative to the start of the function,
* so that between runs.
*/
debug_printf("%6lu:\t", (unsigned long)pc);
if (!DisAsm->getInstruction(Inst, Size, memoryObject,
pc,
nulls())) {
debug_printf("invalid\n");
pc += 1;
}
/*
* Output the bytes in hexidecimal format.
*/
if (0) {
unsigned i;
for (i = 0; i < Size; ++i) {
debug_printf("%02x ", ((const uint8_t*)bytes)[pc + i]);
}
for (; i < 16; ++i) {
debug_printf(" ");
}
}
/*
* Print the instruction.
*/
#if HAVE_LLVM >= 0x208
Printer->printInst(&Inst, Out);
#else
Printer->printInst(&Inst);
#endif
Out.flush();
/*
* Advance.
*/
pc += Size;
const TargetInstrDesc &TID = TII->get(Inst.getOpcode());
/*
* Keep track of forward jumps to a nearby address.
*/
if (TID.isBranch()) {
for (unsigned i = 0; i < Inst.getNumOperands(); ++i) {
const MCOperand &operand = Inst.getOperand(i);
if (operand.isImm()) {
uint64_t jump;
/*
* FIXME: Handle both relative and absolute addresses correctly.
* EDInstInfo actually has this info, but operandTypes and
* operandFlags enums are not exposed in the public interface.
*/
if (1) {
/*
* PC relative addr.
*/
jump = pc + operand.getImm();
} else {
/*
* Absolute addr.
*/
jump = (uint64_t)operand.getImm();
}
/*
* Output the address relative to the function start, given
* that MC will print the addresses relative the current pc.
*/
debug_printf("\t\t; %lu", (unsigned long)jump);
/*
* Ignore far jumps given it could be actually a tail return to
* a random address.
*/
if (jump > max_pc &&
jump < extent) {
max_pc = jump;
}
}
}
}
debug_printf("\n");
/*
* Stop disassembling on return statements, if there is no record of a
* jump to a successive address.
*/
if (TID.isReturn()) {
if (pc > max_pc) {
break;
}
}
}
/*
* Print GDB command, useful to verify output.
*/
if (0) {
debug_printf("disassemble %p %p\n", bytes, bytes + pc);
}
debug_printf("\n");
#else /* HAVE_LLVM < 0x0207 */
(void)func;
#endif /* HAVE_LLVM < 0x0207 */
}
|
/**************************************************************************
*
* Copyright 2009-2011 VMware, Inc.
* All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sub license, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice (including the
* next paragraph) shall be included in all copies or substantial portions
* of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
* IN NO EVENT SHALL VMWARE AND/OR ITS SUPPLIERS BE LIABLE FOR
* ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
**************************************************************************/
#include <llvm-c/Core.h>
#include <llvm/Target/TargetMachine.h>
#include <llvm/Target/TargetRegistry.h>
#include <llvm/Target/TargetSelect.h>
#include <llvm/Target/TargetInstrInfo.h>
#include <llvm/Support/raw_ostream.h>
#include <llvm/Support/MemoryObject.h>
#if HAVE_LLVM >= 0x0209
#include <llvm/Support/Host.h>
#else
#include <llvm/System/Host.h>
#endif
#if HAVE_LLVM >= 0x0207
#include <llvm/MC/MCDisassembler.h>
#include <llvm/MC/MCAsmInfo.h>
#include <llvm/MC/MCInst.h>
#include <llvm/MC/MCInstPrinter.h>
#endif /* HAVE_LLVM >= 0x0207 */
#include "util/u_math.h"
#include "util/u_debug.h"
#include "lp_bld_debug.h"
/**
* Check alignment.
*
* It is important that this check is not implemented as a macro or inlined
* function, as the compiler assumptions in respect to alignment of global
* and stack variables would often make the check a no op, defeating the
* whole purpose of the exercise.
*/
extern "C" boolean
lp_check_alignment(const void *ptr, unsigned alignment)
{
assert(util_is_power_of_two(alignment));
return ((uintptr_t)ptr & (alignment - 1)) == 0;
}
class raw_debug_ostream :
public llvm::raw_ostream
{
uint64_t pos;
void write_impl(const char *Ptr, size_t Size);
uint64_t current_pos() { return pos; }
uint64_t current_pos() const { return pos; }
#if HAVE_LLVM >= 0x207
uint64_t preferred_buffer_size() { return 512; }
#else
size_t preferred_buffer_size() { return 512; }
#endif
};
void
raw_debug_ostream::write_impl(const char *Ptr, size_t Size)
{
if (Size > 0) {
char *lastPtr = (char *)&Ptr[Size];
char last = *lastPtr;
*lastPtr = 0;
_debug_printf("%*s", Size, Ptr);
*lastPtr = last;
pos += Size;
}
}
/**
* Same as LLVMDumpValue, but through our debugging channels.
*/
extern "C" void
lp_debug_dump_value(LLVMValueRef value)
{
#if (defined(PIPE_OS_WINDOWS) && !defined(PIPE_CC_MSVC)) || defined(PIPE_OS_EMBDDED)
raw_debug_ostream os;
llvm::unwrap(value)->print(os);
os.flush();
#else
LLVMDumpValue(value);
#endif
}
#if HAVE_LLVM >= 0x0207
/*
* MemoryObject wrapper around a buffer of memory, to be used by MC
* disassembler.
*/
class BufferMemoryObject:
public llvm::MemoryObject
{
private:
const uint8_t *Bytes;
uint64_t Length;
public:
BufferMemoryObject(const uint8_t *bytes, uint64_t length) :
Bytes(bytes), Length(length)
{
}
uint64_t getBase() const
{
return 0;
}
uint64_t getExtent() const
{
return Length;
}
int readByte(uint64_t addr, uint8_t *byte) const
{
if (addr > getExtent())
return -1;
*byte = Bytes[addr];
return 0;
}
};
#endif /* HAVE_LLVM >= 0x0207 */
/*
* Disassemble a function, using the LLVM MC disassembler.
*
* See also:
* - http://blog.llvm.org/2010/01/x86-disassembler.html
* - http://blog.llvm.org/2010/04/intro-to-llvm-mc-project.html
*/
extern "C" void
lp_disassemble(const void* func)
{
#if HAVE_LLVM >= 0x0207
using namespace llvm;
const uint8_t *bytes = (const uint8_t *)func;
/*
* Limit disassembly to this extent
*/
const uint64_t extent = 0x10000;
uint64_t max_pc = 0;
/*
* Initialize all used objects.
*/
std::string Triple = sys::getHostTriple();
std::string Error;
const Target *T = TargetRegistry::lookupTarget(Triple, Error);
#if HAVE_LLVM >= 0x0208
InitializeNativeTargetAsmPrinter();
#else
InitializeAllAsmPrinters();
#endif
InitializeAllDisassemblers();
OwningPtr<const MCAsmInfo> AsmInfo(T->createAsmInfo(Triple));
if (!AsmInfo) {
debug_printf("error: no assembly info for target %s\n", Triple.c_str());
return;
}
OwningPtr<const MCDisassembler> DisAsm(T->createMCDisassembler());
if (!DisAsm) {
debug_printf("error: no disassembler for target %s\n", Triple.c_str());
return;
}
raw_debug_ostream Out;
TargetMachine *TM = T->createTargetMachine(Triple, "");
#if HAVE_LLVM >= 0x0300
unsigned int AsmPrinterVariant = AsmInfo->getAssemblerDialect();
#else
int AsmPrinterVariant = AsmInfo->getAssemblerDialect();
#endif
#if HAVE_LLVM >= 0x0300
OwningPtr<MCInstPrinter> Printer(
T->createMCInstPrinter(*TM, AsmPrinterVariant, *AsmInfo));
#elif HAVE_LLVM >= 0x0208
OwningPtr<MCInstPrinter> Printer(
T->createMCInstPrinter(AsmPrinterVariant, *AsmInfo));
#else
OwningPtr<MCInstPrinter> Printer(
T->createMCInstPrinter(AsmPrinterVariant, *AsmInfo, Out));
#endif
if (!Printer) {
debug_printf("error: no instruction printer for target %s\n", Triple.c_str());
return;
}
const TargetInstrInfo *TII = TM->getInstrInfo();
/*
* Wrap the data in a MemoryObject
*/
BufferMemoryObject memoryObject((const uint8_t *)bytes, extent);
uint64_t pc;
pc = 0;
while (true) {
MCInst Inst;
uint64_t Size;
/*
* Print address. We use addresses relative to the start of the function,
* so that between runs.
*/
debug_printf("%6lu:\t", (unsigned long)pc);
if (!DisAsm->getInstruction(Inst, Size, memoryObject,
pc,
nulls())) {
debug_printf("invalid\n");
pc += 1;
}
/*
* Output the bytes in hexidecimal format.
*/
if (0) {
unsigned i;
for (i = 0; i < Size; ++i) {
debug_printf("%02x ", ((const uint8_t*)bytes)[pc + i]);
}
for (; i < 16; ++i) {
debug_printf(" ");
}
}
/*
* Print the instruction.
*/
#if HAVE_LLVM >= 0x208
Printer->printInst(&Inst, Out);
#else
Printer->printInst(&Inst);
#endif
Out.flush();
/*
* Advance.
*/
pc += Size;
const TargetInstrDesc &TID = TII->get(Inst.getOpcode());
/*
* Keep track of forward jumps to a nearby address.
*/
if (TID.isBranch()) {
for (unsigned i = 0; i < Inst.getNumOperands(); ++i) {
const MCOperand &operand = Inst.getOperand(i);
if (operand.isImm()) {
uint64_t jump;
/*
* FIXME: Handle both relative and absolute addresses correctly.
* EDInstInfo actually has this info, but operandTypes and
* operandFlags enums are not exposed in the public interface.
*/
if (1) {
/*
* PC relative addr.
*/
jump = pc + operand.getImm();
} else {
/*
* Absolute addr.
*/
jump = (uint64_t)operand.getImm();
}
/*
* Output the address relative to the function start, given
* that MC will print the addresses relative the current pc.
*/
debug_printf("\t\t; %lu", (unsigned long)jump);
/*
* Ignore far jumps given it could be actually a tail return to
* a random address.
*/
if (jump > max_pc &&
jump < extent) {
max_pc = jump;
}
}
}
}
debug_printf("\n");
/*
* Stop disassembling on return statements, if there is no record of a
* jump to a successive address.
*/
if (TID.isReturn()) {
if (pc > max_pc) {
break;
}
}
}
/*
* Print GDB command, useful to verify output.
*/
if (0) {
debug_printf("disassemble %p %p\n", bytes, bytes + pc);
}
debug_printf("\n");
#else /* HAVE_LLVM < 0x0207 */
(void)func;
#endif /* HAVE_LLVM < 0x0207 */
}
|
Fix build with llvm-2.9.
|
gallivm: Fix build with llvm-2.9.
The build fix of commit 40ae214067673edbda79371969d1730b6194d83e does
not apply to llvm-2.9 but rather to llvm-3.0svn.
|
C++
|
mit
|
zz85/glsl-optimizer,bkaradzic/glsl-optimizer,djreep81/glsl-optimizer,bkaradzic/glsl-optimizer,KTXSoftware/glsl2agal,zz85/glsl-optimizer,mcanthony/glsl-optimizer,mcanthony/glsl-optimizer,bkaradzic/glsl-optimizer,KTXSoftware/glsl2agal,benaadams/glsl-optimizer,mcanthony/glsl-optimizer,metora/MesaGLSLCompiler,jbarczak/glsl-optimizer,zeux/glsl-optimizer,bkaradzic/glsl-optimizer,jbarczak/glsl-optimizer,tokyovigilante/glsl-optimizer,zeux/glsl-optimizer,metora/MesaGLSLCompiler,metora/MesaGLSLCompiler,zeux/glsl-optimizer,adobe/glsl2agal,benaadams/glsl-optimizer,mapbox/glsl-optimizer,mapbox/glsl-optimizer,tokyovigilante/glsl-optimizer,djreep81/glsl-optimizer,zeux/glsl-optimizer,mapbox/glsl-optimizer,jbarczak/glsl-optimizer,djreep81/glsl-optimizer,wolf96/glsl-optimizer,zz85/glsl-optimizer,KTXSoftware/glsl2agal,tokyovigilante/glsl-optimizer,mcanthony/glsl-optimizer,zeux/glsl-optimizer,dellis1972/glsl-optimizer,zz85/glsl-optimizer,djreep81/glsl-optimizer,dellis1972/glsl-optimizer,dellis1972/glsl-optimizer,mapbox/glsl-optimizer,adobe/glsl2agal,tokyovigilante/glsl-optimizer,zz85/glsl-optimizer,benaadams/glsl-optimizer,dellis1972/glsl-optimizer,dellis1972/glsl-optimizer,benaadams/glsl-optimizer,benaadams/glsl-optimizer,KTXSoftware/glsl2agal,jbarczak/glsl-optimizer,adobe/glsl2agal,adobe/glsl2agal,KTXSoftware/glsl2agal,tokyovigilante/glsl-optimizer,adobe/glsl2agal,wolf96/glsl-optimizer,zz85/glsl-optimizer,djreep81/glsl-optimizer,benaadams/glsl-optimizer,wolf96/glsl-optimizer,wolf96/glsl-optimizer,jbarczak/glsl-optimizer,mapbox/glsl-optimizer,wolf96/glsl-optimizer,bkaradzic/glsl-optimizer,mcanthony/glsl-optimizer
|
5d63a467a131ade20730141464fad9bff49c7e27
|
media/filters/ffmpeg_video_decode_engine.cc
|
media/filters/ffmpeg_video_decode_engine.cc
|
// Copyright (c) 2010 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "media/filters/ffmpeg_video_decode_engine.h"
#include "base/command_line.h"
#include "base/string_number_conversions.h"
#include "base/task.h"
#include "media/base/buffers.h"
#include "media/base/callback.h"
#include "media/base/limits.h"
#include "media/base/media_switches.h"
#include "media/ffmpeg/ffmpeg_common.h"
#include "media/ffmpeg/ffmpeg_util.h"
#include "media/filters/ffmpeg_demuxer.h"
namespace media {
FFmpegVideoDecodeEngine::FFmpegVideoDecodeEngine()
: codec_context_(NULL),
av_stream_(NULL),
event_handler_(NULL) {
}
FFmpegVideoDecodeEngine::~FFmpegVideoDecodeEngine() {
}
void FFmpegVideoDecodeEngine::Initialize(
MessageLoop* message_loop,
VideoDecodeEngine::EventHandler* event_handler,
const VideoCodecConfig& config) {
// Always try to use three threads for video decoding. There is little reason
// not to since current day CPUs tend to be multi-core and we measured
// performance benefits on older machines such as P4s with hyperthreading.
//
// Handling decoding on separate threads also frees up the pipeline thread to
// continue processing. Although it'd be nice to have the option of a single
// decoding thread, FFmpeg treats having one thread the same as having zero
// threads (i.e., avcodec_decode_video() will execute on the calling thread).
// Yet another reason for having three threads :)
static const int kDecodeThreads = 3;
static const int kMaxDecodeThreads = 16;
av_stream_ = static_cast<AVStream*>(config.opaque_context_);
codec_context_ = av_stream_->codec;
codec_context_->flags2 |= CODEC_FLAG2_FAST; // Enable faster H264 decode.
// Enable motion vector search (potentially slow), strong deblocking filter
// for damaged macroblocks, and set our error detection sensitivity.
codec_context_->error_concealment = FF_EC_GUESS_MVS | FF_EC_DEBLOCK;
codec_context_->error_recognition = FF_ER_CAREFUL;
AVCodec* codec = avcodec_find_decoder(codec_context_->codec_id);
// TODO(fbarchard): Improve thread logic based on size / codec.
int decode_threads = kDecodeThreads;
const CommandLine* cmd_line = CommandLine::ForCurrentProcess();
std::string threads(cmd_line->GetSwitchValueASCII(switches::kVideoThreads));
if ((!threads.empty() &&
!base::StringToInt(threads, &decode_threads)) ||
decode_threads < 0 || decode_threads > kMaxDecodeThreads) {
decode_threads = kDecodeThreads;
}
// We don't allocate AVFrame on the stack since different versions of FFmpeg
// may change the size of AVFrame, causing stack corruption. The solution is
// to let FFmpeg allocate the structure via avcodec_alloc_frame().
av_frame_.reset(avcodec_alloc_frame());
VideoCodecInfo info;
info.success_ = false;
info.provides_buffers_ = false;
info.stream_info_.surface_type_ = VideoFrame::TYPE_SYSTEM_MEMORY;
info.stream_info_.surface_format_ = GetSurfaceFormat();
info.stream_info_.surface_width_ = config.width_;
info.stream_info_.surface_height_ = config.height_;
if (codec &&
avcodec_thread_init(codec_context_, decode_threads) >= 0 &&
avcodec_open(codec_context_, codec) >= 0 &&
av_frame_.get()) {
info.success_ = true;
}
event_handler_ = event_handler;
event_handler_->OnInitializeComplete(info);
}
// TODO(fbarchard): Find way to remove this memcpy of the entire image.
static void CopyPlane(size_t plane,
scoped_refptr<VideoFrame> video_frame,
const AVFrame* frame) {
DCHECK_EQ(video_frame->width() % 2, 0u);
const uint8* source = frame->data[plane];
const size_t source_stride = frame->linesize[plane];
uint8* dest = video_frame->data(plane);
const size_t dest_stride = video_frame->stride(plane);
size_t bytes_per_line = video_frame->width();
size_t copy_lines = video_frame->height();
if (plane != VideoFrame::kYPlane) {
bytes_per_line /= 2;
if (video_frame->format() == VideoFrame::YV12) {
copy_lines = (copy_lines + 1) / 2;
}
}
DCHECK(bytes_per_line <= source_stride && bytes_per_line <= dest_stride);
for (size_t i = 0; i < copy_lines; ++i) {
memcpy(dest, source, bytes_per_line);
source += source_stride;
dest += dest_stride;
}
}
void FFmpegVideoDecodeEngine::EmptyThisBuffer(
scoped_refptr<Buffer> buffer) {
DecodeFrame(buffer);
}
void FFmpegVideoDecodeEngine::FillThisBuffer(scoped_refptr<VideoFrame> frame) {
scoped_refptr<Buffer> buffer;
event_handler_->OnEmptyBufferCallback(buffer);
}
// Try to decode frame when both input and output are ready.
void FFmpegVideoDecodeEngine::DecodeFrame(scoped_refptr<Buffer> buffer) {
scoped_refptr<VideoFrame> video_frame;
// Create a packet for input data.
// Due to FFmpeg API changes we no longer have const read-only pointers.
AVPacket packet;
av_init_packet(&packet);
packet.data = const_cast<uint8*>(buffer->GetData());
packet.size = buffer->GetDataSize();
// Let FFmpeg handle presentation timestamp reordering.
codec_context_->reordered_opaque = buffer->GetTimestamp().InMicroseconds();
// This is for codecs not using get_buffer to initialize
// |av_frame_->reordered_opaque|
av_frame_->reordered_opaque = codec_context_->reordered_opaque;
int frame_decoded = 0;
int result = avcodec_decode_video2(codec_context_,
av_frame_.get(),
&frame_decoded,
&packet);
// Log the problem if we can't decode a video frame and exit early.
if (result < 0) {
LOG(INFO) << "Error decoding a video frame with timestamp: "
<< buffer->GetTimestamp().InMicroseconds() << " us"
<< " , duration: "
<< buffer->GetDuration().InMicroseconds() << " us"
<< " , packet size: "
<< buffer->GetDataSize() << " bytes";
// TODO(jiesun): call event_handler_->OnError() instead.
event_handler_->OnFillBufferCallback(video_frame);
return;
}
// If frame_decoded == 0, then no frame was produced.
if (frame_decoded == 0) {
if (buffer->IsEndOfStream()) // We had started flushing.
event_handler_->OnFillBufferCallback(video_frame);
else
event_handler_->OnEmptyBufferCallback(buffer);
return;
}
// TODO(fbarchard): Work around for FFmpeg http://crbug.com/27675
// The decoder is in a bad state and not decoding correctly.
// Checking for NULL avoids a crash in CopyPlane().
if (!av_frame_->data[VideoFrame::kYPlane] ||
!av_frame_->data[VideoFrame::kUPlane] ||
!av_frame_->data[VideoFrame::kVPlane]) {
// TODO(jiesun): call event_handler_->OnError() instead.
event_handler_->OnFillBufferCallback(video_frame);
return;
}
// Determine timestamp and calculate the duration based on the repeat picture
// count. According to FFmpeg docs, the total duration can be calculated as
// follows:
// duration = (1 / fps) + (repeat_pict) / (2 * fps)
// = (2 + repeat_pict) / (2 * fps)
DCHECK_LE(av_frame_->repeat_pict, 2); // Sanity check.
// Even frame rate is fixed, for some streams and codecs, the value of
// |codec_context_->time_base| and |av_stream_->time_base| are not the
// inverse of the |av_stream_->r_frame_rate|. They use 1 milli-second as
// time-base units and use increment of av_packet->pts which is not one.
// Use the inverse of |av_stream_->r_frame_rate| instead of time_base.
AVRational doubled_time_base;
doubled_time_base.den = av_stream_->r_frame_rate.num;
doubled_time_base.num = av_stream_->r_frame_rate.den;
doubled_time_base.den *= 2;
base::TimeDelta timestamp =
base::TimeDelta::FromMicroseconds(av_frame_->reordered_opaque);
base::TimeDelta duration =
ConvertTimestamp(doubled_time_base, 2 + av_frame_->repeat_pict);
VideoFrame::CreateFrame(GetSurfaceFormat(),
codec_context_->width,
codec_context_->height,
timestamp,
duration,
&video_frame);
if (!video_frame.get()) {
// TODO(jiesun): call event_handler_->OnError() instead.
event_handler_->OnFillBufferCallback(video_frame);
return;
}
// Copy the frame data since FFmpeg reuses internal buffers for AVFrame
// output, meaning the data is only valid until the next
// avcodec_decode_video() call.
// TODO(scherkus): figure out pre-allocation/buffer cycling scheme.
// TODO(scherkus): is there a cleaner way to figure out the # of planes?
CopyPlane(VideoFrame::kYPlane, video_frame.get(), av_frame_.get());
CopyPlane(VideoFrame::kUPlane, video_frame.get(), av_frame_.get());
CopyPlane(VideoFrame::kVPlane, video_frame.get(), av_frame_.get());
event_handler_->OnFillBufferCallback(video_frame);
}
void FFmpegVideoDecodeEngine::Uninitialize() {
// TODO(jiesun): Release buffers when we support buffer recycling.
event_handler_->OnUninitializeComplete();
}
void FFmpegVideoDecodeEngine::Flush() {
avcodec_flush_buffers(codec_context_);
event_handler_->OnFlushComplete();
}
void FFmpegVideoDecodeEngine::Seek() {
event_handler_->OnSeekComplete();
}
VideoFrame::Format FFmpegVideoDecodeEngine::GetSurfaceFormat() const {
// J (Motion JPEG) versions of YUV are full range 0..255.
// Regular (MPEG) YUV is 16..240.
// For now we will ignore the distinction and treat them the same.
switch (codec_context_->pix_fmt) {
case PIX_FMT_YUV420P:
case PIX_FMT_YUVJ420P:
return VideoFrame::YV12;
break;
case PIX_FMT_YUV422P:
case PIX_FMT_YUVJ422P:
return VideoFrame::YV16;
break;
default:
// TODO(scherkus): More formats here?
return VideoFrame::INVALID;
}
}
} // namespace media
|
// Copyright (c) 2010 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "media/filters/ffmpeg_video_decode_engine.h"
#include "base/command_line.h"
#include "base/string_number_conversions.h"
#include "base/task.h"
#include "media/base/buffers.h"
#include "media/base/callback.h"
#include "media/base/limits.h"
#include "media/base/media_switches.h"
#include "media/ffmpeg/ffmpeg_common.h"
#include "media/ffmpeg/ffmpeg_util.h"
#include "media/filters/ffmpeg_demuxer.h"
namespace media {
FFmpegVideoDecodeEngine::FFmpegVideoDecodeEngine()
: codec_context_(NULL),
av_stream_(NULL),
event_handler_(NULL) {
}
FFmpegVideoDecodeEngine::~FFmpegVideoDecodeEngine() {
}
void FFmpegVideoDecodeEngine::Initialize(
MessageLoop* message_loop,
VideoDecodeEngine::EventHandler* event_handler,
const VideoCodecConfig& config) {
// Always try to use three threads for video decoding. There is little reason
// not to since current day CPUs tend to be multi-core and we measured
// performance benefits on older machines such as P4s with hyperthreading.
//
// Handling decoding on separate threads also frees up the pipeline thread to
// continue processing. Although it'd be nice to have the option of a single
// decoding thread, FFmpeg treats having one thread the same as having zero
// threads (i.e., avcodec_decode_video() will execute on the calling thread).
// Yet another reason for having three threads :)
static const int kDecodeThreads = 3;
static const int kMaxDecodeThreads = 16;
av_stream_ = static_cast<AVStream*>(config.opaque_context_);
codec_context_ = av_stream_->codec;
codec_context_->flags2 |= CODEC_FLAG2_FAST; // Enable faster H264 decode.
// Enable motion vector search (potentially slow), strong deblocking filter
// for damaged macroblocks, and set our error detection sensitivity.
codec_context_->error_concealment = FF_EC_GUESS_MVS | FF_EC_DEBLOCK;
codec_context_->error_recognition = FF_ER_CAREFUL;
AVCodec* codec = avcodec_find_decoder(codec_context_->codec_id);
// TODO(fbarchard): Improve thread logic based on size / codec.
// TODO(fbarchard): Fix bug affecting video-cookie.html
int decode_threads = (codec_context_->codec_id == CODEC_ID_THEORA) ?
1 : kDecodeThreads;
const CommandLine* cmd_line = CommandLine::ForCurrentProcess();
std::string threads(cmd_line->GetSwitchValueASCII(switches::kVideoThreads));
if ((!threads.empty() &&
!base::StringToInt(threads, &decode_threads)) ||
decode_threads < 0 || decode_threads > kMaxDecodeThreads) {
decode_threads = kDecodeThreads;
}
// We don't allocate AVFrame on the stack since different versions of FFmpeg
// may change the size of AVFrame, causing stack corruption. The solution is
// to let FFmpeg allocate the structure via avcodec_alloc_frame().
av_frame_.reset(avcodec_alloc_frame());
VideoCodecInfo info;
info.success_ = false;
info.provides_buffers_ = false;
info.stream_info_.surface_type_ = VideoFrame::TYPE_SYSTEM_MEMORY;
info.stream_info_.surface_format_ = GetSurfaceFormat();
info.stream_info_.surface_width_ = config.width_;
info.stream_info_.surface_height_ = config.height_;
if (codec &&
avcodec_thread_init(codec_context_, decode_threads) >= 0 &&
avcodec_open(codec_context_, codec) >= 0 &&
av_frame_.get()) {
info.success_ = true;
}
event_handler_ = event_handler;
event_handler_->OnInitializeComplete(info);
}
// TODO(fbarchard): Find way to remove this memcpy of the entire image.
static void CopyPlane(size_t plane,
scoped_refptr<VideoFrame> video_frame,
const AVFrame* frame) {
DCHECK_EQ(video_frame->width() % 2, 0u);
const uint8* source = frame->data[plane];
const size_t source_stride = frame->linesize[plane];
uint8* dest = video_frame->data(plane);
const size_t dest_stride = video_frame->stride(plane);
size_t bytes_per_line = video_frame->width();
size_t copy_lines = video_frame->height();
if (plane != VideoFrame::kYPlane) {
bytes_per_line /= 2;
if (video_frame->format() == VideoFrame::YV12) {
copy_lines = (copy_lines + 1) / 2;
}
}
DCHECK(bytes_per_line <= source_stride && bytes_per_line <= dest_stride);
for (size_t i = 0; i < copy_lines; ++i) {
memcpy(dest, source, bytes_per_line);
source += source_stride;
dest += dest_stride;
}
}
void FFmpegVideoDecodeEngine::EmptyThisBuffer(
scoped_refptr<Buffer> buffer) {
DecodeFrame(buffer);
}
void FFmpegVideoDecodeEngine::FillThisBuffer(scoped_refptr<VideoFrame> frame) {
scoped_refptr<Buffer> buffer;
event_handler_->OnEmptyBufferCallback(buffer);
}
// Try to decode frame when both input and output are ready.
void FFmpegVideoDecodeEngine::DecodeFrame(scoped_refptr<Buffer> buffer) {
scoped_refptr<VideoFrame> video_frame;
// Create a packet for input data.
// Due to FFmpeg API changes we no longer have const read-only pointers.
AVPacket packet;
av_init_packet(&packet);
packet.data = const_cast<uint8*>(buffer->GetData());
packet.size = buffer->GetDataSize();
// Let FFmpeg handle presentation timestamp reordering.
codec_context_->reordered_opaque = buffer->GetTimestamp().InMicroseconds();
// This is for codecs not using get_buffer to initialize
// |av_frame_->reordered_opaque|
av_frame_->reordered_opaque = codec_context_->reordered_opaque;
int frame_decoded = 0;
int result = avcodec_decode_video2(codec_context_,
av_frame_.get(),
&frame_decoded,
&packet);
// Log the problem if we can't decode a video frame and exit early.
if (result < 0) {
LOG(INFO) << "Error decoding a video frame with timestamp: "
<< buffer->GetTimestamp().InMicroseconds() << " us"
<< " , duration: "
<< buffer->GetDuration().InMicroseconds() << " us"
<< " , packet size: "
<< buffer->GetDataSize() << " bytes";
// TODO(jiesun): call event_handler_->OnError() instead.
event_handler_->OnFillBufferCallback(video_frame);
return;
}
// If frame_decoded == 0, then no frame was produced.
if (frame_decoded == 0) {
if (buffer->IsEndOfStream()) // We had started flushing.
event_handler_->OnFillBufferCallback(video_frame);
else
event_handler_->OnEmptyBufferCallback(buffer);
return;
}
// TODO(fbarchard): Work around for FFmpeg http://crbug.com/27675
// The decoder is in a bad state and not decoding correctly.
// Checking for NULL avoids a crash in CopyPlane().
if (!av_frame_->data[VideoFrame::kYPlane] ||
!av_frame_->data[VideoFrame::kUPlane] ||
!av_frame_->data[VideoFrame::kVPlane]) {
// TODO(jiesun): call event_handler_->OnError() instead.
event_handler_->OnFillBufferCallback(video_frame);
return;
}
// Determine timestamp and calculate the duration based on the repeat picture
// count. According to FFmpeg docs, the total duration can be calculated as
// follows:
// duration = (1 / fps) + (repeat_pict) / (2 * fps)
// = (2 + repeat_pict) / (2 * fps)
DCHECK_LE(av_frame_->repeat_pict, 2); // Sanity check.
// Even frame rate is fixed, for some streams and codecs, the value of
// |codec_context_->time_base| and |av_stream_->time_base| are not the
// inverse of the |av_stream_->r_frame_rate|. They use 1 milli-second as
// time-base units and use increment of av_packet->pts which is not one.
// Use the inverse of |av_stream_->r_frame_rate| instead of time_base.
AVRational doubled_time_base;
doubled_time_base.den = av_stream_->r_frame_rate.num;
doubled_time_base.num = av_stream_->r_frame_rate.den;
doubled_time_base.den *= 2;
base::TimeDelta timestamp =
base::TimeDelta::FromMicroseconds(av_frame_->reordered_opaque);
base::TimeDelta duration =
ConvertTimestamp(doubled_time_base, 2 + av_frame_->repeat_pict);
VideoFrame::CreateFrame(GetSurfaceFormat(),
codec_context_->width,
codec_context_->height,
timestamp,
duration,
&video_frame);
if (!video_frame.get()) {
// TODO(jiesun): call event_handler_->OnError() instead.
event_handler_->OnFillBufferCallback(video_frame);
return;
}
// Copy the frame data since FFmpeg reuses internal buffers for AVFrame
// output, meaning the data is only valid until the next
// avcodec_decode_video() call.
// TODO(scherkus): figure out pre-allocation/buffer cycling scheme.
// TODO(scherkus): is there a cleaner way to figure out the # of planes?
CopyPlane(VideoFrame::kYPlane, video_frame.get(), av_frame_.get());
CopyPlane(VideoFrame::kUPlane, video_frame.get(), av_frame_.get());
CopyPlane(VideoFrame::kVPlane, video_frame.get(), av_frame_.get());
event_handler_->OnFillBufferCallback(video_frame);
}
void FFmpegVideoDecodeEngine::Uninitialize() {
// TODO(jiesun): Release buffers when we support buffer recycling.
event_handler_->OnUninitializeComplete();
}
void FFmpegVideoDecodeEngine::Flush() {
avcodec_flush_buffers(codec_context_);
event_handler_->OnFlushComplete();
}
void FFmpegVideoDecodeEngine::Seek() {
event_handler_->OnSeekComplete();
}
VideoFrame::Format FFmpegVideoDecodeEngine::GetSurfaceFormat() const {
// J (Motion JPEG) versions of YUV are full range 0..255.
// Regular (MPEG) YUV is 16..240.
// For now we will ignore the distinction and treat them the same.
switch (codec_context_->pix_fmt) {
case PIX_FMT_YUV420P:
case PIX_FMT_YUVJ420P:
return VideoFrame::YV12;
break;
case PIX_FMT_YUV422P:
case PIX_FMT_YUVJ422P:
return VideoFrame::YV16;
break;
default:
// TODO(scherkus): More formats here?
return VideoFrame::INVALID;
}
}
} // namespace media
|
revert thread enable for ogv. bug on video-cookie.html likely affects mp4 as well BUG=none TEST=./src/webkit/tools/layout_tests/run_webkit_tests.sh --debug http/tests/media/\* Review URL: http://codereview.chromium.org/3137020
|
revert thread enable for ogv. bug on video-cookie.html likely affects mp4 as well
BUG=none
TEST=./src/webkit/tools/layout_tests/run_webkit_tests.sh --debug http/tests/media/\*
Review URL: http://codereview.chromium.org/3137020
git-svn-id: de016e52bd170d2d4f2344f9bf92d50478b649e0@56478 0039d316-1c4b-4281-b951-d872f2087c98
|
C++
|
bsd-3-clause
|
hgl888/chromium-crosswalk,littlstar/chromium.src,markYoungH/chromium.src,zcbenz/cefode-chromium,crosswalk-project/chromium-crosswalk-efl,PeterWangIntel/chromium-crosswalk,TheTypoMaster/chromium-crosswalk,markYoungH/chromium.src,hgl888/chromium-crosswalk-efl,junmin-zhu/chromium-rivertrail,Just-D/chromium-1,rogerwang/chromium,Fireblend/chromium-crosswalk,zcbenz/cefode-chromium,Fireblend/chromium-crosswalk,dednal/chromium.src,pozdnyakov/chromium-crosswalk,PeterWangIntel/chromium-crosswalk,ltilve/chromium,M4sse/chromium.src,crosswalk-project/chromium-crosswalk-efl,hgl888/chromium-crosswalk,patrickm/chromium.src,Chilledheart/chromium,rogerwang/chromium,junmin-zhu/chromium-rivertrail,krieger-od/nwjs_chromium.src,junmin-zhu/chromium-rivertrail,hujiajie/pa-chromium,keishi/chromium,patrickm/chromium.src,pozdnyakov/chromium-crosswalk,anirudhSK/chromium,Pluto-tv/chromium-crosswalk,chuan9/chromium-crosswalk,hujiajie/pa-chromium,PeterWangIntel/chromium-crosswalk,Pluto-tv/chromium-crosswalk,anirudhSK/chromium,littlstar/chromium.src,axinging/chromium-crosswalk,zcbenz/cefode-chromium,jaruba/chromium.src,M4sse/chromium.src,Jonekee/chromium.src,robclark/chromium,dushu1203/chromium.src,zcbenz/cefode-chromium,Just-D/chromium-1,patrickm/chromium.src,anirudhSK/chromium,junmin-zhu/chromium-rivertrail,M4sse/chromium.src,timopulkkinen/BubbleFish,keishi/chromium,krieger-od/nwjs_chromium.src,bright-sparks/chromium-spacewalk,M4sse/chromium.src,Fireblend/chromium-crosswalk,anirudhSK/chromium,ondra-novak/chromium.src,mohamed--abdel-maksoud/chromium.src,dushu1203/chromium.src,zcbenz/cefode-chromium,Jonekee/chromium.src,hgl888/chromium-crosswalk-efl,littlstar/chromium.src,anirudhSK/chromium,hgl888/chromium-crosswalk-efl,mogoweb/chromium-crosswalk,keishi/chromium,mogoweb/chromium-crosswalk,timopulkkinen/BubbleFish,dushu1203/chromium.src,chuan9/chromium-crosswalk,rogerwang/chromium,zcbenz/cefode-chromium,PeterWangIntel/chromium-crosswalk,Just-D/chromium-1,timopulkkinen/BubbleFish,ChromiumWebApps/chromium,ltilve/chromium,littlstar/chromium.src,Pluto-tv/chromium-crosswalk,pozdnyakov/chromium-crosswalk,crosswalk-project/chromium-crosswalk-efl,zcbenz/cefode-chromium,dushu1203/chromium.src,dushu1203/chromium.src,anirudhSK/chromium,axinging/chromium-crosswalk,Fireblend/chromium-crosswalk,chuan9/chromium-crosswalk,PeterWangIntel/chromium-crosswalk,dednal/chromium.src,Just-D/chromium-1,ondra-novak/chromium.src,Jonekee/chromium.src,hujiajie/pa-chromium,markYoungH/chromium.src,fujunwei/chromium-crosswalk,patrickm/chromium.src,markYoungH/chromium.src,fujunwei/chromium-crosswalk,jaruba/chromium.src,ChromiumWebApps/chromium,timopulkkinen/BubbleFish,hgl888/chromium-crosswalk,Chilledheart/chromium,patrickm/chromium.src,ltilve/chromium,junmin-zhu/chromium-rivertrail,Pluto-tv/chromium-crosswalk,pozdnyakov/chromium-crosswalk,keishi/chromium,nacl-webkit/chrome_deps,keishi/chromium,ltilve/chromium,hgl888/chromium-crosswalk-efl,bright-sparks/chromium-spacewalk,hujiajie/pa-chromium,patrickm/chromium.src,krieger-od/nwjs_chromium.src,ChromiumWebApps/chromium,ChromiumWebApps/chromium,robclark/chromium,mohamed--abdel-maksoud/chromium.src,nacl-webkit/chrome_deps,fujunwei/chromium-crosswalk,Jonekee/chromium.src,markYoungH/chromium.src,bright-sparks/chromium-spacewalk,pozdnyakov/chromium-crosswalk,bright-sparks/chromium-spacewalk,Fireblend/chromium-crosswalk,rogerwang/chromium,fujunwei/chromium-crosswalk,timopulkkinen/BubbleFish,nacl-webkit/chrome_deps,axinging/chromium-crosswalk,anirudhSK/chromium,nacl-webkit/chrome_deps,jaruba/chromium.src,Fireblend/chromium-crosswalk,mohamed--abdel-maksoud/chromium.src,krieger-od/nwjs_chromium.src,M4sse/chromium.src,mohamed--abdel-maksoud/chromium.src,PeterWangIntel/chromium-crosswalk,M4sse/chromium.src,ChromiumWebApps/chromium,patrickm/chromium.src,mogoweb/chromium-crosswalk,anirudhSK/chromium,robclark/chromium,hujiajie/pa-chromium,ondra-novak/chromium.src,hujiajie/pa-chromium,TheTypoMaster/chromium-crosswalk,junmin-zhu/chromium-rivertrail,Jonekee/chromium.src,mogoweb/chromium-crosswalk,Just-D/chromium-1,chuan9/chromium-crosswalk,chuan9/chromium-crosswalk,ondra-novak/chromium.src,Just-D/chromium-1,patrickm/chromium.src,mogoweb/chromium-crosswalk,axinging/chromium-crosswalk,anirudhSK/chromium,TheTypoMaster/chromium-crosswalk,hgl888/chromium-crosswalk,mohamed--abdel-maksoud/chromium.src,axinging/chromium-crosswalk,chuan9/chromium-crosswalk,dednal/chromium.src,hujiajie/pa-chromium,ondra-novak/chromium.src,Chilledheart/chromium,crosswalk-project/chromium-crosswalk-efl,dednal/chromium.src,zcbenz/cefode-chromium,hgl888/chromium-crosswalk-efl,ltilve/chromium,Just-D/chromium-1,dushu1203/chromium.src,rogerwang/chromium,patrickm/chromium.src,Jonekee/chromium.src,dednal/chromium.src,jaruba/chromium.src,Just-D/chromium-1,TheTypoMaster/chromium-crosswalk,anirudhSK/chromium,Just-D/chromium-1,Chilledheart/chromium,nacl-webkit/chrome_deps,jaruba/chromium.src,keishi/chromium,dednal/chromium.src,krieger-od/nwjs_chromium.src,robclark/chromium,mohamed--abdel-maksoud/chromium.src,crosswalk-project/chromium-crosswalk-efl,Chilledheart/chromium,krieger-od/nwjs_chromium.src,hgl888/chromium-crosswalk,jaruba/chromium.src,M4sse/chromium.src,nacl-webkit/chrome_deps,hgl888/chromium-crosswalk,axinging/chromium-crosswalk,keishi/chromium,hujiajie/pa-chromium,ltilve/chromium,ltilve/chromium,nacl-webkit/chrome_deps,krieger-od/nwjs_chromium.src,dednal/chromium.src,ondra-novak/chromium.src,pozdnyakov/chromium-crosswalk,littlstar/chromium.src,PeterWangIntel/chromium-crosswalk,TheTypoMaster/chromium-crosswalk,mogoweb/chromium-crosswalk,krieger-od/nwjs_chromium.src,pozdnyakov/chromium-crosswalk,Chilledheart/chromium,nacl-webkit/chrome_deps,dushu1203/chromium.src,hgl888/chromium-crosswalk,dushu1203/chromium.src,hujiajie/pa-chromium,fujunwei/chromium-crosswalk,axinging/chromium-crosswalk,Chilledheart/chromium,nacl-webkit/chrome_deps,hgl888/chromium-crosswalk,ChromiumWebApps/chromium,Pluto-tv/chromium-crosswalk,crosswalk-project/chromium-crosswalk-efl,pozdnyakov/chromium-crosswalk,M4sse/chromium.src,ltilve/chromium,Chilledheart/chromium,markYoungH/chromium.src,TheTypoMaster/chromium-crosswalk,bright-sparks/chromium-spacewalk,krieger-od/nwjs_chromium.src,fujunwei/chromium-crosswalk,ChromiumWebApps/chromium,pozdnyakov/chromium-crosswalk,TheTypoMaster/chromium-crosswalk,robclark/chromium,zcbenz/cefode-chromium,hgl888/chromium-crosswalk-efl,axinging/chromium-crosswalk,Jonekee/chromium.src,mohamed--abdel-maksoud/chromium.src,krieger-od/nwjs_chromium.src,krieger-od/nwjs_chromium.src,jaruba/chromium.src,jaruba/chromium.src,chuan9/chromium-crosswalk,robclark/chromium,dednal/chromium.src,pozdnyakov/chromium-crosswalk,axinging/chromium-crosswalk,Pluto-tv/chromium-crosswalk,robclark/chromium,rogerwang/chromium,timopulkkinen/BubbleFish,mogoweb/chromium-crosswalk,timopulkkinen/BubbleFish,ondra-novak/chromium.src,junmin-zhu/chromium-rivertrail,chuan9/chromium-crosswalk,mohamed--abdel-maksoud/chromium.src,markYoungH/chromium.src,dednal/chromium.src,crosswalk-project/chromium-crosswalk-efl,littlstar/chromium.src,pozdnyakov/chromium-crosswalk,M4sse/chromium.src,keishi/chromium,zcbenz/cefode-chromium,jaruba/chromium.src,crosswalk-project/chromium-crosswalk-efl,mohamed--abdel-maksoud/chromium.src,keishi/chromium,Pluto-tv/chromium-crosswalk,fujunwei/chromium-crosswalk,Jonekee/chromium.src,nacl-webkit/chrome_deps,dednal/chromium.src,ChromiumWebApps/chromium,fujunwei/chromium-crosswalk,hgl888/chromium-crosswalk-efl,hgl888/chromium-crosswalk-efl,markYoungH/chromium.src,bright-sparks/chromium-spacewalk,TheTypoMaster/chromium-crosswalk,markYoungH/chromium.src,dushu1203/chromium.src,Pluto-tv/chromium-crosswalk,robclark/chromium,hgl888/chromium-crosswalk-efl,ondra-novak/chromium.src,jaruba/chromium.src,timopulkkinen/BubbleFish,dushu1203/chromium.src,markYoungH/chromium.src,keishi/chromium,anirudhSK/chromium,hujiajie/pa-chromium,bright-sparks/chromium-spacewalk,Jonekee/chromium.src,keishi/chromium,chuan9/chromium-crosswalk,crosswalk-project/chromium-crosswalk-efl,junmin-zhu/chromium-rivertrail,M4sse/chromium.src,dushu1203/chromium.src,hgl888/chromium-crosswalk,M4sse/chromium.src,ChromiumWebApps/chromium,junmin-zhu/chromium-rivertrail,mogoweb/chromium-crosswalk,axinging/chromium-crosswalk,mohamed--abdel-maksoud/chromium.src,Jonekee/chromium.src,bright-sparks/chromium-spacewalk,ltilve/chromium,TheTypoMaster/chromium-crosswalk,junmin-zhu/chromium-rivertrail,Chilledheart/chromium,junmin-zhu/chromium-rivertrail,mogoweb/chromium-crosswalk,anirudhSK/chromium,PeterWangIntel/chromium-crosswalk,rogerwang/chromium,PeterWangIntel/chromium-crosswalk,littlstar/chromium.src,Pluto-tv/chromium-crosswalk,rogerwang/chromium,ondra-novak/chromium.src,rogerwang/chromium,nacl-webkit/chrome_deps,fujunwei/chromium-crosswalk,rogerwang/chromium,Jonekee/chromium.src,ChromiumWebApps/chromium,bright-sparks/chromium-spacewalk,Fireblend/chromium-crosswalk,markYoungH/chromium.src,timopulkkinen/BubbleFish,robclark/chromium,ChromiumWebApps/chromium,timopulkkinen/BubbleFish,robclark/chromium,littlstar/chromium.src,mohamed--abdel-maksoud/chromium.src,jaruba/chromium.src,hgl888/chromium-crosswalk-efl,Fireblend/chromium-crosswalk,Fireblend/chromium-crosswalk,ChromiumWebApps/chromium,mogoweb/chromium-crosswalk,dednal/chromium.src,zcbenz/cefode-chromium,hujiajie/pa-chromium,timopulkkinen/BubbleFish,axinging/chromium-crosswalk
|
880b00f732f2b368989dca25bc1c7c9886ce6fe2
|
MMCore/FastLogger.cpp
|
MMCore/FastLogger.cpp
|
///////////////////////////////////////////////////////////////////////////////
// FILE: FastLogger.cpp
// PROJECT: Micro-Manager
// SUBSYSTEM: MMCore
//-----------------------------------------------------------------------------
// DESCRIPTION: Implementation of the IMMLogger interface
// COPYRIGHT: University of California, San Francisco, 2009
// LICENSE: This file is distributed under the "Lesser GPL" (LGPL) license.
// License text is included with the source distribution.
//
// This file is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty
// of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
//
// IN NO EVENT SHALL THE COPYRIGHT OWNER OR
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
// INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES.
//
// AUTHOR: Karl Hoover, [email protected], 2009 11 11
//
// CVS: $Id$
#include <stdarg.h>
#include <string>
#include <iostream>
#include <fstream>
#include <limits.h>
#include "FastLogger.h"
#include "CoreUtils.h"
#include "../MMDevice/DeviceUtils.h"
#include <boost/algorithm/string.hpp>
#include <boost/lexical_cast.hpp>
#include <boost/thread/thread.hpp>
// TODO Stop relying on Boost internals
#include "boost/interprocess/detail/os_thread_functions.hpp"
#include "boost/version.hpp"
#if BOOST_VERSION >= 104800
# define BOOST_IPC_DETAIL boost::interprocess::ipcdetail
#else
# define BOOST_IPC_DETAIL boost::interprocess::detail
#endif
using namespace std;
const char* g_textLogIniFiled = "Logging initialization failed\n";
class LoggerThread : public MMDeviceThreadBase
{
public:
LoggerThread(FastLogger* l) : log_(l), busy_(false), stop_(false) {}
~LoggerThread() {}
int svc (void);
void Stop() {stop_ = true;}
void Start() {stop_ = false; activate();}
private:
FastLogger* log_;
bool busy_;
bool stop_;
};
int LoggerThread::svc(void)
{
do
{
std::string stmp;
{
MMThreadGuard stringGuard(log_->logStringLock_g);
stmp = log_->stringToWrite_g;
log_->stringToWrite_g.clear();
}
if (0 < stmp.length())
{
if( 0 != (log_->flags() & STDERR))
std::cerr << stmp << '\n' << flush;
MMThreadGuard fileGuard(log_->logFileLock_g);
if( NULL != log_->plogFile_g)
*log_->plogFile_g << stmp << '\n' << flush;
}
CDeviceUtils::SleepMs(30);
} while (!stop_ );
return 0;
}
LoggerThread* pLogThread_g = NULL;
FastLogger::FastLogger()
:level_(any)
,fast_log_flags_(any)
,plogFile_(NULL)
,failureReported(false),
plogFile_g(0)
{
}
FastLogger::~FastLogger()
{
if( NULL != pLogThread_g)
{
pLogThread_g->Stop();
pLogThread_g->wait();
delete pLogThread_g;
}
Shutdown();
}
/**
* methods declared in IMMLogger as pure virtual
* Refere to IMMLogger declaration
*/
bool FastLogger::Initialize(std::string logFileName, std::string logInstanceName)throw(IMMLogger::runtime_exception)
{
bool bRet =false;
try
{
failureReported=false;
logInstanceName_=logInstanceName;
{
MMThreadGuard guard(logFileLock_g);
bRet = Open(logFileName);
if(bRet)
{
fast_log_flags_ |= OSTREAM;
}
fast_log_flags_ |= STDERR;
set_flags (fast_log_flags_);
}
if( NULL == pLogThread_g)
{
pLogThread_g = new LoggerThread(this);
pLogThread_g->Start();
}
}
catch(...)
{
ReportLogFailure();
throw(IMMLogger::runtime_exception(g_textLogIniFiled));
}
return bRet;
};
void FastLogger::Shutdown()throw(IMMLogger::runtime_exception)
{
try
{
MMThreadGuard guard(logFileLock_g);
failureReported=false;
if(NULL != plogFile_g)
{
plogFile_g->close();
delete plogFile_g;
plogFile_g = NULL;
}
clr_flags (OSTREAM);
//msg_ostream (0, 0);
}
catch(...)
{
plogFile_g = NULL;
ReportLogFailure();
throw(IMMLogger::runtime_exception(g_textLogIniFiled));
}
}
bool FastLogger::Reset()throw(IMMLogger::runtime_exception)
{
bool bRet =false;
try{
MMThreadGuard guard(logFileLock_g);
failureReported=false;
if(NULL != plogFile_g)
{
if (plogFile_g->is_open())
{
plogFile_g->close();
}
//re-open same file but truncate old log content
plogFile_g->open(logFileName_.c_str(), ios_base::trunc);
bRet = true;
}
}
catch(...)
{
ReportLogFailure();
throw(IMMLogger::runtime_exception(g_textLogIniFiled));
}
return bRet;
};
void FastLogger::SetPriorityLevel(IMMLogger::priority level) throw()
{
level_ = level;
}
bool FastLogger::EnableLogToStderr(bool enable)throw()
{
bool bRet = ( 0 != (fast_log_flags_ | STDERR));
fast_log_flags_ |= OSTREAM;
if (enable)
{
fast_log_flags_ |= STDERR;
}
else
{
fast_log_flags_ &= ~STDERR;
}
pLogThread_g->Stop();
pLogThread_g->wait();
set_flags (fast_log_flags_);
pLogThread_g->Start();
return bRet;
};
void FastLogger::Log(IMMLogger::priority p, const char* format, ...) throw()
{
{
MMThreadGuard guard(logFileLock_g);
if( NULL == plogFile_g)
{
cerr<< " log file is NULL!" << endl;
return;
}
}
try
{
// filter by current priority
if (!(p & level_))
return;
std::string entryPrefix = GetEntryPrefix(p);
const size_t MaxBuf = 32767;
struct BigBuffer { char buffer[MaxBuf]; };
std::auto_ptr<BigBuffer> pB (new BigBuffer());
va_list argp;
va_start(argp, format);
#ifdef WIN32
int n = vsnprintf_s(pB->buffer, MaxBuf, MaxBuf - 1, format, argp);
#else
int n = vsnprintf(pB->buffer, MaxBuf - 1, format, argp);
#endif
va_end(argp, format);
if (n <= -1) {
ReportLogFailure();
return;
}
std::string entryString = entryPrefix + pB->buffer;
boost::algorithm::trim_right(entryString);
{
MMThreadGuard stringGuard(logStringLock_g);
if ( 0 <stringToWrite_g.size())
stringToWrite_g += '\n';
stringToWrite_g += entryString;
}
}
catch(...)
{
ReportLogFailure();
}
};
void FastLogger::ReportLogFailure()throw()
{
if(!failureReported)
{
failureReported=true;
MMThreadGuard guard(logFileLock_g);
try {
std::cerr << g_textLogIniFiled;
}
catch (...) {
}
}
};
std::string FastLogger::GetEntryPrefix(IMMLogger::priority p)
{
// date, pid, tid, and log level
std::string entryPrefix;
entryPrefix.reserve(100);
// Date
boost::posix_time::ptime bt = boost::posix_time::microsec_clock::local_time();
std::string todaysDate = boost::posix_time::to_iso_extended_string(bt);
entryPrefix += todaysDate;
// PID
// XXX Avoid using Boost 'detail' classes!
BOOST_IPC_DETAIL::OS_process_id_t pidd = BOOST_IPC_DETAIL::get_current_process_id();
entryPrefix += " p:";
entryPrefix += boost::lexical_cast<std::string>(pidd);
// TID
entryPrefix += " t:";
// Use the platform thread id where available, so that it can be compared
// with debugger, etc.
#ifdef WIN32
entryPrefix += boost::lexical_cast<std::string>(GetCurrentThreadId());
#else
entryPrefix += boost::lexical_cast<std::string>(pthread_self());
#endif
// Log level
if (p == debug)
entryPrefix += " [dbg]: ";
else
entryPrefix += " [LOG]: ";
return entryPrefix;
}
bool FastLogger::Open(const std::string specifiedFile)
{
bool bRet = false;
try
{
if(NULL == plogFile_g)
{
plogFile_g = new std::ofstream();
}
if (!plogFile_g->is_open())
{
// N.B. we do NOT handle re-opening of the log file on a different path!!
if(logFileName_.length() < 1) // if log file path has not yet been specified:
{
logFileName_ = specifiedFile;
}
// first try to open the specified file without any assumption about the path
plogFile_g->open(logFileName_.c_str(), ios_base::app);
//std::cout << "first attempt to open " << logFileName_.c_str() << (plogFile_g->is_open()?" OK":" FAILED") << std::endl;
// if the open failed, assume that this is because the ordinary user does not have write access to the application / program directory
if (!plogFile_g->is_open())
{
std::string homePath;
#ifdef _WINDOWS
homePath = std::string(getenv("HOMEDRIVE")) + std::string(getenv("HOMEPATH")) + "\\";
#else
homePath = std::string(getenv("HOME")) + "/";
#endif
logFileName_ = homePath + specifiedFile;
plogFile_g->open(logFileName_.c_str(), ios_base::app);
}
}
else
{
;//std::cout << "log file " << logFileName_.c_str() << " was open already" << std::endl;
}
bRet = plogFile_g->is_open();
}
catch(...){}
return bRet;
}
void FastLogger::LogContents(char** ppContents, unsigned long& len)
{
*ppContents = 0;
len = 0;
MMThreadGuard guard(logFileLock_g);
if (plogFile_g->is_open())
{
plogFile_g->close();
}
// open to read, and position at the end of the file
// XXX We simply return NULL if cannot open file or size is too large!
std::ifstream ifile(logFileName_.c_str(), ios::in | ios::binary | ios::ate);
if (ifile.is_open())
{
std::ifstream::pos_type pos = ifile.tellg();
// XXX This is broken (sort of): on 64-bit Windows, we artificially
// limit ourselves to 4 GB. But it is probably okay since we don't
// expect the log contents to be > 4 GB. Fixing would require changing
// the signature of this function.
if (pos < ULONG_MAX)
{
len = static_cast<unsigned long>(pos);
*ppContents = new char[len];
if (0 != *ppContents)
{
ifile.seekg(0, ios::beg);
ifile.read(*ppContents, len);
ifile.close();
}
}
}
// re-open for logging
plogFile_g->open(logFileName_.c_str(), ios_base::app);
return;
}
std::string FastLogger::LogPath(void)
{
return logFileName_;
}
|
///////////////////////////////////////////////////////////////////////////////
// FILE: FastLogger.cpp
// PROJECT: Micro-Manager
// SUBSYSTEM: MMCore
//-----------------------------------------------------------------------------
// DESCRIPTION: Implementation of the IMMLogger interface
// COPYRIGHT: University of California, San Francisco, 2009
// LICENSE: This file is distributed under the "Lesser GPL" (LGPL) license.
// License text is included with the source distribution.
//
// This file is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty
// of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
//
// IN NO EVENT SHALL THE COPYRIGHT OWNER OR
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
// INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES.
//
// AUTHOR: Karl Hoover, [email protected], 2009 11 11
//
// CVS: $Id$
#include <stdarg.h>
#include <string>
#include <iostream>
#include <fstream>
#include <limits.h>
#include "FastLogger.h"
#include "CoreUtils.h"
#include "../MMDevice/DeviceUtils.h"
#include <boost/algorithm/string.hpp>
#include <boost/lexical_cast.hpp>
#include <boost/thread/thread.hpp>
// TODO Stop relying on Boost internals
#include "boost/interprocess/detail/os_thread_functions.hpp"
#include "boost/version.hpp"
#if BOOST_VERSION >= 104800
# define BOOST_IPC_DETAIL boost::interprocess::ipcdetail
#else
# define BOOST_IPC_DETAIL boost::interprocess::detail
#endif
using namespace std;
const char* g_textLogIniFiled = "Logging initialization failed\n";
class LoggerThread : public MMDeviceThreadBase
{
public:
LoggerThread(FastLogger* l) : log_(l), busy_(false), stop_(false) {}
~LoggerThread() {}
int svc (void);
void Stop() {stop_ = true;}
void Start() {stop_ = false; activate();}
private:
FastLogger* log_;
bool busy_;
bool stop_;
};
int LoggerThread::svc(void)
{
do
{
std::string stmp;
{
MMThreadGuard stringGuard(log_->logStringLock_g);
stmp = log_->stringToWrite_g;
log_->stringToWrite_g.clear();
}
if (0 < stmp.length())
{
if( 0 != (log_->flags() & STDERR))
std::cerr << stmp << '\n' << flush;
MMThreadGuard fileGuard(log_->logFileLock_g);
if( NULL != log_->plogFile_g)
*log_->plogFile_g << stmp << '\n' << flush;
}
CDeviceUtils::SleepMs(30);
} while (!stop_ );
return 0;
}
LoggerThread* pLogThread_g = NULL;
FastLogger::FastLogger()
:level_(any)
,fast_log_flags_(any)
,plogFile_(NULL)
,failureReported(false),
plogFile_g(0)
{
}
FastLogger::~FastLogger()
{
if( NULL != pLogThread_g)
{
pLogThread_g->Stop();
pLogThread_g->wait();
delete pLogThread_g;
}
Shutdown();
}
/**
* methods declared in IMMLogger as pure virtual
* Refere to IMMLogger declaration
*/
bool FastLogger::Initialize(std::string logFileName, std::string logInstanceName)throw(IMMLogger::runtime_exception)
{
bool bRet =false;
try
{
failureReported=false;
logInstanceName_=logInstanceName;
{
MMThreadGuard guard(logFileLock_g);
bRet = Open(logFileName);
if(bRet)
{
fast_log_flags_ |= OSTREAM;
}
fast_log_flags_ |= STDERR;
set_flags (fast_log_flags_);
}
if( NULL == pLogThread_g)
{
pLogThread_g = new LoggerThread(this);
pLogThread_g->Start();
}
}
catch(...)
{
ReportLogFailure();
throw(IMMLogger::runtime_exception(g_textLogIniFiled));
}
return bRet;
};
void FastLogger::Shutdown()throw(IMMLogger::runtime_exception)
{
try
{
MMThreadGuard guard(logFileLock_g);
failureReported=false;
if(NULL != plogFile_g)
{
plogFile_g->close();
delete plogFile_g;
plogFile_g = NULL;
}
clr_flags (OSTREAM);
//msg_ostream (0, 0);
}
catch(...)
{
plogFile_g = NULL;
ReportLogFailure();
throw(IMMLogger::runtime_exception(g_textLogIniFiled));
}
}
bool FastLogger::Reset()throw(IMMLogger::runtime_exception)
{
bool bRet =false;
try{
MMThreadGuard guard(logFileLock_g);
failureReported=false;
if(NULL != plogFile_g)
{
if (plogFile_g->is_open())
{
plogFile_g->close();
}
//re-open same file but truncate old log content
plogFile_g->open(logFileName_.c_str(), ios_base::trunc);
bRet = true;
}
}
catch(...)
{
ReportLogFailure();
throw(IMMLogger::runtime_exception(g_textLogIniFiled));
}
return bRet;
};
void FastLogger::SetPriorityLevel(IMMLogger::priority level) throw()
{
level_ = level;
}
bool FastLogger::EnableLogToStderr(bool enable)throw()
{
bool bRet = ( 0 != (fast_log_flags_ | STDERR));
fast_log_flags_ |= OSTREAM;
if (enable)
{
fast_log_flags_ |= STDERR;
}
else
{
fast_log_flags_ &= ~STDERR;
}
pLogThread_g->Stop();
pLogThread_g->wait();
set_flags (fast_log_flags_);
pLogThread_g->Start();
return bRet;
};
const size_t MaxBuf = 32767;
struct BigBuffer { char buffer[MaxBuf]; };
void FastLogger::Log(IMMLogger::priority p, const char* format, ...) throw()
{
{
MMThreadGuard guard(logFileLock_g);
if( NULL == plogFile_g)
{
cerr<< " log file is NULL!" << endl;
return;
}
}
try
{
// filter by current priority
if (!(p & level_))
return;
std::string entryPrefix = GetEntryPrefix(p);
std::auto_ptr<BigBuffer> pB (new BigBuffer());
va_list argp;
va_start(argp, format);
#ifdef WIN32
int n = vsnprintf_s(pB->buffer, MaxBuf, MaxBuf - 1, format, argp);
#else
int n = vsnprintf(pB->buffer, MaxBuf - 1, format, argp);
#endif
va_end(argp);
if (n <= -1) {
ReportLogFailure();
return;
}
std::string entryString = entryPrefix + pB->buffer;
boost::algorithm::trim_right(entryString);
{
MMThreadGuard stringGuard(logStringLock_g);
if ( 0 <stringToWrite_g.size())
stringToWrite_g += '\n';
stringToWrite_g += entryString;
}
}
catch(...)
{
ReportLogFailure();
}
};
void FastLogger::ReportLogFailure()throw()
{
if(!failureReported)
{
failureReported=true;
MMThreadGuard guard(logFileLock_g);
try {
std::cerr << g_textLogIniFiled;
}
catch (...) {
}
}
};
std::string FastLogger::GetEntryPrefix(IMMLogger::priority p)
{
// date, pid, tid, and log level
std::string entryPrefix;
entryPrefix.reserve(100);
// Date
boost::posix_time::ptime bt = boost::posix_time::microsec_clock::local_time();
std::string todaysDate = boost::posix_time::to_iso_extended_string(bt);
entryPrefix += todaysDate;
// PID
// XXX Avoid using Boost 'detail' classes!
BOOST_IPC_DETAIL::OS_process_id_t pidd = BOOST_IPC_DETAIL::get_current_process_id();
entryPrefix += " p:";
entryPrefix += boost::lexical_cast<std::string>(pidd);
// TID
entryPrefix += " t:";
// Use the platform thread id where available, so that it can be compared
// with debugger, etc.
#ifdef WIN32
entryPrefix += boost::lexical_cast<std::string>(GetCurrentThreadId());
#else
entryPrefix += boost::lexical_cast<std::string>(pthread_self());
#endif
// Log level
if (p == debug)
entryPrefix += " [dbg]: ";
else
entryPrefix += " [LOG]: ";
return entryPrefix;
}
bool FastLogger::Open(const std::string specifiedFile)
{
bool bRet = false;
try
{
if(NULL == plogFile_g)
{
plogFile_g = new std::ofstream();
}
if (!plogFile_g->is_open())
{
// N.B. we do NOT handle re-opening of the log file on a different path!!
if(logFileName_.length() < 1) // if log file path has not yet been specified:
{
logFileName_ = specifiedFile;
}
// first try to open the specified file without any assumption about the path
plogFile_g->open(logFileName_.c_str(), ios_base::app);
//std::cout << "first attempt to open " << logFileName_.c_str() << (plogFile_g->is_open()?" OK":" FAILED") << std::endl;
// if the open failed, assume that this is because the ordinary user does not have write access to the application / program directory
if (!plogFile_g->is_open())
{
std::string homePath;
#ifdef _WINDOWS
homePath = std::string(getenv("HOMEDRIVE")) + std::string(getenv("HOMEPATH")) + "\\";
#else
homePath = std::string(getenv("HOME")) + "/";
#endif
logFileName_ = homePath + specifiedFile;
plogFile_g->open(logFileName_.c_str(), ios_base::app);
}
}
else
{
;//std::cout << "log file " << logFileName_.c_str() << " was open already" << std::endl;
}
bRet = plogFile_g->is_open();
}
catch(...){}
return bRet;
}
void FastLogger::LogContents(char** ppContents, unsigned long& len)
{
*ppContents = 0;
len = 0;
MMThreadGuard guard(logFileLock_g);
if (plogFile_g->is_open())
{
plogFile_g->close();
}
// open to read, and position at the end of the file
// XXX We simply return NULL if cannot open file or size is too large!
std::ifstream ifile(logFileName_.c_str(), ios::in | ios::binary | ios::ate);
if (ifile.is_open())
{
std::ifstream::pos_type pos = ifile.tellg();
// XXX This is broken (sort of): on 64-bit Windows, we artificially
// limit ourselves to 4 GB. But it is probably okay since we don't
// expect the log contents to be > 4 GB. Fixing would require changing
// the signature of this function.
if (pos < ULONG_MAX)
{
len = static_cast<unsigned long>(pos);
*ppContents = new char[len];
if (0 != *ppContents)
{
ifile.seekg(0, ios::beg);
ifile.read(*ppContents, len);
ifile.close();
}
}
}
// re-open for logging
plogFile_g->open(logFileName_.c_str(), ios_base::app);
return;
}
std::string FastLogger::LogPath(void)
{
return logFileName_;
}
|
Fix build with GCC/Clang.
|
Fix build with GCC/Clang.
git-svn-id: 03a8048b5ee8463be5048a3801110fb50f378627@12252 d0ab736e-dc22-4aeb-8dc9-08def0aa14fd
|
C++
|
mit
|
kmdouglass/Micro-Manager,kmdouglass/Micro-Manager
|
6d5135eec2a32c52a91eb68eed0d495bb1e47aef
|
cpp/journal_timeliness_checker.cc
|
cpp/journal_timeliness_checker.cc
|
/** \brief Checks the BSZ delivery database to find journals for which we have no reasonably new articles delivered.
* \author Dr. Johannes Ruscheinski ([email protected])
*
* \copyright 2018 Universitätsbibliothek Tübingen. All rights reserved.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <iostream>
#include <ctime>
#include <cstdlib>
#include "DbConnection.h"
#include "BSZUpload.h"
#include "EmailSender.h"
#include "IniFile.h"
#include "SqlUtil.h"
#include "StringUtil.h"
#include "UBTools.h"
#include "util.h"
namespace {
[[noreturn]] void Usage() {
std::cerr << "Usage: " << ::progname
<< " [--min-log-level=log_level] [--default-update-window=no_of_days] config_file_path sender_email_address "
<< "notification_email_address\n";
std::exit(EXIT_FAILURE);
}
void ProcessJournal(DbConnection * const db_connection, const std::string &journal_name, const std::string &journal_ppn,
const unsigned update_window, std::string * tardy_list)
{
db_connection->queryOrDie("SELECT MAX(created_at) AS max_created_at FROM marc_records WHERE superior_control_number="
+ db_connection->escapeAndQuoteString(journal_ppn));
DbResultSet result_set(db_connection->getLastResultSet());
if (result_set.empty())
return;
const std::string max_created_at_string(result_set.getNextRow()["max_created_at"]);
const time_t max_created_at(SqlUtil::DatetimeToTimeT(max_created_at_string));
if (max_created_at < ::time(nullptr) - update_window * 86400)
*tardy_list += journal_name + ": " + max_created_at_string + "\n";
}
const unsigned DEFAULT_DEFAULT_UPDATE_WINDOW(60); // days
} // unnamed namespace
int Main(int argc, char *argv[]) {
if (argc < 4)
Usage();
unsigned default_update_window(DEFAULT_DEFAULT_UPDATE_WINDOW);
if (StringUtil::StartsWith(argv[1], "--default-update-window=")) {
if (not StringUtil::ToUnsigned(argv[1] + __builtin_strlen("--default-update-window=")))
LOG_ERROR("invalid default update window: \"" + std::string(argv[1] + __builtin_strlen("--default-update-window=")) + "\"!");
--argc, ++argv;
}
if (argc != 4)
Usage();
const std::string sender_email_address(argv[2]), notification_email_address(argv[3]);
DbConnection db_connection;
IniFile ini_file(UBTools::GetTuelibPath() + "zts_harvester.conf");
std::string tardy_list;
for (const auto §ion : ini_file) {
if (section.find("user_agent") != section.end())
continue; // Not a journal section.
const auto delivery_mode(section.getEnum("zotero_delivery_mode", BSZUpload::STRING_TO_DELIVERY_MODE_MAP,
BSZUpload::DeliveryMode::NONE));
if (delivery_mode != BSZUpload::DeliveryMode::LIVE)
continue;
const std::string journal_name(section.getSectionName());
std::string journal_ppn(section.getString("online_ppn", ""));
if (journal_ppn.empty())
journal_ppn = section.getString("print_ppn", "");
if (journal_ppn.empty()) {
LOG_WARNING("no PPN found for \"" + journal_name + "\"!");
continue;
}
unsigned update_window;
if (section.find("update_window") == section.end()) {
LOG_WARNING("no update window found for \"" + journal_name + "\", using " + std::to_string(default_update_window) + "!");
update_window = default_update_window;
} else
update_window = section.getUnsigned("update_window");
ProcessJournal(&db_connection, journal_name, journal_ppn, update_window, &tardy_list);
}
if (not tardy_list.empty())
EmailSender::SendEmail(sender_email_address, notification_email_address, "Überfällige Zeitschiften",
"Letzte Lieferung ans BSZ\n" + tardy_list, EmailSender::HIGH);
return EXIT_SUCCESS;
}
|
/** \brief Checks the BSZ delivery database to find journals for which we have no reasonably new articles delivered.
* \author Dr. Johannes Ruscheinski ([email protected])
*
* \copyright 2018 Universitätsbibliothek Tübingen. All rights reserved.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <iostream>
#include <ctime>
#include <cstdlib>
#include "DbConnection.h"
#include "BSZUpload.h"
#include "EmailSender.h"
#include "IniFile.h"
#include "SqlUtil.h"
#include "StringUtil.h"
#include "UBTools.h"
#include "util.h"
namespace {
[[noreturn]] void Usage() {
std::cerr << "Usage: " << ::progname
<< " [--min-log-level=log_level] [--default-update-window=no_of_days] config_file_path sender_email_address "
<< "notification_email_address\n";
std::exit(EXIT_FAILURE);
}
void ProcessJournal(DbConnection * const db_connection, const std::string &journal_name, const std::string &journal_ppn,
const unsigned update_window, std::string * tardy_list)
{
db_connection->queryOrDie("SELECT MAX(created_at) AS max_created_at FROM marc_records WHERE superior_control_number="
+ db_connection->escapeAndQuoteString(journal_ppn));
DbResultSet result_set(db_connection->getLastResultSet());
if (result_set.empty())
return;
const std::string max_created_at_string(result_set.getNextRow()["max_created_at"]);
const time_t max_created_at(SqlUtil::DatetimeToTimeT(max_created_at_string));
if (max_created_at < ::time(nullptr) - update_window * 86400)
*tardy_list += journal_name + ": " + max_created_at_string + "\n";
}
const unsigned DEFAULT_DEFAULT_UPDATE_WINDOW(60); // days
} // unnamed namespace
int Main(int argc, char *argv[]) {
if (argc < 4)
Usage();
unsigned default_update_window(DEFAULT_DEFAULT_UPDATE_WINDOW);
if (StringUtil::StartsWith(argv[1], "--default-update-window=")) {
if (not StringUtil::ToUnsigned(argv[1] + __builtin_strlen("--default-update-window=")))
LOG_ERROR("invalid default update window: \"" + std::string(argv[1] + __builtin_strlen("--default-update-window=")) + "\"!");
--argc, ++argv;
}
if (argc != 4)
Usage();
const std::string sender_email_address(argv[2]), notification_email_address(argv[3]);
DbConnection db_connection;
IniFile ini_file(UBTools::GetTuelibPath() + "zts_harvester.conf");
std::string tardy_list;
for (const auto §ion : ini_file) {
if (section.find("user_agent") != section.end())
continue; // Not a journal section.
const auto delivery_mode(section.getEnum("zotero_delivery_mode", BSZUpload::STRING_TO_DELIVERY_MODE_MAP,
BSZUpload::DeliveryMode::NONE));
if (delivery_mode != BSZUpload::DeliveryMode::LIVE)
continue;
const std::string journal_name(section.getSectionName());
std::string journal_ppn(section.getString("online_ppn", ""));
if (journal_ppn.empty())
journal_ppn = section.getString("print_ppn", "");
if (journal_ppn.empty()) {
LOG_WARNING("no PPN found for \"" + journal_name + "\"!");
continue;
}
unsigned update_window;
if (section.find("zeder_update_window") == section.end()) {
LOG_WARNING("no update window found for \"" + journal_name + "\", using " + std::to_string(default_update_window) + "!");
update_window = default_update_window;
} else
update_window = section.getUnsigned("update_window");
ProcessJournal(&db_connection, journal_name, journal_ppn, update_window, &tardy_list);
}
if (not tardy_list.empty())
EmailSender::SendEmail(sender_email_address, notification_email_address, "Überfällige Zeitschiften",
"Letzte Lieferung ans BSZ\n" + tardy_list, EmailSender::HIGH);
return EXIT_SUCCESS;
}
|
Adjust section parameter to prevalent naming scheme
|
Adjust section parameter to prevalent naming scheme
|
C++
|
agpl-3.0
|
ubtue/ub_tools,ubtue/ub_tools,ubtue/ub_tools,ubtue/ub_tools,ubtue/ub_tools,ubtue/ub_tools,ubtue/ub_tools,ubtue/ub_tools
|
25a32474da8997bf4c735108f39cfcb82333ad50
|
test/photon_opacity_unit.C
|
test/photon_opacity_unit.C
|
//-----------------------------------------------------------------------bl-
//--------------------------------------------------------------------------
//
// Planet - An atmospheric code for planetary bodies, adapted to Titan
//
// Copyright (C) 2013 The PECOS Development Team
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the Version 2.1 GNU Lesser General
// Public License as published by the Free Software Foundation.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc. 51 Franklin Street, Fifth Floor,
// Boston, MA 02110-1301 USA
//
//-----------------------------------------------------------------------el-
//Antioch
#include "antioch/vector_utils_decl.h"
#include "antioch/cmath_shims.h"
#include "antioch/sigma_bin_converter.h"
#include "antioch/vector_utils.h"
#include "antioch/physical_constants.h"
//Planet
#include "planet/photon_opacity.h"
#include "planet/planet_constants.h"
#include "planet/atmospheric_temperature.h"
//C++
#include <iostream>
#include <fstream>
#include <iomanip>
#include <limits>
#include <string>
#include <vector>
template<typename Scalar>
int check(const Scalar &test, const Scalar &ref, const Scalar &tol, const std::string &model)
{
if(Antioch::ant_abs(test - ref)/ref > tol && Antioch::ant_abs(test - ref) > tol)
{
std::cout << std::scientific << std::setprecision(20)
<< "Error in binary diffusion calculations" << std::endl
<< "model is " << model << std::endl
<< "calculated coefficient = " << test << std::endl
<< "solution = " << ref << std::endl
<< "relative error = " << Antioch::ant_abs(test - ref)/ref << std::endl
<< "tolerance = " << tol << std::endl;
return 1;
}
return 0;
}
template<typename Scalar, typename VectorScalar = std::vector<Scalar> >
void read_crossSection(VectorScalar & lambda, const std::string &file, VectorScalar &sigma)
{
std::string line;
std::ifstream sig_f(file);
getline(sig_f,line);
while(!sig_f.eof())
{
Scalar wv(-1),sigt;
sig_f >> wv >> sigt;
if(!getline(sig_f,line))break;
if(wv < 0.)break;
lambda.push_back(wv/10.);//A -> nm
sigma.push_back(sigt*10.);//cm-2/A -> m-2/nm
}
sig_f.close();
return;
}
template<typename Scalar>
Scalar barometry(const Scalar &zmin, const Scalar &z, const Scalar &T, const Scalar &Mm, const Scalar &botdens)
{
return botdens * Antioch::ant_exp(-(z - zmin)/((Planet::Constants::Titan::radius<Scalar>() + z) * (Planet::Constants::Titan::radius<Scalar>() + zmin) * 1e3 *
Antioch::Constants::Avogadro<Scalar>() * Planet::Constants::Universal::kb<Scalar>() * T /
(Planet::Constants::Universal::G<Scalar>() * Planet::Constants::Titan::mass<Scalar>() * Mm))
);
}
template<typename Scalar, typename VectorScalar = std::vector<Scalar> >
void read_temperature(VectorScalar &T0, VectorScalar &Tz, const std::string &file)
{
T0.clear();
Tz.clear();
std::string line;
std::ifstream temp(file);
getline(temp,line);
while(!temp.eof())
{
Scalar t,tz,dt,dtz;
temp >> t >> tz >> dt >> dtz;
T0.push_back(t);
Tz.push_back(tz);
}
temp.close();
return;
}
template<typename Scalar, typename VectorScalar>
void densities(const Scalar &z, const Scalar &zmin, const Scalar &zmax, const Scalar &dens_tot,
const Planet::AtmosphericTemperature<Scalar, std::vector<Scalar> > &temperature,
const Scalar &Mmean, const VectorScalar &molar_frac, VectorScalar &sum_dens)
{
Scalar zstep(1.L);
sum_dens.resize(molar_frac.size(),0.L);
for(Scalar ztmp = zmax; ztmp > z; ztmp -= zstep)
{
Scalar T = temperature.neutral_temperature(z);
Scalar nTot = barometry(zmin,ztmp,T,Mmean,dens_tot);
for(unsigned int s = 0; s < molar_frac.size(); s++)
{
sum_dens[s] += nTot * molar_frac[s] * zstep;
}
}
}
template<typename Scalar>
Scalar a(const Scalar &T, const Scalar &Mmean, const Scalar &z)
{
return Planet::Constants::g<Scalar>(Planet::Constants::Titan::radius<Scalar>(),z,Planet::Constants::Titan::mass<Scalar>()) * Mmean *
(Planet::Constants::Titan::radius<Scalar>() + z) * Scalar(1e3) / (Antioch::Constants::Avogadro<Scalar>() * Planet::Constants::Universal::kb<Scalar>() * T);
}
template<typename Scalar>
int tester(const std::string &input_T, const std::string &input_N2, const std::string &input_CH4)
{
Scalar chi(120);
//
Scalar zmin(600.);
Scalar zmax(1400.);
Scalar zstep(10.);
//
Scalar MN(14.008L), MC(12.011), MH(1.008L);
Scalar MN2 = 2.L*MN , MCH4 = MC + 4.L*MH;
std::vector<Scalar> Mm;
Mm.push_back(MN2);
Mm.push_back(MCH4);
std::vector<Scalar> molar_frac;
molar_frac.push_back(0.96L);
molar_frac.push_back(0.04L);
molar_frac.push_back(0.L);
Scalar dens_tot(1e12L);
Scalar Mmean(0.L);
for(unsigned int s = 0; s < Mm.size(); s++)
{
Mmean += Mm[s] * molar_frac[s];
}
Mmean *= 1e-3; // to kg
////cross-section
std::vector<Scalar> lambda;
for(Scalar l = 0.1; l < 300.; l += 1.)
{
lambda.push_back(l);
}
std::vector<std::vector<Scalar> > sigmas;
std::vector<std::vector<Scalar> > lambdas;
sigmas.resize(2);
lambdas.resize(2);
read_crossSection<Scalar>(lambdas[0],input_N2,sigmas[0]);
read_crossSection<Scalar>(lambdas[1],input_CH4,sigmas[1]);
std::vector<std::vector<Scalar> > sigma_ref;
sigma_ref.resize(2);
Antioch::SigmaBinConverter<std::vector<Scalar> > binconv;
for(unsigned int i = 0; i < 2; i++)
{
sigma_ref[i].resize(lambda.size());
binconv.y_on_custom_grid(lambdas[i],sigmas[i],lambda,sigma_ref[i]);
}
//////
Planet::Chapman<Scalar> chapman(chi);
/////
Planet::PhotonOpacity<Scalar,std::vector<Scalar> > tau(chapman);
tau.add_cross_section(lambdas[0],sigmas[0],0, 0);
tau.add_cross_section(lambdas[1],sigmas[1],1, 1);
tau.update_cross_section(lambda);
//temperature
std::vector<Scalar> T0,Tz;
read_temperature<Scalar>(T0,Tz,input_T);
Planet::AtmosphericTemperature<Scalar, std::vector<Scalar> > temperature(T0, T0, Tz, Tz);
////////////////////:
molar_frac.pop_back();
int return_flag(0);
const Scalar tol = std::numeric_limits<Scalar>::epsilon() * 100.;
for(Scalar z = zmin; z <= zmax; z += zstep)
{
Scalar T = temperature.neutral_temperature(z);
std::vector<Scalar> sum_dens;
densities(z,zmin,zmax,dens_tot,temperature,Mmean,molar_frac,sum_dens);
Scalar x = a(T,Mmean,z);
std::vector<Scalar> tau_cal;
tau.compute_tau(x,sum_dens,tau_cal);
for(unsigned int il = 0; il < lambda.size(); il++)
{
Scalar tau_exact(0.L);
for(unsigned int s = 0; s < 2; s++)
{
tau_exact += sigma_ref[s][il] * sum_dens[s]; // cm-3.km
return_flag = check(tau.absorbing_species_cs()[s].cross_section_on_custom_grid()[il],
sigma_ref[s][il],tol,"sigma ref of species at altitude and wavelength") ||
return_flag;
}
tau_exact *= chapman(x) * 1e5; //cm-1.km to no unit
return_flag = check(tau_cal[il],tau_exact,tol,"tau at altitude and wavelength") ||
return_flag;
}
}
return return_flag;
}
int main(int argc, char** argv)
{
// Check command line count.
if( argc < 4 )
{
// TODO: Need more consistent error handling.
std::cerr << "Error: Must specify input file." << std::endl;
antioch_error();
}
return (tester<float>(std::string(argv[1]), std::string(argv[2]), std::string(argv[3])) ||
tester<double>(std::string(argv[1]), std::string(argv[2]), std::string(argv[3])) ||
tester<long double>(std::string(argv[1]), std::string(argv[2]), std::string(argv[3])));
}
|
//-----------------------------------------------------------------------bl-
//--------------------------------------------------------------------------
//
// Planet - An atmospheric code for planetary bodies, adapted to Titan
//
// Copyright (C) 2013 The PECOS Development Team
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the Version 2.1 GNU Lesser General
// Public License as published by the Free Software Foundation.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc. 51 Franklin Street, Fifth Floor,
// Boston, MA 02110-1301 USA
//
//-----------------------------------------------------------------------el-
//Antioch
#include "antioch/vector_utils_decl.h"
#include "antioch/cmath_shims.h"
#include "antioch/sigma_bin_converter.h"
#include "antioch/vector_utils.h"
#include "antioch/physical_constants.h"
//Planet
#include "planet/photon_opacity.h"
#include "planet/planet_constants.h"
#include "planet/atmospheric_temperature.h"
//C++
#include <iostream>
#include <fstream>
#include <iomanip>
#include <limits>
#include <string>
#include <vector>
template<typename Scalar>
int check(const Scalar &test, const Scalar &ref, const Scalar &tol, const std::string &model)
{
if(Antioch::ant_abs(test - ref)/ref > tol && Antioch::ant_abs(test - ref) > tol)
{
std::cout << std::scientific << std::setprecision(20)
<< "Error in binary diffusion calculations" << std::endl
<< "model is " << model << std::endl
<< "calculated coefficient = " << test << std::endl
<< "solution = " << ref << std::endl
<< "relative error = " << Antioch::ant_abs(test - ref)/ref << std::endl
<< "tolerance = " << tol << std::endl;
return 1;
}
return 0;
}
template<typename Scalar, typename VectorScalar = std::vector<Scalar> >
void read_crossSection(VectorScalar & lambda, const std::string &file, VectorScalar &sigma)
{
std::string line;
std::ifstream sig_f(file);
getline(sig_f,line);
while(!sig_f.eof())
{
Scalar wv(-1),sigt,dsig;
sig_f >> wv >> sigt >> dsig;
if(!sig_f.good())break;
lambda.push_back(wv);//A -> nm
sigma.push_back(sigt);//cm-2/A -> m-2/nm
}
sig_f.close();
return;
}
template<typename Scalar>
Scalar barometry(const Scalar &zmin, const Scalar &z, const Scalar &T, const Scalar &Mm, const Scalar &botdens)
{
return botdens * Antioch::ant_exp(-(z - zmin)/((Planet::Constants::Titan::radius<Scalar>() + z) * (Planet::Constants::Titan::radius<Scalar>() + zmin) * 1e3 *
Antioch::Constants::Avogadro<Scalar>() * Planet::Constants::Universal::kb<Scalar>() * T /
(Planet::Constants::Universal::G<Scalar>() * Planet::Constants::Titan::mass<Scalar>() * Mm))
);
}
template<typename Scalar, typename VectorScalar = std::vector<Scalar> >
void read_temperature(VectorScalar &T0, VectorScalar &Tz, const std::string &file)
{
T0.clear();
Tz.clear();
std::string line;
std::ifstream temp(file);
getline(temp,line);
while(!temp.eof())
{
Scalar t,tz,dt,dtz;
temp >> t >> tz >> dt >> dtz;
if(!temp.good())break;
T0.push_back(t);
Tz.push_back(tz);
}
temp.close();
return;
}
template<typename Scalar, typename VectorScalar>
void densities(const Scalar &z, const Scalar &zmin, const Scalar &zmax, const Scalar &dens_tot,
const Planet::AtmosphericTemperature<Scalar, std::vector<Scalar> > &temperature,
const Scalar &Mmean, const VectorScalar &molar_frac, VectorScalar &sum_dens)
{
Scalar zstep(1.L);
sum_dens.resize(molar_frac.size(),0.L);
for(Scalar ztmp = zmax; ztmp > z; ztmp -= zstep)
{
Scalar T = temperature.neutral_temperature(z);
Scalar nTot = barometry(zmin,ztmp,T,Mmean,dens_tot);
for(unsigned int s = 0; s < molar_frac.size(); s++)
{
sum_dens[s] += nTot * molar_frac[s] * zstep;
}
}
}
template<typename Scalar>
Scalar a(const Scalar &T, const Scalar &Mmean, const Scalar &z)
{
return Planet::Constants::g<Scalar>(Planet::Constants::Titan::radius<Scalar>(),z,Planet::Constants::Titan::mass<Scalar>()) * Mmean *
(Planet::Constants::Titan::radius<Scalar>() + z) * Scalar(1e3) / (Antioch::Constants::Avogadro<Scalar>() * Planet::Constants::Universal::kb<Scalar>() * T);
}
template<typename Scalar>
int tester(const std::string &input_T, const std::string &input_N2, const std::string &input_CH4)
{
Scalar chi(120);
//
Scalar zmin(600.);
Scalar zmax(1400.);
Scalar zstep(10.);
//
Scalar MN(14.008L), MC(12.011), MH(1.008L);
Scalar MN2 = 2.L*MN , MCH4 = MC + 4.L*MH;
std::vector<Scalar> Mm;
Mm.push_back(MN2);
Mm.push_back(MCH4);
std::vector<Scalar> molar_frac;
molar_frac.push_back(0.96L);
molar_frac.push_back(0.04L);
molar_frac.push_back(0.L);
Scalar dens_tot(1e12L);
Scalar Mmean(0.L);
for(unsigned int s = 0; s < Mm.size(); s++)
{
Mmean += Mm[s] * molar_frac[s];
}
Mmean *= 1e-3; // to kg
////cross-section
std::vector<Scalar> lambda;
for(Scalar l = 0.1; l < 300.; l += 1.)
{
lambda.push_back(l);
}
std::vector<std::vector<Scalar> > sigmas;
std::vector<std::vector<Scalar> > lambdas;
sigmas.resize(2);
lambdas.resize(2);
read_crossSection<Scalar>(lambdas[0],input_N2,sigmas[0]);
read_crossSection<Scalar>(lambdas[1],input_CH4,sigmas[1]);
std::vector<std::vector<Scalar> > sigma_ref;
sigma_ref.resize(2);
Antioch::SigmaBinConverter<std::vector<Scalar> > binconv;
for(unsigned int i = 0; i < 2; i++)
{
sigma_ref[i].resize(lambda.size());
binconv.y_on_custom_grid(lambdas[i],sigmas[i],lambda,sigma_ref[i]);
}
//////
Planet::Chapman<Scalar> chapman(chi);
/////
Planet::PhotonOpacity<Scalar,std::vector<Scalar> > tau(chapman);
tau.add_cross_section(lambdas[0],sigmas[0],0, 0);
tau.add_cross_section(lambdas[1],sigmas[1],1, 1);
tau.update_cross_section(lambda);
//temperature
std::vector<Scalar> T0,Tz;
read_temperature<Scalar>(T0,Tz,input_T);
Planet::AtmosphericTemperature<Scalar, std::vector<Scalar> > temperature(T0, T0, Tz, Tz);
////////////////////:
molar_frac.pop_back();
int return_flag(0);
const Scalar tol = std::numeric_limits<Scalar>::epsilon() * 100.;
for(Scalar z = zmin; z <= zmax; z += zstep)
{
Scalar T = temperature.neutral_temperature(z);
std::vector<Scalar> sum_dens;
densities(z,zmin,zmax,dens_tot,temperature,Mmean,molar_frac,sum_dens);
Scalar x = a(T,Mmean,z);
std::vector<Scalar> tau_cal;
tau.compute_tau(x,sum_dens,tau_cal);
for(unsigned int il = 0; il < lambda.size(); il++)
{
Scalar tau_exact(0.L);
for(unsigned int s = 0; s < 2; s++)
{
tau_exact += sigma_ref[s][il] * sum_dens[s]; // cm-3.km
return_flag = check(tau.absorbing_species_cs()[s].cross_section_on_custom_grid()[il],
sigma_ref[s][il],tol,"sigma ref of species at altitude and wavelength") ||
return_flag;
}
tau_exact *= chapman(x) * 1e5; //cm-1.km to no unit
return_flag = check(tau_cal[il],tau_exact,tol,"tau at altitude and wavelength") ||
return_flag;
}
}
return return_flag;
}
int main(int argc, char** argv)
{
// Check command line count.
if( argc < 4 )
{
// TODO: Need more consistent error handling.
std::cerr << "Error: Must specify input file." << std::endl;
antioch_error();
}
return (tester<float>(std::string(argv[1]), std::string(argv[2]), std::string(argv[3])) ||
tester<double>(std::string(argv[1]), std::string(argv[2]), std::string(argv[3])) ||
tester<long double>(std::string(argv[1]), std::string(argv[2]), std::string(argv[3])));
}
|
read updated
|
read updated
|
C++
|
lgpl-2.1
|
Planet-INC/Planet_INC,Planet-INC/Planet_INC,Planet-INC/Planet_INC,Planet-INC/Planet_INC,Planet-INC/Planet_INC
|
674da46f979f5a763ac1bc76152597f10c20fc76
|
test/src/mt/threadpool.hpp
|
test/src/mt/threadpool.hpp
|
/**
* Created by Jian Chen
* @since 2016.06.06
* @author Jian Chen <[email protected]>
* @link http://chensoft.com
*/
#pragma once
#include <chen/chen.hpp>
#include <gtest/gtest.h>
TEST(MtThreadpoolTest, Single)
{
// check prime number, it's time consuming
// when build in release mode, it takes about 100ms on my Macbook
// my cpu is 2.6 GHz Intel Core i5
for (unsigned i = 1; i <= 20000; ++i)
chen::num::prime(i);
}
TEST(MtThreadpoolTest, Multiple)
{
// make sure your cpu is multi-core, otherwise the elapsed time is close to the above test
// it takes about 50ms on my Macbook because my cpu is dual-core
auto check = [] (unsigned min, unsigned max) {
for (unsigned i = min; i <= max; ++i)
chen::num::prime(i);
};
chen::threadpool pool;
std::vector<std::future<void>> task;
// we split task into several parts
auto count = pool.count();
auto part = 20000 / count;
for (int i = 0; i < count; ++i)
{
task.push_back(pool.post(std::bind(check, 1 + part * i, part * (i + 1))));
}
// wait all tasks to be done
for (auto &future : task)
future.get();
}
|
/**
* Created by Jian Chen
* @since 2016.06.06
* @author Jian Chen <[email protected]>
* @link http://chensoft.com
*/
#pragma once
#include <chen/chen.hpp>
#include <gtest/gtest.h>
TEST(MtThreadpoolTest, Single)
{
// check prime number, it's time consuming
// when build in release mode, it takes about 100ms on my Macbook
// my cpu is 2.6 GHz Intel Core i5
for (unsigned i = 1; i <= 20000; ++i)
chen::num::prime(i);
}
TEST(MtThreadpoolTest, Multiple)
{
// make sure your cpu is multi-core, otherwise the elapsed time is close to the above test
// it takes about 50ms on my Macbook because my cpu is dual-core
auto check = [] (unsigned min, unsigned max) {
for (unsigned i = min; i <= max; ++i)
chen::num::prime(i);
};
chen::threadpool pool;
std::vector<std::future<void>> task;
// we split task into several parts
auto count = pool.count();
auto part = 20000 / count;
for (std::size_t i = 0; i < count; ++i)
{
task.push_back(pool.post(std::bind(check, 1 + part * i, part * (i + 1))));
}
// wait all tasks to be done
for (auto &future : task)
future.get();
}
|
fix compile warning
|
test: fix compile warning
|
C++
|
mit
|
chensoft/libsocket,chensoft/libchen,chensoft/libsocket,chensoft/libsocket,chensoft/libsocket
|
6ebb925acd6336760f6f9453e860944e0e314a7b
|
test/syscalls/linux/dev.cc
|
test/syscalls/linux/dev.cc
|
// Copyright 2018 The gVisor Authors.
//
// Licensed 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 <fcntl.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <unistd.h>
#include <vector>
#include "gmock/gmock.h"
#include "gtest/gtest.h"
#include "test/util/file_descriptor.h"
#include "test/util/test_util.h"
namespace gvisor {
namespace testing {
namespace {
TEST(DevTest, LseekDevUrandom) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/urandom", O_RDONLY));
EXPECT_THAT(lseek(fd.get(), -10, SEEK_CUR), SyscallSucceeds());
EXPECT_THAT(lseek(fd.get(), -10, SEEK_SET), SyscallSucceeds());
EXPECT_THAT(lseek(fd.get(), 0, SEEK_CUR), SyscallSucceeds());
}
TEST(DevTest, LseekDevNull) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/null", O_RDONLY));
EXPECT_THAT(lseek(fd.get(), -10, SEEK_CUR), SyscallSucceeds());
EXPECT_THAT(lseek(fd.get(), -10, SEEK_SET), SyscallSucceeds());
EXPECT_THAT(lseek(fd.get(), 0, SEEK_CUR), SyscallSucceeds());
EXPECT_THAT(lseek(fd.get(), 0, SEEK_END), SyscallSucceeds());
}
TEST(DevTest, LseekDevZero) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/zero", O_RDONLY));
EXPECT_THAT(lseek(fd.get(), 0, SEEK_CUR), SyscallSucceeds());
EXPECT_THAT(lseek(fd.get(), 0, SEEK_END), SyscallSucceeds());
}
TEST(DevTest, LseekDevFull) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/full", O_RDONLY));
EXPECT_THAT(lseek(fd.get(), 123, SEEK_SET), SyscallSucceedsWithValue(0));
EXPECT_THAT(lseek(fd.get(), 123, SEEK_CUR), SyscallSucceedsWithValue(0));
EXPECT_THAT(lseek(fd.get(), 123, SEEK_END), SyscallSucceedsWithValue(0));
}
TEST(DevTest, LseekDevNullFreshFile) {
// Seeks to /dev/null always return 0.
const FileDescriptor fd1 =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/null", O_RDONLY));
const FileDescriptor fd2 =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/null", O_RDONLY));
EXPECT_THAT(lseek(fd1.get(), 0, SEEK_CUR), SyscallSucceedsWithValue(0));
EXPECT_THAT(lseek(fd1.get(), 1000, SEEK_CUR), SyscallSucceedsWithValue(0));
EXPECT_THAT(lseek(fd2.get(), 0, SEEK_CUR), SyscallSucceedsWithValue(0));
const FileDescriptor fd3 =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/null", O_RDONLY));
EXPECT_THAT(lseek(fd3.get(), 0, SEEK_CUR), SyscallSucceedsWithValue(0));
}
TEST(DevTest, OpenTruncate) {
// Truncation is ignored on linux and gvisor for device files.
ASSERT_NO_ERRNO_AND_VALUE(
Open("/dev/null", O_CREAT | O_TRUNC | O_WRONLY, 0644));
ASSERT_NO_ERRNO_AND_VALUE(
Open("/dev/zero", O_CREAT | O_TRUNC | O_WRONLY, 0644));
ASSERT_NO_ERRNO_AND_VALUE(
Open("/dev/full", O_CREAT | O_TRUNC | O_WRONLY, 0644));
}
TEST(DevTest, Pread64DevNull) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/null", O_RDONLY));
char buf[1];
EXPECT_THAT(pread64(fd.get(), buf, 1, 0), SyscallSucceedsWithValue(0));
}
TEST(DevTest, Pread64DevZero) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/zero", O_RDONLY));
char buf[1];
EXPECT_THAT(pread64(fd.get(), buf, 1, 0), SyscallSucceedsWithValue(1));
}
TEST(DevTest, Pread64DevFull) {
// /dev/full behaves like /dev/zero with respect to reads.
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/full", O_RDONLY));
char buf[1];
EXPECT_THAT(pread64(fd.get(), buf, 1, 0), SyscallSucceedsWithValue(1));
}
TEST(DevTest, ReadDevNull) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/null", O_RDONLY));
std::vector<char> buf(1);
EXPECT_THAT(ReadFd(fd.get(), buf.data(), 1), SyscallSucceeds());
}
// Do not allow random save as it could lead to partial reads.
TEST(DevTest, ReadDevZero_NoRandomSave) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/zero", O_RDONLY));
constexpr int kReadSize = 128 * 1024;
std::vector<char> buf(kReadSize, 1);
EXPECT_THAT(ReadFd(fd.get(), buf.data(), kReadSize),
SyscallSucceedsWithValue(kReadSize));
EXPECT_EQ(std::vector<char>(kReadSize, 0), buf);
}
TEST(DevTest, WriteDevNull) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/null", O_WRONLY));
EXPECT_THAT(WriteFd(fd.get(), "a", 1), SyscallSucceedsWithValue(1));
}
TEST(DevTest, WriteDevZero) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/zero", O_WRONLY));
EXPECT_THAT(WriteFd(fd.get(), "a", 1), SyscallSucceedsWithValue(1));
}
TEST(DevTest, WriteDevFull) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/full", O_WRONLY));
EXPECT_THAT(WriteFd(fd.get(), "a", 1), SyscallFailsWithErrno(ENOSPC));
}
TEST(DevTest, TTYExists) {
struct stat statbuf = {};
ASSERT_THAT(stat("/dev/tty", &statbuf), SyscallSucceeds());
}
} // namespace
} // namespace testing
} // namespace gvisor
|
// Copyright 2018 The gVisor Authors.
//
// Licensed 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 <fcntl.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <unistd.h>
#include <vector>
#include "gmock/gmock.h"
#include "gtest/gtest.h"
#include "test/util/file_descriptor.h"
#include "test/util/test_util.h"
namespace gvisor {
namespace testing {
namespace {
TEST(DevTest, LseekDevUrandom) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/urandom", O_RDONLY));
EXPECT_THAT(lseek(fd.get(), -10, SEEK_CUR), SyscallSucceeds());
EXPECT_THAT(lseek(fd.get(), -10, SEEK_SET), SyscallSucceeds());
EXPECT_THAT(lseek(fd.get(), 0, SEEK_CUR), SyscallSucceeds());
}
TEST(DevTest, LseekDevNull) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/null", O_RDONLY));
EXPECT_THAT(lseek(fd.get(), -10, SEEK_CUR), SyscallSucceeds());
EXPECT_THAT(lseek(fd.get(), -10, SEEK_SET), SyscallSucceeds());
EXPECT_THAT(lseek(fd.get(), 0, SEEK_CUR), SyscallSucceeds());
EXPECT_THAT(lseek(fd.get(), 0, SEEK_END), SyscallSucceeds());
}
TEST(DevTest, LseekDevZero) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/zero", O_RDONLY));
EXPECT_THAT(lseek(fd.get(), 0, SEEK_CUR), SyscallSucceeds());
EXPECT_THAT(lseek(fd.get(), 0, SEEK_END), SyscallSucceeds());
}
TEST(DevTest, LseekDevFull) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/full", O_RDONLY));
EXPECT_THAT(lseek(fd.get(), 123, SEEK_SET), SyscallSucceedsWithValue(0));
EXPECT_THAT(lseek(fd.get(), 123, SEEK_CUR), SyscallSucceedsWithValue(0));
EXPECT_THAT(lseek(fd.get(), 123, SEEK_END), SyscallSucceedsWithValue(0));
}
TEST(DevTest, LseekDevNullFreshFile) {
// Seeks to /dev/null always return 0.
const FileDescriptor fd1 =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/null", O_RDONLY));
const FileDescriptor fd2 =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/null", O_RDONLY));
EXPECT_THAT(lseek(fd1.get(), 0, SEEK_CUR), SyscallSucceedsWithValue(0));
EXPECT_THAT(lseek(fd1.get(), 1000, SEEK_CUR), SyscallSucceedsWithValue(0));
EXPECT_THAT(lseek(fd2.get(), 0, SEEK_CUR), SyscallSucceedsWithValue(0));
const FileDescriptor fd3 =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/null", O_RDONLY));
EXPECT_THAT(lseek(fd3.get(), 0, SEEK_CUR), SyscallSucceedsWithValue(0));
}
TEST(DevTest, OpenTruncate) {
// Truncation is ignored on linux and gvisor for device files.
ASSERT_NO_ERRNO_AND_VALUE(
Open("/dev/null", O_CREAT | O_TRUNC | O_WRONLY, 0644));
ASSERT_NO_ERRNO_AND_VALUE(
Open("/dev/zero", O_CREAT | O_TRUNC | O_WRONLY, 0644));
ASSERT_NO_ERRNO_AND_VALUE(
Open("/dev/full", O_CREAT | O_TRUNC | O_WRONLY, 0644));
}
TEST(DevTest, Pread64DevNull) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/null", O_RDONLY));
char buf[1];
EXPECT_THAT(pread64(fd.get(), buf, 1, 0), SyscallSucceedsWithValue(0));
}
TEST(DevTest, Pread64DevZero) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/zero", O_RDONLY));
char buf[1];
EXPECT_THAT(pread64(fd.get(), buf, 1, 0), SyscallSucceedsWithValue(1));
}
TEST(DevTest, Pread64DevFull) {
// /dev/full behaves like /dev/zero with respect to reads.
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/full", O_RDONLY));
char buf[1];
EXPECT_THAT(pread64(fd.get(), buf, 1, 0), SyscallSucceedsWithValue(1));
}
TEST(DevTest, ReadDevNull) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/null", O_RDONLY));
std::vector<char> buf(1);
EXPECT_THAT(ReadFd(fd.get(), buf.data(), 1), SyscallSucceeds());
}
// Do not allow random save as it could lead to partial reads.
TEST(DevTest, ReadDevZero_NoRandomSave) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/zero", O_RDONLY));
constexpr int kReadSize = 128 * 1024;
std::vector<char> buf(kReadSize, 1);
EXPECT_THAT(ReadFd(fd.get(), buf.data(), kReadSize),
SyscallSucceedsWithValue(kReadSize));
EXPECT_EQ(std::vector<char>(kReadSize, 0), buf);
}
TEST(DevTest, WriteDevNull) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/null", O_WRONLY));
EXPECT_THAT(WriteFd(fd.get(), "a", 1), SyscallSucceedsWithValue(1));
}
TEST(DevTest, WriteDevZero) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/zero", O_WRONLY));
EXPECT_THAT(WriteFd(fd.get(), "a", 1), SyscallSucceedsWithValue(1));
}
TEST(DevTest, WriteDevFull) {
const FileDescriptor fd =
ASSERT_NO_ERRNO_AND_VALUE(Open("/dev/full", O_WRONLY));
EXPECT_THAT(WriteFd(fd.get(), "a", 1), SyscallFailsWithErrno(ENOSPC));
}
TEST(DevTest, TTYExists) {
struct stat statbuf = {};
ASSERT_THAT(stat("/dev/tty", &statbuf), SyscallSucceeds());
// Check that it's a character device with rw-rw-rw- permissions.
EXPECT_EQ(statbuf.st_mode, S_IFCHR | 0666);
// Check that it's owned by root.
EXPECT_EQ(statbuf.st_uid, 0);
}
} // namespace
} // namespace testing
} // namespace gvisor
|
Add permission, char device, and uid checks.
|
Add permission, char device, and uid checks.
Change-Id: I8307bfb390a56424aaa651285a218aad277c4aed
|
C++
|
apache-2.0
|
google/gvisor,google/gvisor,google/gvisor,google/gvisor,google/gvisor,google/gvisor,google/gvisor,google/gvisor
|
67a7f3f295bc051063a068d81eff6f4ce5a9d956
|
test/t_istream_replace.cxx
|
test/t_istream_replace.cxx
|
/*
* Copyright 2007-2018 Content Management AG
* All rights reserved.
*
* author: Max Kellermann <[email protected]>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* - Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* - Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the
* distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "IstreamFilterTest.hxx"
#include "istream/ReplaceIstream.hxx"
#include "istream/istream_string.hxx"
#include "istream/UnusedPtr.hxx"
class IstreamReplaceTestTraits {
public:
static constexpr const char *expected_result = "foo";
static constexpr bool call_available = true;
static constexpr bool got_data_assert = true;
static constexpr bool enable_blocking = true;
static constexpr bool enable_abort_istream = true;
UnusedIstreamPtr CreateInput(struct pool &pool) const noexcept {
return istream_string_new(pool, "foo");
}
UnusedIstreamPtr CreateTest(EventLoop &event_loop, struct pool &pool,
UnusedIstreamPtr input) const noexcept {
auto replace = istream_replace_new(event_loop, pool, std::move(input));
replace.second->Add(0, 0, nullptr);
replace.second->Add(3, 3, nullptr);
replace.second->Finish();
return std::move(replace.first);
}
};
INSTANTIATE_TYPED_TEST_CASE_P(Replace, IstreamFilterTest,
IstreamReplaceTestTraits);
class IstreamReplace2TestTraits {
public:
static constexpr const char *expected_result =
"abcfoofghijklmnopqrstuvwxyz";
static constexpr bool call_available = true;
static constexpr bool got_data_assert = true;
static constexpr bool enable_blocking = true;
static constexpr bool enable_abort_istream = true;
UnusedIstreamPtr CreateInput(struct pool &pool) const noexcept {
return istream_string_new(pool, "foo");
}
UnusedIstreamPtr CreateTest(EventLoop &event_loop, struct pool &pool,
UnusedIstreamPtr input) const noexcept {
auto istream =
istream_string_new(pool, "abcdefghijklmnopqrstuvwxyz");
auto replace = istream_replace_new(event_loop, pool, std::move(istream));
replace.second->Add(3, 3, std::move(input));
replace.second->Extend(3, 4);
replace.second->Extend(3, 5);
replace.second->Finish();
return std::move(replace.first);
}
};
INSTANTIATE_TYPED_TEST_CASE_P(Replace2, IstreamFilterTest,
IstreamReplace2TestTraits);
|
/*
* Copyright 2007-2020 CM4all GmbH
* All rights reserved.
*
* author: Max Kellermann <[email protected]>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* - Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* - Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the
* distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "IstreamFilterTest.hxx"
#include "istream/ReplaceIstream.hxx"
#include "istream/istream_string.hxx"
#include "istream/UnusedPtr.hxx"
class IstreamReplaceTestTraits {
public:
static constexpr const char *expected_result = "foo";
static constexpr bool call_available = true;
static constexpr bool got_data_assert = true;
static constexpr bool enable_blocking = true;
static constexpr bool enable_abort_istream = true;
UnusedIstreamPtr CreateInput(struct pool &pool) const noexcept {
return istream_string_new(pool, "foo");
}
UnusedIstreamPtr CreateTest(EventLoop &event_loop, struct pool &pool,
UnusedIstreamPtr input) const noexcept {
auto replace = istream_replace_new(event_loop, pool, std::move(input));
replace.second->Add(0, 0, nullptr);
replace.second->Add(3, 3, nullptr);
replace.second->Finish();
return std::move(replace.first);
}
};
INSTANTIATE_TYPED_TEST_CASE_P(Replace, IstreamFilterTest,
IstreamReplaceTestTraits);
class IstreamReplace2TestTraits {
public:
static constexpr const char *expected_result =
"abcfoofghijklmnopqrstuvwxyz";
static constexpr bool call_available = true;
static constexpr bool got_data_assert = true;
static constexpr bool enable_blocking = true;
static constexpr bool enable_abort_istream = true;
UnusedIstreamPtr CreateInput(struct pool &pool) const noexcept {
return istream_string_new(pool, "foo");
}
UnusedIstreamPtr CreateTest(EventLoop &event_loop, struct pool &pool,
UnusedIstreamPtr input) const noexcept {
auto istream =
istream_string_new(pool, "abcdefghijklmnopqrstuvwxyz");
auto replace = istream_replace_new(event_loop, pool, std::move(istream));
replace.second->Add(3, 3, std::move(input));
replace.second->Extend(3, 4);
replace.second->Extend(3, 5);
replace.second->Finish();
return std::move(replace.first);
}
};
INSTANTIATE_TYPED_TEST_CASE_P(Replace2, IstreamFilterTest,
IstreamReplace2TestTraits);
|
indent with tabs
|
test/t_istream_replace: indent with tabs
|
C++
|
bsd-2-clause
|
CM4all/beng-proxy,CM4all/beng-proxy,CM4all/beng-proxy,CM4all/beng-proxy,CM4all/beng-proxy,CM4all/beng-proxy
|
f51ad7538b0a277ed2412f8b3f932993fc5b642e
|
src/quickdraw/qStdRRect.cpp
|
src/quickdraw/qStdRRect.cpp
|
/* Copyright 1986, 1988, 1989, 1990 by Abacus Research and
* Development, Inc. All rights reserved.
*/
/* Forward declarations in QuickDraw.h (DO NOT DELETE THIS LINE) */
#include <base/common.h>
#include <QuickDraw.h>
#include <CQuickDraw.h>
#include <MemoryMgr.h>
#include <quickdraw/cquick.h>
#include <quickdraw/picture.h>
#include <util/handle_vector.h>
#include <iostream>
using namespace Executor;
using RgnVector = handle_vector<int16_t, RgnHandle, 10>;
static RgnHandle roundRectRgn(const Rect& r, int16_t width, int16_t height)
{
width = std::min<int16_t>(width, r.right - r.left);
height = std::min<int16_t>(height, r.bottom - r.top);
Rect ovalRect { r.top, r.left, r.top + height, r.left + width };
RgnHandle rgn = ROMlib_circrgn(ovalRect);
(*rgn)->rgnBBox = r;
RgnVector vec(rgn);
int16_t midX = r.left + width / 2;
int16_t midY = r.top + height / 2;
int16_t insertX = r.right - r.left - width;
int16_t insertY = r.bottom - r.top - width;
for(auto p = vec.begin(); *p != RGN_STOP; ++p)
{
if(*p >= midY)
*p += insertY;
for(++p; *p != RGN_STOP; ++p)
if(*p >= midX)
*p += insertX;
}
return vec.release();
}
void Executor::C_StdRRect(GrafVerb verb, const Rect *r, INTEGER width, INTEGER height)
{
PAUSEDECL;
if(qdGlobals().thePort->picSave)
{
GUEST<Point> p = { height, width };
ROMlib_drawingverbrectovalpicupdate(verb, r, &p);
PICOP(OP_frameRRect + (int)verb);
PICWRITE(r, sizeof(*r));
}
if(PORT_PEN_VIS(qdGlobals().thePort) < 0
&& (!PORT_REGION_SAVE(qdGlobals().thePort) || verb != frame))
/*-->*/ return;
PAUSERECORDING;
if(width < 4 && height < 4)
StdRect(verb, r);
else
{
RgnHandle rh = roundRectRgn(*r, width, height);
if(verb == frame)
{
if(RgnHandle rsave = (RgnHandle)PORT_REGION_SAVE(qdGlobals().thePort))
XorRgn(rh, rsave, rsave);
Rect inner = *r;
Point penSize = PORT_PEN_SIZE(qdGlobals().thePort);
InsetRect(&inner, penSize.h, penSize.v);
RgnHandle innerRgn = roundRectRgn(inner, width - 2 * penSize.h, height - 2 * penSize.v);
DiffRgn(rh, innerRgn, rh);
DisposeRgn(innerRgn);
StdRgn(paint, rh);
}
else
StdRgn(verb, rh);
DisposeRgn(rh);
}
RESUMERECORDING;
}
|
/* Copyright 1986, 1988, 1989, 1990 by Abacus Research and
* Development, Inc. All rights reserved.
*/
/* Forward declarations in QuickDraw.h (DO NOT DELETE THIS LINE) */
#include <base/common.h>
#include <QuickDraw.h>
#include <CQuickDraw.h>
#include <MemoryMgr.h>
#include <quickdraw/cquick.h>
#include <quickdraw/picture.h>
#include <util/handle_vector.h>
#include <algorithm>
using namespace Executor;
using RgnVector = handle_vector<int16_t, RgnHandle, 10>;
static RgnHandle roundRectRgn(const Rect& r, int16_t width, int16_t height)
{
width = std::min<int16_t>(width, r.right - r.left);
height = std::min<int16_t>(height, r.bottom - r.top);
Rect ovalRect { r.top, r.left, r.top + height, r.left + width };
RgnHandle rgn = ROMlib_circrgn(ovalRect);
(*rgn)->rgnBBox = r;
RgnVector vec(rgn);
int16_t midX = r.left + width / 2;
int16_t midY = r.top + height / 2;
int16_t insertX = r.right - r.left - width;
int16_t insertY = r.bottom - r.top - width;
for(auto p = vec.begin(); *p != RGN_STOP; ++p)
{
if(*p >= midY)
*p += insertY;
for(++p; *p != RGN_STOP; ++p)
if(*p >= midX)
*p += insertX;
}
return vec.release();
}
void Executor::C_StdRRect(GrafVerb verb, const Rect *r, INTEGER width, INTEGER height)
{
PAUSEDECL;
if(qdGlobals().thePort->picSave)
{
GUEST<Point> p = { height, width };
ROMlib_drawingverbrectovalpicupdate(verb, r, &p);
PICOP(OP_frameRRect + (int)verb);
PICWRITE(r, sizeof(*r));
}
if(PORT_PEN_VIS(qdGlobals().thePort) < 0
&& (!PORT_REGION_SAVE(qdGlobals().thePort) || verb != frame))
/*-->*/ return;
PAUSERECORDING;
if(width < 4 && height < 4)
StdRect(verb, r);
else
{
RgnHandle rh = roundRectRgn(*r, width, height);
if(verb == frame)
{
if(RgnHandle rsave = (RgnHandle)PORT_REGION_SAVE(qdGlobals().thePort))
XorRgn(rh, rsave, rsave);
Rect inner = *r;
Point penSize = PORT_PEN_SIZE(qdGlobals().thePort);
InsetRect(&inner, penSize.h, penSize.v);
RgnHandle innerRgn = roundRectRgn(inner, width - 2 * penSize.h, height - 2 * penSize.v);
DiffRgn(rh, innerRgn, rh);
DisposeRgn(innerRgn);
StdRgn(paint, rh);
}
else
StdRgn(verb, rh);
DisposeRgn(rh);
}
RESUMERECORDING;
}
|
fix #include
|
fix #include
|
C++
|
mit
|
autc04/executor,autc04/executor,autc04/executor,autc04/executor,autc04/executor,autc04/executor
|
b0241e5b20689d3c4c434064941a77c20b61b685
|
cpp/tests/unit-tests/DelayedSchedulerTest.cpp
|
cpp/tests/unit-tests/DelayedSchedulerTest.cpp
|
/*
* #%L
* %%
* Copyright (C) 2011 - 2017 BMW Car IT GmbH
* %%
* Licensed 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.
* #L%
*/
#include <cassert>
#include <cstdint>
#include "tests/utils/Gtest.h"
#include "joynr/DelayedScheduler.h"
#include "joynr/Logger.h"
#include "joynr/Semaphore.h"
#include "joynr/SingleThreadedIOService.h"
#include "tests/JoynrTest.h"
#include "tests/mock/MockRunnable.h"
#include "tests/utils/TimeUtils.h"
using namespace joynr;
using namespace ::testing;
using ::testing::StrictMock;
// Expected accuracy of the timer in milliseconds
static const std::uint64_t timerAccuracy_ms = 15U;
class SimpleDelayedScheduler : public DelayedScheduler
{
public:
SimpleDelayedScheduler(std::shared_ptr<SingleThreadedIOService> singleThreadedIOService)
: DelayedScheduler(std::bind(&SimpleDelayedScheduler::workAvailable,
this,
std::placeholders::_1),
singleThreadedIOService->getIOService()),
est_ms(0)
{
}
~SimpleDelayedScheduler() = default;
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-local-typedefs"
MOCK_CONST_METHOD1(workAvailableCalled, void(std::shared_ptr<Runnable>));
MOCK_CONST_METHOD0(workAvailableInTime, void());
#pragma GCC diagnostic pop
DelayedScheduler::RunnableHandle schedule(std::shared_ptr<Runnable> runnable,
std::chrono::milliseconds delay)
{
RunnableHandle currentHandle = DelayedScheduler::schedule(runnable, delay);
est_ms =
TimeUtils::getCurrentMillisSinceEpoch() + static_cast<std::uint64_t>(delay.count());
return currentHandle;
}
void workAvailable(std::shared_ptr<Runnable> runnable)
{
const std::uint64_t now_ms = TimeUtils::getCurrentMillisSinceEpoch();
workAvailableCalled(runnable);
if (est_ms > 0) {
const std::uint64_t diff_ms = (now_ms > est_ms) ? now_ms - est_ms : est_ms - now_ms;
JOYNR_LOG_TRACE(logger(), "Runnable is available");
JOYNR_LOG_TRACE(logger(), " ETA : {}", est_ms);
JOYNR_LOG_TRACE(logger(), " current : {}", now_ms);
JOYNR_LOG_TRACE(logger(), " difference : {}", diff_ms);
if (diff_ms <= timerAccuracy_ms) {
workAvailableInTime();
}
} else {
JOYNR_LOG_TRACE(logger(), "No delay given but work available called.");
}
// if (runnable->isDeleteOnExit()) {
// delete runnable;
//}
}
private:
std::uint64_t est_ms;
};
TEST(DelayedSchedulerTest, startAndShutdownWithoutWork)
{
auto singleThreadedIOService = std::make_shared<SingleThreadedIOService>();
singleThreadedIOService->start();
auto scheduler = std::make_shared<SimpleDelayedScheduler>(singleThreadedIOService);
scheduler->shutdown();
singleThreadedIOService->stop();
}
TEST(DelayedSchedulerTest, startAndShutdownWithPendingWork_callDtorOfRunnablesCorrect)
{
auto singleThreadedIOService = std::make_shared<SingleThreadedIOService>();
singleThreadedIOService->start();
auto scheduler = std::make_shared<SimpleDelayedScheduler>(singleThreadedIOService);
// Dtor should be called
auto runnable1 = std::make_shared<StrictMock<MockRunnable>>();
scheduler->schedule(runnable1, std::chrono::milliseconds(100));
// Dtor called after scheduler was cleaned
auto runnable2 = std::make_shared<StrictMock<MockRunnable>>();
scheduler->schedule(runnable2, std::chrono::milliseconds(100));
EXPECT_CALL(*runnable1, dtorCalled()).Times(1);
std::this_thread::sleep_for(std::chrono::milliseconds(10));
scheduler->shutdown();
std::this_thread::sleep_for(std::chrono::milliseconds(10));
EXPECT_CALL(*runnable2, dtorCalled()).Times(1);
singleThreadedIOService->stop();
}
TEST(DelayedSchedulerTest, testAccuracyOfDelayedScheduler)
{
joynr::Semaphore semaphore;
auto singleThreadedIOService = std::make_shared<SingleThreadedIOService>();
singleThreadedIOService->start();
auto scheduler = std::make_shared<SimpleDelayedScheduler>(singleThreadedIOService);
auto runnable1 = std::make_shared<StrictMock<MockRunnable>>();
EXPECT_CALL(*scheduler, workAvailableCalled(std::dynamic_pointer_cast<Runnable>(runnable1)))
.Times(1);
EXPECT_CALL(*scheduler, workAvailableInTime()).Times(1).WillOnce(ReleaseSemaphore(&semaphore));
scheduler->schedule(runnable1, std::chrono::milliseconds(5));
EXPECT_TRUE(semaphore.waitFor(std::chrono::milliseconds(1000)));
scheduler->shutdown();
EXPECT_CALL(*runnable1, dtorCalled()).Times(1);
singleThreadedIOService->stop();
}
TEST(DelayedSchedulerTest, avoidCallingDtorOfRunnablesAfterSchedulerHasExpired)
{
joynr::Semaphore semaphore;
auto singleThreadedIOService = std::make_shared<SingleThreadedIOService>();
singleThreadedIOService->start();
auto scheduler = std::make_shared<SimpleDelayedScheduler>(singleThreadedIOService);
auto runnable1 = std::make_shared<StrictMock<MockRunnable>>();
EXPECT_CALL(*scheduler, workAvailableCalled(std::dynamic_pointer_cast<Runnable>(runnable1)))
.Times(1)
.WillOnce(ReleaseSemaphore(&semaphore));
EXPECT_CALL(*runnable1, dtorCalled()).Times(1);
scheduler->schedule(runnable1, std::chrono::milliseconds(5));
EXPECT_TRUE(semaphore.waitFor(std::chrono::milliseconds(500)));
scheduler->shutdown();
singleThreadedIOService->stop();
}
TEST(DelayedSchedulerTest, scheduleAndUnscheduleRunnable_NoCallToRunnable)
{
auto singleThreadedIOService = std::make_shared<SingleThreadedIOService>();
singleThreadedIOService->start();
auto scheduler = std::make_shared<SimpleDelayedScheduler>(singleThreadedIOService);
auto runnable1 = std::make_shared<StrictMock<MockRunnable>>();
DelayedScheduler::RunnableHandle handle =
scheduler->schedule(runnable1, std::chrono::milliseconds(50));
EXPECT_CALL(*runnable1, dtorCalled()).Times(1);
EXPECT_CALL(*scheduler, workAvailableCalled(std::dynamic_pointer_cast<Runnable>(runnable1)))
.Times(0);
std::this_thread::sleep_for(std::chrono::milliseconds(1));
scheduler->unschedule(handle);
std::this_thread::sleep_for(std::chrono::milliseconds(100));
scheduler->shutdown();
singleThreadedIOService->stop();
}
TEST(DelayedSchedulerTest, scheduleAndUnscheduleRunnable_CallDtorOnUnschedule)
{
joynr::Semaphore semaphore;
auto singleThreadedIOService = std::make_shared<SingleThreadedIOService>();
singleThreadedIOService->start();
auto scheduler = std::make_shared<SimpleDelayedScheduler>(singleThreadedIOService);
auto runnable1 = std::make_shared<StrictMock<MockRunnable>>();
DelayedScheduler::RunnableHandle handle =
scheduler->schedule(runnable1, std::chrono::milliseconds(50));
std::this_thread::sleep_for(std::chrono::milliseconds(1));
EXPECT_CALL(*runnable1, dtorCalled()).Times(1).WillOnce(ReleaseSemaphore(&semaphore));
scheduler->unschedule(handle);
runnable1.reset();
EXPECT_TRUE(semaphore.waitFor(std::chrono::milliseconds(100)));
scheduler->shutdown();
singleThreadedIOService->stop();
}
|
/*
* #%L
* %%
* Copyright (C) 2011 - 2017 BMW Car IT GmbH
* %%
* Licensed 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.
* #L%
*/
#include <cassert>
#include <cstdint>
#include "tests/utils/Gtest.h"
#include "joynr/DelayedScheduler.h"
#include "joynr/Logger.h"
#include "joynr/Semaphore.h"
#include "joynr/SingleThreadedIOService.h"
#include "tests/JoynrTest.h"
#include "tests/mock/MockRunnable.h"
#include "tests/utils/TimeUtils.h"
using namespace joynr;
using namespace ::testing;
using ::testing::StrictMock;
// Expected accuracy of the timer in milliseconds
static const std::uint64_t timerAccuracy_ms = 15U;
class SimpleDelayedScheduler : public DelayedScheduler
{
public:
SimpleDelayedScheduler(std::shared_ptr<SingleThreadedIOService> singleThreadedIOService)
: DelayedScheduler(std::bind(&SimpleDelayedScheduler::workAvailable,
this,
std::placeholders::_1),
singleThreadedIOService->getIOService()),
est_ms(0)
{
}
~SimpleDelayedScheduler() = default;
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-local-typedefs"
MOCK_CONST_METHOD1(workAvailableCalled, void(std::shared_ptr<Runnable>));
MOCK_CONST_METHOD0(workAvailableInTime, void());
#pragma GCC diagnostic pop
DelayedScheduler::RunnableHandle schedule(std::shared_ptr<Runnable> runnable,
std::chrono::milliseconds delay)
{
RunnableHandle currentHandle = DelayedScheduler::schedule(runnable, delay);
est_ms =
TimeUtils::getCurrentMillisSinceEpoch() + static_cast<std::uint64_t>(delay.count());
return currentHandle;
}
void workAvailable(std::shared_ptr<Runnable> runnable)
{
const std::uint64_t now_ms = TimeUtils::getCurrentMillisSinceEpoch();
workAvailableCalled(runnable);
if (est_ms > 0) {
const std::uint64_t diff_ms = (now_ms > est_ms) ? now_ms - est_ms : est_ms - now_ms;
JOYNR_LOG_TRACE(logger(), "Runnable is available");
JOYNR_LOG_TRACE(logger(), " ETA : {}", est_ms);
JOYNR_LOG_TRACE(logger(), " current : {}", now_ms);
JOYNR_LOG_TRACE(logger(), " difference : {}", diff_ms);
if (diff_ms <= timerAccuracy_ms) {
workAvailableInTime();
}
} else {
JOYNR_LOG_TRACE(logger(), "No delay given but work available called.");
}
// if (runnable->isDeleteOnExit()) {
// delete runnable;
//}
}
private:
std::uint64_t est_ms;
};
TEST(DelayedSchedulerTest, startAndShutdownWithoutWork)
{
auto singleThreadedIOService = std::make_shared<SingleThreadedIOService>();
singleThreadedIOService->start();
auto scheduler = std::make_shared<SimpleDelayedScheduler>(singleThreadedIOService);
scheduler->shutdown();
singleThreadedIOService->stop();
}
TEST(DelayedSchedulerTest, startAndShutdownWithPendingWork_callDtorOfRunnablesCorrect)
{
auto singleThreadedIOService = std::make_shared<SingleThreadedIOService>();
singleThreadedIOService->start();
auto scheduler = std::make_shared<SimpleDelayedScheduler>(singleThreadedIOService);
// Dtor should be called
auto runnable1 = std::make_shared<StrictMock<MockRunnable>>();
EXPECT_CALL(*runnable1, dtorCalled()).Times(1);
scheduler->schedule(runnable1, std::chrono::milliseconds(100));
// Dtor called after scheduler was cleaned
auto runnable2 = std::make_shared<StrictMock<MockRunnable>>();
EXPECT_CALL(*runnable2, dtorCalled()).Times(1);
scheduler->schedule(runnable2, std::chrono::milliseconds(100));
std::this_thread::sleep_for(std::chrono::milliseconds(10));
scheduler->shutdown();
std::this_thread::sleep_for(std::chrono::milliseconds(10));
singleThreadedIOService->stop();
}
TEST(DelayedSchedulerTest, testAccuracyOfDelayedScheduler)
{
std::shared_ptr<joynr::Semaphore> semaphore = std::make_shared<Semaphore>();
auto singleThreadedIOService = std::make_shared<SingleThreadedIOService>();
singleThreadedIOService->start();
auto runnable1 = std::make_shared<StrictMock<MockRunnable>>();
EXPECT_CALL(*runnable1, dtorCalled()).Times(1);
auto scheduler = std::make_shared<SimpleDelayedScheduler>(singleThreadedIOService);
EXPECT_CALL(*scheduler, workAvailableCalled(std::dynamic_pointer_cast<Runnable>(runnable1)))
.Times(1);
EXPECT_CALL(*scheduler, workAvailableInTime()).Times(1).WillOnce(ReleaseSemaphore(semaphore));
scheduler->schedule(runnable1, std::chrono::milliseconds(5));
EXPECT_TRUE(semaphore->waitFor(std::chrono::milliseconds(1000)));
scheduler->shutdown();
singleThreadedIOService->stop();
}
TEST(DelayedSchedulerTest, avoidCallingDtorOfRunnablesAfterSchedulerHasExpired)
{
std::shared_ptr<joynr::Semaphore> semaphore = std::make_shared<Semaphore>();
auto singleThreadedIOService = std::make_shared<SingleThreadedIOService>();
singleThreadedIOService->start();
auto runnable1 = std::make_shared<StrictMock<MockRunnable>>();
EXPECT_CALL(*runnable1, dtorCalled()).Times(1);
auto scheduler = std::make_shared<SimpleDelayedScheduler>(singleThreadedIOService);
EXPECT_CALL(*scheduler, workAvailableCalled(std::dynamic_pointer_cast<Runnable>(runnable1)))
.Times(1)
.WillOnce(ReleaseSemaphore(semaphore));
scheduler->schedule(runnable1, std::chrono::milliseconds(5));
EXPECT_TRUE(semaphore->waitFor(std::chrono::milliseconds(500)));
scheduler->shutdown();
singleThreadedIOService->stop();
}
TEST(DelayedSchedulerTest, scheduleAndUnscheduleRunnable_NoCallToRunnable)
{
auto singleThreadedIOService = std::make_shared<SingleThreadedIOService>();
singleThreadedIOService->start();
auto runnable1 = std::make_shared<StrictMock<MockRunnable>>();
EXPECT_CALL(*runnable1, dtorCalled()).Times(1);
auto scheduler = std::make_shared<SimpleDelayedScheduler>(singleThreadedIOService);
EXPECT_CALL(*scheduler, workAvailableCalled(std::dynamic_pointer_cast<Runnable>(runnable1)))
.Times(0);
DelayedScheduler::RunnableHandle handle =
scheduler->schedule(runnable1, std::chrono::milliseconds(50));
std::this_thread::sleep_for(std::chrono::milliseconds(1));
scheduler->unschedule(handle);
std::this_thread::sleep_for(std::chrono::milliseconds(100));
scheduler->shutdown();
singleThreadedIOService->stop();
}
TEST(DelayedSchedulerTest, scheduleAndUnscheduleRunnable_CallDtorOnUnschedule)
{
std::shared_ptr<joynr::Semaphore> semaphore = std::make_shared<Semaphore>();
auto singleThreadedIOService = std::make_shared<SingleThreadedIOService>();
singleThreadedIOService->start();
auto runnable1 = std::make_shared<StrictMock<MockRunnable>>();
EXPECT_CALL(*runnable1, dtorCalled()).Times(1).WillOnce(ReleaseSemaphore(semaphore));
auto scheduler = std::make_shared<SimpleDelayedScheduler>(singleThreadedIOService);
DelayedScheduler::RunnableHandle handle =
scheduler->schedule(runnable1, std::chrono::milliseconds(50));
std::this_thread::sleep_for(std::chrono::milliseconds(1));
scheduler->unschedule(handle);
runnable1.reset();
EXPECT_TRUE(semaphore->waitFor(std::chrono::milliseconds(100)));
scheduler->shutdown();
singleThreadedIOService->stop();
}
|
Fix DelayedSchedulerTest
|
[C++] Fix DelayedSchedulerTest
Use shared_ptr for Semaphore instead of object
Refactor code so EXPECT_CALLS are used before any call for the tested object
|
C++
|
apache-2.0
|
bmwcarit/joynr,bmwcarit/joynr,bmwcarit/joynr,bmwcarit/joynr,bmwcarit/joynr,bmwcarit/joynr,bmwcarit/joynr,bmwcarit/joynr,bmwcarit/joynr
|
7f638b419e63da17ea7c0880c158f8e8fce06719
|
src/cpu/architecture/architecture_windows.cpp
|
src/cpu/architecture/architecture_windows.cpp
|
// infoware - C++ System information Library
//
// Written in 2016-2020 by nabijaczleweli <[email protected]> and ThePhD <[email protected]>
//
// To the extent possible under law, the author(s) have dedicated all copyright and related
// and neighboring rights to this software to the public domain worldwide. This software is
// distributed without any warranty.
//
// You should have received a copy of the CC0 Public Domain Dedication along with this software.
// If not, see <http://creativecommons.org/publicdomain/zero/1.0/>
#ifdef _WIN32
#include "infoware/cpu.hpp"
#define WIN32_LEAN_AND_MEAN
#include <windows.h>
// https://msdn.microsoft.com/en-us/library/windows/desktop/ms724958(v=vs.85).aspx
iware::cpu::architecture_t iware::cpu::architecture() noexcept {
SYSTEM_INFO sysinfo;
GetSystemInfo(&sysinfo);
switch(sysinfo.wProcessorArchitecture) {
case PROCESSOR_ARCHITECTURE_AMD64:
return iware::cpu::architecture_t::x64;
case PROCESSOR_ARCHITECTURE_ARM:
return iware::cpu::architecture_t::arm;
case PROCESSOR_ARCHITECTURE_IA64:
return iware::cpu::architecture_t::itanium;
case PROCESSOR_ARCHITECTURE_INTEL:
return iware::cpu::architecture_t::x86;
default:
return iware::cpu::architecture_t::unknown;
}
}
#endif
|
// infoware - C++ System information Library
//
// Written in 2016-2020 by nabijaczleweli <[email protected]> and ThePhD <[email protected]>
//
// To the extent possible under law, the author(s) have dedicated all copyright and related
// and neighboring rights to this software to the public domain worldwide. This software is
// distributed without any warranty.
//
// You should have received a copy of the CC0 Public Domain Dedication along with this software.
// If not, see <http://creativecommons.org/publicdomain/zero/1.0/>
#ifdef _WIN32
#include "infoware/cpu.hpp"
#define WIN32_LEAN_AND_MEAN
#include <windows.h>
// https://msdn.microsoft.com/en-us/library/windows/desktop/ms724958(v=vs.85).aspx
iware::cpu::architecture_t iware::cpu::architecture() noexcept {
SYSTEM_INFO sysinfo;
GetNativeSystemInfo(&sysinfo);
switch(sysinfo.wProcessorArchitecture) {
case PROCESSOR_ARCHITECTURE_AMD64:
return iware::cpu::architecture_t::x64;
case PROCESSOR_ARCHITECTURE_ARM:
return iware::cpu::architecture_t::arm;
case PROCESSOR_ARCHITECTURE_IA64:
return iware::cpu::architecture_t::itanium;
case PROCESSOR_ARCHITECTURE_INTEL:
return iware::cpu::architecture_t::x86;
default:
return iware::cpu::architecture_t::unknown;
}
}
#endif
|
Use GetNativeSystemInfo instead of GetSystemInfo in iware::cpu::architecture()
|
Use GetNativeSystemInfo instead of GetSystemInfo in iware::cpu::architecture()
In 64-bit Windows, the OS runs x86 applications in emulation mode(aka WOW64). GetSystemInfo
returns its emulated information; therefore iware::cpu::architecture() says the architecture
is x86, although OS is 64-bit.
This commit fixes the issue by calling GetNativeSystemInfo.
|
C++
|
cc0-1.0
|
ThePhD/infoware
|
1a4051269d05a510e1c2fac176e6a41b37f8e03c
|
tools/RegressionTest/Test.cpp
|
tools/RegressionTest/Test.cpp
|
///////////////////////////////////////////////////////////////////////////////
// Unit Test for Loki
//
// Copyright Terje Sletteb and Pavel Vozenilek 2002.
//
// Permission to use, copy, modify, and distribute this software for any
// purpose is hereby granted without fee, provided that this copyright and
// permissions notice appear in all copies and derivatives.
//
// This software is provided "as is" without express or implied warranty.
//
// Last update: October 12, 2002
///////////////////////////////////////////////////////////////////////////////
#ifdef __INTEL_COMPILER
# pragma warning(disable: 111 193 304 383 444 488 981 1418)
#elif defined(_MSC_VER) && !defined(__MWERKS__)
# pragma warning(disable: 4018 4097 4100 4213 4290 4512 4514 4700 4702 4710 4786 4800)
#endif
#if defined(_MSC_VER) || defined(__MINGW32__)
#include <Windows.h> // for threads, part of the sdk, disable if not found
#endif
// Some platforms might have difficulty with this
// Need to ifdef around those cases.
// TODO SGB
#include "UnitTest.h"
// static variable defintion, do not remove
Test::tests_type Test::tests;
// Merely comment out any of the following headers to
// prevent thier execution during the test.
//
// A pluggable-factory-like method is used to
// auto-register the test, so all that is needed
// is the header inclusion to execute the correspond
// unit test.
#include "TypelistTest.h"
#include "TypeManipTest.h"
#include "TypeTraitsTest.h"
#include "SmallObjectTest.h"
#include "SingletonTest.h"
#include "SmartPtrTest.h"
#include "FactoryTest.h"
#include "AbstractFactoryTest.h"
#include "AssocVectorTest.h"
#include "FunctorTest.h"
#include "DataGeneratorsTest.h"
/*
* AP - All Pass
* FC - Fails to Compile
* ? - Unknown/Not Tested/Not Recorded
*
* TypelistTest TypeManipTest TypeTraitsTest SmallObjectTest SingletonTest
* gcc 2.95.3 ? ? ? ? ?
* gcc 3.2 AP AP AP AP P (Only SingleThreaded)
* MSVC 6.0 P AP FC FC AP
* MSVC 7.0 AP Conversion FC AP P (Only SingleThreaded) ?
* Intel 5.0 AP AP AP FC FC
* Intel 6.0 AP AP AP FC P (Only SingleThreaded)
* Intel 7.0 AP AP AP FC P (Only SingleThreaded)
* BCC 5.5 ? ? ? ? ?
* BCC 5.6 ? ? ? ? ?
* CW 6.0 ? ? ? ? ?
*
* SmartPtrTest FactoryTest AbstractFactoryTest AssocVectorTest FunctorTest
* gcc 2.95.3 ? ? ? ? ?
* gcc 3.2 AP AP AP AP AP
* MSVC 6.0 FC AP FC FC FC
* MSVC 7.0 FC AP AP FC AP
* Intel 5.0 FC FC FC FC FC
* Intel 6.0 FC AP AP FC FC
* Intel 7.0 FC AP AP FC FC
* BCC 5.5 ? ? ? ? ?
* CW 6.0 ? ? ? ? ?
*
* DataGeneratorsTest
* gcc 2.95.3 ?
* gcc 3.2 AP
* MSVC 6.0 FC
* MSVC 7.0 AP
* Intel 5.0 FC
* Intel 6.0 AP
* Intel 7.0 AP
* BCC 5.5 ?
* BCC 5.6 ?
* CW 6.0 ?
*/
int main()
{
int result = Test::run("Loki Unit Test");
#if defined(__BORLANDC__) || defined(__GNUC__) || defined(_MSC_VER)
system("pause"); // Stop console window from closing if run from IDE.
#endif
return result;
}
|
///////////////////////////////////////////////////////////////////////////////
// Unit Test for Loki
//
// Copyright Terje Sletteb and Pavel Vozenilek 2002.
//
// Permission to use, copy, modify, and distribute this software for any
// purpose is hereby granted without fee, provided that this copyright and
// permissions notice appear in all copies and derivatives.
//
// This software is provided "as is" without express or implied warranty.
//
// Last update: October 12, 2002
///////////////////////////////////////////////////////////////////////////////
#ifdef __INTEL_COMPILER
# pragma warning(disable: 111 193 304 383 444 488 981 1418)
#elif defined(_MSC_VER) && !defined(__MWERKS__)
# pragma warning(disable: 4018 4097 4100 4213 4290 4512 4514 4700 4702 4710 4786 4800)
#endif
//#define DEFAULT_THREADING ::Loki::ObjectLevelLockable
//#define DEFAULT_THREADING ::Loki::ClassLevelLockable
#if defined(_MSC_VER) || defined(__MINGW32__)
#include <Windows.h> // for threads, part of the sdk, disable if not found
#endif
// Some platforms might have difficulty with this
// Need to ifdef around those cases.
// TODO SGB
#include "UnitTest.h"
// static variable defintion, do not remove
Test::tests_type Test::tests;
// Merely comment out any of the following headers to
// prevent thier execution during the test.
//
// A pluggable-factory-like method is used to
// auto-register the test, so all that is needed
// is the header inclusion to execute the correspond
// unit test.
#include "TypelistTest.h"
#include "TypeManipTest.h"
#include "TypeTraitsTest.h"
#include "SmallObjectTest.h"
#include "SingletonTest.h"
#include "SmartPtrTest.h"
#include "FactoryTest.h"
//#include "FactoryParmTest.h"
#include "AbstractFactoryTest.h"
#include "AssocVectorTest.h"
#include "FunctorTest.h"
#include "DataGeneratorsTest.h"
/* */
/*
* AP - All Pass
* FC - Fails to Compile
* ? - Unknown/Not Tested/Not Recorded
*
* TypelistTest TypeManipTest TypeTraitsTest SmallObjectTest SingletonTest
* gcc 2.95.3 ? ? ? ? ?
* gcc 3.2 AP AP AP AP P (Only SingleThreaded)
* MSVC 6.0 P AP FC FC AP
* MSVC 7.0 AP Conversion FC AP P (Only SingleThreaded) ?
* Intel 5.0 AP AP AP FC FC
* Intel 6.0 AP AP AP FC P (Only SingleThreaded)
* Intel 7.0 AP AP AP FC P (Only SingleThreaded)
* BCC 5.5 ? ? ? ? ?
* BCC 5.6 ? ? ? ? ?
* CW 6.0 ? ? ? ? ?
*
* SmartPtrTest FactoryTest AbstractFactoryTest AssocVectorTest FunctorTest
* gcc 2.95.3 ? ? ? ? ?
* gcc 3.2 AP AP AP AP AP
* MSVC 6.0 FC AP FC FC FC
* MSVC 7.0 FC AP AP FC AP
* Intel 5.0 FC FC FC FC FC
* Intel 6.0 FC AP AP FC FC
* Intel 7.0 FC AP AP FC FC
* BCC 5.5 ? ? ? ? ?
* CW 6.0 ? ? ? ? ?
*
* DataGeneratorsTest
* gcc 2.95.3 ?
* gcc 3.2 AP
* MSVC 6.0 FC
* MSVC 7.0 AP
* Intel 5.0 FC
* Intel 6.0 AP
* Intel 7.0 AP
* BCC 5.5 ?
* BCC 5.6 ?
* CW 6.0 ?
*/
int main()
{
int result = Test::run("Loki Unit Test");
#if defined(__BORLANDC__) || defined(__GNUC__) || defined(_MSC_VER)
system("pause"); // Stop console window from closing if run from IDE.
#endif
return result;
}
|
add some thread stuff
|
add some thread stuff
git-svn-id: 2bceadd671bcc8d4f7a34159d1bc3b98592acb3b@176 7ec92016-0320-0410-acc4-a06ded1c099a
|
C++
|
mit
|
Streamlet/ZLibWrap,Streamlet/ZLibWrap,Streamlet/ZLibWrap,Streamlet/ZLibWrap,Streamlet/ZLibWrap
|
fcf2e92552b48172108abbb3a030bda8ccfe047c
|
tools/bench_pictures_main.cpp
|
tools/bench_pictures_main.cpp
|
/*
* Copyright 2012 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "BenchTimer.h"
#include "PictureBenchmark.h"
#include "SkBenchLogger.h"
#include "SkCanvas.h"
#include "SkGraphics.h"
#include "SkMath.h"
#include "SkOSFile.h"
#include "SkPicture.h"
#include "SkStream.h"
#include "SkTArray.h"
#include "picture_utils.h"
const int DEFAULT_REPEATS = 100;
static void usage(const char* argv0) {
SkDebugf("SkPicture benchmarking tool\n");
SkDebugf("\n"
"Usage: \n"
" %s <inputDir>...\n"
" [--logFile filename][--timers [wcgWC]*][--logPerIter 1|0][--min]\n"
" [--repeat] \n"
" [--mode pow2tile minWidth height[] (multi) | record | simple\n"
" | tile width[] height[] (multi) | playbackCreation]\n"
" [--pipe]\n"
" [--device bitmap"
#if SK_SUPPORT_GPU
" | gpu"
#endif
"]"
, argv0);
SkDebugf("\n\n");
SkDebugf(
" inputDir: A list of directories and files to use as input. Files are\n"
" expected to have the .skp extension.\n\n"
" --logFile filename : destination for writing log output, in addition to stdout.\n");
SkDebugf(" --logPerIter 1|0 : "
"Log each repeat timer instead of mean, default is disabled.\n");
SkDebugf(" --min : Print the minimum times (instead of average).\n");
SkDebugf(" --timers [wcgWC]* : "
"Display wall, cpu, gpu, truncated wall or truncated cpu time for each picture.\n");
SkDebugf(
" --mode pow2tile minWidht height[] (multi) | record | simple\n"
" | tile width[] height[] (multi) | playbackCreation:\n"
" Run in the corresponding mode.\n"
" Default is simple.\n");
SkDebugf(
" pow2tile minWidth height[], Creates tiles with widths\n"
" that are all a power of two\n"
" such that they minimize the\n"
" amount of wasted tile space.\n"
" minWidth is the minimum width\n"
" of these tiles and must be a\n"
" power of two. Simple\n"
" rendering using these tiles\n"
" is benchmarked.\n"
" Append \"multi\" for multithreaded\n"
" drawing.\n");
SkDebugf(
" record, Benchmark picture to picture recording.\n");
SkDebugf(
" simple, Benchmark a simple rendering.\n");
SkDebugf(
" tile width[] height[], Benchmark simple rendering using\n"
" tiles with the given dimensions.\n"
" Append \"multi\" for multithreaded\n"
" drawing.\n");
SkDebugf(
" playbackCreation, Benchmark creation of the SkPicturePlayback.\n");
SkDebugf("\n");
SkDebugf(
" --pipe: Benchmark SkGPipe rendering. Compatible with tiled, multithreaded rendering.\n");
SkDebugf(
" --device bitmap"
#if SK_SUPPORT_GPU
" | gpu"
#endif
": Use the corresponding device. Default is bitmap.\n");
SkDebugf(
" bitmap, Render to a bitmap.\n");
#if SK_SUPPORT_GPU
SkDebugf(
" gpu, Render to the GPU.\n");
#endif
SkDebugf("\n");
SkDebugf(
" --repeat: "
"Set the number of times to repeat each test."
" Default is %i.\n", DEFAULT_REPEATS);
}
SkBenchLogger gLogger;
static bool run_single_benchmark(const SkString& inputPath,
sk_tools::PictureBenchmark& benchmark) {
SkFILEStream inputStream;
inputStream.setPath(inputPath.c_str());
if (!inputStream.isValid()) {
SkString err;
err.printf("Could not open file %s\n", inputPath.c_str());
gLogger.logError(err);
return false;
}
bool success = false;
SkPicture* picture = SkNEW_ARGS(SkPicture, (&inputStream, &success));
SkAutoTUnref<SkPicture> aur(picture);
if (!success) {
SkString err;
err.printf("Could not read an SkPicture from %s\n", inputPath.c_str());
gLogger.logError(err);
return false;
}
SkString filename;
sk_tools::get_basename(&filename, inputPath);
SkString result;
result.printf("running bench [%i %i] %s ", picture->width(),
picture->height(), filename.c_str());
gLogger.logProgress(result);
// rescale to avoid memory issues allocating a very large offscreen
sk_tools::resize_if_needed(&aur);
benchmark.run(aur);
return true;
}
static void parse_commandline(int argc, char* const argv[], SkTArray<SkString>* inputs,
sk_tools::PictureBenchmark* benchmark) {
const char* argv0 = argv[0];
char* const* stop = argv + argc;
int repeats = DEFAULT_REPEATS;
sk_tools::PictureRenderer::SkDeviceTypes deviceType =
sk_tools::PictureRenderer::kBitmap_DeviceType;
sk_tools::PictureRenderer* renderer = NULL;
// Create a string to show our current settings.
// TODO: Make it prettier. Currently it just repeats the command line.
SkString commandLine("bench_pictures:");
for (int i = 1; i < argc; i++) {
commandLine.appendf(" %s", *(argv+i));
}
commandLine.append("\n");
bool usePipe = false;
bool multiThreaded = false;
bool useTiles = false;
const char* widthString = NULL;
const char* heightString = NULL;
bool isPowerOf2Mode = false;
const char* mode = NULL;
for (++argv; argv < stop; ++argv) {
if (0 == strcmp(*argv, "--repeat")) {
++argv;
if (argv < stop) {
repeats = atoi(*argv);
if (repeats < 1) {
gLogger.logError("--repeat must be given a value > 0\n");
exit(-1);
}
} else {
gLogger.logError("Missing arg for --repeat\n");
usage(argv0);
exit(-1);
}
} else if (0 == strcmp(*argv, "--pipe")) {
usePipe = true;
} else if (0 == strcmp(*argv, "--logFile")) {
argv++;
if (argv < stop) {
if (!gLogger.SetLogFile(*argv)) {
SkString str;
str.printf("Could not open %s for writing.", *argv);
gLogger.logError(str);
usage(argv0);
// TODO(borenet): We're disabling this for now, due to
// write-protected Android devices. The very short-term
// solution is to ignore the fact that we have no log file.
//exit(-1);
}
} else {
gLogger.logError("Missing arg for --logFile\n");
usage(argv0);
exit(-1);
}
} else if (0 == strcmp(*argv, "--mode")) {
++argv;
if (argv >= stop) {
gLogger.logError("Missing mode for --mode\n");
usage(argv0);
exit(-1);
}
if (0 == strcmp(*argv, "record")) {
renderer = SkNEW(sk_tools::RecordPictureRenderer);
} else if (0 == strcmp(*argv, "simple")) {
renderer = SkNEW(sk_tools::SimplePictureRenderer);
} else if ((0 == strcmp(*argv, "tile")) || (0 == strcmp(*argv, "pow2tile"))) {
useTiles = true;
mode = *argv;
if (0 == strcmp(*argv, "pow2tile")) {
isPowerOf2Mode = true;
}
++argv;
if (argv >= stop) {
SkString err;
err.printf("Missing width for --mode %s\n", mode);
gLogger.logError(err);
usage(argv0);
exit(-1);
}
widthString = *argv;
++argv;
if (argv >= stop) {
gLogger.logError("Missing height for --mode tile\n");
usage(argv0);
exit(-1);
}
heightString = *argv;
++argv;
if (argv < stop && 0 == strcmp(*argv, "multi")) {
multiThreaded = true;
} else {
--argv;
}
} else if (0 == strcmp(*argv, "playbackCreation")) {
renderer = SkNEW(sk_tools::PlaybackCreationRenderer);
} else {
SkString err;
err.printf("%s is not a valid mode for --mode\n", *argv);
gLogger.logError(err);
usage(argv0);
exit(-1);
}
} else if (0 == strcmp(*argv, "--device")) {
++argv;
if (argv >= stop) {
gLogger.logError("Missing mode for --device\n");
usage(argv0);
exit(-1);
}
if (0 == strcmp(*argv, "bitmap")) {
deviceType = sk_tools::PictureRenderer::kBitmap_DeviceType;
}
#if SK_SUPPORT_GPU
else if (0 == strcmp(*argv, "gpu")) {
deviceType = sk_tools::PictureRenderer::kGPU_DeviceType;
}
#endif
else {
SkString err;
err.printf("%s is not a valid mode for --device\n", *argv);
gLogger.logError(err);
usage(argv0);
exit(-1);
}
} else if (0 == strcmp(*argv, "--timers")) {
++argv;
if (argv < stop) {
bool timerWall = false;
bool truncatedTimerWall = false;
bool timerCpu = false;
bool truncatedTimerCpu = false;
bool timerGpu = false;
for (char* t = *argv; *t; ++t) {
switch (*t) {
case 'w':
timerWall = true;
break;
case 'c':
timerCpu = true;
break;
case 'W':
truncatedTimerWall = true;
break;
case 'C':
truncatedTimerCpu = true;
break;
case 'g':
timerGpu = true;
break;
default: {
break;
}
}
}
benchmark->setTimersToShow(timerWall, truncatedTimerWall, timerCpu,
truncatedTimerCpu, timerGpu);
} else {
gLogger.logError("Missing arg for --timers\n");
usage(argv0);
exit(-1);
}
} else if (0 == strcmp(*argv, "--min")) {
benchmark->setPrintMin(true);
} else if (0 == strcmp(*argv, "--logPerIter")) {
++argv;
if (argv < stop) {
bool log = atoi(*argv) != 0;
benchmark->setLogPerIter(log);
} else {
gLogger.logError("Missing arg for --logPerIter\n");
usage(argv0);
exit(-1);
}
} else if (0 == strcmp(*argv, "--help") || 0 == strcmp(*argv, "-h")) {
usage(argv0);
exit(0);
} else {
inputs->push_back(SkString(*argv));
}
}
if (useTiles) {
SkASSERT(NULL == renderer);
sk_tools::TiledPictureRenderer* tiledRenderer = SkNEW(sk_tools::TiledPictureRenderer);
if (isPowerOf2Mode) {
int minWidth = atoi(widthString);
if (!SkIsPow2(minWidth) || minWidth < 0) {
tiledRenderer->unref();
SkString err;
err.printf("-mode %s must be given a width"
" value that is a power of two\n", mode);
gLogger.logError(err);
exit(-1);
}
tiledRenderer->setTileMinPowerOf2Width(minWidth);
} else if (sk_tools::is_percentage(widthString)) {
tiledRenderer->setTileWidthPercentage(atof(widthString));
if (!(tiledRenderer->getTileWidthPercentage() > 0)) {
tiledRenderer->unref();
gLogger.logError("--mode tile must be given a width percentage > 0\n");
exit(-1);
}
} else {
tiledRenderer->setTileWidth(atoi(widthString));
if (!(tiledRenderer->getTileWidth() > 0)) {
tiledRenderer->unref();
gLogger.logError("--mode tile must be given a width > 0\n");
exit(-1);
}
}
if (sk_tools::is_percentage(heightString)) {
tiledRenderer->setTileHeightPercentage(atof(heightString));
if (!(tiledRenderer->getTileHeightPercentage() > 0)) {
tiledRenderer->unref();
gLogger.logError("--mode tile must be given a height percentage > 0\n");
exit(-1);
}
} else {
tiledRenderer->setTileHeight(atoi(heightString));
if (!(tiledRenderer->getTileHeight() > 0)) {
tiledRenderer->unref();
gLogger.logError("--mode tile must be given a height > 0\n");
exit(-1);
}
}
tiledRenderer->setMultiThreaded(multiThreaded);
tiledRenderer->setUsePipe(usePipe);
renderer = tiledRenderer;
} else if (usePipe) {
renderer = SkNEW(sk_tools::PipePictureRenderer);
}
if (inputs->count() < 1) {
SkDELETE(benchmark);
usage(argv0);
exit(-1);
}
if (NULL == renderer) {
renderer = SkNEW(sk_tools::SimplePictureRenderer);
}
benchmark->setRenderer(renderer)->unref();
benchmark->setRepeats(repeats);
benchmark->setDeviceType(deviceType);
benchmark->setLogger(&gLogger);
// Report current settings:
gLogger.logProgress(commandLine);
}
static int process_input(const SkString& input,
sk_tools::PictureBenchmark& benchmark) {
SkOSFile::Iter iter(input.c_str(), "skp");
SkString inputFilename;
int failures = 0;
if (iter.next(&inputFilename)) {
do {
SkString inputPath;
sk_tools::make_filepath(&inputPath, input, inputFilename);
if (!run_single_benchmark(inputPath, benchmark))
++failures;
} while(iter.next(&inputFilename));
} else {
if (!run_single_benchmark(input, benchmark))
++failures;
}
return failures;
}
int main(int argc, char* const argv[]) {
#ifdef SK_ENABLE_INST_COUNT
gPrintInstCount = true;
#endif
SkAutoGraphics ag;
SkTArray<SkString> inputs;
sk_tools::PictureBenchmark benchmark;
parse_commandline(argc, argv, &inputs, &benchmark);
int failures = 0;
for (int i = 0; i < inputs.count(); ++i) {
failures += process_input(inputs[i], benchmark);
}
if (failures != 0) {
SkString err;
err.printf("Failed to run %i benchmarks.\n", failures);
gLogger.logError(err);
return 1;
}
}
|
/*
* Copyright 2012 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "BenchTimer.h"
#include "PictureBenchmark.h"
#include "SkBenchLogger.h"
#include "SkCanvas.h"
#include "SkGraphics.h"
#include "SkMath.h"
#include "SkOSFile.h"
#include "SkPicture.h"
#include "SkStream.h"
#include "SkTArray.h"
#include "picture_utils.h"
const int DEFAULT_REPEATS = 1;
static void usage(const char* argv0) {
SkDebugf("SkPicture benchmarking tool\n");
SkDebugf("\n"
"Usage: \n"
" %s <inputDir>...\n"
" [--logFile filename][--timers [wcgWC]*][--logPerIter 1|0][--min]\n"
" [--repeat] \n"
" [--mode pow2tile minWidth height[] (multi) | record | simple\n"
" | tile width[] height[] (multi) | playbackCreation]\n"
" [--pipe]\n"
" [--device bitmap"
#if SK_SUPPORT_GPU
" | gpu"
#endif
"]"
, argv0);
SkDebugf("\n\n");
SkDebugf(
" inputDir: A list of directories and files to use as input. Files are\n"
" expected to have the .skp extension.\n\n"
" --logFile filename : destination for writing log output, in addition to stdout.\n");
SkDebugf(" --logPerIter 1|0 : "
"Log each repeat timer instead of mean, default is disabled.\n");
SkDebugf(" --min : Print the minimum times (instead of average).\n");
SkDebugf(" --timers [wcgWC]* : "
"Display wall, cpu, gpu, truncated wall or truncated cpu time for each picture.\n");
SkDebugf(
" --mode pow2tile minWidht height[] (multi) | record | simple\n"
" | tile width[] height[] (multi) | playbackCreation:\n"
" Run in the corresponding mode.\n"
" Default is simple.\n");
SkDebugf(
" pow2tile minWidth height[], Creates tiles with widths\n"
" that are all a power of two\n"
" such that they minimize the\n"
" amount of wasted tile space.\n"
" minWidth is the minimum width\n"
" of these tiles and must be a\n"
" power of two. Simple\n"
" rendering using these tiles\n"
" is benchmarked.\n"
" Append \"multi\" for multithreaded\n"
" drawing.\n");
SkDebugf(
" record, Benchmark picture to picture recording.\n");
SkDebugf(
" simple, Benchmark a simple rendering.\n");
SkDebugf(
" tile width[] height[], Benchmark simple rendering using\n"
" tiles with the given dimensions.\n"
" Append \"multi\" for multithreaded\n"
" drawing.\n");
SkDebugf(
" playbackCreation, Benchmark creation of the SkPicturePlayback.\n");
SkDebugf("\n");
SkDebugf(
" --pipe: Benchmark SkGPipe rendering. Compatible with tiled, multithreaded rendering.\n");
SkDebugf(
" --device bitmap"
#if SK_SUPPORT_GPU
" | gpu"
#endif
": Use the corresponding device. Default is bitmap.\n");
SkDebugf(
" bitmap, Render to a bitmap.\n");
#if SK_SUPPORT_GPU
SkDebugf(
" gpu, Render to the GPU.\n");
#endif
SkDebugf("\n");
SkDebugf(
" --repeat: "
"Set the number of times to repeat each test."
" Default is %i.\n", DEFAULT_REPEATS);
}
SkBenchLogger gLogger;
static bool run_single_benchmark(const SkString& inputPath,
sk_tools::PictureBenchmark& benchmark) {
SkFILEStream inputStream;
inputStream.setPath(inputPath.c_str());
if (!inputStream.isValid()) {
SkString err;
err.printf("Could not open file %s\n", inputPath.c_str());
gLogger.logError(err);
return false;
}
bool success = false;
SkPicture* picture = SkNEW_ARGS(SkPicture, (&inputStream, &success));
SkAutoTUnref<SkPicture> aur(picture);
if (!success) {
SkString err;
err.printf("Could not read an SkPicture from %s\n", inputPath.c_str());
gLogger.logError(err);
return false;
}
SkString filename;
sk_tools::get_basename(&filename, inputPath);
SkString result;
result.printf("running bench [%i %i] %s ", picture->width(),
picture->height(), filename.c_str());
gLogger.logProgress(result);
// rescale to avoid memory issues allocating a very large offscreen
sk_tools::resize_if_needed(&aur);
benchmark.run(aur);
return true;
}
static void parse_commandline(int argc, char* const argv[], SkTArray<SkString>* inputs,
sk_tools::PictureBenchmark* benchmark) {
const char* argv0 = argv[0];
char* const* stop = argv + argc;
int repeats = DEFAULT_REPEATS;
sk_tools::PictureRenderer::SkDeviceTypes deviceType =
sk_tools::PictureRenderer::kBitmap_DeviceType;
sk_tools::PictureRenderer* renderer = NULL;
// Create a string to show our current settings.
// TODO: Make it prettier. Currently it just repeats the command line.
SkString commandLine("bench_pictures:");
for (int i = 1; i < argc; i++) {
commandLine.appendf(" %s", *(argv+i));
}
commandLine.append("\n");
bool usePipe = false;
bool multiThreaded = false;
bool useTiles = false;
const char* widthString = NULL;
const char* heightString = NULL;
bool isPowerOf2Mode = false;
const char* mode = NULL;
for (++argv; argv < stop; ++argv) {
if (0 == strcmp(*argv, "--repeat")) {
++argv;
if (argv < stop) {
repeats = atoi(*argv);
if (repeats < 1) {
gLogger.logError("--repeat must be given a value > 0\n");
exit(-1);
}
} else {
gLogger.logError("Missing arg for --repeat\n");
usage(argv0);
exit(-1);
}
} else if (0 == strcmp(*argv, "--pipe")) {
usePipe = true;
} else if (0 == strcmp(*argv, "--logFile")) {
argv++;
if (argv < stop) {
if (!gLogger.SetLogFile(*argv)) {
SkString str;
str.printf("Could not open %s for writing.", *argv);
gLogger.logError(str);
usage(argv0);
// TODO(borenet): We're disabling this for now, due to
// write-protected Android devices. The very short-term
// solution is to ignore the fact that we have no log file.
//exit(-1);
}
} else {
gLogger.logError("Missing arg for --logFile\n");
usage(argv0);
exit(-1);
}
} else if (0 == strcmp(*argv, "--mode")) {
++argv;
if (argv >= stop) {
gLogger.logError("Missing mode for --mode\n");
usage(argv0);
exit(-1);
}
if (0 == strcmp(*argv, "record")) {
renderer = SkNEW(sk_tools::RecordPictureRenderer);
} else if (0 == strcmp(*argv, "simple")) {
renderer = SkNEW(sk_tools::SimplePictureRenderer);
} else if ((0 == strcmp(*argv, "tile")) || (0 == strcmp(*argv, "pow2tile"))) {
useTiles = true;
mode = *argv;
if (0 == strcmp(*argv, "pow2tile")) {
isPowerOf2Mode = true;
}
++argv;
if (argv >= stop) {
SkString err;
err.printf("Missing width for --mode %s\n", mode);
gLogger.logError(err);
usage(argv0);
exit(-1);
}
widthString = *argv;
++argv;
if (argv >= stop) {
gLogger.logError("Missing height for --mode tile\n");
usage(argv0);
exit(-1);
}
heightString = *argv;
++argv;
if (argv < stop && 0 == strcmp(*argv, "multi")) {
multiThreaded = true;
} else {
--argv;
}
} else if (0 == strcmp(*argv, "playbackCreation")) {
renderer = SkNEW(sk_tools::PlaybackCreationRenderer);
} else {
SkString err;
err.printf("%s is not a valid mode for --mode\n", *argv);
gLogger.logError(err);
usage(argv0);
exit(-1);
}
} else if (0 == strcmp(*argv, "--device")) {
++argv;
if (argv >= stop) {
gLogger.logError("Missing mode for --device\n");
usage(argv0);
exit(-1);
}
if (0 == strcmp(*argv, "bitmap")) {
deviceType = sk_tools::PictureRenderer::kBitmap_DeviceType;
}
#if SK_SUPPORT_GPU
else if (0 == strcmp(*argv, "gpu")) {
deviceType = sk_tools::PictureRenderer::kGPU_DeviceType;
}
#endif
else {
SkString err;
err.printf("%s is not a valid mode for --device\n", *argv);
gLogger.logError(err);
usage(argv0);
exit(-1);
}
} else if (0 == strcmp(*argv, "--timers")) {
++argv;
if (argv < stop) {
bool timerWall = false;
bool truncatedTimerWall = false;
bool timerCpu = false;
bool truncatedTimerCpu = false;
bool timerGpu = false;
for (char* t = *argv; *t; ++t) {
switch (*t) {
case 'w':
timerWall = true;
break;
case 'c':
timerCpu = true;
break;
case 'W':
truncatedTimerWall = true;
break;
case 'C':
truncatedTimerCpu = true;
break;
case 'g':
timerGpu = true;
break;
default: {
break;
}
}
}
benchmark->setTimersToShow(timerWall, truncatedTimerWall, timerCpu,
truncatedTimerCpu, timerGpu);
} else {
gLogger.logError("Missing arg for --timers\n");
usage(argv0);
exit(-1);
}
} else if (0 == strcmp(*argv, "--min")) {
benchmark->setPrintMin(true);
} else if (0 == strcmp(*argv, "--logPerIter")) {
++argv;
if (argv < stop) {
bool log = atoi(*argv) != 0;
benchmark->setLogPerIter(log);
} else {
gLogger.logError("Missing arg for --logPerIter\n");
usage(argv0);
exit(-1);
}
} else if (0 == strcmp(*argv, "--help") || 0 == strcmp(*argv, "-h")) {
usage(argv0);
exit(0);
} else {
inputs->push_back(SkString(*argv));
}
}
if (useTiles) {
SkASSERT(NULL == renderer);
sk_tools::TiledPictureRenderer* tiledRenderer = SkNEW(sk_tools::TiledPictureRenderer);
if (isPowerOf2Mode) {
int minWidth = atoi(widthString);
if (!SkIsPow2(minWidth) || minWidth < 0) {
tiledRenderer->unref();
SkString err;
err.printf("-mode %s must be given a width"
" value that is a power of two\n", mode);
gLogger.logError(err);
exit(-1);
}
tiledRenderer->setTileMinPowerOf2Width(minWidth);
} else if (sk_tools::is_percentage(widthString)) {
tiledRenderer->setTileWidthPercentage(atof(widthString));
if (!(tiledRenderer->getTileWidthPercentage() > 0)) {
tiledRenderer->unref();
gLogger.logError("--mode tile must be given a width percentage > 0\n");
exit(-1);
}
} else {
tiledRenderer->setTileWidth(atoi(widthString));
if (!(tiledRenderer->getTileWidth() > 0)) {
tiledRenderer->unref();
gLogger.logError("--mode tile must be given a width > 0\n");
exit(-1);
}
}
if (sk_tools::is_percentage(heightString)) {
tiledRenderer->setTileHeightPercentage(atof(heightString));
if (!(tiledRenderer->getTileHeightPercentage() > 0)) {
tiledRenderer->unref();
gLogger.logError("--mode tile must be given a height percentage > 0\n");
exit(-1);
}
} else {
tiledRenderer->setTileHeight(atoi(heightString));
if (!(tiledRenderer->getTileHeight() > 0)) {
tiledRenderer->unref();
gLogger.logError("--mode tile must be given a height > 0\n");
exit(-1);
}
}
tiledRenderer->setMultiThreaded(multiThreaded);
tiledRenderer->setUsePipe(usePipe);
renderer = tiledRenderer;
} else if (usePipe) {
renderer = SkNEW(sk_tools::PipePictureRenderer);
}
if (inputs->count() < 1) {
SkDELETE(benchmark);
usage(argv0);
exit(-1);
}
if (NULL == renderer) {
renderer = SkNEW(sk_tools::SimplePictureRenderer);
}
benchmark->setRenderer(renderer)->unref();
benchmark->setRepeats(repeats);
benchmark->setDeviceType(deviceType);
benchmark->setLogger(&gLogger);
// Report current settings:
gLogger.logProgress(commandLine);
}
static int process_input(const SkString& input,
sk_tools::PictureBenchmark& benchmark) {
SkOSFile::Iter iter(input.c_str(), "skp");
SkString inputFilename;
int failures = 0;
if (iter.next(&inputFilename)) {
do {
SkString inputPath;
sk_tools::make_filepath(&inputPath, input, inputFilename);
if (!run_single_benchmark(inputPath, benchmark))
++failures;
} while(iter.next(&inputFilename));
} else {
if (!run_single_benchmark(input, benchmark))
++failures;
}
return failures;
}
int main(int argc, char* const argv[]) {
#ifdef SK_ENABLE_INST_COUNT
gPrintInstCount = true;
#endif
SkAutoGraphics ag;
SkTArray<SkString> inputs;
sk_tools::PictureBenchmark benchmark;
parse_commandline(argc, argv, &inputs, &benchmark);
int failures = 0;
for (int i = 0; i < inputs.count(); ++i) {
failures += process_input(inputs[i], benchmark);
}
if (failures != 0) {
SkString err;
err.printf("Failed to run %i benchmarks.\n", failures);
gLogger.logError(err);
return 1;
}
}
|
Set DEFAULT_REPEATS to 1
|
Set DEFAULT_REPEATS to 1
bench defaults to 1 repeat, so bench_pictures should do the same.
This is causing the Android build cycles to be *hours* long.
Review URL: https://codereview.appspot.com/6490123
|
C++
|
bsd-3-clause
|
csulmone/skia,csulmone/skia,csulmone/skia,csulmone/skia
|
06daf30251e19b8a3b1bb7aeeff8199bfc49f87c
|
src/Dataflow/Serialization/Network/Tests/LegacyNetworkFileImporterTests.cc
|
src/Dataflow/Serialization/Network/Tests/LegacyNetworkFileImporterTests.cc
|
/*
For more information, please see: http://software.sci.utah.edu
The MIT License
Copyright (c) 2015 Scientific Computing and Imaging Institute,
University of Utah.
Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE.
*/
#include <Dataflow/Serialization/Network/Importer/NetworkIO.h>
#include <Dataflow/Serialization/Network/ModuleDescriptionSerialization.h>
#include <Dataflow/Serialization/Network/NetworkDescriptionSerialization.h>
#include <Dataflow/Serialization/Network/NetworkXMLSerializer.h>
#include <Modules/Factory/HardCodedModuleFactory.h>
#include <gtest/gtest.h>
#include <gmock/gmock.h>
#include <Dataflow/Network/Network.h>
#include <Dataflow/Network/ModuleInterface.h>
#include <Dataflow/Network/ModuleStateInterface.h>
#include <Dataflow/Network/ConnectionId.h>
#include <Dataflow/Network/Tests/MockNetwork.h>
#include <Core/Datatypes/DenseMatrix.h>
#include <Core/Datatypes/MatrixComparison.h>
#include <Core/Datatypes/MatrixIO.h>
#include <Modules/Basic/SendTestMatrix.h>
#include <Modules/Basic/ReceiveTestMatrix.h>
#include <Modules/Math/EvaluateLinearAlgebraUnary.h>
#include <Modules/Factory/HardCodedModuleFactory.h>
#include <Core/Algorithms/Math/EvaluateLinearAlgebraUnaryAlgo.h>
#include <Core/Algorithms/Math/EvaluateLinearAlgebraBinaryAlgo.h>
#include <Core/Algorithms/Math/ReportMatrixInfo.h>
#include <Dataflow/Network/Tests/MockModuleState.h>
#include <Dataflow/State/SimpleMapModuleState.h>
#include <Dataflow/Engine/Controller/NetworkEditorController.h>
#include <Dataflow/Serialization/Network/XMLSerializer.h>
#include <Dataflow/Engine/Scheduler/DesktopExecutionStrategyFactory.h>
#include <Core/Algorithms/Base/AlgorithmVariableNames.h>
#include <Testing/Utils/SCIRunUnitTests.h>
using namespace SCIRun;
using namespace SCIRun::Dataflow::Engine;
using namespace SCIRun::Modules::Basic;
using namespace SCIRun::Modules::Math;
using namespace SCIRun::Modules::Factory;
using namespace SCIRun::Core::Datatypes;
using namespace SCIRun::Dataflow::Networks;
using namespace SCIRun::Dataflow::Networks::Mocks;
using namespace SCIRun::Core::Algorithms::Math;
using namespace SCIRun::Dataflow::State;
using namespace SCIRun::Core::Algorithms;
using namespace SCIRun::TestUtils;
#include <stdexcept>
#include <fstream>
#include <boost/assign.hpp>
using namespace SCIRun::Dataflow::Networks;
using namespace boost::assign;
TEST(LegacyNetworkFileImporterTests, CanLoadEmptyNetworkFile)
{
auto dtdpath = TestResources::rootDir() / "Other";
LegacyNetworkIO lnio(dtdpath.string());;
auto v4file1 = TestResources::rootDir() / "Other" / "v4nets" / "empty.srn";
auto networkFile = lnio.load_net(v4file1.string());
ASSERT_TRUE(networkFile != nullptr);
EXPECT_EQ(0, networkFile->network.modules.size());
EXPECT_EQ(0, networkFile->network.connections.size());
EXPECT_EQ(0, networkFile->modulePositions.modulePositions.size());
EXPECT_EQ(0, networkFile->moduleNotes.notes.size());
EXPECT_EQ(0, networkFile->connectionNotes.notes.size());
EXPECT_EQ(0, networkFile->moduleTags.tags.size());
}
TEST(LegacyNetworkFileImporterTests, CanLoadNetworkFileWithSingleModuleNoState)
{
auto dtdpath = TestResources::rootDir() / "Other";
LegacyNetworkIO lnio(dtdpath.string());
auto v4file1 = TestResources::rootDir() / "Other" / "v4nets" / "oneModule.srn";
auto networkFile = lnio.load_net(v4file1.string());
ASSERT_TRUE(networkFile != nullptr);
EXPECT_EQ(1, networkFile->network.modules.size());
auto mod = *networkFile->network.modules.begin();
EXPECT_EQ("m1", mod.first); //TODO: ID conversion??
EXPECT_EQ("CreateLatVol", mod.second.module.module_name_);
EXPECT_EQ("NewField", mod.second.module.category_name_);
EXPECT_EQ("SCIRun", mod.second.module.package_name_);
EXPECT_EQ(0, networkFile->network.connections.size());
EXPECT_EQ(1, networkFile->modulePositions.modulePositions.size());
EXPECT_EQ(std::make_pair(289.0,151.0), networkFile->modulePositions.modulePositions.begin()->second);
EXPECT_EQ(0, networkFile->moduleNotes.notes.size());
EXPECT_EQ(0, networkFile->connectionNotes.notes.size());
EXPECT_EQ(0, networkFile->moduleTags.tags.size());
}
TEST(LegacyNetworkFileImporterTests, CanLoadNetworkFileWithSingleModuleWithState)
{
FAIL() << "todo";
}
TEST(LegacyNetworkFileImporterTests, CanLoadNetworkFileWithTwoModulesNoConnections)
{
auto dtdpath = TestResources::rootDir() / "Other";
LegacyNetworkIO lnio(dtdpath.string());
auto v4file1 = TestResources::rootDir() / "Other" / "v4nets" / "threeModulesNoConnections.srn";
auto networkFile = lnio.load_net(v4file1.string());
ASSERT_TRUE(networkFile != nullptr);
EXPECT_EQ(3, networkFile->network.modules.size());
auto modIter = networkFile->network.modules.begin();
EXPECT_EQ("m1", modIter->first); //TODO: ID conversion??
EXPECT_EQ("ComputeSVD", modIter->second.module.module_name_);
EXPECT_EQ("Math", modIter->second.module.category_name_);
EXPECT_EQ("SCIRun", modIter->second.module.package_name_);
++modIter;
EXPECT_EQ("m2", modIter->first); //TODO: ID conversion??
EXPECT_EQ("CreateLatVol", modIter->second.module.module_name_);
EXPECT_EQ("NewField", modIter->second.module.category_name_);
EXPECT_EQ("SCIRun", modIter->second.module.package_name_);
++modIter;
EXPECT_EQ("m3", modIter->first); //TODO: ID conversion??
EXPECT_EQ("ShowField", modIter->second.module.module_name_);
EXPECT_EQ("Visualization", modIter->second.module.category_name_);
EXPECT_EQ("SCIRun", modIter->second.module.package_name_);
EXPECT_EQ(0, networkFile->network.connections.size());
EXPECT_EQ(3, networkFile->modulePositions.modulePositions.size());
auto posIter = networkFile->modulePositions.modulePositions.begin();
EXPECT_EQ(std::make_pair(357.0,134.0), posIter->second); ++posIter;
EXPECT_EQ(std::make_pair(304.0,258.0), posIter->second); ++posIter;
EXPECT_EQ(std::make_pair(386.0,376.0), posIter->second);
EXPECT_EQ(0, networkFile->moduleNotes.notes.size());
EXPECT_EQ(0, networkFile->connectionNotes.notes.size());
EXPECT_EQ(0, networkFile->moduleTags.tags.size());
}
TEST(LegacyNetworkFileImporterTests, CanLoadNetworkFileWithTwoModulesOneConnection)
{
auto dtdpath = TestResources::rootDir() / "Other";
LegacyNetworkIO lnio(dtdpath.string());
auto v4file1 = TestResources::rootDir() / "Other" / "v4nets" / "twoModsOneConnection.srn";
auto networkFile = lnio.load_net(v4file1.string());
ASSERT_TRUE(networkFile != nullptr);
EXPECT_EQ(2, networkFile->network.modules.size());
auto modIter = networkFile->network.modules.begin();
EXPECT_EQ("m1", modIter->first); //TODO: ID conversion??
EXPECT_EQ("ComputeSVD", modIter->second.module.module_name_);
EXPECT_EQ("Math", modIter->second.module.category_name_);
EXPECT_EQ("SCIRun", modIter->second.module.package_name_);
++modIter;
EXPECT_EQ("m2", modIter->first); //TODO: ID conversion??
EXPECT_EQ("CreateLatVol", modIter->second.module.module_name_);
EXPECT_EQ("NewField", modIter->second.module.category_name_);
EXPECT_EQ("SCIRun", modIter->second.module.package_name_);
ASSERT_EQ(1, networkFile->network.connections.size());
auto conn = networkFile->network.connections[0];
std::cout << "CONN LOOKS LIKE " << static_cast<std::string>(ConnectionId::create(conn)) << std::endl;
EXPECT_EQ(2, networkFile->modulePositions.modulePositions.size());
EXPECT_EQ(0, networkFile->moduleNotes.notes.size());
EXPECT_EQ(0, networkFile->connectionNotes.notes.size());
EXPECT_EQ(0, networkFile->moduleTags.tags.size());
FAIL() << "todo";
}
TEST(LegacyNetworkFileImporterTests, CanLoadNetworkFileWithTwoModulesTwoConnections)
{
FAIL() << "todo";
}
TEST(LegacyNetworkFileImporterTests, CanLoadNetworkFileWithLotsOfObjects)
{
FAIL() << "todo";
}
TEST(LegacyNetworkFileImporterTests, CanLoadNetworkFileWithModuleNotes)
{
FAIL() << "todo";
}
TEST(LegacyNetworkFileImporterTests, CanLoadNetworkFileWithConnectionNotes)
{
FAIL() << "todo";
}
|
/*
For more information, please see: http://software.sci.utah.edu
The MIT License
Copyright (c) 2015 Scientific Computing and Imaging Institute,
University of Utah.
Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE.
*/
#include <Dataflow/Serialization/Network/Importer/NetworkIO.h>
#include <Dataflow/Serialization/Network/ModuleDescriptionSerialization.h>
#include <Dataflow/Serialization/Network/NetworkDescriptionSerialization.h>
#include <Dataflow/Serialization/Network/NetworkXMLSerializer.h>
#include <Modules/Factory/HardCodedModuleFactory.h>
#include <gtest/gtest.h>
#include <gmock/gmock.h>
#include <Dataflow/Network/Network.h>
#include <Dataflow/Network/ModuleInterface.h>
#include <Dataflow/Network/ModuleStateInterface.h>
#include <Dataflow/Network/ConnectionId.h>
#include <Dataflow/Network/Tests/MockNetwork.h>
#include <Core/Datatypes/DenseMatrix.h>
#include <Core/Datatypes/MatrixComparison.h>
#include <Core/Datatypes/MatrixIO.h>
#include <Modules/Basic/SendTestMatrix.h>
#include <Modules/Basic/ReceiveTestMatrix.h>
#include <Modules/Math/EvaluateLinearAlgebraUnary.h>
#include <Modules/Factory/HardCodedModuleFactory.h>
#include <Core/Algorithms/Math/EvaluateLinearAlgebraUnaryAlgo.h>
#include <Core/Algorithms/Math/EvaluateLinearAlgebraBinaryAlgo.h>
#include <Core/Algorithms/Math/ReportMatrixInfo.h>
#include <Dataflow/Network/Tests/MockModuleState.h>
#include <Dataflow/State/SimpleMapModuleState.h>
#include <Dataflow/Engine/Controller/NetworkEditorController.h>
#include <Dataflow/Serialization/Network/XMLSerializer.h>
#include <Dataflow/Engine/Scheduler/DesktopExecutionStrategyFactory.h>
#include <Core/Algorithms/Base/AlgorithmVariableNames.h>
#include <Testing/Utils/SCIRunUnitTests.h>
using namespace SCIRun;
using namespace SCIRun::Dataflow::Engine;
using namespace SCIRun::Modules::Basic;
using namespace SCIRun::Modules::Math;
using namespace SCIRun::Modules::Factory;
using namespace SCIRun::Core::Datatypes;
using namespace SCIRun::Dataflow::Networks;
using namespace SCIRun::Dataflow::Networks::Mocks;
using namespace SCIRun::Core::Algorithms::Math;
using namespace SCIRun::Dataflow::State;
using namespace SCIRun::Core::Algorithms;
using namespace SCIRun::TestUtils;
#include <stdexcept>
#include <fstream>
#include <boost/assign.hpp>
using namespace SCIRun::Dataflow::Networks;
using namespace boost::assign;
TEST(LegacyNetworkFileImporterTests, CanLoadEmptyNetworkFile)
{
auto dtdpath = TestResources::rootDir() / "Other";
LegacyNetworkIO lnio(dtdpath.string());;
auto v4file1 = TestResources::rootDir() / "Other" / "v4nets" / "empty.srn";
auto networkFile = lnio.load_net(v4file1.string());
ASSERT_TRUE(networkFile != nullptr);
EXPECT_EQ(0, networkFile->network.modules.size());
EXPECT_EQ(0, networkFile->network.connections.size());
EXPECT_EQ(0, networkFile->modulePositions.modulePositions.size());
EXPECT_EQ(0, networkFile->moduleNotes.notes.size());
EXPECT_EQ(0, networkFile->connectionNotes.notes.size());
EXPECT_EQ(0, networkFile->moduleTags.tags.size());
}
TEST(LegacyNetworkFileImporterTests, CanLoadNetworkFileWithSingleModuleNoState)
{
auto dtdpath = TestResources::rootDir() / "Other";
LegacyNetworkIO lnio(dtdpath.string());
auto v4file1 = TestResources::rootDir() / "Other" / "v4nets" / "oneModule.srn";
auto networkFile = lnio.load_net(v4file1.string());
ASSERT_TRUE(networkFile != nullptr);
EXPECT_EQ(1, networkFile->network.modules.size());
auto mod = *networkFile->network.modules.begin();
EXPECT_EQ("CreateLatVol:0", mod.first);
EXPECT_EQ("CreateLatVol", mod.second.module.module_name_);
EXPECT_EQ("NewField", mod.second.module.category_name_);
EXPECT_EQ("SCIRun", mod.second.module.package_name_);
EXPECT_EQ(0, networkFile->network.connections.size());
EXPECT_EQ(1, networkFile->modulePositions.modulePositions.size());
EXPECT_EQ(std::make_pair(289.0,151.0), networkFile->modulePositions.modulePositions.begin()->second);
EXPECT_EQ(0, networkFile->moduleNotes.notes.size());
EXPECT_EQ(0, networkFile->connectionNotes.notes.size());
EXPECT_EQ(0, networkFile->moduleTags.tags.size());
}
TEST(LegacyNetworkFileImporterTests, CanLoadNetworkFileWithSingleModuleWithState)
{
FAIL() << "todo";
}
TEST(LegacyNetworkFileImporterTests, CanLoadNetworkFileWithTwoModulesNoConnections)
{
auto dtdpath = TestResources::rootDir() / "Other";
LegacyNetworkIO lnio(dtdpath.string());
auto v4file1 = TestResources::rootDir() / "Other" / "v4nets" / "threeModulesNoConnections.srn";
auto networkFile = lnio.load_net(v4file1.string());
ASSERT_TRUE(networkFile != nullptr);
EXPECT_EQ(3, networkFile->network.modules.size());
auto modIter = networkFile->network.modules.begin();
EXPECT_EQ("ComputeSVD:0", modIter->first);
EXPECT_EQ("ComputeSVD", modIter->second.module.module_name_);
EXPECT_EQ("Math", modIter->second.module.category_name_);
EXPECT_EQ("SCIRun", modIter->second.module.package_name_);
++modIter;
EXPECT_EQ("CreateLatVol:0", modIter->first);
EXPECT_EQ("CreateLatVol", modIter->second.module.module_name_);
EXPECT_EQ("NewField", modIter->second.module.category_name_);
EXPECT_EQ("SCIRun", modIter->second.module.package_name_);
++modIter;
EXPECT_EQ("ShowField:0", modIter->first);
EXPECT_EQ("ShowField", modIter->second.module.module_name_);
EXPECT_EQ("Visualization", modIter->second.module.category_name_);
EXPECT_EQ("SCIRun", modIter->second.module.package_name_);
EXPECT_EQ(0, networkFile->network.connections.size());
EXPECT_EQ(3, networkFile->modulePositions.modulePositions.size());
auto posIter = networkFile->modulePositions.modulePositions.begin();
EXPECT_EQ(std::make_pair(357.0,134.0), posIter->second); ++posIter;
EXPECT_EQ(std::make_pair(304.0,258.0), posIter->second); ++posIter;
EXPECT_EQ(std::make_pair(386.0,376.0), posIter->second);
EXPECT_EQ(0, networkFile->moduleNotes.notes.size());
EXPECT_EQ(0, networkFile->connectionNotes.notes.size());
EXPECT_EQ(0, networkFile->moduleTags.tags.size());
}
TEST(LegacyNetworkFileImporterTests, CanLoadNetworkFileWithTwoModulesOneConnection)
{
auto dtdpath = TestResources::rootDir() / "Other";
LegacyNetworkIO lnio(dtdpath.string());
auto v4file1 = TestResources::rootDir() / "Other" / "v4nets" / "twoModsOneConnection.srn";
auto networkFile = lnio.load_net(v4file1.string());
ASSERT_TRUE(networkFile != nullptr);
EXPECT_EQ(2, networkFile->network.modules.size());
auto modIter = networkFile->network.modules.begin();
EXPECT_EQ("ComputeSVD:0", modIter->first);
EXPECT_EQ("ComputeSVD", modIter->second.module.module_name_);
EXPECT_EQ("Math", modIter->second.module.category_name_);
EXPECT_EQ("SCIRun", modIter->second.module.package_name_);
++modIter;
EXPECT_EQ("CreateLatVol:0", modIter->first);
EXPECT_EQ("CreateLatVol", modIter->second.module.module_name_);
EXPECT_EQ("NewField", modIter->second.module.category_name_);
EXPECT_EQ("SCIRun", modIter->second.module.package_name_);
ASSERT_EQ(1, networkFile->network.connections.size());
auto conn = networkFile->network.connections[0];
std::cout << "CONN LOOKS LIKE " << static_cast<std::string>(ConnectionId::create(conn)) << std::endl;
EXPECT_EQ(2, networkFile->modulePositions.modulePositions.size());
EXPECT_EQ(0, networkFile->moduleNotes.notes.size());
EXPECT_EQ(0, networkFile->connectionNotes.notes.size());
EXPECT_EQ(0, networkFile->moduleTags.tags.size());
FAIL() << "todo";
}
TEST(LegacyNetworkFileImporterTests, CanLoadNetworkFileWithThreeModulesSameType)
{
auto dtdpath = TestResources::rootDir() / "Other";
LegacyNetworkIO lnio(dtdpath.string());
auto v4file1 = TestResources::rootDir() / "Other" / "v4nets" / "threeSameModulesIDTest.srn";
auto networkFile = lnio.load_net(v4file1.string());
ASSERT_TRUE(networkFile != nullptr);
EXPECT_EQ(3, networkFile->network.modules.size());
auto modIter = networkFile->network.modules.begin();
EXPECT_EQ("CreateLatVol:0", modIter->first);
EXPECT_EQ("CreateLatVol", modIter->second.module.module_name_);
EXPECT_EQ("NewField", modIter->second.module.category_name_);
EXPECT_EQ("SCIRun", modIter->second.module.package_name_);
++modIter;
EXPECT_EQ("CreateLatVol:1", modIter->first);
EXPECT_EQ("CreateLatVol", modIter->second.module.module_name_);
EXPECT_EQ("NewField", modIter->second.module.category_name_);
EXPECT_EQ("SCIRun", modIter->second.module.package_name_);
++modIter;
EXPECT_EQ("CreateLatVol:2", modIter->first);
EXPECT_EQ("CreateLatVol", modIter->second.module.module_name_);
EXPECT_EQ("NewField", modIter->second.module.category_name_);
EXPECT_EQ("SCIRun", modIter->second.module.package_name_);
EXPECT_EQ(0, networkFile->network.connections.size());
}
TEST(LegacyNetworkFileImporterTests, CanLoadNetworkFileWithTwoModulesTwoConnections)
{
FAIL() << "todo";
}
TEST(LegacyNetworkFileImporterTests, CanLoadNetworkFileWithLotsOfObjects)
{
FAIL() << "todo";
}
TEST(LegacyNetworkFileImporterTests, CanLoadNetworkFileWithModuleNotes)
{
FAIL() << "todo";
}
TEST(LegacyNetworkFileImporterTests, CanLoadNetworkFileWithConnectionNotes)
{
FAIL() << "todo";
}
|
Update ids
|
Update ids
|
C++
|
mit
|
collint8/SCIRun,jessdtate/SCIRun,moritzdannhauer/SCIRunGUIPrototype,moritzdannhauer/SCIRunGUIPrototype,jcollfont/SCIRun,jessdtate/SCIRun,jessdtate/SCIRun,ajanson/SCIRun,ajanson/SCIRun,collint8/SCIRun,ajanson/SCIRun,jcollfont/SCIRun,jessdtate/SCIRun,collint8/SCIRun,moritzdannhauer/SCIRunGUIPrototype,moritzdannhauer/SCIRunGUIPrototype,jessdtate/SCIRun,jessdtate/SCIRun,collint8/SCIRun,jcollfont/SCIRun,jessdtate/SCIRun,jcollfont/SCIRun,moritzdannhauer/SCIRunGUIPrototype,ajanson/SCIRun,collint8/SCIRun,collint8/SCIRun,jessdtate/SCIRun,jcollfont/SCIRun,collint8/SCIRun,ajanson/SCIRun,moritzdannhauer/SCIRunGUIPrototype,ajanson/SCIRun,collint8/SCIRun,ajanson/SCIRun,jcollfont/SCIRun,jcollfont/SCIRun,moritzdannhauer/SCIRunGUIPrototype
|
ba45775be000f0923ae620fff6760f15ca56dc53
|
tensorflow/compiler/tf2xla/kernels/while_op.cc
|
tensorflow/compiler/tf2xla/kernels/while_op.cc
|
/* Copyright 2017 The TensorFlow Authors. All Rights Reserved.
Licensed 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 "tensorflow/compiler/tf2xla/kernels/while_op.h"
#include "tensorflow/compiler/tf2xla/shape_util.h"
#include "tensorflow/compiler/tf2xla/type_util.h"
#include "tensorflow/compiler/tf2xla/xla_compiler.h"
#include "tensorflow/compiler/tf2xla/xla_helpers.h"
#include "tensorflow/compiler/tf2xla/xla_op_kernel.h"
#include "tensorflow/compiler/tf2xla/xla_op_registry.h"
#include "tensorflow/compiler/xla/client/computation_builder.h"
#include "tensorflow/core/framework/function.h"
#include "tensorflow/core/framework/op_kernel.h"
namespace tensorflow {
namespace {
// Builds XlaCompiler argument descriptions `args` from `ctx`.
Status MakeXlaCompilerArgumentsFromInputs(
XlaOpKernelContext* ctx, std::vector<XlaCompiler::Argument>* args,
bool* has_uninitialized_vars) {
VLOG(2) << "Num inputs " << ctx->num_inputs();
args->resize(ctx->num_inputs());
*has_uninitialized_vars = false;
for (int i = 0; i < ctx->num_inputs(); ++i) {
VLOG(2) << " Input " << i
<< " type: " << DataTypeString(ctx->input_type(i))
<< " shape: " << ctx->InputShape(i).DebugString();
XlaCompiler::Argument& arg = (*args)[i];
DataType type = ctx->input_type(i);
// When reading a resource input, use the type and shape of the resource's
// current value.
if (type == DT_RESOURCE) {
XlaResource* resource;
TF_RETURN_IF_ERROR(ctx->GetResourceInput(i, &resource));
arg.initialized = resource->value.handle() > 0;
switch (resource->kind) {
case XlaResource::kVariable:
arg.kind = XlaCompiler::Argument::kVariable;
break;
case XlaResource::kTensorArray:
arg.kind = XlaCompiler::Argument::kTensorArray;
break;
case XlaResource::kInvalid:
CHECK(false);
}
arg.type = resource->type;
if (arg.initialized) {
auto shape = ctx->builder()->GetShape(resource->value);
TF_RETURN_IF_ERROR(shape.status());
arg.shape = *shape.ValueOrDie();
} else {
*has_uninitialized_vars = true;
}
arg.tensor_array_size = resource->tensor_array_size;
arg.name = resource->name;
// TODO(phawkins): propagate TensorArray gradients into loops.
VLOG(2) << " resource " << resource->name
<< " type: " << DataTypeString(arg.type)
<< " shape: " << arg.shape.DebugString()
<< " initialized: " << arg.initialized;
} else {
arg.kind = XlaCompiler::Argument::kParameter;
arg.type = ctx->input_type(i);
TF_RETURN_IF_ERROR(
TensorShapeToXLAShape(arg.type, ctx->InputShape(i), &arg.shape));
}
}
return Status::OK();
}
} // anonymous namespace
XlaWhileOp::XlaWhileOp(OpKernelConstruction* ctx) : XlaOpKernel(ctx) {
const NameAttrList* name_attr;
OP_REQUIRES_OK(ctx, ctx->GetAttr("cond", &name_attr));
cond_name_attr_ = *name_attr;
OP_REQUIRES_OK(ctx, ctx->GetAttr("body", &name_attr));
body_name_attr_ = *name_attr;
}
void XlaWhileOp::Compile(XlaOpKernelContext* ctx) {
VLOG(1) << "WhileOp::Compile";
std::vector<XlaCompiler::Argument> arguments;
bool has_uninitialized_vars;
OP_REQUIRES_OK(ctx, MakeXlaCompilerArgumentsFromInputs(
ctx, &arguments, &has_uninitialized_vars));
const bool use_tuple_arg = (arguments.size() != 1);
xla::ComputationBuilder* builder = ctx->builder();
XlaCompiler* compiler = ctx->compiler();
VLOG(1) << "Compiling body";
// All resource that are inputs to the loop's body must also be
// present as loop body outputs; the signature of the loop's input and
// output must match. We ensure this by asking the compiler to include the
// current values of all resources, even if they haven't been updated by the
// computation. We must also ask the compiler to keep compile-time constant
// outputs as part of the generated computation, for the same reason.
// TODO(phawkins): consider adding loop-invariant inputs to XLA's While()
// operator.
XlaCompiler::CompileOptions body_options;
body_options.use_tuple_arg = use_tuple_arg;
body_options.return_updated_values_for_all_resources = true;
body_options.resolve_compile_time_constants = false;
XlaCompiler::CompilationResult body;
OP_REQUIRES_OK(ctx, compiler->CompileFunction(body_options, body_name_attr_,
arguments, &body));
// We must use a static shape for parameters to an XLA compilation. However,
// we may not know the shape of a TensorArray if it is first written inside
// the loop. Ideally we would require the user to provide a static shape,
// but this is not always easy.
// So if uninitialized resource are used by the loop body, we compile the
// body function twice:
// 1) once with uninitialized resource inputs. We discard the computation
// but we assume resource shapes reach a fixpoint after one iteration.
// So we can use the output shapes of the resource as the "true" shapes.
// 2) again with the "correct" input shapes determined by (1).
if (has_uninitialized_vars) {
// Initializes any uninitialized resource with zero values of the
// shape determined by the first compilation.
for (int i = 0; i < body.resource_updates.size(); ++i) {
const XlaCompiler::ResourceUpdate& update = body.resource_updates[i];
XlaCompiler::Argument& arg = arguments[update.input_index];
if (!arg.initialized) {
VLOG(2) << "Update shape for argument " << update.input_index << " "
<< xla::ShapeUtil::HumanString(update.shape);
arg.initialized = true;
arg.shape = update.shape;
XlaResource* resource;
OP_REQUIRES_OK(ctx,
ctx->GetResourceInput(update.input_index, &resource));
std::unique_ptr<xla::Literal> zero =
xla::Literal::CreateFromShape(update.shape);
resource->value = builder->ConstantLiteral(*zero);
}
}
// Recompile the body with the "correct" shapes.
VLOG(1) << "Recompiling body with non-placeholder shapes";
body = {};
OP_REQUIRES_OK(ctx, compiler->CompileFunction(body_options, body_name_attr_,
arguments, &body));
}
VLOG(1) << "Compiling condition";
XlaCompiler::CompileOptions cond_options;
cond_options.use_tuple_arg = use_tuple_arg;
cond_options.resolve_compile_time_constants = false;
XlaCompiler::CompilationResult cond;
OP_REQUIRES_OK(ctx, compiler->CompileFunction(cond_options, cond_name_attr_,
arguments, &cond));
xla::Shape body_input_shape, cond_input_shape;
if (use_tuple_arg) {
body_input_shape = xla::ShapeUtil::MakeTupleShape(body.xla_input_shapes);
cond_input_shape = xla::ShapeUtil::MakeTupleShape(cond.xla_input_shapes);
} else {
CHECK(!body.xla_input_shapes.empty());
body_input_shape = body.xla_input_shapes[0];
CHECK(!body.xla_input_shapes.empty());
cond_input_shape = cond.xla_input_shapes[0];
}
VLOG(2) << "Body shape: " << xla::ShapeUtil::HumanString(body_input_shape)
<< " -> " << xla::ShapeUtil::HumanString(body.xla_output_shape);
VLOG(2) << "Cond shape: " << xla::ShapeUtil::HumanString(cond_input_shape)
<< " -> " << xla::ShapeUtil::HumanString(cond.xla_output_shape);
OP_REQUIRES(ctx,
xla::ShapeUtil::Compatible(body_input_shape, cond_input_shape),
errors::InvalidArgument(
"Input shapes of loop body and condition do not match: ",
xla::ShapeUtil::HumanString(body_input_shape), " vs. ",
xla::ShapeUtil::HumanString(cond_input_shape)));
OP_REQUIRES(
ctx, xla::ShapeUtil::Compatible(body_input_shape, body.xla_output_shape),
errors::InvalidArgument(
"Input and output shapes of loop body do not match: ",
xla::ShapeUtil::HumanString(body_input_shape), " vs. ",
xla::ShapeUtil::HumanString(body.xla_output_shape)));
xla::ComputationDataHandle data;
int num_inputs = body.input_mapping.size();
std::vector<xla::ComputationDataHandle> inputs(num_inputs);
for (int i = 0; i < num_inputs; ++i) {
int input_num = body.input_mapping[i];
if (ctx->input_type(input_num) == DT_RESOURCE) {
XlaResource* resource;
OP_REQUIRES_OK(ctx, ctx->GetResourceInput(input_num, &resource));
inputs[i] = resource->value;
} else {
inputs[i] = ctx->Input(i);
}
}
xla::ComputationDataHandle init;
if (use_tuple_arg) {
init = builder->Tuple(inputs);
} else {
init = inputs[0];
}
VLOG(1) << "Building while loop";
xla::ComputationDataHandle while_result =
builder->While(*cond.computation, *body.computation, init);
auto get_loop_output = [&](int i) {
if (use_tuple_arg) {
return builder->GetTupleElement(while_result, i);
} else {
return while_result;
}
};
// Sets non-variable outputs.
for (int i = 0; i < ctx->num_outputs(); ++i) {
if (ctx->input_type(i) != DT_RESOURCE) {
ctx->SetOutput(body.input_mapping[i], get_loop_output(i));
}
}
// Updates the values of any resource variables modified by the loop.
for (int i = 0; i < body.resource_updates.size(); ++i) {
const XlaCompiler::ResourceUpdate& update = body.resource_updates[i];
XlaResource* resource;
OP_REQUIRES_OK(ctx, ctx->GetResourceInput(update.input_index, &resource));
if (update.modified) {
int pos = body.outputs.size() + i;
resource->value = get_loop_output(pos);
}
VLOG(2) << "Loop-carried variable: pos: " << update.input_index
<< " name: " << resource->name << " modified: " << update.modified
<< " type: " << DataTypeString(update.type)
<< " shape: " << update.shape.DebugString();
// Copies the identity of the resource variable from input to output
// unchanged, even if the variable was not modified.
ctx->op_kernel_context()->set_output(
update.input_index,
ctx->op_kernel_context()->input(update.input_index));
}
VLOG(1) << "Done building while loop";
}
REGISTER_XLA_OP(Name("XlaWhile").AllowResourceTypes(), XlaWhileOp);
} // namespace tensorflow
|
/* Copyright 2017 The TensorFlow Authors. All Rights Reserved.
Licensed 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 "tensorflow/compiler/tf2xla/kernels/while_op.h"
#include "tensorflow/compiler/tf2xla/shape_util.h"
#include "tensorflow/compiler/tf2xla/type_util.h"
#include "tensorflow/compiler/tf2xla/xla_compiler.h"
#include "tensorflow/compiler/tf2xla/xla_helpers.h"
#include "tensorflow/compiler/tf2xla/xla_op_kernel.h"
#include "tensorflow/compiler/tf2xla/xla_op_registry.h"
#include "tensorflow/compiler/xla/client/computation_builder.h"
#include "tensorflow/core/framework/function.h"
#include "tensorflow/core/framework/op_kernel.h"
namespace tensorflow {
namespace {
// Builds XlaCompiler argument descriptions `args` from `ctx`.
Status MakeXlaCompilerArgumentsFromInputs(
XlaOpKernelContext* ctx, std::vector<XlaCompiler::Argument>* args,
bool* has_uninitialized_vars) {
VLOG(2) << "Num inputs " << ctx->num_inputs();
args->resize(ctx->num_inputs());
*has_uninitialized_vars = false;
for (int i = 0; i < ctx->num_inputs(); ++i) {
VLOG(2) << " Input " << i
<< " type: " << DataTypeString(ctx->input_type(i))
<< " shape: " << ctx->InputShape(i).DebugString();
XlaCompiler::Argument& arg = (*args)[i];
DataType type = ctx->input_type(i);
// When reading a resource input, use the type and shape of the resource's
// current value.
if (type == DT_RESOURCE) {
XlaResource* resource;
TF_RETURN_IF_ERROR(ctx->GetResourceInput(i, &resource));
arg.initialized = resource->value.handle() > 0;
switch (resource->kind) {
case XlaResource::kVariable:
arg.kind = XlaCompiler::Argument::kVariable;
break;
case XlaResource::kTensorArray:
arg.kind = XlaCompiler::Argument::kTensorArray;
break;
case XlaResource::kInvalid:
CHECK(false);
}
arg.type = resource->type;
if (arg.initialized) {
auto shape = ctx->builder()->GetShape(resource->value);
TF_RETURN_IF_ERROR(shape.status());
arg.shape = *shape.ValueOrDie();
} else {
*has_uninitialized_vars = true;
}
arg.tensor_array_size = resource->tensor_array_size;
arg.name = resource->name;
// TODO(phawkins): propagate TensorArray gradients into loops.
VLOG(2) << " resource " << resource->name
<< " type: " << DataTypeString(arg.type)
<< " shape: " << arg.shape.DebugString()
<< " initialized: " << arg.initialized;
} else {
arg.kind = XlaCompiler::Argument::kParameter;
arg.type = ctx->input_type(i);
TF_RETURN_IF_ERROR(
TensorShapeToXLAShape(arg.type, ctx->InputShape(i), &arg.shape));
}
}
return Status::OK();
}
} // anonymous namespace
XlaWhileOp::XlaWhileOp(OpKernelConstruction* ctx) : XlaOpKernel(ctx) {
const NameAttrList* name_attr;
OP_REQUIRES_OK(ctx, ctx->GetAttr("cond", &name_attr));
cond_name_attr_ = *name_attr;
OP_REQUIRES_OK(ctx, ctx->GetAttr("body", &name_attr));
body_name_attr_ = *name_attr;
}
void XlaWhileOp::Compile(XlaOpKernelContext* ctx) {
VLOG(1) << "WhileOp::Compile";
std::vector<XlaCompiler::Argument> arguments;
bool has_uninitialized_vars;
OP_REQUIRES_OK(ctx, MakeXlaCompilerArgumentsFromInputs(
ctx, &arguments, &has_uninitialized_vars));
const bool use_tuple_arg = (arguments.size() != 1);
xla::ComputationBuilder* builder = ctx->builder();
XlaCompiler* compiler = ctx->compiler();
VLOG(1) << "Compiling body";
// All resource that are inputs to the loop's body must also be
// present as loop body outputs; the signature of the loop's input and
// output must match. We ensure this by asking the compiler to include the
// current values of all resources, even if they haven't been updated by the
// computation. We must also ask the compiler to keep compile-time constant
// outputs as part of the generated computation, for the same reason.
// TODO(phawkins): consider adding loop-invariant inputs to XLA's While()
// operator.
XlaCompiler::CompileOptions body_options;
body_options.use_tuple_arg = use_tuple_arg;
body_options.return_updated_values_for_all_resources = true;
body_options.resolve_compile_time_constants = false;
XlaCompiler::CompilationResult body;
OP_REQUIRES_OK(ctx, compiler->CompileFunction(body_options, body_name_attr_,
arguments, &body));
// We must use a static shape for parameters to an XLA compilation. However,
// we may not know the shape of a TensorArray if it is first written inside
// the loop. Ideally we would require the user to provide a static shape,
// but this is not always easy.
// So if uninitialized resource are used by the loop body, we compile the
// body function twice:
// 1) once with uninitialized resource inputs. We discard the computation
// but we assume resource shapes reach a fixpoint after one iteration.
// So we can use the output shapes of the resource as the "true" shapes.
// 2) again with the "correct" input shapes determined by (1).
if (has_uninitialized_vars) {
// Initializes any uninitialized resource with zero values of the
// shape determined by the first compilation.
for (int i = 0; i < body.resource_updates.size(); ++i) {
const XlaCompiler::ResourceUpdate& update = body.resource_updates[i];
XlaCompiler::Argument& arg = arguments[update.input_index];
if (!arg.initialized) {
VLOG(2) << "Update shape for argument " << update.input_index << " "
<< xla::ShapeUtil::HumanString(update.shape);
arg.initialized = true;
arg.shape = update.shape;
XlaResource* resource;
OP_REQUIRES_OK(ctx,
ctx->GetResourceInput(update.input_index, &resource));
std::unique_ptr<xla::Literal> zero =
xla::Literal::CreateFromShape(update.shape);
resource->value = builder->ConstantLiteral(*zero);
}
}
// Recompile the body with the "correct" shapes.
VLOG(1) << "Recompiling body with non-placeholder shapes";
body = {};
OP_REQUIRES_OK(ctx, compiler->CompileFunction(body_options, body_name_attr_,
arguments, &body));
}
VLOG(1) << "Compiling condition";
XlaCompiler::CompileOptions cond_options;
cond_options.use_tuple_arg = use_tuple_arg;
cond_options.resolve_compile_time_constants = false;
XlaCompiler::CompilationResult cond;
OP_REQUIRES_OK(ctx, compiler->CompileFunction(cond_options, cond_name_attr_,
arguments, &cond));
xla::Shape body_input_shape, cond_input_shape;
if (use_tuple_arg) {
body_input_shape = xla::ShapeUtil::MakeTupleShape(body.xla_input_shapes);
cond_input_shape = xla::ShapeUtil::MakeTupleShape(cond.xla_input_shapes);
} else {
CHECK(!body.xla_input_shapes.empty());
body_input_shape = body.xla_input_shapes[0];
CHECK(!cond.xla_input_shapes.empty());
cond_input_shape = cond.xla_input_shapes[0];
}
VLOG(2) << "Body shape: " << xla::ShapeUtil::HumanString(body_input_shape)
<< " -> " << xla::ShapeUtil::HumanString(body.xla_output_shape);
VLOG(2) << "Cond shape: " << xla::ShapeUtil::HumanString(cond_input_shape)
<< " -> " << xla::ShapeUtil::HumanString(cond.xla_output_shape);
OP_REQUIRES(ctx,
xla::ShapeUtil::Compatible(body_input_shape, cond_input_shape),
errors::InvalidArgument(
"Input shapes of loop body and condition do not match: ",
xla::ShapeUtil::HumanString(body_input_shape), " vs. ",
xla::ShapeUtil::HumanString(cond_input_shape)));
OP_REQUIRES(
ctx, xla::ShapeUtil::Compatible(body_input_shape, body.xla_output_shape),
errors::InvalidArgument(
"Input and output shapes of loop body do not match: ",
xla::ShapeUtil::HumanString(body_input_shape), " vs. ",
xla::ShapeUtil::HumanString(body.xla_output_shape)));
xla::ComputationDataHandle data;
int num_inputs = body.input_mapping.size();
std::vector<xla::ComputationDataHandle> inputs(num_inputs);
for (int i = 0; i < num_inputs; ++i) {
int input_num = body.input_mapping[i];
if (ctx->input_type(input_num) == DT_RESOURCE) {
XlaResource* resource;
OP_REQUIRES_OK(ctx, ctx->GetResourceInput(input_num, &resource));
inputs[i] = resource->value;
} else {
inputs[i] = ctx->Input(i);
}
}
xla::ComputationDataHandle init;
if (use_tuple_arg) {
init = builder->Tuple(inputs);
} else {
init = inputs[0];
}
VLOG(1) << "Building while loop";
xla::ComputationDataHandle while_result =
builder->While(*cond.computation, *body.computation, init);
auto get_loop_output = [&](int i) {
if (use_tuple_arg) {
return builder->GetTupleElement(while_result, i);
} else {
return while_result;
}
};
// Sets non-variable outputs.
for (int i = 0; i < ctx->num_outputs(); ++i) {
if (ctx->input_type(i) != DT_RESOURCE) {
ctx->SetOutput(body.input_mapping[i], get_loop_output(i));
}
}
// Updates the values of any resource variables modified by the loop.
for (int i = 0; i < body.resource_updates.size(); ++i) {
const XlaCompiler::ResourceUpdate& update = body.resource_updates[i];
XlaResource* resource;
OP_REQUIRES_OK(ctx, ctx->GetResourceInput(update.input_index, &resource));
if (update.modified) {
int pos = body.outputs.size() + i;
resource->value = get_loop_output(pos);
}
VLOG(2) << "Loop-carried variable: pos: " << update.input_index
<< " name: " << resource->name << " modified: " << update.modified
<< " type: " << DataTypeString(update.type)
<< " shape: " << update.shape.DebugString();
// Copies the identity of the resource variable from input to output
// unchanged, even if the variable was not modified.
ctx->op_kernel_context()->set_output(
update.input_index,
ctx->op_kernel_context()->input(update.input_index));
}
VLOG(1) << "Done building while loop";
}
REGISTER_XLA_OP(Name("XlaWhile").AllowResourceTypes(), XlaWhileOp);
} // namespace tensorflow
|
Fix copy-and-paste bug in CHECK statement.
|
[TF:XLA] Fix copy-and-paste bug in CHECK statement.
PiperOrigin-RevId: 161527685
|
C++
|
apache-2.0
|
guschmue/tensorflow,seanli9jan/tensorflow,petewarden/tensorflow,allenlavoie/tensorflow,ravindrapanda/tensorflow,tensorflow/tensorflow-pywrap_tf_optimizer,raymondxyang/tensorflow,lukeiwanski/tensorflow,kevin-coder/tensorflow-fork,allenlavoie/tensorflow,karllessard/tensorflow,rabipanda/tensorflow,tiagofrepereira2012/tensorflow,dancingdan/tensorflow,freedomtan/tensorflow,annarev/tensorflow,eadgarchen/tensorflow,Xeralux/tensorflow,AnishShah/tensorflow,JVillella/tensorflow,hsaputra/tensorflow,annarev/tensorflow,ZhangXinNan/tensorflow,girving/tensorflow,alshedivat/tensorflow,Moriadry/tensorflow,freedomtan/tensorflow,hfp/tensorflow-xsmm,davidzchen/tensorflow,drpngx/tensorflow,seanli9jan/tensorflow,dongjoon-hyun/tensorflow,benoitsteiner/tensorflow-opencl,alivecor/tensorflow,Moriadry/tensorflow,rabipanda/tensorflow,dyoung418/tensorflow,jbedorf/tensorflow,nolanliou/tensorflow,jalexvig/tensorflow,tiagofrepereira2012/tensorflow,caisq/tensorflow,mavenlin/tensorflow,Mistobaan/tensorflow,AnishShah/tensorflow,Mistobaan/tensorflow,theflofly/tensorflow,guschmue/tensorflow,Bismarrck/tensorflow,Moriadry/tensorflow,zasdfgbnm/tensorflow,Kongsea/tensorflow,allenlavoie/tensorflow,yanchen036/tensorflow,av8ramit/tensorflow,yongtang/tensorflow,codrut3/tensorflow,davidzchen/tensorflow,asimshankar/tensorflow,aam-at/tensorflow,eaplatanios/tensorflow,chemelnucfin/tensorflow,laszlocsomor/tensorflow,dendisuhubdy/tensorflow,tensorflow/tensorflow,raymondxyang/tensorflow,ishay2b/tensorflow,gunan/tensorflow,sarvex/tensorflow,freedomtan/tensorflow,renyi533/tensorflow,aam-at/tensorflow,gautam1858/tensorflow,lakshayg/tensorflow,Intel-tensorflow/tensorflow,Mistobaan/tensorflow,jalexvig/tensorflow,chemelnucfin/tensorflow,apark263/tensorflow,ZhangXinNan/tensorflow,rabipanda/tensorflow,alivecor/tensorflow,davidzchen/tensorflow,a-doumoulakis/tensorflow,unsiloai/syntaxnet-ops-hack,Bismarrck/tensorflow,frreiss/tensorflow-fred,ArtsiomCh/tensorflow,ychfan/tensorflow,suiyuan2009/tensorflow,horance-liu/tensorflow,theflofly/tensorflow,maciekcc/tensorflow,arborh/tensorflow,cxxgtxy/tensorflow,hsaputra/tensorflow,gojira/tensorflow,eadgarchen/tensorflow,lakshayg/tensorflow,eadgarchen/tensorflow,nburn42/tensorflow,unsiloai/syntaxnet-ops-hack,Intel-Corporation/tensorflow,renyi533/tensorflow,manipopopo/tensorflow,freedomtan/tensorflow,gunan/tensorflow,adit-chandra/tensorflow,alshedivat/tensorflow,alsrgv/tensorflow,gunan/tensorflow,petewarden/tensorflow,alsrgv/tensorflow,jwlawson/tensorflow,alivecor/tensorflow,gojira/tensorflow,Kongsea/tensorflow,xzturn/tensorflow,JingJunYin/tensorflow,apark263/tensorflow,lukeiwanski/tensorflow,gojira/tensorflow,jwlawson/tensorflow,ravindrapanda/tensorflow,karllessard/tensorflow,ZhangXinNan/tensorflow,gunan/tensorflow,jwlawson/tensorflow,DavidNorman/tensorflow,with-git/tensorflow,tiagofrepereira2012/tensorflow,dongjoon-hyun/tensorflow,tensorflow/tensorflow,ZhangXinNan/tensorflow,codrut3/tensorflow,gautam1858/tensorflow,ychfan/tensorflow,jbedorf/tensorflow,alshedivat/tensorflow,tensorflow/tensorflow-experimental_link_static_libraries_once,jalexvig/tensorflow,tiagofrepereira2012/tensorflow,tensorflow/tensorflow-pywrap_saved_model,drpngx/tensorflow,aam-at/tensorflow,brchiu/tensorflow,ravindrapanda/tensorflow,manazhao/tf_recsys,DavidNorman/tensorflow,guschmue/tensorflow,gojira/tensorflow,xzturn/tensorflow,nburn42/tensorflow,DavidNorman/tensorflow,a-doumoulakis/tensorflow,JVillella/tensorflow,alsrgv/tensorflow,AnishShah/tensorflow,yongtang/tensorflow,benoitsteiner/tensorflow-opencl,gautam1858/tensorflow,ZhangXinNan/tensorflow,seanli9jan/tensorflow,mdrumond/tensorflow,lakshayg/tensorflow,petewarden/tensorflow,Intel-tensorflow/tensorflow,raymondxyang/tensorflow,horance-liu/tensorflow,mavenlin/tensorflow,meteorcloudy/tensorflow,Moriadry/tensorflow,horance-liu/tensorflow,sarvex/tensorflow,raymondxyang/tensorflow,tensorflow/tensorflow-experimental_link_static_libraries_once,jendap/tensorflow,eadgarchen/tensorflow,mixturemodel-flow/tensorflow,jwlawson/tensorflow,yongtang/tensorflow,laszlocsomor/tensorflow,aselle/tensorflow,theflofly/tensorflow,snnn/tensorflow,tensorflow/tensorflow,paolodedios/tensorflow,mavenlin/tensorflow,asimshankar/tensorflow,ychfan/tensorflow,paolodedios/tensorflow,renyi533/tensorflow,JVillella/tensorflow,rabipanda/tensorflow,nburn42/tensorflow,Moriadry/tensorflow,av8ramit/tensorflow,alistairlow/tensorflow,petewarden/tensorflow,snnn/tensorflow,jostep/tensorflow,annarev/tensorflow,lukeiwanski/tensorflow,freedomtan/tensorflow,raymondxyang/tensorflow,Mistobaan/tensorflow,dendisuhubdy/tensorflow,caisq/tensorflow,dongjoon-hyun/tensorflow,allenlavoie/tensorflow,brchiu/tensorflow,aldian/tensorflow,tensorflow/tensorflow-experimental_link_static_libraries_once,Mistobaan/tensorflow,with-git/tensorflow,Xeralux/tensorflow,theflofly/tensorflow,DavidNorman/tensorflow,jostep/tensorflow,girving/tensorflow,apark263/tensorflow,hsaputra/tensorflow,ZhangXinNan/tensorflow,kevin-coder/tensorflow-fork,aselle/tensorflow,gojira/tensorflow,girving/tensorflow,alsrgv/tensorflow,Bismarrck/tensorflow,yongtang/tensorflow,yanchen036/tensorflow,JingJunYin/tensorflow,dancingdan/tensorflow,snnn/tensorflow,Mistobaan/tensorflow,ArtsiomCh/tensorflow,caisq/tensorflow,Xeralux/tensorflow,benoitsteiner/tensorflow-opencl,sarvex/tensorflow,eaplatanios/tensorflow,manazhao/tf_recsys,tillahoffmann/tensorflow,karllessard/tensorflow,hehongliang/tensorflow,Bismarrck/tensorflow,manazhao/tf_recsys,hfp/tensorflow-xsmm,lukeiwanski/tensorflow,mavenlin/tensorflow,xodus7/tensorflow,tensorflow/tensorflow-pywrap_tf_optimizer,davidzchen/tensorflow,jhseu/tensorflow,pavelchristof/gomoku-ai,zasdfgbnm/tensorflow,JingJunYin/tensorflow,tornadozou/tensorflow,chemelnucfin/tensorflow,kevin-coder/tensorflow-fork,ArtsiomCh/tensorflow,jhseu/tensorflow,av8ramit/tensorflow,cxxgtxy/tensorflow,Intel-tensorflow/tensorflow,JVillella/tensorflow,aselle/tensorflow,paolodedios/tensorflow,jendap/tensorflow,aam-at/tensorflow,brchiu/tensorflow,jostep/tensorflow,tiagofrepereira2012/tensorflow,nolanliou/tensorflow,jbedorf/tensorflow,jhseu/tensorflow,apark263/tensorflow,gunan/tensorflow,dyoung418/tensorflow,Moriadry/tensorflow,laszlocsomor/tensorflow,drpngx/tensorflow,tensorflow/tensorflow-experimental_link_static_libraries_once,laszlocsomor/tensorflow,Intel-tensorflow/tensorflow,lukeiwanski/tensorflow,gautam1858/tensorflow,with-git/tensorflow,yongtang/tensorflow,eaplatanios/tensorflow,jalexvig/tensorflow,JingJunYin/tensorflow,hsaputra/tensorflow,snnn/tensorflow,DavidNorman/tensorflow,gunan/tensorflow,snnn/tensorflow,adit-chandra/tensorflow,ppwwyyxx/tensorflow,maciekcc/tensorflow,frreiss/tensorflow-fred,petewarden/tensorflow,jhseu/tensorflow,ageron/tensorflow,eadgarchen/tensorflow,ArtsiomCh/tensorflow,Intel-tensorflow/tensorflow,unsiloai/syntaxnet-ops-hack,JVillella/tensorflow,hfp/tensorflow-xsmm,gunan/tensorflow,mdrumond/tensorflow,nolanliou/tensorflow,guschmue/tensorflow,mdrumond/tensorflow,ageron/tensorflow,xzturn/tensorflow,annarev/tensorflow,apark263/tensorflow,tensorflow/tensorflow-experimental_link_static_libraries_once,yongtang/tensorflow,Xeralux/tensorflow,Bismarrck/tensorflow,eaplatanios/tensorflow,dongjoon-hyun/tensorflow,jhseu/tensorflow,gojira/tensorflow,jbedorf/tensorflow,dendisuhubdy/tensorflow,alsrgv/tensorflow,gunan/tensorflow,ppwwyyxx/tensorflow,JingJunYin/tensorflow,dancingdan/tensorflow,hsaputra/tensorflow,suiyuan2009/tensorflow,zasdfgbnm/tensorflow,dancingdan/tensorflow,jostep/tensorflow,hfp/tensorflow-xsmm,hsaputra/tensorflow,girving/tensorflow,jart/tensorflow,cxxgtxy/tensorflow,nburn42/tensorflow,aldian/tensorflow,brchiu/tensorflow,Bismarrck/tensorflow,kevin-coder/tensorflow-fork,aselle/tensorflow,suiyuan2009/tensorflow,jbedorf/tensorflow,alshedivat/tensorflow,davidzchen/tensorflow,jhseu/tensorflow,kevin-coder/tensorflow-fork,ghchinoy/tensorflow,nolanliou/tensorflow,yanchen036/tensorflow,karllessard/tensorflow,petewarden/tensorflow,Bismarrck/tensorflow,ZhangXinNan/tensorflow,JingJunYin/tensorflow,gunan/tensorflow,aam-at/tensorflow,aldian/tensorflow,dyoung418/tensorflow,cxxgtxy/tensorflow,jendap/tensorflow,tensorflow/tensorflow-pywrap_tf_optimizer,jendap/tensorflow,gojira/tensorflow,aam-at/tensorflow,petewarden/tensorflow,maciekcc/tensorflow,seanli9jan/tensorflow,mixturemodel-flow/tensorflow,DavidNorman/tensorflow,gautam1858/tensorflow,seanli9jan/tensorflow,tensorflow/tensorflow-pywrap_tf_optimizer,hfp/tensorflow-xsmm,hfp/tensorflow-xsmm,manazhao/tf_recsys,dancingdan/tensorflow,ageron/tensorflow,ppwwyyxx/tensorflow,guschmue/tensorflow,asimshankar/tensorflow,davidzchen/tensorflow,ageron/tensorflow,Intel-tensorflow/tensorflow,AnishShah/tensorflow,yanchen036/tensorflow,mdrumond/tensorflow,dancingdan/tensorflow,unsiloai/syntaxnet-ops-hack,gojira/tensorflow,adit-chandra/tensorflow,meteorcloudy/tensorflow,paolodedios/tensorflow,benoitsteiner/tensorflow-xsmm,petewarden/tensorflow,aldian/tensorflow,arborh/tensorflow,Mazecreator/tensorflow,benoitsteiner/tensorflow-xsmm,dendisuhubdy/tensorflow,xzturn/tensorflow,rabipanda/tensorflow,rabipanda/tensorflow,girving/tensorflow,ageron/tensorflow,laszlocsomor/tensorflow,ghchinoy/tensorflow,zasdfgbnm/tensorflow,dyoung418/tensorflow,ghchinoy/tensorflow,alistairlow/tensorflow,drpngx/tensorflow,eaplatanios/tensorflow,Mistobaan/tensorflow,Mazecreator/tensorflow,av8ramit/tensorflow,tensorflow/tensorflow-experimental_link_static_libraries_once,jart/tensorflow,chemelnucfin/tensorflow,asimshankar/tensorflow,kobejean/tensorflow,adit-chandra/tensorflow,bowang/tensorflow,arborh/tensorflow,pavelchristof/gomoku-ai,adit-chandra/tensorflow,jhseu/tensorflow,Mazecreator/tensorflow,alshedivat/tensorflow,raymondxyang/tensorflow,jostep/tensorflow,arborh/tensorflow,drpngx/tensorflow,hehongliang/tensorflow,jendap/tensorflow,horance-liu/tensorflow,Intel-tensorflow/tensorflow,maciekcc/tensorflow,frreiss/tensorflow-fred,tensorflow/tensorflow-pywrap_saved_model,Bismarrck/tensorflow,sarvex/tensorflow,laszlocsomor/tensorflow,rabipanda/tensorflow,yongtang/tensorflow,tillahoffmann/tensorflow,xodus7/tensorflow,kobejean/tensorflow,benoitsteiner/tensorflow-xsmm,Mistobaan/tensorflow,brchiu/tensorflow,ageron/tensorflow,jbedorf/tensorflow,av8ramit/tensorflow,manipopopo/tensorflow,tensorflow/tensorflow-pywrap_saved_model,horance-liu/tensorflow,alshedivat/tensorflow,adamtiger/tensorflow,unsiloai/syntaxnet-ops-hack,adit-chandra/tensorflow,alsrgv/tensorflow,ppwwyyxx/tensorflow,jalexvig/tensorflow,aam-at/tensorflow,aldian/tensorflow,mixturemodel-flow/tensorflow,jostep/tensorflow,eadgarchen/tensorflow,jwlawson/tensorflow,meteorcloudy/tensorflow,meteorcloudy/tensorflow,xzturn/tensorflow,davidzchen/tensorflow,benoitsteiner/tensorflow-xsmm,xodus7/tensorflow,alivecor/tensorflow,nburn42/tensorflow,horance-liu/tensorflow,tensorflow/tensorflow,DavidNorman/tensorflow,alsrgv/tensorflow,gojira/tensorflow,Mazecreator/tensorflow,tensorflow/tensorflow-pywrap_saved_model,meteorcloudy/tensorflow,paolodedios/tensorflow,codrut3/tensorflow,alistairlow/tensorflow,brchiu/tensorflow,laszlocsomor/tensorflow,horance-liu/tensorflow,renyi533/tensorflow,hehongliang/tensorflow,sarvex/tensorflow,Intel-tensorflow/tensorflow,maciekcc/tensorflow,alivecor/tensorflow,kobejean/tensorflow,av8ramit/tensorflow,eaplatanios/tensorflow,dongjoon-hyun/tensorflow,asimshankar/tensorflow,xodus7/tensorflow,benoitsteiner/tensorflow-xsmm,laszlocsomor/tensorflow,AnishShah/tensorflow,girving/tensorflow,codrut3/tensorflow,a-doumoulakis/tensorflow,Mistobaan/tensorflow,drpngx/tensorflow,aldian/tensorflow,ishay2b/tensorflow,zasdfgbnm/tensorflow,caisq/tensorflow,hsaputra/tensorflow,benoitsteiner/tensorflow-opencl,gunan/tensorflow,manipopopo/tensorflow,meteorcloudy/tensorflow,ghchinoy/tensorflow,renyi533/tensorflow,ppwwyyxx/tensorflow,xodus7/tensorflow,ZhangXinNan/tensorflow,dendisuhubdy/tensorflow,brchiu/tensorflow,dancingdan/tensorflow,mdrumond/tensorflow,seanli9jan/tensorflow,theflofly/tensorflow,adamtiger/tensorflow,av8ramit/tensorflow,yanchen036/tensorflow,ghchinoy/tensorflow,Mazecreator/tensorflow,AnishShah/tensorflow,yanchen036/tensorflow,eadgarchen/tensorflow,alsrgv/tensorflow,benoitsteiner/tensorflow-opencl,dongjoon-hyun/tensorflow,Mistobaan/tensorflow,aselle/tensorflow,ZhangXinNan/tensorflow,ppwwyyxx/tensorflow,seanli9jan/tensorflow,dongjoon-hyun/tensorflow,alistairlow/tensorflow,yanchen036/tensorflow,jart/tensorflow,yongtang/tensorflow,adit-chandra/tensorflow,dongjoon-hyun/tensorflow,dancingdan/tensorflow,JVillella/tensorflow,tensorflow/tensorflow-experimental_link_static_libraries_once,kevin-coder/tensorflow-fork,alistairlow/tensorflow,tensorflow/tensorflow-experimental_link_static_libraries_once,seanli9jan/tensorflow,jendap/tensorflow,annarev/tensorflow,gunan/tensorflow,tornadozou/tensorflow,codrut3/tensorflow,maciekcc/tensorflow,kobejean/tensorflow,pavelchristof/gomoku-ai,xodus7/tensorflow,rabipanda/tensorflow,dendisuhubdy/tensorflow,jart/tensorflow,petewarden/tensorflow,annarev/tensorflow,davidzchen/tensorflow,ageron/tensorflow,jalexvig/tensorflow,frreiss/tensorflow-fred,drpngx/tensorflow,alsrgv/tensorflow,tensorflow/tensorflow-pywrap_saved_model,alivecor/tensorflow,aselle/tensorflow,Xeralux/tensorflow,dancingdan/tensorflow,nolanliou/tensorflow,caisq/tensorflow,adamtiger/tensorflow,guschmue/tensorflow,jalexvig/tensorflow,Xeralux/tensorflow,with-git/tensorflow,jwlawson/tensorflow,codrut3/tensorflow,jostep/tensorflow,arborh/tensorflow,theflofly/tensorflow,pavelchristof/gomoku-ai,xodus7/tensorflow,caisq/tensorflow,Intel-Corporation/tensorflow,suiyuan2009/tensorflow,jalexvig/tensorflow,ychfan/tensorflow,aam-at/tensorflow,theflofly/tensorflow,mixturemodel-flow/tensorflow,Intel-Corporation/tensorflow,snnn/tensorflow,tiagofrepereira2012/tensorflow,gojira/tensorflow,cxxgtxy/tensorflow,tiagofrepereira2012/tensorflow,a-doumoulakis/tensorflow,Intel-Corporation/tensorflow,dyoung418/tensorflow,yongtang/tensorflow,lakshayg/tensorflow,yanchen036/tensorflow,AnishShah/tensorflow,zasdfgbnm/tensorflow,nburn42/tensorflow,tillahoffmann/tensorflow,Kongsea/tensorflow,paolodedios/tensorflow,annarev/tensorflow,tornadozou/tensorflow,freedomtan/tensorflow,Mazecreator/tensorflow,AnishShah/tensorflow,bowang/tensorflow,tensorflow/tensorflow,xzturn/tensorflow,alshedivat/tensorflow,jendap/tensorflow,jwlawson/tensorflow,paolodedios/tensorflow,Intel-Corporation/tensorflow,kobejean/tensorflow,alivecor/tensorflow,suiyuan2009/tensorflow,tensorflow/tensorflow-pywrap_tf_optimizer,Mistobaan/tensorflow,hehongliang/tensorflow,ageron/tensorflow,av8ramit/tensorflow,karllessard/tensorflow,tensorflow/tensorflow-pywrap_tf_optimizer,xodus7/tensorflow,nolanliou/tensorflow,lukeiwanski/tensorflow,tornadozou/tensorflow,Intel-tensorflow/tensorflow,guschmue/tensorflow,Xeralux/tensorflow,xzturn/tensorflow,sarvex/tensorflow,mavenlin/tensorflow,tensorflow/tensorflow,freedomtan/tensorflow,tensorflow/tensorflow-pywrap_tf_optimizer,cxxgtxy/tensorflow,frreiss/tensorflow-fred,brchiu/tensorflow,hehongliang/tensorflow,tornadozou/tensorflow,benoitsteiner/tensorflow-xsmm,manipopopo/tensorflow,tillahoffmann/tensorflow,tillahoffmann/tensorflow,with-git/tensorflow,nburn42/tensorflow,petewarden/tensorflow,benoitsteiner/tensorflow-opencl,lukeiwanski/tensorflow,benoitsteiner/tensorflow-opencl,asimshankar/tensorflow,with-git/tensorflow,Xeralux/tensorflow,arborh/tensorflow,ravindrapanda/tensorflow,codrut3/tensorflow,aselle/tensorflow,tensorflow/tensorflow-pywrap_saved_model,asimshankar/tensorflow,alshedivat/tensorflow,JingJunYin/tensorflow,manipopopo/tensorflow,Moriadry/tensorflow,pavelchristof/gomoku-ai,hsaputra/tensorflow,guschmue/tensorflow,allenlavoie/tensorflow,manipopopo/tensorflow,frreiss/tensorflow-fred,allenlavoie/tensorflow,Kongsea/tensorflow,kobejean/tensorflow,annarev/tensorflow,tornadozou/tensorflow,JVillella/tensorflow,adit-chandra/tensorflow,snnn/tensorflow,aam-at/tensorflow,tensorflow/tensorflow,rabipanda/tensorflow,raymondxyang/tensorflow,snnn/tensorflow,dyoung418/tensorflow,Kongsea/tensorflow,xzturn/tensorflow,tensorflow/tensorflow-pywrap_tf_optimizer,davidzchen/tensorflow,yongtang/tensorflow,zasdfgbnm/tensorflow,annarev/tensorflow,ravindrapanda/tensorflow,alsrgv/tensorflow,meteorcloudy/tensorflow,aldian/tensorflow,hsaputra/tensorflow,davidzchen/tensorflow,chemelnucfin/tensorflow,laszlocsomor/tensorflow,caisq/tensorflow,karllessard/tensorflow,karllessard/tensorflow,unsiloai/syntaxnet-ops-hack,chemelnucfin/tensorflow,a-doumoulakis/tensorflow,gunan/tensorflow,ageron/tensorflow,yongtang/tensorflow,alsrgv/tensorflow,jendap/tensorflow,suiyuan2009/tensorflow,xzturn/tensorflow,kevin-coder/tensorflow-fork,Intel-tensorflow/tensorflow,jart/tensorflow,manazhao/tf_recsys,jbedorf/tensorflow,apark263/tensorflow,jhseu/tensorflow,tensorflow/tensorflow-pywrap_saved_model,ageron/tensorflow,tensorflow/tensorflow-pywrap_tf_optimizer,karllessard/tensorflow,jalexvig/tensorflow,renyi533/tensorflow,kobejean/tensorflow,jendap/tensorflow,jhseu/tensorflow,petewarden/tensorflow,freedomtan/tensorflow,drpngx/tensorflow,alshedivat/tensorflow,bowang/tensorflow,chemelnucfin/tensorflow,tensorflow/tensorflow,ravindrapanda/tensorflow,nolanliou/tensorflow,ychfan/tensorflow,dyoung418/tensorflow,tensorflow/tensorflow-experimental_link_static_libraries_once,lukeiwanski/tensorflow,mixturemodel-flow/tensorflow,benoitsteiner/tensorflow-xsmm,Moriadry/tensorflow,paolodedios/tensorflow,hsaputra/tensorflow,unsiloai/syntaxnet-ops-hack,paolodedios/tensorflow,zasdfgbnm/tensorflow,kevin-coder/tensorflow-fork,aselle/tensorflow,unsiloai/syntaxnet-ops-hack,drpngx/tensorflow,pavelchristof/gomoku-ai,girving/tensorflow,av8ramit/tensorflow,AnishShah/tensorflow,seanli9jan/tensorflow,ychfan/tensorflow,snnn/tensorflow,nburn42/tensorflow,DavidNorman/tensorflow,ravindrapanda/tensorflow,arborh/tensorflow,ghchinoy/tensorflow,freedomtan/tensorflow,ghchinoy/tensorflow,ghchinoy/tensorflow,mdrumond/tensorflow,eadgarchen/tensorflow,alistairlow/tensorflow,tensorflow/tensorflow,mixturemodel-flow/tensorflow,jalexvig/tensorflow,horance-liu/tensorflow,annarev/tensorflow,jbedorf/tensorflow,eaplatanios/tensorflow,sarvex/tensorflow,kobejean/tensorflow,rabipanda/tensorflow,karllessard/tensorflow,kevin-coder/tensorflow-fork,maciekcc/tensorflow,bowang/tensorflow,JingJunYin/tensorflow,apark263/tensorflow,a-doumoulakis/tensorflow,adamtiger/tensorflow,tensorflow/tensorflow-pywrap_tf_optimizer,Mazecreator/tensorflow,mavenlin/tensorflow,freedomtan/tensorflow,a-doumoulakis/tensorflow,zasdfgbnm/tensorflow,hfp/tensorflow-xsmm,ghchinoy/tensorflow,ishay2b/tensorflow,xodus7/tensorflow,Xeralux/tensorflow,Intel-Corporation/tensorflow,dongjoon-hyun/tensorflow,meteorcloudy/tensorflow,dendisuhubdy/tensorflow,lakshayg/tensorflow,arborh/tensorflow,jhseu/tensorflow,jwlawson/tensorflow,ishay2b/tensorflow,chemelnucfin/tensorflow,aldian/tensorflow,tensorflow/tensorflow-experimental_link_static_libraries_once,arborh/tensorflow,horance-liu/tensorflow,manazhao/tf_recsys,ychfan/tensorflow,nolanliou/tensorflow,jendap/tensorflow,hfp/tensorflow-xsmm,brchiu/tensorflow,mavenlin/tensorflow,sarvex/tensorflow,nburn42/tensorflow,allenlavoie/tensorflow,Kongsea/tensorflow,eadgarchen/tensorflow,gautam1858/tensorflow,jbedorf/tensorflow,jart/tensorflow,girving/tensorflow,benoitsteiner/tensorflow-xsmm,brchiu/tensorflow,dendisuhubdy/tensorflow,aam-at/tensorflow,tensorflow/tensorflow-pywrap_saved_model,chemelnucfin/tensorflow,ppwwyyxx/tensorflow,brchiu/tensorflow,manipopopo/tensorflow,benoitsteiner/tensorflow-opencl,Intel-Corporation/tensorflow,av8ramit/tensorflow,tillahoffmann/tensorflow,adamtiger/tensorflow,hfp/tensorflow-xsmm,mdrumond/tensorflow,theflofly/tensorflow,meteorcloudy/tensorflow,apark263/tensorflow,guschmue/tensorflow,tensorflow/tensorflow-experimental_link_static_libraries_once,ravindrapanda/tensorflow,apark263/tensorflow,ishay2b/tensorflow,freedomtan/tensorflow,renyi533/tensorflow,DavidNorman/tensorflow,alistairlow/tensorflow,eaplatanios/tensorflow,aselle/tensorflow,with-git/tensorflow,ghchinoy/tensorflow,allenlavoie/tensorflow,xzturn/tensorflow,pavelchristof/gomoku-ai,petewarden/tensorflow,alistairlow/tensorflow,allenlavoie/tensorflow,aselle/tensorflow,chemelnucfin/tensorflow,eaplatanios/tensorflow,ArtsiomCh/tensorflow,cxxgtxy/tensorflow,mavenlin/tensorflow,apark263/tensorflow,ZhangXinNan/tensorflow,theflofly/tensorflow,with-git/tensorflow,tornadozou/tensorflow,raymondxyang/tensorflow,laszlocsomor/tensorflow,dancingdan/tensorflow,tillahoffmann/tensorflow,a-doumoulakis/tensorflow,tensorflow/tensorflow-pywrap_saved_model,benoitsteiner/tensorflow-xsmm,frreiss/tensorflow-fred,jart/tensorflow,paolodedios/tensorflow,girving/tensorflow,nolanliou/tensorflow,kevin-coder/tensorflow-fork,hehongliang/tensorflow,DavidNorman/tensorflow,kobejean/tensorflow,seanli9jan/tensorflow,adit-chandra/tensorflow,alshedivat/tensorflow,caisq/tensorflow,jostep/tensorflow,codrut3/tensorflow,ageron/tensorflow,Bismarrck/tensorflow,zasdfgbnm/tensorflow,jart/tensorflow,manazhao/tf_recsys,jwlawson/tensorflow,dancingdan/tensorflow,adamtiger/tensorflow,ychfan/tensorflow,bowang/tensorflow,caisq/tensorflow,lakshayg/tensorflow,adit-chandra/tensorflow,guschmue/tensorflow,bowang/tensorflow,jhseu/tensorflow,frreiss/tensorflow-fred,dendisuhubdy/tensorflow,manipopopo/tensorflow,alistairlow/tensorflow,davidzchen/tensorflow,alsrgv/tensorflow,JingJunYin/tensorflow,tillahoffmann/tensorflow,gautam1858/tensorflow,jhseu/tensorflow,Xeralux/tensorflow,asimshankar/tensorflow,kobejean/tensorflow,benoitsteiner/tensorflow-opencl,lakshayg/tensorflow,theflofly/tensorflow,ArtsiomCh/tensorflow,chemelnucfin/tensorflow,jbedorf/tensorflow,tensorflow/tensorflow,ychfan/tensorflow,girving/tensorflow,mdrumond/tensorflow,mixturemodel-flow/tensorflow,frreiss/tensorflow-fred,drpngx/tensorflow,xodus7/tensorflow,tensorflow/tensorflow,tensorflow/tensorflow-pywrap_saved_model,Bismarrck/tensorflow,renyi533/tensorflow,nburn42/tensorflow,mixturemodel-flow/tensorflow,eaplatanios/tensorflow,aam-at/tensorflow,jbedorf/tensorflow,ppwwyyxx/tensorflow,Intel-tensorflow/tensorflow,chemelnucfin/tensorflow,rabipanda/tensorflow,ravindrapanda/tensorflow,asimshankar/tensorflow,JingJunYin/tensorflow,alistairlow/tensorflow,lukeiwanski/tensorflow,zasdfgbnm/tensorflow,dongjoon-hyun/tensorflow,asimshankar/tensorflow,hehongliang/tensorflow,karllessard/tensorflow,bowang/tensorflow,Intel-Corporation/tensorflow,xzturn/tensorflow,arborh/tensorflow,frreiss/tensorflow-fred,ArtsiomCh/tensorflow,arborh/tensorflow,tensorflow/tensorflow-pywrap_tf_optimizer,snnn/tensorflow,DavidNorman/tensorflow,ppwwyyxx/tensorflow,jart/tensorflow,gautam1858/tensorflow,manipopopo/tensorflow,jbedorf/tensorflow,AnishShah/tensorflow,paolodedios/tensorflow,gautam1858/tensorflow,frreiss/tensorflow-fred,Kongsea/tensorflow,karllessard/tensorflow,Mazecreator/tensorflow,apark263/tensorflow,theflofly/tensorflow,codrut3/tensorflow,ishay2b/tensorflow,alshedivat/tensorflow,lukeiwanski/tensorflow,jendap/tensorflow,renyi533/tensorflow,annarev/tensorflow,seanli9jan/tensorflow,mdrumond/tensorflow,benoitsteiner/tensorflow-xsmm,ppwwyyxx/tensorflow,jwlawson/tensorflow,adit-chandra/tensorflow,ageron/tensorflow,renyi533/tensorflow,hfp/tensorflow-xsmm,ishay2b/tensorflow,ArtsiomCh/tensorflow,eaplatanios/tensorflow,Mazecreator/tensorflow,davidzchen/tensorflow,tiagofrepereira2012/tensorflow,manipopopo/tensorflow,gojira/tensorflow,gautam1858/tensorflow,nburn42/tensorflow,cxxgtxy/tensorflow,bowang/tensorflow,renyi533/tensorflow,tornadozou/tensorflow,arborh/tensorflow,meteorcloudy/tensorflow,snnn/tensorflow,ppwwyyxx/tensorflow,jalexvig/tensorflow,AnishShah/tensorflow,lakshayg/tensorflow,hfp/tensorflow-xsmm,Kongsea/tensorflow,allenlavoie/tensorflow,horance-liu/tensorflow,gautam1858/tensorflow,Bismarrck/tensorflow,asimshankar/tensorflow,suiyuan2009/tensorflow,dendisuhubdy/tensorflow,jart/tensorflow,DavidNorman/tensorflow,dyoung418/tensorflow,kevin-coder/tensorflow-fork,renyi533/tensorflow,adamtiger/tensorflow,frreiss/tensorflow-fred,pavelchristof/gomoku-ai,freedomtan/tensorflow,eadgarchen/tensorflow,maciekcc/tensorflow,gautam1858/tensorflow,ppwwyyxx/tensorflow,girving/tensorflow,Xeralux/tensorflow,xzturn/tensorflow,av8ramit/tensorflow,benoitsteiner/tensorflow-xsmm,ghchinoy/tensorflow,aselle/tensorflow,nolanliou/tensorflow,allenlavoie/tensorflow,xodus7/tensorflow,tensorflow/tensorflow-pywrap_saved_model,aam-at/tensorflow,jwlawson/tensorflow,kobejean/tensorflow,alivecor/tensorflow,adit-chandra/tensorflow,codrut3/tensorflow,dongjoon-hyun/tensorflow,ZhangXinNan/tensorflow,theflofly/tensorflow,manipopopo/tensorflow,caisq/tensorflow,ghchinoy/tensorflow
|
f3b50d7749a7d754bfc87b1e1ae857a203908eb5
|
test/integration_tests/src/prepared_outage.cpp
|
test/integration_tests/src/prepared_outage.cpp
|
/*
Copyright (c) 2014 DataStax
Licensed 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.
*/
#define BOOST_TEST_DYN_LINK
#ifdef STAND_ALONE
# define BOOST_TEST_MODULE cassandra
#endif
#include <algorithm>
#include <boost/test/unit_test.hpp>
#include <boost/test/debug.hpp>
#include <boost/lexical_cast.hpp>
#include <boost/cstdint.hpp>
#include <boost/format.hpp>
#include <boost/thread.hpp>
#include <boost/chrono.hpp>
#include "cql_ccm_bridge.hpp"
#include "cassandra.h"
#include "test_utils.hpp"
struct PreparedOutageTests : public test_utils::SingleSessionTest {
PreparedOutageTests() : SingleSessionTest(3, 0) {
cass_cluster_set_log_level(cluster, CASS_LOG_DEBUG);
test_utils::execute_query(session, str(boost::format(test_utils::CREATE_KEYSPACE_SIMPLE_FORMAT)
% test_utils::SIMPLE_KEYSPACE % "2"));
test_utils::execute_query(session, str(boost::format("USE %s") % test_utils::SIMPLE_KEYSPACE));
}
};
BOOST_FIXTURE_TEST_SUITE(prepared_outage, PreparedOutageTests)
BOOST_AUTO_TEST_CASE(test_reprepared_on_new_node)
{
std::string table_name = "test";
test_utils::execute_query(session, str(boost::format("CREATE TABLE %s (key text PRIMARY KEY, value int);") % table_name));
std::string insert_query = "INSERT INTO %s (key, value) VALUES ('%s', %d);";
test_utils::execute_query(session, str(boost::format(insert_query) % table_name % "123" % 17));
test_utils::execute_query(session, str(boost::format(insert_query) % table_name % "456" % 18));
std::string select_query = str(boost::format("SELECT * FROM %s WHERE key = ?;") % table_name);
test_utils::CassFuturePtr prepared_future(cass_session_prepare(session,
cass_string_init2(select_query.data(), select_query.size())));
test_utils::wait_and_check_error(prepared_future.get());
test_utils::CassPreparedPtr prepared(cass_future_get_prepared(prepared_future.get()));
{
test_utils::CassStatementPtr statement(cass_prepared_bind(prepared.get()));
BOOST_REQUIRE(cass_statement_bind_string(statement.get(), 0, cass_string_init("123")) == CASS_OK);
test_utils::CassFuturePtr future(cass_session_execute(session, statement.get()));
test_utils::wait_and_check_error(future.get());
test_utils::CassResultPtr result(cass_future_get_result(future.get()));
BOOST_REQUIRE(cass_result_row_count(result.get()) == 1);
BOOST_REQUIRE(cass_result_column_count(result.get()) == 2);
const CassRow* row = cass_result_first_row(result.get());
cass_int32_t result_value;
BOOST_REQUIRE(cass_value_get_int32(cass_row_get_column(row, 1), &result_value) == CASS_OK);
BOOST_REQUIRE(result_value == 17);
}
ccm->stop(1);
ccm->start(1);
ccm->stop(2);
for(int i = 0; i < 10; ++i){
test_utils::CassStatementPtr statement(cass_prepared_bind(prepared.get()));
BOOST_REQUIRE(cass_statement_bind_string(statement.get(), 0, cass_string_init("456")) == CASS_OK);
test_utils::CassFuturePtr future(cass_session_execute(session, statement.get()));
test_utils::wait_and_check_error(future.get());
test_utils::CassResultPtr result(cass_future_get_result(future.get()));
BOOST_REQUIRE(cass_result_row_count(result.get()) == 1);
BOOST_REQUIRE(cass_result_column_count(result.get()) == 2);
const CassRow* row = cass_result_first_row(result.get());
cass_int32_t result_value;
BOOST_REQUIRE(cass_value_get_int32(cass_row_get_column(row, 1), &result_value) == CASS_OK);
BOOST_REQUIRE(result_value == 18);
}
test_utils::execute_query(session, str(boost::format(insert_query) % table_name % "789" % 19));
ccm->start(2);
ccm->gossip(1, false);
for(int i = 0; i < 10; ++i){
test_utils::CassStatementPtr statement(cass_prepared_bind(prepared.get()));
BOOST_REQUIRE(cass_statement_bind_string(statement.get(), 0, cass_string_init("789")) == CASS_OK);
test_utils::CassFuturePtr future(cass_session_execute(session, statement.get()));
test_utils::wait_and_check_error(future.get());
test_utils::CassResultPtr result(cass_future_get_result(future.get()));
BOOST_REQUIRE(cass_result_row_count(result.get()) == 1);
BOOST_REQUIRE(cass_result_column_count(result.get()) == 2);
const CassRow* row = cass_result_first_row(result.get());
cass_int32_t result_value;
BOOST_REQUIRE(cass_value_get_int32(cass_row_get_column(row, 1), &result_value) == CASS_OK);
BOOST_REQUIRE(result_value == 19);
}
ccm->gossip(1, true);
ccm->binary(2, false);
ccm->binary(1, false);
//Ensure the binary protocol is disabled before executing the inserts
boost::this_thread::sleep_for(boost::chrono::seconds(5));
test_utils::execute_query(session, str(boost::format(insert_query) % table_name % "123456789" % 20));
ccm->binary(2, true);
for(int i = 0; i < 10; ++i){
test_utils::CassStatementPtr statement(cass_prepared_bind(prepared.get()));
BOOST_REQUIRE(cass_statement_bind_string(statement.get(), 0, cass_string_init("123456789")) == CASS_OK);
test_utils::CassFuturePtr future(cass_session_execute(session, statement.get()));
test_utils::wait_and_check_error(future.get());
test_utils::CassResultPtr result(cass_future_get_result(future.get()));
BOOST_REQUIRE(cass_result_row_count(result.get()) == 1);
BOOST_REQUIRE(cass_result_column_count(result.get()) == 2);
const CassRow* row = cass_result_first_row(result.get());
cass_int32_t result_value;
BOOST_REQUIRE(cass_value_get_int32(cass_row_get_column(row, 1), &result_value) == CASS_OK);
BOOST_REQUIRE(result_value == 20);
}
}
BOOST_AUTO_TEST_SUITE_END()
|
/*
Copyright (c) 2014 DataStax
Licensed 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.
*/
#define BOOST_TEST_DYN_LINK
#ifdef STAND_ALONE
# define BOOST_TEST_MODULE cassandra
#endif
#include <algorithm>
#include <boost/test/unit_test.hpp>
#include <boost/test/debug.hpp>
#include <boost/lexical_cast.hpp>
#include <boost/cstdint.hpp>
#include <boost/format.hpp>
#include <boost/thread.hpp>
#include <boost/chrono.hpp>
#include "cql_ccm_bridge.hpp"
#include "cassandra.h"
#include "test_utils.hpp"
struct PreparedOutageTests : public test_utils::SingleSessionTest {
PreparedOutageTests() : SingleSessionTest(3, 0) {
cass_cluster_set_log_level(cluster, CASS_LOG_DEBUG);
test_utils::execute_query(session, str(boost::format(test_utils::CREATE_KEYSPACE_SIMPLE_FORMAT)
% test_utils::SIMPLE_KEYSPACE % "2"));
test_utils::execute_query(session, str(boost::format("USE %s") % test_utils::SIMPLE_KEYSPACE));
}
};
BOOST_FIXTURE_TEST_SUITE(prepared_outage, PreparedOutageTests)
BOOST_AUTO_TEST_CASE(test_reprepared_on_new_node)
{
std::string table_name = "test";
test_utils::execute_query(session, str(boost::format("CREATE TABLE %s (key text PRIMARY KEY, value int);") % table_name));
std::string insert_query = "INSERT INTO %s (key, value) VALUES ('%s', %d);";
test_utils::execute_query(session, str(boost::format(insert_query) % table_name % "123" % 17));
test_utils::execute_query(session, str(boost::format(insert_query) % table_name % "456" % 18));
std::string select_query = str(boost::format("SELECT * FROM %s WHERE key = ?;") % table_name);
test_utils::CassFuturePtr prepared_future(cass_session_prepare(session,
cass_string_init2(select_query.data(), select_query.size())));
test_utils::wait_and_check_error(prepared_future.get());
test_utils::CassPreparedPtr prepared(cass_future_get_prepared(prepared_future.get()));
{
test_utils::CassStatementPtr statement(cass_prepared_bind(prepared.get()));
BOOST_REQUIRE(cass_statement_bind_string(statement.get(), 0, cass_string_init("123")) == CASS_OK);
test_utils::CassFuturePtr future(cass_session_execute(session, statement.get()));
test_utils::wait_and_check_error(future.get());
test_utils::CassResultPtr result(cass_future_get_result(future.get()));
BOOST_REQUIRE(cass_result_row_count(result.get()) == 1);
BOOST_REQUIRE(cass_result_column_count(result.get()) == 2);
const CassRow* row = cass_result_first_row(result.get());
cass_int32_t result_value;
BOOST_REQUIRE(cass_value_get_int32(cass_row_get_column(row, 1), &result_value) == CASS_OK);
BOOST_REQUIRE(result_value == 17);
}
ccm->stop(1);
ccm->start(1);
ccm->stop(2);
for (int i = 0; i < 10; ++i){
test_utils::CassStatementPtr statement(cass_prepared_bind(prepared.get()));
BOOST_REQUIRE(cass_statement_bind_string(statement.get(), 0, cass_string_init("456")) == CASS_OK);
test_utils::CassFuturePtr future(cass_session_execute(session, statement.get()));
test_utils::wait_and_check_error(future.get());
test_utils::CassResultPtr result(cass_future_get_result(future.get()));
BOOST_REQUIRE(cass_result_row_count(result.get()) == 1);
BOOST_REQUIRE(cass_result_column_count(result.get()) == 2);
const CassRow* row = cass_result_first_row(result.get());
cass_int32_t result_value;
BOOST_REQUIRE(cass_value_get_int32(cass_row_get_column(row, 1), &result_value) == CASS_OK);
BOOST_REQUIRE(result_value == 18);
}
test_utils::execute_query(session, str(boost::format(insert_query) % table_name % "789" % 19));
ccm->start(2);
ccm->gossip(1, false);
for (int i = 0; i < 10; ++i){
test_utils::CassStatementPtr statement(cass_prepared_bind(prepared.get()));
BOOST_REQUIRE(cass_statement_bind_string(statement.get(), 0, cass_string_init("789")) == CASS_OK);
test_utils::CassFuturePtr future(cass_session_execute(session, statement.get()));
test_utils::wait_and_check_error(future.get());
test_utils::CassResultPtr result(cass_future_get_result(future.get()));
BOOST_REQUIRE(cass_result_row_count(result.get()) == 1);
BOOST_REQUIRE(cass_result_column_count(result.get()) == 2);
const CassRow* row = cass_result_first_row(result.get());
cass_int32_t result_value;
BOOST_REQUIRE(cass_value_get_int32(cass_row_get_column(row, 1), &result_value) == CASS_OK);
BOOST_REQUIRE(result_value == 19);
}
ccm->gossip(1, true);
ccm->binary(2, false);
ccm->binary(1, false);
//Ensure the binary protocol is disabled before executing the inserts
boost::this_thread::sleep_for(boost::chrono::seconds(5));
test_utils::execute_query(session, str(boost::format(insert_query) % table_name % "123456789" % 20));
ccm->binary(2, true);
for (int i = 0; i < 10; ++i){
test_utils::CassStatementPtr statement(cass_prepared_bind(prepared.get()));
BOOST_REQUIRE(cass_statement_bind_string(statement.get(), 0, cass_string_init("123456789")) == CASS_OK);
test_utils::CassFuturePtr future(cass_session_execute(session, statement.get()));
test_utils::wait_and_check_error(future.get());
test_utils::CassResultPtr result(cass_future_get_result(future.get()));
BOOST_REQUIRE(cass_result_row_count(result.get()) == 1);
BOOST_REQUIRE(cass_result_column_count(result.get()) == 2);
const CassRow* row = cass_result_first_row(result.get());
cass_int32_t result_value;
BOOST_REQUIRE(cass_value_get_int32(cass_row_get_column(row, 1), &result_value) == CASS_OK);
BOOST_REQUIRE(result_value == 20);
}
}
BOOST_AUTO_TEST_SUITE_END()
|
Update prepared_outage.cpp
|
Update prepared_outage.cpp
|
C++
|
apache-2.0
|
mikefero/cpp-driver,tempbottle/cpp-driver,mikefero/cpp-driver,zhangpng/cpp-driver,zhangpng/cpp-driver,hpcc-systems/cpp-driver,hpcc-systems/cpp-driver,datastax/cpp-driver,Teino1978-Corp/cpp-driver,flightaware/cpp-driver,flightaware/cpp-driver,flightaware/cpp-driver,tempbottle/cpp-driver,tempbottle/cpp-driver,hpcc-systems/cpp-driver,mpenick/cpp-driver,tempbottle/cpp-driver,datastax/cpp-driver,zhangpng/cpp-driver,hpcc-systems/cpp-driver,mpenick/cpp-driver,mpenick/cpp-driver,mikefero/cpp-driver,datastax/cpp-driver,Teino1978-Corp/cpp-driver,zhangpng/cpp-driver,mpenick/cpp-driver,datastax/cpp-driver,Teino1978-Corp/cpp-driver,flightaware/cpp-driver,mikefero/cpp-driver,mikefero/cpp-driver,Teino1978-Corp/cpp-driver
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.