search for: stmt

Dear list, I need to read in a big table with 487 columns and 238,305 rows (row names and column names are supplied). Is there a code to read in the table in a fast way? I tried the read.table() but it seems that it takes forever :( Thanks a lot! Best, Allen

...us, e.g. enabled or removed - * Other methods are optional: - * _PS0/3: put them here for debug purpose * * Eject button would generate a general-purpose event, then the * control method for this event uses Notify() to inform OSPM which @@ -344,13 +342,6 @@ stmt("Name", "_ADR, 0x%08x", ((slot & ~7) << 13) | (slot & 7)); /* _SUN == dev */ stmt("Name", "_SUN, 0x%08x", slot >> 3); - push_block("Method", "_PS0, 0"); - stmt("Store...

​Hi all, I am using llvmlite for pyvex and I want the output of my code (which is written based on llvmlite) to be like pyvex. In pyvex, (https://github.com/angr/pyvex). Considering pyvex, I tried to implement the following statements in pyvex to llvmlite: for stmt in irsb.statements: if isinstance(stmt, pyvex.IRStmt.Store): print "ST%s(%s) = %s" % (self.endness[-2:].lower(), self.addr, self.data) (which gets the data in a register and store it in another register) I translate it in llvmlite as follows: from ctypes import CFUNCTYPE, c_intimp...

def self.up execute("delimiter ^ ") sql = <<-_SQL CREATE TRIGGER customer_bi BEFORE INSERT ON customers FOR EACH ROW BEGIN SET NEW.sndx = SOUNDEX(NEW.lname) ; END ^ _SQL sql.split(''^'').each do |stmt| execute(stmt) if (stmt.strip! && stmt.length > 0) end execute("delimiter ; ") end Blows up with this message: Mysql::Error: You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near...

...ttps://reviews.llvm.org/D80947, which was then committed after significant time on llvm-commits. I would like to encourage the list via discussion and further reviews/commits to come to a consensus on what we actually MEAN by this rule. For example, a recent comment points out that : If (cond) Stmt; else if (cond) Stmt; else { Stmt; Stmt; } Should require braces on all of the conditions! However, we are extraordinarily inconsistent here. My wish is for us to become more consistent, so I would like us to use this thread to organize our collective thoughts on figuring out what the rule...

Patches 1 & 2 were posted previously here: https://www.redhat.com/archives/libguestfs/2016-May/msg00134.html Patch 3 is a hack so I can test this using my own version of qemu (the `-L ?' stuff is not upstream). Patch 4 is where the real action takes place: Replace the caching of qemu features in blob-like files with a sqlite database. Probably the best way to approach this patch is to

...e server. I would like the local dataframe have the same name as the source SAS dataset, and the function below is what I am developing. However, the "substitute(table)" on the left side of the assignment generates the error "Error in substitute(table) <<- sqlQuery(sears, sql.stmt) : could not find function "substitute<-". Thanks in advance MakeDF <- function(table) #------------------------------------------------------------ # Function makes dataframe from UNIX SAS datasets #------------------------------------------------------------ { st.time <-...

...is fails to build: make all-recursive make[1]: Entering directory '/root/tmp/nftables-0.7' Making all in src make[2]: Entering directory '/root/tmp/nftables-0.7/src' make all-am make[3]: Entering directory '/root/tmp/nftables-0.7/src' CC xt.o xt.c: In function ‘xt_stmt_xlate’: xt.c:31:24: warning: implicit declaration of function ‘xt_xlate_alloc’ [-Wimplicit-function-declaration] struct xt_xlate *xl = xt_xlate_alloc(10240); ^ xt.c:31:24: warning: initialization makes pointer from integer without a cast [-Wint-conversion] xt.c:37:28: erro...

...s automatically added on declaration) > o *[_|_|X] automatic static assert *- is adding the static assert needs to be manually or is it done automatically with the declaration of the new bitfield. This is not actually true. There is only a single static_assert for the size of the union in Stmt [1] and the same could be done for the union in DeclBase. > * *[_|_|X] runtime assert* - that a new value set, fits into the the bitfield (without truncation). This is true, I agree here that this is useful. > * *[_|_|X] typed* - as opposed to using a representative type (like `int`) a...

Dear All, I have a question How could I use WhileStmt class in Stmt.h http://clang.llvm.org/doxygen/Stmt_8h_source.html to implement while loop like while(i==1){} that is required to be inserted For example, Convert x++; y++; to x++; while(i=1){} y++; from the class's constructor: WhileStmt(ASTContext &C, VarDecl *Var, Expr *cond, Stmt *b...

Hi @llvm, below is a copy of a message I sent to clang a hour before. I guess it's more appropriate here. --snip-- While trying to eleminate as much std::tr1::function as possible I stumbled over a design flaw in llvm::df_iterator. Consider the following code: void for_all_stmts(Stmt* S, const std::tr1::function<void(Stmt*)>& fn) { if (S) { fn(S); for (Stmt::child_iterator i = S->child_begin(), e = S->child_end(); i != e; ++i) { for_all_stmts(*i, fn); } } } In a first step I want to replace this with: void for_all_stmts(Stmt*...

...commits. >> >> >> >> I would like to encourage the list via discussion and further reviews/commits to come to a consensus on what we actually MEAN by this rule. For example, a recent comment points out that : >> >> >> >> If (cond) >> >> Stmt; >> >> else if (cond) >> >> Stmt; >> >> else { >> >> Stmt; >> >> Stmt; >> >> } >> >> >> >> Should require braces on all of the conditions! However, we are extraordinarily inconsistent here. My wi...

...we > > tell whether the vectorized version we might now create will be > > executed (based on having profiling data from a run where the > > compiler might have previously made a similar choice)? > > For example, for the following loop: > for (i = 0; i < N; i++) > stmt; > After many loop optimizations it could become something like: > if (vectorized1) > for (i = 0;.....) > stmt; //uid: 1 > else if (vectorized2) > for (i = 0;.....) > stmt; //uid: 2 > else if (unrolled) > for (i = 0; i < N & (~0x3) i += 4) > stmt; stmt; stmt;...

...D10} c={MD20} Here MD10, MD20 are general MD. They described the actually variable. b.union(c) equal to {MD10, MD20} a.union(b)  equal to {MD1} b.union(a) equal to {MD1} Our flow-sensitive method is divided into 2 step: 1. Iterative solve flow-equation to compute POINT-TO for each stmt. 2. According to POINT-TO info, compute MayDef BITSET and MayUse BITSET for each stmt. So, I have an question, after step 2 each stmt should own two BITSETs to record MayDef and MayUse. Is that right or necessary?  How to describe both MayDef, MayUse info if just have a single BITSET in each stmt...

...was then committed after > significant time on llvm-commits. > > I would like to encourage the list via discussion and further > reviews/commits to come to a consensus on what we actually MEAN by this > rule. For example, a recent comment points out that : > > If (cond) > Stmt; > else if (cond) > Stmt; > else { > Stmt; > Stmt; > } > > Should require braces on all of the conditions! However, we are > extraordinarily inconsistent here. My wish is for us to become more > consistent, so I would like us to use this thread to organize our...

...clang::CodeGen::CodeGenFunction::EmitScalarExpr(clang::Expr const*, bool) + 96 13 clang 0x0000000000847a27 clang::CodeGen::CodeGenFunction::EmitAnyExpr(clang::Expr const*, clang::CodeGen::AggValueSlot, bool) + 247 14 clang 0x00000000008e6948 clang::CodeGen::CodeGenFunction::EmitStmt(clang::Stmt const*) + 712 15 clang 0x00000000008e9e40 clang::CodeGen::CodeGenFunction::EmitCompoundStmt(clang::CompoundStmt const&, bool, clang::CodeGen::AggValueSlot) + 272 16 clang 0x00000000008ea0ff clang::CodeGen::CodeGenFunction::EmitSimpleStmt(clang::Stmt const*) + 271...

----- Original Message ----- > From: "Dehao Chen" <dehao at google.com> > To: "Hal Finkel" <hfinkel at anl.gov> > Cc: "Xinliang David Li" <davidxl at google.com>, "llvm-dev" > <llvm-dev at lists.llvm.org> > Sent: Tuesday, November 1, 2016 11:43:41 AM > Subject: Re: [llvm-dev] (RFC) Encoding code duplication factor

...s in the hands of the actual class needing them. And > these are all restricted hierarchically by the superclasses of that class. > > I spent some time packing various bits of data into bit-fields in clang. > My experience > is that the solution in clang actually works just fine. The Stmt hierarchy > has a huge > number of bit-field classes (I count more than 40! [1]), but because the > offsets are > relative adding a bit means only adding one to an enum value a few lines > below > (a static_assert then checks that the union is not too large). > > [1] > ht...

Can you compare ReST to docbook? We've talked about using docbook for a long time. What are the pros and cons of each? Thanks, Tanya On Dec 9, 2008, at 7:56 AM, Mikhail Glushenkov wrote: > [Chris asked me to bring this up on the mailing list some time > ago, but I couldn't get to it. Sorry for that.] > > Since the beginning, I used ReST [1] for documenting llvmc, instead

...variable. > > b.union(c) equal to {MD10, MD20} > a.union(b) equal to {MD1} > b.union(a) equal to {MD1} > > Our flow-sensitive method is divided into 2 step: > 1. Iterative solve flow-equation to compute POINT-TO for each stmt. > 2. According to POINT-TO info, compute MayDef BITSET and MayUse BITSET for each stmt. > > So, I have an question, after step 2 each stmt should own two BITSETs to record MayDef and MayUse. > Is that right or necessary? It's fine, it's not strictly necessary, but it...