Displaying 5 results from an estimated 5 matches for "valueless".
Did you mean:
clueless
2010 Jun 08
1
[LLVMdev] the PartialSpecialization pass (was Re: Is there a "callback optimization"?)
...lable from other passes.
2) To separate methods discovering interests.
Various (optional) heuristics would be helpful.
Also I will help to contribute above someday.
I had been afraid to read the discussion
http://llvm.org/bugs/show_bug.cgi?id=3757
I was doubtful then whether the patch might be valueless and useless :p
arigato gozaimasu, Takumi
2010/6/5 Kenneth Uildriks <kennethuil at gmail.com>:
> Applied, with minor changes:
>
> 1. deleted[std:distance(as, ai)] creates a map entry (with a null
> value if the operator[] is not the left-hand-side of an assignment
> statemen...
2002 Nov 01
0
The split access puzzled me
..., the IP package which
source address is $IP1 will be passed to table T1. Such packages, only
generating by that linux router itself, are independent of local network
behind the linux box.
So, any IP packages from anywhere (except linux router itself) will bypass
table T1. For them the table T1 is valueless. T2 is similar.
As the HOWTO said, the target is "route answers to packets coming in over a
particular provider, say Provider 1, backup out again over that same
provide." For this, I believe the correct one is:
ip rule add $P1_NET via IP1 dev $IF1
and a rule/table (and the others) is u...
2004 Jan 18
2
Re: ultra-cheap asterisk box -> Small Biz Robust Asterisk Solution - SBRAS
...g a server yourself is only cheaper if you =
> don't
> value your own time.=20
>
> Your cost calculation also assumes the server won't ever break. The =
> first
> time you have to fix your home-brew box the cost difference
> disappears. =
> Even
> if your time is valueless, buying a new part will eliminate any cost
> difference.=20
>
> Even when buying an industrial strength server from a reputable
> manufacturer, I always stock a spare server with the identical =
> configuration
> in case something goes wrong. I also keep spare interface boards =
&...
2010 Jun 05
0
[LLVMdev] the PartialSpecialization pass (was Re: Is there a "callback optimization"?)
Applied, with minor changes:
1. deleted[std:distance(as, ai)] creates a map entry (with a null
value if the operator[] is not the left-hand-side of an assignment
statement) if one doesn't already exist. deleted->find returns
deleted.end() if the entry doesn't exist and doesn't change the map.
2. Included a comment to make it easy to find the spot where the
callsite is checked
2010 Jun 04
2
[LLVMdev] the PartialSpecialization pass (was Re: Is there a "callback optimization"?)
Good morning, Kenneth
FYI,
Here is my patch for lib/Transforms/IPO/PartialSpecialization.cpp.
It works with my several applications but it is not widely tested.
The pass had a critical bug, ... when a specialized function is created,
all callers are modified. Even if a caller is not needed, to be malformed.
My fix includes to examine each of callers to be modified.
See also the discussion;