- Boost-users - lists.preview.boost.org

boost ptr_map memory access violation (stack/heap problem)
by roland kapl 06 Jan '21

06 Jan '21

Dear Boost-Experts! I'm trying to use a ptr_map along with boost property trees. I need to store pointers to specific parts of a built up property tree to access these parts later on for easy insertion there. However, when the ptr_map is cleared/destroyed, I get memory access violations/stack overflow messages for my test cases. The ptr_map (typedef treeMap) is globally defined within a std::map to a ptr_map to property trees as follows (I know this isn't good practice, but passing it as a reference didn't make a difference, so I left it that way): namespace pt = boost::property_tree; typedef boost::ptr_map<std::string, pt::ptree> treeMap; std::map<std::string, treeMap> parentTableTrees; The property tree is defined as follows in this function (this builds a property tree from tabular data in the passed table variable "data" using definitions form table variable "control"): std::string TreeizeRelD::writeTreeAndCreateXML(const std::vector<std::vector<std::string>>& control, const std::vector<std::vector<std::vector<std::string>>>& data, int *result) { std::string resultString; pt::ptree &propTree = pt::ptree(); std::string returnStr = TreeizeRelD::writeTree(control, data, propTree); *result = 0; if (returnStr != "") { *result = 1; return returnStr; } returnStr = TreeizeRelD::createXML(propTree, resultString); if (returnStr != "") { *result = 1; return returnStr; } // here the memory access violation occurs: parentTableTrees.clear(); return resultString; } In function writeTree the propTree (being passed by ref as ptTree) is populated in following three lines: std::string TreeizeRelD::writeTree(const std::vector<std::vector<std::string>> &control, const std::vector<std::vector<std::vector<std::string>>> &data, pt::ptree & ptTree) ... // FIRST LINE parentTableTrees[subRootNode].insert(keyPair.first, &ptTree.add_child(subRootNode, keyPair.second)); ... // iterate through all parent key record collections referred to by subtables parentNode (rootnode + optional subnode) for (treeMap::value_type && parentKeysPair : parentTableTrees.find(lookupNode)->second) { // iterate through all records (ptrees) in key collection for (pt::ptree::iterator parentRecPair = parentKeysPair.second->begin(); parentRecPair != parentKeysPair.second->end(); ++parentRecPair) { pt::ptree &parentRecPtree = parentRecPair->second; ... // SECOND LINE // parentRecPair is an iterator variable from the ptr_map: parentTableTrees[subRootNode].insert(rowsFK, &parentRecPair->second.get_child(subnodeFRec)); ... // THIRD LINE // parentRecPtree is the referenced property tree itself: parentTableTrees[subRootNode].insert(rowsFK, &parentRecPtree.put_child(subnodeOfParent, foreignRecordset)); I already have the suspicion that the memory access violation comes from ptr_map taking ownership of the pointers (references) passed to it in the above three lines and that these are all created on the stack and not the heap, where ptr_map expects them to be. When the ptr_map is finally destroyed, it tries to access memory, that's impossible to access... But I didn't manage to successfully create heap objects that also do NOT copy the property tree objects, which is important as I only need references to the property trees. Any help is appreciated. -regards, Roland

1 0

[statechart] Event dispatching for orthogonal states
by B A 03 Jan '21

03 Jan '21

