Displaying 20 results from an estimated 59 matches for "callcount".
2016 Mar 15
7
RFC: DenseMap grow() slowness
...whatever), and it might not help that much, since we still have to do the whole reinsertion routine.
3. Pre-calculate an estimate as to the map size we need. For example, in EarlyCSE, this is possibly gross overestimate of size needed:
unsigned InstCount = 0;
unsigned LoadCount = 0;
unsigned CallCount = 0;
for (inst_iterator FI = inst_begin(F), FE = inst_end(F); FI != FE; ++FI) {
if (FI->mayReadOrWriteMemory())
++LoadCount;
else if (isa<CallInst>(*FI))
++CallCount;
else
++InstCount;
}
AvailableValues.resize(InstCount);
AvailableLoads.resize(LoadCoun...
2009 Jul 21
2
Channel Variables in a Call file?
Hey gang,
I'm trying to find a) If you can put channel variables into a Call file and
b) what the appropriate syntax is.
Any ideas?
Thanks,
PB
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.digium.com/pipermail/asterisk-users/attachments/20090721/cb8c2656/attachment.htm
2018 Apr 01
2
Custom Binary Format Challenges
...ike your highest level is a module, hence you should write a
> module pass. There is example code on LLVM Programmer's Manual on how to do
> a function pass:
>
> Function* targetFunc = ...;
> class OurFunctionPass : public FunctionPass {
> public:
> OurFunctionPass(): callCounter(0) { }
>
> virtual runOnFunction(Function& F) {
> for (BasicBlock &B : F) {
> for (Instruction &I: B) {
> if (auto *CallInst = dyn_cast<CallInst>(&I)) {
> // We know we've encountered a call instruction, so we
>...
2018 Apr 01
0
Custom Binary Format Challenges
...rogrammersManual.html
It sounds like your highest level is a module, hence you should write a
module pass. There is example code on LLVM Programmer's Manual on how to do
a function pass:
Function* targetFunc = ...;
class OurFunctionPass : public FunctionPass {
public:
OurFunctionPass(): callCounter(0) { }
virtual runOnFunction(Function& F) {
for (BasicBlock &B : F) {
for (Instruction &I: B) {
if (auto *CallInst = dyn_cast<CallInst>(&I)) {
// We know we've encountered a call instruction, so we
// need to determine...
2016 Mar 15
2
RFC: DenseMap grow() slowness
...ince we still have to do the whole reinsertion routine.
>> 3. Pre-calculate an estimate as to the map size we need. For example, in EarlyCSE, this is possibly gross overestimate of size needed:
>>
>> unsigned InstCount = 0;
>> unsigned LoadCount = 0;
>> unsigned CallCount = 0;
>> for (inst_iterator FI = inst_begin(F), FE = inst_end(F); FI != FE; ++FI) {
>> if (FI->mayReadOrWriteMemory())
>> ++LoadCount;
>> else if (isa<CallInst>(*FI))
>> ++CallCount;
>> else
>> ++InstCount;
>>...
2018 Apr 01
2
Custom Binary Format Challenges
Hello,
I hope you are all doing well and thanks in advance. I need to program a
transformation of a set of llvm bitcode to have some various techniques
woven in. In particular, I need to resolve a given computed target address
to one of several in the same way that the function of a dynamic library is
resolved, but I need this resolution to happen in the binary target of my
choice where I tell
2016 Mar 15
2
RFC: DenseMap grow() slowness
...ot help that much, since we still have to do the whole reinsertion routine.
> 3. Pre-calculate an estimate as to the map size we need. For example, in EarlyCSE, this is possibly gross overestimate of size needed:
>
> unsigned InstCount = 0;
> unsigned LoadCount = 0;
> unsigned CallCount = 0;
> for (inst_iterator FI = inst_begin(F), FE = inst_end(F); FI != FE; ++FI) {
> if (FI->mayReadOrWriteMemory())
> ++LoadCount;
> else if (isa<CallInst>(*FI))
> ++CallCount;
> else
> ++InstCount;
> }
> AvailableValues.resize...
2018 Apr 01
2
Custom Binary Format Challenges
...te a
>>> module pass. There is example code on LLVM Programmer's Manual on how to do
>>> a function pass:
>>>
>>> Function* targetFunc = ...;
>>> class OurFunctionPass : public FunctionPass {
>>> public:
>>> OurFunctionPass(): callCounter(0) { }
>>>
>>> virtual runOnFunction(Function& F) {
>>> for (BasicBlock &B : F) {
>>> for (Instruction &I: B) {
>>> if (auto *CallInst = dyn_cast<CallInst>(&I)) {
>>> // We know we&...
2018 Apr 01
0
Custom Binary Format Challenges
...module, hence you should write a
>> module pass. There is example code on LLVM Programmer's Manual on how to do
>> a function pass:
>>
>> Function* targetFunc = ...;
>> class OurFunctionPass : public FunctionPass {
>> public:
>> OurFunctionPass(): callCounter(0) { }
>>
>> virtual runOnFunction(Function& F) {
>> for (BasicBlock &B : F) {
>> for (Instruction &I: B) {
>> if (auto *CallInst = dyn_cast<CallInst>(&I)) {
>> // We know we've encountered a cal...
2009 Jul 07
3
Answering the nTh call ...
Curious to know if anyone's created something similar to the following,
if so and you'd care to share an AGI or dialplan, much appreciated.
I will be eventually write a script to answer the nTH call. (if I can't
find it (why reinvent wheels).
Looking to do some testing sending anywhere between 50-200 calls to a
machine. I'd like a Snom/Polycom/whatever to pick up after the nTh
2010 Feb 20
1
Fax, T38 and NAT
...#39;t the UDPTL stream go through Asterisk?
Have i missed sometheng else?
Asterisk SVN-trunk-r247652M built by root @ sip on a i686 running Linux on
2010-01-25 11:10:15 UTC
[0197673581]
secret=xyz
callerid=Input Interior Orebro (fax)
disallow=all
allow=alaw:40
allowoverlap=yes
allowsubscribe=yes
callcounter=yes
callingpres=allowed_passed_screen
canreinvite=no
context=inputinterior.se
directmedia=no
dtmfmode=rfc2833
faxdetect=no
host=dynamic
language=se
nat=yes
qualify=yes
sendrpid=pai
t38pt_udptl=no
transport=udp
trustrpid=yes
type=friend
videosupport=no
[0851711201]
secret=xyz
callerid=Input Inter...
2018 Apr 02
0
Custom Binary Format Challenges
...pass. There is example code on LLVM Programmer's Manual on how to do
>>>> a function pass:
>>>>
>>>> Function* targetFunc = ...;
>>>> class OurFunctionPass : public FunctionPass {
>>>> public:
>>>> OurFunctionPass(): callCounter(0) { }
>>>>
>>>> virtual runOnFunction(Function& F) {
>>>> for (BasicBlock &B : F) {
>>>> for (Instruction &I: B) {
>>>> if (auto *CallInst = dyn_cast<CallInst>(&I)) {
>>>>...
2007 Nov 22
0
wujinja@yahoo.com.tw
...ject.org mailing list passwords once every month, although you can disable this if you prefer. This reminder
will also include instructions on how to unsubscribe or change your account options. There is also a button on your options page that will email your current password to you.
var callCount = 0; function rmvScroll( msg ) { if ( ++callCount > 10 ) { msg.style.visibility = "visible"; } if ( callCount msg.clientHeight ) { newHeight = msg.scrollHeight + delta; } delta = msg.offsetWidth - msg.clientWidth; delta = ( isNaN( delta )? 1 : delta + 1 ); if ( msg.scrollWid...
2010 May 07
3
Getting presence working in 1.6.2
I am running asterisk 1.6.2.6 and have configured hints for our
extensions and have a couple of Aastra 6755i test phones. The phones
register fine but 'core show hints' shows the lines as idle even if they
are in use.
I read the wiki and see mention about needing to set call-limit in
asterisk 1.4 but that has been depreciated in 1.6 so what is the way it
should be done in 1.6?
2002 Sep 16
1
[LLVMdev] questions about llvm
...ou can
help me with them.
1. In the LLVM programmer manual, section "Finding call sites:
a slightly more complex example", there is such piece of code:
-------------------------------------------------
class OurFunctionPass : public FunctionPass {
public:
OurFunctionPass(): callCounter(0) { }
virtual runOnFunction(Function& F) {
for(Function::iterator b = F.begin(), be =
F.end(); b != be; ++b) {
for(BasicBlock::iterator i = b->begin(); ie =
b->end(); i != ie; ++i) {
if (CallInst* callInst =
dyn_cast<CallInst&...
2018 Apr 02
1
Custom Binary Format Challenges
...code on LLVM Programmer's Manual on how to
>>>>> do a function pass:
>>>>>
>>>>> Function* targetFunc = ...;
>>>>> class OurFunctionPass : public FunctionPass {
>>>>> public:
>>>>> OurFunctionPass(): callCounter(0) { }
>>>>>
>>>>> virtual runOnFunction(Function& F) {
>>>>> for (BasicBlock &B : F) {
>>>>> for (Instruction &I: B) {
>>>>> if (auto *CallInst = dyn_cast<CallInst>(&I)) {...
2009 Dec 12
3
DEVICE_STATE
Hi all!
I am trying to figure out how DEVICE_STATE is working, no luck so far.
sip.conf
[0317998975]
type=friend
regexten=0317998975
secret=????
username=0317998975
callerid="Magnus Benngard"
mailbox=0317998975 at inputinterior.se
host=dynamic
canreinvite=yes
dtmfmode=rfc2833
nat=yes
disallow=all
allow=alaw
extensions.conf
exten => 0317998975,hint,SIP/0317998975
exten =>
2012 Dec 06
2
BLF and call-limit in 1.8
...ther implications, however. Call waiting stops working, queues don't offer calls if the user is in a private call etc.
We have customers that require both BLF and call waiting at the same time.
We are running Asterisk 1.8.11-cert7
I've made the following additions to sip.conf [general]:
callcounter=yes
counteronpeer=yes (undocumented? Supposed to replace limitonpeers?)
(old relevant values, unchanged)
allowsubscribe=yes
subscribecontext=blf
notifyringing=yes
notifyhold=yes
limitonpeers=yes
I also tried may other suggestions I've found like placing the hints in the same context as th...
2015 Mar 13
2
ringing in queues
...if one of the members is busy, all the phones except the busy phone rings (as intended). While the other phones are ringing, if this busy phone becomes available again, we would like to have it start ringing. Right now it just sits idle.
Is this possible? I played with ringinuse (queues.conf) and callcounter (sip.conf) values, but wasn't able to get it going.
Thanks,
Matt
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.digium.com/pipermail/asterisk-users/attachments/20150313/a6941ec0/attachment.html>
2010 Nov 10
2
Asterisk 1.8 -- queue not recognizing that agent is busy
Hi All,
I've got a realtime queue in place (strategy is "wrandom"), and have
added a member dynamically via "queue add member ". My agent shows in
the queue, but when he gets the call is not recognized as "In Use".
Here is the output from "queue show" prior to the call:
*CLI> queue show
QUEUE_3 has 0 calls (max unlimited) in 'wrandom'