Displaying 5 results from an estimated 5 matches for "__html".
2012 Dec 17
0
[LLVMdev] LoopPass doFinalization() called multiple times per program?
...ng doFinalization() being called multiple
> times per program. Digging into the code, it appears that LPPassManager
> actually
> makes the calls to doFinalization() at the end of it's runOnFunction()
> method
> (http://llvm.org/docs/doxygen/__html/LoopPass_8cpp_source.__html#l00281
> <http://llvm.org/docs/doxygen/html/LoopPass_8cpp_source.html#l00281>, at
> time of
> writing). This therefore means that doFinalization() can be called multiple
> times per LoopPass; as many as there are function...
2012 Dec 17
3
[LLVMdev] LoopPass doFinalization() called multiple times per program?
On Sun, Dec 16, 2012 at 7:23 AM, Duncan Sands <baldrick at free.fr> wrote:
> Hi Stephen,
>
>
> On 13/12/12 18:58, Stephen McGruer wrote:
>
>> I'm wondering if the documentation for LoopPass
>> (http://llvm.org/docs/**WritingAnLLVMPass.html#**LoopPass<http://llvm.org/docs/WritingAnLLVMPass.html#LoopPass>)
>> is misleading or
>> incorrect (or
2014 Mar 20
2
[LLVMdev] load bytecode from string for jiting problem
This segfault occuring only under valgrind,
in shell way, and in gdb way i have
Invalid bitcode signature
simple_scev_dynamic_array: /home/willy/apollo/llvm/include/llvm/Support/ErrorOr.h:258: storage_type *llvm::ErrorOr<llvm::Module *>::getStorage() [T = llvm::Module *]: Assertion `!HasError && "Cannot get value when an error exists!"' failed.
Command terminated by
2014 Mar 20
2
[LLVMdev] load bytecode from string for jiting problem
...> I investigate more the source code of llvm.
>>>>
>>>> First, I change isRawBitcode function to print the content of
>>>> the parameter like this:
>>>> original:
>>>> http://llvm.org/docs/doxygen/__html/ReaderWriter_8h_source._
>>>> _html#l00081
>>>>
>>>> <http://llvm.org/docs/doxygen/html/ReaderWriter_8h_source.
>>>> html#l00081>
>>>>
>>>> inline bool isRawBitcode(const unsigned char *BufPtr,
>>&...
2013 May 30
1
wilcox_test function in coin package
Dear All,
I have two simple data samples (no groups or factors, etc.) and would just
like to compute the two-sample Wilcoxon Rank Sum test using the wilcox_test
function contained in the coin package, which is reportedly better than the
regular wilcox.test function because it performs some adjustment for ties.
Would anyone know how to craft a script to perform this task? Much
appreciated.
Janh