Pike-devel August 2013

pike-devel@lists.lysator.liu.se

4 participants
10 discussions

Re: Playing music using pike and SDL.
by Martin Nilsson (lvl 60) ＠ Pike (-) developers forum 13 Mar '26

13 Mar '26

Were you not able to get any C code to play through SDL either? Does your SDL library have a mixer compiled in it (I think it is optional)?

5 4

managing comport settings in linux
by Henrik Grubbstr�m (Lysator) ＠ Pike (-) developers forum 13 Mar '26

13 Mar '26

Not a good idea; the design philosophy of Pike is that Pike-level code should never be able to cause memory corruption at C-level. With ioctls there's no way to know what data a specific ioctl wants without reading the documentation for that specific ioctl for that specific OS. ioctls and fcntls are a way for device handlers to hook in APIs that aren't standard across all filedescriptors. / Henrik Grubbström (Lysator) Previous text: >2004-08-17 13:32: >Subject: managing comport settings in linux >-------------------------------------------------------------------- >What would be nice, is a way to define ioctl methods in >Pike. Perhaps something like > >object i = Stdio.IOCTL(4242 /* request_id */ ); >i->add_int_parameter(); >i->add_string_parameter(); >i->set_return_type(STRING); > >string ret = i(fd, 1, "somestring"); > > >That ought to be possible, or..? > > / Marcus Agehall (PacketFront) >

3 2

full MySQL 4.x support. or pike roadmap
by thomas.gusenleitner＠com-bet.com ＠ Pike developers forum 01 Mar '26

01 Mar '26

HI to all! mysql 4.x support works only with a mysql CFLAGS=-DUSE_OLD_FUNCTIONS is this correct ? are there plans to make a full 4.x support ? bye, thomas

4 4

debugger opcodes
by Bill Welliver 31 Oct '14

31 Oct '14

I noticed that folks have been working on code generation lately. Any chance it might be possible to implement some of the opcodes required to get debugging working (step, break, etc)? I seem to recall someone indicating it wasn't a terribly difficult task, but it's clearly beyond my understanding of the problem. Bill

4 6

Sql.pgsql behavior in case of errors
by aldem-pikedev＠aldem.net 21 Aug '14

21 Aug '14

Hi everyone, I am preparing to use Postgres in my app, found the following strange behavior: ---snip--- Sql.Sql db = Sql.Sql("pgsql://localhost", "test", "test", "test"); db->query("BEGIN"); db->query("INSERT INTO requests (SvTrId) VALUES ('lala')"); catch(db->query("INSERT INTO requests (SvTrId) VALUES ('lala')")); db->query("INSERT INTO requests (SvTrId) VALUES ('juju')"); db->query("ROLLBACK"); ---snip--- Database is opened, row with 'lala' is inserted, second query (obviously) fails as SvTrId is the primary key, but row with 'juju' is inserted *and* appears in the database - i.e. the transaction is *committed*! Studying source code show, that once error is encounter, session is reset, i.e. running transaction is rolled back, everything is closed, temporary tables are deleted and session variables are reset as well, and after that, the next statement(s) will be committed immediately, as there is no active transaction. In my opinion, this is not exactly correct behavior when statement fails, as session still may be needed (especially temporary tables, open cursors etc). Im some cases, this is perfectly normal when SQL statement fails, especially in SERIALIZED transaction isolation level, and it would be more practical to leave the decision as of what to do to the application. Yes, this is true that it is impossible to continue executing statements in failed transaction, but temporary tables etc. may still be needed. Also, silent reconnection is not a good idea too - when there are many transactional statements are executed - it would be nice to have an option to modify this behavior. Best regards, /Alexander

5 6

bug in Protocols.XMLRPC
by Martin Bähr 21 Aug '13

21 Aug '13