Hello, I have following code : ///////////////////////////////////////////// #include <iostream> #include <boost/mpl/list.hpp> #include <boost/statechart/simple_state.hpp> #include <boost/statechart/state_machine.hpp> #include <boost/statechart/event.hpp> #include <boost/statechart/transition.hpp> #include <boost/statechart/custom_reaction.hpp> namespace sc = boost::statechart; struct Event1 : sc::event<Event1> {}; struct Event11 : sc::event<Event11> {}; struct Meta; struct Machine : sc::state_machine<Machine, Meta> {}; struct Meta2 : sc::simple_state<Meta2, Machine> { Meta2() { std::cout << "Meta2\n"; } }; struct Inner1; struct Inner2; struct Meta : sc::simple_state<Meta, Machine, boost::mpl::list<Inner1, Inner2>> { Meta() { std::cout << "Meta\n"; } typedef sc::transition<Event1, Meta2> reactions; }; struct Inner11 : sc::simple_state<Inner11, Meta::orthogonal<0>> { Inner11() { std::cout << "Inner11\n"; } typedef sc::custom_reaction<Event1> reactions; sc::result react(const Event1& ev) { std::cout << "Inner1 reaction\n"; return forward_event(); } }; struct Inner1 : sc::simple_state<Inner1, Meta::orthogonal<0>> { Inner1() { std::cout << "Inner1\n"; } typedef sc::transition<Event11, Inner11> reactions; }; struct Inner2 : sc::simple_state<Inner2, Meta::orthogonal<1>> { Inner2() { std::cout << "Inner2\n"; } }; int main() { Machine m; m.initiate(); m.process_event(Event11()); m.process_event(Event1()); return 0; } //////////////////// That gives me output: Meta Inner1 Inner2 Inner11 Meta2 The goal was to get Event1 processed first in Inner11 state and then forward it to outer state Meta for further processing but looks like event dispatching does not work as expected. I can make it work in that way only if I put Event1 handling into Inner1 state. I'm aware of limitation (https://www.boost.org/doc/libs/1_61_0/libs/statechart/doc/rationale.html#Li… #Event dispatch to orthogonal regions) but as far I understand that considers that case when both Inner1 and Inner11 have same event processing, please correct me if I'm wrong. Is current dispatching work correctly for my code? Regards, Andrew

1 0

BOOST_DLL_ALIAS - non Latin AliasName
by Nicholas Yue 02 Jan '21

02 Jan '21

Hi, The examples I have seen so far appears to use ASCII name for AliasName I am considering providing AliasName in languages like Chinese, Korean, Japanese, Thai, Tamil, does Boost DLL allow for wstring/UNICODE as AliasName ? Cheers -- Nicholas Yue Graphics - Arnold, Alembic, RenderMan, OpenGL, HDF5 Custom Dev - C++ porting, OSX, Linux, Windows http://au.linkedin.com/in/nicholasyue https://vimeo.com/channels/naiadtools

1 0

shutdown( ) blocks forever
by Fariya F 30 Dec '20

30 Dec '20

