Displaying 20 results from an estimated 1000 matches similar to: "requiring array indices be int64_t"
2007 Jan 10
13
[DTrace] how to get socket read size
Hi
i''m trying to write my first dtrace script apparently i bit off a bit
more than i can chew, i want to track io over sockets, i found your
socketsize.d that gave me how to track writes, but i''m at a loss how
to track reads, frankly i don''t see how your write tracker works
because it uses a probe in a function that only takes two arguments
but you grab size of write
2008 Oct 02
0
Comments for squeue.c; part 2.
1.
566 squeue_enter(squeue_t *sqp, mblk_t *mp, mblk_t *tail, uint32_t cnt,
Why cnt is declared as uint32_t (fixed size?) Why not just int or uint_t?
554 * squeue_enter() - enter squeue sqp with mblk mp (which can be
555 * a chain), while tail points to the end and cnt in number of
556 * mblks in the chain.
It is not quite clear what is a tail (and why it is needed as well)
558 * For
2007 Apr 04
2
aggregate printing with S10
Using the following dtrace command, I can see who''s calling what with lots of +/- numbers:
dtrace -n ''fbt:ip:ip_output:entry{@dbtypes[((mblk_t *)arg1)->b_datap->db_type,caller] = count();}''
...the output is what I want but not how I want to see it.
What I''d rather see is the function names associated with caller and for db_type to be output in hex.
2006 Mar 24
3
Triggering on close of a written file.
I have just started my first ''serious'' dtrace script and can use some
advice.
I want to have a probe triggered when close() occurs after a
succesfull write of /etc/hosts ( I want to regenerate the nameserver
zone files
from /etc/hosts after it has changed)
At the moment I have the following code:
syscall::open*:entry,
syscall::creat*:entry
{
self->file=arg0;
2015 May 09
4
[LLVMdev] [LSR] hoisting loop invariants in reverse order
Hi,
I was tracking down a performance regression and noticed that
LoopStrengthReduce hoists loop invariants (e.g., the initial formulae of
indvars) in the reverse order of how they appear in the loop.
This reverse order creates troubles for the StraightLineStrengthReduce pass
I recently add. While I understand ultimately SLSR should be able to sort
independent candidates in an optimal order,
2015 Jun 22
2
[LLVMdev] bb-vectorizer transforms only part of the block
The loads, stores and float arithmetic in attached function should be
completely vectorizable. The bb-vectorizer does a good job at first, but
from instruction %96 on it messes up by adding unnecessary
vectorshuffles. (The function was designed so that no shuffle would be
needed in order to vectorize it).
I tested this with llvm 3.6 with the following command:
2007 Aug 01
2
getting hex out of ints
I have a probe:
pid111::myfunc:entry
{
self->arg = arg0;
}
pid111::myfunc:return
/self->arg/
{
@[self->arg] = quantize();
}
works great, but i''d like arg0 to be printed in hex. I''ve tried numerous approaches to do this but i''ve hit a wall every time. I''ve tried:
1) self->arg = sprintf(arg0);
no, cuz dtrace has no sprintf
2) self->arg
2005 Dec 21
1
ustack() issues && correlating SIGSEGV activity?
Howdy,
I was playing around with the malloc/free D script provided by
Philip Beevers:
http://www.opensolaris.org/jive/thread.jspa?threadID=4224&tstart=15
And decided to change the free:entry probe from:
pid24169::free:entry
/ sz[arg0] /
{
printf("Freeing %p (size %d)\n", arg0, sz[arg0]);
sz[arg0] = 0;
}
to:
pid24169::free:entry
/ ! sz[arg0] /
{
printf("[ *
2005 Sep 27
2
Invalid address error message
Hi,
I ran a d-program with syscall::open:entry probe but got the following
error messages sometimes:
dtrace: error on enabled probe ID 1 (ID 14: syscall::open:entry): invalid
address (0xff34e000) in predicate at DIF offset 76
dtrace: error on enabled probe ID 6 (ID 14: syscall::open:entry): invalid
address (0xff34e000) in predicate at DIF offset 28
I don''t know how to interpret these
2015 Jul 01
3
[LLVMdev] SLP vectorizer on AVX feature
I seem to have problem to get the SLP vectorizer to make use of the full
8 floats available in a SIMD vector on a Sandy Bridge CPU with AVX. The
function is attached, the CPU flags are:
flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov
pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx
pdpe1gb rdtscp lm constant_tsc arch_perfmon pebs bts rep_good
2006 Sep 06
3
Dtrace Snooping
Dear dtrace Experts,
I have seen some dtrace utilities like opensnoop and execsnoop etc.
My interest is to write a simple script that can snoop the files which
uses the 3 syscalls like open,create,unlink.
I have gone through dtrace oneliners that can do the same :
dtrace -n ''syscall::open*:entry { printf("%s %s",execname,copyinstr(arg0));}''
dtrace -n
2009 Jun 24
1
Qualified parameters in SOAP body using .SOAP
Hello,
I am trying to reach a web service using the SOAP package. I succeeded
calling the web service, but not sending parameters to it. After much
research and tries, I think I found that the problem lies in the
namespace including the parameters in the SOAP body.
In short, my question is: how can I send unqualified parameters in the
SOAP body of a call produced through the SOAP package?
2014 Mar 25
2
[LLVMdev] Alignment of pointee
Hi all,
Is there a way to express in the IR that a pointer's value is a multiple
of, say, 32 bytes? I.e. the data the pointer points to has an alignment
of 32 bytes. I am not meaning the natural alignment determined by the
object's size. I am talking about a double* pointer and like to
explicitly overestimate the alignment.
I am trying to add this pointer as a function's
2011 Mar 15
2
[LLVMdev] Kinda noob questions
Hi all,
I have 2 simple questions...
First, just for you to know, I'm making a compiler (kinda obvious) and the
language definition is mine, so there is no much constraint for me, it's
written in Java (it generates a .ll file as output) and it's just for fun by
now, maybe a serious project after I learn all the stuff needed...
and sorry bad english
1) I want to know if when I do
2010 Mar 19
2
Using DTrace in 32-bit to handle 64-bit parameters [72631230]
Hi all,
OK, so this at first looked like a clear cut "Don''t do it, or at worst
handle the results" issue my customer has come to me with, but the more
we discuss it, the more it looks like we should have better ways of
dealing with this issue.
> We have user defined dtrace probe points in the application which use
> as parameter 64 bit values:
>
> provider adv {
2011 Mar 15
0
[LLVMdev] Kinda noob questions
On 3/14/11 7:52 PM, Judison wrote:
> Hi all,
>
> I have 2 simple questions...
>
> First, just for you to know, I'm making a compiler (kinda obvious) and
> the language definition is mine, so there is no much constraint for
> me, it's written in Java (it generates a .ll file as output) and it's
> just for fun by now, maybe a serious project after I learn all
2006 Oct 24
15
How to emit associative array after ^C
Boy am I a dummy. I want to simply dump out unfreed allocations when I terminate the script. What''s the secret sauce?
#!/usr/sbin/dtrace -s
pid$1::MyAlloc:return
{
bufs[arg1] = walltimestamp;
}
pid$1::MyFree:entry
/bufs[arg0]/
{
bufs[arg0] = 0;
}
This message posted from opensolaris.org
2007 Jul 11
5
Error trying to count return points in functions.
Whilst trying out some D to get an insight into what is the most
common reason for a given function to return, I have bumped
into an error I don''t understand.
The first take on what I was trying to do was:
# dtrace -n ''fbt:ip:ip_input:return{@home[arg0] = count();}''
and all was well. The next step was:
# dtrace -n
2011 Mar 15
2
[LLVMdev] Kinda noob questions
On Mar 14, 2011, at 5:56 PM, John Criswell wrote:
> On 3/14/11 7:52 PM, Judison wrote:
>>
>> 2) does the LLVM optimizes this:
>>
>> ; this code (arg -> var) is very similar to what gcc generates
>> define void @foo(i32 %arg0) {
>> entry:
>> %var0 = alloca i32
>> store i32 %arg0, i32* var0
>> ...
>> %x = load i32*
2015 Jun 03
2
[LLVMdev] Replacing a repetitive sequence of code with a loop
Hey guys, in an HPC project I am working on I am given an LLVM program
consisting of a linear sequence of repetitive junks of code with an
uniform memory access pattern. Each code junk does the following: 1)
loads some memory, 2) performs some arithmetic operations, 3) stores the
result back to memory. The memory stride between consecutive junks is
constant over the whole program, thus the