search for: addvalu

...ype = {anonymous}::testx; Storage = bool; ParserClass = llvm::cl::parser<{anonymous}::testx>]’: /home/dan/documents/projects/project/klee/src/lib/Core/Executor.cpp:3448:1: required from here /home/dan/documents/projects/project/llvm-2.9/src/include/llvm/Support/CommandLine.h:1220:5: error: ‘addValue’ was not declared in this scope, and no declarations were found by argument-dependent lookup at the point of instantiation [-fpermissive] /home/dan/documents/projects/project/llvm-2.9/src/include/llvm/Support/CommandLine.h:1220:5: note: declarations in dependent base ‘llvm::cl::bits_storage<{an...

I just finished the merge of branch_jackoggsvorbis into branch_postbeta2 Vorbis is now split into two libs, libogg, and libvorbis in this branch. the follow modules are a result: ogg - basic framing library, all ogg code and docs, etc vorbis - the vorbis codec, depends on ogg vorbis-plugins - all the audio plugins for ogg vorbis, depends on ogg and vorbis ao - libao a cross platform audio

...d correctly the numbers, this does not tell anything about how much the Dwarf emitter accounts on the *peak memory* usage (could be more, could be nothing...). I think these nodes represent allocations from the DWARF emitter: DwarfDebug::DwarfDebug 9.5% DwarfDebug::endFunction 15.6% DIEValueList::addValue 9.1% total 34.2% I believe they are totals, but my reading of the code is that the DWARF emitter does not deallocate its memory until the end of code generation, so total ~= peak in this case. I am not surprised by these figures -- see e.g. DIEValueList::Node which in the worst case can use up t...

Seems to just be a byproduct of TGParser::AddSubClass() begin called twice. This means that TGParser::AddValue() is being called once for the "i" of each class, and the "last one wins". Not sure if it is intended, but this behavior seems to more-or-less "make sense". --Sean Silva On Mon, Jul 2, 2012 at 4:55 PM, reed kotler <rkotler at mips.com> wrote: > class one {...

...much the Dwarf emitter accounts on the *peak memory* usage (could > be more, could be nothing...). > > > > I think these nodes represent allocations from the DWARF emitter: > > > > DwarfDebug::DwarfDebug 9.5% > > DwarfDebug::endFunction 15.6% > > DIEValueList::addValue 9.1% > > total 34.2% > > > > I believe they are totals, but my reading of the code is that the DWARF > > emitter does not deallocate its memory until the end of code generation, > > That's sad :( > > > so total ~= peak in this case. > > Assuming the...

class one { int i = 0; } class two { int i = 1; } class multiple: one, two; This causes the first i to be ignored and the second i to replace it. This is a useful property if you want to specialize classes. But I don't know if it was intended to work that way or not. For example, if you have an instruction class with no patterns, you can merge it with one that defines the pattern

...nts on the *peak memory* usage (could >> be more, could be nothing...). >> > >> > I think these nodes represent allocations from the DWARF emitter: >> > >> > DwarfDebug::DwarfDebug 9.5% >> > DwarfDebug::endFunction 15.6% >> > DIEValueList::addValue 9.1% >> > total 34.2% >> > >> > I believe they are totals, but my reading of the code is that the DWARF >> > emitter does not deallocate its memory until the end of code generation, >> >> That's sad :( >> >> > so total ~= peak in t...

Hello R-users, I need to create a vector inserting an 1 after each value of another vector. For example: vec1<-c(2,3,4) I need to create a vector with the values 2,1,3,1,4 Does anyone know how create this vector without loops (vec1 could have 1000 elements) Thank you, Juan -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- r-help mailing list -- Read

...ntry) { + DIE *DieCU = Die->getCompileUnitOrNull(); + DIE *EntryCU = Entry->getEntry()->getCompileUnitOrNull(); + if (!DieCU) + // We assume that Die belongs to this CU, if it is not linked to any CU yet. + DieCU = getCUDie(); + if (!EntryCU) + EntryCU = getCUDie(); + Die->addValue(Attribute, EntryCU == DieCU ? dwarf::DW_FORM_ref4 : + dwarf::DW_FORM_ref_addr, Entry); } If we made the correct assumptions inside addDIEEntry, we would make the correct decision between ref4 and ref_addr, so when we emitting a ref4, the two DIEs must...

On Wed, Oct 16, 2013 at 9:10 PM, Manman Ren <manman.ren at gmail.com> wrote: > > > > On Wed, Oct 16, 2013 at 1:58 PM, David Blaikie <dblaikie at gmail.com> wrote: > >> >> >> >> On Wed, Oct 16, 2013 at 1:21 PM, Manman Ren <manman.ren at gmail.com> wrote: >> >>> >>> There are a few places where we break the assumption:

On Wed, Oct 16, 2013 at 1:58 PM, David Blaikie <dblaikie at gmail.com> wrote: > > > > On Wed, Oct 16, 2013 at 1:21 PM, Manman Ren <manman.ren at gmail.com> wrote: > >> >> There are a few places where we break the assumption: >> 1> formal_parameter constructed in DwarfDebug when adding attribute type >> we call SPCU->addType(Arg, ATy),

Hi all, We have profiled [1] the memory usage in LLVM when LTO'ing Chromium, and we've found that one of the top consumers of memory is the DWARF emitter in lib/CodeGen/AsmPrinter/Dwarf*. I've been reading the DWARF emitter code and I have a few ideas in mind for how to reduce its memory consumption. One idea I've had is to restructure the emitter so that (for the most part) it