Protocols.XMLRPC contains the following: protected mixed decode(string xml_input, string dtd_input, int|void boolean) { // We cannot insert 0 integers directly into the parse tree, so // we'll use magic_zero as a placeholder and destruct it afterwards. object magic_zero = class {}(); ... case "int": return (int)(data*"") || magic_zero; ... destruct(magic_zero); // Apply Magic! Replace magic_zero with real 0:s. unfortunately this doesn't quite work: Pike v7.9 release 5 running Hilfe v3.5 (Incremental Pike Frontend) > object magic_zero = class {}(); > mapping foo = ([ "foo":magic_zero ]); > destruct(magic_zero); Compiler Warning: 1: Returning a void expression. Converted to zero. (1) Result: 0 > foreach(foo; string key; mixed val){ write("%O\n", intp(val)); } 0 Ok. in other words, in this situation, the magic zero is not recognized as an int. this causes for example xml-rpc-call in modules/tags/additional_rxml.pike to fail: format_response: else if (intp (val)) buf->add ("<int>", (string) val, "</int>\n"); ... else { // Gotta be a Calendar object. // Format this to be compatible with the iso-time attribute // to the <date> tag. buf->add ("<iso-date-time>", val->format_time(), "</iso-date-time>\n"); } failing with: Internal server error: Lookup in destructed object.

2 1

String clearing
by Martin Nilsson (Opera Mini - AFK!) ＠ Pike (-) developers forum 16 Aug '13

16 Aug '13

Per and I discussed the recent string clearing changes and think that most of them should be rolled back. Having clear on exit set on all random strings, random seeds and all decrypted data is often not needed. Having the flag propagade through string operations is probably also not desired in the general case.

7 13

Re: String clearing
by Per Hedbor () ＠ Pike (-) developers forum 16 Aug '13

16 Aug '13

However, your test is more likely to benchmark the function call, not the clearing of the string.

1 0

Benchmark output
by Per Hedbor () ＠ Pike (-) developers forum 16 Aug '13

16 Aug '13

Is anyone seriously attached to the current pike -x benchmark format/output? I have done some work to a: Only output relevant information b: Actually output relevant information. Additionally I have added a json output mode, and a way to run a benchmark with an old result as the baseline (and then report differences, useful when you are trying to optimize something). What is left of the output is somewhat sparse, though. The perhaps most important part that is missing is the memory usage, but it was rather .. random before, since it counted the memory use _after_ the benchmark was run. # leopard$ make benchmark BENCHARGS="-c $PWD/compare" (...) ----------------------------------------------------------------- Test Result Change ----------------------------------------------------------------- Ackermann . . . . . . . . . . . . . . . . . . . . . 38M/s -0.1% Append array . . . . . . . . . . . . . . . . . . . 23M/s -0.1% Append mapping (+) . . . . . . . . . . . . . . . 4902k/s 0.2% Append mapping (|) . . . . . . . . . . . . . . . 5571k/s 6.3% Append multiset . . . . . . . . . . . . . . . . . . 105k/s -3.3% Array & String Juggling . . . . . . . . . . . . . . 110k/s -4.8% Array Copy . . . . . . . . . . . . . . . . . . . . 41M/s 2.0% Array Zero . . . . . . . . . . . . . . . . . . . . 285k/s 0.0% Binary Trees . . . . . . . . . . . . . . . . . . . 994k/s 3.3% Clone null-object . . . . . . . . . . . . . . . . . 11M/s 1.1% Clone object . . . . . . . . . . . . . . . . . . 5627k/s -9.4% Compile . . . . . . . . . . . . . . . . . . . 97k lines/s -0.1% Compile & Exec . . . . . . . . . . . . . . . 92k lines/s -0.3% Foreach (arr,global) . . . . . . . . . . . . . . . 71M/s -2.6% Foreach (arr,local) . . . . . . . . . . . . . . . . 174M/s 1.4% Foreach (arr;local;global) . . . . . . . . . . . . 37M/s -1.1% Foreach (arr;local;local) . . . . . . . . . . . . . 52M/s 1.0% GC . . . . . . . . . . . . . . . . . . . . . . . . 1197/s 2.2% Insert in array . . . . . . . . . . . . . . . . . . 48M/s 0.4% Insert in mapping . . . . . . . . . . . . . . . . . 10M/s -2.2% Insert in multiset . . . . . . . . . . . . . . . 3868k/s 2.4% Loops Nested (global) . . . . . . . . . . . . . . . 31M/s 2.9% Loops Nested (local) . . . . . . . . . . . . . . . 181M/s -0.4% Loops Nested (local,var) . . . . . . . . . . . . . 161M/s -2.0% Loops Recursed . . . . . . . . . . . . . . . . . . 18M/s 1.1% Matrix multiplication (100x100) . . . . . . . . 2.23 GF/s 1.9% Read binary INT128 . . . . . . . . . . . . . . . . 197k/s -0.9% Read binary INT16 . . . . . . . . . . . . . . . . . 19M/s 20.1% Read binary INT32 . . . . . . . . . . . . . . . . . 17M/s -2.0% Replace (parallel) . . . . . . . . . . . . . . . . 9831/s 5.0% Replace (serial) . . . . . . . . . . . . . . . . . 13k/s -2.6% Sort equal integers . . . . . . . . . . . . . . . . 59M/s -0.9% Sort ordered integers . . . . . . . . . . . . . . . 88M/s -0.1% Sort unordered integers . . . . . . . . . . . . . . 14M/s 3.9% Sort unordered objects . . . . . . . . . . . . . . 569k/s -2.2% String Creation . . . . . . . . . . . . . . . . . 3053k/s -8.1% String Creation (existing) . . . . . . . . . . . . 10M/s 1.9% String Creation (wide) . . . . . . . . . . . . . . 678k/s 1.9% Tag removal u. Parser.HTML . . . . . . . . . . . 4929k/s 3.5% Tag removal u. Regexp.PCRE . . . . . . . . . . . 2124k/s 1.4% Tag removal u. array_sscanf . . . . . . . . . . . 6150k/s -0.2% Tag removal u. division . . . . . . . . . . . . . 3113k/s -1.5% Tag removal u. search . . . . . . . . . . . . . . 5218k/s -2.9% Tag removal using a loop . . . . . . . . . . . . . 895k/s -2.3% Tag removal using sscanf . . . . . . . . . . . . . 718k/s 2.7% Upper/lower case shift 0 . . . . . . . . . . . . . 137M/s -0.3% Upper/lower case shift 1 . . . . . . . . . . . . . 60M/s -1.4% call_out handling . . . . . . . . . . . . . . . . . 177k/s 0.2% call_out handling (with id) . . . . . . . . . . . 4560k/s -2.4% ----------------------------------------------------------------- 0.3% -----------------------------------------------------------------

5 6

Calender question.
by Martin Nilsson (Opera Mini - AFK!) ＠ Pike (-) developers forum 14 Aug '13

14 Aug '13

If you create a Day and call next() it will not have all fields calculated. It looks intentional, but is it useful? Pike v7.9 release 11 running Hilfe v3.5 (Incremental Pike Frontend) > object d = Calendar.ISO.Day(2013,8,14); > object e = d->next(); > e->md; (1) Result: -1000 > e->m; (2) Result: -1000 > e->make_month(); (3) Result: 0 > e->md; (4) Result: 15 > e->m; (5) Result: 8 or to put it in more surprising terms > object d = Calendar.ISO.Day(2013,8,14)->next(); > d->m; (1) Result: -1000 > d; // Forces _sprintf to call make_month() (2) Result: Day(Thu 15 Aug 2013) > d->m; (3) Result: 8

2 3

2026

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

Pike-devel August 2013