search for: sreedhar

Displaying 19 results from an estimated 19 matches for "sreedhar".

2004 Feb 23
1
Information required on mounting Windows shared folders on Unix s ystems
...> using find computer and "Map network drive". > Now my question is How to mount my windows shared folder ( > \\ravi\SharedFolder <file://\\ravi\SharedFolder> ) on Unix system. For > that What I have to do. What are the things I have to do > Thanks and Regards > Sreedhar >
2012 Jan 07
1
[LLVMdev] dominance frontiers
...enough in practice (I believe > someone later published a paper comparing them all and finding the > same thing). > > > I wrote the current implementation of the up-front SSA construction in LLVM, > found in Utils/PromoteMemoryToRegister.cpp. It uses a modified version of > the Sreedhar-Gao algorithm from "A linear time algorithm for placing > phi-nodes". The most interesting modification is that it uses per-variable > liveness information to compute pruned SSA by pruning the entire IDF > computation, rather than merely pruning the DF -> IDF step like is usua...
2019 Jun 03
2
[IDF][analyzer] Generalizing IDFCalculator to be used for Clang's CFG
...emplatized" GraphDiff and all related classes to handle clang's CFG. If the answer to both of these questions is "no", I'd separate out a base of IDFCalculator, to a new class called IDFCalculatorBase that wouldn't contain either of said functions. Cheers! Kristóf [1] Sreedhar, Vugranam C., and Guang R. Gao. "A linear time algorithm for placing ϕ-nodes." Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages. ACM, 1995. [2] [IDF] Teach Iterated Dominance Frontier to use a snapshot CFG based on a GraphDiff. https://reviews.ll...
2012 Jan 07
0
[LLVMdev] dominance frontiers
...t sadly, none were fast enough in practice (I believe > someone later published a paper comparing them all and finding the > same thing). I wrote the current implementation of the up-front SSA construction in LLVM, found in Utils/PromoteMemoryToRegister.cpp. It uses a modified version of the Sreedhar-Gao algorithm from "A linear time algorithm for placing phi-nodes". The most interesting modification is that it uses per-variable liveness information to compute pruned SSA by pruning the entire IDF computation, rather than merely pruning the DF -> IDF step like is usually done. I was...
2003 Feb 26
2
OpenSSH 3.4p1 hostbased authentication
...ebug1: next auth method to try is hostbased get_socket_ipaddr: getnameinfo 8 failed userauth_hostbased: cannot get local ipaddr/name debug1: next auth method to try is password root at server01's password: What special settings are to be done to make it work? Please help. thanks and regards, Sreedhar. ************************************************************************** This email (including any attachments) is intended for the sole use of the intended recipient/s and may contain material that is CONFIDENTIAL AND PRIVATE COMPANY INFORMATION. Any review or reliance by others or copying or...
2012 Jan 07
2
[LLVMdev] dominance frontiers
On Fri, Jan 6, 2012 at 8:17 PM, Chris Lattner <clattner at apple.com> wrote: > > On Jan 6, 2012, at 5:08 PM, Chris Lattner wrote: > >>>> >>>> It's very like SSA construction, but must make provision >>>> testing anti dependences.  I had planned to use dominance frontiers to >>>> guide placement of phi nodes, as usual. >>>
2011 Mar 28
1
problems with blind transfer on GXP-2000 - Multi tenant asterisk !!
...ions. Call is dropped immediately. We couldn't see any error in the SIP log. I have attached the sip log, where call is made to ddi 016700202 and 100-solitaire rang. blindtransfer was made to 101-solitaire. If anyone is interested to fix this for us, it will be good. My yahoo id is sreedharmt at yahoo.com Myskypeid is kvss2010 Note: I can provide more information upon request. Regs Sreedhar. -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.digium.com/pipermail/asterisk-users/attachments/20110328/b951b82c/attachment.ht...
2019 Jun 16
2
[IDF][analyzer] Generalizing IDFCalculator to be used for Clang's CFG
...>> If the answer to both of these questions is "no", I'd separate out a base >> of IDFCalculator, to a new class called IDFCalculatorBase that wouldn't >> contain either of said functions. >> >> Cheers! >> Kristóf >> >> >> [1] Sreedhar, Vugranam C., and Guang R. Gao. "A linear time algorithm for >> placing ϕ-nodes." Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on >> Principles of programming languages. ACM, 1995. >> [2] [IDF] Teach Iterated Dominance Frontier to use a snapshot CFG based >&gt...
2019 Jun 17
2
[IDF][analyzer] Generalizing IDFCalculator to be used for Clang's CFG
...uot;, I'd separate out a >>>> base of IDFCalculator, to a new class called IDFCalculatorBase that >>>> wouldn't contain either of said functions. >>>> >>>> Cheers! >>>> Kristóf >>>> >>>> >>>> [1] Sreedhar, Vugranam C., and Guang R. Gao. "A linear time algorithm >>>> for placing ϕ-nodes." Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium >>>> on Principles of programming languages. ACM, 1995. >>>> [2] [IDF] Teach Iterated Dominance Frontier to use a sn...
2012 Sep 13
2
[LLVMdev] Dominance frontier & Postdominance frontier
Hi, I found that LLVM 3.1 says Dominance frontier is deprecated. Can anyone please tell me, if there is any replacement for Dominance frontier & Postdominance frontier in LLVM? What are the options if we need to use them? Thanks, Swarup. -------------- next part -------------- An HTML attachment was scrubbed... URL:
2013 Jan 14
1
sqldf package: using variables in where condition
Sent from my iPhone On Jan 13, 2013, at 9:47 PM, ravsre <ravishree51 at hotmail.com> wrote: > I am trying to use the sqldf package to create independent data frames from a > master dataframe. > I want to use sqldf package and perform a simple select statement. However, > what I want to do is to create a loop and repeatedly send a variable to the > where clause condition
2007 Apr 12
0
[LLVMdev] Regalloc Refactoring
...and Ken Kennedy and Timothy S. Oberg and Steven W. Reeves}, YEAR = "2002", TITLE = "Fast copy coalescing and live-range identification", BOOKTITLE = "PLDI", PAGES = "25-32", PUBLISHER = "ACM Press" } @InProceedings{Sreedhar99, AUTHOR = "Vugranam C. Sreedhar and Roy Dz-ching Ju and David M. Gillies and Vatsa Santhanam", YEAR = 1999, TITLE = "Translating out of Static Single Assignment Form", booktitle = {SAS}, publisher = {Springer-Verlag}, pages = {194-210}...
2013 Nov 02
0
[LLVMdev] DominanceFrontier/PostDominanceFrontier for PRE
Hi, I'm not able to answer your question. I'm wondering if you can create your own if it is just your own hobby project, or a project that you don't have to commit to the main repository. Creating DominatorFrontier seems to be expensive. However, if you are using bit-vector to represent a basic-block-set, I guess it can be done in linear time in practice. Following is the
2008 Feb 12
5
Unable to boot Dom0 from external hard disk in snv_b81
...he second harddisk as the internal hard disk in (which contains fc8 and winxp) in BIOS. The i86pc version boots fine and I am able to work without any problems. The same system(i86xpv) worked for me in my lab when I installed in an internal hard disk. Could some one help me fix the problem? Regards Sreedhar GS
2005 May 13
4
Encryption
Hi All, I am using rsync to backup our office server to our Internet server (RHE). As an association for doctors we are looking at providing a backup service for their practices using rsync. As it would be patient data it would need to be encrypted. I have found a few options, namely esync wurt rsyncrypto Does anyone have experience with the above and perhaps like to recommend one? On the
2013 Nov 02
2
[LLVMdev] DominanceFrontier/PostDominanceFrontier for PRE
Hi all, Does anyone know how to recreate the DominanceFronter and PostDominanceFrontier structures using the API of the latest release? To my knowledge, these are needed to implement a PRE pass (as done in the past<https://llvm.org/svn/llvm-project/llvm/tags/RELEASE_13/lib/Transforms/Scalar/PRE.cpp>), but they were removed a while ago for efficiency reasons. Is there a better way to
2013 Nov 03
4
[LLVMdev] DominanceFrontier/PostDominanceFrontier for PRE
...rs). http://www.cs.rice.edu/~keith/Embed/dom.pdf See figure 5. It will only touch nodes actually in the dominance frontier. This is what GCC uses. There are actually real almost linear dominance frontier algorithms (http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.202 is one example. Sreedhar's classic dj-graphs paper on placing phi nodes in linear time, shows also how to compute dominance frontier in same time bound) In practice, nobody implements these because the computation time of dominance frontiers is just not that large most of the time. In any case, to answer the origina...
2007 Apr 12
8
[LLVMdev] Regalloc Refactoring
Chris Lattner wrote: > On Thu, 12 Apr 2007, David Greene wrote: >> As I work toward improving LLVM register allocation, I've >> come across the need to do some refactoring. > > cool. :) One request: Evan is currently out on vacation until Monday. > This is an area that he is very interested in and will want to chime in > on. Please don't start anything
2020 Mar 20
0
[ANNOUNCE] igt-gpu-tools 1.25
...chamelium: add test descriptions lib/igt_eld: introduce eld_is_supported lib/igt_eld: fix eld_is_supported failing if not supported igt_eld: Add eld_is_igt lib/igt_alsa: Check that ELD comes from IGT Sravan Kumar Nedunoori (1): i915: Remove gem_write_read_ring_switch Sreedhar Telukuntla (1): tests/i915/gem_exec_parallel:Set engine map to default context Stanislav Lisovskiy (1): igt/kms_flip: Use actual vblank_interval instead of expected. Stuart Summers (1): tests/i915: Use engine query interface for gem_ctx_isolation/persistence Stylon Wang (1):...