similar to: sieve 0.1.2 problem with address and :regex

$ gdb /usr/lib/dovecot/lmtp core_lmtp.48883.nihlus.leuxner.net GNU gdb (GDB) 7.4.1-debian Copyright (C) 2012 Free Software Foundation, Inc. License GPLv3+: GNU GPL version 3 or later <http://gnu.org/licenses/gpl.html> This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law. Type "show copying" and "show

Hi, I just found this in my logs: Apr 29 11:05:20 lmtp(joerg.eggenstein at ruhr-uni-bochum.de): Panic: file message-part-serialize.c: line 90 (part_serialize): assertion failed: (part->children == NULL) Apr 29 11:05:20 lmtp(joerg.eggenstein at ruhr-uni-bochum.de): Error: Raw backtrace: /usr/local/dovecot/lib/dovecot/libdovecot.so.0(+0x9c7f9) [0x7fa88bfbf7f9] ->

Program received signal SIGSEGV, Segmentation fault. 0x00007f1975cccdee in expire_mailbox_transaction_commit (t=<value optimized out>, changes_r=<value optimized out>) at expire-plugin.c:169 169 } else if (strcmp(value, "0") == 0) { (gdb) bt #0 0x00007f1975cccdee in expire_mailbox_transaction_commit (t=<value optimized out>,

Hi, when trying to build dovecot 2.3.5.1 pigeonhole testsuite crashes in Test case: ./tests/extensions/editheader/deleteheader.svtest: 1: Test 'Deleteheader - nonexistent' SUCCEEDED 2: Test 'Deleteheader - nonexistent (match)' SUCCEEDED 3: Test 'Deleteheader - one' SUCCEEDED 4: Test 'Deleteheader - two (first)' SUCCEEDED 5: Test 'Deleteheader - two

Ugh...This should be very simple, but evidently I am not searching for the proper term. Given the below: val_size<-100000 x_vals<-rnorm(val_size) I would like to group them according to the following x_vals_mean_tmp[1]<-mean(x_vals[1:10]) x_vals_mean_tmp[2]<-mean(x_vals[11:20]) ... x_vals_mean_tmp[n]<-mean(x_vals[99991:100000]) Then, I would like to group them according to the

I setup new server with dovecot 2.1.12 and mboxes from backup (moboxes was used with dovecot 1.1.6). OS: FreeBSD 8.3-STABLE, amd64. All index files from dovecot 1.1.6 has been deleted. Some times dovecot processes aborted. E. g. Jan 25 03:01:52 ost dovecot: lda(user at example.ru): Panic: file mail-transaction-log-file.c: line 1694 (mail_transaction_log_file_map): assertion failed:

Hi Terence, The reason I remarked, actually, is that for LLVM in particular the C+ + API offers more safety, and emitting .ll generally requires at least partially reimplementing the IR object model. I think this is a topic in the FAQ. But both are perfectly valid approaches! - Gordon On Apr 23, 2008, at 14:04, Terence Parr <parrt at cs.usfca.edu> wrote: > Gordon reminded me that

Hi all. My dovecot setup: pf at vulcan:~ ? dovecot --version 2.3.0 (c8b89eb) on Arch Linux, x86_64 (full config here: [0]) uses sieve plugin to train rspamd system as described in the wiki [1]. It used to work fine prior to 2.3.0/0.5.0 update, but now "imap" process crashes when I move spam letters from the inbox to the junk folder. I've recompiled both dovecot and pigeonhole

Hi everybody, Sometime last week outpost.ds9a.nl''s disk filled up and mailman corrupted one of its databases. It took quite some time to fix this, for which I apologize. But we''re back now! For posterity, the log file reported: Nov 13 13:27:33 2004 (25374) Delivery exception: EOF read where object expected Nov 13 13:27:33 2004 (25374) Traceback (most recent call last): File

I'm trying to make a regex to match common mailing list addresses and file messages to corresponding folders. I'm using sieve-test to try and understand what is happening. The sieve script is: require [ "fileinto", "regex", "variables" ]; if header :regex ["Sender"] ["(.*>[ \\t]*,?[ \\t]*)?([^-@]*)-([^-@]*)(-bounces)?@antlr.org"] {

When you create a parser via ANTLR you specify the output language of the resulting recursive descent parser, at the moment there exists no C++ output template to my knowledge, thus you would have to generate the parser as C code for which a template exists. The runtime support should be there, at least partially but it won't use things like exceptions, nor will it have a very modular design

Hi, thank you for your response. Óscar Fuentes schrieb: > It would be useful to see the first error messages and the compile > command (do make VERBOSE=1 in case it is hidden the first few errors are: f:/dev/projects/llvm-2.5/include/llvm/Support/Annotation.h:42: error: expected unqualified-id before numeric constant f:/dev/projects/llvm-2.5/include/llvm/Support/Annotation.h: In

Use a custom test driver for running the tests: based on the test-driver provided by automake, it adds the running time of the test in each .trs file. --- configure.ac | 1 + guestfs-test-driver | 151 ++++++++++++++++++++++++++++++++++++++++++++++++++++ tests/Makefile.am | 2 + 3 files changed, 154 insertions(+) create mode 100755 guestfs-test-driver diff --git a/configure.ac

Hello to all: When I make a call of extension (FXS) to extension (FXS) (TDM40B) status of the call is the following one: #### Case call answered --------------------------------------------------- Log init -- Starting simple switch on 'Zap/4-1' -- Executing Macro("Zap/4-1", "stdexten|103|Zap/2") in new stack -- Executing Dial("Zap/4-1",

Hi, I've not got any experience using ANTLR to parse C++, however, you will find that there only exists a C code generator for ANTLR and NOT a C++ one. Over the years numerous people have requested a C++ code generation template but alas there is still only a C one. Just a heads up. Granville 2009/7/11 Vikram S. Adve <vadve at cs.uiuc.edu> > We are looking for an open source C++

On 20 Mar 2007, at 15:45, Jeff Cohen wrote: > Duncan Sands wrote: >>> If that fails, I will build a front-end using ANTLR [http:// >>> antlr.org] a parser generator with which I am familiar and for >>> which a FORTRAN grammar is already available (targeting an >>> obsolete version of ANTLR, but it should not be too difficult to >>> update).

For a LL(1) parser, it might be a little bit difficult to parse complex grammar like C++, but it might work. ANTLR worked great when other codes were written in Java, but it was a little bit painful when using other languages like python. I worked on it two years ago. I guess they might have some improvement now. Haohui On 07/11/2009 02:40 PM, Vikram S. Adve wrote: > We are looking for an

Hello Surinder, The existing hand-written parser is callable from almost anywhere so the only reason you'd need to have a parser for it would be to extend it. Originally it was written using Flex and Bison but Chris Lattner rewrote it from scratch to catch more errors at the parsing stage. The only feature I've found to be missing from the existing LLVM-AS utility was an include

Duncan Sands wrote: >> If that fails, I will build a >> front-end using ANTLR [http://antlr.org] a parser generator with which >> I am familiar and for which a FORTRAN grammar is already available >> (targeting an obsolete version of ANTLR, but it should not be too >> difficult to update). >> > > Bad plan. I doubt you can build a serious fortran

That sounds like a problem. Just so I understand, do you mean there isn't the run-time support etc. to write back ends for the C++ language, or that the compiler IR is also somehow insufficient to write a code generator? --Vikram Associate Professor, Computer Science University of Illinois at Urbana-Champaign http://llvm.org/~vadve On Jul 11, 2009, at 3:00 PM, Granville Barnett