I have a server that accepts ssl connections on port 443. I am using the boost libraries for the server implementation. Below is the code snippet: ssl_socket socket_; { // Open the acceptor with the option to reuse the address (i.e. SO_REUSEADDR). boost::asio::ip::tcp::resolver resolver(io_service_); boost::asio::ip::tcp::resolver::query query(address, port); boost::asio::ip::tcp::endpoint endpoint = *resolver.resolve(query); acceptor_.open(endpoint.protocol()); acceptor_.set_option(boost::asio::ip::tcp::acceptor::reuse_address(true)); acceptor_.bind(endpoint); acceptor_.listen(1000); start_accept(); } void server::start_accept() { new_connection_.reset( new connection(io_service_, connection_manager_, request_handler_, context_)); acceptor_.async_accept(new_connection_->socket(), boost::bind(&server::handle_accept, this, boost::asio::placeholders::error)); } void server::handle_accept(const boost::system::error_code& e) { // Check whether the server was stopped by a signal before this completion // handler had a chance to run. if (!acceptor_.is_open()) { return; } else { start(); } start_accept(); } void server::start() { socket_.async_handshake(boost::asio::ssl::stream_base::server, boost::bind(&connection::handle_handshake, this, boost::asio::placeholders::error)); if (boost::asio::placeholders::error) { // printf("Error is there. Check it\n"); } } void connection::handle_handshake(const boost::system::error_code& error) { if (!error) { DEBUG("async read some"); socket_.async_read_some(boost::asio::buffer(buffer_), boost::bind(&connection::handle_read, shared_from_this(), boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred)); } else { std::cout << "Error number: " << error.value(); std::cout << " Error message: " << error.message(); std::cout << " Error category: " << error.category().name() << std::endl; delete this; } } When I initiate multiple clients to connect to the server, most of the time the connection succeeds i.e TCP handshake followed by SSL handshake succeeds and I am able to do data transfer. However, there are times when the TCP handshake succeeds (as seen by wireshark) but the SSL request isn't responded to by my server. I am able to see the SSL handshake request coming from the client onto my server, but the server doesn't respond, neither is my handle_accept() function gets called. When I check the output of netstat, I see a lot of data pending in the Recv-Q. Below is the output of netstat -atn command on the server during one such scenario: Active Internet connections (servers and established) Proto Recv-Q Send-Q Local Address Foreign Address State tcp 15 0 0.0.0.0:443 0.0.0.0:* LISTEN tcp 0 213 10.110.112.1:443 10.110.112.2:52363 ESTABLISHED tcp 180 0 10.110.112.1:443 10.110.112.2:52624 ESTABLISHED tcp 180 0 10.110.112.1:443 10.110.112.2:52581 ESTABLISHED tcp 180 0 10.110.112.1:443 10.110.112.2:52646 ESTABLISHED tcp 180 0 10.110.112.1:443 10.110.112.2:52749 ESTABLISHED tcp 180 0 10.110.112.1:443 10.110.112.2:52824 ESTABLISHED tcp 180 0 10.110.112.1:443 10.110.112.2:52805 ESTABLISHED tcp 180 0 10.110.112.1:443 10.110.112.2:52645 ESTABLISHED tcp 0 471 10.110.112.1:443 10.110.112.2:52362 ESTABLISHED tcp 1 0 10.110.112.1:443 10.110.112.3:39129 CLOSE_WAIT tcp 183 0 10.110.112.1:443 10.110.112.3:39130 CLOSE_WAIT tcp 180 0 10.110.112.1:443 10.110.112.2:52595 ESTABLISHED tcp 183 0 10.110.112.1:443 10.110.112.3:39131 CLOSE_WAIT Upon further debugging, I see that the call to ssl socket member function shutdown() blocks sometimes forever and sometimes for at least 5 - 10 minutes due to which no further data is taken in and the recv-q indicates pending bytes. This is how my write handler is. Any help on where I am going wrong would be greatly appreciated: void connection::handle_write(const boost::system::error_code& e) { if (!e) { boost::system::error_code ec; socket_.shutdown(ec); //Code blocks here indefinitely } } Any reasons why the socket_.shutdown( ) blocks. How could I specify a timeout such that the shutdown( ) returns back after some time? Any other way of handling this? ( I know there is async_shutdown( ) but I prefer using shutdown( ) blocking handler) Any help would be greatly appreciated. Regards, Fariya

3 3

[json] Using boost.json with boost.beast
by Sean Farrow 22 Dec '20

22 Dec '20

Hi, Are there any samples of using boost.json to deserialize boost.beast responses? Thanks, Sean.

2 2

[Accumulators] How to extract P90, P99?
by Dominique Devienne 21 Dec '20

21 Dec '20

I'm already using the accumulator below to keep track of request processing times of a server. using ProcAcc = acc::accumulator_set< double, acc::stats< acc::tag::min, acc::tag::max, acc::tag::mean, acc::tag::median, acc::tag::sum > >; But now I'm interested in also extracting the P90 and P99 values, to get insight in how much of an outlier the max could be. AFAIK, the median is the P50, but it's not readily obvious to me what tag to use for the P90 or P(N) in general. Could someone help please? Thanks, --DD PS: Does accumulator allow to keep the top(N) values as well? How?

2 2

boost::hash_value not picking up std::hash specialisations
by Marc Mutz 21 Dec '20

21 Dec '20

Hi, I'm trying to move away from Qt containers in my source code, and Qt 5.15 makes that a bit easier by providing specialisations for some its types. Now I have a struct S { QLatin1String a, b; } that I'd like to hash. I can use boost::hash_combine to implement std::hash<S>, but S is actually a nested type, and with qHash(), I could just write an overload as a hidden friend, and I figured I could do the same with hash_value() (at the cost of having to specify boost::hash<S> as a unordered_map template argument). But hash_combine seems to insist on hash_value which in turn doesn't look at std::hash at all: size_t seed = 0; boost::hash_combine(seed, key.a); // ERROR: no hash_value overload for QLatin1String boost::hash_combine(seed, key.b); // Ditto return seed; expected: calls std::hash<QLatin1String>{}::op() (if it exists). It's trivial to write hash_value(QLatin1String), of course, but what's the general strategy here? Shouldn't hash_combine() look for std::hash<T> first? And, speaking as a Qt developer: do I really need to provide qHash(), std::hash<T> _and_ hash_value(T) for every hashable T?! Thanks, Marc

1 1

Weight as a function of distance at source
by Amit Prakash Ambasta 18 Dec '20

18 Dec '20

Hi, Looking at BGL implementations, weight, compare and combine are used in examine edge(e) as compare(combine(old_distance, get(weight, e)), old_distance) Additionally, old_distance = m_zero to check for negative weights etc. In my implementation, edges have a bundled property struct EdgeProp { Distance weight(Distance start) { ... } }; that returns the cumulative weight on iterating over the edge given a start distance. To use this, I should be able to pass a combine function of the form []<typename BinaryFunction>(DistanceType d, BinaryFunction f) { return f(d); } However, this approach falls apart. I've tried putting together a formal example here, but not sure why this fails. (My actual use case is where weights represent nodes in a transport system and for a person arriving at a vertex at some time Tx, there is a variable weight of using the next outbound transport = waiting_time + travel_time, where waiting_time is a function of Tx #include <boost/graph/adjacency_list.hpp> #include <boost/graph/dijkstra_shortest_paths.hpp> #include <limits> struct VProp {}; struct EProp { int multiplier; int weight(int src_distance) { return src_distance * multiplier; } }; typedef boost:: adjacency_list<boost::vecS, boost::vecS, boost::directedS, VProp, EProp> Graph; template<class G> using Vertex = boost::graph_traits<G>::vertex_descriptor; template<class G> using Edge = boost::graph_traits<G>::edge_descriptor; int main() { Graph graph; auto source = boost::add_vertex(VProp{}, graph); auto target = boost::add_vertex(VProp{}, graph); boost::add_edge(source, target, EProp{ 3 }, graph); auto index_map = get(boost::vertex_index, graph); std::vector<Vertex<Graph>> predecessors(boost::num_vertices(graph)); auto predecessor_map = boost::make_iterator_property_map(predecessors.begin(), index_map); std::vector<int> distances(boost::num_vertices(graph)); auto distance_map = boost::make_iterator_property_map(distances.begin(), index_map); auto compare = [](int lhs, int rhs) -> bool { return lhs < rhs; }; auto combine = []<typename BinaryFunction>(int dst, BinaryFunction f) -> int { return f(dst); }; boost::dijkstra_shortest_paths( graph, source, predecessor_map, distance_map, boost::weight_map(boost::get(&EProp::weight, graph)), index_map, compare, combine, std::numeric_limits<int>::min(), std::numeric_limits<int>::max(), boost::default_dijkstra_visitor()); }

2 3

boost::regex: regex meta data or AST for regex?
by Frank Bergemann 16 Dec '20

16 Dec '20

in concrete: Is it possible to not only get the #no of groups (sub-expressions) via basic_regex::mark_count(), but also their position (begin() / end() iterators) in the given regex string (c'tor argument)? more general: Can an AST be created for a the given regex string (c'tor argument)? E.g with boost::spirit?

1 0

how to get progress indicator during phrase_parse() of boost::spirit::x3?
by Lane 15 Dec '20

15 Dec '20

I am using boost::spirit:x3, shown below. I use it to import/parse some very large files and am trying to find a way to get some sort of progress from it so that I can use for a progress bar in app, but so far I've been unable to see a way. namespace parser { namespace x3 = boost::spirit::x3; using namespace x3; auto const string = lexeme[+graph]; auto const point = rule<struct _p, ast::point> {"point"} = int_ >> double_ >> double_ >> double_; auto const element = rule<struct _e, ast::element> {"element"} = int_ >> string >> int_ >> int_ >> int_ >> eol >> *(int_ >> int_ >> int_); auto lines = [](auto p) { return *(p >> eol); }; auto const input = lines(point) >> lines(element); } And I import a file like so. { namespace x3 = boost::spirit::x3; mapped_file_source map(filePath); std::istringstream iss(map.data()); map.close(); boost::spirit::istream_iterator iter(iss >> std::noskipws), eof; bool ok = phrase_parse(iter, eof, smf::parser::input, x3::blank, types); if (iter != eof) { // ... } } Would anyone have thoughts on how to get some sort of indicator during the parsing?

1 0