similar to: [LLVMdev] bytecode reader assertion failure

Ryan, This looks like a bug. Could you file it, please? Reid. On Thu, 2007-02-22 at 19:47 -0600, Ryan M. Lefever wrote: > I have a compiler transform that I have been working on that produces > bytecode that passes the verifier. However, when I try to read that > bytecode back in, I get the assertion failure below. > > llvm::BytecodeReader::ParseConstantPoolValue(unsigned

I am still diagnosing the cause of the assertion failure and will submit a bug when I better understand the problem. Reid Spencer wrote: > Ryan, > > This looks like a bug. Could you file it, please? > > Reid. > > On Thu, 2007-02-22 at 19:47 -0600, Ryan M. Lefever wrote: > >>I have a compiler transform that I have been working on that produces >>bytecode

I am writing an interprocedural compiler pass. Because the passneeds information from a FunctionPass, e.g., the post-dominance frontier (PDF), and because a ModulePass is not permitted to require a FunctionPass, I am forced to make my pass a FunctionPass and do majority of its work in the doFinalization() method. When I run "opt -mypass -verify -o code2.bc code1.bc" I get no

I followed what you said and called verifyModule() with the AbortProcessAction option. verifyModule() returns false, but does not abort and does not print out any information about what caused the verification to fail. Chris Lattner wrote: > On Wed, 21 Feb 2007, Ryan M. Lefever wrote: >> I am writing an interprocedural compiler pass. Because the passneeds >> information from a

I also tried iterating through the functions of the module and calling verifyFunction(), which also returns false, but does not cause an abort or report anything to stderr about what caused the verification to fail. From the doxygen for verifyFunction() and verifyModule(), it seems like they both should print information to stderr if the verification fails and should abort opt if

On Wed, 21 Feb 2007, Ryan M. Lefever wrote: > I am writing an interprocedural compiler pass. Because the passneeds > information from a FunctionPass, e.g., the post-dominance frontier > (PDF), and because a ModulePass is not permitted to require a > FunctionPass, I am forced to make my pass a FunctionPass and do majority > of its work in the doFinalization() method. ok > When

I think I misread the doxygen. verifyFunction & verifyModule return false if no errors are detected. However, my question now becomes why does the code produced by my transform pass verification, but it causes an assertion failure in the byte reader when it (the code produced by my transform) is passed to another invocation of opt? Ryan M. Lefever wrote: > I also tried iterating

Hi, Probably some of the leaks Valgrind reports are spurious, but the numbers seem to be significant enough to demand some attention: ==10132== LEAK SUMMARY: ==10132== definitely lost: 15,624 bytes in 558 blocks. ==10132== indirectly lost: 44,548 bytes in 1,591 blocks. ==10132== possibly lost: 37,576 bytes in 98 blocks. ==10132== still reachable: 1,336,876 bytes in 1,364 blocks.

Hi guys, We have found a bug of BitcodeReader.cpp in processing an LTO bitcode file. As LLVM doesn't emit use-list for LTO bitcode files, many forward references will happen when BitcodeReader processes the bitcode file, and LLVM uses placeholders for those forward references and resolve them later. When parseConstants() reads in a CST_CODE_CE_SELECT record, e.g. select

Hi Eli, Thanks for the advice! By delaying processing the "select" until we have resolved other records(like "aggregate " in this case) as you did for "shuffle", the test case passes now. But I wonder if it's an ultimate solution: what if the selector of a "select" is the output of another forward-reference "select" that hasn't been

nchar(with(list(2),ls())) gives an internal error. This is of course a peculiar call (no names in the list), but the error is not caught cleanly. It is not clear from the documentation whether with(list(2)...) is allowable; if it is not, it should presumably give an error. If it is, then ls shouldn't have problems with the resulting environment. > qq <- with(list(2),ls())

Noob alert! Hi, I am having trouble figuring out how to filter a select helper. The following shows all of the rows in the table but I would like to filter the collection from the list_name column (:list_name => "Project Status"): @project_status = Valuelist.all.collect {|s| [s.list_value,s.id]} Thanks in advance, James -- Posted via http://www.ruby-forum.com/. -- You received

Dear R-users Im working with a dataset that contains information for 8 groups of data and I need to select a sample of certain size (100 cubic feet by group) from this database for each of these 8 groups. To clarify, here is the starting code Im working with: k<-nrow(dataset) ix<-sort(runif(k),index.return=TRUE)$ix M<-max(which(cumsum(dataset$volume[ix])<100))+1

On Tue, Apr 4, 2017 at 12:36 PM, Duncan P. N. Exon Smith < dexonsmith at apple.com> wrote: > > On 2017-Apr-04, at 12:12, Peter Collingbourne <peter at pcc.me.uk> wrote: > > On Mon, Apr 3, 2017 at 8:13 PM, Mehdi Amini <mehdi.amini at apple.com> wrote: > >> >> On Apr 3, 2017, at 7:08 PM, Peter Collingbourne <peter at pcc.me.uk> wrote: >>

# xl cpupool-create ''name="pool2" sched="credit2"'' command line:2: config parsing error near `sched'': syntax error, unexpected IDENT, expecting NEWLINE or '';'' Failed to parse config file: Invalid argument *** glibc detected *** xl: free(): invalid pointer: 0x0000000001a79a10 *** Segmentation fault (core dumped) Looking at the code

I wrote: > Also I wrote: > > However, xl fails on config files which are missing the final > > newline. This should be fixed for 4.2. > > My patch for this didn''t make it into 4.2 RC4. Should this go into 4.2.0 or be held for 4.2.1 (or is it not 4.2.x material at all) ? Ian. From: Ian Jackson <ian.jackson@eu.citrix.com> Subject: [PATCH] libxl: Tolerate xl

Dear All, Would somebody be able to update the Bytecode Format Manual with the 28 bit bytecode version numbers for LLVM 1.4, 1.5, and 1.6 (or point me to the file which defines it so I can look it up)? Thanks. -- John T. -- John T. Criswell Research Programmer University of Illinois at Urbana-Champaign "It's today!" said Piglet. "My favorite day," said Pooh.

Hello, I noticed a bit of a gap in the current code for unions: a ConstantUnion cannot be written out to .ll. Hopefully I'm not stepping on Talin's toes by posting this, it's a fairly straightforward adaptation of the code for structs just above. Tim. -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. --------------

I am in a holding pattern while client decides upon changes and so I am working some things out internally so it seems to me that indexing frequently searched table fields might be useful. I am using postgres and via postgres, I have added an index to one of my tables whose index is the same name as the column name. The ''find'' screen I am using this to judge populates a number

Hi, Does anybody know how codebooks are generated in OggVorbis encoder? We are porting oggorbis encoder on embedded platform for which VQ codebook memory is hugeeee to imagine. How can we reduce that? Can we do VQ with less codebooks and if yes how? If any help available? Parul Embedded Engineer Einfochips Ltd