search for: pt1

for example /// getPointerUnionTypeNum - If the argument has type PT1* or PT2* return /// false or true respectively. template <typename PT1, typename PT2> static inline int getPointerUnionTypeNum(PT1 *P) { return 0; } template <typename PT1, typename PT2> static inline int getPointerUnionTypeNum(PT2 *P) { return 1; } template <typename PT1...

...rTraits>::getAddrOfPointer() const [with PointerTy = void*, unsigned int IntBits = 1u, IntType = bool, PtrTraits = llvm::PointerUnionUIntTraits<llvm::VNInfo*, llvm::SmallVector<llvm::VNInfo*, 4u>*>]’: /src/llvm-trunk-dev/include/llvm/ADT/PointerUnion.h:153: instantiated from ‘const PT1* llvm::PointerUnion<PT1, PT2>::getAddrOf() const [with T = llvm::VNInfo*, PT1 = llvm::VNInfo*, PT2 = llvm::SmallVector<llvm::VNInfo*, 4u>*]’ /src/llvm-trunk-dev/include/llvm/ADT/TinyPtrVector.h:63: instantiated from ‘const EltTy* llvm::TinyPtrVector<EltTy>::begin() const [with E...

I have the following (simple!?) problem which I am unable to find a relatively trivial solution to. If I have a dataframe, A 1 A 7 B 4 B 5 C 3 D 3 D 2 E 5 F 5 F 6 I would like to create a new data.frame in the form ID pt1 pt2 A 1 7 B 4 5 C 3 NA D 3 2 E 5 NA F 5 6 so that for each identifier, in this example, A...F I have a column for each observation for each identifier... (with a maximum of 2 obs per identifier, if only 1 obs exist then the second obs pt2 is set to...

https://bugzilla.samba.org/show_bug.cgi?id=2628 wayned@samba.org changed: What |Removed |Added ---------------------------------------------------------------------------- Summary|hangs indefinitely (while |hangs indefinitely at start |listing files) |of phase 1 ------- Additional Comments From wayned@samba.org

...U) const override > { > AliasAnalysis::getAnalysisUsage(AU); > } > > virtual AliasResult alias(const Location &LocA, const Location &LocB) override > { > const Value *V1 = LocA.Ptr; > const Value *V2 = LocB.Ptr; > > const PointerType *PT1 = dyn_cast<const PointerType>(V1->getType()); > const PointerType *PT2 = dyn_cast<const PointerType>(V2->getType()); > > // The logic here is very simple: pointers to two different address spaces > // cannot alias. > if (PT1 != nullptr && PT2...

...->x expression. If I fabricate a caller by stealing some code from your previous example, see bellow. I think these code & your previous example (about placement new) share the same std. I'm wondering if gcc can give a correct result. foo_caller() { T1 t1; T1 *pt1; T2 *pt2 = new (pt1) T2; foo(pt1, pt2); }

...because they *must* point to the same memory. For this specific case, I actually tried both g++ and gcc last night, there is no difference. I'm wondering why the "dynamic type" would help to make TBAA 100% safe and also helpful. Suppose point-to set for the two mem-access are pt1 and pt2, dyn-type1 = union-of-all-type-of-the-element-in-pt1, dyn-type2 = union-of-all-type-of-all-element-in-ptr2. If dyn-type1 and dyn-type2 are disjointed, then pt1 and pt2 must be disjoint, which means the point-to analysis already prove these two memory access are not alias. We don't ne...

...routines to handle the R objects, we'll call this: SEXP XtimesY(SEXP X,SEXP Y); // X*Y SEXP XminusY(SEXP X,SEXP Y); // X-Y SEXP tX(SEXP X); // X^T SEXP mycholinv(SEXP V); // Use cholesky decomposition for inverse Now, what I'm noticing is that if I call each routine individually such as: pt1=XtimesY(X,beta); // X*beta pt2=Xminus(Y,pt1); // Y-X*beta pt3=tX(pt2); // (Y-X*beta)^T pt4=mycholinv(V); //V^{-1} pt5=XtimesY(pt2,pt4); // (Y-X*beta)^T V^{-1} result=XtimesY(pt5,pt2); //(y-X*beta)^T V^{-1} (y-X*beta) Then the result is correct. But if instead I want to save some lines of code, an...

On Tue, Mar 12, 2013 at 11:59 PM, Shuxin Yang <shuxin.llvm at gmail.com> wrote: > I personally believe that in the context of type-based AA, correctness is a > subjective term:-). > > If the user smell something fishy, it is up to user to disable such opt, > there is no other > way around. TBAA is just to find the a sweet spot between precision & > safeness. Sorry,

On Wed, Mar 13, 2013 at 11:37 AM, Arnold Schwaighofer <aschwaighofer at apple.com> wrote: > > On Mar 13, 2013, at 1:07 PM, Shuxin Yang <shuxin.llvm at gmail.com> wrote: > >>> >>> The program I gave was well typed :) >> >> Hi, Daniel: >> Thank you for sharing your insight. I didn't realized it is well-typed -- I'm basically a big

