Displaying 20 results from an estimated 1000 matches similar to: "Strange Error -- ASterisk 1.6"
2010 Apr 01
2
canary_thread
People,
Anybody knows what mean this message in my CLI:
[Apr 1 16:58:34] WARNING[3845]: asterisk.c:3050 canary_thread: The canary is no more. He has ceased to be! He's expired and gone to meet his maker! He's a stiff! Bereft of life, he rests in peace. His metabolic processes are now history! He's off the twig! He's kicked the bucket. He's shuffled off his mortal
2006 Nov 23
0
[ANNOUNCE] libX11 1.1
It's not pinin', it's passed on! This library is no more! It has ceased to be!
It's expired and gone to meet its maker! This is a late library! It's a stiff!
Bereft of life, it rests in peace! If you hadn't nailed it to the perch it
would be pushing up the daisies! It's rung down the curtain and joined the
choir invisible! This is an X-lib!
After two candidate
2012 Mar 10
0
[LLVMdev] Stack protector performance
If you compile this with optimizations, then the 'canary()' function should be totally inlined into the 'main()' function. In that case, the cost of the stack protectors will be very small compared to the loop.
-bw
On Mar 9, 2012, at 2:52 AM, Job Noorman <jobnoorman at gmail.com> wrote:
> I have a question about the performance of the implementation of the stack
>
2012 Mar 09
3
[LLVMdev] Stack protector performance
I have a question about the performance of the implementation of the stack
protector in LLVM.
Consider the following C program:
=====
void canary()
{
char buf[20];
buf[0]++;
}
int main()
{
int i;
for (i = 0; i < 1000000000; ++i)
canary();
return 0;
}
=====
This should definately run slower when stack protection is enabled, right?
I have measured the runtime of
2009 Jan 27
2
working with tables -- was Re: Mode (statistics) in R?
Ok, so I'm slowly figuring out what a factor is, and was able to follow
the related thread about finding a mode by using constructs like
my_mode = as.numeric(names(table(x))[which.max(table(x))])
Now, suppose I want to keep looking for other modes? For example,
Rgames> sample(seq(1,10),50,replace=TRUE)->bag
Rgames> bag
[1] 2 8 8 10 7 3 2 9 8 3 8 9 6 6 10 10 7 1
2011 Jul 26
4
[LLVMdev] How to get the return address on the stack on LLVM
Hi all,
I want to implement the Xor random canary, so I have to get the return
address in the prologue and epilogue of the function.
In the prologue of the function, before I insert into the canary on
the stack, I can get the return address by:
ConstantInt* ci =
llvm::ConstantInt::get(Type::getInt32Ty(RI->getContext()), 0);
Value* Args1[] = {ci};
CallInst* callInst =
2011 Jul 20
2
[LLVMdev] Question about SimplifyXorInst
Hi all,
I am master student in Edinburgh, UK. I am doing my MSc project with
LLVM compiler and I have to modify LLVM to implement the StackGuard
with a XOR random Canary. However, I am not familiar with LLVM.
My problem is that I want to XOR the random canary word with the
return address which are both 32 bits. I found a method called
SimplifyXorInst(Value *, Value *, const TargetData
2016 Jun 30
1
Implementing stack probes
On Thu, Jun 30, 2016 at 8:29 AM, Martin J. O'Riordan via llvm-dev <
llvm-dev at lists.llvm.org> wrote:
> I am trying to implement stack probes for our SHAVE target, and I see that
> the compiler injects references to ‘__stack_chk_guard’ and
> ‘__stack_chk_fail’. The code that gets generated is horribly wrong, but in
> order to understand how to fix it I was wondering if
2011 Jul 21
1
[LLVMdev] How to XOR return address
Hi all,
How to XOR the return address on the stack with a canary word both are
32 bits? Is there a method to implement it?
Thank you.
Ying
--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.
2016 Mar 22
2
GSoC and SAFECode
John Criswell wrote:
> If you're interested in SAFECode, the first step is to get SAFECode
> working with a newer version of LLVM. A Master's student did some
> work on this last summer with LLVM 3.7 but didn't finish. It would
> now need to be updated to LLVM 3.8 (though I suppose a completed LLVM
> 3.7 port would be fine with me).
>
> After that, there are
2008 Apr 10
3
Zfs send takes 3 days for 1TB?
Can zfs send utilize multiple-streams of data transmission (or some sort
of multipleness)?
Interesting read for background
http://people.planetpostgresql.org/xzilla/index.php?/archives/338-guid.html
Note: zfs send takes 3 days for 1TB to another system
Regards,
Jignesh
2010 Jul 16
8
Cyberpower 1500AVR
All,
I just had a power failure that caused me a little drama. This
spurred me into trying to get NUT up on my cyberpower 1500 again. For
about 6 months I tried to get it to work with the new power panel drive
with no luck. Today I removed all the old files for NUT and installed
the newest version I could find (2.4.3) and it works perfectly now with
my UPS.
Hopefully now I
2008 Jul 03
3
Icecast Fedora9 migration problems
Karl Heyes wrote:
> Seann Clark wrote:
>
>> The biggest being is that the server binds to whatever port it feels
>> like instead of the bind port specified. The rest of the issues I have
>
> a random port bind is a new issue. Can you show us the
> netstat -tnlp | grep icecast
> for the xml provided?
Thu Jul 03-13:54:17-root at haruhi-new:~> netstat -tnlp | grep
2010 May 11
4
AGI and Severe Weather Alerts
All,
I am toying with an idea of using an AGI to be able to 'call'
my phone, or phones, in case of severe weather warnings. I have been
tinkering with a script that reads from weather underground for the
forecast, based off a PHP version of a weather AGI I found on the net.
It seems rather trivial to have the AGI as a script, that does nothing
unless a condition is met, and
2011 Jul 26
0
[LLVMdev] How to get the return address on the stack on LLVM
Hello
> In the prologue of the function, before I insert into the canary on
> the stack, I can get the return address by:
Note that there is no epilogue and prologue at IR level :)
> But it does not work this time. I cannot get the return address.
> What is problem? How can I get the return address? Thank you!
What is the problem? It seems you're getting the return address via
2008 Mar 27
1
Commandline utility to edit ID3 tags?
Hi,
I'm running a webradio on our brandnew CentOS 5.1 database server. (The
main purpose of this radio is fun, sure, but it's also a bit like a
canary in a coalmine...) It's based on Icecast, MPD and NCMPC and works
great. I'm configuring the server remotely via SSH, no X.
Is there any commandline utility to edit ID3 tags?
Cheers,
Niki
2002 Jun 17
1
make_file() could ignore ENODEV errors (from afs filesystem)
Hi,
Would it be acceptable to patch make_file() in flist.c to ignore any
ENODEV's and not mark them as io_error=1?
In afs, a mountpoint to a volume which does not exist gives an
ENODEV. As such, it can't be copied, so should (or could) just be
ignored?
The io_error isn't terminal, but it does disable the delete function
and you end up with an exit code of 23.
regards
|<evin
2002 May 20
2
exit code 23 - inappropriate error for copying symlinks?
Hi,
I've just created a small directory as an example, it holds a file and
two symlinks that don't point to anything, and another symlink going
nowhere in a subdirectory.
rsync (2.5.5) is happy to copy these but produces an error. I can't
see why it considers this an error? It's not even aborting after it
first encounters this 'error'.
$ ls -lR /var/tmp/rsync.test
2005 May 13
2
SSHD Feature Request
With the increased number of "brute force" login attempts against port 22, I am concerned that an intruder may actually stumble accross a valid user/pass combination. To combat this, I would like to request an sshd_config option that would cause the running sshd parent process to keep track of login failures by IP address. If there are more than X number of login failures for a
2003 Sep 12
2
Transferring large files using rsync
I am running into an issue with rsync that I need some help with. When syncing
large files (e.g. 1GB), the rsync algorithm creates a temporary 1GB file and
then renames it when the transfer is finished. The issue I am running into is
if the two large files have very few differences between them, the bottleneck is
creating the 1GB temporary file on the target box. This process takes several