search for: stable_sort

The comment says it was added due to a bug in MSVC 2013 implementation of stable_sort. Newer versions of MSVC have fixed this bug in stable_sort according to this webpage record https://connect.microsoft.com/VisualStudio/feedback/details/886652 Can we remove the check now? ~Craig -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm....

...k-of-Mon-20090824/085454.html) Problem is: I can't get it to work. The attached patch (which depends on lib/Transforms/Instrumentation/MaximumSpanningTree.* being removed before application) does not compile with $> .../lib/Transforms/Instrumentation/MaximumSpanningTree.cpp:38: error: 'stable_sort' is not a member of 'std' which I find kind of curious since std::stable_sort didn't make a problem in the specific implementation. This problem aside I get the error $> llvm[2]: Linking Debug executable opt $> .../llvm-svn-debug-obj/Debug/lib/libLLVMInstrumentation.a(Optim...

Andreas Neustifter wrote: > $> .../lib/Transforms/Instrumentation/MaximumSpanningTree.cpp:38: error: > 'stable_sort' is not a member of 'std' > > which I find kind of curious since std::stable_sort didn't make a > problem in the specific implementation. > I don't see anything that definitely pulls <algorithm> in, so it may be a case of one implementation happening to do i...

...ndows, B_Linux = B_Windows). Privacy reasons prevent me from sharing my testcases here, sorry. I compared debug information and found the root cause in MachinePipliner.cpp that Node orders differed after sort algorithm. There were two `std::sort` in this file and when I replaced them with 'std::stable_sort', these two assembly files became the same but other assembly files differed(A_Linux = A_Windows, B_Linux != B_Windows). I cannot figure out the reason and could you give me some advice why this happened and what sort algorithm should I use to get exactly same assembly files? Best regards, Ruo...

Hi, It looks like the the ELFPassFile doesnot get an ordinal value assigned, as its added in a pass. Is there a way to assign a file ordinal for the files added by Passes ? Till that time, I am going to XFAIL the ifunc test. More tests should fail, and am not sure why they are not failing. Thanks Shankar Easwaran -- Qualcomm Innovation Center, Inc. is a member of Code Aurora Forum, hosted

In addition I think the LayoutPass std::stable_sort be replaced with std::sort as total ordering is guaranteed as each File would get an ordinal and each atom would get an ordinal too, after the below problem is fixed. Thanks Shankar Easwaran On 10/6/2013 10:54 PM, Shankar Easwaran wrote: > Hi, > > It looks like the the ELFPassFile do...

Ping ? Do you think that we need to have an API in LinkingContext to return the next ordinal available, so that files created by passes can be assigned ordinals ? Thanks Shankar Easwaran On 10/6/2013 11:07 PM, Shankar Easwaran wrote: > In addition I think the LayoutPass std::stable_sort be replaced with > std::sort as total ordering is guaranteed as each File would get an > ordinal and each atom would get an ordinal too, after the below > problem is fixed. > > Thanks > > Shankar Easwaran > > On 10/6/2013 10:54 PM, Shankar Easwaran wrote: >> Hi,...

Statistic.cpp uses std::stable_sort without including <algorithm>. -- Casey Carter Casey at Carter.net ccarter at uiuc.edu AIM: cartec69 -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: patch URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20021027/4d75abdc/...

...le does not work for > me. From the source file gram.yc, my bison (version 1.28) generates > files gram.yc.tab.h and gram.yc.tab.c instead of gram.tab.cc and > gram.tab.hc. My fix is to use the -o option to tell bison what to name > the outputs. Applied. > Statistic.cpp uses std::stable_sort without including <algorithm>. Applied. > Timer.cpp uses std::greater without including <functional>. Applied. > PreSelection.cpp uses the form "++(ConstantExpr*)->op_begin()" in a > couple of places: gcc2 considers this to be an illegal use of a constant >...

...rgest file ordinal for a file created in a pass. If you want to assign the smallest file ordinal, for example, then the API wouldn't work. > Thanks > > Shankar Easwaran > > > On 10/6/2013 11:07 PM, Shankar Easwaran wrote: > >> In addition I think the LayoutPass std::stable_sort be replaced with >> std::sort as total ordering is guaranteed as each File would get an ordinal >> and each atom would get an ordinal too, after the below problem is fixed. >> >> Thanks >> >> Shankar Easwaran >> >> On 10/6/2013 10:54 PM, Shankar Easwa...

On Tue, May 5, 2015 at 10:20 AM, Jingyue Wu <jingyue at google.com> wrote: > Hi Daniel, > > I presume you mean, instead of assigning function arguments distinct ranks > (http://llvm.org/docs/doxygen/html/Reassociate_8cpp_source.html#l00282), we > should group function arguments in favor of existing pairings. Existing = pairings reassociate already chose before *not* existing

...> ('a * 'b) list -> ('a * 'b) list + val split : ('a * 'b) list -> 'a list * 'b list + val combine : 'a list -> 'b list -> ('a * 'b) list + val sort : ('a -> 'a -> int) -> 'a list -> 'a list + val stable_sort : ('a -> 'a -> int) -> 'a list -> 'a list + val fast_sort : ('a -> 'a -> int) -> 'a list -> 'a list + val merge : ('a -> 'a -> int) -> 'a list -> 'a list -> 'a list +end +(** Override the List module fr...

...ingPadInfo *, 64> LandingPads; >> + LandingPads.reserve(PadInfos.size()); >> + for (unsigned i = 0, N = PadInfos.size(); i != N; ++i) >> + LandingPads.push_back(&PadInfos[i]); >> + std::sort(LandingPads.begin(), LandingPads.end(), PadLT); >> > > stable_sort instead? Does it matter? > > I leave that to the DwarWriter.cpp coders. All the code here is taken from that file. Thanks, Nicolas

...ions. > + SmallVector<const LandingPadInfo *, 64> LandingPads; > + LandingPads.reserve(PadInfos.size()); > + for (unsigned i = 0, N = PadInfos.size(); i != N; ++i) > + LandingPads.push_back(&PadInfos[i]); > + std::sort(LandingPads.begin(), LandingPads.end(), PadLT); stable_sort instead? Does it matter? > + > + // Negative type ids index into FilterIds, positive type ids > index into > + // TypeInfos. The value written for a positive type id is just > the type > + // id itself. For a negative type id, however, the value > written is the &gt...

Hi everyone, Here's a patch that enables exception handling when jitting. I've copy/pasted _many_code from lib/Codegen/DwarfWriter.cpp, so we may need to factorize it, but the functionality is there and I'm very happy with it :) lli should now be able to execute the output from llvm-gcc when using exceptions (the UnwindInst instruction is not involved in this patch). Just add the

v2 -> v3: - Renamed List.assoc_ -> List.assoc_lbl. - Rebased on top of current master branch. Rich.

This time including the first commit ...

In Std_utils we already extend Char and String. These commits take it a little further by extending List and adding a new Option submodule. All basically simple refactoring. Rich.