Displaying 20 results from an estimated 10000 matches similar to: "extern calls interfere with optimizations"
2000 Sep 14
5
ListenAddress option.
How do I compile OpenSSH so that I can use:
ListenAddress 0.0.0.0
in my sshd_config file ?
Currently I get:
[root at dark openssh-2.2.0p1]# sshd -d
debug: sshd version OpenSSH_2.2.0p1
debug: Seeding random number generator
debug: read DSA private key done
debug: Seeding random number generator
error: getnameinfo failed
fatal: Cannot bind any address.
if I try to use "ListenAddress
2008 Jul 09
2
build matrix with the content of one column of a data frame in function of two factors
Hello,
First, thanks for your help (and sorry for my english !)
I have a data frame in which each row represents a vote (in percent, only
20,40, 60,80,100) of one person on one content, with three columns : name
(the name of the voters), content_id, vote :
str(votesredac)
'data.frame': 1000 obs. of 3 variables:
$ name : chr "Guillemette Faure" "Guillemette
2015 Oct 22
8
RFC: Inlining report
RFC: Inlining Report
Motivation
Making good inlining choices while optimizing an application is often key to achieving optimal performance. While the compiler's default inlining heuristics sometimes provide great out-of-box results, optimal performance is sometimes achieved only after varying the settings of certain compiler options related to inlining or adding "always_inline" or
2004 Oct 04
2
call/pickup groups
Hi,
Anyone knows why there's a limit of 32 callgroup/pickupgroup in * ?
It is coded as unsigned int but there's an hardcoded "if( X > 31 )"
like line. IMHO, 32 group is very low and I wonder what impact it
would have to increase it to 2^16-1 .
Anyone?
2020 Mar 09
4
GSoC - Improve parallelism-aware analyses and optimizations
Hello! My name is Emanuel and I am an undergraduate student from Brazil (at
the University of São Paulo) wanting to participate in this years GSoC on
LLVM. Specifically, on the "Improve parallelism-aware analyses and
optimizations" project.
I currently do research on autotuning of LLVM IR optimization passes and I
am sitting for a class about parallel computing, but I have been studying
1998 Aug 10
3
Samba and the PDC are fighting for being the Browse master, why?
Hello,
in my log.nmb I regularly see these messages:
process_local_master_announce: Server GUTENBERG at IP 192.168.35.90 is announcing itself as a local master browser for workgroup PIEZO and we think we are master. Forcing election.
1998/08/10 12:57:03 ***** Samba name server FAURE has stopped being a local master browser for workgroup PIEZO on subnet 192.168.32.1 *****
1998/08/10
2020 Mar 09
2
GSoC - Improve parallelism-aware analyses and optimizations
Awesome, thanks!
As per your suggestion, I read the description of these two projects:
Advanced Heuristics for Ordering Compiler Optimization Passes
Machine learning and compiler optimizations: using inter-procedural
analysis to select optimizations
and they are amazing! Indeed, they are very close to my interest in
autotuning. I didn't see them on the list before.
If I choose to focus on
2007 Dec 09
3
[LLVMdev] Darwin vs exceptions
(Mail system seems to have eaten this, sorry if it's a repeat)
On Dec 8, 2007, at 12:48 AM, Duncan Sands wrote:
> Hi Dale,
>
>> - Why was C++ claiming that every selector has a catch-all handler?
>
> this is easy: because the semantics of invoke require it. Yes,
> really.
> If unwinding reaches an invoke then control is required to jump to the
> unwind basic
2019 Aug 02
2
[RFC] Stack overflow and optimizations
During the review of https://reviews.llvm.org/D59978 we got to the
question whether we can optimize based on the assumption that stack
overflow is undefined behavior. While I think it is according to the
C++ standard, Windows Structured Exception Handling and signal
handlers might allow programs to recover/exit gracefully.
Concretely, the patch D59978 wants add the noreturn attribute to
functions
2007 Dec 09
0
[LLVMdev] Darwin vs exceptions
Hi Dale,
> #include <cstdio>
> class A {
> public:
> A() {}
> ~A() {}
> };
> void f() {
> A a;
> throw 5.0;
> }
> main() {
> try {
> f();
> } catch(...) { printf("caught\n"); }
> }
this example indeed shows the problem. Let me explain to see if we agree on what
the problem is. Suppose we don't artificially
2009 Jun 18
2
Hatched symbols
Hello,
I would like to build rectangles in a plot and use color and different type
of hatching for filling rectangles. I don't find the way to draw hatchings.
I'm thinking to build segment by segment inside each rectangle but I'm sure
that exists a better way to do that. I didn't find any documentation about
that.
> symbols(1,1,rectangles=cbind(1,1),bg="red", ...
2008 Aug 25
0
[LLVMdev] Proposal : Function Notes
Hi Devang,
I have a few questions below.
On Aug 22, 2008, at 4:40 PM, Devang Patel wrote:
> Here is a proposal that I mentioned sometime ago. Any
> thoughts,comments or
> suggestions on this proposal would be appreciated.
> -
> Devang
>
> //
> =
> =
> =
> ----------------------------------------------------------------------=
> ==//
> //
2019 Jun 04
2
is this a bug in PruneEH?
I have the following C source:
extern unsigned int donut;
void f1();
void f2();
void f1()
{
unsigned int *magic = &donut;
if (*magic != 286529877) {
f2();
}
}
void f2() {
/* Loop here forever if application is built with wrong version of ROM image */
while(1) {
;
}
}
The -O2 level PruneEH pass uses SimplifyFunction() which contains this code:
for
2010 May 11
1
[LLVMdev] All CallInsts mayHaveSideEffects
Hi,
All CallInsts should return true for Instruction::mayHaveSideEffects() because functions are not guaranteed to halt.
Inliner::runOnSCC calls isInstructionTriviallyDead to determine whether code can be dead code eliminated. isInstructionTriviallyDead returns true if Instruction::mayHaveSideEffects() returns false. A function that potentially runs forever based on its input but does not write
2012 Sep 23
1
Background color in a grid plot seems to interfere with plot()
Hi,
Why does the upper left panel (in the plot below) not have a gray background?
Cheers,
Marius
require(grid)
require(gridBase)
pdf(file="Rplot.pdf", width=8, height=8, onefile=FALSE)
## set up the grid layout
gl <- grid.layout(5, 5, widths=unit(c(1.8, 8, 0.8, 8, 0.8), "cm"),
heights=unit(c(0.8, 8, 0.8, 8, 1.5), "cm"))
if(FALSE) grid.show.layout(gl)
2011 Mar 03
1
Does RSpec interfere with Pathname#dirname or Pathname#realpath ?
Hi,
I starting a new project, and have run into behavior I cannot
replicate in irb, (i.e. outside of using rspec) when the directory?
returns true, so I thought I''d ask here, in case any one has seen this
badhavior.
ruby-1.9.2-p136
rspec (2.5.0)
rspec-core (2.5.1)
rspec-expectations (2.5.0)
rspec-mocks (2.5.0)
When I try to run this spec:
require Pathname(__FILE__).ascend { |d|
2012 Nov 28
4
[LLVMdev] noreturn attribute on a call instruction vs noreturn on a function
Hi,
Building the following C code I get a call instruction that has no noreturn
attribute, while the function itself does have it.
void foo(void **b) {
__builtin_longjmp(b, 1);
}
define void @_Z3fooPPv(i8** %b) noreturn nounwind uwtable {
entry:
%0 = bitcast i8** %b to i8*
tail call void @llvm.eh.sjlj.longjmp(i8* %0)
2016 Mar 28
2
Ignoring coverage for noreturn decls
Hi all,
Recently I’ve noticed in coverage profiles that llvm_unreachable and the like are considered uncovered because there’s no special behavior in instrumentation to ‘ignore’ noreturn paths.
While I don’t necessarily think it’s ideal to ignore all noreturn decls, I think there’s definitely room for some heuristics around ignoring things like llvm_unreachable (perhaps opt-in?). I’m
2010 Dec 07
0
[LLVMdev] RFC: Exception Handling Proposal Revised
Hi Bill, there are a couple of things I didn't understand about your proposal,
for example how it interacts with inlining, whether it is feasible to do the
"turn invoke-of-Unwind_Resume into a branch" optimization and also whether in
"resumedest" you still plan to use _Unwind_Resume to continue unwinding up the
stack. Could you please show what the LLVM IR would look like
2000 May 28
1
Warning for expired password
Is it possible to get sshd to report the number of days till a password
expires after a login ?
If not, how else could I do it ?
Thanks
___________________________________________________________
Paul Faure paul at engsoc.carleton.ca