Pike-devel

pike-devel@lists.lysator.liu.se

1 participants
3041 discussions

Segmentation fault pike 8.1
by Stephen R. van den Berg 05 Nov '19

05 Nov '19

This is in a heavy multithreaded application: Thread 1475 "pike" received signal SIGSEGV, Segmentation fault. [Switching to Thread 0x7ffff574c700 (LWP 14689)] ba_alloc (a=a@entry=0x55555575bf20 <object_allocator>) at /var/src/roxen/81pike/src/block_allocator.c:267 267 p->h.used++; (gdb) l 262 263 ptr = p->h.first; 264 PIKE_MEMPOOL_ALLOC(a, ptr, a->l.block_size); 265 PIKE_MEM_RW_RANGE(ptr, sizeof(struct ba_block_header)); 266 267 p->h.used++; 268 269 #ifdef PIKE_DEBUG 270 ba_check_ptr(a, a->alloc, ptr, NULL, __LINE__); 271 #endif (gdb) p p $1 = (struct ba_page *) 0x555555d298c0 (gdb) p *p $2 = {h = {first = 0x555555d35ae000, used = 681, flags = 0}} (gdb) p ptr $3 = (struct ba_block_header *) 0x555555d35ae000 (gdb) p *ptr Cannot access memory at address 0x555555d35ae000 (gdb) where #0 ba_alloc (a=a@entry=0x55555575bf20 <object_allocator>) at /var/src/roxen/81pike/src/block_allocator.c:267 #1 0x000055555560156f in alloc_object () at /var/src/roxen/81pike/src/object.c:135 #2 low_clone (p=0x5555557d2f70) at /var/src/roxen/81pike/src/object.c:135 #3 0x0000555555601ad2 in debug_clone_object (p=<optimized out>, args=args@entry=0) at /var/src/roxen/81pike/src/object.c:408 #4 0x000055555564b55c in f_mutex_trylock (args=1) at /var/src/roxen/81pike/src/threads.c:2333 #5 0x0000555555585a9c in low_mega_apply (type=<optimized out>, type@entry=APPLY_STACK, args=1, arg1=<optimized out>, arg1@entry=0x0, arg2=arg2@entry=0x0) at /var/src/roxen/81pike/src/apply_low.h:225 #6 0x000055555558624e in jump_opcode_F_CALL_FUNCTION () at /var/src/roxen/81pike/src/interpret_functions.h:2422 #7 0x00007ffff6a4c55c in ?? () #8 0x00007ffff574bd41 in ?? () #9 0x0000000000000001 in ?? () #10 0x00007fffffffe03e in ?? () #11 0x00007fffffffe03f in ?? () #12 0x00007ffff574c700 in ?? () #13 0x00005555559af8e0 in ?? () #14 0x0000000000000000 in ?? () Any ideas? I can still explore more structures, have the session still open. -- Stephen.

2 9

Re: debugger, status and suggestions sought
by Mateusz Krawczuk 03 Nov '19

03 Nov '19

I think having both LSP <https://microsoft.github.io/language-server-protocol/> and DAP <https://microsoft.github.io/debug-adapter-protocol/> implementations for Pike would be awsome, but I feel that this discussion is getting further away from it's main point. We've been talking about LSP for a little during the Conference. There is a huge interest in it and I think we should move the LSP discussion to another mailing thread to avoid mixing contexts. Having a Pike debug adapter would also be great, but since DAP is used for estabilishing communication between IDE and the debugger, we can't move on with it until we actually have a debugger. >From what I understand the greatest challenge now would be to reach the local variables. I've heard that long time ago, the language got some optimizations that makes retrieving local variable names very challenging. Is it true? If yes, how we can jump this through? I would be more than happy to help crossing-out the remaining TO-DOs, if I only could get some itroduction and clues.

5 25

Re: Opinions on safe index
by Peter Bortas 25 Oct '19

