text
stringlengths 54
60.6k
|
|---|
<commit_before>/*
* Copyright (c) 2011-2013 Stephen Williams (steve@icarus.com)
* Copyright CERN 2015
* @author Maciej Suminski (maciej.suminski@cern.ch)
*
* This source code is free software; you can redistribute it
* and/or modify it in source code form 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
# include "expression.h"
# include "architec.h"
# include <ivl_assert.h>
# include <limits>
# include <cmath>
bool Expression::evaluate(ScopeBase*, int64_t&) const
{
return false;
}
bool Expression::evaluate(Entity*, ScopeBase*scope, int64_t&val) const
{
return evaluate(scope, val);
}
bool ExpArithmetic::evaluate(ScopeBase*scope, int64_t&val) const
{
int64_t val1, val2;
bool rc;
rc = eval_operand1(scope, val1);
if (rc == false)
return false;
rc = eval_operand2(scope, val2);
if (rc == false)
return false;
switch (fun_) {
case PLUS:
val = val1 + val2;
break;
case MINUS:
val = val1 - val2;
break;
case MULT:
val = val1 * val2;
break;
case DIV:
if (val2 == 0)
return false;
val = val1 / val2;
break;
case MOD:
if (val2 == 0)
return false;
val = val1 % val2;
break;
case REM:
if (val2 == 0)
return false;
val = val1 - (val1 / val2) * val2;
return false;
case POW:
val = (int64_t) pow(val1, val2);
break;
case xCONCAT: // not possible
return false;
}
return true;
}
bool ExpAttribute::evaluate(ScopeBase*scope, int64_t&val) const
{
/* Special Case: The array attributes can sometimes be calculated all
the down to a literal integer at compile time, and all it
needs is the type of the base expression. (The base
expression doesn't even need to be evaluated.) */
if (name_ == "length" || name_ == "right" || name_ == "left") {
const VType*base_type = base_->peek_type();
if(!base_type) {
const ExpName*name = NULL;
if(scope && (name = dynamic_cast<const ExpName*>(base_))) {
const perm_string& n = name->peek_name();
if(const Variable*var = scope->find_variable(n))
base_type = var->peek_type();
else if(const Signal*sig = scope->find_signal(n))
base_type = sig->peek_type();
else if(const InterfacePort*port = scope->find_param(n))
base_type = port->type;
}
}
if(!base_type)
return false; // I tried really hard, sorry
const VTypeArray*arr = dynamic_cast<const VTypeArray*>(base_type);
if (arr == 0) {
cerr << endl << get_fileline() << ": error: "
<< "Cannot apply the '" << name_ << " attribute to non-array objects"
<< endl;
ivl_assert(*this, false);
return false;
}
if(name_ == "length") {
int64_t size = arr->get_width(scope);
if(size > 0)
val = size;
else
return false;
} else if(name_ == "left") {
arr->dimension(0).msb()->evaluate(scope, val);
} else if(name_ == "right") {
arr->dimension(0).lsb()->evaluate(scope, val);
} else ivl_assert(*this, false);
return true;
}
return false;
}
bool ExpAttribute::evaluate(Entity*ent, ScopeBase*scope, int64_t&val) const
{
if (!ent || !scope) { // it's impossible to evaluate, probably it is inside a subprogram
return false;
}
if (name_ == "left" || name_ == "right") {
const VType*base_type = base_->peek_type();
if (base_type == 0)
base_type = base_->probe_type(ent, scope);
ivl_assert(*this, base_type);
const VTypeArray*arr = dynamic_cast<const VTypeArray*>(base_type);
if (arr == 0) {
cerr << endl << get_fileline() << ": error: "
<< "Cannot apply the '" << name_
<< " attribute to non-array objects" << endl;
ivl_assert(*this, false);
return false;
}
ivl_assert(*this, arr->dimensions() == 1);
if(name_ == "left")
arr->dimension(0).msb()->evaluate(ent, scope, val);
else // "right"
arr->dimension(0).lsb()->evaluate(ent, scope, val);
return true;
}
return evaluate(scope, val);
}
/*
* I don't yet know how to evaluate concatenations. It is not likely
* to come up anyhow.
*/
bool ExpConcat::evaluate(ScopeBase*, int64_t&) const
{
return false;
}
bool ExpName::evaluate(ScopeBase*scope, int64_t&val) const
{
const VType*type;
Expression*exp;
if (prefix_.get()) {
cerr << get_fileline() << ": sorry: I don't know how to evaluate ExpName prefix parts." << endl;
return false;
}
if (!scope)
return false;
if (!scope->find_constant(name_, type, exp))
return false;
return exp->evaluate(scope, val);
}
bool ExpName::evaluate(Entity*ent, ScopeBase*scope, int64_t&val) const
{
if (prefix_.get()) {
cerr << get_fileline() << ": sorry: I don't know how to evaluate ExpName prefix parts." << endl;
return false;
}
const InterfacePort*gen = ent->find_generic(name_);
if (gen) {
cerr << get_fileline() << ": sorry: I don't necessarily handle generic overrides." << endl;
// Evaluate the default expression and use that.
if (gen->expr)
return gen->expr->evaluate(ent, scope, val);
}
return evaluate(scope, val);
}
bool ExpShift::evaluate(ScopeBase*scope, int64_t&val) const
{
int64_t val1, val2;
bool rc;
rc = eval_operand1(scope, val1);
if (rc == false)
return false;
rc = eval_operand2(scope, val2);
if (rc == false)
return false;
switch (shift_) {
case SRL:
val = (uint64_t)val1 >> (uint64_t)val2;
break;
case SLL:
val = (uint64_t)val1 << (uint64_t)val2;
break;
case SRA:
val = (int64_t)val1 >> (int64_t)val2;
break;
case SLA:
val = (int64_t)val1 << (int64_t)val2;
break;
case ROR:
case ROL:
return false;
}
return true;
}
bool ExpTime::evaluate(ScopeBase*, int64_t&val) const
{
double v = to_fs();
if(v > std::numeric_limits<int64_t>::max()) {
val = std::numeric_limits<int64_t>::max();
cerr << get_fileline() << ": sorry: Time value is higher than the "
<< "handled limit, reduced to " << val << " fs." << endl;
}
val = v;
return true;
}
bool ExpTime::evaluate(Entity*, ScopeBase*, int64_t&val) const
{
return evaluate(NULL, NULL, val);
}
<commit_msg>vhdlpp: Fixed infinite recursion when evaluating ExpTime.<commit_after>/*
* Copyright (c) 2011-2013 Stephen Williams (steve@icarus.com)
* Copyright CERN 2015
* @author Maciej Suminski (maciej.suminski@cern.ch)
*
* This source code is free software; you can redistribute it
* and/or modify it in source code form 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
# include "expression.h"
# include "architec.h"
# include <ivl_assert.h>
# include <limits>
# include <cmath>
bool Expression::evaluate(ScopeBase*, int64_t&) const
{
return false;
}
bool Expression::evaluate(Entity*, ScopeBase*scope, int64_t&val) const
{
return evaluate(scope, val);
}
bool ExpArithmetic::evaluate(ScopeBase*scope, int64_t&val) const
{
int64_t val1, val2;
bool rc;
rc = eval_operand1(scope, val1);
if (rc == false)
return false;
rc = eval_operand2(scope, val2);
if (rc == false)
return false;
switch (fun_) {
case PLUS:
val = val1 + val2;
break;
case MINUS:
val = val1 - val2;
break;
case MULT:
val = val1 * val2;
break;
case DIV:
if (val2 == 0)
return false;
val = val1 / val2;
break;
case MOD:
if (val2 == 0)
return false;
val = val1 % val2;
break;
case REM:
if (val2 == 0)
return false;
val = val1 - (val1 / val2) * val2;
return false;
case POW:
val = (int64_t) pow(val1, val2);
break;
case xCONCAT: // not possible
return false;
}
return true;
}
bool ExpAttribute::evaluate(ScopeBase*scope, int64_t&val) const
{
/* Special Case: The array attributes can sometimes be calculated all
the down to a literal integer at compile time, and all it
needs is the type of the base expression. (The base
expression doesn't even need to be evaluated.) */
if (name_ == "length" || name_ == "right" || name_ == "left") {
const VType*base_type = base_->peek_type();
if(!base_type) {
const ExpName*name = NULL;
if(scope && (name = dynamic_cast<const ExpName*>(base_))) {
const perm_string& n = name->peek_name();
if(const Variable*var = scope->find_variable(n))
base_type = var->peek_type();
else if(const Signal*sig = scope->find_signal(n))
base_type = sig->peek_type();
else if(const InterfacePort*port = scope->find_param(n))
base_type = port->type;
}
}
if(!base_type)
return false; // I tried really hard, sorry
const VTypeArray*arr = dynamic_cast<const VTypeArray*>(base_type);
if (arr == 0) {
cerr << endl << get_fileline() << ": error: "
<< "Cannot apply the '" << name_ << " attribute to non-array objects"
<< endl;
ivl_assert(*this, false);
return false;
}
if(name_ == "length") {
int64_t size = arr->get_width(scope);
if(size > 0)
val = size;
else
return false;
} else if(name_ == "left") {
arr->dimension(0).msb()->evaluate(scope, val);
} else if(name_ == "right") {
arr->dimension(0).lsb()->evaluate(scope, val);
} else ivl_assert(*this, false);
return true;
}
return false;
}
bool ExpAttribute::evaluate(Entity*ent, ScopeBase*scope, int64_t&val) const
{
if (!ent || !scope) { // it's impossible to evaluate, probably it is inside a subprogram
return false;
}
if (name_ == "left" || name_ == "right") {
const VType*base_type = base_->peek_type();
if (base_type == 0)
base_type = base_->probe_type(ent, scope);
ivl_assert(*this, base_type);
const VTypeArray*arr = dynamic_cast<const VTypeArray*>(base_type);
if (arr == 0) {
cerr << endl << get_fileline() << ": error: "
<< "Cannot apply the '" << name_
<< " attribute to non-array objects" << endl;
ivl_assert(*this, false);
return false;
}
ivl_assert(*this, arr->dimensions() == 1);
if(name_ == "left")
arr->dimension(0).msb()->evaluate(ent, scope, val);
else // "right"
arr->dimension(0).lsb()->evaluate(ent, scope, val);
return true;
}
return evaluate(scope, val);
}
/*
* I don't yet know how to evaluate concatenations. It is not likely
* to come up anyhow.
*/
bool ExpConcat::evaluate(ScopeBase*, int64_t&) const
{
return false;
}
bool ExpName::evaluate(ScopeBase*scope, int64_t&val) const
{
const VType*type;
Expression*exp;
if (prefix_.get()) {
cerr << get_fileline() << ": sorry: I don't know how to evaluate ExpName prefix parts." << endl;
return false;
}
if (!scope)
return false;
if (!scope->find_constant(name_, type, exp))
return false;
return exp->evaluate(scope, val);
}
bool ExpName::evaluate(Entity*ent, ScopeBase*scope, int64_t&val) const
{
if (prefix_.get()) {
cerr << get_fileline() << ": sorry: I don't know how to evaluate ExpName prefix parts." << endl;
return false;
}
const InterfacePort*gen = ent->find_generic(name_);
if (gen) {
cerr << get_fileline() << ": sorry: I don't necessarily handle generic overrides." << endl;
// Evaluate the default expression and use that.
if (gen->expr)
return gen->expr->evaluate(ent, scope, val);
}
return evaluate(scope, val);
}
bool ExpShift::evaluate(ScopeBase*scope, int64_t&val) const
{
int64_t val1, val2;
bool rc;
rc = eval_operand1(scope, val1);
if (rc == false)
return false;
rc = eval_operand2(scope, val2);
if (rc == false)
return false;
switch (shift_) {
case SRL:
val = (uint64_t)val1 >> (uint64_t)val2;
break;
case SLL:
val = (uint64_t)val1 << (uint64_t)val2;
break;
case SRA:
val = (int64_t)val1 >> (int64_t)val2;
break;
case SLA:
val = (int64_t)val1 << (int64_t)val2;
break;
case ROR:
case ROL:
return false;
}
return true;
}
bool ExpTime::evaluate(ScopeBase*, int64_t&val) const
{
double v = to_fs();
if(v > std::numeric_limits<int64_t>::max()) {
val = std::numeric_limits<int64_t>::max();
cerr << get_fileline() << ": sorry: Time value is higher than the "
<< "handled limit, reduced to " << val << " fs." << endl;
}
val = v;
return true;
}
bool ExpTime::evaluate(Entity*, ScopeBase*, int64_t&val) const
{
return evaluate(NULL, val);
}
<|endoftext|>
|
<commit_before>/*
* Copyright (c) 2013 The WebRTC project authors. All Rights Reserved.
*
* Use of this source code is governed by a BSD-style license
* that can be found in the LICENSE file in the root of the source
* tree. An additional intellectual property rights grant can be found
* in the file PATENTS. All contributing project authors may
* be found in the AUTHORS file in the root of the source tree.
*/
#include "testing/gtest/include/gtest/gtest.h"
#include <iostream>
#include <map>
#include "webrtc/typedefs.h"
#include "webrtc/video_engine/new_include/video_engine.h"
#include "webrtc/video_engine/test/common/direct_transport.h"
#include "webrtc/video_engine/test/common/generate_ssrcs.h"
#include "webrtc/video_engine/test/common/video_capturer.h"
#include "webrtc/video_engine/test/common/video_renderer.h"
namespace webrtc {
class LoopbackTest : public ::testing::Test {
protected:
std::map<uint32_t, bool> reserved_ssrcs;
};
TEST_F(LoopbackTest, Test) {
test::VideoRenderer* local_preview =
test::VideoRenderer::Create("Local Preview");
test::VideoRenderer* loopback_video =
test::VideoRenderer::Create("Loopback Video");
newapi::VideoEngine* video_engine =
newapi::VideoEngine::Create(webrtc::newapi::VideoEngineConfig());
test::DirectTransport transport(NULL);
newapi::VideoCall* call = video_engine->CreateCall(&transport);
// Loopback, call sends to itself.
transport.SetReceiver(call->Receiver());
newapi::VideoSendStreamConfig send_config;
call->GetDefaultSendConfig(&send_config);
test::GenerateRandomSsrcs(&send_config, &reserved_ssrcs);
send_config.local_renderer = local_preview;
// TODO(pbos): Should be specified by command-line parameters. And not even
// visible in the test. Break it out to some get-test-defaults
// class
send_config.codec.width = 640;
send_config.codec.height = 480;
send_config.codec.minBitrate = 1000;
send_config.codec.startBitrate = 1500;
send_config.codec.maxBitrate = 2000;
newapi::VideoSendStream* send_stream = call->CreateSendStream(send_config);
test::VideoCapturer* camera =
test::VideoCapturer::Create(send_stream->Input());
newapi::VideoReceiveStreamConfig receive_config;
call->GetDefaultReceiveConfig(&receive_config);
receive_config.rtp.ssrc = send_config.rtp.ssrcs[0];
receive_config.renderer = loopback_video;
newapi::VideoReceiveStream* receive_stream =
call->CreateReceiveStream(receive_config);
receive_stream->StartReceive();
send_stream->StartSend();
camera->Start();
// TODO(pbos): Run this time limited (optionally), so it can run automated.
std::cout << ">> Press ENTER to continue..." << std::endl;
std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n');
receive_stream->StopReceive();
send_stream->StopSend();
// Stop sending
delete camera;
call->DestroyReceiveStream(receive_stream);
call->DestroySendStream(send_stream);
delete call;
delete video_engine;
delete loopback_video;
delete local_preview;
}
} // webrtc
int main(int argc, char* argv[]) {
::testing::InitGoogleTest(&argc, argv);
return RUN_ALL_TESTS();
}
<commit_msg>Remove <iostream> usage from loopback.cc<commit_after>/*
* Copyright (c) 2013 The WebRTC project authors. All Rights Reserved.
*
* Use of this source code is governed by a BSD-style license
* that can be found in the LICENSE file in the root of the source
* tree. An additional intellectual property rights grant can be found
* in the file PATENTS. All contributing project authors may
* be found in the AUTHORS file in the root of the source tree.
*/
#include "testing/gtest/include/gtest/gtest.h"
#include <cstdio>
#include <map>
#include "webrtc/typedefs.h"
#include "webrtc/video_engine/new_include/video_engine.h"
#include "webrtc/video_engine/test/common/direct_transport.h"
#include "webrtc/video_engine/test/common/generate_ssrcs.h"
#include "webrtc/video_engine/test/common/video_capturer.h"
#include "webrtc/video_engine/test/common/video_renderer.h"
namespace webrtc {
class LoopbackTest : public ::testing::Test {
protected:
std::map<uint32_t, bool> reserved_ssrcs;
};
TEST_F(LoopbackTest, Test) {
test::VideoRenderer* local_preview =
test::VideoRenderer::Create("Local Preview");
test::VideoRenderer* loopback_video =
test::VideoRenderer::Create("Loopback Video");
newapi::VideoEngine* video_engine =
newapi::VideoEngine::Create(webrtc::newapi::VideoEngineConfig());
test::DirectTransport transport(NULL);
newapi::VideoCall* call = video_engine->CreateCall(&transport);
// Loopback, call sends to itself.
transport.SetReceiver(call->Receiver());
newapi::VideoSendStreamConfig send_config;
call->GetDefaultSendConfig(&send_config);
test::GenerateRandomSsrcs(&send_config, &reserved_ssrcs);
send_config.local_renderer = local_preview;
// TODO(pbos): Should be specified by command-line parameters. And not even
// visible in the test. Break it out to some get-test-defaults
// class
send_config.codec.width = 640;
send_config.codec.height = 480;
send_config.codec.minBitrate = 1000;
send_config.codec.startBitrate = 1500;
send_config.codec.maxBitrate = 2000;
newapi::VideoSendStream* send_stream = call->CreateSendStream(send_config);
test::VideoCapturer* camera =
test::VideoCapturer::Create(send_stream->Input());
newapi::VideoReceiveStreamConfig receive_config;
call->GetDefaultReceiveConfig(&receive_config);
receive_config.rtp.ssrc = send_config.rtp.ssrcs[0];
receive_config.renderer = loopback_video;
newapi::VideoReceiveStream* receive_stream =
call->CreateReceiveStream(receive_config);
receive_stream->StartReceive();
send_stream->StartSend();
camera->Start();
// TODO(pbos): Run this time limited (optionally), so it can run automated.
puts(">> Press ENTER to continue...");
while (getchar() != '\n' && !feof(stdin));
receive_stream->StopReceive();
send_stream->StopSend();
// Stop sending
delete camera;
call->DestroyReceiveStream(receive_stream);
call->DestroySendStream(send_stream);
delete call;
delete video_engine;
delete loopback_video;
delete local_preview;
}
} // webrtc
int main(int argc, char* argv[]) {
::testing::InitGoogleTest(&argc, argv);
return RUN_ALL_TESTS();
}
<|endoftext|>
|
<commit_before>//*****************************************************************************
//
// exosite.cpp - Prototypes for the Exosite Cloud API
//
// Copyright (c) 2012 Exosite LLC. 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 Exosite LLC 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 "AS IS" AND WITH ALL FAULTS.
// NO WARRANTIES, WHETHER EXPRESS, IMPLIED OR STATUTORY, INCLUDING, BUT
// NOT LIMITED TO, IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE APPLY TO THIS SOFTWARE. TI SHALL NOT, UNDER ANY
// CIRCUMSTANCES, BE LIABLE FOR SPECIAL, INCIDENTAL, OR CONSEQUENTIAL
// DAMAGES, FOR ANY REASON WHATSOEVER.
//
//*****************************************************************************
#include <SPI.h>
#include "Exosite.h"
#include <Ethernet.h>
#include <EthernetClient.h>
#define serverName "m2.exosite.com"
/*==============================================================================
* Exosite
*
* constructor for Exosite class
*=============================================================================*/
Exosite::Exosite(EthernetClass *eth, byte* _mac, String _cik)
{
ethernet = eth;
mac = _mac;
cik = _cik;
}
/*==============================================================================
* init
*
* initialization function for Exosite class.
*=============================================================================*/
void Exosite::init(void)
{
ethernet->begin(mac);
delay(500);
this->client = new EthernetClient();
}
/*==============================================================================
* sendToCloud
*
* send data to cloud
*=============================================================================*/
int Exosite::sendToCloud(String res, int value){
int readCount = 0;
int writeCount = 1;
char* readAliases[1];
char* readValues[1];
char* writeAliases[1];
char* writeValues[1];
writeAliases[0] = (char*)malloc(sizeof(char) * 32);
writeValues[0] = (char*)malloc(sizeof(char) * 32);
if(writeAliases[0] == 0 || writeValues[0] == 0){
if(writeAliases[0] != 0){
free(writeAliases[0]);
}
Serial.println(F("Not enough memory!"));
return 0;
}
res.toCharArray(writeAliases[0], 32);
if(this->readWrite(writeAliases, writeValues, writeCount, readAliases, readValues, readCount)){
free(writeAliases[0]);
free(writeValues[0]);
return 1;
}else{
Serial.println(F("Error Communicating with Exosite (Write)"));
}
free(writeAliases[0]);
free(writeValues[0]);
return 0;
}
/*==============================================================================
* readFromCloud
*
* read data from cloud
*=============================================================================*/
int Exosite::readFromCloud(String res ,String* pResult){
int readCount = 1;
int writeCount = 0;
char* readAliases[1];
char* readValues[1];
char* writeAliases[1];
char* writeValues[1];
readAliases[0] = (char*)malloc(sizeof(char) * 32);
readValues[0] = (char*)malloc(sizeof(char) * 32);
if(readAliases[0] == 0 || readValues[0] == 0){
if(readAliases[0] != 0){
free(readAliases);
}
Serial.println(F("Not enough memory!"));
return 0;
}
res.toCharArray(readAliases[0], 32);
if(this->readWrite(writeAliases, writeValues, writeCount, readAliases, readValues, readCount)){
*pResult = String(readValues[0]);
free(readAliases[0]);
free(readValues[0]);
return 1;
}else{
Serial.println(F("Error Communicating with Exosite (Read)"));
}
free(readAliases[0]);
free(readValues[0]);
return 0;
}
/*==============================================================================
* readWrite
*
* One step Read and Write to Cloud
*=============================================================================*/
boolean Exosite::readWrite(char* writeAliases[], char* writeValues[], int& writeCount, char* readAliases[], char* readValues[], int& readCount){
ret = false;
stringPos = 0;
DataRx= false;
RxLoop = true;
timeout_time = 0;
time_now = 0;
timeout = 3000; // 3 seconds
aliasList[0] = '\0';
dataList[0] = '\0';
varPtr = aliasList;
for(int i = 0; i < readCount; i++){
strcat(aliasList, readAliases[i]);
if(i != readCount-1){
strcat(aliasList, "&");
}
}
readCount = 0;
for(int i = 0; i < writeCount; i++){
strcat(dataList, writeAliases[i]);
strcat(dataList, "=");
strcat(dataList, writeValues[i]);
if(i != writeCount-1){
strcat(dataList, "&");
}
}
delay(2000);
if (client->connect(serverName,80)) {
if (client->connected()) {
// Send request using Exosite basic HTTP API
client->print(F("POST /onep:v1/stack/alias?"));
client->print(aliasList);
client->println(F(" HTTP/1.1"));
client->println(F("Host: m2.exosite.com"));
client->print(F("X-Exosite-CIK: "));
client->println(cik);
client->println(F("Accept: application/x-www-form-urlencoded; charset=utf-8"));
client->println(F("Content-Type: application/x-www-form-urlencoded; charset=utf-8"));
client->print(F("Content-Length: "));
client->println(strlen(dataList)); //calculate length
client->println();
client->println((char*)dataList);
// Read from the nic or the IC buffer overflows with no warning and goes out to lunch
timeout_time = millis()+ timeout;
while ((timeout_time > time_now) && RxLoop) {
if (client->available()) {
if (!DataRx)
DataRx= true;
c = client->read();
rxdata[stringPos] = c;
stringPos += 1;
} else {
rxdata[stringPos] = 0;
if (DataRx) {
DataRx = false;
RxLoop = false;
size_t length = 0;
size_t subStringLength = 0;
int i = 0;
if (strstr(rxdata, "HTTP/1.1 200 OK")) {
ret = true;
varPtr = strstr(rxdata, "\r\n\r\n") + 4;
varPtr2 = strstr( varPtr, "=" );
while( varPtr > 0 && varPtr2 > 0){
strncpy(readAliases[i], varPtr, varPtr2 - varPtr);
readAliases[i][varPtr2 - varPtr] = '\0';
varPtr = varPtr2 + 1;
varPtr2 = strstr( varPtr, "&" );
if(varPtr2 == 0){ // Last Item It Seems, Go to End of String
varPtr2 = varPtr + strlen(varPtr); // For some reason
}
strncpy(readValues[i], varPtr, varPtr2 - varPtr);
readValues[i][varPtr2 - varPtr] = '\0';
varPtr = varPtr2 + 1;
varPtr2 = strstr( varPtr, "=" );
i++;
}
readCount = i;
}else if(strstr(rxdata, "HTTP/1.1 204 No Content")){
ret = true;
} else {
varPtr = strstr(rxdata, "\n");
*varPtr = '\0';
Serial.println(rxdata);
}
}
}
time_now = millis();
}
client->stop();
}
}
return ret;
}
<commit_msg>Bug in sentToCloud(), Wasn't Copying Value<commit_after>//*****************************************************************************
//
// exosite.cpp - Prototypes for the Exosite Cloud API
//
// Copyright (c) 2012 Exosite LLC. 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 Exosite LLC 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 "AS IS" AND WITH ALL FAULTS.
// NO WARRANTIES, WHETHER EXPRESS, IMPLIED OR STATUTORY, INCLUDING, BUT
// NOT LIMITED TO, IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE APPLY TO THIS SOFTWARE. TI SHALL NOT, UNDER ANY
// CIRCUMSTANCES, BE LIABLE FOR SPECIAL, INCIDENTAL, OR CONSEQUENTIAL
// DAMAGES, FOR ANY REASON WHATSOEVER.
//
//*****************************************************************************
#include <SPI.h>
#include "Exosite.h"
#include <Ethernet.h>
#include <EthernetClient.h>
#define serverName "m2.exosite.com"
/*==============================================================================
* Exosite
*
* constructor for Exosite class
*=============================================================================*/
Exosite::Exosite(EthernetClass *eth, byte* _mac, String _cik)
{
ethernet = eth;
mac = _mac;
cik = _cik;
}
/*==============================================================================
* init
*
* initialization function for Exosite class.
*=============================================================================*/
void Exosite::init(void)
{
ethernet->begin(mac);
delay(500);
this->client = new EthernetClient();
}
/*==============================================================================
* sendToCloud
*
* send data to cloud
*=============================================================================*/
int Exosite::sendToCloud(String res, int value){
int readCount = 0;
int writeCount = 1;
char* readAliases[1];
char* readValues[1];
char* writeAliases[1];
char* writeValues[1];
writeAliases[0] = (char*)malloc(sizeof(char) * 32);
writeValues[0] = (char*)malloc(sizeof(char) * 32);
if(writeAliases[0] == 0 || writeValues[0] == 0){
if(writeAliases[0] != 0){
free(writeAliases[0]);
}
Serial.println(F("Not enough memory!"));
return 0;
}
res.toCharArray(writeAliases[0], 32);
itoa(value, writeValues[0], 10);
if(this->readWrite(writeAliases, writeValues, writeCount, readAliases, readValues, readCount)){
free(writeAliases[0]);
free(writeValues[0]);
return 1;
}else{
Serial.println(F("Error Communicating with Exosite (Write)"));
}
free(writeAliases[0]);
free(writeValues[0]);
return 0;
}
/*==============================================================================
* readFromCloud
*
* read data from cloud
*=============================================================================*/
int Exosite::readFromCloud(String res ,String* pResult){
int readCount = 1;
int writeCount = 0;
char* readAliases[1];
char* readValues[1];
char* writeAliases[1];
char* writeValues[1];
readAliases[0] = (char*)malloc(sizeof(char) * 32);
readValues[0] = (char*)malloc(sizeof(char) * 32);
if(readAliases[0] == 0 || readValues[0] == 0){
if(readAliases[0] != 0){
free(readAliases);
}
Serial.println(F("Not enough memory!"));
return 0;
}
res.toCharArray(readAliases[0], 32);
if(this->readWrite(writeAliases, writeValues, writeCount, readAliases, readValues, readCount)){
*pResult = String(readValues[0]);
free(readAliases[0]);
free(readValues[0]);
return 1;
}else{
Serial.println(F("Error Communicating with Exosite (Read)"));
}
free(readAliases[0]);
free(readValues[0]);
return 0;
}
/*==============================================================================
* readWrite
*
* One step Read and Write to Cloud
*=============================================================================*/
boolean Exosite::readWrite(char* writeAliases[], char* writeValues[], int& writeCount, char* readAliases[], char* readValues[], int& readCount){
ret = false;
stringPos = 0;
DataRx= false;
RxLoop = true;
timeout_time = 0;
time_now = 0;
timeout = 3000; // 3 seconds
aliasList[0] = '\0';
dataList[0] = '\0';
varPtr = aliasList;
for(int i = 0; i < readCount; i++){
strcat(aliasList, readAliases[i]);
if(i != readCount-1){
strcat(aliasList, "&");
}
}
readCount = 0;
for(int i = 0; i < writeCount; i++){
strcat(dataList, writeAliases[i]);
strcat(dataList, "=");
strcat(dataList, writeValues[i]);
if(i != writeCount-1){
strcat(dataList, "&");
}
}
delay(2000);
if (client->connect(serverName,80)) {
if (client->connected()) {
// Send request using Exosite basic HTTP API
client->print(F("POST /onep:v1/stack/alias?"));
client->print(aliasList);
client->println(F(" HTTP/1.1"));
client->println(F("Host: m2.exosite.com"));
client->print(F("X-Exosite-CIK: "));
client->println(cik);
client->println(F("Accept: application/x-www-form-urlencoded; charset=utf-8"));
client->println(F("Content-Type: application/x-www-form-urlencoded; charset=utf-8"));
client->print(F("Content-Length: "));
client->println(strlen(dataList)); //calculate length
client->println();
client->println((char*)dataList);
// Read from the nic or the IC buffer overflows with no warning and goes out to lunch
timeout_time = millis()+ timeout;
while ((timeout_time > time_now) && RxLoop) {
if (client->available()) {
if (!DataRx)
DataRx= true;
c = client->read();
rxdata[stringPos] = c;
stringPos += 1;
} else {
rxdata[stringPos] = 0;
if (DataRx) {
DataRx = false;
RxLoop = false;
size_t length = 0;
size_t subStringLength = 0;
int i = 0;
if (strstr(rxdata, "HTTP/1.1 200 OK")) {
ret = true;
varPtr = strstr(rxdata, "\r\n\r\n") + 4;
varPtr2 = strstr( varPtr, "=" );
while( varPtr > 0 && varPtr2 > 0){
strncpy(readAliases[i], varPtr, varPtr2 - varPtr);
readAliases[i][varPtr2 - varPtr] = '\0';
varPtr = varPtr2 + 1;
varPtr2 = strstr( varPtr, "&" );
if(varPtr2 == 0){ // Last Item It Seems, Go to End of String
varPtr2 = varPtr + strlen(varPtr); // For some reason
}
strncpy(readValues[i], varPtr, varPtr2 - varPtr);
readValues[i][varPtr2 - varPtr] = '\0';
varPtr = varPtr2 + 1;
varPtr2 = strstr( varPtr, "=" );
i++;
}
readCount = i;
}else if(strstr(rxdata, "HTTP/1.1 204 No Content")){
ret = true;
} else {
varPtr = strstr(rxdata, "\n");
*varPtr = '\0';
Serial.println(rxdata);
}
}
}
time_now = millis();
}
client->stop();
}
}
return ret;
}
<|endoftext|>
|
<commit_before>#include <iostream>
#include <cstdlib>
#include <cstdio>
#include "util.h"
using namespace std;
bool show_addresses;
void status(string message) {
cout << "[+] " << message << "\n";
}
void header() {
cout << "SIC-Disassembler v1.2 by Jay Bosamiya\n"
"-------------------------------------\n\n";
}
void usage(string progname) {
cerr << "Usage: " << progname << " input_object_file output_assembly_file [-a]\n";
cerr << " Options:\n";
cerr << " -a Show addresses in assembly output\n";
exit(-2);
}
void error(string err) {
cerr << "[!] Error: " << err << "\n";
}
void fatal(string err, int code) {
error(err);
exit(code);
}
bool is_hex_digit(char c) {
return
(c >= 'A' && c <= 'F') ||
(c >= '0' && c <= '9');
}
bool is_hex_string(std::string s) {
bool ret = true;
for ( const char *c = s.c_str(); *c && ret ; c++ ) {
ret = ret && is_hex_digit(*c);
}
return ret;
}
void make_upper_case(std::string &s) {
for ( string::iterator c = s.begin() ; c != s.end() ; c++ ) {
if ( *c >= 'a' && *c <= 'z' ) {
*c = (*c - 'a') + 'A';
}
}
}
int hexchar2int(char c) {
int ret = -1;
if ( c >= '0' && c <= '9' ) {
ret = (c-'0');
} else if ( c >= 'A' && c <= 'F' ) {
ret = (c-'A')+10;
}
return ret;
}
int hex2int(string s) {
int ret = 0;
for ( const char * cc = s.c_str() ; *cc ; cc++ ) {
ret *= 16;
const char &c = *cc;
if ( is_hex_digit(c) ) {
ret += hexchar2int(c);
} else {
fatal("Hex values need to be 0-9 or A-F");
}
}
return ret;
}
string byte2hex(int c) {
string ret = "";
if ( c < 0 || c >= 256 ) {
fatal("Illegal value for byte");
}
ret += (c/16 < 10)?('0'+c/16):('A'+c/16-10);
ret += (c%16 < 10)?('0'+c%16):('A'+c%16-10);
return ret;
}
string int2hex(int c, int bytes) {
if ( c < 0 ) {
return int2hex(c&0x7FFFFFFF,bytes);
}
if ( bytes <= 0 ) {
return "";
}
return int2hex(c/256,bytes-1)+byte2hex(c%256);
}
std::string int2str(int c) {
char ret[20];
sprintf(ret,"%d",c);
return ret;
}
<commit_msg>Update version number<commit_after>#include <iostream>
#include <cstdlib>
#include <cstdio>
#include "util.h"
using namespace std;
bool show_addresses;
void status(string message) {
cout << "[+] " << message << "\n";
}
void header() {
cout << "SIC-Disassembler v1.3 by Jay Bosamiya\n"
"-------------------------------------\n\n";
}
void usage(string progname) {
cerr << "Usage: " << progname << " input_object_file output_assembly_file [-a]\n";
cerr << " Options:\n";
cerr << " -a Show addresses in assembly output\n";
exit(-2);
}
void error(string err) {
cerr << "[!] Error: " << err << "\n";
}
void fatal(string err, int code) {
error(err);
exit(code);
}
bool is_hex_digit(char c) {
return
(c >= 'A' && c <= 'F') ||
(c >= '0' && c <= '9');
}
bool is_hex_string(std::string s) {
bool ret = true;
for ( const char *c = s.c_str(); *c && ret ; c++ ) {
ret = ret && is_hex_digit(*c);
}
return ret;
}
void make_upper_case(std::string &s) {
for ( string::iterator c = s.begin() ; c != s.end() ; c++ ) {
if ( *c >= 'a' && *c <= 'z' ) {
*c = (*c - 'a') + 'A';
}
}
}
int hexchar2int(char c) {
int ret = -1;
if ( c >= '0' && c <= '9' ) {
ret = (c-'0');
} else if ( c >= 'A' && c <= 'F' ) {
ret = (c-'A')+10;
}
return ret;
}
int hex2int(string s) {
int ret = 0;
for ( const char * cc = s.c_str() ; *cc ; cc++ ) {
ret *= 16;
const char &c = *cc;
if ( is_hex_digit(c) ) {
ret += hexchar2int(c);
} else {
fatal("Hex values need to be 0-9 or A-F");
}
}
return ret;
}
string byte2hex(int c) {
string ret = "";
if ( c < 0 || c >= 256 ) {
fatal("Illegal value for byte");
}
ret += (c/16 < 10)?('0'+c/16):('A'+c/16-10);
ret += (c%16 < 10)?('0'+c%16):('A'+c%16-10);
return ret;
}
string int2hex(int c, int bytes) {
if ( c < 0 ) {
return int2hex(c&0x7FFFFFFF,bytes);
}
if ( bytes <= 0 ) {
return "";
}
return int2hex(c/256,bytes-1)+byte2hex(c%256);
}
std::string int2str(int c) {
char ret[20];
sprintf(ret,"%d",c);
return ret;
}
<|endoftext|>
|
<commit_before>/* Copyright (c) 2016 PaddlePaddle Authors. All Rights Reserve.
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. */
#undef PADDLE_DISABLE_TIMER
#include <gtest/gtest.h>
#include <paddle/utils/PythonUtil.h>
#include <algorithm>
#include <cstdlib>
#include "paddle/testing/TestUtil.h"
#include "paddle/trainer/Trainer.h"
#include "paddle/utils/Stat.h"
using namespace paddle; // NOLINT
using namespace std; // NOLINT
DECLARE_int32(gpu_id);
DECLARE_double(checkgrad_eps);
DEFINE_bool(use_label, true, "input label or sequence label");
DEFINE_bool(static_para, false, "static parameter");
struct DataIn {
std::vector<Argument> inArgs;
std::vector<MatrixPtr> outGrads;
std::vector<VectorPtr> paraValues;
};
struct DataOut {
std::vector<MatrixPtr> outValues;
std::vector<VectorPtr> paraGrads;
};
void initArgument(DataIn& data,
const std::string& configPath,
bool useGpu = FLAGS_use_gpu) {
TrainerConfigHelper config(configPath);
size_t batchSize = config.getOptConfig().batch_size();
for (const auto& layer_name : config.getModelConfig().input_layer_names()) {
auto layer_config = std::find_if(config.getModelConfig().layers().begin(),
config.getModelConfig().layers().end(),
[=](const LayerConfig& layer_config) {
return layer_config.name() == layer_name;
});
CHECK(layer_config != config.getModelConfig().layers().end());
size_t layerSize = layer_config->size();
Argument arg;
arg.value = Matrix::create(batchSize, layerSize, false, useGpu);
arg.grad = Matrix::create(batchSize, layerSize, false, useGpu);
arg.value->randomizeUniform();
arg.value->add(-0.5);
arg.value->sigmoid(*arg.value);
arg.grad->zeroMem();
if (FLAGS_use_label) {
arg.ids = VectorT<int>::create(batchSize, useGpu);
arg.ids->rand(layerSize);
}
generateSequenceStartPositions(batchSize, arg.sequenceStartPositions);
data.inArgs.push_back(arg);
}
for (const auto& layer_name : config.getModelConfig().output_layer_names()) {
auto layer_config = std::find_if(config.getModelConfig().layers().begin(),
config.getModelConfig().layers().end(),
[=](const LayerConfig& layer_config) {
return layer_config.name() == layer_name;
});
CHECK(layer_config != config.getModelConfig().layers().end());
size_t layerSize = layer_config->size();
MatrixPtr grad = Matrix::create(batchSize, layerSize, false, useGpu);
grad->randomizeUniform();
data.outGrads.push_back(grad);
}
for (const auto& para_config : config.getModelConfig().parameters()) {
VectorPtr value = Vector::create(para_config.size(), useGpu);
value->randnorm(0, 2);
data.paraValues.push_back(value);
}
}
void calcGradient(DataIn& in, DataOut& out, const std::string& configPath) {
*ThreadLocalRand::getSeed() = 0;
srand(0);
Trainer trainer;
auto config = std::make_shared<TrainerConfigHelper>(configPath);
trainer.init(config, false);
std::vector<ParameterPtr> parameters;
vector<Argument> outArgs;
auto gradientMachine = trainer.getGradientMachine();
parameters = gradientMachine->getParameters();
if (FLAGS_static_para) {
for (size_t i = 0; i < parameters.size(); i++) {
parameters[i]->getBuf(PARAMETER_VALUE)->one();
}
} else {
for (size_t i = 0; i < in.paraValues.size(); i++) {
parameters[i]->getBuf(PARAMETER_VALUE)->copyFrom(*in.paraValues[i]);
}
}
gradientMachine->start();
gradientMachine->forward(in.inArgs, &outArgs, PASS_TRAIN);
for (size_t i = 0; i < in.outGrads.size(); i++) {
// If the all the layers in the config have no parameters, also
// not set NeedGradient(), the outArgs[i] will be nullptr.
outArgs[i].grad->copyFrom(*in.outGrads[i]);
}
gradientMachine->backward();
for (size_t i = 0; i < in.outGrads.size(); i++) {
MatrixPtr value = Matrix::create(outArgs[i].value->getHeight(),
outArgs[i].value->getWidth(),
false,
false);
value->copyFrom(*outArgs[i].value);
out.outValues.push_back(value);
}
for (size_t i = 0; i < in.paraValues.size(); i++) {
VectorPtr grad = Vector::create(
parameters[i]->getBuf(PARAMETER_GRADIENT)->getSize(), false);
grad->copyFrom(*parameters[i]->getBuf(PARAMETER_GRADIENT));
out.paraGrads.push_back(grad);
}
for (int i = 0; i < 20; i++) {
REGISTER_TIMER("forward");
gradientMachine->forward(in.inArgs, &outArgs, PASS_TRAIN);
}
for (int i = 0; i < 20; i++) {
REGISTER_TIMER("backward");
gradientMachine->backward();
}
gradientMachine->finish();
}
void checkBuffer(real* A,
const char* desA,
real* B,
const char* desB,
size_t len,
size_t width = 1) {
int nNum = 0;
for (size_t i = 0; i < len; ++i) {
real diff = fabs(A[i] - B[i]);
if (diff > 0.0f &&
diff / std::max(fabs(A[i]), fabs(B[i])) > FLAGS_checkgrad_eps) {
nNum++;
LOG(INFO) << "Row: " << i / width << ", " << desA << " : " << A[i]
<< " " << desB << " : " << B[i];
}
}
EXPECT_EQ(0, nNum);
}
void compareGradient(DataOut& outA, DataOut& outB) {
LOG(INFO) << "------------------------------"
<< " Check Network Output "
<< "------------------------------";
for (size_t i = 0; i < outA.outValues.size(); ++i) {
LOG(INFO) << "OUTPUT VALUE: " << i;
checkBuffer(outA.outValues[i]->getData(),
"network A output",
outB.outValues[i]->getData(),
"network B output",
outA.outValues[i]->getElementCnt(),
outA.outValues[i]->getWidth());
}
if (!FLAGS_static_para) {
LOG(INFO) << "------------------------------"
<< " Check Parameters "
<< "------------------------------";
for (size_t i = 0; i < outA.paraGrads.size(); ++i) {
LOG(INFO) << "PARAMETER GRADIENT: " << i;
checkBuffer(outA.paraGrads[i]->getData(),
"Network A",
outB.paraGrads[i]->getData(),
"Network B",
outA.paraGrads[i]->getSize());
}
}
}
void compareNetwork(const std::string& config_file_a,
const std::string& config_file_b) {
DataIn in;
initArgument(in, config_file_a);
DataOut dataA;
calcGradient(in, dataA, config_file_a);
LOG(INFO) << "forwardBackward of Network A is finished";
globalStat.printSegTimerStatus();
globalStat.reset();
LOG(INFO) << "\n\n";
DataOut dataB;
calcGradient(in, dataB, config_file_b);
LOG(INFO) << "forwardBackward of the Network B is finished";
globalStat.printSegTimerStatus();
globalStat.reset();
LOG(INFO) << "\n\n";
compareGradient(dataA, dataB);
}
TEST(Compare, concat_dotmul) {
std::string config_file_a = "./gserver/tests/concat_dotmul_a.conf";
std::string config_file_b = "./gserver/tests/concat_dotmul_b.conf";
compareNetwork(config_file_a, config_file_b);
}
TEST(Compare, concat_fullmatrix) {
std::string config_file_a = "./gserver/tests/concat_fullmatrix_a.conf";
std::string config_file_b = "./gserver/tests/concat_fullmatrix_b.conf";
compareNetwork(config_file_a, config_file_b);
}
TEST(Compare, concat_table) {
std::string config_file_a = "./gserver/tests/concat_table_a.conf";
std::string config_file_b = "./gserver/tests/concat_table_b.conf";
compareNetwork(config_file_a, config_file_b);
}
TEST(Compare, concat_slice) {
std::string config_file_a = "./gserver/tests/concat_slice_a.conf";
std::string config_file_b = "./gserver/tests/concat_slice_b.conf";
compareNetwork(config_file_a, config_file_b);
}
#ifndef PADDLE_ONLY_CPU
TEST(Compare, img_pool) {
std::string config_file_a = "./gserver/tests/img_pool_a.conf";
std::string config_file_b = "./gserver/tests/img_pool_b.conf";
bool useGpu = FLAGS_use_gpu;
FLAGS_use_gpu = true;
compareNetwork(config_file_a, config_file_b);
FLAGS_use_gpu = useGpu;
}
TEST(Compare, img_conv) {
std::string config_file_a = "./gserver/tests/img_conv_a.conf";
std::string config_file_b = "./gserver/tests/img_conv_b.conf";
bool useGpu = FLAGS_use_gpu;
FLAGS_use_gpu = true;
compareNetwork(config_file_a, config_file_b);
FLAGS_use_gpu = useGpu;
}
// Test cudnn_conv and exconv give the same result
TEST(Compare, img_conv2) {
std::string config_file_a = "./gserver/tests/img_conv_cudnn.py";
std::string config_file_b = "./gserver/tests/img_conv_exconv.py";
bool useGpu = FLAGS_use_gpu;
double eps = FLAGS_checkgrad_eps;
FLAGS_use_gpu = true;
FLAGS_checkgrad_eps = 1e-2;
compareNetwork(config_file_a, config_file_b);
FLAGS_use_gpu = useGpu;
FLAGS_checkgrad_eps = eps;
}
#endif
DEFINE_string(config_file_a, "", "config of one network to compare");
DEFINE_string(config_file_b, "", "config of another network to compare");
TEST(Compare, network) {
if (FLAGS_config_file_a != "" && FLAGS_config_file_b != "") {
compareNetwork(FLAGS_config_file_a, FLAGS_config_file_b);
}
}
int main(int argc, char** argv) {
testing::InitGoogleTest(&argc, argv);
paddle::initMain(argc, argv);
initPython(argc, argv);
int ret = RUN_ALL_TESTS();
return ret;
}
<commit_msg>tune relative precision for unit test img_conv2 in test_NetworkCompare.cpp. 1. It's no problem with relative precision 1e-3 when testing several times in my local machine. 2. But the testing failed with 1e-2 in the TeamCity, and only one value's relative precision is over 1e-2. So tune it to 4e-2<commit_after>/* Copyright (c) 2016 PaddlePaddle Authors. All Rights Reserve.
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. */
#undef PADDLE_DISABLE_TIMER
#include <gtest/gtest.h>
#include <paddle/utils/PythonUtil.h>
#include <algorithm>
#include <cstdlib>
#include "paddle/testing/TestUtil.h"
#include "paddle/trainer/Trainer.h"
#include "paddle/utils/Stat.h"
using namespace paddle; // NOLINT
using namespace std; // NOLINT
DECLARE_int32(gpu_id);
DECLARE_double(checkgrad_eps);
DEFINE_bool(use_label, true, "input label or sequence label");
DEFINE_bool(static_para, false, "static parameter");
struct DataIn {
std::vector<Argument> inArgs;
std::vector<MatrixPtr> outGrads;
std::vector<VectorPtr> paraValues;
};
struct DataOut {
std::vector<MatrixPtr> outValues;
std::vector<VectorPtr> paraGrads;
};
void initArgument(DataIn& data,
const std::string& configPath,
bool useGpu = FLAGS_use_gpu) {
TrainerConfigHelper config(configPath);
size_t batchSize = config.getOptConfig().batch_size();
for (const auto& layer_name : config.getModelConfig().input_layer_names()) {
auto layer_config = std::find_if(config.getModelConfig().layers().begin(),
config.getModelConfig().layers().end(),
[=](const LayerConfig& layer_config) {
return layer_config.name() == layer_name;
});
CHECK(layer_config != config.getModelConfig().layers().end());
size_t layerSize = layer_config->size();
Argument arg;
arg.value = Matrix::create(batchSize, layerSize, false, useGpu);
arg.grad = Matrix::create(batchSize, layerSize, false, useGpu);
arg.value->randomizeUniform();
arg.value->add(-0.5);
arg.value->sigmoid(*arg.value);
arg.grad->zeroMem();
if (FLAGS_use_label) {
arg.ids = VectorT<int>::create(batchSize, useGpu);
arg.ids->rand(layerSize);
}
generateSequenceStartPositions(batchSize, arg.sequenceStartPositions);
data.inArgs.push_back(arg);
}
for (const auto& layer_name : config.getModelConfig().output_layer_names()) {
auto layer_config = std::find_if(config.getModelConfig().layers().begin(),
config.getModelConfig().layers().end(),
[=](const LayerConfig& layer_config) {
return layer_config.name() == layer_name;
});
CHECK(layer_config != config.getModelConfig().layers().end());
size_t layerSize = layer_config->size();
MatrixPtr grad = Matrix::create(batchSize, layerSize, false, useGpu);
grad->randomizeUniform();
data.outGrads.push_back(grad);
}
for (const auto& para_config : config.getModelConfig().parameters()) {
VectorPtr value = Vector::create(para_config.size(), useGpu);
value->randnorm(0, 2);
data.paraValues.push_back(value);
}
}
void calcGradient(DataIn& in, DataOut& out, const std::string& configPath) {
*ThreadLocalRand::getSeed() = 0;
srand(0);
Trainer trainer;
auto config = std::make_shared<TrainerConfigHelper>(configPath);
trainer.init(config, false);
std::vector<ParameterPtr> parameters;
vector<Argument> outArgs;
auto gradientMachine = trainer.getGradientMachine();
parameters = gradientMachine->getParameters();
if (FLAGS_static_para) {
for (size_t i = 0; i < parameters.size(); i++) {
parameters[i]->getBuf(PARAMETER_VALUE)->one();
}
} else {
for (size_t i = 0; i < in.paraValues.size(); i++) {
parameters[i]->getBuf(PARAMETER_VALUE)->copyFrom(*in.paraValues[i]);
}
}
gradientMachine->start();
gradientMachine->forward(in.inArgs, &outArgs, PASS_TRAIN);
for (size_t i = 0; i < in.outGrads.size(); i++) {
// If the all the layers in the config have no parameters, also
// not set NeedGradient(), the outArgs[i] will be nullptr.
outArgs[i].grad->copyFrom(*in.outGrads[i]);
}
gradientMachine->backward();
for (size_t i = 0; i < in.outGrads.size(); i++) {
MatrixPtr value = Matrix::create(outArgs[i].value->getHeight(),
outArgs[i].value->getWidth(),
false,
false);
value->copyFrom(*outArgs[i].value);
out.outValues.push_back(value);
}
for (size_t i = 0; i < in.paraValues.size(); i++) {
VectorPtr grad = Vector::create(
parameters[i]->getBuf(PARAMETER_GRADIENT)->getSize(), false);
grad->copyFrom(*parameters[i]->getBuf(PARAMETER_GRADIENT));
out.paraGrads.push_back(grad);
}
for (int i = 0; i < 20; i++) {
REGISTER_TIMER("forward");
gradientMachine->forward(in.inArgs, &outArgs, PASS_TRAIN);
}
for (int i = 0; i < 20; i++) {
REGISTER_TIMER("backward");
gradientMachine->backward();
}
gradientMachine->finish();
}
void checkBuffer(real* A,
const char* desA,
real* B,
const char* desB,
size_t len,
size_t width = 1) {
int nNum = 0;
for (size_t i = 0; i < len; ++i) {
real diff = fabs(A[i] - B[i]);
if (diff > 0.0f &&
diff / std::max(fabs(A[i]), fabs(B[i])) > FLAGS_checkgrad_eps) {
nNum++;
LOG(INFO) << "Row: " << i / width << ", " << desA << " : " << A[i]
<< " " << desB << " : " << B[i];
}
}
EXPECT_EQ(0, nNum);
}
void compareGradient(DataOut& outA, DataOut& outB) {
LOG(INFO) << "------------------------------"
<< " Check Network Output "
<< "------------------------------";
for (size_t i = 0; i < outA.outValues.size(); ++i) {
LOG(INFO) << "OUTPUT VALUE: " << i;
checkBuffer(outA.outValues[i]->getData(),
"network A output",
outB.outValues[i]->getData(),
"network B output",
outA.outValues[i]->getElementCnt(),
outA.outValues[i]->getWidth());
}
if (!FLAGS_static_para) {
LOG(INFO) << "------------------------------"
<< " Check Parameters "
<< "------------------------------";
for (size_t i = 0; i < outA.paraGrads.size(); ++i) {
LOG(INFO) << "PARAMETER GRADIENT: " << i;
checkBuffer(outA.paraGrads[i]->getData(),
"Network A",
outB.paraGrads[i]->getData(),
"Network B",
outA.paraGrads[i]->getSize());
}
}
}
void compareNetwork(const std::string& config_file_a,
const std::string& config_file_b) {
DataIn in;
initArgument(in, config_file_a);
DataOut dataA;
calcGradient(in, dataA, config_file_a);
LOG(INFO) << "forwardBackward of Network A is finished";
globalStat.printSegTimerStatus();
globalStat.reset();
LOG(INFO) << "\n\n";
DataOut dataB;
calcGradient(in, dataB, config_file_b);
LOG(INFO) << "forwardBackward of the Network B is finished";
globalStat.printSegTimerStatus();
globalStat.reset();
LOG(INFO) << "\n\n";
compareGradient(dataA, dataB);
}
TEST(Compare, concat_dotmul) {
std::string config_file_a = "./gserver/tests/concat_dotmul_a.conf";
std::string config_file_b = "./gserver/tests/concat_dotmul_b.conf";
compareNetwork(config_file_a, config_file_b);
}
TEST(Compare, concat_fullmatrix) {
std::string config_file_a = "./gserver/tests/concat_fullmatrix_a.conf";
std::string config_file_b = "./gserver/tests/concat_fullmatrix_b.conf";
compareNetwork(config_file_a, config_file_b);
}
TEST(Compare, concat_table) {
std::string config_file_a = "./gserver/tests/concat_table_a.conf";
std::string config_file_b = "./gserver/tests/concat_table_b.conf";
compareNetwork(config_file_a, config_file_b);
}
TEST(Compare, concat_slice) {
std::string config_file_a = "./gserver/tests/concat_slice_a.conf";
std::string config_file_b = "./gserver/tests/concat_slice_b.conf";
compareNetwork(config_file_a, config_file_b);
}
#ifndef PADDLE_ONLY_CPU
TEST(Compare, img_pool) {
std::string config_file_a = "./gserver/tests/img_pool_a.conf";
std::string config_file_b = "./gserver/tests/img_pool_b.conf";
bool useGpu = FLAGS_use_gpu;
FLAGS_use_gpu = true;
compareNetwork(config_file_a, config_file_b);
FLAGS_use_gpu = useGpu;
}
TEST(Compare, img_conv) {
std::string config_file_a = "./gserver/tests/img_conv_a.conf";
std::string config_file_b = "./gserver/tests/img_conv_b.conf";
bool useGpu = FLAGS_use_gpu;
FLAGS_use_gpu = true;
compareNetwork(config_file_a, config_file_b);
FLAGS_use_gpu = useGpu;
}
// Test cudnn_conv and exconv give the same result
TEST(Compare, img_conv2) {
std::string config_file_a = "./gserver/tests/img_conv_cudnn.py";
std::string config_file_b = "./gserver/tests/img_conv_exconv.py";
bool useGpu = FLAGS_use_gpu;
double eps = FLAGS_checkgrad_eps;
FLAGS_use_gpu = true;
// Sometimes, this unit test will fail with 1e-2
FLAGS_checkgrad_eps = 4e-2;
compareNetwork(config_file_a, config_file_b);
FLAGS_use_gpu = useGpu;
FLAGS_checkgrad_eps = eps;
}
#endif
DEFINE_string(config_file_a, "", "config of one network to compare");
DEFINE_string(config_file_b, "", "config of another network to compare");
TEST(Compare, network) {
if (FLAGS_config_file_a != "" && FLAGS_config_file_b != "") {
compareNetwork(FLAGS_config_file_a, FLAGS_config_file_b);
}
}
int main(int argc, char** argv) {
testing::InitGoogleTest(&argc, argv);
paddle::initMain(argc, argv);
initPython(argc, argv);
int ret = RUN_ALL_TESTS();
return ret;
}
<|endoftext|>
|
<commit_before>#include "FPSRole.h"
#include "Engine.h"
#include "Creature.h"
#include "AnimationBlend.h"
CFPSRole::CFPSRole(void)
{
m_nFire = 0;
m_fAniCoolingTime = 0;
m_fAniNowCoolingTime = 0;
m_fSudCoolingTime = 0;
m_fEmitCoolingTime = 0;
}
CFPSRole::~CFPSRole(void)
{
g_Engine.pGame->RemoveNode(m_pMuzzleEffect);
}
int CFPSRole::Init( int nRoleID,const char* strCharFile )
{
if(CRoleBase::Init(nRoleID,strCharFile))
{
m_pStand[0] = (CAnimationBlendRotate*)m_pCreature->GetAnimationBlend("stand_h");
m_pFire[0] = (CAnimationBlendRotate*)m_pCreature->GetAnimationBlend("fire_h");
m_pStand[1] = (CAnimationBlendRotate*)m_pCreature->GetAnimationBlend("stand_v");
m_pFire[1] = (CAnimationBlendRotate*)m_pCreature->GetAnimationBlend("fire_v");
m_pRun[0] = (CAnimationBlendDual*)m_pCreature->GetAnimationBlend("run_h");
m_pRun[1] = (CAnimationBlendDual*)m_pCreature->GetAnimationBlend("run_v");
}
return 1;//always return 1;
}
void CFPSRole::OnKeyFrame( _ActionCallback_KeyFrame* pKeyInfo )
{
//I will finish this function later.
}
void CFPSRole::OnActionComplete( _ActionCallback_Complete* pActInfo )
{
return CRoleBase::OnActionComplete(pActInfo);
}<commit_msg>Signed-off-by: mrlitong <litongtongxue@gmail.com><commit_after>#include "FPSRole.h"
#include "Engine.h"
#include "Creature.h"
#include "AnimationBlend.h"
CFPSRole::CFPSRole(void)
{
m_nFire = 0;
m_fAniCoolingTime = 0;
m_fAniNowCoolingTime = 0;
m_fSudCoolingTime = 0;
m_fEmitCoolingTime = 0;
}
CFPSRole::~CFPSRole(void)
{
g_Engine.pGame->RemoveNode(m_pMuzzleEffect);
}
int CFPSRole::Init( int nRoleID,const char* strCharFile )
{
if(CRoleBase::Init(nRoleID,strCharFile))
{
m_pStand[0] = (CAnimationBlendRotate*)m_pCreature->GetAnimationBlend("stand_h");
m_pFire[0] = (CAnimationBlendRotate*)m_pCreature->GetAnimationBlend("fire_h");
m_pStand[1] = (CAnimationBlendRotate*)m_pCreature->GetAnimationBlend("stand_v");
m_pFire[1] = (CAnimationBlendRotate*)m_pCreature->GetAnimationBlend("fire_v");
m_pRun[0] = (CAnimationBlendDual*)m_pCreature->GetAnimationBlend("run_h");
m_pRun[1] = (CAnimationBlendDual*)m_pCreature->GetAnimationBlend("run_v");
m_fEmitNowCoolingTime = 0;
m_fSudNowCoolingTime = 0;
}
return 1;//always return 1;
}
void CFPSRole::OnKeyFrame( _ActionCallback_KeyFrame* pKeyInfo )
{
//I will finish this function later.
}
void CFPSRole::OnActionComplete( _ActionCallback_Complete* pActInfo )
{
return CRoleBase::OnActionComplete(pActInfo);
}
<|endoftext|>
|
<commit_before>#include <tests/lib/test.h>
#define TP_QT_ENABLE_LOWLEVEL_API
#include <TelepathyQt/BaseConnectionManager>
#include <TelepathyQt/ConnectionManager>
#include <TelepathyQt/ConnectionManagerLowlevel>
#include <TelepathyQt/DBusError>
#include <TelepathyQt/PendingReady>
#include <TelepathyQt/PendingConnection>
using namespace Tp;
class TestBaseCM : public Test
{
Q_OBJECT
public:
TestBaseCM(QObject *parent = 0)
: Test(parent)
{ }
private Q_SLOTS:
void initTestCase();
void init();
void testNoProtocols();
void cleanup();
void cleanupTestCase();
};
void TestBaseCM::initTestCase()
{
initTestCaseImpl();
}
void TestBaseCM::init()
{
initImpl();
}
void TestBaseCM::testNoProtocols()
{
qDebug() << "Introspecting non-existing CM";
ConnectionManagerPtr cliCM = ConnectionManager::create(
QLatin1String("testcm"));
PendingReady *pr = cliCM->becomeReady(ConnectionManager::FeatureCore);
connect(pr, SIGNAL(finished(Tp::PendingOperation*)),
SLOT(expectFailure(Tp::PendingOperation*)));
QCOMPARE(mLoop->exec(), 0);
qDebug() << "Creating CM";
BaseConnectionManagerPtr cm = BaseConnectionManager::create(
QLatin1String("testcm"));
Tp::DBusError err;
QVERIFY(cm->registerObject(&err));
QVERIFY(!err.isValid());
qDebug() << "Introspecting new CM";
cliCM = ConnectionManager::create(QLatin1String("testcm"));
pr = cliCM->becomeReady(ConnectionManager::FeatureCore);
connect(pr, SIGNAL(finished(Tp::PendingOperation*)),
SLOT(expectSuccessfulCall(Tp::PendingOperation*)));
QCOMPARE(mLoop->exec(), 0);
QCOMPARE(cliCM->supportedProtocols().size(), 0);
qDebug() << "Requesting connection";
PendingConnection *pc = cliCM->lowlevel()->requestConnection(
QLatin1String("jabber"), QVariantMap());
connect(pc, SIGNAL(finished(Tp::PendingOperation*)),
SLOT(expectFailure(Tp::PendingOperation*)));
QCOMPARE(mLoop->exec(), 0);
}
void TestBaseCM::cleanup()
{
cleanupImpl();
}
void TestBaseCM::cleanupTestCase()
{
cleanupTestCaseImpl();
}
QTEST_MAIN(TestBaseCM)
#include "_gen/base-cm.cpp.moc.hpp"
<commit_msg>test-base-cm: Add test for the protocol-related methods of BaseCM<commit_after>#include <tests/lib/test.h>
#define TP_QT_ENABLE_LOWLEVEL_API
#include <TelepathyQt/BaseConnectionManager>
#include <TelepathyQt/BaseProtocol>
#include <TelepathyQt/ConnectionManager>
#include <TelepathyQt/ConnectionManagerLowlevel>
#include <TelepathyQt/DBusError>
#include <TelepathyQt/PendingReady>
#include <TelepathyQt/PendingConnection>
using namespace Tp;
class TestBaseCM : public Test
{
Q_OBJECT
public:
TestBaseCM(QObject *parent = 0)
: Test(parent)
{ }
private Q_SLOTS:
void initTestCase();
void init();
void testNoProtocols();
void testProtocols();
void cleanup();
void cleanupTestCase();
};
void TestBaseCM::initTestCase()
{
initTestCaseImpl();
}
void TestBaseCM::init()
{
initImpl();
}
void TestBaseCM::testNoProtocols()
{
qDebug() << "Introspecting non-existing CM";
ConnectionManagerPtr cliCM = ConnectionManager::create(
QLatin1String("testcm"));
PendingReady *pr = cliCM->becomeReady(ConnectionManager::FeatureCore);
connect(pr, SIGNAL(finished(Tp::PendingOperation*)),
SLOT(expectFailure(Tp::PendingOperation*)));
QCOMPARE(mLoop->exec(), 0);
qDebug() << "Creating CM";
BaseConnectionManagerPtr cm = BaseConnectionManager::create(
QLatin1String("testcm"));
Tp::DBusError err;
QVERIFY(cm->registerObject(&err));
QVERIFY(!err.isValid());
QCOMPARE(cm->protocols().size(), 0);
qDebug() << "Introspecting new CM";
cliCM = ConnectionManager::create(QLatin1String("testcm"));
pr = cliCM->becomeReady(ConnectionManager::FeatureCore);
connect(pr, SIGNAL(finished(Tp::PendingOperation*)),
SLOT(expectSuccessfulCall(Tp::PendingOperation*)));
QCOMPARE(mLoop->exec(), 0);
QCOMPARE(cliCM->supportedProtocols().size(), 0);
qDebug() << "Requesting connection";
PendingConnection *pc = cliCM->lowlevel()->requestConnection(
QLatin1String("jabber"), QVariantMap());
connect(pc, SIGNAL(finished(Tp::PendingOperation*)),
SLOT(expectFailure(Tp::PendingOperation*)));
QCOMPARE(mLoop->exec(), 0);
QCOMPARE(mLastError, TP_QT_ERROR_NOT_IMPLEMENTED);
}
void TestBaseCM::testProtocols()
{
qDebug() << "Creating CM";
BaseConnectionManagerPtr cm = BaseConnectionManager::create(QLatin1String("testcm"));
BaseProtocolPtr protocol = BaseProtocol::create(QLatin1String("myprotocol"));
QVERIFY(!protocol.isNull());
QVERIFY(cm->addProtocol(protocol));
QVERIFY(cm->hasProtocol(QLatin1String("myprotocol")));
QCOMPARE(cm->protocol(QLatin1String("myprotocol")), protocol);
QCOMPARE(cm->protocols().size(), 1);
QVERIFY(!cm->hasProtocol(QLatin1String("otherprotocol")));
QVERIFY(cm->protocol(QLatin1String("otherprotocol")).isNull());
//can't add the same protocol twice
QVERIFY(!cm->addProtocol(protocol));
Tp::DBusError err;
QVERIFY(cm->registerObject(&err));
QVERIFY(!err.isValid());
//can't add another protocol after registerObject()
protocol = BaseProtocol::create(QLatin1String("otherprotocol"));
QVERIFY(!protocol.isNull());
QVERIFY(!cm->addProtocol(protocol));
QCOMPARE(cm->protocols().size(), 1);
protocol.reset();
QVariantMap props = cm->immutableProperties();
QVERIFY(props.contains(TP_QT_IFACE_CONNECTION_MANAGER + QLatin1String(".Protocols")));
ProtocolPropertiesMap protocols = qvariant_cast<Tp::ProtocolPropertiesMap>(
props[TP_QT_IFACE_CONNECTION_MANAGER + QLatin1String(".Protocols")]);
QVERIFY(protocols.contains(QLatin1String("myprotocol")));
QVERIFY(!protocols.contains(QLatin1String("otherprotocol")));
qDebug() << "Introspecting CM";
ConnectionManagerPtr cliCM = ConnectionManager::create(
QLatin1String("testcm"));
PendingReady *pr = cliCM->becomeReady(ConnectionManager::FeatureCore);
connect(pr, SIGNAL(finished(Tp::PendingOperation*)),
SLOT(expectSuccessfulCall(Tp::PendingOperation*)));
QCOMPARE(mLoop->exec(), 0);
QCOMPARE(cliCM->supportedProtocols().size(), 1);
QVERIFY(cliCM->hasProtocol(QLatin1String("myprotocol")));
PendingConnection *pc = cliCM->lowlevel()->requestConnection(
QLatin1String("myprotocol"), QVariantMap());
connect(pc, SIGNAL(finished(Tp::PendingOperation*)),
SLOT(expectFailure(Tp::PendingOperation*)));
QCOMPARE(mLoop->exec(), 0);
QCOMPARE(mLastError, TP_QT_ERROR_NOT_IMPLEMENTED);
}
void TestBaseCM::cleanup()
{
cleanupImpl();
}
void TestBaseCM::cleanupTestCase()
{
cleanupTestCaseImpl();
}
QTEST_MAIN(TestBaseCM)
#include "_gen/base-cm.cpp.moc.hpp"
<|endoftext|>
|
<commit_before>#include "FastLED.h"
#if defined(__SAM3X8E__)
volatile uint32_t fuckit;
#endif
void *pSmartMatrix = NULL;
CFastLED LEDS;
CFastLED & FastSPI_LED = LEDS;
CFastLED & FastSPI_LED2 = LEDS;
CFastLED & FastLED = LEDS;
CLEDController *CLEDController::m_pHead = NULL;
CLEDController *CLEDController::m_pTail = NULL;
// uint32_t CRGB::Squant = ((uint32_t)((__TIME__[4]-'0') * 28))<<16 | ((__TIME__[6]-'0')*50)<<8 | ((__TIME__[7]-'0')*28);
CFastLED::CFastLED() {
// clear out the array of led controllers
// m_nControllers = 0;
m_Scale = 255;
}
CLEDController &CFastLED::addLeds(CLEDController *pLed,
struct CRGB *data,
int nLedsOrOffset, int nLedsIfOffset) {
int nOffset = (nLedsIfOffset > 0) ? nLedsOrOffset : 0;
int nLeds = (nLedsIfOffset > 0) ? nLedsIfOffset : nLedsOrOffset;
pLed->init();
pLed->setLeds(data + nOffset, nLeds);
return *pLed;
}
void CFastLED::show(uint8_t scale) {
CLEDController *pCur = CLEDController::head();
while(pCur) {
pCur->showLeds(scale);
pCur = pCur->next();
}
}
int CFastLED::count() {
int x = 0;
CLEDController *pCur = CLEDController::head();
while( pCur) {
x++;
pCur = pCur->next();
}
return x;
}
CLEDController & CFastLED::operator[](int x) {
CLEDController *pCur = CLEDController::head();
while(x-- && pCur) {
pCur = pCur->next();
}
if(pCur == NULL) {
return *(CLEDController::head());
} else {
return *pCur;
}
}
void CFastLED::showColor(const struct CRGB & color, uint8_t scale) {
CLEDController *pCur = CLEDController::head();
while(pCur) {
pCur->showColor(color, scale);
pCur = pCur->next();
}
}
void CFastLED::clear(boolean writeData) {
if(writeData) {
showColor(CRGB(0,0,0), 0);
}
clearData();
}
void CFastLED::clearData() {
CLEDController *pCur = CLEDController::head();
while(pCur) {
pCur->clearLedData();
pCur = pCur->next();
}
}
void CFastLED::delay(unsigned long ms) {
unsigned long start = millis();
while((millis()-start) < ms) {
show();
}
}
void CFastLED::setTemperature(const struct CRGB & temp) {
CLEDController *pCur = CLEDController::head();
while(pCur) {
pCur->setTemperature(temp);
pCur = pCur->next();
}
}
void CFastLED::setCorrection(const struct CRGB & correction) {
CLEDController *pCur = CLEDController::head();
while(pCur) {
pCur->setCorrection(correction);
pCur = pCur->next();
}
}
void CFastLED::setDither(uint8_t ditherMode) {
CLEDController *pCur = CLEDController::head();
while(pCur) {
pCur->setDither(ditherMode);
pCur = pCur->next();
}
}
extern int noise_min;
extern int noise_max;
void CFastLED::countFPS(int nFrames) {
if(Serial) {
static int br = 0;
static uint32_t lastframe = 0; // millis();
br++;
if(br == nFrames) {
uint32_t now = millis();
Serial.print(lastframe); Serial.print("ms and now it is "); Serial.print(now); Serial.println("ms");
now -= lastframe;
uint32_t fps = (br * 1000) / now;
/*Serial.print('('); Serial.print(noise_min); Serial.print(','); Serial.print(noise_max); Serial.print(") "); */
Serial.print(now); Serial.print("ms for "); Serial.print(br); Serial.print(" frames, aka ");
Serial.print(fps); Serial.println(" fps. ");
br = 0;
lastframe = millis();
}
}
}
<commit_msg>Make sure delay does the right thing, even when show is short enough to not cause millis to change - #71<commit_after>#include "FastLED.h"
#if defined(__SAM3X8E__)
volatile uint32_t fuckit;
#endif
void *pSmartMatrix = NULL;
CFastLED LEDS;
CFastLED & FastSPI_LED = LEDS;
CFastLED & FastSPI_LED2 = LEDS;
CFastLED & FastLED = LEDS;
CLEDController *CLEDController::m_pHead = NULL;
CLEDController *CLEDController::m_pTail = NULL;
// uint32_t CRGB::Squant = ((uint32_t)((__TIME__[4]-'0') * 28))<<16 | ((__TIME__[6]-'0')*50)<<8 | ((__TIME__[7]-'0')*28);
CFastLED::CFastLED() {
// clear out the array of led controllers
// m_nControllers = 0;
m_Scale = 255;
}
CLEDController &CFastLED::addLeds(CLEDController *pLed,
struct CRGB *data,
int nLedsOrOffset, int nLedsIfOffset) {
int nOffset = (nLedsIfOffset > 0) ? nLedsOrOffset : 0;
int nLeds = (nLedsIfOffset > 0) ? nLedsIfOffset : nLedsOrOffset;
pLed->init();
pLed->setLeds(data + nOffset, nLeds);
return *pLed;
}
void CFastLED::show(uint8_t scale) {
CLEDController *pCur = CLEDController::head();
while(pCur) {
pCur->showLeds(scale);
pCur = pCur->next();
}
}
int CFastLED::count() {
int x = 0;
CLEDController *pCur = CLEDController::head();
while( pCur) {
x++;
pCur = pCur->next();
}
return x;
}
CLEDController & CFastLED::operator[](int x) {
CLEDController *pCur = CLEDController::head();
while(x-- && pCur) {
pCur = pCur->next();
}
if(pCur == NULL) {
return *(CLEDController::head());
} else {
return *pCur;
}
}
void CFastLED::showColor(const struct CRGB & color, uint8_t scale) {
CLEDController *pCur = CLEDController::head();
while(pCur) {
pCur->showColor(color, scale);
pCur = pCur->next();
}
}
void CFastLED::clear(boolean writeData) {
if(writeData) {
showColor(CRGB(0,0,0), 0);
}
clearData();
}
void CFastLED::clearData() {
CLEDController *pCur = CLEDController::head();
while(pCur) {
pCur->clearLedData();
pCur = pCur->next();
}
}
void CFastLED::delay(unsigned long ms) {
unsigned long start = millis();
while((millis()-start) < ms) {
show();
delay(1);
}
}
void CFastLED::setTemperature(const struct CRGB & temp) {
CLEDController *pCur = CLEDController::head();
while(pCur) {
pCur->setTemperature(temp);
pCur = pCur->next();
}
}
void CFastLED::setCorrection(const struct CRGB & correction) {
CLEDController *pCur = CLEDController::head();
while(pCur) {
pCur->setCorrection(correction);
pCur = pCur->next();
}
}
void CFastLED::setDither(uint8_t ditherMode) {
CLEDController *pCur = CLEDController::head();
while(pCur) {
pCur->setDither(ditherMode);
pCur = pCur->next();
}
}
extern int noise_min;
extern int noise_max;
void CFastLED::countFPS(int nFrames) {
if(Serial) {
static int br = 0;
static uint32_t lastframe = 0; // millis();
br++;
if(br == nFrames) {
uint32_t now = millis();
Serial.print(lastframe); Serial.print("ms and now it is "); Serial.print(now); Serial.println("ms");
now -= lastframe;
uint32_t fps = (br * 1000) / now;
/*Serial.print('('); Serial.print(noise_min); Serial.print(','); Serial.print(noise_max); Serial.print(") "); */
Serial.print(now); Serial.print("ms for "); Serial.print(br); Serial.print(" frames, aka ");
Serial.print(fps); Serial.println(" fps. ");
br = 0;
lastframe = millis();
}
}
}
<|endoftext|>
|
<commit_before>// This file is distributed under the MIT license.
// See the LICENSE file for details.
#include "Support/CmdLine.h"
#include "Support/PrettyPrint.h"
#include "Support/StringSplit.h"
#include "CmdLineQt.h"
#include "CmdLineWithIndex.h"
#include <iostream>
#include <set>
using namespace support;
namespace support
{
namespace cl
{
template <class T, class U>
struct Parser<std::pair<T, U>>
{
bool operator ()(StringRef value, size_t i, std::pair<T, U>& result) const
{
auto p = strings::split(value, ":")();
return Parser<T>()(p.first.trim(), i, result.first)
&& Parser<U>()(p.second.trim(), i, result.second);
}
};
template <class T, class P>
void prettyPrint(std::ostream& stream, Option<T, P> const& option)
{
stream << option.getName() << ":\n";
stream << " count = " << option.getCount() << "\n";
stream << " value = " << pretty(option.get());
}
template <class T>
void prettyPrint(std::ostream& stream, WithIndex<T> const& x)
{
stream << "(" << x.index << ": " << pretty(x.value) << ")";
}
} // namespace cl
} // namespace support
int main(int argc, char* argv[])
{
//----------------------------------------------------------------------------------------------
cl::CmdLine cmd(argv[0], "A short description.\n\nA long description.");
//------------------------------------------------------------------------------
double y = -1.0;
auto y_ref = cl::makeOption<double&>(cmd, "y",
cl::ArgName("float"),
cl::Desc("Enter a floating-point number"),
cl::ArgRequired,
cl::init(y)
);
//------------------------------------------------------------------------------
auto g = cl::makeOption<bool>(cmd, "g", cl::Grouping, cl::ZeroOrMore);
auto h = cl::makeOption<bool>(cmd, "h", cl::Grouping, cl::ZeroOrMore);
auto gh = cl::makeOption<bool>(cmd, "gh", cl::Prefix, cl::ArgRequired);
//------------------------------------------------------------------------------
auto z = cl::makeOption<std::set<int>>(cmd, "z",
cl::ArgName("int"),
cl::Desc("A list of integers"),
cl::ZeroOrMore,
cl::ArgRequired,
cl::CommaSeparated
);
//------------------------------------------------------------------------------
std::initializer_list<cl::WithIndex<std::string>> Iinit {
"eins", "zwei", "drei", "vier", "funf"
};
auto I = cl::makeOption<std::vector<cl::WithIndex<std::string>>>(cmd, "I",
cl::ArgName("dir"),
cl::Desc("Add the directory dir to the list of directories to be searched for header files."),
cl::Prefix,
cl::ArgRequired,
cl::ZeroOrMore,
cl::init(Iinit)
);
//------------------------------------------------------------------------------
auto files = cl::makeOption<std::vector<std::string>>(cmd, "files",
cl::Positional,
cl::ZeroOrMore
);
//------------------------------------------------------------------------------
enum OptimizationLevel {
OL_None,
OL_Trivial,
OL_Default,
OL_Expensive
};
auto optParser = cl::MapParser<OptimizationLevel>({
{ "O0", OL_None },
{ "O1", OL_Trivial },
{ "O2", OL_Default },
{ "O3", OL_Expensive }
});
auto opt = cl::makeOptionWithParser<OptimizationLevel>(
optParser,
cmd,
cl::Required,
cl::ArgDisallowed,
cl::Desc("Choose an optimization level"),
cl::init(OL_None)
);
//------------------------------------------------------------------------------
enum Simpson {
Homer, Marge, Bart, Lisa, Maggie, SideshowBob
};
auto simpsonParser = cl::MapParser<Simpson>({
{ "homer", Homer },
{ "marge", Marge },
{ "bart", Bart },
{ "el barto", Bart },
{ "lisa", Lisa },
{ "maggie", Maggie }
});
auto simpson = cl::makeOptionWithParser<Simpson>(
simpsonParser,
cmd, "simpson",
cl::Desc("Choose a Simpson"),
cl::ArgRequired,
cl::init(SideshowBob)
);
//------------------------------------------------------------------------------
auto f = cl::makeOption<std::map<std::string, int>>(
cmd, "f",
cl::CommaSeparated,
cl::ArgRequired
);
//------------------------------------------------------------------------------
auto helpParser = [&](StringRef /*value*/, size_t /*i*/, bool & /*result*/)->bool
{
cmd.help();
exit(0);
};
auto help = cl::makeOptionWithParser<bool>(
helpParser,
cmd, "help",
cl::Optional
);
//----------------------------------------------------------------------------------------------
if (!cmd.parse({ argv + 1, argv + argc }, /*ignoreUnknowns*/ false))
{
for (auto const& s : cmd.getErrors())
std::cout << "error: " << s << "\n";
return -1;
}
//----------------------------------------------------------------------------------------------
std::cout << pretty(f) << std::endl;
std::cout << pretty(g) << std::endl;
std::cout << pretty(gh) << std::endl;
std::cout << pretty(h) << std::endl;
std::cout << pretty(help) << std::endl;
std::cout << pretty(I) << std::endl;
std::cout << pretty(opt) << std::endl;
std::cout << pretty(simpson) << std::endl;
std::cout << pretty(y_ref) << std::endl;
std::cout << pretty(z) << std::endl;
std::cout << "files:\n";
for (auto& s : files.get())
std::cout << " \"" << s << "\"" << std::endl;
//----------------------------------------------------------------------------------------------
return 0;
}
<commit_msg>Test with std::bind<commit_after>// This file is distributed under the MIT license.
// See the LICENSE file for details.
#include "Support/CmdLine.h"
#include "Support/PrettyPrint.h"
#include "Support/StringSplit.h"
#include "CmdLineQt.h"
#include "CmdLineWithIndex.h"
#include <functional>
#include <iostream>
#include <set>
using namespace support;
namespace support
{
namespace cl
{
template <class T, class U>
struct Parser<std::pair<T, U>>
{
bool operator ()(StringRef value, size_t i, std::pair<T, U>& result) const
{
auto p = strings::split(value, ":")();
return Parser<T>()(p.first.trim(), i, result.first)
&& Parser<U>()(p.second.trim(), i, result.second);
}
};
template <class T, class P>
void prettyPrint(std::ostream& stream, Option<T, P> const& option)
{
stream << option.getName() << ":\n";
stream << " count = " << option.getCount() << "\n";
stream << " value = " << pretty(option.get());
}
template <class T>
void prettyPrint(std::ostream& stream, WithIndex<T> const& x)
{
stream << "(" << x.index << ": " << pretty(x.value) << ")";
}
} // namespace cl
} // namespace support
int main(int argc, char* argv[])
{
//----------------------------------------------------------------------------------------------
cl::CmdLine cmd(argv[0], "A short description.\n\nA long description.");
//------------------------------------------------------------------------------
double y = -1.0;
auto y_ref = cl::makeOption<double&>(cmd, "y",
cl::ArgName("float"),
cl::Desc("Enter a floating-point number"),
cl::ArgRequired,
cl::init(y)
);
//------------------------------------------------------------------------------
auto g = cl::makeOption<bool>(cmd, "g", cl::Grouping, cl::ZeroOrMore);
auto h = cl::makeOption<bool>(cmd, "h", cl::Grouping, cl::ZeroOrMore);
auto gh = cl::makeOption<bool>(cmd, "gh", cl::Prefix, cl::ArgRequired);
//------------------------------------------------------------------------------
auto z = cl::makeOption<std::set<int>>(cmd, "z",
cl::ArgName("int"),
cl::Desc("A list of integers"),
cl::ZeroOrMore,
cl::ArgRequired,
cl::CommaSeparated
);
//------------------------------------------------------------------------------
std::initializer_list<cl::WithIndex<std::string>> Iinit {
"eins", "zwei", "drei", "vier", "funf"
};
auto I = cl::makeOption<std::vector<cl::WithIndex<std::string>>>(cmd, "I",
cl::ArgName("dir"),
cl::Desc("Add the directory dir to the list of directories to be searched for header files."),
cl::Prefix,
cl::ArgRequired,
cl::ZeroOrMore,
cl::init(Iinit)
);
//------------------------------------------------------------------------------
auto files = cl::makeOption<std::vector<std::string>>(cmd, "files",
cl::Positional,
cl::ZeroOrMore
);
//------------------------------------------------------------------------------
enum OptimizationLevel {
OL_None,
OL_Trivial,
OL_Default,
OL_Expensive
};
auto optParser = cl::MapParser<OptimizationLevel>({
{ "O0", OL_None },
{ "O1", OL_Trivial },
{ "O2", OL_Default },
{ "O3", OL_Expensive }
});
auto opt = cl::makeOptionWithParser<OptimizationLevel>(
optParser,
cmd,
cl::Required,
cl::ArgDisallowed,
cl::Desc("Choose an optimization level"),
cl::init(OL_None)
);
//------------------------------------------------------------------------------
enum Simpson {
Homer, Marge, Bart, Lisa, Maggie, SideshowBob
};
auto simpsonParser = cl::MapParser<Simpson>({
{ "homer", Homer },
{ "marge", Marge },
{ "bart", Bart },
{ "el barto", Bart },
{ "lisa", Lisa },
{ "maggie", Maggie }
});
auto simpson = cl::makeOptionWithParser<Simpson>(
simpsonParser,
cmd, "simpson",
cl::Desc("Choose a Simpson"),
cl::ArgRequired,
cl::init(SideshowBob)
);
//------------------------------------------------------------------------------
auto f = cl::makeOption<std::map<std::string, int>>(
cmd, "f",
cl::CommaSeparated,
cl::ArgRequired
);
//------------------------------------------------------------------------------
auto helpParser = [&](StringRef value) -> bool
{
std::cout << "Showing help for \"" << value << "\"\n";
cmd.help();
return true;
};
auto help = cl::makeOptionWithParser<std::string/*subcommand*/>(
std::bind(helpParser, std::placeholders::_1),
cmd, "help",
cl::Optional,
cl::Prefix,
cl::ArgOptional
);
//----------------------------------------------------------------------------------------------
bool success = cmd.parse({ argv + 1, argv + argc }, /*ignoreUnknowns*/ false);
if (help.getCount())
return 0;
if (!success)
{
for (auto const& s : cmd.getErrors())
std::cout << "error: " << s << "\n";
return -1;
}
//----------------------------------------------------------------------------------------------
std::cout << pretty(f) << std::endl;
std::cout << pretty(g) << std::endl;
std::cout << pretty(gh) << std::endl;
std::cout << pretty(h) << std::endl;
std::cout << pretty(help) << std::endl;
std::cout << pretty(I) << std::endl;
std::cout << pretty(opt) << std::endl;
std::cout << pretty(simpson) << std::endl;
std::cout << pretty(y_ref) << std::endl;
std::cout << pretty(z) << std::endl;
std::cout << "files:\n";
for (auto& s : files.get())
std::cout << " \"" << s << "\"" << std::endl;
//----------------------------------------------------------------------------------------------
return 0;
}
<|endoftext|>
|
<commit_before>#include <pcl/ModelCoefficients.h>
#include <pcl/point_types.h>
#include <pcl/io/pcd_io.h>
#include <pcl/features/normal_3d.h>
#include <pcl/filters/extract_indices.h>
#include <pcl/filters/voxel_grid.h>
#include <pcl/kdtree/kdtree.h>
#include <pcl/sample_consensus/method_types.h>
#include <pcl/sample_consensus/model_types.h>
#include <pcl/segmentation/sac_segmentation.h>
#include <pcl/segmentation/extract_clusters.h>
int
main (int argc, char** argv)
{
// Read in the cloud data
pcl::PCDReader reader;
pcl::PointCloud<pcl::PointXYZ>::Ptr cloud (new pcl::PointCloud<pcl::PointXYZ>);
reader.read ("table_scene_lms400.pcd", *cloud);
std::cout << "PointCloud before filtering has: " << cloud->points.size () << " data points." << std::endl; //*
// Create the filtering object: downsample the dataset using a leaf size of 1cm
pcl::VoxelGrid<pcl::PointXYZ> vg;
pcl::PointCloud<pcl::PointXYZ>::Ptr cloud_filtered (new pcl::PointCloud<pcl::PointXYZ>);
vg.setInputCloud (cloud);
vg.setLeafSize (0.01f, 0.01f, 0.01f);
vg.filter (*cloud_filtered);
std::cout << "PointCloud after filtering has: " << cloud_filtered->points.size () << " data points." << std::endl; //*
// Create the segmentation object for the planar model and set all the parameters
pcl::SACSegmentation<pcl::PointXYZ> seg;
pcl::PointIndices::Ptr inliers (new pcl::PointIndices);
pcl::ModelCoefficients::Ptr coefficients (new pcl::ModelCoefficients);
pcl::PointCloud<pcl::PointXYZ>::Ptr cloud_plane (new pcl::PointCloud<pcl::PointXYZ> ());
pcl::PCDWriter writer;
seg.setOptimizeCoefficients (true);
seg.setModelType (pcl::SACMODEL_PLANE);
seg.setMethodType (pcl::SAC_RANSAC);
seg.setMaxIterations (100);
seg.setDistanceThreshold (0.02);
int i=0, nr_points = (int) cloud_filtered->points.size ();
while (cloud_filtered->points.size () > 0.3 * nr_points)
{
// Segment the largest planar component from the remaining cloud
seg.setInputCloud(cloud_filtered);
seg.segment (*inliers, *coefficients); //*
if (inliers->indices.size () == 0)
{
std::cout << "Could not estimate a planar model for the given dataset." << std::endl;
break;
}
// Extract the planar inliers from the input cloud
pcl::ExtractIndices<pcl::PointXYZ> extract;
extract.setInputCloud (cloud_filtered);
extract.setIndices (inliers);
extract.setNegative (false);
// Write the planar inliers to disk
extract.filter (*cloud_plane); //*
std::cout << "PointCloud representing the planar component: " << cloud_plane->points.size () << " data points." << std::endl;
// Remove the planar inliers, extract the rest
extract.setNegative (true);
extract.filter (*cloud_filtered); //*
}
// Creating the KdTree object for the search method of the extraction
pcl::KdTree<pcl::PointXYZ>::Ptr tree (new pcl::KdTreeFLANN<pcl::PointXYZ>);
tree->setInputCloud (cloud_filtered);
std::vector<pcl::PointIndices> cluster_indices;
pcl::EuclideanClusterExtraction<pcl::PointXYZ> ec;
ec.setClusterTolerance (0.02); // 2cm
ec.setMinClusterSize (100);
ec.setMaxClusterSize (25000);
ec.setSearchMethod (tree);
ec.setInputCloud( cloud_filtered);
ec.extract (cluster_indices);
int j = 0;
for (std::vector<pcl::PointIndices>::const_iterator it = cluster_indices.begin (); it != cluster_indices.end (); ++it)
{
pcl::PointCloud<pcl::PointXYZ>::Ptr cloud_cluster (new pcl::PointCloud<pcl::PointXYZ>);
for (std::vector<int>::const_iterator pit = it->indices.begin (); pit != it->indices.end (); pit++)
cloud_cluster->points.push_back (cloud_filtered->points[*pit]); //*
std::cout << "PointCloud representing the Cluster: " << cloud_cluster->points.size () << " data points." << std::endl;
std::stringstream ss;
ss << "cloud_cluster_" << j << ".pcd";
writer.write<pcl::PointXYZ> (ss.str (), *cloud_cluster, false); //*
j++;
}
return (0);
}
<commit_msg>fix for the cluster_extraction tutorial, per #357 (thanks Anthony!)<commit_after>#include <pcl/ModelCoefficients.h>
#include <pcl/point_types.h>
#include <pcl/io/pcd_io.h>
#include <pcl/features/normal_3d.h>
#include <pcl/filters/extract_indices.h>
#include <pcl/filters/voxel_grid.h>
#include <pcl/kdtree/kdtree.h>
#include <pcl/sample_consensus/method_types.h>
#include <pcl/sample_consensus/model_types.h>
#include <pcl/segmentation/sac_segmentation.h>
#include <pcl/segmentation/extract_clusters.h>
int
main (int argc, char** argv)
{
// Read in the cloud data
pcl::PCDReader reader;
pcl::PointCloud<pcl::PointXYZ>::Ptr cloud (new pcl::PointCloud<pcl::PointXYZ>);
reader.read ("table_scene_lms400.pcd", *cloud);
std::cout << "PointCloud before filtering has: " << cloud->points.size () << " data points." << std::endl; //*
// Create the filtering object: downsample the dataset using a leaf size of 1cm
pcl::VoxelGrid<pcl::PointXYZ> vg;
pcl::PointCloud<pcl::PointXYZ>::Ptr cloud_filtered (new pcl::PointCloud<pcl::PointXYZ>);
vg.setInputCloud (cloud);
vg.setLeafSize (0.01f, 0.01f, 0.01f);
vg.filter (*cloud_filtered);
std::cout << "PointCloud after filtering has: " << cloud_filtered->points.size () << " data points." << std::endl; //*
// Create the segmentation object for the planar model and set all the parameters
pcl::SACSegmentation<pcl::PointXYZ> seg;
pcl::PointIndices::Ptr inliers (new pcl::PointIndices);
pcl::ModelCoefficients::Ptr coefficients (new pcl::ModelCoefficients);
pcl::PointCloud<pcl::PointXYZ>::Ptr cloud_plane (new pcl::PointCloud<pcl::PointXYZ> ());
pcl::PCDWriter writer;
seg.setOptimizeCoefficients (true);
seg.setModelType (pcl::SACMODEL_PLANE);
seg.setMethodType (pcl::SAC_RANSAC);
seg.setMaxIterations (100);
seg.setDistanceThreshold (0.02);
int i=0, nr_points = (int) cloud_filtered->points.size ();
while (cloud_filtered->points.size () > 0.3 * nr_points)
{
// Segment the largest planar component from the remaining cloud
seg.setInputCloud(cloud_filtered);
seg.segment (*inliers, *coefficients); //*
if (inliers->indices.size () == 0)
{
std::cout << "Could not estimate a planar model for the given dataset." << std::endl;
break;
}
// Extract the planar inliers from the input cloud
pcl::ExtractIndices<pcl::PointXYZ> extract;
extract.setInputCloud (cloud_filtered);
extract.setIndices (inliers);
extract.setNegative (false);
// Write the planar inliers to disk
extract.filter (*cloud_plane); //*
std::cout << "PointCloud representing the planar component: " << cloud_plane->points.size () << " data points." << std::endl;
// Remove the planar inliers, extract the rest
extract.setNegative (true);
extract.filter (*cloud_filtered); //*
}
// Creating the KdTree object for the search method of the extraction
pcl::KdTree<pcl::PointXYZ>::Ptr tree (new pcl::KdTreeFLANN<pcl::PointXYZ>);
tree->setInputCloud (cloud_filtered);
std::vector<pcl::PointIndices> cluster_indices;
pcl::EuclideanClusterExtraction<pcl::PointXYZ> ec;
ec.setClusterTolerance (0.02); // 2cm
ec.setMinClusterSize (100);
ec.setMaxClusterSize (25000);
ec.setSearchMethod (tree);
ec.setInputCloud( cloud_filtered);
ec.extract (cluster_indices);
int j = 0;
for (std::vector<pcl::PointIndices>::const_iterator it = cluster_indices.begin (); it != cluster_indices.end (); ++it)
{
pcl::PointCloud<pcl::PointXYZ>::Ptr cloud_cluster (new pcl::PointCloud<pcl::PointXYZ>);
for (std::vector<int>::const_iterator pit = it->indices.begin (); pit != it->indices.end (); pit++)
cloud_cluster->points.push_back (cloud_filtered->points[*pit]); //*
cloud_cluster->width = cloud_cluster->points.size ();
cloud_cluster->height = 1;
cloud_cluster->is_dense = true;
std::cout << "PointCloud representing the Cluster: " << cloud_cluster->points.size () << " data points." << std::endl;
std::stringstream ss;
ss << "cloud_cluster_" << j << ".pcd";
writer.write<pcl::PointXYZ> (ss.str (), *cloud_cluster, false); //*
j++;
}
return (0);
}
<|endoftext|>
|
<commit_before>/*
* This file is part of the Sqloxx project and is distributed under the
* terms of the license contained in the file LICENSE.txt distributed
* with this package.
*
* Author: Matthew Harvey <matthew@matthewharvey.net>
*
* Copyright (c) 2012-2013, Matthew Harvey.
*
* 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 "example.hpp"
#include "handle.hpp"
#include "sqloxx_tests_common.hpp"
#include <jewel/optional.hpp>
#include <UnitTest++/UnitTest++.h>
#include <utility>
using jewel::UninitializedOptionalException;
using std::move;
namespace sqloxx
{
namespace tests
{
TEST_FIXTURE(ExampleFixture, handle_constructors)
{
JEWEL_LOG_TRACE();
Handle<ExampleA> const dpo0;
CHECK(!dpo0);
CHECK_THROW(*dpo0, UnboundHandleException);
CHECK_THROW(dpo0->x(), UnboundHandleException);
Handle<ExampleA> const dpo1(*pdbc);
dpo1->set_x(10);
CHECK_EQUAL(dpo1->x(), 10);
dpo1->set_y(50000.9812);
CHECK_EQUAL(dpo1->y(), 50000.9812);
dpo1->save();
Handle<ExampleA> const dpo1b(*pdbc, 1);
CHECK_EQUAL(dpo1b->x(), 10);
CHECK_EQUAL(dpo1b->y(), 50000.9812);
Handle<ExampleA> dpo2(*pdbc);
dpo2->set_x(503);
dpo2->set_y(-1.3);
dpo2->save();
Handle<ExampleA> const dpo2b(*pdbc, 2);
CHECK_EQUAL(dpo2b->x(), 503);
CHECK_EQUAL(dpo2b->y(), -1.3);
Handle<ExampleA> dpo2c(*pdbc, 2);
CHECK_EQUAL(dpo2c->y(), -1.3);
CHECK_EQUAL(dpo2c->x(), 503);
CHECK_THROW
( Handle<ExampleA> const dpo3(*pdbc, 3),
sqloxx::BadIdentifier
);
CHECK_THROW
( Handle<ExampleA> dpo0(*pdbc, 0),
sqloxx::BadIdentifier
);
JEWEL_LOG_TRACE();
}
TEST_FIXTURE(ExampleFixture, handle_create_unchecked)
{
JEWEL_LOG_TRACE();
Handle<ExampleA> const dpo1(*pdbc);
dpo1->set_x(10);
CHECK_EQUAL(dpo1->x(), 10);
dpo1->set_y(50000.9812);
CHECK_EQUAL(dpo1->y(), 50000.9812);
dpo1->save();
Handle<ExampleA> const dpo1b =
Handle<ExampleA>::create_unchecked(*pdbc, 1);
CHECK_EQUAL(dpo1b->x(), 10);
CHECK_EQUAL(dpo1b->y(), 50000.9812);
Handle<ExampleA> dpo2(*pdbc);
dpo2->set_x(503);
dpo2->set_y(-1.3);
dpo2->save();
CHECK_EQUAL(Handle<ExampleA>::create_unchecked(*pdbc, 2)->x(), 503);
Handle<ExampleA> const dpo2b
( Handle<ExampleA>::create_unchecked(*pdbc, 2)
);
CHECK_EQUAL(dpo2b->y(), -1.3);
JEWEL_LOG_TRACE();
}
TEST_FIXTURE(ExampleFixture, handle_copy_constructor_and_indirection)
{
Handle<ExampleA> dpo1(*pdbc);
dpo1->set_x(-9);
Handle<ExampleA> dpo2(dpo1);
dpo2->set_y(102928);
CHECK_EQUAL(dpo2->x(), -9);
dpo2->save();
CHECK_EQUAL(dpo1->id(), 1);
CHECK_EQUAL(dpo2->id(), dpo1->id());
CHECK_EQUAL(dpo1->y(), 102928);
Handle<ExampleA> dpo3(dpo1);
CHECK_EQUAL(dpo3->id(), 1);
CHECK_EQUAL(dpo3->y(), 102928);
CHECK_EQUAL(dpo3->x(), dpo1->x());
}
TEST_FIXTURE(ExampleFixture, handle_move_constructor_and_indirection)
{
Handle<ExampleA> dpo1(*pdbc);
dpo1->set_x(-9);
dpo1->set_y(102928);
dpo1->save();
Handle<ExampleA> dpo2(move(dpo1));
// dpo1 is now "taboo".
CHECK_EQUAL(dpo2->id(), 1);
CHECK_EQUAL(dpo2->y(), 102928);
CHECK_EQUAL(dpo2->x(), -9);
}
TEST_FIXTURE(ExampleFixture, handle_assignment_and_indirection)
{
Handle<ExampleA> dpo1(*pdbc);
Handle<ExampleA> dpo2(*pdbc);
dpo2->set_x(100);
dpo2->set_y(0.0112);
dpo2->save();
dpo1->set_x(897);
dpo1->set_y(30978);
dpo2 = dpo1; // copy assignment
CHECK_EQUAL(dpo2->x(), dpo1->x());
CHECK_EQUAL(dpo2->y(), 30978);
dpo1->save();
CHECK_EQUAL(dpo2->id(), 2);
Handle<ExampleA> dpo3(*pdbc, 1);
CHECK_EQUAL(dpo3->id(), 1);
dpo3->set_x(-188342392);
dpo1 = dpo3; // copy assignment
CHECK_EQUAL(dpo1->x(), -188342392);
dpo1->set_y(50);
CHECK_EQUAL(dpo1->y(), 50);
dpo1->save();
CHECK_EQUAL(dpo3->id(), 1);
Handle<ExampleA> dpo4(*pdbc);
dpo4 = Handle<ExampleA>(*pdbc, 2); // move assignment
CHECK_EQUAL(dpo4->x(), 897);
CHECK_EQUAL(dpo4->y(), 30978);
dpo4 = Handle<ExampleA>(); // move assignment
CHECK(!dpo4);
dpo4 = Handle<ExampleA>(*pdbc); // move assignment
CHECK(dpo4);
}
TEST_FIXTURE(ExampleFixture, handle_dereferencing)
{
Handle<ExampleA> dpo1(*pdbc);
dpo1->set_x(10);
dpo1->set_y(1278.90172);
dpo1->save();
ExampleA& dpo1_dereferenced(*dpo1);
CHECK_EQUAL(dpo1_dereferenced.y(), dpo1->y());
CHECK_EQUAL((*dpo1).y(), dpo1->y());
CHECK_EQUAL(dpo1_dereferenced.id(), dpo1->id());
CHECK_EQUAL(dpo1_dereferenced.x(), 10);
dpo1_dereferenced.set_y(.504);
CHECK_EQUAL(dpo1->y(), 0.504);
Handle<ExampleA> dpo2(*pdbc);
ExampleA& dpo2_dereferenced = *dpo2;
dpo2_dereferenced.set_x(8000);
dpo2_dereferenced.set_y(140);
CHECK_EQUAL((*dpo2).x(), dpo2_dereferenced.x());
CHECK_EQUAL(dpo2->y(), (*dpo2).y());
CHECK_EQUAL(dpo2->y(), 140);
Handle<ExampleA> dpo4;
CHECK_THROW(dpo4->y(), UnboundHandleException);
CHECK_THROW(*dpo4, UnboundHandleException);
}
TEST_FIXTURE(ExampleFixture, handle_conversion_to_bool)
{
Handle<ExampleA> dpo1(*pdbc);
CHECK(dpo1);
CHECK_EQUAL(static_cast<bool>(dpo1), true);
CHECK(dpo1);
dpo1->set_y(139000000);
dpo1->set_x(7);
dpo1->save();
CHECK(dpo1);
// Handle is still valid after underlying object has
// been removed from the database.
dpo1->remove();
CHECK(dpo1);
CHECK_EQUAL(dpo1->x(), 7);
CHECK_THROW(dpo1->id(), UninitializedOptionalException);
CHECK_EQUAL(static_cast<bool>(dpo1), true);
CHECK(static_cast<bool>(dpo1));
// However handle is not valid if completely uninitialized.
Handle<ExampleA> dpo2;
CHECK_EQUAL(static_cast<bool>(dpo2), false);
dpo1 = dpo2;
CHECK_EQUAL(static_cast<bool>(dpo2), false);
CHECK(!dpo2);
}
TEST_FIXTURE(ExampleFixture, handle_equality_and_inequality)
{
Handle<ExampleA> dpo1(*pdbc);
Handle<ExampleA> dpo2(dpo1);
CHECK(dpo1 == dpo2);
CHECK(dpo2 == dpo1);
Handle<ExampleA> const dpo3(*pdbc);
dpo3->set_x(109);
dpo3->set_y(.5);
dpo3->save();
CHECK(dpo3 != dpo1);
CHECK(dpo2 != dpo3);
Handle<ExampleA> dpo4(*pdbc, 1);
CHECK(dpo4 == dpo3);
CHECK(dpo3 == dpo4);
Handle<ExampleA> const dpo5(*pdbc);
dpo5->save();
Handle<ExampleA> const dpo6(*pdbc, 2);
CHECK(dpo6 == dpo5);
CHECK(dpo5 == dpo6);
CHECK(dpo6 != dpo4);
CHECK(dpo3 != dpo6);
CHECK(dpo4 != dpo6);
}
TEST_FIXTURE(ExampleFixture, handle_cast_test)
{
Handle<ExampleC> dpoc1(*pdbc);
dpoc1->set_s("hello");
dpoc1->set_p(3);
dpoc1->set_q(50);
dpoc1->save();
Handle<ExampleC> dpoc2(*pdbc);
dpoc2->set_s("goodbye");
dpoc2->set_p(-309);
dpoc2->set_q(501);
dpoc2->save();
Handle<ExampleB> dpob1;
CHECK_THROW(*dpob1, UnboundHandleException);
dpob1 = handle_cast<ExampleB>(dpoc2);
CHECK(dpob1);
CHECK_EQUAL(dpob1->id(), 2);
CHECK_EQUAL(dpob1->s(), "goodbye");
Handle<ExampleB> dpob2 = handle_cast<ExampleB>(dpob1);
CHECK(dpob2);
CHECK_EQUAL(dpob2->id(), 2);
CHECK_EQUAL(dpob2->s(), "goodbye");
dpob2->set_s("yeah");
CHECK_EQUAL(dpoc2->s(), "yeah");
CHECK_EQUAL(dpob1->s(), "yeah");
dpoc2->set_s("mmm");
CHECK_EQUAL(dpob2->s(), "mmm");
Handle<ExampleC> dpoc3;
CHECK(!dpoc3);
dpoc3 = handle_cast<ExampleC>(dpob2);
CHECK(dpoc3);
CHECK_EQUAL(dpoc3->q(), 501);
CHECK_EQUAL(dpoc3->id(), 2);
CHECK_EQUAL(dpoc3->p(), -309);
CHECK_EQUAL(dpoc3->s(), "mmm");
Handle<ExampleB> dpoc4;
dpoc3 = handle_cast<ExampleC>(dpoc4);
CHECK_THROW(dpoc3->s(), UnboundHandleException);
CHECK_THROW(dpoc3->p(), UnboundHandleException);
CHECK(!dpoc3);
}
} // namespace tests
} // namespace sqloxx
<commit_msg>Fixed compilation warning re. shadowed variable in test.<commit_after>/*
* This file is part of the Sqloxx project and is distributed under the
* terms of the license contained in the file LICENSE.txt distributed
* with this package.
*
* Author: Matthew Harvey <matthew@matthewharvey.net>
*
* Copyright (c) 2012-2013, Matthew Harvey.
*
* 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 "example.hpp"
#include "handle.hpp"
#include "sqloxx_tests_common.hpp"
#include <jewel/optional.hpp>
#include <UnitTest++/UnitTest++.h>
#include <utility>
using jewel::UninitializedOptionalException;
using std::move;
namespace sqloxx
{
namespace tests
{
TEST_FIXTURE(ExampleFixture, handle_constructors)
{
JEWEL_LOG_TRACE();
Handle<ExampleA> const dpo0;
CHECK(!dpo0);
CHECK_THROW(*dpo0, UnboundHandleException);
CHECK_THROW(dpo0->x(), UnboundHandleException);
Handle<ExampleA> const dpo1(*pdbc);
dpo1->set_x(10);
CHECK_EQUAL(dpo1->x(), 10);
dpo1->set_y(50000.9812);
CHECK_EQUAL(dpo1->y(), 50000.9812);
dpo1->save();
Handle<ExampleA> const dpo1b(*pdbc, 1);
CHECK_EQUAL(dpo1b->x(), 10);
CHECK_EQUAL(dpo1b->y(), 50000.9812);
Handle<ExampleA> dpo2(*pdbc);
dpo2->set_x(503);
dpo2->set_y(-1.3);
dpo2->save();
Handle<ExampleA> const dpo2b(*pdbc, 2);
CHECK_EQUAL(dpo2b->x(), 503);
CHECK_EQUAL(dpo2b->y(), -1.3);
Handle<ExampleA> dpo2c(*pdbc, 2);
CHECK_EQUAL(dpo2c->y(), -1.3);
CHECK_EQUAL(dpo2c->x(), 503);
CHECK_THROW
( Handle<ExampleA> const dpo3(*pdbc, 3),
sqloxx::BadIdentifier
);
CHECK_THROW
( Handle<ExampleA> dpo100(*pdbc, 0),
sqloxx::BadIdentifier
);
JEWEL_LOG_TRACE();
}
TEST_FIXTURE(ExampleFixture, handle_create_unchecked)
{
JEWEL_LOG_TRACE();
Handle<ExampleA> const dpo1(*pdbc);
dpo1->set_x(10);
CHECK_EQUAL(dpo1->x(), 10);
dpo1->set_y(50000.9812);
CHECK_EQUAL(dpo1->y(), 50000.9812);
dpo1->save();
Handle<ExampleA> const dpo1b =
Handle<ExampleA>::create_unchecked(*pdbc, 1);
CHECK_EQUAL(dpo1b->x(), 10);
CHECK_EQUAL(dpo1b->y(), 50000.9812);
Handle<ExampleA> dpo2(*pdbc);
dpo2->set_x(503);
dpo2->set_y(-1.3);
dpo2->save();
CHECK_EQUAL(Handle<ExampleA>::create_unchecked(*pdbc, 2)->x(), 503);
Handle<ExampleA> const dpo2b
( Handle<ExampleA>::create_unchecked(*pdbc, 2)
);
CHECK_EQUAL(dpo2b->y(), -1.3);
JEWEL_LOG_TRACE();
}
TEST_FIXTURE(ExampleFixture, handle_copy_constructor_and_indirection)
{
Handle<ExampleA> dpo1(*pdbc);
dpo1->set_x(-9);
Handle<ExampleA> dpo2(dpo1);
dpo2->set_y(102928);
CHECK_EQUAL(dpo2->x(), -9);
dpo2->save();
CHECK_EQUAL(dpo1->id(), 1);
CHECK_EQUAL(dpo2->id(), dpo1->id());
CHECK_EQUAL(dpo1->y(), 102928);
Handle<ExampleA> dpo3(dpo1);
CHECK_EQUAL(dpo3->id(), 1);
CHECK_EQUAL(dpo3->y(), 102928);
CHECK_EQUAL(dpo3->x(), dpo1->x());
}
TEST_FIXTURE(ExampleFixture, handle_move_constructor_and_indirection)
{
Handle<ExampleA> dpo1(*pdbc);
dpo1->set_x(-9);
dpo1->set_y(102928);
dpo1->save();
Handle<ExampleA> dpo2(move(dpo1));
// dpo1 is now "taboo".
CHECK_EQUAL(dpo2->id(), 1);
CHECK_EQUAL(dpo2->y(), 102928);
CHECK_EQUAL(dpo2->x(), -9);
}
TEST_FIXTURE(ExampleFixture, handle_assignment_and_indirection)
{
Handle<ExampleA> dpo1(*pdbc);
Handle<ExampleA> dpo2(*pdbc);
dpo2->set_x(100);
dpo2->set_y(0.0112);
dpo2->save();
dpo1->set_x(897);
dpo1->set_y(30978);
dpo2 = dpo1; // copy assignment
CHECK_EQUAL(dpo2->x(), dpo1->x());
CHECK_EQUAL(dpo2->y(), 30978);
dpo1->save();
CHECK_EQUAL(dpo2->id(), 2);
Handle<ExampleA> dpo3(*pdbc, 1);
CHECK_EQUAL(dpo3->id(), 1);
dpo3->set_x(-188342392);
dpo1 = dpo3; // copy assignment
CHECK_EQUAL(dpo1->x(), -188342392);
dpo1->set_y(50);
CHECK_EQUAL(dpo1->y(), 50);
dpo1->save();
CHECK_EQUAL(dpo3->id(), 1);
Handle<ExampleA> dpo4(*pdbc);
dpo4 = Handle<ExampleA>(*pdbc, 2); // move assignment
CHECK_EQUAL(dpo4->x(), 897);
CHECK_EQUAL(dpo4->y(), 30978);
dpo4 = Handle<ExampleA>(); // move assignment
CHECK(!dpo4);
dpo4 = Handle<ExampleA>(*pdbc); // move assignment
CHECK(dpo4);
}
TEST_FIXTURE(ExampleFixture, handle_dereferencing)
{
Handle<ExampleA> dpo1(*pdbc);
dpo1->set_x(10);
dpo1->set_y(1278.90172);
dpo1->save();
ExampleA& dpo1_dereferenced(*dpo1);
CHECK_EQUAL(dpo1_dereferenced.y(), dpo1->y());
CHECK_EQUAL((*dpo1).y(), dpo1->y());
CHECK_EQUAL(dpo1_dereferenced.id(), dpo1->id());
CHECK_EQUAL(dpo1_dereferenced.x(), 10);
dpo1_dereferenced.set_y(.504);
CHECK_EQUAL(dpo1->y(), 0.504);
Handle<ExampleA> dpo2(*pdbc);
ExampleA& dpo2_dereferenced = *dpo2;
dpo2_dereferenced.set_x(8000);
dpo2_dereferenced.set_y(140);
CHECK_EQUAL((*dpo2).x(), dpo2_dereferenced.x());
CHECK_EQUAL(dpo2->y(), (*dpo2).y());
CHECK_EQUAL(dpo2->y(), 140);
Handle<ExampleA> dpo4;
CHECK_THROW(dpo4->y(), UnboundHandleException);
CHECK_THROW(*dpo4, UnboundHandleException);
}
TEST_FIXTURE(ExampleFixture, handle_conversion_to_bool)
{
Handle<ExampleA> dpo1(*pdbc);
CHECK(dpo1);
CHECK_EQUAL(static_cast<bool>(dpo1), true);
CHECK(dpo1);
dpo1->set_y(139000000);
dpo1->set_x(7);
dpo1->save();
CHECK(dpo1);
// Handle is still valid after underlying object has
// been removed from the database.
dpo1->remove();
CHECK(dpo1);
CHECK_EQUAL(dpo1->x(), 7);
CHECK_THROW(dpo1->id(), UninitializedOptionalException);
CHECK_EQUAL(static_cast<bool>(dpo1), true);
CHECK(static_cast<bool>(dpo1));
// However handle is not valid if completely uninitialized.
Handle<ExampleA> dpo2;
CHECK_EQUAL(static_cast<bool>(dpo2), false);
dpo1 = dpo2;
CHECK_EQUAL(static_cast<bool>(dpo2), false);
CHECK(!dpo2);
}
TEST_FIXTURE(ExampleFixture, handle_equality_and_inequality)
{
Handle<ExampleA> dpo1(*pdbc);
Handle<ExampleA> dpo2(dpo1);
CHECK(dpo1 == dpo2);
CHECK(dpo2 == dpo1);
Handle<ExampleA> const dpo3(*pdbc);
dpo3->set_x(109);
dpo3->set_y(.5);
dpo3->save();
CHECK(dpo3 != dpo1);
CHECK(dpo2 != dpo3);
Handle<ExampleA> dpo4(*pdbc, 1);
CHECK(dpo4 == dpo3);
CHECK(dpo3 == dpo4);
Handle<ExampleA> const dpo5(*pdbc);
dpo5->save();
Handle<ExampleA> const dpo6(*pdbc, 2);
CHECK(dpo6 == dpo5);
CHECK(dpo5 == dpo6);
CHECK(dpo6 != dpo4);
CHECK(dpo3 != dpo6);
CHECK(dpo4 != dpo6);
}
TEST_FIXTURE(ExampleFixture, handle_cast_test)
{
Handle<ExampleC> dpoc1(*pdbc);
dpoc1->set_s("hello");
dpoc1->set_p(3);
dpoc1->set_q(50);
dpoc1->save();
Handle<ExampleC> dpoc2(*pdbc);
dpoc2->set_s("goodbye");
dpoc2->set_p(-309);
dpoc2->set_q(501);
dpoc2->save();
Handle<ExampleB> dpob1;
CHECK_THROW(*dpob1, UnboundHandleException);
dpob1 = handle_cast<ExampleB>(dpoc2);
CHECK(dpob1);
CHECK_EQUAL(dpob1->id(), 2);
CHECK_EQUAL(dpob1->s(), "goodbye");
Handle<ExampleB> dpob2 = handle_cast<ExampleB>(dpob1);
CHECK(dpob2);
CHECK_EQUAL(dpob2->id(), 2);
CHECK_EQUAL(dpob2->s(), "goodbye");
dpob2->set_s("yeah");
CHECK_EQUAL(dpoc2->s(), "yeah");
CHECK_EQUAL(dpob1->s(), "yeah");
dpoc2->set_s("mmm");
CHECK_EQUAL(dpob2->s(), "mmm");
Handle<ExampleC> dpoc3;
CHECK(!dpoc3);
dpoc3 = handle_cast<ExampleC>(dpob2);
CHECK(dpoc3);
CHECK_EQUAL(dpoc3->q(), 501);
CHECK_EQUAL(dpoc3->id(), 2);
CHECK_EQUAL(dpoc3->p(), -309);
CHECK_EQUAL(dpoc3->s(), "mmm");
Handle<ExampleB> dpoc4;
dpoc3 = handle_cast<ExampleC>(dpoc4);
CHECK_THROW(dpoc3->s(), UnboundHandleException);
CHECK_THROW(dpoc3->p(), UnboundHandleException);
CHECK(!dpoc3);
}
} // namespace tests
} // namespace sqloxx
<|endoftext|>
|
<commit_before>// This program takes two args:
// 1. the path to the sites file, like /foo/sites/sites.tsv
// 2. the path to the augmented pheno directory, like /foo/augmented_phenos/
// The augmented pheno files must look somewhat like:
// chr pos ref alt rsids nearest_genes maf pval
// 1 49298 T C rs10399793 OR4G4P 0.36596 0.73483
// 1 54676 C T rs2462492 OR4G4P 0.3857 0.52691
// The sites file is like that but with only [chr, pos, ref, alt, rsid, nearest_genes] and without headers.
// Every augmented pheno file must be a subsequence of the sites file.
// This program will print the full matrix to stdout.
#include <iterator>
#include <iostream>
#include <fstream>
#include <sstream>
#include <vector>
#include <string>
#include <glob.h>
#include <assert.h>
#include <stdlib.h>
#include <sys/resource.h> // setrlimit
#include <stdio.h>
#include <errno.h>
std::vector<std::string> glob(const std::string& pat) {
// From <http://stackoverflow.com/a/8615450/1166306>
glob_t glob_result;
glob(pat.c_str(),GLOB_TILDE,NULL,&glob_result);
std::vector<std::string> ret;
for(unsigned int i=0;i<glob_result.gl_pathc;++i){
ret.push_back(std::string(glob_result.gl_pathv[i]));
}
globfree(&glob_result);
return ret;
}
class CSVRow { // From <http://stackoverflow.com/questions/1120140/how-can-i-read-and-parse-csv-files-in-c>
public:
std::string const& operator[](std::size_t index) const { return m_data[index]; }
std::size_t size() const { return m_data.size(); }
void readNextRow(std::istream& str) {
std::string line;
std::getline(str, line);
// CR remover from <http://stackoverflow.com/a/2529011/1166306>
if (!line.empty() && line[line.size() - 1] == '\r')
line.erase(line.size() - 1);
std::stringstream lineStream(line);
std::string cell;
m_data.clear();
while(std::getline(lineStream, cell, '\t')) {
m_data.push_back(cell);
}
if (!lineStream && cell.empty()) { //check for trailing empty cell
m_data.push_back("");
}
}
private:
std::vector<std::string> m_data;
};
std::istream& operator>>(std::istream& str, CSVRow& data) {
data.readNextRow(str);
return str;
}
class CSVIterator {
public:
typedef std::input_iterator_tag iterator_category;
typedef CSVRow value_type;
typedef std::size_t difference_type;
typedef CSVRow *pointer;
typedef CSVRow &reference;
CSVIterator(std::istream& stream) : m_str(stream.good()?&stream:NULL) { ++(*this); }
CSVIterator(std::ifstream& stream) : m_str(stream.good()?&stream:NULL) { ++(*this); }
CSVIterator() : m_str(NULL) {}
CSVIterator& operator++() {
if (m_str) {
if (!((*m_str) >> m_row)){
m_str = NULL;
}
}
return *this;
}
CSVIterator operator++(int) {
CSVIterator tmp(*this);
++(*this);
return tmp;
}
CSVRow const& operator*() const { return m_row; }
CSVRow const* operator->() const { return &m_row; }
bool operator==(CSVIterator const& rhs) { return ((this == &rhs) || ((this->m_str == NULL) && (rhs.m_str == NULL))); }
bool operator!=(CSVIterator const& rhs) { return !((*this) == rhs); }
private:
std::istream *m_str;
CSVRow m_row;
};
class ColIdx {
// TODO: Long-term, how can we support arbitrary columns?
public:
int CHR_COL = -1;
int POS_COL = -1;
int REF_COL = -1;
int ALT_COL = -1;
int RSID_COL = -1;
int GENE_COL = -1;
int MAF_COL = -1;
int PVAL_COL = -1;
int BETA_COL = -1;
int SEBETA_COL = -1;
};
bool is_empty(std::ifstream& f)
{
return f.peek() == std::ifstream::traits_type::eof();
}
void set_ulimit_num_files(unsigned num_files) {
struct rlimit limit;
limit.rlim_cur = num_files;
limit.rlim_max = num_files;
if (setrlimit(RLIMIT_NOFILE, &limit) != 0) {
std::cerr << "setrlimit() failed with errno=" << errno << "\n";
exit(1);
}
}
int main(int argc, char** argv) {
//sites file
std::string sites_fname = argv[1];
std::ifstream sites_file(sites_fname);
CSVIterator sites_it(sites_file);
const int SITES_CHR_COL = 0;
const int SITES_POS_COL = 1;
const int SITES_REF_COL = 2;
const int SITES_ALT_COL = 3;
const int SITES_RSID_COL = 4;
const int SITES_GENE_COL = 5;
// augmented_pheno files
std::string phenos_dir = argv[2];
phenos_dir += "/*";
std::vector<std::string> aug_fpaths = glob(phenos_dir.c_str());
std::vector<std::string> aug_fnames(aug_fpaths.size());
std::vector<std::ifstream*> aug_files(aug_fpaths.size()); // ifstreams have a problem with copies, so just pre-allocate.
std::vector<CSVIterator*> aug_its(aug_fpaths.size());
std::vector<ColIdx> aug_colidx(aug_fpaths.size());
set_ulimit_num_files(aug_fpaths.size() + 5); // stdin, stdout, stderr, sites_file, ???
for (size_t i = 0; i != aug_fnames.size(); i++) {
aug_fnames[i] = aug_fpaths[i];
size_t last_slash_idx = aug_fnames[i].find_last_of("/");
if (std::string::npos != last_slash_idx) {
aug_fnames[i].erase(0, last_slash_idx + 1);
}
std::ifstream* f = new std::ifstream(aug_fpaths[i].c_str());
aug_files[i] = f;
CSVIterator *it = new CSVIterator(*f);
aug_its[i] = it;
CSVRow row = **aug_its[i];
for (int fieldname_index = 0; fieldname_index < row.size(); fieldname_index++) {
if (row[fieldname_index] == "chrom") {
aug_colidx[i].CHR_COL = fieldname_index;
} else if (row[fieldname_index] == "pos") {
aug_colidx[i].POS_COL = fieldname_index;
} else if (row[fieldname_index] == "ref") {
aug_colidx[i].REF_COL = fieldname_index;
} else if (row[fieldname_index] == "alt") {
aug_colidx[i].ALT_COL = fieldname_index;
} else if (row[fieldname_index] == "rsids") {
aug_colidx[i].RSID_COL = fieldname_index;
} else if (row[fieldname_index] == "nearest_genes") {
aug_colidx[i].GENE_COL = fieldname_index;
} else if (row[fieldname_index] == "maf") {
aug_colidx[i].MAF_COL = fieldname_index;
} else if (row[fieldname_index] == "pval") {
aug_colidx[i].PVAL_COL = fieldname_index;
} else if (row[fieldname_index] == "beta") {
aug_colidx[i].BETA_COL = fieldname_index;
} else if (row[fieldname_index] == "sebeta") {
aug_colidx[i].SEBETA_COL = fieldname_index;
} else {
std::cerr << "What is this column \"" << row[fieldname_index] << "\"?" << std::endl;
return 1;
}
}
(*aug_its[i])++; // go past header.
// TODO: can I: row = (*aug_its[i])++; ?
}
// Print header line.
std::cout << "#chrom\tpos\tref\talt\trsids\tnearest_genes\tmaf";
for (size_t i = 0; i != aug_fnames.size(); i++) {
std::cout << "\tpval@" << aug_fnames[i];
if (aug_colidx[i].BETA_COL != -1) {
std::cout << "\tbeta@" << aug_fnames[i];
}
if (aug_colidx[i].SEBETA_COL != -1) {
std::cout << "\tsebeta@" << aug_fnames[i];
}
}
std::cout << "\n";
// Combine the remaining lines of each file.
for(; sites_it != CSVIterator(); ++sites_it) {
CSVRow sites_row = *sites_it;
std::cout << sites_row[SITES_CHR_COL] << "\t"
<< sites_row[SITES_POS_COL] << "\t"
<< sites_row[SITES_REF_COL] << "\t"
<< sites_row[SITES_ALT_COL] << "\t"
<< sites_row[SITES_RSID_COL] << "\t"
<< sites_row[SITES_GENE_COL] << "\t";
int num_mafs = 0;
double maf = 0;
std::ostringstream all_the_rest; // gotta hold these while you calculate avg maf
for (size_t i = 0; i < aug_fnames.size(); i++) {
if (*aug_its[i] == CSVIterator()) {
// just print blanks and continue
all_the_rest << "\t.";
if (aug_colidx[i].BETA_COL != -1) all_the_rest << "\t.";
if (aug_colidx[i].SEBETA_COL != -1) all_the_rest << "\t.";
continue;
}
// load current variant
CSVRow row = **aug_its[i];
if (row[aug_colidx[i].CHR_COL] == sites_row[SITES_CHR_COL] &&
row[aug_colidx[i].POS_COL] == sites_row[SITES_POS_COL] &&
row[aug_colidx[i].REF_COL] == sites_row[SITES_REF_COL] &&
row[aug_colidx[i].ALT_COL] == sites_row[SITES_ALT_COL]) {
// print row
if (row[aug_colidx[i].RSID_COL] != sites_row[SITES_RSID_COL]) {
std::cerr << "rsids disagree: [" << row[aug_colidx[i].RSID_COL] << "] [" << sites_row[SITES_RSID_COL] << "]" << std::endl;
exit(1);
}
if (row[aug_colidx[i].GENE_COL] != sites_row[SITES_GENE_COL]) {
std::cerr << "genes disagree: [" << row[aug_colidx[i].GENE_COL] << "] [" << sites_row[SITES_GENE_COL] << "]" << std::endl;
exit(1);
}
maf += atof(row[aug_colidx[i].MAF_COL].c_str());
num_mafs++;
all_the_rest << "\t" << row[aug_colidx[i].PVAL_COL];
if (aug_colidx[i].BETA_COL != -1) all_the_rest << "\t" << row[aug_colidx[i].BETA_COL];
if (aug_colidx[i].SEBETA_COL != -1) all_the_rest << "\t" << row[aug_colidx[i].BETA_COL];
(*aug_its[i])++;
} else {
// print blanks
all_the_rest << "\t.";
if (aug_colidx[i].BETA_COL != -1) all_the_rest << "\t.";
if (aug_colidx[i].SEBETA_COL != -1) all_the_rest << "\t.";
}
}
std::cout << maf/num_mafs << "\t" << all_the_rest.str() << "\n";
}
}
<commit_msg>Remove extra tab from matrix.tsv.gz<commit_after>// This program takes two args:
// 1. the path to the sites file, like /foo/sites/sites.tsv
// 2. the path to the augmented pheno directory, like /foo/augmented_phenos/
// The augmented pheno files must look somewhat like:
// chr pos ref alt rsids nearest_genes maf pval
// 1 49298 T C rs10399793 OR4G4P 0.36596 0.73483
// 1 54676 C T rs2462492 OR4G4P 0.3857 0.52691
// The sites file is like that but with only [chr, pos, ref, alt, rsid, nearest_genes] and without headers.
// Every augmented pheno file must be a subsequence of the sites file.
// This program will print the full matrix to stdout.
#include <iterator>
#include <iostream>
#include <fstream>
#include <sstream>
#include <vector>
#include <string>
#include <glob.h>
#include <assert.h>
#include <stdlib.h>
#include <sys/resource.h> // setrlimit
#include <stdio.h>
#include <errno.h>
std::vector<std::string> glob(const std::string& pat) {
// From <http://stackoverflow.com/a/8615450/1166306>
glob_t glob_result;
glob(pat.c_str(),GLOB_TILDE,NULL,&glob_result);
std::vector<std::string> ret;
for(unsigned int i=0;i<glob_result.gl_pathc;++i){
ret.push_back(std::string(glob_result.gl_pathv[i]));
}
globfree(&glob_result);
return ret;
}
class CSVRow { // From <http://stackoverflow.com/questions/1120140/how-can-i-read-and-parse-csv-files-in-c>
public:
std::string const& operator[](std::size_t index) const { return m_data[index]; }
std::size_t size() const { return m_data.size(); }
void readNextRow(std::istream& str) {
std::string line;
std::getline(str, line);
// CR remover from <http://stackoverflow.com/a/2529011/1166306>
if (!line.empty() && line[line.size() - 1] == '\r')
line.erase(line.size() - 1);
std::stringstream lineStream(line);
std::string cell;
m_data.clear();
while(std::getline(lineStream, cell, '\t')) {
m_data.push_back(cell);
}
if (!lineStream && cell.empty()) { //check for trailing empty cell
m_data.push_back("");
}
}
private:
std::vector<std::string> m_data;
};
std::istream& operator>>(std::istream& str, CSVRow& data) {
data.readNextRow(str);
return str;
}
class CSVIterator {
public:
typedef std::input_iterator_tag iterator_category;
typedef CSVRow value_type;
typedef std::size_t difference_type;
typedef CSVRow *pointer;
typedef CSVRow &reference;
CSVIterator(std::istream& stream) : m_str(stream.good()?&stream:NULL) { ++(*this); }
CSVIterator(std::ifstream& stream) : m_str(stream.good()?&stream:NULL) { ++(*this); }
CSVIterator() : m_str(NULL) {}
CSVIterator& operator++() {
if (m_str) {
if (!((*m_str) >> m_row)){
m_str = NULL;
}
}
return *this;
}
CSVIterator operator++(int) {
CSVIterator tmp(*this);
++(*this);
return tmp;
}
CSVRow const& operator*() const { return m_row; }
CSVRow const* operator->() const { return &m_row; }
bool operator==(CSVIterator const& rhs) { return ((this == &rhs) || ((this->m_str == NULL) && (rhs.m_str == NULL))); }
bool operator!=(CSVIterator const& rhs) { return !((*this) == rhs); }
private:
std::istream *m_str;
CSVRow m_row;
};
class ColIdx {
// TODO: Long-term, how can we support arbitrary columns?
public:
int CHR_COL = -1;
int POS_COL = -1;
int REF_COL = -1;
int ALT_COL = -1;
int RSID_COL = -1;
int GENE_COL = -1;
int MAF_COL = -1;
int PVAL_COL = -1;
int BETA_COL = -1;
int SEBETA_COL = -1;
};
bool is_empty(std::ifstream& f)
{
return f.peek() == std::ifstream::traits_type::eof();
}
void set_ulimit_num_files(unsigned num_files) {
struct rlimit limit;
limit.rlim_cur = num_files;
limit.rlim_max = num_files;
if (setrlimit(RLIMIT_NOFILE, &limit) != 0) {
std::cerr << "setrlimit() failed with errno=" << errno << "\n";
exit(1);
}
}
int main(int argc, char** argv) {
//sites file
std::string sites_fname = argv[1];
std::ifstream sites_file(sites_fname);
CSVIterator sites_it(sites_file);
const int SITES_CHR_COL = 0;
const int SITES_POS_COL = 1;
const int SITES_REF_COL = 2;
const int SITES_ALT_COL = 3;
const int SITES_RSID_COL = 4;
const int SITES_GENE_COL = 5;
// augmented_pheno files
std::string phenos_dir = argv[2];
phenos_dir += "/*";
std::vector<std::string> aug_fpaths = glob(phenos_dir.c_str());
std::vector<std::string> aug_fnames(aug_fpaths.size());
std::vector<std::ifstream*> aug_files(aug_fpaths.size()); // ifstreams have a problem with copies, so just pre-allocate.
std::vector<CSVIterator*> aug_its(aug_fpaths.size());
std::vector<ColIdx> aug_colidx(aug_fpaths.size());
set_ulimit_num_files(aug_fpaths.size() + 5); // stdin, stdout, stderr, sites_file, ???
for (size_t i = 0; i != aug_fnames.size(); i++) {
aug_fnames[i] = aug_fpaths[i];
size_t last_slash_idx = aug_fnames[i].find_last_of("/");
if (std::string::npos != last_slash_idx) {
aug_fnames[i].erase(0, last_slash_idx + 1);
}
std::ifstream* f = new std::ifstream(aug_fpaths[i].c_str());
aug_files[i] = f;
CSVIterator *it = new CSVIterator(*f);
aug_its[i] = it;
CSVRow row = **aug_its[i];
for (int fieldname_index = 0; fieldname_index < row.size(); fieldname_index++) {
if (row[fieldname_index] == "chrom") {
aug_colidx[i].CHR_COL = fieldname_index;
} else if (row[fieldname_index] == "pos") {
aug_colidx[i].POS_COL = fieldname_index;
} else if (row[fieldname_index] == "ref") {
aug_colidx[i].REF_COL = fieldname_index;
} else if (row[fieldname_index] == "alt") {
aug_colidx[i].ALT_COL = fieldname_index;
} else if (row[fieldname_index] == "rsids") {
aug_colidx[i].RSID_COL = fieldname_index;
} else if (row[fieldname_index] == "nearest_genes") {
aug_colidx[i].GENE_COL = fieldname_index;
} else if (row[fieldname_index] == "maf") {
aug_colidx[i].MAF_COL = fieldname_index;
} else if (row[fieldname_index] == "pval") {
aug_colidx[i].PVAL_COL = fieldname_index;
} else if (row[fieldname_index] == "beta") {
aug_colidx[i].BETA_COL = fieldname_index;
} else if (row[fieldname_index] == "sebeta") {
aug_colidx[i].SEBETA_COL = fieldname_index;
} else {
std::cerr << "What is this column \"" << row[fieldname_index] << "\"?" << std::endl;
return 1;
}
}
(*aug_its[i])++; // go past header.
// TODO: can I: row = (*aug_its[i])++; ?
}
// Print header line.
std::cout << "#chrom\tpos\tref\talt\trsids\tnearest_genes\tmaf";
for (size_t i = 0; i != aug_fnames.size(); i++) {
std::cout << "\tpval@" << aug_fnames[i];
if (aug_colidx[i].BETA_COL != -1) {
std::cout << "\tbeta@" << aug_fnames[i];
}
if (aug_colidx[i].SEBETA_COL != -1) {
std::cout << "\tsebeta@" << aug_fnames[i];
}
}
std::cout << "\n";
// Combine the remaining lines of each file.
for(; sites_it != CSVIterator(); ++sites_it) {
CSVRow sites_row = *sites_it;
std::cout << sites_row[SITES_CHR_COL] << "\t"
<< sites_row[SITES_POS_COL] << "\t"
<< sites_row[SITES_REF_COL] << "\t"
<< sites_row[SITES_ALT_COL] << "\t"
<< sites_row[SITES_RSID_COL] << "\t"
<< sites_row[SITES_GENE_COL];
int num_mafs = 0;
double maf = 0;
std::ostringstream all_the_rest; // gotta hold these while you calculate avg maf
for (size_t i = 0; i < aug_fnames.size(); i++) {
if (*aug_its[i] == CSVIterator()) {
// just print blanks and continue
all_the_rest << "\t.";
if (aug_colidx[i].BETA_COL != -1) all_the_rest << "\t.";
if (aug_colidx[i].SEBETA_COL != -1) all_the_rest << "\t.";
continue;
}
// load current variant
CSVRow row = **aug_its[i];
if (row[aug_colidx[i].CHR_COL] == sites_row[SITES_CHR_COL] &&
row[aug_colidx[i].POS_COL] == sites_row[SITES_POS_COL] &&
row[aug_colidx[i].REF_COL] == sites_row[SITES_REF_COL] &&
row[aug_colidx[i].ALT_COL] == sites_row[SITES_ALT_COL]) {
// print row
if (row[aug_colidx[i].RSID_COL] != sites_row[SITES_RSID_COL]) {
std::cerr << "rsids disagree: [" << row[aug_colidx[i].RSID_COL] << "] [" << sites_row[SITES_RSID_COL] << "]" << std::endl;
exit(1);
}
if (row[aug_colidx[i].GENE_COL] != sites_row[SITES_GENE_COL]) {
std::cerr << "genes disagree: [" << row[aug_colidx[i].GENE_COL] << "] [" << sites_row[SITES_GENE_COL] << "]" << std::endl;
exit(1);
}
maf += atof(row[aug_colidx[i].MAF_COL].c_str());
num_mafs++;
all_the_rest << "\t" << row[aug_colidx[i].PVAL_COL];
if (aug_colidx[i].BETA_COL != -1) all_the_rest << "\t" << row[aug_colidx[i].BETA_COL];
if (aug_colidx[i].SEBETA_COL != -1) all_the_rest << "\t" << row[aug_colidx[i].BETA_COL];
(*aug_its[i])++;
} else {
// print blanks
all_the_rest << "\t.";
if (aug_colidx[i].BETA_COL != -1) all_the_rest << "\t.";
if (aug_colidx[i].SEBETA_COL != -1) all_the_rest << "\t.";
}
}
std::cout << "\t" << maf/num_mafs << all_the_rest.str() << "\n";
}
}
<|endoftext|>
|
<commit_before>//
// FileDir.m
// FileDir
//
// Created by Daniel Cohen Gindi on 6/24/14.
// Copyright (c) 2013 Daniel Cohen Gindi. All rights reserved.
//
// https://github.com/danielgindi/FileDir
//
// The MIT License (MIT)
//
// Copyright (c) 2014 Daniel Cohen Gindi (danielgindi@gmail.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.
//
#include "FileDir.h"
#include <stdlib.h>
#include <string.h>
#ifdef _MSC_VER
#define WIN32_LEAN_AND_MEAN
#include <windows.h>
#endif
#ifndef FILEDIR_CHAR
#ifdef _MSC_VER
#define FILEDIR_CHAR wchar_t
#define ustrrchr wcsrchr
#define ustrlen wcslen
#define ustrdup _wcsdup
#else
#define FILEDIR_CHAR char
#define ustrrchr strrchr
#define ustrlen strlen
#define ustrdup strdup
#endif
#endif
FileDir::FileDir(void)
{
_fullPath = NULL;
_fileName = NULL;
_cachedFullPath = _cachedFileName = _cachedExtension = _cachedFileNameWithoutExtension = NULL;
_isFolder = _isFile = false;
}
FileDir::~FileDir(void)
{
if (_fullPath)
{
delete [] _fullPath;
_fullPath = NULL;
}
if (_fileName)
{
delete [] _fileName;
_fileName = NULL;
}
if (_cachedFileNameWithoutExtension)
{
delete [] _cachedFileNameWithoutExtension;
_cachedFileNameWithoutExtension = NULL;
}
_cachedFullPath = _cachedFileName = _cachedExtension = NULL;
}
void FileDir::SetFullPath(const FILEDIR_CHAR *fullPath)
{
if (_fullPath)
{
delete [] _fullPath;
_fullPath = NULL;
}
if (_fileName)
{
delete [] _fileName;
_fileName = NULL;
}
if (fullPath)
{
_fullPath = ustrdup(fullPath);
const FILEDIR_CHAR *separator = ustrrchr(_fullPath, '/');
if (!separator) separator = ustrrchr(_fullPath, '\\');
if (separator && separator[1] == '\0')
{
while (separator > _fullPath && --separator && (separator[0] != '/' && separator[0] != '\\'));
}
if (separator && !(separator == _fullPath && separator[1] == '\0'))
{
_fileName = ustrdup(separator + 1);
}
else
{
_fileName = ustrdup(_fullPath);
}
}
}
const FILEDIR_CHAR * FileDir::GetExtension()
{
if (_fullPath != _cachedFullPath)
{
_cachedFullPath = _fullPath;
_cachedExtension = NULL;
}
if (!_fullPath) return NULL;
if (!_cachedExtension)
{
FILEDIR_CHAR *period = ustrrchr(_fullPath, '.');
if (period == NULL)
{
return &(_fullPath[ustrlen(_fullPath)]);
}
else
{
return period + 1;
}
}
return _cachedExtension;
}
const FILEDIR_CHAR * FileDir::GetFileNameWithoutExtension()
{
if (_fileName != _cachedFileName)
{
_cachedFileName = _fileName;
if (_cachedFileNameWithoutExtension)
{
delete [] _cachedFileNameWithoutExtension;
_cachedFileNameWithoutExtension = NULL;
}
}
if (!_fileName) return NULL;
if (!_cachedExtension)
{
FILEDIR_CHAR *period = ustrrchr(_fileName, '.');
if (period == NULL)
{
_cachedFileNameWithoutExtension = ustrdup(_fileName);
}
else
{
int periodIndex = (int)(period - _fileName);
FILEDIR_CHAR *fileNameWithoutExtension = new FILEDIR_CHAR[periodIndex + 1];
memcpy(fileNameWithoutExtension, _fileName, sizeof(FILEDIR_CHAR) * periodIndex);
fileNameWithoutExtension[periodIndex] = '\0';
_cachedFileNameWithoutExtension = fileNameWithoutExtension;
}
}
return _cachedFileNameWithoutExtension;
}<commit_msg>was not correctly caching extension<commit_after>//
// FileDir.m
// FileDir
//
// Created by Daniel Cohen Gindi on 6/24/14.
// Copyright (c) 2013 Daniel Cohen Gindi. All rights reserved.
//
// https://github.com/danielgindi/FileDir
//
// The MIT License (MIT)
//
// Copyright (c) 2014 Daniel Cohen Gindi (danielgindi@gmail.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.
//
#include "FileDir.h"
#include <stdlib.h>
#include <string.h>
#ifdef _MSC_VER
#define WIN32_LEAN_AND_MEAN
#include <windows.h>
#endif
#ifndef FILEDIR_CHAR
#ifdef _MSC_VER
#define FILEDIR_CHAR wchar_t
#define ustrrchr wcsrchr
#define ustrlen wcslen
#define ustrdup _wcsdup
#else
#define FILEDIR_CHAR char
#define ustrrchr strrchr
#define ustrlen strlen
#define ustrdup strdup
#endif
#endif
FileDir::FileDir(void)
{
_fullPath = NULL;
_fileName = NULL;
_cachedFullPath = _cachedFileName = _cachedExtension = _cachedFileNameWithoutExtension = NULL;
_isFolder = _isFile = false;
}
FileDir::~FileDir(void)
{
if (_fullPath)
{
delete [] _fullPath;
_fullPath = NULL;
}
if (_fileName)
{
delete [] _fileName;
_fileName = NULL;
}
if (_cachedFileNameWithoutExtension)
{
delete [] _cachedFileNameWithoutExtension;
_cachedFileNameWithoutExtension = NULL;
}
_cachedFullPath = _cachedFileName = _cachedExtension = NULL;
}
void FileDir::SetFullPath(const FILEDIR_CHAR *fullPath)
{
if (_fullPath)
{
delete [] _fullPath;
_fullPath = NULL;
}
if (_fileName)
{
delete [] _fileName;
_fileName = NULL;
}
if (fullPath)
{
_fullPath = ustrdup(fullPath);
const FILEDIR_CHAR *separator = ustrrchr(_fullPath, '/');
if (!separator) separator = ustrrchr(_fullPath, '\\');
if (separator && separator[1] == '\0')
{
while (separator > _fullPath && --separator && (separator[0] != '/' && separator[0] != '\\'));
}
if (separator && !(separator == _fullPath && separator[1] == '\0'))
{
_fileName = ustrdup(separator + 1);
}
else
{
_fileName = ustrdup(_fullPath);
}
}
}
const FILEDIR_CHAR * FileDir::GetExtension()
{
if (_fullPath != _cachedFullPath)
{
_cachedFullPath = _fullPath;
_cachedExtension = NULL;
}
if (!_fullPath) return NULL;
if (!_cachedExtension)
{
FILEDIR_CHAR *period = ustrrchr(_fullPath, '.');
if (period == NULL)
{
_cachedExtension = &(_fullPath[ustrlen(_fullPath)]);
}
else
{
_cachedExtension = period + 1;
}
}
return _cachedExtension;
}
const FILEDIR_CHAR * FileDir::GetFileNameWithoutExtension()
{
if (_fileName != _cachedFileName)
{
_cachedFileName = _fileName;
if (_cachedFileNameWithoutExtension)
{
delete [] _cachedFileNameWithoutExtension;
_cachedFileNameWithoutExtension = NULL;
}
}
if (!_fileName) return NULL;
if (!_cachedExtension)
{
FILEDIR_CHAR *period = ustrrchr(_fileName, '.');
if (period == NULL)
{
_cachedFileNameWithoutExtension = ustrdup(_fileName);
}
else
{
int periodIndex = (int)(period - _fileName);
FILEDIR_CHAR *fileNameWithoutExtension = new FILEDIR_CHAR[periodIndex + 1];
memcpy(fileNameWithoutExtension, _fileName, sizeof(FILEDIR_CHAR) * periodIndex);
fileNameWithoutExtension[periodIndex] = '\0';
_cachedFileNameWithoutExtension = fileNameWithoutExtension;
}
}
return _cachedFileNameWithoutExtension;
}<|endoftext|>
|
<commit_before>#include "vendor/docopt/docopt.hpp"
#include <thewizardplusplus/wizard_parser/lexer/lexeme.hpp>
#include <thewizardplusplus/wizard_parser/parser/parsers.hpp>
#include <thewizardplusplus/wizard_parser/parser/macroses.hpp>
#include <thewizardplusplus/wizard_parser/lexer/tokenizer.hpp>
#include <thewizardplusplus/wizard_parser/parser/parse.hpp>
#include <regex>
#include <vector>
#include <string>
#include <unordered_set>
#include <iostream>
#include <iterator>
#include <cstdlib>
#include <exception>
using namespace thewizardplusplus::wizard_parser::lexer;
using namespace thewizardplusplus::wizard_parser::parser;
using namespace thewizardplusplus::wizard_parser::parser::operators;
const auto usage =
R"(Usage:
./example -h | --help
./example [-t | --tokens] <expression>
./example [-t | --tokens] (-s | --stdin)
Options:
-h, --help - show this message;
-t, --tokens - show a token list instead an AST;
-s, --stdin - read an expression from stdin.)";
const auto lexemes = std::vector<lexeme>{
{std::regex{"=="}, "equal"},
{std::regex{"/="}, "not_equal"},
{std::regex{"<"}, "less"},
{std::regex{"<="}, "less_or_equal"},
{std::regex{">"}, "great"},
{std::regex{">="}, "great_or_equal"},
{std::regex{R"(\+)"}, "plus"},
{std::regex{"-"}, "minus"},
{std::regex{R"(\*)"}, "star"},
{std::regex{"/"}, "slash"},
{std::regex{"%"}, "percent"},
{std::regex{R"(\()"}, "opening_parenthesis"},
{std::regex{R"(\))"}, "closing_parenthesis"},
{std::regex{","}, "comma"},
{std::regex{R"(\d+(?:\.\d+)?(?:e-?\d+)?)"}, "number_constant"},
{std::regex{R"([A-Za-z_]\w*)"}, "base_identifier"},
{std::regex{R"(\s+)"}, "whitespace"}
};
const auto ignorable_tokens = std::unordered_set<std::string>{"whitespace"};
namespace {
rule_parser::pointer make_atom_parser(const rule_parser::pointer& expression) {
RULE(number_constant) = "number_constant"_t;
RULE(key_words) = "and"_v | "not"_v | "or"_v;
RULE(identifier) = "base_identifier"_t - key_words;
IMPORTANT_RULE(function_call) = identifier >> &"("_v >>
-(expression >> *(&","_v >> expression))
>> &")"_v;
return number_constant
| identifier
| function_call
| (&"("_v >> expression >> &")"_v);
}
rule_parser::pointer make_expression_parser() {
const auto expression_dummy = dummy();
RULE(atom) = make_atom_parser(expression_dummy);
RULE(unary) = *("-"_v | "not"_v) >> atom;
RULE(product) = unary >> *(("*"_v | "/"_v | "%"_v) >> unary);
RULE(sum) = product >> *(("+"_v | "-"_v) >> product);
RULE(comparison) = sum >> *(("<"_v | "<="_v | ">"_v | ">="_v) >> sum);
RULE(equality) = comparison >> *(("=="_v | "/="_v) >> comparison);
RULE(conjunction) = equality >> *(&"and"_v >> equality);
RULE(disjunction) = conjunction >> *(&"or"_v >> conjunction);
expression_dummy->set_parser(disjunction);
return disjunction >> eoi();
}
}
int main(int argc, char* argv[]) try {
auto code = std::string{};
const auto options = docopt::docopt(usage, {argv + 1, argv + argc}, true);
if (!options.at("--stdin").asBool()) {
code = options.at("<expression>").asString();
} else {
code = std::string{std::istreambuf_iterator<char>{std::cin}, {}};
}
const auto tokens = tokenizer{lexemes, ignorable_tokens, code}.tokenize();
if (options.at("--tokens").asBool()) {
std::cout << tokens << '\n';
std::exit(EXIT_SUCCESS);
}
RULE(expression) = make_expression_parser();
const auto ast = parse(expression, tokens, code.size());
std::cout << ast << '\n';
} catch (const std::exception& exception) {
std::cerr << "error: " << exception.what() << '\n';
std::exit(EXIT_FAILURE);
}
<commit_msg>Issue #12: correct the example<commit_after>#include "vendor/docopt/docopt.hpp"
#include <thewizardplusplus/wizard_parser/lexer/lexeme.hpp>
#include <thewizardplusplus/wizard_parser/parser/parsers.hpp>
#include <thewizardplusplus/wizard_parser/parser/macroses.hpp>
#include <thewizardplusplus/wizard_parser/lexer/tokenize.hpp>
#include <thewizardplusplus/wizard_parser/parser/parse.hpp>
#include <regex>
#include <vector>
#include <string>
#include <unordered_set>
#include <iostream>
#include <iterator>
#include <cstdlib>
#include <exception>
using namespace thewizardplusplus::wizard_parser::lexer;
using namespace thewizardplusplus::wizard_parser::parser;
using namespace thewizardplusplus::wizard_parser::parser::operators;
const auto usage =
R"(Usage:
./example -h | --help
./example [-t | --tokens] <expression>
./example [-t | --tokens] (-s | --stdin)
Options:
-h, --help - show this message;
-t, --tokens - show a token list instead an AST;
-s, --stdin - read an expression from stdin.)";
const auto lexemes = std::vector<lexeme>{
{std::regex{"=="}, "equal"},
{std::regex{"/="}, "not_equal"},
{std::regex{"<"}, "less"},
{std::regex{"<="}, "less_or_equal"},
{std::regex{">"}, "great"},
{std::regex{">="}, "great_or_equal"},
{std::regex{R"(\+)"}, "plus"},
{std::regex{"-"}, "minus"},
{std::regex{R"(\*)"}, "star"},
{std::regex{"/"}, "slash"},
{std::regex{"%"}, "percent"},
{std::regex{R"(\()"}, "opening_parenthesis"},
{std::regex{R"(\))"}, "closing_parenthesis"},
{std::regex{","}, "comma"},
{std::regex{R"(\d+(?:\.\d+)?(?:e-?\d+)?)"}, "number_constant"},
{std::regex{R"([A-Za-z_]\w*)"}, "base_identifier"},
{std::regex{R"(\s+)"}, "whitespace"}
};
const auto ignorable_tokens = std::unordered_set<std::string>{"whitespace"};
namespace {
rule_parser::pointer make_atom_parser(const rule_parser::pointer& expression) {
RULE(number_constant) = "number_constant"_t;
RULE(key_words) = "and"_v | "not"_v | "or"_v;
RULE(identifier) = "base_identifier"_t - key_words;
IMPORTANT_RULE(function_call) = identifier >> &"("_v >>
-(expression >> *(&","_v >> expression))
>> &")"_v;
return number_constant
| identifier
| function_call
| (&"("_v >> expression >> &")"_v);
}
rule_parser::pointer make_expression_parser() {
const auto expression_dummy = dummy();
RULE(atom) = make_atom_parser(expression_dummy);
RULE(unary) = *("-"_v | "not"_v) >> atom;
RULE(product) = unary >> *(("*"_v | "/"_v | "%"_v) >> unary);
RULE(sum) = product >> *(("+"_v | "-"_v) >> product);
RULE(comparison) = sum >> *(("<"_v | "<="_v | ">"_v | ">="_v) >> sum);
RULE(equality) = comparison >> *(("=="_v | "/="_v) >> comparison);
RULE(conjunction) = equality >> *(&"and"_v >> equality);
RULE(disjunction) = conjunction >> *(&"or"_v >> conjunction);
expression_dummy->set_parser(disjunction);
return disjunction >> eoi();
}
}
int main(int argc, char* argv[]) try {
auto code = std::string{};
const auto options = docopt::docopt(usage, {argv + 1, argv + argc}, true);
if (!options.at("--stdin").asBool()) {
code = options.at("<expression>").asString();
} else {
code = std::string{std::istreambuf_iterator<char>{std::cin}, {}};
}
const auto tokens = tokenize(lexemes, ignorable_tokens, code);
if (options.at("--tokens").asBool()) {
std::cout << tokens << '\n';
std::exit(EXIT_SUCCESS);
}
RULE(expression) = make_expression_parser();
const auto ast = parse(expression, tokens, code.size());
std::cout << ast << '\n';
} catch (const std::exception& exception) {
std::cerr << "error: " << exception.what() << '\n';
std::exit(EXIT_FAILURE);
}
<|endoftext|>
|
<commit_before>/*
* Copyright (c) 2021 dresden elektronik ingenieurtechnik gmbh.
* All rights reserved.
*
* The software in this package is published under the terms of the BSD
* style license a copy of which has been included with this distribution in
* the LICENSE.txt file.
*
*/
#include <deconz/aps_controller.h>
#include <deconz/dbg_trace.h>
#include <deconz/zcl.h>
#include "zcl.h"
struct ZclDataType
{
quint8 dataType;
char type; // 'A' analog 'D' discrete
quint8 size;
};
static ZclDataType _zclDataTypes[] = {
{ deCONZ::Zcl8BitUint, 'A', 1 },
{ deCONZ::Zcl16BitUint, 'A', 2 },
{ deCONZ::Zcl24BitUint, 'A', 3 },
{ deCONZ::Zcl32BitUint, 'A', 4 },
{ deCONZ::Zcl40BitUint, 'A', 5 },
{ deCONZ::Zcl48BitUint, 'A', 6 },
{ deCONZ::Zcl56BitUint, 'A', 7 },
{ deCONZ::Zcl64BitUint, 'A', 8 },
{ deCONZ::Zcl8BitInt, 'A', 1 },
{ deCONZ::Zcl16BitInt, 'A', 2 },
{ deCONZ::Zcl24BitInt, 'A', 3 },
{ deCONZ::Zcl32BitInt, 'A', 4 },
{ deCONZ::Zcl40BitInt, 'A', 5 },
{ deCONZ::Zcl48BitInt, 'A', 6 },
{ deCONZ::Zcl56BitInt, 'A', 7 },
{ deCONZ::Zcl64BitInt, 'A', 8 },
{ deCONZ::ZclSingleFloat, 'A', 4 },
{ deCONZ::ZclSemiFloat, 'A', 2 },
{ deCONZ::ZclDoubleFloat, 'A', 8 },
{ deCONZ::ZclTimeOfDay, 'A', 4 },
{ deCONZ::ZclDate, 'A', 4 },
{ deCONZ::ZclUtcTime, 'A', 4 },
{ deCONZ::ZclNoData, 0, 0 }
};
ZCL_Result ZCL_ReadAttributes(const ZCL_Param ¶m, quint64 extAddress, quint16 nwkAddress, deCONZ::ApsController *apsCtrl)
{
ZCL_Result result{};
// task.req.setTxOptions(deCONZ::ApsTxAcknowledgedTransmission);
deCONZ::ApsDataRequest req;
result.apsReqId = req.id();
req.setDstEndpoint(param.endpoint);
req.setDstAddressMode(deCONZ::ApsExtAddress);
req.dstAddress().setExt(extAddress);
req.dstAddress().setNwk(nwkAddress);
req.setClusterId(param.clusterId);
req.setProfileId(HA_PROFILE_ID);
req.setSrcEndpoint(0x01); // todo dynamic
deCONZ::ZclFrame zclFrame;
zclFrame.setSequenceNumber(zclNextSequenceNumber());
zclFrame.setCommandId(deCONZ::ZclReadAttributesId);
DBG_Printf(DBG_INFO, "ZCL read attr 0x%016llX, ep: 0x%02X, cl: 0x%04X, attr: 0x%04X, mfcode: 0x%04X, aps.id: %u, zcl.seq: %u\n",
extAddress, param.endpoint, param.clusterId, param.attributes.front(), param.manufacturerCode, req.id(), zclFrame.sequenceNumber());
result.sequenceNumber = zclFrame.sequenceNumber();
if (param.manufacturerCode)
{
zclFrame.setFrameControl(deCONZ::ZclFCProfileCommand |
deCONZ::ZclFCManufacturerSpecific |
deCONZ::ZclFCDirectionClientToServer |
deCONZ::ZclFCDisableDefaultResponse);
zclFrame.setManufacturerCode(param.manufacturerCode);
}
else
{
zclFrame.setFrameControl(deCONZ::ZclFCProfileCommand |
deCONZ::ZclFCDirectionClientToServer |
deCONZ::ZclFCDisableDefaultResponse);
}
{ // payload
QDataStream stream(&zclFrame.payload(), QIODevice::WriteOnly);
stream.setByteOrder(QDataStream::LittleEndian);
for (size_t i = 0; i < param.attributeCount; i++)
{
stream << param.attributes[i];
}
}
{ // ZCL frame
QDataStream stream(&req.asdu(), QIODevice::WriteOnly);
stream.setByteOrder(QDataStream::LittleEndian);
zclFrame.writeToStream(stream);
}
if (apsCtrl->apsdeDataRequest(req) == deCONZ::Success)
{
result.isEnqueued = true;
}
return result;
}
ZCL_Result ZCL_ReadReportConfiguration(const ZCL_ReadReportConfigurationParam ¶m, deCONZ::ApsController *apsCtrl)
{
ZCL_Result result{};
deCONZ::ApsDataRequest req;
result.apsReqId = req.id();
req.setDstEndpoint(param.endpoint);
req.setDstAddressMode(deCONZ::ApsExtAddress);
req.dstAddress().setExt(param.extAddress);
req.dstAddress().setNwk(param.nwkAddress);
req.setClusterId(param.clusterId);
req.setProfileId(HA_PROFILE_ID);
req.setSrcEndpoint(0x01); // todo dynamic
deCONZ::ZclFrame zclFrame;
zclFrame.setSequenceNumber(zclNextSequenceNumber());
zclFrame.setCommandId(deCONZ::ZclReadReportingConfigId);
DBG_Printf(DBG_INFO, "ZCL read report config, ep: 0x%02X, cl: 0x%04X, mfcode: 0x%04X, aps.id: %u, zcl.seq: %u\n",
param.endpoint, param.clusterId, param.manufacturerCode, req.id(), zclFrame.sequenceNumber());
result.sequenceNumber = zclFrame.sequenceNumber();
if (param.manufacturerCode)
{
zclFrame.setFrameControl(deCONZ::ZclFCProfileCommand |
deCONZ::ZclFCManufacturerSpecific |
deCONZ::ZclFCDirectionClientToServer |
deCONZ::ZclFCDisableDefaultResponse);
zclFrame.setManufacturerCode(param.manufacturerCode);
}
else
{
zclFrame.setFrameControl(deCONZ::ZclFCProfileCommand |
deCONZ::ZclFCDirectionClientToServer |
deCONZ::ZclFCDisableDefaultResponse);
}
{ // payload
QDataStream stream(&zclFrame.payload(), QIODevice::WriteOnly);
stream.setByteOrder(QDataStream::LittleEndian);
for (const auto &record : param.records)
{
stream << record.direction;
stream << record.attributeId;
}
}
{ // ZCL frame
QDataStream stream(&req.asdu(), QIODevice::WriteOnly);
stream.setByteOrder(QDataStream::LittleEndian);
zclFrame.writeToStream(stream);
}
if (apsCtrl->apsdeDataRequest(req) == deCONZ::Success)
{
result.isEnqueued = true;
}
return result;
}
const ZclDataType *ZCL_GetDataType(deCONZ::ZclDataTypeId type)
{
const auto *dt = &_zclDataTypes[0];
while (dt->dataType != deCONZ::ZclNoData)
{
if (dt->dataType == type)
{
break;
}
dt++;
}
return dt; // deCONZ::ZclNoData if not found
}
bool ZCL_IsDataTypeAnalog(deCONZ::ZclDataTypeId type)
{
const auto *dt = ZCL_GetDataType(type);
return dt->type == 'A';
}
size_t ZCL_DataTypeSize(deCONZ::ZclDataTypeId type)
{
const auto *dt = ZCL_GetDataType(type);
return dt->size;
}
ZCL_ReadReportConfigurationRsp ZCL_ParseReadReportConfigurationRsp(const deCONZ::ApsDataIndication &ind, const deCONZ::ZclFrame &zclFrame)
{
ZCL_ReadReportConfigurationRsp result{};
result.sequenceNumber = zclFrame.sequenceNumber();
result.endpoint = ind.srcEndpoint();
result.clusterId = ind.clusterId();
result.manufacturerCode = zclFrame.manufacturerCode();
QDataStream stream(zclFrame.payload());
stream.setByteOrder(QDataStream::LittleEndian);
while (!stream.atEnd() && result.recordCount < ZCL_ReadReportConfigurationRsp::MaxRecords)
{
auto &record = result.records[result.recordCount];
result.recordCount++;
stream >> record.status;
stream >> record.direction;
stream >> record.attributeId;
if (record.status != deCONZ::ZclSuccessStatus)
{
// If the status field is not set to SUCCESS, all fields except the direction and attribute identifier fields SHALL be omitted.
continue;
}
stream >> record.dataType;
stream >> record.minInterval;
stream >> record.maxInterval;
record.reportableChange = 0;
if (ZCL_IsDataTypeAnalog(deCONZ::ZclDataTypeId(record.dataType)))
{
const auto size = ZCL_DataTypeSize(deCONZ::ZclDataTypeId(record.dataType));
Q_ASSERT(size <= 8);
if (size > 8)
{
break; // unsupported
}
for (size_t i = 0; i < size; i++)
{
quint8 tmp;
stream >> tmp;
record.reportableChange |= quint64(tmp) << (i * 8);
}
}
}
return result;
}
ZCL_Result ZCL_ConfigureReporting(const ZCL_ConfigureReportingParam ¶m, deCONZ::ApsController *apsCtrl)
{
ZCL_Result result{};
deCONZ::ApsDataRequest req;
result.apsReqId = req.id();
req.setDstEndpoint(param.endpoint);
req.setDstAddressMode(deCONZ::ApsExtAddress);
req.dstAddress().setExt(param.extAddress);
req.dstAddress().setNwk(param.nwkAddress);
req.setClusterId(param.clusterId);
req.setProfileId(HA_PROFILE_ID);
req.setSrcEndpoint(0x01); // todo dynamic
deCONZ::ZclFrame zclFrame;
zclFrame.setSequenceNumber(zclNextSequenceNumber());
zclFrame.setCommandId(deCONZ::ZclConfigureReportingId);
DBG_Printf(DBG_INFO, "ZCL configure reporting ep: 0x%02X, cl: 0x%04X, mfcode: 0x%04X, aps.id: %u, zcl.seq: %u\n",
param.endpoint, param.clusterId, param.manufacturerCode, req.id(), zclFrame.sequenceNumber());
result.sequenceNumber = zclFrame.sequenceNumber();
if (param.manufacturerCode)
{
zclFrame.setFrameControl(deCONZ::ZclFCProfileCommand |
deCONZ::ZclFCManufacturerSpecific |
deCONZ::ZclFCDirectionClientToServer |
deCONZ::ZclFCDisableDefaultResponse);
zclFrame.setManufacturerCode(param.manufacturerCode);
}
else
{
zclFrame.setFrameControl(deCONZ::ZclFCProfileCommand |
deCONZ::ZclFCDirectionClientToServer |
deCONZ::ZclFCDisableDefaultResponse);
}
{ // payload
QDataStream stream(&zclFrame.payload(), QIODevice::WriteOnly);
stream.setByteOrder(QDataStream::LittleEndian);
for (const auto &record : param.records)
{
stream << record.direction;
stream << record.attributeId;
stream << record.dataType;
stream << record.minInterval;
stream << record.maxInterval;
if (ZCL_IsDataTypeAnalog(deCONZ::ZclDataTypeId(record.dataType)))
{
const auto size = ZCL_DataTypeSize(deCONZ::ZclDataTypeId(record.dataType));
Q_ASSERT(size <= 8);
if (size > 8)
{
return result; // unsupported
}
auto reportableChange = record.reportableChange;
for (size_t i = 0; i < size; i++)
{
stream << static_cast<quint8>(reportableChange & 0xff);
reportableChange >>= 8;
}
}
// stream << record.timeout; // TODO?
}
}
{ // ZCL frame
QDataStream stream(&req.asdu(), QIODevice::WriteOnly);
stream.setByteOrder(QDataStream::LittleEndian);
zclFrame.writeToStream(stream);
}
if (apsCtrl->apsdeDataRequest(req) == deCONZ::Success)
{
result.isEnqueued = true;
}
return result;
}
<commit_msg>For device ZCL functions change DBG_INFO to DBG_ZCL<commit_after>/*
* Copyright (c) 2021 dresden elektronik ingenieurtechnik gmbh.
* All rights reserved.
*
* The software in this package is published under the terms of the BSD
* style license a copy of which has been included with this distribution in
* the LICENSE.txt file.
*
*/
#include <deconz/aps_controller.h>
#include <deconz/dbg_trace.h>
#include <deconz/zcl.h>
#include "zcl.h"
struct ZclDataType
{
quint8 dataType;
char type; // 'A' analog 'D' discrete
quint8 size;
};
static ZclDataType _zclDataTypes[] = {
{ deCONZ::Zcl8BitUint, 'A', 1 },
{ deCONZ::Zcl16BitUint, 'A', 2 },
{ deCONZ::Zcl24BitUint, 'A', 3 },
{ deCONZ::Zcl32BitUint, 'A', 4 },
{ deCONZ::Zcl40BitUint, 'A', 5 },
{ deCONZ::Zcl48BitUint, 'A', 6 },
{ deCONZ::Zcl56BitUint, 'A', 7 },
{ deCONZ::Zcl64BitUint, 'A', 8 },
{ deCONZ::Zcl8BitInt, 'A', 1 },
{ deCONZ::Zcl16BitInt, 'A', 2 },
{ deCONZ::Zcl24BitInt, 'A', 3 },
{ deCONZ::Zcl32BitInt, 'A', 4 },
{ deCONZ::Zcl40BitInt, 'A', 5 },
{ deCONZ::Zcl48BitInt, 'A', 6 },
{ deCONZ::Zcl56BitInt, 'A', 7 },
{ deCONZ::Zcl64BitInt, 'A', 8 },
{ deCONZ::ZclSingleFloat, 'A', 4 },
{ deCONZ::ZclSemiFloat, 'A', 2 },
{ deCONZ::ZclDoubleFloat, 'A', 8 },
{ deCONZ::ZclTimeOfDay, 'A', 4 },
{ deCONZ::ZclDate, 'A', 4 },
{ deCONZ::ZclUtcTime, 'A', 4 },
{ deCONZ::ZclNoData, 0, 0 }
};
ZCL_Result ZCL_ReadAttributes(const ZCL_Param ¶m, quint64 extAddress, quint16 nwkAddress, deCONZ::ApsController *apsCtrl)
{
ZCL_Result result{};
// task.req.setTxOptions(deCONZ::ApsTxAcknowledgedTransmission);
deCONZ::ApsDataRequest req;
result.apsReqId = req.id();
req.setDstEndpoint(param.endpoint);
req.setDstAddressMode(deCONZ::ApsExtAddress);
req.dstAddress().setExt(extAddress);
req.dstAddress().setNwk(nwkAddress);
req.setClusterId(param.clusterId);
req.setProfileId(HA_PROFILE_ID);
req.setSrcEndpoint(0x01); // todo dynamic
deCONZ::ZclFrame zclFrame;
zclFrame.setSequenceNumber(zclNextSequenceNumber());
zclFrame.setCommandId(deCONZ::ZclReadAttributesId);
DBG_Printf(DBG_ZCL, "ZCL read attr 0x%016llX, ep: 0x%02X, cl: 0x%04X, attr: 0x%04X, mfcode: 0x%04X, aps.id: %u, zcl.seq: %u\n",
extAddress, param.endpoint, param.clusterId, param.attributes.front(), param.manufacturerCode, req.id(), zclFrame.sequenceNumber());
result.sequenceNumber = zclFrame.sequenceNumber();
if (param.manufacturerCode)
{
zclFrame.setFrameControl(deCONZ::ZclFCProfileCommand |
deCONZ::ZclFCManufacturerSpecific |
deCONZ::ZclFCDirectionClientToServer |
deCONZ::ZclFCDisableDefaultResponse);
zclFrame.setManufacturerCode(param.manufacturerCode);
}
else
{
zclFrame.setFrameControl(deCONZ::ZclFCProfileCommand |
deCONZ::ZclFCDirectionClientToServer |
deCONZ::ZclFCDisableDefaultResponse);
}
{ // payload
QDataStream stream(&zclFrame.payload(), QIODevice::WriteOnly);
stream.setByteOrder(QDataStream::LittleEndian);
for (size_t i = 0; i < param.attributeCount; i++)
{
stream << param.attributes[i];
}
}
{ // ZCL frame
QDataStream stream(&req.asdu(), QIODevice::WriteOnly);
stream.setByteOrder(QDataStream::LittleEndian);
zclFrame.writeToStream(stream);
}
if (apsCtrl->apsdeDataRequest(req) == deCONZ::Success)
{
result.isEnqueued = true;
}
return result;
}
ZCL_Result ZCL_ReadReportConfiguration(const ZCL_ReadReportConfigurationParam ¶m, deCONZ::ApsController *apsCtrl)
{
ZCL_Result result{};
deCONZ::ApsDataRequest req;
result.apsReqId = req.id();
req.setDstEndpoint(param.endpoint);
req.setDstAddressMode(deCONZ::ApsExtAddress);
req.dstAddress().setExt(param.extAddress);
req.dstAddress().setNwk(param.nwkAddress);
req.setClusterId(param.clusterId);
req.setProfileId(HA_PROFILE_ID);
req.setSrcEndpoint(0x01); // todo dynamic
deCONZ::ZclFrame zclFrame;
zclFrame.setSequenceNumber(zclNextSequenceNumber());
zclFrame.setCommandId(deCONZ::ZclReadReportingConfigId);
DBG_Printf(DBG_ZCL, "ZCL read report config, ep: 0x%02X, cl: 0x%04X, mfcode: 0x%04X, aps.id: %u, zcl.seq: %u\n",
param.endpoint, param.clusterId, param.manufacturerCode, req.id(), zclFrame.sequenceNumber());
result.sequenceNumber = zclFrame.sequenceNumber();
if (param.manufacturerCode)
{
zclFrame.setFrameControl(deCONZ::ZclFCProfileCommand |
deCONZ::ZclFCManufacturerSpecific |
deCONZ::ZclFCDirectionClientToServer |
deCONZ::ZclFCDisableDefaultResponse);
zclFrame.setManufacturerCode(param.manufacturerCode);
}
else
{
zclFrame.setFrameControl(deCONZ::ZclFCProfileCommand |
deCONZ::ZclFCDirectionClientToServer |
deCONZ::ZclFCDisableDefaultResponse);
}
{ // payload
QDataStream stream(&zclFrame.payload(), QIODevice::WriteOnly);
stream.setByteOrder(QDataStream::LittleEndian);
for (const auto &record : param.records)
{
stream << record.direction;
stream << record.attributeId;
}
}
{ // ZCL frame
QDataStream stream(&req.asdu(), QIODevice::WriteOnly);
stream.setByteOrder(QDataStream::LittleEndian);
zclFrame.writeToStream(stream);
}
if (apsCtrl->apsdeDataRequest(req) == deCONZ::Success)
{
result.isEnqueued = true;
}
return result;
}
const ZclDataType *ZCL_GetDataType(deCONZ::ZclDataTypeId type)
{
const auto *dt = &_zclDataTypes[0];
while (dt->dataType != deCONZ::ZclNoData)
{
if (dt->dataType == type)
{
break;
}
dt++;
}
return dt; // deCONZ::ZclNoData if not found
}
bool ZCL_IsDataTypeAnalog(deCONZ::ZclDataTypeId type)
{
const auto *dt = ZCL_GetDataType(type);
return dt->type == 'A';
}
size_t ZCL_DataTypeSize(deCONZ::ZclDataTypeId type)
{
const auto *dt = ZCL_GetDataType(type);
return dt->size;
}
ZCL_ReadReportConfigurationRsp ZCL_ParseReadReportConfigurationRsp(const deCONZ::ApsDataIndication &ind, const deCONZ::ZclFrame &zclFrame)
{
ZCL_ReadReportConfigurationRsp result{};
result.sequenceNumber = zclFrame.sequenceNumber();
result.endpoint = ind.srcEndpoint();
result.clusterId = ind.clusterId();
result.manufacturerCode = zclFrame.manufacturerCode();
QDataStream stream(zclFrame.payload());
stream.setByteOrder(QDataStream::LittleEndian);
while (!stream.atEnd() && result.recordCount < ZCL_ReadReportConfigurationRsp::MaxRecords)
{
auto &record = result.records[result.recordCount];
result.recordCount++;
stream >> record.status;
stream >> record.direction;
stream >> record.attributeId;
if (record.status != deCONZ::ZclSuccessStatus)
{
// If the status field is not set to SUCCESS, all fields except the direction and attribute identifier fields SHALL be omitted.
continue;
}
stream >> record.dataType;
stream >> record.minInterval;
stream >> record.maxInterval;
record.reportableChange = 0;
if (ZCL_IsDataTypeAnalog(deCONZ::ZclDataTypeId(record.dataType)))
{
const auto size = ZCL_DataTypeSize(deCONZ::ZclDataTypeId(record.dataType));
Q_ASSERT(size <= 8);
if (size > 8)
{
break; // unsupported
}
for (size_t i = 0; i < size; i++)
{
quint8 tmp;
stream >> tmp;
record.reportableChange |= quint64(tmp) << (i * 8);
}
}
}
return result;
}
ZCL_Result ZCL_ConfigureReporting(const ZCL_ConfigureReportingParam ¶m, deCONZ::ApsController *apsCtrl)
{
ZCL_Result result{};
deCONZ::ApsDataRequest req;
result.apsReqId = req.id();
req.setDstEndpoint(param.endpoint);
req.setDstAddressMode(deCONZ::ApsExtAddress);
req.dstAddress().setExt(param.extAddress);
req.dstAddress().setNwk(param.nwkAddress);
req.setClusterId(param.clusterId);
req.setProfileId(HA_PROFILE_ID);
req.setSrcEndpoint(0x01); // todo dynamic
deCONZ::ZclFrame zclFrame;
zclFrame.setSequenceNumber(zclNextSequenceNumber());
zclFrame.setCommandId(deCONZ::ZclConfigureReportingId);
DBG_Printf(DBG_ZCL, "ZCL configure reporting ep: 0x%02X, cl: 0x%04X, mfcode: 0x%04X, aps.id: %u, zcl.seq: %u\n",
param.endpoint, param.clusterId, param.manufacturerCode, req.id(), zclFrame.sequenceNumber());
result.sequenceNumber = zclFrame.sequenceNumber();
if (param.manufacturerCode)
{
zclFrame.setFrameControl(deCONZ::ZclFCProfileCommand |
deCONZ::ZclFCManufacturerSpecific |
deCONZ::ZclFCDirectionClientToServer |
deCONZ::ZclFCDisableDefaultResponse);
zclFrame.setManufacturerCode(param.manufacturerCode);
}
else
{
zclFrame.setFrameControl(deCONZ::ZclFCProfileCommand |
deCONZ::ZclFCDirectionClientToServer |
deCONZ::ZclFCDisableDefaultResponse);
}
{ // payload
QDataStream stream(&zclFrame.payload(), QIODevice::WriteOnly);
stream.setByteOrder(QDataStream::LittleEndian);
for (const auto &record : param.records)
{
stream << record.direction;
stream << record.attributeId;
stream << record.dataType;
stream << record.minInterval;
stream << record.maxInterval;
if (ZCL_IsDataTypeAnalog(deCONZ::ZclDataTypeId(record.dataType)))
{
const auto size = ZCL_DataTypeSize(deCONZ::ZclDataTypeId(record.dataType));
Q_ASSERT(size <= 8);
if (size > 8)
{
return result; // unsupported
}
auto reportableChange = record.reportableChange;
for (size_t i = 0; i < size; i++)
{
stream << static_cast<quint8>(reportableChange & 0xff);
reportableChange >>= 8;
}
}
// stream << record.timeout; // TODO?
}
}
{ // ZCL frame
QDataStream stream(&req.asdu(), QIODevice::WriteOnly);
stream.setByteOrder(QDataStream::LittleEndian);
zclFrame.writeToStream(stream);
}
if (apsCtrl->apsdeDataRequest(req) == deCONZ::Success)
{
result.isEnqueued = true;
}
return result;
}
<|endoftext|>
|
<commit_before>/* IBM_PROLOG_BEGIN_TAG */
/* This is an automatically generated prolog. */
/* */
/* $Source: src/import/chips/p9/procedures/hwp/pm/p9_cpu_special_wakeup.H $ */
/* */
/* OpenPOWER HostBoot Project */
/* */
/* Contributors Listed Below - COPYRIGHT 2015,2019 */
/* [+] International Business Machines Corp. */
/* */
/* */
/* 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. */
/* */
/* IBM_PROLOG_END_TAG */
#ifndef __API_SPECIAL_WAKEUP_
#define __API_SPECIAL_WAKEUP_
/**
* @file : p9_cpu_special_wakeup.H
* @brief : HWP to perform special wakeup of core, EQ or EX.
* @HWP HW Owner : Greg Still <stillgs@us.ibm.com>
* @HWP FW Owner : Prem S Jha <premjha2@in.ibm.com>
* @HWP Team : PM
* @HWP Level : L1
* @HWP Consumed by : OCC, FSP, HOST
*/
// ---------------------------------------------------------------------
// Includes
// ---------------------------------------------------------------------
#include <fapi2.H>
typedef const fapi2::Target < fapi2::TARGET_TYPE_CORE |
fapi2::TARGET_TYPE_EX |
fapi2::TARGET_TYPE_EQ > CONST_FAPI2_WAKEUP_CHIPLET;
#define NUM_SPCWKUP_ENTITIES 4
/**
* @brief enumerates all platforms which request special wakeup.
*/
enum PROC_SPCWKUP_ENTITY
{
HOST,
FSP,
OCC,
PHYP = HOST,
SPW_ALL
};
#define NUM_SPCWKUP_OPS 3
/**
* @brief enumerates all operations associated with special wakeup.
*/
enum PROC_SPCWKUP_OPS
{
SPCWKUP_DISABLE,
SPCWKUP_ENABLE,
SPCWKUP_INIT,
SPCWKUP_FORCE_DEASSERT
};
/**
* @brief Sets core, ex or eq chiplet into special wakeup state.
* @param i_chipletTarget fapi2 target associated with core, ex and eq.
* @param i_operation special wakeup operations to be used.
* @return SUCCESS if requested operation is accomplished, errorcode
* otherwise.
* @note needs support of following attribute:
* ATTR_PM_SPWUP_FSP
* ATTR_PM_SPWUP_OCC
* ATTR_PM_SPWUP_HOST
* ATTR_PM_SPWUP_OTR
* ATTR_PM_SPWUP_IGNORE_XSTOP_FLAG
*/
fapi2::ReturnCode
p9_cpu_special_wakeup( CONST_FAPI2_WAKEUP_CHIPLET& i_chipletTarget,
PROC_SPCWKUP_OPS i_operation,
PROC_SPCWKUP_ENTITY i_entity );
#endif //__API_SPECIAL_WAKEUP_
<commit_msg>PM: Added make file for special wakeup HWP and fixed prolog.<commit_after>/* IBM_PROLOG_BEGIN_TAG */
/* This is an automatically generated prolog. */
/* */
/* $Source: src/import/chips/p9/procedures/hwp/pm/p9_cpu_special_wakeup.H $ */
/* */
/* OpenPOWER HostBoot Project */
/* */
/* Contributors Listed Below - COPYRIGHT 2015,2019 */
/* [+] International Business Machines Corp. */
/* */
/* */
/* 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. */
/* */
/* IBM_PROLOG_END_TAG */
///
/// @file : p9_cpu_special_wakeup.H
/// @brief : HWP to perform special wakeup of core, EQ or EX.
// *HWP HW Owner : Greg Still <stillgs@us.ibm.com>
// *HWP FW Owner : Prem S Jha <premjha2@in.ibm.com>
// *HWP Team : PM
// *HWP Level : 1
// *HWP Consumed by : OCC:FSP:HOST
#ifndef __P9_CPU_SPECIAL_WAKEUP_H_
#define __P9_CPU_SPECIAL_WAKEUP_H_
// ---------------------------------------------------------------------
// Includes
// ---------------------------------------------------------------------
#include <fapi2.H>
//------------------------------------------------------------------------------
// Constant definitions
//------------------------------------------------------------------------------
namespace p9specialWakeup
{
typedef fapi2::Target < fapi2::TARGET_TYPE_CORE |
fapi2::TARGET_TYPE_EX |
fapi2::TARGET_TYPE_EQ > FAPI2_WAKEUP_CHIPLET;
/**
* @brief enumerates all platforms which request special wakeup.
*/
enum PROC_SPCWKUP_ENTITY
{
HOST,
FSP,
OCC,
PHYP = HOST,
SPW_ALL
};
/**
* @brief enumerates all operations associated with special wakeup.
*/
enum PROC_SPCWKUP_OPS
{
SPCWKUP_DISABLE,
SPCWKUP_ENABLE,
SPCWKUP_INIT,
SPCWKUP_FORCE_DEASSERT
};
} //p9specialWakeup ends
// function pointer typedef definition for HWP call support
typedef fapi2::ReturnCode (*p9_cpu_special_wakeup_FP_t)
( const p9specialWakeup::FAPI2_WAKEUP_CHIPLET& i_chipletTarget,
const p9specialWakeup::PROC_SPCWKUP_OPS i_operation,
const p9specialWakeup::PROC_SPCWKUP_ENTITY i_entity );
extern "C"
{
/// @brief Sets core, ex or eq chiplet into special wakeup state.
/// @param[in] i_chipletTarget fapi2 target associated with core, ex and eq.
/// @param[in] i_operation special wakeup operations to be used.
/// @param[in] i_entity entity requesting special wakeup.
/// @return FAPI2_RC_SUCCESS on success, errorcode otherwise.
/// @note needs support of following attribute:
/// ATTR_PM_SPWUP_FSP
/// ATTR_PM_SPWUP_OCC
/// ATTR_PM_SPWUP_HOST
/// ATTR_PM_SPWUP_OTR
/// ATTR_PM_SPWUP_IGNORE_XSTOP_FLAG
fapi2::ReturnCode
p9_cpu_special_wakeup( const p9specialWakeup::FAPI2_WAKEUP_CHIPLET& i_chipletTarget,
const p9specialWakeup::PROC_SPCWKUP_OPS i_operation,
const p9specialWakeup::PROC_SPCWKUP_ENTITY i_entity );
}// extern "C" ends
#endif //__P9_CPU_SPECIAL_WAKEUP_H_
<|endoftext|>
|
<commit_before>#include "JewelFactory.h"
#include <SDL2/SDL_image.h>
#include "jewel.h"
#include "graphics/Renderer.h"
#include "util/Log.h"
namespace bejeweled {
namespace {
int dx[7] = {3,0,1,2,0,1,2};
int dy[7] = {3,0,0,0,1,1,1};
}
JewelFactory::JewelFactory(int jewel_pool_size, graphics::Renderer &renderer) : generator_(), dist_(0, jewel_pool_size), jewel_texture_() {
LogSDL(jewel_texture_ = graphics::Texture(IMG_LoadTexture(renderer, "resources/sprites/sprites.bmp")));
}
Jewel JewelFactory::GetNextJewel() {
auto aux = dist_(generator_) + 1;
auto x = dx[aux];
auto y = dy[aux];
auto spritesheet_location = util::Point{x * 32, y * 32} + Jewel::Size();
return Jewel(static_cast<JewelType>(aux), jewel_texture_, spritesheet_location);
}
} // namespace bejewled
<commit_msg>Fix spritesheet filename<commit_after>#include "JewelFactory.h"
#include <SDL2/SDL_image.h>
#include "jewel.h"
#include "graphics/Renderer.h"
#include "util/Log.h"
namespace bejeweled {
namespace {
int dx[7] = {3,0,1,2,0,1,2};
int dy[7] = {3,0,0,0,1,1,1};
}
JewelFactory::JewelFactory(int jewel_pool_size, graphics::Renderer &renderer) : generator_(), dist_(0, jewel_pool_size), jewel_texture_() {
LogSDL(jewel_texture_ = graphics::Texture(IMG_LoadTexture(renderer, "resources/sprites/sprites.png")));
}
Jewel JewelFactory::GetNextJewel() {
auto aux = dist_(generator_) + 1;
auto x = dx[aux];
auto y = dy[aux];
auto spritesheet_location = util::Point{x * 32, y * 32} + Jewel::Size();
return Jewel(static_cast<JewelType>(aux), jewel_texture_, spritesheet_location);
}
} // namespace bejewled
<|endoftext|>
|
<commit_before><commit_msg>Fix sigsegv with createObjects<commit_after><|endoftext|>
|
<commit_before>#include "StdAfx.h"
#include "NikonDecompressor.h"
/*
RawSpeed - RAW file decoder.
Copyright (C) 2009 Klaus Post
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 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
http://www.klauspost.com
*/
namespace RawSpeed {
NikonDecompressor::NikonDecompressor(FileMap* file, RawImage img) :
LJpegDecompressor(file, img) {
for (uint32 i = 0; i < 0xffff ; i++) {
curve[i] = i;
}
bits = 0;
}
NikonDecompressor::~NikonDecompressor(void) {
if (bits)
delete(bits);
bits = 0;
}
void NikonDecompressor::initTable(uint32 huffSelect) {
HuffmanTable *dctbl1 = &huff[0];
uint32 acc = 0;
for (uint32 i = 0; i < 16 ;i++) {
dctbl1->bits[i+1] = nikon_tree[huffSelect][i];
acc += dctbl1->bits[i+1];
}
dctbl1->bits[0] = 0;
for (uint32 i = 0 ; i < acc; i++) {
dctbl1->huffval[i] = nikon_tree[huffSelect][i+16];
}
createHuffmanTable(dctbl1);
}
void NikonDecompressor::DecompressNikon(ByteStream *metadata, uint32 w, uint32 h, uint32 bitsPS, uint32 offset, uint32 size) {
uint32 v0 = metadata->getByte();
uint32 v1 = metadata->getByte();
uint32 huffSelect = 0;
uint32 split = 0;
int pUp1[2];
int pUp2[2];
mUseBigtable = true;
_RPT2(0, "Nef version v0:%u, v1:%u\n", v0, v1);
if (v0 == 73 || v1 == 88)
metadata->skipBytes(2110);
if (v0 == 70) huffSelect = 2;
if (bitsPS == 14) huffSelect += 3;
pUp1[0] = metadata->getShort();
pUp1[1] = metadata->getShort();
pUp2[0] = metadata->getShort();
pUp2[1] = metadata->getShort();
int _max = 1 << bitsPS & 0x7fff;
uint32 step = 0;
uint32 csize = metadata->getShort();
if (csize > 1)
step = _max / (csize - 1);
if (v0 == 68 && v1 == 32 && step > 0) {
for (uint32 i = 0; i < csize; i++)
curve[i*step] = metadata->getShort();
for (int i = 0; i < _max; i++)
curve[i] = (curve[i-i%step] * (step - i % step) +
curve[i-i%step+step] * (i % step)) / step;
metadata->setAbsoluteOffset(562);
split = metadata->getShort();
} else if (v0 != 70 && csize <= 0x4001) {
for (uint32 i = 0; i < csize; i++) {
curve[i] = metadata->getShort();
}
_max = csize;
}
while (curve[_max-2] == curve[_max-1]) _max--;
initTable(huffSelect);
mRaw->whitePoint = curve[_max-1];
mRaw->blackLevel = curve[0];
uint32 x, y;
bits = new BitPumpMSB(mFile->getData(offset), size);
uchar8 *draw = mRaw->getData();
uint32 *dest;
uint32 pitch = mRaw->pitch;
int pLeft1 = 0;
int pLeft2 = 0;
uint32 cw = w / 2;
for (y = 0; y < h; y++) {
if (split && y == split) {
initTable(huffSelect + 1);
}
dest = (uint32*) & draw[y*pitch]; // Adjust destination
pUp1[y&1] += HuffDecodeNikon();
pUp2[y&1] += HuffDecodeNikon();
pLeft1 = pUp1[y&1];
pLeft2 = pUp2[y&1];
dest[0] = curve[pLeft1] | (curve[pLeft2] << 16);
for (x = 1; x < cw; x++) {
bits->checkPos();
pLeft1 += HuffDecodeNikon();
pLeft2 += HuffDecodeNikon();
dest[x] = curve[MIN(_max-1, MAX(0,pLeft1))] | (curve[MIN(_max-1, MAX(0,pLeft2))] << 16);
}
}
}
/*
*--------------------------------------------------------------
*
* HuffDecode --
*
* Taken from Figure F.16: extract next coded symbol from
* input stream. This should becode a macro.
*
* Results:
* Next coded symbol
*
* Side effects:
* Bitstream is parsed.
*
*--------------------------------------------------------------
*/
int NikonDecompressor::HuffDecodeNikon() {
int rv;
int l, temp;
int code, val ;
HuffmanTable *dctbl1 = &huff[0];
bits->fill();
code = bits->peekBitsNoFill(14);
val = dctbl1->bigTable[code];
if ((val&0xff) != 0xff) {
bits->skipBitsNoFill(val&0xff);
return val >> 8;
}
rv = 0;
code = bits->peekByteNoFill();
val = dctbl1->numbits[code];
l = val & 15;
if (l) {
bits->skipBitsNoFill(l);
rv = val >> 4;
} else {
bits->skipBits(8);
l = 8;
while (code > dctbl1->maxcode[l]) {
temp = bits->getBitNoFill();
code = (code << 1) | temp;
l++;
}
if (l > 16) {
ThrowIOE("Corrupt JPEG data: bad Huffman code:%u\n", l);
} else {
rv = dctbl1->huffval[dctbl1->valptr[l] +
((int)(code - dctbl1->mincode[l]))];
}
}
if (rv == 16)
return -32768;
/*
* Section F.2.2.1: decode the difference and
* Figure F.12: extend sign bit
*/
uint32 len = rv & 15;
uint32 shl = rv >> 4;
int diff = ((bits->getBits(len - shl) << 1) + 1) << shl >> 1;
if ((diff & (1 << (len - 1))) == 0)
diff -= (1 << len) - !shl;
return diff;
}
} // namespace RawSpeed
<commit_msg>Clamp initial value for Nikon decoder to avoid buffer overflow.<commit_after>#include "StdAfx.h"
#include "NikonDecompressor.h"
/*
RawSpeed - RAW file decoder.
Copyright (C) 2009 Klaus Post
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 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
http://www.klauspost.com
*/
namespace RawSpeed {
NikonDecompressor::NikonDecompressor(FileMap* file, RawImage img) :
LJpegDecompressor(file, img) {
for (uint32 i = 0; i < 0xffff ; i++) {
curve[i] = i;
}
bits = 0;
}
NikonDecompressor::~NikonDecompressor(void) {
if (bits)
delete(bits);
bits = 0;
}
void NikonDecompressor::initTable(uint32 huffSelect) {
HuffmanTable *dctbl1 = &huff[0];
uint32 acc = 0;
for (uint32 i = 0; i < 16 ;i++) {
dctbl1->bits[i+1] = nikon_tree[huffSelect][i];
acc += dctbl1->bits[i+1];
}
dctbl1->bits[0] = 0;
for (uint32 i = 0 ; i < acc; i++) {
dctbl1->huffval[i] = nikon_tree[huffSelect][i+16];
}
createHuffmanTable(dctbl1);
}
void NikonDecompressor::DecompressNikon(ByteStream *metadata, uint32 w, uint32 h, uint32 bitsPS, uint32 offset, uint32 size) {
uint32 v0 = metadata->getByte();
uint32 v1 = metadata->getByte();
uint32 huffSelect = 0;
uint32 split = 0;
int pUp1[2];
int pUp2[2];
mUseBigtable = true;
_RPT2(0, "Nef version v0:%u, v1:%u\n", v0, v1);
if (v0 == 73 || v1 == 88)
metadata->skipBytes(2110);
if (v0 == 70) huffSelect = 2;
if (bitsPS == 14) huffSelect += 3;
pUp1[0] = metadata->getShort();
pUp1[1] = metadata->getShort();
pUp2[0] = metadata->getShort();
pUp2[1] = metadata->getShort();
int _max = 1 << bitsPS & 0x7fff;
uint32 step = 0;
uint32 csize = metadata->getShort();
if (csize > 1)
step = _max / (csize - 1);
if (v0 == 68 && v1 == 32 && step > 0) {
for (uint32 i = 0; i < csize; i++)
curve[i*step] = metadata->getShort();
for (int i = 0; i < _max; i++)
curve[i] = (curve[i-i%step] * (step - i % step) +
curve[i-i%step+step] * (i % step)) / step;
metadata->setAbsoluteOffset(562);
split = metadata->getShort();
} else if (v0 != 70 && csize <= 0x4001) {
for (uint32 i = 0; i < csize; i++) {
curve[i] = metadata->getShort();
}
_max = csize;
}
while (curve[_max-2] == curve[_max-1]) _max--;
initTable(huffSelect);
mRaw->whitePoint = curve[_max-1];
mRaw->blackLevel = curve[0];
uint32 x, y;
bits = new BitPumpMSB(mFile->getData(offset), size);
uchar8 *draw = mRaw->getData();
uint32 *dest;
uint32 pitch = mRaw->pitch;
int pLeft1 = 0;
int pLeft2 = 0;
uint32 cw = w / 2;
for (y = 0; y < h; y++) {
if (split && y == split) {
initTable(huffSelect + 1);
}
dest = (uint32*) & draw[y*pitch]; // Adjust destination
pUp1[y&1] += HuffDecodeNikon();
pUp2[y&1] += HuffDecodeNikon();
pLeft1 = pUp1[y&1];
pLeft2 = pUp2[y&1];
dest[0] = curve[MIN(_max-1, MAX(0,pLeft1))] | (curve[MIN(_max-1, MAX(0,pLeft2))] << 16);
for (x = 1; x < cw; x++) {
bits->checkPos();
pLeft1 += HuffDecodeNikon();
pLeft2 += HuffDecodeNikon();
dest[x] = curve[MIN(_max-1, MAX(0,pLeft1))] | (curve[MIN(_max-1, MAX(0,pLeft2))] << 16);
}
}
}
/*
*--------------------------------------------------------------
*
* HuffDecode --
*
* Taken from Figure F.16: extract next coded symbol from
* input stream. This should becode a macro.
*
* Results:
* Next coded symbol
*
* Side effects:
* Bitstream is parsed.
*
*--------------------------------------------------------------
*/
int NikonDecompressor::HuffDecodeNikon() {
int rv;
int l, temp;
int code, val ;
HuffmanTable *dctbl1 = &huff[0];
bits->fill();
code = bits->peekBitsNoFill(14);
val = dctbl1->bigTable[code];
if ((val&0xff) != 0xff) {
bits->skipBitsNoFill(val&0xff);
return val >> 8;
}
rv = 0;
code = bits->peekByteNoFill();
val = dctbl1->numbits[code];
l = val & 15;
if (l) {
bits->skipBitsNoFill(l);
rv = val >> 4;
} else {
bits->skipBits(8);
l = 8;
while (code > dctbl1->maxcode[l]) {
temp = bits->getBitNoFill();
code = (code << 1) | temp;
l++;
}
if (l > 16) {
ThrowIOE("Corrupt JPEG data: bad Huffman code:%u\n", l);
} else {
rv = dctbl1->huffval[dctbl1->valptr[l] +
((int)(code - dctbl1->mincode[l]))];
}
}
if (rv == 16)
return -32768;
/*
* Section F.2.2.1: decode the difference and
* Figure F.12: extend sign bit
*/
uint32 len = rv & 15;
uint32 shl = rv >> 4;
int diff = ((bits->getBits(len - shl) << 1) + 1) << shl >> 1;
if ((diff & (1 << (len - 1))) == 0)
diff -= (1 << len) - !shl;
return diff;
}
} // namespace RawSpeed
<|endoftext|>
|
<commit_before>/*
* Copyright (c) 2008-2017, Hazelcast, Inc. 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.
*/
#ifdef HZ_BUILD_WITH_SSL
#include "hazelcast/client/internal/socket/SSLSocket.h"
#include "hazelcast/client/config/SSLConfig.h"
#include "hazelcast/client/exception/IOException.h"
#include "hazelcast/util/IOUtil.h"
#include <boost/bind.hpp>
#include <iostream>
#include <cstdlib>
#include <string.h>
#if defined(WIN32) || defined(_WIN32) || defined(WIN64) || defined(_WIN64)
#pragma warning(push)
#pragma warning(disable: 4996) //for strerror
#endif
namespace hazelcast {
namespace client {
namespace internal {
namespace socket {
struct HAZELCAST_API ConnectHandler
{
ConnectHandler(asio::error_code &errorCode) : ec(errorCode) {}
template <typename Iterator>
void operator()(
const asio::error_code& error,
Iterator iterator) {
ec = error;
}
asio::error_code &ec;
};
SSLSocket::SSLSocket(const client::Address &address, asio::io_service &ioSrv,
asio::ssl::context &context)
: remoteEndpoint(address), ioService(ioSrv), sslContext(context),
deadline(ioSrv) {
socket = std::auto_ptr<asio::ssl::stream<asio::ip::tcp::socket> >(
new asio::ssl::stream<asio::ip::tcp::socket>(ioService, sslContext));
}
SSLSocket::~SSLSocket() {
close();
}
void SSLSocket::checkDeadline(const asio::error_code &ec)
{
// The timer may return an error, e.g. operation_aborted when we cancel it. would_block is OK,
// since we set it at the start of the connection.
if (ec != asio::error::would_block) {
return;
}
// Check whether the deadline has passed. We compare the deadline against
// the current time since a new asynchronous operation may have moved the
// deadline before this actor had a chance to run.
if (deadline.expires_at() <= asio::deadline_timer::traits_type::now()) {
// The deadline has passed. The socket is closed so that any outstanding
// asynchronous operations are cancelled. This allows the blocked
// connect(), read_line() or write_line() functions to return.
asio::error_code ignored_ec;
socket->lowest_layer().close(ignored_ec);
return;
}
// Put the actor back to sleep. _1 is for passing the error_code to the method.
deadline.async_wait(boost::bind(&SSLSocket::checkDeadline, this, _1));
}
int SSLSocket::connect(int timeoutInMillis) {
try {
asio::ip::tcp::resolver resolver(ioService);
std::ostringstream out;
out << remoteEndpoint.getPort();
asio::ip::tcp::resolver::query query(remoteEndpoint.getHost(), out.str());
asio::ip::tcp::resolver::iterator iterator = resolver.resolve(query);
deadline.expires_from_now(boost::posix_time::milliseconds(timeoutInMillis));
asio::error_code ec;
checkDeadline(ec);
// Set up the variable that receives the result of the asynchronous
// operation. The error code is set to would_block to signal that the
// operation is incomplete. Asio guarantees that its asynchronous
// operations will never fail with would_block, so any other value in
// ec indicates completion.
ec = asio::error::would_block;
// Start the asynchronous operation itself. a callback will update the ec variable when the
// operation completes.
ConnectHandler handler(ec);
asio::async_connect(socket->lowest_layer(), iterator, handler);
// Block until the asynchronous operation has completed.
do {
ioService.run_one(ec);
} while (ec == asio::error::would_block);
// cancel the deadline timer
deadline.cancel();
// Cancel async connect operation if it is still in operation
socket->lowest_layer().cancel();
// the restart is needed for the other connection attempts to work since the ioservice goes
// into the stopped state following the loop
ioService.restart();
// Determine whether a connection was successfully established. The
// deadline actor may have had a chance to run and close our socket, even
// though the connect operation notionally succeeded. Therefore we must
// check whether the socket is still open before deciding if we succeeded
// or failed.
if (ec || !socket->lowest_layer().is_open()) {
std::ostringstream out;
out << "Connection to server " << remoteEndpoint << " failed. ";
if (ec) {
asio::system_error systemError(ec);
out << systemError.what();
} else {
out << " Failed to connect in " << timeoutInMillis << " milliseconds";
}
throw exception::IOException("SSLSocket::connect", out.str());
}
socket->handshake(asio::ssl::stream<asio::ip::tcp::socket>::client);
int size = 32 * 1024;
socket->lowest_layer().set_option(asio::socket_base::receive_buffer_size(size));
socket->lowest_layer().set_option(asio::socket_base::send_buffer_size(size));
// SO_NOSIGPIPE seems to be internally handled by asio on connect and accept. no such option
// is defined at the api, hence not setting this option
// set the socket as blocking by default
setBlocking(true);
} catch (asio::system_error &e) {
throw exception::IOException("SSLSocket::connect", e.what());
}
return 0;
}
void SSLSocket::setBlocking(bool blocking) {
socket->lowest_layer().non_blocking(!blocking);
}
std::vector<SSLSocket::CipherInfo> SSLSocket::getCiphers() const {
STACK_OF(SSL_CIPHER) *ciphers = SSL_get_ciphers(socket->native_handle());
std::vector<CipherInfo> supportedCiphers;
for (int i = 0; i < sk_SSL_CIPHER_num (ciphers); ++i) {
struct SSLSocket::CipherInfo info;
SSL_CIPHER *cipher = sk_SSL_CIPHER_value (ciphers, i);
info.name = SSL_CIPHER_get_name(cipher);
info.numberOfBits = SSL_CIPHER_get_bits(cipher, 0);
info.version = SSL_CIPHER_get_version(cipher);
char descBuf[256];
info.description = SSL_CIPHER_description(cipher, descBuf, 256);
supportedCiphers.push_back(info);
}
return supportedCiphers;
}
int SSLSocket::send(const void *buffer, int len) const {
size_t size = 0;
asio::error_code ec;
size = asio::write(*socket, asio::buffer(buffer, (size_t) len),
asio::transfer_exactly((size_t) len), ec);
return handleError("SSLSocket::send", size, ec);
}
int SSLSocket::receive(void *buffer, int len, int flag) const {
size_t size = 0;
asio::error_code ec;
size = asio::read(*socket, asio::buffer(buffer, (size_t) len),
asio::transfer_exactly((size_t) len), ec);
return handleError("SSLSocket::receive", size, ec);
}
int SSLSocket::getSocketId() const {
return socket->lowest_layer().native_handle();
}
void SSLSocket::setRemoteEndpoint(const client::Address &address) {
remoteEndpoint = address;
}
const client::Address &SSLSocket::getRemoteEndpoint() const {
return remoteEndpoint;
}
client::Address SSLSocket::getAddress() const {
asio::ip::basic_endpoint<asio::ip::tcp> local_endpoint = socket->lowest_layer().local_endpoint();
return client::Address(local_endpoint.address().to_string(), local_endpoint.port());
}
void SSLSocket::close() {
asio::error_code ec;
// Call the non-exception throwing versions of the following method
socket->lowest_layer().close(ec);
}
int SSLSocket::handleError(const std::string &source, size_t numBytes, const asio::error_code &error) const {
if (error && error != asio::error::try_again && error != asio::error::would_block) {
throw exception::IOException(source, error.message());
}
return (int) numBytes;
}
std::ostream &operator<<(std::ostream &out, const SSLSocket::CipherInfo &info) {
out << "Cipher{"
"Name: " << info.name <<
", Bits:"<< info.numberOfBits <<
", Version:"<< info.version <<
", Description:"<< info.description << "}";
return out;
}
}
}
}
}
#if defined(WIN32) || defined(_WIN32) || defined(WIN64) || defined(_WIN64)
#pragma warning(pop)
#endif
#endif // HZ_BUILD_WITH_SSL
<commit_msg>Make SSLSocket obey non-exception throwing rule of Socket::connect interface. It just returns the error code now. (#296)<commit_after>/*
* Copyright (c) 2008-2017, Hazelcast, Inc. 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.
*/
#ifdef HZ_BUILD_WITH_SSL
#include "hazelcast/client/internal/socket/SSLSocket.h"
#include "hazelcast/client/config/SSLConfig.h"
#include "hazelcast/client/exception/IOException.h"
#include "hazelcast/util/IOUtil.h"
#include <boost/bind.hpp>
#include <iostream>
#include <cstdlib>
#include <string.h>
#if defined(WIN32) || defined(_WIN32) || defined(WIN64) || defined(_WIN64)
#pragma warning(push)
#pragma warning(disable: 4996) //for strerror
#endif
namespace hazelcast {
namespace client {
namespace internal {
namespace socket {
struct HAZELCAST_API ConnectHandler
{
ConnectHandler(asio::error_code &errorCode) : ec(errorCode) {}
template <typename Iterator>
void operator()(
const asio::error_code& error,
Iterator iterator) {
ec = error;
}
asio::error_code &ec;
};
SSLSocket::SSLSocket(const client::Address &address, asio::io_service &ioSrv,
asio::ssl::context &context)
: remoteEndpoint(address), ioService(ioSrv), sslContext(context),
deadline(ioSrv) {
socket = std::auto_ptr<asio::ssl::stream<asio::ip::tcp::socket> >(
new asio::ssl::stream<asio::ip::tcp::socket>(ioService, sslContext));
}
SSLSocket::~SSLSocket() {
close();
}
void SSLSocket::checkDeadline(const asio::error_code &ec)
{
// The timer may return an error, e.g. operation_aborted when we cancel it. would_block is OK,
// since we set it at the start of the connection.
if (ec != asio::error::would_block) {
return;
}
// Check whether the deadline has passed. We compare the deadline against
// the current time since a new asynchronous operation may have moved the
// deadline before this actor had a chance to run.
if (deadline.expires_at() <= asio::deadline_timer::traits_type::now()) {
// The deadline has passed. The socket is closed so that any outstanding
// asynchronous operations are cancelled. This allows the blocked
// connect(), read_line() or write_line() functions to return.
asio::error_code ignored_ec;
socket->lowest_layer().close(ignored_ec);
return;
}
// Put the actor back to sleep. _1 is for passing the error_code to the method.
deadline.async_wait(boost::bind(&SSLSocket::checkDeadline, this, _1));
}
int SSLSocket::connect(int timeoutInMillis) {
try {
asio::ip::tcp::resolver resolver(ioService);
std::ostringstream out;
out << remoteEndpoint.getPort();
asio::ip::tcp::resolver::query query(remoteEndpoint.getHost(), out.str());
asio::ip::tcp::resolver::iterator iterator = resolver.resolve(query);
deadline.expires_from_now(boost::posix_time::milliseconds(timeoutInMillis));
asio::error_code ec;
checkDeadline(ec);
// Set up the variable that receives the result of the asynchronous
// operation. The error code is set to would_block to signal that the
// operation is incomplete. Asio guarantees that its asynchronous
// operations will never fail with would_block, so any other value in
// ec indicates completion.
ec = asio::error::would_block;
// Start the asynchronous operation itself. a callback will update the ec variable when the
// operation completes.
ConnectHandler handler(ec);
asio::async_connect(socket->lowest_layer(), iterator, handler);
// Block until the asynchronous operation has completed.
do {
ioService.run_one(ec);
} while (ec == asio::error::would_block);
// cancel the deadline timer
deadline.cancel();
// Cancel async connect operation if it is still in operation
socket->lowest_layer().cancel();
// the restart is needed for the other connection attempts to work since the ioservice goes
// into the stopped state following the loop
ioService.restart();
// Determine whether a connection was successfully established. The
// deadline actor may have had a chance to run and close our socket, even
// though the connect operation notionally succeeded. Therefore we must
// check whether the socket is still open before deciding if we succeeded
// or failed.
if (ec) {
return ec.value();
}
if (!socket->lowest_layer().is_open()) {
return asio::error::operation_aborted;
}
socket->handshake(asio::ssl::stream<asio::ip::tcp::socket>::client);
int size = 32 * 1024;
socket->lowest_layer().set_option(asio::socket_base::receive_buffer_size(size));
socket->lowest_layer().set_option(asio::socket_base::send_buffer_size(size));
// SO_NOSIGPIPE seems to be internally handled by asio on connect and accept. no such option
// is defined at the api, hence not setting this option
// set the socket as blocking by default
setBlocking(true);
} catch (asio::system_error &e) {
return e.code().value();
}
return 0;
}
void SSLSocket::setBlocking(bool blocking) {
socket->lowest_layer().non_blocking(!blocking);
}
std::vector<SSLSocket::CipherInfo> SSLSocket::getCiphers() const {
STACK_OF(SSL_CIPHER) *ciphers = SSL_get_ciphers(socket->native_handle());
std::vector<CipherInfo> supportedCiphers;
for (int i = 0; i < sk_SSL_CIPHER_num (ciphers); ++i) {
struct SSLSocket::CipherInfo info;
SSL_CIPHER *cipher = sk_SSL_CIPHER_value (ciphers, i);
info.name = SSL_CIPHER_get_name(cipher);
info.numberOfBits = SSL_CIPHER_get_bits(cipher, 0);
info.version = SSL_CIPHER_get_version(cipher);
char descBuf[256];
info.description = SSL_CIPHER_description(cipher, descBuf, 256);
supportedCiphers.push_back(info);
}
return supportedCiphers;
}
int SSLSocket::send(const void *buffer, int len) const {
size_t size = 0;
asio::error_code ec;
size = asio::write(*socket, asio::buffer(buffer, (size_t) len),
asio::transfer_exactly((size_t) len), ec);
return handleError("SSLSocket::send", size, ec);
}
int SSLSocket::receive(void *buffer, int len, int flag) const {
size_t size = 0;
asio::error_code ec;
size = asio::read(*socket, asio::buffer(buffer, (size_t) len),
asio::transfer_exactly((size_t) len), ec);
return handleError("SSLSocket::receive", size, ec);
}
int SSLSocket::getSocketId() const {
return socket->lowest_layer().native_handle();
}
void SSLSocket::setRemoteEndpoint(const client::Address &address) {
remoteEndpoint = address;
}
const client::Address &SSLSocket::getRemoteEndpoint() const {
return remoteEndpoint;
}
client::Address SSLSocket::getAddress() const {
asio::ip::basic_endpoint<asio::ip::tcp> local_endpoint = socket->lowest_layer().local_endpoint();
return client::Address(local_endpoint.address().to_string(), local_endpoint.port());
}
void SSLSocket::close() {
asio::error_code ec;
// Call the non-exception throwing versions of the following method
socket->lowest_layer().close(ec);
}
int SSLSocket::handleError(const std::string &source, size_t numBytes, const asio::error_code &error) const {
if (error && error != asio::error::try_again && error != asio::error::would_block) {
throw exception::IOException(source, error.message());
}
return (int) numBytes;
}
std::ostream &operator<<(std::ostream &out, const SSLSocket::CipherInfo &info) {
out << "Cipher{"
"Name: " << info.name <<
", Bits:"<< info.numberOfBits <<
", Version:"<< info.version <<
", Description:"<< info.description << "}";
return out;
}
}
}
}
}
#if defined(WIN32) || defined(_WIN32) || defined(WIN64) || defined(_WIN64)
#pragma warning(pop)
#endif
#endif // HZ_BUILD_WITH_SSL
<|endoftext|>
|
<commit_before>// Copyright (c) 2013, Facebook, Inc. All rights reserved.
// This source code is licensed under the BSD-style license found in the
// LICENSE file in the root directory of this source tree. An additional grant
// of patent rights can be found in the PATENTS file in the same directory.
//
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file. See the AUTHORS file for names of contributors.
#include "util/arena.h"
#include <sys/mman.h>
#include <algorithm>
namespace rocksdb {
const size_t Arena::kMinBlockSize = 4096;
const size_t Arena::kMaxBlockSize = 2 << 30;
static const int kAlignUnit = sizeof(void*);
size_t OptimizeBlockSize(size_t block_size) {
// Make sure block_size is in optimal range
block_size = std::max(Arena::kMinBlockSize, block_size);
block_size = std::min(Arena::kMaxBlockSize, block_size);
// make sure block_size is the multiple of kAlignUnit
if (block_size % kAlignUnit != 0) {
block_size = (1 + block_size / kAlignUnit) * kAlignUnit;
}
return block_size;
}
Arena::Arena(size_t block_size) : kBlockSize(OptimizeBlockSize(block_size)) {
assert(kBlockSize >= kMinBlockSize && kBlockSize <= kMaxBlockSize &&
kBlockSize % kAlignUnit == 0);
}
Arena::~Arena() {
for (const auto& block : blocks_) {
delete[] block;
}
for (const auto& mmap_info : huge_blocks_) {
auto ret = munmap(mmap_info.addr_, mmap_info.length_);
if (ret != 0) {
// TODO(sdong): Better handling
perror("munmap");
}
}
}
char* Arena::AllocateFallback(size_t bytes, bool aligned) {
if (bytes > kBlockSize / 4) {
++irregular_block_num;
// Object is more than a quarter of our block size. Allocate it separately
// to avoid wasting too much space in leftover bytes.
return AllocateNewBlock(bytes);
}
// We waste the remaining space in the current block.
auto block_head = AllocateNewBlock(kBlockSize);
alloc_bytes_remaining_ = kBlockSize - bytes;
if (aligned) {
aligned_alloc_ptr_ = block_head + bytes;
unaligned_alloc_ptr_ = block_head + kBlockSize;
return block_head;
} else {
aligned_alloc_ptr_ = block_head;
unaligned_alloc_ptr_ = block_head + kBlockSize - bytes;
return unaligned_alloc_ptr_;
}
}
char* Arena::AllocateAligned(size_t bytes, size_t huge_page_tlb_size) {
assert((kAlignUnit & (kAlignUnit - 1)) ==
0); // Pointer size should be a power of 2
#ifdef OS_LINUX
if (huge_page_tlb_size > 0 && bytes > 0) {
// Allocate from a huge page TBL table.
size_t reserved_size =
((bytes - 1U) / huge_page_tlb_size + 1U) * huge_page_tlb_size;
assert(reserved_size >= bytes);
void* addr = mmap(nullptr, reserved_size, (PROT_READ | PROT_WRITE),
(MAP_PRIVATE | MAP_ANONYMOUS | MAP_HUGETLB), 0, 0);
if (addr == MAP_FAILED) {
perror("mmap");
// fail back to malloc
} else {
blocks_memory_ += reserved_size;
huge_blocks_.push_back(MmapInfo(addr, reserved_size));
return reinterpret_cast<char*>(addr);
}
}
#endif
size_t current_mod =
reinterpret_cast<uintptr_t>(aligned_alloc_ptr_) & (kAlignUnit - 1);
size_t slop = (current_mod == 0 ? 0 : kAlignUnit - current_mod);
size_t needed = bytes + slop;
char* result;
if (needed <= alloc_bytes_remaining_) {
result = aligned_alloc_ptr_ + slop;
aligned_alloc_ptr_ += needed;
alloc_bytes_remaining_ -= needed;
} else {
// AllocateFallback always returned aligned memory
result = AllocateFallback(bytes, true /* aligned */);
}
assert((reinterpret_cast<uintptr_t>(result) & (kAlignUnit - 1)) == 0);
return result;
}
char* Arena::AllocateNewBlock(size_t block_bytes) {
char* block = new char[block_bytes];
blocks_memory_ += block_bytes;
blocks_.push_back(block);
return block;
}
} // namespace rocksdb
<commit_msg>Temporary remove perror() calls before we can log from inside of arena<commit_after>// Copyright (c) 2013, Facebook, Inc. All rights reserved.
// This source code is licensed under the BSD-style license found in the
// LICENSE file in the root directory of this source tree. An additional grant
// of patent rights can be found in the PATENTS file in the same directory.
//
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file. See the AUTHORS file for names of contributors.
#include "util/arena.h"
#include <sys/mman.h>
#include <algorithm>
namespace rocksdb {
const size_t Arena::kMinBlockSize = 4096;
const size_t Arena::kMaxBlockSize = 2 << 30;
static const int kAlignUnit = sizeof(void*);
size_t OptimizeBlockSize(size_t block_size) {
// Make sure block_size is in optimal range
block_size = std::max(Arena::kMinBlockSize, block_size);
block_size = std::min(Arena::kMaxBlockSize, block_size);
// make sure block_size is the multiple of kAlignUnit
if (block_size % kAlignUnit != 0) {
block_size = (1 + block_size / kAlignUnit) * kAlignUnit;
}
return block_size;
}
Arena::Arena(size_t block_size) : kBlockSize(OptimizeBlockSize(block_size)) {
assert(kBlockSize >= kMinBlockSize && kBlockSize <= kMaxBlockSize &&
kBlockSize % kAlignUnit == 0);
}
Arena::~Arena() {
for (const auto& block : blocks_) {
delete[] block;
}
for (const auto& mmap_info : huge_blocks_) {
auto ret = munmap(mmap_info.addr_, mmap_info.length_);
if (ret != 0) {
// TODO(sdong): Better handling
}
}
}
char* Arena::AllocateFallback(size_t bytes, bool aligned) {
if (bytes > kBlockSize / 4) {
++irregular_block_num;
// Object is more than a quarter of our block size. Allocate it separately
// to avoid wasting too much space in leftover bytes.
return AllocateNewBlock(bytes);
}
// We waste the remaining space in the current block.
auto block_head = AllocateNewBlock(kBlockSize);
alloc_bytes_remaining_ = kBlockSize - bytes;
if (aligned) {
aligned_alloc_ptr_ = block_head + bytes;
unaligned_alloc_ptr_ = block_head + kBlockSize;
return block_head;
} else {
aligned_alloc_ptr_ = block_head;
unaligned_alloc_ptr_ = block_head + kBlockSize - bytes;
return unaligned_alloc_ptr_;
}
}
char* Arena::AllocateAligned(size_t bytes, size_t huge_page_tlb_size) {
assert((kAlignUnit & (kAlignUnit - 1)) ==
0); // Pointer size should be a power of 2
#ifdef OS_LINUX
if (huge_page_tlb_size > 0 && bytes > 0) {
// Allocate from a huge page TBL table.
size_t reserved_size =
((bytes - 1U) / huge_page_tlb_size + 1U) * huge_page_tlb_size;
assert(reserved_size >= bytes);
void* addr = mmap(nullptr, reserved_size, (PROT_READ | PROT_WRITE),
(MAP_PRIVATE | MAP_ANONYMOUS | MAP_HUGETLB), 0, 0);
if (addr == MAP_FAILED) {
// TODO(sdong): Better handling
// fail back to malloc
} else {
blocks_memory_ += reserved_size;
huge_blocks_.push_back(MmapInfo(addr, reserved_size));
return reinterpret_cast<char*>(addr);
}
}
#endif
size_t current_mod =
reinterpret_cast<uintptr_t>(aligned_alloc_ptr_) & (kAlignUnit - 1);
size_t slop = (current_mod == 0 ? 0 : kAlignUnit - current_mod);
size_t needed = bytes + slop;
char* result;
if (needed <= alloc_bytes_remaining_) {
result = aligned_alloc_ptr_ + slop;
aligned_alloc_ptr_ += needed;
alloc_bytes_remaining_ -= needed;
} else {
// AllocateFallback always returned aligned memory
result = AllocateFallback(bytes, true /* aligned */);
}
assert((reinterpret_cast<uintptr_t>(result) & (kAlignUnit - 1)) == 0);
return result;
}
char* Arena::AllocateNewBlock(size_t block_bytes) {
char* block = new char[block_bytes];
blocks_memory_ += block_bytes;
blocks_.push_back(block);
return block;
}
} // namespace rocksdb
<|endoftext|>
|
<commit_before>/*
* Copyright (C) 2015 ScyllaDB
*/
/*
* This file is part of Scylla.
*
* Scylla 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.
*
* Scylla 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 Scylla. If not, see <http://www.gnu.org/licenses/>.
*/
#define BOOST_TEST_DYN_LINK
#include <boost/test/unit_test.hpp>
#include "utils/UUID_gen.hh"
#include "tests/test-utils.hh"
#include "schema_builder.hh"
#include "core/thread.hh"
#include "memtable.hh"
#include "mutation_source_test.hh"
#include "mutation_reader_assertions.hh"
#include "disk-error-handler.hh"
thread_local disk_error_signal_type commit_error;
thread_local disk_error_signal_type general_disk_error;
static api::timestamp_type next_timestamp() {
static thread_local api::timestamp_type next_timestamp = 1;
return next_timestamp++;
}
static bytes make_unique_bytes() {
return to_bytes(utils::UUID_gen::get_time_UUID().to_sstring());
}
static void set_column(mutation& m, const sstring& column_name) {
assert(m.schema()->get_column_definition(to_bytes(column_name))->type == bytes_type);
auto value = data_value(make_unique_bytes());
m.set_clustered_cell(clustering_key::make_empty(), to_bytes(column_name), value, next_timestamp());
}
static
mutation make_unique_mutation(schema_ptr s) {
return mutation(partition_key::from_single_value(*s, make_unique_bytes()), s);
}
// Returns a vector of empty mutations in ring order
std::vector<mutation> make_ring(schema_ptr s, int n_mutations) {
std::vector<mutation> ring;
for (int i = 0; i < n_mutations; ++i) {
ring.push_back(make_unique_mutation(s));
}
std::sort(ring.begin(), ring.end(), mutation_decorated_key_less_comparator());
return ring;
}
SEASTAR_TEST_CASE(test_memtable_conforms_to_mutation_source) {
return seastar::async([] {
run_mutation_source_tests([](schema_ptr s, const std::vector<mutation>& partitions) {
auto mt = make_lw_shared<memtable>(s);
for (auto&& m : partitions) {
mt->apply(m);
}
logalloc::shard_tracker().full_compaction();
return mt->as_data_source();
});
});
}
SEASTAR_TEST_CASE(test_adding_a_column_during_reading_doesnt_affect_read_result) {
return seastar::async([] {
auto common_builder = schema_builder("ks", "cf")
.with_column("pk", bytes_type, column_kind::partition_key);
auto s1 = common_builder
.with_column("v2", bytes_type, column_kind::regular_column)
.build();
auto s2 = common_builder
.with_column("v1", bytes_type, column_kind::regular_column) // new column
.with_column("v2", bytes_type, column_kind::regular_column)
.build();
auto mt = make_lw_shared<memtable>(s1);
std::vector<mutation> ring = make_ring(s1, 3);
for (auto&& m : ring) {
set_column(m, "v2");
mt->apply(m);
}
auto check_rd_s1 = assert_that(mt->make_reader(s1));
auto check_rd_s2 = assert_that(mt->make_reader(s2));
check_rd_s1.next_mutation().has_schema(s1).is_equal_to(ring[0]);
check_rd_s2.next_mutation().has_schema(s2).is_equal_to(ring[0]);
mt->set_schema(s2);
check_rd_s1.next_mutation().has_schema(s1).is_equal_to(ring[1]);
check_rd_s2.next_mutation().has_schema(s2).is_equal_to(ring[1]);
check_rd_s1.next_mutation().has_schema(s1).is_equal_to(ring[2]);
check_rd_s2.next_mutation().has_schema(s2).is_equal_to(ring[2]);
check_rd_s1.produces_end_of_stream();
check_rd_s2.produces_end_of_stream();
assert_that(mt->make_reader(s1))
.produces(ring[0])
.produces(ring[1])
.produces(ring[2])
.produces_end_of_stream();
assert_that(mt->make_reader(s2))
.produces(ring[0])
.produces(ring[1])
.produces(ring[2])
.produces_end_of_stream();
});
}
<commit_msg>tests: memtable: Add tests for flushing reader<commit_after>/*
* Copyright (C) 2015 ScyllaDB
*/
/*
* This file is part of Scylla.
*
* Scylla 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.
*
* Scylla 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 Scylla. If not, see <http://www.gnu.org/licenses/>.
*/
#define BOOST_TEST_DYN_LINK
#include <boost/test/unit_test.hpp>
#include "service/priority_manager.hh"
#include "database.hh"
#include "utils/UUID_gen.hh"
#include "tests/test-utils.hh"
#include "schema_builder.hh"
#include "core/thread.hh"
#include "memtable.hh"
#include "mutation_source_test.hh"
#include "mutation_reader_assertions.hh"
#include "disk-error-handler.hh"
thread_local disk_error_signal_type commit_error;
thread_local disk_error_signal_type general_disk_error;
static api::timestamp_type next_timestamp() {
static thread_local api::timestamp_type next_timestamp = 1;
return next_timestamp++;
}
static bytes make_unique_bytes() {
return to_bytes(utils::UUID_gen::get_time_UUID().to_sstring());
}
static void set_column(mutation& m, const sstring& column_name) {
assert(m.schema()->get_column_definition(to_bytes(column_name))->type == bytes_type);
auto value = data_value(make_unique_bytes());
m.set_clustered_cell(clustering_key::make_empty(), to_bytes(column_name), value, next_timestamp());
}
static
mutation make_unique_mutation(schema_ptr s) {
return mutation(partition_key::from_single_value(*s, make_unique_bytes()), s);
}
// Returns a vector of empty mutations in ring order
std::vector<mutation> make_ring(schema_ptr s, int n_mutations) {
std::vector<mutation> ring;
for (int i = 0; i < n_mutations; ++i) {
ring.push_back(make_unique_mutation(s));
}
std::sort(ring.begin(), ring.end(), mutation_decorated_key_less_comparator());
return ring;
}
SEASTAR_TEST_CASE(test_memtable_conforms_to_mutation_source) {
return seastar::async([] {
run_mutation_source_tests([](schema_ptr s, const std::vector<mutation>& partitions) {
auto mt = make_lw_shared<memtable>(s);
for (auto&& m : partitions) {
mt->apply(m);
}
logalloc::shard_tracker().full_compaction();
return mt->as_data_source();
});
});
}
SEASTAR_TEST_CASE(test_adding_a_column_during_reading_doesnt_affect_read_result) {
return seastar::async([] {
auto common_builder = schema_builder("ks", "cf")
.with_column("pk", bytes_type, column_kind::partition_key);
auto s1 = common_builder
.with_column("v2", bytes_type, column_kind::regular_column)
.build();
auto s2 = common_builder
.with_column("v1", bytes_type, column_kind::regular_column) // new column
.with_column("v2", bytes_type, column_kind::regular_column)
.build();
auto mt = make_lw_shared<memtable>(s1);
std::vector<mutation> ring = make_ring(s1, 3);
for (auto&& m : ring) {
set_column(m, "v2");
mt->apply(m);
}
auto check_rd_s1 = assert_that(mt->make_reader(s1));
auto check_rd_s2 = assert_that(mt->make_reader(s2));
check_rd_s1.next_mutation().has_schema(s1).is_equal_to(ring[0]);
check_rd_s2.next_mutation().has_schema(s2).is_equal_to(ring[0]);
mt->set_schema(s2);
check_rd_s1.next_mutation().has_schema(s1).is_equal_to(ring[1]);
check_rd_s2.next_mutation().has_schema(s2).is_equal_to(ring[1]);
check_rd_s1.next_mutation().has_schema(s1).is_equal_to(ring[2]);
check_rd_s2.next_mutation().has_schema(s2).is_equal_to(ring[2]);
check_rd_s1.produces_end_of_stream();
check_rd_s2.produces_end_of_stream();
assert_that(mt->make_reader(s1))
.produces(ring[0])
.produces(ring[1])
.produces(ring[2])
.produces_end_of_stream();
assert_that(mt->make_reader(s2))
.produces(ring[0])
.produces(ring[1])
.produces(ring[2])
.produces_end_of_stream();
});
}
SEASTAR_TEST_CASE(test_virtual_dirty_accounting_on_flush) {
return seastar::async([] {
schema_ptr s = schema_builder("ks", "cf")
.with_column("pk", bytes_type, column_kind::partition_key)
.with_column("col", bytes_type, column_kind::regular_column)
.build();
memtable_dirty_memory_manager mgr;
auto mt = make_lw_shared<memtable>(s, &mgr.region_group());
std::vector<mutation> ring = make_ring(s, 3);
std::vector<mutation> current_ring;
for (auto&& m : ring) {
auto m_with_cell = m;
m_with_cell.set_clustered_cell(clustering_key::make_empty(), to_bytes("col"),
data_value(bytes(bytes::initialized_later(), 4096)), next_timestamp());
mt->apply(m_with_cell);
current_ring.push_back(m_with_cell);
}
// Create a reader which will cause many partition versions to be created
auto rd1 = mt->make_reader(s);
streamed_mutation_opt part0_stream = rd1().get0();
// Override large cell value with a short one
{
auto part0_update = ring[0];
part0_update.set_clustered_cell(clustering_key::make_empty(), to_bytes("col"),
data_value(bytes(bytes::initialized_later(), 8)), next_timestamp());
mt->apply(std::move(part0_update));
current_ring[0] = part0_update;
}
std::vector<size_t> virtual_dirty_values;
virtual_dirty_values.push_back(mgr.virtual_dirty_memory());
auto flush_reader_check = assert_that(mt->make_flush_reader(s, service::get_local_priority_manager().memtable_flush_priority()));
flush_reader_check.produces(current_ring[0]);
virtual_dirty_values.push_back(mgr.virtual_dirty_memory());
flush_reader_check.produces(current_ring[1]);
virtual_dirty_values.push_back(mgr.virtual_dirty_memory());
part0_stream = {};
while (rd1().get0()) ;
logalloc::shard_tracker().full_compaction();
flush_reader_check.produces(current_ring[2]);
virtual_dirty_values.push_back(mgr.virtual_dirty_memory());
flush_reader_check.produces_end_of_stream();
virtual_dirty_values.push_back(mgr.virtual_dirty_memory());
std::reverse(virtual_dirty_values.begin(), virtual_dirty_values.end());
BOOST_REQUIRE(std::is_sorted(virtual_dirty_values.begin(), virtual_dirty_values.end()));
});
}
struct function_invoking_consumer {
std::function<void()> func;
template<typename T>
stop_iteration consume(T t) {
func();
return stop_iteration::no;
}
void consume_end_of_stream() { }
};
// Reproducer for #1746
SEASTAR_TEST_CASE(test_segment_migration_during_flush) {
return seastar::async([] {
schema_ptr s = schema_builder("ks", "cf")
.with_column("pk", bytes_type, column_kind::partition_key)
.with_column("ck", bytes_type, column_kind::clustering_key)
.with_column("col", bytes_type, column_kind::regular_column)
.build();
memtable_dirty_memory_manager mgr;
auto mt = make_lw_shared<memtable>(s, &mgr.region_group());
const int rows_per_partition = 300;
const int partitions = 3;
std::vector<mutation> ring = make_ring(s, partitions);
for (auto& m : ring) {
for (int i = 0; i < rows_per_partition; ++i) {
auto ck = clustering_key::from_single_value(*s, data_value(make_unique_bytes()).serialize());
auto col_value = data_value(bytes(bytes::initialized_later(), 8));
m.set_clustered_cell(ck, to_bytes("col"), col_value, next_timestamp());
}
mt->apply(m);
}
std::vector<size_t> virtual_dirty_values;
virtual_dirty_values.push_back(mgr.virtual_dirty_memory());
auto rd = mt->make_flush_reader(s, service::get_local_priority_manager().memtable_flush_priority());
auto consume_mutation = [] (streamed_mutation_opt part) {
assert(part);
consume(*part, function_invoking_consumer{[] {
logalloc::shard_tracker().full_compaction();
}}).get();
};
for (int i = 0; i < partitions; ++i) {
consume_mutation(rd().get0());
virtual_dirty_values.push_back(mgr.virtual_dirty_memory());
}
BOOST_REQUIRE(!rd().get0());
std::reverse(virtual_dirty_values.begin(), virtual_dirty_values.end());
BOOST_REQUIRE(std::is_sorted(virtual_dirty_values.begin(), virtual_dirty_values.end()));
});
}
<|endoftext|>
|
<commit_before>/*
* Quad2.h
*
* Created on: May 15, 2013
* Author: Ryler Hockenbury
*
* Quad2
*/
#include "Quad2.h"
uint8_t vehicleStatus = 0x0;
bool inFlight = false;
ITG3200 gyro;
ADXL345 accel;
HMC5883L comp;
AR6210 receiver;
PID controller[2]; // pitch and roll controllers
//Motors motors;
float gyroData[3] = {0.0, 0.0, 0.0}; // x, y and z axis
float accelData[3] = {0.0, 0.0, 0.0};
float compData[3] = {0.0, 0.0, 0.0};
float currentFlightAngle[3] = {0.0, 0.0, 0.0}; // roll, pitch, yaw
float targetFlightAngle[2] = {0.0, 0.0}; // roll and pitch
float stickCommands[6] = {STICK_COMMAND_MID, STICK_COMMAND_MID, // roll, pitch, throttle, yaw, mode, aux1
STICK_COMMAND_MIN, STICK_COMMAND_MID,
STICK_COMMAND_MAX, STICK_COMMAND_MIN };
uint32_t currentSystemTime = 0;
uint32_t lastSystemTime = 0;
uint32_t deltaSystemTime = 0;
uint32_t last100HzTime = 0;
uint32_t last50HzTime = 0;
uint32_t last10HzTime = 0;
float pitchAdjust = 0.0;
float rollAdjust = 0.0;
float rollCurPoint = 0.0;
float pitchCurPoint = 0.0;
/*
* Helper routine to call radio ISR
*/
void handleReceiverInterruptHelper() {
receiver.readChannels();
}
void setup() {
Wire.begin(); // initialize I2C bus
Serial.begin(57600); // initialize serial link @ baudrate = 57600
receiver.init(); // initialize receiver
Serial.println("INFO: attaching receiver interrupts");
pinMode(PPM_PIN, INPUT);
attachInterrupt(0, handleReceiverInterruptHelper, FALLING);
delay(200);
Serial.println("INFO: initializing sensors");
gyro.init();
accel.init();
comp.init();
//gyro.setOffset();
//accel.setOffset();
//comp.setOffset();
//Serial.println("INFO: attaching motors");
//motors.init();
// run system test
// turn on green LED
delay(200);
Serial.println("INFO: entering flight processing loop");
}
void loop() {
currentSystemTime = millis();
deltaSystemTime = currentSystemTime - lastSystemTime;
lastSystemTime = currentSystemTime;
//Serial.println("current: " + currentSystemTime);
//Serial.println("100Hz: " + last100HzTime);
//Serial.println("50Hz: " + last50HzTime);
//Serial.println("10Hz: " + last10HzTime);
//Serial.println("last: " + deltaSystemTime); // loop time
// TODO Can i make the assumption that these happend periodically as i would except?
/* 100 Hz Tasks
* Poll IMU sensors, calculate orientation, update controller and command motors.
*/
if(currentSystemTime >= (last100HzTime + 10) && SENSORS_ONLINE) {
gyro.getRate(gyroData);
accel.getValue(accelData);
comp.getHeading(compData);
getOrientation(currentFlightAngle, gyroData, accelData, compData); // could put inside flight control? - eliminate currentAngle and gyroData
rollAdjust = targetFlightAngle[ROLL_AXIS] - currentFlightAngle[1]; // mismatch? - depends on orientation
pitchAdjust = targetFlightAngle[PITCH_AXIS] - currentFlightAngle[0];
//float factor = 1.0;
// also try just using angles
rollCurPoint = 1500.0 + gyroData[1]; // rate of change (degrees/second)
//float rollSetPoint = stickCommands[ROLL_CHANNEL] + factor*rollAdjust; //(degrees)
pitchCurPoint = 1500.0 + gyroData[0];
//float pitchSetPoint = stickCommands[PITCH_CHANNEL] + factor*pitchAdjust;
//motorAxisCommand[ROLL_AXIS] = controller[ROLL_AXIS].updatePid(1500.0 + gyroData[1], stickCommands[ROLL_CHANNEL] + levelAdjust[ROLL_AXIS]);
//motorAxisCommand[PITCH_AXIS] = controller[PITCH_AXIS].updatePid(1500.0 + gyroData[0], stickCommands[PITCH_CHANNEL] + levelAdjust[PITCH_AXIS]);
//processFlightControls(stickCommands, targetFlightAngle, controller); //currentFlightAngle, gyroData
last100HzTime = currentSystemTime;
}
/* 50 Hz Tasks
* Read and process commands from radio, and monitor battery.
*/
if(currentSystemTime >= (last50HzTime + 20) && RX_ONLINE) {
receiver.getStickCommands(stickCommands);
processFlightCommands(stickCommands, targetFlightAngle, controller, &gyro, &accel, &comp);
//TODO - monitor battery health
//get voltage
//get remaining mah
//get remaining time
last50HzTime = currentSystemTime;
}
/* 10 Hz Tasks
* Send serial stream to ground station.
*/
if(currentSystemTime >= (last10HzTime + 100)) {
serialOpen();
serialPrint(currentFlightAngle, 3);
serialPrint(stickCommands, 6);
//serialPrint(rollCurPoint);
//serialPrint(pitchCurPoint);
//serialPrint(targetFlightAngle, 2);
//serialPrint(rollAdjust);
//serialPrint(pitchAdjust);
//serialPrint((float)receiver.getSyncCounter());
//serialPrint(controller[ROLL_AXIS].getMode());
//serialPrint(controller[PITCH_AXIS].getMode());
//serialPrint(battVoltage);
//serialPrint(battCurrent);
serialClose();
// TODO - check for and process serial input
// pid gains
// stick scale/senstivitiy
last10HzTime = currentSystemTime;
}
}
/////////////////////////////////////////////
// CODE TO READ SERIES OF SENSOR REGSITERS //
/////////////////////////////////////////////
/*
byte buffer[6];
Serial.print("\n");
Serial.println("Reading Initialized Bytes");
I2Cdev::readByte(0x53, 0x0, buffer);
Serial.print("\n");
Serial.print(buffer[0], HEX);
Serial.print("\n");
I2Cdev::readByte(0x53, 0x1E, buffer);
Serial.print("\n");
Serial.print(buffer[0]);
Serial.print("\n");
I2Cdev::readByte(0x53, 0x1F, buffer);
Serial.print("\n");
Serial.print(buffer[0]);
Serial.print("\n");
I2Cdev::readByte(0x53, 0x20, buffer);
Serial.print("\n");
Serial.print(buffer[0]);
Serial.print("\n");
I2Cdev::readByte(0x53, 0x2C, buffer);
Serial.print("\n");
Serial.print(buffer[0], BIN);
Serial.print("\n");
I2Cdev::readByte(0x53, 0x2d, buffer);
Serial.print("\n");
Serial.print(buffer[0], BIN);
Serial.print("\n");
I2Cdev::readByte(0x53, 0x31, buffer);
Serial.print("\n");
Serial.print(buffer[0], BIN);
Serial.print("\n");
*/
//delay(20);
//Serial.print(buffer[0]);
//Serial.print("\n");
//delay(5000);
//gyro.setSampleRate(0x9);
//Serial.println("Writing Byte");
//byte status = I2Cdev::writeByte(0x68, 0x15, 0x9);
//Serial.print(status);
//delay(5000);
//I2Cdev::readBytes(0x68, 0x1D, 6, buffer);
//Serial.print("\n");
//Serial.println("Reading Byte");
//I2Cdev::readByte(0x68, 0x15, buffer);
//Serial.print(buffer[0]);
//Serial.print("\n");
<commit_msg>Updated main code<commit_after>/*
* Quad2.h
*
* Created on: May 15, 2013
* Author: Ryler Hockenbury
*
* Quad2
*/
#include "Quad2.h"
uint8_t vehicleStatus = 0x0;
bool inFlight = false;
ITG3200 gyro;
ADXL345 accel;
HMC5883L comp;
AR6210 receiver;
PID controller[2]; // pitch and roll controllers
//Motors motors;
float gyroData[3] = {0.0, 0.0, 0.0}; // x, y and z axis
float accelData[3] = {0.0, 0.0, 0.0};
float compData[3] = {0.0, 0.0, 0.0};
float currentFlightAngle[3] = {0.0, 0.0, 0.0}; // roll, pitch, yaw
float targetFlightAngle[2] = {0.0, 0.0}; // roll and pitch
float stickCommands[6] = {STICK_COMMAND_MID, STICK_COMMAND_MID, // roll, pitch, throttle, yaw, mode, aux1
STICK_COMMAND_MIN, STICK_COMMAND_MID,
STICK_COMMAND_MAX, STICK_COMMAND_MIN };
uint32_t currentSystemTime = 0;
uint32_t lastSystemTime = 0;
uint32_t deltaSystemTime = 0;
uint32_t last100HzTime = 0;
uint32_t last50HzTime = 0;
uint32_t last10HzTime = 0;
/*
* Helper routine to call radio ISR
*/
void handleReceiverInterruptHelper() {
receiver.readChannels();
}
/*
* Setup task
*/
void setup() {
Serial.begin(57600); // initialize serial link @ rate = 57600
Serial.println("INFO: Initializing status LEDs...");
LED::LED();
Serial.println("INFO: Initializing I2C bus...");
Wire.begin();
Serial.println("INFO: Initializing Spektrum receiver...");
receiver.init();
//pinMode(PPM_PIN, INPUT);
//attachInterrupt(0, handleReceiverInterruptHelper, FALLING);
//delay(200);
Serial.println("INFO: Initializing sensors...");
bool sensorStatus = false;
sensorStatus = gyro.init();
sensorStatus |= accel.init();
sensorStatus |= comp.init();
if(sensorStatus == false) {
Serial.println("INFO: Unable to initialize sensors");
}
//Serial.println("INFO: Initializing motors");
//motors.init();
Serial.println("INFO: Entering flight processing loop...");
delay(200);
}
/*
* Flight task
*/
void loop() {
currentSystemTime = millis();
deltaSystemTime = currentSystemTime - lastSystemTime;
lastSystemTime = currentSystemTime;
//LED::LEDBlink(RED_LED, 3, 250);
//LED::LEDBlink(YELLOW_LED, 3, 250);
//LED::LEDBlink(GREEN_LED, 3, 250);
//Serial.println("current: " + currentSystemTime);
//Serial.println("100Hz: " + last100HzTime);
//Serial.println("50Hz: " + last50HzTime);
//Serial.println("10Hz: " + last10HzTime);
//Serial.println("last: " + deltaSystemTime); // loop time
// TODO Can i make the assumption that these happend periodically as i would except?
/* 100 Hz Tasks
* Poll IMU sensors, calculate orientation, update controller and command motors.
*/
if(currentSystemTime >= (last100HzTime + 10)) {
if(SENSORS_ONLINE) {
gyro.getRate(gyroData);
accel.getValue(accelData);
comp.getHeading(compData);
// could put inside flight control? - eliminate currentAngle and gyroData
// but lose global access to currentFlightAngle
getOrientation(currentFlightAngle, gyroData, accelData, compData);
}
if(RX_ONLINE && SENSORS_ONLINE) {
processFlightControl(targetFlightAngle, currentFlightAngle, controller, gyroData, stickCommands);
}
last100HzTime = currentSystemTime;
}
/* 50 Hz Tasks
* Read and process commands from radio.
*/
if(currentSystemTime >= (last50HzTime + 20)) {
if(RX_ONLINE) {
receiver.getStickCommands(stickCommands);
processFlightCommands(stickCommands, targetFlightAngle, controller, &gyro, &accel, &comp);
}
last50HzTime = currentSystemTime;
}
/* 10 Hz Tasks
* Send serial stream to ground station.
*/
if(currentSystemTime >= (last10HzTime + 100)) {
serialOpen();
serialPrint(currentFlightAngle, 3);
serialPrint(stickCommands, 6);
//serialPrint(rollCurPoint);
//serialPrint(pitchCurPoint);
//serialPrint(targetFlightAngle, 2);
//serialPrint(rollAdjust);
//serialPrint(pitchAdjust);
//serialPrint((float)receiver.getSyncCounter());
//serialPrint(controller[ROLL_AXIS].getMode());
//serialPrint(controller[PITCH_AXIS].getMode());
//serialPrint(battVoltage);
//serialPrint(battCurrent);
serialClose();
// TODO - check for and process serial input
// pid gains
// stick scale/senstivitiy
//TODO - monitor battery health
//get voltage
//get remaining mah
//get remaining time
last10HzTime = currentSystemTime;
}
}
/////////////////////////////////////////////
// CODE TO READ SERIES OF SENSOR REGSITERS //
/////////////////////////////////////////////
/*
byte buffer[6];
Serial.print("\n");
Serial.println("Reading Initialized Bytes");
I2Cdev::readByte(0x53, 0x0, buffer);
Serial.print("\n");
Serial.print(buffer[0], HEX);
Serial.print("\n");
I2Cdev::readByte(0x53, 0x1E, buffer);
Serial.print("\n");
Serial.print(buffer[0]);
Serial.print("\n");
I2Cdev::readByte(0x53, 0x1F, buffer);
Serial.print("\n");
Serial.print(buffer[0]);
Serial.print("\n");
I2Cdev::readByte(0x53, 0x20, buffer);
Serial.print("\n");
Serial.print(buffer[0]);
Serial.print("\n");
I2Cdev::readByte(0x53, 0x2C, buffer);
Serial.print("\n");
Serial.print(buffer[0], BIN);
Serial.print("\n");
I2Cdev::readByte(0x53, 0x2d, buffer);
Serial.print("\n");
Serial.print(buffer[0], BIN);
Serial.print("\n");
I2Cdev::readByte(0x53, 0x31, buffer);
Serial.print("\n");
Serial.print(buffer[0], BIN);
Serial.print("\n");
*/
//delay(20);
//Serial.print(buffer[0]);
//Serial.print("\n");
//delay(5000);
//gyro.setSampleRate(0x9);
//Serial.println("Writing Byte");
//byte status = I2Cdev::writeByte(0x68, 0x15, 0x9);
//Serial.print(status);
//delay(5000);
//I2Cdev::readBytes(0x68, 0x1D, 6, buffer);
//Serial.print("\n");
//Serial.println("Reading Byte");
//I2Cdev::readByte(0x68, 0x15, buffer);
//Serial.print(buffer[0]);
//Serial.print("\n");
<|endoftext|>
|
<commit_before>/*
* Copyright 2013-2014 Jose Fonseca
*
* 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.
*
* 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 "tap.h"
#include "apps/wine.h"
#include <assert.h>
#include <stdlib.h>
#include <windows.h>
#include <dbghelp.h>
#include <shlwapi.h>
static bool
comparePath(const char *s1, const char *s2)
{
fprintf(stderr, "%s vs %s\n", s1, s2);
if (strcmp(s1, s2) == 0) {
return true;
}
s1 = PathFindFileNameA(s1);
s2 = PathFindFileNameA(s2);
fprintf(stderr, " %s vs %s\n", s1, s2);
return strcmp(s1, s2) == 0;
}
static BOOL
g_bStripped = FALSE;
static void
checkSym(HANDLE hProcess,
PVOID pvSymbol,
const char *szSymbolName)
{
bool ok;
DWORD64 dwAddr = (DWORD64)(UINT_PTR)pvSymbol;
// Test SymFromAddr
DWORD64 Displacement = 0;
struct {
SYMBOL_INFO Symbol;
CHAR Name[256];
} s;
memset(&s, 0, sizeof s);
s.Symbol.SizeOfStruct = sizeof s.Symbol;
s.Symbol.MaxNameLen = sizeof s.Symbol.Name + sizeof s.Name;
ok = SymFromAddr(hProcess, dwAddr, &Displacement, &s.Symbol);
test_line(ok, "SymFromAddr(&%s)", szSymbolName);
if (!ok) {
test_diagnostic_last_error();
} else {
if (!g_bStripped) {
ok = strcmp(s.Symbol.Name, szSymbolName) == 0;
} else {
// XXX: ignore differences due to demangling
ok = strncmp(szSymbolName, s.Symbol.Name, strlen(szSymbolName)) == 0;
}
test_line(ok, "SymFromAddr(&%s).Name", szSymbolName);
if (!ok) {
test_diagnostic("Name = \"%s\" != \"%s\"",
s.Symbol.Name, szSymbolName);
}
}
}
static void
checkSymLine(HANDLE hProcess,
PVOID pvSymbol,
const char *szSymbolName,
const char *szFileName,
DWORD dwLineNumber)
{
bool ok;
DWORD64 dwAddr = (DWORD64)(UINT_PTR)pvSymbol;
checkSym(hProcess, pvSymbol, szSymbolName);
if (g_bStripped) {
// Don't check line nos
return;
}
// Test SymGetLineFromAddr64
DWORD dwDisplacement;
IMAGEHLP_LINE64 Line;
ZeroMemory(&Line, sizeof Line);
Line.SizeOfStruct = sizeof Line;
ok = SymGetLineFromAddr64(hProcess, dwAddr, &dwDisplacement, &Line);
test_line(ok, "SymGetLineFromAddr64(&%s)", szSymbolName);
if (!ok) {
test_diagnostic_last_error();
} else {
ok = comparePath(Line.FileName, szFileName);
test_line(ok, "SymGetLineFromAddr64(&%s).FileName", szSymbolName);
if (!ok) {
test_diagnostic("FileName = \"%s\" != \"%s\"",
Line.FileName, szFileName);
}
ok = Line.LineNumber == dwLineNumber;
test_line(ok, "SymGetLineFromAddr64(&%s).LineNumber", szSymbolName);
if (Line.LineNumber != dwLineNumber) {
test_diagnostic("LineNumber = %lu != %lu",
Line.LineNumber, dwLineNumber);
}
}
}
static void
__attribute__ ((noinline))
checkCaller(HANDLE hProcess,
const char *szSymbolName,
const char *szFileName,
DWORD dwLineNumber)
{
void *addr = __builtin_return_address(0);
checkSymLine(hProcess, addr, szSymbolName, szFileName, dwLineNumber);
}
static void
checkExport(HANDLE hProcess,
const char *szModuleName,
const char *szSymbolName)
{
HMODULE hModule = GetModuleHandleA(szModuleName);
const PVOID pvSymbol = (PVOID)GetProcAddress(hModule, szSymbolName);
checkSym(hProcess, pvSymbol, szSymbolName);
}
static const DWORD foo_line = __LINE__; static int foo(int a, int b) {
return a * b;
}
#define LINE_BARRIER rand();
int
main(int argc, char **argv)
{
HANDLE hProcess = GetCurrentProcess();
bool ok;
if (strstr(argv[0], "_stripped_")) {
g_bStripped = TRUE;
}
HMODULE hMgwHelpDll = GetModuleHandleA("mgwhelp.dll");
if (!hMgwHelpDll) {
test_line(false, "GetModuleHandleA(\"mgwhelp.dll\")");
} else {
test_line(GetProcAddress(hMgwHelpDll, "SymGetOptions") != NULL, "GetProcAddress(\"SymGetOptions\")");
test_line(GetProcAddress(hMgwHelpDll, "SymGetOptions@0") == NULL, "!GetProcAddress(\"SymGetOptions\")");
}
ok = SymInitialize(hProcess, "", TRUE);
test_line(ok, "SymInitialize()");
if (!ok) {
test_diagnostic_last_error();
} {
checkSymLine(hProcess, (PVOID)&foo, "foo", __FILE__, foo_line);
checkCaller(hProcess, "main", __FILE__, __LINE__); LINE_BARRIER
// Test DbgHelp fallback
// XXX: Doesn't work reliably on Wine
if (!insideWine()) {
checkExport(hProcess, "kernel32", "Sleep");
}
ok = SymCleanup(hProcess);
test_line(ok, "SymCleanup()");
if (!ok) {
test_diagnostic_last_error();
}
}
test_exit();
}
<commit_msg>tests: Remove debug printfs.<commit_after>/*
* Copyright 2013-2014 Jose Fonseca
*
* 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.
*
* 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 "tap.h"
#include "apps/wine.h"
#include <assert.h>
#include <stdlib.h>
#include <windows.h>
#include <dbghelp.h>
#include <shlwapi.h>
static bool
comparePath(const char *s1, const char *s2)
{
if (strcmp(s1, s2) == 0) {
return true;
}
s1 = PathFindFileNameA(s1);
s2 = PathFindFileNameA(s2);
return strcmp(s1, s2) == 0;
}
static BOOL
g_bStripped = FALSE;
static void
checkSym(HANDLE hProcess,
PVOID pvSymbol,
const char *szSymbolName)
{
bool ok;
DWORD64 dwAddr = (DWORD64)(UINT_PTR)pvSymbol;
// Test SymFromAddr
DWORD64 Displacement = 0;
struct {
SYMBOL_INFO Symbol;
CHAR Name[256];
} s;
memset(&s, 0, sizeof s);
s.Symbol.SizeOfStruct = sizeof s.Symbol;
s.Symbol.MaxNameLen = sizeof s.Symbol.Name + sizeof s.Name;
ok = SymFromAddr(hProcess, dwAddr, &Displacement, &s.Symbol);
test_line(ok, "SymFromAddr(&%s)", szSymbolName);
if (!ok) {
test_diagnostic_last_error();
} else {
if (!g_bStripped) {
ok = strcmp(s.Symbol.Name, szSymbolName) == 0;
} else {
// XXX: ignore differences due to demangling
ok = strncmp(szSymbolName, s.Symbol.Name, strlen(szSymbolName)) == 0;
}
test_line(ok, "SymFromAddr(&%s).Name", szSymbolName);
if (!ok) {
test_diagnostic("Name = \"%s\" != \"%s\"",
s.Symbol.Name, szSymbolName);
}
}
}
static void
checkSymLine(HANDLE hProcess,
PVOID pvSymbol,
const char *szSymbolName,
const char *szFileName,
DWORD dwLineNumber)
{
bool ok;
DWORD64 dwAddr = (DWORD64)(UINT_PTR)pvSymbol;
checkSym(hProcess, pvSymbol, szSymbolName);
if (g_bStripped) {
// Don't check line nos
return;
}
// Test SymGetLineFromAddr64
DWORD dwDisplacement;
IMAGEHLP_LINE64 Line;
ZeroMemory(&Line, sizeof Line);
Line.SizeOfStruct = sizeof Line;
ok = SymGetLineFromAddr64(hProcess, dwAddr, &dwDisplacement, &Line);
test_line(ok, "SymGetLineFromAddr64(&%s)", szSymbolName);
if (!ok) {
test_diagnostic_last_error();
} else {
ok = comparePath(Line.FileName, szFileName);
test_line(ok, "SymGetLineFromAddr64(&%s).FileName", szSymbolName);
if (!ok) {
test_diagnostic("FileName = \"%s\" != \"%s\"",
Line.FileName, szFileName);
}
ok = Line.LineNumber == dwLineNumber;
test_line(ok, "SymGetLineFromAddr64(&%s).LineNumber", szSymbolName);
if (Line.LineNumber != dwLineNumber) {
test_diagnostic("LineNumber = %lu != %lu",
Line.LineNumber, dwLineNumber);
}
}
}
static void
__attribute__ ((noinline))
checkCaller(HANDLE hProcess,
const char *szSymbolName,
const char *szFileName,
DWORD dwLineNumber)
{
void *addr = __builtin_return_address(0);
checkSymLine(hProcess, addr, szSymbolName, szFileName, dwLineNumber);
}
static void
checkExport(HANDLE hProcess,
const char *szModuleName,
const char *szSymbolName)
{
HMODULE hModule = GetModuleHandleA(szModuleName);
const PVOID pvSymbol = (PVOID)GetProcAddress(hModule, szSymbolName);
checkSym(hProcess, pvSymbol, szSymbolName);
}
static const DWORD foo_line = __LINE__; static int foo(int a, int b) {
return a * b;
}
#define LINE_BARRIER rand();
int
main(int argc, char **argv)
{
HANDLE hProcess = GetCurrentProcess();
bool ok;
if (strstr(argv[0], "_stripped_")) {
g_bStripped = TRUE;
}
HMODULE hMgwHelpDll = GetModuleHandleA("mgwhelp.dll");
if (!hMgwHelpDll) {
test_line(false, "GetModuleHandleA(\"mgwhelp.dll\")");
} else {
test_line(GetProcAddress(hMgwHelpDll, "SymGetOptions") != NULL, "GetProcAddress(\"SymGetOptions\")");
test_line(GetProcAddress(hMgwHelpDll, "SymGetOptions@0") == NULL, "!GetProcAddress(\"SymGetOptions\")");
}
ok = SymInitialize(hProcess, "", TRUE);
test_line(ok, "SymInitialize()");
if (!ok) {
test_diagnostic_last_error();
} {
checkSymLine(hProcess, (PVOID)&foo, "foo", __FILE__, foo_line);
checkCaller(hProcess, "main", __FILE__, __LINE__); LINE_BARRIER
// Test DbgHelp fallback
// XXX: Doesn't work reliably on Wine
if (!insideWine()) {
checkExport(hProcess, "kernel32", "Sleep");
}
ok = SymCleanup(hProcess);
test_line(ok, "SymCleanup()");
if (!ok) {
test_diagnostic_last_error();
}
}
test_exit();
}
<|endoftext|>
|
<commit_before>/*
* templatedlg.cpp - dialogue to create, edit and delete alarm templates
* Program: kalarm
* (C) 2004 by David Jarvie <software@astrojar.org.uk>
*
* 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#include "kalarm.h"
#include <qlayout.h>
#include <qpushbutton.h>
#include <qwhatsthis.h>
#include <klocale.h>
#include <kmessagebox.h>
#include <kdebug.h>
#include "editdlg.h"
#include "alarmcalendar.h"
#include "functions.h"
#include "templatelistview.h"
#include "templatedlg.moc"
static const char TMPL_DIALOG_NAME[] = "TemplateDialog";
TemplateDlg* TemplateDlg::mInstance = 0;
TemplateDlg::TemplateDlg(QWidget* parent, const char* name)
: KDialogBase(KDialogBase::Plain, i18n("Alarm Templates"), Close, Ok, parent, name, false, true)
{
QWidget* topWidget = plainPage();
QBoxLayout* topLayout = new QHBoxLayout(topWidget);
topLayout->setSpacing(spacingHint());
QBoxLayout* layout = new QVBoxLayout(topLayout);
mTemplateList = new TemplateListView(true, i18n("The list of alarm templates"), topWidget);
mTemplateList->setSelectionMode(QListView::Extended);
mTemplateList->setSizePolicy(QSizePolicy(QSizePolicy::Expanding, QSizePolicy::Expanding));
connect(mTemplateList, SIGNAL(selectionChanged()), SLOT(slotSelectionChanged()));
layout->addWidget(mTemplateList);
layout = new QVBoxLayout(topLayout);
QPushButton* button = new QPushButton(i18n("&New..."), topWidget);
button->setFixedSize(button->sizeHint());
connect(button, SIGNAL(clicked()), SLOT(slotNew()));
QWhatsThis::add(button, i18n("Create a new alarm template"));
layout->addWidget(button);
mEditButton = new QPushButton(i18n("&Edit..."), topWidget);
mEditButton->setFixedSize(mEditButton->sizeHint());
connect(mEditButton, SIGNAL(clicked()), SLOT(slotEdit()));
QWhatsThis::add(mEditButton, i18n("Edit the currently highlighted alarm template"));
layout->addWidget(mEditButton);
mCopyButton = new QPushButton(i18n("Co&py"), topWidget);
mCopyButton->setFixedSize(mCopyButton->sizeHint());
connect(mCopyButton, SIGNAL(clicked()), SLOT(slotCopy()));
QWhatsThis::add(mCopyButton,
i18n("Create a new alarm template based on a copy of the currently highlighted template"));
layout->addWidget(mCopyButton);
mDeleteButton = new QPushButton(i18n("&Delete"), topWidget);
mDeleteButton->setFixedSize(mDeleteButton->sizeHint());
connect(mDeleteButton, SIGNAL(clicked()), SLOT(slotDelete()));
QWhatsThis::add(mDeleteButton, i18n("Delete the currently highlighted alarm template"));
layout->addWidget(mDeleteButton);
mTemplateList->refresh();
slotSelectionChanged(); // enable/disable buttons as appropriate
QSize s;
if (KAlarm::readConfigWindowSize(TMPL_DIALOG_NAME, s))
resize(s);
}
/******************************************************************************
* Destructor.
*/
TemplateDlg::~TemplateDlg()
{
mInstance = 0;
}
/******************************************************************************
* Create an instance, if none already exists.
*/
TemplateDlg* TemplateDlg::create(QWidget* parent, const char* name)
{
if (mInstance)
return 0;
mInstance = new TemplateDlg(parent, name);
return mInstance;
}
/******************************************************************************
* Called when the New Template button is clicked to create a new template
* based on the currently selected alarm.
*/
void TemplateDlg::slotNew()
{
createTemplate(0, this, mTemplateList);
}
/******************************************************************************
* Called when the Copy button is clicked to edit a copy of an existing alarm,
* to add to the list.
*/
void TemplateDlg::slotCopy()
{
TemplateListViewItem* item = mTemplateList->singleSelectedItem();
if (item)
{
KAEvent event = item->event();
createTemplate(&event, mTemplateList);
}
}
/******************************************************************************
* Create a new template.
* If 'event' is non-zero, base the new template on an existing event or template.
*/
void TemplateDlg::createTemplate(const KAEvent* event, QWidget* parent, TemplateListView* view)
{
EditAlarmDlg editDlg(true, i18n("New Alarm Template"), parent, "editDlg", event);
if (editDlg.exec() == QDialog::Accepted)
{
KAEvent event;
editDlg.getEvent(event);
// Add the template to the displayed lists and to the calendar file
AlarmCalendar* cal = AlarmCalendar::templateCalendarOpen();
if (cal)
{
cal->addEvent(event);
cal->save();
cal->emitEmptyStatus();
}
TemplateListView::addEvent(event, view);
}
}
/******************************************************************************
* Called when the Modify button is clicked to edit the currently highlighted
* alarm in the list.
*/
void TemplateDlg::slotEdit()
{
TemplateListViewItem* item = mTemplateList->singleSelectedItem();
if (item)
{
KAEvent event = item->event();
EditAlarmDlg* editDlg = new EditAlarmDlg(true, i18n("Edit Alarm Template"), this, "editDlg", &event);
if (editDlg->exec() == QDialog::Accepted)
{
KAEvent newEvent;
editDlg->getEvent(newEvent);
// Update the event in the displays and in the calendar file
QString id = event.id();
newEvent.setEventID(id);
AlarmCalendar* cal = AlarmCalendar::templateCalendarOpen();
if (cal)
{
cal->updateEvent(newEvent);
cal->save();
}
TemplateListView::modifyEvent(id, newEvent, mTemplateList);
}
}
}
/******************************************************************************
* Called when the Delete button is clicked to delete the currently highlighted
* alarms in the list.
*/
void TemplateDlg::slotDelete()
{
QValueList<EventListViewItemBase*> items = mTemplateList->selectedItems();
int n = items.count();
if (KMessageBox::warningContinueCancel(this, i18n("Do you really want to delete the selected alarm template?",
"Do you really want to delete the %n selected alarm templates?", n),
i18n("Delete Alarm Template", "Delete Alarm Templates", n), KGuiItem(i18n("&Delete"), "editdelete"))
!= KMessageBox::Continue)
return;
AlarmCalendar::templateCalendar()->startUpdate(); // prevent multiple saves of the calendar until we're finished
for (QValueList<EventListViewItemBase*>::Iterator it = items.begin(); it != items.end(); ++it)
{
TemplateListViewItem* item = (TemplateListViewItem*)(*it);
KAEvent event = item->event();
// Delete the event from the displays
QString id = event.id();
AlarmCalendar* cal = AlarmCalendar::templateCalendarOpen();
if (cal)
{
cal->deleteEvent(id);
cal->save();
cal->emitEmptyStatus();
}
mTemplateList->deleteEvent(id);
}
AlarmCalendar::templateCalendar()->endUpdate(); // save the calendar now
}
/******************************************************************************
* Called when the group of items selected changes.
* Enable/disable the buttons depending on whether/how many templates are
* currently highlighted.
*/
void TemplateDlg::slotSelectionChanged()
{
int count = mTemplateList->selectedCount();
mEditButton->setEnabled(count == 1);
mCopyButton->setEnabled(count == 1);
mDeleteButton->setEnabled(count);
}
/******************************************************************************
* Called when the dialog's size has changed.
* Records the new size in the config file.
*/
void TemplateDlg::resizeEvent(QResizeEvent* re)
{
if (isVisible())
KAlarm::writeConfigWindowSize(TMPL_DIALOG_NAME, re->size());
KDialog::resizeEvent(re);
}
<commit_msg>Fix compile error<commit_after>/*
* templatedlg.cpp - dialogue to create, edit and delete alarm templates
* Program: kalarm
* (C) 2004 by David Jarvie <software@astrojar.org.uk>
*
* 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#include "kalarm.h"
#include <qlayout.h>
#include <qpushbutton.h>
#include <qwhatsthis.h>
#include <klocale.h>
#include <kguiitem.h>
#include <kmessagebox.h>
#include <kdebug.h>
#include "editdlg.h"
#include "alarmcalendar.h"
#include "functions.h"
#include "templatelistview.h"
#include "templatedlg.moc"
static const char TMPL_DIALOG_NAME[] = "TemplateDialog";
TemplateDlg* TemplateDlg::mInstance = 0;
TemplateDlg::TemplateDlg(QWidget* parent, const char* name)
: KDialogBase(KDialogBase::Plain, i18n("Alarm Templates"), Close, Ok, parent, name, false, true)
{
QWidget* topWidget = plainPage();
QBoxLayout* topLayout = new QHBoxLayout(topWidget);
topLayout->setSpacing(spacingHint());
QBoxLayout* layout = new QVBoxLayout(topLayout);
mTemplateList = new TemplateListView(true, i18n("The list of alarm templates"), topWidget);
mTemplateList->setSelectionMode(QListView::Extended);
mTemplateList->setSizePolicy(QSizePolicy(QSizePolicy::Expanding, QSizePolicy::Expanding));
connect(mTemplateList, SIGNAL(selectionChanged()), SLOT(slotSelectionChanged()));
layout->addWidget(mTemplateList);
layout = new QVBoxLayout(topLayout);
QPushButton* button = new QPushButton(i18n("&New..."), topWidget);
button->setFixedSize(button->sizeHint());
connect(button, SIGNAL(clicked()), SLOT(slotNew()));
QWhatsThis::add(button, i18n("Create a new alarm template"));
layout->addWidget(button);
mEditButton = new QPushButton(i18n("&Edit..."), topWidget);
mEditButton->setFixedSize(mEditButton->sizeHint());
connect(mEditButton, SIGNAL(clicked()), SLOT(slotEdit()));
QWhatsThis::add(mEditButton, i18n("Edit the currently highlighted alarm template"));
layout->addWidget(mEditButton);
mCopyButton = new QPushButton(i18n("Co&py"), topWidget);
mCopyButton->setFixedSize(mCopyButton->sizeHint());
connect(mCopyButton, SIGNAL(clicked()), SLOT(slotCopy()));
QWhatsThis::add(mCopyButton,
i18n("Create a new alarm template based on a copy of the currently highlighted template"));
layout->addWidget(mCopyButton);
mDeleteButton = new QPushButton(i18n("&Delete"), topWidget);
mDeleteButton->setFixedSize(mDeleteButton->sizeHint());
connect(mDeleteButton, SIGNAL(clicked()), SLOT(slotDelete()));
QWhatsThis::add(mDeleteButton, i18n("Delete the currently highlighted alarm template"));
layout->addWidget(mDeleteButton);
mTemplateList->refresh();
slotSelectionChanged(); // enable/disable buttons as appropriate
QSize s;
if (KAlarm::readConfigWindowSize(TMPL_DIALOG_NAME, s))
resize(s);
}
/******************************************************************************
* Destructor.
*/
TemplateDlg::~TemplateDlg()
{
mInstance = 0;
}
/******************************************************************************
* Create an instance, if none already exists.
*/
TemplateDlg* TemplateDlg::create(QWidget* parent, const char* name)
{
if (mInstance)
return 0;
mInstance = new TemplateDlg(parent, name);
return mInstance;
}
/******************************************************************************
* Called when the New Template button is clicked to create a new template
* based on the currently selected alarm.
*/
void TemplateDlg::slotNew()
{
createTemplate(0, this, mTemplateList);
}
/******************************************************************************
* Called when the Copy button is clicked to edit a copy of an existing alarm,
* to add to the list.
*/
void TemplateDlg::slotCopy()
{
TemplateListViewItem* item = mTemplateList->singleSelectedItem();
if (item)
{
KAEvent event = item->event();
createTemplate(&event, mTemplateList);
}
}
/******************************************************************************
* Create a new template.
* If 'event' is non-zero, base the new template on an existing event or template.
*/
void TemplateDlg::createTemplate(const KAEvent* event, QWidget* parent, TemplateListView* view)
{
EditAlarmDlg editDlg(true, i18n("New Alarm Template"), parent, "editDlg", event);
if (editDlg.exec() == QDialog::Accepted)
{
KAEvent event;
editDlg.getEvent(event);
// Add the template to the displayed lists and to the calendar file
AlarmCalendar* cal = AlarmCalendar::templateCalendarOpen();
if (cal)
{
cal->addEvent(event);
cal->save();
cal->emitEmptyStatus();
}
TemplateListView::addEvent(event, view);
}
}
/******************************************************************************
* Called when the Modify button is clicked to edit the currently highlighted
* alarm in the list.
*/
void TemplateDlg::slotEdit()
{
TemplateListViewItem* item = mTemplateList->singleSelectedItem();
if (item)
{
KAEvent event = item->event();
EditAlarmDlg* editDlg = new EditAlarmDlg(true, i18n("Edit Alarm Template"), this, "editDlg", &event);
if (editDlg->exec() == QDialog::Accepted)
{
KAEvent newEvent;
editDlg->getEvent(newEvent);
// Update the event in the displays and in the calendar file
QString id = event.id();
newEvent.setEventID(id);
AlarmCalendar* cal = AlarmCalendar::templateCalendarOpen();
if (cal)
{
cal->updateEvent(newEvent);
cal->save();
}
TemplateListView::modifyEvent(id, newEvent, mTemplateList);
}
}
}
/******************************************************************************
* Called when the Delete button is clicked to delete the currently highlighted
* alarms in the list.
*/
void TemplateDlg::slotDelete()
{
QValueList<EventListViewItemBase*> items = mTemplateList->selectedItems();
int n = items.count();
if (KMessageBox::warningContinueCancel(this, i18n("Do you really want to delete the selected alarm template?",
"Do you really want to delete the %n selected alarm templates?", n),
i18n("Delete Alarm Template", "Delete Alarm Templates", n), KGuiItem(i18n("&Delete"), "editdelete"))
!= KMessageBox::Continue)
return;
AlarmCalendar::templateCalendar()->startUpdate(); // prevent multiple saves of the calendar until we're finished
for (QValueList<EventListViewItemBase*>::Iterator it = items.begin(); it != items.end(); ++it)
{
TemplateListViewItem* item = (TemplateListViewItem*)(*it);
KAEvent event = item->event();
// Delete the event from the displays
QString id = event.id();
AlarmCalendar* cal = AlarmCalendar::templateCalendarOpen();
if (cal)
{
cal->deleteEvent(id);
cal->save();
cal->emitEmptyStatus();
}
mTemplateList->deleteEvent(id);
}
AlarmCalendar::templateCalendar()->endUpdate(); // save the calendar now
}
/******************************************************************************
* Called when the group of items selected changes.
* Enable/disable the buttons depending on whether/how many templates are
* currently highlighted.
*/
void TemplateDlg::slotSelectionChanged()
{
int count = mTemplateList->selectedCount();
mEditButton->setEnabled(count == 1);
mCopyButton->setEnabled(count == 1);
mDeleteButton->setEnabled(count);
}
/******************************************************************************
* Called when the dialog's size has changed.
* Records the new size in the config file.
*/
void TemplateDlg::resizeEvent(QResizeEvent* re)
{
if (isVisible())
KAlarm::writeConfigWindowSize(TMPL_DIALOG_NAME, re->size());
KDialog::resizeEvent(re);
}
<|endoftext|>
|
<commit_before>/*
* Copyright (c) 2016, The OpenThread Authors.
* 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.
* 3. Neither the name of the copyright holder 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 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.
*/
/**
* @file
* This file implements the OpenThread CoAP API.
*/
#include <openthread/coap.h>
#include "openthread-instance.h"
#include "coap/coap_header.hpp"
#if OPENTHREAD_ENABLE_APPLICATION_COAP
using namespace ot;
void otCoapHeaderInit(otCoapHeader *aHeader, otCoapType aType, otCoapCode aCode)
{
Coap::Header *header = static_cast<Coap::Header *>(aHeader);
header->Init(aType, aCode);
}
void otCoapHeaderSetToken(otCoapHeader *aHeader, const uint8_t *aToken, uint8_t aTokenLength)
{
static_cast<Coap::Header *>(aHeader)->SetToken(aToken, aTokenLength);
}
void otCoapHeaderGenerateToken(otCoapHeader *aHeader, uint8_t aTokenLength)
{
static_cast<Coap::Header *>(aHeader)->SetToken(aTokenLength);
}
ThreadError otCoapHeaderAppendOption(otCoapHeader *aHeader, const otCoapOption *aOption)
{
return static_cast<Coap::Header *>(aHeader)->AppendOption(*static_cast<const Coap::Header::Option *>(aOption));
}
ThreadError otCoapHeaderAppendUintOption(otCoapHeader *aHeader, uint16_t aNumber, uint32_t aValue)
{
return static_cast<Coap::Header *>(aHeader)->AppendUintOption(aNumber, aValue);
}
ThreadError otCoapHeaderAppendObserveOption(otCoapHeader *aHeader, uint32_t aObserve)
{
return static_cast<Coap::Header *>(aHeader)->AppendObserveOption(aObserve);
}
ThreadError otCoapHeaderAppendUriPathOptions(otCoapHeader *aHeader, const char *aUriPath)
{
return static_cast<Coap::Header *>(aHeader)->AppendUriPathOptions(aUriPath);
}
ThreadError otCoapHeaderAppendMaxAgeOption(otCoapHeader *aHeader, uint32_t aMaxAge)
{
return static_cast<Coap::Header *>(aHeader)->AppendMaxAgeOption(aMaxAge);
}
ThreadError otCoapHeaderAppendUriQueryOption(otCoapHeader *aHeader, const char *aUriQuery)
{
return static_cast<Coap::Header *>(aHeader)->AppendUriQueryOption(aUriQuery);
}
void otCoapHeaderSetPayloadMarker(otCoapHeader *aHeader)
{
static_cast<Coap::Header *>(aHeader)->SetPayloadMarker();
}
void otCoapHeaderSetMessageId(otCoapHeader *aHeader, uint16_t aMessageId)
{
return static_cast<Coap::Header *>(aHeader)->SetMessageId(aMessageId);
}
otCoapType otCoapHeaderGetType(const otCoapHeader *aHeader)
{
return static_cast<const Coap::Header *>(aHeader)->GetType();
}
otCoapCode otCoapHeaderGetCode(const otCoapHeader *aHeader)
{
return static_cast<const Coap::Header *>(aHeader)->GetCode();
}
uint16_t otCoapHeaderGetMessageId(const otCoapHeader *aHeader)
{
return static_cast<const Coap::Header *>(aHeader)->GetMessageId();
}
uint8_t otCoapHeaderGetTokenLength(const otCoapHeader *aHeader)
{
return static_cast<const Coap::Header *>(aHeader)->GetTokenLength();
}
const uint8_t *otCoapHeaderGetToken(const otCoapHeader *aHeader)
{
return static_cast<const Coap::Header *>(aHeader)->GetToken();
}
const otCoapOption *otCoapHeaderGetFirstOption(otCoapHeader *aHeader)
{
return static_cast<const otCoapOption *>(static_cast<Coap::Header *>(aHeader)->GetFirstOption());
}
const otCoapOption *otCoapHeaderGetNextOption(otCoapHeader *aHeader)
{
return static_cast<const otCoapOption *>(static_cast<Coap::Header *>(aHeader)->GetNextOption());
}
otMessage *otCoapNewMessage(otInstance *aInstance, const otCoapHeader *aHeader)
{
Message *message;
VerifyOrExit(aHeader != NULL, message = NULL);
message = aInstance->mThreadNetif.GetCoap().NewMessage(*(static_cast<const Coap::Header *>(aHeader)));
exit:
return message;
}
ThreadError otCoapSendRequest(otInstance *aInstance, otMessage *aMessage, const otMessageInfo *aMessageInfo,
otCoapResponseHandler aHandler, void *aContext)
{
return aInstance->mThreadNetif.GetCoap().SendMessage(
*static_cast<Message *>(aMessage),
*static_cast<const Ip6::MessageInfo *>(aMessageInfo),
aHandler, aContext);
}
ThreadError otCoapStart(otInstance *aInstance, uint16_t aPort)
{
return aInstance->mApplicationCoap.Start(aPort);
}
ThreadError otCoapStop(otInstance *aInstance)
{
return aInstance->mApplicationCoap.Stop();
}
ThreadError otCoapAddResource(otInstance *aInstance, otCoapResource *aResource)
{
return aInstance->mApplicationCoap.AddResource(*static_cast<Coap::Resource *>(aResource));
}
void otCoapRemoveResource(otInstance *aInstance, otCoapResource *aResource)
{
aInstance->mApplicationCoap.RemoveResource(*static_cast<Coap::Resource *>(aResource));
}
ThreadError otCoapSendResponse(otInstance *aInstance, otMessage *aMessage, const otMessageInfo *aMessageInfo)
{
return aInstance->mApplicationCoap.SendMessage(
*static_cast<Message *>(aMessage), *static_cast<const Ip6::MessageInfo *>(aMessageInfo));
}
#endif // OPENTHREAD_ENABLE_APPLICATION_COAP
<commit_msg>CoAP: Send CoAP requests using application CoAP core. (#1717)<commit_after>/*
* Copyright (c) 2016, The OpenThread Authors.
* 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.
* 3. Neither the name of the copyright holder 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 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.
*/
/**
* @file
* This file implements the OpenThread CoAP API.
*/
#include <openthread/coap.h>
#include "openthread-instance.h"
#include "coap/coap_header.hpp"
#if OPENTHREAD_ENABLE_APPLICATION_COAP
using namespace ot;
void otCoapHeaderInit(otCoapHeader *aHeader, otCoapType aType, otCoapCode aCode)
{
Coap::Header *header = static_cast<Coap::Header *>(aHeader);
header->Init(aType, aCode);
}
void otCoapHeaderSetToken(otCoapHeader *aHeader, const uint8_t *aToken, uint8_t aTokenLength)
{
static_cast<Coap::Header *>(aHeader)->SetToken(aToken, aTokenLength);
}
void otCoapHeaderGenerateToken(otCoapHeader *aHeader, uint8_t aTokenLength)
{
static_cast<Coap::Header *>(aHeader)->SetToken(aTokenLength);
}
ThreadError otCoapHeaderAppendOption(otCoapHeader *aHeader, const otCoapOption *aOption)
{
return static_cast<Coap::Header *>(aHeader)->AppendOption(*static_cast<const Coap::Header::Option *>(aOption));
}
ThreadError otCoapHeaderAppendUintOption(otCoapHeader *aHeader, uint16_t aNumber, uint32_t aValue)
{
return static_cast<Coap::Header *>(aHeader)->AppendUintOption(aNumber, aValue);
}
ThreadError otCoapHeaderAppendObserveOption(otCoapHeader *aHeader, uint32_t aObserve)
{
return static_cast<Coap::Header *>(aHeader)->AppendObserveOption(aObserve);
}
ThreadError otCoapHeaderAppendUriPathOptions(otCoapHeader *aHeader, const char *aUriPath)
{
return static_cast<Coap::Header *>(aHeader)->AppendUriPathOptions(aUriPath);
}
ThreadError otCoapHeaderAppendMaxAgeOption(otCoapHeader *aHeader, uint32_t aMaxAge)
{
return static_cast<Coap::Header *>(aHeader)->AppendMaxAgeOption(aMaxAge);
}
ThreadError otCoapHeaderAppendUriQueryOption(otCoapHeader *aHeader, const char *aUriQuery)
{
return static_cast<Coap::Header *>(aHeader)->AppendUriQueryOption(aUriQuery);
}
void otCoapHeaderSetPayloadMarker(otCoapHeader *aHeader)
{
static_cast<Coap::Header *>(aHeader)->SetPayloadMarker();
}
void otCoapHeaderSetMessageId(otCoapHeader *aHeader, uint16_t aMessageId)
{
return static_cast<Coap::Header *>(aHeader)->SetMessageId(aMessageId);
}
otCoapType otCoapHeaderGetType(const otCoapHeader *aHeader)
{
return static_cast<const Coap::Header *>(aHeader)->GetType();
}
otCoapCode otCoapHeaderGetCode(const otCoapHeader *aHeader)
{
return static_cast<const Coap::Header *>(aHeader)->GetCode();
}
uint16_t otCoapHeaderGetMessageId(const otCoapHeader *aHeader)
{
return static_cast<const Coap::Header *>(aHeader)->GetMessageId();
}
uint8_t otCoapHeaderGetTokenLength(const otCoapHeader *aHeader)
{
return static_cast<const Coap::Header *>(aHeader)->GetTokenLength();
}
const uint8_t *otCoapHeaderGetToken(const otCoapHeader *aHeader)
{
return static_cast<const Coap::Header *>(aHeader)->GetToken();
}
const otCoapOption *otCoapHeaderGetFirstOption(otCoapHeader *aHeader)
{
return static_cast<const otCoapOption *>(static_cast<Coap::Header *>(aHeader)->GetFirstOption());
}
const otCoapOption *otCoapHeaderGetNextOption(otCoapHeader *aHeader)
{
return static_cast<const otCoapOption *>(static_cast<Coap::Header *>(aHeader)->GetNextOption());
}
otMessage *otCoapNewMessage(otInstance *aInstance, const otCoapHeader *aHeader)
{
Message *message;
VerifyOrExit(aHeader != NULL, message = NULL);
message = aInstance->mApplicationCoap.NewMessage(*(static_cast<const Coap::Header *>(aHeader)));
exit:
return message;
}
ThreadError otCoapSendRequest(otInstance *aInstance, otMessage *aMessage, const otMessageInfo *aMessageInfo,
otCoapResponseHandler aHandler, void *aContext)
{
return aInstance->mApplicationCoap.SendMessage(
*static_cast<Message *>(aMessage),
*static_cast<const Ip6::MessageInfo *>(aMessageInfo),
aHandler, aContext);
}
ThreadError otCoapStart(otInstance *aInstance, uint16_t aPort)
{
return aInstance->mApplicationCoap.Start(aPort);
}
ThreadError otCoapStop(otInstance *aInstance)
{
return aInstance->mApplicationCoap.Stop();
}
ThreadError otCoapAddResource(otInstance *aInstance, otCoapResource *aResource)
{
return aInstance->mApplicationCoap.AddResource(*static_cast<Coap::Resource *>(aResource));
}
void otCoapRemoveResource(otInstance *aInstance, otCoapResource *aResource)
{
aInstance->mApplicationCoap.RemoveResource(*static_cast<Coap::Resource *>(aResource));
}
ThreadError otCoapSendResponse(otInstance *aInstance, otMessage *aMessage, const otMessageInfo *aMessageInfo)
{
return aInstance->mApplicationCoap.SendMessage(
*static_cast<Message *>(aMessage), *static_cast<const Ip6::MessageInfo *>(aMessageInfo));
}
#endif // OPENTHREAD_ENABLE_APPLICATION_COAP
<|endoftext|>
|
<commit_before>/*
* Copyright (C) 2015 ScyllaDB
*/
/*
* This file is part of Scylla.
*
* Scylla 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.
*
* Scylla 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 Scylla. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef UTILS_HASH_HH_
#define UTILS_HASH_HH_
#include <functional>
#include "core/apply.hh"
namespace utils {
// public for unit testing etc
inline size_t hash_combine(size_t left, size_t right) {
return left + 0x9e3779b9 + (right << 6) + (right >> 2);
}
struct tuple_hash {
private:
// CMH. Add specializations here to handle recursive tuples
template<typename T>
static size_t hash(const T& t) {
return std::hash<T>()(t);
}
template<size_t index, typename...Types>
struct hash_impl {
size_t operator()(const std::tuple<Types...>& t, size_t a) const {
return hash_impl<index-1, Types...>()(t, hash_combine(hash(std::get<index>(t)), a));
}
size_t operator()(const std::tuple<Types...>& t) const {
return hash_impl<index-1, Types...>()(t, hash(std::get<index>(t)));
}
};
template<class...Types>
struct hash_impl<0, Types...> {
size_t operator()(const std::tuple<Types...>& t, size_t a) const {
return hash_combine(hash(std::get<0>(t)), a);
}
size_t operator()(const std::tuple<Types...>& t) const {
return hash(std::get<0>(t));
}
};
public:
template<typename T1, typename T2>
size_t operator()(const std::pair<T1, T2>& p) const {
return hash_combine(hash(p.first), hash(p.second));
}
template<typename... Args>
size_t operator()(const std::tuple<Args...>& v) const;
};
template<typename... Args>
inline size_t tuple_hash::operator()(const std::tuple<Args...>& v) const {
return hash_impl<std::tuple_size<std::tuple<Args...>>::value - 1, Args...>()(v);
}
template<>
inline size_t tuple_hash::operator()(const std::tuple<>& v) const {
return 0;
}
}
#endif /* UTILS_HASH_HH_ */
<commit_msg>tuple_hash: Add convinence operator for two arguments (non-pair)<commit_after>/*
* Copyright (C) 2015 ScyllaDB
*/
/*
* This file is part of Scylla.
*
* Scylla 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.
*
* Scylla 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 Scylla. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef UTILS_HASH_HH_
#define UTILS_HASH_HH_
#include <functional>
#include "core/apply.hh"
namespace utils {
// public for unit testing etc
inline size_t hash_combine(size_t left, size_t right) {
return left + 0x9e3779b9 + (right << 6) + (right >> 2);
}
struct tuple_hash {
private:
// CMH. Add specializations here to handle recursive tuples
template<typename T>
static size_t hash(const T& t) {
return std::hash<T>()(t);
}
template<size_t index, typename...Types>
struct hash_impl {
size_t operator()(const std::tuple<Types...>& t, size_t a) const {
return hash_impl<index-1, Types...>()(t, hash_combine(hash(std::get<index>(t)), a));
}
size_t operator()(const std::tuple<Types...>& t) const {
return hash_impl<index-1, Types...>()(t, hash(std::get<index>(t)));
}
};
template<class...Types>
struct hash_impl<0, Types...> {
size_t operator()(const std::tuple<Types...>& t, size_t a) const {
return hash_combine(hash(std::get<0>(t)), a);
}
size_t operator()(const std::tuple<Types...>& t) const {
return hash(std::get<0>(t));
}
};
public:
template<typename T1, typename T2>
size_t operator()(const std::pair<T1, T2>& p) const {
return hash_combine(hash(p.first), hash(p.second));
}
template<typename T1, typename T2>
size_t operator()(const T1& t1, const T2& t2) const {
return hash_combine(hash(t1), hash(t2));
}
template<typename... Args>
size_t operator()(const std::tuple<Args...>& v) const;
};
template<typename... Args>
inline size_t tuple_hash::operator()(const std::tuple<Args...>& v) const {
return hash_impl<std::tuple_size<std::tuple<Args...>>::value - 1, Args...>()(v);
}
template<>
inline size_t tuple_hash::operator()(const std::tuple<>& v) const {
return 0;
}
}
#endif /* UTILS_HASH_HH_ */
<|endoftext|>
|
<commit_before>#ifndef ASSERT_HPP
#define ASSERT_HPP
#include <iostream>
#include "core/debug/break.hpp"
namespace tz
{
namespace debug
{
static bool assert_failure = false;
}
#ifdef topaz_assert
#undef topaz_assert
#endif
/**
* Evaluate the expression. This should be used to guarantee that expressions are true at runtime.
* If an assertion failure is catastrophic for the machine (such as a GPU/BSOD), use a hard-assert instead.
* If the expression can be evaluated at compile-time, use a static_assert -- Guaranteed by the C++ standard since C++11.
* If TOPAZ_DEBUG == 1 and the expression evaluates to false, send an error message to cerr and send a breakpoint signal to the debugger. If no debugger is attached, the OS will likely kill the program.
* Note: To guarantee termination on failure without a debugger, use a hard-assert.
*/
#define topaz_assert(EXPRESSION, ...) ((EXPRESSION) ? \
(void)0 : tz::assert_message(std::cerr, false, \
"Assertion failure: ", #EXPRESSION, "\nIn file: ", __FILE__, \
" on line ", __LINE__, ":\n\t", __VA_ARGS__))
template<typename... Args>
inline void assert_message([[maybe_unused]] std::ostream &out, [[maybe_unused]] bool hard, [[maybe_unused]] Args &&... args)
{
#if TOPAZ_DEBUG
std::flush(out);
#if TOPAZ_UNIT_TEST
bool unit_test = true;
#else
bool unit_test = false;
#endif
if(unit_test)
{
// Note: We don't print out the assertion message as a unit-test. It's expected that the expectation failure sort this out instead.
debug::assert_failure = true;
}
else
{
// Use the given ostream.
(out << ... << args) << std::endl;
tz::debugbreak();
if(hard)
{
out << "[HARD ASSERT DETECTED. ABORTING.]\n" << std::endl;
std::abort();
}
}
#endif
}
#ifdef topaz_assertf
#undef topaz_assertf
#endif
#define topaz_assertf(EXPRESSION, fmt, ...) ((EXPRESSION) ? \
(void)0 : tz::assert_messagef(stderr, \
"Assertion failure: %s\nIn file: %s on line %d:\n\t" fmt, #EXPRESSION, __FILE__, __LINE__, __VA_ARGS__))
template<typename... Args>
inline void assert_messagef(FILE* output_stream, const char* fmt, Args&&... args)
{
#if TOPAZ_DEBUG
fflush(output_stream);
fprintf(output_stream, fmt, std::forward<Args>(args)...);
std::abort();
#endif
}
namespace debug::test
{
inline bool assert_failure()
{
return tz::debug::assert_failure;
}
inline void clear_assert_failure()
{
tz::debug::assert_failure = false;
}
}
#ifdef topaz_hard_assert
#undef topaz_hard_assert
#endif
/**
* Evaluate the expression in a stricter manner than a normal assert.
* If TOPAZ_DEBUG == 1 and the expression evaluates to false, send an error message to cerr and send a breakpoint signal to the debugger. After that, invoke abort() to guarantee program termination.
*/
#define topaz_hard_assert(EXPRESSION, ...) ((EXPRESSION) ? \
(void)0 : tz::assert_message(std::cerr, true, \
"[FATAL ERROR] Hard Assertion failure: ", #EXPRESSION, "\nIn file: ", __FILE__, \
" on line ", __LINE__, ":\n\t", __VA_ARGS__))
#ifdef topaz_assert_clear
#undef topaz_assert_clear
#endif
#define topaz_assert_clear() tz::debug::test::clear_assert_failure()
}
#endif // ASSERT_HPP<commit_msg>+ Added topaz_hard_assertf and fixed an issue where topaz_assertf did not match the behaviour of topaz_assert<commit_after>#ifndef ASSERT_HPP
#define ASSERT_HPP
#include <iostream>
#include "core/debug/break.hpp"
namespace tz
{
namespace debug
{
static bool assert_failure = false;
}
#ifdef topaz_assert
#undef topaz_assert
#endif
/**
* Evaluate the expression. This should be used to guarantee that expressions are true at runtime.
* If an assertion failure is catastrophic for the machine (such as a GPU/BSOD), use a hard-assert instead.
* If the expression can be evaluated at compile-time, use a static_assert -- Guaranteed by the C++ standard since C++11.
* If TOPAZ_DEBUG == 1 and the expression evaluates to false, send an error message to cerr and send a breakpoint signal to the debugger. If no debugger is attached, the OS will likely kill the program.
* Note: To guarantee termination on failure without a debugger, use a hard-assert.
*/
#define topaz_assert(EXPRESSION, ...) ((EXPRESSION) ? \
(void)0 : tz::assert_message(std::cerr, false, \
"Assertion failure: ", #EXPRESSION, "\nIn file: ", __FILE__, \
" on line ", __LINE__, ":\n\t", __VA_ARGS__))
template<typename... Args>
inline void assert_message([[maybe_unused]] std::ostream &out, [[maybe_unused]] bool hard, [[maybe_unused]] Args &&... args)
{
#if TOPAZ_DEBUG
std::flush(out);
#if TOPAZ_UNIT_TEST
bool unit_test = true;
#else
bool unit_test = false;
#endif
if(unit_test)
{
// Note: We don't print out the assertion message as a unit-test. It's expected that the expectation failure sort this out instead.
debug::assert_failure = true;
}
else
{
// Use the given ostream.
(out << ... << args) << std::endl;
tz::debugbreak();
if(hard)
{
out << "[HARD ASSERT DETECTED. ABORTING.]\n" << std::endl;
std::abort();
}
}
#endif
}
#ifdef topaz_assertf
#undef topaz_assertf
#endif
#define topaz_assertf(EXPRESSION, fmt, ...) ((EXPRESSION) ? \
(void)0 : tz::assert_messagef(stderr, false, \
"Assertion failure: %s\nIn file: %s on line %d:\n\t" fmt, #EXPRESSION, __FILE__, __LINE__, __VA_ARGS__))
template<typename... Args>
inline void assert_messagef([[maybe_unused]] FILE* output_stream, [[maybe_unused]] bool hard, [[maybe_unused]] const char* fmt, [[maybe_unused]] Args&&... args)
{
#if TOPAZ_DEBUG
#if TOPAZ_UNIT_TEST
bool unit_test = true;
#else
bool unit_test = false;
#endif
if(unit_test)
{
// Note: We don't print out the assertion message as a unit-test. It's expected that the expectation failure sort this out instead.
debug::assert_failure = true;
}
else
{
// Use the given ostream.
fflush(output_stream);
fprintf(output_stream, fmt, std::forward<Args>(args)...);
tz::debugbreak();
if(hard)
{
fprintf(output_stream, "%s", "[HARD ASSERT DETECTED. ABORTING.]\n");
std::abort();
}
}
#endif
}
namespace debug::test
{
inline bool assert_failure()
{
return tz::debug::assert_failure;
}
inline void clear_assert_failure()
{
tz::debug::assert_failure = false;
}
}
#ifdef topaz_hard_assert
#undef topaz_hard_assert
#endif
/**
* Evaluate the expression in a stricter manner than a normal assert.
* If TOPAZ_DEBUG == 1 and the expression evaluates to false, send an error message to cerr and send a breakpoint signal to the debugger. After that, invoke abort() to guarantee program termination.
*/
#define topaz_hard_assert(EXPRESSION, ...) ((EXPRESSION) ? \
(void)0 : tz::assert_message(std::cerr, true, \
"[FATAL ERROR] Hard Assertion failure: ", #EXPRESSION, "\nIn file: ", __FILE__, \
" on line ", __LINE__, ":\n\t", __VA_ARGS__))
#ifdef topaz_hard_assertf
#undef topaz_hard_assertf
#endif
#define topaz_hard_assertf(EXPRESSION, fmt, ...) ((EXPRESSION) ? \
(void)0 : tz::assert_messagef(stderr, true, \
"[FATAL ERROR] Hard Assertion failure: %s\nIn file: %s on line %d:\n\t" fmt, #EXPRESSION, __FILE__, __LINE__, __VA_ARGS__))
#ifdef topaz_assert_clear
#undef topaz_assert_clear
#endif
#define topaz_assert_clear() tz::debug::test::clear_assert_failure()
}
#endif // ASSERT_HPP<|endoftext|>
|
<commit_before>/*Copyright (c) 2013, Nordic Semiconductor ASA
*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 Nordic Semiconductor ASA 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 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.
*/
/** @file
@brief Implementation of the ACI transport layer module
*/
#include <SPI.h>
#include "hal_platform.h"
#include "hal_aci_tl.h"
#include <avr/sleep.h>
static void m_print_aci_data(hal_aci_data_t *p_data);
static uint8_t spi_readwrite(uint8_t aci_byte);
static hal_aci_data_t received_data;
static bool aci_debug_print;
aci_queue_t aci_tx_q;
aci_queue_t aci_rx_q;
static aci_pins_t *a_pins_local_ptr;
static void m_aci_q_init(aci_queue_t *aci_q)
{
uint8_t loop;
aci_debug_print = false;
aci_q->head = 0;
aci_q->tail = 0;
for(loop=0; loop<ACI_QUEUE_SIZE; loop++)
{
aci_q->aci_data[loop].buffer[0] = 0x00;
aci_q->aci_data[loop].buffer[1] = 0x00;
}
}
void hal_aci_debug_print(bool enable)
{
aci_debug_print = enable;
}
bool m_aci_q_enqueue(aci_queue_t *aci_q, hal_aci_data_t *p_data)
{
const uint8_t next = (aci_q->tail + 1) % ACI_QUEUE_SIZE;
const uint8_t length = p_data->buffer[0];
if (next == aci_q->head)
{
/* full queue */
return false;
}
aci_q->aci_data[aci_q->tail].status_byte = 0;
memcpy((uint8_t *)&(aci_q->aci_data[aci_q->tail].buffer[0]), (uint8_t *)&p_data->buffer[0], length + 1);
aci_q->tail = next;
return true;
}
//@comment after a port to a new mcu have test for the queue states, esp. the full and the empty states
static bool m_aci_q_dequeue(aci_queue_t *aci_q, hal_aci_data_t *p_data)
{
if (aci_q->head == aci_q->tail)
{
/* empty queue */
return false;
}
memcpy((uint8_t *)p_data, (uint8_t *)&(aci_q->aci_data[aci_q->head]), sizeof(hal_aci_data_t));
aci_q->head = (aci_q->head + 1) % ACI_QUEUE_SIZE;
return true;
}
bool m_aci_q_is_empty(aci_queue_t *aci_q)
{
return (aci_q->head == aci_q->tail);
}
bool m_aci_q_is_full(aci_queue_t *aci_q)
{
uint8_t next;
bool state;
//This should be done in a critical section
noInterrupts();
next = (aci_q->tail + 1) % ACI_QUEUE_SIZE;
if (next == aci_q->head)
{
state = true;
}
else
{
state = false;
}
interrupts();
//end
return state;
}
void m_print_aci_data(hal_aci_data_t *p_data)
{
const uint8_t length = p_data->buffer[0];
uint8_t i;
Serial.print(length, DEC);
Serial.print(" :");
for (i=0; i<=length; i++)
{
Serial.print(p_data->buffer[i], HEX);
Serial.print(F(", "));
}
Serial.println(F(""));
}
void m_rdy_line_handle(void)
{
hal_aci_data_t *p_aci_data;
sleep_disable();
detachInterrupt(1);
// Receive or transmit data
p_aci_data = hal_aci_tl_poll_get();
// Check if we received data
if (p_aci_data->buffer[0] > 0)
{
if (!m_aci_q_enqueue(&aci_rx_q, p_aci_data))
{
/* Receive Buffer full.
Should never happen.
Spin in a while loop.
*/
while(1);
}
if (m_aci_q_is_full(&aci_rx_q))
{
/* Disable RDY line interrupt.
Will latch any pending RDY lines, so when enabled it again this
routine should be taken again */
if (true == a_pins_local_ptr->interface_is_interrupt)
{
EIMSK &= ~(0x2);
}
}
}
}
bool hal_aci_tl_event_get(hal_aci_data_t *p_aci_data)
{
bool was_full = m_aci_q_is_full(&aci_rx_q);
if (m_aci_q_dequeue(&aci_rx_q, p_aci_data))
{
if (true == aci_debug_print)
{
Serial.print(" E");
m_print_aci_data(p_aci_data);
}
if (was_full)
{
if (true == a_pins_local_ptr->interface_is_interrupt)
{
/* Enable RDY line interrupt again */
EIMSK |= (0x2);
}
}
return true;
}
else
{
return false;
}
}
void hal_aci_tl_init(aci_pins_t *a_pins)
{
received_data.buffer[0] = 0;
m_aci_pins_set(a_pins);
/*
The SPI lines used are mapped directly to the hardware SPI
MISO MOSI and SCK
Change here if the pins are mapped differently
The SPI library assumes that the hardware pins are used
*/
SPI.begin();
SPI.setBitOrder(LSBFIRST);
SPI.setClockDivider(a_pins->spi_clock_divider);
SPI.setDataMode(SPI_MODE0);
/* initialize aci cmd queue */
m_aci_q_init(&aci_tx_q);
m_aci_q_init(&aci_rx_q);
//Configure the IO lines
pinMode(a_pins->rdyn_pin, INPUT_PULLUP);
pinMode(a_pins->reqn_pin, OUTPUT);
if (UNUSED != a_pins->active_pin)
{
pinMode(a_pins->active_pin, INPUT);
}
if (UNUSED != a_pins->reset_pin)
{
pinMode(a_pins->reset_pin, OUTPUT);
if (REDBEARLAB_SHIELD_V1_1 == a_pins->board_name)
{
//The reset for this board is inverted and has a Power On Reset
//circuit that takes about 100ms to trigger the reset
digitalWrite(a_pins->reset_pin, 1);
delay(100);
digitalWrite(a_pins->reset_pin, 0);
}
else
{
digitalWrite(a_pins->reset_pin, 1);
digitalWrite(a_pins->reset_pin, 0);
digitalWrite(a_pins->reset_pin, 1);
}
}
digitalWrite(a_pins->miso_pin, 0);
digitalWrite(a_pins->mosi_pin, 0);
digitalWrite(a_pins->reqn_pin, 1);
digitalWrite(a_pins->sck_pin, 0);
delay(30); //Wait for the nRF8001 to get hold of its lines - the lines float for a few ms after the reset
//Attach the interrupt to the RDYN line as requested by the caller
if (a_pins->interface_is_interrupt)
{
attachInterrupt(a_pins->interrupt_number, m_rdy_line_handle, LOW); // We use the LOW level of the RDYN line as the atmega328 can wakeup from sleep only on LOW
}
}
bool hal_aci_tl_send(hal_aci_data_t *p_aci_cmd)
{
const uint8_t length = p_aci_cmd->buffer[0];
bool ret_val = false;
if (length > HAL_ACI_MAX_LENGTH)
{
return false;
}
else
{
if (m_aci_q_enqueue(&aci_tx_q, p_aci_cmd))
{
ret_val = true;
}
}
if (true == aci_debug_print)
{
Serial.print("C");
m_print_aci_data(p_aci_cmd);
}
digitalWrite(a_pins_local_ptr->reqn_pin, 0);
return ret_val;
}
hal_aci_data_t * hal_aci_tl_poll_get(void)
{
uint8_t byte_cnt;
uint8_t byte_sent_cnt;
uint8_t max_bytes;
hal_aci_data_t data_to_send;
digitalWrite(a_pins_local_ptr->reqn_pin, 0);
// Receive from queue
if (m_aci_q_dequeue(&aci_tx_q, &data_to_send) == false)
{
/* queue was empty, nothing to send */
data_to_send.status_byte = 0;
data_to_send.buffer[0] = 0;
}
//Change this if your mcu has DMA for the master SPI
// Send length, receive header
byte_sent_cnt = 0;
received_data.status_byte = spi_readwrite(data_to_send.buffer[byte_sent_cnt++]);
// Send first byte, receive length from slave
received_data.buffer[0] = spi_readwrite(data_to_send.buffer[byte_sent_cnt++]);
if (0 == data_to_send.buffer[0])
{
max_bytes = received_data.buffer[0];
}
else
{
// Set the maximum to the biggest size. One command byte is already sent
max_bytes = (received_data.buffer[0] > (data_to_send.buffer[0] - 1))
? received_data.buffer[0] : (data_to_send.buffer[0] - 1);
}
if (max_bytes > HAL_ACI_MAX_LENGTH)
{
max_bytes = HAL_ACI_MAX_LENGTH;
}
// Transmit/receive the rest of the packet
for (byte_cnt = 0; byte_cnt < max_bytes; byte_cnt++)
{
received_data.buffer[byte_cnt+1] = spi_readwrite(data_to_send.buffer[byte_sent_cnt++]);
}
digitalWrite(a_pins_local_ptr->reqn_pin, 1);
//RDYN should follow the REQN line in approx 100ns
sleep_enable();
if (a_pins_local_ptr->interface_is_interrupt)
{
attachInterrupt(a_pins_local_ptr->interrupt_number, m_rdy_line_handle, LOW);
}
if (false == m_aci_q_is_empty(&aci_tx_q))
{
//Lower the REQN line to start a new ACI transaction
digitalWrite(a_pins_local_ptr->reqn_pin, 0);
}
/* valid Rx available or transmit finished*/
return (&received_data);
}
static uint8_t spi_readwrite(const uint8_t aci_byte)
{
return SPI.transfer(aci_byte);
}
void m_aci_q_flush(void)
{
noInterrupts();
/* re-initialize aci cmd queue and aci event queue to flush them*/
m_aci_q_init(&aci_tx_q);
m_aci_q_init(&aci_rx_q);
interrupts();
}
void m_aci_pins_set(aci_pins_t *a_pins_ptr)
{
a_pins_local_ptr = a_pins_ptr;
}<commit_msg>Fixed an issue in the transport layer<commit_after>/*Copyright (c) 2013, Nordic Semiconductor ASA
*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 Nordic Semiconductor ASA 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 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.
*/
/** @file
@brief Implementation of the ACI transport layer module
*/
#include <SPI.h>
#include "hal_platform.h"
#include "hal_aci_tl.h"
#include <avr/sleep.h>
static void m_print_aci_data(hal_aci_data_t *p_data);
static uint8_t spi_readwrite(uint8_t aci_byte);
static hal_aci_data_t received_data;
static bool aci_debug_print;
aci_queue_t aci_tx_q;
aci_queue_t aci_rx_q;
static aci_pins_t *a_pins_local_ptr;
static void m_aci_q_init(aci_queue_t *aci_q)
{
uint8_t loop;
aci_debug_print = false;
aci_q->head = 0;
aci_q->tail = 0;
for(loop=0; loop<ACI_QUEUE_SIZE; loop++)
{
aci_q->aci_data[loop].buffer[0] = 0x00;
aci_q->aci_data[loop].buffer[1] = 0x00;
}
}
void hal_aci_debug_print(bool enable)
{
aci_debug_print = enable;
}
bool m_aci_q_enqueue(aci_queue_t *aci_q, hal_aci_data_t *p_data)
{
const uint8_t next = (aci_q->tail + 1) % ACI_QUEUE_SIZE;
const uint8_t length = p_data->buffer[0];
if (next == aci_q->head)
{
/* full queue */
return false;
}
aci_q->aci_data[aci_q->tail].status_byte = 0;
memcpy((uint8_t *)&(aci_q->aci_data[aci_q->tail].buffer[0]), (uint8_t *)&p_data->buffer[0], length + 1);
aci_q->tail = next;
return true;
}
//@comment after a port to a new mcu have test for the queue states, esp. the full and the empty states
static bool m_aci_q_dequeue(aci_queue_t *aci_q, hal_aci_data_t *p_data)
{
if (aci_q->head == aci_q->tail)
{
/* empty queue */
return false;
}
memcpy((uint8_t *)p_data, (uint8_t *)&(aci_q->aci_data[aci_q->head]), sizeof(hal_aci_data_t));
aci_q->head = (aci_q->head + 1) % ACI_QUEUE_SIZE;
return true;
}
bool m_aci_q_is_empty(aci_queue_t *aci_q)
{
return (aci_q->head == aci_q->tail);
}
bool m_aci_q_is_full(aci_queue_t *aci_q)
{
uint8_t next;
bool state;
//This should be done in a critical section
noInterrupts();
next = (aci_q->tail + 1) % ACI_QUEUE_SIZE;
if (next == aci_q->head)
{
state = true;
}
else
{
state = false;
}
interrupts();
//end
return state;
}
void m_print_aci_data(hal_aci_data_t *p_data)
{
const uint8_t length = p_data->buffer[0];
uint8_t i;
Serial.print(length, DEC);
Serial.print(" :");
for (i=0; i<=length; i++)
{
Serial.print(p_data->buffer[i], HEX);
Serial.print(F(", "));
}
Serial.println(F(""));
}
void m_rdy_line_handle(void)
{
hal_aci_data_t *p_aci_data;
sleep_disable();
detachInterrupt(1);
// Receive or transmit data
p_aci_data = hal_aci_tl_poll_get();
// Check if we received data
if (p_aci_data->buffer[0] > 0)
{
if (!m_aci_q_enqueue(&aci_rx_q, p_aci_data))
{
/* Receive Buffer full.
Should never happen.
Spin in a while loop.
*/
while(1);
}
if (m_aci_q_is_full(&aci_rx_q))
{
/* Disable RDY line interrupt.
Will latch any pending RDY lines, so when enabled it again this
routine should be taken again */
if (true == a_pins_local_ptr->interface_is_interrupt)
{
EIMSK &= ~(0x2);
}
}
}
}
bool hal_aci_tl_event_get(hal_aci_data_t *p_aci_data)
{
bool was_full = m_aci_q_is_full(&aci_rx_q);
if (m_aci_q_dequeue(&aci_rx_q, p_aci_data))
{
if (true == aci_debug_print)
{
Serial.print(" E");
m_print_aci_data(p_aci_data);
}
if (was_full)
{
if (true == a_pins_local_ptr->interface_is_interrupt)
{
/* Enable RDY line interrupt again */
EIMSK |= (0x2);
}
}
return true;
}
else
{
return false;
}
}
void hal_aci_tl_init(aci_pins_t *a_pins)
{
received_data.buffer[0] = 0;
m_aci_pins_set(a_pins);
/*
The SPI lines used are mapped directly to the hardware SPI
MISO MOSI and SCK
Change here if the pins are mapped differently
The SPI library assumes that the hardware pins are used
*/
SPI.begin();
SPI.setBitOrder(LSBFIRST);
SPI.setClockDivider(a_pins->spi_clock_divider);
SPI.setDataMode(SPI_MODE0);
/* initialize aci cmd queue */
m_aci_q_init(&aci_tx_q);
m_aci_q_init(&aci_rx_q);
//Configure the IO lines
pinMode(a_pins->rdyn_pin, INPUT_PULLUP);
pinMode(a_pins->reqn_pin, OUTPUT);
if (UNUSED != a_pins->active_pin)
{
pinMode(a_pins->active_pin, INPUT);
}
if (UNUSED != a_pins->reset_pin)
{
pinMode(a_pins->reset_pin, OUTPUT);
if (REDBEARLAB_SHIELD_V1_1 == a_pins->board_name)
{
//The reset for this board is inverted and has a Power On Reset
//circuit that takes about 100ms to trigger the reset
digitalWrite(a_pins->reset_pin, 1);
delay(100);
digitalWrite(a_pins->reset_pin, 0);
}
else
{
digitalWrite(a_pins->reset_pin, 1);
digitalWrite(a_pins->reset_pin, 0);
digitalWrite(a_pins->reset_pin, 1);
}
}
digitalWrite(a_pins->miso_pin, 0);
digitalWrite(a_pins->mosi_pin, 0);
digitalWrite(a_pins->reqn_pin, 1);
digitalWrite(a_pins->sck_pin, 0);
delay(30); //Wait for the nRF8001 to get hold of its lines - the lines float for a few ms after the reset
//Attach the interrupt to the RDYN line as requested by the caller
if (a_pins->interface_is_interrupt)
{
attachInterrupt(a_pins->interrupt_number, m_rdy_line_handle, LOW); // We use the LOW level of the RDYN line as the atmega328 can wakeup from sleep only on LOW
}
}
bool hal_aci_tl_send(hal_aci_data_t *p_aci_cmd)
{
const uint8_t length = p_aci_cmd->buffer[0];
bool ret_val = false;
if (length > HAL_ACI_MAX_LENGTH)
{
return false;
}
else
{
if (m_aci_q_enqueue(&aci_tx_q, p_aci_cmd))
{
ret_val = true;
digitalWrite(a_pins_local_ptr->reqn_pin, 0); //Place request line low only if enqueued
}
}
if ((true == aci_debug_print) && (true == ret_val))
{
Serial.print("C");
m_print_aci_data(p_aci_cmd);
}
return ret_val;
}
hal_aci_data_t * hal_aci_tl_poll_get(void)
{
uint8_t byte_cnt;
uint8_t byte_sent_cnt;
uint8_t max_bytes;
hal_aci_data_t data_to_send;
digitalWrite(a_pins_local_ptr->reqn_pin, 0);
// Receive from queue
if (m_aci_q_dequeue(&aci_tx_q, &data_to_send) == false)
{
/* queue was empty, nothing to send */
data_to_send.status_byte = 0;
data_to_send.buffer[0] = 0;
}
//Change this if your mcu has DMA for the master SPI
// Send length, receive header
byte_sent_cnt = 0;
received_data.status_byte = spi_readwrite(data_to_send.buffer[byte_sent_cnt++]);
// Send first byte, receive length from slave
received_data.buffer[0] = spi_readwrite(data_to_send.buffer[byte_sent_cnt++]);
if (0 == data_to_send.buffer[0])
{
max_bytes = received_data.buffer[0];
}
else
{
// Set the maximum to the biggest size. One command byte is already sent
max_bytes = (received_data.buffer[0] > (data_to_send.buffer[0] - 1))
? received_data.buffer[0] : (data_to_send.buffer[0] - 1);
}
if (max_bytes > HAL_ACI_MAX_LENGTH)
{
max_bytes = HAL_ACI_MAX_LENGTH;
}
// Transmit/receive the rest of the packet
for (byte_cnt = 0; byte_cnt < max_bytes; byte_cnt++)
{
received_data.buffer[byte_cnt+1] = spi_readwrite(data_to_send.buffer[byte_sent_cnt++]);
}
digitalWrite(a_pins_local_ptr->reqn_pin, 1);
//RDYN should follow the REQN line in approx 100ns
sleep_enable();
if (a_pins_local_ptr->interface_is_interrupt)
{
attachInterrupt(a_pins_local_ptr->interrupt_number, m_rdy_line_handle, LOW);
}
if (false == m_aci_q_is_empty(&aci_tx_q))
{
//Lower the REQN line to start a new ACI transaction
digitalWrite(a_pins_local_ptr->reqn_pin, 0);
}
/* valid Rx available or transmit finished*/
return (&received_data);
}
static uint8_t spi_readwrite(const uint8_t aci_byte)
{
return SPI.transfer(aci_byte);
}
void m_aci_q_flush(void)
{
noInterrupts();
/* re-initialize aci cmd queue and aci event queue to flush them*/
m_aci_q_init(&aci_tx_q);
m_aci_q_init(&aci_rx_q);
interrupts();
}
void m_aci_pins_set(aci_pins_t *a_pins_ptr)
{
a_pins_local_ptr = a_pins_ptr;
}<|endoftext|>
|
<commit_before>/*
* Created on: 19 Apr 2014
* Author: Vladimir Ivan
*
* Copyright (c) 2016, University Of Edinburgh
* 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 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.
*
*/
#include <exotica/Problems/UnconstrainedTimeIndexedProblem.h>
#include <exotica/Setup.h>
REGISTER_PROBLEM_TYPE("UnconstrainedTimeIndexedProblem", exotica::UnconstrainedTimeIndexedProblem)
namespace exotica
{
UnconstrainedTimeIndexedProblem::UnconstrainedTimeIndexedProblem()
: T(0), tau(0), Q_rate(0), W_rate(0), H_rate(0)
{
Flags = KIN_FK | KIN_J;
}
UnconstrainedTimeIndexedProblem::~UnconstrainedTimeIndexedProblem()
{
}
void UnconstrainedTimeIndexedProblem::Instantiate(UnconstrainedTimeIndexedProblemInitializer& init)
{
T = init.T;
if (T <= 2)
{
throw_named("Invalid number of timesteps: "<<T);
}
tau = init.Tau;
Q_rate = init.Qrate;
H_rate = init.Hrate;
W_rate = init.Wrate;
NumTasks = Tasks.size();
PhiN = 0;
JN = 0;
TaskSpaceVector yref;
for(int i=0;i<NumTasks;i++)
{
appendVector(yref.map, Tasks[i]->getLieGroupIndices());
PhiN += Tasks[i]->Length;
JN += Tasks[i]->LengthJ;
}
N = scene_->getSolver().getNumJoints();
W = Eigen::MatrixXd::Identity(N, N)*W_rate;
if(init.W.rows()>0)
{
if(init.W.rows()==N)
{
W.diagonal() = init.W*W_rate;
}
else
{
throw_named("W dimension mismatch! Expected "<<N<<", got "<<init.W.rows());
}
}
H = Eigen::MatrixXd::Identity(N, N)*Q_rate;
Q = Eigen::MatrixXd::Identity(N, N)*H_rate;
if(init.Rho.rows()==0)
{
Rho.assign(T, Eigen::VectorXd::Ones(NumTasks));
}
else if(init.Rho.rows()==NumTasks)
{
Rho.assign(T, init.Rho);
}
else if(init.Rho.rows()==NumTasks*T)
{
Rho.resize(T);
for(int i=0;i<T;i++)
{
Rho[i] = init.Rho.segment(i*NumTasks,NumTasks);
}
}
else
{
throw_named("Invalid task weights rho! "<<init.Rho.rows());
}
yref.setZero(PhiN);
y.assign(T, yref);
Phi = y;
ydiff.assign(T, Eigen::VectorXd::Zero(JN));
J.assign(T, Eigen::MatrixXd(JN, N));
}
double UnconstrainedTimeIndexedProblem::getDuration()
{
return tau * (double) T;
}
void UnconstrainedTimeIndexedProblem::Update(Eigen::VectorXdRefConst x, int t)
{
scene_->Update(x);
for(int i=0;i<NumTasks;i++)
{
Tasks[i]->update(x, Phi[t].data.segment(Tasks[i]->Start, Tasks[i]->Length), J[t].middleRows(Tasks[i]->StartJ, Tasks[i]->LengthJ));
}
ydiff[t] = y[t] - Phi[t];
}
void UnconstrainedTimeIndexedProblem::setGoal(const std::string & task_name, Eigen::VectorXdRefConst goal, int t)
{
try
{
TaskMap_ptr task = TaskMaps.at(task_name);
y[t].data.segment(task->Start, task->Length) = goal;
}
catch(std::out_of_range& e)
{
throw_pretty("Cannot set Goal. Task map '"<<task_name<<"' Does not exist.");
}
}
void UnconstrainedTimeIndexedProblem::setRho(const std::string & task_name, const double rho, int t)
{
try
{
TaskMap_ptr task = TaskMaps.at(task_name);
Rho[t](task->Id) = rho;
}
catch(std::out_of_range& e)
{
throw_pretty("Cannot set Rho. Task map '"<<task_name<<"' Does not exist.");
}
}
Eigen::VectorXd UnconstrainedTimeIndexedProblem::getGoal(const std::string & task_name, int t)
{
try
{
TaskMap_ptr task = TaskMaps.at(task_name);
return y[t].data.segment(task->Start, task->Length);
}
catch(std::out_of_range& e)
{
throw_pretty("Cannot get Goal. Task map '"<<task_name<<"' Does not exist.");
}
}
double UnconstrainedTimeIndexedProblem::getRho(const std::string & task_name, int t)
{
try
{
TaskMap_ptr task = TaskMaps.at(task_name);
return Rho[t](task->Id);
}
catch(std::out_of_range& e)
{
throw_pretty("Cannot get Rho. Task map '"<<task_name<<"' Does not exist.");
}
}
}
<commit_msg>UnconstrainedTimeIndexedProblem: Avoid segfault for out of range t values in getter/setters - Checks whether chosen timestep is valid - Adds support for -1 = last element<commit_after>/*
* Created on: 19 Apr 2014
* Author: Vladimir Ivan
*
* Copyright (c) 2016, University Of Edinburgh
* 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 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.
*
*/
#include <exotica/Problems/UnconstrainedTimeIndexedProblem.h>
#include <exotica/Setup.h>
REGISTER_PROBLEM_TYPE("UnconstrainedTimeIndexedProblem", exotica::UnconstrainedTimeIndexedProblem)
namespace exotica
{
UnconstrainedTimeIndexedProblem::UnconstrainedTimeIndexedProblem()
: T(0), tau(0), Q_rate(0), W_rate(0), H_rate(0)
{
Flags = KIN_FK | KIN_J;
}
UnconstrainedTimeIndexedProblem::~UnconstrainedTimeIndexedProblem()
{
}
void UnconstrainedTimeIndexedProblem::Instantiate(UnconstrainedTimeIndexedProblemInitializer& init)
{
T = init.T;
if (T <= 2)
{
throw_named("Invalid number of timesteps: "<<T);
}
tau = init.Tau;
Q_rate = init.Qrate;
H_rate = init.Hrate;
W_rate = init.Wrate;
NumTasks = Tasks.size();
PhiN = 0;
JN = 0;
TaskSpaceVector yref;
for(int i=0;i<NumTasks;i++)
{
appendVector(yref.map, Tasks[i]->getLieGroupIndices());
PhiN += Tasks[i]->Length;
JN += Tasks[i]->LengthJ;
}
N = scene_->getSolver().getNumJoints();
W = Eigen::MatrixXd::Identity(N, N)*W_rate;
if(init.W.rows()>0)
{
if(init.W.rows()==N)
{
W.diagonal() = init.W*W_rate;
}
else
{
throw_named("W dimension mismatch! Expected "<<N<<", got "<<init.W.rows());
}
}
H = Eigen::MatrixXd::Identity(N, N)*Q_rate;
Q = Eigen::MatrixXd::Identity(N, N)*H_rate;
if(init.Rho.rows()==0)
{
Rho.assign(T, Eigen::VectorXd::Ones(NumTasks));
}
else if(init.Rho.rows()==NumTasks)
{
Rho.assign(T, init.Rho);
}
else if(init.Rho.rows()==NumTasks*T)
{
Rho.resize(T);
for(int i=0;i<T;i++)
{
Rho[i] = init.Rho.segment(i*NumTasks,NumTasks);
}
}
else
{
throw_named("Invalid task weights rho! "<<init.Rho.rows());
}
yref.setZero(PhiN);
y.assign(T, yref);
Phi = y;
ydiff.assign(T, Eigen::VectorXd::Zero(JN));
J.assign(T, Eigen::MatrixXd(JN, N));
}
double UnconstrainedTimeIndexedProblem::getDuration()
{
return tau * (double) T;
}
void UnconstrainedTimeIndexedProblem::Update(Eigen::VectorXdRefConst x, int t)
{
scene_->Update(x);
for(int i=0;i<NumTasks;i++)
{
Tasks[i]->update(x, Phi[t].data.segment(Tasks[i]->Start, Tasks[i]->Length), J[t].middleRows(Tasks[i]->StartJ, Tasks[i]->LengthJ));
}
ydiff[t] = y[t] - Phi[t];
}
void UnconstrainedTimeIndexedProblem::setGoal(const std::string & task_name, Eigen::VectorXdRefConst goal, int t)
{
try
{
if (t >= T || t < -1) {
throw_pretty("Requested t="
<< t
<< " out of range, needs to be 0 =< t < " << T);
} else if (t == -1) {
t = T - 1;
}
TaskMap_ptr task = TaskMaps.at(task_name);
y[t].data.segment(task->Start, task->Length) = goal;
}
catch(std::out_of_range& e)
{
throw_pretty("Cannot set Goal. Task map '"<<task_name<<"' Does not exist.");
}
}
void UnconstrainedTimeIndexedProblem::setRho(const std::string & task_name, const double rho, int t)
{
try
{
if (t >= T || t < -1) {
throw_pretty("Requested t="
<< t
<< " out of range, needs to be 0 =< t < " << T);
} else if (t == -1) {
t = T - 1;
}
TaskMap_ptr task = TaskMaps.at(task_name);
Rho[t](task->Id) = rho;
}
catch(std::out_of_range& e)
{
throw_pretty("Cannot set Rho. Task map '"<<task_name<<"' Does not exist.");
}
}
Eigen::VectorXd UnconstrainedTimeIndexedProblem::getGoal(const std::string & task_name, int t)
{
try
{
if (t >= T || t < -1) {
throw_pretty("Requested t="
<< t
<< " out of range, needs to be 0 =< t < " << T);
} else if (t == -1) {
t = T - 1;
}
TaskMap_ptr task = TaskMaps.at(task_name);
return y[t].data.segment(task->Start, task->Length);
}
catch(std::out_of_range& e)
{
throw_pretty("Cannot get Goal. Task map '"<<task_name<<"' Does not exist.");
}
}
double UnconstrainedTimeIndexedProblem::getRho(const std::string & task_name, int t)
{
try
{
if (t >= T || t < -1) {
throw_pretty("Requested t="
<< t
<< " out of range, needs to be 0 =< t < " << T);
} else if (t == -1) {
t = T - 1;
}
TaskMap_ptr task = TaskMaps.at(task_name);
return Rho[t](task->Id);
}
catch(std::out_of_range& e)
{
throw_pretty("Cannot get Rho. Task map '"<<task_name<<"' Does not exist.");
}
}
}
<|endoftext|>
|
<commit_before>#include <bts/kid/kid_server.hpp>
#include <bts/blockchain/difficulty.hpp>
#include <bts/db/level_map.hpp>
#include <fc/filesystem.hpp>
#include <fc/network/http/server.hpp>
#include <fc/exception/exception.hpp>
#include <fc/thread/thread.hpp>
#include <fc/reflect/variant.hpp>
#include <fc/io/raw.hpp>
namespace bts { namespace kid {
uint64_t name_record::difficulty()const
{
return 1000 * bts::blockchain::difficulty( digest512() );
}
fc::ecc::public_key signed_name_record::get_signee()const
{
return fc::ecc::public_key( master_signature, digest() );
}
fc::ecc::public_key stored_key::get_signee()const
{
FC_ASSERT( encrypted_key.size() > 0 );
auto digest = fc::sha256::hash( encrypted_key.data(), encrypted_key.size() );
return fc::ecc::public_key( signature, digest );
}
fc::sha256 name_record::digest()const
{
fc::sha256::encoder enc;
fc::raw::pack( enc, *this );
return enc.result();
}
fc::sha256 name_record::digest512()const
{
fc::sha512::encoder enc;
fc::raw::pack( enc, *this );
auto h512 = enc.result();
return fc::sha256::hash( (char*)&h512, sizeof(h512) );
}
fc::sha256 signed_name_record::id()const
{
fc::sha256::encoder enc;
fc::raw::pack( enc, *this );
return enc.result();
}
fc::sha256 block::digest()const
{
fc::sha256::encoder enc;
fc::raw::pack( enc, *this );
return enc.result();
}
fc::sha256 signed_block::id()const
{
fc::sha256::encoder enc;
fc::raw::pack( enc, *this );
return enc.result();
}
void signed_block::sign( const fc::ecc::private_key& trustee_priv_key )
{
trustee_signature = trustee_priv_key.sign_compact( id() );
}
void signed_block::verify( const fc::ecc::public_key& trustee_pub_key )
{
FC_ASSERT( fc::ecc::public_key( trustee_signature, id() ) == trustee_pub_key )
}
namespace detail
{
class server_impl
{
public:
server* _self;
bts::db::level_map<std::string, history > _name_index;
bts::db::level_map<uint32_t, signed_block> _block_database;
bts::db::level_map<std::string,stored_key > _key_data;
bts::db::level_map<fc::ripemd160, std::string> _key_to_name;
std::unordered_map<std::string, signed_name_record> _pending;
fc::future<void> _block_gen_loop_complete;
signed_block _current_block;
fc::sha256 _current_block_id;
fc::ecc::private_key _trustee_key;
void block_generation_loop()
{
while( !_block_gen_loop_complete.canceled() )
{
if( _pending.size() && (fc::time_point::now() - _current_block.timestamp) > fc::seconds(60) )
{
signed_block next_block;
next_block.number = _current_block.number + 1;
auto next_diff = _current_block.difficulty * 500 / _pending.size();
next_diff = (_current_block.difficulty * 99 + next_diff) / 100;
next_block.difficulty = std::max<uint64_t>(next_diff, 1000 );
next_block.timestamp = fc::time_point::now();
for( auto rec : _pending )
{
next_block.records.push_back( rec.second );
}
next_block.sign( _trustee_key );
_block_database.store(next_block.number,next_block);
for( uint32_t rec = 0; rec < next_block.records.size(); ++rec )
{
auto hist = _self->fetch_history( next_block.records[rec].name );
hist.updates.push_back( name_index( next_block.number, rec ) );
_name_index.store( next_block.records[rec].name, hist );
}
_current_block = next_block;
_current_block_id = _current_block.id();
}
fc::usleep( fc::seconds( 1 ) );
}
}
};
} // namespace detail
server::server()
:my( new detail::server_impl() )
{
my->_self = this;
my->_block_gen_loop_complete = fc::async( [=](){ my->block_generation_loop(); } );
}
server::~server()
{
ilog( "waiting for block generation loop to exit" );
try {
my->_block_gen_loop_complete.cancel();
my->_block_gen_loop_complete.wait();
}
catch ( const fc::canceled_exception& e ){}
catch ( const fc::exception& e )
{
wlog( "${e}", ("e",e.to_detail_string()) );
}
}
void server::set_data_directory( const fc::path& dir )
{
my->_name_index.open( dir / "name_index" );
my->_block_database.open( dir / "block_database" );
my->_key_data.open( dir / "key_data" );
my->_key_to_name.open( dir / "key_to_name" );
}
void server::listen( const fc::ip::endpoint& ep )
{
}
bool server::update_record( const signed_name_record& r )
{
FC_ASSERT( my->_pending.size() < 20000 );
FC_ASSERT( fc::trim_and_normalize_spaces( r.name ) == r.name );
FC_ASSERT( fc::to_lower( r.name ) == r.name );
FC_ASSERT( r.difficulty() >= my->_current_block.difficulty );
FC_ASSERT( my->_current_block_id == r.prev_block_id );
auto pending_itr = my->_pending.find( r.name );
FC_ASSERT( pending_itr == my->_pending.end() );
auto hist = fetch_history( r.name );
if( hist.updates.size() == 0 )
{
my->_pending[r.name] = r;
return true;
}
auto old_record = fetch_record( hist.updates.back() );
FC_ASSERT( old_record.master_key == r.get_signee() )
my->_pending[r.name] = r;
return true;
}
signed_name_record server::fetch_record( const std::string& name )
{
auto pending_itr = my->_pending.find( name );
if( pending_itr != my->_pending.end() )
return pending_itr->second;
auto hist= fetch_history( name );
FC_ASSERT( hist.updates.size() > 0 );
auto old_block = fetch_block( hist.updates.back().block_num );
return fetch_record( hist.updates.back() );
FC_ASSERT( old_block.records.size() > hist.updates.back().record_num );
return old_block.records[hist.updates.back().record_num];
}
signed_name_record server::fetch_record( const name_index& index )
{
auto old_block = fetch_block( index.block_num );
FC_ASSERT( old_block.records.size() > index.record_num );
return old_block.records[index.record_num];
}
history server::fetch_history( const std::string& name )
{
history hist;
auto itr = my->_name_index.find(name);
if( itr.valid() )
hist = itr.value();
return hist;
}
void server::store_key( const std::string& name, const stored_key& k )
{
auto cur_rec = fetch_record( name );
FC_ASSERT( k.encrypted_key.size() < 1024*16 );
FC_ASSERT( cur_rec.master_key == k.get_signee() );
my->_key_data.store( name, k );
}
stored_key server::fetch_key( const std::string& name )
{
return my->_key_data.fetch( name );
}
signed_block server::fetch_block( uint32_t block_num )
{
return my->_block_database.fetch( block_num );
}
} } // namespace bts::kid
<commit_msg>started http interface<commit_after>#include <bts/kid/kid_server.hpp>
#include <bts/blockchain/difficulty.hpp>
#include <bts/db/level_map.hpp>
#include <fc/filesystem.hpp>
#include <fc/network/http/server.hpp>
#include <fc/exception/exception.hpp>
#include <fc/thread/thread.hpp>
#include <fc/reflect/variant.hpp>
#include <fc/io/raw.hpp>
namespace bts { namespace kid {
uint64_t name_record::difficulty()const
{
return 1000 * bts::blockchain::difficulty( digest512() );
}
fc::ecc::public_key signed_name_record::get_signee()const
{
return fc::ecc::public_key( master_signature, digest() );
}
fc::ecc::public_key stored_key::get_signee()const
{
FC_ASSERT( encrypted_key.size() > 0 );
auto digest = fc::sha256::hash( encrypted_key.data(), encrypted_key.size() );
return fc::ecc::public_key( signature, digest );
}
fc::sha256 name_record::digest()const
{
fc::sha256::encoder enc;
fc::raw::pack( enc, *this );
return enc.result();
}
fc::sha256 name_record::digest512()const
{
fc::sha512::encoder enc;
fc::raw::pack( enc, *this );
auto h512 = enc.result();
return fc::sha256::hash( (char*)&h512, sizeof(h512) );
}
fc::sha256 signed_name_record::id()const
{
fc::sha256::encoder enc;
fc::raw::pack( enc, *this );
return enc.result();
}
fc::sha256 block::digest()const
{
fc::sha256::encoder enc;
fc::raw::pack( enc, *this );
return enc.result();
}
fc::sha256 signed_block::id()const
{
fc::sha256::encoder enc;
fc::raw::pack( enc, *this );
return enc.result();
}
void signed_block::sign( const fc::ecc::private_key& trustee_priv_key )
{
trustee_signature = trustee_priv_key.sign_compact( id() );
}
void signed_block::verify( const fc::ecc::public_key& trustee_pub_key )
{
FC_ASSERT( fc::ecc::public_key( trustee_signature, id() ) == trustee_pub_key )
}
namespace detail
{
class server_impl
{
public:
server* _self;
fc::http::server _httpd;
bts::db::level_map<std::string, history > _name_index;
bts::db::level_map<uint32_t, signed_block> _block_database;
bts::db::level_map<std::string,stored_key > _key_data;
bts::db::level_map<fc::ripemd160, std::string> _key_to_name;
std::unordered_map<std::string, signed_name_record> _pending;
fc::future<void> _block_gen_loop_complete;
signed_block _current_block;
fc::sha256 _current_block_id;
fc::ecc::private_key _trustee_key;
void block_generation_loop()
{
while( !_block_gen_loop_complete.canceled() )
{
if( _pending.size() && (fc::time_point::now() - _current_block.timestamp) > fc::seconds(60) )
{
signed_block next_block;
next_block.number = _current_block.number + 1;
auto next_diff = _current_block.difficulty * 500 / _pending.size();
next_diff = (_current_block.difficulty * 99 + next_diff) / 100;
next_block.difficulty = std::max<uint64_t>(next_diff, 1000 );
next_block.timestamp = fc::time_point::now();
for( auto rec : _pending )
{
next_block.records.push_back( rec.second );
}
next_block.sign( _trustee_key );
_block_database.store(next_block.number,next_block);
for( uint32_t rec = 0; rec < next_block.records.size(); ++rec )
{
auto hist = _self->fetch_history( next_block.records[rec].name );
hist.updates.push_back( name_index( next_block.number, rec ) );
_name_index.store( next_block.records[rec].name, hist );
}
_current_block = next_block;
_current_block_id = _current_block.id();
}
fc::usleep( fc::seconds( 1 ) );
}
}
void handle_request( const fc::http::request& r, const fc::http::server::response& s )
{
auto pos = r.path.find( "/" );
auto first_dir = r.path.substr(0,pos);
if( first_dir == "update_record" )
{
s.set_status( fc::http::reply::RecordCreated );
}
else if( first_dir == "fetch_by_name" )
{
s.set_status( fc::http::reply::Found );
}
else if( first_dir == "fetch_by_key" )
{
s.set_status( fc::http::reply::Found );
}
else if( first_dir == "store_key" )
{
s.set_status( fc::http::reply::RecordCreated );
}
else if( first_dir == "fetch_key" )
{
s.set_status( fc::http::reply::Found );
}
else
{
s.set_status( fc::http::reply::NotFound );
}
}
};
} // namespace detail
server::server()
:my( new detail::server_impl() )
{
my->_self = this;
my->_block_gen_loop_complete = fc::async( [=](){ my->block_generation_loop(); } );
}
server::~server()
{
ilog( "waiting for block generation loop to exit" );
try {
my->_block_gen_loop_complete.cancel();
my->_block_gen_loop_complete.wait();
}
catch ( const fc::canceled_exception& e ){}
catch ( const fc::exception& e )
{
wlog( "${e}", ("e",e.to_detail_string()) );
}
}
void server::set_data_directory( const fc::path& dir )
{
my->_name_index.open( dir / "name_index" );
my->_block_database.open( dir / "block_database" );
my->_key_data.open( dir / "key_data" );
my->_key_to_name.open( dir / "key_to_name" );
}
void server::listen( const fc::ip::endpoint& ep )
{
my->_httpd.on_request( [=]( const fc::http::request& r, const fc::http::server::response& s ){ my->handle_request( r, s ); } );
my->_httpd.listen(ep);
}
bool server::update_record( const signed_name_record& r )
{
FC_ASSERT( my->_pending.size() < 20000 );
FC_ASSERT( fc::trim_and_normalize_spaces( r.name ) == r.name );
FC_ASSERT( fc::to_lower( r.name ) == r.name );
FC_ASSERT( r.difficulty() >= my->_current_block.difficulty );
FC_ASSERT( my->_current_block_id == r.prev_block_id );
auto pending_itr = my->_pending.find( r.name );
FC_ASSERT( pending_itr == my->_pending.end() );
auto hist = fetch_history( r.name );
if( hist.updates.size() == 0 )
{
my->_pending[r.name] = r;
return true;
}
auto old_record = fetch_record( hist.updates.back() );
FC_ASSERT( old_record.master_key == r.get_signee() )
my->_pending[r.name] = r;
return true;
}
signed_name_record server::fetch_record( const std::string& name )
{
auto pending_itr = my->_pending.find( name );
if( pending_itr != my->_pending.end() )
return pending_itr->second;
auto hist= fetch_history( name );
FC_ASSERT( hist.updates.size() > 0 );
auto old_block = fetch_block( hist.updates.back().block_num );
return fetch_record( hist.updates.back() );
FC_ASSERT( old_block.records.size() > hist.updates.back().record_num );
return old_block.records[hist.updates.back().record_num];
}
signed_name_record server::fetch_record( const name_index& index )
{
auto old_block = fetch_block( index.block_num );
FC_ASSERT( old_block.records.size() > index.record_num );
return old_block.records[index.record_num];
}
history server::fetch_history( const std::string& name )
{
history hist;
auto itr = my->_name_index.find(name);
if( itr.valid() )
hist = itr.value();
return hist;
}
void server::store_key( const std::string& name, const stored_key& k )
{
auto cur_rec = fetch_record( name );
FC_ASSERT( k.encrypted_key.size() < 1024*16 );
FC_ASSERT( cur_rec.master_key == k.get_signee() );
my->_key_data.store( name, k );
}
stored_key server::fetch_key( const std::string& name )
{
return my->_key_data.fetch( name );
}
signed_block server::fetch_block( uint32_t block_num )
{
return my->_block_database.fetch( block_num );
}
} } // namespace bts::kid
<|endoftext|>
|
<commit_before>/*
eXokernel Development Kit (XDK)
Based on code by Samsung Research America Copyright (C) 2013
The GNU C 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.
The GNU C 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 the GNU C Library; if not, see
<http://www.gnu.org/licenses/>.
As a special exception, if you link the code in this file with
files compiled with a GNU compiler to produce an executable,
that does not cause the resulting executable to be covered by
the GNU Lesser General Public License. This exception does not
however invalidate any other reasons why the executable file
might be covered by the GNU Lesser General Public License.
This exception applies to code released by its copyright holders
in files containing the exception.
*/
/*
Authors:
Copyright (C) 2014, Daniel G. Waddington <daniel.waddington@acm.org>
*/
#include <stdint.h>
#include <dlfcn.h>
#include <assert.h>
#include <stdio.h>
#include <component/base.h>
#include <common/errors.h>
namespace Component
{
bool operator==(const Component::uuid_t& lhs, const Component::uuid_t& rhs) {
return memcmp(&lhs, &rhs, sizeof(Component::uuid_t))==0;
}
/**
* Called by the client to load the component from a DLL file
*
*/
IBase * load_component(const char * dllname, Component::uuid_t component_id) {
void * (*factory_createInstance)(Component::uuid_t&);
char * error;
void * dll = dlopen(dllname,RTLD_NOW);
if(!dll) {
PERR("unable to load library (%s) - check dependencies with ldd tool.",dllname);
return NULL;
}
dlerror();
*(void **) (&factory_createInstance) = dlsym(dll,"factory_createInstance");
if ((error = dlerror()) != NULL) {
PERR("Error: %s\n", error);
return NULL;
}
IBase* comp = (IBase*) factory_createInstance(component_id);
if(!comp) {
PERR("Error: factory create instance returned null.");
return NULL;
}
assert(comp);
comp->set_dll_handle(dll); /* record so we can call dlclose() */
comp->add_ref();
return comp;
}
/**
* Perform pairwise binding of components
*
* @param components List of components to bind
*
* @return S_OK on success.
*/
status_t bind(std::vector<IBase *> components) {
for(int i=0;i<components.size();i++) {
assert(components[i]);
for(int j=0;j<components.size();j++) {
assert(components[j]);
if(i==j) continue;
if(components[i]->bind(components[j]) == -1) {
PDBG("connect call in pairwise bind failed.");
return E_FAIL;
}
}
}
return S_OK;
}
}
<commit_msg>looks nicer<commit_after>/*
eXokernel Development Kit (XDK)
Based on code by Samsung Research America Copyright (C) 2013
The GNU C 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.
The GNU C 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 the GNU C Library; if not, see
<http://www.gnu.org/licenses/>.
As a special exception, if you link the code in this file with
files compiled with a GNU compiler to produce an executable,
that does not cause the resulting executable to be covered by
the GNU Lesser General Public License. This exception does not
however invalidate any other reasons why the executable file
might be covered by the GNU Lesser General Public License.
This exception applies to code released by its copyright holders
in files containing the exception.
*/
/*
Authors:
Copyright (C) 2014, Daniel G. Waddington <daniel.waddington@acm.org>
*/
#include <stdint.h>
#include <dlfcn.h>
#include <assert.h>
#include <stdio.h>
#include <component/base.h>
#include <common/errors.h>
namespace Component
{
bool operator==(const Component::uuid_t& lhs, const Component::uuid_t& rhs) {
return memcmp(&lhs, &rhs, sizeof(Component::uuid_t))==0;
}
/**
* Called by the client to load the component from a DLL file
*
*/
IBase * load_component(const char * dllname, Component::uuid_t component_id) {
void * (*factory_createInstance)(Component::uuid_t&);
char * error;
void * dll = dlopen(dllname,RTLD_NOW);
if(!dll) {
PERR("unable to load library (%s) - check dependencies with ldd tool.",dllname);
return NULL;
}
dlerror();
*(void **) (&factory_createInstance) = dlsym(dll,"factory_createInstance");
if ((error = dlerror()) != NULL) {
PERR("Error: %s\n", error);
return NULL;
}
IBase* comp = (IBase*) factory_createInstance(component_id);
if(comp==NULL) {
PERR("Error: factory create instance returned null.");
return NULL;
}
comp->set_dll_handle(dll); /* record so we can call dlclose() */
comp->add_ref();
return comp;
}
/**
* Perform pairwise binding of components
*
* @param components List of components to bind
*
* @return S_OK on success.
*/
status_t bind(std::vector<IBase *> components) {
for(int i=0;i<components.size();i++) {
assert(components[i]);
for(int j=0;j<components.size();j++) {
assert(components[j]);
if(i==j) continue;
if(components[i]->bind(components[j]) == -1) {
PDBG("connect call in pairwise bind failed.");
return E_FAIL;
}
}
}
return S_OK;
}
}
<|endoftext|>
|
<commit_before>// This file is part of the dune-gdt project:
// http://users.dune-project.org/projects/dune-gdt
// Copyright holders: Felix Albrecht
// License: BSD 2-Clause License (http://opensource.org/licenses/BSD-2-Clause)
//
// Contributors: Kirsten Weber
#ifndef DUNE_GDT_DISCRETEFUNCTION_DEFAULT_HH
#define DUNE_GDT_DISCRETEFUNCTION_DEFAULT_HH
#include <memory>
#include <type_traits>
#include <dune/common/exceptions.hh>
#include <dune/common/fvector.hh>
#include <dune/grid/io/file/vtk.hh>
#include <dune/stuff/la/container/interfaces.hh>
#include <dune/gdt/space/interface.hh>
#include "local.hh"
namespace Dune {
namespace GDT {
template< class SpaceImp, class VectorImp >
class ConstDiscreteFunction
: public Stuff::LocalizableFunctionInterface< typename SpaceImp::EntityType,
typename SpaceImp::DomainFieldType, SpaceImp::dimDomain,
typename SpaceImp::RangeFieldType, SpaceImp::dimRange, SpaceImp::dimRangeCols >
{
static_assert(std::is_base_of< SpaceInterface< typename SpaceImp::Traits >, SpaceImp >::value,
"SpaceImp has to be derived from SpaceInterface!");
static_assert(std::is_base_of< Dune::Stuff::LA::VectorInterface< typename VectorImp::Traits >, VectorImp >::value,
"VectorImp has to be derived from Stuff::LA::VectorInterface!");
static_assert(std::is_same< typename SpaceImp::RangeFieldType, typename VectorImp::ScalarType >::value,
"Types do not match!");
typedef Stuff::LocalizableFunctionInterface
< typename SpaceImp::EntityType, typename SpaceImp::DomainFieldType, SpaceImp::dimDomain,
typename SpaceImp::RangeFieldType, SpaceImp::dimRange, SpaceImp::dimRangeCols >
BaseType;
typedef ConstDiscreteFunction< SpaceImp, VectorImp > ThisType;
public:
typedef SpaceImp SpaceType;
typedef VectorImp VectorType;
typedef typename BaseType::EntityType EntityType;
typedef typename BaseType::LocalfunctionType LocalfunctionType;
static const unsigned int dimDomain = BaseType::dimDomain;
typedef typename BaseType::DomainFieldType DomainFieldType;
typedef typename BaseType::DomainType DomainType;
static const unsigned int dimRange = BaseType::dimRange;
static const unsigned int dimRangeCols = BaseType::dimRangeCols;
typedef typename BaseType::RangeFieldType RangeFieldType;
typedef typename BaseType::RangeType RangeType;
typedef typename BaseType::JacobianRangeType JacobianRangeType;
typedef ConstLocalDiscreteFunction< SpaceType, VectorType > ConstLocalDiscreteFunctionType;
ConstDiscreteFunction(const SpaceType& sp,
const VectorType& vec,
const std::string nm = "dune.gdt.constdiscretefunction")
: space_(sp)
, vector_(vec)
, name_(nm)
{
assert(vector_.size() == space_.mapper().size() && "Given vector has wrong size!");
}
ConstDiscreteFunction(const ThisType& other)
: space_(other.space_)
, vector_(other.vector_)
, name_(other.name_)
{}
ConstDiscreteFunction(ThisType&& source)
: space_(source.space_)
, vector_(source.vector_)
, name_(std::move(source.name_))
{}
ThisType& operator=(const ThisType& other) = delete;
~ConstDiscreteFunction() {}
virtual ThisType* copy() const DS_OVERRIDE
{
return new ThisType(*this);
}
virtual std::string name() const DS_OVERRIDE
{
return name_;
}
const SpaceType& space() const
{
return space_;
}
const VectorType& vector() const
{
return vector_;
}
ConstLocalDiscreteFunctionType local_discrete_function(const EntityType& entity) const
{
assert(space_.grid_view()->indexSet().contains(entity));
return ConstLocalDiscreteFunctionType(space_, vector_, entity);
}
virtual std::unique_ptr< LocalfunctionType > local_function(const EntityType& entity) const DS_OVERRIDE
{
return std::unique_ptr< ConstLocalDiscreteFunctionType >
(new ConstLocalDiscreteFunctionType(local_discrete_function(entity)));
}
void visualize(const std::string filename,
const bool subsampling = true,
VTK::OutputType vtk_output_type = VTK::appendedraw) const
{
BaseType::template visualize< typename SpaceType::GridViewType >(*(space().grid_view()),
filename,
subsampling,
vtk_output_type);
}
protected:
const SpaceType& space_;
private:
const VectorType& vector_;
const std::string name_;
}; // class ConstDiscreteFunction
template< class SpaceImp, class VectorImp >
class DiscreteFunction
: public ConstDiscreteFunction< SpaceImp, VectorImp >
{
typedef ConstDiscreteFunction< SpaceImp, VectorImp > BaseType;
typedef DiscreteFunction< SpaceImp, VectorImp > ThisType;
public:
typedef typename BaseType::SpaceType SpaceType;
typedef typename BaseType::VectorType VectorType;
typedef typename BaseType::EntityType EntityType;
typedef typename BaseType::LocalfunctionType LocalfunctionType;
typedef LocalDiscreteFunction< SpaceType, VectorType > LocalDiscreteFunctionType;
DiscreteFunction(const SpaceType& sp,
VectorType& vec,
const std::string nm = "dune.gdt.discretefunction")
: BaseType(sp, vec, nm)
, vector_(vec)
{}
DiscreteFunction(const ThisType& other)
: BaseType(other)
, vector_(other.vector_)
{}
DiscreteFunction(ThisType&& source)
: BaseType(std::move(source))
, vector_(source.vector_)
{}
ThisType& operator=(const ThisType& other) = delete;
~DiscreteFunction() {}
virtual ThisType* copy() const DS_OVERRIDE
{
return new ThisType(*this);
}
VectorType& vector()
{
return vector_;
}
LocalDiscreteFunctionType local_discrete_function(const EntityType& entity)
{
assert(space_.grid_view()->indexSet().contains(entity));
return LocalDiscreteFunctionType(space_, vector_, entity);
}
private:
using BaseType::space_;
VectorType& vector_;
}; // class DiscreteFunction
} // namespace GDT
} // namespace Dune
#endif // DUNE_GDT_DISCRETEFUNCTION_DEFAULT_HH
<commit_msg>[discretefunction.default] * allow to get a const local discrete function from a non const function<commit_after>// This file is part of the dune-gdt project:
// http://users.dune-project.org/projects/dune-gdt
// Copyright holders: Felix Albrecht
// License: BSD 2-Clause License (http://opensource.org/licenses/BSD-2-Clause)
//
// Contributors: Kirsten Weber
#ifndef DUNE_GDT_DISCRETEFUNCTION_DEFAULT_HH
#define DUNE_GDT_DISCRETEFUNCTION_DEFAULT_HH
#include <memory>
#include <type_traits>
#include <dune/common/exceptions.hh>
#include <dune/common/fvector.hh>
#include <dune/grid/io/file/vtk.hh>
#include <dune/stuff/la/container/interfaces.hh>
#include <dune/gdt/space/interface.hh>
#include "local.hh"
namespace Dune {
namespace GDT {
template< class SpaceImp, class VectorImp >
class ConstDiscreteFunction
: public Stuff::LocalizableFunctionInterface< typename SpaceImp::EntityType,
typename SpaceImp::DomainFieldType, SpaceImp::dimDomain,
typename SpaceImp::RangeFieldType, SpaceImp::dimRange, SpaceImp::dimRangeCols >
{
static_assert(std::is_base_of< SpaceInterface< typename SpaceImp::Traits >, SpaceImp >::value,
"SpaceImp has to be derived from SpaceInterface!");
static_assert(std::is_base_of< Dune::Stuff::LA::VectorInterface< typename VectorImp::Traits >, VectorImp >::value,
"VectorImp has to be derived from Stuff::LA::VectorInterface!");
static_assert(std::is_same< typename SpaceImp::RangeFieldType, typename VectorImp::ScalarType >::value,
"Types do not match!");
typedef Stuff::LocalizableFunctionInterface
< typename SpaceImp::EntityType, typename SpaceImp::DomainFieldType, SpaceImp::dimDomain,
typename SpaceImp::RangeFieldType, SpaceImp::dimRange, SpaceImp::dimRangeCols >
BaseType;
typedef ConstDiscreteFunction< SpaceImp, VectorImp > ThisType;
public:
typedef SpaceImp SpaceType;
typedef VectorImp VectorType;
typedef typename BaseType::EntityType EntityType;
typedef typename BaseType::LocalfunctionType LocalfunctionType;
static const unsigned int dimDomain = BaseType::dimDomain;
typedef typename BaseType::DomainFieldType DomainFieldType;
typedef typename BaseType::DomainType DomainType;
static const unsigned int dimRange = BaseType::dimRange;
static const unsigned int dimRangeCols = BaseType::dimRangeCols;
typedef typename BaseType::RangeFieldType RangeFieldType;
typedef typename BaseType::RangeType RangeType;
typedef typename BaseType::JacobianRangeType JacobianRangeType;
typedef ConstLocalDiscreteFunction< SpaceType, VectorType > ConstLocalDiscreteFunctionType;
ConstDiscreteFunction(const SpaceType& sp,
const VectorType& vec,
const std::string nm = "dune.gdt.constdiscretefunction")
: space_(sp)
, vector_(vec)
, name_(nm)
{
assert(vector_.size() == space_.mapper().size() && "Given vector has wrong size!");
}
ConstDiscreteFunction(const ThisType& other)
: space_(other.space_)
, vector_(other.vector_)
, name_(other.name_)
{}
ConstDiscreteFunction(ThisType&& source)
: space_(source.space_)
, vector_(source.vector_)
, name_(std::move(source.name_))
{}
ThisType& operator=(const ThisType& other) = delete;
~ConstDiscreteFunction() {}
virtual ThisType* copy() const DS_OVERRIDE
{
return new ThisType(*this);
}
virtual std::string name() const DS_OVERRIDE
{
return name_;
}
const SpaceType& space() const
{
return space_;
}
const VectorType& vector() const
{
return vector_;
}
ConstLocalDiscreteFunctionType local_discrete_function(const EntityType& entity) const
{
assert(space_.grid_view()->indexSet().contains(entity));
return ConstLocalDiscreteFunctionType(space_, vector_, entity);
}
virtual std::unique_ptr< LocalfunctionType > local_function(const EntityType& entity) const DS_OVERRIDE
{
return std::unique_ptr< ConstLocalDiscreteFunctionType >
(new ConstLocalDiscreteFunctionType(local_discrete_function(entity)));
}
void visualize(const std::string filename,
const bool subsampling = true,
VTK::OutputType vtk_output_type = VTK::appendedraw) const
{
BaseType::template visualize< typename SpaceType::GridViewType >(*(space().grid_view()),
filename,
subsampling,
vtk_output_type);
}
protected:
const SpaceType& space_;
private:
const VectorType& vector_;
const std::string name_;
}; // class ConstDiscreteFunction
template< class SpaceImp, class VectorImp >
class DiscreteFunction
: public ConstDiscreteFunction< SpaceImp, VectorImp >
{
typedef ConstDiscreteFunction< SpaceImp, VectorImp > BaseType;
typedef DiscreteFunction< SpaceImp, VectorImp > ThisType;
public:
typedef typename BaseType::SpaceType SpaceType;
typedef typename BaseType::VectorType VectorType;
typedef typename BaseType::EntityType EntityType;
typedef typename BaseType::LocalfunctionType LocalfunctionType;
typedef LocalDiscreteFunction< SpaceType, VectorType > LocalDiscreteFunctionType;
DiscreteFunction(const SpaceType& sp,
VectorType& vec,
const std::string nm = "dune.gdt.discretefunction")
: BaseType(sp, vec, nm)
, vector_(vec)
{}
DiscreteFunction(const ThisType& other)
: BaseType(other)
, vector_(other.vector_)
{}
DiscreteFunction(ThisType&& source)
: BaseType(std::move(source))
, vector_(source.vector_)
{}
ThisType& operator=(const ThisType& other) = delete;
~DiscreteFunction() {}
virtual ThisType* copy() const DS_OVERRIDE
{
return new ThisType(*this);
}
VectorType& vector()
{
return vector_;
}
using BaseType::local_discrete_function;
LocalDiscreteFunctionType local_discrete_function(const EntityType& entity)
{
assert(space_.grid_view()->indexSet().contains(entity));
return LocalDiscreteFunctionType(space_, vector_, entity);
}
private:
using BaseType::space_;
VectorType& vector_;
}; // class DiscreteFunction
} // namespace GDT
} // namespace Dune
#endif // DUNE_GDT_DISCRETEFUNCTION_DEFAULT_HH
<|endoftext|>
|
<commit_before>//===- Miscompilation.cpp - Debug program miscompilations -----------------===//
//
// This file implements program miscompilation debugging support.
//
//===----------------------------------------------------------------------===//
#include "BugDriver.h"
#include "SystemUtils.h"
#include "ListReducer.h"
#include "llvm/Pass.h"
#include "llvm/Module.h"
#include "llvm/Transforms/Utils/Cloning.h"
#include "llvm/Transforms/Utils/Linker.h"
class ReduceMiscompilingPasses : public ListReducer<const PassInfo*> {
BugDriver &BD;
public:
ReduceMiscompilingPasses(BugDriver &bd) : BD(bd) {}
virtual TestResult doTest(std::vector<const PassInfo*> &Prefix,
std::vector<const PassInfo*> &Suffix);
};
ReduceMiscompilingPasses::TestResult
ReduceMiscompilingPasses::doTest(std::vector<const PassInfo*> &Prefix,
std::vector<const PassInfo*> &Suffix) {
// First, run the program with just the Suffix passes. If it is still broken
// with JUST the kept passes, discard the prefix passes.
std::cout << "Checking to see if '" << getPassesString(Suffix)
<< "' compile correctly: ";
std::string BytecodeResult;
if (BD.runPasses(Suffix, BytecodeResult, false/*delete*/, true/*quiet*/)) {
std::cerr << BD.getToolName() << ": Error running this sequence of passes"
<< " on the input program!\n";
exit(1);
}
// Check to see if the finished program matches the reference output...
if (BD.diffProgram(BytecodeResult, "", true /*delete bytecode*/)) {
std::cout << "nope.\n";
return KeepSuffix; // Miscompilation detected!
}
std::cout << "yup.\n"; // No miscompilation!
if (Prefix.empty()) return NoFailure;
// Next, see if the program is broken if we run the "prefix" passes first,
// then separately run the "kept" passes.
std::cout << "Checking to see if '" << getPassesString(Prefix)
<< "' compile correctly: ";
// If it is not broken with the kept passes, it's possible that the prefix
// passes must be run before the kept passes to break it. If the program
// WORKS after the prefix passes, but then fails if running the prefix AND
// kept passes, we can update our bytecode file to include the result of the
// prefix passes, then discard the prefix passes.
//
if (BD.runPasses(Prefix, BytecodeResult, false/*delete*/, true/*quiet*/)) {
std::cerr << BD.getToolName() << ": Error running this sequence of passes"
<< " on the input program!\n";
exit(1);
}
// If the prefix maintains the predicate by itself, only keep the prefix!
if (BD.diffProgram(BytecodeResult)) {
std::cout << "nope.\n";
removeFile(BytecodeResult);
return KeepPrefix;
}
std::cout << "yup.\n"; // No miscompilation!
// Ok, so now we know that the prefix passes work, try running the suffix
// passes on the result of the prefix passes.
//
Module *PrefixOutput = BD.ParseInputFile(BytecodeResult);
if (PrefixOutput == 0) {
std::cerr << BD.getToolName() << ": Error reading bytecode file '"
<< BytecodeResult << "'!\n";
exit(1);
}
removeFile(BytecodeResult); // No longer need the file on disk
std::cout << "Checking to see if '" << getPassesString(Suffix)
<< "' passes compile correctly after the '"
<< getPassesString(Prefix) << "' passes: ";
Module *OriginalInput = BD.Program;
BD.Program = PrefixOutput;
if (BD.runPasses(Suffix, BytecodeResult, false/*delete*/, true/*quiet*/)) {
std::cerr << BD.getToolName() << ": Error running this sequence of passes"
<< " on the input program!\n";
exit(1);
}
// Run the result...
if (BD.diffProgram(BytecodeResult, "", true/*delete bytecode*/)) {
std::cout << "nope.\n";
delete OriginalInput; // We pruned down the original input...
return KeepSuffix;
}
// Otherwise, we must not be running the bad pass anymore.
std::cout << "yup.\n"; // No miscompilation!
BD.Program = OriginalInput; // Restore original program
delete PrefixOutput; // Free experiment
return NoFailure;
}
class ReduceMiscompilingFunctions : public ListReducer<Function*> {
BugDriver &BD;
public:
ReduceMiscompilingFunctions(BugDriver &bd) : BD(bd) {}
virtual TestResult doTest(std::vector<Function*> &Prefix,
std::vector<Function*> &Suffix) {
if (TestFuncs(Suffix, false))
return KeepSuffix;
if (!Prefix.empty() && TestFuncs(Prefix, false))
return KeepPrefix;
return NoFailure;
}
bool TestFuncs(const std::vector<Function*> &Prefix, bool EmitBytecode);
};
bool ReduceMiscompilingFunctions::TestFuncs(const std::vector<Function*> &Funcs,
bool EmitBytecode) {
// Test to see if the function is misoptimized if we ONLY run it on the
// functions listed in Funcs.
if (!EmitBytecode) {
std::cout << "Checking to see if the program is misoptimized when these "
<< "functions are run\nthrough the passes: ";
BD.PrintFunctionList(Funcs);
std::cout << "\n";
} else {
std::cout <<"Outputting reduced bytecode files which expose the problem:\n";
}
// First step: clone the module for the two halves of the program we want.
Module *ToOptimize = CloneModule(BD.Program);
// Second step: Make sure functions & globals are all external so that linkage
// between the two modules will work.
for (Module::iterator I = ToOptimize->begin(), E = ToOptimize->end();I!=E;++I)
I->setLinkage(GlobalValue::ExternalLinkage);
for (Module::giterator I = ToOptimize->gbegin(), E = ToOptimize->gend();
I != E; ++I)
I->setLinkage(GlobalValue::ExternalLinkage);
// Third step: make a clone of the externalized program for the non-optimized
// part.
Module *ToNotOptimize = CloneModule(ToOptimize);
// Fourth step: Remove the test functions from the ToNotOptimize module, and
// all of the global variables.
for (unsigned i = 0, e = Funcs.size(); i != e; ++i) {
Function *TNOF = ToNotOptimize->getFunction(Funcs[i]->getName(),
Funcs[i]->getFunctionType());
assert(TNOF && "Function doesn't exist in module!");
DeleteFunctionBody(TNOF); // Function is now external in this module!
}
for (Module::giterator I = ToNotOptimize->gbegin(), E = ToNotOptimize->gend();
I != E; ++I)
I->setInitializer(0); // Delete the initializer to make it external
if (EmitBytecode) {
std::cout << " Non-optimized portion: ";
std::swap(BD.Program, ToNotOptimize);
BD.EmitProgressBytecode("tonotoptimize", true);
std::swap(BD.Program, ToNotOptimize);
}
// Fifth step: Remove all functions from the ToOptimize module EXCEPT for the
// ones specified in Funcs. We know which ones these are because they are
// non-external in ToOptimize, but external in ToNotOptimize.
//
for (Module::iterator I = ToOptimize->begin(), E = ToOptimize->end();I!=E;++I)
if (!I->isExternal()) {
Function *TNOF = ToNotOptimize->getFunction(I->getName(),
I->getFunctionType());
assert(TNOF && "Function doesn't exist in ToNotOptimize module??");
if (!TNOF->isExternal())
DeleteFunctionBody(I);
}
if (EmitBytecode) {
std::cout << " Portion that is input to optimizer: ";
std::swap(BD.Program, ToOptimize);
BD.EmitProgressBytecode("tooptimize");
std::swap(BD.Program, ToOptimize);
}
// Sixth step: Run the optimization passes on ToOptimize, producing a
// transformed version of the functions being tested.
Module *OldProgram = BD.Program;
BD.Program = ToOptimize;
if (!EmitBytecode)
std::cout << " Optimizing functions being tested: ";
std::string BytecodeResult;
if (BD.runPasses(BD.PassesToRun, BytecodeResult, false/*delete*/,
true/*quiet*/)) {
std::cerr << BD.getToolName() << ": Error running this sequence of passes"
<< " on the input program!\n";
exit(1);
}
if (!EmitBytecode)
std::cout << "done.\n";
delete BD.Program; // Delete the old "ToOptimize" module
BD.Program = BD.ParseInputFile(BytecodeResult);
if (EmitBytecode) {
std::cout << " 'tooptimize' after being optimized: ";
BD.EmitProgressBytecode("optimized", true);
}
if (BD.Program == 0) {
std::cerr << BD.getToolName() << ": Error reading bytecode file '"
<< BytecodeResult << "'!\n";
exit(1);
}
removeFile(BytecodeResult); // No longer need the file on disk
// Seventh step: Link the optimized part of the program back to the
// unoptimized part of the program.
//
if (LinkModules(BD.Program, ToNotOptimize, &BytecodeResult)) {
std::cerr << BD.getToolName() << ": Error linking modules together:"
<< BytecodeResult << "\n";
exit(1);
}
delete ToNotOptimize; // We are done with this module...
if (EmitBytecode) {
std::cout << " Program as tested: ";
BD.EmitProgressBytecode("linked", true);
delete BD.Program;
BD.Program = OldProgram;
return false; // We don't need to actually execute the program here.
}
std::cout << " Checking to see if the merged program executes correctly: ";
// Eighth step: Execute the program. If it does not match the expected
// output, then 'Funcs' are being misoptimized!
bool Broken = BD.diffProgram();
delete BD.Program; // Delete the hacked up program
BD.Program = OldProgram; // Restore the original
std::cout << (Broken ? "nope.\n" : "yup.\n");
return Broken;
}
/// debugMiscompilation - This method is used when the passes selected are not
/// crashing, but the generated output is semantically different from the
/// input.
///
bool BugDriver::debugMiscompilation() {
if (diffProgram()) {
std::cout << "\n*** Input program does not match reference diff!\n"
<< " Must be problem with input source!\n";
return false; // Problem found
}
// Make sure something was miscompiled...
if (!ReduceMiscompilingPasses(*this).reduceList(PassesToRun)) {
std::cerr << "*** Optimized program matches reference output! No problem "
<< "detected...\nbugpoint can't help you with your problem!\n";
return false;
}
std::cout << "\n*** Found miscompiling pass"
<< (PassesToRun.size() == 1 ? "" : "es") << ": "
<< getPassesString(PassesToRun) << "\n";
EmitProgressBytecode("passinput");
// Okay, now that we have reduced the list of passes which are causing the
// failure, see if we can pin down which functions are being
// miscompiled... first build a list of all of the non-external functions in
// the program.
std::vector<Function*> MiscompiledFunctions;
for (Module::iterator I = Program->begin(), E = Program->end(); I != E; ++I)
if (!I->isExternal())
MiscompiledFunctions.push_back(I);
// Do the reduction...
ReduceMiscompilingFunctions(*this).reduceList(MiscompiledFunctions);
std::cout << "\n*** The following functions are being miscompiled: ";
PrintFunctionList(MiscompiledFunctions);
std::cout << "\n";
// Output a bunch of bytecode files for the user...
ReduceMiscompilingFunctions(*this).TestFuncs(MiscompiledFunctions, true);
return false;
}
<commit_msg>Do not attempt to reduce a test case if it is an empty set.<commit_after>//===- Miscompilation.cpp - Debug program miscompilations -----------------===//
//
// This file implements program miscompilation debugging support.
//
//===----------------------------------------------------------------------===//
#include "BugDriver.h"
#include "SystemUtils.h"
#include "ListReducer.h"
#include "llvm/Pass.h"
#include "llvm/Module.h"
#include "llvm/Transforms/Utils/Cloning.h"
#include "llvm/Transforms/Utils/Linker.h"
class ReduceMiscompilingPasses : public ListReducer<const PassInfo*> {
BugDriver &BD;
public:
ReduceMiscompilingPasses(BugDriver &bd) : BD(bd) {}
virtual TestResult doTest(std::vector<const PassInfo*> &Prefix,
std::vector<const PassInfo*> &Suffix);
};
ReduceMiscompilingPasses::TestResult
ReduceMiscompilingPasses::doTest(std::vector<const PassInfo*> &Prefix,
std::vector<const PassInfo*> &Suffix) {
// First, run the program with just the Suffix passes. If it is still broken
// with JUST the kept passes, discard the prefix passes.
std::cout << "Checking to see if '" << getPassesString(Suffix)
<< "' compile correctly: ";
std::string BytecodeResult;
if (BD.runPasses(Suffix, BytecodeResult, false/*delete*/, true/*quiet*/)) {
std::cerr << BD.getToolName() << ": Error running this sequence of passes"
<< " on the input program!\n";
exit(1);
}
// Check to see if the finished program matches the reference output...
if (BD.diffProgram(BytecodeResult, "", true /*delete bytecode*/)) {
std::cout << "nope.\n";
return KeepSuffix; // Miscompilation detected!
}
std::cout << "yup.\n"; // No miscompilation!
if (Prefix.empty()) return NoFailure;
// Next, see if the program is broken if we run the "prefix" passes first,
// then separately run the "kept" passes.
std::cout << "Checking to see if '" << getPassesString(Prefix)
<< "' compile correctly: ";
// If it is not broken with the kept passes, it's possible that the prefix
// passes must be run before the kept passes to break it. If the program
// WORKS after the prefix passes, but then fails if running the prefix AND
// kept passes, we can update our bytecode file to include the result of the
// prefix passes, then discard the prefix passes.
//
if (BD.runPasses(Prefix, BytecodeResult, false/*delete*/, true/*quiet*/)) {
std::cerr << BD.getToolName() << ": Error running this sequence of passes"
<< " on the input program!\n";
exit(1);
}
// If the prefix maintains the predicate by itself, only keep the prefix!
if (BD.diffProgram(BytecodeResult)) {
std::cout << "nope.\n";
removeFile(BytecodeResult);
return KeepPrefix;
}
std::cout << "yup.\n"; // No miscompilation!
// Ok, so now we know that the prefix passes work, try running the suffix
// passes on the result of the prefix passes.
//
Module *PrefixOutput = BD.ParseInputFile(BytecodeResult);
if (PrefixOutput == 0) {
std::cerr << BD.getToolName() << ": Error reading bytecode file '"
<< BytecodeResult << "'!\n";
exit(1);
}
removeFile(BytecodeResult); // No longer need the file on disk
std::cout << "Checking to see if '" << getPassesString(Suffix)
<< "' passes compile correctly after the '"
<< getPassesString(Prefix) << "' passes: ";
Module *OriginalInput = BD.Program;
BD.Program = PrefixOutput;
if (BD.runPasses(Suffix, BytecodeResult, false/*delete*/, true/*quiet*/)) {
std::cerr << BD.getToolName() << ": Error running this sequence of passes"
<< " on the input program!\n";
exit(1);
}
// Run the result...
if (BD.diffProgram(BytecodeResult, "", true/*delete bytecode*/)) {
std::cout << "nope.\n";
delete OriginalInput; // We pruned down the original input...
return KeepSuffix;
}
// Otherwise, we must not be running the bad pass anymore.
std::cout << "yup.\n"; // No miscompilation!
BD.Program = OriginalInput; // Restore original program
delete PrefixOutput; // Free experiment
return NoFailure;
}
class ReduceMiscompilingFunctions : public ListReducer<Function*> {
BugDriver &BD;
public:
ReduceMiscompilingFunctions(BugDriver &bd) : BD(bd) {}
virtual TestResult doTest(std::vector<Function*> &Prefix,
std::vector<Function*> &Suffix) {
if (!Suffix.empty() && TestFuncs(Suffix, false))
return KeepSuffix;
if (!Prefix.empty() && TestFuncs(Prefix, false))
return KeepPrefix;
return NoFailure;
}
bool TestFuncs(const std::vector<Function*> &Prefix, bool EmitBytecode);
};
bool ReduceMiscompilingFunctions::TestFuncs(const std::vector<Function*> &Funcs,
bool EmitBytecode) {
// Test to see if the function is misoptimized if we ONLY run it on the
// functions listed in Funcs.
if (!EmitBytecode) {
std::cout << "Checking to see if the program is misoptimized when these "
<< "functions are run\nthrough the passes: ";
BD.PrintFunctionList(Funcs);
std::cout << "\n";
} else {
std::cout <<"Outputting reduced bytecode files which expose the problem:\n";
}
// First step: clone the module for the two halves of the program we want.
Module *ToOptimize = CloneModule(BD.Program);
// Second step: Make sure functions & globals are all external so that linkage
// between the two modules will work.
for (Module::iterator I = ToOptimize->begin(), E = ToOptimize->end();I!=E;++I)
I->setLinkage(GlobalValue::ExternalLinkage);
for (Module::giterator I = ToOptimize->gbegin(), E = ToOptimize->gend();
I != E; ++I)
I->setLinkage(GlobalValue::ExternalLinkage);
// Third step: make a clone of the externalized program for the non-optimized
// part.
Module *ToNotOptimize = CloneModule(ToOptimize);
// Fourth step: Remove the test functions from the ToNotOptimize module, and
// all of the global variables.
for (unsigned i = 0, e = Funcs.size(); i != e; ++i) {
Function *TNOF = ToNotOptimize->getFunction(Funcs[i]->getName(),
Funcs[i]->getFunctionType());
assert(TNOF && "Function doesn't exist in module!");
DeleteFunctionBody(TNOF); // Function is now external in this module!
}
for (Module::giterator I = ToNotOptimize->gbegin(), E = ToNotOptimize->gend();
I != E; ++I)
I->setInitializer(0); // Delete the initializer to make it external
if (EmitBytecode) {
std::cout << " Non-optimized portion: ";
std::swap(BD.Program, ToNotOptimize);
BD.EmitProgressBytecode("tonotoptimize", true);
std::swap(BD.Program, ToNotOptimize);
}
// Fifth step: Remove all functions from the ToOptimize module EXCEPT for the
// ones specified in Funcs. We know which ones these are because they are
// non-external in ToOptimize, but external in ToNotOptimize.
//
for (Module::iterator I = ToOptimize->begin(), E = ToOptimize->end();I!=E;++I)
if (!I->isExternal()) {
Function *TNOF = ToNotOptimize->getFunction(I->getName(),
I->getFunctionType());
assert(TNOF && "Function doesn't exist in ToNotOptimize module??");
if (!TNOF->isExternal())
DeleteFunctionBody(I);
}
if (EmitBytecode) {
std::cout << " Portion that is input to optimizer: ";
std::swap(BD.Program, ToOptimize);
BD.EmitProgressBytecode("tooptimize");
std::swap(BD.Program, ToOptimize);
}
// Sixth step: Run the optimization passes on ToOptimize, producing a
// transformed version of the functions being tested.
Module *OldProgram = BD.Program;
BD.Program = ToOptimize;
if (!EmitBytecode)
std::cout << " Optimizing functions being tested: ";
std::string BytecodeResult;
if (BD.runPasses(BD.PassesToRun, BytecodeResult, false/*delete*/,
true/*quiet*/)) {
std::cerr << BD.getToolName() << ": Error running this sequence of passes"
<< " on the input program!\n";
exit(1);
}
if (!EmitBytecode)
std::cout << "done.\n";
delete BD.Program; // Delete the old "ToOptimize" module
BD.Program = BD.ParseInputFile(BytecodeResult);
if (EmitBytecode) {
std::cout << " 'tooptimize' after being optimized: ";
BD.EmitProgressBytecode("optimized", true);
}
if (BD.Program == 0) {
std::cerr << BD.getToolName() << ": Error reading bytecode file '"
<< BytecodeResult << "'!\n";
exit(1);
}
removeFile(BytecodeResult); // No longer need the file on disk
// Seventh step: Link the optimized part of the program back to the
// unoptimized part of the program.
//
if (LinkModules(BD.Program, ToNotOptimize, &BytecodeResult)) {
std::cerr << BD.getToolName() << ": Error linking modules together:"
<< BytecodeResult << "\n";
exit(1);
}
delete ToNotOptimize; // We are done with this module...
if (EmitBytecode) {
std::cout << " Program as tested: ";
BD.EmitProgressBytecode("linked", true);
delete BD.Program;
BD.Program = OldProgram;
return false; // We don't need to actually execute the program here.
}
std::cout << " Checking to see if the merged program executes correctly: ";
// Eighth step: Execute the program. If it does not match the expected
// output, then 'Funcs' are being misoptimized!
bool Broken = BD.diffProgram();
delete BD.Program; // Delete the hacked up program
BD.Program = OldProgram; // Restore the original
std::cout << (Broken ? "nope.\n" : "yup.\n");
return Broken;
}
/// debugMiscompilation - This method is used when the passes selected are not
/// crashing, but the generated output is semantically different from the
/// input.
///
bool BugDriver::debugMiscompilation() {
if (diffProgram()) {
std::cout << "\n*** Input program does not match reference diff!\n"
<< " Must be problem with input source!\n";
return false; // Problem found
}
// Make sure something was miscompiled...
if (!ReduceMiscompilingPasses(*this).reduceList(PassesToRun)) {
std::cerr << "*** Optimized program matches reference output! No problem "
<< "detected...\nbugpoint can't help you with your problem!\n";
return false;
}
std::cout << "\n*** Found miscompiling pass"
<< (PassesToRun.size() == 1 ? "" : "es") << ": "
<< getPassesString(PassesToRun) << "\n";
EmitProgressBytecode("passinput");
// Okay, now that we have reduced the list of passes which are causing the
// failure, see if we can pin down which functions are being
// miscompiled... first build a list of all of the non-external functions in
// the program.
std::vector<Function*> MiscompiledFunctions;
for (Module::iterator I = Program->begin(), E = Program->end(); I != E; ++I)
if (!I->isExternal())
MiscompiledFunctions.push_back(I);
// Do the reduction...
ReduceMiscompilingFunctions(*this).reduceList(MiscompiledFunctions);
std::cout << "\n*** The following functions are being miscompiled: ";
PrintFunctionList(MiscompiledFunctions);
std::cout << "\n";
// Output a bunch of bytecode files for the user...
ReduceMiscompilingFunctions(*this).TestFuncs(MiscompiledFunctions, true);
return false;
}
<|endoftext|>
|
<commit_before>#include <Eigen/Dense>
#include <Eigen/Sparse>
#include <iomanip>
#include "mvnormal.h"
#include "session.h"
#include "chol.h"
#include "linop.h"
#include "noisemodels.h"
#include "latentprior.h"
#include "data.h"
using namespace std;
using namespace Eigen;
namespace Macau {
ILatentPrior::ILatentPrior(BaseSession &m, int p, std::string name)
: session(m), mode(p), name(name) {}
std::ostream &ILatentPrior::info(std::ostream &os, std::string indent)
{
os << indent << mode << ": " << name << "\n";
return os;
}
Model &ILatentPrior::model() { return session.model; }
Data &ILatentPrior::data() { return *session.data; }
INoiseModel &ILatentPrior::noise() { return *data().noise; }
MatrixXd &ILatentPrior::U() { return model().U(mode); }
MatrixXd &ILatentPrior::V() { return model().V(mode); }
void ILatentPrior::init()
{
rrs.init(VectorNd::Zero(num_latent()));
MMs.init(MatrixNNd::Zero(num_latent(), num_latent()));
}
void ILatentPrior::sample_latents()
{
session.data->update_pnm(model(), mode);
#pragma omp parallel for schedule(guided)
for(int n = 0; n < U().cols(); n++) {
#pragma omp task
sample_latent(n);
}
}
/**
* base class NormalPrior
*/
NormalPrior::NormalPrior(BaseSession &m, int p, std::string name)
: ILatentPrior(m, p, name) {}
void NormalPrior::init() {
ILatentPrior::init();
initUU();
const int K = num_latent();
mu.resize(K);
mu.setZero();
Lambda.resize(K, K);
Lambda.setIdentity();
Lambda *= 10;
// parameters of Inv-Whishart distribution
WI.resize(K, K);
WI.setIdentity();
mu0.resize(K);
mu0.setZero();
b0 = 2;
df = K;
}
void NormalPrior::initUU()
{
Ucol.init(VectorNd::Zero(num_latent())),
UUcol.init(MatrixNNd::Zero(num_latent(), num_latent()));
UUcol.local() = U() * U().transpose();
Ucol.local() = U().rowwise().sum();
}
void NormalPrior::sample_latents() {
const int N = num_cols();
const auto cov = UUcol.combine();
const auto sum = Ucol.combine();
tie(mu, Lambda) = CondNormalWishart(N, cov / N, sum / N, mu0, b0, WI, df);
UUcol.reset();
Ucol.reset();
ILatentPrior::sample_latents();
}
void NormalPrior::sample_latent(int n)
{
const auto &mu_u = getMu(n);
VectorNd &rr = rrs.local();
MatrixNNd &MM = MMs.local();
rr.setZero();
MM.setZero();
// add pnm
session.data->get_pnm(model(),mode,n,rr,MM);
// add hyperparams
rr.noalias() += Lambda * mu_u;
MM.noalias() += Lambda;
Eigen::LLT<MatrixXd> chol = MM.llt();
if(chol.info() != Eigen::Success) {
throw std::runtime_error("Cholesky Decomposition failed!");
}
chol.matrixL().solveInPlace(rr);
rr.noalias() += nrandn(num_latent());
chol.matrixU().solveInPlace(rr);
U().col(n).noalias() = rr;
Ucol.local().noalias() += rr;
UUcol.local().noalias() += rr * rr.transpose();
}
void NormalPrior::save(std::string prefix, std::string suffix) {
write_dense(prefix + "-U" + std::to_string(mode) + "-latentmean" + suffix, mu);
}
void NormalPrior::restore(std::string prefix, std::string suffix) {
read_dense(prefix + "-U" + std::to_string(mode) + "-latentmean" + suffix, mu);
initUU();
}
} // end namespace Macau
<commit_msg>Update hyper params AFTER sampling latents<commit_after>#include <Eigen/Dense>
#include <Eigen/Sparse>
#include <iomanip>
#include "mvnormal.h"
#include "session.h"
#include "chol.h"
#include "linop.h"
#include "noisemodels.h"
#include "latentprior.h"
#include "data.h"
using namespace std;
using namespace Eigen;
namespace Macau {
ILatentPrior::ILatentPrior(BaseSession &m, int p, std::string name)
: session(m), mode(p), name(name) {}
std::ostream &ILatentPrior::info(std::ostream &os, std::string indent)
{
os << indent << mode << ": " << name << "\n";
return os;
}
Model &ILatentPrior::model() { return session.model; }
Data &ILatentPrior::data() { return *session.data; }
INoiseModel &ILatentPrior::noise() { return *data().noise; }
MatrixXd &ILatentPrior::U() { return model().U(mode); }
MatrixXd &ILatentPrior::V() { return model().V(mode); }
void ILatentPrior::init()
{
rrs.init(VectorNd::Zero(num_latent()));
MMs.init(MatrixNNd::Zero(num_latent(), num_latent()));
}
void ILatentPrior::sample_latents()
{
session.data->update_pnm(model(), mode);
#pragma omp parallel for schedule(guided)
for(int n = 0; n < U().cols(); n++) {
#pragma omp task
sample_latent(n);
}
}
/**
* base class NormalPrior
*/
NormalPrior::NormalPrior(BaseSession &m, int p, std::string name)
: ILatentPrior(m, p, name) {}
void NormalPrior::init() {
ILatentPrior::init();
initUU();
const int K = num_latent();
mu.resize(K);
mu.setZero();
Lambda.resize(K, K);
Lambda.setIdentity();
Lambda *= 10;
// parameters of Inv-Whishart distribution
WI.resize(K, K);
WI.setIdentity();
mu0.resize(K);
mu0.setZero();
b0 = 2;
df = K;
}
void NormalPrior::initUU()
{
const int K = num_latent();
Ucol.init(VectorNd::Zero(K));
UUcol.init(MatrixNNd::Zero(K, K));
UUcol.local() = U() * U().transpose();
Ucol.local() = U().rowwise().sum();
}
void NormalPrior::sample_latents()
{
ILatentPrior::sample_latents();
const int N = num_cols();
const auto cov = UUcol.combine_and_reset();
const auto sum = Ucol.combine_and_reset();
//tie(mu, Lambda) = CondNormalWishart(N, cov / N, sum / N, mu0, b0, WI, df);
//tie(mu, Lambda) = CondNormalWishart(U(), mu0, b0, WI, df);
SHOW(N);
SHOW(mu.norm());
SHOW(Lambda.norm());
}
void NormalPrior::sample_latent(int n)
{
const auto &mu_u = getMu(n);
VectorNd &rr = rrs.local();
MatrixNNd &MM = MMs.local();
rr.setZero();
MM.setZero();
// add pnm
session.data->get_pnm(model(),mode,n,rr,MM);
// add hyperparams
rr.noalias() += Lambda * mu_u;
MM.noalias() += Lambda;
Eigen::LLT<MatrixXd> chol = MM.llt();
if(chol.info() != Eigen::Success) {
throw std::runtime_error("Cholesky Decomposition failed!");
}
chol.matrixL().solveInPlace(rr);
rr.noalias() += nrandn(num_latent());
chol.matrixU().solveInPlace(rr);
U().col(n).noalias() = rr;
Ucol.local().noalias() += rr;
UUcol.local().noalias() += rr * rr.transpose();
}
void NormalPrior::save(std::string prefix, std::string suffix) {
write_dense(prefix + "-U" + std::to_string(mode) + "-latentmean" + suffix, mu);
}
void NormalPrior::restore(std::string prefix, std::string suffix) {
read_dense(prefix + "-U" + std::to_string(mode) + "-latentmean" + suffix, mu);
initUU();
}
} // end namespace Macau
<|endoftext|>
|
<commit_before>#include "Runtime/GuiSys/CTextParser.hpp"
#include "Runtime/GuiSys/CFontImageDef.hpp"
#include "Runtime/GuiSys/CTextExecuteBuffer.hpp"
namespace urde {
static float u16stof(char16_t* str) {
char cstr[16];
int i;
for (i = 0; i < 15 && str[i] != u'\0'; ++i)
cstr[i] = str[i];
cstr[i] = '\0';
return strtof(cstr, nullptr);
}
CTextColor CTextParser::ParseColor(const char16_t* str, int len) {
u8 r = GetColorValue(str + 1);
u8 g = GetColorValue(str + 3);
u8 b = GetColorValue(str + 5);
u8 a = 0xff;
if (len == 9)
a = GetColorValue(str + 7);
CTextColor ret;
ret.fromRGBA8(r, g, b, a);
return ret;
}
u8 CTextParser::GetColorValue(const char16_t* str) { return (FromHex(str[0]) << 4) + FromHex(str[1]); }
u32 CTextParser::FromHex(char16_t ch) {
if (ch >= u'0' && ch <= u'9')
return ch - u'0';
if (ch >= u'A' && ch <= u'F')
return ch - u'A' + 10;
if (ch >= u'a' && ch <= u'f')
return ch - u'a' + 10;
return 0;
}
s32 CTextParser::ParseInt(const char16_t* str, int len, bool signVal) {
bool neg = false;
int procCur = 0;
if (signVal && len && *str == u'-') {
neg = true;
procCur = 1;
}
int val = 0;
while (len > procCur) {
val *= 10;
wchar_t ch = str[procCur];
val += ch - u'0';
++procCur;
}
return neg ? -val : val;
}
bool CTextParser::Equals(const char16_t* str, int len, const char16_t* other) {
for (int i = 0; *other && i < len; ++i, ++str, ++other) {
if (*str != *other)
return false;
}
return *other == u'\0';
}
bool CTextParser::BeginsWith(const char16_t* str, int len, const char16_t* other) {
for (int i = 0; *other && i < len; ++i, ++str, ++other) {
if (*str != *other)
return false;
}
return true;
}
void CTextParser::ParseTag(CTextExecuteBuffer& out, const char16_t* str, int len,
const std::vector<std::pair<CAssetId, CAssetId>>* txtrMap) {
if (BeginsWith(str, len, u"font=")) {
TToken<CRasterFont> font = GetFont(str + 5, len - 5);
out.AddFont(font);
} else if (BeginsWith(str, len, u"image=")) {
CFontImageDef image = GetImage(str + 6, len - 6, txtrMap);
out.AddImage(image);
} else if (BeginsWith(str, len, u"fg-color=")) {
CTextColor color = ParseColor(str + 9, len - 9);
out.AddColor(EColorType::Foreground, color);
} else if (BeginsWith(str, len, u"main-color=")) {
CTextColor color = ParseColor(str + 11, len - 11);
out.AddColor(EColorType::Main, color);
} else if (BeginsWith(str, len, u"geometry-color=")) {
CTextColor color = ParseColor(str + 15, len - 15);
out.AddColor(EColorType::Geometry, color);
} else if (BeginsWith(str, len, u"outline-color=")) {
CTextColor color = ParseColor(str + 14, len - 14);
out.AddColor(EColorType::Outline, color);
} else if (BeginsWith(str, len, u"color")) {
const char16_t* valCur = str + 7;
len -= 7;
int val = str[6] - u'0';
if (str[7] >= u'0' && str[7] <= u'9') {
++valCur;
--len;
val *= 10;
val += str[7] - u'0';
}
if (Equals(valCur + 10, len - 10, u"no"))
out.AddRemoveColorOverride(val);
else {
CTextColor color = ParseColor(str + 10, len - 10);
out.AddColorOverride(val, color);
}
} else if (BeginsWith(str, len, u"line-spacing=")) {
out.AddLineSpacing(ParseInt(str + 13, len - 13, true) / 100.0);
} else if (BeginsWith(str, len, u"line-extra-space=")) {
out.AddLineExtraSpace(ParseInt(str + 17, len - 17, true));
} else if (BeginsWith(str, len, u"just=")) {
if (Equals(str + 5, len - 5, u"left"))
out.AddJustification(EJustification::Left);
else if (Equals(str + 5, len - 5, u"center"))
out.AddJustification(EJustification::Center);
else if (Equals(str + 5, len - 5, u"right"))
out.AddJustification(EJustification::Right);
else if (Equals(str + 5, len - 5, u"full"))
out.AddJustification(EJustification::Full);
else if (Equals(str + 5, len - 5, u"nleft"))
out.AddJustification(EJustification::NLeft);
else if (Equals(str + 5, len - 5, u"ncenter"))
out.AddJustification(EJustification::NCenter);
else if (Equals(str + 5, len - 5, u"nright"))
out.AddJustification(EJustification::NRight);
} else if (BeginsWith(str, len, u"vjust=")) {
if (Equals(str + 6, len - 6, u"top"))
out.AddVerticalJustification(EVerticalJustification::Top);
else if (Equals(str + 6, len - 6, u"center"))
out.AddVerticalJustification(EVerticalJustification::Center);
else if (Equals(str + 6, len - 6, u"bottom"))
out.AddVerticalJustification(EVerticalJustification::Bottom);
else if (Equals(str + 6, len - 6, u"full"))
out.AddVerticalJustification(EVerticalJustification::Full);
else if (Equals(str + 6, len - 6, u"ntop"))
out.AddVerticalJustification(EVerticalJustification::NTop);
else if (Equals(str + 6, len - 6, u"ncenter"))
out.AddVerticalJustification(EVerticalJustification::NCenter);
else if (Equals(str + 6, len - 6, u"nbottom"))
out.AddVerticalJustification(EVerticalJustification::NBottom);
} else if (Equals(str, len, u"push")) {
out.AddPushState();
} else if (Equals(str, len, u"pop")) {
out.AddPopState();
}
}
CFontImageDef CTextParser::GetImage(const char16_t* str, int len,
const std::vector<std::pair<CAssetId, CAssetId>>* txtrMap) {
int commaCount = 0;
for (int i = 0; i < len; ++i)
if (str[i] == u',')
++commaCount;
if (commaCount) {
std::u16string iterable(str, len);
size_t tokenPos;
size_t commaPos;
commaPos = iterable.find(u',');
iterable[commaPos] = u'\0';
tokenPos = commaPos + 1;
auto AdvanceCommaPos = [&]() {
commaPos = iterable.find(u',', tokenPos);
if (commaPos == std::u16string::npos)
commaPos = iterable.size();
iterable[commaPos] = u'\0';
};
auto AdvanceTokenPos = [&]() { tokenPos = commaPos + 1; };
if (BeginsWith(str, len, u"A")) {
/* Animated texture array */
AdvanceCommaPos();
float interval = u16stof(&iterable[tokenPos]);
AdvanceTokenPos();
std::vector<TToken<CTexture>> texs;
texs.reserve(commaCount - 1);
do {
AdvanceCommaPos();
texs.push_back(x0_store.GetObj({SBIG('TXTR'), GetAssetIdFromString(&iterable[tokenPos], len, txtrMap)}));
AdvanceTokenPos();
} while (commaPos != iterable.size());
return CFontImageDef(texs, interval, zeus::CVector2f(1.f, 1.f));
} else if (BeginsWith(str, len, u"SA")) {
/* Scaled and animated texture array */
AdvanceCommaPos();
float interval = u16stof(&iterable[tokenPos]);
AdvanceTokenPos();
AdvanceCommaPos();
float cropX = u16stof(&iterable[tokenPos]);
AdvanceTokenPos();
AdvanceCommaPos();
float cropY = u16stof(&iterable[tokenPos]);
AdvanceTokenPos();
std::vector<TToken<CTexture>> texs;
texs.reserve(commaCount - 3);
do {
AdvanceCommaPos();
texs.push_back(x0_store.GetObj({SBIG('TXTR'), GetAssetIdFromString(&iterable[tokenPos], len, txtrMap)}));
AdvanceTokenPos();
} while (commaPos != iterable.size());
return CFontImageDef(texs, interval, zeus::CVector2f(cropX, cropY));
} else if (BeginsWith(str, len, u"SI")) {
/* Scaled single texture */
AdvanceCommaPos();
float cropX = u16stof(&iterable[tokenPos]);
AdvanceTokenPos();
AdvanceCommaPos();
float cropY = u16stof(&iterable[tokenPos]);
AdvanceTokenPos();
AdvanceCommaPos();
TToken<CTexture> tex = x0_store.GetObj({SBIG('TXTR'), GetAssetIdFromString(&iterable[tokenPos], len, txtrMap)});
AdvanceTokenPos();
return CFontImageDef(tex, zeus::CVector2f(cropX, cropY));
}
}
TToken<CTexture> tex = x0_store.GetObj({SBIG('TXTR'), GetAssetIdFromString(str, len, txtrMap)});
return CFontImageDef(tex, zeus::CVector2f(1.f, 1.f));
}
CAssetId CTextParser::GetAssetIdFromString(const char16_t* str, int len,
const std::vector<std::pair<CAssetId, CAssetId>>* txtrMap) {
u8 r = GetColorValue(str);
u8 g = GetColorValue(str + 2);
u8 b = GetColorValue(str + 4);
u8 a = GetColorValue(str + 6);
CAssetId id = ((r << 24) | (g << 16) | (b << 8) | a) & 0xffffffff;
if (len == 16) {
r = GetColorValue(str + 8);
g = GetColorValue(str + 10);
b = GetColorValue(str + 12);
a = GetColorValue(str + 14);
id = (id.Value() << 32) | (((r << 24) | (g << 16) | (b << 8) | a) & 0xffffffff);
}
if (txtrMap) {
auto search = rstl::binary_find(txtrMap->begin(), txtrMap->end(), id,
[](const std::pair<CAssetId, CAssetId>& a) { return a.first; });
if (search != txtrMap->end())
id = search->second;
}
return id;
}
TToken<CRasterFont> CTextParser::GetFont(const char16_t* str, int len) {
return x0_store.GetObj({SBIG('FONT'), GetAssetIdFromString(str, len, nullptr)});
}
void CTextParser::ParseText(CTextExecuteBuffer& out, const char16_t* str, int len,
const std::vector<std::pair<CAssetId, CAssetId>>* txtrMap) {
int b = 0, e = 0;
for (b = 0, e = 0; str[e] && (len == -1 || e < len);) {
if (str[e] != u'&') {
++e;
continue;
}
if ((len == -1 || e + 1 < len) && str[e + 1] != u'&') {
if (e > b)
out.AddString(str + b, e - b);
++e;
b = e;
while (str[e] && (len == -1 || e < len) && str[e] != u';')
++e;
ParseTag(out, str + b, e - b, txtrMap);
b = e + 1;
} else {
out.AddString(str + b, e + 1 - b);
e += 2;
b = e;
}
}
if (e > b)
out.AddString(str + b, e - b);
}
} // namespace urde
<commit_msg>CTextParser: Resolve double->float truncation within ParseTag()<commit_after>#include "Runtime/GuiSys/CTextParser.hpp"
#include "Runtime/GuiSys/CFontImageDef.hpp"
#include "Runtime/GuiSys/CTextExecuteBuffer.hpp"
namespace urde {
static float u16stof(char16_t* str) {
char cstr[16];
int i;
for (i = 0; i < 15 && str[i] != u'\0'; ++i)
cstr[i] = str[i];
cstr[i] = '\0';
return strtof(cstr, nullptr);
}
CTextColor CTextParser::ParseColor(const char16_t* str, int len) {
u8 r = GetColorValue(str + 1);
u8 g = GetColorValue(str + 3);
u8 b = GetColorValue(str + 5);
u8 a = 0xff;
if (len == 9)
a = GetColorValue(str + 7);
CTextColor ret;
ret.fromRGBA8(r, g, b, a);
return ret;
}
u8 CTextParser::GetColorValue(const char16_t* str) { return (FromHex(str[0]) << 4) + FromHex(str[1]); }
u32 CTextParser::FromHex(char16_t ch) {
if (ch >= u'0' && ch <= u'9')
return ch - u'0';
if (ch >= u'A' && ch <= u'F')
return ch - u'A' + 10;
if (ch >= u'a' && ch <= u'f')
return ch - u'a' + 10;
return 0;
}
s32 CTextParser::ParseInt(const char16_t* str, int len, bool signVal) {
bool neg = false;
int procCur = 0;
if (signVal && len && *str == u'-') {
neg = true;
procCur = 1;
}
int val = 0;
while (len > procCur) {
val *= 10;
wchar_t ch = str[procCur];
val += ch - u'0';
++procCur;
}
return neg ? -val : val;
}
bool CTextParser::Equals(const char16_t* str, int len, const char16_t* other) {
for (int i = 0; *other && i < len; ++i, ++str, ++other) {
if (*str != *other)
return false;
}
return *other == u'\0';
}
bool CTextParser::BeginsWith(const char16_t* str, int len, const char16_t* other) {
for (int i = 0; *other && i < len; ++i, ++str, ++other) {
if (*str != *other)
return false;
}
return true;
}
void CTextParser::ParseTag(CTextExecuteBuffer& out, const char16_t* str, int len,
const std::vector<std::pair<CAssetId, CAssetId>>* txtrMap) {
if (BeginsWith(str, len, u"font=")) {
TToken<CRasterFont> font = GetFont(str + 5, len - 5);
out.AddFont(font);
} else if (BeginsWith(str, len, u"image=")) {
CFontImageDef image = GetImage(str + 6, len - 6, txtrMap);
out.AddImage(image);
} else if (BeginsWith(str, len, u"fg-color=")) {
CTextColor color = ParseColor(str + 9, len - 9);
out.AddColor(EColorType::Foreground, color);
} else if (BeginsWith(str, len, u"main-color=")) {
CTextColor color = ParseColor(str + 11, len - 11);
out.AddColor(EColorType::Main, color);
} else if (BeginsWith(str, len, u"geometry-color=")) {
CTextColor color = ParseColor(str + 15, len - 15);
out.AddColor(EColorType::Geometry, color);
} else if (BeginsWith(str, len, u"outline-color=")) {
CTextColor color = ParseColor(str + 14, len - 14);
out.AddColor(EColorType::Outline, color);
} else if (BeginsWith(str, len, u"color")) {
const char16_t* valCur = str + 7;
len -= 7;
int val = str[6] - u'0';
if (str[7] >= u'0' && str[7] <= u'9') {
++valCur;
--len;
val *= 10;
val += str[7] - u'0';
}
if (Equals(valCur + 10, len - 10, u"no"))
out.AddRemoveColorOverride(val);
else {
CTextColor color = ParseColor(str + 10, len - 10);
out.AddColorOverride(val, color);
}
} else if (BeginsWith(str, len, u"line-spacing=")) {
out.AddLineSpacing(ParseInt(str + 13, len - 13, true) / 100.0f);
} else if (BeginsWith(str, len, u"line-extra-space=")) {
out.AddLineExtraSpace(ParseInt(str + 17, len - 17, true));
} else if (BeginsWith(str, len, u"just=")) {
if (Equals(str + 5, len - 5, u"left"))
out.AddJustification(EJustification::Left);
else if (Equals(str + 5, len - 5, u"center"))
out.AddJustification(EJustification::Center);
else if (Equals(str + 5, len - 5, u"right"))
out.AddJustification(EJustification::Right);
else if (Equals(str + 5, len - 5, u"full"))
out.AddJustification(EJustification::Full);
else if (Equals(str + 5, len - 5, u"nleft"))
out.AddJustification(EJustification::NLeft);
else if (Equals(str + 5, len - 5, u"ncenter"))
out.AddJustification(EJustification::NCenter);
else if (Equals(str + 5, len - 5, u"nright"))
out.AddJustification(EJustification::NRight);
} else if (BeginsWith(str, len, u"vjust=")) {
if (Equals(str + 6, len - 6, u"top"))
out.AddVerticalJustification(EVerticalJustification::Top);
else if (Equals(str + 6, len - 6, u"center"))
out.AddVerticalJustification(EVerticalJustification::Center);
else if (Equals(str + 6, len - 6, u"bottom"))
out.AddVerticalJustification(EVerticalJustification::Bottom);
else if (Equals(str + 6, len - 6, u"full"))
out.AddVerticalJustification(EVerticalJustification::Full);
else if (Equals(str + 6, len - 6, u"ntop"))
out.AddVerticalJustification(EVerticalJustification::NTop);
else if (Equals(str + 6, len - 6, u"ncenter"))
out.AddVerticalJustification(EVerticalJustification::NCenter);
else if (Equals(str + 6, len - 6, u"nbottom"))
out.AddVerticalJustification(EVerticalJustification::NBottom);
} else if (Equals(str, len, u"push")) {
out.AddPushState();
} else if (Equals(str, len, u"pop")) {
out.AddPopState();
}
}
CFontImageDef CTextParser::GetImage(const char16_t* str, int len,
const std::vector<std::pair<CAssetId, CAssetId>>* txtrMap) {
int commaCount = 0;
for (int i = 0; i < len; ++i)
if (str[i] == u',')
++commaCount;
if (commaCount) {
std::u16string iterable(str, len);
size_t tokenPos;
size_t commaPos;
commaPos = iterable.find(u',');
iterable[commaPos] = u'\0';
tokenPos = commaPos + 1;
auto AdvanceCommaPos = [&]() {
commaPos = iterable.find(u',', tokenPos);
if (commaPos == std::u16string::npos)
commaPos = iterable.size();
iterable[commaPos] = u'\0';
};
auto AdvanceTokenPos = [&]() { tokenPos = commaPos + 1; };
if (BeginsWith(str, len, u"A")) {
/* Animated texture array */
AdvanceCommaPos();
float interval = u16stof(&iterable[tokenPos]);
AdvanceTokenPos();
std::vector<TToken<CTexture>> texs;
texs.reserve(commaCount - 1);
do {
AdvanceCommaPos();
texs.push_back(x0_store.GetObj({SBIG('TXTR'), GetAssetIdFromString(&iterable[tokenPos], len, txtrMap)}));
AdvanceTokenPos();
} while (commaPos != iterable.size());
return CFontImageDef(texs, interval, zeus::CVector2f(1.f, 1.f));
} else if (BeginsWith(str, len, u"SA")) {
/* Scaled and animated texture array */
AdvanceCommaPos();
float interval = u16stof(&iterable[tokenPos]);
AdvanceTokenPos();
AdvanceCommaPos();
float cropX = u16stof(&iterable[tokenPos]);
AdvanceTokenPos();
AdvanceCommaPos();
float cropY = u16stof(&iterable[tokenPos]);
AdvanceTokenPos();
std::vector<TToken<CTexture>> texs;
texs.reserve(commaCount - 3);
do {
AdvanceCommaPos();
texs.push_back(x0_store.GetObj({SBIG('TXTR'), GetAssetIdFromString(&iterable[tokenPos], len, txtrMap)}));
AdvanceTokenPos();
} while (commaPos != iterable.size());
return CFontImageDef(texs, interval, zeus::CVector2f(cropX, cropY));
} else if (BeginsWith(str, len, u"SI")) {
/* Scaled single texture */
AdvanceCommaPos();
float cropX = u16stof(&iterable[tokenPos]);
AdvanceTokenPos();
AdvanceCommaPos();
float cropY = u16stof(&iterable[tokenPos]);
AdvanceTokenPos();
AdvanceCommaPos();
TToken<CTexture> tex = x0_store.GetObj({SBIG('TXTR'), GetAssetIdFromString(&iterable[tokenPos], len, txtrMap)});
AdvanceTokenPos();
return CFontImageDef(tex, zeus::CVector2f(cropX, cropY));
}
}
TToken<CTexture> tex = x0_store.GetObj({SBIG('TXTR'), GetAssetIdFromString(str, len, txtrMap)});
return CFontImageDef(tex, zeus::CVector2f(1.f, 1.f));
}
CAssetId CTextParser::GetAssetIdFromString(const char16_t* str, int len,
const std::vector<std::pair<CAssetId, CAssetId>>* txtrMap) {
u8 r = GetColorValue(str);
u8 g = GetColorValue(str + 2);
u8 b = GetColorValue(str + 4);
u8 a = GetColorValue(str + 6);
CAssetId id = ((r << 24) | (g << 16) | (b << 8) | a) & 0xffffffff;
if (len == 16) {
r = GetColorValue(str + 8);
g = GetColorValue(str + 10);
b = GetColorValue(str + 12);
a = GetColorValue(str + 14);
id = (id.Value() << 32) | (((r << 24) | (g << 16) | (b << 8) | a) & 0xffffffff);
}
if (txtrMap) {
auto search = rstl::binary_find(txtrMap->begin(), txtrMap->end(), id,
[](const std::pair<CAssetId, CAssetId>& a) { return a.first; });
if (search != txtrMap->end())
id = search->second;
}
return id;
}
TToken<CRasterFont> CTextParser::GetFont(const char16_t* str, int len) {
return x0_store.GetObj({SBIG('FONT'), GetAssetIdFromString(str, len, nullptr)});
}
void CTextParser::ParseText(CTextExecuteBuffer& out, const char16_t* str, int len,
const std::vector<std::pair<CAssetId, CAssetId>>* txtrMap) {
int b = 0, e = 0;
for (b = 0, e = 0; str[e] && (len == -1 || e < len);) {
if (str[e] != u'&') {
++e;
continue;
}
if ((len == -1 || e + 1 < len) && str[e + 1] != u'&') {
if (e > b)
out.AddString(str + b, e - b);
++e;
b = e;
while (str[e] && (len == -1 || e < len) && str[e] != u';')
++e;
ParseTag(out, str + b, e - b, txtrMap);
b = e + 1;
} else {
out.AddString(str + b, e + 1 - b);
e += 2;
b = e;
}
}
if (e > b)
out.AddString(str + b, e - b);
}
} // namespace urde
<|endoftext|>
|
<commit_before>// Filename: showBase.cxx
// Created by: shochet (02Feb00)
//
////////////////////////////////////////////////////////////////////
#include "showBase.h"
#include <throw_event.h>
#include <camera.h>
#include <renderRelation.h>
#include <namedNode.h>
#include <renderModeTransition.h>
#include <renderModeAttribute.h>
#include <textureTransition.h>
#include <textureAttribute.h>
#include <interactiveGraphicsPipe.h>
#include <graphicsWindow.h>
#include <chancfg.h>
#include <cullFaceTransition.h>
#include <cullFaceAttribute.h>
#include <dftraverser.h>
#include <renderBuffer.h>
#include <clockObject.h>
#include <animControl.h>
#include <nodeRelation.h>
#include <dataGraphTraversal.h>
#include <depthTestTransition.h>
#include <depthTestAttribute.h>
#include <depthWriteTransition.h>
#include <depthWriteAttribute.h>
#include <lightTransition.h>
#include <materialTransition.h>
#include <camera.h>
#include <frustum.h>
#include <orthoProjection.h>
#include <appTraverser.h>
#include <get_config_path.h>
#include <allAttributesWrapper.h>
#include <dataGraphTraversal.h>
ConfigureDef(config_showbase);
ConfigureFn(config_showbase) {
}
DSearchPath &
get_particle_path() {
static DSearchPath *particle_path = NULL;
return get_config_path("particle-path", particle_path);
}
// Default channel config
std::string chan_config = "single";
std::string window_title = "Panda3D";
void render_frame(GraphicsPipe *pipe,
NodeAttributes &initial_state) {
int num_windows = pipe->get_num_windows();
for (int w = 0; w < num_windows; w++) {
GraphicsWindow *win = pipe->get_window(w);
win->get_gsg()->render_frame(initial_state);
}
ClockObject::get_global_clock()->tick();
throw_event("NewFrame");
}
class WindowCallback : public GraphicsWindow::Callback {
public:
WindowCallback(GraphicsPipe *pipe, Node *render,
NodeAttributes *initial_state) :
_pipe(pipe),
_render(render),
_initial_state(initial_state),
_app_traverser(RenderRelation::get_class_type()) { }
virtual ~WindowCallback() { }
virtual void draw(bool) {
_app_traverser.traverse(_render);
render_frame(_pipe, *_initial_state);
}
virtual void idle(void) {
}
PT(GraphicsPipe) _pipe;
PT(Node) _render;
NodeAttributes *_initial_state;
AppTraverser _app_traverser;
};
PT(GraphicsPipe) make_graphics_pipe() {
PT(GraphicsPipe) main_pipe;
// load display modules
GraphicsPipe::resolve_modules();
nout << "Known pipe types:" << endl;
GraphicsPipe::get_factory().write_types(nout, 2);
// Create a window
main_pipe = GraphicsPipe::get_factory().
make_instance(InteractiveGraphicsPipe::get_class_type());
if (main_pipe == (GraphicsPipe*)0L) {
nout << "No interactive pipe is available! Check your Configrc!\n";
return NULL;
}
nout << "Opened a '" << main_pipe->get_type().get_name()
<< "' interactive graphics pipe." << endl;
return main_pipe;
}
PT(GraphicsWindow) make_graphics_window(GraphicsPipe *pipe,
NamedNode *render,
NamedNode *camera,
NodeAttributes &initial_state) {
PT(GraphicsWindow) main_win;
ChanCfgOverrides override;
// Turn on backface culling
CullFaceAttribute *cfa = new CullFaceAttribute;
cfa->set_mode(CullFaceProperty::M_cull_clockwise);
initial_state.set_attribute(CullFaceTransition::get_class_type(), cfa);
DepthTestAttribute *dta = new DepthTestAttribute;
initial_state.set_attribute(DepthTestTransition::get_class_type(), dta);
DepthWriteAttribute *dwa = new DepthWriteAttribute;
initial_state.set_attribute(DepthWriteTransition::get_class_type(), dwa);
override.setField(ChanCfgOverrides::Mask,
((unsigned int)(W_DOUBLE|W_DEPTH|W_MULTISAMPLE)));
std::string title = config_showbase.GetString("window-title", window_title);
override.setField(ChanCfgOverrides::Title, title);
std::string conf = config_showbase.GetString("chan-config", chan_config);
main_win = ChanConfig(pipe, conf, camera, render, override);
assert(main_win != (GraphicsWindow*)0L);
WindowCallback *wcb =
new WindowCallback(pipe, render, &initial_state);
// Set draw and idle callbacks
main_win->set_draw_callback(wcb);
main_win->set_idle_callback(wcb);
return main_win;
}
// Create a scene graph, associated with the indicated window, that
// can contain 2-d geometry and will be rendered on top of the
// existing 3-d window. Returns the top node of the scene graph.
NodePath
setup_panda_2d(GraphicsWindow *win, const string &graph_name) {
PT(Node) render2d_top;
render2d_top = new NamedNode(graph_name + "_top");
Node *render2d = new NamedNode(graph_name);
RenderRelation *render2d_arc = new RenderRelation(render2d_top, render2d);
// Set up some overrides to turn off certain properties which we
// probably won't need for 2-d objects.
// It's particularly important to turn off the depth test, since
// we'll be keeping the same depth buffer already filled by the
// previously-drawn 3-d scene--we don't want to pay for a clear
// operation, but we also don't want to collide with that depth
// buffer.
render2d_arc->set_transition(new DepthTestTransition(DepthTestProperty::M_none), 1);
render2d_arc->set_transition(new DepthWriteTransition(DepthWriteTransition::off()), 1);
render2d_arc->set_transition(new LightTransition(LightTransition::all_off()), 1);
render2d_arc->set_transition(new MaterialTransition(MaterialTransition::off()), 1);
render2d_arc->set_transition(new CullFaceTransition(CullFaceProperty::M_cull_none), 1);
// Create a 2-d camera.
Camera *cam2d = new Camera("cam2d");
new RenderRelation(render2d, cam2d);
Frustumf frustum2d;
frustum2d.make_ortho(-1000,1000);
cam2d->set_projection(OrthoProjection(frustum2d));
add_render_layer(win, render2d_top, cam2d);
NodePath render2d_np = NodePath();
render2d_np.extend_by(render2d_arc);
return render2d_np;
}
// Create an auxiliary scene graph starting at the indicated node,
// layered on top of the previously-created layers.
void
add_render_layer(GraphicsWindow *win, Node *render_top, Camera *camera) {
GraphicsChannel *chan = win->get_channel(0);
nassertv(chan != (GraphicsChannel *)NULL);
GraphicsLayer *layer = chan->make_layer();
nassertv(layer != (GraphicsLayer *)NULL);
DisplayRegion *dr = layer->make_display_region();
nassertv(dr != (DisplayRegion *)NULL);
camera->set_scene(render_top);
dr->set_camera(camera);
}
void
toggle_wireframe(NodeAttributes &initial_state) {
static bool wireframe_mode = false;
wireframe_mode = !wireframe_mode;
if (!wireframe_mode) {
// Set the normal, filled mode on the render arc.
RenderModeAttribute *rma = new RenderModeAttribute;
rma->set_mode(RenderModeProperty::M_filled);
CullFaceAttribute *cfa = new CullFaceAttribute;
cfa->set_mode(CullFaceProperty::M_cull_clockwise);
initial_state.set_attribute(RenderModeTransition::get_class_type(), rma);
initial_state.set_attribute(CullFaceTransition::get_class_type(), cfa);
} else {
// Set the initial state up for wireframe mode.
RenderModeAttribute *rma = new RenderModeAttribute;
rma->set_mode(RenderModeProperty::M_wireframe);
CullFaceAttribute *cfa = new CullFaceAttribute;
cfa->set_mode(CullFaceProperty::M_cull_none);
initial_state.set_attribute(RenderModeTransition::get_class_type(), rma);
initial_state.set_attribute(CullFaceTransition::get_class_type(), cfa);
}
}
void
toggle_backface(NodeAttributes &initial_state) {
static bool backface_mode = false;
// Toggle the state variable
backface_mode = !backface_mode;
if (backface_mode) {
// Turn backface culling off
CullFaceAttribute *cfa = new CullFaceAttribute;
cfa->set_mode(CullFaceProperty::M_cull_none);
initial_state.set_attribute(CullFaceTransition::get_class_type(), cfa);
} else {
// Turn backface culling on
CullFaceAttribute *cfa = new CullFaceAttribute;
cfa->set_mode(CullFaceProperty::M_cull_clockwise);
initial_state.set_attribute(CullFaceTransition::get_class_type(), cfa);
}
}
void toggle_texture(NodeAttributes &initial_state) {
static bool textures_enabled = true;
textures_enabled = !textures_enabled;
if (textures_enabled) {
// Remove the override from the initial state.
initial_state.clear_attribute(TextureTransition::get_class_type());
} else {
// Set an override on the initial state to disable texturing.
TextureAttribute *ta = new TextureAttribute;
ta->set_priority(100);
initial_state.set_attribute(TextureTransition::get_class_type(), ta);
}
}
void take_snapshot(GraphicsWindow *win, const string &name) {
GraphicsStateGuardian* gsg = win->get_gsg();
const RenderBuffer& rb = gsg->get_render_buffer(RenderBuffer::T_front);
// CPT(DisplayRegion) dr = gsg->get_current_display_region();
CPT(DisplayRegion) dr = win->get_channel(0)->get_layer(0)->get_dr(0);
nassertv(dr != (DisplayRegion *)NULL);
int width = dr->get_pixel_width();
int height = dr->get_pixel_height();
PixelBuffer p(width, height, 3, 1, PixelBuffer::T_unsigned_byte,
PixelBuffer::F_rgb);
p.copy(gsg, dr, rb);
p.write(name.c_str());
}
// Returns the configure object for accessing config variables from a
// scripting language.
ConfigShowbase &
get_config_showbase() {
return config_showbase;
}
<commit_msg>trivial<commit_after>// Filename: showBase.cxx
// Created by: shochet (02Feb00)
//
////////////////////////////////////////////////////////////////////
#include "showBase.h"
#include <throw_event.h>
#include <camera.h>
#include <renderRelation.h>
#include <namedNode.h>
#include <renderModeTransition.h>
#include <renderModeAttribute.h>
#include <textureTransition.h>
#include <textureAttribute.h>
#include <interactiveGraphicsPipe.h>
#include <graphicsWindow.h>
#include <chancfg.h>
#include <cullFaceTransition.h>
#include <cullFaceAttribute.h>
#include <dftraverser.h>
#include <renderBuffer.h>
#include <clockObject.h>
#include <animControl.h>
#include <nodeRelation.h>
#include <dataGraphTraversal.h>
#include <depthTestTransition.h>
#include <depthTestAttribute.h>
#include <depthWriteTransition.h>
#include <depthWriteAttribute.h>
#include <lightTransition.h>
#include <materialTransition.h>
#include <camera.h>
#include <frustum.h>
#include <orthoProjection.h>
#include <appTraverser.h>
#include <get_config_path.h>
#include <allAttributesWrapper.h>
#include <dataGraphTraversal.h>
ConfigureDef(config_showbase);
ConfigureFn(config_showbase) {
}
DSearchPath &
get_particle_path() {
static DSearchPath *particle_path = NULL;
return get_config_path("particle-path", particle_path);
}
// Default channel config
std::string chan_config = "single";
std::string window_title = "Panda3D";
void render_frame(GraphicsPipe *pipe,
NodeAttributes &initial_state) {
int num_windows = pipe->get_num_windows();
for (int w = 0; w < num_windows; w++) {
GraphicsWindow *win = pipe->get_window(w);
win->get_gsg()->render_frame(initial_state);
}
ClockObject::get_global_clock()->tick();
throw_event("NewFrame");
}
class WindowCallback : public GraphicsWindow::Callback {
public:
WindowCallback(GraphicsPipe *pipe, Node *render,
NodeAttributes *initial_state) :
_pipe(pipe),
_render(render),
_initial_state(initial_state),
_app_traverser(RenderRelation::get_class_type()) { }
virtual ~WindowCallback() { }
virtual void draw(bool) {
_app_traverser.traverse(_render);
render_frame(_pipe, *_initial_state);
}
virtual void idle(void) {
}
PT(GraphicsPipe) _pipe;
PT(Node) _render;
NodeAttributes *_initial_state;
AppTraverser _app_traverser;
};
PT(GraphicsPipe) make_graphics_pipe() {
PT(GraphicsPipe) main_pipe;
// load display modules
GraphicsPipe::resolve_modules();
nout << "Known pipe types:" << endl;
GraphicsPipe::get_factory().write_types(nout, 2);
// Create a window
main_pipe = GraphicsPipe::get_factory().
make_instance(InteractiveGraphicsPipe::get_class_type());
if (main_pipe == (GraphicsPipe*)0L) {
nout << "No interactive pipe is available! Check your Configrc!\n";
return NULL;
}
nout << "Opened a '" << main_pipe->get_type().get_name()
<< "' interactive graphics pipe." << endl;
return main_pipe;
}
PT(GraphicsWindow) make_graphics_window(GraphicsPipe *pipe,
NamedNode *render,
NamedNode *camera,
NodeAttributes &initial_state) {
PT(GraphicsWindow) main_win;
ChanCfgOverrides override;
// Turn on backface culling
CullFaceAttribute *cfa = new CullFaceAttribute;
cfa->set_mode(CullFaceProperty::M_cull_clockwise);
initial_state.set_attribute(CullFaceTransition::get_class_type(), cfa);
DepthTestAttribute *dta = new DepthTestAttribute;
initial_state.set_attribute(DepthTestTransition::get_class_type(), dta);
DepthWriteAttribute *dwa = new DepthWriteAttribute;
initial_state.set_attribute(DepthWriteTransition::get_class_type(), dwa);
override.setField(ChanCfgOverrides::Mask,
((unsigned int)(W_DOUBLE|W_DEPTH|W_MULTISAMPLE)));
std::string title = config_showbase.GetString("window-title", window_title);
override.setField(ChanCfgOverrides::Title, title);
std::string conf = config_showbase.GetString("chan-config", chan_config);
main_win = ChanConfig(pipe, conf, camera, render, override);
assert(main_win != (GraphicsWindow*)0L);
WindowCallback *wcb =
new WindowCallback(pipe, render, &initial_state);
// Set draw and idle callbacks
main_win->set_draw_callback(wcb);
main_win->set_idle_callback(wcb);
return main_win;
}
// Create a scene graph, associated with the indicated window, that
// can contain 2-d geometry and will be rendered on top of the
// existing 3-d window. Returns the top node of the scene graph.
NodePath
setup_panda_2d(GraphicsWindow *win, const string &graph_name) {
PT(Node) render2d_top;
render2d_top = new NamedNode(graph_name + "_top");
Node *render2d = new NamedNode(graph_name);
RenderRelation *render2d_arc = new RenderRelation(render2d_top, render2d);
// Set up some overrides to turn off certain properties which we
// probably won't need for 2-d objects.
// It's particularly important to turn off the depth test, since
// we'll be keeping the same depth buffer already filled by the
// previously-drawn 3-d scene--we don't want to pay for a clear
// operation, but we also don't want to collide with that depth
// buffer.
render2d_arc->set_transition(new DepthTestTransition(DepthTestProperty::M_none), 1);
render2d_arc->set_transition(new DepthWriteTransition(DepthWriteTransition::off()), 1);
render2d_arc->set_transition(new LightTransition(LightTransition::all_off()), 1);
render2d_arc->set_transition(new MaterialTransition(MaterialTransition::off()), 1);
render2d_arc->set_transition(new CullFaceTransition(CullFaceProperty::M_cull_none), 1);
// Create a 2-d camera.
Camera *cam2d = new Camera("cam2d");
new RenderRelation(render2d, cam2d);
Frustumf frustum2d;
frustum2d.make_ortho(-1000,1000);
cam2d->set_projection(OrthoProjection(frustum2d));
add_render_layer(win, render2d_top, cam2d);
NodePath render2d_np = NodePath();
render2d_np.extend_by(render2d_arc);
return render2d_np;
}
// Create an auxiliary scene graph starting at the indicated node,
// layered on top of the previously-created layers.
void
add_render_layer(GraphicsWindow *win, Node *render_top, Camera *camera) {
GraphicsChannel *chan = win->get_channel(0);
nassertv(chan != (GraphicsChannel *)NULL);
GraphicsLayer *layer = chan->make_layer();
nassertv(layer != (GraphicsLayer *)NULL);
DisplayRegion *dr = layer->make_display_region();
nassertv(dr != (DisplayRegion *)NULL);
camera->set_scene(render_top);
dr->set_camera(camera);
}
void
toggle_wireframe(NodeAttributes &initial_state) {
static bool wireframe_mode = false;
wireframe_mode = !wireframe_mode;
if (!wireframe_mode) {
// Set the normal, filled mode on the render arc.
RenderModeAttribute *rma = new RenderModeAttribute;
rma->set_mode(RenderModeProperty::M_filled);
CullFaceAttribute *cfa = new CullFaceAttribute;
cfa->set_mode(CullFaceProperty::M_cull_clockwise);
initial_state.set_attribute(RenderModeTransition::get_class_type(), rma);
initial_state.set_attribute(CullFaceTransition::get_class_type(), cfa);
} else {
// Set the initial state up for wireframe mode.
RenderModeAttribute *rma = new RenderModeAttribute;
rma->set_mode(RenderModeProperty::M_wireframe);
CullFaceAttribute *cfa = new CullFaceAttribute;
cfa->set_mode(CullFaceProperty::M_cull_none);
initial_state.set_attribute(RenderModeTransition::get_class_type(), rma);
initial_state.set_attribute(CullFaceTransition::get_class_type(), cfa);
}
}
void
toggle_backface(NodeAttributes &initial_state) {
static bool backface_mode = false;
// Toggle the state variable
backface_mode = !backface_mode;
if (backface_mode) {
// Turn backface culling off
CullFaceAttribute *cfa = new CullFaceAttribute;
cfa->set_mode(CullFaceProperty::M_cull_none);
initial_state.set_attribute(CullFaceTransition::get_class_type(), cfa);
} else {
// Turn backface culling on
CullFaceAttribute *cfa = new CullFaceAttribute;
cfa->set_mode(CullFaceProperty::M_cull_clockwise);
initial_state.set_attribute(CullFaceTransition::get_class_type(), cfa);
}
}
void toggle_texture(NodeAttributes &initial_state) {
static bool textures_enabled = true;
textures_enabled = !textures_enabled;
if (textures_enabled) {
// Remove the override from the initial state.
initial_state.clear_attribute(TextureTransition::get_class_type());
} else {
// Set an override on the initial state to disable texturing.
TextureAttribute *ta = new TextureAttribute;
ta->set_priority(100);
initial_state.set_attribute(TextureTransition::get_class_type(), ta);
}
}
void take_snapshot(GraphicsWindow *win, const string &name) {
GraphicsStateGuardian* gsg = win->get_gsg();
const RenderBuffer& rb = gsg->get_render_buffer(RenderBuffer::T_front);
// CPT(DisplayRegion) dr = gsg->get_current_display_region();
CPT(DisplayRegion) dr = win->get_channel(0)->get_layer(0)->get_dr(0);
nassertv(dr != (DisplayRegion *)NULL);
int width = dr->get_pixel_width();
int height = dr->get_pixel_height();
PixelBuffer p(width, height, 3, 1, PixelBuffer::T_unsigned_byte,
PixelBuffer::F_rgb);
p.copy(gsg, dr, rb);
p.write(name);
}
// Returns the configure object for accessing config variables from a
// scripting language.
ConfigShowbase &
get_config_showbase() {
return config_showbase;
}
<|endoftext|>
|
<commit_before>/*
Copyright (c) 2007 Volker Krause <vkrause@kde.org>
This library is free software; you can redistribute it and/or modify it
under the terms of the GNU Library General Public License as published by
the Free Software Foundation; either version 2 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 Library General Public
License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to the
Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.
*/
#include "notificationmessage_p.h"
#include "imapparser_p.h"
#include <QtCore/QDebug>
#include <QtCore/QHash>
#include <QtDBus/QDBusMetaType>
using namespace Akonadi;
class NotificationMessage::Private : public QSharedData
{
public:
Private()
: QSharedData(),
type( NotificationMessage::InvalidType ),
operation( NotificationMessage::InvalidOp ),
uid( -1 ),
parentCollection( -1 ),
parentDestCollection( -1 )
{
}
Private( const Private &other )
: QSharedData( other )
{
sessionId = other.sessionId;
type = other.type;
operation = other.operation;
uid = other.uid;
remoteId = other.remoteId;
resource = other.resource;
destResource = other.destResource;
parentCollection = other.parentCollection;
parentDestCollection = other.parentDestCollection;
mimeType = other.mimeType;
parts = other.parts;
}
bool compareWithoutOpAndParts( const Private &other ) const
{
return uid == other.uid
&& type == other.type
&& sessionId == other.sessionId
&& remoteId == other.remoteId
&& resource == other.resource
&& destResource == other.destResource
&& parentCollection == other.parentCollection
&& parentDestCollection == other.parentDestCollection
&& mimeType == other.mimeType;
}
bool operator==( const Private &other ) const
{
return operation == other.operation && parts == other.parts && compareWithoutOpAndParts( other );
}
QByteArray sessionId;
NotificationMessage::Type type;
NotificationMessage::Operation operation;
Id uid;
QString remoteId;
QByteArray resource;
QByteArray destResource;
Id parentCollection;
Id parentDestCollection;
QString mimeType;
QSet<QByteArray> parts;
};
NotificationMessage::NotificationMessage()
: d( new Private )
{
}
NotificationMessage::NotificationMessage( const NotificationMessage &other )
: d( other.d )
{
}
NotificationMessage::~NotificationMessage()
{
}
NotificationMessage& NotificationMessage::operator=( const NotificationMessage &other )
{
if ( this != &other )
d = other.d;
return *this;
}
bool NotificationMessage::operator==( const NotificationMessage &other ) const
{
return d == other.d;
}
void NotificationMessage::registerDBusTypes()
{
qDBusRegisterMetaType<Akonadi::NotificationMessage>();
qDBusRegisterMetaType<Akonadi::NotificationMessage::List>();
}
QByteArray NotificationMessage::sessionId() const
{
return d->sessionId;
}
void NotificationMessage::setSessionId( const QByteArray &sessionId )
{
d->sessionId = sessionId;
}
NotificationMessage::Type NotificationMessage::type() const
{
return d->type;
}
void NotificationMessage::setType( Type type )
{
d->type = type;
}
NotificationMessage::Operation NotificationMessage::operation() const
{
return d->operation;
}
void NotificationMessage::setOperation( Operation operation )
{
d->operation = operation;
}
NotificationMessage::Id NotificationMessage::uid() const
{
return d->uid;
}
void NotificationMessage::setUid( Id uid )
{
d->uid = uid;
}
QString NotificationMessage::remoteId() const
{
return d->remoteId;
}
void NotificationMessage::setRemoteId( const QString &remoteId )
{
d->remoteId = remoteId;
}
QByteArray NotificationMessage::resource() const
{
return d->resource;
}
void NotificationMessage::setResource( const QByteArray &resource )
{
d->resource = resource;
}
NotificationMessage::Id NotificationMessage::parentCollection() const
{
return d->parentCollection;
}
NotificationMessage::Id NotificationMessage::parentDestCollection() const
{
return d->parentDestCollection;
}
void NotificationMessage::setParentCollection( Id parent )
{
d->parentCollection = parent;
}
void NotificationMessage::setParentDestCollection( Id parent )
{
d->parentDestCollection = parent;
}
void NotificationMessage::setDestinationResource( const QByteArray &destResource )
{
d->destResource = destResource;
}
QByteArray NotificationMessage::destinationResource() const
{
return d->destResource;
}
QString NotificationMessage::mimeType() const
{
return d->mimeType;
}
void NotificationMessage::setMimeType( const QString &mimeType )
{
d->mimeType = mimeType;
}
QSet<QByteArray> NotificationMessage::itemParts() const
{
return d->parts;
}
void NotificationMessage::setItemParts( const QSet<QByteArray> &parts )
{
d->parts = parts;
}
QString NotificationMessage::toString() const
{
QString rv;
switch ( type() ) {
case Item:
rv += QLatin1String( "Item " );
break;
case Collection:
rv += QLatin1String( "Collection " );
break;
case InvalidType: // TODO: an error?
break;
}
rv += QString::fromLatin1( "(%1, %2) " ).arg( uid() ).arg( remoteId() );
if ( parentDestCollection() >= 0 )
rv += QString::fromLatin1( "from " );
else
rv += QString::fromLatin1( "in " );
if ( parentCollection() >= 0 )
rv += QString::fromLatin1( "collection %1 " ).arg( parentCollection() );
switch ( operation() ) {
case Add:
rv += QLatin1String( "added" );
break;
case Modify:
rv += QLatin1String( "modified parts (" );
rv += QString::fromLatin1( ImapParser::join( itemParts().toList(), ", " ) );
rv += QLatin1String( ")" );
break;
case Move:
rv += QLatin1String( "moved" );
break;
case Remove:
rv += QLatin1String( "removed" );
break;
case Link:
rv += QLatin1String( "linked" );
break;
case Unlink:
rv += QLatin1String( "unlinked" );
break;
case Subscribe:
rv += QLatin1String( "subscribed" );
break;
case Unsubscribe:
rv += QLatin1String( "unsubscribed" );
break;
case InvalidOp: // TODO: an error?
break;
}
if ( parentDestCollection() >= 0 )
rv += QString::fromLatin1( "to collection %1" ).arg( parentDestCollection() );
return rv;
}
void NotificationMessage::appendAndCompress( NotificationMessage::List &list, const NotificationMessage &msg )
{
bool appended;
appendAndCompress( list, msg, &appended );
}
void NotificationMessage::appendAndCompress( NotificationMessage::List &list, const NotificationMessage &msg, bool *appended )
{
// fast-path for stuff that is not considered during O(n) compression below
if ( msg.operation() != Add && msg.operation() != Link && msg.operation() != Unlink && msg.operation() != Subscribe && msg.operation() != Unsubscribe && msg.operation() != Move ) {
NotificationMessage::List::Iterator end = list.end();
for ( NotificationMessage::List::Iterator it = list.begin(); it != end; ) {
if ( msg.d.constData()->compareWithoutOpAndParts( *((*it).d.constData()) ) ) {
// same operation: merge changed parts and drop the new one
if ( msg.operation() == (*it).operation() ) {
(*it).setItemParts( (*it).itemParts() + msg.itemParts() );
*appended = false;
return;
}
// new one is a modification, the existing one not, so drop the new one
else if ( msg.operation() == Modify ) {
*appended = false;
return;
}
// new on is a deletion, erase the existing modification ones (and keep going, in case there are more)
else if ( msg.operation() == Remove && (*it).operation() == Modify ) {
it = list.erase( it );
end = list.end();
}
// keep looking
else {
++it;
}
} else {
++it;
}
}
}
*appended = true;
list.append( msg );
}
QDBusArgument& operator<<( QDBusArgument &arg, const NotificationMessage &msg )
{
arg.beginStructure();
arg << msg.sessionId();
arg << msg.type();
arg << msg.operation();
arg << msg.uid();
arg << msg.remoteId();
arg << msg.resource();
arg << msg.parentCollection();
arg << msg.parentDestCollection();
arg << msg.mimeType();
QStringList itemParts;
if ( msg.operation() == NotificationMessage::Move ) {
// encode destination resource in parts, as a backward compat hack
itemParts.push_back( QString::fromLatin1( msg.destinationResource() ) );
} else {
Q_FOREACH ( const QByteArray &itemPart, msg.itemParts() )
itemParts.append( QString::fromLatin1( itemPart ) );
}
arg << itemParts;
arg.endStructure();
return arg;
}
const QDBusArgument& operator>>( const QDBusArgument &arg, NotificationMessage &msg )
{
arg.beginStructure();
QByteArray b;
arg >> b;
msg.setSessionId( b );
int i;
arg >> i;
msg.setType( static_cast<NotificationMessage::Type>( i ) );
arg >> i;
msg.setOperation( static_cast<NotificationMessage::Operation>( i ) );
NotificationMessage::Id id;
arg >> id;
msg.setUid( id );
QString s;
arg >> s;
msg.setRemoteId( s );
arg >> b;
msg.setResource( b );
arg >> id;
msg.setParentCollection( id );
arg >> id;
msg.setParentDestCollection( id );
arg >> s;
msg.setMimeType( s );
QStringList l;
arg >> l;
QSet<QByteArray> itemParts;
if ( msg.operation() == NotificationMessage::Move && l.size() >= 1 ) {
// decode destination resource, which is stored in parts as a backward compat hack
msg.setDestinationResource( l.first().toLatin1() );
} else {
Q_FOREACH ( const QString &itemPart, l )
itemParts.insert( itemPart.toLatin1() );
}
msg.setItemParts( itemParts );
arg.endStructure();
return arg;
}
uint qHash( const Akonadi::NotificationMessage &msg )
{
return qHash( msg.uid() + (msg.type() << 31) + (msg.operation() << 28) );
}
<commit_msg>to get a better message, #108582<commit_after>/*
Copyright (c) 2007 Volker Krause <vkrause@kde.org>
This library is free software; you can redistribute it and/or modify it
under the terms of the GNU Library General Public License as published by
the Free Software Foundation; either version 2 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 Library General Public
License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to the
Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.
*/
#include "notificationmessage_p.h"
#include "imapparser_p.h"
#include <QtCore/QDebug>
#include <QtCore/QHash>
#include <QtDBus/QDBusMetaType>
using namespace Akonadi;
class NotificationMessage::Private : public QSharedData
{
public:
Private()
: QSharedData(),
type( NotificationMessage::InvalidType ),
operation( NotificationMessage::InvalidOp ),
uid( -1 ),
parentCollection( -1 ),
parentDestCollection( -1 )
{
}
Private( const Private &other )
: QSharedData( other )
{
sessionId = other.sessionId;
type = other.type;
operation = other.operation;
uid = other.uid;
remoteId = other.remoteId;
resource = other.resource;
destResource = other.destResource;
parentCollection = other.parentCollection;
parentDestCollection = other.parentDestCollection;
mimeType = other.mimeType;
parts = other.parts;
}
bool compareWithoutOpAndParts( const Private &other ) const
{
return uid == other.uid
&& type == other.type
&& sessionId == other.sessionId
&& remoteId == other.remoteId
&& resource == other.resource
&& destResource == other.destResource
&& parentCollection == other.parentCollection
&& parentDestCollection == other.parentDestCollection
&& mimeType == other.mimeType;
}
bool operator==( const Private &other ) const
{
return operation == other.operation && parts == other.parts && compareWithoutOpAndParts( other );
}
QByteArray sessionId;
NotificationMessage::Type type;
NotificationMessage::Operation operation;
Id uid;
QString remoteId;
QByteArray resource;
QByteArray destResource;
Id parentCollection;
Id parentDestCollection;
QString mimeType;
QSet<QByteArray> parts;
};
NotificationMessage::NotificationMessage()
: d( new Private )
{
}
NotificationMessage::NotificationMessage( const NotificationMessage &other )
: d( other.d )
{
}
NotificationMessage::~NotificationMessage()
{
}
NotificationMessage& NotificationMessage::operator=( const NotificationMessage &other )
{
if ( this != &other )
d = other.d;
return *this;
}
bool NotificationMessage::operator==( const NotificationMessage &other ) const
{
return d == other.d;
}
void NotificationMessage::registerDBusTypes()
{
qDBusRegisterMetaType<Akonadi::NotificationMessage>();
qDBusRegisterMetaType<Akonadi::NotificationMessage::List>();
}
QByteArray NotificationMessage::sessionId() const
{
return d->sessionId;
}
void NotificationMessage::setSessionId( const QByteArray &sessionId )
{
d->sessionId = sessionId;
}
NotificationMessage::Type NotificationMessage::type() const
{
return d->type;
}
void NotificationMessage::setType( Type type )
{
d->type = type;
}
NotificationMessage::Operation NotificationMessage::operation() const
{
return d->operation;
}
void NotificationMessage::setOperation( Operation operation )
{
d->operation = operation;
}
NotificationMessage::Id NotificationMessage::uid() const
{
return d->uid;
}
void NotificationMessage::setUid( Id uid )
{
d->uid = uid;
}
QString NotificationMessage::remoteId() const
{
return d->remoteId;
}
void NotificationMessage::setRemoteId( const QString &remoteId )
{
d->remoteId = remoteId;
}
QByteArray NotificationMessage::resource() const
{
return d->resource;
}
void NotificationMessage::setResource( const QByteArray &resource )
{
d->resource = resource;
}
NotificationMessage::Id NotificationMessage::parentCollection() const
{
return d->parentCollection;
}
NotificationMessage::Id NotificationMessage::parentDestCollection() const
{
return d->parentDestCollection;
}
void NotificationMessage::setParentCollection( Id parent )
{
d->parentCollection = parent;
}
void NotificationMessage::setParentDestCollection( Id parent )
{
d->parentDestCollection = parent;
}
void NotificationMessage::setDestinationResource( const QByteArray &destResource )
{
d->destResource = destResource;
}
QByteArray NotificationMessage::destinationResource() const
{
return d->destResource;
}
QString NotificationMessage::mimeType() const
{
return d->mimeType;
}
void NotificationMessage::setMimeType( const QString &mimeType )
{
d->mimeType = mimeType;
}
QSet<QByteArray> NotificationMessage::itemParts() const
{
return d->parts;
}
void NotificationMessage::setItemParts( const QSet<QByteArray> &parts )
{
d->parts = parts;
}
QString NotificationMessage::toString() const
{
QString rv;
switch ( type() ) {
case Item:
rv += QLatin1String( "Item " );
break;
case Collection:
rv += QLatin1String( "Collection " );
break;
case InvalidType: // TODO: an error?
break;
}
rv += QString::fromLatin1( "(%1, %2) " ).arg( uid() ).arg( remoteId() );
if ( parentDestCollection() >= 0 )
rv += QString::fromLatin1( "from " );
else
rv += QString::fromLatin1( "in " );
if ( parentCollection() >= 0 )
rv += QString::fromLatin1( "collection %1 " ).arg( parentCollection() );
switch ( operation() ) {
case Add:
rv += QLatin1String( "added" );
break;
case Modify:
rv += QLatin1String( "modified parts (" );
rv += QString::fromLatin1( ImapParser::join( itemParts().toList(), ", " ) );
rv += QLatin1String( ")" );
break;
case Move:
rv += QLatin1String( "moved" );
break;
case Remove:
rv += QLatin1String( "removed" );
break;
case Link:
rv += QLatin1String( "linked" );
break;
case Unlink:
rv += QLatin1String( "unlinked" );
break;
case Subscribe:
rv += QLatin1String( "subscribed" );
break;
case Unsubscribe:
rv += QLatin1String( "unsubscribed" );
break;
case InvalidOp: // TODO: an error?
break;
}
if ( parentDestCollection() >= 0 )
rv += QString::fromLatin1( " to collection %1" ).arg( parentDestCollection() );
return rv;
}
void NotificationMessage::appendAndCompress( NotificationMessage::List &list, const NotificationMessage &msg )
{
bool appended;
appendAndCompress( list, msg, &appended );
}
void NotificationMessage::appendAndCompress( NotificationMessage::List &list, const NotificationMessage &msg, bool *appended )
{
// fast-path for stuff that is not considered during O(n) compression below
if ( msg.operation() != Add && msg.operation() != Link && msg.operation() != Unlink && msg.operation() != Subscribe && msg.operation() != Unsubscribe && msg.operation() != Move ) {
NotificationMessage::List::Iterator end = list.end();
for ( NotificationMessage::List::Iterator it = list.begin(); it != end; ) {
if ( msg.d.constData()->compareWithoutOpAndParts( *((*it).d.constData()) ) ) {
// same operation: merge changed parts and drop the new one
if ( msg.operation() == (*it).operation() ) {
(*it).setItemParts( (*it).itemParts() + msg.itemParts() );
*appended = false;
return;
}
// new one is a modification, the existing one not, so drop the new one
else if ( msg.operation() == Modify ) {
*appended = false;
return;
}
// new on is a deletion, erase the existing modification ones (and keep going, in case there are more)
else if ( msg.operation() == Remove && (*it).operation() == Modify ) {
it = list.erase( it );
end = list.end();
}
// keep looking
else {
++it;
}
} else {
++it;
}
}
}
*appended = true;
list.append( msg );
}
QDBusArgument& operator<<( QDBusArgument &arg, const NotificationMessage &msg )
{
arg.beginStructure();
arg << msg.sessionId();
arg << msg.type();
arg << msg.operation();
arg << msg.uid();
arg << msg.remoteId();
arg << msg.resource();
arg << msg.parentCollection();
arg << msg.parentDestCollection();
arg << msg.mimeType();
QStringList itemParts;
if ( msg.operation() == NotificationMessage::Move ) {
// encode destination resource in parts, as a backward compat hack
itemParts.push_back( QString::fromLatin1( msg.destinationResource() ) );
} else {
Q_FOREACH ( const QByteArray &itemPart, msg.itemParts() )
itemParts.append( QString::fromLatin1( itemPart ) );
}
arg << itemParts;
arg.endStructure();
return arg;
}
const QDBusArgument& operator>>( const QDBusArgument &arg, NotificationMessage &msg )
{
arg.beginStructure();
QByteArray b;
arg >> b;
msg.setSessionId( b );
int i;
arg >> i;
msg.setType( static_cast<NotificationMessage::Type>( i ) );
arg >> i;
msg.setOperation( static_cast<NotificationMessage::Operation>( i ) );
NotificationMessage::Id id;
arg >> id;
msg.setUid( id );
QString s;
arg >> s;
msg.setRemoteId( s );
arg >> b;
msg.setResource( b );
arg >> id;
msg.setParentCollection( id );
arg >> id;
msg.setParentDestCollection( id );
arg >> s;
msg.setMimeType( s );
QStringList l;
arg >> l;
QSet<QByteArray> itemParts;
if ( msg.operation() == NotificationMessage::Move && l.size() >= 1 ) {
// decode destination resource, which is stored in parts as a backward compat hack
msg.setDestinationResource( l.first().toLatin1() );
} else {
Q_FOREACH ( const QString &itemPart, l )
itemParts.insert( itemPart.toLatin1() );
}
msg.setItemParts( itemParts );
arg.endStructure();
return arg;
}
uint qHash( const Akonadi::NotificationMessage &msg )
{
return qHash( msg.uid() + (msg.type() << 31) + (msg.operation() << 28) );
}
<|endoftext|>
|
<commit_before>#include "crashhandler.hpp"
#if (defined(WIN32) || defined(_WIN32) || defined(__WIN32__) && !defined(__GNUC__))
#error "crashhandler_unix.cpp is used on a non-UNIX platform"
#endif
#include <csignal>
#include <cstring>
#include <unistd.h>
#include <execinfo.h>
#include <cxxabi.h>
#include <cstdlib>
#include <sstream>
#include <iostream>
#include <thread>
#include <atomic>
#include <map>
#include <mutex>
#include <fmt/format.h>
// Linux/Clang, OSX/Clang, OSX/gcc
#if (defined(__clang__) || defined(__APPLE__))
#include <sys/ucontext.h>
#else
#include <ucontext.h>
#endif
#include "CLogger.hpp"
namespace
{
const std::map<crashhandler::Signal, std::string> Signals = {
{SIGABRT, "SIGABRT"},
{SIGFPE, "SIGFPE"},
{SIGILL, "SIGILL"},
{SIGSEGV, "SIGSEGV"},
{SIGTERM, "SIGTERM"},
};
std::map<crashhandler::Signal, struct sigaction> OldSignalActions;
bool IsFirstSignal()
{
static std::atomic<int> first_exit{ 0 };
int const count = first_exit.fetch_add(1, std::memory_order_relaxed);
return (count == 0);
}
void RestoreSignalHandler(int signal_number)
{
//try restoring old action
auto it = OldSignalActions.find(signal_number);
if (it != OldSignalActions.end())
{
sigaction(signal_number, &(it->second), nullptr);
}
else //fallback to default action
{
struct sigaction action;
memset(&action, 0, sizeof(action));
sigemptyset(&action.sa_mask);
action.sa_handler = SIG_DFL;
sigaction(signal_number, &action, nullptr);
}
}
void ExitWithDefaultSignalHandler(crashhandler::Signal fatal_signal_id, pid_t process_id)
{
const int signal_number = static_cast<int>(fatal_signal_id);
RestoreSignalHandler(signal_number);
std::cerr << "\n\n" << __FUNCTION__ << ":" << __LINE__ << ". Signal ID: " << signal_number << " \n\n" << std::flush;
kill(process_id, signal_number);
exit(signal_number);
}
void SignalHandler(int signal_number, siginfo_t* info, void* unused_context)
{
//only one signal will be allowed past this point
if (!IsFirstSignal())
{
while (true)
std::this_thread::sleep_for(std::chrono::seconds(1));
}
const std::string err_msg = fmt::format(
"signal {:d} ({:s}) catched; shutting log-core down (errno: {}, signal code: {}, exit status: {})",
signal_number, Signals.at(signal_number), info->si_errno, info->si_code, info->si_status);
CLogManager::Get()->QueueLogMessage(std::unique_ptr<CMessage>(new CMessage(
"log-core", LogLevel::ERROR,
err_msg, 0, "", "")));
CLogManager::Get()->Destroy();
ExitWithDefaultSignalHandler(signal_number, info->si_pid);
}
}
namespace crashhandler
{
void Install()
{
struct sigaction action, old_action;
memset(&action, 0, sizeof(action));
memset(&old_action, 0, sizeof(old_action));
sigemptyset(&action.sa_mask);
action.sa_sigaction = &SignalHandler;
action.sa_flags = SA_SIGINFO;
for (const auto &signal : Signals)
{
if (sigaction(signal.first, &action, &old_action) < 0)
{
const std::string error = "sigaction - " + signal.second;
perror(error.c_str());
}
else
{
if (old_action.sa_handler != nullptr || old_action.sa_sigaction != nullptr)
OldSignalActions.emplace(signal.first, old_action);
}
}
}
}
<commit_msg>improve UNIX crash handler<commit_after>#include "crashhandler.hpp"
#if (defined(WIN32) || defined(_WIN32) || defined(__WIN32__) && !defined(__GNUC__))
#error "crashhandler_unix.cpp is used on a non-UNIX platform"
#endif
#include <csignal>
#include <cstring>
#include <unistd.h>
#include <execinfo.h>
#include <cxxabi.h>
#include <cstdlib>
#include <sstream>
#include <iostream>
#include <thread>
#include <atomic>
#include <map>
#include <mutex>
#include <fmt/format.h>
// Linux/Clang, OSX/Clang, OSX/gcc
#if (defined(__clang__) || defined(__APPLE__))
#include <sys/ucontext.h>
#else
#include <ucontext.h>
#endif
#include "CLogger.hpp"
namespace
{
const std::map<crashhandler::Signal, std::string> Signals = {
{SIGABRT, "SIGABRT"},
{SIGFPE, "SIGFPE"},
{SIGILL, "SIGILL"},
{SIGSEGV, "SIGSEGV"},
{SIGTERM, "SIGTERM"},
};
std::map<crashhandler::Signal, struct sigaction> OldSignalActions;
bool IsFirstSignal()
{
static std::atomic<int> first_exit{ 0 };
int const count = first_exit.fetch_add(1, std::memory_order_relaxed);
return (count == 0);
}
void RestoreSignalHandler(int signal_number)
{
//try restoring old action
auto it = OldSignalActions.find(signal_number);
if (it != OldSignalActions.end())
sigaction(signal_number, &(it->second), nullptr);
}
void ExitWithDefaultSignalHandler(crashhandler::Signal fatal_signal_id)
{
const int signal_number = static_cast<int>(fatal_signal_id);
RestoreSignalHandler(signal_number);
std::cerr << "\n\n" << "[log-core] fatal signal '" << signal_number
<< "' (" << Signals.at(fatal_signal_id) << ") catched \n\n" << std::flush;
raise(signal_number);
}
void SignalHandler(int signal_number, siginfo_t* info, void* unused_context)
{
//only one signal will be allowed past this point
if (!IsFirstSignal())
{
while (true)
std::this_thread::sleep_for(std::chrono::seconds(1));
}
const std::string err_msg = fmt::format(
"signal {:d} ({:s}) catched; shutting log-core down (errno: {}, signal code: {}, exit status: {})",
signal_number, Signals.at(signal_number), info->si_errno, info->si_code, info->si_status);
CLogManager::Get()->QueueLogMessage(std::unique_ptr<CMessage>(new CMessage(
"log-core", LogLevel::ERROR, err_msg, 0, "", "")));
CLogManager::Get()->Destroy();
ExitWithDefaultSignalHandler(signal_number);
}
}
namespace crashhandler
{
void Install()
{
struct sigaction action, old_action;
memset(&action, 0, sizeof(action));
memset(&old_action, 0, sizeof(old_action));
sigemptyset(&action.sa_mask);
action.sa_sigaction = &SignalHandler;
action.sa_flags = SA_SIGINFO;
for (const auto &signal : Signals)
{
if (sigaction(signal.first, &action, &old_action) < 0)
{
const std::string error = "sigaction - " + signal.second;
perror(error.c_str());
}
else
{
OldSignalActions.emplace(signal.first, old_action);
}
}
}
}
<|endoftext|>
|
<commit_before>#include "ofSoundStream.h"
#include "RtAudio.h"
//----------------------------------- static variables:
static ofBaseApp * OFSAptr = NULL;
RtAudio * audio = NULL;
int nInputChannels;
int nOutputChannels;
ofAudioEventArgs audioEventArgs;
int receiveAudioBufferAndCallSimpleApp(void *outputBuffer, void *inputBuffer, unsigned int bufferSize,
double streamTime, RtAudioStreamStatus status, void *data);
//------------------------------------------------------------------------------
int receiveAudioBufferAndCallSimpleApp(void *outputBuffer, void *inputBuffer, unsigned int bufferSize,
double streamTime, RtAudioStreamStatus status, void *data){
if ( status ) std::cout << "Stream over/underflow detected." << std::endl;
// rtAudio uses a system by which the audio
// can be of different formats
// char, float, etc.
// we choose float
float * fPtrOut = (float *)outputBuffer;
float * fPtrIn = (float *)inputBuffer;
// [zach] memset output to zero before output call
// this is because of how rtAudio works: duplex w/ one callback
// you need to cut in the middle. if the simpleApp
// doesn't produce audio, we pass silence instead of duplex...
if (nInputChannels > 0){
OFSAptr->audioReceived(fPtrIn, bufferSize, nInputChannels);
#ifdef OF_USING_POCO
audioEventArgs.buffer = fPtrIn;
audioEventArgs.bufferSize = bufferSize;
audioEventArgs.nChannels = nInputChannels;
ofNotifyEvent( ofEvents.audioReceived, audioEventArgs );
#endif
memset(fPtrIn, 0, bufferSize * nInputChannels * sizeof(float));
}
if (nOutputChannels > 0) {
OFSAptr->audioRequested(fPtrOut, bufferSize, nOutputChannels);
#ifdef OF_USING_POCO
audioEventArgs.buffer = fPtrOut;
audioEventArgs.bufferSize = bufferSize;
audioEventArgs.nChannels = nOutputChannels;
ofNotifyEvent( ofEvents.audioRequested, audioEventArgs );
#endif
}
return 0;
}
//---------------------------------------------------------
void ofSoundStreamSetup(int nOutputs, int nInputs, ofBaseApp * OFSA){
ofSoundStreamSetup(nOutputs, nInputs, OFSA, 44100, 256, 4);
}
//---------------------------------------------------------
void ofSoundStreamSetup(int nOutputs, int nInputs, int sampleRate, int bufferSize, int nBuffers){
ofSoundStreamSetup(nOutputs, nInputs, NULL, sampleRate, bufferSize, nBuffers);
}
//---------------------------------------------------------
void ofSoundStreamSetup(int nOutputs, int nInputs, ofBaseApp * OFSA, int sampleRate, int bufferSize, int nBuffers){
nInputChannels = nInputs;
nOutputChannels = nOutputs;
OFSAptr = OFSA;
bufferSize = ofNextPow2(bufferSize); // must be pow2
try {
audio = new RtAudio();
} catch (RtError &error) {
error.printMessage();
//std::exit(EXIT_FAILURE); // need case here
}
RtAudio::StreamParameters * outputParameters=NULL;
if(nOutputChannels >0){
outputParameters = new RtAudio::StreamParameters();
outputParameters->deviceId = audio->getDefaultOutputDevice();
outputParameters->nChannels = nOutputChannels;
}
RtAudio::StreamParameters * inputParameters = NULL;
if(nInputChannels>0){
inputParameters = new RtAudio::StreamParameters;
inputParameters->deviceId = audio->getDefaultInputDevice();
inputParameters->nChannels = nInputChannels;
}
unsigned int bufferFrames = (unsigned int)bufferSize; // 256 sample frames
RtAudio::StreamOptions options;
options.flags = RTAUDIO_SCHEDULE_REALTIME;
options.numberOfBuffers = nBuffers;
options.priority = 1;
try {
audio ->openStream( outputParameters, inputParameters, RTAUDIO_FLOAT32,
sampleRate, &bufferFrames, &receiveAudioBufferAndCallSimpleApp, &options);
audio->startStream();
} catch (RtError &error) {
error.printMessage();
}
}
//---------------------------------------------------------
void ofSoundStreamStop(){
try {
audio->stopStream();
} catch (RtError &error) {
error.printMessage();
}
}
//---------------------------------------------------------
void ofSoundStreamStart(){
try{
audio->startStream();
} catch (RtError &error) {
error.printMessage();
}
}
//---------------------------------------------------------
void ofSoundStreamClose(){
if(!audio) return;
try {
audio->stopStream();
audio->closeStream();
} catch (RtError &error) {
error.printMessage();
}
delete audio;
}
//---------------------------------------------------------
void ofSoundStreamListDevices(){
RtAudio *audioTemp = 0;
try {
audioTemp = new RtAudio();
} catch (RtError &error) {
error.printMessage();
}
int devices = audioTemp->getDeviceCount();
RtAudio::DeviceInfo info;
for (int i=0; i< devices; i++) {
try {
info = audioTemp->getDeviceInfo(i);
} catch (RtError &error) {
error.printMessage();
break;
}
std::cout << "device = " << i << " (" << info.name << ")\n";
if (info.isDefaultInput) std::cout << "----* default ----* \n";
std::cout << "maximum output channels = " << info.outputChannels << "\n";
std::cout << "maximum input channels = " << info.inputChannels << "\n";
std::cout << "-----------------------------------------\n";
}
delete audioTemp;
}
<commit_msg>ofSoundStream: check if app is set in callback. Closes #183<commit_after>#include "ofSoundStream.h"
#include "RtAudio.h"
//----------------------------------- static variables:
static ofBaseApp * OFSAptr = NULL;
RtAudio * audio = NULL;
int nInputChannels;
int nOutputChannels;
ofAudioEventArgs audioEventArgs;
int receiveAudioBufferAndCallSimpleApp(void *outputBuffer, void *inputBuffer, unsigned int bufferSize,
double streamTime, RtAudioStreamStatus status, void *data);
//------------------------------------------------------------------------------
int receiveAudioBufferAndCallSimpleApp(void *outputBuffer, void *inputBuffer, unsigned int bufferSize,
double streamTime, RtAudioStreamStatus status, void *data){
if ( status ) std::cout << "Stream over/underflow detected." << std::endl;
// rtAudio uses a system by which the audio
// can be of different formats
// char, float, etc.
// we choose float
float * fPtrOut = (float *)outputBuffer;
float * fPtrIn = (float *)inputBuffer;
// [zach] memset output to zero before output call
// this is because of how rtAudio works: duplex w/ one callback
// you need to cut in the middle. if the simpleApp
// doesn't produce audio, we pass silence instead of duplex...
if (nInputChannels > 0){
if(OFSAptr) OFSAptr->audioReceived(fPtrIn, bufferSize, nInputChannels);
#ifdef OF_USING_POCO
audioEventArgs.buffer = fPtrIn;
audioEventArgs.bufferSize = bufferSize;
audioEventArgs.nChannels = nInputChannels;
ofNotifyEvent( ofEvents.audioReceived, audioEventArgs );
#endif
memset(fPtrIn, 0, bufferSize * nInputChannels * sizeof(float));
}
if (nOutputChannels > 0) {
if(OFSAptr) OFSAptr->audioRequested(fPtrOut, bufferSize, nOutputChannels);
#ifdef OF_USING_POCO
audioEventArgs.buffer = fPtrOut;
audioEventArgs.bufferSize = bufferSize;
audioEventArgs.nChannels = nOutputChannels;
ofNotifyEvent( ofEvents.audioRequested, audioEventArgs );
#endif
}
return 0;
}
//---------------------------------------------------------
void ofSoundStreamSetup(int nOutputs, int nInputs, ofBaseApp * OFSA){
ofSoundStreamSetup(nOutputs, nInputs, OFSA, 44100, 256, 4);
}
//---------------------------------------------------------
void ofSoundStreamSetup(int nOutputs, int nInputs, int sampleRate, int bufferSize, int nBuffers){
ofSoundStreamSetup(nOutputs, nInputs, NULL, sampleRate, bufferSize, nBuffers);
}
//---------------------------------------------------------
void ofSoundStreamSetup(int nOutputs, int nInputs, ofBaseApp * OFSA, int sampleRate, int bufferSize, int nBuffers){
nInputChannels = nInputs;
nOutputChannels = nOutputs;
OFSAptr = OFSA;
bufferSize = ofNextPow2(bufferSize); // must be pow2
try {
audio = new RtAudio();
} catch (RtError &error) {
error.printMessage();
//std::exit(EXIT_FAILURE); // need case here
}
RtAudio::StreamParameters * outputParameters=NULL;
if(nOutputChannels >0){
outputParameters = new RtAudio::StreamParameters();
outputParameters->deviceId = audio->getDefaultOutputDevice();
outputParameters->nChannels = nOutputChannels;
}
RtAudio::StreamParameters * inputParameters = NULL;
if(nInputChannels>0){
inputParameters = new RtAudio::StreamParameters;
inputParameters->deviceId = audio->getDefaultInputDevice();
inputParameters->nChannels = nInputChannels;
}
unsigned int bufferFrames = (unsigned int)bufferSize; // 256 sample frames
RtAudio::StreamOptions options;
options.flags = RTAUDIO_SCHEDULE_REALTIME;
options.numberOfBuffers = nBuffers;
options.priority = 1;
try {
audio ->openStream( outputParameters, inputParameters, RTAUDIO_FLOAT32,
sampleRate, &bufferFrames, &receiveAudioBufferAndCallSimpleApp, &options);
audio->startStream();
} catch (RtError &error) {
error.printMessage();
}
}
//---------------------------------------------------------
void ofSoundStreamStop(){
try {
audio->stopStream();
} catch (RtError &error) {
error.printMessage();
}
}
//---------------------------------------------------------
void ofSoundStreamStart(){
try{
audio->startStream();
} catch (RtError &error) {
error.printMessage();
}
}
//---------------------------------------------------------
void ofSoundStreamClose(){
if(!audio) return;
try {
audio->stopStream();
audio->closeStream();
} catch (RtError &error) {
error.printMessage();
}
delete audio;
}
//---------------------------------------------------------
void ofSoundStreamListDevices(){
RtAudio *audioTemp = 0;
try {
audioTemp = new RtAudio();
} catch (RtError &error) {
error.printMessage();
}
int devices = audioTemp->getDeviceCount();
RtAudio::DeviceInfo info;
for (int i=0; i< devices; i++) {
try {
info = audioTemp->getDeviceInfo(i);
} catch (RtError &error) {
error.printMessage();
break;
}
std::cout << "device = " << i << " (" << info.name << ")\n";
if (info.isDefaultInput) std::cout << "----* default ----* \n";
std::cout << "maximum output channels = " << info.outputChannels << "\n";
std::cout << "maximum input channels = " << info.inputChannels << "\n";
std::cout << "-----------------------------------------\n";
}
delete audioTemp;
}
<|endoftext|>
|
<commit_before>/*
* Copyright (C) 2014 Pavel Kirienko <pavel.kirienko@gmail.com>
*/
#pragma once
#include <queue>
#include <vector>
#include <gtest/gtest.h>
#include <uavcan/internal/transport/can_io.hpp>
#include "../../common.hpp"
class CanIfaceMock : public uavcan::ICanIface
{
public:
struct FrameWithTime
{
uavcan::CanFrame frame;
uint64_t time;
FrameWithTime(const uavcan::CanFrame& frame, uint64_t time)
: frame(frame)
, time(time)
{ }
};
std::queue<FrameWithTime> tx; ///< Queue of outgoing frames (bus <-- library)
std::queue<FrameWithTime> rx; ///< Queue of incoming frames (bus --> library)
bool writeable;
bool tx_failure;
bool rx_failure;
uint64_t num_errors;
SystemClockMock& clockmock;
CanIfaceMock(SystemClockMock& clockmock)
: writeable(true)
, tx_failure(false)
, rx_failure(false)
, num_errors(0)
, clockmock(clockmock)
{ }
void pushRx(uavcan::CanFrame frame)
{
rx.push(FrameWithTime(frame, clockmock.utc));
}
bool matchAndPopTx(const uavcan::CanFrame& frame, uint64_t tx_deadline)
{
if (tx.empty())
{
std::cout << "Tx buffer is empty" << std::endl;
return false;
}
const FrameWithTime frame_time = tx.front();
tx.pop();
return (frame_time.frame == frame) && (frame_time.time == tx_deadline);
}
int send(const uavcan::CanFrame& frame, uint64_t tx_timeout_usec)
{
assert(this);
EXPECT_TRUE(writeable); // Shall never be called when not writeable
if (tx_failure)
return -1;
if (!writeable)
return 0;
const uint64_t monotonic_deadline = tx_timeout_usec + clockmock.monotonic;
tx.push(FrameWithTime(frame, monotonic_deadline));
return 1;
}
int receive(uavcan::CanFrame& out_frame, uint64_t& out_ts_monotonic_usec, uint64_t& out_ts_utc_usec)
{
assert(this);
EXPECT_TRUE(rx.size()); // Shall never be called when not readable
if (rx_failure)
return -1;
if (rx.empty())
return 0;
const FrameWithTime frame = rx.front();
rx.pop();
out_frame = frame.frame;
out_ts_monotonic_usec = frame.time;
out_ts_utc_usec = 0;
return 1;
}
// cppcheck-suppress unusedFunction
// cppcheck-suppress functionConst
int configureFilters(const uavcan::CanFilterConfig* filter_configs, int num_configs) { return -1; }
// cppcheck-suppress unusedFunction
int getNumFilters() const { return 0; }
uint64_t getNumErrors() const { return num_errors; }
};
class CanDriverMock : public uavcan::ICanDriver
{
public:
std::vector<CanIfaceMock> ifaces;
SystemClockMock& clockmock;
bool select_failure;
CanDriverMock(int num_ifaces, SystemClockMock& clockmock)
: ifaces(num_ifaces, CanIfaceMock(clockmock))
, clockmock(clockmock)
, select_failure(false)
{ }
int select(int& inout_write_iface_mask, int& inout_read_iface_mask, uint64_t timeout_usec)
{
assert(this);
std::cout << "Write/read masks: " << inout_write_iface_mask << "/" << inout_read_iface_mask << std::endl;
if (select_failure)
return -1;
const int valid_iface_mask = (1 << getNumIfaces()) - 1;
EXPECT_FALSE(inout_write_iface_mask & ~valid_iface_mask);
EXPECT_FALSE(inout_read_iface_mask & ~valid_iface_mask);
int out_write_mask = 0;
int out_read_mask = 0;
for (int i = 0; i < getNumIfaces(); i++)
{
const int mask = 1 << i;
if ((inout_write_iface_mask & mask) && ifaces.at(i).writeable)
out_write_mask |= mask;
if ((inout_read_iface_mask & mask) && ifaces.at(i).rx.size())
out_read_mask |= mask;
}
inout_write_iface_mask = out_write_mask;
inout_read_iface_mask = out_read_mask;
if ((out_write_mask | out_read_mask) == 0)
{
clockmock.advance(timeout_usec); // Emulating timeout
return 0;
}
return 1; // This value is not being checked anyway, it just has to be greater than zero
}
uavcan::ICanIface* getIface(int iface_index) { return &ifaces.at(iface_index); }
int getNumIfaces() const { return ifaces.size(); }
};
<commit_msg>CAN iface mock uses monotonic timestamping instead of UTC<commit_after>/*
* Copyright (C) 2014 Pavel Kirienko <pavel.kirienko@gmail.com>
*/
#pragma once
#include <queue>
#include <vector>
#include <gtest/gtest.h>
#include <uavcan/internal/transport/can_io.hpp>
#include "../../common.hpp"
class CanIfaceMock : public uavcan::ICanIface
{
public:
struct FrameWithTime
{
uavcan::CanFrame frame;
uint64_t time;
FrameWithTime(const uavcan::CanFrame& frame, uint64_t time)
: frame(frame)
, time(time)
{ }
};
std::queue<FrameWithTime> tx; ///< Queue of outgoing frames (bus <-- library)
std::queue<FrameWithTime> rx; ///< Queue of incoming frames (bus --> library)
bool writeable;
bool tx_failure;
bool rx_failure;
uint64_t num_errors;
SystemClockMock& clockmock;
CanIfaceMock(SystemClockMock& clockmock)
: writeable(true)
, tx_failure(false)
, rx_failure(false)
, num_errors(0)
, clockmock(clockmock)
{ }
void pushRx(uavcan::CanFrame frame)
{
rx.push(FrameWithTime(frame, clockmock.monotonic));
}
bool matchAndPopTx(const uavcan::CanFrame& frame, uint64_t tx_deadline)
{
if (tx.empty())
{
std::cout << "Tx buffer is empty" << std::endl;
return false;
}
const FrameWithTime frame_time = tx.front();
tx.pop();
return (frame_time.frame == frame) && (frame_time.time == tx_deadline);
}
int send(const uavcan::CanFrame& frame, uint64_t tx_timeout_usec)
{
assert(this);
EXPECT_TRUE(writeable); // Shall never be called when not writeable
if (tx_failure)
return -1;
if (!writeable)
return 0;
const uint64_t monotonic_deadline = tx_timeout_usec + clockmock.monotonic;
tx.push(FrameWithTime(frame, monotonic_deadline));
return 1;
}
int receive(uavcan::CanFrame& out_frame, uint64_t& out_ts_monotonic_usec, uint64_t& out_ts_utc_usec)
{
assert(this);
EXPECT_TRUE(rx.size()); // Shall never be called when not readable
if (rx_failure)
return -1;
if (rx.empty())
return 0;
const FrameWithTime frame = rx.front();
rx.pop();
out_frame = frame.frame;
out_ts_monotonic_usec = frame.time;
out_ts_utc_usec = 0;
return 1;
}
// cppcheck-suppress unusedFunction
// cppcheck-suppress functionConst
int configureFilters(const uavcan::CanFilterConfig* filter_configs, int num_configs) { return -1; }
// cppcheck-suppress unusedFunction
int getNumFilters() const { return 0; }
uint64_t getNumErrors() const { return num_errors; }
};
class CanDriverMock : public uavcan::ICanDriver
{
public:
std::vector<CanIfaceMock> ifaces;
SystemClockMock& clockmock;
bool select_failure;
CanDriverMock(int num_ifaces, SystemClockMock& clockmock)
: ifaces(num_ifaces, CanIfaceMock(clockmock))
, clockmock(clockmock)
, select_failure(false)
{ }
int select(int& inout_write_iface_mask, int& inout_read_iface_mask, uint64_t timeout_usec)
{
assert(this);
std::cout << "Write/read masks: " << inout_write_iface_mask << "/" << inout_read_iface_mask << std::endl;
if (select_failure)
return -1;
const int valid_iface_mask = (1 << getNumIfaces()) - 1;
EXPECT_FALSE(inout_write_iface_mask & ~valid_iface_mask);
EXPECT_FALSE(inout_read_iface_mask & ~valid_iface_mask);
int out_write_mask = 0;
int out_read_mask = 0;
for (int i = 0; i < getNumIfaces(); i++)
{
const int mask = 1 << i;
if ((inout_write_iface_mask & mask) && ifaces.at(i).writeable)
out_write_mask |= mask;
if ((inout_read_iface_mask & mask) && ifaces.at(i).rx.size())
out_read_mask |= mask;
}
inout_write_iface_mask = out_write_mask;
inout_read_iface_mask = out_read_mask;
if ((out_write_mask | out_read_mask) == 0)
{
clockmock.advance(timeout_usec); // Emulating timeout
return 0;
}
return 1; // This value is not being checked anyway, it just has to be greater than zero
}
uavcan::ICanIface* getIface(int iface_index) { return &ifaces.at(iface_index); }
int getNumIfaces() const { return ifaces.size(); }
};
<|endoftext|>
|
<commit_before>#include "SimulationEvent.hpp"
auto operator<<(std::ostream& os, const SimulationEventType& ty) -> std::ostream& {
switch (ty) {
case SimulationEventType::Attack:
os << "Attack";
break;
case SimulationEventType::Collision:
os << "Collision";
break;
case SimulationEventType::Desertion:
os << "Desertion";
break;
}
return os;
}
auto test_aabb_circle(
int rect_x, int rect_y, int rect_w, int rect_h,
const hlt::Location& circ_center, double radius) -> bool {
// https://stackoverflow.com/a/21096179
// Find axis-aligned distances between circle and rectangle center
const auto x_half_rect = rect_w / 2.0;
const auto y_half_rect = rect_h / 2.0;
const auto x_dist = std::abs(circ_center.pos_x - rect_x - x_half_rect);
const auto y_dist = std::abs(circ_center.pos_y - rect_y - y_half_rect);
if (x_dist > x_half_rect + radius) return false;
if (y_dist > y_half_rect + radius) return false;
if (x_dist <= x_half_rect) return true;
if (y_dist <= y_half_rect) return true;
// Distance from rectangle side to circle center
const auto dx = x_dist - x_half_rect;
const auto dy = y_dist - y_half_rect;
return std::pow(dx, 2) + std::pow(dy, 2) <= std::pow(radius, 2);
}
CollisionMap::CollisionMap(const hlt::Map& game_map,
const std::function<double(const hlt::Ship&)> radius_func) {
width = static_cast<int>(std::ceil(static_cast<double>(game_map.map_width) / CELL_SIZE));
height = static_cast<int>(std::ceil(static_cast<double>(game_map.map_height) / CELL_SIZE));
std::vector<std::vector<hlt::EntityId>> row(height, std::vector<hlt::EntityId>());
cells.resize(width, row);
rebuild(game_map, radius_func);
}
auto CollisionMap::rebuild(const hlt::Map& game_map,
const std::function<double(const hlt::Ship&)> radius_func) -> void {
hlt::PlayerId player = 0;
for (const auto& player_ships : game_map.ships) {
for (const auto& ship_pair : player_ships) {
const auto& location = ship_pair.second.location;
const auto id = hlt::EntityId::for_ship(player, ship_pair.first);
add(location, radius_func(ship_pair.second), id);
}
player++;
}
}
auto CollisionMap::add(const hlt::Location& location, double radius,
hlt::EntityId id) -> void {
// Add the entity ID to all grid cells that the entity overlaps
for (auto cell_x = 0; cell_x < width; cell_x++) {
for (auto cell_y = 0; cell_y < height; cell_y++) {
if (test_aabb_circle(cell_x * CELL_SIZE, cell_y * CELL_SIZE,
CELL_SIZE, CELL_SIZE,
location, radius)) {
cells.at(cell_x).at(cell_y).push_back(id);
}
}
}
}
auto CollisionMap::test(const hlt::Location& location, double radius,
std::vector<hlt::EntityId>& potential_collisions) -> void {
// Add all IDs of any cell that overlaps the circle
for (auto cell_x = 0; cell_x < width; cell_x++) {
for (auto cell_y = 0; cell_y < height; cell_y++) {
if (test_aabb_circle(cell_x * CELL_SIZE, cell_y * CELL_SIZE,
CELL_SIZE, CELL_SIZE,
location, radius)) {
const auto& cell = cells.at(cell_x).at(cell_y);
potential_collisions.insert(
potential_collisions.end(),
cell.begin(), cell.end()
);
}
}
}
}
auto collision_time(
double r,
const hlt::Location& loc1, const hlt::Location& loc2,
const hlt::Velocity& vel1, const hlt::Velocity& vel2
) -> std::pair<bool, double> {
// With credit to Ben Spector
// Simplified derivation:
// 1. Set up the distance between the two entities in terms of time,
// the difference between their velocities and the difference between
// their positions
// 2. Equate the distance equal to the event radius (max possible distance
// they could be)
// 3. Solve the resulting quadratic
const auto dx = loc1.pos_x - loc2.pos_x;
const auto dy = loc1.pos_y - loc2.pos_y;
const auto dvx = vel1.vel_x - vel2.vel_x;
const auto dvy = vel1.vel_y - vel2.vel_y;
// Quadratic formula
const auto a = std::pow(dvx, 2) + std::pow(dvy, 2);
const auto b = 2 * (dx * dvx + dy * dvy);
const auto c = std::pow(dx, 2) + std::pow(dy, 2) - std::pow(r, 2);
const auto disc = std::pow(b, 2) - 4 * a * c;
if (a == 0.0) {
if (b == 0.0) {
if (c <= 0.0) {
// Implies r^2 >= dx^2 + dy^2 and the two are already colliding
return { true, 0.0 };
}
return { false, 0.0 };
}
const auto t = -c / b;
if (t >= 0.0) {
return { true, t };
}
return { false, 0.0 };
}
else if (disc == 0.0) {
// One solution
const auto t = -b / (2 * a);
return { true, t };
}
else if (disc > 0) {
const auto t1 = -b + std::sqrt(disc);
const auto t2 = -b - std::sqrt(disc);
if (t1 >= 0.0 && t2 >= 0.0) {
return { true, std::min(t1, t2) / (2 * a) };
}
else {
return { true, std::max(t1, t2) / (2 * a) };
}
}
else {
return { false, 0.0 };
}
}
auto collision_time(double r, const hlt::Ship& ship1, const hlt::Ship& ship2) -> std::pair<bool, double> {
return collision_time(r,
ship1.location, ship2.location,
ship1.velocity, ship2.velocity);
}
auto collision_time(double r, const hlt::Ship& ship1, const hlt::Planet& planet) -> std::pair<bool, double> {
return collision_time(r,
ship1.location, planet.location,
ship1.velocity, { 0, 0 });
}
auto might_attack(double distance, const hlt::Ship& ship1, const hlt::Ship& ship2) -> bool {
return distance <= ship1.velocity.magnitude() + ship2.velocity.magnitude()
+ hlt::GameConstants::get().WEAPON_RADIUS;
}
auto might_collide(double distance, const hlt::Ship& ship1, const hlt::Ship& ship2) -> bool {
return distance <= ship1.velocity.magnitude() + ship2.velocity.magnitude() +
ship1.radius + ship2.radius;
}
auto round_event_time(double t) -> double {
return std::round(t * EVENT_TIME_PRECISION) / EVENT_TIME_PRECISION;
}
auto find_events(
std::unordered_set<SimulationEvent>& unsorted_events,
const hlt::EntityId id1, const hlt::EntityId& id2,
const hlt::Ship& ship1, const hlt::Ship& ship2) -> void {
const auto distance = ship1.location.distance(ship2.location);
const auto player1 = id1.player_id();
const auto player2 = id2.player_id();
if (player1 != player2 && might_attack(distance, ship1, ship2)) {
// Combat event
const auto attack_radius = ship1.radius +
ship2.radius + hlt::GameConstants::get().WEAPON_RADIUS;
const auto t = collision_time(attack_radius, ship1, ship2);
if (t.first && t.second >= 0 && t.second <= 1) {
unsorted_events.insert(SimulationEvent{
SimulationEventType::Attack,
id1, id2, round_event_time(t.second),
});
}
else if (distance < attack_radius) {
unsorted_events.insert(SimulationEvent{
SimulationEventType::Attack,
id1, id2, 0
});
}
}
if (id1 != id2 && might_collide(distance, ship1, ship2)) {
// Collision event
const auto collision_radius = ship1.radius + ship2.radius;
const auto t = collision_time(collision_radius, ship1, ship2);
if (t.first) {
if (t.second >= 0 && t.second <= 1) {
unsorted_events.insert(SimulationEvent{
SimulationEventType::Collision,
id1, id2, round_event_time(t.second),
});
}
}
else if (distance < collision_radius) {
// This should never happen - the ships should already be dead
assert(false);
}
}
}
<commit_msg>Fixes the collision time calculation<commit_after>#include "SimulationEvent.hpp"
auto operator<<(std::ostream& os, const SimulationEventType& ty) -> std::ostream& {
switch (ty) {
case SimulationEventType::Attack:
os << "Attack";
break;
case SimulationEventType::Collision:
os << "Collision";
break;
case SimulationEventType::Desertion:
os << "Desertion";
break;
}
return os;
}
auto test_aabb_circle(
int rect_x, int rect_y, int rect_w, int rect_h,
const hlt::Location& circ_center, double radius) -> bool {
// https://stackoverflow.com/a/21096179
// Find axis-aligned distances between circle and rectangle center
const auto x_half_rect = rect_w / 2.0;
const auto y_half_rect = rect_h / 2.0;
const auto x_dist = std::abs(circ_center.pos_x - rect_x - x_half_rect);
const auto y_dist = std::abs(circ_center.pos_y - rect_y - y_half_rect);
if (x_dist > x_half_rect + radius) return false;
if (y_dist > y_half_rect + radius) return false;
if (x_dist <= x_half_rect) return true;
if (y_dist <= y_half_rect) return true;
// Distance from rectangle side to circle center
const auto dx = x_dist - x_half_rect;
const auto dy = y_dist - y_half_rect;
return std::pow(dx, 2) + std::pow(dy, 2) <= std::pow(radius, 2);
}
CollisionMap::CollisionMap(const hlt::Map& game_map,
const std::function<double(const hlt::Ship&)> radius_func) {
width = static_cast<int>(std::ceil(static_cast<double>(game_map.map_width) / CELL_SIZE));
height = static_cast<int>(std::ceil(static_cast<double>(game_map.map_height) / CELL_SIZE));
std::vector<std::vector<hlt::EntityId>> row(height, std::vector<hlt::EntityId>());
cells.resize(width, row);
rebuild(game_map, radius_func);
}
auto CollisionMap::rebuild(const hlt::Map& game_map,
const std::function<double(const hlt::Ship&)> radius_func) -> void {
hlt::PlayerId player = 0;
for (const auto& player_ships : game_map.ships) {
for (const auto& ship_pair : player_ships) {
const auto& location = ship_pair.second.location;
const auto id = hlt::EntityId::for_ship(player, ship_pair.first);
add(location, radius_func(ship_pair.second), id);
}
player++;
}
}
auto CollisionMap::add(const hlt::Location& location, double radius,
hlt::EntityId id) -> void {
// Add the entity ID to all grid cells that the entity overlaps
for (auto cell_x = 0; cell_x < width; cell_x++) {
for (auto cell_y = 0; cell_y < height; cell_y++) {
if (test_aabb_circle(cell_x * CELL_SIZE, cell_y * CELL_SIZE,
CELL_SIZE, CELL_SIZE,
location, radius)) {
cells.at(cell_x).at(cell_y).push_back(id);
}
}
}
}
auto CollisionMap::test(const hlt::Location& location, double radius,
std::vector<hlt::EntityId>& potential_collisions) -> void {
// Add all IDs of any cell that overlaps the circle
for (auto cell_x = 0; cell_x < width; cell_x++) {
for (auto cell_y = 0; cell_y < height; cell_y++) {
if (test_aabb_circle(cell_x * CELL_SIZE, cell_y * CELL_SIZE,
CELL_SIZE, CELL_SIZE,
location, radius)) {
const auto& cell = cells.at(cell_x).at(cell_y);
potential_collisions.insert(
potential_collisions.end(),
cell.begin(), cell.end()
);
}
}
}
}
auto collision_time(
double r,
const hlt::Location& loc1, const hlt::Location& loc2,
const hlt::Velocity& vel1, const hlt::Velocity& vel2
) -> std::pair<bool, double> {
// With credit to Ben Spector
// Simplified derivation:
// 1. Set up the distance between the two entities in terms of time,
// the difference between their velocities and the difference between
// their positions
// 2. Equate the distance equal to the event radius (max possible distance
// they could be)
// 3. Solve the resulting quadratic
const auto dx = loc1.pos_x - loc2.pos_x;
const auto dy = loc1.pos_y - loc2.pos_y;
const auto dvx = vel1.vel_x - vel2.vel_x;
const auto dvy = vel1.vel_y - vel2.vel_y;
// Quadratic formula
const auto a = std::pow(dvx, 2) + std::pow(dvy, 2);
const auto b = 2 * (dx * dvx + dy * dvy);
const auto c = std::pow(dx, 2) + std::pow(dy, 2) - std::pow(r, 2);
const auto disc = std::pow(b, 2) - 4 * a * c;
if (a == 0.0) {
if (b == 0.0) {
if (c <= 0.0) {
// Implies r^2 >= dx^2 + dy^2 and the two are already colliding
return { true, 0.0 };
}
return { false, 0.0 };
}
const auto t = -c / b;
if (t >= 0.0) {
return { true, t };
}
return { false, 0.0 };
}
else if (disc == 0.0) {
// One solution
const auto t = -b / (2 * a);
return { true, t };
}
else if (disc > 0) {
const auto t1 = (-b + std::sqrt(disc)) / (2 * a);
const auto t2 = (-b - std::sqrt(disc)) / (2 * a);
if(t1 >= 0.0 && t1 <= 1.0) {
/// t1 is valid to pick, because it is in between 0 and 1
return { true, t1 };
} else if (t1 < 0.0 && t2 >= 0.0) {
/// t1 is before 0 and t2 is after, but that means at t = 0.0 we are colliding
return { true, 0.0 };
} else {
/// The range [0, 1] does not intersect with [t1, t2]
return { false, 0.0 };
}
}
else {
return { false, 0.0 };
}
}
auto collision_time(double r, const hlt::Ship& ship1, const hlt::Ship& ship2) -> std::pair<bool, double> {
return collision_time(r,
ship1.location, ship2.location,
ship1.velocity, ship2.velocity);
}
auto collision_time(double r, const hlt::Ship& ship1, const hlt::Planet& planet) -> std::pair<bool, double> {
return collision_time(r,
ship1.location, planet.location,
ship1.velocity, { 0, 0 });
}
auto might_attack(double distance, const hlt::Ship& ship1, const hlt::Ship& ship2) -> bool {
return distance <= ship1.velocity.magnitude() + ship2.velocity.magnitude()
+ hlt::GameConstants::get().WEAPON_RADIUS;
}
auto might_collide(double distance, const hlt::Ship& ship1, const hlt::Ship& ship2) -> bool {
return distance <= ship1.velocity.magnitude() + ship2.velocity.magnitude() +
ship1.radius + ship2.radius;
}
auto round_event_time(double t) -> double {
return std::round(t * EVENT_TIME_PRECISION) / EVENT_TIME_PRECISION;
}
auto find_events(
std::unordered_set<SimulationEvent>& unsorted_events,
const hlt::EntityId id1, const hlt::EntityId& id2,
const hlt::Ship& ship1, const hlt::Ship& ship2) -> void {
const auto distance = ship1.location.distance(ship2.location);
const auto player1 = id1.player_id();
const auto player2 = id2.player_id();
if (player1 != player2 && might_attack(distance, ship1, ship2)) {
// Combat event
const auto attack_radius = ship1.radius +
ship2.radius + hlt::GameConstants::get().WEAPON_RADIUS;
const auto t = collision_time(attack_radius, ship1, ship2);
if (t.first && t.second >= 0 && t.second <= 1) {
unsorted_events.insert(SimulationEvent{
SimulationEventType::Attack,
id1, id2, round_event_time(t.second),
});
}
else if (distance < attack_radius) {
unsorted_events.insert(SimulationEvent{
SimulationEventType::Attack,
id1, id2, 0
});
}
}
if (id1 != id2 && might_collide(distance, ship1, ship2)) {
// Collision event
const auto collision_radius = ship1.radius + ship2.radius;
const auto t = collision_time(collision_radius, ship1, ship2);
if (t.first) {
if (t.second >= 0 && t.second <= 1) {
unsorted_events.insert(SimulationEvent{
SimulationEventType::Collision,
id1, id2, round_event_time(t.second),
});
}
}
else if (distance < collision_radius) {
// This should never happen - the ships should already be dead
assert(false);
}
}
}
<|endoftext|>
|
<commit_before>/*************************************************************************
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: lngopt.hxx,v $
*
* $Revision: 1.14 $
*
* last change: $Author: rt $ $Date: 2007-01-29 15:46:04 $
*
* The Contents of this file are made available subject to
* the terms of GNU Lesser General Public License Version 2.1.
*
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2005 by Sun Microsystems, Inc.
* 901 San Antonio Road, Palo Alto, CA 94303, USA
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, 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., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
************************************************************************/
#ifndef _LINGUISTIC_LNGOPT_HHX_
#define _LINGUISTIC_LNGOPT_HHX_
#include <functional>
#include <uno/lbnames.h> // CPPU_CURRENT_LANGUAGE_BINDING_NAME macro, which specify the environment type
#include <cppuhelper/implbase5.hxx> // helper for implementations
#ifndef _CPPUHELPER_INTERFACECONTAINER_HXX_
#include <cppuhelper/interfacecontainer.hxx>
#endif
#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSET_HPP_
#include <com/sun/star/beans/XPropertySet.hpp>
#endif
#ifndef _COM_SUN_STAR_BEANS_XFASTPROPERTYSET_HPP_
#include <com/sun/star/beans/XFastPropertySet.hpp>
#endif
#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_
#include <com/sun/star/lang/XServiceInfo.hpp>
#endif
#ifndef _COM_SUN_STAR_BEANS_XPROPERTYACCESS_HPP_
#include <com/sun/star/beans/XPropertyAccess.hpp>
#endif
#ifndef _COM_SUN_STAR_LANG_XCOMPONENT_HPP_
#include <com/sun/star/lang/XComponent.hpp>
#endif
#ifndef _SVTOOLS_LINGUCFG_HXX_
#include <svtools/lingucfg.hxx>
#endif
#ifndef _SFX_ITEMPROP_HXX
#include <svtools/itemprop.hxx>
#endif
#ifndef _UTL_CONFIGITEM_HXX_
#include <unotools/configitem.hxx>
#endif
#ifndef _COM_SUN_STAR_UNO_ANY_H_
#include <com/sun/star/uno/Any.h>
#endif
#ifndef _SOLAR_H //autogen wg. INT16
#include <tools/solar.h>
#endif
#include <vcl/timer.hxx>
#include <svtools/itemprop.hxx>
#ifndef _LINGUISTIC_MISC_HXX_
#include "misc.hxx"
#endif
#ifndef _LINGUISTIC_DEFS_HXX_
#include "defs.hxx"
#endif
namespace com { namespace sun { namespace star {
namespace beans {
struct PropertyChangeEvent;
}
namespace registry {
class XRegistryKey;
}
}}};
///////////////////////////////////////////////////////////////////////////
// LinguOptions
// This class represents all Linguistik relevant options.
//
class LinguOptions
{
static SvtLinguOptions *pData;
static vos::ORefCount aRefCount; // number of objects of this class
//! uses default assignment-operator
BOOL SetLocale_Impl( INT16 &rLanguage,
::com::sun::star::uno::Any &rOld,
const ::com::sun::star::uno::Any &rVal);
public:
LinguOptions();
LinguOptions(const LinguOptions &rOpt);
~LinguOptions();
BOOL SetValue( ::com::sun::star::uno::Any &rOld,
const ::com::sun::star::uno::Any &rVal, INT32 nWID );
void GetValue( ::com::sun::star::uno::Any &rVal, INT32 nWID ) const;
::rtl::OUString GetName( INT32 nWID ) const;
BOOL IsSpellInAllLanguages() const { return pData->bIsSpellInAllLanguages; }
const ::com::sun::star::uno::Sequence< rtl::OUString >
GetActiveDics() const { return pData->aActiveDics; }
const ::com::sun::star::uno::Sequence< rtl::OUString >
GetActiveConvDics() const { return pData->aActiveConvDics; }
};
///////////////////////////////////////////////////////////////////////////
// uses templates from <cppuhelper/interfacecontainer.h>
// helper function call class
struct PropHashType_Impl
{
size_t operator()(const INT32 &s) const { return s; }
};
typedef cppu::OMultiTypeInterfaceContainerHelperVar
<
INT32,
PropHashType_Impl,
std::equal_to< INT32 >
> OPropertyListenerContainerHelper;
///////////////////////////////////////////////////////////////////////////
class LinguProps :
public cppu::WeakImplHelper5
<
com::sun::star::beans::XPropertySet,
com::sun::star::beans::XFastPropertySet,
com::sun::star::beans::XPropertyAccess,
com::sun::star::lang::XComponent,
com::sun::star::lang::XServiceInfo
>
{
::cppu::OInterfaceContainerHelper aEvtListeners;
OPropertyListenerContainerHelper aPropListeners;
SfxItemPropertyMap *pMap;
LinguOptions aOpt;
BOOL bDisposing;
// disallow copy-constructor and assignment-operator for now
LinguProps(const LinguProps &);
LinguProps & operator = (const LinguProps &);
void launchEvent( const ::com::sun::star::beans::PropertyChangeEvent &rEvt ) const;
public:
LinguProps();
// XPropertySet
virtual ::com::sun::star::uno::Reference<
::com::sun::star::beans::XPropertySetInfo > SAL_CALL
getPropertySetInfo()
throw(::com::sun::star::uno::RuntimeException);
virtual void SAL_CALL
setPropertyValue( const ::rtl::OUString& aPropertyName,
const ::com::sun::star::uno::Any& aValue )
throw(::com::sun::star::beans::UnknownPropertyException,
::com::sun::star::beans::PropertyVetoException,
::com::sun::star::lang::IllegalArgumentException,
::com::sun::star::lang::WrappedTargetException,
::com::sun::star::uno::RuntimeException);
virtual ::com::sun::star::uno::Any SAL_CALL
getPropertyValue( const ::rtl::OUString& PropertyName )
throw(::com::sun::star::beans::UnknownPropertyException,
::com::sun::star::lang::WrappedTargetException,
::com::sun::star::uno::RuntimeException);
virtual void SAL_CALL
addPropertyChangeListener( const ::rtl::OUString& aPropertyName,
const ::com::sun::star::uno::Reference<
::com::sun::star::beans::XPropertyChangeListener >& rxListener )
throw(::com::sun::star::beans::UnknownPropertyException,
::com::sun::star::lang::WrappedTargetException,
::com::sun::star::uno::RuntimeException);
virtual void SAL_CALL
removePropertyChangeListener( const ::rtl::OUString& aPropertyName,
const ::com::sun::star::uno::Reference<
::com::sun::star::beans::XPropertyChangeListener >& rxListener )
throw(::com::sun::star::beans::UnknownPropertyException,
::com::sun::star::lang::WrappedTargetException,
::com::sun::star::uno::RuntimeException);
virtual void SAL_CALL
addVetoableChangeListener( const ::rtl::OUString& PropertyName,
const ::com::sun::star::uno::Reference<
::com::sun::star::beans::XVetoableChangeListener >& rxListener )
throw(::com::sun::star::beans::UnknownPropertyException,
::com::sun::star::lang::WrappedTargetException,
::com::sun::star::uno::RuntimeException);
virtual void SAL_CALL
removeVetoableChangeListener( const ::rtl::OUString& PropertyName,
const ::com::sun::star::uno::Reference<
::com::sun::star::beans::XVetoableChangeListener >& rxListener )
throw(::com::sun::star::beans::UnknownPropertyException,
::com::sun::star::lang::WrappedTargetException,
::com::sun::star::uno::RuntimeException);
// XFastPropertySet
virtual void SAL_CALL
setFastPropertyValue( sal_Int32 nHandle, const ::com::sun::star::uno::Any& aValue )
throw(::com::sun::star::beans::UnknownPropertyException,
::com::sun::star::beans::PropertyVetoException,
::com::sun::star::lang::IllegalArgumentException,
::com::sun::star::lang::WrappedTargetException,
::com::sun::star::uno::RuntimeException);
virtual ::com::sun::star::uno::Any SAL_CALL
getFastPropertyValue( sal_Int32 nHandle )
throw(::com::sun::star::beans::UnknownPropertyException,
::com::sun::star::lang::WrappedTargetException,
::com::sun::star::uno::RuntimeException);
// XPropertyAccess
virtual ::com::sun::star::uno::Sequence<
::com::sun::star::beans::PropertyValue > SAL_CALL
getPropertyValues()
throw(::com::sun::star::uno::RuntimeException);
virtual void SAL_CALL
setPropertyValues( const ::com::sun::star::uno::Sequence<
::com::sun::star::beans::PropertyValue >& aProps )
throw(::com::sun::star::beans::UnknownPropertyException,
::com::sun::star::beans::PropertyVetoException,
::com::sun::star::lang::IllegalArgumentException,
::com::sun::star::lang::WrappedTargetException,
::com::sun::star::uno::RuntimeException);
// XComponent
virtual void SAL_CALL
dispose()
throw(::com::sun::star::uno::RuntimeException);
virtual void SAL_CALL
addEventListener( const ::com::sun::star::uno::Reference<
::com::sun::star::lang::XEventListener >& rxListener )
throw(::com::sun::star::uno::RuntimeException);
virtual void SAL_CALL
removeEventListener( const ::com::sun::star::uno::Reference<
::com::sun::star::lang::XEventListener >& rxListener )
throw(::com::sun::star::uno::RuntimeException);
////////////////////////////////////////////////////////////
// Service specific part
//
// XServiceInfo
virtual ::rtl::OUString SAL_CALL
getImplementationName()
throw(::com::sun::star::uno::RuntimeException);
virtual sal_Bool SAL_CALL
supportsService( const ::rtl::OUString& ServiceName )
throw(::com::sun::star::uno::RuntimeException);
virtual ::com::sun::star::uno::Sequence< ::rtl::OUString > SAL_CALL
getSupportedServiceNames()
throw(::com::sun::star::uno::RuntimeException);
static inline ::rtl::OUString
getImplementationName_Static() throw();
static com::sun::star::uno::Sequence< ::rtl::OUString >
getSupportedServiceNames_Static() throw();
};
inline ::rtl::OUString LinguProps::getImplementationName_Static() throw()
{
return A2OU( "com.sun.star.lingu2.LinguProps" );
}
///////////////////////////////////////////////////////////////////////////
#endif
<commit_msg>INTEGRATION: CWS tl32 (1.13.44); FILE MERGED 2007/04/11 10:25:50 tl 1.13.44.2: RESYNC: (1.13-1.14); FILE MERGED 2006/11/02 15:42:37 tl 1.13.44.1: #140479# warning-free code for unxsols4(.pro)<commit_after>/*************************************************************************
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: lngopt.hxx,v $
*
* $Revision: 1.15 $
*
* last change: $Author: vg $ $Date: 2007-05-25 12:23:46 $
*
* The Contents of this file are made available subject to
* the terms of GNU Lesser General Public License Version 2.1.
*
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2005 by Sun Microsystems, Inc.
* 901 San Antonio Road, Palo Alto, CA 94303, USA
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, 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., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
************************************************************************/
#ifndef _LINGUISTIC_LNGOPT_HHX_
#define _LINGUISTIC_LNGOPT_HHX_
#include <functional>
#include <uno/lbnames.h> // CPPU_CURRENT_LANGUAGE_BINDING_NAME macro, which specify the environment type
#include <cppuhelper/implbase5.hxx> // helper for implementations
#ifndef _CPPUHELPER_INTERFACECONTAINER_HXX_
#include <cppuhelper/interfacecontainer.hxx>
#endif
#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSET_HPP_
#include <com/sun/star/beans/XPropertySet.hpp>
#endif
#ifndef _COM_SUN_STAR_BEANS_XFASTPROPERTYSET_HPP_
#include <com/sun/star/beans/XFastPropertySet.hpp>
#endif
#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_
#include <com/sun/star/lang/XServiceInfo.hpp>
#endif
#ifndef _COM_SUN_STAR_BEANS_XPROPERTYACCESS_HPP_
#include <com/sun/star/beans/XPropertyAccess.hpp>
#endif
#ifndef _COM_SUN_STAR_LANG_XCOMPONENT_HPP_
#include <com/sun/star/lang/XComponent.hpp>
#endif
#ifndef _SVTOOLS_LINGUCFG_HXX_
#include <svtools/lingucfg.hxx>
#endif
#ifndef _SFX_ITEMPROP_HXX
#include <svtools/itemprop.hxx>
#endif
#ifndef _UTL_CONFIGITEM_HXX_
#include <unotools/configitem.hxx>
#endif
#ifndef _COM_SUN_STAR_UNO_ANY_H_
#include <com/sun/star/uno/Any.h>
#endif
#ifndef _SOLAR_H //autogen wg. INT16
#include <tools/solar.h>
#endif
#include <vcl/timer.hxx>
#include <svtools/itemprop.hxx>
#ifndef _LINGUISTIC_MISC_HXX_
#include "misc.hxx"
#endif
#ifndef _LINGUISTIC_DEFS_HXX_
#include "defs.hxx"
#endif
namespace com { namespace sun { namespace star {
namespace beans {
struct PropertyChangeEvent;
}
namespace registry {
class XRegistryKey;
}
}}}
///////////////////////////////////////////////////////////////////////////
// LinguOptions
// This class represents all Linguistik relevant options.
//
class LinguOptions
{
static SvtLinguOptions *pData;
static vos::ORefCount aRefCount; // number of objects of this class
//! uses default assignment-operator
BOOL SetLocale_Impl( INT16 &rLanguage,
::com::sun::star::uno::Any &rOld,
const ::com::sun::star::uno::Any &rVal);
public:
LinguOptions();
LinguOptions(const LinguOptions &rOpt);
~LinguOptions();
BOOL SetValue( ::com::sun::star::uno::Any &rOld,
const ::com::sun::star::uno::Any &rVal, INT32 nWID );
void GetValue( ::com::sun::star::uno::Any &rVal, INT32 nWID ) const;
::rtl::OUString GetName( INT32 nWID ) const;
BOOL IsSpellInAllLanguages() const { return pData->bIsSpellInAllLanguages; }
const ::com::sun::star::uno::Sequence< rtl::OUString >
GetActiveDics() const { return pData->aActiveDics; }
const ::com::sun::star::uno::Sequence< rtl::OUString >
GetActiveConvDics() const { return pData->aActiveConvDics; }
};
///////////////////////////////////////////////////////////////////////////
// uses templates from <cppuhelper/interfacecontainer.h>
// helper function call class
struct PropHashType_Impl
{
size_t operator()(const INT32 &s) const { return s; }
};
typedef cppu::OMultiTypeInterfaceContainerHelperVar
<
INT32,
PropHashType_Impl,
std::equal_to< INT32 >
> OPropertyListenerContainerHelper;
///////////////////////////////////////////////////////////////////////////
class LinguProps :
public cppu::WeakImplHelper5
<
com::sun::star::beans::XPropertySet,
com::sun::star::beans::XFastPropertySet,
com::sun::star::beans::XPropertyAccess,
com::sun::star::lang::XComponent,
com::sun::star::lang::XServiceInfo
>
{
::cppu::OInterfaceContainerHelper aEvtListeners;
OPropertyListenerContainerHelper aPropListeners;
SfxItemPropertyMap *pMap;
LinguOptions aOpt;
BOOL bDisposing;
// disallow copy-constructor and assignment-operator for now
LinguProps(const LinguProps &);
LinguProps & operator = (const LinguProps &);
void launchEvent( const ::com::sun::star::beans::PropertyChangeEvent &rEvt ) const;
public:
LinguProps();
// XPropertySet
virtual ::com::sun::star::uno::Reference<
::com::sun::star::beans::XPropertySetInfo > SAL_CALL
getPropertySetInfo()
throw(::com::sun::star::uno::RuntimeException);
virtual void SAL_CALL
setPropertyValue( const ::rtl::OUString& aPropertyName,
const ::com::sun::star::uno::Any& aValue )
throw(::com::sun::star::beans::UnknownPropertyException,
::com::sun::star::beans::PropertyVetoException,
::com::sun::star::lang::IllegalArgumentException,
::com::sun::star::lang::WrappedTargetException,
::com::sun::star::uno::RuntimeException);
virtual ::com::sun::star::uno::Any SAL_CALL
getPropertyValue( const ::rtl::OUString& PropertyName )
throw(::com::sun::star::beans::UnknownPropertyException,
::com::sun::star::lang::WrappedTargetException,
::com::sun::star::uno::RuntimeException);
virtual void SAL_CALL
addPropertyChangeListener( const ::rtl::OUString& aPropertyName,
const ::com::sun::star::uno::Reference<
::com::sun::star::beans::XPropertyChangeListener >& rxListener )
throw(::com::sun::star::beans::UnknownPropertyException,
::com::sun::star::lang::WrappedTargetException,
::com::sun::star::uno::RuntimeException);
virtual void SAL_CALL
removePropertyChangeListener( const ::rtl::OUString& aPropertyName,
const ::com::sun::star::uno::Reference<
::com::sun::star::beans::XPropertyChangeListener >& rxListener )
throw(::com::sun::star::beans::UnknownPropertyException,
::com::sun::star::lang::WrappedTargetException,
::com::sun::star::uno::RuntimeException);
virtual void SAL_CALL
addVetoableChangeListener( const ::rtl::OUString& PropertyName,
const ::com::sun::star::uno::Reference<
::com::sun::star::beans::XVetoableChangeListener >& rxListener )
throw(::com::sun::star::beans::UnknownPropertyException,
::com::sun::star::lang::WrappedTargetException,
::com::sun::star::uno::RuntimeException);
virtual void SAL_CALL
removeVetoableChangeListener( const ::rtl::OUString& PropertyName,
const ::com::sun::star::uno::Reference<
::com::sun::star::beans::XVetoableChangeListener >& rxListener )
throw(::com::sun::star::beans::UnknownPropertyException,
::com::sun::star::lang::WrappedTargetException,
::com::sun::star::uno::RuntimeException);
// XFastPropertySet
virtual void SAL_CALL
setFastPropertyValue( sal_Int32 nHandle, const ::com::sun::star::uno::Any& aValue )
throw(::com::sun::star::beans::UnknownPropertyException,
::com::sun::star::beans::PropertyVetoException,
::com::sun::star::lang::IllegalArgumentException,
::com::sun::star::lang::WrappedTargetException,
::com::sun::star::uno::RuntimeException);
virtual ::com::sun::star::uno::Any SAL_CALL
getFastPropertyValue( sal_Int32 nHandle )
throw(::com::sun::star::beans::UnknownPropertyException,
::com::sun::star::lang::WrappedTargetException,
::com::sun::star::uno::RuntimeException);
// XPropertyAccess
virtual ::com::sun::star::uno::Sequence<
::com::sun::star::beans::PropertyValue > SAL_CALL
getPropertyValues()
throw(::com::sun::star::uno::RuntimeException);
virtual void SAL_CALL
setPropertyValues( const ::com::sun::star::uno::Sequence<
::com::sun::star::beans::PropertyValue >& aProps )
throw(::com::sun::star::beans::UnknownPropertyException,
::com::sun::star::beans::PropertyVetoException,
::com::sun::star::lang::IllegalArgumentException,
::com::sun::star::lang::WrappedTargetException,
::com::sun::star::uno::RuntimeException);
// XComponent
virtual void SAL_CALL
dispose()
throw(::com::sun::star::uno::RuntimeException);
virtual void SAL_CALL
addEventListener( const ::com::sun::star::uno::Reference<
::com::sun::star::lang::XEventListener >& rxListener )
throw(::com::sun::star::uno::RuntimeException);
virtual void SAL_CALL
removeEventListener( const ::com::sun::star::uno::Reference<
::com::sun::star::lang::XEventListener >& rxListener )
throw(::com::sun::star::uno::RuntimeException);
////////////////////////////////////////////////////////////
// Service specific part
//
// XServiceInfo
virtual ::rtl::OUString SAL_CALL
getImplementationName()
throw(::com::sun::star::uno::RuntimeException);
virtual sal_Bool SAL_CALL
supportsService( const ::rtl::OUString& ServiceName )
throw(::com::sun::star::uno::RuntimeException);
virtual ::com::sun::star::uno::Sequence< ::rtl::OUString > SAL_CALL
getSupportedServiceNames()
throw(::com::sun::star::uno::RuntimeException);
static inline ::rtl::OUString
getImplementationName_Static() throw();
static com::sun::star::uno::Sequence< ::rtl::OUString >
getSupportedServiceNames_Static() throw();
};
inline ::rtl::OUString LinguProps::getImplementationName_Static() throw()
{
return A2OU( "com.sun.star.lingu2.LinguProps" );
}
///////////////////////////////////////////////////////////////////////////
#endif
<|endoftext|>
|
<commit_before>/*************************************************************************
*
* $RCSfile: service1_impl.cxx,v $
*
* $Revision: 1.7 $
*
* last change: $Author: obo $ $Date: 2006-09-17 00:09:50 $
*
* The Contents of this file are made available subject to the terms of
* the BSD license.
*
* Copyright (c) 2003 by Sun Microsystems, Inc.
* 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.
* 3. Neither the name of Sun Microsystems, Inc. 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.
*
*************************************************************************/
// MARKER(update_precomp.py): autogen include statement, do not remove
#include "precompiled_odk.hxx"
#include <osl/interlck.h>
#include <osl/mutex.hxx>
#include <rtl/uuid.h>
#include <cppuhelper/factory.hxx>
#include <com/sun/star/lang/XServiceInfo.hpp>
#include <com/sun/star/lang/XTypeProvider.hpp>
#include <my_module/XSomething.hpp>
using namespace ::rtl; // for OUString
using namespace ::com::sun::star; // for odk interfaces
using namespace ::com::sun::star::uno; // for basic types
namespace my_sc_impl
{
Sequence< OUString > SAL_CALL getSupportedServiceNames_MyService1Impl()
{
Sequence< OUString > names(1);
names[0] = OUString(RTL_CONSTASCII_USTRINGPARAM("my_module.MyService1"));
return names;
}
OUString SAL_CALL getImplementationName_MyService1Impl()
{
return OUString( RTL_CONSTASCII_USTRINGPARAM(
"my_module.my_sc_implementation.MyService1") );
}
class MyService1Impl
: public ::my_module::XSomething
, public lang::XServiceInfo
, public lang::XTypeProvider
{
oslInterlockedCount m_refcount;
OUString m_sData;
// it's good practise to store the context for further use when you use
// other UNO API's in your implementation
Reference< XComponentContext > m_xContext;
public:
inline MyService1Impl(Reference< XComponentContext > const & xContext) throw ()
: m_refcount( 0 ),
m_xContext(xContext)
{}
virtual ~MyService1Impl() {}
// XInterface
virtual Any SAL_CALL queryInterface( Type const & type )
throw (RuntimeException);
virtual void SAL_CALL acquire()
throw ();
virtual void SAL_CALL release()
throw ();
// XTypeProvider
virtual Sequence< Type > SAL_CALL getTypes()
throw (RuntimeException);
virtual Sequence< sal_Int8 > SAL_CALL getImplementationId()
throw (RuntimeException);
// XSomething
virtual OUString SAL_CALL methodOne( OUString const & str )
throw (RuntimeException);
virtual OUString SAL_CALL methodTwo( )
throw (RuntimeException);
// XServiceInfo
virtual OUString SAL_CALL getImplementationName()
throw (RuntimeException);
virtual sal_Bool SAL_CALL supportsService( OUString const & serviceName )
throw (RuntimeException);
virtual Sequence< OUString > SAL_CALL getSupportedServiceNames()
throw (RuntimeException);
};
// XInterface implementation
Any MyService1Impl::queryInterface( Type const & type )
throw (RuntimeException)
{
if (type.equals(::cppu::UnoType< Reference< XInterface > >::get()))
{
// return XInterface interface
// (resolve ambiguity by casting to lang::XTypeProvider)
Reference< XInterface > x(
static_cast< lang::XTypeProvider * >( this ) );
return makeAny( x );
}
if (type.equals(::cppu::UnoType< Reference< lang::XTypeProvider > >::get()))
{
// return XInterface interface
Reference< XInterface > x(
static_cast< lang::XTypeProvider * >( this ) );
return makeAny( x );
}
if (type.equals(::cppu::UnoType< Reference< lang::XServiceInfo > >::get()))
{
// return XServiceInfo interface
Reference< lang::XServiceInfo > x(
static_cast< lang::XServiceInfo * >( this ) );
return makeAny( x );
}
if (type.equals(::cppu::UnoType< Reference< ::my_module::XSomething > >::get()))
{
// return sample interface
Reference< ::my_module::XSomething > x(
static_cast< ::my_module::XSomething * >( this ) );
return makeAny( x );
}
// querying for unsupported type
return Any();
}
void MyService1Impl::acquire()
throw ()
{
// thread-safe incrementation of reference count
::osl_incrementInterlockedCount( &m_refcount );
}
void MyService1Impl::release()
throw ()
{
// thread-safe decrementation of reference count
if (0 == ::osl_decrementInterlockedCount( &m_refcount ))
{
delete this; // shutdown this object
}
}
// XTypeProvider implementation
Sequence< Type > MyService1Impl::getTypes()
throw (RuntimeException)
{
Sequence< Type > seq( 3 );
seq[ 0 ] = ::cppu::UnoType< Reference< lang::XTypeProvider > >::get();
seq[ 1 ] = ::cppu::UnoType< Reference< lang::XServiceInfo > >::get();
seq[ 2 ] = ::cppu::UnoType< Reference< ::my_module::XSomething > >::get();
return seq;
}
Sequence< sal_Int8 > MyService1Impl::getImplementationId()
throw (RuntimeException)
{
static Sequence< sal_Int8 > * s_pId = 0;
if (! s_pId)
{
// create unique id
Sequence< sal_Int8 > id( 16 );
::rtl_createUuid( (sal_uInt8 *)id.getArray(), 0, sal_True );
// guard initialization with some mutex
::osl::MutexGuard guard( ::osl::Mutex::getGlobalMutex() );
if (! s_pId)
{
static Sequence< sal_Int8 > s_id( id );
s_pId = &s_id;
}
}
return *s_pId;
}
// XSomething implementation
OUString MyService1Impl::methodOne( OUString const & str )
throw (RuntimeException)
{
m_sData = str;
return OUString( RTL_CONSTASCII_USTRINGPARAM(
"called methodOne() of MyService1 implementation: ") ) + m_sData;
}
OUString MyService1Impl::methodTwo( )
throw (RuntimeException)
{
return OUString( RTL_CONSTASCII_USTRINGPARAM(
"called methodTwo() of MyService1 implementation: ") ) + m_sData;
}
// XServiceInfo implementation
OUString MyService1Impl::getImplementationName()
throw (RuntimeException)
{
// unique implementation name
return OUString( RTL_CONSTASCII_USTRINGPARAM(
"my_module.my_sc_implementation.MyService1") );
}
sal_Bool MyService1Impl::supportsService( OUString const & serviceName )
throw (RuntimeException)
{
// this object only supports one service, so the test is simple
return serviceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(
"my_module.MyService1") );
}
Sequence< OUString > MyService1Impl::getSupportedServiceNames()
throw (RuntimeException)
{
// this object only supports one service
OUString serviceName( RTL_CONSTASCII_USTRINGPARAM("my_module.MyService1") );
return Sequence< OUString >( &serviceName, 1 );
}
Reference< XInterface > SAL_CALL create_MyService1Impl(
Reference< XComponentContext > const & xContext )
SAL_THROW( () )
{
return static_cast< lang::XTypeProvider * >( new MyService1Impl( xContext) );
}
// forward decl: implemented in service2_impl.cxx
Reference< XInterface > SAL_CALL create_MyService2Impl(
Reference< XComponentContext > const & ) SAL_THROW( () );
}
/*
extern "C" void SAL_CALL component_getImplementationEnvironment(
sal_Char const ** ppEnvTypeName, uno_Environment ** )
{
*ppEnvTypeName = CPPU_CURRENT_LANGUAGE_BINDING_NAME;
}
extern "C" sal_Bool SAL_CALL component_writeInfo(
lang::XMultiServiceFactory * xMgr, registry::XRegistryKey * xRegistry )
{
if (xRegistry)
{
try
{
// implementation of MyService1A
Reference< registry::XRegistryKey > xKey(
xRegistry->createKey( OUString( RTL_CONSTASCII_USTRINGPARAM(
"my_module.my_sc_implementation.MyService1/UNO/SERVICES") ) ) );
// subkeys denote implemented services of implementation
xKey->createKey( OUString( RTL_CONSTASCII_USTRINGPARAM(
"my_module.MyService1") ) );
// implementation of MyService1B
xKey = xRegistry->createKey( OUString( RTL_CONSTASCII_USTRINGPARAM(
"my_module.my_sc_implementation.MyService2/UNO/SERVICES") ) );
// subkeys denote implemented services of implementation
xKey->createKey( OUString( RTL_CONSTASCII_USTRINGPARAM(
"my_module.MyService2") ) );
return sal_True; // success
}
catch (registry::InvalidRegistryException &)
{
// function fails if exception caught
}
}
return sal_False;
}
extern "C" void * SAL_CALL component_getFactory(
sal_Char const * implName, lang::XMultiServiceFactory * xMgr, void * )
{
Reference< lang::XSingleComponentFactory > xFactory;
if (0 == ::rtl_str_compare( implName, "my_module.my_sc_implementation.MyService1" ))
{
// create component factory for MyService1 implementation
OUString serviceName( RTL_CONSTASCII_USTRINGPARAM("my_module.MyService1") );
xFactory = ::cppu::createSingleComponentFactory(
::my_sc_impl::create_MyService1Impl,
OUString( RTL_CONSTASCII_USTRINGPARAM("my_module.my_sc_implementation.MyService1") ),
Sequence< OUString >( &serviceName, 1 ) );
}
else if (0 == ::rtl_str_compare( implName, "my_module.my_sc_implementation.MyService2" ))
{
// create component factory for MyService12 implementation
OUString serviceName( RTL_CONSTASCII_USTRINGPARAM("my_module.MyService2") );
xFactory = ::cppu::createSingleComponentFactory(
::my_sc_impl::create_MyService2Impl,
OUString( RTL_CONSTASCII_USTRINGPARAM("my_module.my_sc_implementation.MyService2") ),
Sequence< OUString >( &serviceName, 1 ) );
}
if (xFactory.is())
xFactory->acquire();
return xFactory.get(); // return acquired interface pointer or null
}
*/
<commit_msg>INTEGRATION: CWS jsc14 (1.7.14); FILE MERGED 2006/10/25 08:52:23 jsc 1.7.14.1: #i70636# remove auto generated precompiled header include<commit_after>/*************************************************************************
*
* $RCSfile: service1_impl.cxx,v $
*
* $Revision: 1.8 $
*
* last change: $Author: kz $ $Date: 2006-11-06 15:00:06 $
*
* The Contents of this file are made available subject to the terms of
* the BSD license.
*
* Copyright (c) 2003 by Sun Microsystems, Inc.
* 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.
* 3. Neither the name of Sun Microsystems, Inc. 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.
*
*************************************************************************/
#include <osl/interlck.h>
#include <osl/mutex.hxx>
#include <rtl/uuid.h>
#include <cppuhelper/factory.hxx>
#include <com/sun/star/lang/XServiceInfo.hpp>
#include <com/sun/star/lang/XTypeProvider.hpp>
#include <my_module/XSomething.hpp>
using namespace ::rtl; // for OUString
using namespace ::com::sun::star; // for odk interfaces
using namespace ::com::sun::star::uno; // for basic types
namespace my_sc_impl
{
Sequence< OUString > SAL_CALL getSupportedServiceNames_MyService1Impl()
{
Sequence< OUString > names(1);
names[0] = OUString(RTL_CONSTASCII_USTRINGPARAM("my_module.MyService1"));
return names;
}
OUString SAL_CALL getImplementationName_MyService1Impl()
{
return OUString( RTL_CONSTASCII_USTRINGPARAM(
"my_module.my_sc_implementation.MyService1") );
}
class MyService1Impl
: public ::my_module::XSomething
, public lang::XServiceInfo
, public lang::XTypeProvider
{
oslInterlockedCount m_refcount;
OUString m_sData;
// it's good practise to store the context for further use when you use
// other UNO API's in your implementation
Reference< XComponentContext > m_xContext;
public:
inline MyService1Impl(Reference< XComponentContext > const & xContext) throw ()
: m_refcount( 0 ),
m_xContext(xContext)
{}
virtual ~MyService1Impl() {}
// XInterface
virtual Any SAL_CALL queryInterface( Type const & type )
throw (RuntimeException);
virtual void SAL_CALL acquire()
throw ();
virtual void SAL_CALL release()
throw ();
// XTypeProvider
virtual Sequence< Type > SAL_CALL getTypes()
throw (RuntimeException);
virtual Sequence< sal_Int8 > SAL_CALL getImplementationId()
throw (RuntimeException);
// XSomething
virtual OUString SAL_CALL methodOne( OUString const & str )
throw (RuntimeException);
virtual OUString SAL_CALL methodTwo( )
throw (RuntimeException);
// XServiceInfo
virtual OUString SAL_CALL getImplementationName()
throw (RuntimeException);
virtual sal_Bool SAL_CALL supportsService( OUString const & serviceName )
throw (RuntimeException);
virtual Sequence< OUString > SAL_CALL getSupportedServiceNames()
throw (RuntimeException);
};
// XInterface implementation
Any MyService1Impl::queryInterface( Type const & type )
throw (RuntimeException)
{
if (type.equals(::cppu::UnoType< Reference< XInterface > >::get()))
{
// return XInterface interface
// (resolve ambiguity by casting to lang::XTypeProvider)
Reference< XInterface > x(
static_cast< lang::XTypeProvider * >( this ) );
return makeAny( x );
}
if (type.equals(::cppu::UnoType< Reference< lang::XTypeProvider > >::get()))
{
// return XInterface interface
Reference< XInterface > x(
static_cast< lang::XTypeProvider * >( this ) );
return makeAny( x );
}
if (type.equals(::cppu::UnoType< Reference< lang::XServiceInfo > >::get()))
{
// return XServiceInfo interface
Reference< lang::XServiceInfo > x(
static_cast< lang::XServiceInfo * >( this ) );
return makeAny( x );
}
if (type.equals(::cppu::UnoType< Reference< ::my_module::XSomething > >::get()))
{
// return sample interface
Reference< ::my_module::XSomething > x(
static_cast< ::my_module::XSomething * >( this ) );
return makeAny( x );
}
// querying for unsupported type
return Any();
}
void MyService1Impl::acquire()
throw ()
{
// thread-safe incrementation of reference count
::osl_incrementInterlockedCount( &m_refcount );
}
void MyService1Impl::release()
throw ()
{
// thread-safe decrementation of reference count
if (0 == ::osl_decrementInterlockedCount( &m_refcount ))
{
delete this; // shutdown this object
}
}
// XTypeProvider implementation
Sequence< Type > MyService1Impl::getTypes()
throw (RuntimeException)
{
Sequence< Type > seq( 3 );
seq[ 0 ] = ::cppu::UnoType< Reference< lang::XTypeProvider > >::get();
seq[ 1 ] = ::cppu::UnoType< Reference< lang::XServiceInfo > >::get();
seq[ 2 ] = ::cppu::UnoType< Reference< ::my_module::XSomething > >::get();
return seq;
}
Sequence< sal_Int8 > MyService1Impl::getImplementationId()
throw (RuntimeException)
{
static Sequence< sal_Int8 > * s_pId = 0;
if (! s_pId)
{
// create unique id
Sequence< sal_Int8 > id( 16 );
::rtl_createUuid( (sal_uInt8 *)id.getArray(), 0, sal_True );
// guard initialization with some mutex
::osl::MutexGuard guard( ::osl::Mutex::getGlobalMutex() );
if (! s_pId)
{
static Sequence< sal_Int8 > s_id( id );
s_pId = &s_id;
}
}
return *s_pId;
}
// XSomething implementation
OUString MyService1Impl::methodOne( OUString const & str )
throw (RuntimeException)
{
m_sData = str;
return OUString( RTL_CONSTASCII_USTRINGPARAM(
"called methodOne() of MyService1 implementation: ") ) + m_sData;
}
OUString MyService1Impl::methodTwo( )
throw (RuntimeException)
{
return OUString( RTL_CONSTASCII_USTRINGPARAM(
"called methodTwo() of MyService1 implementation: ") ) + m_sData;
}
// XServiceInfo implementation
OUString MyService1Impl::getImplementationName()
throw (RuntimeException)
{
// unique implementation name
return OUString( RTL_CONSTASCII_USTRINGPARAM(
"my_module.my_sc_implementation.MyService1") );
}
sal_Bool MyService1Impl::supportsService( OUString const & serviceName )
throw (RuntimeException)
{
// this object only supports one service, so the test is simple
return serviceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(
"my_module.MyService1") );
}
Sequence< OUString > MyService1Impl::getSupportedServiceNames()
throw (RuntimeException)
{
// this object only supports one service
OUString serviceName( RTL_CONSTASCII_USTRINGPARAM("my_module.MyService1") );
return Sequence< OUString >( &serviceName, 1 );
}
Reference< XInterface > SAL_CALL create_MyService1Impl(
Reference< XComponentContext > const & xContext )
SAL_THROW( () )
{
return static_cast< lang::XTypeProvider * >( new MyService1Impl( xContext) );
}
// forward decl: implemented in service2_impl.cxx
Reference< XInterface > SAL_CALL create_MyService2Impl(
Reference< XComponentContext > const & ) SAL_THROW( () );
}
/*
extern "C" void SAL_CALL component_getImplementationEnvironment(
sal_Char const ** ppEnvTypeName, uno_Environment ** )
{
*ppEnvTypeName = CPPU_CURRENT_LANGUAGE_BINDING_NAME;
}
extern "C" sal_Bool SAL_CALL component_writeInfo(
lang::XMultiServiceFactory * xMgr, registry::XRegistryKey * xRegistry )
{
if (xRegistry)
{
try
{
// implementation of MyService1A
Reference< registry::XRegistryKey > xKey(
xRegistry->createKey( OUString( RTL_CONSTASCII_USTRINGPARAM(
"my_module.my_sc_implementation.MyService1/UNO/SERVICES") ) ) );
// subkeys denote implemented services of implementation
xKey->createKey( OUString( RTL_CONSTASCII_USTRINGPARAM(
"my_module.MyService1") ) );
// implementation of MyService1B
xKey = xRegistry->createKey( OUString( RTL_CONSTASCII_USTRINGPARAM(
"my_module.my_sc_implementation.MyService2/UNO/SERVICES") ) );
// subkeys denote implemented services of implementation
xKey->createKey( OUString( RTL_CONSTASCII_USTRINGPARAM(
"my_module.MyService2") ) );
return sal_True; // success
}
catch (registry::InvalidRegistryException &)
{
// function fails if exception caught
}
}
return sal_False;
}
extern "C" void * SAL_CALL component_getFactory(
sal_Char const * implName, lang::XMultiServiceFactory * xMgr, void * )
{
Reference< lang::XSingleComponentFactory > xFactory;
if (0 == ::rtl_str_compare( implName, "my_module.my_sc_implementation.MyService1" ))
{
// create component factory for MyService1 implementation
OUString serviceName( RTL_CONSTASCII_USTRINGPARAM("my_module.MyService1") );
xFactory = ::cppu::createSingleComponentFactory(
::my_sc_impl::create_MyService1Impl,
OUString( RTL_CONSTASCII_USTRINGPARAM("my_module.my_sc_implementation.MyService1") ),
Sequence< OUString >( &serviceName, 1 ) );
}
else if (0 == ::rtl_str_compare( implName, "my_module.my_sc_implementation.MyService2" ))
{
// create component factory for MyService12 implementation
OUString serviceName( RTL_CONSTASCII_USTRINGPARAM("my_module.MyService2") );
xFactory = ::cppu::createSingleComponentFactory(
::my_sc_impl::create_MyService2Impl,
OUString( RTL_CONSTASCII_USTRINGPARAM("my_module.my_sc_implementation.MyService2") ),
Sequence< OUString >( &serviceName, 1 ) );
}
if (xFactory.is())
xFactory->acquire();
return xFactory.get(); // return acquired interface pointer or null
}
*/
<|endoftext|>
|
<commit_before>/****************************************************************************
**
** Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the QtDeclarative module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the Technology Preview License Agreement accompanying
** this package.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** If you have questions regarding the use of this file, please contact
** Nokia at qt-info@nokia.com.
**
**
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include <QDebug>
#include <qdeclarativeextensionplugin.h>
#include <qdeclarativeengine.h>
#include <qdeclarative.h>
#include <qcontactmanager.h>
#include <qcontactdetails.h>
#include "qdeclarativecontactimageprovider_p.h"
QTM_USE_NAMESPACE
// This is run in a low priority thread.
QImage ContactThumbnailImageProvider::requestImage(const QString &id, QSize *size, const QSize &req_size)
{
if (m_thumbnails.contains(id)) {
if (size)
*size = req_size;
return m_thumbnails.value(id).scaled(req_size);
}
/* url format:
image://thumbnail/{manager.contactid}
*/
QString managerName = id.split('.').first();
QString localId = id.split('.').last();
QContactManager* manager = 0;
if (m_managers.contains(managerName)) {
manager = m_managers.value(managerName);
} else {
manager = new QContactManager(managerName);
m_managers.insert(managerName, manager);
}
QContact c = manager->contact(localId.toInt());
QImage image(
req_size.width() > 0 ? req_size.width() : 100,
req_size.height() > 0 ? req_size.height() : 50,
QImage::Format_RGB32);
QContactThumbnail t = c.detail<QContactThumbnail>();
if (!t.thumbnail().isNull()) {
image = t.thumbnail().scaled(image.size());
} else {
QContactAvatar a = c.detail<QContactAvatar>();
QString imageUrl = a.imageUrl().isEmpty()? QLatin1String(":/default.svg") : a.imageUrl().toString();
image.load(imageUrl);
}
if (size)
*size = image.size();
m_thumbnails.insert(id, image);
return image;
}
ContactThumbnailImageProvider::ContactThumbnailImageProvider()
:QDeclarativeImageProvider(QDeclarativeImageProvider::Image)
{
}
ContactThumbnailImageProvider::~ContactThumbnailImageProvider()
{
foreach(const QString& name, m_managers.keys()) {
delete m_managers.value(name);
}
m_managers.clear();
}
<commit_msg>Fix QTMOBILITY-1220:qmlcontacts does not show thumbnail properly<commit_after>/****************************************************************************
**
** Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the QtDeclarative module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the Technology Preview License Agreement accompanying
** this package.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** If you have questions regarding the use of this file, please contact
** Nokia at qt-info@nokia.com.
**
**
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include <QDebug>
#include <qdeclarativeextensionplugin.h>
#include <qdeclarativeengine.h>
#include <qdeclarative.h>
#include <qcontactmanager.h>
#include <qcontactdetails.h>
#include "qdeclarativecontactimageprovider_p.h"
QTM_USE_NAMESPACE
// This is run in a low priority thread.
QImage ContactThumbnailImageProvider::requestImage(const QString &id, QSize *size, const QSize &req_size)
{
if (m_thumbnails.contains(id)) {
if (size)
*size = req_size;
return m_thumbnails.value(id).scaled(req_size);
}
/* url format:
image://thumbnail/{managerUri.contactid}
*/
QString managerUri = id.split('.').first();
QString localId = id.split('.').last();
QContactManager* manager = 0;
if (m_managers.contains(managerUri)) {
manager = m_managers.value(managerUri);
} else {
manager = QContactManager::fromUri(managerUri);
m_managers.insert(managerUri, manager);
}
QContact c = manager->contact(localId.toInt());
QImage image(
req_size.width() > 0 ? req_size.width() : 100,
req_size.height() > 0 ? req_size.height() : 50,
QImage::Format_RGB32);
QContactThumbnail t = c.detail<QContactThumbnail>();
if (!t.thumbnail().isNull()) {
image = t.thumbnail().scaled(image.size());
} else {
QContactAvatar a = c.detail<QContactAvatar>();
QString imageUrl = a.imageUrl().isEmpty()? QLatin1String(":/default.svg") : a.imageUrl().toString();
image.load(imageUrl);
}
if (size)
*size = image.size();
m_thumbnails.insert(id, image);
return image;
}
ContactThumbnailImageProvider::ContactThumbnailImageProvider()
:QDeclarativeImageProvider(QDeclarativeImageProvider::Image)
{
}
ContactThumbnailImageProvider::~ContactThumbnailImageProvider()
{
foreach(const QString& name, m_managers.keys()) {
delete m_managers.value(name);
}
m_managers.clear();
}
<|endoftext|>
|
<commit_before>#include "parentwlxwindow.h"
#include "wlx_interfaces.h"
#include <QApplication>
#include <QLabel>
#include <QSet>
#include <QTimer>
#include <QVBoxLayout>
#if QT_VERSION >= QT_VERSION_CHECK(5,0,0)
#include <QWindow>
#define QT_WA(unicode, ansi) unicode
#endif
static LRESULT CALLBACK WndProc(HWND hWnd, UINT Msg, WPARAM wParam, LPARAM lParam)
{
ParentWlxWindow* tcmdWin = ParentWlxWindow::getByHandle(hWnd);
if (tcmdWin)
{
// choice of WndProc
WNDPROC proc = tcmdWin->isKeyboardExclusive() ? tcmdWin->origWndProc() :
tcmdWin->listerWndProc();
QSet<UINT> keyEvents;
keyEvents.insert(WM_KEYDOWN);
keyEvents.insert(WM_KEYUP);
keyEvents.insert(WM_DEADCHAR);
keyEvents.insert(WM_SYSDEADCHAR);
keyEvents.insert(WM_CHAR);
keyEvents.insert(WM_UNICHAR);
keyEvents.insert(WM_HOTKEY);
if (keyEvents.contains(Msg))
{
// reload
switch(wParam)
{
case VK_F2:
tcmdWin->reloadWidget();
break;
case VK_ESCAPE:
// set proc to Lister
proc = tcmdWin->listerWndProc();
break;
default:
break;
}
}
else
{
// if Msg is not WM_KEYUP then proc should be ListerWndProc
proc = tcmdWin->listerWndProc();
}
return CallWindowProc(proc, hWnd, Msg, wParam, lParam);
}
return E_FAIL;
}
// returns S_OK for all events
static LRESULT CALLBACK DummyWndProc(HWND /*hWnd*/, UINT /*Msg*/, WPARAM /*wParam*/, LPARAM /*lParam*/)
{
return S_OK;
}
ParentWlxWindow::ParentWlxWindow(const Interface& keeper, WId hParentWin) :
QWidget(),
m_keeper(keeper),
m_keyboardExclusive(false),
m_origWndProc((WNDPROC)GetWindowLongPtr((HWND)winId(), GWLP_WNDPROC)),
m_listerWndProc(NULL),
m_firstShowTimer(new QTimer(this)),
m_childWindow(NULL)
{
// keep the pointer to this into GWLP_USERDATA
SetWindowLongPtr((HWND)winId(), GWLP_USERDATA, (LONG_PTR)this);
setNativeParent(hParentWin);
setAttribute(Qt::WA_DeleteOnClose, true);
// layout
QVBoxLayout* lay = new QVBoxLayout(this);
lay->setContentsMargins(0,0,0,0);
lay->setSpacing(0);
setLayout(lay);
}
ParentWlxWindow::~ParentWlxWindow()
{
releaseChild();
// set previous window proc
WNDPROC proc = m_listerWndProc ? m_listerWndProc : m_origWndProc;
_assert(proc != WndProc);
SetWindowLongPtr((HWND)winId(), GWLP_WNDPROC, (LONG_PTR)proc);
m_listerWndProc = NULL;
m_origWndProc = NULL;
}
void ParentWlxWindow::setChildWindow(IAbstractWlxWindow* childWindow)
{
releaseChild();
QWidget* w = childWindow->widget();
_assert(w);
if (w)
{
m_childWindow = childWindow;
layout()->addWidget(w);
m_childWindow->initEmbedded();
_log("Window is embedded");
w->show();
}
else
{
layout()->addWidget(new QLabel(QString("Cannot cast IAbstractWlxWindow* to QWidget*")));
_log("Window is NOT embedded. Cannot cast to QWidget*.");
}
}
ParentWlxWindow* ParentWlxWindow::getByHandle(HWND hwnd)
{
QWidget* p = (QWidget*)GetWindowLongPtr(hwnd, GWLP_USERDATA);
return qobject_cast<ParentWlxWindow*> (p);
}
void ParentWlxWindow::reloadWidget()
{
_assert(m_childWindow);
if (m_childWindow)
{
m_childWindow->reload();
}
}
void ParentWlxWindow::releaseChild()
{
if (m_childWindow)
{
// clear layout
while(layout()->count())
{
layout()->takeAt(0);
}
m_childWindow->widget()->deleteLater();
_log(QString("Child window destroyed: ") + QString::number((quint64)m_childWindow, 16));
m_childWindow = NULL;
}
}
void ParentWlxWindow::setNativeParent(WId hParentWin)
{
// make the widget window style be WS_CHILD so SetParent will work
SetWindowLongPtr((HWND)winId(), GWL_STYLE,
(hParentWin ? WS_CHILD : WS_POPUP) |
WS_CLIPCHILDREN |
WS_CLIPSIBLINGS /*|
WS_EX_NOPARENTNOTIFY*/);
#if QT_VERSION >= QT_VERSION_CHECK(5,0,0)
QWindow* window = windowHandle();
window->setProperty("_q_embedded_native_parent_handle", hParentWin ? (WId)hParentWin : QVariant());
SetParent((HWND)winId(), (HWND)hParentWin);
window->setFlags(Qt::FramelessWindowHint);
#else
SetParent(winId(), (HWND)hParentWin);
#endif
QEvent e(QEvent::EmbeddingControl);
QApplication::sendEvent(this, &e);
}
WId ParentWlxWindow::nativeParent() const
{
return (WId)GetAncestor((HWND)winId(), GA_PARENT);
}
void ParentWlxWindow::showEvent(QShowEvent* e)
{
QWidget::showEvent(e);
connect(m_firstShowTimer, &QTimer::timeout, this, &ParentWlxWindow::onFirstShowTimer);
m_firstShowTimer->start(200);
}
#if QT_VERSION >= QT_VERSION_CHECK(5,0,0)
bool ParentWlxWindow::nativeEvent(const QByteArray&, void* message, long* /*result*/)
#else
bool ParentWlxWindow::winEvent(MSG* msg, long* /*result*/)
#endif
{
#if QT_VERSION >= QT_VERSION_CHECK(5,0,0)
MSG *msg = (MSG *)message;
#endif
if (msg->message == WM_DESTROY)
{
close();
}
return false;
}
void ParentWlxWindow::onFirstShowTimer()
{
WNDPROC proc = (WNDPROC)GetWindowLongPtr((HWND)winId(), GWLP_WNDPROC);
if ( ( proc != m_origWndProc ) && ( ! m_listerWndProc ) )
{
m_listerWndProc = proc;
// replace default window procedure
SetWindowLongPtr((HWND)winId(), GWLP_WNDPROC, (LONG_PTR)WndProc);
m_firstShowTimer->stop();
}
}
void ParentWlxWindow::setListerOptions(int itemtype, int value) const
{
PostMessage((HWND)nativeParent(), WM_COMMAND, MAKELONG(value, itemtype),(LPARAM)winId());
}
QString ParentWlxWindow::listerTitle() const
{
if (HWND hParent = (HWND)nativeParent())
{
QVector<TCHAR> wStrTitle(GetWindowTextLength(hParent) + 1);
GetWindowText(hParent, wStrTitle.data(), wStrTitle.size());
QString title = QString::fromWCharArray(wStrTitle.constData());
return title;
}
_assert_ex(false, "Parent handle is not accessible");
return QString();
}
void ParentWlxWindow::setListerTitle(const QString& title)
{
if (HWND hParent = (HWND)nativeParent())
{
QVector<TCHAR> wStrTitle(title.size() + 1);
title.toWCharArray(wStrTitle.data());
SetWindowText(hParent, wStrTitle.constData());
}
else
{
_assert_ex(false, "Parent handle is not accessible");
}
}
<commit_msg>Fix duplicate reload() calls on F2 key press<commit_after>#include "parentwlxwindow.h"
#include "wlx_interfaces.h"
#include <QApplication>
#include <QLabel>
#include <QSet>
#include <QTimer>
#include <QVBoxLayout>
#if QT_VERSION >= QT_VERSION_CHECK(5,0,0)
#include <QWindow>
#define QT_WA(unicode, ansi) unicode
#endif
static LRESULT CALLBACK WndProc(HWND hWnd, UINT Msg, WPARAM wParam, LPARAM lParam)
{
ParentWlxWindow* tcmdWin = ParentWlxWindow::getByHandle(hWnd);
if (tcmdWin)
{
// choice of WndProc
WNDPROC proc = tcmdWin->isKeyboardExclusive() ? tcmdWin->origWndProc() :
tcmdWin->listerWndProc();
if (WM_KEYDOWN == Msg)
{
switch (wParam)
{
case VK_F2:
tcmdWin->reloadWidget();
break;
case VK_ESCAPE:
// set proc to Lister
proc = tcmdWin->listerWndProc();
break;
default:
break;
}
}
else
{
proc = tcmdWin->listerWndProc();
}
return CallWindowProc(proc, hWnd, Msg, wParam, lParam);
}
return E_FAIL;
}
ParentWlxWindow::ParentWlxWindow(const Interface& keeper, WId hParentWin) :
QWidget(),
m_keeper(keeper),
m_keyboardExclusive(false),
m_origWndProc((WNDPROC)GetWindowLongPtr((HWND)winId(), GWLP_WNDPROC)),
m_listerWndProc(NULL),
m_firstShowTimer(new QTimer(this)),
m_childWindow(NULL)
{
// keep the pointer to this into GWLP_USERDATA
SetWindowLongPtr((HWND)winId(), GWLP_USERDATA, (LONG_PTR)this);
setNativeParent(hParentWin);
setAttribute(Qt::WA_DeleteOnClose, true);
// layout
QVBoxLayout* lay = new QVBoxLayout(this);
lay->setContentsMargins(0,0,0,0);
lay->setSpacing(0);
setLayout(lay);
}
ParentWlxWindow::~ParentWlxWindow()
{
releaseChild();
// set previous window proc
WNDPROC proc = m_listerWndProc ? m_listerWndProc : m_origWndProc;
_assert(proc != WndProc);
SetWindowLongPtr((HWND)winId(), GWLP_WNDPROC, (LONG_PTR)proc);
m_listerWndProc = NULL;
m_origWndProc = NULL;
}
void ParentWlxWindow::setChildWindow(IAbstractWlxWindow* childWindow)
{
releaseChild();
QWidget* w = childWindow->widget();
_assert(w);
if (w)
{
m_childWindow = childWindow;
layout()->addWidget(w);
m_childWindow->initEmbedded();
_log("Window is embedded");
w->show();
}
else
{
layout()->addWidget(new QLabel(QString("Cannot cast IAbstractWlxWindow* to QWidget*")));
_log("Window is NOT embedded. Cannot cast to QWidget*.");
}
}
ParentWlxWindow* ParentWlxWindow::getByHandle(HWND hwnd)
{
QWidget* p = (QWidget*)GetWindowLongPtr(hwnd, GWLP_USERDATA);
return qobject_cast<ParentWlxWindow*> (p);
}
void ParentWlxWindow::reloadWidget()
{
_assert(m_childWindow);
if (m_childWindow)
{
m_childWindow->reload();
}
}
void ParentWlxWindow::releaseChild()
{
if (m_childWindow)
{
// clear layout
while(layout()->count())
{
layout()->takeAt(0);
}
m_childWindow->widget()->deleteLater();
_log(QString("Child window destroyed: ") + QString::number((quint64)m_childWindow, 16));
m_childWindow = NULL;
}
}
void ParentWlxWindow::setNativeParent(WId hParentWin)
{
// make the widget window style be WS_CHILD so SetParent will work
SetWindowLongPtr((HWND)winId(), GWL_STYLE,
(hParentWin ? WS_CHILD : WS_POPUP) |
WS_CLIPCHILDREN |
WS_CLIPSIBLINGS /*|
WS_EX_NOPARENTNOTIFY*/);
#if QT_VERSION >= QT_VERSION_CHECK(5,0,0)
QWindow* window = windowHandle();
window->setProperty("_q_embedded_native_parent_handle", hParentWin ? (WId)hParentWin : QVariant());
SetParent((HWND)winId(), (HWND)hParentWin);
window->setFlags(Qt::FramelessWindowHint);
#else
SetParent(winId(), (HWND)hParentWin);
#endif
QEvent e(QEvent::EmbeddingControl);
QApplication::sendEvent(this, &e);
}
WId ParentWlxWindow::nativeParent() const
{
return (WId)GetAncestor((HWND)winId(), GA_PARENT);
}
void ParentWlxWindow::showEvent(QShowEvent* e)
{
QWidget::showEvent(e);
connect(m_firstShowTimer, &QTimer::timeout, this, &ParentWlxWindow::onFirstShowTimer);
m_firstShowTimer->start(200);
}
#if QT_VERSION >= QT_VERSION_CHECK(5,0,0)
bool ParentWlxWindow::nativeEvent(const QByteArray&, void* message, long* /*result*/)
#else
bool ParentWlxWindow::winEvent(MSG* msg, long* /*result*/)
#endif
{
#if QT_VERSION >= QT_VERSION_CHECK(5,0,0)
MSG *msg = (MSG *)message;
#endif
if (msg->message == WM_DESTROY)
{
close();
}
return false;
}
void ParentWlxWindow::onFirstShowTimer()
{
WNDPROC proc = (WNDPROC)GetWindowLongPtr((HWND)winId(), GWLP_WNDPROC);
if ( ( proc != m_origWndProc ) && ( ! m_listerWndProc ) )
{
m_listerWndProc = proc;
// replace default window procedure
SetWindowLongPtr((HWND)winId(), GWLP_WNDPROC, (LONG_PTR)WndProc);
m_firstShowTimer->stop();
}
}
void ParentWlxWindow::setListerOptions(int itemtype, int value) const
{
PostMessage((HWND)nativeParent(), WM_COMMAND, MAKELONG(value, itemtype),(LPARAM)winId());
}
QString ParentWlxWindow::listerTitle() const
{
if (HWND hParent = (HWND)nativeParent())
{
QVector<TCHAR> wStrTitle(GetWindowTextLength(hParent) + 1);
GetWindowText(hParent, wStrTitle.data(), wStrTitle.size());
QString title = QString::fromWCharArray(wStrTitle.constData());
return title;
}
_assert_ex(false, "Parent handle is not accessible");
return QString();
}
void ParentWlxWindow::setListerTitle(const QString& title)
{
if (HWND hParent = (HWND)nativeParent())
{
QVector<TCHAR> wStrTitle(title.size() + 1);
title.toWCharArray(wStrTitle.data());
SetWindowText(hParent, wStrTitle.constData());
}
else
{
_assert_ex(false, "Parent handle is not accessible");
}
}
<|endoftext|>
|
<commit_before>// This file is a part of the IncludeOS unikernel - www.includeos.org
//
// Copyright 2015 Oslo and Akershus University College of Applied Sciences
// and Alfred Bratterud
//
// 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 PRINT_INFO
//#define DEBUG
//#define DEBUG2
#include "virtionet.hpp"
#include <net/packet.hpp>
#include <kernel/irq_manager.hpp>
#include <kernel/syscalls.hpp>
#include <hw/pci.hpp>
#include <cstdlib>
#include <malloc.h>
#include <string.h>
//#define NO_DEFERRED_KICK
#ifndef NO_DEFERRED_KICK
static std::vector<VirtioNet*> deferred_devices;
static uint8_t deferred_intr;
#endif
using namespace net;
void VirtioNet::get_config() {
Virtio::get_config(&_conf, _config_length);
}
VirtioNet::VirtioNet(hw::PCI_Device& d)
: Virtio(d),
Link(Link_protocol{{this, &VirtioNet::transmit}, mac()},
std::max(2048u, queue_size(0) * 2), sizeof(net::Packet) + sizeof(virtio_net_hdr) + MTU()),
packets_rx_{Statman::get().create(Stat::UINT64, device_name() + ".packets_rx").get_uint64()},
packets_tx_{Statman::get().create(Stat::UINT64, device_name() + ".packets_tx").get_uint64()}
{
INFO("VirtioNet", "Driver initializing");
// this must be true, otherwise packets will be created incorrectly
assert(sizeof(virtio_net_hdr) <= sizeof(Packet));
uint32_t needed_features = 0
| (1 << VIRTIO_NET_F_MAC)
| (1 << VIRTIO_NET_F_STATUS)
;//| (1 << VIRTIO_NET_F_MRG_RXBUF); //Merge RX Buffers (Everything i 1 buffer)
uint32_t wanted_features = needed_features;
negotiate_features(wanted_features);
CHECK ((features() & needed_features) == needed_features,
"Negotiated needed features");
CHECK ((features() & wanted_features) == wanted_features,
"Negotiated wanted features");
CHECK(features() & (1 << VIRTIO_NET_F_CSUM),
"Device handles packets w. partial checksum");
CHECK(features() & (1 << VIRTIO_NET_F_GUEST_CSUM),
"Guest handles packets w. partial checksum");
CHECK(features() & (1 << VIRTIO_NET_F_CTRL_VQ),
"There's a control queue");
CHECK(features() & (1 << VIRTIO_F_ANY_LAYOUT),
"Queue can handle any header/data layout");
CHECK(features() & (1 << VIRTIO_F_RING_INDIRECT_DESC),
"We can use indirect descriptors");
CHECK(features() & (1 << VIRTIO_F_RING_EVENT_IDX),
"There's a Ring Event Index to use");
CHECK(features() & (1 << VIRTIO_NET_F_MQ),
"There are multiple queue pairs");
if (features() & (1 << VIRTIO_NET_F_MQ))
printf("\t\t* max_virtqueue_pairs: 0x%x \n",_conf.max_virtq_pairs);
CHECK(features() & (1 << VIRTIO_NET_F_MRG_RXBUF),
"Merge RX buffers");
/** RX que is 0, TX Queue is 1 - Virtio Std. §5.1.2 */
new (&rx_q) Virtio::Queue(queue_size(0),0,iobase());
new (&tx_q) Virtio::Queue(queue_size(1),1,iobase());
new (&ctrl_q) Virtio::Queue(queue_size(2),2,iobase());
// Step 1 - Initialize RX/TX queues
auto success = assign_queue(0, (uint32_t)rx_q.queue_desc());
CHECK(success, "RX queue (%u) assigned (0x%x) to device",
rx_q.size(), (uint32_t)rx_q.queue_desc());
success = assign_queue(1, (uint32_t)tx_q.queue_desc());
CHECK(success, "TX queue (%u) assigned (0x%x) to device",
tx_q.size(), (uint32_t)tx_q.queue_desc());
// Step 2 - Initialize Ctrl-queue if it exists
if (features() & (1 << VIRTIO_NET_F_CTRL_VQ)) {
success = assign_queue(2, (uint32_t)tx_q.queue_desc());
CHECK(success, "CTRL queue (%u) assigned (0x%x) to device",
ctrl_q.size(), (uint32_t)ctrl_q.queue_desc());
}
// Step 3 - Fill receive queue with buffers
// DEBUG: Disable
INFO("VirtioNet", "Adding %u receive buffers of size %u",
rx_q.size(), bufsize());
for (int i = 0; i < rx_q.size(); i++) add_receive_buffer();
// Step 4 - If there are many queues, we should negotiate the number.
// Set config length, based on whether there are multiple queues
if (features() & (1 << VIRTIO_NET_F_MQ))
_config_length = sizeof(config);
else
_config_length = sizeof(config) - sizeof(uint16_t);
// @todo: Specify how many queues we're going to use.
// Step 5 - get the mac address (we're demanding this feature)
// Step 6 - get the status - demanding this as well.
// Getting the MAC + status
get_config();
CHECK(_conf.mac.major > 0, "Valid Mac address: %s",
_conf.mac.str().c_str());
// Step 7 - 9 - GSO: @todo Not using GSO features yet.
// Signal setup complete.
setup_complete((features() & needed_features) == needed_features);
CHECK((features() & needed_features) == needed_features, "Signalled driver OK");
// Hook up interrupts
if (has_msix())
{
assert(get_msix_vectors() >= 3);
// for now use service queues, otherwise stress test fails
auto recv_del(delegate<void()>{this, &VirtioNet::msix_recv_handler});
auto xmit_del(delegate<void()>{this, &VirtioNet::msix_xmit_handler});
auto conf_del(delegate<void()>{this, &VirtioNet::msix_conf_handler});
// update BSP IDT
IRQ_manager::get().subscribe(irq() + 0, recv_del);
IRQ_manager::get().subscribe(irq() + 1, xmit_del);
IRQ_manager::get().subscribe(irq() + 2, conf_del);
}
else
{
assert(0 && "Legacy IRQs not supported");
}
#ifndef NO_DEFERRED_KICK
static bool init_deferred = false;
if (!init_deferred) {
init_deferred = true;
deferred_intr = IRQ_manager::get().get_next_msix_irq();
IRQ_manager::get().subscribe(deferred_intr, handle_deferred_devices);
}
#endif
// Done
INFO("VirtioNet", "Driver initialization complete");
CHECK(_conf.status & 1, "Link up\n");
rx_q.kick();
}
void VirtioNet::msix_conf_handler()
{
debug("\t <VirtioNet> Configuration change:\n");
// Getting the MAC + status
debug("\t Old status: 0x%x\n",_conf.status);
get_config();
debug("\t New status: 0x%x \n",_conf.status);
}
void VirtioNet::msix_recv_handler()
{
bool dequeued_rx = false;
rx_q.disable_interrupts();
// handle incoming packets as long as bufstore has available buffers
while (rx_q.new_incoming() && bufstore().available() > 1)
{
auto res = rx_q.dequeue();
auto pckt_ptr = recv_packet(res.data(), res.size());
Link::receive(std::move(pckt_ptr));
// Requeue a new buffer
add_receive_buffer();
dequeued_rx = true;
// Stat increase packets received
packets_rx_++;
}
rx_q.enable_interrupts();
if (dequeued_rx)
rx_q.kick();
}
void VirtioNet::msix_xmit_handler()
{
bool dequeued_tx = false;
tx_q.disable_interrupts();
// Do one TX-packet
while (tx_q.new_incoming())
{
auto res = tx_q.dequeue();
assert(res.data());
// get packet offset, and call destructor
auto* packet = (net::Packet*) (res.data() - sizeof(net::Packet));
packet->~Packet(); // call destructor on Packet to release it
dequeued_tx = true;
}
// If we have a transmit queue, eat from it, otherwise let the stack know we
// have increased transmit capacity
if (dequeued_tx) {
debug("<VirtioNet>%i dequeued, transmitting backlog\n", dequeued_tx);
// transmit as much as possible from the buffer
if (transmit_queue_){
transmit(std::move(transmit_queue_));
}
// If we now emptied the buffer, offer packets to stack
if (!transmit_queue_ && tx_q.num_free() > 1)
transmit_queue_available_event_(tx_q.num_free() / 2);
}
}
void VirtioNet::add_receive_buffer()
{
auto* pkt = bufstore().get_buffer();
// offset pointer to virtionet header
auto* vnet = pkt + sizeof(Packet);
Token token2 { {vnet, sizeof(virtio_net_hdr) + MTU()}, Token::IN };
std::array<Token, 1> tokens {{ token2 }};
rx_q.enqueue(tokens);
}
net::Packet_ptr
VirtioNet::recv_packet(uint8_t* data, uint16_t size)
{
auto* ptr = (net::Packet*) (data - sizeof(net::Packet));
#ifdef DEBUG
assert(bufstore().is_from_pool((uint8_t*) ptr));
assert(bufstore().is_buffer((uint8_t*) ptr));
#endif
new (ptr) net::Packet(MTU(), size - sizeof(virtio_net_hdr), sizeof(virtio_net_hdr), &bufstore());
return net::Packet_ptr(ptr);
}
net::Packet_ptr
VirtioNet::create_packet(uint16_t size)
{
auto* ptr = (net::Packet*) bufstore().get_buffer();
new (ptr) net::Packet(MTU(), size, sizeof(virtio_net_hdr), &bufstore());
return net::Packet_ptr(ptr);
}
void VirtioNet::add_to_tx_buffer(net::Packet_ptr pckt){
if (transmit_queue_)
transmit_queue_->chain(std::move(pckt));
else
transmit_queue_ = std::move(pckt);
#ifdef DEBUG
size_t chain_length = 1;
auto* next = transmit_queue_->tail();
while (next) {
chain_length++;
next = next->tail();
}
#endif
debug("Buffering, %i packets chained \n", chain_length);
}
void VirtioNet::transmit(net::Packet_ptr pckt) {
/** @note We have to send a virtio header first, then the packet.
From Virtio std. §5.1.6.6:
"When using legacy interfaces, transitional drivers which have not
negotiated VIRTIO_F_ANY_LAYOUT MUST use a single descriptor for the struct
virtio_net_hdr on both transmit and receive, with the network data in the
following descriptors."
VirtualBox *does not* accept ANY_LAYOUT, while Qemu does, so this is to
support VirtualBox
*/
int transmitted = 0;
net::Packet_ptr tail = std::move(pckt);
// Transmit all we can directly
while (tx_q.num_free() and tail) {
debug("%i tokens left in TX queue \n", tx_q.num_free());
// next in line
auto next = tail->detach_tail();
// write data to network
// explicitly release the data to prevent destructor being called
enqueue(tail.release());
tail = std::move(next);
transmitted++;
// Stat increase packets transmitted
packets_tx_++;
if (!tail) break;
}
// Notify virtio about new packets
if (LIKELY(transmitted)) {
begin_deferred_kick();
}
// Buffer the rest
if (UNLIKELY(tail)) {
debug("Buffering remaining packets..\n");
add_to_tx_buffer(std::move(tail));
}
}
void VirtioNet::enqueue(net::Packet* pckt)
{
auto* hdr = pckt->buffer() - sizeof(virtio_net_hdr);
Token token1 {{ hdr, sizeof(virtio_net_hdr)}, Token::OUT };
Token token2 {{ pckt->buffer(), pckt->size()}, Token::OUT };
std::array<Token, 2> tokens {{ token1, token2 }};
// Enqueue scatterlist, 2 pieces readable, 0 writable.
tx_q.enqueue(tokens);
}
void VirtioNet::begin_deferred_kick()
{
#ifdef NO_DEFERRED_KICK
tx_q.enable_interrupts();
tx_q.kick();
#else
if (!deferred_kick) {
deferred_kick = true;
deferred_devices.push_back(this);
IRQ_manager::get().register_irq(deferred_intr);
}
#endif
}
void VirtioNet::handle_deferred_devices()
{
#ifndef NO_DEFERRED_KICK
for (auto* dev : deferred_devices) {
// kick transmitq
dev->deferred_kick = false;
dev->tx_q.enable_interrupts();
dev->tx_q.kick();
}
deferred_devices.clear();
#endif
}
void VirtioNet::deactivate()
{
/// disable interrupts on virtio queues
rx_q.disable_interrupts();
tx_q.disable_interrupts();
ctrl_q.disable_interrupts();
/// mask off MSI-X vectors
if (has_msix())
deactivate_msix();
}
#include <kernel/pci_manager.hpp>
/** Register VirtioNet's driver factory at the PCI_manager */
static struct Autoreg_virtionet {
Autoreg_virtionet() {
PCI_manager::register_driver<hw::Nic>(hw::PCI_Device::VENDOR_VIRTIO, 0x1000, &VirtioNet::new_instance);
}
} autoreg_virtionet;
<commit_msg>virtionet: Undo combine receive tokens<commit_after>// This file is a part of the IncludeOS unikernel - www.includeos.org
//
// Copyright 2015 Oslo and Akershus University College of Applied Sciences
// and Alfred Bratterud
//
// 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 PRINT_INFO
//#define DEBUG
//#define DEBUG2
#include "virtionet.hpp"
#include <net/packet.hpp>
#include <kernel/irq_manager.hpp>
#include <kernel/syscalls.hpp>
#include <hw/pci.hpp>
#include <cstdlib>
#include <malloc.h>
#include <string.h>
//#define NO_DEFERRED_KICK
#ifndef NO_DEFERRED_KICK
static std::vector<VirtioNet*> deferred_devices;
static uint8_t deferred_intr;
#endif
using namespace net;
void VirtioNet::get_config() {
Virtio::get_config(&_conf, _config_length);
}
VirtioNet::VirtioNet(hw::PCI_Device& d)
: Virtio(d),
Link(Link_protocol{{this, &VirtioNet::transmit}, mac()},
std::max(2048u, queue_size(0) * 2), sizeof(net::Packet) + sizeof(virtio_net_hdr) + MTU()),
packets_rx_{Statman::get().create(Stat::UINT64, device_name() + ".packets_rx").get_uint64()},
packets_tx_{Statman::get().create(Stat::UINT64, device_name() + ".packets_tx").get_uint64()}
{
INFO("VirtioNet", "Driver initializing");
// this must be true, otherwise packets will be created incorrectly
assert(sizeof(virtio_net_hdr) <= sizeof(Packet));
uint32_t needed_features = 0
| (1 << VIRTIO_NET_F_MAC)
| (1 << VIRTIO_NET_F_STATUS)
;//| (1 << VIRTIO_NET_F_MRG_RXBUF); //Merge RX Buffers (Everything i 1 buffer)
uint32_t wanted_features = needed_features;
negotiate_features(wanted_features);
CHECK ((features() & needed_features) == needed_features,
"Negotiated needed features");
CHECK ((features() & wanted_features) == wanted_features,
"Negotiated wanted features");
CHECK(features() & (1 << VIRTIO_NET_F_CSUM),
"Device handles packets w. partial checksum");
CHECK(features() & (1 << VIRTIO_NET_F_GUEST_CSUM),
"Guest handles packets w. partial checksum");
CHECK(features() & (1 << VIRTIO_NET_F_CTRL_VQ),
"There's a control queue");
CHECK(features() & (1 << VIRTIO_F_ANY_LAYOUT),
"Queue can handle any header/data layout");
CHECK(features() & (1 << VIRTIO_F_RING_INDIRECT_DESC),
"We can use indirect descriptors");
CHECK(features() & (1 << VIRTIO_F_RING_EVENT_IDX),
"There's a Ring Event Index to use");
CHECK(features() & (1 << VIRTIO_NET_F_MQ),
"There are multiple queue pairs");
if (features() & (1 << VIRTIO_NET_F_MQ))
printf("\t\t* max_virtqueue_pairs: 0x%x \n",_conf.max_virtq_pairs);
CHECK(features() & (1 << VIRTIO_NET_F_MRG_RXBUF),
"Merge RX buffers");
/** RX que is 0, TX Queue is 1 - Virtio Std. §5.1.2 */
new (&rx_q) Virtio::Queue(queue_size(0),0,iobase());
new (&tx_q) Virtio::Queue(queue_size(1),1,iobase());
new (&ctrl_q) Virtio::Queue(queue_size(2),2,iobase());
// Step 1 - Initialize RX/TX queues
auto success = assign_queue(0, (uint32_t)rx_q.queue_desc());
CHECK(success, "RX queue (%u) assigned (0x%x) to device",
rx_q.size(), (uint32_t)rx_q.queue_desc());
success = assign_queue(1, (uint32_t)tx_q.queue_desc());
CHECK(success, "TX queue (%u) assigned (0x%x) to device",
tx_q.size(), (uint32_t)tx_q.queue_desc());
// Step 2 - Initialize Ctrl-queue if it exists
if (features() & (1 << VIRTIO_NET_F_CTRL_VQ)) {
success = assign_queue(2, (uint32_t)tx_q.queue_desc());
CHECK(success, "CTRL queue (%u) assigned (0x%x) to device",
ctrl_q.size(), (uint32_t)ctrl_q.queue_desc());
}
// Step 3 - Fill receive queue with buffers
// DEBUG: Disable
INFO("VirtioNet", "Adding %u receive buffers of size %u",
rx_q.size() / 2, bufsize());
for (int i = 0; i < rx_q.size() / 2; i++) add_receive_buffer();
// Step 4 - If there are many queues, we should negotiate the number.
// Set config length, based on whether there are multiple queues
if (features() & (1 << VIRTIO_NET_F_MQ))
_config_length = sizeof(config);
else
_config_length = sizeof(config) - sizeof(uint16_t);
// @todo: Specify how many queues we're going to use.
// Step 5 - get the mac address (we're demanding this feature)
// Step 6 - get the status - demanding this as well.
// Getting the MAC + status
get_config();
CHECK(_conf.mac.major > 0, "Valid Mac address: %s",
_conf.mac.str().c_str());
// Step 7 - 9 - GSO: @todo Not using GSO features yet.
// Signal setup complete.
setup_complete((features() & needed_features) == needed_features);
CHECK((features() & needed_features) == needed_features, "Signalled driver OK");
// Hook up interrupts
if (has_msix())
{
assert(get_msix_vectors() >= 3);
// for now use service queues, otherwise stress test fails
auto recv_del(delegate<void()>{this, &VirtioNet::msix_recv_handler});
auto xmit_del(delegate<void()>{this, &VirtioNet::msix_xmit_handler});
auto conf_del(delegate<void()>{this, &VirtioNet::msix_conf_handler});
// update BSP IDT
IRQ_manager::get().subscribe(irq() + 0, recv_del);
IRQ_manager::get().subscribe(irq() + 1, xmit_del);
IRQ_manager::get().subscribe(irq() + 2, conf_del);
}
else
{
assert(0 && "Legacy IRQs not supported");
}
#ifndef NO_DEFERRED_KICK
static bool init_deferred = false;
if (!init_deferred) {
init_deferred = true;
deferred_intr = IRQ_manager::get().get_next_msix_irq();
IRQ_manager::get().subscribe(deferred_intr, handle_deferred_devices);
}
#endif
// Done
INFO("VirtioNet", "Driver initialization complete");
CHECK(_conf.status & 1, "Link up\n");
rx_q.kick();
}
void VirtioNet::msix_conf_handler()
{
debug("\t <VirtioNet> Configuration change:\n");
// Getting the MAC + status
debug("\t Old status: 0x%x\n",_conf.status);
get_config();
debug("\t New status: 0x%x \n",_conf.status);
}
void VirtioNet::msix_recv_handler()
{
bool dequeued_rx = false;
rx_q.disable_interrupts();
// handle incoming packets as long as bufstore has available buffers
while (rx_q.new_incoming() && bufstore().available() > 1)
{
auto res = rx_q.dequeue();
auto pckt_ptr = recv_packet(res.data(), res.size());
Link::receive(std::move(pckt_ptr));
// Requeue a new buffer
add_receive_buffer();
dequeued_rx = true;
// Stat increase packets received
packets_rx_++;
}
rx_q.enable_interrupts();
if (dequeued_rx)
rx_q.kick();
}
void VirtioNet::msix_xmit_handler()
{
bool dequeued_tx = false;
tx_q.disable_interrupts();
// Do one TX-packet
while (tx_q.new_incoming())
{
auto res = tx_q.dequeue();
assert(res.data());
// get packet offset, and call destructor
auto* packet = (net::Packet*) (res.data() - sizeof(net::Packet));
packet->~Packet(); // call destructor on Packet to release it
dequeued_tx = true;
}
// If we have a transmit queue, eat from it, otherwise let the stack know we
// have increased transmit capacity
if (dequeued_tx) {
debug("<VirtioNet>%i dequeued, transmitting backlog\n", dequeued_tx);
// transmit as much as possible from the buffer
if (transmit_queue_){
transmit(std::move(transmit_queue_));
}
// If we now emptied the buffer, offer packets to stack
if (!transmit_queue_ && tx_q.num_free() > 1)
transmit_queue_available_event_(tx_q.num_free() / 2);
}
}
void VirtioNet::add_receive_buffer()
{
auto* pkt = bufstore().get_buffer();
// offset pointer to virtionet header
auto* vnet = pkt + sizeof(Packet);
Token token1 {{vnet, sizeof(virtio_net_hdr)}, Token::IN };
Token token2 {{vnet + sizeof(virtio_net_hdr), MTU()}, Token::IN };
std::array<Token, 2> tokens {{ token1, token2 }};
rx_q.enqueue(tokens);
}
net::Packet_ptr
VirtioNet::recv_packet(uint8_t* data, uint16_t size)
{
auto* ptr = (net::Packet*) (data - sizeof(net::Packet));
#ifdef DEBUG
assert(bufstore().is_from_pool((uint8_t*) ptr));
assert(bufstore().is_buffer((uint8_t*) ptr));
#endif
new (ptr) net::Packet(MTU(), size - sizeof(virtio_net_hdr), sizeof(virtio_net_hdr), &bufstore());
return net::Packet_ptr(ptr);
}
net::Packet_ptr
VirtioNet::create_packet(uint16_t size)
{
auto* ptr = (net::Packet*) bufstore().get_buffer();
new (ptr) net::Packet(MTU(), size, sizeof(virtio_net_hdr), &bufstore());
return net::Packet_ptr(ptr);
}
void VirtioNet::add_to_tx_buffer(net::Packet_ptr pckt){
if (transmit_queue_)
transmit_queue_->chain(std::move(pckt));
else
transmit_queue_ = std::move(pckt);
#ifdef DEBUG
size_t chain_length = 1;
auto* next = transmit_queue_->tail();
while (next) {
chain_length++;
next = next->tail();
}
#endif
debug("Buffering, %i packets chained \n", chain_length);
}
void VirtioNet::transmit(net::Packet_ptr pckt) {
/** @note We have to send a virtio header first, then the packet.
From Virtio std. §5.1.6.6:
"When using legacy interfaces, transitional drivers which have not
negotiated VIRTIO_F_ANY_LAYOUT MUST use a single descriptor for the struct
virtio_net_hdr on both transmit and receive, with the network data in the
following descriptors."
VirtualBox *does not* accept ANY_LAYOUT, while Qemu does, so this is to
support VirtualBox
*/
int transmitted = 0;
net::Packet_ptr tail = std::move(pckt);
// Transmit all we can directly
while (tx_q.num_free() and tail) {
debug("%i tokens left in TX queue \n", tx_q.num_free());
// next in line
auto next = tail->detach_tail();
// write data to network
// explicitly release the data to prevent destructor being called
enqueue(tail.release());
tail = std::move(next);
transmitted++;
// Stat increase packets transmitted
packets_tx_++;
if (!tail) break;
}
// Notify virtio about new packets
if (LIKELY(transmitted)) {
begin_deferred_kick();
}
// Buffer the rest
if (UNLIKELY(tail)) {
debug("Buffering remaining packets..\n");
add_to_tx_buffer(std::move(tail));
}
}
void VirtioNet::enqueue(net::Packet* pckt)
{
auto* hdr = pckt->buffer() - sizeof(virtio_net_hdr);
Token token1 {{ hdr, sizeof(virtio_net_hdr)}, Token::OUT };
Token token2 {{ pckt->buffer(), pckt->size()}, Token::OUT };
std::array<Token, 2> tokens {{ token1, token2 }};
// Enqueue scatterlist, 2 pieces readable, 0 writable.
tx_q.enqueue(tokens);
}
void VirtioNet::begin_deferred_kick()
{
#ifdef NO_DEFERRED_KICK
tx_q.enable_interrupts();
tx_q.kick();
#else
if (!deferred_kick) {
deferred_kick = true;
deferred_devices.push_back(this);
IRQ_manager::get().register_irq(deferred_intr);
}
#endif
}
void VirtioNet::handle_deferred_devices()
{
#ifndef NO_DEFERRED_KICK
for (auto* dev : deferred_devices) {
// kick transmitq
dev->deferred_kick = false;
dev->tx_q.enable_interrupts();
dev->tx_q.kick();
}
deferred_devices.clear();
#endif
}
void VirtioNet::deactivate()
{
/// disable interrupts on virtio queues
rx_q.disable_interrupts();
tx_q.disable_interrupts();
ctrl_q.disable_interrupts();
/// mask off MSI-X vectors
if (has_msix())
deactivate_msix();
}
#include <kernel/pci_manager.hpp>
/** Register VirtioNet's driver factory at the PCI_manager */
static struct Autoreg_virtionet {
Autoreg_virtionet() {
PCI_manager::register_driver<hw::Nic>(hw::PCI_Device::VENDOR_VIRTIO, 0x1000, &VirtioNet::new_instance);
}
} autoreg_virtionet;
<|endoftext|>
|
<commit_before>/*
* Copyright 2013-2014 Jose Fonseca
*
* 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.
*
* 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 "tap.h"
#include "apps/wine.h"
#include <assert.h>
#include <stdlib.h>
#include <windows.h>
#include <dbghelp.h>
#include <shlwapi.h>
static bool
comparePath(const char *s1, const char *s2)
{
if (strcmp(s1, s2) == 0) {
return true;
}
s1 = PathFindFileNameA(s1);
s2 = PathFindFileNameA(s2);
return strcmp(s1, s2) == 0;
}
static BOOL
g_bStripped = FALSE;
static void
checkSym(HANDLE hProcess,
PVOID pvSymbol,
const char *szSymbolName)
{
bool ok;
DWORD64 dwAddr = (DWORD64)(UINT_PTR)pvSymbol;
// Test SymFromAddr
DWORD64 Displacement = 0;
struct {
SYMBOL_INFO Symbol;
CHAR Name[256];
} s;
memset(&s, 0, sizeof s);
s.Symbol.SizeOfStruct = sizeof s.Symbol;
s.Symbol.MaxNameLen = sizeof s.Symbol.Name + sizeof s.Name;
ok = SymFromAddr(hProcess, dwAddr, &Displacement, &s.Symbol);
test_line(ok, "SymFromAddr(&%s)", szSymbolName);
if (!ok) {
test_diagnostic_last_error();
} else {
if (!g_bStripped) {
ok = strcmp(s.Symbol.Name, szSymbolName) == 0;
} else {
// XXX: ignore differences due to demangling
ok = strncmp(szSymbolName, s.Symbol.Name, strlen(szSymbolName)) == 0;
}
test_line(ok, "SymFromAddr(&%s).Name", szSymbolName);
if (!ok) {
test_diagnostic("Name = \"%s\" != \"%s\"",
s.Symbol.Name, szSymbolName);
}
}
}
static void
checkSymLine(HANDLE hProcess,
PVOID pvSymbol,
const char *szSymbolName,
const char *szFileName,
DWORD dwLineNumber)
{
bool ok;
DWORD64 dwAddr = (DWORD64)(UINT_PTR)pvSymbol;
checkSym(hProcess, pvSymbol, szSymbolName);
if (g_bStripped) {
// Don't check line nos
return;
}
// Test SymGetLineFromAddr64
DWORD dwDisplacement;
IMAGEHLP_LINE64 Line;
ZeroMemory(&Line, sizeof Line);
Line.SizeOfStruct = sizeof Line;
ok = SymGetLineFromAddr64(hProcess, dwAddr, &dwDisplacement, &Line);
test_line(ok, "SymGetLineFromAddr64(&%s)", szSymbolName);
if (!ok) {
test_diagnostic_last_error();
} else {
ok = comparePath(Line.FileName, szFileName);
test_line(ok, "SymGetLineFromAddr64(&%s).FileName", szSymbolName);
if (!ok) {
test_diagnostic("FileName = \"%s\" != \"%s\"",
Line.FileName, szFileName);
}
ok = Line.LineNumber == dwLineNumber;
test_line(ok, "SymGetLineFromAddr64(&%s).LineNumber", szSymbolName);
if (Line.LineNumber != dwLineNumber) {
test_diagnostic("LineNumber = %lu != %lu",
Line.LineNumber, dwLineNumber);
}
}
}
static void
__attribute__ ((noinline))
checkCaller(HANDLE hProcess,
const char *szSymbolName,
const char *szFileName,
DWORD dwLineNumber)
{
void *addr = __builtin_return_address(0);
checkSymLine(hProcess, addr, szSymbolName, szFileName, dwLineNumber);
}
static void
checkExport(HANDLE hProcess,
const char *szModuleName,
const char *szSymbolName)
{
HMODULE hModule = GetModuleHandleA(szModuleName);
const PVOID pvSymbol = (PVOID)GetProcAddress(hModule, szSymbolName);
checkSym(hProcess, pvSymbol, szSymbolName);
}
static const DWORD foo_line = __LINE__; static int foo(int a, int b) {
return a * b;
}
#define LINE_BARRIER rand();
int
main(int argc, char **argv)
{
HANDLE hProcess = GetCurrentProcess();
bool ok;
if (strstr(argv[0], "test_mgwhelp_stripped")) {
g_bStripped = TRUE;
}
HMODULE hMgwHelpDll = GetModuleHandleA("mgwhelp.dll");
if (!hMgwHelpDll) {
test_line(false, "GetModuleHandleA(\"mgwhelp.dll\")");
} else {
test_line(GetProcAddress(hMgwHelpDll, "SymGetOptions") != NULL, "GetProcAddress(\"SymGetOptions\")");
test_line(GetProcAddress(hMgwHelpDll, "SymGetOptions@0") == NULL, "!GetProcAddress(\"SymGetOptions\")");
}
ok = SymInitialize(hProcess, "", TRUE);
test_line(ok, "SymInitialize()");
if (!ok) {
test_diagnostic_last_error();
} {
checkSymLine(hProcess, (PVOID)&foo, "foo", __FILE__, foo_line);
checkCaller(hProcess, "main", __FILE__, __LINE__); LINE_BARRIER
// Test DbgHelp fallback
// XXX: Doesn't work reliably on Wine
if (!insideWine()) {
checkExport(hProcess, "kernel32", "Sleep");
}
ok = SymCleanup(hProcess);
test_line(ok, "SymCleanup()");
if (!ok) {
test_diagnostic_last_error();
}
}
test_exit();
}
<commit_msg>tests: Add test for Displacement out parameter.<commit_after>/*
* Copyright 2013-2014 Jose Fonseca
*
* 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.
*
* 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 "tap.h"
#include "apps/wine.h"
#include <assert.h>
#include <stdlib.h>
#include <windows.h>
#include <dbghelp.h>
#include <shlwapi.h>
static bool
comparePath(const char *s1, const char *s2)
{
if (strcmp(s1, s2) == 0) {
return true;
}
s1 = PathFindFileNameA(s1);
s2 = PathFindFileNameA(s2);
return strcmp(s1, s2) == 0;
}
static BOOL
g_bStripped = FALSE;
static void
checkSym(HANDLE hProcess,
PVOID pvSymbol,
const char *szSymbolName,
DWORD64 dwExpectDisplacement)
{
bool ok;
DWORD64 dwAddr = (DWORD64)(UINT_PTR)pvSymbol;
// Test SymFromAddr
DWORD64 Displacement = -1;
struct {
SYMBOL_INFO Symbol;
CHAR Name[256];
} s;
memset(&s, 0, sizeof s);
s.Symbol.SizeOfStruct = sizeof s.Symbol;
s.Symbol.MaxNameLen = sizeof s.Symbol.Name + sizeof s.Name;
ok = SymFromAddr(hProcess, dwAddr, &Displacement, &s.Symbol);
test_line(ok, "SymFromAddr(&%s)", szSymbolName);
if (!ok) {
test_diagnostic_last_error();
} else {
if (!g_bStripped) {
ok = strcmp(s.Symbol.Name, szSymbolName) == 0;
} else {
// XXX: ignore differences due to demangling
ok = strncmp(szSymbolName, s.Symbol.Name, strlen(szSymbolName)) == 0;
}
test_line(ok, "SymFromAddr(&%s).Name", szSymbolName);
if (!ok) {
test_diagnostic("Name = \"%s\" != \"%s\"",
s.Symbol.Name, szSymbolName);
}
ok = Displacement == dwExpectDisplacement;
test_line(ok, "SymFromAddr(&%s).Displacement", szSymbolName);
if (!ok) {
test_diagnostic("Displacement = %I64x != %I64x",
Displacement, dwExpectDisplacement);
}
}
}
static void
checkSymLine(HANDLE hProcess,
PVOID pvSymbol,
const char *szSymbolName,
const char *szFileName,
DWORD dwLineNumber,
DWORD64 dwExpectDisplacement)
{
bool ok;
DWORD64 dwAddr = (DWORD64)(UINT_PTR)pvSymbol;
checkSym(hProcess, pvSymbol, szSymbolName, dwExpectDisplacement);
if (g_bStripped) {
// Don't check line nos
return;
}
// Test SymGetLineFromAddr64
DWORD dwDisplacement;
IMAGEHLP_LINE64 Line;
ZeroMemory(&Line, sizeof Line);
Line.SizeOfStruct = sizeof Line;
ok = SymGetLineFromAddr64(hProcess, dwAddr, &dwDisplacement, &Line);
test_line(ok, "SymGetLineFromAddr64(&%s)", szSymbolName);
if (!ok) {
test_diagnostic_last_error();
} else {
ok = comparePath(Line.FileName, szFileName);
test_line(ok, "SymGetLineFromAddr64(&%s).FileName", szSymbolName);
if (!ok) {
test_diagnostic("FileName = \"%s\" != \"%s\"",
Line.FileName, szFileName);
}
ok = Line.LineNumber == dwLineNumber;
test_line(ok, "SymGetLineFromAddr64(&%s).LineNumber", szSymbolName);
if (Line.LineNumber != dwLineNumber) {
test_diagnostic("LineNumber = %lu != %lu",
Line.LineNumber, dwLineNumber);
}
ok = dwDisplacement == dwExpectDisplacement;
test_line(ok, "SymGetLineFromAddr64(&%s).Displacement", szSymbolName);
if (!ok) {
test_diagnostic("Displacement = %lx != %I64x",
dwDisplacement, dwExpectDisplacement);
}
}
}
static void
__attribute__ ((noinline))
checkCaller(HANDLE hProcess,
PVOID pvCaller,
const char *szSymbolName,
const char *szFileName,
DWORD dwLineNumber)
{
void *addr = __builtin_return_address(0);
DWORD64 displacement = (DWORD64)addr - (DWORD64)pvCaller;
checkSymLine(hProcess, addr, szSymbolName, szFileName, dwLineNumber, displacement);
}
static void
checkExport(HANDLE hProcess,
const char *szModuleName,
const char *szSymbolName)
{
HMODULE hModule = GetModuleHandleA(szModuleName);
const PVOID pvSymbol = (PVOID)GetProcAddress(hModule, szSymbolName);
checkSym(hProcess, pvSymbol, szSymbolName, 0);
}
static const DWORD foo_line = __LINE__; static int foo(int a, int b) {
return a * b;
}
#define LINE_BARRIER rand();
int
main(int argc, char **argv)
{
HANDLE hProcess = GetCurrentProcess();
bool ok;
if (strstr(argv[0], "test_mgwhelp_stripped")) {
g_bStripped = TRUE;
}
HMODULE hMgwHelpDll = GetModuleHandleA("mgwhelp.dll");
if (!hMgwHelpDll) {
test_line(false, "GetModuleHandleA(\"mgwhelp.dll\")");
} else {
test_line(GetProcAddress(hMgwHelpDll, "SymGetOptions") != NULL, "GetProcAddress(\"SymGetOptions\")");
test_line(GetProcAddress(hMgwHelpDll, "SymGetOptions@0") == NULL, "!GetProcAddress(\"SymGetOptions\")");
}
ok = SymInitialize(hProcess, "", TRUE);
test_line(ok, "SymInitialize()");
if (!ok) {
test_diagnostic_last_error();
} {
checkSymLine(hProcess, (PVOID)&foo, "foo", __FILE__, foo_line, 0);
checkCaller(hProcess, (PVOID)&main, "main", __FILE__, __LINE__); LINE_BARRIER
// Test DbgHelp fallback
// XXX: Doesn't work reliably on Wine
if (!insideWine()) {
checkExport(hProcess, "kernel32", "Sleep");
}
ok = SymCleanup(hProcess);
test_line(ok, "SymCleanup()");
if (!ok) {
test_diagnostic_last_error();
}
}
test_exit();
}
<|endoftext|>
|
<commit_before>#pragma once
#include <RenHook/ExecutableMeta/ExecutableMeta.hpp>
#include <RenHook/Hooks/Hook.hpp>
#include <RenHook/Pattern/Pattern.hpp>
namespace RenHook::Managers::Hooks
{
namespace Private
{
std::shared_ptr<Hook> Create(const uintptr_t Address, const uintptr_t Detour, const std::string& Key);
extern uintptr_t ImageBase;
extern std::map<std::string, std::shared_ptr<RenHook::Hook>> Hooks;
}
template<typename T>
std::shared_ptr<Hook> Create(uintptr_t Address, const T Detour, bool IsInIDARange, std::string Key)
{
if (Key.empty() == true)
{
Key = std::to_string(Address);
}
// Check if we already have a hooked function with that key.
if (Private::Hooks.find(Key) != Private::Hooks.end())
{
return Private::Hooks.at(Key);
}
if (IsInIDARange == true)
{
Address = Address - Private::ImageBase + RenHook::ExecutableMeta::GetBaseAddress();
}
return Private::Create(Address, reinterpret_cast<uintptr_t>(Detour), Key);
}
template<typename T>
std::shared_ptr<Hook> Create(const std::string& Module, const std::string& Function, const T Detour, std::string Key)
{
if (Key.empty() == true)
{
Key = Module + "::" + Function;
}
// Check if we already have a hooked function with that key.
if (Private::Hooks.find(Key) != Private::Hooks.end())
{
return Private::Hooks.at(Key);
}
auto Handle = GetModuleHandleA(Module.c_str());
// If we don't have the module loaded, try to load it.
if (Handle == nullptr)
{
LoadLibraryA(Module.c_str());
// Try again to get the module's handle.
Handle = GetModuleHandleA(Module.c_str());
// Is it loaded now?
if (Handle == nullptr)
{
throw std::invalid_argument("Module not found");
}
}
auto Address = GetProcAddress(Handle, Function.c_str());
// Do we have an invalid address?
if (Address == nullptr)
{
throw std::invalid_argument("Function not found in module");
}
return Private::Create(reinterpret_cast<uintptr_t>(Address), reinterpret_cast<uintptr_t>(Detour), Key);;
}
template<typename T>
std::shared_ptr<Hook> Create(std::string Pattern, const T Detour, std::string Key)
{
if (Key.empty() == true)
{
Key = Pattern;
}
// Remove whitespaces between bytes.
Pattern.erase(std::remove_if(Pattern.begin(), Pattern.end(), ::isspace), Pattern.end());
// Make sure the pattern is properly aligned.
if (Pattern.length() % 2 > 0)
{
throw std::invalid_argument("Pattern is not properly aligned");
}
// Check if we already have a hooked function with that pattern.
if (Private::Hooks.find(Key) != Private::Hooks.end())
{
return Private::Hooks.at(Key);
}
auto Address = RenHook::Pattern(Pattern).Except(1).Get(1).To<uintptr_t>();
if (Address == 0)
{
throw std::runtime_error("Pattern not found");
}
return Private::Create(Address, reinterpret_cast<uintptr_t>(Detour), Key);;
}
std::shared_ptr<Hook> Get(const uintptr_t Address);
std::shared_ptr<Hook> Get(const std::string& Key);
std::shared_ptr<Hook> Get(const std::string& Module, const std::string& Function);
void Remove(const uintptr_t Address);
void Remove(const std::string& Key);
void Remove(const std::string& Module, const std::string& Function);
void RemoveAll();
}<commit_msg>Change "Except" to "Expect"<commit_after>#pragma once
#include <RenHook/ExecutableMeta/ExecutableMeta.hpp>
#include <RenHook/Hooks/Hook.hpp>
#include <RenHook/Pattern/Pattern.hpp>
namespace RenHook::Managers::Hooks
{
namespace Private
{
std::shared_ptr<Hook> Create(const uintptr_t Address, const uintptr_t Detour, const std::string& Key);
extern uintptr_t ImageBase;
extern std::map<std::string, std::shared_ptr<RenHook::Hook>> Hooks;
}
template<typename T>
std::shared_ptr<Hook> Create(uintptr_t Address, const T Detour, bool IsInIDARange, std::string Key)
{
if (Key.empty() == true)
{
Key = std::to_string(Address);
}
// Check if we already have a hooked function with that key.
if (Private::Hooks.find(Key) != Private::Hooks.end())
{
return Private::Hooks.at(Key);
}
if (IsInIDARange == true)
{
Address = Address - Private::ImageBase + RenHook::ExecutableMeta::GetBaseAddress();
}
return Private::Create(Address, reinterpret_cast<uintptr_t>(Detour), Key);
}
template<typename T>
std::shared_ptr<Hook> Create(const std::string& Module, const std::string& Function, const T Detour, std::string Key)
{
if (Key.empty() == true)
{
Key = Module + "::" + Function;
}
// Check if we already have a hooked function with that key.
if (Private::Hooks.find(Key) != Private::Hooks.end())
{
return Private::Hooks.at(Key);
}
auto Handle = GetModuleHandleA(Module.c_str());
// If we don't have the module loaded, try to load it.
if (Handle == nullptr)
{
LoadLibraryA(Module.c_str());
// Try again to get the module's handle.
Handle = GetModuleHandleA(Module.c_str());
// Is it loaded now?
if (Handle == nullptr)
{
throw std::invalid_argument("Module not found");
}
}
auto Address = GetProcAddress(Handle, Function.c_str());
// Do we have an invalid address?
if (Address == nullptr)
{
throw std::invalid_argument("Function not found in module");
}
return Private::Create(reinterpret_cast<uintptr_t>(Address), reinterpret_cast<uintptr_t>(Detour), Key);;
}
template<typename T>
std::shared_ptr<Hook> Create(std::string Pattern, const T Detour, std::string Key)
{
if (Key.empty() == true)
{
Key = Pattern;
}
// Remove whitespaces between bytes.
Pattern.erase(std::remove_if(Pattern.begin(), Pattern.end(), ::isspace), Pattern.end());
// Make sure the pattern is properly aligned.
if (Pattern.length() % 2 > 0)
{
throw std::invalid_argument("Pattern is not properly aligned");
}
// Check if we already have a hooked function with that pattern.
if (Private::Hooks.find(Key) != Private::Hooks.end())
{
return Private::Hooks.at(Key);
}
auto Address = RenHook::Pattern(Pattern).Expect(1).Get(1).To<uintptr_t>();
if (Address == 0)
{
throw std::runtime_error("Pattern not found");
}
return Private::Create(Address, reinterpret_cast<uintptr_t>(Detour), Key);;
}
std::shared_ptr<Hook> Get(const uintptr_t Address);
std::shared_ptr<Hook> Get(const std::string& Key);
std::shared_ptr<Hook> Get(const std::string& Module, const std::string& Function);
void Remove(const uintptr_t Address);
void Remove(const std::string& Key);
void Remove(const std::string& Module, const std::string& Function);
void RemoveAll();
}<|endoftext|>
|
<commit_before>// Unit test includes
#include "libmesh_cppunit.h"
#include "test_comm.h"
// libMesh includes
#include <libmesh/libmesh.h>
#include <libmesh/xdr_cxx.h>
#include <libmesh/int_range.h>
#include <timpi/communicator.h>
// C++ includes
#include <vector>
using namespace libMesh;
class XdrTest : public CppUnit::TestCase {
public:
CPPUNIT_TEST_SUITE( XdrTest );
CPPUNIT_TEST( testDataVec );
CPPUNIT_TEST( testDataStream );
CPPUNIT_TEST_SUITE_END();
private:
public:
void setUp()
{}
void tearDown()
{}
void testDataVec ()
{
std::vector<Real> vec = {libMesh::pi, 2*libMesh::pi, 3*libMesh::pi};
// Test reading/writing on 1 processor
if (TestCommWorld->rank() == 0)
{
// Write to file
{
Xdr xdr("output.dat", WRITE);
xdr.data(vec, "# This is a comment");
}
// Read from file
{
Xdr xdr("output.dat", READ);
std::vector<Real> vec_in;
xdr.data(vec_in);
// Check that correct number of values were read in
CPPUNIT_ASSERT_EQUAL(vec_in.size(), vec.size());
// Check that values were written/read with sufficient accuracy
for (auto i : index_range(vec_in))
LIBMESH_ASSERT_FP_EQUAL(vec[i], vec_in[i], TOLERANCE);
}
}
}
void testDataStream ()
{
std::vector<Real> vec(100);
for (auto i : index_range(vec))
vec[i] = static_cast<Real>(i+1) / vec.size();
// Test reading/writing on 1 processor
if (TestCommWorld->rank() == 0)
{
// Write to file. If "line_break" does not exactly divide the
// vector size, there will be one line with fewer values than
// the others.
{
Xdr xdr("output.dat", WRITE);
xdr.data_stream(vec.data(), vec.size(), /*line_break=*/16);
}
// Read from file. To use data_stream(), the storage needs to
// be pre-sized and the line_break parameter is ignored.
{
Xdr xdr("output.dat", READ);
std::vector<Real> vec_in(100);
xdr.data_stream(vec_in.data(), vec_in.size());
// Check that values were written/read correctly
for (auto i : index_range(vec_in))
LIBMESH_ASSERT_FP_EQUAL(vec[i], vec_in[i], TOLERANCE);
}
}
}
};
CPPUNIT_TEST_SUITE_REGISTRATION( XdrTest );
<commit_msg>Ensure Xdr test isn't set up for a race condition<commit_after>// Unit test includes
#include "libmesh_cppunit.h"
#include "test_comm.h"
// libMesh includes
#include <libmesh/libmesh.h>
#include <libmesh/xdr_cxx.h>
#include <libmesh/int_range.h>
#include <timpi/communicator.h>
// C++ includes
#include <vector>
using namespace libMesh;
class XdrTest : public CppUnit::TestCase {
public:
CPPUNIT_TEST_SUITE( XdrTest );
CPPUNIT_TEST( testDataVec );
CPPUNIT_TEST( testDataStream );
CPPUNIT_TEST_SUITE_END();
private:
public:
void setUp()
{}
void tearDown()
{}
void testDataVec ()
{
std::vector<Real> vec = {libMesh::pi, 2*libMesh::pi, 3*libMesh::pi};
// There was once a weird bug mutating our TestCommWorld in
// a previous unit test, which turned *this* test into a race
// condition. Let's make sure that never happens again.
CPPUNIT_ASSERT_EQUAL(TestCommWorld->rank(),
libMesh::global_processor_id());
// Test reading/writing on 1 processor
if (TestCommWorld->rank() == 0)
{
// Write to file
{
Xdr xdr("output.dat", WRITE);
xdr.data(vec, "# This is a comment");
}
// Read from file
{
Xdr xdr("output.dat", READ);
std::vector<Real> vec_in;
xdr.data(vec_in);
// Check that correct number of values were read in
CPPUNIT_ASSERT_EQUAL(vec_in.size(), vec.size());
// Check that values were written/read with sufficient accuracy
for (auto i : index_range(vec_in))
LIBMESH_ASSERT_FP_EQUAL(vec[i], vec_in[i], TOLERANCE);
}
}
}
void testDataStream ()
{
std::vector<Real> vec(100);
for (auto i : index_range(vec))
vec[i] = static_cast<Real>(i+1) / vec.size();
// Test reading/writing on 1 processor
if (TestCommWorld->rank() == 0)
{
// Write to file. If "line_break" does not exactly divide the
// vector size, there will be one line with fewer values than
// the others.
{
Xdr xdr("output.dat", WRITE);
xdr.data_stream(vec.data(), vec.size(), /*line_break=*/16);
}
// Read from file. To use data_stream(), the storage needs to
// be pre-sized and the line_break parameter is ignored.
{
Xdr xdr("output.dat", READ);
std::vector<Real> vec_in(100);
xdr.data_stream(vec_in.data(), vec_in.size());
// Check that values were written/read correctly
for (auto i : index_range(vec_in))
LIBMESH_ASSERT_FP_EQUAL(vec[i], vec_in[i], TOLERANCE);
}
}
}
};
CPPUNIT_TEST_SUITE_REGISTRATION( XdrTest );
<|endoftext|>
|
<commit_before>#include "Application.h"
#include "Glew\include\glew.h"
#include"Imgui/imgui_impl_sdl.h"
#include"Imgui\imgui.h"
#include"Imgui\imguidock.h"
#include"Quadtree.h"
Application::Application()
{
window = new ModuleWindow();
input = new ModuleInput();
audio = new ModuleAudio(true);
scene_intro = new ModuleSceneIntro();
renderer3D = new ModuleRenderer3D();
camera = new ModuleCamera3D();
gui = new ModuleGui();
assimp = new ModuleAssimp();
fs_e = new ModuleFileSystem_Engine();
resources_mod = new ModuleResources();
shaders_manager = new Shaders_Manager();
// The order of calls is very important!
// Modules will Init() Start() and Update in this order
// They will CleanUp() in reverse order
// Main Modules
AddModule(window);
AddModule(fs_e);
AddModule(camera);
AddModule(input);
AddModule(audio);
AddModule(assimp);
AddModule(resources_mod);
AddModule(shaders_manager);
// Scenes
AddModule(scene_intro);
// Renderer last!
AddModule(renderer3D);
AddModule(gui);
window->name = "window";
fs_e->name = "filesystem";
camera->name = "camera";
input->name = "input";
renderer3D->name = "renderer3D";
gui->name = "gui";
audio->name = "audio";
scene_intro->name = "scene intro";
assimp->name = "assimp";
resources_mod->name = "resources_manager";
shaders_manager->name = "shader Manager";
}
Application::~Application()
{
for (std::list<Module*>::iterator item = list_modules.begin(); item != list_modules.end(); ++item) {
RELEASE((*item));
}
list_modules.clear();
}
bool Application::Init()
{
bool ret = true;
// After all Init calls we call Start() in all modules
LOG("Application Start --------------");
imp_mat = new MaterialImporter();
imp_mesh = new MeshImporter();
json_class = new Parson_JSON();
json_class->Init();
json_class->Load();
ImGui::LoadDocks();
for (std::list<Module*>::iterator item = list_modules.begin(); item != list_modules.end(); ++item) {
ret = (item)._Ptr->_Myval->Init();
(item)._Ptr->_Myval->module_timer = new Timer();
}
for (std::list<Module*>::iterator item = list_modules.begin(); item != list_modules.end(); ++item) {
(*item)->Start();
}
ms_timer.Start();
return ret;
}
// ---------------------------------------------
void Application::PrepareUpdate()
{
dt = (float)ms_timer.Read() / 1000.0f;
ms_timer.Start();
frame_count++;
last_sec_frame_count++;
frame_time.Start();
}
// ---------------------------------------------
void Application::FinishUpdate()
{
}
void Application::SetFramesCapped(int cap_temp)
{
capped_ms = cap_temp;
}
int Application::GetFramesCapped()
{
return capped_ms;
}
void Application::Play()
{
timeStatus = play;
play_timer = 0;
DtSwitch();
}
void Application::Pause()
{
timeStatus = pause;
DtSwitch();
}
void Application::Stop()
{
timeStatus = stop;
play_timer = 0;
DtSwitch();
}
void Application::DtSwitch()
{
if (timeStatus == play)
{
dtvariation = tempdt;
StartPlayingScene();
}
if (timeStatus == pause)
{
tempdt = dtvariation;
dtvariation = 0.0f;
}
if (timeStatus == stop)
{
tempdt = dtvariation;
dtvariation = 0.0f;
ReStartScene();
}
}
void Application::ReStartScene()
{
App->gui->inspection_node = nullptr;
App->scene_intro->num_GO = 0;
App->scene_intro->root_gameobject->CleanUp();
App->json_class->Create_JSON_DOC(&App->scene_intro->root_value_scene, &App->scene_intro->root_object_scene,"..\\Game\\Library\\TempPlay");
App->scene_intro->Load_Scene(App->scene_intro->root_object_scene,false);
App->scene_intro->calc_octree_stop_button = true;
json_value_free(App->scene_intro->root_value_scene);
}
void Application::StartPlayingScene()
{
App->json_class->Create_JSON_DOC(&App->scene_intro->root_value_scene, &App->scene_intro->root_object_scene, "..\\Game\\Library\\TempPlay");
json_object_clear(App->scene_intro->root_object_scene);
App->scene_intro->root_gameobject->Save(App->scene_intro->root_object_scene);
char* serialized_string = json_serialize_to_string_pretty(App->scene_intro->root_value_scene);
json_serialize_to_file(App->scene_intro->root_value_scene, "..\\Game\\Library\\TempPlay");
}
// Call PreUpdate, Update and PostUpdate on all modules
update_status Application::Update()
{
update_status ret = UPDATE_CONTINUE;
PrepareUpdate();
//change dt time
float tempdt = dt * dtvariation;
if (NextFrame)
{
tempdt = dt;
NextFrame = false;
}
//
for (std::list<Module*>::iterator item = list_modules.begin(); item != list_modules.end(); ++item) {
(*item)->StartTimer();
if ((*item) == camera)
{
(*item)->PreUpdate(dt);
}
else {
(*item)->PreUpdate(tempdt);
}
(*item)->PauseTimer();
}
//LOG("%f", 1/dt);
for (std::list<Module*>::iterator item = list_modules.begin(); item != list_modules.end(); ++item) {
(*item)->ResumeTimer();
if ((*item) == camera)
{
(*item)->Update(dt);
}
else {
(*item)->Update(tempdt);
}
(*item)->PauseTimer();
}
if (timeStatus == play)
{
play_timer += tempdt;
}
for (std::list<Module*>::iterator item = list_modules.begin(); item != list_modules.end(); ++item) {
(*item)->ResumeTimer();
if ((*item) == camera)
{
ret = (*item)->PostUpdate(dt);
}
else {
ret = (*item)->PostUpdate(tempdt);
}
(*item)->StopTimer();
if (ret == update_status::UPDATE_ERROR || ret == update_status::UPDATE_STOP)
break;
}
// Framerate calculations --
if (last_sec_frame_time.Read() > 1000)
{
last_sec_frame_time.Start();
prev_last_sec_frame_count = last_sec_frame_count;
last_sec_frame_count = 0;
}
avg_fps = float(frame_count) / startup_time.ReadSec();
seconds_since_startup = startup_time.ReadSec();
last_frame_ms = frame_time.Read();
frames_on_last_update = prev_last_sec_frame_count;
if (capped_ms > 0)
{
uint cap = 1000 / capped_ms;
if (last_frame_ms < cap)
SDL_Delay(cap - last_frame_ms);
}
FinishUpdate();
return ret;
}
bool Application::CleanUp()
{
bool ret = true;
for (std::list<Module*>::iterator item = list_modules.begin(); item != list_modules.end(); ++item) {
delete (item)._Ptr->_Myval->module_timer;
}
for (std::list<Module*>::iterator item = list_modules.begin(); item != list_modules.end(); ++item) {
(*item)->CleanUp();
}
json_class->Save();
json_class->CleanUp();
ImGui::SaveDocks();
App->imp_mat->Mat_Map.clear();
delete imp_mat;
delete imp_mesh;
delete json_class;
return ret;
}
bool Application::Gui_Engine_Modules(float dt)
{
if (ImGui::BeginDock("Application", false, false/*, App->IsPlaying()*/, ImGuiWindowFlags_HorizontalScrollbar)) {
std::list<Module*>::iterator item = App->list_modules.begin();
while (item != App->list_modules.end())
{
const char* name = (*item)->name.c_str();
(*item)->performance[(*item)->performance_offset] = (*item)->module_timer->Read_ms();
(*item)->performance_offset = ((*item)->performance_offset + 1) % IM_ARRAYSIZE((*item)->performance);
ImGui::PlotHistogram((char*)name, (*item)->performance, IM_ARRAYSIZE((*item)->performance), 0, name, 0.0f, 30.f, ImVec2(0, 40));
item++;
}
}
const char* name = "fps";
this->performance[this->performance_offset] = App->frames_on_last_update;
this->performance_offset = (this->performance_offset + 1) % IM_ARRAYSIZE(this->performance);
ImGui::PlotHistogram((char*)name, this->performance, IM_ARRAYSIZE(this->performance), 0, name, 0.0f, 150.f, ImVec2(0, 40));
int temp_cap = capped_ms;
if (ImGui::InputInt("Fps capped:", &temp_cap, -1, 100, ImGuiInputTextFlags_EnterReturnsTrue)) {
capped_ms = temp_cap;
}
ImGui::SliderFloat("dt", &dtvariation ,0.0f, 10.0f);
;
ImGui::Text("Time Since Startup: %f", play_timer);
ImGui::EndDock();
return true;
}
void Application::LoadModules()
{
}
void Application::SaveModules()
{
}
void Application::AddModule(Module* mod)
{
list_modules.push_back(mod);
}
float Application::GetPlay_Time()const {
return play_timer;
}<commit_msg>Fixed playtime bug<commit_after>#include "Application.h"
#include "Glew\include\glew.h"
#include"Imgui/imgui_impl_sdl.h"
#include"Imgui\imgui.h"
#include"Imgui\imguidock.h"
#include"Quadtree.h"
Application::Application()
{
window = new ModuleWindow();
input = new ModuleInput();
audio = new ModuleAudio(true);
scene_intro = new ModuleSceneIntro();
renderer3D = new ModuleRenderer3D();
camera = new ModuleCamera3D();
gui = new ModuleGui();
assimp = new ModuleAssimp();
fs_e = new ModuleFileSystem_Engine();
resources_mod = new ModuleResources();
shaders_manager = new Shaders_Manager();
// The order of calls is very important!
// Modules will Init() Start() and Update in this order
// They will CleanUp() in reverse order
// Main Modules
AddModule(window);
AddModule(fs_e);
AddModule(camera);
AddModule(input);
AddModule(audio);
AddModule(assimp);
AddModule(resources_mod);
AddModule(shaders_manager);
// Scenes
AddModule(scene_intro);
// Renderer last!
AddModule(renderer3D);
AddModule(gui);
window->name = "window";
fs_e->name = "filesystem";
camera->name = "camera";
input->name = "input";
renderer3D->name = "renderer3D";
gui->name = "gui";
audio->name = "audio";
scene_intro->name = "scene intro";
assimp->name = "assimp";
resources_mod->name = "resources_manager";
shaders_manager->name = "shader Manager";
}
Application::~Application()
{
for (std::list<Module*>::iterator item = list_modules.begin(); item != list_modules.end(); ++item) {
RELEASE((*item));
}
list_modules.clear();
}
bool Application::Init()
{
bool ret = true;
// After all Init calls we call Start() in all modules
LOG("Application Start --------------");
imp_mat = new MaterialImporter();
imp_mesh = new MeshImporter();
json_class = new Parson_JSON();
json_class->Init();
json_class->Load();
ImGui::LoadDocks();
for (std::list<Module*>::iterator item = list_modules.begin(); item != list_modules.end(); ++item) {
ret = (item)._Ptr->_Myval->Init();
(item)._Ptr->_Myval->module_timer = new Timer();
}
for (std::list<Module*>::iterator item = list_modules.begin(); item != list_modules.end(); ++item) {
(*item)->Start();
}
ms_timer.Start();
return ret;
}
// ---------------------------------------------
void Application::PrepareUpdate()
{
dt = (float)ms_timer.Read() / 1000.0f;
ms_timer.Start();
frame_count++;
last_sec_frame_count++;
frame_time.Start();
}
// ---------------------------------------------
void Application::FinishUpdate()
{
}
void Application::SetFramesCapped(int cap_temp)
{
capped_ms = cap_temp;
}
int Application::GetFramesCapped()
{
return capped_ms;
}
void Application::Play()
{
timeStatus = play;
play_timer = 0;
DtSwitch();
}
void Application::Pause()
{
timeStatus = pause;
DtSwitch();
}
void Application::Stop()
{
timeStatus = stop;
play_timer = 0;
DtSwitch();
}
void Application::DtSwitch()
{
if (timeStatus == play)
{
dtvariation = tempdt;
StartPlayingScene();
}
if (timeStatus == pause)
{
tempdt = dtvariation;
dtvariation = 0.0f;
}
if (timeStatus == stop)
{
if (dtvariation != 0)
{
tempdt = dtvariation;
}
else
{
tempdt = 1;
}
dtvariation = 0.0f;
ReStartScene();
}
}
void Application::ReStartScene()
{
App->gui->inspection_node = nullptr;
App->scene_intro->num_GO = 0;
App->scene_intro->root_gameobject->CleanUp();
App->json_class->Create_JSON_DOC(&App->scene_intro->root_value_scene, &App->scene_intro->root_object_scene,"..\\Game\\Library\\TempPlay");
App->scene_intro->Load_Scene(App->scene_intro->root_object_scene,false);
App->scene_intro->calc_octree_stop_button = true;
json_value_free(App->scene_intro->root_value_scene);
}
void Application::StartPlayingScene()
{
App->json_class->Create_JSON_DOC(&App->scene_intro->root_value_scene, &App->scene_intro->root_object_scene, "..\\Game\\Library\\TempPlay");
json_object_clear(App->scene_intro->root_object_scene);
App->scene_intro->root_gameobject->Save(App->scene_intro->root_object_scene);
char* serialized_string = json_serialize_to_string_pretty(App->scene_intro->root_value_scene);
json_serialize_to_file(App->scene_intro->root_value_scene, "..\\Game\\Library\\TempPlay");
}
// Call PreUpdate, Update and PostUpdate on all modules
update_status Application::Update()
{
update_status ret = UPDATE_CONTINUE;
PrepareUpdate();
//change dt time
float tempdt = dt * dtvariation;
if (NextFrame)
{
tempdt = dt;
NextFrame = false;
}
//
for (std::list<Module*>::iterator item = list_modules.begin(); item != list_modules.end(); ++item) {
(*item)->StartTimer();
if ((*item) == camera)
{
(*item)->PreUpdate(dt);
}
else {
(*item)->PreUpdate(tempdt);
}
(*item)->PauseTimer();
}
//LOG("%f", 1/dt);
for (std::list<Module*>::iterator item = list_modules.begin(); item != list_modules.end(); ++item) {
(*item)->ResumeTimer();
if ((*item) == camera)
{
(*item)->Update(dt);
}
else {
(*item)->Update(tempdt);
}
(*item)->PauseTimer();
}
if (timeStatus == play)
{
play_timer += tempdt;
}
for (std::list<Module*>::iterator item = list_modules.begin(); item != list_modules.end(); ++item) {
(*item)->ResumeTimer();
if ((*item) == camera)
{
ret = (*item)->PostUpdate(dt);
}
else {
ret = (*item)->PostUpdate(tempdt);
}
(*item)->StopTimer();
if (ret == update_status::UPDATE_ERROR || ret == update_status::UPDATE_STOP)
break;
}
// Framerate calculations --
if (last_sec_frame_time.Read() > 1000)
{
last_sec_frame_time.Start();
prev_last_sec_frame_count = last_sec_frame_count;
last_sec_frame_count = 0;
}
avg_fps = float(frame_count) / startup_time.ReadSec();
seconds_since_startup = startup_time.ReadSec();
last_frame_ms = frame_time.Read();
frames_on_last_update = prev_last_sec_frame_count;
if (capped_ms > 0)
{
uint cap = 1000 / capped_ms;
if (last_frame_ms < cap)
SDL_Delay(cap - last_frame_ms);
}
FinishUpdate();
return ret;
}
bool Application::CleanUp()
{
bool ret = true;
for (std::list<Module*>::iterator item = list_modules.begin(); item != list_modules.end(); ++item) {
delete (item)._Ptr->_Myval->module_timer;
}
for (std::list<Module*>::iterator item = list_modules.begin(); item != list_modules.end(); ++item) {
(*item)->CleanUp();
}
json_class->Save();
json_class->CleanUp();
ImGui::SaveDocks();
App->imp_mat->Mat_Map.clear();
delete imp_mat;
delete imp_mesh;
delete json_class;
return ret;
}
bool Application::Gui_Engine_Modules(float dt)
{
if (ImGui::BeginDock("Application", false, false/*, App->IsPlaying()*/, ImGuiWindowFlags_HorizontalScrollbar)) {
std::list<Module*>::iterator item = App->list_modules.begin();
while (item != App->list_modules.end())
{
const char* name = (*item)->name.c_str();
(*item)->performance[(*item)->performance_offset] = (*item)->module_timer->Read_ms();
(*item)->performance_offset = ((*item)->performance_offset + 1) % IM_ARRAYSIZE((*item)->performance);
ImGui::PlotHistogram((char*)name, (*item)->performance, IM_ARRAYSIZE((*item)->performance), 0, name, 0.0f, 30.f, ImVec2(0, 40));
item++;
}
}
const char* name = "fps";
this->performance[this->performance_offset] = App->frames_on_last_update;
this->performance_offset = (this->performance_offset + 1) % IM_ARRAYSIZE(this->performance);
ImGui::PlotHistogram((char*)name, this->performance, IM_ARRAYSIZE(this->performance), 0, name, 0.0f, 150.f, ImVec2(0, 40));
int temp_cap = capped_ms;
if (ImGui::InputInt("Fps capped:", &temp_cap, -1, 100, ImGuiInputTextFlags_EnterReturnsTrue)) {
capped_ms = temp_cap;
}
ImGui::SliderFloat("dt", &dtvariation ,0.0f, 10.0f);
;
ImGui::Text("Time Since Startup: %f", play_timer);
ImGui::EndDock();
return true;
}
void Application::LoadModules()
{
}
void Application::SaveModules()
{
}
void Application::AddModule(Module* mod)
{
list_modules.push_back(mod);
}
float Application::GetPlay_Time()const {
return play_timer;
}<|endoftext|>
|
<commit_before>/**
* FreeRDS: Simple Greeter (Logon UI)
*
* Copyright 2014 Dell Software <Mike.McDonald@software.dell.com>
*
* Permission to use, copy, modify, distribute, and sell this software and
* its documentation for any purpose is hereby granted without fee, provided
* that the above copyright notice appear in all copies and that both that
* copyright notice and this permission notice appear in supporting
* documentation, and that the name of the copyright holders not be used in
* advertising or publicity pertaining to distribution of the software
* without specific, written prior permission. The copyright holders make
* no representations about the suitability of this software for any
* purpose. It is provided "as is" without express or implied warranty.
*
* THE COPYRIGHT HOLDERS DISCLAIM ALL WARRANTIES WITH REGARD TO THIS
* SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
* FITNESS, IN NO EVENT SHALL THE COPYRIGHT HOLDERS BE LIABLE FOR ANY
* SPECIAL, 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 Qt headers (requires qt4-dev-tools) */
#include <QApplication>
#include <QMessageBox>
#include <QPalette>
#include <freerds/fdsapi.h>
#include <winpr/crt.h>
#include "simple_greeter.h"
#define UI_TIMEOUT 30
SimpleGreeterWindow::SimpleGreeterWindow()
{
setupUi(this);
#if 1
// Set the background color.
QPalette palette;
palette.setColor(QPalette::Background, QColor(0, 133, 195));
setAutoFillBackground(true);
setPalette(palette);
#else
// TODO: Setting background color from image does not work correctly.
setAttribute(Qt::WA_PaintOnScreen, true);
setStyleSheet("background-image: url(:/images/background.png)");
setSizePolicy(QSizePolicy(QSizePolicy::Expanding, QSizePolicy::Preferred));
setBackgroundRole(QPalette::Background);
#endif
// Display the logo.
QPixmap pix(":/images/logo.png");
logoLabel->setPixmap(pix);
logoLabel->setScaledContents(true);
// Adjust contents of the credentials box.
innerGrid->setContentsMargins(20, 20, 20, 20);
palette.setColor(QPalette::Background, QColor(200, 200, 200));
innerBox->setAutoFillBackground(true);
innerBox->setPalette(palette);
// Initialize widgets.
char *env = getenv("FREERDS_USER");
if (env)
{
usernameEdit->setText(env);
}
// Start a timer.
mTimer = new QTimer;
mTimer->setInterval(UI_TIMEOUT * 1000);
mTimer->setSingleShot(true);
connect(mTimer, SIGNAL(timeout()), this, SLOT(timeout()));
// Update the buttons.
updateButtons();
}
SimpleGreeterWindow::~SimpleGreeterWindow()
{
}
void SimpleGreeterWindow::updateButtons()
{
QString username = usernameEdit->text();
if (username.isEmpty())
{
// Disable the login button.
loginButton->setEnabled(false);
}
else
{
// Enable the login button.
loginButton->setEnabled(true);
}
// Restart the timer.
mTimer->start();
}
void SimpleGreeterWindow::on_usernameEdit_textChanged(const QString& text)
{
updateButtons();
}
void SimpleGreeterWindow::on_usernameEdit_returnPressed()
{
on_loginButton_clicked(true);
}
void SimpleGreeterWindow::on_passwordEdit_textChanged(const QString& text)
{
updateButtons();
}
void SimpleGreeterWindow::on_passwordEdit_returnPressed()
{
on_loginButton_clicked(true);
}
void SimpleGreeterWindow::on_loginButton_clicked(bool checked)
{
QString username = usernameEdit->text();
QString password = passwordEdit->text();
QString domain;
int index = username.indexOf('\\');
if (index >= 0)
{
domain = username.left(index);
username = username.mid(index + 1);
}
int status = FreeRDS_AuthenticateUser(
WTS_CURRENT_SESSION,
username.toLatin1().constData(),
password.toLatin1().constData(),
domain.toLatin1().constData());
qDebug("FreeRDS_AuthenticateUser returned %d", status);
if (status != 0)
{
QMessageBox::critical(NULL, "FreeRDS", "Login failure: bad username or password");
}
}
void SimpleGreeterWindow::on_cancelButton_clicked(bool checked)
{
this->close();
}
void SimpleGreeterWindow::timeout()
{
this->close();
}
int main(int argc, char *argv[])
{
QApplication app(argc, argv);
SimpleGreeterWindow window;
window.showMaximized();
return app.exec();
}
<commit_msg>Fixed code to eliminate a crash.<commit_after>/**
* FreeRDS: Simple Greeter (Logon UI)
*
* Copyright 2014 Dell Software <Mike.McDonald@software.dell.com>
*
* Permission to use, copy, modify, distribute, and sell this software and
* its documentation for any purpose is hereby granted without fee, provided
* that the above copyright notice appear in all copies and that both that
* copyright notice and this permission notice appear in supporting
* documentation, and that the name of the copyright holders not be used in
* advertising or publicity pertaining to distribution of the software
* without specific, written prior permission. The copyright holders make
* no representations about the suitability of this software for any
* purpose. It is provided "as is" without express or implied warranty.
*
* THE COPYRIGHT HOLDERS DISCLAIM ALL WARRANTIES WITH REGARD TO THIS
* SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
* FITNESS, IN NO EVENT SHALL THE COPYRIGHT HOLDERS BE LIABLE FOR ANY
* SPECIAL, 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 Qt headers (requires qt4-dev-tools) */
#include <QApplication>
#include <QMessageBox>
#include <QPalette>
#include <freerds/fdsapi.h>
#include <winpr/crt.h>
#include "simple_greeter.h"
#define UI_TIMEOUT 30
SimpleGreeterWindow::SimpleGreeterWindow()
{
setupUi(this);
#if 1
// Set the background color.
QPalette palette;
palette.setColor(QPalette::Background, QColor(0, 133, 195));
setAutoFillBackground(true);
setPalette(palette);
#else
// TODO: Setting background color from image does not work correctly.
setAttribute(Qt::WA_PaintOnScreen, true);
setStyleSheet("background-image: url(:/images/background.png)");
setSizePolicy(QSizePolicy(QSizePolicy::Expanding, QSizePolicy::Preferred));
setBackgroundRole(QPalette::Background);
#endif
// Display the logo.
QPixmap pix(":/images/logo.png");
logoLabel->setPixmap(pix);
logoLabel->setScaledContents(true);
// Adjust contents of the credentials box.
innerGrid->setContentsMargins(20, 20, 20, 20);
palette.setColor(QPalette::Background, QColor(200, 200, 200));
innerBox->setAutoFillBackground(true);
innerBox->setPalette(palette);
// Create a timer.
mTimer = new QTimer;
mTimer->setInterval(UI_TIMEOUT * 1000);
mTimer->setSingleShot(true);
connect(mTimer, SIGNAL(timeout()), this, SLOT(timeout()));
// Initialize widgets.
const char *domain = getenv("FREERDS_DOMAIN");
const char *username = getenv("FREERDS_USER");
if (domain && username)
{
QString text = QString("%1\\%2").arg(domain, username);
usernameEdit->setText(text);
}
else if (username)
{
usernameEdit->setText(username);
}
// Update the buttons.
updateButtons();
}
SimpleGreeterWindow::~SimpleGreeterWindow()
{
}
void SimpleGreeterWindow::updateButtons()
{
QString username = usernameEdit->text();
if (username.isEmpty())
{
// Disable the login button.
loginButton->setEnabled(false);
}
else
{
// Enable the login button.
loginButton->setEnabled(true);
}
// Restart the timer.
mTimer->start();
}
void SimpleGreeterWindow::on_usernameEdit_textChanged(const QString& text)
{
updateButtons();
}
void SimpleGreeterWindow::on_usernameEdit_returnPressed()
{
on_loginButton_clicked(true);
}
void SimpleGreeterWindow::on_passwordEdit_textChanged(const QString& text)
{
updateButtons();
}
void SimpleGreeterWindow::on_passwordEdit_returnPressed()
{
on_loginButton_clicked(true);
}
void SimpleGreeterWindow::on_loginButton_clicked(bool checked)
{
QString username = usernameEdit->text();
QString password = passwordEdit->text();
QString domain;
int index = username.indexOf('\\');
if (index >= 0)
{
domain = username.left(index);
username = username.mid(index + 1);
}
int status = FreeRDS_AuthenticateUser(
WTS_CURRENT_SESSION,
username.toLatin1().constData(),
password.toLatin1().constData(),
domain.toLatin1().constData());
qDebug("FreeRDS_AuthenticateUser returned %d", status);
if (status != 0)
{
QMessageBox::critical(NULL, "FreeRDS", "Login failure: bad username or password");
}
}
void SimpleGreeterWindow::on_cancelButton_clicked(bool checked)
{
this->close();
}
void SimpleGreeterWindow::timeout()
{
this->close();
}
int main(int argc, char *argv[])
{
QApplication app(argc, argv);
SimpleGreeterWindow window;
window.showMaximized();
return app.exec();
}
<|endoftext|>
|
<commit_before>/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/* ListStyle: Stores (and writes) list-based information that is
* needed at the head of an OO document.
*
* 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/.
*/
/* "This product is not manufactured, approved, or supported by
* Corel Corporation or Corel Corporation Limited."
*/
#ifndef _LISTSTYLE_H
#define _LISTSTYLE_H
#include <libwpd/libwpd.h>
#define WP6_NUM_LIST_LEVELS 8 // see WP6FileStructure.h (we shouldn't need to reference this)
#include "Style.hxx"
class ListLevelStyle
{
public:
virtual ~ListLevelStyle() {};
virtual void write(OdfDocumentHandler *pHandler, int iLevel) const = 0;
};
class OrderedListLevelStyle : public ListLevelStyle
{
public:
OrderedListLevelStyle(const WPXPropertyList &xPropList);
void write(OdfDocumentHandler *pHandler, int iLevel) const;
private:
WPXPropertyList mPropList;
};
class UnorderedListLevelStyle : public ListLevelStyle
{
public:
UnorderedListLevelStyle(const WPXPropertyList &xPropList);
void write(OdfDocumentHandler *pHandler, int iLevel) const;
private:
WPXPropertyList mPropList;
};
class ListStyle : public Style
{
public:
ListStyle(const char *psName, const int iListID);
virtual ~ListStyle();
virtual void updateListLevel(const int iLevel, const WPXPropertyList &xPropList) = 0;
virtual void write(OdfDocumentHandler *pHandler) const;
int getListID()
{
return miListID;
}
bool isListLevelDefined(int iLevel) const;
protected:
void setListLevel(int iLevel, ListLevelStyle *iListLevelStyle);
private:
ListLevelStyle *mppListLevels[WP6_NUM_LIST_LEVELS];
int miNumListLevels;
const int miListID;
};
class OrderedListStyle : public ListStyle
{
public:
OrderedListStyle(const char *psName, const int iListID) : ListStyle(psName, iListID) {}
void updateListLevel(const int iLevel, const WPXPropertyList &xPropList);
};
class UnorderedListStyle : public ListStyle
{
public:
UnorderedListStyle(const char *psName, const int iListID) : ListStyle(psName, iListID) {}
void updateListLevel(const int iLevel, const WPXPropertyList &xPropList);
};
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
<commit_msg>-Werror,-Wunused-private-field (Clang towards 3.2)<commit_after>/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/* ListStyle: Stores (and writes) list-based information that is
* needed at the head of an OO document.
*
* 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/.
*/
/* "This product is not manufactured, approved, or supported by
* Corel Corporation or Corel Corporation Limited."
*/
#ifndef _LISTSTYLE_H
#define _LISTSTYLE_H
#include <libwpd/libwpd.h>
#define WP6_NUM_LIST_LEVELS 8 // see WP6FileStructure.h (we shouldn't need to reference this)
#include "Style.hxx"
class ListLevelStyle
{
public:
virtual ~ListLevelStyle() {};
virtual void write(OdfDocumentHandler *pHandler, int iLevel) const = 0;
};
class OrderedListLevelStyle : public ListLevelStyle
{
public:
OrderedListLevelStyle(const WPXPropertyList &xPropList);
void write(OdfDocumentHandler *pHandler, int iLevel) const;
private:
WPXPropertyList mPropList;
};
class UnorderedListLevelStyle : public ListLevelStyle
{
public:
UnorderedListLevelStyle(const WPXPropertyList &xPropList);
void write(OdfDocumentHandler *pHandler, int iLevel) const;
private:
WPXPropertyList mPropList;
};
class ListStyle : public Style
{
public:
ListStyle(const char *psName, const int iListID);
virtual ~ListStyle();
virtual void updateListLevel(const int iLevel, const WPXPropertyList &xPropList) = 0;
virtual void write(OdfDocumentHandler *pHandler) const;
int getListID()
{
return miListID;
}
bool isListLevelDefined(int iLevel) const;
protected:
void setListLevel(int iLevel, ListLevelStyle *iListLevelStyle);
private:
ListLevelStyle *mppListLevels[WP6_NUM_LIST_LEVELS];
const int miListID;
};
class OrderedListStyle : public ListStyle
{
public:
OrderedListStyle(const char *psName, const int iListID) : ListStyle(psName, iListID) {}
void updateListLevel(const int iLevel, const WPXPropertyList &xPropList);
};
class UnorderedListStyle : public ListStyle
{
public:
UnorderedListStyle(const char *psName, const int iListID) : ListStyle(psName, iListID) {}
void updateListLevel(const int iLevel, const WPXPropertyList &xPropList);
};
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
<|endoftext|>
|
<commit_before>#include <gmi_mesh.h>
#include <apf.h>
#include <apfMesh2.h>
#include <apfMDS.h>
#include <PCU.h>
#include <parma.h>
namespace {
const char* modelFile = 0;
const char* meshFile = 0;
void freeMesh(apf::Mesh* m)
{
m->destroyNative();
apf::destroyMesh(m);
}
void getConfig(int argc, char** argv)
{
assert(argc==3||argc==4);
modelFile = argv[1];
meshFile = argv[2];
}
apf::MeshTag* applyUnitVtxWeight(apf::Mesh* m) {
apf::MeshTag* wtag = m->createDoubleTag("ghostUnitWeight",1);
apf::MeshEntity* e;
apf::MeshIterator* itr = m->begin(0);
double w = 1;
while( (e = m->iterate(itr)) )
m->setDoubleTag(e, wtag, &w);
m->end(itr);
return wtag;
}
void runParma(apf::Mesh* m) {
apf::MeshTag* weights = applyUnitVtxWeight(m);
const int layers = 3;
const int bridgeDim = 1;
apf::Balancer* ghost = Parma_MakeGhostDiffuser(m, layers, bridgeDim);
ghost->balance(weights, 1.05);
delete ghost;
}
}
int main(int argc, char** argv)
{
int provided;
MPI_Init_thread(&argc,&argv,MPI_THREAD_MULTIPLE,&provided);
assert(provided==MPI_THREAD_MULTIPLE);
PCU_Comm_Init();
gmi_register_mesh();
PCU_Protect();
getConfig(argc,argv);
apf::Mesh2* m = apf::loadMdsMesh(modelFile,meshFile);
apf::writeVtkFiles("before", m);
runParma(m);
if (argc==4)
m->writeNative(argv[3]);
apf::writeVtkFiles("after", m);
freeMesh(m);
PCU_Comm_Free();
MPI_Finalize();
}
<commit_msg>don't write vtk files, require mesh output<commit_after>#include <gmi_mesh.h>
#include <apf.h>
#include <apfMesh2.h>
#include <apfMDS.h>
#include <PCU.h>
#include <parma.h>
namespace {
const char* modelFile = 0;
const char* meshFile = 0;
void freeMesh(apf::Mesh* m)
{
m->destroyNative();
apf::destroyMesh(m);
}
void getConfig(int argc, char** argv)
{
assert(argc==4);
modelFile = argv[1];
meshFile = argv[2];
}
apf::MeshTag* applyUnitVtxWeight(apf::Mesh* m) {
apf::MeshTag* wtag = m->createDoubleTag("ghostUnitWeight",1);
apf::MeshEntity* e;
apf::MeshIterator* itr = m->begin(0);
double w = 1;
while( (e = m->iterate(itr)) )
m->setDoubleTag(e, wtag, &w);
m->end(itr);
return wtag;
}
void runParma(apf::Mesh* m) {
apf::MeshTag* weights = applyUnitVtxWeight(m);
const int layers = 3;
const int bridgeDim = 1;
apf::Balancer* ghost = Parma_MakeGhostDiffuser(m, layers, bridgeDim);
ghost->balance(weights, 1.05);
delete ghost;
}
}
int main(int argc, char** argv)
{
int provided;
MPI_Init_thread(&argc,&argv,MPI_THREAD_MULTIPLE,&provided);
assert(provided==MPI_THREAD_MULTIPLE);
PCU_Comm_Init();
gmi_register_mesh();
PCU_Protect();
getConfig(argc,argv);
apf::Mesh2* m = apf::loadMdsMesh(modelFile,meshFile);
runParma(m);
m->writeNative(argv[3]);
freeMesh(m);
PCU_Comm_Free();
MPI_Finalize();
}
<|endoftext|>
|
<commit_before>#include "GeometryLoader.h"
GeometryLoader::GeometryLoader(bool start_enabled) : Module(start_enabled)
{
}
GeometryLoader::~GeometryLoader()
{
}
bool GeometryLoader::Awake()
{
bool ret = true;
return ret;
}
bool GeometryLoader::Start()
{
bool ret = true;
return ret;
}
bool GeometryLoader::Update()
{
bool ret = true;
return ret;
}
bool GeometryLoader::CleanUp()
{
bool ret = true;
return ret;
}
<commit_msg>assimp WIP<commit_after>#include "GeometryLoader.h"
#include "Assimp\include\cimport.h"
#include "Assimp\include\scene.h"
#include "Assimp\include\postprocess.h"
#include "Assimp\include\cfileio.h"
#pragma comment (lib, "Assimp/libx86/assimp.lib")
GeometryLoader::GeometryLoader(bool start_enabled) : Module(start_enabled)
{
}
GeometryLoader::~GeometryLoader()
{
}
bool GeometryLoader::Awake()
{
bool ret = true;
return ret;
}
bool GeometryLoader::Start()
{
bool ret = true;
// Stream log messages to Debug window
struct aiLogStream stream;
stream = aiGetPredefinedLogStream(aiDefaultLogStream_DEBUGGER, nullptr);
aiAttachLogStream(&stream);
return ret;
}
bool GeometryLoader::Update()
{
bool ret = true;
return ret;
}
bool GeometryLoader::CleanUp()
{
bool ret = true;
// detach log stream
aiDetachAllLogStreams();
return ret;
}
<|endoftext|>
|
<commit_before>// This file is a part of the OpenSurgSim project.
// Copyright 2013, SimQuest Solutions 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 "SurgSim/Framework/Assert.h"
#include "SurgSim/Math/Geometry.h"
#include "SurgSim/Math/OdeState.h"
#include "SurgSim/Physics/FemElement.h"
namespace SurgSim
{
namespace Physics
{
FemElement::FemElement() : m_numDofPerNode(0), m_rho(0.0), m_E(0.0), m_nu(0.0)
{}
FemElement::~FemElement()
{}
void FemElement::initialize(const SurgSim::Math::OdeState& state)
{
SURGSIM_ASSERT(m_rho != 0.0) << "Mass density is not set. Did you call setMassDensity() ?";
SURGSIM_ASSERT(m_nu != 0.0) << "Poisson ratio is not set. Did you call setPoissonRatio() ?";
SURGSIM_ASSERT(m_E != 0.0) << "Young modulus is not set. Did you call setYoungModulus() ?";
SURGSIM_ASSERT(m_rho > 0.0) << "Mass density ("<<m_rho<<") is invalid, it should be positive";
SURGSIM_ASSERT(m_nu > 0.0 && m_nu < 0.5) << "Poisson ratio ("<<m_nu<<") is invalid, it should be within [0 0.5)";
SURGSIM_ASSERT(m_E > 0.0) << "Young modulus ("<<m_E<<") is invalid, it should be positive";
}
unsigned int FemElement::getNumDofPerNode() const
{
return m_numDofPerNode;
}
void FemElement::setNumDofPerNode(unsigned int numDofPerNode)
{
m_numDofPerNode = numDofPerNode;
}
unsigned int FemElement::getNumNodes() const
{
return m_nodeIds.size();
}
unsigned int FemElement::getNodeId(unsigned int elementNodeId) const
{
return m_nodeIds[elementNodeId];
}
const std::vector<unsigned int>& FemElement::getNodeIds() const
{
return m_nodeIds;
}
void FemElement::setYoungModulus(double E)
{
m_E = E;
}
double FemElement::getYoungModulus() const
{
return m_E;
}
void FemElement::setPoissonRatio(double nu)
{
m_nu = nu;
}
double FemElement::getPoissonRatio() const
{
return m_nu;
}
void FemElement::setMassDensity(double rho)
{
m_rho = rho;
}
double FemElement::getMassDensity() const
{
return m_rho;
}
double FemElement::getMass(const SurgSim::Math::OdeState& state) const
{
return getVolume(state) * m_rho;
}
bool FemElement::isValidCoordinate(const SurgSim::Math::Vector& naturalCoordinate) const
{
return (std::abs(naturalCoordinate.sum() - 1.0) < SurgSim::Math::Geometry::ScalarEpsilon)
&& (naturalCoordinate.size() == getNumNodes())
&& (-SurgSim::Math::Geometry::ScalarEpsilon <= naturalCoordinate.minCoeff() &&
naturalCoordinate.maxCoeff() <= 1.0 + SurgSim::Math::Geometry::ScalarEpsilon);
}
} // namespace Physics
} // namespace SurgSim
<commit_msg>Cast to unsigned int before comparing.<commit_after>// This file is a part of the OpenSurgSim project.
// Copyright 2013, SimQuest Solutions 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 "SurgSim/Framework/Assert.h"
#include "SurgSim/Math/Geometry.h"
#include "SurgSim/Math/OdeState.h"
#include "SurgSim/Physics/FemElement.h"
namespace SurgSim
{
namespace Physics
{
FemElement::FemElement() : m_numDofPerNode(0), m_rho(0.0), m_E(0.0), m_nu(0.0)
{}
FemElement::~FemElement()
{}
void FemElement::initialize(const SurgSim::Math::OdeState& state)
{
SURGSIM_ASSERT(m_rho != 0.0) << "Mass density is not set. Did you call setMassDensity() ?";
SURGSIM_ASSERT(m_nu != 0.0) << "Poisson ratio is not set. Did you call setPoissonRatio() ?";
SURGSIM_ASSERT(m_E != 0.0) << "Young modulus is not set. Did you call setYoungModulus() ?";
SURGSIM_ASSERT(m_rho > 0.0) << "Mass density ("<<m_rho<<") is invalid, it should be positive";
SURGSIM_ASSERT(m_nu > 0.0 && m_nu < 0.5) << "Poisson ratio ("<<m_nu<<") is invalid, it should be within [0 0.5)";
SURGSIM_ASSERT(m_E > 0.0) << "Young modulus ("<<m_E<<") is invalid, it should be positive";
}
unsigned int FemElement::getNumDofPerNode() const
{
return m_numDofPerNode;
}
void FemElement::setNumDofPerNode(unsigned int numDofPerNode)
{
m_numDofPerNode = numDofPerNode;
}
unsigned int FemElement::getNumNodes() const
{
return m_nodeIds.size();
}
unsigned int FemElement::getNodeId(unsigned int elementNodeId) const
{
return m_nodeIds[elementNodeId];
}
const std::vector<unsigned int>& FemElement::getNodeIds() const
{
return m_nodeIds;
}
void FemElement::setYoungModulus(double E)
{
m_E = E;
}
double FemElement::getYoungModulus() const
{
return m_E;
}
void FemElement::setPoissonRatio(double nu)
{
m_nu = nu;
}
double FemElement::getPoissonRatio() const
{
return m_nu;
}
void FemElement::setMassDensity(double rho)
{
m_rho = rho;
}
double FemElement::getMassDensity() const
{
return m_rho;
}
double FemElement::getMass(const SurgSim::Math::OdeState& state) const
{
return getVolume(state) * m_rho;
}
bool FemElement::isValidCoordinate(const SurgSim::Math::Vector& naturalCoordinate) const
{
return (std::abs(naturalCoordinate.sum() - 1.0) < SurgSim::Math::Geometry::ScalarEpsilon)
&& (static_cast<unsigned int>(naturalCoordinate.size()) == getNumNodes())
&& (-SurgSim::Math::Geometry::ScalarEpsilon <= naturalCoordinate.minCoeff() &&
naturalCoordinate.maxCoeff() <= 1.0 + SurgSim::Math::Geometry::ScalarEpsilon);
}
} // namespace Physics
} // namespace SurgSim
<|endoftext|>
|
<commit_before>/*
* Copyright (C) 2012 argent77
*
* This file is part of tileconv.
*
* tileconv 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 3 of the License, or
* (at your option) any later version.
*
* tileconv 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 tileconv. If not, see <http://www.gnu.org/licenses/>.
*/
#include <cstring>
#include "dxtsquish.h"
const int DxtSquish::DEF_FLAGS = Dxt1 | ColourClusterFit | WeightColourByAlpha;
const int DxtSquish::MASK_DXT = Dxt1 | Dxt3 | Dxt5;
DxtSquish::DxtSquish() noexcept
: DxtBase()
{
setFlags(DEF_FLAGS);
}
DxtSquish::DxtSquish(ColorFormat format) noexcept
: DxtBase(format, DEF_FLAGS)
{
}
DxtSquish::DxtSquish(ColorFormat format, int flags) noexcept
: DxtBase(format, flags)
{
}
DxtSquish::~DxtSquish() noexcept
{
}
bool DxtSquish::compressBlock(uint8_t *src, uint8_t *dst) noexcept
{
uint8_t buffer[64]; // temp. buffer for a single 4x4 pixel block
if (src != nullptr && dst != nullptr) {
std::memcpy(buffer, src, 64);
ReorderColors(buffer, 16, getColorFormat(), ColorFormat::ABGR);
squish::Compress(buffer, dst, getFlags());
return true;
}
return false;
}
/*
bool DxtSquish::decompressBlock(uint8_t *src, uint8_t *dst) noexcept
{
if (src != nullptr && dst != nullptr) {
squish::Decompress(dst, src, getFlags());
DxtBase::ReorderColors(dst, 16, ColorFormat::ABGR, getColorFormat());
return true;
}
return false;
}
*/
void DxtSquish::setDxt1() noexcept
{
setFlags((getFlags() & ~MASK_DXT) | Dxt1);
}
void DxtSquish::setDxt3() noexcept
{
setFlags((getFlags() & ~MASK_DXT) | Dxt3);
}
void DxtSquish::setDxt5() noexcept
{
setFlags((getFlags() & ~MASK_DXT) | Dxt5);
}
bool DxtSquish::isDxt1() const noexcept
{
return (getFlags() & Dxt1) != 0;
}
bool DxtSquish::isDxt3() const noexcept
{
return (getFlags() & Dxt3) != 0;
}
bool DxtSquish::isDxt5() const noexcept
{
return (getFlags() & Dxt5) != 0;
}
<commit_msg>Fixed license information<commit_after>/*
Copyright (c) 2014 Argent77
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 <cstring>
#include "dxtsquish.h"
const int DxtSquish::DEF_FLAGS = Dxt1 | ColourClusterFit | WeightColourByAlpha;
const int DxtSquish::MASK_DXT = Dxt1 | Dxt3 | Dxt5;
DxtSquish::DxtSquish() noexcept
: DxtBase()
{
setFlags(DEF_FLAGS);
}
DxtSquish::DxtSquish(ColorFormat format) noexcept
: DxtBase(format, DEF_FLAGS)
{
}
DxtSquish::DxtSquish(ColorFormat format, int flags) noexcept
: DxtBase(format, flags)
{
}
DxtSquish::~DxtSquish() noexcept
{
}
bool DxtSquish::compressBlock(uint8_t *src, uint8_t *dst) noexcept
{
uint8_t buffer[64]; // temp. buffer for a single 4x4 pixel block
if (src != nullptr && dst != nullptr) {
std::memcpy(buffer, src, 64);
ReorderColors(buffer, 16, getColorFormat(), ColorFormat::ABGR);
squish::Compress(buffer, dst, getFlags());
return true;
}
return false;
}
/*
bool DxtSquish::decompressBlock(uint8_t *src, uint8_t *dst) noexcept
{
if (src != nullptr && dst != nullptr) {
squish::Decompress(dst, src, getFlags());
DxtBase::ReorderColors(dst, 16, ColorFormat::ABGR, getColorFormat());
return true;
}
return false;
}
*/
void DxtSquish::setDxt1() noexcept
{
setFlags((getFlags() & ~MASK_DXT) | Dxt1);
}
void DxtSquish::setDxt3() noexcept
{
setFlags((getFlags() & ~MASK_DXT) | Dxt3);
}
void DxtSquish::setDxt5() noexcept
{
setFlags((getFlags() & ~MASK_DXT) | Dxt5);
}
bool DxtSquish::isDxt1() const noexcept
{
return (getFlags() & Dxt1) != 0;
}
bool DxtSquish::isDxt3() const noexcept
{
return (getFlags() & Dxt3) != 0;
}
bool DxtSquish::isDxt5() const noexcept
{
return (getFlags() & Dxt5) != 0;
}
<|endoftext|>
|
<commit_before>#include "engine/world/Room.h"
#include "engine/math/random.h"
namespace engine {
namespace world {
Room::Room(){
//Initialize empty room
roomType = ROOM_TYPE_EMPTY;
Tile tempTile;
tempTile.setType(TILE_VOID);
for(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){
tiles[i] = tempTile;
}
}
Tile* Room::getTile(vec2 pos){
return getTile(pos.x,pos.y);
}
Tile* Room::getTile(int x,int y){
ASSERT_TILE_XY(x,y);
return &tiles[(x * ROOM_HEIGHT) + y];
}
void Room::setTile(vec2 pos,Tile tile){
setTile(pos.x,pos.y,tile);
}
void Room::setTile(int x,int y,Tile tile){
ASSERT_TILE_XY(x,y);
tiles[(x * ROOM_HEIGHT) + y] = tile;
}
/**
* Regenerate the room.
*
* Input: Reads roomType and builds on top of that.
*/
void Room::generate(){
//Lets get the simple types out from the way first... air and water...
Tile tempTile;
switch(roomType){
case ROOM_TYPE_EMPTY:
//Loop trough all tiles and set them to void
tempTile.setType(TILE_VOID);
for(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){
tiles[i] = tempTile;
}
break;
case ROOM_TYPE_WATER:
tempTile.setType(TILE_WATER);
for(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){
tiles[i] = tempTile;
}
break;
case ROOM_TYPE_GROUND:
tempTile.setType(TILE_GRASS);
for(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){
tiles[i] = tempTile;
}
for(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){
if(randomRange(0,10) > 8){
tiles[i] = Tile(TILE_TREE);
}
}
break;
case ROOM_TYPE_DUNGEON:
tempTile.setType(TILE_ROCK_FLOOR);
for(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){
tiles[i] = tempTile;
}
for(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){
if(randomRange(0,1)){
tiles[i] = Tile(TILE_SOLID_ROCK);
}
}
break;
}
}
/**
* Returns direct access to the tile array, useful when raw access needed to the array.
*/
Tile* Room::getTileArray(){
return tiles;
}
/**
* Prints the room layout to the cmd. Used for debugging.
*/
void Room::printLayout(){
for(int y = 0;y < ROOM_HEIGHT;++y){
for(int x = 0;x < ROOM_WIDTH;++x){
printf("%c",getTile(x,y)->visual);
}
printf("\n");
}
}
}
}
<commit_msg>Modifying the world generator<commit_after>#include "engine/world/Room.h"
#include "engine/math/random.h"
#include "engine/math/AABB.h"
namespace engine {
namespace world {
Room::Room(){
//Initialize empty room
roomType = ROOM_TYPE_EMPTY;
Tile tempTile;
tempTile.setType(TILE_VOID);
for(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){
tiles[i] = tempTile;
}
}
Tile* Room::getTile(vec2 pos){
return getTile(pos.x,pos.y);
}
Tile* Room::getTile(int x,int y){
ASSERT_TILE_XY(x,y);
return &tiles[(x * ROOM_HEIGHT) + y];
}
void Room::setTile(vec2 pos,Tile tile){
setTile(pos.x,pos.y,tile);
}
void Room::setTile(int x,int y,Tile tile){
ASSERT_TILE_XY(x,y);
tiles[(x * ROOM_HEIGHT) + y] = tile;
}
/**
* Regenerate the room.
*
* Input: Reads roomType and builds on top of that.
*/
void Room::generate(){
//Lets get the simple types out from the way first... air and water...
Tile tempTile;
switch(roomType){
case ROOM_TYPE_EMPTY:
//Loop trough all tiles and set them to void
tempTile.setType(TILE_VOID);
for(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){
tiles[i] = tempTile;
}
break;
case ROOM_TYPE_WATER:
tempTile.setType(TILE_WATER);
for(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){
tiles[i] = tempTile;
}
break;
case ROOM_TYPE_GROUND:
tempTile.setType(TILE_GRASS);
for(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){
tiles[i] = tempTile;
}
for(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){
if(randomRange(0,10) > 8){
tiles[i] = Tile(TILE_TREE);
}
}
break;
case ROOM_TYPE_DUNGEON:
tempTile.setType(TILE_ROCK_FLOOR);
//reset room
for(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){
tiles[i] = tempTile;
}
//Base with random amounts of rock
for(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){
if(randomRange(0,10) > 1){
tiles[i] = Tile(TILE_SOLID_ROCK);
}
}
//Insert the random rooms
int roomCount = randomRange(2,6);
while(roomCount > 0){
AABB room;
//first size, then position, so we are sure it wont go over the limits
LOG_INFO("Room");
room.size.x = randomRange(2,5);
room.size.y = randomRange(2,5);
room.pos.x = randomRange(0,(ROOM_WIDTH - room.size.x));
room.pos.y = randomRange(0,(ROOM_HEIGHT - room.size.y));
//Room stuff is ok, lets draw it in
for(int x = room.pos.x;x < room.size.x;++x){
for(int y = room.pos.y;y < room.size.y;++y){
setTile(x,y,Tile(TILE_ROCK_FLOOR));
}
}
--roomCount;
}
break;
}
}
/**
* Returns direct access to the tile array, useful when raw access needed to the array.
*/
Tile* Room::getTileArray(){
return tiles;
}
/**
* Prints the room layout to the cmd. Used for debugging.
*/
void Room::printLayout(){
for(int y = 0;y < ROOM_HEIGHT;++y){
for(int x = 0;x < ROOM_WIDTH;++x){
printf("%c",getTile(x,y)->visual);
}
printf("\n");
}
}
}
}
<|endoftext|>
|
<commit_before>/*
-----------------------------------------------------------------------------
This source file is part of OGRE
(Object-oriented Graphics Rendering Engine)
For the latest info, see http://www.ogre3d.org/
Copyright (c) 2000-2009 Torus Knot Software Ltd
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 "OgreStableHeaders.h"
#include "OgrePrerequisites.h"
#include "OgreCommon.h"
#include "OgreString.h"
#include "OgreLogManager.h"
namespace Ogre
{
int findCommandLineOpts(int numargs, char** argv, UnaryOptionList& unaryOptList,
BinaryOptionList& binOptList)
{
int startIndex = 1;
for (int i = 1; i < numargs; ++i)
{
String tmp(argv[i]);
if (StringUtil::startsWith(tmp, "-"))
{
UnaryOptionList::iterator ui = unaryOptList.find(argv[i]);
if(ui != unaryOptList.end())
{
ui->second = true;
++startIndex;
continue;
}
BinaryOptionList::iterator bi = binOptList.find(argv[i]);
if(bi != binOptList.end())
{
bi->second = argv[i+1];
startIndex += 2;
++i;
continue;
}
// Invalid option
LogManager::getSingleton().logMessage("Invalid option " + tmp);
}
}
return startIndex;
}
/** General hash function, derived from here
http://www.azillionmonkeys.com/qed/hash.html
Original by Paul Hsieh
*/
#define OGRE_GET16BITS(d) (*((const uint16 *) (d)))
uint32 _OgreExport FastHash (const char * data, int len, uint32 hashSoFar)
{
uint32 hash;
uint32 tmp;
int rem;
if (hashSoFar)
hash = hashSoFar;
else
hash = len;
if (len <= 0 || data == NULL) return 0;
rem = len & 3;
len >>= 2;
/* Main loop */
for (;len > 0; len--) {
hash += OGRE_GET16BITS (data);
tmp = (OGRE_GET16BITS (data+2) << 11) ^ hash;
hash = (hash << 16) ^ tmp;
data += 2*sizeof (uint16);
hash += hash >> 11;
}
/* Handle end cases */
switch (rem) {
case 3: hash += OGRE_GET16BITS (data);
hash ^= hash << 16;
hash ^= data[sizeof (uint16)] << 18;
hash += hash >> 11;
break;
case 2: hash += OGRE_GET16BITS (data);
hash ^= hash << 11;
hash += hash >> 17;
break;
case 1: hash += *data;
hash ^= hash << 10;
hash += hash >> 1;
}
/* Force "avalanching" of final 127 bits */
hash ^= hash << 3;
hash += hash >> 5;
hash ^= hash << 4;
hash += hash >> 17;
hash ^= hash << 25;
hash += hash >> 6;
return hash;
}
}
<commit_msg>Endian fix for FastHash - casting to uint16 is non-portable NOTE: this will break checksums if you're on a big-endian machine using files generated before this change.<commit_after>/*
-----------------------------------------------------------------------------
This source file is part of OGRE
(Object-oriented Graphics Rendering Engine)
For the latest info, see http://www.ogre3d.org/
Copyright (c) 2000-2009 Torus Knot Software Ltd
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 "OgreStableHeaders.h"
#include "OgrePrerequisites.h"
#include "OgreCommon.h"
#include "OgreString.h"
#include "OgreLogManager.h"
namespace Ogre
{
int findCommandLineOpts(int numargs, char** argv, UnaryOptionList& unaryOptList,
BinaryOptionList& binOptList)
{
int startIndex = 1;
for (int i = 1; i < numargs; ++i)
{
String tmp(argv[i]);
if (StringUtil::startsWith(tmp, "-"))
{
UnaryOptionList::iterator ui = unaryOptList.find(argv[i]);
if(ui != unaryOptList.end())
{
ui->second = true;
++startIndex;
continue;
}
BinaryOptionList::iterator bi = binOptList.find(argv[i]);
if(bi != binOptList.end())
{
bi->second = argv[i+1];
startIndex += 2;
++i;
continue;
}
// Invalid option
LogManager::getSingleton().logMessage("Invalid option " + tmp);
}
}
return startIndex;
}
/** General hash function, derived from here
http://www.azillionmonkeys.com/qed/hash.html
Original by Paul Hsieh
*/
#if OGRE_ENDIAN == OGRE_ENDIAN_LITTLE
# define OGRE_GET16BITS(d) (*((const uint16 *) (d)))
#else
// Cast to uint16 in little endian means first byte is least significant
// replicate that here
# define OGRE_GET16BITS(d) (*((const uint8 *) (d)) + (*((const uint8 *) (d+1))<<8))
#endif
uint32 _OgreExport FastHash (const char * data, int len, uint32 hashSoFar)
{
uint32 hash;
uint32 tmp;
int rem;
if (hashSoFar)
hash = hashSoFar;
else
hash = len;
if (len <= 0 || data == NULL) return 0;
rem = len & 3;
len >>= 2;
/* Main loop */
for (;len > 0; len--) {
hash += OGRE_GET16BITS (data);
tmp = (OGRE_GET16BITS (data+2) << 11) ^ hash;
hash = (hash << 16) ^ tmp;
data += 2*sizeof (uint16);
hash += hash >> 11;
}
/* Handle end cases */
switch (rem) {
case 3: hash += OGRE_GET16BITS (data);
hash ^= hash << 16;
hash ^= data[sizeof (uint16)] << 18;
hash += hash >> 11;
break;
case 2: hash += OGRE_GET16BITS (data);
hash ^= hash << 11;
hash += hash >> 17;
break;
case 1: hash += *data;
hash ^= hash << 10;
hash += hash >> 1;
}
/* Force "avalanching" of final 127 bits */
hash ^= hash << 3;
hash += hash >> 5;
hash ^= hash << 4;
hash += hash >> 17;
hash ^= hash << 25;
hash += hash >> 6;
return hash;
}
}
<|endoftext|>
|
<commit_before><commit_msg>Parse library no longer required<commit_after><|endoftext|>
|
<commit_before>/*
Copyright (C) 2016 Volker Krause <vkrause@kde.org>
This program is free software; you can redistribute it and/or modify it
under the terms of the GNU Library 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 Library General Public
License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "codeeditor.h"
#include <definition.h>
#include <syntaxhighlighter.h>
#include <theme.h>
#include <QApplication>
#include <QDebug>
#include <QFile>
#include <QFileDialog>
#include <QFontDatabase>
#include <QMenu>
#include <QPainter>
#include <QPalette>
class CodeEditorSidebar : public QWidget
{
Q_OBJECT
public:
explicit CodeEditorSidebar(CodeEditor *editor);
QSize sizeHint() const Q_DECL_OVERRIDE;
protected:
void paintEvent(QPaintEvent *event) Q_DECL_OVERRIDE;
private:
CodeEditor *m_codeEditor;
};
CodeEditorSidebar::CodeEditorSidebar(CodeEditor *editor) :
QWidget(editor),
m_codeEditor(editor)
{
}
QSize CodeEditorSidebar::sizeHint() const
{
return QSize(m_codeEditor->sidebarWidth(), 0);
}
void CodeEditorSidebar::paintEvent(QPaintEvent *event)
{
m_codeEditor->sidebarPaintEvent(event);
}
CodeEditor::CodeEditor(QWidget *parent) :
QPlainTextEdit(parent),
m_highlighter(new SyntaxHighlighting::SyntaxHighlighter(document())),
m_sideBar(new CodeEditorSidebar(this))
{
setFont(QFontDatabase::systemFont(QFontDatabase::FixedFont));
setTheme((palette().color(QPalette::Base).lightness() < 128)
? m_repository.defaultTheme(SyntaxHighlighting::Repository::DarkTheme)
: m_repository.defaultTheme(SyntaxHighlighting::Repository::LightTheme));
connect(this, &QPlainTextEdit::blockCountChanged, this, &CodeEditor::updateSidebarGeometry);
connect(this, &QPlainTextEdit::updateRequest, this, &CodeEditor::updateSidebarArea);
connect(this, &QPlainTextEdit::cursorPositionChanged, this, &CodeEditor::highlightCurrentLine);
updateSidebarGeometry();
highlightCurrentLine();
}
CodeEditor::~CodeEditor()
{
}
void CodeEditor::openFile(const QString& fileName)
{
QFile f(fileName);
if (!f.open(QFile::ReadOnly)) {
qWarning() << "Failed to open" << fileName << ":" << f.errorString();
return;
}
const auto def = m_repository.definitionForFileName(fileName);
m_highlighter->setDefinition(def);
setWindowTitle(fileName);
setPlainText(QString::fromUtf8(f.readAll()));
}
void CodeEditor::contextMenuEvent(QContextMenuEvent *event)
{
auto menu = createStandardContextMenu(event->pos());
menu->addSeparator();
auto openAction = menu->addAction(QStringLiteral("Open File..."));
connect(openAction, &QAction::triggered, this, [this]() {
const auto fileName = QFileDialog::getOpenFileName(this, QStringLiteral("Open File"));
if (!fileName.isEmpty())
openFile(fileName);
});
// syntax selection
auto hlActionGroup = new QActionGroup(menu);
hlActionGroup->setExclusive(true);
auto hlGroupMenu = menu->addMenu(QStringLiteral("Syntax"));
auto noHlAction = hlGroupMenu->addAction(QStringLiteral("None"));
noHlAction->setCheckable(true);
hlActionGroup->addAction(noHlAction);
noHlAction->setChecked(!m_highlighter->definition().isValid());
QMenu *hlSubMenu = Q_NULLPTR;
QString currentGroup;
foreach (const auto &def, m_repository.definitions()) {
if (def.isHidden())
continue;
if (currentGroup != def.section()) {
currentGroup = def.section();
hlSubMenu = hlGroupMenu->addMenu(def.translatedSection());
}
Q_ASSERT(hlSubMenu);
auto action = hlSubMenu->addAction(def.translatedName());
action->setCheckable(true);
action->setData(def.name());
hlActionGroup->addAction(action);
if (def.name() == m_highlighter->definition().name())
action->setChecked(true);
}
connect(hlActionGroup, &QActionGroup::triggered, this, [this](QAction *action) {
const auto defName = action->data().toString();
const auto def = m_repository.definitionForName(defName);
m_highlighter->setDefinition(def);
});
// theme selection
auto themeGroup = new QActionGroup(menu);
themeGroup->setExclusive(true);
auto themeMenu = menu->addMenu(QStringLiteral("Theme"));
foreach (const auto &theme, m_repository.themes()) {
auto action = themeMenu->addAction(theme.translatedName());
action->setCheckable(true);
action->setData(theme.name());
themeGroup->addAction(action);
if (theme.name() == m_highlighter->theme().name())
action->setChecked(true);
}
connect(themeGroup, &QActionGroup::triggered, this, [this](QAction *action) {
const auto themeName = action->data().toString();
const auto theme = m_repository.theme(themeName);
setTheme(theme);
});
menu->exec(event->globalPos());
delete menu;
}
void CodeEditor::resizeEvent(QResizeEvent *event)
{
QPlainTextEdit::resizeEvent(event);
updateSidebarGeometry();
}
void CodeEditor::setTheme(const SyntaxHighlighting::Theme &theme)
{
auto pal = qApp->palette();
if (theme.isValid()) {
pal.setColor(QPalette::Base, theme.editorColor(SyntaxHighlighting::Theme::BackgroundColor));
pal.setColor(QPalette::Text, theme.textColor(SyntaxHighlighting::Theme::Normal));
pal.setColor(QPalette::Highlight, theme.editorColor(SyntaxHighlighting::Theme::TextSelection));
}
setPalette(pal);
m_highlighter->setTheme(theme);
m_highlighter->rehighlight();
highlightCurrentLine();
}
int CodeEditor::sidebarWidth() const
{
int digits = 1;
auto count = blockCount();
while (count >= 10) {
++digits;
count /= 10;
}
return 4 + fontMetrics().width(QLatin1Char('9')) * digits;
}
void CodeEditor::sidebarPaintEvent(QPaintEvent *event)
{
QPainter painter(m_sideBar);
painter.fillRect(event->rect(), m_highlighter->theme().editorColor(SyntaxHighlighting::Theme::IconBorder));
auto block = firstVisibleBlock();
auto blockNumber = block.blockNumber();
int top = blockBoundingGeometry(block).translated(contentOffset()).top();
int bottom = top + blockBoundingRect(block).height();
const int currentBlockNumber = textCursor().blockNumber();
while (block.isValid() && top <= event->rect().bottom()) {
if (block.isVisible() && bottom >= event->rect().top()) {
const auto number = QString::number(blockNumber + 1);
painter.setPen(m_highlighter->theme().editorColor(
(blockNumber == currentBlockNumber) ? SyntaxHighlighting::Theme::CurrentLineNumber
: SyntaxHighlighting::Theme::LineNumbers));
painter.drawText(0, top, m_sideBar->width() - 2, fontMetrics().height(), Qt::AlignRight, number);
}
block = block.next();
top = bottom;
bottom = top + blockBoundingRect(block).height();
++blockNumber;
}
}
void CodeEditor::updateSidebarGeometry()
{
setViewportMargins(sidebarWidth(), 0, 0, 0);
const auto r = contentsRect();
m_sideBar->setGeometry(QRect(r.left(), r.top(), sidebarWidth(), r.height()));
}
void CodeEditor::updateSidebarArea(const QRect& rect, int dy)
{
if (dy)
m_sideBar->scroll(0, dy);
else
m_sideBar->update(0, rect.y(), m_sideBar->width(), rect.height());
}
void CodeEditor::highlightCurrentLine()
{
QTextEdit::ExtraSelection selection;
selection.format.setBackground(QColor(m_highlighter->theme().editorColor(SyntaxHighlighting::Theme::CurrentLine)));
selection.format.setProperty(QTextFormat::FullWidthSelection, true);
selection.cursor = textCursor();
selection.cursor.clearSelection();
QList<QTextEdit::ExtraSelection> extraSelections;
extraSelections.append(selection);
setExtraSelections(extraSelections);
}
#include "codeeditor.moc"
<commit_msg>Avoid double highlighting by content and definition change<commit_after>/*
Copyright (C) 2016 Volker Krause <vkrause@kde.org>
This program is free software; you can redistribute it and/or modify it
under the terms of the GNU Library 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 Library General Public
License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "codeeditor.h"
#include <definition.h>
#include <syntaxhighlighter.h>
#include <theme.h>
#include <QApplication>
#include <QDebug>
#include <QFile>
#include <QFileDialog>
#include <QFontDatabase>
#include <QMenu>
#include <QPainter>
#include <QPalette>
class CodeEditorSidebar : public QWidget
{
Q_OBJECT
public:
explicit CodeEditorSidebar(CodeEditor *editor);
QSize sizeHint() const Q_DECL_OVERRIDE;
protected:
void paintEvent(QPaintEvent *event) Q_DECL_OVERRIDE;
private:
CodeEditor *m_codeEditor;
};
CodeEditorSidebar::CodeEditorSidebar(CodeEditor *editor) :
QWidget(editor),
m_codeEditor(editor)
{
}
QSize CodeEditorSidebar::sizeHint() const
{
return QSize(m_codeEditor->sidebarWidth(), 0);
}
void CodeEditorSidebar::paintEvent(QPaintEvent *event)
{
m_codeEditor->sidebarPaintEvent(event);
}
CodeEditor::CodeEditor(QWidget *parent) :
QPlainTextEdit(parent),
m_highlighter(new SyntaxHighlighting::SyntaxHighlighter(document())),
m_sideBar(new CodeEditorSidebar(this))
{
setFont(QFontDatabase::systemFont(QFontDatabase::FixedFont));
setTheme((palette().color(QPalette::Base).lightness() < 128)
? m_repository.defaultTheme(SyntaxHighlighting::Repository::DarkTheme)
: m_repository.defaultTheme(SyntaxHighlighting::Repository::LightTheme));
connect(this, &QPlainTextEdit::blockCountChanged, this, &CodeEditor::updateSidebarGeometry);
connect(this, &QPlainTextEdit::updateRequest, this, &CodeEditor::updateSidebarArea);
connect(this, &QPlainTextEdit::cursorPositionChanged, this, &CodeEditor::highlightCurrentLine);
updateSidebarGeometry();
highlightCurrentLine();
}
CodeEditor::~CodeEditor()
{
}
void CodeEditor::openFile(const QString& fileName)
{
QFile f(fileName);
if (!f.open(QFile::ReadOnly)) {
qWarning() << "Failed to open" << fileName << ":" << f.errorString();
return;
}
clear();
const auto def = m_repository.definitionForFileName(fileName);
m_highlighter->setDefinition(def);
setWindowTitle(fileName);
setPlainText(QString::fromUtf8(f.readAll()));
}
void CodeEditor::contextMenuEvent(QContextMenuEvent *event)
{
auto menu = createStandardContextMenu(event->pos());
menu->addSeparator();
auto openAction = menu->addAction(QStringLiteral("Open File..."));
connect(openAction, &QAction::triggered, this, [this]() {
const auto fileName = QFileDialog::getOpenFileName(this, QStringLiteral("Open File"));
if (!fileName.isEmpty())
openFile(fileName);
});
// syntax selection
auto hlActionGroup = new QActionGroup(menu);
hlActionGroup->setExclusive(true);
auto hlGroupMenu = menu->addMenu(QStringLiteral("Syntax"));
auto noHlAction = hlGroupMenu->addAction(QStringLiteral("None"));
noHlAction->setCheckable(true);
hlActionGroup->addAction(noHlAction);
noHlAction->setChecked(!m_highlighter->definition().isValid());
QMenu *hlSubMenu = Q_NULLPTR;
QString currentGroup;
foreach (const auto &def, m_repository.definitions()) {
if (def.isHidden())
continue;
if (currentGroup != def.section()) {
currentGroup = def.section();
hlSubMenu = hlGroupMenu->addMenu(def.translatedSection());
}
Q_ASSERT(hlSubMenu);
auto action = hlSubMenu->addAction(def.translatedName());
action->setCheckable(true);
action->setData(def.name());
hlActionGroup->addAction(action);
if (def.name() == m_highlighter->definition().name())
action->setChecked(true);
}
connect(hlActionGroup, &QActionGroup::triggered, this, [this](QAction *action) {
const auto defName = action->data().toString();
const auto def = m_repository.definitionForName(defName);
m_highlighter->setDefinition(def);
});
// theme selection
auto themeGroup = new QActionGroup(menu);
themeGroup->setExclusive(true);
auto themeMenu = menu->addMenu(QStringLiteral("Theme"));
foreach (const auto &theme, m_repository.themes()) {
auto action = themeMenu->addAction(theme.translatedName());
action->setCheckable(true);
action->setData(theme.name());
themeGroup->addAction(action);
if (theme.name() == m_highlighter->theme().name())
action->setChecked(true);
}
connect(themeGroup, &QActionGroup::triggered, this, [this](QAction *action) {
const auto themeName = action->data().toString();
const auto theme = m_repository.theme(themeName);
setTheme(theme);
});
menu->exec(event->globalPos());
delete menu;
}
void CodeEditor::resizeEvent(QResizeEvent *event)
{
QPlainTextEdit::resizeEvent(event);
updateSidebarGeometry();
}
void CodeEditor::setTheme(const SyntaxHighlighting::Theme &theme)
{
auto pal = qApp->palette();
if (theme.isValid()) {
pal.setColor(QPalette::Base, theme.editorColor(SyntaxHighlighting::Theme::BackgroundColor));
pal.setColor(QPalette::Text, theme.textColor(SyntaxHighlighting::Theme::Normal));
pal.setColor(QPalette::Highlight, theme.editorColor(SyntaxHighlighting::Theme::TextSelection));
}
setPalette(pal);
m_highlighter->setTheme(theme);
m_highlighter->rehighlight();
highlightCurrentLine();
}
int CodeEditor::sidebarWidth() const
{
int digits = 1;
auto count = blockCount();
while (count >= 10) {
++digits;
count /= 10;
}
return 4 + fontMetrics().width(QLatin1Char('9')) * digits;
}
void CodeEditor::sidebarPaintEvent(QPaintEvent *event)
{
QPainter painter(m_sideBar);
painter.fillRect(event->rect(), m_highlighter->theme().editorColor(SyntaxHighlighting::Theme::IconBorder));
auto block = firstVisibleBlock();
auto blockNumber = block.blockNumber();
int top = blockBoundingGeometry(block).translated(contentOffset()).top();
int bottom = top + blockBoundingRect(block).height();
const int currentBlockNumber = textCursor().blockNumber();
while (block.isValid() && top <= event->rect().bottom()) {
if (block.isVisible() && bottom >= event->rect().top()) {
const auto number = QString::number(blockNumber + 1);
painter.setPen(m_highlighter->theme().editorColor(
(blockNumber == currentBlockNumber) ? SyntaxHighlighting::Theme::CurrentLineNumber
: SyntaxHighlighting::Theme::LineNumbers));
painter.drawText(0, top, m_sideBar->width() - 2, fontMetrics().height(), Qt::AlignRight, number);
}
block = block.next();
top = bottom;
bottom = top + blockBoundingRect(block).height();
++blockNumber;
}
}
void CodeEditor::updateSidebarGeometry()
{
setViewportMargins(sidebarWidth(), 0, 0, 0);
const auto r = contentsRect();
m_sideBar->setGeometry(QRect(r.left(), r.top(), sidebarWidth(), r.height()));
}
void CodeEditor::updateSidebarArea(const QRect& rect, int dy)
{
if (dy)
m_sideBar->scroll(0, dy);
else
m_sideBar->update(0, rect.y(), m_sideBar->width(), rect.height());
}
void CodeEditor::highlightCurrentLine()
{
QTextEdit::ExtraSelection selection;
selection.format.setBackground(QColor(m_highlighter->theme().editorColor(SyntaxHighlighting::Theme::CurrentLine)));
selection.format.setProperty(QTextFormat::FullWidthSelection, true);
selection.cursor = textCursor();
selection.cursor.clearSelection();
QList<QTextEdit::ExtraSelection> extraSelections;
extraSelections.append(selection);
setExtraSelections(extraSelections);
}
#include "codeeditor.moc"
<|endoftext|>
|
<commit_before>// Copyright (c) 2020 The Orbit 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 "FunctionUtils.h"
#include <map>
#include "OrbitBase/Logging.h"
#include "Path.h"
#include "Utils.h"
namespace FunctionUtils {
using orbit_client_protos::FunctionInfo;
using orbit_client_protos::FunctionStats;
using orbit_client_protos::TimerInfo;
std::string GetLoadedModuleName(const FunctionInfo& func) {
return Path::GetFileName(func.loaded_module_path());
}
uint64_t GetHash(const FunctionInfo& func) { return StringHash(func.pretty_name()); }
uint64_t Offset(const FunctionInfo& func) { return func.address() - func.load_bias(); }
bool IsOrbitFunc(const FunctionInfo& func) { return func.type() != FunctionInfo::kNone; }
std::shared_ptr<FunctionInfo> CreateFunctionInfo(std::string name, std::string pretty_name,
uint64_t address, uint64_t load_bias,
uint64_t size, std::string file, uint32_t line,
std::string loaded_module_path,
uint64_t module_base_address) {
std::shared_ptr<FunctionInfo> function_info = std::make_shared<FunctionInfo>();
function_info->set_name(std::move(name));
function_info->set_pretty_name(std::move(pretty_name));
function_info->set_address(address);
function_info->set_load_bias(load_bias);
function_info->set_size(size);
function_info->set_file(std::move(file));
function_info->set_line(line);
function_info->set_loaded_module_path(std::move(loaded_module_path));
function_info->set_module_base_address(module_base_address);
SetOrbitTypeFromName(function_info.get());
return function_info;
}
const absl::flat_hash_map<const char*, FunctionInfo::OrbitType>& GetFunctionNameToOrbitTypeMap() {
static absl::flat_hash_map<const char*, FunctionInfo::OrbitType> function_name_to_type_map{
{"Start(", FunctionInfo::kOrbitTimerStart},
{"Stop(", FunctionInfo::kOrbitTimerStop},
{"StartAsync(", FunctionInfo::kOrbitTimerStartAsync},
{"StopAsync(", FunctionInfo::kOrbitTimerStopAsync},
{"TrackValue(", FunctionInfo::kOrbitTrackValue}};
return function_name_to_type_map;
}
// Detect Orbit API functions by looking for special function names part of the
// orbit_api namespace. On a match, set the corresponding function type.
bool SetOrbitTypeFromName(FunctionInfo* func) {
const std::string& name = GetDisplayName(*func);
if (absl::StartsWith(name, "orbit_api::")) {
for (auto& pair : GetFunctionNameToOrbitTypeMap()) {
if (absl::StrContains(name, pair.first)) {
func->set_type(pair.second);
return true;
}
}
}
return false;
}
} // namespace FunctionUtils
<commit_msg>Remove unused using declarations<commit_after>// Copyright (c) 2020 The Orbit 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 "FunctionUtils.h"
#include <map>
#include "OrbitBase/Logging.h"
#include "Path.h"
#include "Utils.h"
namespace FunctionUtils {
using orbit_client_protos::FunctionInfo;
std::string GetLoadedModuleName(const FunctionInfo& func) {
return Path::GetFileName(func.loaded_module_path());
}
uint64_t GetHash(const FunctionInfo& func) { return StringHash(func.pretty_name()); }
uint64_t Offset(const FunctionInfo& func) { return func.address() - func.load_bias(); }
bool IsOrbitFunc(const FunctionInfo& func) { return func.type() != FunctionInfo::kNone; }
std::shared_ptr<FunctionInfo> CreateFunctionInfo(std::string name, std::string pretty_name,
uint64_t address, uint64_t load_bias,
uint64_t size, std::string file, uint32_t line,
std::string loaded_module_path,
uint64_t module_base_address) {
std::shared_ptr<FunctionInfo> function_info = std::make_shared<FunctionInfo>();
function_info->set_name(std::move(name));
function_info->set_pretty_name(std::move(pretty_name));
function_info->set_address(address);
function_info->set_load_bias(load_bias);
function_info->set_size(size);
function_info->set_file(std::move(file));
function_info->set_line(line);
function_info->set_loaded_module_path(std::move(loaded_module_path));
function_info->set_module_base_address(module_base_address);
SetOrbitTypeFromName(function_info.get());
return function_info;
}
const absl::flat_hash_map<const char*, FunctionInfo::OrbitType>& GetFunctionNameToOrbitTypeMap() {
static absl::flat_hash_map<const char*, FunctionInfo::OrbitType> function_name_to_type_map{
{"Start(", FunctionInfo::kOrbitTimerStart},
{"Stop(", FunctionInfo::kOrbitTimerStop},
{"StartAsync(", FunctionInfo::kOrbitTimerStartAsync},
{"StopAsync(", FunctionInfo::kOrbitTimerStopAsync},
{"TrackValue(", FunctionInfo::kOrbitTrackValue}};
return function_name_to_type_map;
}
// Detect Orbit API functions by looking for special function names part of the
// orbit_api namespace. On a match, set the corresponding function type.
bool SetOrbitTypeFromName(FunctionInfo* func) {
const std::string& name = GetDisplayName(*func);
if (absl::StartsWith(name, "orbit_api::")) {
for (auto& pair : GetFunctionNameToOrbitTypeMap()) {
if (absl::StrContains(name, pair.first)) {
func->set_type(pair.second);
return true;
}
}
}
return false;
}
} // namespace FunctionUtils
<|endoftext|>
|
<commit_before>#include "RigidBody.h"
void RigidBody::SetPosition(Ogre::Vector3 & position)
{
RigidBody::Node->setPosition(position);
}
Ogre::Vector3 RigidBody::GetPosition()
{
return RigidBody::Node->getPosition();
}
void RigidBody::SetOrientation(Ogre::Quaternion & orientation)
{
RigidBody::Node->setOrientation(orientation);
}
Ogre::Quaternion RigidBody::GetOrientation()
{
return RigidBody::Node->getOrientation();
}
void RigidBody::AddForce(Ogre::Vector3 & force)
{
RigidBody::ForceAccum += force;
}
void RigidBody::AddTorque(Ogre::Vector3 & torque)
{
RigidBody::TorqueAccum = torque;
}
void RigidBody::SetIsAwake(const bool awake)
{
RigidBody::IsAwake = awake;
}
void RigidBody::Integrate(float delta)
{
if (RigidBody::IsAwake)
{
//calculate acceleration with mass and force
//TODO calculate angular acceleration with Tensor and Torque
RigidBody::Acceleration.addScaledVector(RigidBody::ForceAccum, RigidBody::InverseMass);
//Update velocity with time and acceleration
RigidBody::Velocity.addScaledVector(RigidBody::Acceleration, delta);
//dampen the movement so it stops eventually
RigidBody::Velocity *= Ogre::Math().Pow(RigidBody::Dampening, delta);
//Move Rigidbody with velocity and time
Ogre::Vector3 tempPos = RigidBody::GetPosition();
tempPos.addScaledVector(RigidBody::Velocity, delta);
RigidBody::SetPosition(tempPos);
//TODO Calculate total movement and check if under benchmark: IsAwake = false
}
}
<commit_msg>Fixed error in rigidbody<commit_after>#include "RigidBody.h"
void RigidBody::SetPosition(Ogre::Vector3 & position)
{
RigidBody::Node->setPosition(position);
}
Ogre::Vector3 RigidBody::GetPosition()
{
return RigidBody::Node->getPosition();
}
void RigidBody::SetOrientation(Ogre::Quaternion & orientation)
{
RigidBody::Node->setOrientation(orientation);
}
Ogre::Quaternion RigidBody::GetOrientation()
{
return RigidBody::Node->getOrientation();
}
void RigidBody::AddForce(Ogre::Vector3 & force)
{
RigidBody::ForceAccum += force;
}
void RigidBody::AddTorque(Ogre::Vector3 & torque)
{
RigidBody::TorqueAccum = torque;
}
void RigidBody::SetIsAwake(const bool awake)
{
RigidBody::IsAwake = awake;
}
void RigidBody::Integrate(float delta)
{
if (RigidBody::IsAwake)
{
//calculate acceleration with mass and force
//TODO calculate angular acceleration with Tensor and Torque
RigidBody::Acceleration + (RigidBody::ForceAccum * RigidBody::InverseMass);
//Update velocity with time and acceleration
RigidBody::Velocity + (RigidBody::Acceleration * delta);
//dampen the movement so it stops eventually
RigidBody::Velocity *= Ogre::Math().Pow(RigidBody::Dampening, delta);
//Move Rigidbody with velocity and time
Ogre::Vector3 tempPos = RigidBody::GetPosition();
tempPos + (RigidBody::Velocity * delta);
RigidBody::SetPosition(tempPos);
//TODO Calculate total movement and check if under benchmark: IsAwake = false
}
}
<|endoftext|>
|
<commit_before>/*******************************************************
* Copyright (c) 2014, ArrayFire
* All rights reserved.
*
* This file is distributed under 3-clause BSD license.
* The complete license agreement can be obtained at:
* http://arrayfire.com/licenses/BSD-3-Clause
********************************************************/
#include <gtest/gtest.h>
#include <arrayfire.h>
#include <af/dim4.hpp>
#include <af/defines.h>
#include <af/traits.hpp>
#include <af/data.h>
#include <vector>
#include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <testHelpers.hpp>
using std::vector;
using std::string;
using std::generate;
using std::cout;
using std::endl;
using std::ostream_iterator;
using af::dtype_traits;
void testGeneralAssignOneArray(string pTestFile, const dim_type ndims, af_index_t* indexers, int arrayDim)
{
vector<af::dim4> numDims;
vector< vector<float> > in;
vector< vector<float> > tests;
readTestsFromFile<float, float>(pTestFile, numDims, in, tests);
af::dim4 dims0 = numDims[0];
af::dim4 dims1 = numDims[1];
af::dim4 dims2 = numDims[2];
af_array outArray = 0;
af_array rhsArray = 0;
af_array lhsArray = 0;
af_array idxArray = 0;
ASSERT_EQ(AF_SUCCESS, af_create_array(&lhsArray, &(in[0].front()),
dims0.ndims(), dims0.get(), (af_dtype)af::dtype_traits<float>::af_type));
ASSERT_EQ(AF_SUCCESS, af_create_array(&rhsArray, &(in[1].front()),
dims1.ndims(), dims1.get(), (af_dtype)af::dtype_traits<float>::af_type));
ASSERT_EQ(AF_SUCCESS, af_create_array(&idxArray, &(in[2].front()),
dims2.ndims(), dims2.get(), (af_dtype)af::dtype_traits<float>::af_type));
indexers[arrayDim].mIndexer.arr = idxArray;
ASSERT_EQ(AF_SUCCESS, af_assign_gen(&outArray, lhsArray, ndims, indexers, rhsArray));
vector<float> currGoldBar = tests[0];
size_t nElems = currGoldBar.size();
float *outData = new float[nElems];
ASSERT_EQ(AF_SUCCESS, af_get_data_ptr((void*)outData, outArray));
for (size_t elIter=0; elIter<nElems; ++elIter) {
ASSERT_EQ(currGoldBar[elIter], outData[elIter])<< "at: " << elIter<< std::endl;
}
delete[] outData;
ASSERT_EQ(AF_SUCCESS, af_destroy_array(rhsArray));
ASSERT_EQ(AF_SUCCESS, af_destroy_array(lhsArray));
ASSERT_EQ(AF_SUCCESS, af_destroy_array(idxArray));
ASSERT_EQ(AF_SUCCESS, af_destroy_array(outArray));
}
TEST(GeneralAssign, ASSS)
{
af_index_t indexers[2];
indexers[1].mIndexer.seq = af_make_seq(0, 9, 1);
indexers[0].mIsSeq = false;
indexers[1].mIsSeq = true;
testGeneralAssignOneArray(string(TEST_DIR"/gen_assign/as0_9s0_ns0_n.test"), 2, indexers, 0);
}
TEST(GeneralAssign, SASS)
{
af_index_t indexers[2];
indexers[0].mIndexer.seq = af_make_seq(10, 14, 1);
indexers[0].mIsSeq = true;
indexers[1].mIsSeq = false;
testGeneralAssignOneArray(string(TEST_DIR"/gen_assign/s10_14as0_ns0_n.test"), 2, indexers, 1);
}
TEST(GeneralAssign, SSSS)
{
vector<af::dim4> numDims;
vector< vector<float> > in;
vector< vector<float> > tests;
readTestsFromFile<float, float>(string(TEST_DIR"/gen_assign/s10_14s0_9s0_ns0_n.test"), numDims, in, tests);
af::dim4 dims0 = numDims[0];
af::dim4 dims1 = numDims[1];
af_array outArray = 0;
af_array rhsArray = 0;
af_array lhsArray = 0;
af_index_t indexers[2];
indexers[0].mIndexer.seq = af_make_seq(10, 14, 1);
indexers[1].mIndexer.seq = af_make_seq(0, 9, 1);
indexers[0].mIsSeq = true;
indexers[1].mIsSeq = true;
ASSERT_EQ(AF_SUCCESS, af_create_array(&lhsArray, &(in[0].front()),
dims0.ndims(), dims0.get(), (af_dtype)af::dtype_traits<float>::af_type));
ASSERT_EQ(AF_SUCCESS, af_create_array(&rhsArray, &(in[1].front()),
dims1.ndims(), dims1.get(), (af_dtype)af::dtype_traits<float>::af_type));
ASSERT_EQ(AF_SUCCESS, af_assign_gen(&outArray, lhsArray, 2, indexers, rhsArray));
vector<float> currGoldBar = tests[0];
size_t nElems = currGoldBar.size();
float *outData = new float[nElems];
ASSERT_EQ(AF_SUCCESS, af_get_data_ptr((void*)outData, outArray));
for (size_t elIter=0; elIter<nElems; ++elIter) {
ASSERT_EQ(currGoldBar[elIter], outData[elIter])<< "at: " << elIter<< std::endl;
}
delete[] outData;
ASSERT_EQ(AF_SUCCESS, af_destroy_array(rhsArray));
ASSERT_EQ(AF_SUCCESS, af_destroy_array(lhsArray));
ASSERT_EQ(AF_SUCCESS, af_destroy_array(outArray));
}
TEST(GeneralAssign, AAAA)
{
vector<af::dim4> numDims;
vector< vector<float> > in;
vector< vector<float> > tests;
readTestsFromFile<float, float>(string(TEST_DIR"/gen_assign/aaaa.test"), numDims, in, tests);
af::dim4 dims0 = numDims[0];
af::dim4 dims1 = numDims[1];
af::dim4 dims2 = numDims[2];
af::dim4 dims3 = numDims[3];
af::dim4 dims4 = numDims[4];
af::dim4 dims5 = numDims[5];
af_array outArray = 0;
af_array rhsArray = 0;
af_array lhsArray = 0;
af_array idxArray0 = 0;
af_array idxArray1 = 0;
af_array idxArray2 = 0;
af_array idxArray3 = 0;
af_index_t indexers[4];
indexers[0].mIsSeq = false;
indexers[1].mIsSeq = false;
indexers[2].mIsSeq = false;
indexers[3].mIsSeq = false;
ASSERT_EQ(AF_SUCCESS, af_create_array(&lhsArray, &(in[0].front()),
dims0.ndims(), dims0.get(), (af_dtype)af::dtype_traits<float>::af_type));
ASSERT_EQ(AF_SUCCESS, af_create_array(&rhsArray, &(in[1].front()),
dims1.ndims(), dims1.get(), (af_dtype)af::dtype_traits<float>::af_type));
ASSERT_EQ(AF_SUCCESS, af_create_array(&idxArray0, &(in[2].front()),
dims2.ndims(), dims2.get(), (af_dtype)af::dtype_traits<float>::af_type));
indexers[0].mIndexer.arr = idxArray0;
ASSERT_EQ(AF_SUCCESS, af_create_array(&idxArray1, &(in[3].front()),
dims3.ndims(), dims3.get(), (af_dtype)af::dtype_traits<float>::af_type));
indexers[1].mIndexer.arr = idxArray1;
ASSERT_EQ(AF_SUCCESS, af_create_array(&idxArray2, &(in[4].front()),
dims4.ndims(), dims4.get(), (af_dtype)af::dtype_traits<float>::af_type));
indexers[2].mIndexer.arr = idxArray2;
ASSERT_EQ(AF_SUCCESS, af_create_array(&idxArray3, &(in[5].front()),
dims5.ndims(), dims5.get(), (af_dtype)af::dtype_traits<float>::af_type));
indexers[3].mIndexer.arr = idxArray3;
ASSERT_EQ(AF_SUCCESS, af_assign_gen(&outArray, lhsArray, 4, indexers, rhsArray));
vector<float> currGoldBar = tests[0];
size_t nElems = currGoldBar.size();
float *outData = new float[nElems];
ASSERT_EQ(AF_SUCCESS, af_get_data_ptr((void*)outData, outArray));
for (size_t elIter=0; elIter<nElems; ++elIter) {
ASSERT_EQ(currGoldBar[elIter], outData[elIter])<< "at: " << elIter<< std::endl;
}
delete[] outData;
ASSERT_EQ(AF_SUCCESS, af_destroy_array(rhsArray));
ASSERT_EQ(AF_SUCCESS, af_destroy_array(lhsArray));
ASSERT_EQ(AF_SUCCESS, af_destroy_array(outArray));
}
<commit_msg>TEST: Adding test for a(idx) = b where idx is array<commit_after>/*******************************************************
* Copyright (c) 2014, ArrayFire
* All rights reserved.
*
* This file is distributed under 3-clause BSD license.
* The complete license agreement can be obtained at:
* http://arrayfire.com/licenses/BSD-3-Clause
********************************************************/
#include <gtest/gtest.h>
#include <arrayfire.h>
#include <af/dim4.hpp>
#include <af/defines.h>
#include <af/traits.hpp>
#include <af/data.h>
#include <vector>
#include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <testHelpers.hpp>
using std::vector;
using std::string;
using std::generate;
using std::cout;
using std::endl;
using std::ostream_iterator;
using af::dtype_traits;
void testGeneralAssignOneArray(string pTestFile, const dim_type ndims, af_index_t* indexers, int arrayDim)
{
vector<af::dim4> numDims;
vector< vector<float> > in;
vector< vector<float> > tests;
readTestsFromFile<float, float>(pTestFile, numDims, in, tests);
af::dim4 dims0 = numDims[0];
af::dim4 dims1 = numDims[1];
af::dim4 dims2 = numDims[2];
af_array outArray = 0;
af_array rhsArray = 0;
af_array lhsArray = 0;
af_array idxArray = 0;
ASSERT_EQ(AF_SUCCESS, af_create_array(&lhsArray, &(in[0].front()),
dims0.ndims(), dims0.get(), (af_dtype)af::dtype_traits<float>::af_type));
ASSERT_EQ(AF_SUCCESS, af_create_array(&rhsArray, &(in[1].front()),
dims1.ndims(), dims1.get(), (af_dtype)af::dtype_traits<float>::af_type));
ASSERT_EQ(AF_SUCCESS, af_create_array(&idxArray, &(in[2].front()),
dims2.ndims(), dims2.get(), (af_dtype)af::dtype_traits<float>::af_type));
indexers[arrayDim].mIndexer.arr = idxArray;
ASSERT_EQ(AF_SUCCESS, af_assign_gen(&outArray, lhsArray, ndims, indexers, rhsArray));
vector<float> currGoldBar = tests[0];
size_t nElems = currGoldBar.size();
float *outData = new float[nElems];
ASSERT_EQ(AF_SUCCESS, af_get_data_ptr((void*)outData, outArray));
for (size_t elIter=0; elIter<nElems; ++elIter) {
ASSERT_EQ(currGoldBar[elIter], outData[elIter])<< "at: " << elIter<< std::endl;
}
delete[] outData;
ASSERT_EQ(AF_SUCCESS, af_destroy_array(rhsArray));
ASSERT_EQ(AF_SUCCESS, af_destroy_array(lhsArray));
ASSERT_EQ(AF_SUCCESS, af_destroy_array(idxArray));
ASSERT_EQ(AF_SUCCESS, af_destroy_array(outArray));
}
TEST(GeneralAssign, ASSS)
{
af_index_t indexers[2];
indexers[1].mIndexer.seq = af_make_seq(0, 9, 1);
indexers[0].mIsSeq = false;
indexers[1].mIsSeq = true;
testGeneralAssignOneArray(string(TEST_DIR"/gen_assign/as0_9s0_ns0_n.test"), 2, indexers, 0);
}
TEST(GeneralAssign, SASS)
{
af_index_t indexers[2];
indexers[0].mIndexer.seq = af_make_seq(10, 14, 1);
indexers[0].mIsSeq = true;
indexers[1].mIsSeq = false;
testGeneralAssignOneArray(string(TEST_DIR"/gen_assign/s10_14as0_ns0_n.test"), 2, indexers, 1);
}
TEST(GeneralAssign, SSSS)
{
vector<af::dim4> numDims;
vector< vector<float> > in;
vector< vector<float> > tests;
readTestsFromFile<float, float>(string(TEST_DIR"/gen_assign/s10_14s0_9s0_ns0_n.test"), numDims, in, tests);
af::dim4 dims0 = numDims[0];
af::dim4 dims1 = numDims[1];
af_array outArray = 0;
af_array rhsArray = 0;
af_array lhsArray = 0;
af_index_t indexers[2];
indexers[0].mIndexer.seq = af_make_seq(10, 14, 1);
indexers[1].mIndexer.seq = af_make_seq(0, 9, 1);
indexers[0].mIsSeq = true;
indexers[1].mIsSeq = true;
ASSERT_EQ(AF_SUCCESS, af_create_array(&lhsArray, &(in[0].front()),
dims0.ndims(), dims0.get(), (af_dtype)af::dtype_traits<float>::af_type));
ASSERT_EQ(AF_SUCCESS, af_create_array(&rhsArray, &(in[1].front()),
dims1.ndims(), dims1.get(), (af_dtype)af::dtype_traits<float>::af_type));
ASSERT_EQ(AF_SUCCESS, af_assign_gen(&outArray, lhsArray, 2, indexers, rhsArray));
vector<float> currGoldBar = tests[0];
size_t nElems = currGoldBar.size();
float *outData = new float[nElems];
ASSERT_EQ(AF_SUCCESS, af_get_data_ptr((void*)outData, outArray));
for (size_t elIter=0; elIter<nElems; ++elIter) {
ASSERT_EQ(currGoldBar[elIter], outData[elIter])<< "at: " << elIter<< std::endl;
}
delete[] outData;
ASSERT_EQ(AF_SUCCESS, af_destroy_array(rhsArray));
ASSERT_EQ(AF_SUCCESS, af_destroy_array(lhsArray));
ASSERT_EQ(AF_SUCCESS, af_destroy_array(outArray));
}
TEST(GeneralAssign, AAAA)
{
vector<af::dim4> numDims;
vector< vector<float> > in;
vector< vector<float> > tests;
readTestsFromFile<float, float>(string(TEST_DIR"/gen_assign/aaaa.test"), numDims, in, tests);
af::dim4 dims0 = numDims[0];
af::dim4 dims1 = numDims[1];
af::dim4 dims2 = numDims[2];
af::dim4 dims3 = numDims[3];
af::dim4 dims4 = numDims[4];
af::dim4 dims5 = numDims[5];
af_array outArray = 0;
af_array rhsArray = 0;
af_array lhsArray = 0;
af_array idxArray0 = 0;
af_array idxArray1 = 0;
af_array idxArray2 = 0;
af_array idxArray3 = 0;
af_index_t indexers[4];
indexers[0].mIsSeq = false;
indexers[1].mIsSeq = false;
indexers[2].mIsSeq = false;
indexers[3].mIsSeq = false;
ASSERT_EQ(AF_SUCCESS, af_create_array(&lhsArray, &(in[0].front()),
dims0.ndims(), dims0.get(), (af_dtype)af::dtype_traits<float>::af_type));
ASSERT_EQ(AF_SUCCESS, af_create_array(&rhsArray, &(in[1].front()),
dims1.ndims(), dims1.get(), (af_dtype)af::dtype_traits<float>::af_type));
ASSERT_EQ(AF_SUCCESS, af_create_array(&idxArray0, &(in[2].front()),
dims2.ndims(), dims2.get(), (af_dtype)af::dtype_traits<float>::af_type));
indexers[0].mIndexer.arr = idxArray0;
ASSERT_EQ(AF_SUCCESS, af_create_array(&idxArray1, &(in[3].front()),
dims3.ndims(), dims3.get(), (af_dtype)af::dtype_traits<float>::af_type));
indexers[1].mIndexer.arr = idxArray1;
ASSERT_EQ(AF_SUCCESS, af_create_array(&idxArray2, &(in[4].front()),
dims4.ndims(), dims4.get(), (af_dtype)af::dtype_traits<float>::af_type));
indexers[2].mIndexer.arr = idxArray2;
ASSERT_EQ(AF_SUCCESS, af_create_array(&idxArray3, &(in[5].front()),
dims5.ndims(), dims5.get(), (af_dtype)af::dtype_traits<float>::af_type));
indexers[3].mIndexer.arr = idxArray3;
ASSERT_EQ(AF_SUCCESS, af_assign_gen(&outArray, lhsArray, 4, indexers, rhsArray));
vector<float> currGoldBar = tests[0];
size_t nElems = currGoldBar.size();
float *outData = new float[nElems];
ASSERT_EQ(AF_SUCCESS, af_get_data_ptr((void*)outData, outArray));
for (size_t elIter=0; elIter<nElems; ++elIter) {
ASSERT_EQ(currGoldBar[elIter], outData[elIter])<< "at: " << elIter<< std::endl;
}
delete[] outData;
ASSERT_EQ(AF_SUCCESS, af_destroy_array(rhsArray));
ASSERT_EQ(AF_SUCCESS, af_destroy_array(lhsArray));
ASSERT_EQ(AF_SUCCESS, af_destroy_array(outArray));
}
TEST(ArrayAssign, CPP_ASSIGN_INDEX)
{
using af::array;
const int num = 20000;
array a = af::randu(num);
float *hAO = a.host<float>();
array a_copy = a;
array idx = where(a < 0.5);
const int len = idx.elements();
array b = af::randu(len);
a(idx) = b;
float *hA = a.host<float>();
float *hB = b.host<float>();
float *hAC = a_copy.host<float>();
uint *hIdx = idx.host<uint>();
for (int i = 0; i < num; i++) {
int j = 0;
while(j < len) {
// If index found, value should match B
if ((int)hIdx[j] == i) {
ASSERT_EQ(hA[i], hB[j]);
break;
}
j++;
}
// If index not found, value should match original
if (j >= len) {
ASSERT_EQ(hA[i], hAO[i]);
}
}
// hAC should not be modified, i.e. same as original
for (int i = 0; i < num; i++) {
ASSERT_EQ(hAO[i], hAC[i]);
}
delete[] hA;
delete[] hB;
delete[] hAC;
delete[] hAO;
delete[] hIdx;
}
<|endoftext|>
|
<commit_before>#if !defined(__CINT__) || defined(__MAKECINT__)
// ROOT includes
#include "TFile.h"
#include "TGrid.h"
#include "TString.h"
#include "TObjArray.h"
#include "TObjString.h"
#include "TSystem.h"
#include "TROOT.h"
#include "TKey.h"
#include "TTree.h"
#include "TParameter.h"
// Aliroot includes
#include "AliAnalysisManager.h"
#include "AliAnalysisAlien.h"
#include "AliESDInputHandler.h"
#define COMPILEMACRO
#endif
//_____________________________________________________________________________
void LoadLibs()
{
gSystem->Load("libTree");
gSystem->Load("libGeom");
gSystem->Load("libVMC");
gSystem->Load("libPhysics");
gSystem->Load("libProof");
gSystem->Load("libANALYSIS.so");
gSystem->Load("libOADB.so");
gSystem->Load("libANALYSISalice.so");
gSystem->Load("libCORRFW.so");
gSystem->Load("libPWGmuon.so");
gSystem->Load("libPWGPPMUONlite.so");
}
//_____________________________________________________________________________
AliAnalysisAlien* CreateAlienHandler()
{
AliAnalysisAlien *plugin = new AliAnalysisAlien();
// Set the run mode
plugin->SetRunMode("terminate");
// Declare all libraries
plugin->SetAdditionalLibs("libCORRFW.so libPWGHFbase.so libPWGmuon.so libPWGPPMUONlite.so");
plugin->SetAdditionalRootLibs("libXMLParser.so libGui.so libProofPlayer.so");
plugin->AddIncludePath("-I.");
plugin->AddIncludePath("-I$ALICE_ROOT/PWGPP/MUON/lite");
return plugin;
}
enum {
trackQA = 1 << 0,
trigQA = 1 << 1
};
//_____________________________________________________________________________
void terminateQA ( TString outfilename = "QAresults.root", UInt_t force = 0, UInt_t mask = (trackQA|trigQA) )
{
//
// Load common libraries
//
LoadLibs();
AliAnalysisAlien* alienHandler = CreateAlienHandler();
AliAnalysisManager* mgr = new AliAnalysisManager("testAnalysis");
mgr->SetCommonFileName(outfilename.Data());
mgr->SetGridHandler(alienHandler);
// Needed to the manager (but not used in terminate mode)
AliESDInputHandler* esdH = new AliESDInputHandler();
esdH->SetReadFriends(kFALSE);
mgr->SetInputEventHandler(esdH);
TString trigOutName = "trigChEff_ANY_Apt_allTrig.root";
if ( ( force & trigQA ) == 0 ) {
if ( gSystem->AccessPathName(trigOutName) == 0 ) {
printf("Terminate already done for trigger. Skip\n");
mask &= ~trigQA;
}
}
if ( ( force & trackQA ) == 0 ) {
TFile* file = TFile::Open(outfilename.Data());
TKey* key = file->FindKeyAny("general2");
if ( key ) {
printf("Terminate already done for tracker. Skip\n");
mask &= ~trackQA;
}
delete file;
}
#ifndef COMPILEMACRO
if ( mask & trigQA ) {
gROOT->LoadMacro("$ALICE_ROOT/PWGPP/macros/AddTaskMTRchamberEfficiency.C");
AliAnalysisTaskTrigChEff* trigChEffTask = AddTaskMTRchamberEfficiency(kFALSE);
trigChEffTask->SetTerminateOptions("PhysSelPass","ANY","-5_105",Form("FORCEBATCH %s?PhysSelPass?ANY?-5_105?NoSelMatchAptFromTrg",trigOutName));
}
if ( mask & trackQA ) {
gROOT->LoadMacro("$ALICE_ROOT/PWGPP/PilotTrain/AddTaskMuonQA.C");
AliAnalysisTaskMuonQA* muonQATask = AddTaskMuonQA();
}
#endif
// // Check if terminate was already performed
// if ( ! force ) {
// TObject* paramContainer = mgr->GetParamOutputs()->At(0);
// if ( paramContainer ) {
// TFile* file = TFile::Open(outfilename);
// if ( file->FindObjectAny(paramContainer->GetName() ) ) {
// printf("\nTerminate was already executed!\n");
// printf("Nothing to be done\n");
// file->Close();
// return;
// }
// file->Close();
// }
// }
if ( ! mgr->InitAnalysis()) {
printf("Fatal: Cannot initialize analysis\n");
return;
}
mgr->PrintStatus();
mgr->StartAnalysis("grid terminate");
}
//_____________________________________________________________________________
TString GetFullPath ( TString filename )
{
if ( filename.BeginsWith("alien://") ) return filename;
TString dirName = gSystem->DirName(filename);
TString baseName = gSystem->BaseName(filename);
TString currDir = gSystem->pwd();
gSystem->cd(dirName);
TString fullDir = gSystem->pwd();
gSystem->cd(currDir);
TString fullPath = fullDir.Data();
if ( ! fullDir.EndsWith("/") ) fullPath.Append("/");
fullPath += baseName;
return fullPath;
}
//_____________________________________________________________________________
TString GetBaseName ( TString filename )
{
TString baseName = gSystem->BaseName(filename);
Int_t idx = baseName.Index("#");
if ( idx > 0 ) baseName.Remove(0,idx+1);
return baseName;
}
//_____________________________________________________________________________
void CopyDir(TDirectory *source) {
//copy all objects and subdirs of directory source as a subdir of the current directory
TDirectory *savdir = gDirectory;
TDirectory *adir = savdir->mkdir(source->GetName());
adir->cd();
//loop on all entries of this directory
TKey *key;
TIter nextkey(source->GetListOfKeys());
while ((key = (TKey*)nextkey())) {
const char *classname = key->GetClassName();
TClass *cl = gROOT->GetClass(classname);
if (!cl) continue;
if (cl->InheritsFrom(TDirectory::Class())) {
source->cd(key->GetName());
TDirectory *subdir = gDirectory;
adir->cd();
CopyDir(subdir);
adir->cd();
} else if (cl->InheritsFrom(TTree::Class())) {
TTree *T = (TTree*)source->Get(key->GetName());
adir->cd();
TTree *newT = T->CloneTree(-1,"fast");
newT->Write();
} else {
source->cd();
TObject *obj = key->ReadObj();
adir->cd();
obj->Write(obj->GetName(),TObject::kSingleKey);
delete obj;
}
}
adir->SaveSelf(kTRUE);
savdir->cd();
}
//_____________________________________________________________________________
Bool_t GetQAInfo ( const char* qaFileName, TString dirNames = "MUON_QA MTR_ChamberEffMap MUON.TrigEfficiencyMap MUON.TriggerEfficiencyMap" )
{
LoadLibs();
TString outFilename = GetBaseName(qaFileName);
TString inFullPath = GetFullPath(qaFileName);
TString outFullPath = GetFullPath(outFilename);
if ( inFullPath == outFullPath ) {
printf("Warning: input and output are same file!\n");
return kFALSE;
}
if ( inFullPath.BeginsWith("alien") && ! gGrid ) TGrid::Connect("alien://");
TObjArray* dirList = dirNames.Tokenize(" ");
TFile* outFile = TFile::Open(outFilename,"RECREATE");
TFile* inFile = TFile::Open(qaFileName);
for ( Int_t idir=0; idir<dirList->GetEntries(); idir++ ) {
inFile->cd();
TObject* obj = inFile->Get(dirList->At(idir)->GetName());
if ( ! obj ) continue;
outFile->cd();
CopyDir(static_cast<TDirectory*>(obj));
}
delete outFile;
delete inFile;
delete dirList;
return kTRUE;
}
//_____________________________________________________________________________
Bool_t AddTreeVariable ( TList& parList, const char* varName, char varType, Float_t val )
{
if ( varType == 'D' ) varType = 'F';
TString parName = Form("%s/%c",varName,varType);
if ( varType == 'F' ) {
parList.Add(new TParameter<float>(parName,val));
}
else if ( varType == 'I' ) {
parList.Add(new TParameter<int>(parName,(Int_t)val));
}
else {
printf("Error: variable type %c not accepted", varType);
return kFALSE;
}
return kTRUE;
}
//_____________________________________________________________________________
void FillTree ( TTree* tree, TList &parList )
{
Int_t nVars = parList.GetEntries();
TArrayI varInt(nVars);
TArrayF varFloat(nVars);
for ( Int_t ivar=0; ivar<nVars; ivar++ ) {
TObject* obj = parList.At(ivar);
TString varName = obj->GetName();
TString branchName = varName;
branchName.Remove(varName.Length()-2);
if ( varName.EndsWith("F") ) {
varFloat[ivar] = ((TParameter<float>*)obj)->GetVal();
tree->Branch(branchName.Data(),&varFloat[ivar],varName.Data());
}
else if ( varName.EndsWith("I") ) {
varInt[ivar] = (Int_t)((TParameter<int>*)obj)->GetVal();
tree->Branch(branchName.Data(),&varInt[ivar],varName.Data());
}
}
tree->Fill();
}
//_____________________________________________________________________________
void AddTrigVars ( TString filename, TList &parList )
{
TString trigOutName = "trigChEff_ANY_Apt_allTrig.root";
if ( gSystem->AccessPathName(trigOutName.Data()) ) trigOutName = filename;
TFile* file = TFile::Open(filename.Data());
TList* inList = (TList*)file->FindObjectAny("triggerChamberEff");
TString hChNames[] = {"bendPlaneCountChamber","nonBendPlaneCountChamber","allTracksCountChamber"};
Int_t nHistos = sizeof(hChNames)/sizeof(hChNames[0]);
for ( Int_t ihisto=0; ihisto<nHistos; ihisto++ ) {
TH1* histo = (TH1*)inList->FindObject(hChNames[ihisto].Data());
Double_t currVal = ( histo ) ? histo->GetBinContent(ibin) : 0.;
for ( Int_t ibin=1; ibin<=4; ibin++ ) {
AddTreeVariable(parList, Form("%s%i",hChNames[ihisto].Data(),ibin),'F',currVal);
}
}
delete file;
}
//_____________________________________________________________________________
void MakeTrend ( const char* qaFile, Int_t runNumber, UInt_t force = trigQA, UInt_t mask = (trackQA|trigQA) )
{
Bool_t isOk = GetQAInfo(qaFile);
if ( ! isOk ) return;
TString inFilename = GetBaseName(qaFile);
terminateQA(inFilename,force,mask);
TList parList;
parList.SetOwner();
AddTreeVariable(parList, "run", 'I', runNumber);
// function for trigger
AddTrigVars(inFilename.Data(),parList);
TFile* outFile = TFile::Open("trending.root","RECREATE");
TTree* tree = new TTree("trending","trending");
FillTree(tree, parList);
tree->Write();
delete outFile;
}
<commit_msg>Bug fix: variable used outside loop<commit_after>#if !defined(__CINT__) || defined(__MAKECINT__)
// ROOT includes
#include "TFile.h"
#include "TGrid.h"
#include "TString.h"
#include "TObjArray.h"
#include "TObjString.h"
#include "TSystem.h"
#include "TROOT.h"
#include "TKey.h"
#include "TTree.h"
#include "TParameter.h"
// Aliroot includes
#include "AliAnalysisManager.h"
#include "AliAnalysisAlien.h"
#include "AliESDInputHandler.h"
#define COMPILEMACRO
#endif
//_____________________________________________________________________________
void LoadLibs()
{
gSystem->Load("libTree");
gSystem->Load("libGeom");
gSystem->Load("libVMC");
gSystem->Load("libPhysics");
gSystem->Load("libProof");
gSystem->Load("libANALYSIS.so");
gSystem->Load("libOADB.so");
gSystem->Load("libANALYSISalice.so");
gSystem->Load("libCORRFW.so");
gSystem->Load("libPWGmuon.so");
gSystem->Load("libPWGPPMUONlite.so");
}
//_____________________________________________________________________________
AliAnalysisAlien* CreateAlienHandler()
{
AliAnalysisAlien *plugin = new AliAnalysisAlien();
// Set the run mode
plugin->SetRunMode("terminate");
// Declare all libraries
plugin->SetAdditionalLibs("libCORRFW.so libPWGHFbase.so libPWGmuon.so libPWGPPMUONlite.so");
plugin->SetAdditionalRootLibs("libXMLParser.so libGui.so libProofPlayer.so");
plugin->AddIncludePath("-I.");
plugin->AddIncludePath("-I$ALICE_ROOT/PWGPP/MUON/lite");
return plugin;
}
enum {
trackQA = 1 << 0,
trigQA = 1 << 1
};
//_____________________________________________________________________________
void terminateQA ( TString outfilename = "QAresults.root", UInt_t force = 0, UInt_t mask = (trackQA|trigQA) )
{
//
// Load common libraries
//
LoadLibs();
AliAnalysisAlien* alienHandler = CreateAlienHandler();
AliAnalysisManager* mgr = new AliAnalysisManager("testAnalysis");
mgr->SetCommonFileName(outfilename.Data());
mgr->SetGridHandler(alienHandler);
// Needed to the manager (but not used in terminate mode)
AliESDInputHandler* esdH = new AliESDInputHandler();
esdH->SetReadFriends(kFALSE);
mgr->SetInputEventHandler(esdH);
TString trigOutName = "trigChEff_ANY_Apt_allTrig.root";
if ( ( force & trigQA ) == 0 ) {
if ( gSystem->AccessPathName(trigOutName) == 0 ) {
printf("Terminate already done for trigger. Skip\n");
mask &= ~trigQA;
}
}
if ( ( force & trackQA ) == 0 ) {
TFile* file = TFile::Open(outfilename.Data());
TKey* key = file->FindKeyAny("general2");
if ( key ) {
printf("Terminate already done for tracker. Skip\n");
mask &= ~trackQA;
}
delete file;
}
#ifndef COMPILEMACRO
if ( mask & trigQA ) {
gROOT->LoadMacro("$ALICE_ROOT/PWGPP/macros/AddTaskMTRchamberEfficiency.C");
AliAnalysisTaskTrigChEff* trigChEffTask = AddTaskMTRchamberEfficiency(kFALSE);
trigChEffTask->SetTerminateOptions("PhysSelPass","ANY","-5_105",Form("FORCEBATCH %s?PhysSelPass?ANY?-5_105?NoSelMatchAptFromTrg",trigOutName));
}
if ( mask & trackQA ) {
gROOT->LoadMacro("$ALICE_ROOT/PWGPP/PilotTrain/AddTaskMuonQA.C");
AliAnalysisTaskMuonQA* muonQATask = AddTaskMuonQA();
}
#endif
// // Check if terminate was already performed
// if ( ! force ) {
// TObject* paramContainer = mgr->GetParamOutputs()->At(0);
// if ( paramContainer ) {
// TFile* file = TFile::Open(outfilename);
// if ( file->FindObjectAny(paramContainer->GetName() ) ) {
// printf("\nTerminate was already executed!\n");
// printf("Nothing to be done\n");
// file->Close();
// return;
// }
// file->Close();
// }
// }
if ( ! mgr->InitAnalysis()) {
printf("Fatal: Cannot initialize analysis\n");
return;
}
mgr->PrintStatus();
mgr->StartAnalysis("grid terminate");
}
//_____________________________________________________________________________
TString GetFullPath ( TString filename )
{
if ( filename.BeginsWith("alien://") ) return filename;
TString dirName = gSystem->DirName(filename);
TString baseName = gSystem->BaseName(filename);
TString currDir = gSystem->pwd();
gSystem->cd(dirName);
TString fullDir = gSystem->pwd();
gSystem->cd(currDir);
TString fullPath = fullDir.Data();
if ( ! fullDir.EndsWith("/") ) fullPath.Append("/");
fullPath += baseName;
return fullPath;
}
//_____________________________________________________________________________
TString GetBaseName ( TString filename )
{
TString baseName = gSystem->BaseName(filename);
Int_t idx = baseName.Index("#");
if ( idx > 0 ) baseName.Remove(0,idx+1);
return baseName;
}
//_____________________________________________________________________________
void CopyDir(TDirectory *source) {
//copy all objects and subdirs of directory source as a subdir of the current directory
TDirectory *savdir = gDirectory;
TDirectory *adir = savdir->mkdir(source->GetName());
adir->cd();
//loop on all entries of this directory
TKey *key;
TIter nextkey(source->GetListOfKeys());
while ((key = (TKey*)nextkey())) {
const char *classname = key->GetClassName();
TClass *cl = gROOT->GetClass(classname);
if (!cl) continue;
if (cl->InheritsFrom(TDirectory::Class())) {
source->cd(key->GetName());
TDirectory *subdir = gDirectory;
adir->cd();
CopyDir(subdir);
adir->cd();
} else if (cl->InheritsFrom(TTree::Class())) {
TTree *T = (TTree*)source->Get(key->GetName());
adir->cd();
TTree *newT = T->CloneTree(-1,"fast");
newT->Write();
} else {
source->cd();
TObject *obj = key->ReadObj();
adir->cd();
obj->Write(obj->GetName(),TObject::kSingleKey);
delete obj;
}
}
adir->SaveSelf(kTRUE);
savdir->cd();
}
//_____________________________________________________________________________
Bool_t GetQAInfo ( const char* qaFileName, TString dirNames = "MUON_QA MTR_ChamberEffMap MUON.TrigEfficiencyMap MUON.TriggerEfficiencyMap" )
{
LoadLibs();
TString outFilename = GetBaseName(qaFileName);
TString inFullPath = GetFullPath(qaFileName);
TString outFullPath = GetFullPath(outFilename);
if ( inFullPath == outFullPath ) {
printf("Warning: input and output are same file!\n");
return kFALSE;
}
if ( inFullPath.BeginsWith("alien") && ! gGrid ) TGrid::Connect("alien://");
TObjArray* dirList = dirNames.Tokenize(" ");
TFile* outFile = TFile::Open(outFilename,"RECREATE");
TFile* inFile = TFile::Open(qaFileName);
for ( Int_t idir=0; idir<dirList->GetEntries(); idir++ ) {
inFile->cd();
TObject* obj = inFile->Get(dirList->At(idir)->GetName());
if ( ! obj ) continue;
outFile->cd();
CopyDir(static_cast<TDirectory*>(obj));
}
delete outFile;
delete inFile;
delete dirList;
return kTRUE;
}
//_____________________________________________________________________________
Bool_t AddTreeVariable ( TList& parList, const char* varName, char varType, Float_t val )
{
if ( varType == 'D' ) varType = 'F';
TString parName = Form("%s/%c",varName,varType);
if ( varType == 'F' ) {
parList.Add(new TParameter<float>(parName,val));
}
else if ( varType == 'I' ) {
parList.Add(new TParameter<int>(parName,(Int_t)val));
}
else {
printf("Error: variable type %c not accepted", varType);
return kFALSE;
}
return kTRUE;
}
//_____________________________________________________________________________
void FillTree ( TTree* tree, TList &parList )
{
Int_t nVars = parList.GetEntries();
TArrayI varInt(nVars);
TArrayF varFloat(nVars);
for ( Int_t ivar=0; ivar<nVars; ivar++ ) {
TObject* obj = parList.At(ivar);
TString varName = obj->GetName();
TString branchName = varName;
branchName.Remove(varName.Length()-2);
if ( varName.EndsWith("F") ) {
varFloat[ivar] = ((TParameter<float>*)obj)->GetVal();
tree->Branch(branchName.Data(),&varFloat[ivar],varName.Data());
}
else if ( varName.EndsWith("I") ) {
varInt[ivar] = (Int_t)((TParameter<int>*)obj)->GetVal();
tree->Branch(branchName.Data(),&varInt[ivar],varName.Data());
}
}
tree->Fill();
}
//_____________________________________________________________________________
void AddTrigVars ( TString filename, TList &parList )
{
TString trigOutName = "trigChEff_ANY_Apt_allTrig.root";
if ( gSystem->AccessPathName(trigOutName.Data()) ) trigOutName = filename;
TFile* file = TFile::Open(filename.Data());
TList* inList = (TList*)file->FindObjectAny("triggerChamberEff");
TString hChNames[] = {"bendPlaneCountChamber","nonBendPlaneCountChamber","allTracksCountChamber"};
Int_t nHistos = sizeof(hChNames)/sizeof(hChNames[0]);
for ( Int_t ihisto=0; ihisto<nHistos; ihisto++ ) {
TH1* histo = (TH1*)inList->FindObject(hChNames[ihisto].Data());
for ( Int_t ibin=1; ibin<=4; ibin++ ) {
Double_t currVal = ( histo ) ? histo->GetBinContent(ibin) : 0.;
AddTreeVariable(parList, Form("%s%i",hChNames[ihisto].Data(),ibin),'F',currVal);
}
}
delete file;
}
//_____________________________________________________________________________
void MakeTrend ( const char* qaFile, Int_t runNumber, UInt_t force = trigQA, UInt_t mask = (trackQA|trigQA) )
{
Bool_t isOk = GetQAInfo(qaFile);
if ( ! isOk ) return;
TString inFilename = GetBaseName(qaFile);
terminateQA(inFilename,force,mask);
TList parList;
parList.SetOwner();
AddTreeVariable(parList, "run", 'I', runNumber);
// function for trigger
AddTrigVars(inFilename.Data(),parList);
TFile* outFile = TFile::Open("trending.root","RECREATE");
TTree* tree = new TTree("trending","trending");
FillTree(tree, parList);
tree->Write();
delete outFile;
}
<|endoftext|>
|
<commit_before>/**************************************************************************
* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
* *
* Author: The ALICE Off-line Project. *
* Contributors are mentioned in the code where appropriate. *
* *
* Permission to use, copy, modify and distribute this software and its *
* documentation strictly for non-commercial purposes is hereby granted *
* without fee, provided that the above copyright notice appears in all *
* copies and that both the copyright notice and this permission notice *
* appear in the supporting documentation. The authors make no claims *
* about the suitability of this software for any purpose. It is *
* provided "as is" without express or implied warranty. *
**************************************************************************/
//------------------------------------------------------------------------------
// Impementation of AliMCInfoCuts class. It keeps selection cuts for MC tracks.
//
//
// Author: J.Otwinowski 04/02/2008
//------------------------------------------------------------------------------
#include <iostream>
#include <TArrayI.h>
#include <TList.h>
#include "AliLog.h"
#include "AliMCInfoCuts.h"
using namespace std;
ClassImp(AliMCInfoCuts)
//_____________________________________________________________________________
AliMCInfoCuts::AliMCInfoCuts() :
AliAnalysisCuts()
, fMinRowsWithDigits(0)
, fMaxR(0)
, fMaxVz(0)
, fMinTPCSignal(0)
, fMaxTPCSignal(0)
, fMinTrackLength(0)
, aTrackParticles(0)
{
// default constructor
}
//_____________________________________________________________________________
AliMCInfoCuts::AliMCInfoCuts(const Char_t* name,const Char_t *title) :
AliAnalysisCuts(name, title)
, fMinRowsWithDigits(0)
, fMaxR(0)
, fMaxVz(0)
, fMinTPCSignal(0)
, fMaxTPCSignal(0)
, fMinTrackLength(0)
, aTrackParticles(0)
{
// default constructor
// init data members with defaults
InitME();
}
//_____________________________________________________________________________
AliMCInfoCuts::AliMCInfoCuts(const AliMCInfoCuts& that) :
AliAnalysisCuts(that)
, fMinRowsWithDigits(that.fMinRowsWithDigits)
, fMaxR(that.fMaxR)
, fMaxVz(that.fMaxVz)
, fMinTPCSignal(that.fMinTPCSignal)
, fMaxTPCSignal(that.fMaxTPCSignal)
, fMinTrackLength(that.fMinTrackLength)
, aTrackParticles(new TArrayI(kNParticles))
{
*aTrackParticles = *that.aTrackParticles;
}
//_____________________________________________________________________________
AliMCInfoCuts& AliMCInfoCuts::operator=(const AliMCInfoCuts& that)
{
fMinRowsWithDigits = that.fMinRowsWithDigits;
fMaxR = that.fMaxR;
fMaxVz = that.fMaxVz;
fMinTPCSignal = that.fMinTPCSignal;
fMaxTPCSignal = that.fMaxTPCSignal;
fMinTrackLength = that.fMinTrackLength;
if (!aTrackParticles) aTrackParticles = new TArrayI(1);
aTrackParticles = that.aTrackParticles;
return *this;
}
//_____________________________________________________________________________
AliMCInfoCuts::~AliMCInfoCuts()
{
// destructor
delete aTrackParticles;
}
//_____________________________________________________________________________
void AliMCInfoCuts::InitME()
{
// set default values
SetMinRowsWithDigits();
SetMaxR();
SetMaxVz();
SetRangeTPCSignal();
SetMinTrackLength();
// create aTrackParticles array
aTrackParticles = new TArrayI(kNParticles); // max nb. of particles
aTrackParticles->Reset(0);
// create an array of track particles: e, muons, pions, kaons, protons
if(aTrackParticles != 0)
{
// keep order adding a new particles
AddPdgParticle(0,ep); // e+
AddPdgParticle(1,em); // e-
AddPdgParticle(2,mup); // mu+
AddPdgParticle(3,mum); // mu-
AddPdgParticle(4,pip); // pi+
AddPdgParticle(5,pim); // pi-
AddPdgParticle(6,kp); // K+
AddPdgParticle(7,km); // K-
AddPdgParticle(8,prot); // p
AddPdgParticle(9,protbar); // p_bar
}
}
//_____________________________________________________________________________
void AliMCInfoCuts::AddPdgParticle(Int_t idx, Int_t pdgcode) const
{
// add particle to the array
if(aTrackParticles != 0) aTrackParticles->AddAt(pdgcode,idx);
else AliDebug(AliLog::kError, "ERROR: Cannot add particle to the array");
}
//_____________________________________________________________________________
Bool_t AliMCInfoCuts::IsPdgParticle(Int_t pdgcode) const
{
// check PDG particle
if(aTrackParticles == 0) {
AliDebug(AliLog::kError, "ERROR: Cannot get particle array");
return kFALSE;
}
Int_t size = aTrackParticles->GetSize();
for(int i=0; i<size; ++i) {
if(pdgcode == aTrackParticles->At(i)) return kTRUE;
}
return kFALSE;
}
//_____________________________________________________________________________
Bool_t AliMCInfoCuts::IsPosPdgParticle(Int_t pdgcode) const
{
// check PDG particle (only positive charged)
if(aTrackParticles == 0) {
AliDebug(AliLog::kError, "ERROR: Cannot get particle array");
return kFALSE;
}
Int_t size = aTrackParticles->GetSize();
for(int i=0; i<size; ++i) {
// leptons have oposite pdg convension from hadrons (e+/e- = -11/11)
if(pdgcode > 0 && (pdgcode == 11 || pdgcode == 13)) return kFALSE;
if(pdgcode < 0 && (pdgcode != -11 || pdgcode != -13) ) return kFALSE;
//
if(pdgcode == aTrackParticles->At(i)) return kTRUE;
}
return kFALSE;
}
//_____________________________________________________________________________
Long64_t AliMCInfoCuts::Merge(TCollection* list)
{
// Merge list of objects (needed by PROOF)
if (!list)
return 0;
if (list->IsEmpty())
return 1;
TIterator* iter = list->MakeIterator();
TObject* obj = 0;
Int_t count=0;
while((obj = iter->Next()) != 0)
{
AliMCInfoCuts* entry = dynamic_cast<AliMCInfoCuts*>(obj);
if (entry == 0)
continue;
count++;
}
return count;
}
<commit_msg>Fix braindead mistakes<commit_after>/**************************************************************************
* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
* *
* Author: The ALICE Off-line Project. *
* Contributors are mentioned in the code where appropriate. *
* *
* Permission to use, copy, modify and distribute this software and its *
* documentation strictly for non-commercial purposes is hereby granted *
* without fee, provided that the above copyright notice appears in all *
* copies and that both the copyright notice and this permission notice *
* appear in the supporting documentation. The authors make no claims *
* about the suitability of this software for any purpose. It is *
* provided "as is" without express or implied warranty. *
**************************************************************************/
//------------------------------------------------------------------------------
// Impementation of AliMCInfoCuts class. It keeps selection cuts for MC tracks.
//
//
// Author: J.Otwinowski 04/02/2008
//------------------------------------------------------------------------------
#include <iostream>
#include <TArrayI.h>
#include <TList.h>
#include "AliLog.h"
#include "AliMCInfoCuts.h"
using namespace std;
ClassImp(AliMCInfoCuts)
//_____________________________________________________________________________
AliMCInfoCuts::AliMCInfoCuts() :
AliAnalysisCuts()
, fMinRowsWithDigits(0)
, fMaxR(0)
, fMaxVz(0)
, fMinTPCSignal(0)
, fMaxTPCSignal(0)
, fMinTrackLength(0)
, aTrackParticles(0)
{
// default constructor
}
//_____________________________________________________________________________
AliMCInfoCuts::AliMCInfoCuts(const Char_t* name,const Char_t *title) :
AliAnalysisCuts(name, title)
, fMinRowsWithDigits(0)
, fMaxR(0)
, fMaxVz(0)
, fMinTPCSignal(0)
, fMaxTPCSignal(0)
, fMinTrackLength(0)
, aTrackParticles(0)
{
// default constructor
// init data members with defaults
InitME();
}
//_____________________________________________________________________________
AliMCInfoCuts::AliMCInfoCuts(const AliMCInfoCuts& that) :
AliAnalysisCuts(that)
, fMinRowsWithDigits(that.fMinRowsWithDigits)
, fMaxR(that.fMaxR)
, fMaxVz(that.fMaxVz)
, fMinTPCSignal(that.fMinTPCSignal)
, fMaxTPCSignal(that.fMaxTPCSignal)
, fMinTrackLength(that.fMinTrackLength)
, aTrackParticles(new TArrayI(*that.aTrackParticles))
{
}
//_____________________________________________________________________________
AliMCInfoCuts& AliMCInfoCuts::operator=(const AliMCInfoCuts& that)
{
fMinRowsWithDigits = that.fMinRowsWithDigits;
fMaxR = that.fMaxR;
fMaxVz = that.fMaxVz;
fMinTPCSignal = that.fMinTPCSignal;
fMaxTPCSignal = that.fMaxTPCSignal;
fMinTrackLength = that.fMinTrackLength;
if (!aTrackParticles)
aTrackParticles = new TArrayI(*that.aTrackParticles);
else
*aTrackParticles = *that.aTrackParticles;
return *this;
}
//_____________________________________________________________________________
AliMCInfoCuts::~AliMCInfoCuts()
{
// destructor
delete aTrackParticles;
}
//_____________________________________________________________________________
void AliMCInfoCuts::InitME()
{
// set default values
SetMinRowsWithDigits();
SetMaxR();
SetMaxVz();
SetRangeTPCSignal();
SetMinTrackLength();
// create aTrackParticles array
aTrackParticles = new TArrayI(kNParticles); // max nb. of particles
aTrackParticles->Reset(0);
// create an array of track particles: e, muons, pions, kaons, protons
if(aTrackParticles != 0)
{
// keep order adding a new particles
AddPdgParticle(0,ep); // e+
AddPdgParticle(1,em); // e-
AddPdgParticle(2,mup); // mu+
AddPdgParticle(3,mum); // mu-
AddPdgParticle(4,pip); // pi+
AddPdgParticle(5,pim); // pi-
AddPdgParticle(6,kp); // K+
AddPdgParticle(7,km); // K-
AddPdgParticle(8,prot); // p
AddPdgParticle(9,protbar); // p_bar
}
}
//_____________________________________________________________________________
void AliMCInfoCuts::AddPdgParticle(Int_t idx, Int_t pdgcode) const
{
// add particle to the array
if(aTrackParticles != 0) aTrackParticles->AddAt(pdgcode,idx);
else AliDebug(AliLog::kError, "ERROR: Cannot add particle to the array");
}
//_____________________________________________________________________________
Bool_t AliMCInfoCuts::IsPdgParticle(Int_t pdgcode) const
{
// check PDG particle
if(aTrackParticles == 0) {
AliDebug(AliLog::kError, "ERROR: Cannot get particle array");
return kFALSE;
}
Int_t size = aTrackParticles->GetSize();
for(int i=0; i<size; ++i) {
if(pdgcode == aTrackParticles->At(i)) return kTRUE;
}
return kFALSE;
}
//_____________________________________________________________________________
Bool_t AliMCInfoCuts::IsPosPdgParticle(Int_t pdgcode) const
{
// check PDG particle (only positive charged)
if(aTrackParticles == 0) {
AliDebug(AliLog::kError, "ERROR: Cannot get particle array");
return kFALSE;
}
Int_t size = aTrackParticles->GetSize();
for(int i=0; i<size; ++i) {
// leptons have oposite pdg convension from hadrons (e+/e- = -11/11)
if(pdgcode > 0 && (pdgcode == 11 || pdgcode == 13)) return kFALSE;
if(pdgcode < 0 && (pdgcode != -11 || pdgcode != -13) ) return kFALSE;
//
if(pdgcode == aTrackParticles->At(i)) return kTRUE;
}
return kFALSE;
}
//_____________________________________________________________________________
Long64_t AliMCInfoCuts::Merge(TCollection* list)
{
// Merge list of objects (needed by PROOF)
if (!list)
return 0;
if (list->IsEmpty())
return 1;
TIterator* iter = list->MakeIterator();
TObject* obj = 0;
Int_t count=0;
while((obj = iter->Next()) != 0)
{
AliMCInfoCuts* entry = dynamic_cast<AliMCInfoCuts*>(obj);
if (entry == 0)
continue;
count++;
}
return count;
}
<|endoftext|>
|
<commit_before>/**************************************************************************
* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
* *
* Author: The ALICE Off-line Project. *
* Contributors are mentioned in the code where appropriate. *
* *
* Permission to use, copy, modify and distribute this software and its *
* documentation strictly for non-commercial purposes is hereby granted *
* without fee, provided that the above copyright notice appears in all *
* copies and that both the copyright notice and this permission notice *
* appear in the supporting documentation. The authors make no claims *
* about the suitability of this software for any purpose. It is *
* provided "as is" without express or implied warranty. *
**************************************************************************/
/* $Id$*/
// Trigger preprocessor class.
// According to the TriggerDetectorMask read from the logbook_trigger_clusters
// DAQ table, the triggering detectors are identified, and the
// corresponding procedure is called.
// Data are stored in the OCDB, in /TRIGGER/<DET>/<level3>, where
// <DET> correspond to the triggering detector,
// and <level3> is defined in the detector procedure
#include "AliTRIPreprocessor.h"
#include "AliCDBMetaData.h"
#include "AliCDBEntry.h"
#include "AliLog.h"
#include "AliITSTriggerConditions.h"
#include <TTimeStamp.h>
#include <TObjString.h>
#include <TList.h>
#include <TROOT.h>
#include <TSystem.h>
ClassImp(AliTRIPreprocessor)
// names of detectors/systems in the DETECTORS_MAP in /date/db/detCodes.h
const char* AliTRIPreprocessor::fgkDetectorsMapName[AliTRIPreprocessor::kNDetectorsMap] = {"SPD"/*0*/, "SDD"/*1*/, "SSD"/*2*/, "TPC"/*3*/, "TRD"/*4*/,
"TOF"/*5*/, "HMP"/*6*/, "PHS"/*7*/, "CPV"/*8*/, "PMD"/*9*/,
"MCH"/*10*/,"MTR"/*11*/,"FMD"/*12*/,"T00"/*13*/,"V00"/*14*/,
"ZDC"/*15*/,"ACO"/*16*/,"TRI"/*17*/,"EMC"/*18*/,"TST"/*19*/,
""/*20*/, ""/*21*/, ""/*22*/, ""/*23*/, ""/*24*/,
""/*25*/, ""/*26*/, ""/*27*/, ""/*28*/, "GRP"/*29*/,
"HLT"/*30*/};
//______________________________________________________________________________________________
AliTRIPreprocessor::AliTRIPreprocessor(AliShuttleInterface* shuttle) :
AliPreprocessor("TRI", shuttle),
fShuttle(shuttle)
{
//
// constructor
//
AddRunType("PHYSICS");
}
//______________________________________________________________________________________________
AliTRIPreprocessor::~AliTRIPreprocessor()
{
//
// destructor
//
}
//______________________________________________________________________________________________
void AliTRIPreprocessor::Initialize(Int_t run, UInt_t startTime,
UInt_t endTime)
{
//
// Initialize preprocessor
//
AliPreprocessor::Initialize(run, startTime, endTime);
Log(Form("\n\tRun %d \n\tStartTime %s \n\tEndTime %s", run,
TTimeStamp(startTime).AsString(),
TTimeStamp(endTime).AsString()));
}
//______________________________________________________________________________________________
Bool_t AliTRIPreprocessor::ProcessDCS()
{
//
// DCS data are never needed
//
return kFALSE;
}
//______________________________________________________________________________________________
UInt_t AliTRIPreprocessor::Process(TMap* /*dcsAliasMap*/)
{
// Procees function:
// After reading the TriggerDetectorMask, the
// corresponding triggering detector procedures to
// process the trigger data are called.
typedef Short_t (AliTRIPreprocessor::*AliProcessTriggerData)();
const AliProcessTriggerData processTriggerDataArray[AliTRIPreprocessor::kNDetectorsMap]= {
&AliTRIPreprocessor::ProcessSPDTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData};
// getting the list of triggering detectors from DAQ logbook
TString triggerDetectorMask = (TString)GetTriggerDetectorMask();
Int_t result=0;
if (!triggerDetectorMask.IsNull()){
Int_t length = triggerDetectorMask.Length();
Log(Form("mask = %s", triggerDetectorMask.Data()));
for (Int_t i = 0; i<length; i++){
AliDebug(2,Form("%d-th bit = %c in index %d",i,triggerDetectorMask[length-1-i],length-1-i));
if (triggerDetectorMask[length-1-i] == '1'){
Log("****************************************");
Log(Form("Processing Trigger data for %s",fgkDetectorsMapName[i]));
Log("****************************************");
result+=(this->*processTriggerDataArray[i])();
}
}
}
// result should be 0 to end successfully
return result;
}
//______________________________________________________________________________________________
Short_t AliTRIPreprocessor::ProcessSPDTriggerData()
{
//
// Processing SPD Trigger Data
//
Log("************** Processing SPD Trigger data... **************");
// Read new conditions from dcs fxs
AliITSTriggerConditions* newCond = new AliITSTriggerConditions();
TString fxsID = "pit_conditions";
TList* list = GetFileSources(kDCS, fxsID.Data());
if (!list) {
AliError("FXS file not found.");
return 1;
}
UInt_t nFiles = 0;
while (list->At(nFiles)!=NULL) {
TObjString* fileNameEntry = (TObjString*) list->At(nFiles);
TString fileName = GetFile(kDCS, fxsID.Data(), fileNameEntry->GetString().Data());
if (fileName.IsNull()) {
Log(Form("GetFile failed to retrieve file %s.",fileNameEntry->GetString().Data()));
return 1;
}
if (nFiles==0) newCond->ReadFromTextFile(fileName.Data());
nFiles++;
}
if (nFiles!=1) {
AliWarning(Form("Found %d files with id %s (expected exactly 1).",nFiles,fxsID.Data()));
}
// Read old conditions from ocdb
AliITSTriggerConditions* oldCond = NULL;
AliCDBEntry* pitCond = GetFromOCDB("SPD", "PITConditions");
if (pitCond) {
oldCond = (AliITSTriggerConditions*) pitCond->GetObject();
if (!oldCond) {
AliError("AliCDBEntry::GetObject() returned NULL.");
return 1;
}
}
else {
Log("Old conditions not found in database.");
}
// Do we need to update db?
Bool_t doUpdate = kTRUE;
if (oldCond) {
// compare to see if there were any changes...
if (newCond->IsEqualTo(oldCond)) {
Log("Old conditions equal to new conditions. Do nothing.");
doUpdate = kFALSE;
}
}
if (doUpdate) {
// store new conditions in ocdb
AliCDBMetaData metaData;
metaData.SetResponsible("Henrik Tydesjo");
metaData.SetComment("Created by Trigger PreProcessor");
if (!Store("SPD", "PITConditions", newCond, &metaData, 0, kTRUE)) {
Log("Failed to store conditions data.");
return 1;
}
Log("Database updated.");
}
delete newCond;
Log("************************* ...done.*************************");
return 0; // 0 means success
}
//______________________________________________________________________________________________
Short_t AliTRIPreprocessor::ProcessTOFTriggerData()
{
//
// Processing TOF Trigger Data
//
Log("************** Processing TOF Trigger data... **************");
Log("************** Fake function **************");
Log("************************* ...done.*************************");
return 0;
}
//______________________________________________________________________________________________
Short_t AliTRIPreprocessor::ProcessEmptyTriggerData()
{
//
// Processing TOF Trigger Data
//
Log("************** Trigger data Processing not yet implemented **************");
return 0;
}
<commit_msg>Updating Run Types for TRIGGER pp.<commit_after>/**************************************************************************
* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
* *
* Author: The ALICE Off-line Project. *
* Contributors are mentioned in the code where appropriate. *
* *
* Permission to use, copy, modify and distribute this software and its *
* documentation strictly for non-commercial purposes is hereby granted *
* without fee, provided that the above copyright notice appears in all *
* copies and that both the copyright notice and this permission notice *
* appear in the supporting documentation. The authors make no claims *
* about the suitability of this software for any purpose. It is *
* provided "as is" without express or implied warranty. *
**************************************************************************/
/* $Id$*/
// Trigger preprocessor class.
// According to the TriggerDetectorMask read from the logbook_trigger_clusters
// DAQ table, the triggering detectors are identified, and the
// corresponding procedure is called.
// Data are stored in the OCDB, in /TRIGGER/<DET>/<level3>, where
// <DET> correspond to the triggering detector,
// and <level3> is defined in the detector procedure
#include "AliTRIPreprocessor.h"
#include "AliCDBMetaData.h"
#include "AliCDBEntry.h"
#include "AliLog.h"
#include "AliITSTriggerConditions.h"
#include <TTimeStamp.h>
#include <TObjString.h>
#include <TList.h>
#include <TROOT.h>
#include <TSystem.h>
ClassImp(AliTRIPreprocessor)
// names of detectors/systems in the DETECTORS_MAP in /date/db/detCodes.h
const char* AliTRIPreprocessor::fgkDetectorsMapName[AliTRIPreprocessor::kNDetectorsMap] = {"SPD"/*0*/, "SDD"/*1*/, "SSD"/*2*/, "TPC"/*3*/, "TRD"/*4*/,
"TOF"/*5*/, "HMP"/*6*/, "PHS"/*7*/, "CPV"/*8*/, "PMD"/*9*/,
"MCH"/*10*/,"MTR"/*11*/,"FMD"/*12*/,"T00"/*13*/,"V00"/*14*/,
"ZDC"/*15*/,"ACO"/*16*/,"TRI"/*17*/,"EMC"/*18*/,"TST"/*19*/,
""/*20*/, ""/*21*/, ""/*22*/, ""/*23*/, ""/*24*/,
""/*25*/, ""/*26*/, ""/*27*/, ""/*28*/, "GRP"/*29*/,
"HLT"/*30*/};
//______________________________________________________________________________________________
AliTRIPreprocessor::AliTRIPreprocessor(AliShuttleInterface* shuttle) :
AliPreprocessor("TRI", shuttle),
fShuttle(shuttle)
{
//
// constructor
//
AddRunType("PHYSICS");
AddRunType("STANDALONE_PULSER");
}
//______________________________________________________________________________________________
AliTRIPreprocessor::~AliTRIPreprocessor()
{
//
// destructor
//
}
//______________________________________________________________________________________________
void AliTRIPreprocessor::Initialize(Int_t run, UInt_t startTime,
UInt_t endTime)
{
//
// Initialize preprocessor
//
AliPreprocessor::Initialize(run, startTime, endTime);
Log(Form("\n\tRun %d \n\tStartTime %s \n\tEndTime %s", run,
TTimeStamp(startTime).AsString(),
TTimeStamp(endTime).AsString()));
}
//______________________________________________________________________________________________
Bool_t AliTRIPreprocessor::ProcessDCS()
{
//
// DCS data are never needed
//
return kFALSE;
}
//______________________________________________________________________________________________
UInt_t AliTRIPreprocessor::Process(TMap* /*dcsAliasMap*/)
{
// Procees function:
// After reading the TriggerDetectorMask, the
// corresponding triggering detector procedures to
// process the trigger data are called.
typedef Short_t (AliTRIPreprocessor::*AliProcessTriggerData)();
const AliProcessTriggerData processTriggerDataArray[AliTRIPreprocessor::kNDetectorsMap]= {
&AliTRIPreprocessor::ProcessSPDTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData,
&AliTRIPreprocessor::ProcessEmptyTriggerData};
// getting the list of triggering detectors from DAQ logbook
TString triggerDetectorMask = (TString)GetTriggerDetectorMask();
Int_t result=0;
if (!triggerDetectorMask.IsNull()){
Int_t length = triggerDetectorMask.Length();
Log(Form("mask = %s", triggerDetectorMask.Data()));
for (Int_t i = 0; i<length; i++){
AliDebug(2,Form("%d-th bit = %c in index %d",i,triggerDetectorMask[length-1-i],length-1-i));
if (triggerDetectorMask[length-1-i] == '1'){
Log("****************************************");
Log(Form("Processing Trigger data for %s",fgkDetectorsMapName[i]));
Log("****************************************");
result+=(this->*processTriggerDataArray[i])();
}
}
}
// result should be 0 to end successfully
return result;
}
//______________________________________________________________________________________________
Short_t AliTRIPreprocessor::ProcessSPDTriggerData()
{
//
// Processing SPD Trigger Data
//
Log("************** Processing SPD Trigger data... **************");
// Read new conditions from dcs fxs
AliITSTriggerConditions* newCond = new AliITSTriggerConditions();
TString fxsID = "pit_conditions";
TList* list = GetFileSources(kDCS, fxsID.Data());
if (!list) {
AliError("FXS file not found.");
return 1;
}
UInt_t nFiles = 0;
while (list->At(nFiles)!=NULL) {
TObjString* fileNameEntry = (TObjString*) list->At(nFiles);
TString fileName = GetFile(kDCS, fxsID.Data(), fileNameEntry->GetString().Data());
if (fileName.IsNull()) {
Log(Form("GetFile failed to retrieve file %s.",fileNameEntry->GetString().Data()));
return 1;
}
if (nFiles==0) newCond->ReadFromTextFile(fileName.Data());
nFiles++;
}
if (nFiles!=1) {
AliWarning(Form("Found %d files with id %s (expected exactly 1).",nFiles,fxsID.Data()));
}
// Read old conditions from ocdb
AliITSTriggerConditions* oldCond = NULL;
AliCDBEntry* pitCond = GetFromOCDB("SPD", "PITConditions");
if (pitCond) {
oldCond = (AliITSTriggerConditions*) pitCond->GetObject();
if (!oldCond) {
AliError("AliCDBEntry::GetObject() returned NULL.");
return 1;
}
}
else {
Log("Old conditions not found in database.");
}
// Do we need to update db?
Bool_t doUpdate = kTRUE;
if (oldCond) {
// compare to see if there were any changes...
if (newCond->IsEqualTo(oldCond)) {
Log("Old conditions equal to new conditions. Do nothing.");
doUpdate = kFALSE;
}
}
if (doUpdate) {
// store new conditions in ocdb
AliCDBMetaData metaData;
metaData.SetResponsible("Henrik Tydesjo");
metaData.SetComment("Created by Trigger PreProcessor");
if (!Store("SPD", "PITConditions", newCond, &metaData, 0, kTRUE)) {
Log("Failed to store conditions data.");
return 1;
}
Log("Database updated.");
}
delete newCond;
Log("************************* ...done.*************************");
return 0; // 0 means success
}
//______________________________________________________________________________________________
Short_t AliTRIPreprocessor::ProcessTOFTriggerData()
{
//
// Processing TOF Trigger Data
//
Log("************** Processing TOF Trigger data... **************");
Log("************** Fake function **************");
Log("************************* ...done.*************************");
return 0;
}
//______________________________________________________________________________________________
Short_t AliTRIPreprocessor::ProcessEmptyTriggerData()
{
//
// Processing TOF Trigger Data
//
Log("************** Trigger data Processing not yet implemented **************");
return 0;
}
<|endoftext|>
|
<commit_before>// Copyright (c) 2008-2010 Kent State University
// Copyright (c) 2011 Texas A&M University
//
// This file is distributed under the MIT License. See the accompanying file
// LICENSE.txt or http://www.opensource.org/licenses/mit-license.php for terms
// and conditions.
#ifndef ORIGIN_MATH_BLAS_MATRIX_ALLOC_BASE_HPP
#define ORIGIN_MATH_BLAS_MATRIX_ALLOC_BASE_HPP
#include <cassert>
#include <memory>
#include <algorithm>
namespace origin { namespace blas { namespace detail {
/** The basic matrix base class used for handling
* memory allocations.
*/
template<typename T, typename Alloc>
class matrix_alloc_base {
public:
typedef typename Alloc::template rebind<T>::other rebound_alloc_type;
typedef typename std::allocator_traits<rebound_alloc_type>::allocator_type allocator_type;
typedef typename std::allocator_traits<rebound_alloc_type>::value_type value_type;
typedef typename std::allocator_traits<rebound_alloc_type>::pointer pointer;
typedef typename std::allocator_traits<rebound_alloc_type>::reference reference;
typedef typename std::allocator_traits<rebound_alloc_type>::const_pointer const_pointer;
typedef typename std::allocator_traits<rebound_alloc_type>::const_reference const_reference;
typedef typename std::allocator_traits<rebound_alloc_type>::difference_type difference_type;
typedef typename std::allocator_traits<rebound_alloc_type>::size_type size_type;
};
}}} // end origin::blas::detail
#endif<commit_msg>Looking for concept/typetrait that allows me to verify allocator alignment for reuse.<commit_after>// Copyright (c) 2008-2010 Kent State University
// Copyright (c) 2011 Texas A&M University
//
// This file is distributed under the MIT License. See the accompanying file
// LICENSE.txt or http://www.opensource.org/licenses/mit-license.php for terms
// and conditions.
#ifndef ORIGIN_MATH_BLAS_MATRIX_ALLOC_BASE_HPP
#define ORIGIN_MATH_BLAS_MATRIX_ALLOC_BASE_HPP
#include <cassert>
#include <memory>
#include <algorithm>
namespace origin { namespace blas { namespace detail {
/** The basic matrix base class used for handling
* memory allocations.
*/
template<typename T, typename Alloc>
class matrix_alloc_base {
public:
typedef typename Alloc::template rebind<T>::other rebound_alloc_type;
typedef typename std::allocator_traits<rebound_alloc_type>::allocator_type allocator_type;
typedef typename std::allocator_traits<rebound_alloc_type>::value_type value_type;
typedef typename std::allocator_traits<rebound_alloc_type>::pointer pointer;
typedef typename std::allocator_traits<rebound_alloc_type>::reference reference;
typedef typename std::allocator_traits<rebound_alloc_type>::const_pointer const_pointer;
typedef typename std::allocator_traits<rebound_alloc_type>::const_reference const_reference;
typedef typename std::allocator_traits<rebound_alloc_type>::difference_type difference_type;
typedef typename std::allocator_traits<rebound_alloc_type>::size_type size_type;
private:
struct matrix_alloc_impl_base {
};
};
}}} // end origin::blas::detail
#endif<|endoftext|>
|
<commit_before>#include "PC.h"
PC::PC()
{
}
PC::~PC()
{
}
<commit_msg>켜기 만듬<commit_after>#include "PC.h"
PC::PC()
{
}
PC::~PC()
{
}
bool PC::TurnOnComputer() {
is_power_on = true;
return true;
}<|endoftext|>
|
<commit_before>//
// Options.cpp
//
// Copyright (c) 2001-2004 Virtual Terrain Project
// Free for all uses, see license.txt for details.
//
#include "vtlib/vtlib.h"
#include <string.h>
#include "Options.h"
#include <fstream>
using namespace std;
EnviroOptions g_Options;
#define STR_DATAPATH "DataPath"
#define STR_EARTHVIEW "EarthView"
#define STR_EARTHIMAGE "EarthImage"
#define STR_INITTERRAIN "InitialTerrain"
#define STR_FULLSCREEN "FullScreen"
#define STR_HTMLPANE "HTMLPane"
#define STR_FLOATBAR "FloatingToolBar"
#define STR_TEXTURE_COMPRESSION "TextureCompression"
#define STR_SPEEDTEST "SpeedTest"
#define STR_PLANTSIZE "PlantSize"
#define STR_PLANTSHADOWS "PlantShadows"
#define STR_SELECTIONCUTOFF "SelectionCutoff"
#define STR_DISABLE_MODEL_MIPMAPS "DisableModelMipmaps"
#define STR_CURSOR_THICKNESS "CursorThickness"
EnviroOptions::EnviroOptions()
{
m_strImage = "ev11656_512";
m_fSelectionCutoff = 15.0f;
m_bStartInNeutral = false;
m_bDisableModelMipmaps = false;
m_bTextureCompression = true;
m_fCursorThickness = 0.025;
}
EnviroOptions::~EnviroOptions()
{
}
bool EnviroOptions::Read(const char *szFilename)
{
m_strFilename = szFilename;
ifstream input(m_strFilename, ios::in | ios::binary);
if (!input.is_open())
return false;
char buf[80];
while (!input.eof())
{
if (input.peek() == '\n')
input.ignore();
input >> buf;
// data value should been separated by a tab or space
int next = input.peek();
if (next != '\t' && next != ' ')
continue;
while (input.peek() == '\t' || input.peek() == ' ')
input.ignore();
if (strcmp(buf, STR_DATAPATH) == 0)
{
m_DataPaths.push_back(vtString(get_line_from_stream(input)));
}
else if (strcmp(buf, STR_EARTHVIEW) == 0)
input >> m_bEarthView;
else if (strcmp(buf, STR_EARTHIMAGE) == 0)
m_strImage = get_line_from_stream(input);
else if (strcmp(buf, STR_INITTERRAIN) == 0)
m_strInitTerrain = get_line_from_stream(input);
else if (strcmp(buf, STR_FULLSCREEN) == 0)
input >> m_bFullscreen;
else if (strcmp(buf, STR_HTMLPANE) == 0)
input >> m_bHtmlpane;
else if (strcmp(buf, STR_FLOATBAR) == 0)
input >> m_bFloatingToolbar;
else if (strcmp(buf, STR_TEXTURE_COMPRESSION) == 0)
input >> m_bTextureCompression;
else if (strcmp(buf, STR_SPEEDTEST) == 0)
input >> m_bSpeedTest;
else if (strcmp(buf, STR_PLANTSIZE) == 0)
input >> m_fPlantScale;
else if (strcmp(buf, STR_PLANTSHADOWS) == 0)
input >> m_bShadows;
else if (strcmp(buf, STR_SELECTIONCUTOFF) == 0)
input >> m_fSelectionCutoff;
else if (strcmp(buf, STR_DISABLE_MODEL_MIPMAPS) == 0)
input >> m_bDisableModelMipmaps;
else if (strcmp(buf, STR_CURSOR_THICKNESS) == 0)
input >> m_fCursorThickness;
else
{
// cout << "Input from INI file unrecognized.\n";
get_line_from_stream(input);
}
}
return true;
}
bool EnviroOptions::Write()
{
ofstream output(m_strFilename, ios::binary);
if (!output.is_open())
{
vtString msg;
msg = "Couldn't write settings to file \"";
msg += m_strFilename;
msg += "\"\nPlease make sure it's writable.\n";
// AfxMessageBox(msg);
// MessageBox(NULL, msg, "Note", MB_OK);
VTLOG(msg);
return false;
}
// write to file
for (unsigned int i = 0; i < m_DataPaths.size(); i++)
{
output << STR_DATAPATH << "\t\t";
output << (const char *)(m_DataPaths[i]) << endl;
}
output << STR_EARTHVIEW << "\t\t";
output << m_bEarthView << endl;
output << STR_EARTHIMAGE << "\t\t";
output << (const char *)m_strImage << endl;
output << STR_INITTERRAIN << "\t";
output << (const char *)m_strInitTerrain << endl;
output << STR_FULLSCREEN << "\t\t";
output << m_bFullscreen << endl;
output << STR_HTMLPANE << "\t\t";
output << m_bHtmlpane << endl;
output << STR_FLOATBAR << "\t";
output << m_bFloatingToolbar << endl;
output << STR_TEXTURE_COMPRESSION << "\t";
output << m_bTextureCompression << endl;
output << STR_SPEEDTEST << "\t\t";
output << m_bSpeedTest << endl;
output << STR_PLANTSIZE << "\t\t";
output << m_fPlantScale << endl;
output << STR_PLANTSHADOWS << "\t";
output << m_bShadows << endl;
output << STR_SELECTIONCUTOFF << "\t";
output << m_fSelectionCutoff << endl;
output << STR_DISABLE_MODEL_MIPMAPS << "\t";
output << m_bDisableModelMipmaps << endl;
output << STR_CURSOR_THICKNESS << "\t";
output << m_fCursorThickness << endl;
return true;
}
<commit_msg>added vtLog.h<commit_after>//
// Options.cpp
//
// Copyright (c) 2001-2004 Virtual Terrain Project
// Free for all uses, see license.txt for details.
//
#include "vtlib/vtlib.h"
#include "vtdata/vtLog.h"
#include <string.h>
#include "Options.h"
#include <fstream>
using namespace std;
EnviroOptions g_Options;
#define STR_DATAPATH "DataPath"
#define STR_EARTHVIEW "EarthView"
#define STR_EARTHIMAGE "EarthImage"
#define STR_INITTERRAIN "InitialTerrain"
#define STR_FULLSCREEN "FullScreen"
#define STR_HTMLPANE "HTMLPane"
#define STR_FLOATBAR "FloatingToolBar"
#define STR_TEXTURE_COMPRESSION "TextureCompression"
#define STR_SPEEDTEST "SpeedTest"
#define STR_PLANTSIZE "PlantSize"
#define STR_PLANTSHADOWS "PlantShadows"
#define STR_SELECTIONCUTOFF "SelectionCutoff"
#define STR_DISABLE_MODEL_MIPMAPS "DisableModelMipmaps"
#define STR_CURSOR_THICKNESS "CursorThickness"
EnviroOptions::EnviroOptions()
{
m_strImage = "ev11656_512";
m_fSelectionCutoff = 15.0f;
m_bStartInNeutral = false;
m_bDisableModelMipmaps = false;
m_bTextureCompression = true;
m_fCursorThickness = 0.025;
}
EnviroOptions::~EnviroOptions()
{
}
bool EnviroOptions::Read(const char *szFilename)
{
m_strFilename = szFilename;
ifstream input(m_strFilename, ios::in | ios::binary);
if (!input.is_open())
return false;
char buf[80];
while (!input.eof())
{
if (input.peek() == '\n')
input.ignore();
input >> buf;
// data value should been separated by a tab or space
int next = input.peek();
if (next != '\t' && next != ' ')
continue;
while (input.peek() == '\t' || input.peek() == ' ')
input.ignore();
if (strcmp(buf, STR_DATAPATH) == 0)
{
m_DataPaths.push_back(vtString(get_line_from_stream(input)));
}
else if (strcmp(buf, STR_EARTHVIEW) == 0)
input >> m_bEarthView;
else if (strcmp(buf, STR_EARTHIMAGE) == 0)
m_strImage = get_line_from_stream(input);
else if (strcmp(buf, STR_INITTERRAIN) == 0)
m_strInitTerrain = get_line_from_stream(input);
else if (strcmp(buf, STR_FULLSCREEN) == 0)
input >> m_bFullscreen;
else if (strcmp(buf, STR_HTMLPANE) == 0)
input >> m_bHtmlpane;
else if (strcmp(buf, STR_FLOATBAR) == 0)
input >> m_bFloatingToolbar;
else if (strcmp(buf, STR_TEXTURE_COMPRESSION) == 0)
input >> m_bTextureCompression;
else if (strcmp(buf, STR_SPEEDTEST) == 0)
input >> m_bSpeedTest;
else if (strcmp(buf, STR_PLANTSIZE) == 0)
input >> m_fPlantScale;
else if (strcmp(buf, STR_PLANTSHADOWS) == 0)
input >> m_bShadows;
else if (strcmp(buf, STR_SELECTIONCUTOFF) == 0)
input >> m_fSelectionCutoff;
else if (strcmp(buf, STR_DISABLE_MODEL_MIPMAPS) == 0)
input >> m_bDisableModelMipmaps;
else if (strcmp(buf, STR_CURSOR_THICKNESS) == 0)
input >> m_fCursorThickness;
else
{
// cout << "Input from INI file unrecognized.\n";
get_line_from_stream(input);
}
}
return true;
}
bool EnviroOptions::Write()
{
ofstream output(m_strFilename, ios::binary);
if (!output.is_open())
{
vtString msg;
msg = "Couldn't write settings to file \"";
msg += m_strFilename;
msg += "\"\nPlease make sure it's writable.\n";
VTLOG(msg);
return false;
}
// write to file
for (unsigned int i = 0; i < m_DataPaths.size(); i++)
{
output << STR_DATAPATH << "\t\t";
output << (const char *)(m_DataPaths[i]) << endl;
}
output << STR_EARTHVIEW << "\t\t";
output << m_bEarthView << endl;
output << STR_EARTHIMAGE << "\t\t";
output << (const char *)m_strImage << endl;
output << STR_INITTERRAIN << "\t";
output << (const char *)m_strInitTerrain << endl;
output << STR_FULLSCREEN << "\t\t";
output << m_bFullscreen << endl;
output << STR_HTMLPANE << "\t\t";
output << m_bHtmlpane << endl;
output << STR_FLOATBAR << "\t";
output << m_bFloatingToolbar << endl;
output << STR_TEXTURE_COMPRESSION << "\t";
output << m_bTextureCompression << endl;
output << STR_SPEEDTEST << "\t\t";
output << m_bSpeedTest << endl;
output << STR_PLANTSIZE << "\t\t";
output << m_fPlantScale << endl;
output << STR_PLANTSHADOWS << "\t";
output << m_bShadows << endl;
output << STR_SELECTIONCUTOFF << "\t";
output << m_fSelectionCutoff << endl;
output << STR_DISABLE_MODEL_MIPMAPS << "\t";
output << m_bDisableModelMipmaps << endl;
output << STR_CURSOR_THICKNESS << "\t";
output << m_fCursorThickness << endl;
return true;
}
<|endoftext|>
|
<commit_before>#include "externalpotential.h"
#include "multipole.h"
#include "aux/eigensupport.h"
#include "functionparser.h"
#include "space.h"
#include "spdlog/spdlog.h"
namespace Faunus {
namespace Energy {
// ------------ Energybase -------------
void Energybase::to_json(json &) const {}
void Energybase::sync(Energybase *, Change &) {}
void Energybase::init() {}
void to_json(json &j, const Energybase &base) {
assert(not base.name.empty());
if (base.timer)
j[base.name]["relative time"] = base.timer.result();
if (not base.cite.empty())
j[base.name]["reference"] = base.cite;
base.to_json(j[base.name]);
}
// ------------ ExternalPotential -------------
// this calculates the interaction of a whole group
// with the applied external potential.
double ExternalPotential::_energy(const Group<Particle> &g) const {
double u = 0;
if (molids.find(g.id) != molids.end()) {
if (COM and g.atomic == false) { // apply only to center of mass
Particle cm; // temp. particle representing molecule
cm.charge = Faunus::monopoleMoment(g.begin(), g.end());
cm.pos = g.cm;
return func(cm);
} else {
for (auto &p : g) { // loop over active particles
u += func(p);
if (std::isnan(u))
break;
}
}
}
return u;
}
ExternalPotential::ExternalPotential(const json &j, Space &spc) : spc(spc) {
name = "external";
COM = j.value("com", false);
_names = j.at("molecules").get<decltype(_names)>(); // molecule names
auto _ids = names2ids(molecules, _names); // names --> molids
molids = std::set<int>(_ids.begin(), _ids.end()); // vector --> set
if (molids.empty())
throw std::runtime_error(name + ": molecule list is empty");
}
double ExternalPotential::energy(Change &change) {
assert(func != nullptr);
double u = 0;
if (change.dV or change.all or change.dN) {
for (auto &g : spc.groups) { // check all groups
u += _energy(g);
if (std::isnan(u))
break;
}
} else
for (auto &d : change.groups) {
auto &g = spc.groups.at(d.index); // check specified groups
if (d.all or COM) // check all atoms in group
u += _energy(g); // _energy also checks for molecule id
else { // check only specified atoms in group
if (molids.find(g.id) != molids.end())
for (auto i : d.atoms)
u += func(*(g.begin() + i));
}
if (std::isnan(u))
break;
}
return u;
}
void ExternalPotential::to_json(json &j) const {
j["molecules"] = _names;
j["com"] = COM;
}
// ------------ Confine -------------
Confine::Confine(const json &j, Tspace &spc) : ExternalPotential(j, spc) {
name = "confine";
k = value_inf(j, "k") * 1.0_kJmol; // get floating point; allow inf/-inf
type = m.at(j.at("type"));
if (type == sphere or type == cylinder) {
radius = j.at("radius");
origo = j.value("origo", origo);
scale = j.value("scale", scale);
if (type == cylinder)
dir = {1, 1, 0};
func = [&radius = radius, origo = origo, k = k, dir = dir](const Particle &p) {
double d2 = (origo - p.pos).cwiseProduct(dir).squaredNorm() - radius * radius;
if (d2 > 0)
return 0.5 * k * d2;
return 0.0;
};
// If volume is scaled, also scale the confining radius by adding a trigger
// to `Space::scaleVolume()`
if (scale)
spc.scaleVolumeTriggers.push_back(
[&radius = radius](Tspace &, double Vold, double Vnew) { radius *= std::cbrt(Vnew / Vold); });
}
if (type == cuboid) {
low = j.at("low").get<Point>();
high = j.at("high").get<Point>();
func = [low = low, high = high, k = k](const Particle &p) {
double u = 0;
Point d = low - p.pos;
for (int i = 0; i < 3; ++i)
if (d[i] > 0)
u += d[i] * d[i];
d = p.pos - high;
for (int i = 0; i < 3; ++i)
if (d[i] > 0)
u += d[i] * d[i];
return 0.5 * k * u;
};
}
}
void Confine::to_json(json &j) const {
if (type == cuboid)
j = {{"low", low}, {"high", high}};
if (type == sphere or type == cylinder)
j = {{"radius", radius}};
if (type == sphere) {
j["origo"] = origo;
j["scale"] = scale;
}
for (auto &i : m)
if (i.second == type)
j["type"] = i.first;
j["k"] = k / 1.0_kJmol;
ExternalPotential::to_json(j);
_roundjson(j, 5);
}
// ------------ ExternalAkesson -------------
ExternalAkesson::ExternalAkesson(const json &j, Tspace &spc) : ExternalPotential(j, spc) {
name = "akesson";
cite = "doi:10/dhb9mj";
SingleUseJSON _j = j; // json variant where items are deleted after access
_j.erase("com");
_j.erase("molecules");
nstep = _j.at("nstep").get<unsigned int>();
epsr = _j.at("epsr").get<double>();
fixed = _j.value("fixed", false);
nphi = _j.value("nphi", 10);
halfz = 0.5 * spc.geo.getLength().z();
lB = pc::lB(epsr);
dz = _j.value("dz", 0.2); // read z resolution
Q.setResolution(dz, -halfz, halfz);
rho.setResolution(dz, -halfz, halfz);
phi.setResolution(dz, -halfz, halfz);
filename = _j.value("file", "mfcorr.dat"s);
load();
func = [&phi = phi](const typename Tspace::Tparticle &p) { return p.charge * phi(p.pos.z()); };
if (not _j.empty()) // throw exception of unused/unknown keys are passed
throw std::runtime_error("unused key(s) for '"s + name + "':\n" + _j.dump());
}
double ExternalAkesson::energy(Change &change) {
if (not fixed) // pho(z) unconverged, keep sampling
if (key == Energybase::OLD) { // only sample on accepted configs
cnt++;
if (cnt % nstep == 0)
update_rho();
if (cnt % nstep * nphi == 0)
update_phi();
}
return ExternalPotential::energy(change);
}
ExternalAkesson::~ExternalAkesson() {
// save only if still updating and if energy type is "OLD",
// that is, accepted configurations (not trial)
if (not fixed and key == Energybase::OLD)
save();
}
void ExternalAkesson::to_json(json &j) const {
j = {{"lB", lB}, {"dz", dz}, {"nphi", nphi}, {"epsr", epsr},
{"file", filename}, {"nstep", nstep}, {"Nupdates", updatecnt}, {"fixed", fixed}};
ExternalPotential::to_json(j);
_roundjson(j, 5);
}
void ExternalAkesson::save() {
std::ofstream f(filename);
if (f) {
f.precision(16);
f << rho;
} else
throw std::runtime_error("cannot save file '"s + filename + "'");
}
void ExternalAkesson::load() {
std::ifstream f(filename);
if (f) {
rho << f;
update_phi();
} else
faunus_logger->warn("density file {} not loaded", filename);
}
double ExternalAkesson::phi_ext(double z, double a) const {
double a2 = a * a, z2 = z * z;
return -2 * pc::pi * z - 8 * a * std::log((std::sqrt(2 * a2 + z2) + a) / std::sqrt(a2 + z2)) +
2 * z * (0.5 * pc::pi + std::asin((a2 * a2 - z2 * z2 - 2 * a2 * z2) / std::pow(a2 + z2, 2)));
}
void ExternalAkesson::sync(Energybase *basePtr, Change &) {
if (not fixed) {
auto other = dynamic_cast<decltype(this)>(basePtr);
assert(other);
// only trial energy (new) require sync
if (other->key == Energybase::OLD)
if (cnt != other->cnt) {
assert(cnt < other->cnt && "trial cnt's must be smaller");
cnt = other->cnt;
rho = other->rho;
phi = other->phi;
}
}
}
void ExternalAkesson::update_rho() {
updatecnt++;
Point L = spc.geo.getLength();
double area = L.x() * L.y();
if (L.x() not_eq L.y() or 0.5 * L.z() != halfz)
throw std::runtime_error("Requires box Lx=Ly and Lz=const.");
Q.clear();
for (auto &g : spc.groups) // loop over all groups
for (auto &p : g) // ...and their active particles
Q(p.pos.z()) += p.charge;
for (double z = -halfz; z <= halfz; z += dz)
rho(z) += Q(z) / area;
}
void ExternalAkesson::update_phi() {
Point L = spc.geo.getLength();
double a = 0.5 * L.x();
for (double z = -halfz; z <= halfz; z += dz) {
double s = 0;
for (double zn = -halfz; zn <= halfz; zn += dz)
if (rho(zn).cnt > 0)
s += rho(zn).avg() * phi_ext(std::fabs(z - zn), a); // Eq. 14 in Greberg paper
phi(z) = lB * s;
}
}
// ------------ createGouyChapman -------------
std::function<double(const Particle &)> createGouyChapmanPotential(const json &j, const Geometry::Chameleon &geo) {
if (geo.boundaryConditions().direction.z() != Geometry::FIXED)
throw std::runtime_error("Gouy-Chapman requires non-periodicity in z-direction");
double rho;
double c0 = j.at("ionicstrength").get<double>() * 1.0_molar; // assuming 1:1 salt, so c0=I
double lB = pc::lB(j.at("epsr").get<double>());
double k = 1 / (3.04 / sqrt(c0)); // hack!
double phi0 = j.value("phi0", 0.0); // Unitless potential = beta*e*phi0
if (std::fabs(phi0) > 1e-6)
rho = sqrt(2 * c0 / (pc::pi * lB)) * sinh(.5 * phi0); // Evans&Wennerstrom,Colloidal Domain p. 138-140
else {
rho = 1.0 / j.value("qarea", 0.0);
if (rho > 1e9)
rho = j.at("rho");
phi0 = 2. * std::asinh(rho * std::sqrt(0.5 * lB * pc::pi / c0)); // [Evans..]
}
double gamma0 = std::tanh(phi0 / 4); // assuming z=1 [Evans..]
double surface_z_pos = j.value("zpos", -0.5 * geo.getLength().z());
bool linearize = j.value("linearize", false);
// return gamma function for calculation of GC potential on single particle.
return [=](const Particle &p) {
if (p.charge != 0) {
double x = std::exp(-k * std::fabs(surface_z_pos - p.pos.z()));
if (linearize)
return p.charge * phi0 * x;
else {
x = gamma0 * x;
return 2 * p.charge * std::log((1 + x) / (1 - x));
}
}
return 0.0;
};
}
// ------------ CustomExternal -------------
CustomExternal::CustomExternal(const json &j, Tspace &spc) : ExternalPotential(j, spc) {
expr = std::make_unique<ExprFunction<double>>();
name = "customexternal";
jin = j;
auto &_j = jin["constants"];
if (_j == nullptr)
_j = json::object();
_j["e0"] = pc::e0;
_j["kB"] = pc::kB;
_j["kT"] = pc::kT();
_j["Nav"] = pc::Nav;
_j["T"] = pc::temperature;
std::string name = jin.at("function");
// check if the custom potential match a name with a predefined meaning.
if (name == "gouychapman")
func = createGouyChapmanPotential(_j, spc.geo);
else if (name == "something") {
// add additional potential here
// base::func = createSomeOtherPotential(_j);
} else {
// if nothing found above, it is assumed that `function`
// is a valid expression.
expr->set(jin, {{"q", &d.q}, {"x", &d.x}, {"y", &d.y}, {"z", &d.z}});
func = [&](const Particle &a) {
d.x = a.pos.x();
d.y = a.pos.y();
d.z = a.pos.z();
d.q = a.charge;
return expr->operator()();
};
}
}
void CustomExternal::to_json(json &j) const {
j = jin;
ExternalPotential::to_json(j);
}
// ------------- ParticleSelfEnergy ---------------
/*
* Upon construction, make sure the ExternalPotential base class loop
* over all groups and particles (com=false)
*/
ParticleSelfEnergy::ParticleSelfEnergy(Space &spc, std::function<double(const Particle &)> selfEnergy)
: ExternalPotential({{"molecules", {"*"}}, {"com", false}}, spc) {
assert(selfEnergy && "selfEnergy is not callable");
func = selfEnergy;
#ifndef NDEBUG
// test if self energy can be called
assert(not Faunus::atoms.empty());
Particle myparticle;
myparticle.id=0;
if (this->func) {
double u = this->func(myparticle);
assert(std::isfinite(u));
}
#endif
name = "particle-self-energy";
}
} // namespace Energy
} // namespace Faunus
<commit_msg>Fix external potential for inactive groups<commit_after>#include "externalpotential.h"
#include "multipole.h"
#include "aux/eigensupport.h"
#include "functionparser.h"
#include "space.h"
#include "spdlog/spdlog.h"
namespace Faunus {
namespace Energy {
// ------------ Energybase -------------
void Energybase::to_json(json &) const {}
void Energybase::sync(Energybase *, Change &) {}
void Energybase::init() {}
void to_json(json &j, const Energybase &base) {
assert(not base.name.empty());
if (base.timer)
j[base.name]["relative time"] = base.timer.result();
if (not base.cite.empty())
j[base.name]["reference"] = base.cite;
base.to_json(j[base.name]);
}
// ------------ ExternalPotential -------------
// this calculates the interaction of a whole group
// with the applied external potential.
double ExternalPotential::_energy(const Group<Particle> &g) const {
double u = 0;
if (molids.find(g.id) != molids.end()) {
if (COM and g.atomic == false) { // apply only to center of mass
if (g.size() == g.capacity()) { // only apply if group is active
Particle cm; // temp. particle representing molecule
cm.charge = Faunus::monopoleMoment(g.begin(), g.end());
cm.pos = g.cm;
return func(cm);
}
} else {
for (auto &p : g) { // loop over active particles
u += func(p);
if (std::isnan(u))
break;
}
}
}
return u;
}
ExternalPotential::ExternalPotential(const json &j, Space &spc) : spc(spc) {
name = "external";
COM = j.value("com", false);
_names = j.at("molecules").get<decltype(_names)>(); // molecule names
auto _ids = names2ids(molecules, _names); // names --> molids
molids = std::set<int>(_ids.begin(), _ids.end()); // vector --> set
if (molids.empty())
throw std::runtime_error(name + ": molecule list is empty");
}
double ExternalPotential::energy(Change &change) {
assert(func != nullptr);
double u = 0;
if (change.dV or change.all or change.dN) {
for (auto &g : spc.groups) { // check all groups
u += _energy(g);
if (std::isnan(u))
break;
}
} else
for (auto &d : change.groups) {
auto &g = spc.groups.at(d.index); // check specified groups
if (d.all or COM) // check all atoms in group
u += _energy(g); // _energy also checks for molecule id
else { // check only specified atoms in group
if (molids.find(g.id) != molids.end())
for (auto i : d.atoms)
u += func(*(g.begin() + i));
}
if (std::isnan(u))
break;
}
return u;
}
void ExternalPotential::to_json(json &j) const {
j["molecules"] = _names;
j["com"] = COM;
}
// ------------ Confine -------------
Confine::Confine(const json &j, Tspace &spc) : ExternalPotential(j, spc) {
name = "confine";
k = value_inf(j, "k") * 1.0_kJmol; // get floating point; allow inf/-inf
type = m.at(j.at("type"));
if (type == sphere or type == cylinder) {
radius = j.at("radius");
origo = j.value("origo", origo);
scale = j.value("scale", scale);
if (type == cylinder)
dir = {1, 1, 0};
func = [&radius = radius, origo = origo, k = k, dir = dir](const Particle &p) {
double d2 = (origo - p.pos).cwiseProduct(dir).squaredNorm() - radius * radius;
if (d2 > 0)
return 0.5 * k * d2;
return 0.0;
};
// If volume is scaled, also scale the confining radius by adding a trigger
// to `Space::scaleVolume()`
if (scale)
spc.scaleVolumeTriggers.push_back(
[&radius = radius](Tspace &, double Vold, double Vnew) { radius *= std::cbrt(Vnew / Vold); });
}
if (type == cuboid) {
low = j.at("low").get<Point>();
high = j.at("high").get<Point>();
func = [low = low, high = high, k = k](const Particle &p) {
double u = 0;
Point d = low - p.pos;
for (int i = 0; i < 3; ++i)
if (d[i] > 0)
u += d[i] * d[i];
d = p.pos - high;
for (int i = 0; i < 3; ++i)
if (d[i] > 0)
u += d[i] * d[i];
return 0.5 * k * u;
};
}
}
void Confine::to_json(json &j) const {
if (type == cuboid)
j = {{"low", low}, {"high", high}};
if (type == sphere or type == cylinder)
j = {{"radius", radius}};
if (type == sphere) {
j["origo"] = origo;
j["scale"] = scale;
}
for (auto &i : m)
if (i.second == type)
j["type"] = i.first;
j["k"] = k / 1.0_kJmol;
ExternalPotential::to_json(j);
_roundjson(j, 5);
}
// ------------ ExternalAkesson -------------
ExternalAkesson::ExternalAkesson(const json &j, Tspace &spc) : ExternalPotential(j, spc) {
name = "akesson";
cite = "doi:10/dhb9mj";
SingleUseJSON _j = j; // json variant where items are deleted after access
_j.erase("com");
_j.erase("molecules");
nstep = _j.at("nstep").get<unsigned int>();
epsr = _j.at("epsr").get<double>();
fixed = _j.value("fixed", false);
nphi = _j.value("nphi", 10);
halfz = 0.5 * spc.geo.getLength().z();
lB = pc::lB(epsr);
dz = _j.value("dz", 0.2); // read z resolution
Q.setResolution(dz, -halfz, halfz);
rho.setResolution(dz, -halfz, halfz);
phi.setResolution(dz, -halfz, halfz);
filename = _j.value("file", "mfcorr.dat"s);
load();
func = [&phi = phi](const typename Tspace::Tparticle &p) { return p.charge * phi(p.pos.z()); };
if (not _j.empty()) // throw exception of unused/unknown keys are passed
throw std::runtime_error("unused key(s) for '"s + name + "':\n" + _j.dump());
}
double ExternalAkesson::energy(Change &change) {
if (not fixed) // pho(z) unconverged, keep sampling
if (key == Energybase::OLD) { // only sample on accepted configs
cnt++;
if (cnt % nstep == 0)
update_rho();
if (cnt % nstep * nphi == 0)
update_phi();
}
return ExternalPotential::energy(change);
}
ExternalAkesson::~ExternalAkesson() {
// save only if still updating and if energy type is "OLD",
// that is, accepted configurations (not trial)
if (not fixed and key == Energybase::OLD)
save();
}
void ExternalAkesson::to_json(json &j) const {
j = {{"lB", lB}, {"dz", dz}, {"nphi", nphi}, {"epsr", epsr},
{"file", filename}, {"nstep", nstep}, {"Nupdates", updatecnt}, {"fixed", fixed}};
ExternalPotential::to_json(j);
_roundjson(j, 5);
}
void ExternalAkesson::save() {
std::ofstream f(filename);
if (f) {
f.precision(16);
f << rho;
} else
throw std::runtime_error("cannot save file '"s + filename + "'");
}
void ExternalAkesson::load() {
std::ifstream f(filename);
if (f) {
rho << f;
update_phi();
} else
faunus_logger->warn("density file {} not loaded", filename);
}
double ExternalAkesson::phi_ext(double z, double a) const {
double a2 = a * a, z2 = z * z;
return -2 * pc::pi * z - 8 * a * std::log((std::sqrt(2 * a2 + z2) + a) / std::sqrt(a2 + z2)) +
2 * z * (0.5 * pc::pi + std::asin((a2 * a2 - z2 * z2 - 2 * a2 * z2) / std::pow(a2 + z2, 2)));
}
void ExternalAkesson::sync(Energybase *basePtr, Change &) {
if (not fixed) {
auto other = dynamic_cast<decltype(this)>(basePtr);
assert(other);
// only trial energy (new) require sync
if (other->key == Energybase::OLD)
if (cnt != other->cnt) {
assert(cnt < other->cnt && "trial cnt's must be smaller");
cnt = other->cnt;
rho = other->rho;
phi = other->phi;
}
}
}
void ExternalAkesson::update_rho() {
updatecnt++;
Point L = spc.geo.getLength();
double area = L.x() * L.y();
if (L.x() not_eq L.y() or 0.5 * L.z() != halfz)
throw std::runtime_error("Requires box Lx=Ly and Lz=const.");
Q.clear();
for (auto &g : spc.groups) // loop over all groups
for (auto &p : g) // ...and their active particles
Q(p.pos.z()) += p.charge;
for (double z = -halfz; z <= halfz; z += dz)
rho(z) += Q(z) / area;
}
void ExternalAkesson::update_phi() {
Point L = spc.geo.getLength();
double a = 0.5 * L.x();
for (double z = -halfz; z <= halfz; z += dz) {
double s = 0;
for (double zn = -halfz; zn <= halfz; zn += dz)
if (rho(zn).cnt > 0)
s += rho(zn).avg() * phi_ext(std::fabs(z - zn), a); // Eq. 14 in Greberg paper
phi(z) = lB * s;
}
}
// ------------ createGouyChapman -------------
std::function<double(const Particle &)> createGouyChapmanPotential(const json &j, const Geometry::Chameleon &geo) {
if (geo.boundaryConditions().direction.z() != Geometry::FIXED)
throw std::runtime_error("Gouy-Chapman requires non-periodicity in z-direction");
double rho;
double c0 = j.at("ionicstrength").get<double>() * 1.0_molar; // assuming 1:1 salt, so c0=I
double lB = pc::lB(j.at("epsr").get<double>());
double k = 1 / (3.04 / sqrt(c0)); // hack!
double phi0 = j.value("phi0", 0.0); // Unitless potential = beta*e*phi0
if (std::fabs(phi0) > 1e-6)
rho = sqrt(2 * c0 / (pc::pi * lB)) * sinh(.5 * phi0); // Evans&Wennerstrom,Colloidal Domain p. 138-140
else {
rho = 1.0 / j.value("qarea", 0.0);
if (rho > 1e9)
rho = j.at("rho");
phi0 = 2. * std::asinh(rho * std::sqrt(0.5 * lB * pc::pi / c0)); // [Evans..]
}
double gamma0 = std::tanh(phi0 / 4); // assuming z=1 [Evans..]
double surface_z_pos = j.value("zpos", -0.5 * geo.getLength().z());
bool linearize = j.value("linearize", false);
// return gamma function for calculation of GC potential on single particle.
return [=](const Particle &p) {
if (p.charge != 0) {
double x = std::exp(-k * std::fabs(surface_z_pos - p.pos.z()));
if (linearize)
return p.charge * phi0 * x;
else {
x = gamma0 * x;
return 2 * p.charge * std::log((1 + x) / (1 - x));
}
}
return 0.0;
};
}
// ------------ CustomExternal -------------
CustomExternal::CustomExternal(const json &j, Tspace &spc) : ExternalPotential(j, spc) {
expr = std::make_unique<ExprFunction<double>>();
name = "customexternal";
jin = j;
auto &_j = jin["constants"];
if (_j == nullptr)
_j = json::object();
_j["e0"] = pc::e0;
_j["kB"] = pc::kB;
_j["kT"] = pc::kT();
_j["Nav"] = pc::Nav;
_j["T"] = pc::temperature;
std::string name = jin.at("function");
// check if the custom potential match a name with a predefined meaning.
if (name == "gouychapman")
func = createGouyChapmanPotential(_j, spc.geo);
else if (name == "something") {
// add additional potential here
// base::func = createSomeOtherPotential(_j);
} else {
// if nothing found above, it is assumed that `function`
// is a valid expression.
expr->set(jin, {{"q", &d.q}, {"x", &d.x}, {"y", &d.y}, {"z", &d.z}});
func = [&](const Particle &a) {
d.x = a.pos.x();
d.y = a.pos.y();
d.z = a.pos.z();
d.q = a.charge;
return expr->operator()();
};
}
}
void CustomExternal::to_json(json &j) const {
j = jin;
ExternalPotential::to_json(j);
}
// ------------- ParticleSelfEnergy ---------------
/*
* Upon construction, make sure the ExternalPotential base class loop
* over all groups and particles (com=false)
*/
ParticleSelfEnergy::ParticleSelfEnergy(Space &spc, std::function<double(const Particle &)> selfEnergy)
: ExternalPotential({{"molecules", {"*"}}, {"com", false}}, spc) {
assert(selfEnergy && "selfEnergy is not callable");
func = selfEnergy;
#ifndef NDEBUG
// test if self energy can be called
assert(not Faunus::atoms.empty());
Particle myparticle;
myparticle.id=0;
if (this->func) {
double u = this->func(myparticle);
assert(std::isfinite(u));
}
#endif
name = "particle-self-energy";
}
} // namespace Energy
} // namespace Faunus
<|endoftext|>
|
<commit_before>#include "js_helpers.h"
#include "common/RhodesApp.h"
#include "net/URI.h"
#include "logging/RhoLog.h"
#include "api_generator/Api.h"
#include <vector>
#undef DEFAULT_LOGCATEGORY
#define DEFAULT_LOGCATEGORY "js_helper"
namespace rho
{
namespace apiGenerator
{
using namespace rho::json;
static const String ID("id");
static const String METHOD("method");
static const String RHO_CLASS("__rhoClass");
static const String RHO_ID("__rhoID");
static const String RHO_CALLBACK("__rhoCallback");
static const String VM_ID("vmID");
static const String RHO_CALLBACK_PARAM("optParams");
std::vector<ApiHandler<Func_JS>*> g_modules;
void defineJSApiModule(ApiHandler<Func_JS>* pModule)
{
g_modules.push_back(pModule);
RAWTRACE2("Define %1, %d", pModule->getModuleId(), g_modules.size() -1);
}
ApiHandler<Func_JS>* getJSApiModule(const std::string& moduleId)
{
for(std::vector<ApiHandler<Func_JS>*>::iterator moduleIt = g_modules.begin(); moduleIt != g_modules.end(); ++moduleIt)
{
if(strcmp((*moduleIt)->getModuleId(), moduleId.c_str()) == 0)
{
RAWTRACE2("Module %s, %d", (*moduleIt)->getModuleId(), moduleIt - g_modules.begin());
return *moduleIt;
}
}
RAWTRACE1("Module is not found: %s", moduleId.c_str());
return 0;
}
rho::String js_entry_point(const char* szJSON)
{
RAWTRACE(szJSON);
rho::String strReqId, strModule, strMethod, strObjID, strCallbackID, strJsVmID, strCallbackParam;
CJSONEntry oEntry(szJSON);
if ( !oEntry.hasName(ID) )
{
RAWLOG_ERROR1("There is no %s string in JSON request", ID.c_str());
return "{\"jsonrpc\": \"2.0\", \"error\": {\"code\": -32700, \"message\": \"Parse error\"}, \"id\": null}";
}
strReqId = oEntry.getString(ID.c_str());
if ( !oEntry.hasName(RHO_CLASS) )
{
RAWLOG_ERROR1("There is no %s string in JSON request", RHO_CLASS.c_str());
return "{\"jsonrpc\": \"2.0\", \"error\": {\"code\": -32700, \"message\": \"Parse error\"}, \"id\": " + strReqId + "}";
}
strModule = oEntry.getString(RHO_CLASS.c_str());
if ( !oEntry.hasName(METHOD) )
{
RAWLOG_ERROR1("There is no %s string in JSON request object", METHOD.c_str());
return "{\"jsonrpc\": \"2.0\", \"error\": {\"code\": -32700, \"message\": \"Parse error\"}, \"id\": " + strReqId + "}";
}
strMethod = oEntry.getString(METHOD.c_str());
if ( oEntry.hasName(RHO_ID) )
strObjID = oEntry.getString(RHO_ID.c_str());
if ( oEntry.hasName(RHO_CALLBACK) ) {
RAWTRACE("Parsing callback");
CJSONEntry oCallback = oEntry.getEntry(RHO_CALLBACK.c_str());
RAWTRACE1("Got %s JSON object", RHO_CALLBACK.c_str());
if ( !oCallback.hasName(ID) )
{
RAWLOG_ERROR1("There is no %s string in __rhoCallback request", ID.c_str());
return "{\"jsonrpc\": \"2.0\", \"error\": {\"code\": -32700, \"message\": \"Parse error\"}, \"id\": " + strReqId + "}";
}
const char* pcszCallbackID = oCallback.getString(ID.c_str());
const char* pcszJsVmID = oCallback.getString(VM_ID.c_str());
const char* pcszCallbackParam = oCallback.getString(RHO_CALLBACK_PARAM.c_str());
if (pcszCallbackID)
strCallbackID = pcszCallbackID;
if (pcszJsVmID)
strJsVmID = pcszJsVmID;//oCallback.getString(pcszJsVmID);
if (pcszCallbackParam)
strCallbackParam = pcszCallbackParam;
}
String_replace(strModule, '.', ':');
ApiHandler<Func_JS>* pApiHandler = getJSApiModule(strModule);
if (!pApiHandler)
{
RAWLOG_ERROR1("API Module is not found: %s", strModule.c_str());
return "{\"jsonrpc\": \"2.0\", \"error\": {\"code\": -32601, \"message\": \"API module is not found.\"}, \"id\": " + strReqId + "}";
}
Func_JS pMethod = NULL;
if (strObjID == "0")
{
pMethod = pApiHandler->getStaticMethod(strMethod);
if (!pMethod)
{
RAWLOG_ERROR1("Static API method is not found: %s", strMethod.c_str());
return "{\"jsonrpc\": \"2.0\", \"error\": {\"code\": -32601, \"message\": \"Static method is not found.\"}, \"id\": " + strReqId + "}";
}
}
else
{
pMethod = pApiHandler->getInstanceMethod(strMethod);
if (!pMethod)
{
RAWLOG_ERROR1("Instance API method is not found: %s", strMethod.c_str());
return "{\"jsonrpc\": \"2.0\", \"error\": {\"code\": -32601, \"message\": \"Instance method is not found.\"}, \"id\": " + strReqId + "}";
}
}
CJSONArray oParams(oEntry.getEntry("params"));
RAWTRACE3("Calling API: object: %s, method: %s, callback id: %s", strObjID.c_str(), strMethod.c_str(), strCallbackID.c_str());
String methodResult = pMethod( strObjID, oParams, strCallbackID, strJsVmID, strCallbackParam );
#ifdef RHO_DEBUG
String res = "{"+methodResult+"}";
CJSONEntry jsonValidator(res.c_str());
#endif
return "{\"jsonrpc\": \"2.0\", " + methodResult + ", \"id\": " + strReqId + "}";
}
void rho_http_js_entry_point(void *arg, rho::String const &query )
{
rho::String res = js_entry_point(query.c_str());
rho_http_sendresponse(arg, res.c_str());
}
}
}
<commit_msg>Fix trace in js_helper.cpp<commit_after>#include "js_helpers.h"
#include "common/RhodesApp.h"
#include "net/URI.h"
#include "logging/RhoLog.h"
#include "api_generator/Api.h"
#include <vector>
#undef DEFAULT_LOGCATEGORY
#define DEFAULT_LOGCATEGORY "js_helper"
namespace rho
{
namespace apiGenerator
{
using namespace rho::json;
static const String ID("id");
static const String METHOD("method");
static const String RHO_CLASS("__rhoClass");
static const String RHO_ID("__rhoID");
static const String RHO_CALLBACK("__rhoCallback");
static const String VM_ID("vmID");
static const String RHO_CALLBACK_PARAM("optParams");
std::vector<ApiHandler<Func_JS>*> g_modules;
void defineJSApiModule(ApiHandler<Func_JS>* pModule)
{
g_modules.push_back(pModule);
RAWTRACE2("Define %s, %d", pModule->getModuleId(), g_modules.size() -1);
}
ApiHandler<Func_JS>* getJSApiModule(const std::string& moduleId)
{
for(std::vector<ApiHandler<Func_JS>*>::iterator moduleIt = g_modules.begin(); moduleIt != g_modules.end(); ++moduleIt)
{
if(strcmp((*moduleIt)->getModuleId(), moduleId.c_str()) == 0)
{
RAWTRACE2("Module %s, %d", (*moduleIt)->getModuleId(), moduleIt - g_modules.begin());
return *moduleIt;
}
}
RAWTRACE1("Module is not found: %s", moduleId.c_str());
return 0;
}
rho::String js_entry_point(const char* szJSON)
{
RAWTRACE(szJSON);
rho::String strReqId, strModule, strMethod, strObjID, strCallbackID, strJsVmID, strCallbackParam;
CJSONEntry oEntry(szJSON);
if ( !oEntry.hasName(ID) )
{
RAWLOG_ERROR1("There is no %s string in JSON request", ID.c_str());
return "{\"jsonrpc\": \"2.0\", \"error\": {\"code\": -32700, \"message\": \"Parse error\"}, \"id\": null}";
}
strReqId = oEntry.getString(ID.c_str());
if ( !oEntry.hasName(RHO_CLASS) )
{
RAWLOG_ERROR1("There is no %s string in JSON request", RHO_CLASS.c_str());
return "{\"jsonrpc\": \"2.0\", \"error\": {\"code\": -32700, \"message\": \"Parse error\"}, \"id\": " + strReqId + "}";
}
strModule = oEntry.getString(RHO_CLASS.c_str());
if ( !oEntry.hasName(METHOD) )
{
RAWLOG_ERROR1("There is no %s string in JSON request object", METHOD.c_str());
return "{\"jsonrpc\": \"2.0\", \"error\": {\"code\": -32700, \"message\": \"Parse error\"}, \"id\": " + strReqId + "}";
}
strMethod = oEntry.getString(METHOD.c_str());
if ( oEntry.hasName(RHO_ID) )
strObjID = oEntry.getString(RHO_ID.c_str());
if ( oEntry.hasName(RHO_CALLBACK) ) {
RAWTRACE("Parsing callback");
CJSONEntry oCallback = oEntry.getEntry(RHO_CALLBACK.c_str());
RAWTRACE1("Got %s JSON object", RHO_CALLBACK.c_str());
if ( !oCallback.hasName(ID) )
{
RAWLOG_ERROR1("There is no %s string in __rhoCallback request", ID.c_str());
return "{\"jsonrpc\": \"2.0\", \"error\": {\"code\": -32700, \"message\": \"Parse error\"}, \"id\": " + strReqId + "}";
}
const char* pcszCallbackID = oCallback.getString(ID.c_str());
const char* pcszJsVmID = oCallback.getString(VM_ID.c_str());
const char* pcszCallbackParam = oCallback.getString(RHO_CALLBACK_PARAM.c_str());
if (pcszCallbackID)
strCallbackID = pcszCallbackID;
if (pcszJsVmID)
strJsVmID = pcszJsVmID;//oCallback.getString(pcszJsVmID);
if (pcszCallbackParam)
strCallbackParam = pcszCallbackParam;
}
String_replace(strModule, '.', ':');
ApiHandler<Func_JS>* pApiHandler = getJSApiModule(strModule);
if (!pApiHandler)
{
RAWLOG_ERROR1("API Module is not found: %s", strModule.c_str());
return "{\"jsonrpc\": \"2.0\", \"error\": {\"code\": -32601, \"message\": \"API module is not found.\"}, \"id\": " + strReqId + "}";
}
Func_JS pMethod = NULL;
if (strObjID == "0")
{
pMethod = pApiHandler->getStaticMethod(strMethod);
if (!pMethod)
{
RAWLOG_ERROR1("Static API method is not found: %s", strMethod.c_str());
return "{\"jsonrpc\": \"2.0\", \"error\": {\"code\": -32601, \"message\": \"Static method is not found.\"}, \"id\": " + strReqId + "}";
}
}
else
{
pMethod = pApiHandler->getInstanceMethod(strMethod);
if (!pMethod)
{
RAWLOG_ERROR1("Instance API method is not found: %s", strMethod.c_str());
return "{\"jsonrpc\": \"2.0\", \"error\": {\"code\": -32601, \"message\": \"Instance method is not found.\"}, \"id\": " + strReqId + "}";
}
}
CJSONArray oParams(oEntry.getEntry("params"));
RAWTRACE3("Calling API: object: %s, method: %s, callback id: %s", strObjID.c_str(), strMethod.c_str(), strCallbackID.c_str());
String methodResult = pMethod( strObjID, oParams, strCallbackID, strJsVmID, strCallbackParam );
#ifdef RHO_DEBUG
String res = "{"+methodResult+"}";
CJSONEntry jsonValidator(res.c_str());
#endif
return "{\"jsonrpc\": \"2.0\", " + methodResult + ", \"id\": " + strReqId + "}";
}
void rho_http_js_entry_point(void *arg, rho::String const &query )
{
rho::String res = js_entry_point(query.c_str());
rho_http_sendresponse(arg, res.c_str());
}
}
}
<|endoftext|>
|
<commit_before>#pragma warning(disable:4996)
#include "QtMainWindow.h"
#include "ui_QtMainWindow.h"
#include "ExternalWebView.h"
#include <QResizeEvent>
#include <QWebFrame>
#include "common/RhoStd.h"
#include "common/RhodesApp.h"
#include "rubyext/WebView.h"
#undef null
QtMainWindow::QtMainWindow(QWidget *parent) :
QMainWindow(parent),
ui(new Ui::QtMainWindow),
wi(new QWebInspector()),
cb(NULL)
{
ui->setupUi(this);
this->ui->webView->settings()->setAttribute(QWebSettings::DeveloperExtrasEnabled, true);
this->ui->webView->page()->setLinkDelegationPolicy(QWebPage::DelegateAllLinks);
this->move(0,0);
this->ui->toolBar->hide();
this->ui->toolBarRight->hide();
// connecting WebInspector
wi->setWindowTitle("Web Inspector");
wi->setPage(ui->webView->page());
wi->move(416, this->geometry().y());
wi->resize(850, 600);
wi->show();
}
QtMainWindow::~QtMainWindow()
{
delete wi;
delete ui;
}
void QtMainWindow::setCallback(IMainWindowCallback* callback)
{
cb = callback;
}
void QtMainWindow::hideEvent(QHideEvent *)
{
if (cb) cb->onActivate(0);
}
void QtMainWindow::showEvent(QShowEvent *)
{
if (cb) cb->onActivate(1);
}
void QtMainWindow::closeEvent(QCloseEvent *ce)
{
wi->close();
QMainWindow::closeEvent(ce);
}
void QtMainWindow::resizeEvent(QResizeEvent *event)
{
if (cb)
cb->updateSizeProperties(event->size().width(), event->size().height()); // ui->webView
}
void QtMainWindow::on_actionBack_triggered()
{
ui->webView->back();
}
void QtMainWindow::on_webView_linkClicked(const QUrl& url)
{
QString sUrl = url.toString();
if (sUrl.contains("rho_open_target=_blank")) {
if (cb) cb->logEvent("WebView: open external browser");
ExternalWebView* externalWebView = new ExternalWebView();
externalWebView->navigate(QUrl(sUrl.remove("rho_open_target=_blank")));
externalWebView->show();
externalWebView->activateWindow();
} else {
sUrl.remove(QRegExp("#+$"));
if (sUrl.compare(ui->webView->url().toString())!=0)
ui->webView->load(QUrl(sUrl));
}
}
void QtMainWindow::on_webView_loadStarted()
{
if (cb) cb->logEvent("WebView: loading...");
}
void QtMainWindow::on_webView_loadFinished(bool ok)
{
if (cb) cb->logEvent((ok?"WebView: loaded ":"WebView: failed ")); // +ui->webView->url().toString()
}
void QtMainWindow::on_webView_urlChanged(QUrl url)
{
if (cb) cb->logEvent("WebView: URL changed"); // url.toString()
}
void QtMainWindow::on_menuMain_aboutToShow()
{
if (cb) cb->createCustomMenu();
}
void QtMainWindow::navigate(QString url)
{
if (url.startsWith("javascript:", Qt::CaseInsensitive)) {
url.remove(0,11);
ui->webView->stop();
ui->webView->page()->mainFrame()->evaluateJavaScript(url);
} else
ui->webView->load(QUrl(url));
}
void QtMainWindow::GoBack(void)
{
ui->webView->back();
}
void QtMainWindow::GoForward(void)
{
ui->webView->forward();
}
void QtMainWindow::Refresh(void)
{
ui->webView->reload();
}
void QtMainWindow::toolbarRemoveAllButtons()
{
ui->toolBar->clear();
ui->toolBarRight->clear();
}
void QtMainWindow::toolbarShow()
{
ui->toolBar->show();
ui->toolBarRight->show();
}
void QtMainWindow::toolbarHide()
{
ui->toolBar->hide();
ui->toolBarRight->hide();
}
int QtMainWindow::toolbarGetHeight()
{
return ui->toolBar->height();
}
void QtMainWindow::toolbarAddAction(const QString & text)
{
ui->toolBar->addAction(text);
}
void QtMainWindow::on_toolbarAction_triggered(bool checked)
{
QObject* sender = QObject::sender();
QAction* action;
if (sender && (action = dynamic_cast<QAction*>(sender))) {
rho::String* strAction = new rho::String(action->data().toString().toStdString());
if ( strcasecmp(strAction->c_str(), "forward") == 0 )
rho_webview_navigate_forward();
else
RHODESAPP().loadUrl(*strAction);
}
}
void QtMainWindow::toolbarAddAction(const QIcon & icon, const QString & text, const char* action, bool rightAlign)
{
QAction* qAction = new QAction(icon, text, ui->toolBar);
qAction->setData(QVariant(action));
QObject::connect(qAction, SIGNAL(triggered(bool)), this, SLOT(on_toolbarAction_triggered(bool)) );
if (rightAlign)
ui->toolBarRight->insertAction( (ui->toolBarRight->actions().size() > 0 ? ui->toolBarRight->actions().last() : 0), qAction);
else
ui->toolBar->addAction(qAction);
}
void QtMainWindow::toolbarAddSeparator()
{
ui->toolBar->addSeparator();
}
void QtMainWindow::setToolbarStyle(bool border, QString background)
{
QString style = "";
if (!border) style += "border:0px";
if (background.length()>0) {
if (style.length()>0) style += ";";
style += "background:"+background;
}
if (style.length()>0) {
style = "QToolBar{"+style+"}";
ui->toolBar->setStyleSheet(style);
ui->toolBarRight->setStyleSheet(style);
}
}
void QtMainWindow::menuAddAction(const QString & text, int item)
{
QAction* qAction = new QAction(text, ui->toolBar);
qAction->setData(QVariant(item));
QObject::connect(qAction, SIGNAL(triggered(bool)), this, SLOT(on_menuAction_triggered(bool)) );
ui->menuMain->addAction(qAction);
}
void QtMainWindow::menuClear(void)
{
ui->menuMain->clear();
}
void QtMainWindow::menuAddSeparator()
{
ui->menuMain->addSeparator();
}
void QtMainWindow::on_menuAction_triggered(bool checked)
{
QObject* sender = QObject::sender();
QAction* action;
if (sender && (action = dynamic_cast<QAction*>(sender)) && cb)
cb->onCustomMenuItemCommand(action->data().toInt());
}
<commit_msg>RhoSimulator: WebSQL support fixed<commit_after>#pragma warning(disable:4996)
#include "QtMainWindow.h"
#include "ui_QtMainWindow.h"
#include "ExternalWebView.h"
#include <QResizeEvent>
#include <QWebFrame>
#include <QWebSettings>
#include <QWebSecurityOrigin>
#include "common/RhoStd.h"
#include "common/RhodesApp.h"
#include "rubyext/WebView.h"
#undef null
QtMainWindow::QtMainWindow(QWidget *parent) :
QMainWindow(parent),
ui(new Ui::QtMainWindow),
wi(new QWebInspector()),
cb(NULL)
{
ui->setupUi(this);
QWebSettings* qs = QWebSettings::globalSettings(); //this->ui->webView->settings();
qs->setAttribute(QWebSettings::DeveloperExtrasEnabled, true);
qs->setAttribute(QWebSettings::LocalStorageEnabled, true);
qs->setAttribute(QWebSettings::OfflineStorageDatabaseEnabled, true);
qs->setAttribute(QWebSettings::OfflineWebApplicationCacheEnabled, true);
qs->setOfflineStorageDefaultQuota(1024*1024*1024);
rho::String rs_dir = RHODESAPP().getRhoRootPath()+RHO_EMULATOR_DIR;
qs->setOfflineWebApplicationCachePath(rs_dir.c_str());
qs->setLocalStoragePath(rs_dir.c_str());
qs->setOfflineStoragePath(rs_dir.c_str());
this->ui->webView->page()->setLinkDelegationPolicy(QWebPage::DelegateAllLinks);
this->ui->webView->page()->mainFrame()->securityOrigin().setDatabaseQuota(1024*1024*1024);
this->move(0,0);
this->ui->toolBar->hide();
this->ui->toolBarRight->hide();
// connecting WebInspector
wi->setWindowTitle("Web Inspector");
wi->setPage(ui->webView->page());
wi->move(416, this->geometry().y());
wi->resize(850, 600);
wi->show();
}
QtMainWindow::~QtMainWindow()
{
delete wi;
delete ui;
}
void QtMainWindow::setCallback(IMainWindowCallback* callback)
{
cb = callback;
}
void QtMainWindow::hideEvent(QHideEvent *)
{
if (cb) cb->onActivate(0);
}
void QtMainWindow::showEvent(QShowEvent *)
{
if (cb) cb->onActivate(1);
}
void QtMainWindow::closeEvent(QCloseEvent *ce)
{
wi->close();
QMainWindow::closeEvent(ce);
}
void QtMainWindow::resizeEvent(QResizeEvent *event)
{
if (cb)
cb->updateSizeProperties(event->size().width(), event->size().height()); // ui->webView
}
void QtMainWindow::on_actionBack_triggered()
{
ui->webView->back();
}
void QtMainWindow::on_webView_linkClicked(const QUrl& url)
{
QString sUrl = url.toString();
if (sUrl.contains("rho_open_target=_blank")) {
if (cb) cb->logEvent("WebView: open external browser");
ExternalWebView* externalWebView = new ExternalWebView();
externalWebView->navigate(QUrl(sUrl.remove("rho_open_target=_blank")));
externalWebView->show();
externalWebView->activateWindow();
} else {
sUrl.remove(QRegExp("#+$"));
if (sUrl.compare(ui->webView->url().toString())!=0)
ui->webView->load(QUrl(sUrl));
}
}
void QtMainWindow::on_webView_loadStarted()
{
if (cb) cb->logEvent("WebView: loading...");
}
void QtMainWindow::on_webView_loadFinished(bool ok)
{
if (cb) cb->logEvent((ok?"WebView: loaded ":"WebView: failed ")); // +ui->webView->url().toString()
}
void QtMainWindow::on_webView_urlChanged(QUrl url)
{
if (cb) cb->logEvent("WebView: URL changed"); // url.toString()
}
void QtMainWindow::on_menuMain_aboutToShow()
{
if (cb) cb->createCustomMenu();
}
void QtMainWindow::navigate(QString url)
{
if (url.startsWith("javascript:", Qt::CaseInsensitive)) {
url.remove(0,11);
ui->webView->stop();
ui->webView->page()->mainFrame()->evaluateJavaScript(url);
} else
ui->webView->load(QUrl(url));
}
void QtMainWindow::GoBack(void)
{
ui->webView->back();
}
void QtMainWindow::GoForward(void)
{
ui->webView->forward();
}
void QtMainWindow::Refresh(void)
{
ui->webView->reload();
}
void QtMainWindow::toolbarRemoveAllButtons()
{
ui->toolBar->clear();
ui->toolBarRight->clear();
}
void QtMainWindow::toolbarShow()
{
ui->toolBar->show();
ui->toolBarRight->show();
}
void QtMainWindow::toolbarHide()
{
ui->toolBar->hide();
ui->toolBarRight->hide();
}
int QtMainWindow::toolbarGetHeight()
{
return ui->toolBar->height();
}
void QtMainWindow::toolbarAddAction(const QString & text)
{
ui->toolBar->addAction(text);
}
void QtMainWindow::on_toolbarAction_triggered(bool checked)
{
QObject* sender = QObject::sender();
QAction* action;
if (sender && (action = dynamic_cast<QAction*>(sender))) {
rho::String* strAction = new rho::String(action->data().toString().toStdString());
if ( strcasecmp(strAction->c_str(), "forward") == 0 )
rho_webview_navigate_forward();
else
RHODESAPP().loadUrl(*strAction);
}
}
void QtMainWindow::toolbarAddAction(const QIcon & icon, const QString & text, const char* action, bool rightAlign)
{
QAction* qAction = new QAction(icon, text, ui->toolBar);
qAction->setData(QVariant(action));
QObject::connect(qAction, SIGNAL(triggered(bool)), this, SLOT(on_toolbarAction_triggered(bool)) );
if (rightAlign)
ui->toolBarRight->insertAction( (ui->toolBarRight->actions().size() > 0 ? ui->toolBarRight->actions().last() : 0), qAction);
else
ui->toolBar->addAction(qAction);
}
void QtMainWindow::toolbarAddSeparator()
{
ui->toolBar->addSeparator();
}
void QtMainWindow::setToolbarStyle(bool border, QString background)
{
QString style = "";
if (!border) style += "border:0px";
if (background.length()>0) {
if (style.length()>0) style += ";";
style += "background:"+background;
}
if (style.length()>0) {
style = "QToolBar{"+style+"}";
ui->toolBar->setStyleSheet(style);
ui->toolBarRight->setStyleSheet(style);
}
}
void QtMainWindow::menuAddAction(const QString & text, int item)
{
QAction* qAction = new QAction(text, ui->toolBar);
qAction->setData(QVariant(item));
QObject::connect(qAction, SIGNAL(triggered(bool)), this, SLOT(on_menuAction_triggered(bool)) );
ui->menuMain->addAction(qAction);
}
void QtMainWindow::menuClear(void)
{
ui->menuMain->clear();
}
void QtMainWindow::menuAddSeparator()
{
ui->menuMain->addSeparator();
}
void QtMainWindow::on_menuAction_triggered(bool checked)
{
QObject* sender = QObject::sender();
QAction* action;
if (sender && (action = dynamic_cast<QAction*>(sender)) && cb)
cb->onCustomMenuItemCommand(action->data().toInt());
}
<|endoftext|>
|
<commit_before>
#include <togo/utility.hpp>
#include <togo/assert.hpp>
#include <togo/log.hpp>
#include <togo/kvs.hpp>
#include "../common/helpers.hpp"
#include <cstring>
using namespace togo;
signed
main() {
memory_init();
TOGO_LOGF("sizeof(KVS) = %u\n", static_cast<unsigned>(sizeof(KVS)));
TOGO_LOGF("sizeof(KVS::Value) = %u\n", static_cast<unsigned>(sizeof(KVS::Value)));
TOGO_LOGF("alignof(KVS) %u\n", static_cast<unsigned>(alignof(KVS)));
TOGO_LOGF("alignof(KVS::Value) %u\n", static_cast<unsigned>(alignof(KVS::Value)));
{
KVS const identity;
TOGO_ASSERTE(kvs::is_null(identity));
TOGO_ASSERTE(!kvs::is_integer(identity));
TOGO_ASSERTE(!kvs::is_decimal(identity));
TOGO_ASSERTE(!kvs::is_boolean(identity));
TOGO_ASSERTE(!kvs::is_string(identity));
TOGO_ASSERTE(!kvs::is_vector(identity));
TOGO_ASSERTE(!kvs::is_collection(identity));
TOGO_ASSERTE(!kvs::is_named(identity));
TOGO_ASSERTE(kvs::size(identity) == 0);
TOGO_ASSERTE(!kvs::any(identity));
TOGO_ASSERTE(kvs::empty(identity));
TOGO_ASSERTE(kvs::begin(identity) == nullptr);
TOGO_ASSERTE(kvs::end(identity) == nullptr);
}
{
static constexpr char const NAME[]{"bzork"};
static constexpr char const VALUE[]{"fitz"};
KVS a{VALUE};
TOGO_ASSERTE(!kvs::is_named(a));
TOGO_ASSERTE(kvs::is_string(a));
TOGO_ASSERTE(kvs::string_size(a) == sizeof(VALUE));
TOGO_ASSERTE(0 == std::strncmp(VALUE, kvs::string(a), kvs::string_size(a)));
kvs::set_name(a, NAME);
TOGO_ASSERTE(kvs::is_named(a));
TOGO_ASSERTE(kvs::name_size(a) == sizeof(NAME));
TOGO_ASSERTE(0 == std::strncmp(NAME, kvs::name(a), kvs::name_size(a)));
TOGO_LOGF("\"%s\" = \"%s\"\n", kvs::name(a), kvs::string(a));
kvs::integer(a, static_cast<s64>(0xCECECECECECECECE));
TOGO_ASSERTE(kvs::is_integer(a));
TOGO_ASSERTE(kvs::integer(a) == static_cast<s64>(0xCECECECECECECECE));
kvs::boolean(a, false);
TOGO_ASSERTE(kvs::is_boolean(a));
TOGO_ASSERTE(kvs::boolean(a) == false);
kvs::nullify(a);
TOGO_ASSERTE(kvs::is_null(a));
}
return 0;
}
<commit_msg>test/kvs/values: corrected string size assertions.<commit_after>
#include <togo/utility.hpp>
#include <togo/assert.hpp>
#include <togo/log.hpp>
#include <togo/kvs.hpp>
#include "../common/helpers.hpp"
#include <cstring>
using namespace togo;
signed
main() {
memory_init();
TOGO_LOGF("sizeof(KVS) = %u\n", static_cast<unsigned>(sizeof(KVS)));
TOGO_LOGF("sizeof(KVS::Value) = %u\n", static_cast<unsigned>(sizeof(KVS::Value)));
TOGO_LOGF("alignof(KVS) %u\n", static_cast<unsigned>(alignof(KVS)));
TOGO_LOGF("alignof(KVS::Value) %u\n", static_cast<unsigned>(alignof(KVS::Value)));
{
KVS const identity;
TOGO_ASSERTE(kvs::is_null(identity));
TOGO_ASSERTE(!kvs::is_integer(identity));
TOGO_ASSERTE(!kvs::is_decimal(identity));
TOGO_ASSERTE(!kvs::is_boolean(identity));
TOGO_ASSERTE(!kvs::is_string(identity));
TOGO_ASSERTE(!kvs::is_vector(identity));
TOGO_ASSERTE(!kvs::is_collection(identity));
TOGO_ASSERTE(!kvs::is_named(identity));
TOGO_ASSERTE(kvs::size(identity) == 0);
TOGO_ASSERTE(!kvs::any(identity));
TOGO_ASSERTE(kvs::empty(identity));
TOGO_ASSERTE(kvs::begin(identity) == nullptr);
TOGO_ASSERTE(kvs::end(identity) == nullptr);
}
{
static constexpr char const NAME[]{"bzork"};
static constexpr char const VALUE[]{"fitz"};
KVS a{VALUE};
TOGO_ASSERTE(!kvs::is_named(a));
TOGO_ASSERTE(kvs::is_string(a));
TOGO_ASSERTE(kvs::string_size(a) == std::strlen(VALUE));
TOGO_ASSERTE(0 == std::strncmp(VALUE, kvs::string(a), kvs::string_size(a)));
kvs::set_name(a, NAME);
TOGO_ASSERTE(kvs::is_named(a));
TOGO_ASSERTE(kvs::name_size(a) == std::strlen(NAME));
TOGO_ASSERTE(0 == std::strncmp(NAME, kvs::name(a), kvs::name_size(a)));
TOGO_LOGF("\"%s\" = \"%s\"\n", kvs::name(a), kvs::string(a));
kvs::integer(a, static_cast<s64>(0xCECECECECECECECE));
TOGO_ASSERTE(kvs::is_integer(a));
TOGO_ASSERTE(kvs::integer(a) == static_cast<s64>(0xCECECECECECECECE));
kvs::boolean(a, false);
TOGO_ASSERTE(kvs::is_boolean(a));
TOGO_ASSERTE(kvs::boolean(a) == false);
kvs::nullify(a);
TOGO_ASSERTE(kvs::is_null(a));
}
return 0;
}
<|endoftext|>
|
<commit_before>#ifndef MJOLNIR_CORE_MULTIPLE_BASIN_FORCE_FIELD_HPP
#define MJOLNIR_CORE_MULTIPLE_BASIN_FORCE_FIELD_HPP
#include <mjolnir/forcefield/MultipleBasin/MultipleBasinUnitBase.hpp>
#include <mjolnir/core/Topology.hpp>
#include <mjolnir/core/LocalForceField.hpp>
#include <mjolnir/core/GlobalForceField.hpp>
#include <mjolnir/core/ExternalForceField.hpp>
#include <mjolnir/util/string.hpp>
#include <algorithm>
#include <numeric>
#include <memory>
namespace mjolnir
{
// MultipleBasinForceField
//
// In some cases, protein has several domains that undergoes conformational
// changes independently.
//
// .-. .-. __ .-.
// ( A )( B ) -> (A'|( B )
// `-' `-' `- `-'
// | |
// v v
// .-. __ __ __
// ( A )|B') -> (A'|B')
// `-' -' `- -'
//
// To handle such cases, MultipleBasinForceField has several N-basin forcefields
// inside and manage them in a proper way.
//
template<typename traitsT>
class MultipleBasinForceField : public ForceFieldBase<traitsT>
{
public:
using traits_type = traitsT;
using base_type = ForceFieldBase<traits_type>;
using real_type = typename base_type::real_type;
using coordinate_type = typename base_type::coordinate_type;
using system_type = typename base_type::system_type;
using topology_type = Topology;
using local_forcefield_type = LocalForceField<traits_type>;
using global_forcefield_type = GlobalForceField<traits_type>;
using external_forcefield_type = ExternalForceField<traits_type>;
using forcefield_type = std::tuple<
local_forcefield_type, global_forcefield_type, external_forcefield_type>;
// a set of potentials that are correlated in the way of MultipleBasin.
using multiple_basin_unit_type =
std::unique_ptr<MultipleBasinUnitBase<traits_type>>;
public:
MultipleBasinForceField(forcefield_type&& common,
std::vector<multiple_basin_unit_type>&& units)
: loc_common_(std::move(std::get<0>(common))),
glo_common_(std::move(std::get<1>(common))),
ext_common_(std::move(std::get<2>(common))),
units_(std::move(units))
{}
~MultipleBasinForceField() override = default;
MultipleBasinForceField(const MultipleBasinForceField&) = delete;
MultipleBasinForceField(MultipleBasinForceField&&) = default;
MultipleBasinForceField& operator=(const MultipleBasinForceField&) = delete;
MultipleBasinForceField& operator=(MultipleBasinForceField&&) = default;
void initialize(const system_type& sys) override
{
MJOLNIR_GET_DEFAULT_LOGGER();
MJOLNIR_LOG_FUNCTION();
// -------------------------------------------------------------------
// write topologies. Here we assume topologies are the same
MJOLNIR_LOG_INFO("writing topology");
topol_.resize(sys.size());
for(auto& unit : this->units_)
{
// each unit does not know the size of the system.
// we need to tell them the size.
unit->write_topology(sys, topol_);
}
loc_common_.write_topology(topol_);
topol_.construct_molecules();
MJOLNIR_LOG_INFO("initializing forcefields");
for(auto& unit : this->units_)
{
unit->initialize(sys, this->topol_);
}
loc_common_.initialize(sys);
glo_common_.initialize(sys, this->topol_);
ext_common_.initialize(sys);
return;
}
void calc_force(system_type& sys) const noexcept override
{
for(const auto& unit : this->units_)
{
unit->calc_force(sys);
}
loc_common_.calc_force(sys);
glo_common_.calc_force(sys);
ext_common_.calc_force(sys);
return ;
}
real_type calc_energy(const system_type& sys) const noexcept override
{
real_type E = real_type(0.0);
for(const auto& unit : this->units_)
{
E += unit->calc_energy(sys);
}
E += loc_common_.calc_energy(sys);
E += glo_common_.calc_energy(sys);
E += ext_common_.calc_energy(sys);
return E;
}
void update(const system_type& sys) override
{
// update parameters (e.g. temperature). TODO: topologies?
for(auto& unit : this->units_)
{
unit->update(sys, this->topol_);
}
loc_common_.update(sys);
glo_common_.update(sys, this->topol_);
ext_common_.update(sys);
return;
}
// update margin of neighbor list
void reduce_margin(const real_type dmargin, const system_type& sys) override
{
for(auto& unit : this->units_)
{
unit->reduce_margin(dmargin, sys);
}
loc_common_.reduce_margin(dmargin, sys);
glo_common_.reduce_margin(dmargin, sys);
ext_common_.reduce_margin(dmargin, sys);
return;
}
void scale_margin(const real_type scale, const system_type& sys) override
{
for(auto& unit : this->units_)
{
unit->scale_margin(scale, sys);
}
loc_common_.scale_margin(scale, sys);
glo_common_.scale_margin(scale, sys);
ext_common_.scale_margin(scale, sys);
return;
}
std::vector<std::string> list_energy_name() const override
{
using namespace mjolnir::literals::string_literals;
std::vector<std::string> retval;
for(const auto& unit : this->units_)
{
auto ls = unit->list_energy_name();
std::copy(std::make_move_iterator(ls.begin()),
std::make_move_iterator(ls.end()),
std::back_inserter(retval));
}
std::vector<std::string> common;
auto loc_cmn = loc_common_.list_energy();
auto glo_cmn = glo_common_.list_energy();
auto ext_cmn = ext_common_.list_energy();
std::copy(std::make_move_iterator(loc_cmn.begin()),
std::make_move_iterator(loc_cmn.end()),
std::back_inserter(common));
std::copy(std::make_move_iterator(glo_cmn.begin()),
std::make_move_iterator(glo_cmn.end()),
std::back_inserter(common));
std::copy(std::make_move_iterator(ext_cmn.begin()),
std::make_move_iterator(ext_cmn.end()),
std::back_inserter(common));
if(!common.empty())
{
common.front() = "Common{"_s + common.front();
common.back() += "}"_s;
}
return retval;
}
std::vector<real_type> dump_energy(const system_type& sys) const override
{
std::vector<real_type> retval;
for(const auto& unit : this->units_)
{
const auto ls = unit->dump_energy(sys);
std::copy(ls.begin(), ls.end(), std::back_inserter(retval));
}
const auto loc_cmn = loc_common_.dump_energy(sys);
const auto glo_cmn = glo_common_.dump_energy(sys);
const auto ext_cmn = ext_common_.dump_energy(sys);
std::copy(loc_cmn.begin(), loc_cmn.end(), std::back_inserter(retval));
std::copy(glo_cmn.begin(), glo_cmn.end(), std::back_inserter(retval));
std::copy(ext_cmn.begin(), ext_cmn.end(), std::back_inserter(retval));
return retval;
}
topology_type const& topology() const noexcept override {return topol_;}
private:
topology_type topol_;
local_forcefield_type loc_common_;
global_forcefield_type glo_common_;
external_forcefield_type ext_common_;
std::vector<multiple_basin_unit_type> units_;
};
#ifdef MJOLNIR_SEPARATE_BUILD
extern template class MultipleBasinForceField<SimulatorTraits<double, UnlimitedBoundary >>;
extern template class MultipleBasinForceField<SimulatorTraits<float, UnlimitedBoundary >>;
extern template class MultipleBasinForceField<SimulatorTraits<double, CuboidalPeriodicBoundary>>;
extern template class MultipleBasinForceField<SimulatorTraits<float, CuboidalPeriodicBoundary>>;
#endif
} // mjolnir
#endif// MJOLNIR_CORE_MULTIPLE_BASIN_FORCE_FIELD_HPP
<commit_msg>fix: append common potential names<commit_after>#ifndef MJOLNIR_CORE_MULTIPLE_BASIN_FORCE_FIELD_HPP
#define MJOLNIR_CORE_MULTIPLE_BASIN_FORCE_FIELD_HPP
#include <mjolnir/forcefield/MultipleBasin/MultipleBasinUnitBase.hpp>
#include <mjolnir/core/Topology.hpp>
#include <mjolnir/core/LocalForceField.hpp>
#include <mjolnir/core/GlobalForceField.hpp>
#include <mjolnir/core/ExternalForceField.hpp>
#include <mjolnir/util/string.hpp>
#include <algorithm>
#include <numeric>
#include <memory>
namespace mjolnir
{
// MultipleBasinForceField
//
// In some cases, protein has several domains that undergoes conformational
// changes independently.
//
// .-. .-. __ .-.
// ( A )( B ) -> (A'|( B )
// `-' `-' `- `-'
// | |
// v v
// .-. __ __ __
// ( A )|B') -> (A'|B')
// `-' -' `- -'
//
// To handle such cases, MultipleBasinForceField has several N-basin forcefields
// inside and manage them in a proper way.
//
template<typename traitsT>
class MultipleBasinForceField : public ForceFieldBase<traitsT>
{
public:
using traits_type = traitsT;
using base_type = ForceFieldBase<traits_type>;
using real_type = typename base_type::real_type;
using coordinate_type = typename base_type::coordinate_type;
using system_type = typename base_type::system_type;
using topology_type = Topology;
using local_forcefield_type = LocalForceField<traits_type>;
using global_forcefield_type = GlobalForceField<traits_type>;
using external_forcefield_type = ExternalForceField<traits_type>;
using forcefield_type = std::tuple<
local_forcefield_type, global_forcefield_type, external_forcefield_type>;
// a set of potentials that are correlated in the way of MultipleBasin.
using multiple_basin_unit_type =
std::unique_ptr<MultipleBasinUnitBase<traits_type>>;
public:
MultipleBasinForceField(forcefield_type&& common,
std::vector<multiple_basin_unit_type>&& units)
: loc_common_(std::move(std::get<0>(common))),
glo_common_(std::move(std::get<1>(common))),
ext_common_(std::move(std::get<2>(common))),
units_(std::move(units))
{}
~MultipleBasinForceField() override = default;
MultipleBasinForceField(const MultipleBasinForceField&) = delete;
MultipleBasinForceField(MultipleBasinForceField&&) = default;
MultipleBasinForceField& operator=(const MultipleBasinForceField&) = delete;
MultipleBasinForceField& operator=(MultipleBasinForceField&&) = default;
void initialize(const system_type& sys) override
{
MJOLNIR_GET_DEFAULT_LOGGER();
MJOLNIR_LOG_FUNCTION();
// -------------------------------------------------------------------
// write topologies. Here we assume topologies are the same
MJOLNIR_LOG_INFO("writing topology");
topol_.resize(sys.size());
for(auto& unit : this->units_)
{
// each unit does not know the size of the system.
// we need to tell them the size.
unit->write_topology(sys, topol_);
}
loc_common_.write_topology(topol_);
topol_.construct_molecules();
MJOLNIR_LOG_INFO("initializing forcefields");
for(auto& unit : this->units_)
{
unit->initialize(sys, this->topol_);
}
loc_common_.initialize(sys);
glo_common_.initialize(sys, this->topol_);
ext_common_.initialize(sys);
return;
}
void calc_force(system_type& sys) const noexcept override
{
for(const auto& unit : this->units_)
{
unit->calc_force(sys);
}
loc_common_.calc_force(sys);
glo_common_.calc_force(sys);
ext_common_.calc_force(sys);
return ;
}
real_type calc_energy(const system_type& sys) const noexcept override
{
real_type E = real_type(0.0);
for(const auto& unit : this->units_)
{
E += unit->calc_energy(sys);
}
E += loc_common_.calc_energy(sys);
E += glo_common_.calc_energy(sys);
E += ext_common_.calc_energy(sys);
return E;
}
void update(const system_type& sys) override
{
// update parameters (e.g. temperature). TODO: topologies?
for(auto& unit : this->units_)
{
unit->update(sys, this->topol_);
}
loc_common_.update(sys);
glo_common_.update(sys, this->topol_);
ext_common_.update(sys);
return;
}
// update margin of neighbor list
void reduce_margin(const real_type dmargin, const system_type& sys) override
{
for(auto& unit : this->units_)
{
unit->reduce_margin(dmargin, sys);
}
loc_common_.reduce_margin(dmargin, sys);
glo_common_.reduce_margin(dmargin, sys);
ext_common_.reduce_margin(dmargin, sys);
return;
}
void scale_margin(const real_type scale, const system_type& sys) override
{
for(auto& unit : this->units_)
{
unit->scale_margin(scale, sys);
}
loc_common_.scale_margin(scale, sys);
glo_common_.scale_margin(scale, sys);
ext_common_.scale_margin(scale, sys);
return;
}
std::vector<std::string> list_energy_name() const override
{
using namespace mjolnir::literals::string_literals;
std::vector<std::string> retval;
for(const auto& unit : this->units_)
{
auto ls = unit->list_energy_name();
std::copy(std::make_move_iterator(ls.begin()),
std::make_move_iterator(ls.end()),
std::back_inserter(retval));
}
std::vector<std::string> common;
auto loc_cmn = loc_common_.list_energy();
auto glo_cmn = glo_common_.list_energy();
auto ext_cmn = ext_common_.list_energy();
std::copy(std::make_move_iterator(loc_cmn.begin()),
std::make_move_iterator(loc_cmn.end()),
std::back_inserter(common));
std::copy(std::make_move_iterator(glo_cmn.begin()),
std::make_move_iterator(glo_cmn.end()),
std::back_inserter(common));
std::copy(std::make_move_iterator(ext_cmn.begin()),
std::make_move_iterator(ext_cmn.end()),
std::back_inserter(common));
if(!common.empty())
{
common.front() = "Common{"_s + common.front();
common.back() += "}"_s;
}
std::copy(std::make_move_iterator(common.begin()),
std::make_move_iterator(common.end()),
std::back_inserter(retval));
return retval;
}
std::vector<real_type> dump_energy(const system_type& sys) const override
{
std::vector<real_type> retval;
for(const auto& unit : this->units_)
{
const auto ls = unit->dump_energy(sys);
std::copy(ls.begin(), ls.end(), std::back_inserter(retval));
}
const auto loc_cmn = loc_common_.dump_energy(sys);
const auto glo_cmn = glo_common_.dump_energy(sys);
const auto ext_cmn = ext_common_.dump_energy(sys);
std::copy(loc_cmn.begin(), loc_cmn.end(), std::back_inserter(retval));
std::copy(glo_cmn.begin(), glo_cmn.end(), std::back_inserter(retval));
std::copy(ext_cmn.begin(), ext_cmn.end(), std::back_inserter(retval));
return retval;
}
topology_type const& topology() const noexcept override {return topol_;}
private:
topology_type topol_;
local_forcefield_type loc_common_;
global_forcefield_type glo_common_;
external_forcefield_type ext_common_;
std::vector<multiple_basin_unit_type> units_;
};
#ifdef MJOLNIR_SEPARATE_BUILD
extern template class MultipleBasinForceField<SimulatorTraits<double, UnlimitedBoundary >>;
extern template class MultipleBasinForceField<SimulatorTraits<float, UnlimitedBoundary >>;
extern template class MultipleBasinForceField<SimulatorTraits<double, CuboidalPeriodicBoundary>>;
extern template class MultipleBasinForceField<SimulatorTraits<float, CuboidalPeriodicBoundary>>;
#endif
} // mjolnir
#endif// MJOLNIR_CORE_MULTIPLE_BASIN_FORCE_FIELD_HPP
<|endoftext|>
|
<commit_before><commit_msg>Fix fix of concurrently running Schmutzes.<commit_after><|endoftext|>
|
<commit_before>//
// Created by Salvador on 3/22/2015.
//
#include <iostream>
#include "TreeNode.hxx"
#include "sametree.hxx"
using namespace std;
int main(void) {
Solution sol;
TreeNode p{5}, q{5};
cout << sol.isSameTree(p, q) << endl;
return 0;
}
<commit_msg>fixed test<commit_after>//
// Created by Salvador on 3/22/2015.
//
#include <iostream>
#include "TreeNode.hxx"
#include "sametree.hxx"
using namespace std;
int main(void) {
Solution sol;
TreeNode p{5}, q{5};
cout << sol.isSameTree(&p, &q) << endl;
return 0;
}
<|endoftext|>
|
<commit_before>/*
* jcom.dataspace
* External for Jamoma: map input to output: y=f(x)
* Copyright © 2007
*
* License: This code is licensed under the terms of the "New BSD License"
* http://creativecommons.org/licenses/BSD/
*/
#include "Jamoma.h"
// Data Structure for this object
typedef struct _dataspace{
t_object ob;
//void *outlet_active;
void *outlet_native;
DataspaceLib *dataspace;
long ac; // for return values from the dataspace conversion
t_atom *av; // ...
t_symbol *attr_dataspace; // name of the dataspace -- e.g. "temperature"
t_symbol *attr_dataspace_active; // name of the current unit within the dataspace -- e.g. "celsius"
t_symbol *attr_dataspace_native; // name of the desired native unit within the dataspace -- e.g. "celsius"
} t_dataspace;
// Prototypes for methods
void* dataspace_new(t_symbol *name, long argc, t_atom *argv);
void dataspace_free(t_dataspace *obj);
void dataspace_assist(t_dataspace *obj, void *b, long m, long a, char *s);
void dataspace_int(t_dataspace *obj, long x);
void dataspace_float(t_dataspace *obj, double x);
void dataspace_list(t_dataspace *obj, t_symbol *msg, long argc, t_atom *argv);
void dataspace_getDataspaces(t_dataspace *obj);
void dataspace_getUnits(t_dataspace *obj);
t_max_err dataspace_setDataspace(t_dataspace *obj, void *attr, long argc, t_atom *argv);
t_max_err dataspace_setDataspaceActive(t_dataspace *obj, void *attr, long argc, t_atom *argv);
t_max_err dataspace_setDataspaceNative(t_dataspace *obj, void *attr, long argc, t_atom *argv);
// Globals
t_class *dataspace_class;
/************************************************************************************/
// Main() Function
int JAMOMA_EXPORT_MAXOBJ main(void)
{
t_class *c;
jamoma_init();
common_symbols_init();
// Define our class
c = class_new("jcom.dataspace",(method)dataspace_new, (method)dataspace_free, sizeof(t_dataspace), (method)0L, A_GIMME, 0);
// Make methods accessible for our class:
class_addmethod(c, (method)dataspace_int, "int", A_GIMME, 0);
class_addmethod(c, (method)dataspace_float, "float", A_GIMME, 0);
class_addmethod(c, (method)dataspace_list, "list", A_GIMME, 0);
class_addmethod(c, (method)dataspace_getDataspaces, "dataspaces.get", 0);
class_addmethod(c, (method)dataspace_getUnits, "units.get", A_GIMME, 0);
class_addmethod(c, (method)dataspace_assist, "assist", A_CANT, 0);
class_addmethod(c, (method)object_obex_dumpout, "dumpout", A_CANT, 0);
class_addattr(c,
attr_offset_new("dataspace", _sym_symbol, 0,
(method)0, (method)dataspace_setDataspace, calcoffset(t_dataspace, attr_dataspace)));
/*
class_addattr(c,
attr_offset_new("unit.active", _sym_symbol, 0,
(method)0, (method)dataspace_setDataspaceActive, calcoffset(t_dataspace, attr_dataspace_active)));
class_addattr(c,
attr_offset_new("unit.native", _sym_symbol, 0,
(method)0, (method)dataspace_setDataspaceNative, calcoffset(t_dataspace, attr_dataspace_native)));
*/
CLASS_ATTR_SYM(c, "input", 0, t_dataspace, attr_dataspace_active);
CLASS_ATTR_ACCESSORS(c, "input", NULL, dataspace_setDataspaceActive);
CLASS_ATTR_SYM(c, "output", 0, t_dataspace, attr_dataspace_native);
CLASS_ATTR_ACCESSORS(c, "output", NULL, dataspace_setDataspaceNative);
// Finalize our class
class_register(CLASS_BOX, c);
dataspace_class = c;
return 0;
}
/************************************************************************************/
// Object Life
void *dataspace_new(t_symbol *name, long argc, t_atom *argv)
{
t_dataspace *obj; // Declare an object (based on our struct)
obj = (t_dataspace *)object_alloc(dataspace_class); // Create object, store pointer to it (get 1 inlet free)
if (obj) {
object_obex_store((void *)obj, _sym_dumpout, (object *)outlet_new(obj,NULL));
//obj->outlet_active = outlet_new(obj, 0);
obj->outlet_native = outlet_new(obj, 0);
obj->dataspace = NULL;
obj->attr_dataspace_active = _sym_nothing;
obj->attr_dataspace_native = _sym_nothing;
attr_args_process(obj, argc, argv);
if (!obj->dataspace)
object_attr_setsym(obj, gensym("dataspace"), gensym("temperature"));
obj->av = (t_atom*)sysmem_newptr(sizeof(t_atom) * 3); // just allocating three for now -- limited list support
}
return obj; // Return pointer to our instance
}
void dataspace_free(t_dataspace *obj)
{
sysmem_freeptr(obj->av);
if (obj->dataspace)
delete obj->dataspace;
}
/************************************************************************************/
// Methods bound to input/inlets
// Method for Assistance Messages
void dataspace_assist(t_dataspace *x, void *b, long msg, long arg, char *dst)
{
if (msg==1) // Inlets
strcpy(dst, "x");
else if (msg==2) { // Outlets
switch(arg) {
case 0: strcpy(dst, "y=f(x)"); break;
default: strcpy(dst, "dumpout"); break;
}
}
}
void dataspace_int(t_dataspace *obj, long x)
{
dataspace_float(obj, (double)x);
}
void dataspace_float(t_dataspace *obj, double x)
{
t_atom a[1];
atom_setfloat(a, x);
obj->dataspace->convert(1, a, &obj->ac, &obj->av);
outlet_anything(obj->outlet_native, _sym_float, obj->ac, obj->av);
//outlet_float(obj->outlet_active, x);
}
void dataspace_list(t_dataspace *obj, t_symbol *msg, long argc, t_atom *argv)
{
obj->dataspace->convert(argc, argv, &obj->ac, &obj->av);
outlet_anything(obj->outlet_native, _sym_list, obj->ac, obj->av);
//outlet_anything(obj->outlet_active, _sym_list, argc, argv);
}
void dataspace_getDataspaces(t_dataspace *obj)
{
t_atom a[2];
t_symbol **dataspaceNames = NULL;
long numDataspaces = 0;
long i;
atom_setsym(a+0, gensym("clear"));
object_obex_dumpout(obj, gensym("DataspacesMenu"), 1, a);
jamoma_getDataspaceList(&numDataspaces, &dataspaceNames);
for (i=0; i<numDataspaces; i++) {
atom_setsym(a+0, gensym("append"));
atom_setsym(a+1, dataspaceNames[i]);
object_obex_dumpout(obj, gensym("DataspacesMenu"), 2, a);
}
if (numDataspaces)
sysmem_freeptr(dataspaceNames);
}
void dataspace_getUnits(t_dataspace *obj)
{
t_atom a[2];
t_symbol **unitNames = NULL;
long numUnits = 0;
long i;
atom_setsym(a+0, gensym("clear"));
object_obex_dumpout(obj, gensym("UnitMenu"), 1, a);
obj->dataspace->getAvailableUnits(&numUnits, &unitNames);
for (i=0; i<numUnits; i++) {
atom_setsym(a+0, gensym("append"));
atom_setsym(a+1, unitNames[i]);
object_obex_dumpout(obj, gensym("UnitMenu"), 2, a);
}
if (numUnits)
sysmem_freeptr(unitNames);
}
// ATTRIBUTE:
t_max_err dataspace_setDataspace(t_dataspace *obj, void *attr, long argc, t_atom *argv)
{
obj->attr_dataspace = atom_getsym(argv);
jamoma_getDataspace(obj->attr_dataspace, &obj->dataspace);
obj->attr_dataspace_active = obj->dataspace->neutralUnit;
obj->attr_dataspace_native = obj->dataspace->neutralUnit;
return MAX_ERR_NONE;
}
// ATTRIBUTE:
t_max_err dataspace_setDataspaceActive(t_dataspace *obj, void *attr, long argc, t_atom *argv)
{
obj->attr_dataspace_active = atom_getsym(argv);
obj->dataspace->setInputUnit(obj->attr_dataspace_active);
return MAX_ERR_NONE;
}
// ATTRIBUTE:
t_max_err dataspace_setDataspaceNative(t_dataspace *obj, void *attr, long argc, t_atom *argv)
{
obj->attr_dataspace_native = atom_getsym(argv);
obj->dataspace->setOutputUnit(obj->attr_dataspace_native);
return MAX_ERR_NONE;
}
<commit_msg>Adding pragma marks for simplified navigation in Xcode<commit_after>/*
* jcom.dataspace
* External for Jamoma: map input to output: y=f(x)
* Copyright © 2007
*
* License: This code is licensed under the terms of the "New BSD License"
* http://creativecommons.org/licenses/BSD/
*/
#include "Jamoma.h"
// Data Structure for this object
typedef struct _dataspace{
t_object ob;
//void *outlet_active;
void *outlet_native;
DataspaceLib *dataspace;
long ac; // for return values from the dataspace conversion
t_atom *av; // ...
t_symbol *attr_dataspace; // name of the dataspace -- e.g. "temperature"
t_symbol *attr_dataspace_active; // name of the current unit within the dataspace -- e.g. "celsius"
t_symbol *attr_dataspace_native; // name of the desired native unit within the dataspace -- e.g. "celsius"
} t_dataspace;
// Prototypes for methods
void* dataspace_new(t_symbol *name, long argc, t_atom *argv);
void dataspace_free(t_dataspace *obj);
void dataspace_assist(t_dataspace *obj, void *b, long m, long a, char *s);
void dataspace_int(t_dataspace *obj, long x);
void dataspace_float(t_dataspace *obj, double x);
void dataspace_list(t_dataspace *obj, t_symbol *msg, long argc, t_atom *argv);
void dataspace_getDataspaces(t_dataspace *obj);
void dataspace_getUnits(t_dataspace *obj);
t_max_err dataspace_setDataspace(t_dataspace *obj, void *attr, long argc, t_atom *argv);
t_max_err dataspace_setDataspaceActive(t_dataspace *obj, void *attr, long argc, t_atom *argv);
t_max_err dataspace_setDataspaceNative(t_dataspace *obj, void *attr, long argc, t_atom *argv);
// Globals
t_class *dataspace_class;
#pragma mark -
#pragma mark main
/************************************************************************************/
// Main() Function
int JAMOMA_EXPORT_MAXOBJ main(void)
{
t_class *c;
jamoma_init();
common_symbols_init();
// Define our class
c = class_new("jcom.dataspace",(method)dataspace_new, (method)dataspace_free, sizeof(t_dataspace), (method)0L, A_GIMME, 0);
// Make methods accessible for our class:
class_addmethod(c, (method)dataspace_int, "int", A_GIMME, 0);
class_addmethod(c, (method)dataspace_float, "float", A_GIMME, 0);
class_addmethod(c, (method)dataspace_list, "list", A_GIMME, 0);
class_addmethod(c, (method)dataspace_getDataspaces, "dataspaces.get", 0);
class_addmethod(c, (method)dataspace_getUnits, "units.get", A_GIMME, 0);
class_addmethod(c, (method)dataspace_assist, "assist", A_CANT, 0);
class_addmethod(c, (method)object_obex_dumpout, "dumpout", A_CANT, 0);
class_addattr(c,
attr_offset_new("dataspace", _sym_symbol, 0,
(method)0, (method)dataspace_setDataspace, calcoffset(t_dataspace, attr_dataspace)));
/*
class_addattr(c,
attr_offset_new("unit.active", _sym_symbol, 0,
(method)0, (method)dataspace_setDataspaceActive, calcoffset(t_dataspace, attr_dataspace_active)));
class_addattr(c,
attr_offset_new("unit.native", _sym_symbol, 0,
(method)0, (method)dataspace_setDataspaceNative, calcoffset(t_dataspace, attr_dataspace_native)));
*/
CLASS_ATTR_SYM(c, "input", 0, t_dataspace, attr_dataspace_active);
CLASS_ATTR_ACCESSORS(c, "input", NULL, dataspace_setDataspaceActive);
CLASS_ATTR_SYM(c, "output", 0, t_dataspace, attr_dataspace_native);
CLASS_ATTR_ACCESSORS(c, "output", NULL, dataspace_setDataspaceNative);
// Finalize our class
class_register(CLASS_BOX, c);
dataspace_class = c;
return 0;
}
#pragma mark -
#pragma mark life cycle
/************************************************************************************/
// Object Life
void *dataspace_new(t_symbol *name, long argc, t_atom *argv)
{
t_dataspace *obj; // Declare an object (based on our struct)
obj = (t_dataspace *)object_alloc(dataspace_class); // Create object, store pointer to it (get 1 inlet free)
if (obj) {
object_obex_store((void *)obj, _sym_dumpout, (object *)outlet_new(obj,NULL));
//obj->outlet_active = outlet_new(obj, 0);
obj->outlet_native = outlet_new(obj, 0);
obj->dataspace = NULL;
obj->attr_dataspace_active = _sym_nothing;
obj->attr_dataspace_native = _sym_nothing;
attr_args_process(obj, argc, argv);
if (!obj->dataspace)
object_attr_setsym(obj, gensym("dataspace"), gensym("temperature"));
obj->av = (t_atom*)sysmem_newptr(sizeof(t_atom) * 3); // just allocating three for now -- limited list support
}
return obj; // Return pointer to our instance
}
void dataspace_free(t_dataspace *obj)
{
sysmem_freeptr(obj->av);
if (obj->dataspace)
delete obj->dataspace;
}
#pragma mark -
#pragma mark methods
/************************************************************************************/
// Methods bound to input/inlets
// Method for Assistance Messages
void dataspace_assist(t_dataspace *x, void *b, long msg, long arg, char *dst)
{
if (msg==1) // Inlets
strcpy(dst, "x");
else if (msg==2) { // Outlets
switch(arg) {
case 0: strcpy(dst, "y=f(x)"); break;
default: strcpy(dst, "dumpout"); break;
}
}
}
void dataspace_int(t_dataspace *obj, long x)
{
dataspace_float(obj, (double)x);
}
void dataspace_float(t_dataspace *obj, double x)
{
t_atom a[1];
atom_setfloat(a, x);
obj->dataspace->convert(1, a, &obj->ac, &obj->av);
outlet_anything(obj->outlet_native, _sym_float, obj->ac, obj->av);
//outlet_float(obj->outlet_active, x);
}
void dataspace_list(t_dataspace *obj, t_symbol *msg, long argc, t_atom *argv)
{
obj->dataspace->convert(argc, argv, &obj->ac, &obj->av);
outlet_anything(obj->outlet_native, _sym_list, obj->ac, obj->av);
//outlet_anything(obj->outlet_active, _sym_list, argc, argv);
}
void dataspace_getDataspaces(t_dataspace *obj)
{
t_atom a[2];
t_symbol **dataspaceNames = NULL;
long numDataspaces = 0;
long i;
atom_setsym(a+0, gensym("clear"));
object_obex_dumpout(obj, gensym("DataspacesMenu"), 1, a);
jamoma_getDataspaceList(&numDataspaces, &dataspaceNames);
for (i=0; i<numDataspaces; i++) {
atom_setsym(a+0, gensym("append"));
atom_setsym(a+1, dataspaceNames[i]);
object_obex_dumpout(obj, gensym("DataspacesMenu"), 2, a);
}
if (numDataspaces)
sysmem_freeptr(dataspaceNames);
}
void dataspace_getUnits(t_dataspace *obj)
{
t_atom a[2];
t_symbol **unitNames = NULL;
long numUnits = 0;
long i;
atom_setsym(a+0, gensym("clear"));
object_obex_dumpout(obj, gensym("UnitMenu"), 1, a);
obj->dataspace->getAvailableUnits(&numUnits, &unitNames);
for (i=0; i<numUnits; i++) {
atom_setsym(a+0, gensym("append"));
atom_setsym(a+1, unitNames[i]);
object_obex_dumpout(obj, gensym("UnitMenu"), 2, a);
}
if (numUnits)
sysmem_freeptr(unitNames);
}
#pragma mark -
#pragma mark attributes
// ATTRIBUTE:
t_max_err dataspace_setDataspace(t_dataspace *obj, void *attr, long argc, t_atom *argv)
{
obj->attr_dataspace = atom_getsym(argv);
jamoma_getDataspace(obj->attr_dataspace, &obj->dataspace);
obj->attr_dataspace_active = obj->dataspace->neutralUnit;
obj->attr_dataspace_native = obj->dataspace->neutralUnit;
return MAX_ERR_NONE;
}
// ATTRIBUTE:
t_max_err dataspace_setDataspaceActive(t_dataspace *obj, void *attr, long argc, t_atom *argv)
{
obj->attr_dataspace_active = atom_getsym(argv);
obj->dataspace->setInputUnit(obj->attr_dataspace_active);
return MAX_ERR_NONE;
}
// ATTRIBUTE:
t_max_err dataspace_setDataspaceNative(t_dataspace *obj, void *attr, long argc, t_atom *argv)
{
obj->attr_dataspace_native = atom_getsym(argv);
obj->dataspace->setOutputUnit(obj->attr_dataspace_native);
return MAX_ERR_NONE;
}
<|endoftext|>
|
<commit_before>/*********************************************************************************
* Copyright (c) 2014 David D. Marshall <ddmarsha@calpoly.edu>
*
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors:
* David D. Marshall - initial code and implementation
********************************************************************************/
#ifndef eli_geom_curve_piecewise_cst_airfoil_creator_hpp
#define eli_geom_curve_piecewise_cst_airfoil_creator_hpp
#include <vector>
#include "eli/code_eli.hpp"
#include "eli/geom/curve/piecewise.hpp"
#include "eli/geom/curve/piecewise_creator_base.hpp"
#include "eli/geom/curve/bezier.hpp"
#include "eli/geom/curve/piecewise_polynomial_creator.hpp"
#include "eli/geom/curve/pseudo/cst_airfoil.hpp"
namespace eli
{
namespace geom
{
namespace curve
{
template<typename data__, unsigned short dim__, typename tol__>
class piecewise_cst_airfoil_creator : public piecewise_creator_base<data__, dim__, tol__>
{
public:
typedef piecewise_creator_base<data__, dim__, tol__> base_class_type;
typedef typename base_class_type::data_type data_type;
typedef typename base_class_type::point_type point_type;
typedef typename base_class_type::index_type index_type;
typedef typename base_class_type::tolerance_type tolerance_type;
typedef eli::geom::curve::pseudo::cst_airfoil<data_type> cst_airfoil_type;
typedef typename cst_airfoil_type::point_type cst_airfoil_point_type;
typedef typename cst_airfoil_type::control_point_type cst_airfoil_control_point_type;
typedef unsigned short dimension_type;
piecewise_cst_airfoil_creator() : piecewise_creator_base<data_type, dim__, tolerance_type>(2, 0), cst(1) {}
piecewise_cst_airfoil_creator(const piecewise_cst_airfoil_creator<data_type, dim__, tolerance_type> &pca)
: piecewise_creator_base<data_type, dim__, tolerance_type>(pca), cst(pca.cst) {}
~piecewise_cst_airfoil_creator() {}
void set_airfoil(const cst_airfoil_type &ca)
{
cst = ca;
}
void get_airfoil(cst_airfoil_type &ca) const
{
ca = cst;
}
bool set_conditions(const cst_airfoil_type &ca)
{
set_airfoil(ca);
return true;
}
/** This method creates an exact bezier representation of a CST airfoil upper and
* lower surface. It uses the method from "Creating Exact Bezier Representations of CST
* Shapes" by Marshall, AIAA paper 2013-3077.
*/
virtual bool create(piecewise<bezier, data_type, dim__, tolerance_type> &pc) const
{
typedef piecewise<bezier, data_type, dim__, tolerance_type> piecewise_curve_type;
typedef typename piecewise_curve_type::curve_type curve_type;
typename curve_type::monomial_coefficient_type bezu_mono_coef, bezl_mono_coef;
typename cst_airfoil_type::monomial_coefficient_type cstu_mono_coef, cstl_mono_coef;
// extract the monomial coefficients from the CST airfoil
cst.get_upper_monomial_coefficients(cstu_mono_coef);
cst.get_lower_monomial_coefficients(cstl_mono_coef);
// convert the original coefficients to new monomial coefficients
index_type i, nu(cstu_mono_coef.rows()-1), nl(cstl_mono_coef.rows()-1);
data_type dte_upper(cst.get_upper_trailing_edge_thickness()), dte_lower(cst.get_lower_trailing_edge_thickness());
bezu_mono_coef.resize(2*nu+3+1, dim__);
bezl_mono_coef.resize(2*nl+3+1, dim__);
bezu_mono_coef.setZero();
bezl_mono_coef.setZero();
// upper
i=0;
bezu_mono_coef(2*i+1, 1)=cstu_mono_coef(i, 0);
bezu_mono_coef(2*i+2, 0)=1;
bezu_mono_coef(2*i+2, 1)=dte_upper;
for (i=1; i<=nu; ++i)
{
bezu_mono_coef(2*i+1, 1)=cstu_mono_coef(i, 0)-cstu_mono_coef(i-1, 0);
}
i=nu+1;
bezu_mono_coef(2*i+1, 1)=-cstu_mono_coef(i-1);
// lower
i=0;
bezl_mono_coef(2*i+1, 1)=cstl_mono_coef(i, 0);
bezl_mono_coef(2*i+2, 0)=1;
bezl_mono_coef(2*i+2, 1)=-dte_lower;
for (i=1; i<=nu; ++i)
{
bezl_mono_coef(2*i+1, 1)=cstl_mono_coef(i, 0)-cstl_mono_coef(i-1, 0);
}
i=nu+1;
bezl_mono_coef(2*i+1, 1)=-cstl_mono_coef(i-1);
// create the lower and upper curve
piecewise_polynomial_creator<data_type, dim__, tolerance_type> poly_creator;
pseudo::polynomial<data__, dim__> cu, cl;
bool rtn_flag;
for (dimension_type j=0; j<dim__; ++j)
{
cu.set_coefficients(bezu_mono_coef.col(j), j);
cl.set_coefficients(bezl_mono_coef.col(j), j);
}
// lower
rtn_flag=poly_creator.set_conditions(cl);
if (!rtn_flag)
{
assert(false);
return false;
}
poly_creator.set_t0(this->get_t0());
poly_creator.set_segment_dt(this->get_segment_dt(0), 0);
rtn_flag=poly_creator.create(pc);
if (!rtn_flag)
{
assert(false);
return false;
}
pc.reverse();
// upper
piecewise_curve_type pc_temp;
rtn_flag=poly_creator.set_conditions(cu);
if (!rtn_flag)
{
assert(false);
return false;
}
poly_creator.set_t0(this->get_t0()+this->get_segment_dt(0));
poly_creator.set_segment_dt(this->get_segment_dt(1), 0);
rtn_flag=poly_creator.create(pc_temp);
if (!rtn_flag)
{
assert(false);
return false;
}
pc.push_back(pc_temp);
return true;
}
private:
cst_airfoil_type cst;
};
}
}
}
#endif
<commit_msg>Fixed bug with creating CST airfoil with different degrees for upper and lower curves<commit_after>/*********************************************************************************
* Copyright (c) 2014 David D. Marshall <ddmarsha@calpoly.edu>
*
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors:
* David D. Marshall - initial code and implementation
********************************************************************************/
#ifndef eli_geom_curve_piecewise_cst_airfoil_creator_hpp
#define eli_geom_curve_piecewise_cst_airfoil_creator_hpp
#include <vector>
#include "eli/code_eli.hpp"
#include "eli/geom/curve/piecewise.hpp"
#include "eli/geom/curve/piecewise_creator_base.hpp"
#include "eli/geom/curve/bezier.hpp"
#include "eli/geom/curve/piecewise_polynomial_creator.hpp"
#include "eli/geom/curve/pseudo/cst_airfoil.hpp"
namespace eli
{
namespace geom
{
namespace curve
{
template<typename data__, unsigned short dim__, typename tol__>
class piecewise_cst_airfoil_creator : public piecewise_creator_base<data__, dim__, tol__>
{
public:
typedef piecewise_creator_base<data__, dim__, tol__> base_class_type;
typedef typename base_class_type::data_type data_type;
typedef typename base_class_type::point_type point_type;
typedef typename base_class_type::index_type index_type;
typedef typename base_class_type::tolerance_type tolerance_type;
typedef eli::geom::curve::pseudo::cst_airfoil<data_type> cst_airfoil_type;
typedef typename cst_airfoil_type::point_type cst_airfoil_point_type;
typedef typename cst_airfoil_type::control_point_type cst_airfoil_control_point_type;
typedef unsigned short dimension_type;
piecewise_cst_airfoil_creator() : piecewise_creator_base<data_type, dim__, tolerance_type>(2, 0), cst(1) {}
piecewise_cst_airfoil_creator(const piecewise_cst_airfoil_creator<data_type, dim__, tolerance_type> &pca)
: piecewise_creator_base<data_type, dim__, tolerance_type>(pca), cst(pca.cst) {}
~piecewise_cst_airfoil_creator() {}
void set_airfoil(const cst_airfoil_type &ca)
{
cst = ca;
}
void get_airfoil(cst_airfoil_type &ca) const
{
ca = cst;
}
bool set_conditions(const cst_airfoil_type &ca)
{
set_airfoil(ca);
return true;
}
/** This method creates an exact bezier representation of a CST airfoil upper and
* lower surface. It uses the method from "Creating Exact Bezier Representations of CST
* Shapes" by Marshall, AIAA paper 2013-3077.
*/
virtual bool create(piecewise<bezier, data_type, dim__, tolerance_type> &pc) const
{
typedef piecewise<bezier, data_type, dim__, tolerance_type> piecewise_curve_type;
typedef typename piecewise_curve_type::curve_type curve_type;
typename curve_type::monomial_coefficient_type bezu_mono_coef, bezl_mono_coef;
typename cst_airfoil_type::monomial_coefficient_type cstu_mono_coef, cstl_mono_coef;
// extract the monomial coefficients from the CST airfoil
cst.get_upper_monomial_coefficients(cstu_mono_coef);
cst.get_lower_monomial_coefficients(cstl_mono_coef);
// convert the original coefficients to new monomial coefficients
index_type i, nu(cstu_mono_coef.rows()-1), nl(cstl_mono_coef.rows()-1);
data_type dte_upper(cst.get_upper_trailing_edge_thickness()), dte_lower(cst.get_lower_trailing_edge_thickness());
bezu_mono_coef.resize(2*nu+3+1, dim__);
bezl_mono_coef.resize(2*nl+3+1, dim__);
bezu_mono_coef.setZero();
bezl_mono_coef.setZero();
// upper
i=0;
bezu_mono_coef(2*i+1, 1)=cstu_mono_coef(i, 0);
bezu_mono_coef(2*i+2, 0)=1;
bezu_mono_coef(2*i+2, 1)=dte_upper;
for (i=1; i<=nu; ++i)
{
bezu_mono_coef(2*i+1, 1)=cstu_mono_coef(i, 0)-cstu_mono_coef(i-1, 0);
}
i=nu+1;
bezu_mono_coef(2*i+1, 1)=-cstu_mono_coef(i-1);
// lower
i=0;
bezl_mono_coef(2*i+1, 1)=cstl_mono_coef(i, 0);
bezl_mono_coef(2*i+2, 0)=1;
bezl_mono_coef(2*i+2, 1)=-dte_lower;
for (i=1; i<=nl; ++i)
{
bezl_mono_coef(2*i+1, 1)=cstl_mono_coef(i, 0)-cstl_mono_coef(i-1, 0);
}
i=nl+1;
bezl_mono_coef(2*i+1, 1)=-cstl_mono_coef(i-1);
// create the lower and upper curve
piecewise_polynomial_creator<data_type, dim__, tolerance_type> poly_creator;
pseudo::polynomial<data__, dim__> cu, cl;
bool rtn_flag;
for (dimension_type j=0; j<dim__; ++j)
{
cu.set_coefficients(bezu_mono_coef.col(j), j);
cl.set_coefficients(bezl_mono_coef.col(j), j);
}
// lower
rtn_flag=poly_creator.set_conditions(cl);
if (!rtn_flag)
{
assert(false);
return false;
}
poly_creator.set_t0(this->get_t0());
poly_creator.set_segment_dt(this->get_segment_dt(0), 0);
rtn_flag=poly_creator.create(pc);
if (!rtn_flag)
{
assert(false);
return false;
}
pc.reverse();
// upper
piecewise_curve_type pc_temp;
rtn_flag=poly_creator.set_conditions(cu);
if (!rtn_flag)
{
assert(false);
return false;
}
poly_creator.set_t0(this->get_t0()+this->get_segment_dt(0));
poly_creator.set_segment_dt(this->get_segment_dt(1), 0);
rtn_flag=poly_creator.create(pc_temp);
if (!rtn_flag)
{
assert(false);
return false;
}
pc.push_back(pc_temp);
return true;
}
private:
cst_airfoil_type cst;
};
}
}
}
#endif
<|endoftext|>
|
<commit_before><commit_msg>Fixed a segfault bug that is revealed only when resizing an empty ListBox to a very small size<commit_after><|endoftext|>
|
<commit_before>#include "stactive_record.h"
using namespace stactiverecord;
using namespace std;
Sar_Dbi * Sar_Dbi::dbi;
/**
This is an example of a one to one object relationship. A lock has a single key and a key fits
a single lock. The class definitions are more complicated than they need to be - this is
just a typical situation.
**/
// forward declaration of Key.
class Key;
class Lock : public Record<Lock> {
public:
static string classname;
string name;
Key * key;
Lock() : Record<Lock>() { init(); };
Lock(int id) : Record<Lock>(id) { init(); };
void init() {
get("name", name, "Unknown");
if(isset<Key>())
getOne<Key>(*key);
};
void save() {
set("name", name);
// if key variable has been set
if(key->has_been_saved())
setOne<Key>(*key);
Record<Lock>::save();
};
void update() {
Record<Lock>::update();
init();
};
};
string Lock::classname = "lock";
class Key : public Record<Key> {
public:
static string classname;
string name;
Lock lock;
Key() : Record<Key>() { init(); };
Key(int id) : Record<Key>(id) { init(); };
void init() {
get("name", name, "Unknown");
if(isset<Lock>())
getOne<Lock>(lock);
};
void save() {
set("name", name);
// if teacher variable has been set
if(lock.has_been_saved())
setOne<Lock>(lock);
Record<Key>::save();
};
void update() {
Record<Key>::update();
init();
};
};
string Key::classname = "key";
int main(int argc, char* argv[]) {
if(argc != 2) {
std::cout << "Usage: ./one_to_many <scheme://[user[:password]@host[:port]/]database>\n";
return 1;
}
Sar_Dbi::dbi = Sar_Dbi::makeStorage(std::string(argv[1]));
Key key;
key.name = "The Key";
key.save();
Lock lock;
lock.name = "The Lock";
lock.key = key;
lock.save;
key.update();
cout << "The lock for " << key.name << " is " << key.lock.name << "\n";
delete Sar_Dbi::dbi;
return 0;
};
<commit_msg>finished one_to_one<commit_after>#include "stactive_record.h"
using namespace stactiverecord;
using namespace std;
Sar_Dbi * Sar_Dbi::dbi;
/**
This is an example of a one to one object relationship. A lock has a single key and a key fits
a single lock.
**/
class Lock : public Record<Lock> {
public:
Lock() : Record<Lock>() {};
Lock(int id) : Record<Lock>(id) {};
static string classname;
};
string Lock::classname = "lock";
class Key : public Record<Key> {
public:
Key() : Record<Key>() {};
Key(int id) : Record<Key>(id) {};
static string classname;
};
string Key::classname = "key";
int main(int argc, char* argv[]) {
if(argc != 2) {
std::cout << "Usage: ./one_to_many <scheme://[user[:password]@host[:port]/]database>\n";
return 1;
}
Sar_Dbi::dbi = Sar_Dbi::makeStorage(std::string(argv[1]));
Key key;
key.set("name", "The Key");
key.save();
Lock lock;
lock.set("name", "The Lock");
lock.setOne<Key>(key);
lock.save();
Key dbkey(key.id);
string key_name, lock_name;
dbkey.get("name", key_name);
Lock dblock;
dbkey.getOne<Lock>(dblock);
dblock.get("name", lock_name);
cout << "The lock for " << key_name << " is " << lock_name << "\n";
delete Sar_Dbi::dbi;
return 0;
};
<|endoftext|>
|
<commit_before><commit_msg>fixed layout for openwindow when you open from new<commit_after><|endoftext|>
|
<commit_before><commit_msg>Patch from Todd Whiteman to show brace highlight background over caret line background.<commit_after><|endoftext|>
|
<commit_before>// 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 "webkit/glue/glue_serialize.h"
#include <string>
#include "base/pickle.h"
#include "base/utf_string_conversions.h"
#include "googleurl/src/gurl.h"
#include "third_party/WebKit/WebKit/chromium/public/WebData.h"
#include "third_party/WebKit/WebKit/chromium/public/WebHistoryItem.h"
#include "third_party/WebKit/WebKit/chromium/public/WebHTTPBody.h"
#include "third_party/WebKit/WebKit/chromium/public/WebPoint.h"
#include "third_party/WebKit/WebKit/chromium/public/WebString.h"
#include "third_party/WebKit/WebKit/chromium/public/WebVector.h"
#include "webkit/glue/webkit_glue.h"
using WebKit::WebData;
using WebKit::WebHistoryItem;
using WebKit::WebHTTPBody;
using WebKit::WebPoint;
using WebKit::WebString;
using WebKit::WebUChar;
using WebKit::WebVector;
namespace webkit_glue {
struct SerializeObject {
SerializeObject() : iter(NULL) {}
SerializeObject(const char* data, int len) : pickle(data, len), iter(NULL) {}
std::string GetAsString() {
return std::string(static_cast<const char*>(pickle.data()), pickle.size());
}
Pickle pickle;
mutable void* iter;
mutable int version;
};
// TODO(mpcomplete): obsolete versions 1 and 2 after 1/1/2008.
// Version ID used in reading/writing history items.
// 1: Initial revision.
// 2: Added case for NULL string versus "". Version 2 code can read Version 1
// data, but not vice versa.
// 3: Version 2 was broken, it stored number of WebUChars, not number of bytes.
// This version checks and reads v1 and v2 correctly.
// 4: Adds support for storing FormData::identifier().
// 5: Adds support for empty FormData
// 6: Adds support for documentSequenceNumbers
// Should be const, but unit tests may modify it.
int kVersion = 6;
// A bunch of convenience functions to read/write to SerializeObjects.
// The serializers assume the input data is in the correct format and so does
// no error checking.
inline void WriteData(const void* data, int length, SerializeObject* obj) {
obj->pickle.WriteData(static_cast<const char*>(data), length);
}
inline void ReadData(const SerializeObject* obj, const void** data,
int* length) {
const char* tmp = NULL;
obj->pickle.ReadData(&obj->iter, &tmp, length);
*data = tmp;
}
inline bool ReadBytes(const SerializeObject* obj, const void** data,
int length) {
const char *tmp;
if (!obj->pickle.ReadBytes(&obj->iter, &tmp, length))
return false;
*data = tmp;
return true;
}
inline void WriteInteger(int data, SerializeObject* obj) {
obj->pickle.WriteInt(data);
}
inline int ReadInteger(const SerializeObject* obj) {
int tmp = 0;
obj->pickle.ReadInt(&obj->iter, &tmp);
return tmp;
}
inline void WriteInteger64(int64 data, SerializeObject* obj) {
obj->pickle.WriteInt64(data);
}
inline int64 ReadInteger64(const SerializeObject* obj) {
int64 tmp = 0;
obj->pickle.ReadInt64(&obj->iter, &tmp);
return tmp;
}
inline void WriteReal(double data, SerializeObject* obj) {
WriteData(&data, sizeof(double), obj);
}
inline double ReadReal(const SerializeObject* obj) {
const void* tmp;
int length = 0;
ReadData(obj, &tmp, &length);
if (length > 0 && length >= static_cast<int>(sizeof(0.0)))
return *static_cast<const double*>(tmp);
else
return 0.0;
}
inline void WriteBoolean(bool data, SerializeObject* obj) {
obj->pickle.WriteInt(data ? 1 : 0);
}
inline bool ReadBoolean(const SerializeObject* obj) {
bool tmp = false;
obj->pickle.ReadBool(&obj->iter, &tmp);
return tmp;
}
// Read/WriteString pickle the WebString as <int length><WebUChar* data>.
// If length == -1, then the WebString itself is NULL (WebString()).
// Otherwise the length is the number of WebUChars (not bytes) in the WebString.
inline void WriteString(const WebString& str, SerializeObject* obj) {
switch (kVersion) {
case 1:
// Version 1 writes <length in bytes><string data>.
// It saves WebString() and "" as "".
obj->pickle.WriteInt(str.length() * sizeof(WebUChar));
obj->pickle.WriteBytes(str.data(), str.length() * sizeof(WebUChar));
break;
case 2:
// Version 2 writes <length in WebUChar><string data>.
// It uses -1 in the length field to mean WebString().
if (str.isNull()) {
obj->pickle.WriteInt(-1);
} else {
obj->pickle.WriteInt(str.length());
obj->pickle.WriteBytes(str.data(),
str.length() * sizeof(WebUChar));
}
break;
default:
// Version 3+ writes <length in bytes><string data>.
// It uses -1 in the length field to mean WebString().
if (str.isNull()) {
obj->pickle.WriteInt(-1);
} else {
obj->pickle.WriteInt(str.length() * sizeof(WebUChar));
obj->pickle.WriteBytes(str.data(),
str.length() * sizeof(WebUChar));
}
break;
}
}
// This reads a serialized WebString from obj. If a string can't be read,
// WebString() is returned.
inline WebString ReadString(const SerializeObject* obj) {
int length;
// Versions 1, 2, and 3 all start with an integer.
if (!obj->pickle.ReadInt(&obj->iter, &length))
return WebString();
// Starting with version 2, -1 means WebString().
if (length == -1)
return WebString();
// In version 2, the length field was the length in WebUChars.
// In version 1 and 3 it is the length in bytes.
int bytes = ((obj->version == 2) ? length * sizeof(WebUChar) : length);
const void* data;
if (!ReadBytes(obj, &data, bytes))
return WebString();
return WebString(static_cast<const WebUChar*>(data), bytes / sizeof(WebUChar));
}
// Writes a Vector of Strings into a SerializeObject for serialization.
static void WriteStringVector(
const WebVector<WebString>& data, SerializeObject* obj) {
WriteInteger(static_cast<int>(data.size()), obj);
for (size_t i = 0, c = data.size(); i < c; ++i) {
unsigned ui = static_cast<unsigned>(i); // sigh
WriteString(data[ui], obj);
}
}
static WebVector<WebString> ReadStringVector(const SerializeObject* obj) {
int num_elements = ReadInteger(obj);
WebVector<WebString> result(static_cast<size_t>(num_elements));
for (int i = 0; i < num_elements; ++i)
result[i] = ReadString(obj);
return result;
}
// Writes a FormData object into a SerializeObject for serialization.
static void WriteFormData(const WebHTTPBody& http_body, SerializeObject* obj) {
WriteBoolean(!http_body.isNull(), obj);
if (http_body.isNull())
return;
WriteInteger(static_cast<int>(http_body.elementCount()), obj);
WebHTTPBody::Element element;
for (size_t i = 0; http_body.elementAt(i, element); ++i) {
WriteInteger(element.type, obj);
if (element.type == WebHTTPBody::Element::TypeData) {
WriteData(element.data.data(), static_cast<int>(element.data.size()),
obj);
} else {
WriteString(element.filePath, obj);
}
}
WriteInteger64(http_body.identifier(), obj);
}
static WebHTTPBody ReadFormData(const SerializeObject* obj) {
// In newer versions, an initial boolean indicates if we have form data.
if (obj->version >= 5 && !ReadBoolean(obj))
return WebHTTPBody();
// In older versions, 0 elements implied no form data.
int num_elements = ReadInteger(obj);
if (num_elements == 0 && obj->version < 5)
return WebHTTPBody();
WebHTTPBody http_body;
http_body.initialize();
for (int i = 0; i < num_elements; ++i) {
int type = ReadInteger(obj);
if (type == WebHTTPBody::Element::TypeData) {
const void* data;
int length = -1;
ReadData(obj, &data, &length);
if (length >= 0)
http_body.appendData(WebData(static_cast<const char*>(data), length));
} else {
http_body.appendFile(ReadString(obj));
}
}
if (obj->version >= 4)
http_body.setIdentifier(ReadInteger64(obj));
return http_body;
}
// Writes the HistoryItem data into the SerializeObject object for
// serialization.
static void WriteHistoryItem(
const WebHistoryItem& item, SerializeObject* obj) {
// WARNING: This data may be persisted for later use. As such, care must be
// taken when changing the serialized format. If a new field needs to be
// written, only adding at the end will make it easier to deal with loading
// older versions. Similarly, this should NOT save fields with sensitive
// data, such as password fields.
WriteInteger(kVersion, obj);
WriteString(item.urlString(), obj);
WriteString(item.originalURLString(), obj);
WriteString(item.target(), obj);
WriteString(item.parent(), obj);
WriteString(item.title(), obj);
WriteString(item.alternateTitle(), obj);
WriteReal(item.lastVisitedTime(), obj);
WriteInteger(item.scrollOffset().x, obj);
WriteInteger(item.scrollOffset().y, obj);
WriteBoolean(item.isTargetItem(), obj);
WriteInteger(item.visitCount(), obj);
WriteString(item.referrer(), obj);
WriteStringVector(item.documentState(), obj);
WriteInteger64(item.documentSequenceNumber(), obj);
// Yes, the referrer is written twice. This is for backwards
// compatibility with the format.
WriteFormData(item.httpBody(), obj);
WriteString(item.httpContentType(), obj);
WriteString(item.referrer(), obj);
// Subitems
const WebVector<WebHistoryItem>& children = item.children();
WriteInteger(static_cast<int>(children.size()), obj);
for (size_t i = 0, c = children.size(); i < c; ++i)
WriteHistoryItem(children[i], obj);
}
// Creates a new HistoryItem tree based on the serialized string.
// Assumes the data is in the format returned by WriteHistoryItem.
static WebHistoryItem ReadHistoryItem(
const SerializeObject* obj, bool include_form_data) {
// See note in WriteHistoryItem. on this.
obj->version = ReadInteger(obj);
if (obj->version > kVersion || obj->version < 1)
return WebHistoryItem();
WebHistoryItem item;
item.initialize();
item.setURLString(ReadString(obj));
item.setOriginalURLString(ReadString(obj));
item.setTarget(ReadString(obj));
item.setParent(ReadString(obj));
item.setTitle(ReadString(obj));
item.setAlternateTitle(ReadString(obj));
item.setLastVisitedTime(ReadReal(obj));
int x = ReadInteger(obj);
int y = ReadInteger(obj);
item.setScrollOffset(WebPoint(x, y));
item.setIsTargetItem(ReadBoolean(obj));
item.setVisitCount(ReadInteger(obj));
item.setReferrer(ReadString(obj));
item.setDocumentState(ReadStringVector(obj));
if (obj->version >= 6)
item.setDocumentSequenceNumber(ReadInteger64(obj));
// The extra referrer string is read for backwards compat.
const WebHTTPBody& http_body = ReadFormData(obj);
const WebString& http_content_type = ReadString(obj);
ALLOW_UNUSED const WebString& unused_referrer = ReadString(obj);
if (include_form_data) {
item.setHTTPBody(http_body);
item.setHTTPContentType(http_content_type);
}
// Subitems
int num_children = ReadInteger(obj);
for (int i = 0; i < num_children; ++i)
item.appendToChildren(ReadHistoryItem(obj, include_form_data));
return item;
}
// Serialize a HistoryItem to a string, using our JSON Value serializer.
std::string HistoryItemToString(const WebHistoryItem& item) {
if (item.isNull())
return std::string();
SerializeObject obj;
WriteHistoryItem(item, &obj);
return obj.GetAsString();
}
// Reconstruct a HistoryItem from a string, using our JSON Value deserializer.
// This assumes that the given serialized string has all the required key,value
// pairs, and does minimal error checking. If |include_form_data| is true,
// the form data from a post is restored, otherwise the form data is empty.
static WebHistoryItem HistoryItemFromString(
const std::string& serialized_item,
bool include_form_data) {
if (serialized_item.empty())
return WebHistoryItem();
SerializeObject obj(serialized_item.data(),
static_cast<int>(serialized_item.length()));
return ReadHistoryItem(&obj, include_form_data);
}
WebHistoryItem HistoryItemFromString(
const std::string& serialized_item) {
return HistoryItemFromString(serialized_item, true);
}
// For testing purposes only.
void HistoryItemToVersionedString(const WebHistoryItem& item, int version,
std::string* serialized_item) {
if (item.isNull()) {
serialized_item->clear();
return;
}
// Temporarily change the version.
int real_version = kVersion;
kVersion = version;
SerializeObject obj;
WriteHistoryItem(item, &obj);
*serialized_item = obj.GetAsString();
kVersion = real_version;
}
std::string CreateHistoryStateForURL(const GURL& url) {
WebHistoryItem item;
item.initialize();
item.setURLString(UTF8ToUTF16(url.spec()));
return HistoryItemToString(item);
}
std::string RemoveFormDataFromHistoryState(const std::string& content_state) {
const WebHistoryItem& item = HistoryItemFromString(content_state, false);
if (item.isNull()) {
// Couldn't parse the string, return an empty string.
return std::string();
}
return HistoryItemToString(item);
}
} // namespace webkit_glue
<commit_msg>Resolve issues with GlueSerializeTest.BackwardsCompatibleTest by appending the new documentSequenceNumber entry to the end of the pickle.<commit_after>// 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 "webkit/glue/glue_serialize.h"
#include <string>
#include "base/pickle.h"
#include "base/utf_string_conversions.h"
#include "googleurl/src/gurl.h"
#include "third_party/WebKit/WebKit/chromium/public/WebData.h"
#include "third_party/WebKit/WebKit/chromium/public/WebHistoryItem.h"
#include "third_party/WebKit/WebKit/chromium/public/WebHTTPBody.h"
#include "third_party/WebKit/WebKit/chromium/public/WebPoint.h"
#include "third_party/WebKit/WebKit/chromium/public/WebString.h"
#include "third_party/WebKit/WebKit/chromium/public/WebVector.h"
#include "webkit/glue/webkit_glue.h"
using WebKit::WebData;
using WebKit::WebHistoryItem;
using WebKit::WebHTTPBody;
using WebKit::WebPoint;
using WebKit::WebString;
using WebKit::WebUChar;
using WebKit::WebVector;
namespace webkit_glue {
struct SerializeObject {
SerializeObject() : iter(NULL) {}
SerializeObject(const char* data, int len) : pickle(data, len), iter(NULL) {}
std::string GetAsString() {
return std::string(static_cast<const char*>(pickle.data()), pickle.size());
}
Pickle pickle;
mutable void* iter;
mutable int version;
};
// TODO(mpcomplete): obsolete versions 1 and 2 after 1/1/2008.
// Version ID used in reading/writing history items.
// 1: Initial revision.
// 2: Added case for NULL string versus "". Version 2 code can read Version 1
// data, but not vice versa.
// 3: Version 2 was broken, it stored number of WebUChars, not number of bytes.
// This version checks and reads v1 and v2 correctly.
// 4: Adds support for storing FormData::identifier().
// 5: Adds support for empty FormData
// 6: Adds support for documentSequenceNumbers
// Should be const, but unit tests may modify it.
int kVersion = 6;
// A bunch of convenience functions to read/write to SerializeObjects.
// The serializers assume the input data is in the correct format and so does
// no error checking.
inline void WriteData(const void* data, int length, SerializeObject* obj) {
obj->pickle.WriteData(static_cast<const char*>(data), length);
}
inline void ReadData(const SerializeObject* obj, const void** data,
int* length) {
const char* tmp = NULL;
obj->pickle.ReadData(&obj->iter, &tmp, length);
*data = tmp;
}
inline bool ReadBytes(const SerializeObject* obj, const void** data,
int length) {
const char *tmp;
if (!obj->pickle.ReadBytes(&obj->iter, &tmp, length))
return false;
*data = tmp;
return true;
}
inline void WriteInteger(int data, SerializeObject* obj) {
obj->pickle.WriteInt(data);
}
inline int ReadInteger(const SerializeObject* obj) {
int tmp = 0;
obj->pickle.ReadInt(&obj->iter, &tmp);
return tmp;
}
inline void WriteInteger64(int64 data, SerializeObject* obj) {
obj->pickle.WriteInt64(data);
}
inline int64 ReadInteger64(const SerializeObject* obj) {
int64 tmp = 0;
obj->pickle.ReadInt64(&obj->iter, &tmp);
return tmp;
}
inline void WriteReal(double data, SerializeObject* obj) {
WriteData(&data, sizeof(double), obj);
}
inline double ReadReal(const SerializeObject* obj) {
const void* tmp;
int length = 0;
ReadData(obj, &tmp, &length);
if (length > 0 && length >= static_cast<int>(sizeof(0.0)))
return *static_cast<const double*>(tmp);
else
return 0.0;
}
inline void WriteBoolean(bool data, SerializeObject* obj) {
obj->pickle.WriteInt(data ? 1 : 0);
}
inline bool ReadBoolean(const SerializeObject* obj) {
bool tmp = false;
obj->pickle.ReadBool(&obj->iter, &tmp);
return tmp;
}
// Read/WriteString pickle the WebString as <int length><WebUChar* data>.
// If length == -1, then the WebString itself is NULL (WebString()).
// Otherwise the length is the number of WebUChars (not bytes) in the WebString.
inline void WriteString(const WebString& str, SerializeObject* obj) {
switch (kVersion) {
case 1:
// Version 1 writes <length in bytes><string data>.
// It saves WebString() and "" as "".
obj->pickle.WriteInt(str.length() * sizeof(WebUChar));
obj->pickle.WriteBytes(str.data(), str.length() * sizeof(WebUChar));
break;
case 2:
// Version 2 writes <length in WebUChar><string data>.
// It uses -1 in the length field to mean WebString().
if (str.isNull()) {
obj->pickle.WriteInt(-1);
} else {
obj->pickle.WriteInt(str.length());
obj->pickle.WriteBytes(str.data(),
str.length() * sizeof(WebUChar));
}
break;
default:
// Version 3+ writes <length in bytes><string data>.
// It uses -1 in the length field to mean WebString().
if (str.isNull()) {
obj->pickle.WriteInt(-1);
} else {
obj->pickle.WriteInt(str.length() * sizeof(WebUChar));
obj->pickle.WriteBytes(str.data(),
str.length() * sizeof(WebUChar));
}
break;
}
}
// This reads a serialized WebString from obj. If a string can't be read,
// WebString() is returned.
inline WebString ReadString(const SerializeObject* obj) {
int length;
// Versions 1, 2, and 3 all start with an integer.
if (!obj->pickle.ReadInt(&obj->iter, &length))
return WebString();
// Starting with version 2, -1 means WebString().
if (length == -1)
return WebString();
// In version 2, the length field was the length in WebUChars.
// In version 1 and 3 it is the length in bytes.
int bytes = ((obj->version == 2) ? length * sizeof(WebUChar) : length);
const void* data;
if (!ReadBytes(obj, &data, bytes))
return WebString();
return WebString(static_cast<const WebUChar*>(data), bytes / sizeof(WebUChar));
}
// Writes a Vector of Strings into a SerializeObject for serialization.
static void WriteStringVector(
const WebVector<WebString>& data, SerializeObject* obj) {
WriteInteger(static_cast<int>(data.size()), obj);
for (size_t i = 0, c = data.size(); i < c; ++i) {
unsigned ui = static_cast<unsigned>(i); // sigh
WriteString(data[ui], obj);
}
}
static WebVector<WebString> ReadStringVector(const SerializeObject* obj) {
int num_elements = ReadInteger(obj);
WebVector<WebString> result(static_cast<size_t>(num_elements));
for (int i = 0; i < num_elements; ++i)
result[i] = ReadString(obj);
return result;
}
// Writes a FormData object into a SerializeObject for serialization.
static void WriteFormData(const WebHTTPBody& http_body, SerializeObject* obj) {
WriteBoolean(!http_body.isNull(), obj);
if (http_body.isNull())
return;
WriteInteger(static_cast<int>(http_body.elementCount()), obj);
WebHTTPBody::Element element;
for (size_t i = 0; http_body.elementAt(i, element); ++i) {
WriteInteger(element.type, obj);
if (element.type == WebHTTPBody::Element::TypeData) {
WriteData(element.data.data(), static_cast<int>(element.data.size()),
obj);
} else {
WriteString(element.filePath, obj);
}
}
WriteInteger64(http_body.identifier(), obj);
}
static WebHTTPBody ReadFormData(const SerializeObject* obj) {
// In newer versions, an initial boolean indicates if we have form data.
if (obj->version >= 5 && !ReadBoolean(obj))
return WebHTTPBody();
// In older versions, 0 elements implied no form data.
int num_elements = ReadInteger(obj);
if (num_elements == 0 && obj->version < 5)
return WebHTTPBody();
WebHTTPBody http_body;
http_body.initialize();
for (int i = 0; i < num_elements; ++i) {
int type = ReadInteger(obj);
if (type == WebHTTPBody::Element::TypeData) {
const void* data;
int length = -1;
ReadData(obj, &data, &length);
if (length >= 0)
http_body.appendData(WebData(static_cast<const char*>(data), length));
} else {
http_body.appendFile(ReadString(obj));
}
}
if (obj->version >= 4)
http_body.setIdentifier(ReadInteger64(obj));
return http_body;
}
// Writes the HistoryItem data into the SerializeObject object for
// serialization.
static void WriteHistoryItem(
const WebHistoryItem& item, SerializeObject* obj) {
// WARNING: This data may be persisted for later use. As such, care must be
// taken when changing the serialized format. If a new field needs to be
// written, only adding at the end will make it easier to deal with loading
// older versions. Similarly, this should NOT save fields with sensitive
// data, such as password fields.
WriteInteger(kVersion, obj);
WriteString(item.urlString(), obj);
WriteString(item.originalURLString(), obj);
WriteString(item.target(), obj);
WriteString(item.parent(), obj);
WriteString(item.title(), obj);
WriteString(item.alternateTitle(), obj);
WriteReal(item.lastVisitedTime(), obj);
WriteInteger(item.scrollOffset().x, obj);
WriteInteger(item.scrollOffset().y, obj);
WriteBoolean(item.isTargetItem(), obj);
WriteInteger(item.visitCount(), obj);
WriteString(item.referrer(), obj);
WriteStringVector(item.documentState(), obj);
// Yes, the referrer is written twice. This is for backwards
// compatibility with the format.
WriteFormData(item.httpBody(), obj);
WriteString(item.httpContentType(), obj);
WriteString(item.referrer(), obj);
// Subitems
const WebVector<WebHistoryItem>& children = item.children();
WriteInteger(static_cast<int>(children.size()), obj);
for (size_t i = 0, c = children.size(); i < c; ++i)
WriteHistoryItem(children[i], obj);
WriteInteger64(item.documentSequenceNumber(), obj);
}
// Creates a new HistoryItem tree based on the serialized string.
// Assumes the data is in the format returned by WriteHistoryItem.
static WebHistoryItem ReadHistoryItem(
const SerializeObject* obj, bool include_form_data) {
// See note in WriteHistoryItem. on this.
obj->version = ReadInteger(obj);
if (obj->version > kVersion || obj->version < 1)
return WebHistoryItem();
WebHistoryItem item;
item.initialize();
item.setURLString(ReadString(obj));
item.setOriginalURLString(ReadString(obj));
item.setTarget(ReadString(obj));
item.setParent(ReadString(obj));
item.setTitle(ReadString(obj));
item.setAlternateTitle(ReadString(obj));
item.setLastVisitedTime(ReadReal(obj));
int x = ReadInteger(obj);
int y = ReadInteger(obj);
item.setScrollOffset(WebPoint(x, y));
item.setIsTargetItem(ReadBoolean(obj));
item.setVisitCount(ReadInteger(obj));
item.setReferrer(ReadString(obj));
item.setDocumentState(ReadStringVector(obj));
// The extra referrer string is read for backwards compat.
const WebHTTPBody& http_body = ReadFormData(obj);
const WebString& http_content_type = ReadString(obj);
ALLOW_UNUSED const WebString& unused_referrer = ReadString(obj);
if (include_form_data) {
item.setHTTPBody(http_body);
item.setHTTPContentType(http_content_type);
}
// Subitems
int num_children = ReadInteger(obj);
for (int i = 0; i < num_children; ++i)
item.appendToChildren(ReadHistoryItem(obj, include_form_data));
if (obj->version >= 6)
item.setDocumentSequenceNumber(ReadInteger64(obj));
return item;
}
// Serialize a HistoryItem to a string, using our JSON Value serializer.
std::string HistoryItemToString(const WebHistoryItem& item) {
if (item.isNull())
return std::string();
SerializeObject obj;
WriteHistoryItem(item, &obj);
return obj.GetAsString();
}
// Reconstruct a HistoryItem from a string, using our JSON Value deserializer.
// This assumes that the given serialized string has all the required key,value
// pairs, and does minimal error checking. If |include_form_data| is true,
// the form data from a post is restored, otherwise the form data is empty.
static WebHistoryItem HistoryItemFromString(
const std::string& serialized_item,
bool include_form_data) {
if (serialized_item.empty())
return WebHistoryItem();
SerializeObject obj(serialized_item.data(),
static_cast<int>(serialized_item.length()));
return ReadHistoryItem(&obj, include_form_data);
}
WebHistoryItem HistoryItemFromString(
const std::string& serialized_item) {
return HistoryItemFromString(serialized_item, true);
}
// For testing purposes only.
void HistoryItemToVersionedString(const WebHistoryItem& item, int version,
std::string* serialized_item) {
if (item.isNull()) {
serialized_item->clear();
return;
}
// Temporarily change the version.
int real_version = kVersion;
kVersion = version;
SerializeObject obj;
WriteHistoryItem(item, &obj);
*serialized_item = obj.GetAsString();
kVersion = real_version;
}
std::string CreateHistoryStateForURL(const GURL& url) {
WebHistoryItem item;
item.initialize();
item.setURLString(UTF8ToUTF16(url.spec()));
return HistoryItemToString(item);
}
std::string RemoveFormDataFromHistoryState(const std::string& content_state) {
const WebHistoryItem& item = HistoryItemFromString(content_state, false);
if (item.isNull()) {
// Couldn't parse the string, return an empty string.
return std::string();
}
return HistoryItemToString(item);
}
} // namespace webkit_glue
<|endoftext|>
|
<commit_before>#include "gamelib/core/Game.hpp"
#include <SFML/Graphics.hpp>
#include <climits>
#include "gamelib/core/GameState.hpp"
#include "gamelib/utils/log.hpp"
#include "gamelib/core/event/EventManager.hpp"
#include "gamelib/events/SFMLEvent.hpp"
#include "gamelib/core/input/InputSystem.hpp"
namespace gamelib
{
Game::Game() :
bgcolor(sf::Color::Black),
closebutton(true),
escclose(true),
unfocusPause(true),
_frametime(0),
_rendertime(0),
_updatetime(0),
_size(640, 480),
_maxfps(60),
_title("Unnamed Game"),
_repeatkeys(false),
_vsync(true)
{
auto setSize = +[](const math::Vec2i* val, Game* self) {
self->resize(sf::Vector2u(val->x, val->y));
};
auto setFPS = +[](const int* val, Game* self) {
self->_maxfps = *val;
if (self->_window.isOpen())
self->_window.setFramerateLimit(*val);
};
auto setVsync = +[](const bool* val, Game* self) {
self->_vsync = *val;
if (self->_window.isOpen())
self->_window.setVerticalSyncEnabled(*val);
};
auto setTitle = +[](const std::string* val, Game* self) {
self->_title = *val;
if (self->_window.isOpen())
self->_window.setTitle(*val);
};
auto setRepeat = +[](const bool* val, Game* self) {
self->_repeatkeys = *val;
if (self->_window.isOpen())
self->_window.setKeyRepeatEnabled(*val);
};
_props.registerProperty("bgcolor", bgcolor);
_props.registerProperty("closebutton", closebutton);
_props.registerProperty("escclose", escclose);
_props.registerProperty("unfocusPause", unfocusPause);
_props.registerProperty("size", _size, setSize, this);
_props.registerProperty("maxfps", _maxfps, setFPS, this, 0, INT_MAX);
_props.registerProperty("vsync", _vsync, setVsync, this);
_props.registerProperty("title", _title, setTitle, this);
_props.registerProperty("repeatkeys", _repeatkeys, setRepeat, this);
}
Game::~Game()
{
destroy();
}
bool Game::init()
{
LOG("Initializing game...");
_window.create(sf::VideoMode(_size.x, _size.y), _title, sf::Style::Close);
_window.setFramerateLimit(_maxfps);
_window.setVerticalSyncEnabled(_vsync);
_window.setKeyRepeatEnabled(_repeatkeys);
return true;
}
void Game::run()
{
sf::Clock clock, detailclock;
sf::Event ev;
while (_window.isOpen())
{
clock.restart();
detailclock.restart();
auto inputsys = getSubsystem<InputSystem>();
if (inputsys)
inputsys->beginFrame();
while (_window.pollEvent(ev))
{
if (inputsys)
inputsys->process(ev);
auto evmgr = getSubsystem<EventManager>();
if (evmgr)
evmgr->triggerEvent(SFMLEvent::create(ev));
}
if (_window.hasFocus() || !unfocusPause)
{
bool frozen = false;
for (auto it = _states.rbegin(), end = _states.rend(); it != end; ++it)
{
auto state = (*it).get();
if (state->flags & gamestate_paused)
continue;
if (!frozen || state->flags & gamestate_forceupdate)
state->update(_frametime);
if (state->flags & gamestate_freeze)
frozen = true;
}
if (escclose && inputsys && inputsys->isKeyPressed(sf::Keyboard::Escape))
{
close();
return;
}
}
_updatetime = detailclock.getElapsedTime().asMilliseconds() / 1000.f;
detailclock.restart();
_window.resetGLStates(); // without this things start randomly disappearing
_window.clear(bgcolor);
if (_vsync)
detailclock.restart();
for (auto& i : _states)
i->render(_window);
// TODO: implement own fps capping.
// SFML caps inside window.display(), so it's impossible to get the exact render time
if (!_vsync)
_rendertime = detailclock.getElapsedTime().asMilliseconds() / 1000.0f;
_window.display();
if (_vsync)
_rendertime = detailclock.getElapsedTime().asMilliseconds() / 1000.0f;
// Get elapsed time
_frametime = clock.getElapsedTime().asMilliseconds() / 1000.0f;
}
}
void Game::close()
{
if (_window.isOpen())
{
_window.close();
LOG_DEBUG("Game window closed");
}
}
void Game::destroy()
{
close();
if (!_states.empty())
{
LOG_DEBUG("Closing game states...");
for (auto& i : _states)
i->quit();
_states.clear();
}
}
bool Game::loadFromJson(const Json::Value& node)
{
return _props.loadFromJson(node);
}
void Game::writeToJson(Json::Value& node) const
{
_props.writeToJson(node);
}
void Game::pushState(std::unique_ptr<GameState> state)
{
if (!state->init(this))
{
LOG_ERROR("Failed to initialize game state");
return;
}
_states.push_back(std::move(state));
LOG_DEBUG("Game state added");
}
void Game::popState()
{
_states.back()->quit();
_states.pop_back();
}
GameState* Game::pullState() const
{
return _states.back().get();
}
float Game::getFrametime() const
{
return _frametime;
}
float Game::getRealFrametime() const
{
return _rendertime + _updatetime;
}
float Game::getRenderTime() const
{
return _rendertime;
}
float Game::getUpdateTime() const
{
return _updatetime;
}
sf::RenderWindow& Game::getWindow()
{
return _window;
}
const PropertyContainer& Game::getProperties() const
{
return _props;
}
void Game::resize(const sf::Vector2u& size)
{
if (size.x <= 0 || size.y <= 0)
{
LOG_ERROR("Invalid window size: ", size.x, "x", size.y);
return;
}
_size.fill(size.x, size.y);
if (_window.isOpen())
{
auto diff = size - _window.getSize();
auto pos = _window.getPosition();
pos.x -= diff.x / 2;
pos.y -= diff.y / 2;
_window.setSize(size);
_window.setPosition(pos);
_window.setView(sf::View(sf::FloatRect(0, 0, size.x, size.y)));
}
// Don't create a new window, as it could lead to problems
// if (size != _window.getSize())
// {
// _window.close();
// _window.create(sf::VideoMode(size.x, size.y), game_title, sf::Style::Close);
// }
}
}
<commit_msg>Fix closebutton not working<commit_after>#include "gamelib/core/Game.hpp"
#include <SFML/Graphics.hpp>
#include <climits>
#include "gamelib/core/GameState.hpp"
#include "gamelib/utils/log.hpp"
#include "gamelib/core/event/EventManager.hpp"
#include "gamelib/events/SFMLEvent.hpp"
#include "gamelib/core/input/InputSystem.hpp"
namespace gamelib
{
Game::Game() :
bgcolor(sf::Color::Black),
closebutton(true),
escclose(true),
unfocusPause(true),
_frametime(0),
_rendertime(0),
_updatetime(0),
_size(640, 480),
_maxfps(60),
_title("Unnamed Game"),
_repeatkeys(false),
_vsync(true)
{
auto setSize = +[](const math::Vec2i* val, Game* self) {
self->resize(sf::Vector2u(val->x, val->y));
};
auto setFPS = +[](const int* val, Game* self) {
self->_maxfps = *val;
if (self->_window.isOpen())
self->_window.setFramerateLimit(*val);
};
auto setVsync = +[](const bool* val, Game* self) {
self->_vsync = *val;
if (self->_window.isOpen())
self->_window.setVerticalSyncEnabled(*val);
};
auto setTitle = +[](const std::string* val, Game* self) {
self->_title = *val;
if (self->_window.isOpen())
self->_window.setTitle(*val);
};
auto setRepeat = +[](const bool* val, Game* self) {
self->_repeatkeys = *val;
if (self->_window.isOpen())
self->_window.setKeyRepeatEnabled(*val);
};
_props.registerProperty("bgcolor", bgcolor);
_props.registerProperty("closebutton", closebutton);
_props.registerProperty("escclose", escclose);
_props.registerProperty("unfocusPause", unfocusPause);
_props.registerProperty("size", _size, setSize, this);
_props.registerProperty("maxfps", _maxfps, setFPS, this, 0, INT_MAX);
_props.registerProperty("vsync", _vsync, setVsync, this);
_props.registerProperty("title", _title, setTitle, this);
_props.registerProperty("repeatkeys", _repeatkeys, setRepeat, this);
}
Game::~Game()
{
destroy();
}
bool Game::init()
{
LOG("Initializing game...");
_window.create(sf::VideoMode(_size.x, _size.y), _title, sf::Style::Close);
_window.setFramerateLimit(_maxfps);
_window.setVerticalSyncEnabled(_vsync);
_window.setKeyRepeatEnabled(_repeatkeys);
return true;
}
void Game::run()
{
sf::Clock clock, detailclock;
sf::Event ev;
while (_window.isOpen())
{
clock.restart();
detailclock.restart();
auto inputsys = getSubsystem<InputSystem>();
if (inputsys)
inputsys->beginFrame();
while (_window.pollEvent(ev))
{
if (inputsys)
inputsys->process(ev);
auto evmgr = getSubsystem<EventManager>();
if (evmgr)
evmgr->triggerEvent(SFMLEvent::create(ev));
if (closebutton && ev.type == sf::Event::Closed)
{
close();
return;
}
}
if (_window.hasFocus() || !unfocusPause)
{
bool frozen = false;
for (auto it = _states.rbegin(), end = _states.rend(); it != end; ++it)
{
auto state = (*it).get();
if (state->flags & gamestate_paused)
continue;
if (!frozen || state->flags & gamestate_forceupdate)
state->update(_frametime);
if (state->flags & gamestate_freeze)
frozen = true;
}
if (escclose && inputsys && inputsys->isKeyPressed(sf::Keyboard::Escape))
{
close();
return;
}
}
_updatetime = detailclock.getElapsedTime().asMilliseconds() / 1000.f;
detailclock.restart();
_window.resetGLStates(); // without this things start randomly disappearing
_window.clear(bgcolor);
if (_vsync)
detailclock.restart();
for (auto& i : _states)
i->render(_window);
// TODO: implement own fps capping.
// SFML caps inside window.display(), so it's impossible to get the exact render time
if (!_vsync)
_rendertime = detailclock.getElapsedTime().asMilliseconds() / 1000.0f;
_window.display();
if (_vsync)
_rendertime = detailclock.getElapsedTime().asMilliseconds() / 1000.0f;
// Get elapsed time
_frametime = clock.getElapsedTime().asMilliseconds() / 1000.0f;
}
}
void Game::close()
{
if (_window.isOpen())
{
_window.close();
LOG_DEBUG("Game window closed");
}
}
void Game::destroy()
{
close();
if (!_states.empty())
{
LOG_DEBUG("Closing game states...");
for (auto& i : _states)
i->quit();
_states.clear();
}
}
bool Game::loadFromJson(const Json::Value& node)
{
return _props.loadFromJson(node);
}
void Game::writeToJson(Json::Value& node) const
{
_props.writeToJson(node);
}
void Game::pushState(std::unique_ptr<GameState> state)
{
if (!state->init(this))
{
LOG_ERROR("Failed to initialize game state");
return;
}
_states.push_back(std::move(state));
LOG_DEBUG("Game state added");
}
void Game::popState()
{
_states.back()->quit();
_states.pop_back();
}
GameState* Game::pullState() const
{
return _states.back().get();
}
float Game::getFrametime() const
{
return _frametime;
}
float Game::getRealFrametime() const
{
return _rendertime + _updatetime;
}
float Game::getRenderTime() const
{
return _rendertime;
}
float Game::getUpdateTime() const
{
return _updatetime;
}
sf::RenderWindow& Game::getWindow()
{
return _window;
}
const PropertyContainer& Game::getProperties() const
{
return _props;
}
void Game::resize(const sf::Vector2u& size)
{
if (size.x <= 0 || size.y <= 0)
{
LOG_ERROR("Invalid window size: ", size.x, "x", size.y);
return;
}
_size.fill(size.x, size.y);
if (_window.isOpen())
{
auto diff = size - _window.getSize();
auto pos = _window.getPosition();
pos.x -= diff.x / 2;
pos.y -= diff.y / 2;
_window.setSize(size);
_window.setPosition(pos);
_window.setView(sf::View(sf::FloatRect(0, 0, size.x, size.y)));
}
// Don't create a new window, as it could lead to problems
// if (size != _window.getSize())
// {
// _window.close();
// _window.create(sf::VideoMode(size.x, size.y), game_title, sf::Style::Close);
// }
}
}
<|endoftext|>
|
<commit_before>// Copyright (c) 2011-2014 The Bitcoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "bitcoinamountfield.h"
#include "bitcoinunits.h"
#include "guiconstants.h"
#include "qvaluecombobox.h"
#include <QApplication>
#include <QAbstractSpinBox>
#include <QHBoxLayout>
#include <QKeyEvent>
#include <QLineEdit>
/** QSpinBox that uses fixed-point numbers internally and uses our own
* formatting/parsing functions.
*/
class AmountSpinBox: public QAbstractSpinBox
{
Q_OBJECT
public:
explicit AmountSpinBox(QWidget *parent):
QAbstractSpinBox(parent),
currentUnit(BitcoinUnits::BTC),
singleStep(100000) // satoshis
{
setAlignment(Qt::AlignRight);
connect(lineEdit(), SIGNAL(textEdited(QString)), this, SIGNAL(valueChanged()));
}
QValidator::State validate(QString &text, int &pos) const
{
if(text.isEmpty())
return QValidator::Intermediate;
bool valid = false;
parse(text, &valid);
/* Make sure we return Intermediate so that fixup() is called on defocus */
return valid ? QValidator::Intermediate : QValidator::Invalid;
}
void fixup(QString &input) const
{
bool valid = false;
CAmount val = parse(input, &valid);
if(valid)
{
input = BitcoinUnits::format(currentUnit, val, false, BitcoinUnits::separatorAlways);
lineEdit()->setText(input);
}
}
CAmount value(bool *valid_out=0) const
{
return parse(text(), valid_out);
}
void setValue(const CAmount& value)
{
lineEdit()->setText(BitcoinUnits::format(currentUnit, value, false, BitcoinUnits::separatorAlways));
emit valueChanged();
}
void stepBy(int steps)
{
bool valid = false;
CAmount val = value(&valid);
val = val + steps * singleStep;
val = qMin(qMax(val, CAmount(0)), BitcoinUnits::maxMoney());
setValue(val);
}
StepEnabled stepEnabled() const
{
StepEnabled rv = 0;
if(text().isEmpty()) // Allow step-up with empty field
return StepUpEnabled;
bool valid = false;
CAmount val = value(&valid);
if(valid)
{
if(val > 0)
rv |= StepDownEnabled;
if(val < BitcoinUnits::maxMoney())
rv |= StepUpEnabled;
}
return rv;
}
void setDisplayUnit(int unit)
{
bool valid = false;
CAmount val = value(&valid);
currentUnit = unit;
if(valid)
setValue(val);
else
clear();
}
void setSingleStep(const CAmount& step)
{
singleStep = step;
}
QSize minimumSizeHint() const
{
if(cachedMinimumSizeHint.isEmpty())
{
ensurePolished();
const QFontMetrics fm(fontMetrics());
int h = lineEdit()->minimumSizeHint().height();
int w = fm.width(BitcoinUnits::format(BitcoinUnits::BTC, BitcoinUnits::maxMoney(), false, BitcoinUnits::separatorAlways));
w += 2; // cursor blinking space
QStyleOptionSpinBox opt;
initStyleOption(&opt);
QSize hint(w, h);
QSize extra(35, 6);
opt.rect.setSize(hint + extra);
extra += hint - style()->subControlRect(QStyle::CC_SpinBox, &opt,
QStyle::SC_SpinBoxEditField, this).size();
// get closer to final result by repeating the calculation
opt.rect.setSize(hint + extra);
extra += hint - style()->subControlRect(QStyle::CC_SpinBox, &opt,
QStyle::SC_SpinBoxEditField, this).size();
hint += extra;
hint.setHeight(h);
opt.rect = rect();
cachedMinimumSizeHint = style()->sizeFromContents(QStyle::CT_SpinBox, &opt, hint, this)
.expandedTo(QApplication::globalStrut());
}
return cachedMinimumSizeHint;
}
private:
int currentUnit;
CAmount singleStep;
mutable QSize cachedMinimumSizeHint;
/**
* Parse a string into a number of base monetary units and
* return validity.
* @note Must return 0 if !valid.
*/
CAmount parse(const QString &text, bool *valid_out=0) const
{
CAmount val = 0;
bool valid = BitcoinUnits::parse(currentUnit, text, &val);
if(valid)
{
if(val < 0 || val > BitcoinUnits::maxMoney())
valid = false;
}
if(valid_out)
*valid_out = valid;
return valid ? val : 0;
}
protected:
bool event(QEvent *event)
{
if (event->type() == QEvent::KeyPress || event->type() == QEvent::KeyRelease)
{
QKeyEvent *keyEvent = static_cast<QKeyEvent *>(event);
if (keyEvent->key() == Qt::Key_Comma)
{
// Translate a comma into a period
QKeyEvent periodKeyEvent(event->type(), Qt::Key_Period, keyEvent->modifiers(), ".", keyEvent->isAutoRepeat(), keyEvent->count());
return QAbstractSpinBox::event(&periodKeyEvent);
}
}
return QAbstractSpinBox::event(event);
}
signals:
void valueChanged();
};
#include "bitcoinamountfield.moc"
BitcoinAmountField::BitcoinAmountField(QWidget *parent) :
QWidget(parent),
amount(0)
{
amount = new AmountSpinBox(this);
amount->setLocale(QLocale::c());
amount->installEventFilter(this);
amount->setMaximumWidth(170);
QHBoxLayout *layout = new QHBoxLayout(this);
layout->addWidget(amount);
unit = new QValueComboBox(this);
unit->setModel(new BitcoinUnits(this));
layout->addWidget(unit);
layout->addStretch(1);
layout->setContentsMargins(0,0,0,0);
setLayout(layout);
setFocusPolicy(Qt::TabFocus);
setFocusProxy(amount);
// If one if the widgets changes, the combined content changes as well
connect(amount, SIGNAL(valueChanged()), this, SIGNAL(valueChanged()));
connect(unit, SIGNAL(currentIndexChanged(int)), this, SLOT(unitChanged(int)));
// Set default based on configuration
unitChanged(unit->currentIndex());
}
void BitcoinAmountField::clear()
{
amount->clear();
unit->setCurrentIndex(0);
}
void BitcoinAmountField::setEnabled(bool fEnabled)
{
amount->setEnabled(fEnabled);
unit->setEnabled(fEnabled);
}
bool BitcoinAmountField::validate()
{
bool valid = false;
value(&valid);
setValid(valid);
return valid;
}
void BitcoinAmountField::setValid(bool valid)
{
if (valid)
amount->setStyleSheet("");
else
amount->setStyleSheet(STYLE_INVALID);
}
bool BitcoinAmountField::eventFilter(QObject *object, QEvent *event)
{
if (event->type() == QEvent::FocusIn)
{
// Clear invalid flag on focus
setValid(true);
}
return QWidget::eventFilter(object, event);
}
QWidget *BitcoinAmountField::setupTabChain(QWidget *prev)
{
QWidget::setTabOrder(prev, amount);
QWidget::setTabOrder(amount, unit);
return unit;
}
CAmount BitcoinAmountField::value(bool *valid_out) const
{
return amount->value(valid_out);
}
void BitcoinAmountField::setValue(const CAmount& value)
{
amount->setValue(value);
}
void BitcoinAmountField::setReadOnly(bool fReadOnly)
{
amount->setReadOnly(fReadOnly);
unit->setEnabled(!fReadOnly);
}
void BitcoinAmountField::unitChanged(int idx)
{
// Use description tooltip for current unit for the combobox
unit->setToolTip(unit->itemData(idx, Qt::ToolTipRole).toString());
// Determine new unit ID
int newUnit = unit->itemData(idx, BitcoinUnits::UnitRole).toInt();
amount->setDisplayUnit(newUnit);
}
void BitcoinAmountField::setDisplayUnit(int newUnit)
{
unit->setValue(newUnit);
}
void BitcoinAmountField::setSingleStep(const CAmount& step)
{
amount->setSingleStep(step);
}
<commit_msg>[Qt] don't allow amount changes when AmountSpinBox is read-only<commit_after>// Copyright (c) 2011-2014 The Bitcoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "bitcoinamountfield.h"
#include "bitcoinunits.h"
#include "guiconstants.h"
#include "qvaluecombobox.h"
#include <QApplication>
#include <QAbstractSpinBox>
#include <QHBoxLayout>
#include <QKeyEvent>
#include <QLineEdit>
/** QSpinBox that uses fixed-point numbers internally and uses our own
* formatting/parsing functions.
*/
class AmountSpinBox: public QAbstractSpinBox
{
Q_OBJECT
public:
explicit AmountSpinBox(QWidget *parent):
QAbstractSpinBox(parent),
currentUnit(BitcoinUnits::BTC),
singleStep(100000) // satoshis
{
setAlignment(Qt::AlignRight);
connect(lineEdit(), SIGNAL(textEdited(QString)), this, SIGNAL(valueChanged()));
}
QValidator::State validate(QString &text, int &pos) const
{
if(text.isEmpty())
return QValidator::Intermediate;
bool valid = false;
parse(text, &valid);
/* Make sure we return Intermediate so that fixup() is called on defocus */
return valid ? QValidator::Intermediate : QValidator::Invalid;
}
void fixup(QString &input) const
{
bool valid = false;
CAmount val = parse(input, &valid);
if(valid)
{
input = BitcoinUnits::format(currentUnit, val, false, BitcoinUnits::separatorAlways);
lineEdit()->setText(input);
}
}
CAmount value(bool *valid_out=0) const
{
return parse(text(), valid_out);
}
void setValue(const CAmount& value)
{
lineEdit()->setText(BitcoinUnits::format(currentUnit, value, false, BitcoinUnits::separatorAlways));
emit valueChanged();
}
void stepBy(int steps)
{
bool valid = false;
CAmount val = value(&valid);
val = val + steps * singleStep;
val = qMin(qMax(val, CAmount(0)), BitcoinUnits::maxMoney());
setValue(val);
}
void setDisplayUnit(int unit)
{
bool valid = false;
CAmount val = value(&valid);
currentUnit = unit;
if(valid)
setValue(val);
else
clear();
}
void setSingleStep(const CAmount& step)
{
singleStep = step;
}
QSize minimumSizeHint() const
{
if(cachedMinimumSizeHint.isEmpty())
{
ensurePolished();
const QFontMetrics fm(fontMetrics());
int h = lineEdit()->minimumSizeHint().height();
int w = fm.width(BitcoinUnits::format(BitcoinUnits::BTC, BitcoinUnits::maxMoney(), false, BitcoinUnits::separatorAlways));
w += 2; // cursor blinking space
QStyleOptionSpinBox opt;
initStyleOption(&opt);
QSize hint(w, h);
QSize extra(35, 6);
opt.rect.setSize(hint + extra);
extra += hint - style()->subControlRect(QStyle::CC_SpinBox, &opt,
QStyle::SC_SpinBoxEditField, this).size();
// get closer to final result by repeating the calculation
opt.rect.setSize(hint + extra);
extra += hint - style()->subControlRect(QStyle::CC_SpinBox, &opt,
QStyle::SC_SpinBoxEditField, this).size();
hint += extra;
hint.setHeight(h);
opt.rect = rect();
cachedMinimumSizeHint = style()->sizeFromContents(QStyle::CT_SpinBox, &opt, hint, this)
.expandedTo(QApplication::globalStrut());
}
return cachedMinimumSizeHint;
}
private:
int currentUnit;
CAmount singleStep;
mutable QSize cachedMinimumSizeHint;
/**
* Parse a string into a number of base monetary units and
* return validity.
* @note Must return 0 if !valid.
*/
CAmount parse(const QString &text, bool *valid_out=0) const
{
CAmount val = 0;
bool valid = BitcoinUnits::parse(currentUnit, text, &val);
if(valid)
{
if(val < 0 || val > BitcoinUnits::maxMoney())
valid = false;
}
if(valid_out)
*valid_out = valid;
return valid ? val : 0;
}
protected:
bool event(QEvent *event)
{
if (event->type() == QEvent::KeyPress || event->type() == QEvent::KeyRelease)
{
QKeyEvent *keyEvent = static_cast<QKeyEvent *>(event);
if (keyEvent->key() == Qt::Key_Comma)
{
// Translate a comma into a period
QKeyEvent periodKeyEvent(event->type(), Qt::Key_Period, keyEvent->modifiers(), ".", keyEvent->isAutoRepeat(), keyEvent->count());
return QAbstractSpinBox::event(&periodKeyEvent);
}
}
return QAbstractSpinBox::event(event);
}
StepEnabled stepEnabled() const
{
StepEnabled rv = 0;
if (isReadOnly()) // Disable steps when AmountSpinBox is read-only
return StepNone;
if(text().isEmpty()) // Allow step-up with empty field
return StepUpEnabled;
bool valid = false;
CAmount val = value(&valid);
if(valid)
{
if(val > 0)
rv |= StepDownEnabled;
if(val < BitcoinUnits::maxMoney())
rv |= StepUpEnabled;
}
return rv;
}
signals:
void valueChanged();
};
#include "bitcoinamountfield.moc"
BitcoinAmountField::BitcoinAmountField(QWidget *parent) :
QWidget(parent),
amount(0)
{
amount = new AmountSpinBox(this);
amount->setLocale(QLocale::c());
amount->installEventFilter(this);
amount->setMaximumWidth(170);
QHBoxLayout *layout = new QHBoxLayout(this);
layout->addWidget(amount);
unit = new QValueComboBox(this);
unit->setModel(new BitcoinUnits(this));
layout->addWidget(unit);
layout->addStretch(1);
layout->setContentsMargins(0,0,0,0);
setLayout(layout);
setFocusPolicy(Qt::TabFocus);
setFocusProxy(amount);
// If one if the widgets changes, the combined content changes as well
connect(amount, SIGNAL(valueChanged()), this, SIGNAL(valueChanged()));
connect(unit, SIGNAL(currentIndexChanged(int)), this, SLOT(unitChanged(int)));
// Set default based on configuration
unitChanged(unit->currentIndex());
}
void BitcoinAmountField::clear()
{
amount->clear();
unit->setCurrentIndex(0);
}
void BitcoinAmountField::setEnabled(bool fEnabled)
{
amount->setEnabled(fEnabled);
unit->setEnabled(fEnabled);
}
bool BitcoinAmountField::validate()
{
bool valid = false;
value(&valid);
setValid(valid);
return valid;
}
void BitcoinAmountField::setValid(bool valid)
{
if (valid)
amount->setStyleSheet("");
else
amount->setStyleSheet(STYLE_INVALID);
}
bool BitcoinAmountField::eventFilter(QObject *object, QEvent *event)
{
if (event->type() == QEvent::FocusIn)
{
// Clear invalid flag on focus
setValid(true);
}
return QWidget::eventFilter(object, event);
}
QWidget *BitcoinAmountField::setupTabChain(QWidget *prev)
{
QWidget::setTabOrder(prev, amount);
QWidget::setTabOrder(amount, unit);
return unit;
}
CAmount BitcoinAmountField::value(bool *valid_out) const
{
return amount->value(valid_out);
}
void BitcoinAmountField::setValue(const CAmount& value)
{
amount->setValue(value);
}
void BitcoinAmountField::setReadOnly(bool fReadOnly)
{
amount->setReadOnly(fReadOnly);
unit->setEnabled(!fReadOnly);
}
void BitcoinAmountField::unitChanged(int idx)
{
// Use description tooltip for current unit for the combobox
unit->setToolTip(unit->itemData(idx, Qt::ToolTipRole).toString());
// Determine new unit ID
int newUnit = unit->itemData(idx, BitcoinUnits::UnitRole).toInt();
amount->setDisplayUnit(newUnit);
}
void BitcoinAmountField::setDisplayUnit(int newUnit)
{
unit->setValue(newUnit);
}
void BitcoinAmountField::setSingleStep(const CAmount& step)
{
amount->setSingleStep(step);
}
<|endoftext|>
|
<commit_before>/*********************************************************************************
*
* Inviwo - Interactive Visualization Workshop
*
* Copyright (c) 2016 Inviwo Foundation
* 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 <inviwo/core/common/inviwoapplication.h>
#include <inviwo/core/network/processornetwork.h>
#include <inviwo/qt/editor/inviwomainwindow.h>
#include <inviwo/qt/editor/undomanager.h>
#include <inviwo/core/util/raiiutils.h>
#include <warn/push>
#include <warn/ignore/all>
#include <QAction>
#include <QEvent>
#include <QApplication>
#include <QGuiApplication>
#include <warn/pop>
namespace inviwo {
UndoManager::UndoManager(InviwoMainWindow* mainWindow) : mainWindow_(mainWindow) {
mainWindow_->getInviwoApplication()->getProcessorNetwork()->addObserver(this);
interactionEndCallback_ =
mainWindow_->getInviwoApplication()->getInteractionStateManager().onInteractionEnd(
[&]() { if (dirty_) pushState(); });
undoAction_ = new QAction(QAction::tr("&Undo"), mainWindow_);
undoAction_->setShortcut(QKeySequence::Undo);
undoAction_->connect(undoAction_, &QAction::triggered, [&]() {
undoState();
});
redoAction_ = new QAction(QAction::tr("&Redo"), mainWindow_);
redoAction_->setShortcut(QKeySequence::Redo);
redoAction_->connect(redoAction_, &QAction::triggered, [&]() {
redoState();
});
updateActions();
pushState();
}
void UndoManager::pushState() {
if (isRestoring) return;
if (mainWindow_->getInviwoApplication()->getProcessorNetwork()->islocked()) return;
if (mainWindow_->getInviwoApplication()->getInteractionStateManager().isInteracting()) return;
auto path = mainWindow_->getCurrentWorkspace();
Serializer s(path);
mainWindow_->getInviwoApplication()->getProcessorNetwork()->serialize(s);
std::stringstream stream;
s.writeFile(stream);
auto str = stream.str();
if (head_ >= 0 && str == undoBuffer_[head_]) return; // No Change
++head_;
auto offset = std::min(std::distance(undoBuffer_.begin(), undoBuffer_.end()), head_);
undoBuffer_.erase(undoBuffer_.begin() + offset, undoBuffer_.end());
undoBuffer_.emplace_back(str);
dirty_ = false;
updateActions();
LogInfo("Push state: " << head_ << " (" << undoBuffer_.size() << ")");
}
void UndoManager::undoState() {
if (head_ > 0) {
util::KeepTrueWhileInScope restore(&isRestoring);
auto path = mainWindow_->getCurrentWorkspace();
std::stringstream stream;
--head_;
stream << undoBuffer_[head_];
Deserializer d(mainWindow_->getInviwoApplication(), stream, path);
mainWindow_->getInviwoApplication()->getProcessorNetwork()->deserialize(d);
dirty_ = false;
updateActions();
LogInfo("Undo state: " << head_ << " (" << undoBuffer_.size() << ")");
}
}
void UndoManager::redoState() {
if (head_ >= -1 && head_ < static_cast<DiffType>(undoBuffer_.size())-1) {
util::KeepTrueWhileInScope restore(&isRestoring);
auto path = mainWindow_->getCurrentWorkspace();
std::stringstream stream;
++head_;
stream << undoBuffer_[head_];
Deserializer d(mainWindow_->getInviwoApplication(), stream, path);
mainWindow_->getInviwoApplication()->getProcessorNetwork()->deserialize(d);
dirty_ = false;
updateActions();
LogInfo("Redo state: " << head_ << " (" << undoBuffer_.size() << ")");
}
}
QAction* UndoManager::getUndoAction() const {
return undoAction_;
}
QAction* UndoManager::getRedoAction() const {
return redoAction_;
}
void UndoManager::updateActions() {
undoAction_->setEnabled(head_>0);
redoAction_->setEnabled(head_ >= -1 && head_ < static_cast<DiffType>(undoBuffer_.size()) - 1);
}
void UndoManager::onProcessorNetworkUnlocked() {
if (dirty_) pushState();
}
void UndoManager::onProcessorNetworkChange() {
dirty_ = true;
pushState();
}
void UndoManager::onProcessorNetworkDidAddProcessor(Processor* processor) {
dirty_ = true;
pushState();
}
void UndoManager::onProcessorNetworkDidRemoveProcessor(Processor* processor) {
dirty_ = true;
pushState();
}
void UndoManager::onProcessorNetworkDidAddConnection(const PortConnection& connection) {
dirty_ = true;
pushState();
}
void UndoManager::onProcessorNetworkDidRemoveConnection(const PortConnection& connection) {
dirty_ = true;
pushState();
}
void UndoManager::onProcessorNetworkDidAddLink(const PropertyLink& propertyLink) {
dirty_ = true;
pushState();
}
void UndoManager::onProcessorNetworkDidRemoveLink(const PropertyLink& propertyLink) {
dirty_ = true;
pushState();
}
} // namespace
<commit_msg>Core: UndoManager, disable debug logging<commit_after>/*********************************************************************************
*
* Inviwo - Interactive Visualization Workshop
*
* Copyright (c) 2016 Inviwo Foundation
* 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 <inviwo/core/common/inviwoapplication.h>
#include <inviwo/core/network/processornetwork.h>
#include <inviwo/qt/editor/inviwomainwindow.h>
#include <inviwo/qt/editor/undomanager.h>
#include <inviwo/core/util/raiiutils.h>
#include <warn/push>
#include <warn/ignore/all>
#include <QAction>
#include <QEvent>
#include <QApplication>
#include <QGuiApplication>
#include <warn/pop>
namespace inviwo {
UndoManager::UndoManager(InviwoMainWindow* mainWindow) : mainWindow_(mainWindow) {
mainWindow_->getInviwoApplication()->getProcessorNetwork()->addObserver(this);
interactionEndCallback_ =
mainWindow_->getInviwoApplication()->getInteractionStateManager().onInteractionEnd(
[&]() { if (dirty_) pushState(); });
undoAction_ = new QAction(QAction::tr("&Undo"), mainWindow_);
undoAction_->setShortcut(QKeySequence::Undo);
undoAction_->connect(undoAction_, &QAction::triggered, [&]() {
undoState();
});
redoAction_ = new QAction(QAction::tr("&Redo"), mainWindow_);
redoAction_->setShortcut(QKeySequence::Redo);
redoAction_->connect(redoAction_, &QAction::triggered, [&]() {
redoState();
});
updateActions();
pushState();
}
void UndoManager::pushState() {
if (isRestoring) return;
if (mainWindow_->getInviwoApplication()->getProcessorNetwork()->islocked()) return;
if (mainWindow_->getInviwoApplication()->getInteractionStateManager().isInteracting()) return;
auto path = mainWindow_->getCurrentWorkspace();
Serializer s(path);
mainWindow_->getInviwoApplication()->getProcessorNetwork()->serialize(s);
std::stringstream stream;
s.writeFile(stream);
auto str = stream.str();
if (head_ >= 0 && str == undoBuffer_[head_]) return; // No Change
++head_;
auto offset = std::min(std::distance(undoBuffer_.begin(), undoBuffer_.end()), head_);
undoBuffer_.erase(undoBuffer_.begin() + offset, undoBuffer_.end());
undoBuffer_.emplace_back(str);
dirty_ = false;
updateActions();
//LogInfo("Push state: " << head_ << " (" << undoBuffer_.size() << ")");
}
void UndoManager::undoState() {
if (head_ > 0) {
util::KeepTrueWhileInScope restore(&isRestoring);
auto path = mainWindow_->getCurrentWorkspace();
std::stringstream stream;
--head_;
stream << undoBuffer_[head_];
Deserializer d(mainWindow_->getInviwoApplication(), stream, path);
mainWindow_->getInviwoApplication()->getProcessorNetwork()->deserialize(d);
dirty_ = false;
updateActions();
//LogInfo("Undo state: " << head_ << " (" << undoBuffer_.size() << ")");
}
}
void UndoManager::redoState() {
if (head_ >= -1 && head_ < static_cast<DiffType>(undoBuffer_.size())-1) {
util::KeepTrueWhileInScope restore(&isRestoring);
auto path = mainWindow_->getCurrentWorkspace();
std::stringstream stream;
++head_;
stream << undoBuffer_[head_];
Deserializer d(mainWindow_->getInviwoApplication(), stream, path);
mainWindow_->getInviwoApplication()->getProcessorNetwork()->deserialize(d);
dirty_ = false;
updateActions();
//LogInfo("Redo state: " << head_ << " (" << undoBuffer_.size() << ")");
}
}
QAction* UndoManager::getUndoAction() const {
return undoAction_;
}
QAction* UndoManager::getRedoAction() const {
return redoAction_;
}
void UndoManager::updateActions() {
undoAction_->setEnabled(head_>0);
redoAction_->setEnabled(head_ >= -1 && head_ < static_cast<DiffType>(undoBuffer_.size()) - 1);
}
void UndoManager::onProcessorNetworkUnlocked() {
if (dirty_) pushState();
}
void UndoManager::onProcessorNetworkChange() {
dirty_ = true;
pushState();
}
void UndoManager::onProcessorNetworkDidAddProcessor(Processor* processor) {
dirty_ = true;
pushState();
}
void UndoManager::onProcessorNetworkDidRemoveProcessor(Processor* processor) {
dirty_ = true;
pushState();
}
void UndoManager::onProcessorNetworkDidAddConnection(const PortConnection& connection) {
dirty_ = true;
pushState();
}
void UndoManager::onProcessorNetworkDidRemoveConnection(const PortConnection& connection) {
dirty_ = true;
pushState();
}
void UndoManager::onProcessorNetworkDidAddLink(const PropertyLink& propertyLink) {
dirty_ = true;
pushState();
}
void UndoManager::onProcessorNetworkDidRemoveLink(const PropertyLink& propertyLink) {
dirty_ = true;
pushState();
}
} // namespace
<|endoftext|>
|
<commit_before>#include "qt/pivx/privacywidget.h"
#include "qt/pivx/forms/ui_privacywidget.h"
#include <QFile>
#include "qt/pivx/qtutils.h"
#include "guiutil.h"
#include "qt/pivx/coincontrolzpivdialog.h"
#include "qt/pivx/denomgenerationdialog.h"
#include <QGraphicsDropShadowEffect>
#include "qt/pivx/defaultdialog.h"
#include "qt/pivx/furlistrow.h"
#include "qt/pivx/txviewholder.h"
#include "walletmodel.h"
#include "optionsmodel.h"
#include "coincontroldialog.h"
#define DECORATION_SIZE 70
#define NUM_ITEMS 3
PrivacyWidget::PrivacyWidget(PIVXGUI* _window, QWidget *parent) :
QWidget(parent),
ui(new Ui::PrivacyWidget),
window(_window)
{
ui->setupUi(this);
this->setStyleSheet(_window->styleSheet());
/* Containers */
ui->left->setProperty("cssClass", "container");
ui->left->setContentsMargins(0,20,0,20);
ui->right->setProperty("cssClass", "container-right");
ui->right->setContentsMargins(20,10,20,20);
/* Light Font */
QFont fontLight;
fontLight.setWeight(QFont::Light);
/* Title */
ui->labelTitle->setText("Privacy");
ui->labelTitle->setProperty("cssClass", "text-title-screen");
ui->labelTitle->setFont(fontLight);
/* Button Group */
ui->pushLeft->setText("Convert");
ui->pushLeft->setProperty("cssClass", "btn-check-left");
ui->pushRight->setText("Mint");
ui->pushRight->setProperty("cssClass", "btn-check-right");
/* Subtitle */
ui->labelSubtitle1->setText("Minting zPIV anonymizes your PIV by removing\ntransaction history, making transactions untraceable ");
ui->labelSubtitle1->setProperty("cssClass", "text-subtitle");
ui->labelSubtitle2->setText("Mint new zPIV or convert back to PIV");
ui->labelSubtitle2->setProperty("cssClass", "text-subtitle");
ui->labelSubtitle2->setContentsMargins(0,2,0,0);
/* Amount */
ui->labelSubtitleAmount->setText("Enter amount of PIV to mint into zPIV ");
ui->labelSubtitleAmount->setProperty("cssClass", "text-title");
QGraphicsDropShadowEffect* shadowEffect = new QGraphicsDropShadowEffect();
shadowEffect->setColor(QColor(0, 0, 0, 22));
shadowEffect->setXOffset(0);
shadowEffect->setYOffset(3);
shadowEffect->setBlurRadius(6);
ui->lineEditAmount->setPlaceholderText("0.00 PIV ");
ui->lineEditAmount->setProperty("cssClass", "edit-primary");
ui->lineEditAmount->setAttribute(Qt::WA_MacShowFocusRect, 0);
ui->lineEditAmount->setGraphicsEffect(shadowEffect);
/* Denom */
ui->labelTitleDenom1->setText("Denom. with value 1:");
ui->labelTitleDenom1->setProperty("cssClass", "text-subtitle");
ui->labelValueDenom1->setText("0x1 = 0 zPIV");
ui->labelValueDenom1->setProperty("cssClass", "text-body2");
ui->labelTitleDenom5->setText("Denom. with value 5:");
ui->labelTitleDenom5->setProperty("cssClass", "text-subtitle");
ui->labelValueDenom5->setText("0x5 = 0 zPIV");
ui->labelValueDenom5->setProperty("cssClass", "text-body2");
ui->labelTitleDenom10->setText("Denom. with value 10:");
ui->labelTitleDenom10->setProperty("cssClass", "text-subtitle");
ui->labelValueDenom10->setText("0x10 = 0 zPIV");
ui->labelValueDenom10->setProperty("cssClass", "text-body2");
ui->labelTitleDenom50->setText("Denom. with value 50:");
ui->labelTitleDenom50->setProperty("cssClass", "text-subtitle");
ui->labelValueDenom50->setText("0x50 = 0 zPIV");
ui->labelValueDenom50->setProperty("cssClass", "text-body2");
ui->labelTitleDenom100->setText("Denom. with value 100:");
ui->labelTitleDenom100->setProperty("cssClass", "text-subtitle");
ui->labelValueDenom100->setText("0x100 = 0 zPIV");
ui->labelValueDenom100->setProperty("cssClass", "text-body2");
ui->labelTitleDenom500->setText("Denom. with value 500:");
ui->labelTitleDenom500->setProperty("cssClass", "text-subtitle");
ui->labelValueDenom500->setText("0x500 = 0 zPIV");
ui->labelValueDenom500->setProperty("cssClass", "text-body2");
ui->labelTitleDenom1000->setText("Denom. with value 1000:");
ui->labelTitleDenom1000->setProperty("cssClass", "text-subtitle");
ui->labelValueDenom1000->setText("0x1000 = 0 zPIV");
ui->labelValueDenom1000->setProperty("cssClass", "text-body2");
ui->labelTitleDenom5000->setText("Denom. with value 5000:");
ui->labelTitleDenom5000->setProperty("cssClass", "text-subtitle");
ui->labelValueDenom5000->setText("0x5000 = 0 zPIV");
ui->labelValueDenom5000->setProperty("cssClass", "text-body2");
ui->layoutDenom->setVisible(false);
// List
ui->labelListHistory->setText("Last Zerocoin Movements");
ui->labelListHistory->setProperty("cssClass", "text-title");
//ui->emptyContainer->setVisible(false);
ui->pushImgEmpty->setProperty("cssClass", "img-empty-privacy");
ui->labelEmpty->setText("No transactions yet");
ui->labelEmpty->setProperty("cssClass", "text-empty");
// Buttons
ui->pushButtonSave->setText("Mint to zPIV");
ui->pushButtonSave->setProperty("cssClass", "btn-primary");
ui->btnTotalzPIV->setTitleClassAndText("btn-title-grey", "Total zPIV 1000");
ui->btnTotalzPIV->setSubTitleClassAndText("text-subtitle", "Show own coins denominations.");
ui->btnTotalzPIV->setRightIconClass("btn-dropdown");
ui->btnCoinControl->setTitleClassAndText("btn-title-grey", "Coin Control");
ui->btnCoinControl->setSubTitleClassAndText("text-subtitle", "Select PIV outputs to mint into zPIV.");
ui->btnDenomGeneration->setTitleClassAndText("btn-title-grey", "Denom generation");
ui->btnDenomGeneration->setSubTitleClassAndText("text-subtitle", "Select the denomination of the coins.");
ui->btnRescanMints->setTitleClassAndText("btn-title-grey", "Rescan mints");
ui->btnRescanMints->setSubTitleClassAndText("text-subtitle", "Find mints in the blockchain.");
ui->btnResetZerocoin->setTitleClassAndText("btn-title-grey", "Reset Zerocoin");
ui->btnResetZerocoin->setSubTitleClassAndText("text-subtitle", "Reset zerocoin database.");
connect(ui->btnTotalzPIV, SIGNAL(clicked()), this, SLOT(onTotalZpivClicked()));
connect(ui->btnCoinControl, SIGNAL(clicked()), this, SLOT(onCoinControlClicked()));
connect(ui->btnDenomGeneration, SIGNAL(clicked()), this, SLOT(onDenomClicked()));
connect(ui->btnRescanMints, SIGNAL(clicked()), this, SLOT(onRescanMintsClicked()));
connect(ui->btnResetZerocoin, SIGNAL(clicked()), this, SLOT(onResetZeroClicked()));
// Style
connect(window, SIGNAL(themeChanged(bool, QString&)), this, SLOT(changeTheme(bool, QString&)));
// List
ui->listView->setProperty("cssClass", "container");
txHolder = new TxViewHolder(isLightTheme());
delegate = new FurAbstractListItemDelegate(
DECORATION_SIZE,
txHolder,
this
);
ui->listView->setItemDelegate(delegate);
ui->listView->setIconSize(QSize(DECORATION_SIZE, DECORATION_SIZE));
ui->listView->setMinimumHeight(NUM_ITEMS * (DECORATION_SIZE + 2));
ui->listView->setAttribute(Qt::WA_MacShowFocusRect, false);
ui->listView->setSelectionBehavior(QAbstractItemView::SelectRows);
}
void PrivacyWidget::setWalletModel(WalletModel* _model){
walletModel = _model;
if(walletModel) {
txModel = walletModel->getTransactionTableModel();
// Set up transaction list
filter = new TransactionFilterProxy();
filter->setSourceModel(txModel);
filter->sort(TransactionTableModel::Date, Qt::DescendingOrder);
filter->setShowZcTxes(true);
txHolder->setFilter(filter);
ui->listView->setModel(filter);
if (txModel->size() == 0) {
ui->emptyContainer->setVisible(true);
ui->listView->setVisible(false);
// TODO: Connect waiting for tx updates..
}else{
// TODO: Use show list method..
ui->emptyContainer->setVisible(false);
ui->listView->setVisible(true);
}
connect(ui->pushButtonSave, SIGNAL(clicked()), this, SLOT(onMintClicked()));
}
}
void PrivacyWidget::showList(){
// TODO: here if there is a zc mint/spend here
ui->emptyContainer->setVisible(false);
ui->listView->setVisible(true);
}
void PrivacyWidget::onTotalZpivClicked(){
bool isVisible = ui->layoutDenom->isVisible();
if(!isVisible){
ui->layoutDenom->setVisible(true);
}else{
ui->layoutDenom->setVisible(false);
}
}
void PrivacyWidget::onMintClicked(){
if (!walletModel || !walletModel->getOptionsModel())
return;
if(GetAdjustedTime() > GetSporkValue(SPORK_16_ZEROCOIN_MAINTENANCE_MODE)) {
emit message(tr("Mint Zerocoin"), tr("Transaction sent"), CClientUIInterface::MSG_ERROR);
return;
}
if(!GUIUtil::requestUnlock(walletModel, AskPassphraseDialog::Context::Mint_zPIV, true)){
emit message("", tr("You need to unlock the wallet to be able to mint zPIV"), CClientUIInterface::MSG_INFORMATION);
return;
}
bool isValid = true;
CAmount value = GUIUtil::parseValue(
ui->lineEditAmount->text(),
walletModel->getOptionsModel()->getDisplayUnit(),
&isValid
);
if (value <= 0) {
setCssEditLine(ui->lineEditAmount, false, true);
emit message("", tr("Invalid value"), CClientUIInterface::MSG_INFORMATION);
}
// TODO: Launch confirmation dialog here..
std::string strError;
if(!walletModel->mintCoins(value, CoinControlDialog::coinControl, strError)){
emit message("", tr(strError.data()), CClientUIInterface::MSG_INFORMATION);
}else{
// Mint succeed
emit message("", tr("zPIV minted successfully"), CClientUIInterface::MSG_INFORMATION);
// clear
ui->lineEditAmount->clear();
}
}
void PrivacyWidget::onCoinControlClicked(){
window->showHide(true);
CoinControlZpivDialog* dialog = new CoinControlZpivDialog(window);
openDialogWithOpaqueBackgroundY(dialog, window, 4.5, 5);
}
void PrivacyWidget::onDenomClicked(){
window->showHide(true);
DenomGenerationDialog* dialog = new DenomGenerationDialog(window);
openDialogWithOpaqueBackgroundY(dialog, window, 4.5, 5);
}
void PrivacyWidget::onRescanMintsClicked(){
window->showHide(true);
DefaultDialog* dialog = new DefaultDialog(window);
openDialogWithOpaqueBackgroundY(dialog, window, 4.5, 5);
}
void PrivacyWidget::onResetZeroClicked(){
window->showHide(true);
DefaultDialog* dialog = new DefaultDialog(window);
openDialogWithOpaqueBackgroundY(dialog, window, 4.5, 5);
}
void PrivacyWidget::changeTheme(bool isLightTheme, QString& theme){
// Change theme in all of the childs here..
this->setStyleSheet(theme);
static_cast<TxViewHolder*>(this->delegate->getRowFactory())->isLightTheme = isLightTheme;
ui->listView->update();
updateStyle(this);
}
PrivacyWidget::~PrivacyWidget()
{
delete ui;
}
<commit_msg>privacy view, spork blocking mint + display unit<commit_after>#include "qt/pivx/privacywidget.h"
#include "qt/pivx/forms/ui_privacywidget.h"
#include <QFile>
#include "qt/pivx/qtutils.h"
#include "guiutil.h"
#include "qt/pivx/coincontrolzpivdialog.h"
#include "qt/pivx/denomgenerationdialog.h"
#include <QGraphicsDropShadowEffect>
#include "qt/pivx/defaultdialog.h"
#include "qt/pivx/furlistrow.h"
#include "qt/pivx/txviewholder.h"
#include "walletmodel.h"
#include "optionsmodel.h"
#include "coincontroldialog.h"
#define DECORATION_SIZE 70
#define NUM_ITEMS 3
PrivacyWidget::PrivacyWidget(PIVXGUI* _window, QWidget *parent) :
QWidget(parent),
ui(new Ui::PrivacyWidget),
window(_window)
{
ui->setupUi(this);
this->setStyleSheet(_window->styleSheet());
/* Containers */
ui->left->setProperty("cssClass", "container");
ui->left->setContentsMargins(0,20,0,20);
ui->right->setProperty("cssClass", "container-right");
ui->right->setContentsMargins(20,10,20,20);
/* Light Font */
QFont fontLight;
fontLight.setWeight(QFont::Light);
/* Title */
ui->labelTitle->setText("Privacy");
ui->labelTitle->setProperty("cssClass", "text-title-screen");
ui->labelTitle->setFont(fontLight);
/* Button Group */
ui->pushLeft->setText("Convert");
ui->pushLeft->setProperty("cssClass", "btn-check-left");
ui->pushRight->setText("Mint");
ui->pushRight->setProperty("cssClass", "btn-check-right");
/* Subtitle */
ui->labelSubtitle1->setText("Minting zPIV anonymizes your PIV by removing\ntransaction history, making transactions untraceable ");
ui->labelSubtitle1->setProperty("cssClass", "text-subtitle");
ui->labelSubtitle2->setText("Mint new zPIV or convert back to PIV");
ui->labelSubtitle2->setProperty("cssClass", "text-subtitle");
ui->labelSubtitle2->setContentsMargins(0,2,0,0);
/* Amount */
ui->labelSubtitleAmount->setText("Enter amount of PIV to mint into zPIV ");
ui->labelSubtitleAmount->setProperty("cssClass", "text-title");
QGraphicsDropShadowEffect* shadowEffect = new QGraphicsDropShadowEffect();
shadowEffect->setColor(QColor(0, 0, 0, 22));
shadowEffect->setXOffset(0);
shadowEffect->setYOffset(3);
shadowEffect->setBlurRadius(6);
ui->lineEditAmount->setPlaceholderText("0.00 PIV ");
ui->lineEditAmount->setProperty("cssClass", "edit-primary");
ui->lineEditAmount->setAttribute(Qt::WA_MacShowFocusRect, 0);
ui->lineEditAmount->setGraphicsEffect(shadowEffect);
/* Denom */
ui->labelTitleDenom1->setText("Denom. with value 1:");
ui->labelTitleDenom1->setProperty("cssClass", "text-subtitle");
ui->labelValueDenom1->setText("0x1 = 0 zPIV");
ui->labelValueDenom1->setProperty("cssClass", "text-body2");
ui->labelTitleDenom5->setText("Denom. with value 5:");
ui->labelTitleDenom5->setProperty("cssClass", "text-subtitle");
ui->labelValueDenom5->setText("0x5 = 0 zPIV");
ui->labelValueDenom5->setProperty("cssClass", "text-body2");
ui->labelTitleDenom10->setText("Denom. with value 10:");
ui->labelTitleDenom10->setProperty("cssClass", "text-subtitle");
ui->labelValueDenom10->setText("0x10 = 0 zPIV");
ui->labelValueDenom10->setProperty("cssClass", "text-body2");
ui->labelTitleDenom50->setText("Denom. with value 50:");
ui->labelTitleDenom50->setProperty("cssClass", "text-subtitle");
ui->labelValueDenom50->setText("0x50 = 0 zPIV");
ui->labelValueDenom50->setProperty("cssClass", "text-body2");
ui->labelTitleDenom100->setText("Denom. with value 100:");
ui->labelTitleDenom100->setProperty("cssClass", "text-subtitle");
ui->labelValueDenom100->setText("0x100 = 0 zPIV");
ui->labelValueDenom100->setProperty("cssClass", "text-body2");
ui->labelTitleDenom500->setText("Denom. with value 500:");
ui->labelTitleDenom500->setProperty("cssClass", "text-subtitle");
ui->labelValueDenom500->setText("0x500 = 0 zPIV");
ui->labelValueDenom500->setProperty("cssClass", "text-body2");
ui->labelTitleDenom1000->setText("Denom. with value 1000:");
ui->labelTitleDenom1000->setProperty("cssClass", "text-subtitle");
ui->labelValueDenom1000->setText("0x1000 = 0 zPIV");
ui->labelValueDenom1000->setProperty("cssClass", "text-body2");
ui->labelTitleDenom5000->setText("Denom. with value 5000:");
ui->labelTitleDenom5000->setProperty("cssClass", "text-subtitle");
ui->labelValueDenom5000->setText("0x5000 = 0 zPIV");
ui->labelValueDenom5000->setProperty("cssClass", "text-body2");
ui->layoutDenom->setVisible(false);
// List
ui->labelListHistory->setText("Last Zerocoin Movements");
ui->labelListHistory->setProperty("cssClass", "text-title");
//ui->emptyContainer->setVisible(false);
ui->pushImgEmpty->setProperty("cssClass", "img-empty-privacy");
ui->labelEmpty->setText("No transactions yet");
ui->labelEmpty->setProperty("cssClass", "text-empty");
// Buttons
ui->pushButtonSave->setText("Mint to zPIV");
ui->pushButtonSave->setProperty("cssClass", "btn-primary");
ui->btnTotalzPIV->setTitleClassAndText("btn-title-grey", "Total zPIV 1000");
ui->btnTotalzPIV->setSubTitleClassAndText("text-subtitle", "Show own coins denominations.");
ui->btnTotalzPIV->setRightIconClass("btn-dropdown");
ui->btnCoinControl->setTitleClassAndText("btn-title-grey", "Coin Control");
ui->btnCoinControl->setSubTitleClassAndText("text-subtitle", "Select PIV outputs to mint into zPIV.");
ui->btnDenomGeneration->setTitleClassAndText("btn-title-grey", "Denom generation");
ui->btnDenomGeneration->setSubTitleClassAndText("text-subtitle", "Select the denomination of the coins.");
ui->btnRescanMints->setTitleClassAndText("btn-title-grey", "Rescan mints");
ui->btnRescanMints->setSubTitleClassAndText("text-subtitle", "Find mints in the blockchain.");
ui->btnResetZerocoin->setTitleClassAndText("btn-title-grey", "Reset Zerocoin");
ui->btnResetZerocoin->setSubTitleClassAndText("text-subtitle", "Reset zerocoin database.");
connect(ui->btnTotalzPIV, SIGNAL(clicked()), this, SLOT(onTotalZpivClicked()));
connect(ui->btnCoinControl, SIGNAL(clicked()), this, SLOT(onCoinControlClicked()));
connect(ui->btnDenomGeneration, SIGNAL(clicked()), this, SLOT(onDenomClicked()));
connect(ui->btnRescanMints, SIGNAL(clicked()), this, SLOT(onRescanMintsClicked()));
connect(ui->btnResetZerocoin, SIGNAL(clicked()), this, SLOT(onResetZeroClicked()));
// Style
connect(window, SIGNAL(themeChanged(bool, QString&)), this, SLOT(changeTheme(bool, QString&)));
// List
ui->listView->setProperty("cssClass", "container");
txHolder = new TxViewHolder(isLightTheme());
delegate = new FurAbstractListItemDelegate(
DECORATION_SIZE,
txHolder,
this
);
ui->listView->setItemDelegate(delegate);
ui->listView->setIconSize(QSize(DECORATION_SIZE, DECORATION_SIZE));
ui->listView->setMinimumHeight(NUM_ITEMS * (DECORATION_SIZE + 2));
ui->listView->setAttribute(Qt::WA_MacShowFocusRect, false);
ui->listView->setSelectionBehavior(QAbstractItemView::SelectRows);
}
void PrivacyWidget::setWalletModel(WalletModel* _model){
walletModel = _model;
if(walletModel) {
txModel = walletModel->getTransactionTableModel();
// Set up transaction list
filter = new TransactionFilterProxy();
filter->setSourceModel(txModel);
filter->sort(TransactionTableModel::Date, Qt::DescendingOrder);
filter->setShowZcTxes(true);
txHolder->setDisplayUnit(walletModel->getOptionsModel()->getDisplayUnit());
txHolder->setFilter(filter);
ui->listView->setModel(filter);
if (txModel->size() == 0) {
ui->emptyContainer->setVisible(true);
ui->listView->setVisible(false);
// TODO: Connect waiting for tx updates..
}else{
// TODO: Use show list method..
ui->emptyContainer->setVisible(false);
ui->listView->setVisible(true);
}
connect(ui->pushButtonSave, SIGNAL(clicked()), this, SLOT(onMintClicked()));
// TODO: Connect update display unit..
}
}
void PrivacyWidget::updateDisplayUnit() {
if (walletModel && walletModel->getOptionsModel()) {
nDisplayUnit = walletModel->getOptionsModel()->getDisplayUnit();
txHolder->setDisplayUnit(nDisplayUnit);
ui->listView->update();
}
}
void PrivacyWidget::showList(){
// TODO: here if there is a zc mint/spend here
ui->emptyContainer->setVisible(false);
ui->listView->setVisible(true);
}
void PrivacyWidget::onTotalZpivClicked(){
bool isVisible = ui->layoutDenom->isVisible();
if(!isVisible){
ui->layoutDenom->setVisible(true);
}else{
ui->layoutDenom->setVisible(false);
}
}
void PrivacyWidget::onMintClicked(){
if (!walletModel || !walletModel->getOptionsModel())
return;
if(GetAdjustedTime() > GetSporkValue(SPORK_16_ZEROCOIN_MAINTENANCE_MODE)) {
emit message(tr("Mint Zerocoin"), tr("zPIV is currently undergoing maintenance"), CClientUIInterface::MSG_ERROR);
return;
}
if(!GUIUtil::requestUnlock(walletModel, AskPassphraseDialog::Context::Mint_zPIV, true)){
emit message("", tr("You need to unlock the wallet to be able to mint zPIV"), CClientUIInterface::MSG_INFORMATION);
return;
}
bool isValid = true;
CAmount value = GUIUtil::parseValue(
ui->lineEditAmount->text(),
walletModel->getOptionsModel()->getDisplayUnit(),
&isValid
);
if (value <= 0) {
setCssEditLine(ui->lineEditAmount, false, true);
emit message("", tr("Invalid value"), CClientUIInterface::MSG_INFORMATION);
}
// TODO: Launch confirmation dialog here..
std::string strError;
if(!walletModel->mintCoins(value, CoinControlDialog::coinControl, strError)){
emit message("", tr(strError.data()), CClientUIInterface::MSG_INFORMATION);
}else{
// Mint succeed
emit message("", tr("zPIV minted successfully"), CClientUIInterface::MSG_INFORMATION);
// clear
ui->lineEditAmount->clear();
}
}
void PrivacyWidget::onCoinControlClicked(){
window->showHide(true);
CoinControlZpivDialog* dialog = new CoinControlZpivDialog(window);
openDialogWithOpaqueBackgroundY(dialog, window, 4.5, 5);
}
void PrivacyWidget::onDenomClicked(){
window->showHide(true);
DenomGenerationDialog* dialog = new DenomGenerationDialog(window);
openDialogWithOpaqueBackgroundY(dialog, window, 4.5, 5);
}
void PrivacyWidget::onRescanMintsClicked(){
window->showHide(true);
DefaultDialog* dialog = new DefaultDialog(window);
openDialogWithOpaqueBackgroundY(dialog, window, 4.5, 5);
}
void PrivacyWidget::onResetZeroClicked(){
window->showHide(true);
DefaultDialog* dialog = new DefaultDialog(window);
openDialogWithOpaqueBackgroundY(dialog, window, 4.5, 5);
}
void PrivacyWidget::changeTheme(bool isLightTheme, QString& theme){
// Change theme in all of the childs here..
this->setStyleSheet(theme);
static_cast<TxViewHolder*>(this->delegate->getRowFactory())->isLightTheme = isLightTheme;
ui->listView->update();
updateStyle(this);
}
PrivacyWidget::~PrivacyWidget()
{
delete ui;
}
<|endoftext|>
|
<commit_before>#include "analysisoverlay.h"
/**
* @brief AnalysisOverlay::AnalysisOverlay
*/
AnalysisOverlay::AnalysisOverlay() {
// Temporary areas to show, since there's no analysis yet.
add_area(2, cv::Point(50,50), cv::Point(150,150));
add_area(3, cv::Point(50,50), cv::Point(150,150));
add_area(4, cv::Point(50,50), cv::Point(150,150));
add_area(5, cv::Point(50,50), cv::Point(150,150));
add_area(6, cv::Point(50,50), cv::Point(150,150));
add_area(7, cv::Point(50,50), cv::Point(150,150));
add_area(8, cv::Point(50,50), cv::Point(150,150));
add_area(9, cv::Point(50,50), cv::Point(150,150));
add_area(10, cv::Point(150,150), cv::Point(250,170));
}
/**
* @brief AnalysisOverlay::draw_overlay
* Draws an overlay with the detected areas, on top of the specified frame.
* @param img Frame to draw on
* @param frame_nr Number of the frame currently shown in the video.
*/
cv::Mat AnalysisOverlay::draw_overlay(cv::Mat &frame, int frame_nr) {
if (showing_overlay) {
for (std::pair<cv::Point, cv::Point> area : detections[frame_nr]) {
cv::Rect rect(area.first, area.second);
cv::rectangle(frame, rect, cv::Scalar(255, 0, 0), 5);
}
}
return frame;
}
/**
* @brief AnalysisOverlay::add_area
* @param frame_nr Frame associated with the area.
* @param start Start point.
* @param end End point.
*/
void AnalysisOverlay::add_area(int frame_nr, cv::Point start, cv::Point end) {
std::pair <cv::Point, cv::Point> pair(start, end);
detections[frame_nr].push_back(pair);
}
/**
* @brief AnalysisOverlay::is_showing_overlay
* @return Returns true if the analysis overlay is showing, else false.
*/
bool AnalysisOverlay::is_showing_overlay() {
return showing_overlay;
}
/**
* @brief AnalysisOverlay::toggle_showing
*/
void AnalysisOverlay::toggle_showing() {
showing_overlay = !showing_overlay;
}
<commit_msg>Edited comment.<commit_after>#include "analysisoverlay.h"
/**
* @brief AnalysisOverlay::AnalysisOverlay
*/
AnalysisOverlay::AnalysisOverlay() {
// Temporary areas to show, since there's no analysis yet.
add_area(2, cv::Point(50,50), cv::Point(150,150));
add_area(3, cv::Point(50,50), cv::Point(150,150));
add_area(4, cv::Point(50,50), cv::Point(150,150));
add_area(5, cv::Point(50,50), cv::Point(150,150));
add_area(6, cv::Point(50,50), cv::Point(150,150));
add_area(7, cv::Point(50,50), cv::Point(150,150));
add_area(8, cv::Point(50,50), cv::Point(150,150));
add_area(9, cv::Point(50,50), cv::Point(150,150));
add_area(10, cv::Point(150,150), cv::Point(250,170));
}
/**
* @brief AnalysisOverlay::draw_overlay
* Draws an overlay with the detected areas, on top of the specified frame.
* @param frame Frame to draw on.
* @param frame_nr Number of the frame currently shown in the video.
* @return Returns the frame with the overlay.
*/
cv::Mat AnalysisOverlay::draw_overlay(cv::Mat &frame, int frame_nr) {
if (showing_overlay) {
for (std::pair<cv::Point, cv::Point> area : detections[frame_nr]) {
cv::Rect rect(area.first, area.second);
cv::rectangle(frame, rect, cv::Scalar(255, 0, 0), 5);
}
}
return frame;
}
/**
* @brief AnalysisOverlay::add_area
* @param frame_nr Frame associated with the area.
* @param start Start point.
* @param end End point.
*/
void AnalysisOverlay::add_area(int frame_nr, cv::Point start, cv::Point end) {
std::pair <cv::Point, cv::Point> pair(start, end);
detections[frame_nr].push_back(pair);
}
/**
* @brief AnalysisOverlay::is_showing_overlay
* @return Returns true if the analysis overlay is showing, else false.
*/
bool AnalysisOverlay::is_showing_overlay() {
return showing_overlay;
}
/**
* @brief AnalysisOverlay::toggle_showing
*/
void AnalysisOverlay::toggle_showing() {
showing_overlay = !showing_overlay;
}
<|endoftext|>
|
<commit_before>// trance linux.hpp - Configuration for Linux
//
// Copyright (c) 2011 - 2011 Kohei Takahashi (Flast)
//
// 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 IG_TRANCE_IOSTREAMS_DETAIL_LINUX_HPP_ONCE_
#define IG_TRANCE_IOSTREAMS_DETAIL_LINUX_HPP_ONCE_
#include <trance/config.hpp>
#include <cstddef>
#include <iosfwd>
#include <boost/cstdint.hpp>
#include <boost/preprocessor/cat.hpp>
#include <boost/preprocessor/repeat.hpp>
#include <boost/preprocessor/tuple/elem.hpp>
namespace trance
{
namespace iostreams
{
#define TRANCE_IOSTREAMS_CLEAR_MANIPS_INFO \
( "trance/iostreams/detail/string_manip.hpp", \
6, \
( \
( clear_below, "[0J" ), \
( clear_above, "[1J" ), \
( clear , "[2J" ), \
( clear_right, "[0K" ), \
( clear_left , "[1K" ), \
( clear_line , "[2K" )) \
) \
#define TRANCE_IOSTREAMS_MOVE_IMPL( _suf ) \
TRANCE_IOSTREAMS_MANIP_LAMBDA< \
unsigned int, \
iostreams_detail::_detail::_square_bracket, \
iostreams_detail::_detail::_suf \
> \
#define TRANCE_IOSTREAMS_MOVE_1DIM_MANIPS_INFO \
( "trance/iostreams/detail/param_manip.hpp", \
4, \
( \
( move_up , (TRANCE_IOSTREAMS_MOVE_IMPL( _put_A )) ), \
( move_down , (TRANCE_IOSTREAMS_MOVE_IMPL( _put_B )) ), \
( move_right, (TRANCE_IOSTREAMS_MOVE_IMPL( _put_C )) ), \
( move_left , (TRANCE_IOSTREAMS_MOVE_IMPL( _put_D )) )) \
) \
#define TRANCE_IOSTREAMS_MOVE_UPDOWN_MANIPS_INFO \
( "trance/iostreams/detail/string_manip.hpp", \
3, \
( \
( move_down1, "D" ), \
( new_line , "E" ), \
( move_up1 , "M" )) \
) \
namespace iostreams_detail
{
namespace _detail
{
#define ESC_SEQ_INITIALIZER_DEF( _unused_z, i_, _unused_param ) \
template < typename CharTraits > \
inline ::std::basic_ostream< \
TRANCE_IOSTREAMS_GET_CHAR_TYPE( i_ ), \
CharTraits \
> & \
_esc_seq_initializer( \
::std::basic_ostream< \
TRANCE_IOSTREAMS_GET_CHAR_TYPE( i_ ), \
CharTraits \
> &_ostr ) \
{ \
_ostr << TRANCE_IOSTREAMS_GET_CHAR_FORWARD( i_ )( '\x1b' ); \
return _ostr; \
} \
BOOST_PP_REPEAT( TRANCE_IOSTREAMS_CHAR_TUPLE_SIZE, ESC_SEQ_INITIALIZER_DEF, _ )
#undef ESC_SEQ_INITIALIZER_DEF
// nothing to do
template < typename CharT, typename CharTraits >
inline ::std::basic_ostream< CharT, CharTraits > &
_esc_seq_finalizer( ::std::basic_ostream< CharT, CharTraits > &_ostr )
{ return _ostr; }
#define ENTRY_OPERATOR_DETAIL( _suf, _type, _forward ) \
template < typename CharTraits > \
::std::basic_ostream< _type, CharTraits > & \
operator()( ::std::basic_ostream< _type, CharTraits > &_ostr ) const \
{ return _ostr << BOOST_PP_CAT( TRANCE_IOSTREAMS_, _forward )( _suf ); } \
#define ENTRY_IMPL( _entry, _char ) \
struct _entry \
{ \
ENTRY_OPERATOR_DETAIL( _char, char , CHAR_FORWARD ) \
ENTRY_OPERATOR_DETAIL( _char, wchar_t , WCHAR_T_FORWARD ) \
TRANCE_IOSTREAMS_ENABLE_IF_HAS_CHAR16_T( \
ENTRY_OPERATOR_DETAIL( _char, char16_t, CHAR16_T_FORWARD ) ) \
TRANCE_IOSTREAMS_ENABLE_IF_HAS_CHAR32_T( \
ENTRY_OPERATOR_DETAIL( _char, char32_t, CHAR32_T_FORWARD ) ) \
} \
_ENTRY_IMPL( _square_bracket, '[' );
_ENTRY_IMPL( _put_A, 'A' );
_ENTRY_IMPL( _put_B, 'B' );
_ENTRY_IMPL( _put_C, 'C' );
_ENTRY_IMPL( _put_D, 'D' );
#undef ENTRY_IMPL
#undef ENTRY_OPERATOR_DETAIL
inline size_t
_find_ntz( ::boost::uint8_t _x ) TRANCE_NOEXCEPT
{
::std::size_t i = 0;
for ( ; !( _x & 1 ); ++i, _x >>= 1 );
return i;
}
template < typename Attribute >
inline ::boost::uint8_t
_mask( typename Attribute::value_type _x ) TRANCE_NOEXCEPT
{ return _x & ( ( 1u << 8 ) - 1 ); }
#define INSERT_SEMICOLON_WHEN( begin, itr ) \
if ( begin == itr ) {} else *itr++ = ';'
template < typename CharT >
inline void
_insert_when( ::boost::uint8_t pred,
CharT * const begin, CharT *&itr, const CharT value ) TRANCE_NOEXCEPT
{
if ( !pred )
{ return; }
INSERT_SEMICOLON_WHEN( begin, itr );
*itr++ = value;
*itr++ = '0' + _find_ntz( pred );
}
} // namespace _detail
template < typename CharT, typename Traits, typename Attribute >
inline ::std::basic_ostream< CharT, Traits > &
operator<<( ::std::basic_ostream< CharT, Traits > &_ostr,
const _attribute_forwarder< Attribute > &_af )
{
CharT _buf[ 16 ] = { '\x1b', '[' };
CharT *itr = _buf + 2;
if ( _af._m_value == Attribute::reset )
{ *itr++ = '0'; }
else
{
using namespace _detail;
typedef ::boost::uint8_t mask_t( typename Attribute::value_type );
mask_t &mask = _mask< Attribute >;
if ( ::boost::uint8_t _tmp = mask( _af._m_value ) )
{
for ( CharT c = '1'; _tmp; _tmp >>= 1, ++c )
{
if ( _tmp & ~1 )
{ continue; }
INSERT_SEMICOLON_WHEN( _buf, itr );
*itr++ = c;
}
}
_insert_when( mask( _af._m_value >> 8 ), _buf, itr, '3' );
_insert_when( mask( _af._m_value >> 16 ), _buf, itr, '4' );
}
*itr = 'm';
_ostr << _buf;
return _ostr;
}
#undef INSERT_SEMICOLON_WHEN
} // namespace iostreams_detail
} // namespace iostreams
} // namespace trance
#endif // IG_TRANCE_IOSTREAMS_DETAIL_LINUX_HPP_ONCE_
<commit_msg>Fix compile error<commit_after>// trance linux.hpp - Configuration for Linux
//
// Copyright (c) 2011 - 2011 Kohei Takahashi (Flast)
//
// 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 IG_TRANCE_IOSTREAMS_DETAIL_LINUX_HPP_ONCE_
#define IG_TRANCE_IOSTREAMS_DETAIL_LINUX_HPP_ONCE_
#include <trance/config.hpp>
#include <cstddef>
#include <iosfwd>
#include <boost/cstdint.hpp>
#include <boost/preprocessor/cat.hpp>
#include <boost/preprocessor/repeat.hpp>
#include <boost/preprocessor/tuple/elem.hpp>
namespace trance
{
namespace iostreams
{
#define TRANCE_IOSTREAMS_CLEAR_MANIPS_INFO \
( "trance/iostreams/detail/string_manip.hpp", \
6, \
( \
( clear_below, "[0J" ), \
( clear_above, "[1J" ), \
( clear , "[2J" ), \
( clear_right, "[0K" ), \
( clear_left , "[1K" ), \
( clear_line , "[2K" )) \
) \
#define TRANCE_IOSTREAMS_MOVE_IMPL( _suf ) \
TRANCE_IOSTREAMS_MANIP_LAMBDA< \
unsigned int, \
iostreams_detail::_detail::_square_bracket, \
iostreams_detail::_detail::_suf \
> \
#define TRANCE_IOSTREAMS_MOVE_1DIM_MANIPS_INFO \
( "trance/iostreams/detail/param_manip.hpp", \
4, \
( \
( move_up , (TRANCE_IOSTREAMS_MOVE_IMPL( _put_A )) ), \
( move_down , (TRANCE_IOSTREAMS_MOVE_IMPL( _put_B )) ), \
( move_right, (TRANCE_IOSTREAMS_MOVE_IMPL( _put_C )) ), \
( move_left , (TRANCE_IOSTREAMS_MOVE_IMPL( _put_D )) )) \
) \
#define TRANCE_IOSTREAMS_MOVE_UPDOWN_MANIPS_INFO \
( "trance/iostreams/detail/string_manip.hpp", \
3, \
( \
( move_down1, "D" ), \
( new_line , "E" ), \
( move_up1 , "M" )) \
) \
namespace iostreams_detail
{
namespace _detail
{
#define ESC_SEQ_INITIALIZER_DEF( _unused_z, i_, _unused_param ) \
template < typename CharTraits > \
inline ::std::basic_ostream< \
TRANCE_IOSTREAMS_GET_CHAR_TYPE( i_ ), \
CharTraits \
> & \
_esc_seq_initializer( \
::std::basic_ostream< \
TRANCE_IOSTREAMS_GET_CHAR_TYPE( i_ ), \
CharTraits \
> &_ostr ) \
{ \
_ostr << TRANCE_IOSTREAMS_GET_CHAR_FORWARD( i_ )( '\x1b' ); \
return _ostr; \
} \
BOOST_PP_REPEAT( TRANCE_IOSTREAMS_CHAR_TUPLE_SIZE, ESC_SEQ_INITIALIZER_DEF, _ )
#undef ESC_SEQ_INITIALIZER_DEF
// nothing to do
template < typename CharT, typename CharTraits >
inline ::std::basic_ostream< CharT, CharTraits > &
_esc_seq_finalizer( ::std::basic_ostream< CharT, CharTraits > &_ostr )
{ return _ostr; }
#define ENTRY_OPERATOR_DETAIL( _suf, _type, _forward ) \
template < typename CharTraits > \
::std::basic_ostream< _type, CharTraits > & \
operator()( ::std::basic_ostream< _type, CharTraits > &_ostr ) const \
{ return _ostr << BOOST_PP_CAT( TRANCE_IOSTREAMS_, _forward )( _suf ); } \
#define ENTRY_IMPL( _entry, _char ) \
struct _entry \
{ \
ENTRY_OPERATOR_DETAIL( _char, char , CHAR_FORWARD ) \
ENTRY_OPERATOR_DETAIL( _char, wchar_t , WCHAR_T_FORWARD ) \
TRANCE_IOSTREAMS_ENABLE_IF_HAS_CHAR16_T( \
ENTRY_OPERATOR_DETAIL( _char, char16_t, CHAR16_T_FORWARD ) ) \
TRANCE_IOSTREAMS_ENABLE_IF_HAS_CHAR32_T( \
ENTRY_OPERATOR_DETAIL( _char, char32_t, CHAR32_T_FORWARD ) ) \
} \
ENTRY_IMPL( _square_bracket, '[' );
ENTRY_IMPL( _put_A, 'A' );
ENTRY_IMPL( _put_B, 'B' );
ENTRY_IMPL( _put_C, 'C' );
ENTRY_IMPL( _put_D, 'D' );
#undef ENTRY_IMPL
#undef ENTRY_OPERATOR_DETAIL
inline size_t
_find_ntz( ::boost::uint8_t _x ) TRANCE_NOEXCEPT
{
::std::size_t i = 0;
for ( ; !( _x & 1 ); ++i, _x >>= 1 );
return i;
}
template < typename Attribute >
inline ::boost::uint8_t
_mask( typename Attribute::value_type _x ) TRANCE_NOEXCEPT
{ return _x & ( ( 1u << 8 ) - 1 ); }
#define INSERT_SEMICOLON_WHEN( begin, itr ) \
if ( begin == itr ) {} else *itr++ = ';'
template < typename CharT >
inline void
_insert_when( ::boost::uint8_t pred,
CharT * const begin, CharT *&itr, const CharT value ) TRANCE_NOEXCEPT
{
if ( !pred )
{ return; }
INSERT_SEMICOLON_WHEN( begin, itr );
*itr++ = value;
*itr++ = '0' + _find_ntz( pred );
}
} // namespace _detail
template < typename CharT, typename Traits, typename Attribute >
inline ::std::basic_ostream< CharT, Traits > &
operator<<( ::std::basic_ostream< CharT, Traits > &_ostr,
const _attribute_forwarder< Attribute > &_af )
{
CharT _buf[ 16 ] = { '\x1b', '[' };
CharT *itr = _buf + 2;
if ( _af._m_value == Attribute::reset )
{ *itr++ = '0'; }
else
{
using namespace _detail;
typedef ::boost::uint8_t mask_t( typename Attribute::value_type );
mask_t &mask = _mask< Attribute >;
if ( ::boost::uint8_t _tmp = mask( _af._m_value ) )
{
for ( CharT c = '1'; _tmp; _tmp >>= 1, ++c )
{
if ( _tmp & ~1 )
{ continue; }
INSERT_SEMICOLON_WHEN( _buf, itr );
*itr++ = c;
}
}
_insert_when( mask( _af._m_value >> 8 ), _buf, itr, '3' );
_insert_when( mask( _af._m_value >> 16 ), _buf, itr, '4' );
}
*itr = 'm';
_ostr << _buf;
return _ostr;
}
#undef INSERT_SEMICOLON_WHEN
} // namespace iostreams_detail
} // namespace iostreams
} // namespace trance
#endif // IG_TRANCE_IOSTREAMS_DETAIL_LINUX_HPP_ONCE_
<|endoftext|>
|
<commit_before>/* Copyright 2014 - 2015 CyberTech Labs Ltd.
*
* 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 "src/mailboxServer.h"
#include "src/mailboxConnection.h"
#include <QtNetwork/QNetworkInterface>
#include <QtCore/QSettings>
#include <trikKernel/paths.h>
#include <QHostInfo>
#include <QsLog.h>
using namespace trikNetwork;
MailboxServer::MailboxServer(quint16 port)
: TrikServer([this] () { return connectionFactory(); })
, mHullNumber(0)
, mMyIp(determineMyIp())
, mMyPort(port)
{
setObjectName("MailboxServer");
qRegisterMetaType<QHostAddress>("QHostAddress");
loadSettings();
}
bool MailboxServer::isConnected()
{
bool result = false;
mKnownRobotsLock.lockForRead();
for (auto &&endpoint : mKnownRobots) {
const auto connection = this->connection(endpoint.ip, endpoint.port);
auto mailboxConnection = qobject_cast<MailboxConnection *>(connection);
if (mailboxConnection && mailboxConnection->isConnected()) {
result = true;
break;
}
}
mKnownRobotsLock.unlock();
return result;
}
int MailboxServer::hullNumber() const
{
return mHullNumber;
}
QHostAddress MailboxServer::serverIp()
{
mAuxiliaryInformationLock.lockForRead();
const auto result = mServerIp;
mAuxiliaryInformationLock.unlock();
return result;
}
QHostAddress MailboxServer::myIp() const
{
return mMyIp;
}
void MailboxServer::renewIp()
{
mMyIp = determineMyIp();
}
void MailboxServer::start()
{
startServer(mMyPort);
if (!mServerIp.isNull() && mMyIp == mSavedIp) {
connectTo(mServerIp, mServerPort);
}
}
void MailboxServer::setHullNumber(int hullNumber)
{
mHullNumber = hullNumber;
saveSettings();
forEveryConnection(
[this](Connection *connection) {
auto c = qobject_cast<MailboxConnection *>(connection);
QMetaObject::invokeMethod(c, [c,this]() { c->sendConnectionInfo(mMyIp, mMyPort, mHullNumber); });
}
, -1);
}
void MailboxServer::connectTo(const QString &ip, int port)
{
mAuxiliaryInformationLock.lockForRead();
auto server = mServerIp;
auto serverPort = mServerPort;
mAuxiliaryInformationLock.unlock();
if (server.toString() != ip || serverPort != port) {
mAuxiliaryInformationLock.lockForWrite();
mServerIp = QHostInfo::fromName(ip).addresses().first();
mServerPort = port;
mAuxiliaryInformationLock.unlock();
saveSettings();
}
QReadLocker l(&mAuxiliaryInformationLock);
connectTo(mServerIp, mServerPort);
}
void MailboxServer::connectTo(const QString &ip)
{
connectTo(ip, mMyPort);
}
Connection *MailboxServer::connectTo(const QHostAddress &ip, int port)
{
if (ip == mMyIp && port == mMyPort && isListening()) {
// do not connect to self
return nullptr;
}
const auto connectionObject = connection(ip, port);
if (connectionObject != nullptr) {
return connectionObject;
}
const auto c = new MailboxConnection();
connectConnection(c);
connect(this, &MailboxServer::startedConnection, c, [=]() {
c->connect(ip, port, mMyPort, mHullNumber);
});
startConnection(c);
return c;
}
Connection *MailboxServer::connectionFactory()
{
auto connection = new MailboxConnection();
QObject::connect(connection, &MailboxConnection::newConnection, this, &MailboxServer::onNewConnection);
connectConnection(connection);
return connection;
}
void MailboxServer::connectConnection(Connection * connection)
{
auto c = qobject_cast<MailboxConnection *>(connection);
connect(c, &MailboxConnection::connectionInfo, this, &MailboxServer::onConnectionInfo);
connect(c, &MailboxConnection::newData, this, &MailboxServer::onNewData);
}
QHostAddress MailboxServer::determineMyIp()
{
QList<QNetworkInterface> ifs {
// TRIK wlan0
QNetworkInterface::interfaceFromName("wlan0")
// Fallback to localhost
, QNetworkInterface::interfaceFromName("lo")
, QNetworkInterface::interfaceFromIndex(1)
};
for (auto &&interface : ifs) {
if (interface.isValid()) {
for (auto &&entry : interface.addressEntries()) {
const QHostAddress ip = entry.ip();
if (ip.protocol() == QAbstractSocket::IPv4Protocol) {
return ip;
}
}
}
}
return QHostAddress(); // Total fail
}
Connection *MailboxServer::prepareConnection(const QHostAddress &ip)
{
// First, trying to reuse existing connection.
const auto connectionObject = connection(ip);
if (connectionObject != nullptr) {
return connectionObject;
}
// Next, trying to create new connection to given IP. We need port, so checking if robot is known.
Endpoint targetEndpoint;
mKnownRobotsLock.lockForRead();
for (auto &&endpoint : mKnownRobots) {
if (endpoint.ip == ip) {
targetEndpoint = endpoint;
break;
}
}
mKnownRobotsLock.unlock();
if (targetEndpoint.ip.isNull()) {
QLOG_ERROR() << "Trying to connect to unknown robot, IP:" << ip;
return nullptr;
}
return connectTo(targetEndpoint.ip, targetEndpoint.port);
}
void MailboxServer::onNewConnection(const QHostAddress &ip, int clientPort, int serverPort, int hullNumber)
{
if (ip == mMyIp && serverPort == mMyPort ) {
/// Refuse to handle connections from ourselves.
return;
}
mKnownRobotsLock.lockForRead();
const auto knownRobot = mKnownRobots.contains(hullNumber, {ip, serverPort});
const auto endpoints = mKnownRobots.values();
mKnownRobotsLock.unlock();
if (!knownRobot) {
// Propagate information about newly connected robot through robot network.
forEveryConnection([ip, serverPort, hullNumber](Connection *connection) {
auto c = qobject_cast<MailboxConnection *>(connection);
QMetaObject::invokeMethod(c, [=]() {c->sendConnectionInfo(ip, serverPort, hullNumber);});
});
}
// Send known connection information to newly connected robot.
const auto c = qobject_cast<MailboxConnection *>(connection(ip, clientPort));
if (c != nullptr) {
mKnownRobotsLock.lockForRead();
for (const auto &endpoint : endpoints) {
QMetaObject::invokeMethod(c, [this, c, endpoint]() {
c->sendConnectionInfo(endpoint.ip, endpoint.port, mKnownRobots.key(endpoint));
});
}
// Send information about myself.
QMetaObject::invokeMethod(c, [this, c]() { c->sendSelfInfo(mHullNumber); });
mKnownRobotsLock.unlock();
} else {
QLOG_ERROR() << "Something went wrong, new connection to" << ip << ":" << clientPort << "is dead";
return;
}
if (!knownRobot) {
mKnownRobotsLock.lockForWrite();
mKnownRobots.insert(hullNumber, {ip, serverPort});
mKnownRobotsLock.unlock();
}
}
void MailboxServer::send(int hullNumber, const QString &message)
{
const auto data = QString("data:%1").arg(message).toUtf8();
forEveryConnection(
[data](Connection *c) {
QMetaObject::invokeMethod(c, [c, data]() { c->send(data); });
}
, hullNumber);
}
void MailboxServer::send(const QString &message)
{
send(-1, message);
}
void MailboxServer::onConnectionInfo(const QHostAddress &ip, int port, int hullNumber)
{
if (ip == mMyIp && port == mMyPort) {
return;
}
QVector<Endpoint> toDelete;
mKnownRobotsLock.lockForRead();
for (auto &&endpoint : mKnownRobots) {
if (endpoint == Endpoint{ip, port}) {
toDelete << endpoint;
}
}
mKnownRobotsLock.unlock();
mKnownRobotsLock.lockForWrite();
for (const auto &endpoint : toDelete) {
const auto keys = mKnownRobots.keys(endpoint);
for (const auto &key : keys) {
mKnownRobots.remove(key, endpoint);
}
}
mKnownRobots.insert(hullNumber, {ip, port});
mKnownRobotsLock.unlock();
}
void MailboxServer::onNewData(const QHostAddress &ip, int port, const QByteArray &data)
{
QLOG_INFO() << "New data received by a mailbox from " << ip << ":" << port << ", data is:" << data;
int senderHullNumber = -1;
mKnownRobotsLock.lockForRead();
for (const auto &endpoint : mKnownRobots) {
if (endpoint.ip == ip) {
senderHullNumber = mKnownRobots.key(endpoint);
}
}
mKnownRobotsLock.unlock();
if (senderHullNumber == -1) {
QLOG_INFO() << "Received message from" << ip << ":" << port << "which is unknown at the moment";
}
mMessagesQueueLock.lockForWrite();
mMessagesQueue.enqueue(data);
mMessagesQueueLock.unlock();
emit newMessage(senderHullNumber, QString(data));
}
bool MailboxServer::hasMessages()
{
mMessagesQueueLock.lockForRead();
const bool result = !mMessagesQueue.isEmpty();
mMessagesQueueLock.unlock();
return result;
}
QString MailboxServer::receive()
{
mMessagesQueueLock.lockForWrite();
QByteArray const result = !mMessagesQueue.isEmpty() ? mMessagesQueue.dequeue() : QByteArray();
mMessagesQueueLock.unlock();
return result;
}
bool MailboxServer::hasServer() const
{
return isListening();
}
void MailboxServer::loadSettings()
{
QWriteLocker l(&mAuxiliaryInformationLock);
QSettings settings(trikKernel::Paths::localSettings(), QSettings::IniFormat);
mHullNumber = settings.value("hullNumber", 0).toInt();
auto tryResolve = [](const QString &ipOrName) {
auto info = QHostInfo::fromName(ipOrName);
if (info.error() != QHostInfo::NoError || info.addresses().isEmpty()) {
QLOG_ERROR() << "Failed to get ip for " << ipOrName << ":" << info.error();
return QHostAddress();
} else {
return info.addresses().first();
}
};
mServerIp = tryResolve(settings.value("server", mMyIp.toString()).toString());
mServerPort = settings.value("serverPort", mMyPort).toInt();
mSavedIp = tryResolve(settings.value("localIp", mMyIp.toString()).toString());
}
void MailboxServer::saveSettings()
{
mAuxiliaryInformationLock.lockForRead();
QSettings settings(trikKernel::Paths::localSettings(), QSettings::IniFormat);
settings.setValue("hullNumber", mHullNumber);
settings.setValue("server", mServerIp.toString());
settings.setValue("serverPort", mServerPort);
settings.setValue("localIp", mMyIp.toString());
mAuxiliaryInformationLock.unlock();
}
void MailboxServer::forEveryConnection(const std::function<void(Connection *)> &method, int hullNumber)
{
mKnownRobotsLock.lockForRead();
const auto endpoints = hullNumber == -1 ? mKnownRobots.values() : mKnownRobots.values(hullNumber);
mKnownRobotsLock.unlock();
for (const auto &endpoint : endpoints) {
// We prepare only by IP because there was a check by a hull number.
const auto connection = prepareConnection(endpoint.ip);
if (connection == nullptr) {
QLOG_ERROR() << "Connection to" << endpoint.ip << ":" << endpoint.port << "is dead at the moment, message"
<< "is not delivered. Will try to reestablish connection on next send.";
} else {
if (connection->isConnected()) {
method(connection);
} else {
connect(connection, &Connection::connected, this, method);
}
}
}
}
<commit_msg>Style fixup<commit_after>/* Copyright 2014 - 2015 CyberTech Labs Ltd.
*
* 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 "src/mailboxServer.h"
#include "src/mailboxConnection.h"
#include <QtNetwork/QNetworkInterface>
#include <QtCore/QSettings>
#include <trikKernel/paths.h>
#include <QHostInfo>
#include <QsLog.h>
using namespace trikNetwork;
MailboxServer::MailboxServer(quint16 port)
: TrikServer([this] () { return connectionFactory(); })
, mHullNumber(0)
, mMyIp(determineMyIp())
, mMyPort(port)
{
setObjectName("MailboxServer");
qRegisterMetaType<QHostAddress>("QHostAddress");
loadSettings();
}
bool MailboxServer::isConnected()
{
bool result = false;
mKnownRobotsLock.lockForRead();
for (auto &&endpoint : mKnownRobots) {
const auto connection = this->connection(endpoint.ip, endpoint.port);
auto mailboxConnection = qobject_cast<MailboxConnection *>(connection);
if (mailboxConnection && mailboxConnection->isConnected()) {
result = true;
break;
}
}
mKnownRobotsLock.unlock();
return result;
}
int MailboxServer::hullNumber() const
{
return mHullNumber;
}
QHostAddress MailboxServer::serverIp()
{
mAuxiliaryInformationLock.lockForRead();
const auto result = mServerIp;
mAuxiliaryInformationLock.unlock();
return result;
}
QHostAddress MailboxServer::myIp() const
{
return mMyIp;
}
void MailboxServer::renewIp()
{
mMyIp = determineMyIp();
}
void MailboxServer::start()
{
startServer(mMyPort);
if (!mServerIp.isNull() && mMyIp == mSavedIp) {
connectTo(mServerIp, mServerPort);
}
}
void MailboxServer::setHullNumber(int hullNumber)
{
mHullNumber = hullNumber;
saveSettings();
forEveryConnection(
[this](Connection *connection) {
auto c = qobject_cast<MailboxConnection *>(connection);
QMetaObject::invokeMethod(c, [c,this]() { c->sendConnectionInfo(mMyIp, mMyPort, mHullNumber); });
}
, -1);
}
void MailboxServer::connectTo(const QString &ip, int port)
{
mAuxiliaryInformationLock.lockForRead();
auto server = mServerIp;
auto serverPort = mServerPort;
mAuxiliaryInformationLock.unlock();
if (server.toString() != ip || serverPort != port) {
mAuxiliaryInformationLock.lockForWrite();
mServerIp = QHostInfo::fromName(ip).addresses().first();
mServerPort = port;
mAuxiliaryInformationLock.unlock();
saveSettings();
}
QReadLocker l(&mAuxiliaryInformationLock);
connectTo(mServerIp, mServerPort);
}
void MailboxServer::connectTo(const QString &ip)
{
connectTo(ip, mMyPort);
}
Connection *MailboxServer::connectTo(const QHostAddress &ip, int port)
{
if (ip == mMyIp && port == mMyPort && isListening()) {
// do not connect to self
return nullptr;
}
if (auto connectionObject = connection(ip, port)) {
return connectionObject;
}
const auto c = new MailboxConnection();
connectConnection(c);
connect(this, &MailboxServer::startedConnection, c, [=]() {
c->connect(ip, port, mMyPort, mHullNumber);
});
startConnection(c);
return c;
}
Connection *MailboxServer::connectionFactory()
{
auto connection = new MailboxConnection();
QObject::connect(connection, &MailboxConnection::newConnection, this, &MailboxServer::onNewConnection);
connectConnection(connection);
return connection;
}
void MailboxServer::connectConnection(Connection * connection)
{
auto c = qobject_cast<MailboxConnection *>(connection);
connect(c, &MailboxConnection::connectionInfo, this, &MailboxServer::onConnectionInfo);
connect(c, &MailboxConnection::newData, this, &MailboxServer::onNewData);
}
QHostAddress MailboxServer::determineMyIp()
{
QList<QNetworkInterface> ifs {
// TRIK wlan0
QNetworkInterface::interfaceFromName("wlan0")
// Fallback to localhost
, QNetworkInterface::interfaceFromName("lo")
, QNetworkInterface::interfaceFromIndex(1)
};
for (auto &&interface : ifs) {
if (interface.isValid()) {
for (auto &&entry : interface.addressEntries()) {
const QHostAddress ip = entry.ip();
if (ip.protocol() == QAbstractSocket::IPv4Protocol) {
return ip;
}
}
}
}
return QHostAddress(); // Total fail
}
Connection *MailboxServer::prepareConnection(const QHostAddress &ip)
{
// First, trying to reuse existing connection.
const auto connectionObject = connection(ip);
if (connectionObject != nullptr) {
return connectionObject;
}
// Next, trying to create new connection to given IP. We need port, so checking if robot is known.
Endpoint targetEndpoint;
mKnownRobotsLock.lockForRead();
for (auto &&endpoint : mKnownRobots) {
if (endpoint.ip == ip) {
targetEndpoint = endpoint;
break;
}
}
mKnownRobotsLock.unlock();
if (targetEndpoint.ip.isNull()) {
QLOG_ERROR() << "Trying to connect to unknown robot, IP:" << ip;
return nullptr;
}
return connectTo(targetEndpoint.ip, targetEndpoint.port);
}
void MailboxServer::onNewConnection(const QHostAddress &ip, int clientPort, int serverPort, int hullNumber)
{
if (ip == mMyIp && serverPort == mMyPort ) {
/// Refuse to handle connections from ourselves.
return;
}
mKnownRobotsLock.lockForRead();
const auto knownRobot = mKnownRobots.contains(hullNumber, {ip, serverPort});
const auto endpoints = mKnownRobots.values();
mKnownRobotsLock.unlock();
if (!knownRobot) {
// Propagate information about newly connected robot through robot network.
forEveryConnection([ip, serverPort, hullNumber](Connection *connection) {
auto c = qobject_cast<MailboxConnection *>(connection);
QMetaObject::invokeMethod(c, [=]() {c->sendConnectionInfo(ip, serverPort, hullNumber);});
});
}
// Send known connection information to newly connected robot.
const auto c = qobject_cast<MailboxConnection *>(connection(ip, clientPort));
if (c != nullptr) {
mKnownRobotsLock.lockForRead();
for (const auto &endpoint : endpoints) {
QMetaObject::invokeMethod(c, [this, c, endpoint]() {
c->sendConnectionInfo(endpoint.ip, endpoint.port, mKnownRobots.key(endpoint));
});
}
// Send information about myself.
QMetaObject::invokeMethod(c, [this, c]() { c->sendSelfInfo(mHullNumber); });
mKnownRobotsLock.unlock();
} else {
QLOG_ERROR() << "Something went wrong, new connection to" << ip << ":" << clientPort << "is dead";
return;
}
if (!knownRobot) {
mKnownRobotsLock.lockForWrite();
mKnownRobots.insert(hullNumber, {ip, serverPort});
mKnownRobotsLock.unlock();
}
}
void MailboxServer::send(int hullNumber, const QString &message)
{
const auto data = QString("data:%1").arg(message).toUtf8();
forEveryConnection(
[data](Connection *c) {
QMetaObject::invokeMethod(c, [c, data]() { c->send(data); });
}
, hullNumber);
}
void MailboxServer::send(const QString &message)
{
send(-1, message);
}
void MailboxServer::onConnectionInfo(const QHostAddress &ip, int port, int hullNumber)
{
if (ip == mMyIp && port == mMyPort) {
return;
}
QVector<Endpoint> toDelete;
mKnownRobotsLock.lockForRead();
for (auto &&endpoint : mKnownRobots) {
if (endpoint == Endpoint{ip, port}) {
toDelete << endpoint;
}
}
mKnownRobotsLock.unlock();
mKnownRobotsLock.lockForWrite();
for (const auto &endpoint : toDelete) {
const auto keys = mKnownRobots.keys(endpoint);
for (const auto &key : keys) {
mKnownRobots.remove(key, endpoint);
}
}
mKnownRobots.insert(hullNumber, {ip, port});
mKnownRobotsLock.unlock();
}
void MailboxServer::onNewData(const QHostAddress &ip, int port, const QByteArray &data)
{
QLOG_INFO() << "New data received by a mailbox from " << ip << ":" << port << ", data is:" << data;
int senderHullNumber = -1;
mKnownRobotsLock.lockForRead();
for (const auto &endpoint : mKnownRobots) {
if (endpoint.ip == ip) {
senderHullNumber = mKnownRobots.key(endpoint);
}
}
mKnownRobotsLock.unlock();
if (senderHullNumber == -1) {
QLOG_INFO() << "Received message from" << ip << ":" << port << "which is unknown at the moment";
}
mMessagesQueueLock.lockForWrite();
mMessagesQueue.enqueue(data);
mMessagesQueueLock.unlock();
emit newMessage(senderHullNumber, QString(data));
}
bool MailboxServer::hasMessages()
{
mMessagesQueueLock.lockForRead();
const bool result = !mMessagesQueue.isEmpty();
mMessagesQueueLock.unlock();
return result;
}
QString MailboxServer::receive()
{
mMessagesQueueLock.lockForWrite();
QByteArray const result = !mMessagesQueue.isEmpty() ? mMessagesQueue.dequeue() : QByteArray();
mMessagesQueueLock.unlock();
return result;
}
bool MailboxServer::hasServer() const
{
return isListening();
}
void MailboxServer::loadSettings()
{
QWriteLocker l(&mAuxiliaryInformationLock);
QSettings settings(trikKernel::Paths::localSettings(), QSettings::IniFormat);
mHullNumber = settings.value("hullNumber", 0).toInt();
auto tryResolve = [](const QString &ipOrName) {
auto info = QHostInfo::fromName(ipOrName);
if (info.error() != QHostInfo::NoError || info.addresses().isEmpty()) {
QLOG_ERROR() << "Failed to get ip for " << ipOrName << ":" << info.error();
return QHostAddress();
} else {
return info.addresses().first();
}
};
mServerIp = tryResolve(settings.value("server", mMyIp.toString()).toString());
mServerPort = settings.value("serverPort", mMyPort).toInt();
mSavedIp = tryResolve(settings.value("localIp", mMyIp.toString()).toString());
}
void MailboxServer::saveSettings()
{
mAuxiliaryInformationLock.lockForRead();
QSettings settings(trikKernel::Paths::localSettings(), QSettings::IniFormat);
settings.setValue("hullNumber", mHullNumber);
settings.setValue("server", mServerIp.toString());
settings.setValue("serverPort", mServerPort);
settings.setValue("localIp", mMyIp.toString());
mAuxiliaryInformationLock.unlock();
}
void MailboxServer::forEveryConnection(const std::function<void(Connection *)> &method, int hullNumber)
{
mKnownRobotsLock.lockForRead();
const auto endpoints = hullNumber == -1 ? mKnownRobots.values() : mKnownRobots.values(hullNumber);
mKnownRobotsLock.unlock();
for (const auto &endpoint : endpoints) {
// We prepare only by IP because there was a check by a hull number.
const auto connection = prepareConnection(endpoint.ip);
if (connection == nullptr) {
QLOG_ERROR() << "Connection to" << endpoint.ip << ":" << endpoint.port << "is dead at the moment, message"
<< "is not delivered. Will try to reestablish connection on next send.";
} else {
if (connection->isConnected()) {
method(connection);
} else {
connect(connection, &Connection::connected, this, method);
}
}
}
}
<|endoftext|>
|
<commit_before>/* $Header$ */
// Copyright ***********************************************************
//
// File ecmdMain.C
//
// IBM Confidential
// OCO Source Materials
// 9400 Licensed Internal Code
// (C) COPYRIGHT IBM CORP. 1996
//
// The source code for this program is not published or otherwise
// divested of its trade secrets, irrespective of what has been
// deposited with the U.S. Copyright Office.
//
// End Copyright *******************************************************
// Module Description **************************************************
//
// Description:
//
// End Module Description **********************************************
/**
@file ecmdMain.C
@brief Main Program entry point for ecmdDllClient Application
*/
//----------------------------------------------------------------------
// Includes
//----------------------------------------------------------------------
#include <stdio.h>
#include <string>
#include <ecmdClientCapi.H>
#include <ecmdInterpreter.H>
#include <ecmdReturnCodes.H>
#include <ecmdCommandUtils.H>
#include <ecmdSharedUtils.H>
int main (int argc, char *argv[])
{
uint32_t rc = 0;
std::string cmdsave;
char buf[200];
for (int i = 0; i < argc; i++) {
cmdsave += argv[i];
cmdsave += " ";
}
cmdsave += "\n";
#ifndef ECMD_STATIC_FUNCTIONS
// If building the function 'statically', it doesn't need ECMD_DLL_FILE set; it'll automatically load its DLL
if (getenv ("ECMD_DLL_FILE") == NULL) {
printf("ecmd - You must set ECMD_DLL_FILE in order to run the eCMD command line client\n");
rc = ECMD_INVALID_DLL_FILENAME;
} else {
/* Load the one specified by ECMD_DLL_FILE */
rc = ecmdLoadDll("");
}
#else
rc = ecmdLoadDll("");
#endif
if (rc == ECMD_SUCCESS) {
/* Check to see if we are using stdin to pass in multiple commands */
if (ecmdParseOption(&argc, &argv, "-stdin")) {
/* Grab any other args that may be there */
rc = ecmdCommandArgs(&argc, &argv);
if (rc) exit((int)rc);
/* There shouldn't be any more args when doing a -stdin */
if (argc > 1) {
ecmdOutputError("ecmd - Invalid args passed to ecmd in -stdin mode\n");
rc = ECMD_INVALID_ARGS;
} else {
std::vector< std::string > commands;
int c_argc;
char* c_argv[ECMD_ARG_LIMIT + 1]; ///< A limit of 20 tokens(args) per command
char* buffer = NULL;
size_t bufflen = 0;
size_t commlen;
/* ecmdParseStdInCommands reads from stdin and returns a vector of strings */
/* each string contains one command (ie 'ecmdquery version') */
/* When Ctrl-D or EOF is reached this function will fail to break out of loop */
while ((rc = ecmdParseStdinCommands(commands)) != ECMD_SUCCESS) {
rc = 0;
/* Walk through individual commands from ecmdParseStdInCommands */
for (std::vector< std::string >::iterator commit = commands.begin(); commit != commands.end(); commit ++) {
c_argc = 0;
c_argv[0] = NULL;
/* Check for a comment or empty line, if so delete it */
if ((*commit)[0] == '#') continue;
else if (commit->length() == 0) continue;
/* Create a char buffer to hold the whole command, we will use this to create pointers to each token in the command (like argc,argv) */
commlen = commit->length();
if ( commlen > bufflen) {
if (buffer != NULL) delete[] buffer;
buffer = new char[commlen + 20];
bufflen = commlen + 19;
}
// Beam "error" of possible NULL 'buffer' value requires mutually
// exclusive conditions (need an argument present to enter
// "commands" FOR loop but commit->length = 0 ie. no command). So
// tell beam to ignore NULL pointer message for 'buffer' parm via
// comment on next line.
//lint -e(668) Ignore passing null, same as above for lint
strcpy(buffer, commit->c_str()); /*passing null object*/
/* Now start carving this thing up */
bool lookingForStart = true; /* Are we looking for the start of a word ? */
for (size_t c = 0; c < commlen; c++) {
if (lookingForStart) {
if (buffer[c] != ' ' && buffer[c] != '\t') {
c_argv[c_argc++] = &buffer[c];
lookingForStart = false;
}
} else {
/* Looking for the end */
if (buffer[c] == ' ' || buffer[c] == '\t') {
buffer[c] = '\0';
lookingForStart = true;
}
}
if (c_argc > ECMD_ARG_LIMIT) {
sprintf(buf,"ecmd - Found a command with greater then %d arguments, not supported\n",ECMD_ARG_LIMIT);
ecmdOutputError(buf);
rc = ECMD_INVALID_ARGS;
break;
}
}
// ignore a line if it is only space or tabs -
// This prevents c_argv[o] being accessed below when still pointing to NULL
if (c_argc == 0) continue;
// Before Executing the cmd save it on the Dll side
ecmdSetCurrentCmdline(c_argc, c_argv);
/* We now want to call the command interpreter to handle what the user provided us */
if (!rc) rc = ecmdCallInterpreters(c_argc, c_argv);
if (rc == ECMD_INT_UNKNOWN_COMMAND) {
if (strlen(c_argv[0]) < 200)
sprintf(buf,"ecmd - Unknown Command specified '%s'\n", c_argv[0]);
else
sprintf(buf,"ecmd - Unknown Command specified \n");
ecmdOutputError(buf);
} else if (rc) {
std::string parse = ecmdGetErrorMsg(rc, false);
if (parse.length() > 0) {
/* Display the registered message right away BZ#160 */
ecmdOutput(parse.c_str());
}
parse = ecmdParseReturnCode(rc);
if (strlen(c_argv[0]) + parse.length() < 300)
sprintf(buf,"ecmd - '%s' returned with error code %X (%s)\n", c_argv[0], rc, parse.c_str());
else
sprintf(buf,"ecmd - Command returned with error code %X (%s)\n", rc, parse.c_str());
ecmdOutputError(buf);
break;
}
if (!ecmdGetGlobalVar(ECMD_GLOBALVAR_QUIETMODE)) {
ecmdOutput((*commit + "\n").c_str());
}
} /* tokens loop */
if (rc) break;
}
if (buffer != NULL) delete[] buffer;
} /* invalid args if */
} else {
/* Standard command line command */
// Before Executing the cmd save it on the Dll side
ecmdSetCurrentCmdline(argc-1, argv+1);
/* We now want to call the command interpreter to handle what the user provided us */
rc = ecmdCallInterpreters(argc - 1, argv + 1);
if (rc == ECMD_INT_UNKNOWN_COMMAND) {
if (argv[1] == NULL)
sprintf(buf,"ecmd - Must specify a command to execute. Run 'ecmd -h' for command list.\n");
else if (strlen(argv[1]) < 200)
sprintf(buf,"ecmd - Unknown Command specified '%s'\n", argv[1]);
else
sprintf(buf,"ecmd - Unknown Command specified \n");
ecmdOutputError(buf);
} else if (rc) {
std::string parse = ecmdGetErrorMsg(rc, false);
if (parse.length() > 0) {
/* Display the registered message right away BZ#160 */
ecmdOutput(parse.c_str());
}
parse = ecmdParseReturnCode(rc);
if (strlen(argv[1]) + parse.length() < 300)
sprintf(buf,"ecmd - '%s' returned with error code %X (%s)\n", argv[1], rc, parse.c_str());
else
sprintf(buf,"ecmd - Command returned with error code %X (%s)\n", rc, parse.c_str());
ecmdOutputError(buf);
}
}
/* Move these outputs into the if !rc to fix BZ#224 - cje */
if (!ecmdGetGlobalVar(ECMD_GLOBALVAR_QUIETMODE)) {
ecmdOutput(cmdsave.c_str());
}
ecmdUnloadDll();
}
exit((int)rc);
}
// Change Log *********************************************************
//
// Flag Reason Vers Date Coder Description
// ---- -------- ---- -------- -------- ------------------------------
// CENGEL Initial Creation
// none STGC7449 04/18/05 prahl Clean up Beam messages.
//
// End Change Log *****************************************************
<commit_msg>Created an eCMD shell<commit_after>/* $Header$ */
// Copyright ***********************************************************
//
// File ecmdMain.C
//
// IBM Confidential
// OCO Source Materials
// 9400 Licensed Internal Code
// (C) COPYRIGHT IBM CORP. 1996
//
// The source code for this program is not published or otherwise
// divested of its trade secrets, irrespective of what has been
// deposited with the U.S. Copyright Office.
//
// End Copyright *******************************************************
// Module Description **************************************************
//
// Description:
//
// End Module Description **********************************************
/**
@file ecmdMain.C
@brief Main Program entry point for ecmdDllClient Application
*/
//----------------------------------------------------------------------
// Includes
//----------------------------------------------------------------------
#include <stdio.h>
#include <string>
#include <ecmdClientCapi.H>
#include <ecmdInterpreter.H>
#include <ecmdReturnCodes.H>
#include <ecmdCommandUtils.H>
#include <ecmdSharedUtils.H>
int main (int argc, char *argv[])
{
uint32_t rc = 0;
std::string cmdsave;
char errorbuf[200];
for (int i = 0; i < argc; i++) {
cmdsave += argv[i];
cmdsave += " ";
}
cmdsave += "\n";
rc = ecmdLoadDll("");
if (rc == ECMD_SUCCESS) {
/* Check to see if we are using stdin to pass in multiple commands */
bool shellMode = ecmdParseOption(&argc, &argv, "-shell");
bool stdinMode = ecmdParseOption(&argc, &argv, "-stdin");
if (stdinMode || shellMode) {
/* Grab any other args that may be there */
rc = ecmdCommandArgs(&argc, &argv);
if (rc) exit((int)rc);
/* There shouldn't be any more args when doing a -stdin/-shell */
if (argc > 1) {
ecmdOutputError("ecmd - Invalid args passed to ecmd in -stdin/-shell mode\n");
exit(ECMD_INVALID_ARGS);
}
/* Let's get things going */
std::vector<std::string> commands;
int c_argc;
char* c_argv[ECMD_ARG_LIMIT + 1]; ///< A limit of 20 tokens(args) per command
char* buffer = NULL;
size_t bufflen = 0;
size_t commlen;
bool shellAlive = true;
if (shellMode) {
ecmdOutput("ecmd> "); fflush(0);
}
/* ecmdParseStdInCommands reads from stdin and returns a vector of strings */
/* each string contains one command (ie 'ecmdquery version') */
/* When Ctrl-D or EOF is reached this function will fail to break out of loop */
while (shellAlive && (rc = ecmdParseStdinCommands(commands))) {
rc = 0;
/* Walk through individual commands from ecmdParseStdInCommands */
for (std::vector< std::string >::iterator commandIter = commands.begin(); commandIter != commands.end(); commandIter++) {
c_argc = 0;
c_argv[0] = NULL;
/* Check for a comment or empty line, if so delete it */
if ((*commandIter)[0] == '#') {
continue;
} else if (commandIter->length() == 0) {
continue;
}
if (shellMode) {
if ((*commandIter) == "quit" || (*commandIter) == "exit") {
ecmdOutput("Leaving ecmd shell at users request... \n");
shellAlive = false;
break;
}
}
/* Create a char buffer to hold the whole command, we will use this to create pointers to each token in the command (like argc,argv) */
commlen = commandIter->length();
if ( commlen > bufflen) {
if (buffer != NULL) delete[] buffer;
buffer = new char[commlen + 20];
bufflen = commlen + 19;
}
// Beam "error" of possible NULL 'buffer' value requires mutually
// exclusive conditions (need an argument present to enter
// "commands" FOR loop but commandIter->length = 0 ie. no command). So
// tell beam to ignore NULL pointer message for 'buffer' parm via
// comment on next line.
//lint -e(668) Ignore passing null, same as above for lint
strcpy(buffer, commandIter->c_str()); /*passing null object*/
/* Now start carving this thing up */
bool lookingForStart = true; /* Are we looking for the start of a word ? */
for (size_t c = 0; c < commlen; c++) {
if (lookingForStart) {
if (buffer[c] != ' ' && buffer[c] != '\t') {
c_argv[c_argc++] = &buffer[c];
lookingForStart = false;
}
} else {
/* Looking for the end */
if (buffer[c] == ' ' || buffer[c] == '\t') {
buffer[c] = '\0';
lookingForStart = true;
}
}
if (c_argc > ECMD_ARG_LIMIT) {
sprintf(errorbuf,"ecmd - Found a command with greater then %d arguments, not supported\n",ECMD_ARG_LIMIT);
ecmdOutputError(errorbuf);
rc = ECMD_INVALID_ARGS;
break;
}
}
// ignore a line if it is only space or tabs -
// This prevents c_argv[o] being accessed below when still pointing to NULL
if (c_argc == 0) continue;
// Before Executing the cmd save it on the Dll side
ecmdSetCurrentCmdline(c_argc, c_argv);
/* We now want to call the command interpreter to handle what the user provided us */
if (!rc) rc = ecmdCallInterpreters(c_argc, c_argv);
if (rc == ECMD_INT_UNKNOWN_COMMAND) {
if (strlen(c_argv[0]) < 200)
sprintf(errorbuf,"ecmd - Unknown Command specified '%s'\n", c_argv[0]);
else
sprintf(errorbuf,"ecmd - Unknown Command specified \n");
ecmdOutputError(errorbuf);
} else if (rc) {
std::string parse = ecmdGetErrorMsg(rc, false);
if (parse.length() > 0) {
/* Display the registered message right away BZ#160 */
ecmdOutput(parse.c_str());
}
parse = ecmdParseReturnCode(rc);
if (strlen(c_argv[0]) + parse.length() < 300)
sprintf(errorbuf,"ecmd - '%s' returned with error code %X (%s)\n", c_argv[0], rc, parse.c_str());
else
sprintf(errorbuf,"ecmd - Command returned with error code %X (%s)\n", rc, parse.c_str());
ecmdOutputError(errorbuf);
break;
}
if (!ecmdGetGlobalVar(ECMD_GLOBALVAR_QUIETMODE)) {
ecmdOutput((*commandIter + "\n").c_str());
}
} /* tokens loop */
if (rc) break;
/* Print the prompt again */
if (shellMode && shellAlive) {
ecmdOutput("ecmd> "); fflush(0);
}
}
if (buffer != NULL) delete[] buffer;
} else {
/* Standard command line command */
// Before Executing the cmd save it on the Dll side
ecmdSetCurrentCmdline(argc-1, argv+1);
/* We now want to call the command interpreter to handle what the user provided us */
rc = ecmdCallInterpreters(argc - 1, argv + 1);
if (rc == ECMD_INT_UNKNOWN_COMMAND) {
if (argv[1] == NULL)
sprintf(errorbuf,"ecmd - Must specify a command to execute. Run 'ecmd -h' for command list.\n");
else if (strlen(argv[1]) < 200)
sprintf(errorbuf,"ecmd - Unknown Command specified '%s'\n", argv[1]);
else
sprintf(errorbuf,"ecmd - Unknown Command specified \n");
ecmdOutputError(errorbuf);
} else if (rc) {
std::string parse = ecmdGetErrorMsg(rc, false);
if (parse.length() > 0) {
/* Display the registered message right away BZ#160 */
ecmdOutput(parse.c_str());
}
parse = ecmdParseReturnCode(rc);
if (strlen(argv[1]) + parse.length() < 300)
sprintf(errorbuf,"ecmd - '%s' returned with error code %X (%s)\n", argv[1], rc, parse.c_str());
else
sprintf(errorbuf,"ecmd - Command returned with error code %X (%s)\n", rc, parse.c_str());
ecmdOutputError(errorbuf);
}
}
/* Move these outputs into the if !rc to fix BZ#224 - cje */
if (!ecmdGetGlobalVar(ECMD_GLOBALVAR_QUIETMODE)) {
ecmdOutput(cmdsave.c_str());
}
ecmdUnloadDll();
}
exit((int)rc);
}
// Change Log *********************************************************
//
// Flag Reason Vers Date Coder Description
// ---- -------- ---- -------- -------- ------------------------------
// CENGEL Initial Creation
// none STGC7449 04/18/05 prahl Clean up Beam messages.
//
// End Change Log *****************************************************
<|endoftext|>
|
<commit_before>/* -*- 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 "oglwindow.hxx"
#include <cppuhelper/supportsservice.hxx>
using namespace com::sun::star;
namespace avmedia { namespace ogl {
OGLWindow::OGLWindow( glTFHandle& rHandle, OpenGLContext& rContext, Window& rEventHandlerParent )
: m_rHandle( rHandle )
, m_rContext( rContext )
, m_rEventHandler( rEventHandlerParent )
, m_bVisible ( false )
, m_aLastMousePos(Point())
, m_bIsOrbitMode( false )
, m_fCameraDistance(0.0)
{
}
OGLWindow::~OGLWindow()
{
dispose();
}
void SAL_CALL OGLWindow::update() throw (css::uno::RuntimeException, std::exception)
{
m_rContext.makeCurrent();
gltf_prepare_renderer(&m_rHandle);
gltf_renderer(&m_rHandle);
gltf_complete_renderer(&m_rHandle);
m_rContext.swapBuffers();
}
sal_Bool SAL_CALL OGLWindow::setZoomLevel( css::media::ZoomLevel /*eZoomLevel*/ ) throw (css::uno::RuntimeException, std::exception)
{
return false;
}
css::media::ZoomLevel SAL_CALL OGLWindow::getZoomLevel() throw (css::uno::RuntimeException, std::exception)
{
return media::ZoomLevel_ORIGINAL;
}
void SAL_CALL OGLWindow::setPointerType( sal_Int32 ) throw (css::uno::RuntimeException, std::exception)
{
}
OUString SAL_CALL OGLWindow::getImplementationName() throw (css::uno::RuntimeException, std::exception)
{
return OUString("com.sun.star.comp.avmedia.Window_OpenGL");
}
sal_Bool SAL_CALL OGLWindow::supportsService( const OUString& rServiceName ) throw (css::uno::RuntimeException, std::exception)
{
return cppu::supportsService(this, rServiceName);
}
uno::Sequence< OUString > SAL_CALL OGLWindow::getSupportedServiceNames() throw (css::uno::RuntimeException, std::exception)
{
uno::Sequence< OUString > aRet(1);
aRet[0] = OUString("com.sun.star.media.Window_OpenGL");
return aRet;
}
void SAL_CALL OGLWindow::dispose() throw (uno::RuntimeException, std::exception)
{
assert(m_rEventHandler.GetParent());
m_rEventHandler.GetParent()->RemoveEventListener( LINK(this, OGLWindow, FocusGrabber));
m_rEventHandler.RemoveEventListener( LINK(this, OGLWindow, CameraHandler));
}
void SAL_CALL OGLWindow::addEventListener( const uno::Reference< lang::XEventListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::removeEventListener( const uno::Reference< lang::XEventListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::setPosSize( sal_Int32 nX, sal_Int32 nY, sal_Int32 nWidth, sal_Int32 nHeight, sal_Int16 /*nFlags*/ )
throw (uno::RuntimeException, std::exception)
{
if( m_rHandle.viewport.x != nX || m_rHandle.viewport.x != nY ||
m_rHandle.viewport.width != nWidth || m_rHandle.viewport.height != nHeight )
{
m_rContext.setWinSize(Size(nWidth,nHeight));
m_rHandle.viewport.x = nX;
m_rHandle.viewport.y = nY;
m_rHandle.viewport.width = nWidth;
m_rHandle.viewport.height = nHeight;
}
}
awt::Rectangle SAL_CALL OGLWindow::getPosSize()
throw (uno::RuntimeException, std::exception)
{
return awt::Rectangle(m_rHandle.viewport.x, m_rHandle.viewport.y,
m_rHandle.viewport.width, m_rHandle.viewport.height);
}
void SAL_CALL OGLWindow::setVisible( sal_Bool bSet )
throw (uno::RuntimeException, std::exception)
{
assert(m_rEventHandler.GetParent());
if( bSet && !m_bVisible )
{
m_rEventHandler.GetParent()->AddEventListener( LINK(this, OGLWindow, FocusGrabber));
m_rEventHandler.AddEventListener( LINK(this, OGLWindow, CameraHandler));
m_rEventHandler.GrabFocus();
}
else if( !bSet )
{
m_rEventHandler.GetParent()->RemoveEventListener( LINK(this, OGLWindow, FocusGrabber));
m_rEventHandler.RemoveEventListener( LINK(this, OGLWindow, CameraHandler));
}
m_bVisible = bSet;
}
void SAL_CALL OGLWindow::setEnable( sal_Bool )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::setFocus()
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::addWindowListener( const uno::Reference< awt::XWindowListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::removeWindowListener( const uno::Reference< awt::XWindowListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::addFocusListener( const uno::Reference< awt::XFocusListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::removeFocusListener( const uno::Reference< awt::XFocusListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::addKeyListener( const uno::Reference< awt::XKeyListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::removeKeyListener( const uno::Reference< awt::XKeyListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::addMouseListener( const uno::Reference< awt::XMouseListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::removeMouseListener( const uno::Reference< awt::XMouseListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::addMouseMotionListener( const uno::Reference< awt::XMouseMotionListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::removeMouseMotionListener( const uno::Reference< awt::XMouseMotionListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::addPaintListener( const uno::Reference< awt::XPaintListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::removePaintListener( const uno::Reference< awt::XPaintListener >& )
throw (uno::RuntimeException, std::exception)
{
}
IMPL_LINK(OGLWindow, FocusGrabber, VclWindowEvent*, pEvent)
{
if( pEvent->GetId() == VCLEVENT_WINDOW_MOUSEMOVE )
{
MouseEvent* pMouseEvt = (MouseEvent*)pEvent->GetData();
if(pMouseEvt)
{
const Point& rMousePos = pMouseEvt->GetPosPixel();
const Rectangle aWinRect(m_rEventHandler.GetPosPixel(),m_rEventHandler.GetSizePixel());
// Grab focus to the OpenGL window when mouse pointer is over it
if( aWinRect.IsInside(rMousePos) )
{
if ( !m_rEventHandler.HasFocus() )
{
m_rEventHandler.GrabFocus();
}
}
// Move focus to the document when mouse is not over the OpenGL window
else if ( m_rEventHandler.HasFocus() )
{
m_rEventHandler.GrabFocusToDocument();
}
}
}
return 0;
}
IMPL_LINK(OGLWindow, CameraHandler, VclWindowEvent*, pEvent)
{
if( pEvent->GetId() == VCLEVENT_WINDOW_KEYINPUT )
{
KeyEvent* pKeyEvt = (KeyEvent*)pEvent->GetData();
if(pKeyEvt)
{
const sal_uInt16 nCode = pKeyEvt->GetKeyCode().GetCode();
if (nCode == KEY_Q || nCode == KEY_E ||
nCode == KEY_A || nCode == KEY_D ||
nCode == KEY_W || nCode == KEY_S )
{
// Calculate movement
glm::vec3 vMoveBy;
{
glm::vec3 vEye;
glm::vec3 vView;
glm::vec3 vUp;
gltf_get_camera_pos(&m_rHandle, &vEye,&vView,&vUp);
float fModelSize =(float)gltf_get_model_size(&m_rHandle);
glm::vec3 vMove = vView-vEye;
vMove = glm::normalize(vMove);
vMove *= 25.0f;
glm::vec3 vStrafe = glm::cross(vView-vEye, vUp);
vStrafe = glm::normalize(vStrafe);
vStrafe *= 25.0f;
glm::vec3 vMup = glm::cross(vView-vEye,glm::vec3(1.0f,0.0f,0.0f) );
vMup = glm::normalize(vMup);
vMup *= 25.0f;
if(nCode == KEY_W)vMoveBy += vMove*(0.0005f*fModelSize);
if(nCode == KEY_S)vMoveBy -= vMove*(0.0005f*fModelSize);
if( !m_bIsOrbitMode )
{
if(nCode == KEY_A)vMoveBy -= vStrafe*(0.0005f*fModelSize);
if(nCode == KEY_D)vMoveBy += vStrafe*(0.0005f*fModelSize);
}
else
{
// Limit zooming in orbit mode
m_fCameraDistance += vMoveBy.z;
if ((m_fCameraDistance < 0.75 * fModelSize && vMoveBy.z < 0.0 ) ||
(m_fCameraDistance > 2 * fModelSize && vMoveBy.z > 0.0 ))
{
m_fCameraDistance -= vMoveBy.z;
vMoveBy = glm::vec3(0.0);
}
}
}
gltf_renderer_move_camera(&m_rHandle, vMoveBy.x, vMoveBy.y, vMoveBy.z, 0.0);
}
else if(nCode == KEY_M)
{
if(m_bIsOrbitMode)
{
gltf_orbit_view_stop(&m_rHandle);
m_bIsOrbitMode = false;
}
else
{
gltf_orbit_mode_start(&m_rHandle);
m_bIsOrbitMode = true;
// Set default camera distance
glm::vec3 vEye;
glm::vec3 vView;
glm::vec3 vUp;
gltf_get_camera_pos(&m_rHandle, &vEye,&vView,&vUp);
m_fCameraDistance = vEye.z - gltf_get_model_center_pos(&m_rHandle)->z;
}
}
else if(nCode == KEY_F)
{
gltf_render_FPS_enable(&m_rHandle);
}
}
}
else if( pEvent->GetId() == VCLEVENT_WINDOW_MOUSEBUTTONDOWN )
{
MouseEvent* pMouseEvt = (MouseEvent*)pEvent->GetData();
if(pMouseEvt && pMouseEvt->IsLeft() && pMouseEvt->GetClicks() == 1)
{
m_aLastMousePos = pMouseEvt->GetPosPixel();
}
}
else if( pEvent->GetId() == VCLEVENT_WINDOW_MOUSEMOVE )
{
if ( !m_rEventHandler.HasFocus() )
{
m_rEventHandler.GrabFocus();
}
MouseEvent* pMouseEvt = (MouseEvent*)pEvent->GetData();
if(pMouseEvt && pMouseEvt->IsLeft())
{
const Point& aCurPos = pMouseEvt->GetPosPixel();
float fSensitivity = std::min(m_rHandle.viewport.width, m_rHandle.viewport.height);
if (fSensitivity == 0.0)
fSensitivity = 1.0;
else
fSensitivity = 540.0 / fSensitivity;
long nDeltaX = m_aLastMousePos.X()-aCurPos.X();
long nDeltaY = m_aLastMousePos.Y()-aCurPos.Y();
if( m_bIsOrbitMode )
{
fSensitivity *= 5;
gltf_renderer_rotate_model(&m_rHandle, (float)nDeltaX*fSensitivity, (float)nDeltaY*fSensitivity, 0.0);
}
else
{
// Filter out too small deltas to avoid rewrite rotation parameter with 0
// before rotation is done
if( nDeltaX != 0 || nDeltaY != 0 )
gltf_renderer_rotate_camera(&m_rHandle, (float)nDeltaX*fSensitivity, (float)nDeltaY*fSensitivity, 0.0);
}
m_aLastMousePos = aCurPos;
}
}
else if( pEvent->GetId() == VCLEVENT_WINDOW_MOUSEBUTTONUP )
{
MouseEvent* pMouseEvt = (MouseEvent*)pEvent->GetData();
if(pMouseEvt && pMouseEvt->IsLeft() && pMouseEvt->GetClicks() == 1)
{
gltf_renderer_stop_rotate_model(&m_rHandle);
}
}
return 0;
}
} // namespace ogl
} // namespace avmedia
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
<commit_msg>glTF: camera movement constraint: use distance from the boundary box<commit_after>/* -*- 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 "oglwindow.hxx"
#include <cppuhelper/supportsservice.hxx>
using namespace com::sun::star;
namespace avmedia { namespace ogl {
OGLWindow::OGLWindow( glTFHandle& rHandle, OpenGLContext& rContext, Window& rEventHandlerParent )
: m_rHandle( rHandle )
, m_rContext( rContext )
, m_rEventHandler( rEventHandlerParent )
, m_bVisible ( false )
, m_aLastMousePos(Point())
, m_bIsOrbitMode( false )
, m_fCameraDistance(0.0)
{
}
OGLWindow::~OGLWindow()
{
dispose();
}
void SAL_CALL OGLWindow::update() throw (css::uno::RuntimeException, std::exception)
{
m_rContext.makeCurrent();
gltf_prepare_renderer(&m_rHandle);
gltf_renderer(&m_rHandle);
gltf_complete_renderer(&m_rHandle);
m_rContext.swapBuffers();
}
sal_Bool SAL_CALL OGLWindow::setZoomLevel( css::media::ZoomLevel /*eZoomLevel*/ ) throw (css::uno::RuntimeException, std::exception)
{
return false;
}
css::media::ZoomLevel SAL_CALL OGLWindow::getZoomLevel() throw (css::uno::RuntimeException, std::exception)
{
return media::ZoomLevel_ORIGINAL;
}
void SAL_CALL OGLWindow::setPointerType( sal_Int32 ) throw (css::uno::RuntimeException, std::exception)
{
}
OUString SAL_CALL OGLWindow::getImplementationName() throw (css::uno::RuntimeException, std::exception)
{
return OUString("com.sun.star.comp.avmedia.Window_OpenGL");
}
sal_Bool SAL_CALL OGLWindow::supportsService( const OUString& rServiceName ) throw (css::uno::RuntimeException, std::exception)
{
return cppu::supportsService(this, rServiceName);
}
uno::Sequence< OUString > SAL_CALL OGLWindow::getSupportedServiceNames() throw (css::uno::RuntimeException, std::exception)
{
uno::Sequence< OUString > aRet(1);
aRet[0] = OUString("com.sun.star.media.Window_OpenGL");
return aRet;
}
void SAL_CALL OGLWindow::dispose() throw (uno::RuntimeException, std::exception)
{
assert(m_rEventHandler.GetParent());
m_rEventHandler.GetParent()->RemoveEventListener( LINK(this, OGLWindow, FocusGrabber));
m_rEventHandler.RemoveEventListener( LINK(this, OGLWindow, CameraHandler));
}
void SAL_CALL OGLWindow::addEventListener( const uno::Reference< lang::XEventListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::removeEventListener( const uno::Reference< lang::XEventListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::setPosSize( sal_Int32 nX, sal_Int32 nY, sal_Int32 nWidth, sal_Int32 nHeight, sal_Int16 /*nFlags*/ )
throw (uno::RuntimeException, std::exception)
{
if( m_rHandle.viewport.x != nX || m_rHandle.viewport.x != nY ||
m_rHandle.viewport.width != nWidth || m_rHandle.viewport.height != nHeight )
{
m_rContext.setWinSize(Size(nWidth,nHeight));
m_rHandle.viewport.x = nX;
m_rHandle.viewport.y = nY;
m_rHandle.viewport.width = nWidth;
m_rHandle.viewport.height = nHeight;
}
}
awt::Rectangle SAL_CALL OGLWindow::getPosSize()
throw (uno::RuntimeException, std::exception)
{
return awt::Rectangle(m_rHandle.viewport.x, m_rHandle.viewport.y,
m_rHandle.viewport.width, m_rHandle.viewport.height);
}
void SAL_CALL OGLWindow::setVisible( sal_Bool bSet )
throw (uno::RuntimeException, std::exception)
{
assert(m_rEventHandler.GetParent());
if( bSet && !m_bVisible )
{
m_rEventHandler.GetParent()->AddEventListener( LINK(this, OGLWindow, FocusGrabber));
m_rEventHandler.AddEventListener( LINK(this, OGLWindow, CameraHandler));
m_rEventHandler.GrabFocus();
}
else if( !bSet )
{
m_rEventHandler.GetParent()->RemoveEventListener( LINK(this, OGLWindow, FocusGrabber));
m_rEventHandler.RemoveEventListener( LINK(this, OGLWindow, CameraHandler));
}
m_bVisible = bSet;
}
void SAL_CALL OGLWindow::setEnable( sal_Bool )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::setFocus()
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::addWindowListener( const uno::Reference< awt::XWindowListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::removeWindowListener( const uno::Reference< awt::XWindowListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::addFocusListener( const uno::Reference< awt::XFocusListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::removeFocusListener( const uno::Reference< awt::XFocusListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::addKeyListener( const uno::Reference< awt::XKeyListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::removeKeyListener( const uno::Reference< awt::XKeyListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::addMouseListener( const uno::Reference< awt::XMouseListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::removeMouseListener( const uno::Reference< awt::XMouseListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::addMouseMotionListener( const uno::Reference< awt::XMouseMotionListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::removeMouseMotionListener( const uno::Reference< awt::XMouseMotionListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::addPaintListener( const uno::Reference< awt::XPaintListener >& )
throw (uno::RuntimeException, std::exception)
{
}
void SAL_CALL OGLWindow::removePaintListener( const uno::Reference< awt::XPaintListener >& )
throw (uno::RuntimeException, std::exception)
{
}
IMPL_LINK(OGLWindow, FocusGrabber, VclWindowEvent*, pEvent)
{
if( pEvent->GetId() == VCLEVENT_WINDOW_MOUSEMOVE )
{
MouseEvent* pMouseEvt = (MouseEvent*)pEvent->GetData();
if(pMouseEvt)
{
const Point& rMousePos = pMouseEvt->GetPosPixel();
const Rectangle aWinRect(m_rEventHandler.GetPosPixel(),m_rEventHandler.GetSizePixel());
// Grab focus to the OpenGL window when mouse pointer is over it
if( aWinRect.IsInside(rMousePos) )
{
if ( !m_rEventHandler.HasFocus() )
{
m_rEventHandler.GrabFocus();
}
}
// Move focus to the document when mouse is not over the OpenGL window
else if ( m_rEventHandler.HasFocus() )
{
m_rEventHandler.GrabFocusToDocument();
}
}
}
return 0;
}
IMPL_LINK(OGLWindow, CameraHandler, VclWindowEvent*, pEvent)
{
if( pEvent->GetId() == VCLEVENT_WINDOW_KEYINPUT )
{
KeyEvent* pKeyEvt = (KeyEvent*)pEvent->GetData();
if(pKeyEvt)
{
const sal_uInt16 nCode = pKeyEvt->GetKeyCode().GetCode();
if (nCode == KEY_Q || nCode == KEY_E ||
nCode == KEY_A || nCode == KEY_D ||
nCode == KEY_W || nCode == KEY_S )
{
// Calculate movement
glm::vec3 vMoveBy;
{
glm::vec3 vEye;
glm::vec3 vView;
glm::vec3 vUp;
gltf_get_camera_pos(&m_rHandle, &vEye,&vView,&vUp);
float fModelSize =(float)gltf_get_model_size(&m_rHandle);
glm::vec3 vMove = vView-vEye;
vMove = glm::normalize(vMove);
vMove *= 25.0f;
glm::vec3 vStrafe = glm::cross(vView-vEye, vUp);
vStrafe = glm::normalize(vStrafe);
vStrafe *= 25.0f;
glm::vec3 vMup = glm::cross(vView-vEye,glm::vec3(1.0f,0.0f,0.0f) );
vMup = glm::normalize(vMup);
vMup *= 25.0f;
if(nCode == KEY_W)vMoveBy += vMove*(0.0005f*fModelSize);
if(nCode == KEY_S)vMoveBy -= vMove*(0.0005f*fModelSize);
if( !m_bIsOrbitMode )
{
if(nCode == KEY_A)vMoveBy -= vStrafe*(0.0005f*fModelSize);
if(nCode == KEY_D)vMoveBy += vStrafe*(0.0005f*fModelSize);
}
else
{
// Limit zooming in orbit mode
m_fCameraDistance += vMoveBy.z;
if ((m_fCameraDistance < 0.5 * fModelSize && vMoveBy.z < 0.0 ) ||
(m_fCameraDistance > 2 * fModelSize && vMoveBy.z > 0.0 ))
{
m_fCameraDistance -= vMoveBy.z;
vMoveBy = glm::vec3(0.0);
}
}
}
gltf_renderer_move_camera(&m_rHandle, vMoveBy.x, vMoveBy.y, vMoveBy.z, 0.0);
}
else if(nCode == KEY_M)
{
if(m_bIsOrbitMode)
{
gltf_orbit_view_stop(&m_rHandle);
m_bIsOrbitMode = false;
}
else
{
gltf_orbit_mode_start(&m_rHandle);
m_bIsOrbitMode = true;
// Set default camera distance
glm::vec3 vEye;
glm::vec3 vView;
glm::vec3 vUp;
gltf_get_camera_pos(&m_rHandle, &vEye,&vView,&vUp);
m_fCameraDistance = vEye.z - gltf_get_model_center_pos(&m_rHandle)->z - (gltf_get_model_size(&m_rHandle)/2.0);
}
}
else if(nCode == KEY_F)
{
gltf_render_FPS_enable(&m_rHandle);
}
}
}
else if( pEvent->GetId() == VCLEVENT_WINDOW_MOUSEBUTTONDOWN )
{
MouseEvent* pMouseEvt = (MouseEvent*)pEvent->GetData();
if(pMouseEvt && pMouseEvt->IsLeft() && pMouseEvt->GetClicks() == 1)
{
m_aLastMousePos = pMouseEvt->GetPosPixel();
}
}
else if( pEvent->GetId() == VCLEVENT_WINDOW_MOUSEMOVE )
{
if ( !m_rEventHandler.HasFocus() )
{
m_rEventHandler.GrabFocus();
}
MouseEvent* pMouseEvt = (MouseEvent*)pEvent->GetData();
if(pMouseEvt && pMouseEvt->IsLeft())
{
const Point& aCurPos = pMouseEvt->GetPosPixel();
float fSensitivity = std::min(m_rHandle.viewport.width, m_rHandle.viewport.height);
if (fSensitivity == 0.0)
fSensitivity = 1.0;
else
fSensitivity = 540.0 / fSensitivity;
long nDeltaX = m_aLastMousePos.X()-aCurPos.X();
long nDeltaY = m_aLastMousePos.Y()-aCurPos.Y();
if( m_bIsOrbitMode )
{
fSensitivity *= 5;
gltf_renderer_rotate_model(&m_rHandle, (float)nDeltaX*fSensitivity, (float)nDeltaY*fSensitivity, 0.0);
}
else
{
// Filter out too small deltas to avoid rewrite rotation parameter with 0
// before rotation is done
if( nDeltaX != 0 || nDeltaY != 0 )
gltf_renderer_rotate_camera(&m_rHandle, (float)nDeltaX*fSensitivity, (float)nDeltaY*fSensitivity, 0.0);
}
m_aLastMousePos = aCurPos;
}
}
else if( pEvent->GetId() == VCLEVENT_WINDOW_MOUSEBUTTONUP )
{
MouseEvent* pMouseEvt = (MouseEvent*)pEvent->GetData();
if(pMouseEvt && pMouseEvt->IsLeft() && pMouseEvt->GetClicks() == 1)
{
gltf_renderer_stop_rotate_model(&m_rHandle);
}
}
return 0;
}
} // namespace ogl
} // namespace avmedia
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
<|endoftext|>
|
<commit_before>/*
* Copyright (c) 2018, Arm Limited and affiliates.
* SPDX-License-Identifier: Apache-2.0
*
* 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 "GEMALTO_CINTERION_CellularContext.h"
#include "GEMALTO_CINTERION_CellularInformation.h"
#include "GEMALTO_CINTERION.h"
#include "AT_CellularNetwork.h"
#include "CellularLog.h"
using namespace mbed;
using namespace events;
const uint16_t RESPONSE_TO_SEND_DELAY = 100; // response-to-send delay in milliseconds at bit-rate over 9600
GEMALTO_CINTERION::Module GEMALTO_CINTERION::_module;
GEMALTO_CINTERION::GEMALTO_CINTERION(FileHandle *fh) : AT_CellularDevice(fh)
{
}
AT_CellularContext *GEMALTO_CINTERION::create_context_impl(ATHandler &at, const char *apn, bool cp_req, bool nonip_req)
{
return new GEMALTO_CINTERION_CellularContext(at, this, apn, cp_req, nonip_req);
}
AT_CellularInformation *GEMALTO_CINTERION::open_information_impl(ATHandler &at)
{
if (_module == ModuleBGS2) {
return new GEMALTO_CINTERION_CellularInformation(at);
}
return AT_CellularDevice::open_information_impl(at);
}
nsapi_error_t GEMALTO_CINTERION::init()
{
nsapi_error_t err = AT_CellularDevice::init();
if (err != NSAPI_ERROR_OK) {
return err;
}
CellularInformation *information = open_information();
if (!information) {
return NSAPI_ERROR_NO_MEMORY;
}
char model[sizeof("EHS5-E") + 1]; // sizeof need to be long enough to hold just the model text
nsapi_error_t ret = information->get_model(model, sizeof(model));
close_information();
if (ret != NSAPI_ERROR_OK) {
tr_error("Cellular model not found!");
return NSAPI_ERROR_DEVICE_ERROR;
}
if (memcmp(model, "ELS61", sizeof("ELS61") - 1) == 0) {
init_module_els61();
} else if (memcmp(model, "BGS2", sizeof("BGS2") - 1) == 0) {
init_module_bgs2();
} else if (memcmp(model, "EMS31", sizeof("EMS31") - 1) == 0) {
init_module_ems31();
} else if (memcmp(model, "EHS5-E", sizeof("EHS5-E") - 1) == 0) {
init_module_ehs5e();
} else {
tr_error("Cinterion model unsupported %s", model);
return NSAPI_ERROR_UNSUPPORTED;
}
tr_info("Cinterion model %s (%d)", model, _module);
return NSAPI_ERROR_OK;
}
uint16_t GEMALTO_CINTERION::get_send_delay() const
{
return RESPONSE_TO_SEND_DELAY;
}
GEMALTO_CINTERION::Module GEMALTO_CINTERION::get_module()
{
return _module;
}
void GEMALTO_CINTERION::init_module_bgs2()
{
// BGS2-W_ATC_V00.100
static const intptr_t cellular_properties[AT_CellularBase::PROPERTY_MAX] = {
AT_CellularNetwork::RegistrationModeDisable, // C_EREG
AT_CellularNetwork::RegistrationModeEnable, // C_GREG
AT_CellularNetwork::RegistrationModeLAC, // C_REG
0, // AT_CGSN_WITH_TYPE
1, // AT_CGDATA
1, // AT_CGAUTH
1, // AT_CNMI
1, // AT_CSMP
1, // AT_CMGF
1, // AT_CSDH
1, // PROPERTY_IPV4_STACK
0, // PROPERTY_IPV6_STACK
0, // PROPERTY_IPV4V6_STACK
};
AT_CellularBase::set_cellular_properties(cellular_properties);
_module = ModuleBGS2;
}
void GEMALTO_CINTERION::init_module_els61()
{
// ELS61-E2_ATC_V01.000
static const intptr_t cellular_properties[AT_CellularBase::PROPERTY_MAX] = {
AT_CellularNetwork::RegistrationModeDisable, // C_EREG
AT_CellularNetwork::RegistrationModeEnable, // C_GREG
AT_CellularNetwork::RegistrationModeLAC, // C_REG
0, // AT_CGSN_WITH_TYPE
1, // AT_CGDATA
1, // AT_CGAUTH
1, // PROPERTY_IPV4_STACK
1, // PROPERTY_IPV6_STACK
0, // PROPERTY_IPV4V6_STACK
};
AT_CellularBase::set_cellular_properties(cellular_properties);
_module = ModuleELS61;
}
void GEMALTO_CINTERION::init_module_ems31()
{
// EMS31-US_ATC_V4.9.5
static const intptr_t cellular_properties[AT_CellularBase::PROPERTY_MAX] = {
AT_CellularNetwork::RegistrationModeLAC, // C_EREG
AT_CellularNetwork::RegistrationModeDisable, // C_GREG
AT_CellularNetwork::RegistrationModeDisable, // C_REG
1, // AT_CGSN_WITH_TYPE
1, // AT_CGDATA
1, // AT_CGAUTH
1, // PROPERTY_IPV4_STACK
1, // PROPERTY_IPV6_STACK
1, // PROPERTY_IPV4V6_STACK
};
AT_CellularBase::set_cellular_properties(cellular_properties);
_module = ModuleEMS31;
}
void GEMALTO_CINTERION::init_module_ehs5e()
{
// EHS5-E
static const intptr_t cellular_properties[AT_CellularBase::PROPERTY_MAX] = {
AT_CellularNetwork::RegistrationModeDisable, // C_EREG
AT_CellularNetwork::RegistrationModeLAC, // C_GREG
AT_CellularNetwork::RegistrationModeLAC, // C_REG
0, // AT_CGSN_WITH_TYPE
1, // AT_CGDATA
1, // AT_CGAUTH
1, // PROPERTY_IPV4_STACK
1, // PROPERTY_IPV6_STACK
1, // PROPERTY_IPV4V6_STACK
};
AT_CellularBase::set_cellular_properties(cellular_properties);
_module = ModuleEHS5E;
}
#if MBED_CONF_GEMALTO_CINTERION_PROVIDE_DEFAULT
#include "UARTSerial.h"
CellularDevice *CellularDevice::get_default_instance()
{
static UARTSerial serial(MBED_CONF_GEMALTO_CINTERION_TX, MBED_CONF_GEMALTO_CINTERION_RX, MBED_CONF_GEMALTO_CINTERION_BAUDRATE);
#if defined (MBED_CONF_UBLOX_AT_RTS) && defined(MBED_CONF_UBLOX_AT_CTS)
tr_debug("GEMALTO_CINTERION flow control: RTS %d CTS %d", MBED_CONF_GEMALTO_CINTERION_RTS, MBED_CONF_GEMALTO_CINTERION_CTS);
serial.set_flow_control(SerialBase::RTSCTS, MBED_CONF_GEMALTO_CINTERION_RTS, MBED_CONF_GEMALTO_CINTERION_CTS);
#endif
static GEMALTO_CINTERION device(&serial);
return &device;
}
#endif
<commit_msg>Disable dual stack mode<commit_after>/*
* Copyright (c) 2018, Arm Limited and affiliates.
* SPDX-License-Identifier: Apache-2.0
*
* 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 "GEMALTO_CINTERION_CellularContext.h"
#include "GEMALTO_CINTERION_CellularInformation.h"
#include "GEMALTO_CINTERION.h"
#include "AT_CellularNetwork.h"
#include "CellularLog.h"
using namespace mbed;
using namespace events;
const uint16_t RESPONSE_TO_SEND_DELAY = 100; // response-to-send delay in milliseconds at bit-rate over 9600
GEMALTO_CINTERION::Module GEMALTO_CINTERION::_module;
GEMALTO_CINTERION::GEMALTO_CINTERION(FileHandle *fh) : AT_CellularDevice(fh)
{
}
AT_CellularContext *GEMALTO_CINTERION::create_context_impl(ATHandler &at, const char *apn, bool cp_req, bool nonip_req)
{
return new GEMALTO_CINTERION_CellularContext(at, this, apn, cp_req, nonip_req);
}
AT_CellularInformation *GEMALTO_CINTERION::open_information_impl(ATHandler &at)
{
if (_module == ModuleBGS2) {
return new GEMALTO_CINTERION_CellularInformation(at);
}
return AT_CellularDevice::open_information_impl(at);
}
nsapi_error_t GEMALTO_CINTERION::init()
{
nsapi_error_t err = AT_CellularDevice::init();
if (err != NSAPI_ERROR_OK) {
return err;
}
CellularInformation *information = open_information();
if (!information) {
return NSAPI_ERROR_NO_MEMORY;
}
char model[sizeof("EHS5-E") + 1]; // sizeof need to be long enough to hold just the model text
nsapi_error_t ret = information->get_model(model, sizeof(model));
close_information();
if (ret != NSAPI_ERROR_OK) {
tr_error("Cellular model not found!");
return NSAPI_ERROR_DEVICE_ERROR;
}
if (memcmp(model, "ELS61", sizeof("ELS61") - 1) == 0) {
init_module_els61();
} else if (memcmp(model, "BGS2", sizeof("BGS2") - 1) == 0) {
init_module_bgs2();
} else if (memcmp(model, "EMS31", sizeof("EMS31") - 1) == 0) {
init_module_ems31();
} else if (memcmp(model, "EHS5-E", sizeof("EHS5-E") - 1) == 0) {
init_module_ehs5e();
} else {
tr_error("Cinterion model unsupported %s", model);
return NSAPI_ERROR_UNSUPPORTED;
}
tr_info("Cinterion model %s (%d)", model, _module);
return NSAPI_ERROR_OK;
}
uint16_t GEMALTO_CINTERION::get_send_delay() const
{
return RESPONSE_TO_SEND_DELAY;
}
GEMALTO_CINTERION::Module GEMALTO_CINTERION::get_module()
{
return _module;
}
void GEMALTO_CINTERION::init_module_bgs2()
{
// BGS2-W_ATC_V00.100
static const intptr_t cellular_properties[AT_CellularBase::PROPERTY_MAX] = {
AT_CellularNetwork::RegistrationModeDisable, // C_EREG
AT_CellularNetwork::RegistrationModeEnable, // C_GREG
AT_CellularNetwork::RegistrationModeLAC, // C_REG
0, // AT_CGSN_WITH_TYPE
1, // AT_CGDATA
1, // AT_CGAUTH
1, // AT_CNMI
1, // AT_CSMP
1, // AT_CMGF
1, // AT_CSDH
1, // PROPERTY_IPV4_STACK
0, // PROPERTY_IPV6_STACK
0, // PROPERTY_IPV4V6_STACK
};
AT_CellularBase::set_cellular_properties(cellular_properties);
_module = ModuleBGS2;
}
void GEMALTO_CINTERION::init_module_els61()
{
// ELS61-E2_ATC_V01.000
static const intptr_t cellular_properties[AT_CellularBase::PROPERTY_MAX] = {
AT_CellularNetwork::RegistrationModeDisable, // C_EREG
AT_CellularNetwork::RegistrationModeEnable, // C_GREG
AT_CellularNetwork::RegistrationModeLAC, // C_REG
0, // AT_CGSN_WITH_TYPE
1, // AT_CGDATA
1, // AT_CGAUTH
1, // PROPERTY_IPV4_STACK
1, // PROPERTY_IPV6_STACK
0, // PROPERTY_IPV4V6_STACK
};
AT_CellularBase::set_cellular_properties(cellular_properties);
_module = ModuleELS61;
}
void GEMALTO_CINTERION::init_module_ems31()
{
// EMS31-US_ATC_V4.9.5
static const intptr_t cellular_properties[AT_CellularBase::PROPERTY_MAX] = {
AT_CellularNetwork::RegistrationModeLAC, // C_EREG
AT_CellularNetwork::RegistrationModeDisable, // C_GREG
AT_CellularNetwork::RegistrationModeDisable, // C_REG
1, // AT_CGSN_WITH_TYPE
1, // AT_CGDATA
1, // AT_CGAUTH
1, // PROPERTY_IPV4_STACK
1, // PROPERTY_IPV6_STACK
0, // PROPERTY_IPV4V6_STACK
};
AT_CellularBase::set_cellular_properties(cellular_properties);
_module = ModuleEMS31;
}
void GEMALTO_CINTERION::init_module_ehs5e()
{
// EHS5-E
static const intptr_t cellular_properties[AT_CellularBase::PROPERTY_MAX] = {
AT_CellularNetwork::RegistrationModeDisable, // C_EREG
AT_CellularNetwork::RegistrationModeLAC, // C_GREG
AT_CellularNetwork::RegistrationModeLAC, // C_REG
0, // AT_CGSN_WITH_TYPE
1, // AT_CGDATA
1, // AT_CGAUTH
1, // PROPERTY_IPV4_STACK
1, // PROPERTY_IPV6_STACK
1, // PROPERTY_IPV4V6_STACK
};
AT_CellularBase::set_cellular_properties(cellular_properties);
_module = ModuleEHS5E;
}
#if MBED_CONF_GEMALTO_CINTERION_PROVIDE_DEFAULT
#include "UARTSerial.h"
CellularDevice *CellularDevice::get_default_instance()
{
static UARTSerial serial(MBED_CONF_GEMALTO_CINTERION_TX, MBED_CONF_GEMALTO_CINTERION_RX, MBED_CONF_GEMALTO_CINTERION_BAUDRATE);
#if defined (MBED_CONF_UBLOX_AT_RTS) && defined(MBED_CONF_UBLOX_AT_CTS)
tr_debug("GEMALTO_CINTERION flow control: RTS %d CTS %d", MBED_CONF_GEMALTO_CINTERION_RTS, MBED_CONF_GEMALTO_CINTERION_CTS);
serial.set_flow_control(SerialBase::RTSCTS, MBED_CONF_GEMALTO_CINTERION_RTS, MBED_CONF_GEMALTO_CINTERION_CTS);
#endif
static GEMALTO_CINTERION device(&serial);
return &device;
}
#endif
<|endoftext|>
|
<commit_before>/*************************************************************************
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: rc.cxx,v $
*
* $Revision: 1.7 $
*
* last change: $Author: vg $ $Date: 2006-04-07 16:16:52 $
*
* The Contents of this file are made available subject to
* the terms of GNU Lesser General Public License Version 2.1.
*
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2005 by Sun Microsystems, Inc.
* 901 San Antonio Road, Palo Alto, CA 94303, USA
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, 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., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
************************************************************************/
#define _TOOLS_RC_CXX
#include <string.h>
#ifndef _DATE_HXX
#include <date.hxx>
#endif
#ifndef _TIME_HXX
#include <time.hxx>
#endif
#ifndef _TOOLS_RC_HXX
#include <rc.hxx>
#endif
#ifndef _TOOLS_RCID_H
#include <rcid.h>
#endif
// =======================================================================
Resource::Resource( const ResId& rResId )
{
GetRes( rResId.SetRT( RSC_RESOURCE ) );
}
// -----------------------------------------------------------------------
void Resource::GetRes( const ResId& rResId )
{
if ( rResId.GetResMgr() )
rResId.GetResMgr()->GetResource( rResId, this );
else
GetResManager()->GetResource( rResId, this );
IncrementRes( sizeof( RSHEADER_TYPE ) );
}
// -----------------------------------------------------------------------
// =======================================================================
Time::Time( const ResId& rResId )
{
nTime = 0;
rResId.SetRT( RSC_TIME );
ResMgr* pResMgr = NULL;
ResMgr::GetResourceSkipHeader( rResId, &pResMgr );
ULONG nObjMask = (USHORT)pResMgr->ReadLong();
if ( 0x01 & nObjMask )
SetHour( (USHORT)pResMgr->ReadShort() );
if ( 0x02 & nObjMask )
SetMin( (USHORT)pResMgr->ReadShort() );
if ( 0x04 & nObjMask )
SetSec( (USHORT)pResMgr->ReadShort() );
if ( 0x08 & nObjMask )
Set100Sec( (USHORT)pResMgr->ReadShort() );
}
// =======================================================================
Date::Date( const ResId& rResId )
{
rResId.SetRT( RSC_DATE );
ResMgr* pResMgr = NULL;
ResMgr::GetResourceSkipHeader( rResId, &pResMgr );
ULONG nObjMask = (USHORT)pResMgr->ReadLong();
if ( 0x01 & nObjMask )
SetYear( (USHORT)pResMgr->ReadShort() );
if ( 0x02 & nObjMask )
SetMonth( (USHORT)pResMgr->ReadShort() );
if ( 0x04 & nObjMask )
SetDay( (USHORT)pResMgr->ReadShort() );
}
<commit_msg>INTEGRATION: CWS pchfix02 (1.7.68); FILE MERGED 2006/09/01 17:54:55 kaib 1.7.68.1: #i68856# Added header markers and pch files<commit_after>/*************************************************************************
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: rc.cxx,v $
*
* $Revision: 1.8 $
*
* last change: $Author: obo $ $Date: 2006-09-17 00:59:44 $
*
* The Contents of this file are made available subject to
* the terms of GNU Lesser General Public License Version 2.1.
*
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2005 by Sun Microsystems, Inc.
* 901 San Antonio Road, Palo Alto, CA 94303, USA
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, 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., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
************************************************************************/
// MARKER(update_precomp.py): autogen include statement, do not remove
#include "precompiled_tools.hxx"
#define _TOOLS_RC_CXX
#include <string.h>
#ifndef _DATE_HXX
#include <date.hxx>
#endif
#ifndef _TIME_HXX
#include <time.hxx>
#endif
#ifndef _TOOLS_RC_HXX
#include <rc.hxx>
#endif
#ifndef _TOOLS_RCID_H
#include <rcid.h>
#endif
// =======================================================================
Resource::Resource( const ResId& rResId )
{
GetRes( rResId.SetRT( RSC_RESOURCE ) );
}
// -----------------------------------------------------------------------
void Resource::GetRes( const ResId& rResId )
{
if ( rResId.GetResMgr() )
rResId.GetResMgr()->GetResource( rResId, this );
else
GetResManager()->GetResource( rResId, this );
IncrementRes( sizeof( RSHEADER_TYPE ) );
}
// -----------------------------------------------------------------------
// =======================================================================
Time::Time( const ResId& rResId )
{
nTime = 0;
rResId.SetRT( RSC_TIME );
ResMgr* pResMgr = NULL;
ResMgr::GetResourceSkipHeader( rResId, &pResMgr );
ULONG nObjMask = (USHORT)pResMgr->ReadLong();
if ( 0x01 & nObjMask )
SetHour( (USHORT)pResMgr->ReadShort() );
if ( 0x02 & nObjMask )
SetMin( (USHORT)pResMgr->ReadShort() );
if ( 0x04 & nObjMask )
SetSec( (USHORT)pResMgr->ReadShort() );
if ( 0x08 & nObjMask )
Set100Sec( (USHORT)pResMgr->ReadShort() );
}
// =======================================================================
Date::Date( const ResId& rResId )
{
rResId.SetRT( RSC_DATE );
ResMgr* pResMgr = NULL;
ResMgr::GetResourceSkipHeader( rResId, &pResMgr );
ULONG nObjMask = (USHORT)pResMgr->ReadLong();
if ( 0x01 & nObjMask )
SetYear( (USHORT)pResMgr->ReadShort() );
if ( 0x02 & nObjMask )
SetMonth( (USHORT)pResMgr->ReadShort() );
if ( 0x04 & nObjMask )
SetDay( (USHORT)pResMgr->ReadShort() );
}
<|endoftext|>
|
<commit_before>//FRAGMENT(header)
/*==========================================================================
SeqAn - The Library for Sequence Analysis
http://www.seqan.de
===========================================================================
Copyright (C) 2010
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 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
===========================================================================
Author: Manuel Holtgrewe <manuel.holtgrewe@fu-berlin.de>
===========================================================================
Minimapper -- Minimal read mapping in SeqAn.
===========================================================================
This file contains code for a minimal read mapper with heavy restrictions.
The restrictions are explained in the tutorial chapter, together with
suggestions on how to extend this code.
===========================================================================*/
//FRAGMENT(includes)
#include <cstdio>
#include <iostream>
#include <seqan/basic.h>
#include <seqan/file.h>
#include <seqan/index.h>
#include <seqan/store.h>
#include <seqan/misc/misc_cmdparser.h>
using namespace seqan;
//FRAGMENT(typedefs)
// Some typedefs.
typedef FragmentStore<>::TReadSeqStore TReadSeqStore;
typedef Value<TReadSeqStore>::Type TReadSeq;
typedef FragmentStore<>::TContigStore TContigStore;
typedef Value<TContigStore>::Type TContigStoreElement;
typedef TContigStoreElement::TContigSeq TContigSeq;
typedef Index<TReadSeqStore, Index_QGram<Shape<Dna, UngappedShape<11> >, OpenAddressing> > TIndex;
typedef Pattern<TIndex, Swift<SwiftSemiGlobal> > TPattern;
typedef Finder<TContigSeq, Swift<SwiftSemiGlobal> > TFinder;
typedef FragmentStore<>::TAlignedReadStore TAlignedReadStore;
typedef Value<TAlignedReadStore>::Type TAlignedRead;
// const double EPSILON = 0.08;
struct Options
{
double epsilon;
bool rev_comp;
Options()
{
epsilon = 0.08;
rev_comp = false;
}
};
//FRAGMENT(main-input)
int main(int argc, const char *argv[]) {
// 0) Handle command line arguments.
if (argc < 3) {
std::cerr << "Invalid number of arguments." << std::endl
<< "USAGE: minimapper GENOME.fasta READS.fasta OUT.sam" << std::endl;
return 1;
}
CommandLineOption eps = CommandLineOption("e",
"epsilon",
1,
"maximum error rate",
OptionType::Double,
0.08);
CommandLineOption revcomp = CommandLineOption("rc",
"reverse-complement",
1,
"align against both strands",
OptionType::Bool,
false);
CommandLineParser parser;
addOption(parser, eps);
addOption(parser, revcomp);
parse(parser, argc, argv);
Options MyOptions;
getOptionValueShort(parser, "e", MyOptions.epsilon);
// 1) Load contigs and reads.
FragmentStore<> fragStore;
if (!loadContigs(fragStore, argv[1])) return 1;
if (!loadReads(fragStore, argv[2])) return 1;
// if (MyOptions.rev_comp)
// {
// int orglength = length(fragStore.contigStore);
// resize(fragStore.contigStore, orglength *2);
// for (int i=0; i < orglength; ++i)
// assign(fragStore.contigStore[i+orglength],
// DnaStringReverseComplement(fragStore.contigStore[i]));
// }
//FRAGMENT(pattern-finder)
// 2) Build an index over all reads and a SWIFT pattern over this index.
TIndex index(fragStore.readSeqStore);
TPattern pattern(index);
// String<TVerifyPattern> patterns
// resize()
// for ... setHost()
//FRAGMENT(swift)
// 3) Enumerate all epsilon matches.
for (unsigned i = 0; i < length(fragStore.contigStore); ++i) {
TFinder finder(fragStore.contigStore[i].seq);
// Verify Finder defined here
while (find(finder, pattern, MyOptions.epsilon)) {
//FRAGMENT(verification)
// Verify match.
// clear(verifyFinder)
// pattern = patterns[i]
Finder<TContigSeq> verifyFinder(fragStore.contigStore[i].seq);
setPosition(verifyFinder, beginPosition(finder));
// Pattern<TReadSeq, HammingSimple> verifyPattern(fragStore.readSeqStore[position(pattern).i1]);
Pattern<TReadSeq, Myers<> > verifyPattern(fragStore.readSeqStore[position(pattern).i1]);
setScoreLimit(verifyPattern,
-floor(
MyOptions.epsilon
* length(fragStore.readSeqStore[position(pattern).i1])));
while (find(verifyFinder, verifyPattern)
&& position(verifyFinder) < endPosition(infix(finder))
)
{
bool b = findBegin(verifyFinder, verifyPattern, getScore(verifyPattern));
SEQAN_ASSERT_TRUE(b);
TAlignedRead match(length(fragStore.alignedReadStore),
position(pattern).i1,
i,
beginPosition(verifyFinder),
endPosition(verifyFinder));
std::cout << "BEGIN: " << beginPosition(verifyFinder)
<< " END: " << endPosition(verifyFinder) << std::endl;
appendValue(fragStore.alignedReadStore, match);
// std::cout << fragStore.readSeqStore[position(pattern).i1] << std::endl;
// std::cout << infix(verifyFinder) << std::endl;
}
}
}
convertMatchesToGlobalAlignment(fragStore, Score<int>(0, -999, -1001, -1000), True());
//FRAGMENT(main-output)
// 4) Write out SAM file.
std::ofstream samFile(argv[3], std::ios_base::out);
write(samFile, fragStore, SAM());
return 0;
}
<commit_msg>oops, sorry. reverting to original<commit_after>//FRAGMENT(header)
/*==========================================================================
SeqAn - The Library for Sequence Analysis
http://www.seqan.de
===========================================================================
Copyright (C) 2010
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 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
===========================================================================
Author: Manuel Holtgrewe <manuel.holtgrewe@fu-berlin.de>
===========================================================================
Minimapper -- Minimal read mapping in SeqAn.
===========================================================================
This file contains code for a minimal read mapper with heavy restrictions.
The restrictions are explained in the tutorial chapter, together with
suggestions on how to extend this code.
===========================================================================*/
//FRAGMENT(includes)
#include <cstdio>
#include <iostream>
#include <seqan/basic.h>
#include <seqan/file.h>
#include <seqan/index.h>
#include <seqan/store.h>
using namespace seqan;
//FRAGMENT(typedefs)
// Some typedefs.
typedef FragmentStore<>::TReadSeqStore TReadSeqStore;
typedef Value<TReadSeqStore>::Type TReadSeq;
typedef FragmentStore<>::TContigStore TContigStore;
typedef Value<TContigStore>::Type TContigStoreElement;
typedef TContigStoreElement::TContigSeq TContigSeq;
typedef Index<TReadSeqStore, Index_QGram<Shape<Dna, UngappedShape<11> >, OpenAddressing> > TIndex;
typedef Pattern<TIndex, Swift<SwiftSemiGlobal> > TPattern;
typedef Finder<TContigSeq, Swift<SwiftSemiGlobal> > TFinder;
typedef FragmentStore<>::TAlignedReadStore TAlignedReadStore;
typedef Value<TAlignedReadStore>::Type TAlignedRead;
const double EPSILON = 0.08;
//FRAGMENT(main-input)
int main(int argc, char *argv[]) {
// 0) Handle command line arguments.
if (argc < 3) {
std::cerr << "Invalid number of arguments." << std::endl
<< "USAGE: minimapper GENOME.fasta READS.fasta OUT.sam" << std::endl;
return 1;
}
// 1) Load contigs and reads.
FragmentStore<> fragStore;
if (!loadContigs(fragStore, argv[1])) return 1;
if (!loadReads(fragStore, argv[2])) return 1;
//FRAGMENT(pattern-finder)
// 2) Build an index over all reads and a SWIFT pattern over this index.
TIndex index(fragStore.readSeqStore);
TPattern pattern(index);
//FRAGMENT(swift)
// 3) Enumerate all epsilon matches.
for (unsigned i = 0; i < length(fragStore.contigStore); ++i) {
TFinder finder(fragStore.contigStore[i].seq);
while (find(finder, pattern, EPSILON)) {
//FRAGMENT(verification)
// Verify match.
Finder<TContigSeq> verifyFinder(fragStore.contigStore[i].seq);
setPosition(verifyFinder, beginPosition(finder));
Pattern<TReadSeq, HammingSimple> verifyPattern(fragStore.readSeqStore[position(pattern).i1]);
while (find(verifyFinder, verifyPattern) && position(verifyFinder) < endPosition(infix(finder))) {
TAlignedRead match(length(fragStore.alignedReadStore), position(pattern).i1, i,
beginPosition(verifyFinder), endPosition(verifyFinder));
appendValue(fragStore.alignedReadStore, match);
}
}
}
//FRAGMENT(main-output)
// 4) Write out SAM file.
std::ofstream samFile(argv[3], std::ios_base::out);
write(samFile, fragStore, SAM());
return 0;
}
<|endoftext|>
|
<commit_before>/*
* Copyright (c) 2010 Eduard Burtescu
*
* 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 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 <machine/HidInputManager.h>
#include <usb/UsbHub.h>
#include <usb/UsbDevice.h>
#include "UsbHumanInterfaceDevice.h"
#define undefined -0xffffffff
#define _sign(x) (x>=0?"+":"- ")<<(x>=0?x:-x)
static inline uint64_t _getField(uint8_t *pBuffer, size_t nStart, size_t nLength)
{
uint64_t nValue = 0;
size_t i = 0;
while(i < nLength)
{
uint8_t nBits = ((nStart % 8) + nLength - i) < 8 ? nLength % 8 : 8 - (nStart % 8);
nValue |= ((pBuffer[nStart / 8] >> (nStart % 8)) & ((1 << nBits) - 1)) << i;
i += nBits;
nStart += nBits;
}
return nValue;
}
static inline int64_t _uint2int(uint64_t val, uint8_t len)
{
// Check for the most significant bit, it shows the sign
if(val & (1 << (len - 1)))
return -((1 << len) - val); // Negative value
return val; // Positive value
}
UsbHumanInterfaceDevice::UsbHumanInterfaceDevice(UsbDevice *pDev) : Device(pDev), UsbDevice(pDev)
{
HidDescriptor *pHidDescriptor = 0;
for(size_t i = 0;i < m_pInterface->pOtherDescriptors.count();i++)
{
UnknownDescriptor *pDescriptor = m_pInterface->pOtherDescriptors[i];
if(pDescriptor->nType == 0x21)
{
pHidDescriptor = new HidDescriptor(pDescriptor);
break;
}
}
if(!pHidDescriptor)
{
ERROR("USB: HID: No HID descriptor");
return;
}
/// \bug WMware's mouse's second interface is known to cause problems
if(m_pDescriptor->pDescriptor->nVendorId == 0x0e0f && m_pInterface->pDescriptor->nInterface)
return;
// Disable BIOS stuff
//controlRequest(RequestType::Class | RequestRecipient::Interface, Request::SetInterface, 0, m_pInterface->pDescriptor->nInterface);
// Set Idle Rate to 0
controlRequest(RequestType::Class | RequestRecipient::Interface, Request::GetInterface, 0, 0);
uint16_t nHidSize = pHidDescriptor->pDescriptor->nDescriptorLength;
uint8_t *pHidReportDescriptor = static_cast<uint8_t*>(getDescriptor(0x22, 0, nHidSize, RequestRecipient::Interface));
int64_t nLogMin = undefined, nLogMax = undefined, nPhysMin = undefined, nPhysMax = undefined, nUsagePage = undefined,
nUsageMin = undefined, nUsageMax = undefined, nReportSize = undefined, nReportCount = undefined;
uint8_t nLogSize = 0;
uint32_t nBits = 0;
m_pReport = new HidReport();
Vector<size_t> *pUsages = new Vector<size_t>();
for(size_t i = 0; i < nHidSize; i++)
{
union
{
struct
{
uint8_t size : 2;
uint8_t type : 2;
uint8_t tag : 4;
} PACKED;
uint8_t raw;
} item;
item.raw = pHidReportDescriptor[i];
uint8_t size = item.size == 3 ? 4 : item.size;
uint32_t value = 0;
if(size == 1)
value = pHidReportDescriptor[i + 1];
else if(size == 2)
value = pHidReportDescriptor[i + 1] | (pHidReportDescriptor[i + 2] << 8);
else if(size == 4)
value = pHidReportDescriptor[i + 1] | (pHidReportDescriptor[i + 2] << 8) | (pHidReportDescriptor[i + 3] << 16) | (pHidReportDescriptor[i + 4] << 24);
#ifdef USB_VERBOSE_DEBUG
DEBUG_LOG("USB: HID: Item tag=" << item.tag << " type=" << Dec << item.type << " size=" << size << Hex);
#endif
switch(item.type)
{
case 0:
switch(item.tag)
{
case 0x8:
HidReportBlock *pBlock = new HidReportBlock();
pBlock->nCount = nReportCount;
pBlock->nSize = nReportSize;
if(value & 1)
{
pBlock->type = HidReportBlock::Ignore;
}
else
{
pBlock->nUsagePage = nUsagePage;
pBlock->nLogSize = nLogSize;
if(value & 2)
{
for(size_t j = 0; pUsages->count() < nReportCount; j++)
pUsages->pushBack(nUsageMin + j);
pBlock->pUsages = pUsages;
if(value & 4)
pBlock->type = HidReportBlock::Relative;
else
pBlock->type = HidReportBlock::Absolute;
}
else
{
pBlock->type = HidReportBlock::Array;
pBlock->nUsageBase = nUsageMin;
}
}
m_pReport->pBlockList.pushBack(pBlock);
nBits += nReportSize * nReportCount;
nUsageMin = undefined;
nUsageMax = undefined;
pUsages = new Vector<size_t>();
break;
}
break;
case 1:
switch(item.tag)
{
case 0x0:
nUsagePage = value;
pUsages->clear();
break;
case 0x1:
nLogMin = value;
break;
case 0x2:
nLogMax = value;
nLogSize = size;
break;
case 0x3:
nPhysMin = value;
break;
case 0x4:
nPhysMax = value;
break;
case 0x7:
nReportSize = value;
break;
case 0x9:
nReportCount = value;
break;
}
break;
case 2:
switch(item.tag)
{
case 0x0:
pUsages->pushBack(value);
break;
case 0x1:
nUsageMin = value;
break;
case 0x2:
nUsageMax = value;
break;
}
break;
}
i += size;
}
delete pUsages;
m_pReport->nBytes = nBits / 8;
// Allocate the report buffers
m_pReportBuffer = new uint8_t[m_pReport->nBytes];
m_pOldReportBuffer = new uint8_t[m_pReport->nBytes];
memset(m_pOldReportBuffer, 0, m_pReport->nBytes);
Endpoint *pInEndpoint = 0;
for(size_t i = 0; i < m_pInterface->pEndpoints.count(); i++)
{
Endpoint *pEndpoint = m_pInterface->pEndpoints[i];
if(pEndpoint->nTransferType == Endpoint::Interrupt && pEndpoint->bIn)
{
pInEndpoint = pEndpoint;
break;
}
}
if(!pInEndpoint)
{
ERROR("USB: HID: No Interrupt IN endpoint");
return;
}
// Add the input handler
addInterruptInHandler(pInEndpoint, reinterpret_cast<uintptr_t>(m_pReportBuffer), m_pReport->nBytes, callback, reinterpret_cast<uintptr_t>(this));
m_bHasDriver = true;
}
UsbHumanInterfaceDevice::~UsbHumanInterfaceDevice()
{
}
void UsbHumanInterfaceDevice::callback(uintptr_t pParam, ssize_t ret)
{
UsbHumanInterfaceDevice *pHid = reinterpret_cast<UsbHumanInterfaceDevice*>(pParam);
pHid->inputHandler();
}
void UsbHumanInterfaceDevice::inputHandler()
{
//NOTICE("USB: HID: Handling input on interface " << Dec << m_pInterface->pDescriptor->nInterface << Hex);
size_t nCurrentBit = 0;
for(List<HidReportBlock*>::Iterator it = m_pReport->pBlockList.begin(); it != m_pReport->pBlockList.end(); it++)
{
HidReportBlock *pBlock = *it;
for(size_t i = 0; pBlock->type != HidReportBlock::Ignore && i < pBlock->nCount; i++)
{
uint64_t nValue = _getField(m_pReportBuffer, nCurrentBit + i * pBlock->nSize, pBlock->nSize);
int64_t nSignedValue;
switch(pBlock->type)
{
case HidReportBlock::Absolute:
nSignedValue = nValue - _getField(m_pOldReportBuffer, nCurrentBit + i * pBlock->nSize, pBlock->nSize);
if(nSignedValue)
{
if(pBlock->nUsagePage == 7)
{
if(nSignedValue > 0)
HidInputManager::instance().keyDown((*pBlock->pUsages)[i]);
else
HidInputManager::instance().keyUp((*pBlock->pUsages)[i]);
}
else if(pBlock->nUsagePage == 9)
{
if(nSignedValue > 0)
NOTICE(" Button " << Dec << ((*pBlock->pUsages)[i]) << Hex << " down");
else
NOTICE(" Button " << Dec << ((*pBlock->pUsages)[i]) << Hex << " up");
}
else
NOTICE(" Absolute input, usage " << Dec << pBlock->nUsagePage << ":" << ((*pBlock->pUsages)[i]) << ", value " << _sign(nSignedValue) << " " << pBlock->nSize << Hex);
}
break;
case HidReportBlock::Relative:
nSignedValue = _uint2int(nValue, pBlock->nLogSize * 8);
if(nSignedValue)
NOTICE(" Relative input, usage " << Dec << pBlock->nUsagePage << ":" << ((*pBlock->pUsages)[i]) << ", value " << _sign(nSignedValue) << Hex);
break;
case HidReportBlock::Array:
if(nValue)
{
NOTICE(" Array input, usage entry " << Dec << pBlock->nUsagePage << ":" << (pBlock->nUsageBase + nValue) << Hex);
// Check if this array entry is new
bool bNew = true;
for(size_t j = 0; j < pBlock->nCount; j++)
{
if(_getField(m_pOldReportBuffer, nCurrentBit + j * pBlock->nSize, pBlock->nSize) == nValue)
{
bNew = false;
break;
}
}
if(bNew)
if(pBlock->nUsagePage == 7)
HidInputManager::instance().keyDown(pBlock->nUsageBase + nValue);
}
case HidReportBlock::Ignore:
default:
break;
}
}
// Special case here: check for array entries that disapeared
if(pBlock->type == HidReportBlock::Array)
{
for(size_t i = 0; i < pBlock->nCount; i++)
{
uint64_t nOldValue = _getField(m_pOldReportBuffer, nCurrentBit + i * pBlock->nSize, pBlock->nSize);
if(nOldValue)
{
// Check if this array entry disapeared
bool bDisapeared = true;
for(size_t j = 0; j < pBlock->nCount; j++)
{
if(_getField(m_pReportBuffer, nCurrentBit + j * pBlock->nSize, pBlock->nSize) == nOldValue)
{
bDisapeared = false;
break;
}
}
if(bDisapeared)
if(pBlock->nUsagePage == 7)
HidInputManager::instance().keyUp(pBlock->nUsageBase + nOldValue);
}
}
}
nCurrentBit += pBlock->nCount * pBlock->nSize;
}
memcpy(m_pOldReportBuffer, m_pReportBuffer, m_pReport->nBytes);
}
<commit_msg>Fix a memory leak in usb-hid.<commit_after>/*
* Copyright (c) 2010 Eduard Burtescu
*
* 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 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 <machine/HidInputManager.h>
#include <usb/UsbHub.h>
#include <usb/UsbDevice.h>
#include "UsbHumanInterfaceDevice.h"
#include <utilities/PointerGuard.h>
#define undefined -0xffffffff
#define _sign(x) (x>=0?"+":"- ")<<(x>=0?x:-x)
static inline uint64_t _getField(uint8_t *pBuffer, size_t nStart, size_t nLength)
{
uint64_t nValue = 0;
size_t i = 0;
while(i < nLength)
{
uint8_t nBits = ((nStart % 8) + nLength - i) < 8 ? nLength % 8 : 8 - (nStart % 8);
nValue |= ((pBuffer[nStart / 8] >> (nStart % 8)) & ((1 << nBits) - 1)) << i;
i += nBits;
nStart += nBits;
}
return nValue;
}
static inline int64_t _uint2int(uint64_t val, uint8_t len)
{
// Check for the most significant bit, it shows the sign
if(val & (1 << (len - 1)))
return -((1 << len) - val); // Negative value
return val; // Positive value
}
UsbHumanInterfaceDevice::UsbHumanInterfaceDevice(UsbDevice *pDev) : Device(pDev), UsbDevice(pDev)
{
HidDescriptor *pHidDescriptor = 0;
for(size_t i = 0;i < m_pInterface->pOtherDescriptors.count();i++)
{
UnknownDescriptor *pDescriptor = m_pInterface->pOtherDescriptors[i];
if(pDescriptor->nType == 0x21)
{
pHidDescriptor = new HidDescriptor(pDescriptor);
break;
}
}
if(!pHidDescriptor)
{
ERROR("USB: HID: No HID descriptor");
return;
}
PointerGuard<HidDescriptor> guard(pHidDescriptor);
/// \bug WMware's mouse's second interface is known to cause problems
if(m_pDescriptor->pDescriptor->nVendorId == 0x0e0f && m_pInterface->pDescriptor->nInterface)
return;
// Disable BIOS stuff
//controlRequest(RequestType::Class | RequestRecipient::Interface, Request::SetInterface, 0, m_pInterface->pDescriptor->nInterface);
// Set Idle Rate to 0
controlRequest(RequestType::Class | RequestRecipient::Interface, Request::GetInterface, 0, 0);
uint16_t nHidSize = pHidDescriptor->pDescriptor->nDescriptorLength;
uint8_t *pHidReportDescriptor = static_cast<uint8_t*>(getDescriptor(0x22, 0, nHidSize, RequestRecipient::Interface));
int64_t nLogMin = undefined, nLogMax = undefined, nPhysMin = undefined, nPhysMax = undefined, nUsagePage = undefined,
nUsageMin = undefined, nUsageMax = undefined, nReportSize = undefined, nReportCount = undefined;
uint8_t nLogSize = 0;
uint32_t nBits = 0;
m_pReport = new HidReport();
Vector<size_t> *pUsages = new Vector<size_t>();
for(size_t i = 0; i < nHidSize; i++)
{
union
{
struct
{
uint8_t size : 2;
uint8_t type : 2;
uint8_t tag : 4;
} PACKED;
uint8_t raw;
} item;
item.raw = pHidReportDescriptor[i];
uint8_t size = item.size == 3 ? 4 : item.size;
uint32_t value = 0;
if(size == 1)
value = pHidReportDescriptor[i + 1];
else if(size == 2)
value = pHidReportDescriptor[i + 1] | (pHidReportDescriptor[i + 2] << 8);
else if(size == 4)
value = pHidReportDescriptor[i + 1] | (pHidReportDescriptor[i + 2] << 8) | (pHidReportDescriptor[i + 3] << 16) | (pHidReportDescriptor[i + 4] << 24);
#ifdef USB_VERBOSE_DEBUG
DEBUG_LOG("USB: HID: Item tag=" << item.tag << " type=" << Dec << item.type << " size=" << size << Hex);
#endif
switch(item.type)
{
case 0:
switch(item.tag)
{
case 0x8:
HidReportBlock *pBlock = new HidReportBlock();
pBlock->nCount = nReportCount;
pBlock->nSize = nReportSize;
if(value & 1)
{
pBlock->type = HidReportBlock::Ignore;
}
else
{
pBlock->nUsagePage = nUsagePage;
pBlock->nLogSize = nLogSize;
if(value & 2)
{
for(size_t j = 0; pUsages->count() < nReportCount; j++)
pUsages->pushBack(nUsageMin + j);
pBlock->pUsages = pUsages;
if(value & 4)
pBlock->type = HidReportBlock::Relative;
else
pBlock->type = HidReportBlock::Absolute;
}
else
{
pBlock->type = HidReportBlock::Array;
pBlock->nUsageBase = nUsageMin;
}
}
m_pReport->pBlockList.pushBack(pBlock);
nBits += nReportSize * nReportCount;
nUsageMin = undefined;
nUsageMax = undefined;
pUsages = new Vector<size_t>();
break;
}
break;
case 1:
switch(item.tag)
{
case 0x0:
nUsagePage = value;
pUsages->clear();
break;
case 0x1:
nLogMin = value;
break;
case 0x2:
nLogMax = value;
nLogSize = size;
break;
case 0x3:
nPhysMin = value;
break;
case 0x4:
nPhysMax = value;
break;
case 0x7:
nReportSize = value;
break;
case 0x9:
nReportCount = value;
break;
}
break;
case 2:
switch(item.tag)
{
case 0x0:
pUsages->pushBack(value);
break;
case 0x1:
nUsageMin = value;
break;
case 0x2:
nUsageMax = value;
break;
}
break;
}
i += size;
}
delete pUsages;
m_pReport->nBytes = nBits / 8;
// Allocate the report buffers
m_pReportBuffer = new uint8_t[m_pReport->nBytes];
m_pOldReportBuffer = new uint8_t[m_pReport->nBytes];
memset(m_pOldReportBuffer, 0, m_pReport->nBytes);
Endpoint *pInEndpoint = 0;
for(size_t i = 0; i < m_pInterface->pEndpoints.count(); i++)
{
Endpoint *pEndpoint = m_pInterface->pEndpoints[i];
if(pEndpoint->nTransferType == Endpoint::Interrupt && pEndpoint->bIn)
{
pInEndpoint = pEndpoint;
break;
}
}
if(!pInEndpoint)
{
ERROR("USB: HID: No Interrupt IN endpoint");
return;
}
// Add the input handler
addInterruptInHandler(pInEndpoint, reinterpret_cast<uintptr_t>(m_pReportBuffer), m_pReport->nBytes, callback, reinterpret_cast<uintptr_t>(this));
m_bHasDriver = true;
}
UsbHumanInterfaceDevice::~UsbHumanInterfaceDevice()
{
}
void UsbHumanInterfaceDevice::callback(uintptr_t pParam, ssize_t ret)
{
UsbHumanInterfaceDevice *pHid = reinterpret_cast<UsbHumanInterfaceDevice*>(pParam);
pHid->inputHandler();
}
void UsbHumanInterfaceDevice::inputHandler()
{
//NOTICE("USB: HID: Handling input on interface " << Dec << m_pInterface->pDescriptor->nInterface << Hex);
size_t nCurrentBit = 0;
for(List<HidReportBlock*>::Iterator it = m_pReport->pBlockList.begin(); it != m_pReport->pBlockList.end(); it++)
{
HidReportBlock *pBlock = *it;
for(size_t i = 0; pBlock->type != HidReportBlock::Ignore && i < pBlock->nCount; i++)
{
uint64_t nValue = _getField(m_pReportBuffer, nCurrentBit + i * pBlock->nSize, pBlock->nSize);
int64_t nSignedValue;
switch(pBlock->type)
{
case HidReportBlock::Absolute:
nSignedValue = nValue - _getField(m_pOldReportBuffer, nCurrentBit + i * pBlock->nSize, pBlock->nSize);
if(nSignedValue)
{
if(pBlock->nUsagePage == 7)
{
if(nSignedValue > 0)
HidInputManager::instance().keyDown((*pBlock->pUsages)[i]);
else
HidInputManager::instance().keyUp((*pBlock->pUsages)[i]);
}
else if(pBlock->nUsagePage == 9)
{
if(nSignedValue > 0)
NOTICE(" Button " << Dec << ((*pBlock->pUsages)[i]) << Hex << " down");
else
NOTICE(" Button " << Dec << ((*pBlock->pUsages)[i]) << Hex << " up");
}
else
NOTICE(" Absolute input, usage " << Dec << pBlock->nUsagePage << ":" << ((*pBlock->pUsages)[i]) << ", value " << _sign(nSignedValue) << " " << pBlock->nSize << Hex);
}
break;
case HidReportBlock::Relative:
nSignedValue = _uint2int(nValue, pBlock->nLogSize * 8);
if(nSignedValue)
NOTICE(" Relative input, usage " << Dec << pBlock->nUsagePage << ":" << ((*pBlock->pUsages)[i]) << ", value " << _sign(nSignedValue) << Hex);
break;
case HidReportBlock::Array:
if(nValue)
{
NOTICE(" Array input, usage entry " << Dec << pBlock->nUsagePage << ":" << (pBlock->nUsageBase + nValue) << Hex);
// Check if this array entry is new
bool bNew = true;
for(size_t j = 0; j < pBlock->nCount; j++)
{
if(_getField(m_pOldReportBuffer, nCurrentBit + j * pBlock->nSize, pBlock->nSize) == nValue)
{
bNew = false;
break;
}
}
if(bNew)
if(pBlock->nUsagePage == 7)
HidInputManager::instance().keyDown(pBlock->nUsageBase + nValue);
}
case HidReportBlock::Ignore:
default:
break;
}
}
// Special case here: check for array entries that disapeared
if(pBlock->type == HidReportBlock::Array)
{
for(size_t i = 0; i < pBlock->nCount; i++)
{
uint64_t nOldValue = _getField(m_pOldReportBuffer, nCurrentBit + i * pBlock->nSize, pBlock->nSize);
if(nOldValue)
{
// Check if this array entry disapeared
bool bDisapeared = true;
for(size_t j = 0; j < pBlock->nCount; j++)
{
if(_getField(m_pReportBuffer, nCurrentBit + j * pBlock->nSize, pBlock->nSize) == nOldValue)
{
bDisapeared = false;
break;
}
}
if(bDisapeared)
if(pBlock->nUsagePage == 7)
HidInputManager::instance().keyUp(pBlock->nUsageBase + nOldValue);
}
}
}
nCurrentBit += pBlock->nCount * pBlock->nSize;
}
memcpy(m_pOldReportBuffer, m_pReportBuffer, m_pReport->nBytes);
}
<|endoftext|>
|
<commit_before>/*************************************************************************
*
* REALM CONFIDENTIAL
* __________________
*
* [2011] - [2015] Realm Inc
* All Rights Reserved.
*
* NOTICE: All information contained herein is, and remains
* the property of Realm Incorporated and its suppliers,
* if any. The intellectual and technical concepts contained
* herein are proprietary to Realm Incorporated
* and its suppliers and may be covered by U.S. and Foreign Patents,
* patents in process, and are protected by trade secret or copyright law.
* Dissemination of this information or reproduction of this material
* is strictly forbidden unless prior written permission is obtained
* from Realm Incorporated.
*
**************************************************************************/
#ifndef REALM_COLUMN_DATETIME_HPP
#define REALM_COLUMN_DATETIME_HPP
#include <realm/column.hpp>
namespace realm {
struct NewDate {
NewDate(int64_t seconds, int32_t nanoseconds) : m_seconds(seconds), m_nanoseconds(nanoseconds), m_is_null(false) { }
NewDate(const null&) : m_is_null(true) { }
NewDate() : NewDate(null()) { }
bool is_null() const { return m_is_null; }
bool operator == (const NewDate& rhs) const { return m_seconds == rhs.m_seconds && m_nanoseconds == rhs.m_nanoseconds; }
bool operator != (const NewDate& rhs) const { return m_seconds != rhs.m_seconds || m_nanoseconds != rhs.m_nanoseconds; }
bool operator > (const NewDate& rhs) const { return (m_seconds > rhs.m_seconds) || (m_seconds == rhs.m_seconds && m_nanoseconds > rhs.m_nanoseconds); }
bool operator < (const NewDate& rhs) const { return (m_seconds < rhs.m_seconds) || (m_seconds == rhs.m_seconds && m_nanoseconds < rhs.m_nanoseconds); }
NewDate& operator = (const NewDate& rhs) = default;
int64_t m_seconds;
int32_t m_nanoseconds;
bool m_is_null;
};
class DateTimeColumn : public ColumnBase, public ColumnTemplate<NewDate> {
public:
DateTimeColumn();
/// Get the number of entries in this column. This operation is relatively
/// slow.
size_t size() const noexcept override;
/// Whether or not this column is nullable.
bool is_nullable() const noexcept override;
/// Whether or not the value at \a row_ndx is NULL. If the column is not
/// nullable, always returns false.
bool is_null(size_t row_ndx) const noexcept override;
/// Sets the value at \a row_ndx to be NULL.
/// \throw LogicError Thrown if this column is not nullable.
void set_null(size_t row_ndx) override;
void insert_rows(size_t row_ndx, size_t num_rows_to_insert, size_t prior_num_rows, bool nullable) override;
void erase_rows(size_t row_ndx, size_t num_rows_to_erase, size_t prior_num_rows,
bool broken_reciprocal_backlinks) override;
void move_last_row_over(size_t row_ndx, size_t prior_num_rows,
bool broken_reciprocal_backlinks) override;
void clear(size_t num_rows, bool broken_reciprocal_backlinks) override;
void swap_rows(size_t row_ndx_1, size_t row_ndx_2) override;
void destroy() noexcept override;
StringData get_index_data(size_t, StringIndex::StringConversionBuffer& buffer) const noexcept override;
Allocator& get_alloc() const noexcept override;
/// Returns the 'ref' of the root array.
ref_type get_ref() const noexcept override;
MemRef get_mem() const noexcept override;
void replace_root_array(std::unique_ptr<Array> leaf) override;
MemRef clone_deep(Allocator& alloc) const override;
void detach() override;
bool is_attached() const noexcept override;
ref_type write(size_t slice_offset, size_t slice_size, size_t table_size, _impl::OutputStream&) const override;
void set_parent(ArrayParent*, size_t ndx_in_parent) noexcept override;
size_t get_ndx_in_parent() const noexcept override;
void set_ndx_in_parent(size_t ndx_in_parent) noexcept override;
void update_from_parent(size_t old_baseline) noexcept override;
void refresh_accessor_tree(size_t new_col_ndx, const Spec&) override;
void verify() const override;
void to_dot(std::ostream&, StringData title = StringData()) const override;
void do_dump_node_structure(std::ostream&, int level) const override;
void leaf_to_dot(MemRef, ArrayParent*, size_t ndx_in_parent, std::ostream&) const override;
void add(const NewDate& ndt = NewDate{});
NewDate get(size_t row_ndx) const noexcept;
NewDate get_val(size_t row_ndx) const override;
void set(size_t row_ndx, const NewDate& ndt);
private:
IntNullColumn m_seconds;
IntegerColumn m_nanoseconds;
};
// Implementation
inline DateTimeColumn::DateTimeColumn() :
m_seconds(Allocator::get_default(), IntNullColumn::create(Allocator::get_default())),
m_nanoseconds(Allocator::get_default(), IntegerColumn::create(Allocator::get_default()))
{
}
/// Get the number of entries in this column. This operation is relatively
/// slow.
inline size_t DateTimeColumn::size() const noexcept
{
// FIXME: Consider debug asserts on the columns having the same size
return m_seconds.size();
}
/// Whether or not this column is nullable.
inline bool DateTimeColumn::is_nullable() const noexcept
{
return m_seconds.is_nullable();
}
/// Whether or not the value at \a row_ndx is NULL. If the column is not
/// nullable, always returns false.
inline bool DateTimeColumn::is_null(size_t row_ndx) const noexcept
{
return m_seconds.is_null(row_ndx);
}
/// Sets the value at \a row_ndx to be NULL.
/// \throw LogicError Thrown if this column is not nullable.
inline void DateTimeColumn::set_null(size_t row_ndx)
{
m_seconds.set_null(row_ndx);
}
inline void DateTimeColumn::insert_rows(size_t row_ndx, size_t num_rows_to_insert, size_t prior_num_rows,
bool nullable)
{
m_seconds.insert_rows(row_ndx, num_rows_to_insert, prior_num_rows, nullable);
m_nanoseconds.insert_rows(row_ndx, num_rows_to_insert, prior_num_rows, nullable);
}
inline void DateTimeColumn::erase_rows(size_t row_ndx, size_t num_rows_to_erase, size_t prior_num_rows,
bool broken_reciprocal_backlinks)
{
m_seconds.erase_rows(row_ndx, num_rows_to_erase, prior_num_rows, broken_reciprocal_backlinks);
m_nanoseconds.erase_rows(row_ndx, num_rows_to_erase, prior_num_rows, broken_reciprocal_backlinks);
}
inline void DateTimeColumn::move_last_row_over(size_t row_ndx, size_t prior_num_rows,
bool broken_reciprocal_backlinks)
{
m_seconds.move_last_row_over(row_ndx, prior_num_rows, broken_reciprocal_backlinks);
m_nanoseconds.move_last_row_over(row_ndx, prior_num_rows, broken_reciprocal_backlinks);
}
inline void DateTimeColumn::clear(size_t num_rows, bool broken_reciprocal_backlinks)
{
m_seconds.clear(num_rows, broken_reciprocal_backlinks);
m_nanoseconds.clear(num_rows, broken_reciprocal_backlinks);
}
inline void DateTimeColumn::swap_rows(size_t row_ndx_1, size_t row_ndx_2)
{
m_seconds.swap_rows(row_ndx_1, row_ndx_2);
m_nanoseconds.swap_rows(row_ndx_1, row_ndx_2);
}
inline void DateTimeColumn::destroy() noexcept
{
m_seconds.destroy();
m_nanoseconds.destroy();
}
inline StringData DateTimeColumn::get_index_data(size_t, StringIndex::StringConversionBuffer& /*buffer*/) const noexcept
{
// FIXME: Dummy implementation
return null();
}
inline Allocator& DateTimeColumn::get_alloc() const noexcept
{
// FIXME: Dummy implementation
return Allocator::get_default();
}
inline ref_type DateTimeColumn::get_ref() const noexcept
{
// FIXME: Dummy implementation
return 0;
}
inline MemRef DateTimeColumn::get_mem() const noexcept
{
// FIXME: Dummy implementation
return MemRef();
}
inline void DateTimeColumn::replace_root_array(std::unique_ptr<Array> /*leaf*/)
{
// FIXME: Dummy implementation
}
inline MemRef DateTimeColumn::clone_deep(Allocator& /*alloc*/) const
{
// FIXME: Dummy implementation
return MemRef();
}
inline void DateTimeColumn::detach()
{
m_seconds.detach();
m_nanoseconds.detach();
}
inline bool DateTimeColumn::is_attached() const noexcept
{
// FIXME: Assert on both columns having same attached state?
return m_seconds.is_attached();
}
inline ref_type DateTimeColumn::write(size_t /*slice_offset*/, size_t /*slice_size*/, size_t /*table_size*/,
_impl::OutputStream&) const
{
// FIXME: Dummy implementation
return 0;
}
inline void DateTimeColumn::set_parent(ArrayParent*, size_t /*ndx_in_parent*/) noexcept
{
// FIXME: Dummy implementation
}
inline size_t DateTimeColumn::get_ndx_in_parent() const noexcept
{
// FIXME: Dummy implementation
return 0;
}
inline void DateTimeColumn::set_ndx_in_parent(size_t /*ndx_in_parent*/) noexcept
{
// FIXME: Dummy implementation
}
inline void DateTimeColumn::update_from_parent(size_t /*old_baseline*/) noexcept
{
// FIXME: Dummy implementation
}
inline void DateTimeColumn::refresh_accessor_tree(size_t /*new_col_ndx*/, const Spec&)
{
// FIXME: Dummy implementation
}
inline void DateTimeColumn::verify() const
{
// FIXME: Dummy implementation
}
inline void DateTimeColumn::to_dot(std::ostream&, StringData /*title*/) const
{
// FIXME: Dummy implementation
}
inline void DateTimeColumn::do_dump_node_structure(std::ostream&, int /*level*/) const
{
// FIXME: Dummy implementation
}
inline void DateTimeColumn::leaf_to_dot(MemRef, ArrayParent*, size_t /*ndx_in_parent*/, std::ostream&) const
{
// FIXME: Dummy implementation
}
inline void DateTimeColumn::add(const NewDate& ndt)
{
util::Optional<int64_t> seconds = ndt.is_null() ? util::none : util::make_optional(ndt.m_seconds);
int32_t nanoseconds = ndt.is_null() ? 0 : ndt.m_nanoseconds;
m_seconds.add(seconds);
m_nanoseconds.add(nanoseconds);
}
inline NewDate DateTimeColumn::get(size_t row_ndx) const noexcept
{
util::Optional<int64_t> seconds = m_seconds.get(row_ndx);
return seconds ? NewDate(*seconds, int32_t(m_nanoseconds.get(row_ndx))) : NewDate(null());
}
inline NewDate DateTimeColumn::get_val(size_t row_ndx) const
{
return get(row_ndx);
}
inline void DateTimeColumn::set(size_t row_ndx, const NewDate& ndt)
{
util::Optional<int64_t> seconds = ndt.is_null() ? util::none : util::make_optional(ndt.m_seconds);
int32_t nanoseconds = ndt.is_null() ? 0 : ndt.m_nanoseconds;
m_seconds.set(row_ndx, seconds);
m_nanoseconds.set(row_ndx, nanoseconds);
}
} // namespace realm
#endif // REALM_COLUMN_DATETIME_HPP
<commit_msg>Fixed non-debug compile issues.<commit_after>/*************************************************************************
*
* REALM CONFIDENTIAL
* __________________
*
* [2011] - [2015] Realm Inc
* All Rights Reserved.
*
* NOTICE: All information contained herein is, and remains
* the property of Realm Incorporated and its suppliers,
* if any. The intellectual and technical concepts contained
* herein are proprietary to Realm Incorporated
* and its suppliers and may be covered by U.S. and Foreign Patents,
* patents in process, and are protected by trade secret or copyright law.
* Dissemination of this information or reproduction of this material
* is strictly forbidden unless prior written permission is obtained
* from Realm Incorporated.
*
**************************************************************************/
#ifndef REALM_COLUMN_DATETIME_HPP
#define REALM_COLUMN_DATETIME_HPP
#include <realm/column.hpp>
namespace realm {
struct NewDate {
NewDate(int64_t seconds, int32_t nanoseconds) : m_seconds(seconds), m_nanoseconds(nanoseconds), m_is_null(false) { }
NewDate(const null&) : m_is_null(true) { }
NewDate() : NewDate(null()) { }
bool is_null() const { return m_is_null; }
bool operator == (const NewDate& rhs) const { return m_seconds == rhs.m_seconds && m_nanoseconds == rhs.m_nanoseconds; }
bool operator != (const NewDate& rhs) const { return m_seconds != rhs.m_seconds || m_nanoseconds != rhs.m_nanoseconds; }
bool operator > (const NewDate& rhs) const { return (m_seconds > rhs.m_seconds) || (m_seconds == rhs.m_seconds && m_nanoseconds > rhs.m_nanoseconds); }
bool operator < (const NewDate& rhs) const { return (m_seconds < rhs.m_seconds) || (m_seconds == rhs.m_seconds && m_nanoseconds < rhs.m_nanoseconds); }
NewDate& operator = (const NewDate& rhs) = default;
int64_t m_seconds;
int32_t m_nanoseconds;
bool m_is_null;
};
class DateTimeColumn : public ColumnBase, public ColumnTemplate<NewDate> {
public:
DateTimeColumn();
/// Get the number of entries in this column. This operation is relatively
/// slow.
size_t size() const noexcept override;
/// Whether or not this column is nullable.
bool is_nullable() const noexcept override;
/// Whether or not the value at \a row_ndx is NULL. If the column is not
/// nullable, always returns false.
bool is_null(size_t row_ndx) const noexcept override;
/// Sets the value at \a row_ndx to be NULL.
/// \throw LogicError Thrown if this column is not nullable.
void set_null(size_t row_ndx) override;
void insert_rows(size_t row_ndx, size_t num_rows_to_insert, size_t prior_num_rows, bool nullable) override;
void erase_rows(size_t row_ndx, size_t num_rows_to_erase, size_t prior_num_rows,
bool broken_reciprocal_backlinks) override;
void move_last_row_over(size_t row_ndx, size_t prior_num_rows,
bool broken_reciprocal_backlinks) override;
void clear(size_t num_rows, bool broken_reciprocal_backlinks) override;
void swap_rows(size_t row_ndx_1, size_t row_ndx_2) override;
void destroy() noexcept override;
StringData get_index_data(size_t, StringIndex::StringConversionBuffer& buffer) const noexcept override;
Allocator& get_alloc() const noexcept override;
/// Returns the 'ref' of the root array.
ref_type get_ref() const noexcept override;
MemRef get_mem() const noexcept override;
void replace_root_array(std::unique_ptr<Array> leaf) override;
MemRef clone_deep(Allocator& alloc) const override;
void detach() override;
bool is_attached() const noexcept override;
ref_type write(size_t slice_offset, size_t slice_size, size_t table_size, _impl::OutputStream&) const override;
void set_parent(ArrayParent*, size_t ndx_in_parent) noexcept override;
size_t get_ndx_in_parent() const noexcept override;
void set_ndx_in_parent(size_t ndx_in_parent) noexcept override;
void update_from_parent(size_t old_baseline) noexcept override;
void refresh_accessor_tree(size_t new_col_ndx, const Spec&) override;
#ifdef REALM_DEBUG
void verify() const override;
void to_dot(std::ostream&, StringData title = StringData()) const override;
void do_dump_node_structure(std::ostream&, int level) const override;
void leaf_to_dot(MemRef, ArrayParent*, size_t ndx_in_parent, std::ostream&) const override;
#endif
void add(const NewDate& ndt = NewDate{});
NewDate get(size_t row_ndx) const noexcept;
NewDate get_val(size_t row_ndx) const override;
void set(size_t row_ndx, const NewDate& ndt);
private:
IntNullColumn m_seconds;
IntegerColumn m_nanoseconds;
};
// Implementation
inline DateTimeColumn::DateTimeColumn() :
m_seconds(Allocator::get_default(), IntNullColumn::create(Allocator::get_default())),
m_nanoseconds(Allocator::get_default(), IntegerColumn::create(Allocator::get_default()))
{
}
/// Get the number of entries in this column. This operation is relatively
/// slow.
inline size_t DateTimeColumn::size() const noexcept
{
// FIXME: Consider debug asserts on the columns having the same size
return m_seconds.size();
}
/// Whether or not this column is nullable.
inline bool DateTimeColumn::is_nullable() const noexcept
{
return m_seconds.is_nullable();
}
/// Whether or not the value at \a row_ndx is NULL. If the column is not
/// nullable, always returns false.
inline bool DateTimeColumn::is_null(size_t row_ndx) const noexcept
{
return m_seconds.is_null(row_ndx);
}
/// Sets the value at \a row_ndx to be NULL.
/// \throw LogicError Thrown if this column is not nullable.
inline void DateTimeColumn::set_null(size_t row_ndx)
{
m_seconds.set_null(row_ndx);
}
inline void DateTimeColumn::insert_rows(size_t row_ndx, size_t num_rows_to_insert, size_t prior_num_rows,
bool nullable)
{
m_seconds.insert_rows(row_ndx, num_rows_to_insert, prior_num_rows, nullable);
m_nanoseconds.insert_rows(row_ndx, num_rows_to_insert, prior_num_rows, nullable);
}
inline void DateTimeColumn::erase_rows(size_t row_ndx, size_t num_rows_to_erase, size_t prior_num_rows,
bool broken_reciprocal_backlinks)
{
m_seconds.erase_rows(row_ndx, num_rows_to_erase, prior_num_rows, broken_reciprocal_backlinks);
m_nanoseconds.erase_rows(row_ndx, num_rows_to_erase, prior_num_rows, broken_reciprocal_backlinks);
}
inline void DateTimeColumn::move_last_row_over(size_t row_ndx, size_t prior_num_rows,
bool broken_reciprocal_backlinks)
{
m_seconds.move_last_row_over(row_ndx, prior_num_rows, broken_reciprocal_backlinks);
m_nanoseconds.move_last_row_over(row_ndx, prior_num_rows, broken_reciprocal_backlinks);
}
inline void DateTimeColumn::clear(size_t num_rows, bool broken_reciprocal_backlinks)
{
m_seconds.clear(num_rows, broken_reciprocal_backlinks);
m_nanoseconds.clear(num_rows, broken_reciprocal_backlinks);
}
inline void DateTimeColumn::swap_rows(size_t row_ndx_1, size_t row_ndx_2)
{
m_seconds.swap_rows(row_ndx_1, row_ndx_2);
m_nanoseconds.swap_rows(row_ndx_1, row_ndx_2);
}
inline void DateTimeColumn::destroy() noexcept
{
m_seconds.destroy();
m_nanoseconds.destroy();
}
inline StringData DateTimeColumn::get_index_data(size_t, StringIndex::StringConversionBuffer& /*buffer*/) const noexcept
{
// FIXME: Dummy implementation
return null();
}
inline Allocator& DateTimeColumn::get_alloc() const noexcept
{
// FIXME: Dummy implementation
return Allocator::get_default();
}
inline ref_type DateTimeColumn::get_ref() const noexcept
{
// FIXME: Dummy implementation
return 0;
}
inline MemRef DateTimeColumn::get_mem() const noexcept
{
// FIXME: Dummy implementation
return MemRef();
}
inline void DateTimeColumn::replace_root_array(std::unique_ptr<Array> /*leaf*/)
{
// FIXME: Dummy implementation
}
inline MemRef DateTimeColumn::clone_deep(Allocator& /*alloc*/) const
{
// FIXME: Dummy implementation
return MemRef();
}
inline void DateTimeColumn::detach()
{
m_seconds.detach();
m_nanoseconds.detach();
}
inline bool DateTimeColumn::is_attached() const noexcept
{
// FIXME: Assert on both columns having same attached state?
return m_seconds.is_attached();
}
inline ref_type DateTimeColumn::write(size_t /*slice_offset*/, size_t /*slice_size*/, size_t /*table_size*/,
_impl::OutputStream&) const
{
// FIXME: Dummy implementation
return 0;
}
inline void DateTimeColumn::set_parent(ArrayParent*, size_t /*ndx_in_parent*/) noexcept
{
// FIXME: Dummy implementation
}
inline size_t DateTimeColumn::get_ndx_in_parent() const noexcept
{
// FIXME: Dummy implementation
return 0;
}
inline void DateTimeColumn::set_ndx_in_parent(size_t /*ndx_in_parent*/) noexcept
{
// FIXME: Dummy implementation
}
inline void DateTimeColumn::update_from_parent(size_t /*old_baseline*/) noexcept
{
// FIXME: Dummy implementation
}
inline void DateTimeColumn::refresh_accessor_tree(size_t /*new_col_ndx*/, const Spec&)
{
// FIXME: Dummy implementation
}
#ifdef REALM_DEBUG
inline void DateTimeColumn::verify() const
{
// FIXME: Dummy implementation
}
inline void DateTimeColumn::to_dot(std::ostream&, StringData /*title*/) const
{
// FIXME: Dummy implementation
}
inline void DateTimeColumn::do_dump_node_structure(std::ostream&, int /*level*/) const
{
// FIXME: Dummy implementation
}
inline void DateTimeColumn::leaf_to_dot(MemRef, ArrayParent*, size_t /*ndx_in_parent*/, std::ostream&) const
{
// FIXME: Dummy implementation
}
#endif
inline void DateTimeColumn::add(const NewDate& ndt)
{
util::Optional<int64_t> seconds = ndt.is_null() ? util::none : util::make_optional(ndt.m_seconds);
int32_t nanoseconds = ndt.is_null() ? 0 : ndt.m_nanoseconds;
m_seconds.add(seconds);
m_nanoseconds.add(nanoseconds);
}
inline NewDate DateTimeColumn::get(size_t row_ndx) const noexcept
{
util::Optional<int64_t> seconds = m_seconds.get(row_ndx);
return seconds ? NewDate(*seconds, int32_t(m_nanoseconds.get(row_ndx))) : NewDate(null());
}
inline NewDate DateTimeColumn::get_val(size_t row_ndx) const
{
return get(row_ndx);
}
inline void DateTimeColumn::set(size_t row_ndx, const NewDate& ndt)
{
util::Optional<int64_t> seconds = ndt.is_null() ? util::none : util::make_optional(ndt.m_seconds);
int32_t nanoseconds = ndt.is_null() ? 0 : ndt.m_nanoseconds;
m_seconds.set(row_ndx, seconds);
m_nanoseconds.set(row_ndx, nanoseconds);
}
} // namespace realm
#endif // REALM_COLUMN_DATETIME_HPP
<|endoftext|>
|
<commit_before>#include <die-tk.h>
#include <iostream>
using namespace std;
using namespace tk;
WDims getDims(bool big) { return big ? WDims(200,100) : WDims(100,200); }
int main()
{
Application app;
bool firstWindowWide = true;
auto swapWindowSizes = [&firstWindowWide](Window & w1, Window & w2) {
w2.setDims(getDims(firstWindowWide));
firstWindowWide = ! firstWindowWide;
w1.setDims(getDims(firstWindowWide));
};
Window window(WindowParams("first").start(10,10).dims(200,100));
Window window2(WindowParams("second").start(250,10).dims(100,200));
window.onMouseDown([&](MouseEvent e, Point pt) {
switch(e.button) {
case MouseButton::left: {
swapWindowSizes(window,window2);
app.processMessages(); // makes setDims to execute now, before drawing the poly
Points points = { {40,10}, {80,40}, {40,80}, {10,40}, };
window.canvas().drawPoly(points,RGBColor(0,180,0));
} break;
case MouseButton::right:
swapWindowSizes(window,window2);
break;
}
});
window2.onMouseDown([&](MouseEvent e, Point pt) {
switch(e.button) {
case MouseButton::left:
swapWindowSizes(window,window2);
app.processMessages(); // makes setDims to execute now, before drawing the poly
window2.canvas().fillRect(Rect::closed(Point(10,10),WDims(80,80)),RGBColor(180,180,0));
break;
case MouseButton::right:
swapWindowSizes(window,window2);
break;
}
});
bool open = true;
auto closeFn = [&open]() -> bool { open = false; return true; };
window.onClose(closeFn);
window2.onClose(closeFn);
window.onResize([](WDims d) -> WDims {
if( d.width > 200 ) d.width = 200;
if( d.height > 400 ) d.height = 400;
return d;
});
window2.onResize([](WDims d) -> WDims {
if( d.width < 100 ) d.width = 100;
if( d.height < 100 ) d.height = 100;
return d;
});
do {
app.waitForMessages();
app.processMessages();
} while( open );
}
<commit_msg>fixing tabs<commit_after>#include <die-tk.h>
#include <iostream>
using namespace std;
using namespace tk;
WDims getDims(bool big) { return big ? WDims(200,100) : WDims(100,200); }
int main()
{
Application app;
bool firstWindowWide = true;
auto swapWindowSizes = [&firstWindowWide](Window & w1, Window & w2) {
w2.setDims(getDims(firstWindowWide));
firstWindowWide = ! firstWindowWide;
w1.setDims(getDims(firstWindowWide));
};
Window window(WindowParams("first").start(10,10).dims(200,100));
Window window2(WindowParams("second").start(250,10).dims(100,200));
window.onMouseDown([&](MouseEvent e, Point pt) {
switch(e.button) {
case MouseButton::left: {
swapWindowSizes(window,window2);
app.processMessages(); // makes setDims to execute now, before drawing the poly
Points points = { {40,10}, {80,40}, {40,80}, {10,40}, };
window.canvas().drawPoly(points,RGBColor(0,180,0));
} break;
case MouseButton::right:
swapWindowSizes(window,window2);
break;
}
});
window2.onMouseDown([&](MouseEvent e, Point pt) {
switch(e.button) {
case MouseButton::left:
swapWindowSizes(window,window2);
app.processMessages(); // makes setDims to execute now, before drawing the poly
window2.canvas().fillRect(Rect::closed(Point(10,10),WDims(80,80)),RGBColor(180,180,0));
break;
case MouseButton::right:
swapWindowSizes(window,window2);
break;
}
});
bool open = true;
auto closeFn = [&open]() -> bool { open = false; return true; };
window.onClose(closeFn);
window2.onClose(closeFn);
window.onResize([](WDims d) -> WDims {
if( d.width > 200 ) d.width = 200;
if( d.height > 400 ) d.height = 400;
return d;
});
window2.onResize([](WDims d) -> WDims {
if( d.width < 100 ) d.width = 100;
if( d.height < 100 ) d.height = 100;
return d;
});
do {
app.waitForMessages();
app.processMessages();
} while( open );
}
<|endoftext|>
|
<commit_before>//*****************************************************************************
// Copyright 2017-2018 Intel Corporation
//
// 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 <algorithm>
#include <typeindex>
#include <unordered_set>
#include "ngraph/graph_util.hpp"
#include "ngraph/log.hpp"
#include "ngraph/op/constant.hpp"
#include "ngraph/op/convolution.hpp"
#include "ngraph/op/parameter.hpp"
#include "ngraph/op/reshape.hpp"
#include "ngraph/op/slice.hpp"
#include "ngraph/pass/graph_rewrite.hpp"
#include "ngraph/pass/manager.hpp"
#include "ngraph/pattern/matcher.hpp"
#include "ngraph/pattern/op/label.hpp"
#include "ngraph/pattern/op/skip.hpp"
#include "ngraph/runtime/cpu/cpu_layout_descriptor.hpp"
#include "ngraph/runtime/cpu/cpu_op_annotations.hpp"
#include "ngraph/runtime/cpu/mkldnn_utils.hpp"
#include "ngraph/runtime/cpu/op/convert_layout.hpp"
#include "ngraph/runtime/cpu/pass/cpu_post_layout_optimizations.hpp"
using namespace ngraph;
using namespace std;
#define TI(x) std::type_index(typeid(x))
void ngraph::runtime::cpu::pass::CPUPostLayoutOptimizations::construct_weight_fusion()
{
auto param = std::make_shared<pattern::op::Label>(element::f32, Shape{64});
auto reshape_conv =
std::make_shared<ngraph::op::Reshape>(param, AxisVector{0}, Shape{16, 4, 1, 1});
auto data_conv = std::make_shared<pattern::op::Label>(element::f32, Shape{16, 4, 7, 7});
auto tvt = reshape_conv->get_outputs().at(0).get_tensor_ptr().get();
auto lt_desc = std::make_shared<runtime::cpu::LayoutDescriptor>(*tvt);
auto cvt_lt_conv = std::make_shared<runtime::cpu::op::ConvertLayout>(reshape_conv, lt_desc);
auto conv = std::make_shared<ngraph::op::Convolution>(
data_conv, cvt_lt_conv, Strides{1, 1}, Strides{1, 1});
pattern::graph_rewrite_callback callback = [param](pattern::Matcher& m) {
NGRAPH_DEBUG << "In a callback for construct_weight against "
<< m.get_match_root()->get_name();
auto m_cvt_lt = m.get_match_root()->get_argument(1);
auto m_reshape_conv = m_cvt_lt->get_argument(0);
std::shared_ptr<Node> m_conv_bprop;
std::vector<std::type_index> user_pattern = {TI(ngraph::op::Reshape),
TI(runtime::cpu::op::ConvertLayout),
TI(ngraph::op::ConvolutionBackpropData)};
for (auto u : m.get_pattern_map()[param]->get_users())
{
if (u != m_reshape_conv)
{
size_t num_matches = 0;
auto ui = u;
for (; num_matches < user_pattern.size(); num_matches++)
{
const Node& user_ref = *ui;
if (TI(user_ref) != user_pattern.at(num_matches))
{
NGRAPH_DEBUG << "the type for user " << ui->get_name()
<< " doesn't match the type at " << num_matches;
break;
}
if (ui->get_users().size() != 1)
{
NGRAPH_DEBUG << u->get_name() << " has more than one user";
break;
}
ui = ui->get_users().at(0);
}
if (num_matches == user_pattern.size())
{
m_conv_bprop = u->get_users().at(0)->get_users().at(0);
NGRAPH_DEBUG << " m_conv_bprop is set to " << m_conv_bprop->get_name();
break;
}
}
}
if (!m_conv_bprop)
{
return false;
}
auto m_cvt_lt_bprop = m_conv_bprop->get_argument(0);
auto m_reshape_bprop = m_cvt_lt_bprop->get_argument(0);
NGRAPH_DEBUG << "Replacing input "
<< m_cvt_lt_bprop->get_inputs().at(0).get_output().get_node()->get_name()
<< " to " << m_cvt_lt_bprop->get_name() << " with "
<< m_cvt_lt->get_outputs().at(0).get_node()->get_name();
m_cvt_lt_bprop->get_inputs().at(0).replace_output(m_cvt_lt->get_outputs().at(0));
return true;
};
auto m = make_shared<pattern::Matcher>(
conv, callback, "CPUPostLayoutOptimizations.ConstructWeight_fusion");
this->add_matcher(m);
}
void ngraph::runtime::cpu::pass::CPUPostLayoutOptimizations::construct_slice_convertLayout_fusion()
{
auto param = std::make_shared<pattern::op::Label>(element::f32, Shape{1, 576, 17, 17});
auto slice = std::make_shared<ngraph::op::Slice>(
param, Coordinate{0, 0, 0, 0}, Coordinate{1, 192, 17, 17});
auto tvt = slice->get_outputs().at(0).get_tensor_ptr().get();
auto lt_desc = std::make_shared<runtime::cpu::LayoutDescriptor>(*tvt);
auto cvt_lt = std::make_shared<runtime::cpu::op::ConvertLayout>(slice, lt_desc);
pattern::graph_rewrite_callback callback = [param](pattern::Matcher& m) {
NGRAPH_DEBUG << "In a callback for construct_slice_converLayout against "
<< m.get_match_root()->get_name();
auto m_cvt_lt = m.get_match_root();
auto m_slice = m_cvt_lt->get_argument(0);
auto slice_ptr = static_cast<const ngraph::op::Slice*>(m_slice.get());
// do the fusion if slice has 1 user and uses mkldnn kernel.
if (!runtime::cpu::mkldnn_utils::use_mkldnn_kernel(slice_ptr) ||
m_slice->get_users().size() != 1)
{
return false;
}
for (auto u : m.get_pattern_map()[param]->get_users())
{
if (u != m_slice)
{
continue;
}
auto new_slice = std::make_shared<ngraph::op::Slice>(m_slice->get_argument(0),
slice_ptr->get_lower_bounds(),
slice_ptr->get_upper_bounds(),
slice_ptr->get_strides());
auto op_annotations = std::make_shared<ngraph::runtime::cpu::CPUOpAnnotations>();
op_annotations->set_mkldnn_op(true);
new_slice->set_op_annotations(op_annotations);
auto tv = new_slice->get_output_tensor_ptr(0);
auto layout = std::make_shared<ngraph::runtime::cpu::LayoutDescriptor>(*tv);
layout->set_mkldnn_md(mkldnn_utils::get_output_mkldnn_md(m_cvt_lt.get(), 0));
tv->set_tensor_layout(layout);
ngraph::replace_node(m_cvt_lt, new_slice);
}
return true;
};
auto m = make_shared<pattern::Matcher>(
cvt_lt, callback, "CPUPostLayoutOptimizations.ConstructSliceConvertLayoutFusion");
this->add_matcher(m);
}
// Reshape(transpose) + ConvertLayout
// MKLDNN has more efficient ConvertLayout kernels for named/non-padded formats
// If a transpose is converting a padded format into a generic padded/blocked format, it is better
// to ConvertLayout first and then do the transpose
// E.g.,
// Shape{10, 20, 30, 40} --(Reshape)--> Shape{10, 40, 20, 30} --(ConvertLayout)--> Shape{10, 40, 20, 30}
// is changed to
// Shape{10, 20, 30, 40} --(ConvertLayout)--> Shape{10, 20, 30, 40} --(Reshape)--> Shape{10, 40, 20, 30}
// The new ConvertLayout op computes the desired output layout (out_md) directly from
// input layout using a rotated out_md
void ngraph::runtime::cpu::pass::CPUPostLayoutOptimizations::
construct_reshape_convertLayout_fusion()
{
auto input = std::make_shared<pattern::op::Label>(element::f32, Shape{1, 1, 1, 1});
auto reshape =
std::make_shared<ngraph::op::Reshape>(input, AxisVector{0, 1, 2, 3}, Shape{1, 1, 1, 1});
auto lt_desc =
std::make_shared<runtime::cpu::LayoutDescriptor>(*reshape->get_output_tensor_ptr());
auto cvt_lt = std::make_shared<runtime::cpu::op::ConvertLayout>(reshape, lt_desc);
pattern::graph_rewrite_callback callback = [](pattern::Matcher& m) {
NGRAPH_DEBUG << "In a callback for construct_reshape_converLayout against "
<< m.get_match_root()->get_name();
auto cvt_lt_m = static_pointer_cast<runtime::cpu::op::ConvertLayout>(m.get_match_root());
auto reshape_m = static_pointer_cast<ngraph::op::Reshape>(cvt_lt_m->get_argument(0));
if (reshape_m->get_users().size() > 1)
{
NGRAPH_DEBUG << "ReshapeConvertLayout: Reshape has multiple users";
return false;
}
if (!reshape_m->get_is_transpose())
{
NGRAPH_DEBUG << "ReshapeConvertLayout: Reshape is not a transpose";
return false;
}
if (reshape_m->get_op_annotations()->get_in_place_oi_pairs().size() == 0)
{
NGRAPH_DEBUG << "ReshapeConvertLayout: Reshape is not pass-through";
return false;
}
auto reshape_m_md = runtime::cpu::mkldnn_utils::get_output_mkldnn_md(reshape_m.get(), 0);
if (reshape_m_md.data.format != mkldnn_blocked ||
!runtime::cpu::mkldnn_utils::is_mkldnn_padded_layout(
reshape_m_md, ngraph::get_default_order(reshape_m->get_shape())))
{
NGRAPH_DEBUG << "ReshapeConvertLayout: Reshape is not creating a blocked/padded layout";
return false;
}
// Rotate output layout to the pre-transposed order
auto out_md = runtime::cpu::mkldnn_utils::get_output_mkldnn_md(cvt_lt_m.get(), 0);
auto reshape_order = reshape_m->get_input_order();
// Get the inverse of the original transpose order
// E.g., [0, 3, 1, 2] -> [0, 2, 3, 1]
AxisVector inverse_order;
for (int i = 0; i < reshape_order.size(); i++)
{
inverse_order.push_back(std::find(reshape_order.begin(), reshape_order.end(), i) -
reshape_order.begin());
}
auto rotated_md = runtime::cpu::mkldnn_utils::rotate_blocked_md(out_md, inverse_order);
auto rotated_lt_desc = std::make_shared<runtime::cpu::LayoutDescriptor>(
*reshape_m->get_argument(0)->get_output_tensor_ptr());
rotated_lt_desc->set_mkldnn_md(rotated_md);
auto cvt_lt_n = std::make_shared<runtime::cpu::op::ConvertLayout>(
reshape_m->get_argument(0), 0, rotated_lt_desc);
cvt_lt_n->set_op_annotations(cvt_lt_m->get_op_annotations());
auto reshape_n =
std::make_shared<ngraph::op::Reshape>(cvt_lt_n, reshape_order, cvt_lt_m->get_shape());
auto reshape_n_layout = std::make_shared<ngraph::runtime::cpu::LayoutDescriptor>(
*reshape_n->get_output_tensor_ptr());
reshape_n_layout->set_mkldnn_md(out_md);
reshape_n->get_output_tensor_ptr()->set_tensor_layout(reshape_n_layout);
reshape_n->set_op_annotations(reshape_m->get_op_annotations());
ngraph::replace_node(cvt_lt_m, reshape_n);
NGRAPH_DEBUG << "ReshapeConvertLayout: Reordering reshape and convertlayout for faster "
"MKLDNN kernels";
return true;
};
auto m = make_shared<pattern::Matcher>(
cvt_lt, callback, "CPUPostLayoutOptimizations.ConstructReshapeConvertLayoutFusion");
this->add_matcher(m);
}
<commit_msg>fix crash in ReshapeConvertLayout (#2205)<commit_after>//*****************************************************************************
// Copyright 2017-2018 Intel Corporation
//
// 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 <algorithm>
#include <typeindex>
#include <unordered_set>
#include "ngraph/graph_util.hpp"
#include "ngraph/log.hpp"
#include "ngraph/op/constant.hpp"
#include "ngraph/op/convolution.hpp"
#include "ngraph/op/parameter.hpp"
#include "ngraph/op/reshape.hpp"
#include "ngraph/op/slice.hpp"
#include "ngraph/pass/graph_rewrite.hpp"
#include "ngraph/pass/manager.hpp"
#include "ngraph/pattern/matcher.hpp"
#include "ngraph/pattern/op/label.hpp"
#include "ngraph/pattern/op/skip.hpp"
#include "ngraph/runtime/cpu/cpu_layout_descriptor.hpp"
#include "ngraph/runtime/cpu/cpu_op_annotations.hpp"
#include "ngraph/runtime/cpu/mkldnn_utils.hpp"
#include "ngraph/runtime/cpu/op/convert_layout.hpp"
#include "ngraph/runtime/cpu/pass/cpu_post_layout_optimizations.hpp"
using namespace ngraph;
using namespace std;
#define TI(x) std::type_index(typeid(x))
void ngraph::runtime::cpu::pass::CPUPostLayoutOptimizations::construct_weight_fusion()
{
auto param = std::make_shared<pattern::op::Label>(element::f32, Shape{64});
auto reshape_conv =
std::make_shared<ngraph::op::Reshape>(param, AxisVector{0}, Shape{16, 4, 1, 1});
auto data_conv = std::make_shared<pattern::op::Label>(element::f32, Shape{16, 4, 7, 7});
auto tvt = reshape_conv->get_outputs().at(0).get_tensor_ptr().get();
auto lt_desc = std::make_shared<runtime::cpu::LayoutDescriptor>(*tvt);
auto cvt_lt_conv = std::make_shared<runtime::cpu::op::ConvertLayout>(reshape_conv, lt_desc);
auto conv = std::make_shared<ngraph::op::Convolution>(
data_conv, cvt_lt_conv, Strides{1, 1}, Strides{1, 1});
pattern::graph_rewrite_callback callback = [param](pattern::Matcher& m) {
NGRAPH_DEBUG << "In a callback for construct_weight against "
<< m.get_match_root()->get_name();
auto m_cvt_lt = m.get_match_root()->get_argument(1);
auto m_reshape_conv = m_cvt_lt->get_argument(0);
std::shared_ptr<Node> m_conv_bprop;
std::vector<std::type_index> user_pattern = {TI(ngraph::op::Reshape),
TI(runtime::cpu::op::ConvertLayout),
TI(ngraph::op::ConvolutionBackpropData)};
for (auto u : m.get_pattern_map()[param]->get_users())
{
if (u != m_reshape_conv)
{
size_t num_matches = 0;
auto ui = u;
for (; num_matches < user_pattern.size(); num_matches++)
{
const Node& user_ref = *ui;
if (TI(user_ref) != user_pattern.at(num_matches))
{
NGRAPH_DEBUG << "the type for user " << ui->get_name()
<< " doesn't match the type at " << num_matches;
break;
}
if (ui->get_users().size() != 1)
{
NGRAPH_DEBUG << u->get_name() << " has more than one user";
break;
}
ui = ui->get_users().at(0);
}
if (num_matches == user_pattern.size())
{
m_conv_bprop = u->get_users().at(0)->get_users().at(0);
NGRAPH_DEBUG << " m_conv_bprop is set to " << m_conv_bprop->get_name();
break;
}
}
}
if (!m_conv_bprop)
{
return false;
}
auto m_cvt_lt_bprop = m_conv_bprop->get_argument(0);
auto m_reshape_bprop = m_cvt_lt_bprop->get_argument(0);
NGRAPH_DEBUG << "Replacing input "
<< m_cvt_lt_bprop->get_inputs().at(0).get_output().get_node()->get_name()
<< " to " << m_cvt_lt_bprop->get_name() << " with "
<< m_cvt_lt->get_outputs().at(0).get_node()->get_name();
m_cvt_lt_bprop->get_inputs().at(0).replace_output(m_cvt_lt->get_outputs().at(0));
return true;
};
auto m = make_shared<pattern::Matcher>(
conv, callback, "CPUPostLayoutOptimizations.ConstructWeight_fusion");
this->add_matcher(m);
}
void ngraph::runtime::cpu::pass::CPUPostLayoutOptimizations::construct_slice_convertLayout_fusion()
{
auto param = std::make_shared<pattern::op::Label>(element::f32, Shape{1, 576, 17, 17});
auto slice = std::make_shared<ngraph::op::Slice>(
param, Coordinate{0, 0, 0, 0}, Coordinate{1, 192, 17, 17});
auto tvt = slice->get_outputs().at(0).get_tensor_ptr().get();
auto lt_desc = std::make_shared<runtime::cpu::LayoutDescriptor>(*tvt);
auto cvt_lt = std::make_shared<runtime::cpu::op::ConvertLayout>(slice, lt_desc);
pattern::graph_rewrite_callback callback = [param](pattern::Matcher& m) {
NGRAPH_DEBUG << "In a callback for construct_slice_converLayout against "
<< m.get_match_root()->get_name();
auto m_cvt_lt = m.get_match_root();
auto m_slice = m_cvt_lt->get_argument(0);
auto slice_ptr = static_cast<const ngraph::op::Slice*>(m_slice.get());
// do the fusion if slice has 1 user and uses mkldnn kernel.
if (!runtime::cpu::mkldnn_utils::use_mkldnn_kernel(slice_ptr) ||
m_slice->get_users().size() != 1)
{
return false;
}
for (auto u : m.get_pattern_map()[param]->get_users())
{
if (u != m_slice)
{
continue;
}
auto new_slice = std::make_shared<ngraph::op::Slice>(m_slice->get_argument(0),
slice_ptr->get_lower_bounds(),
slice_ptr->get_upper_bounds(),
slice_ptr->get_strides());
auto op_annotations = std::make_shared<ngraph::runtime::cpu::CPUOpAnnotations>();
op_annotations->set_mkldnn_op(true);
new_slice->set_op_annotations(op_annotations);
auto tv = new_slice->get_output_tensor_ptr(0);
auto layout = std::make_shared<ngraph::runtime::cpu::LayoutDescriptor>(*tv);
layout->set_mkldnn_md(mkldnn_utils::get_output_mkldnn_md(m_cvt_lt.get(), 0));
tv->set_tensor_layout(layout);
ngraph::replace_node(m_cvt_lt, new_slice);
}
return true;
};
auto m = make_shared<pattern::Matcher>(
cvt_lt, callback, "CPUPostLayoutOptimizations.ConstructSliceConvertLayoutFusion");
this->add_matcher(m);
}
// Reshape(transpose) + ConvertLayout
// MKLDNN has more efficient ConvertLayout kernels for named/non-padded formats
// If a transpose is converting a padded format into a generic padded/blocked format, it is better
// to ConvertLayout first and then do the transpose
// E.g.,
// Shape{10, 20, 30, 40} --(Reshape)--> Shape{10, 40, 20, 30} --(ConvertLayout)--> Shape{10, 40, 20, 30}
// is changed to
// Shape{10, 20, 30, 40} --(ConvertLayout)--> Shape{10, 20, 30, 40} --(Reshape)--> Shape{10, 40, 20, 30}
// The new ConvertLayout op computes the desired output layout (out_md) directly from
// input layout using a rotated out_md
void ngraph::runtime::cpu::pass::CPUPostLayoutOptimizations::
construct_reshape_convertLayout_fusion()
{
auto input = std::make_shared<pattern::op::Label>(element::f32, Shape{1, 1, 1, 1});
auto reshape =
std::make_shared<ngraph::op::Reshape>(input, AxisVector{0, 1, 2, 3}, Shape{1, 1, 1, 1});
auto lt_desc =
std::make_shared<runtime::cpu::LayoutDescriptor>(*reshape->get_output_tensor_ptr());
auto cvt_lt = std::make_shared<runtime::cpu::op::ConvertLayout>(reshape, lt_desc);
pattern::graph_rewrite_callback callback = [](pattern::Matcher& m) {
NGRAPH_DEBUG << "In a callback for construct_reshape_converLayout against "
<< m.get_match_root()->get_name();
auto cvt_lt_m = static_pointer_cast<runtime::cpu::op::ConvertLayout>(m.get_match_root());
auto reshape_m = static_pointer_cast<ngraph::op::Reshape>(cvt_lt_m->get_argument(0));
if (reshape_m->get_users().size() > 1)
{
NGRAPH_DEBUG << "ReshapeConvertLayout: Reshape has multiple users";
return false;
}
if (!reshape_m->get_is_transpose())
{
NGRAPH_DEBUG << "ReshapeConvertLayout: Reshape is not a transpose";
return false;
}
auto annotation = reshape_m->get_op_annotations();
if (!annotation || annotation->get_in_place_oi_pairs().size() == 0)
{
NGRAPH_DEBUG << "ReshapeConvertLayout: Reshape is not pass-through";
return false;
}
auto reshape_m_md = runtime::cpu::mkldnn_utils::get_output_mkldnn_md(reshape_m.get(), 0);
if (reshape_m_md.data.format != mkldnn_blocked ||
!runtime::cpu::mkldnn_utils::is_mkldnn_padded_layout(
reshape_m_md, ngraph::get_default_order(reshape_m->get_shape())))
{
NGRAPH_DEBUG << "ReshapeConvertLayout: Reshape is not creating a blocked/padded layout";
return false;
}
// Rotate output layout to the pre-transposed order
auto out_md = runtime::cpu::mkldnn_utils::get_output_mkldnn_md(cvt_lt_m.get(), 0);
auto reshape_order = reshape_m->get_input_order();
// Get the inverse of the original transpose order
// E.g., [0, 3, 1, 2] -> [0, 2, 3, 1]
AxisVector inverse_order;
for (int i = 0; i < reshape_order.size(); i++)
{
inverse_order.push_back(std::find(reshape_order.begin(), reshape_order.end(), i) -
reshape_order.begin());
}
auto rotated_md = runtime::cpu::mkldnn_utils::rotate_blocked_md(out_md, inverse_order);
auto rotated_lt_desc = std::make_shared<runtime::cpu::LayoutDescriptor>(
*reshape_m->get_argument(0)->get_output_tensor_ptr());
rotated_lt_desc->set_mkldnn_md(rotated_md);
auto cvt_lt_n = std::make_shared<runtime::cpu::op::ConvertLayout>(
reshape_m->get_argument(0), 0, rotated_lt_desc);
cvt_lt_n->set_op_annotations(cvt_lt_m->get_op_annotations());
auto reshape_n =
std::make_shared<ngraph::op::Reshape>(cvt_lt_n, reshape_order, cvt_lt_m->get_shape());
auto reshape_n_layout = std::make_shared<ngraph::runtime::cpu::LayoutDescriptor>(
*reshape_n->get_output_tensor_ptr());
reshape_n_layout->set_mkldnn_md(out_md);
reshape_n->get_output_tensor_ptr()->set_tensor_layout(reshape_n_layout);
reshape_n->set_op_annotations(reshape_m->get_op_annotations());
ngraph::replace_node(cvt_lt_m, reshape_n);
NGRAPH_DEBUG << "ReshapeConvertLayout: Reordering reshape and convertlayout for faster "
"MKLDNN kernels";
return true;
};
auto m = make_shared<pattern::Matcher>(
cvt_lt, callback, "CPUPostLayoutOptimizations.ConstructReshapeConvertLayoutFusion");
this->add_matcher(m);
}
<|endoftext|>
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.