search for: reachables

My Valgrind doesn't run, saying it doesn't support showing more than 50 entries of a stack trace --- test/test_bins.sh | 4 ++-- test/test_flac.sh | 8 ++++---- test/test_grabbag.sh | 8 ++++---- test/test_libFLAC++.sh | 2 +- test/test_libFLAC.sh | 2 +- test/test_metaflac.sh | 12 ++++++------ test/test_seeking.sh | 12 ++++++------

Hello list, I have nat=no and qualify=no in my sip peer definition and still my CLI is flooded with : [Mar 12 10:17:26] NOTICE[20278]: chan_sip.c:12985 handle_response_peerpoke: Peer 'mysippeer' is now Reachable. (30ms / 2000ms) [Mar 12 10:17:26] NOTICE[20278]: chan_sip.c:12985 handle_response_peerpoke: Peer 'mysippeer' is now Reachable. (24ms / 2000ms) [Mar 12 10:17:26]

Hello. I found that anonymous structures does not work on gcc-2.95. If you guys want to support a bit older platforms I suggest fixing it. You can check out patch I created to fix this issue. I just added 2 extra structures to remove anonymous structs inside connection_status_t and node_status_t. Patch is here: ftp://borg.uu3.net/pub/unix/tinc/tinc.patch Attaching it as well. Regards, Borg

Hello my friends, My asterisk is going down randomly, following you will find some errors that i could see in the /var/log/asterisk/message at the moment of the crash: [Feb 5 10:32:45] WARNING[6519] chan_sip.c: Maximum retries exceeded on transmission 1850202354 at 10.4.1.152 for seqno 21 (Critical Response) [Feb 5 10:32:45] WARNING[6519] chan_sip.c: Hanging up call 1850202354 at 10.4.1.152 -

All, I have an issue with IAX that I can't comprehend. Approximately every eight minutes my servers go unreachable. They stay unreachable for exactly 10ms. I have two servers running IAX and it happens on both servers simultaneously. I have searched the archives and see similar issues, but not the exact same one. I am on the current CVS stable version of *. Also, during IAX calls,

Dear All, I am new to LLVM and want to know if LLVM provides any reachability information about the instructions inside a function? For example, is instruction 'J' reachable from the instruction 'I'? (just based on CFG) Thanks a lot, ::Saman -------------- next part -------------- An HTML attachment was scrubbed... URL:

Hi again! About my previous E-Mail... I though about it and I think, that maybe I'm just very stupid... Since I called an INTERNAL number, Asterisk tried to call it. I tried right now to call an EXTERNAL number (using my context [myproxy]) and the behavior is NOT the same... Not 100% correct, but it tries the right way... Now my problem is to check in my dialplan if the peer, that

Does anyone know what happens if you try to have 5 concurrent outgoing channels with VoicePulse Connect? Does it give you an error message or a reorder or something? I'm worried about using them as my primary carrier if this is the case. I noticed that they supposedly only allow 4 channels for free and then you have to pay $20 a month extra per channel. I'm guessing this is for inbound

On Wed, Mar 30, 2011 at 11:35 PM, Eli Friedman <eli.friedman at gmail.com> wrote: > On Wed, Mar 30, 2011 at 10:14 AM, Jimborean Alexandra > <xinfinity_a at yahoo.com> wrote: >> Hi, >> >> Is there any method to check if there is a path in the CFG from block M to >> block N, but M does not necessarily dominate block N? >> In other words, if N is

hi folks. we recently deployed 10 Cisco 7960G w/ SIP firmware 7.3 on our network and we start having problems of dropping calls (actually the calls wasn't dropped it just the sound was muted for about 5-10 seconds, but most users will think the call dropped and hangup/redial). i've check the console output. there was a lot of messages like the following: Sep 28 15:00:49 NOTICE[8182]:

Thanks. that's right but I was looking for sth like "successor closure" set for each instruction 'I' that includes all reachable instructions from I. Does LLVM provide such a set? Thanks alot, ::Saman Dear All, > >I am new to LLVM and want to know if LLVM provides any reachability information about the instructions inside a function? For example, is instruction

On Jul 27, 2009, at 5:05 AM, Saman Zonouz wrote: > Dear All, > > I am new to LLVM and want to know if LLVM provides any reachability > information about the instructions inside a function? For example, > is instruction 'J' reachable from the instruction 'I'? (just based > on CFG) You can just do a depth first search on the cfg? -Chris -------------- next

Hi, Is there any method to check if there is a path in the CFG from block M to block N, but M does not necessarily dominate block N? In other words, if N is reachable from M. Thanks, Alexandra -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110330/7d533e42/attachment.html>

I have logs full with this messages... I must have qualify turned on, because phone is behind firewall, main problem si, that phone is each hour about one hour unavailable! :'( I tried to modify minexpiry/maxexpiry sip.conf timeouts, but nothing help me. I'm using latest firmware 8.4 in phone, will be better to downgrade? to what version? (latest asterisk 1.4branch) [Dec 7 00:36:56]

Hi all, I have an issue with asterisk 13 and pjsip. I guess it is somehow Firewall related, but I'm unsure. A registration to Sipgate is established successfully: <Registration/ServerURI..............................> <Auth..........> <Status.......> ==========================================================================================

Hello tinc users, i have the follow configuration: 1 client/server called master, it is always reachable from internet (with dyndns) 5 clients, that connects to the master and the other clients (all behind a router (NAT)) master-hosts-file: Address = ... Port = ... Subnet = ... Compression = 0 ---- key ----- client-hosts-files: Compression = 0 Subnet = ... ----- key ----- tinc.conf Name = ....

Asterisk Users, I am running Asterisk 1.2.13 on Debian Etch with McLeodUSA's T1 service. I have two Netgear switches on my T1 router, one for VOIP and another for data. I use a gigabit switch for all VOIP and a regular 10/100Mbps switch for all data. This morning I saw this message a few times on the Asterisk command line. The lagged cause garbled phone calls. Is my network to

<just want to focus on these parts for a second. *All* of these representations are really access path representations, just encoded slightly different ways, and, as a result, with various parts of the rules in slightly different places> Imagine that we took the enhancement we previously discussed, but instead > of implementing it directly, we just directly encoded for every access the

Good day to all-- First off let me say that I have been very pleased with the mailing list. I have learned a ton of stuff just reading other peoples questions and comments. I really enjoyed the VOIP Conference call on Friday morning. Still working on figuring out the best approach to custom voicemail emails (the reason I joined this group); however, we have more pressing issues. I

On Wed, Mar 30, 2011 at 10:14 AM, Jimborean Alexandra <xinfinity_a at yahoo.com> wrote: > Hi, > > Is there any method to check if there is a path in the CFG from block M to > block N, but M does not necessarily dominate block N? > In other words, if N is reachable from M. I don't think there's any method built in to LLVM. It's pretty easy to write, though. -Eli