From mboxrd@z Thu Jan 1 00:00:00 1970 MIME-Version: 1.0 In-Reply-To: References: <55c52a87f0b8c0ac12a81a150f110b2b@brasstown.quanstro.net> <20091101184418.GM19125@gradx.cs.jhu.edu> <1257590719.28012.1344036163@webmail.messagingengine.com> <20091110003356.GW19125@gradx.cs.jhu.edu> <13426df10911091646o305d2ab2g664aa719e5b9a0e9@mail.gmail.com> Date: Tue, 10 Nov 2009 15:38:00 -0800 Message-ID: From: Roman Shaposhnik To: Fans of the OS Plan 9 from Bell Labs <9fans@9fans.net> Content-Type: text/plain; charset=ISO-8859-1 Subject: Re: [9fans] dtrace for plan 9 Topicbox-Message-UUID: 98b1e5b0-ead5-11e9-9d60-3106f5b1d025 On Tue, Nov 10, 2009 at 12:21 PM, wrote: > On 10 Nov 2009, at 01:00, Roman Shaposhnik wrote: >> >> What exactly do you want to know? I worked with DTrace quite extensively. > > What is the upper bound on the runtime of a single D bytecode sequence? > > Or to put it another way, what's the longest time delay that DTrace&co can > cause in your kernel? Would this answer your question: http://blogs.sun.com/jonh/entry/the_dtrace_deadman_mechanism Or are you literally trying to figure out the upper bound on the # of virtual instructions in a single probe? Thanks, Roman.