search for: sccs

Hello, Any help on the following issue will be appreciated. How do I delete files or directories in my first level of directory that is specified as host. Here is an example : rsync -avz --delete ${SOURCE_HOST}:/mlinkfam/extract/sccs/pa/* /mlinkfam/extract/sccs/pa Giving above command I find redundant files or directory not getting deleted from the first level of target directory /mlinkfam/extract/sccs/pa. However, files or directories do get deleted from subdirectories /mlinkfam/extract/sccs/pa/qa or /mlinkfam/extract/sccs/...

Hello, Has anyone written R functions for applying self-controlled case series methods (http://statistics.open.ac.uk/sccs/). In fact only thing needed is to modify glm function to allow absorption of effect. Eg. in Poisson model individual effect is used as factor, but it is considered as nuisance term where parameter estimates are not needed. Could anyone point how absorbing individual effect could be carried out...

I have a FunctionPass F that needs a list of all the SCCs for use in its doFinalization() method. Let's say I write a CallGraphSCCPass C that creates an array of all SCCs. Let C be required by F, and let F call getAnalysis<C>() from its doFinalization() method. Am I guaranteed that C's runOnSCC() method will have executed on all SCCs...

Hi Ryan, On 9/29/06, Ryan M. Lefever <lefever at crhc.uiuc.edu> wrote: > I have a FunctionPass F that needs a list of all the SCCs for use in its > doFinalization() method. Let's say I write a CallGraphSCCPass C that > creates an array of all SCCs. Let C be required by F, and let F call > getAnalysis<C>() from its doFinalization() method. Am I guaranteed that > C's runOnSCC() method will have execu...

Hello, I'm writing a Function Pass. This function pass needs access to the CallGraph and CallGraph SCCs. Is there any way I can get CallGraph information without changing my pass to a CallGraphSCCPass ? Thanks, -- Nick Johnson

On 5/10/09, Török Edwin <edwintorok at gmail.com> wrote: > On 2009-05-10 20:11, Nick Johnson wrote: > > Hello, > > > > I'm writing a Function Pass. This function pass needs access to the > > CallGraph and CallGraph SCCs. Is there any way I can get CallGraph > > information without changing my pass to a CallGraphSCCPass ? > > > Does getAnalysis<CallGraph>() work? > AFAIK, it's not a pass. > But I'm not sure if using a FunctionPass to access Callgraph data is a > good idea,...

Hey all, I'm working on adding function attribute propagation to function summaries in the ThinLTO index, and have run into some trouble with ensuring bottom-up traversal when finding the SCCs in the call graph. I'm basing my implementation for the GraphTraits for the ModuleSummaryIndex off the GraphTraits<CallGraph *> implementation ( http://llvm-cs.pcc.me.uk/include/llvm/Analysis/CallGraph.h#407). In the GraphTrait<CallGraph *> definition, the getEntryNode function ret...

On 2009-05-10 20:11, Nick Johnson wrote: > Hello, > > I'm writing a Function Pass. This function pass needs access to the > CallGraph and CallGraph SCCs. Is there any way I can get CallGraph > information without changing my pass to a CallGraphSCCPass ? Does getAnalysis<CallGraph>() work? But I'm not sure if using a FunctionPass to access Callgraph data is a good idea, transformations can change it (for example dead code elimination...

...on wrote: > On 5/10/09, Török Edwin <edwintorok at gmail.com> wrote: > >> On 2009-05-10 20:11, Nick Johnson wrote: >> > Hello, >> > >> > I'm writing a Function Pass. This function pass needs access to the >> > CallGraph and CallGraph SCCs. Is there any way I can get CallGraph >> > information without changing my pass to a CallGraphSCCPass ? >> >> >> Does getAnalysis<CallGraph>() work? >> >> > AFAIK, it's not a pass. > > It is, see lib/Analysis/IPA/CallGraph.cpp: s...

>>> Does getAnalysis<CallGraph>() work? Thanks Edwin, that works! What about the CallGraphSCC ? It looks like one can declare a CallGraphSCCPass, but I don't see any other way to get the SCCs of the call graph. -- Nick Johnson

Is there a way in LLVM , using which I can get Call graph SCCs in reverse post order in a FunctionPass object? -Balpreet -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20060501/f34b3700/attachment.html>

...SimplifyCFG is my guess, but I haven't confirmed - had taken something representable as a Loop and converted into a non-Loop SCC. This seems unfortunate and raises a general issue with how we model and canonicalize loops. Long term, I see a couple of options: 1) Introduce a new notion for SCCs in the CFG, and rephrase select optimizations like LICM over them. A Loop then becomes a particular special case of our more generic SCC concept. 2) Avoid breaking loops until some point late in the optimizer. Essentially, we designate the Loop representable form as being canonical and then lo...

...ndencies. Being so, DSWP have a more widely application scope than other automatic parallelizing techniques such as DOALL and Vectorization. The DSWP algorithm is shown below and a detailed description follows. %%%%%%%% DSWP Algorithm %%%%%%%%%%%% DSWP_Procedure(L) G = build_dependence_graph(L); SCCs = find_SCCs(G) If (|SCCs| == 1) return ; EndIf DAG_SCC = coalesce_SCCs(G, SCCs) P = TPP_algorithm(DAG_SCC, L) If (|P| == 1) return ; EndIf split_code_into_loops(L, P) insert_necessary_flows(L,P) EndProcedure %%%%%%%% DSWP Algorithm %%%%%%%%%%%% This procedure receive as input the loop...

Hi, I am using the scc_iterator class in my code on a CallGraph, where some functions are not called from within the module. It seems that scc_iterator does not list all SCCs if the graph is not connected; only those nodes connected to the node pointed to by GraphTraits<...>::getEntryNode() are returned. Can someone verify this behavior? Any tips on how I should go about extending the class in order to visit all SCCs? Is it desirable to augment the scc_iterato...

>From the fedora 19 host: [root@fedora ~]# sg_inq /dev/sdc standard INQUIRY: PQual=0 Device_type=0 RMB=0 version=0x05 [SPC-3] [AERC=0] [TrmTsk=0] NormACA=0 HiSUP=0 Resp_data_format=0 SCCS=1 ACC=0 TPGS=1 3PC=0 Protect=0 [BQue=0] EncServ=0 MultiP=0 [MChngr=0] [ACKREQQ=0] Addr16=0 [RelAdr=0] WBus16=1 Sync=1 Linked=0 [TranDis=0] CmdQue=1 length=36 (0x24) Peripheral device type: disk Vendor identification: MacroSAN Product identification: LU Product revision le...

...++ edited/xen/Makefile 2005-04-14 14:25:33 -07:00 @@ -106,15 +106,18 @@ include/asm-$(TARGET_ARCH)/asm-offsets.h .PHONY: default debug install dist clean delete-unfresh-files TAGS tags SUBDIRS = arch/$(TARGET_ARCH) common drivers +define all_sources + ( find include/asm-$(TARGET_ARCH) -name SCCS -prune -o -name ''*.h'' -print; \ + find include -type d -name SCCS -prune -o \( -name "asm-*" -o \ + -name config \) -prune -o -name ''*.h'' -print; \ + find $(SUBDIRS) -name SCCS -prune -o -name ''*.[chS]'' -print ) +e...

On Sep 29, 2006, at 2:05 PM, Domagoj Babic wrote: > > Check out scc_* iterators. Also note that the call graph > is not aware of the indirect calls, so you will need to write your > own CG implementation if you need to handle function pointers > soundly. > Chris, is this true? If so, it seems like a bad property for the CallGraphSCCPass framework. --Vikram

On Fri, 29 Sep 2006, Vikram Adve wrote: > On Sep 29, 2006, at 2:05 PM, Domagoj Babic wrote: >> Check out scc_* iterators. Also note that the call graph >> is not aware of the indirect calls, so you will need to write your >> own CG implementation if you need to handle function pointers >> soundly. > Chris, is this true? If so, it seems like a bad property for the

...ke target `src/*/*.[chfy]' [32] /home/res4/gilp/R-versions/R-0.63 : ... [32] /home/res4/gilp/R-versions/R-0.63 : make -dd MAKEFLAGS value: stat(make.rules) doname(make.rules) Looking for % rule for make.rules find_double_suffix_rule(make.rules) find_suffix_rule(make.rules,make.rules,) stat(SCCS) stat(/usr/share/lib/make/make.rules) doname(/usr/share/lib/make/make.rules) Looking for % rule for /usr/share/lib/make/make.rules find_double_suffix_rule(/usr/share/lib/make/make.rules) find_suffix_rule(/usr/share/lib/make/make.rules,/usr/share/lib/make/make.rules,) stat(/usr/share/lib/make/S...

On Sep 3, 2009, at 4:15 AM, Hans Vandierendonck wrote: Hi, > > I am using the scc_iterator class in my code on a CallGraph, where > some > functions are not called from within the module. It seems that > scc_iterator does not list all SCCs if the graph is not connected; > only > those nodes connected to the node pointed to by > GraphTraits<...>::getEntryNode() are returned. > > Can someone verify this behavior? > Any tips on how I should go about extending the class in order to > visit > all SCCs? &g...