25 Oct '19

On Thu, Oct 24, 2019 at 3:42 PM Peter Bortas > "?." should be there for symmetry, but it will probably not be used. On second thought, no, "?." should not be a thing. Other than possibly to throw a compile error if you use it. -- Peter Bortas

1 0

Opinions on safe index
by Peter Bortas ＠ Pike developers forum 24 Oct '19

24 Oct '19

I'll bring this up during next weeks conferance, but this is a chance for everyone to chime in. Safe indexing is not documented. Possibly partially because it's not consistently implemented. The lexer says this: if(GOBBLE('-') ) /* safe index: ?-> or ?[] */ { if( GOBBLE( '>' ) ) /* ?-> */ return TOK_SAFE_INDEX; SKIPN(-1); /* Undo GOBBLE('-') above */ } /* Probably wanted: ?. for safe constant index ?[] for safe [] index They however conflict with valid ?: syntaxes. */ /* if( GOBBLE('.' ) ) */ /* return TOK_SAFE_INDEX; */ The question is, could we take the hit that "?." and "?[]" would trigger safe indexing and thus break those as valid if syntax? I'm having a hard time conjureing up even semi-good theoretical examples for their uses. There are no uses in Pike's own source. Having "?->" without "?[]" is awkward and so either we should probably take that hit, or we change the syntax for safe index completely and depricate "?->". "?." should be there for symmerty, but it will probably not be used. As an aside: the "?" if syntax is nor documented in the refdoc for control structures, so hopefully there isn't a lot of casual users of it.

1 0

Broken pipermail
by Tomasz Jamroszczak 16 Sep '19

16 Sep '19

There's no September on https://lists.lysator.liu.se/pipermail/pike-devel/. Best Regards, Tomasz Jamroszczak

1 0

CQL (Cassandra/ScyllaDB) support?
by Stephen R. van den Berg 16 Sep '19

16 Sep '19

Has anyone looked at marrying Cassandra support to Pike? I'm considering doing it, just haven't decided on the best avenue yet. -- Stephen.

1 1

Pike conference 2019
by Tobias S. Josefowitz 30 Aug '19

30 Aug '19

Hi, we invite you to this year's Pike developer conference on the weekend of the 2nd and 3rd of November 2019. Opera will host the conference in its offices in Linköping. On Saturday and Sunday we meet at the Opera offices (Repslagaregatan 21) starting from 10:00. Just call "Opera Software" using the fancy door-bell-replacement technology at the entrance (or follow instructions as posted on the door, if any). Even though asking for this has traditionally proved somewhat pointless with our crowd, why don't you drop me an email to let me know should you want to join. On Friday the 1st of November 2019, Roxen invites everyone who is already in town and available at 15:00 to the traditional pre-conference fika at the Roxen office at S:t Larsgatan 22a. If you want to schedule an item on the conference agenda or have any other questions, please just send me an email. On behalf of the 2019 conference committee, Tobi

1 0

Broken online documentation
by Tomasz Jamroszczak 27 Aug '19

27 Aug '19

There's no System.Tiem in the documentation. I can access it via Google Search cache: https://webcache.googleusercontent.com/search?q=cache:5nqNuHyJgzAJ:https://… Best Regards, Tomasz Jamroszczak

1 0

Re: Comments/thoughts requested: Generators and async functions in Pike
by Chris Angelico 27 Aug '19

27 Aug '19

