search for: s1

Displaying 20 results from an estimated 1491 matches for "s1".

Did you mean: ts1
2016 Apr 29
2
[MemorySSA] Potential CachingMemorySSAWalker bug
...-- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20160429/f4c64f9b/attachment.html> -------------- next part -------------- ; opt -early-cse -S < LoadShorts-simple2.ll target triple = "aarch64--linux-gnu" %S1 = type { i32, i32, i16, i16, i8, i8 } define void @test() { entry: %call1 = call noalias i8* @malloc() %0 = bitcast i8* %call1 to %S1* %ui = getelementptr inbounds %S1, %S1* %0, i32 0, i32 0 store i32 undef, i32* %ui, align 4 %us = getelementptr inbounds %S1, %S1* %0, i32 0, i32 2 stor...
2013 Apr 11
4
How to determine why a server is not responding
...Suddenly, the server stops responding in all services (SSH, Apache, Postfix, ...) but ping works! After wait a few minutes (or 2 hours some times) the server continues unresponsive until we reboot. After reboot we search on /var/log/messages but cannot find useful information... Apr 11 14:56:05 s1 postfix/smtpd[8263]: SQL engine 'intentionally disabled' not supported Apr 11 14:56:05 s1 postfix/smtpd[8263]: auxpropfunc error no mechanism available Apr 11 14:56:42 s1 postfix/smtpd[8370]: SQL engine 'intentionally disabled' not supported Apr 11 14:56:42 s1 postfix/smtpd[8370]: a...
2010 Apr 20
1
[PATCH] nv30/exa : cleanup from nv40 exa
...SurfaceFormat[i]; + i++; } return NULL; @@ -123,106 +125,72 @@ NV30EXAHackupA8Shaders(ScrnInfoPtr pScrn) } } -/* should be in nouveau_reg.h at some point.. */ -#define NV34TCL_TX_SWIZZLE_UNIT_S0_X_ZERO 0 -#define NV34TCL_TX_SWIZZLE_UNIT_S0_X_ONE 1 -#define NV34TCL_TX_SWIZZLE_UNIT_S0_X_S1 2 - -#define NV34TCL_TX_SWIZZLE_UNIT_S0_X_SHIFT 14 -#define NV34TCL_TX_SWIZZLE_UNIT_S0_Y_SHIFT 12 -#define NV34TCL_TX_SWIZZLE_UNIT_S0_Z_SHIFT 10 -#define NV34TCL_TX_SWIZZLE_UNIT_S0_W_SHIFT 8 - -#define NV34TCL_TX_SWIZZLE_UNIT_S1_X_X 3 -#define NV34TCL_TX_SWIZZLE_UNIT_S1_X_Y 2 -#define NV34TC...
2011 May 19
2
trouble with summary tables with several variables using aggregate function
Dear all, I am having trouble creating summary tables using aggregate function. given the following table: Var1 Var2 Var3 dummy S1 T1 I 1 S1 T1 I 1 S1 T1 D 1 S1 T1 D 1 S1 T2 I 1 S1 T2 I 1 S1 T2 D 1 S1 T2 D 1 S2 T1 I 1 S2 T1...
2023 Aug 02
2
Configure DHCP to update DNS records problem
...ipt fail. Notes: 1. I've added a few additional logger lines for my own debugging sanity. 2. The DHCP server runs on a separate box from the AD DC server. 3. I'm using a user map entry to map the AD user 'dhcpduser' to the system user 'dhcpd'. Version info: root at S1:/etc/dhcp (master)# lsb_release -a No LSB modules are available. Distributor ID: Ubuntu Description: Ubuntu 14.04.6 LTS Release: 14.04 Codename: trusty root at S1:/etc/dhcp (master)# samba-tool -V 4.3.11-Ubuntu root at S1:/etc/dhcp (master)# /usr/sbin/dhcpd --version isc-dhcpd-4.2.4 Rel...
2007 Apr 11
0
Error with corCompSymm and lme fit for repeated measures
...etry correlation structure. This problem doesn't occur when using corAR1 or any of the other structures. I would greatly appreciate help on how to solve this issue. Here's my data, code lines, and error messages: > PhotoRed TreeID Block M D Time y 1 1 Dgl s1 0.5m june 2.91130232 2 1 Dgl s1 1.0m june 4.92232779 3 1 Dgl s1 2.5m june 6.17724409 4 1 Dgl s1 5.0m june 3.34278032 5 1 Dgl s1 0.5m july 6.30782170 6 1 Dgl s1 1.0m july 6.98652976 7 1 Dgl s1 2.5m july 8.80715989 8 1 Dgl s...
2004 Oct 12
5
[LLVMdev] set_intersect and Visual C compiler
...working together on this! :) > > > One thing that the compiler absolutely does not understand is the > > definition of set_intersect in include/llvm/ADT/SetOperations.h, and I > > am having a hard time understanding it myself. > > > > template <template<class S1ElTy> class S1Ty, class ETy, class S2Ty> > > void set_intersect(S1Ty<ETy> &S1, const S2Ty &S2) { > > for (typename S1Ty<ETy>::iterator I = S1.begin(); I != S1.end();) { > > const ETy &E = *I; > > ++I; > > if (!S2.count(E))...
2009 Oct 11
1
Solving a nonlinear System of equations
Hello there, I wish to solve the following nonlinear System of equations: + u1 - Vmax11*S1/(S1 + Km11 *(1 + S2/Km21)) - Vmax12*S1/( S1 + Km12 *(1+S2/Km22)) == 0 + u2 - Vmax22*S2/(S2 + Km22 *(1 + S1/Km12)) - Vmax21*S2/( S2 + Km21 *(1+S1/Km11)) == 0 + Vmax11*S1/(S1 + Km11 *(1 + S2/Km21)) + Vmax12*S1/( S1 + Km12 *(1+S2/Km22)) - d1*P1 == 0 + Vmax22*S2/(S2 + Km22 *(1 + S1/Km12)) + Vmax21*S2/...
2009 Jun 02
1
Difference between rsync -r S1 S2 T and cp -r S1 S2 T
The manual says rsync can be used as an improved cp command. If S1 and S2 are (local) source files or directories and T is an (local) existing directory, is it safe to think that $ rsync -r S1 S2 T does the same thing as $ cp -r S1 S2 T , assuming no trailing slashes in S1, S2? -- View this message in context: http://www.nabble.com/Difference-between-rsync--r-S1-...
1997 Jul 24
0
smbclient, tar, and exclude
...ew Thu Jul 24 13:58:29 1997 *************** *** 372,381 **** } /**************************************************************************** ! Compare two strings in a slash insensitive way ***************************************************************************/ ! int strslashcmp(char *s1,char *s2) { while(*s1 && *s2 && (*s1 == *s2 || tolower(*s1) == tolower(*s2) --- 372,386 ---- } /**************************************************************************** ! Compare two strings in a slash insensitive way, allowing s1 to match s2 ! if s1 is an &...
2005 Dec 01
2
Minimizing a Function with three Parameters
...# first equation l1 <- function(beta0,beta1,alpha,x) { n<-length(x) s2<-length(x) for(i in 1:n) { s2[i]<-log(beta0+beta1*i)-log(x[i]+beta0+beta1*i) } s2<-sum(s2) return((n/alpha)+s2) } # second equation l2 <- function(beta0,beta1,alpha,x) { n<-length(x) s1<-length(x) s2<-length(x) for(i in 1:n) { s1[i]<-1/(beta0+beta1*i) s2[i]<-1/(beta0+beta1*i+x[i]) } s1<-sum(s1) s2<-sum(s2) return(alpha*s1-(alpha+1)*s2) } #third equation l3 <- function(beta0,beta1,alpha,x) { n<-length(x) s1<-length(x) s2<...
2011 Mar 22
2
Infinite loop
...of its immediate neighbors. This is part of a larger program I am working on. The following code works well about 65 % of the time (14/40). The problem I encounter happens when the last element remaining to be sampled from the vector STRATA is within 7 digits +- of the last element in the vector s1, at which point an infinite loop occurs. At least that's what I think is happening. Any help would be greatly appreciated. Thank you, Mike require(IRanges) STRATA <- 1:40 s1 <- sample(STRATA, 1) for (i in seq(from = 1, to = 39, by = 1)){ repeat{ tmp <- sample(STRATA, 1)...
2007 Sep 28
2
Problem with hard links
Hello, I have a problem with rsync and hard links : I have 1 folder : P, with 2 subfolders : S1 and S2 S2 contains a lot of hard links to file stored in folder S1. P : -S1 -S2 (S2 files hard links to S1 files) I would like to rsync the folder P to another computer, but each sub folder S1 (110 Go) and S2 (10 Go + hard link to 100 Go of S1) contains thousands of thousands...
2004 Oct 12
3
[LLVMdev] set_intersect and Visual C compiler
..., with help from Paolo and have started to work on fixing some of the problems. One thing that the compiler absolutely does not understand is the definition of set_intersect in include/llvm/ADT/SetOperations.h, and I am having a hard time understanding it myself. template <template<class S1ElTy> class S1Ty, class ETy, class S2Ty> void set_intersect(S1Ty<ETy> &S1, const S2Ty &S2) { for (typename S1Ty<ETy>::iterator I = S1.begin(); I != S1.end();) { const ETy &E = *I; ++I; if (!S2.count(E)) S1.erase(E); // Erase element if not in S2 }...
2012 Nov 01
2
[LLVMdev] llvm linking issue
I have three modules: ----------------------------------------------------------------- s1.ll: %0 = type <{ i32, i32 }> define void @s1(%0* byval %myStruct) nounwind { return: ret void } ----------------------------------------------------------------- s2.ll: %0 = type <{ i32, i32 }> define void @s2(%0* byval %myStruct) nounwind { return: ret void } ------------------...
2023 Aug 02
1
Configure DHCP to update DNS records problem
...#39;ve added a few additional logger lines for my own debugging sanity. > 2. The DHCP server runs on a separate box from the AD DC server. > 3. I'm using a user map entry to map the AD user 'dhcpduser' to the system user 'dhcpd'. > > Version info: > > root at S1:/etc/dhcp (master)# lsb_release -a > No LSB modules are available. > Distributor ID: Ubuntu > Description: Ubuntu 14.04.6 LTS > Release: 14.04 > Codename: trusty > root at S1:/etc/dhcp (master)# samba-tool -V > 4.3.11-Ubuntu > root at S1:/etc/dhcp (master)# /usr/sbin/dhcpd -...
2012 Feb 23
1
[LLVMdev] Simple question on sign
...the PatFrags described and the LoadExtType enum defined, and the use of zext and sext to differentiate what containers the values are being loaded into in the IR. Basically I'm trying to describe patterns for automatically selecting between various multiplication instructions: #define MULL(t,s1,s2) t = (s1) * INT16(s2) #define MULLU(t,s1,s2) t = (s1) * UINT16(s2) #define MULH(t,s1,s2) t = (s1) * INT16((s2) >> 16) #define MULHU(t,s1,s2) t = (s1) * UINT16((s2) >> 16) #define MULHS(t,s1,s2) t = ((s1) * UINT16((s2) >> 16)) << 16 #define MULLL(t,s1,s2) t = INT16(s1) *...
2004 Oct 13
0
[LLVMdev] set_intersect and Visual C compiler
Both are working well on VC. Just tested. template<class STy> void set_intersect(STy &S1, const STy &S2) { for(STy::iterator I = S1.begin(), E = S1.end(); I != E; ) if (S2.count(*I)) S1.erase(*I++); else ++I; } template <class S1Ty, class S2Ty> void set_intersect(S1Ty &S1, const S2Ty &S2) { for (typename S1Ty::iterator I = S1.begin(); I != S1...
2004 Oct 12
0
[LLVMdev] set_intersect and Visual C compiler
...t, I'm glad we're all working together on this! :) > One thing that the compiler absolutely does not understand is the > definition of set_intersect in include/llvm/ADT/SetOperations.h, and I > am having a hard time understanding it myself. > > template <template<class S1ElTy> class S1Ty, class ETy, class S2Ty> > void set_intersect(S1Ty<ETy> &S1, const S2Ty &S2) { > for (typename S1Ty<ETy>::iterator I = S1.begin(); I != S1.end();) { > const ETy &E = *I; > ++I; > if (!S2.count(E)) S1.erase(E); // Erase...
2019 Sep 27
4
Dealing with boolean values in GlobalISel
Hi, I’ve been thinking about what the strategy to use for boolean values in GlobalISel. There are a few semantic and mechanical issues I’ve encountered. For background, on AMDGPU, there are two kinds of bool/s1 values. Contextually, a real boolean value will either be a 1-bit scalar condition (in a non-allocatable physical condition register, which will need to be copied to an allocatable class 32-bit vreg during selection), or a vector condition where the s1 will really be a lane mask of results in a 32...