Hello Group I have a Asterisk server running with 2 Digium T1 cards installed. 1 card connects to Telco via a PRI. The 2nd card is connected to a fax server via Digi DataFire RAS 24 PT1 Adapter (Digi0001). The idea is to have Asterisk route the calls based on DID or FAX tones. Everything is working great so far. The only problem is the Fax server does not see the DID. How can I tell if Asterisk it passing the DID and CallerID info to the server? I seen this was done with HylaFax....

I personally believe that in the context of type-based AA, correctness is a subjective term:-). If the user smell something fishy, it is up to user to disable such opt, there is no other way around. TBAA is just to find the a sweet spot between precision & safeness. Unfortunately, in the context of TBAA, precision & safeness usually come at each other's expense... It would be

...gence (7) crv5 function: crv5 <- function(t, R, exch, trans, trans2, Cd, const1, Cmin=340, Cb=325, A=16, V=8, Ci=93000, Cmin.new=NA) { #function for broken stick nls regression, which joins to the three #curves as a single function -- native emission rise and native+tracer gas emission rise pt1 <- exp(-(t*(0+const1*A+exch))/V)*(((Ci*0+const1*Cd*A+Cb*exch) *exp((t*(0+const1*A+exch))/V))/ (0+const1*A+exch)+((Cmin-Ci)*0+(const1*Cmin-const1*Cd)*A+(Cmin-Cb)*exch) /(0+const1*A+exch)) if(is.na(Cmin.new)){ Cmin.new <- exp(-(trans*(0+const1*A+exch))/V)*(((Ci*0+const1*Cd*A+Cb*exch)...

...es exactly what I want (except for the loops). My aim is to find the solution which minimises processing time. cheers Dave ## Basic paramters k1=3 k2=2 n=10 m1 = matrix (1:(n*k1), nrow=n, ncol=k1) m2 = matrix (1:(n*k2), nrow=n, ncol=k2) ## Approach 1: loop on k1 output1 = matrix(0,nrow=n,ncol=k2) pt1 = proc.time(for (i in 1:k1) output1 = output1 + m1[,i]*m2) ## Approach 2: loop on k2 output2 = matrix(0,nrow=n,ncol=k2) pt2 = proc.time(for (i in 1:k2) output2[,i] = rowSums( m1*m2[,i] )) ## Same result sum(output1-output2) -- David Pleydell Laboratoire de Biologie Environnementale USC INRA-EA...

I''ve been mostly lurking here with an occasional nuby question for a few weeks now. It seems like Ruby and Rails and the many libraries and tools growing up around it are a remarkable toolset. Unfortunately I''m finding the whole enchilada a bit daunting. It seems that if one is to truly tap into the power of this thing and do a significant amount of developing, one needs

...2_FLEXCOP_DEBUG=y # # Supported BT878 Adapters # CONFIG_DVB_BT8XX=m # # Supported Pluto2 Adapters # CONFIG_DVB_PLUTO2=m # # Supported SDMC DM1105 Adapters # CONFIG_DVB_DM1105=m # # Supported FireWire (IEEE 1394) Adapters # CONFIG_DVB_FIREDTV=m CONFIG_DVB_FIREDTV_INPUT=y # # Supported Earthsoft PT1 Adapters # CONFIG_DVB_PT1=m # # Supported Mantis Adapters # CONFIG_MANTIS_CORE=m CONFIG_DVB_MANTIS=m CONFIG_DVB_HOPPER=m # # Supported nGene Adapters # CONFIG_DVB_NGENE=m # # Supported ddbridge ('Octopus') Adapters # CONFIG_DVB_DDBRIDGE=m # # Supported DVB Frontends # CONFIG_DVB_FE_CUST...

...2_FLEXCOP_DEBUG=y # # Supported BT878 Adapters # CONFIG_DVB_BT8XX=m # # Supported Pluto2 Adapters # CONFIG_DVB_PLUTO2=m # # Supported SDMC DM1105 Adapters # CONFIG_DVB_DM1105=m # # Supported FireWire (IEEE 1394) Adapters # CONFIG_DVB_FIREDTV=m CONFIG_DVB_FIREDTV_INPUT=y # # Supported Earthsoft PT1 Adapters # CONFIG_DVB_PT1=m # # Supported Mantis Adapters # CONFIG_MANTIS_CORE=m CONFIG_DVB_MANTIS=m CONFIG_DVB_HOPPER=m # # Supported nGene Adapters # CONFIG_DVB_NGENE=m # # Supported ddbridge ('Octopus') Adapters # CONFIG_DVB_DDBRIDGE=m # # Supported DVB Frontends # CONFIG_DVB_FE_CUST...