On Tue, Aug 27, 2019 at 3:26 AM Henrik Grubbström (Lysator) @ Pike (-) developers forum <10353(a)lyskom.lysator.liu.se> wrote: > > > Pike now (8.1) has a decent promise/future subsystem. It's always had > > great handling of multiple asynchronous operations (GUI, socket, time > > delay, etc) with the convenience of just returning -1 from main. > > Interested in people's opinions on whether it would be of value to > > introduce generators and (built on them) asynchronous functions. > > > > I'm borrowing terminology heavily from Python and ECMAScript here, and > > both of them have drawn from prior art. > > > > A *generator function* is a function that can be partially run, then > > set aside until resumed. Effectively, its stack frame can be > > encapsulated in an object for future use. It would look something like > > this: > > > > int get_numbers() { > > write("Starting\n"); > > yield 1; > > write("Continuing\n"); > > yield 2; > > write("Finishing\n"); > > return 3; > > } > > > > Calling get_numbers would prepare an execution context, but not > > actually begin running the function at all. The caller would get back > > a *generator object*. Asking this generator object to produce its next > > value would begin executing the function, triggering the call to > > write, and would stop at the first yield point, returning that value > > (1). Asking for another value resumes the function, triggering the > > second write, and returns the next yielded value. The third time you > > request a value, it would run the function to completion, and report > > that it returned (not yielded) 3. > > > > (The types yielded don't have to match the type of the return value. > > I'm not sure if there's a good way to declare the yielded types, or if > > it's best to just assume 'mixed'.) > > Not matching the declared type seems like a bad idea. They're two quite separate types, and there's currently no way to declare that distinction. The type yielded and the type returned could be completely different. For example, when being used for asynchronous code, the yielded type would be some sort of awaitable (a Concurrent.Future or similar), and the returned type would be the actual data to be produced. > > A generator object would be an Iterator, allowing you to loop over the > > yielded values easily: > > This is a separate issue. Note that iterators have both indices and values. Yes, I'm aware of that; would it be a problem if the indices are just all zero? Generators don't have any useful concept of "indexing". > > foreach (get_numbers() ;; int num) > > > > The 'yield' keyword would be an expression/operator, allowing you to > > send a value back into the generator function as the result of the > > yield expression. > > This seems to be something entirely different?? It's the way to elevate generators to coroutines. You produce a value out of the generator, and then either get one back in, or just get a zero that you ignore. > Anyway, I have a proof of concept implementation of the first use: > > --- generator_test.pike --- > > continue int foo(int start, int end) > { > while (start <= end) > continue return start++; > } > > int main(int argc, array(string) argv) > { > function(:int) bar = foo(4, 8); > > int i; > do { > i = bar(); > if (zero_type(i)) break; > werror("%d\n", i); > } while (1); > } > > --------------------------- > > $ ./pike generator_test.pike > 4 > 5 > 6 > 7 > 8 > 0 > > Note that the ending 0 is due to the implicit return 0 at the end of > Pike functions. Yes, which is why the returned value can plausibly be different from the "continue return" intermediate values - you don't use them the same way. Going back to my original async I/O example and recasting it into your syntax: string show_channel_info(string name) { int id = continue return get_channel_id(name); mapping data = continue return query_channel(id); write("Status: %s\n", data->status); mapping stream = continue return get_stream_info(id); if (stream) return sprintf("%s is online, %s", name, stream->uptime); return name + " is offline."; } The intermediate values would be Concurrent.Futures; the caller would get one of them, wait on it, and then send the returned value back in. The final return value is a string. ChrisA

2 2

Use of ::_destruct() in arbitrary objects
by Chris Angelico 26 Aug '19

26 Aug '19

In digging into a problem with Protocols.HTTP.Promise, I came across an issue with inheritance and destructors. #ifdef HTTP_PROMISE_DESTRUCT_DEBUG # define PROMISE_DESTRUCTOR \ protected void _destruct() { \ werror("%O()._destruct()\n", object_program(this)); \ } #else # define PROMISE_DESTRUCTOR #endif Activating this debug flag actually prevents the parent destructors from being called. And simply adding ::_destruct() into there doesn't work either, as that will break for anything that DOESN'T have a _destruct in its parent. How can this be solved generically? The symbol ::_destruct simply can't be looked up (at compile time) if the parent doesn't have one. ChrisA

2 2

Jump to page:

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