search for: recursive

Hi all, Does anyone have a comprehensive list of recursive-type objects in R? is.recursive defines them as by exclusion: "most types of objects are regarded as recursive, except for vector types, ?NULL? and symbols (as given by ?as.name?)." I think this that means recursive objects are: * lists * pairlists * calls * expressions Did I miss...

Hi, I''m getting errors while live migrating a pv guest. I''m running Xen 3.4.3 on CentOS 5.5, DRBD 8.3.8.1 and OCFS2 1.4.7-1. The two servers are identical. After live migrating the Debian lenny PV guest(2.6.26-2-686-bigmem), it crashes, It prints this on console [ 502.689357] BUG: recent printk recursion! [ 502.689357] BUG: recent printk recursion! [ 502.689357] BUG: recent

I ran into a problem recently trying to update a package which uses S4 methods using a recent beta of R. I think I can reproduce it with a simple example. I have package called `testpkg' in directory testpkg/. In the R/ subdirectory of testpkg/ I have a file called testpkg.R which contains the following two lines: setClass("testpkg", representation(pts = "list"))

Hi all, I have two prodction servers with FreeBSD 5.4 (all security patches are applied). They running some services like dns, ssh, http, ftp, etc. But I woukd like to encrypt some services for some hosts with ipsec when it is accessed. For example: - DNS resolution: not encrypted. - DNS replication master-slave: encrypted by ipsec. - Telnet: encrypted by ipsec for some hosts. Deny

...and multiplication. > > Constant time, but not necessarily constant memory. > > Deep recursion will blow up your stack (AKA "segmentation fault" :-( ) > if the compiler could not optimize it (tail recursion optimization). Only if the recursion is very deep. In practice, a recursive descent parser isn't going to run out of stack space, nor will a quicksort or binary-tree walker, You're distracting this man from his job of learning how to program. Yes, it's a mistake to have a set of mutually recursive routines that chew up all your stack space; but it's a mis...

...cases, and no matter what arguments are passed to grid.ls. > library(grid) > grid.newpage() > grid.lines(name="foo") > grid.ls() foo > grid.remove("foo") > grid.ls() Error: evaluation nested too deeply: infinite recursion / options(expressions=)? > grid.ls(recursive=FALSE) Error: evaluation nested too deeply: infinite recursion / options(expressions=)? > str(grid.ls(print=FALSE)) Error: evaluation nested too deeply: infinite recursion / options(expressions=)? > traceback() ...etc... ...etc... ...etc... 13: gridList.default(X[[2L]], ...) 12: FUN(X[[2L]],...

...d Blaikie and others who might be interested on this Thank you very much! #1. Then I'd like to know, to make Clang/LLVM optimize a recursion into an iteration, how a recursion has to be implemented with any compiler option? (if the language is C/C++) Clang uses recursions, especially it uses recursive decent and operator-precedence parser. #2. I wonder if this kind of recursion is optimized to a iteration. Sorry my question is getting deeper. ^^; Thank you very much in advance Journeyer J. Joh 2012/10/3 David Blaikie <dblaikie at gmail.com>: > On Tue, Oct 2, 2012 at 11:44 PM, Jour...

Hi list, I have a simple question about LLVM. I learned that we need to use iterations than recursions in C programming. That is because recursion is expensive. It can easily consume out all the stack given to a program. And the call/return consumes time much more. But I've read a sentence that nowadays compilers can optimize recursions in C or whatever languages not to consume heavy stack

Hello, While auditing the NMI/MCE paths, I have encountered some issues with recursive locking in Xen, discovered by the misuse of the console_lock intermittently as a regular lock and as a recursive lock. The comment in spinlock.h is unclear as to whether mixing recursive and non recursive calls on the same spinlock is valid. If the calls are genuinely not valid, then surely regul...

Hi, I'm working on a project that will generate RAM matrices at random. What I want to do is to be able to automatically identify if the model is non-recursive. For example, the following RAM matrix has a non-recursive loop (going from A to B to C to A): n.recursive <- data.frame(matrix(c("A", "B", 1, "B", "C", 1, "C", "A", 1,...

In another thread recursive snapshot creation was found atomic so that it is done quickly, and more important, all at once or nothing at all. Do you know if recursive destroying and renaming of snapshots are atomic too? Regards Henrik Heino

...> recursions in C or whatever languages not to consume heavy stack and > call/return. > > I wonder what kind of optimization this is and if LLVM support this > kind of optimization. > > I am not a compiler expert. Please consider this. ^^; The short answer is: sometimes. Some recursive code may be transformed into something similar to a loop, but sometimes the compiler won't be able to figure it out & it'll remain recursive. - David

...ink if we are going to apply this optimization, we must make sure we aren't going to blow the stack. As users may already be just close enough to the max-stack boundary that their applications don't crash, I think we should aim as much as possible to keep the stack usage no higher than the recursive equivalent. Holding the "state" is the equivalent of a return address, so adding a stack link pointer would be the equivalent of a frame address I suppose... That could be acceptable? As I say, I haven't thought about the deep mechanics just yet. James On Thu Feb 05 2015 at 2:48:48...

Hi, The other day on IRC myself, Chandler, Hal and Pablo discussed recursive inlining. I've pondered a bit since then, and thought I'd get some background on the list with the aim of stimulating discussion. Our goal is to inline recursive functions. We have several workloads with recursive calls, and inlining them to a certain degree can improve performance by up t...

[..] drivers/video/fbdev/Kconfig:5:error: recursive dependency detected! For a resolution refer to Documentation/kbuild/kconfig-language.txt subsection "Kconfig recursive dependency limitations" drivers/video/fbdev/Kconfig:5: symbol FB is selected by DRM_KMS_FB_HELPER For a resolution refer to Documentation/kbuild/kconfig-language.txt subs...

> Only if the recursion is very deep. In practice, a recursive descent > parser isn't going to run out of stack space, nor will a quicksort or > binary-tree walker, The recursive-descent parser case has happened in practice: http://my.opera.com/hallvors/blog/2012/07/17/twitter-crashes-itself-with-commas?1 Also, I've seen some recursion-related...

We have NFS mounted drives. I first build an clang/llvm hosted compiler for Mips linux using the clang/llvm linux x86 compiler. Call this clang1. then in directory recurse on Mips host, I place this clang1 compiler and build clang2. then i rename recurse to recurse1 and create a new recurse directory. in recurse I copy clang2 from recurse1 to a recurse but name it clang1. then i build

See the code below. First, what are recursion limits in R. The function is stopping after 25 iterations for me. Is this general, or localized? Can recursion limits be changed? Second, which is generally more efficient, recursion or looping over a function? R 1.6.1 Windows 98 ----------------------------------------------------------- recurse<-function (n) { ifelse(n<50, {print(n);

Martin, Just a minor fix. Jie, Try the -r option (or the --recurse) option instead. It looks like the source changed to this: options.c: {"recurse", 'r', POPT_ARG_NONE, &recurse}, But the help is still at: options.c: rprintf(F," -r, --recursive recurse into directories\n"); eric Jie Gao wrote: > > rsync: --recursive: unknown option > rsync error: syntax or usage error (code 1) at main.c(739) > > The script: > > #! /bin/sh > /usr/local/bin/rsync --verbose --progress --stats --compress --rsh=...

...s of the directory-tree (e.g. first ~muchofileuser/muchofilesdir1 then ~muchofileuser/muchofilesdir2 and so on) and it works fine for me. So i tried to do this in a automatical way (e.g perl/shell/whatever script) but rsync is missing one feature for that: Limit the depth of recursion in "recursive"-Mode. So i wrote this ugly patch, that works-for-me(TM): diff -uNr rsync-2.5.6/flist.c rsync-2.5.6-patched/flist.c - --- rsync-2.5.6/flist.c Sat Jan 18 19:00:23 2003 +++ rsync-2.5.6-patched/flist.c Mon Jun 23 21:38:21 2003 @@ -41,6 +41,7 @@ extern int cvs_exclude; extern int recurse; +...