search for: arays

Displaying 20 results from an estimated 20 matches for "arays".

Did you mean: arrays
2011 Aug 03
2
[LLVMdev] scalar evolution to determine access functions in arays
...ndra <xinfinity_a at yahoo.com> Cc: "llvmdev at cs.uiuc.edu" <llvmdev at cs.uiuc.edu>; "luismastrangelo at gmail.com" <luismastrangelo at gmail.com> Sent: Wednesday, August 3, 2011 9:36 AM Subject: Re: [LLVMdev] scalar evolution to determine access functions in arays On 08/03/2011 08:35 AM, Jimborean Alexandra wrote: > Hello Tobi, > > You are right, we need to run some other passes before running the > scalar evolution pass. The sequence that I run for this example is -O3 > -loop-simplify -reg2mem. This is why I did not obtain the expressions &g...
2011 Aug 03
0
[LLVMdev] scalar evolution to determine access functions in arays
On 08/03/2011 08:35 AM, Jimborean Alexandra wrote: > Hello Tobi, > > You are right, we need to run some other passes before running the > scalar evolution pass. The sequence that I run for this example is -O3 > -loop-simplify -reg2mem. This is why I did not obtain the expressions > depending on the loop indices. So I removed the reg2mem pass and scalar > evolution computes the
2011 Aug 03
0
[LLVMdev] scalar evolution to determine access functions in arays
On 08/03/2011 10:22 AM, Jimborean Alexandra wrote: > Only because in my next passes I change the CFG significantly and it is > very hard to maintain the values of the Phi nodes. OK. In Polly we developed a pass called, 'independent-blocks-pass'. It basically creates basic blocks, that can easily be rescheduled without stopping the scalar evolution analysis to work. Maybe something
2011 Aug 03
1
[LLVMdev] scalar evolution to determine access functions in arays
...dra <xinfinity_a at yahoo.com> Cc: "llvmdev at cs.uiuc.edu" <llvmdev at cs.uiuc.edu>; "luismastrangelo at gmail.com" <luismastrangelo at gmail.com> Sent: Wednesday, August 3, 2011 11:26 AM Subject: Re: [LLVMdev] scalar evolution to determine access functions in arays On 08/03/2011 10:22 AM, Jimborean Alexandra wrote: > Only because in my next passes I change the CFG significantly and it is > very hard to maintain the values of the Phi nodes. OK. In Polly we developed a pass called, 'independent-blocks-pass'. It basically creates basic blocks, th...
2011 Aug 03
2
[LLVMdev] scalar evolution to determine access functions in arays
...ndra <xinfinity_a at yahoo.com> Cc: "llvmdev at cs.uiuc.edu" <llvmdev at cs.uiuc.edu>; "luismastrangelo at gmail.com" <luismastrangelo at gmail.com> Sent: Wednesday, August 3, 2011 2:21 AM Subject: Re: [LLVMdev] scalar evolution to determine access functions in arays On 07/27/2011 03:11 PM, Jimborean Alexandra wrote: > Hello, > > How can I compute the functions on the loop iterators used as array > indices? > > For example: > > for i = 0, N > for j = 0, M > A[2*i + j - 10] = ... > > Can I obtain that this instruction A[2...
2011 Aug 03
0
[LLVMdev] scalar evolution to determine access functions in arays
On 07/27/2011 03:11 PM, Jimborean Alexandra wrote: > Hello, > > How can I compute the functions on the loop iterators used as array > indices? > > For example: > > for i = 0, N > for j = 0, M > A[2*i + j - 10] = ... > > Can I obtain that this instruction A[2*i + j - 10]= .. always accesses > memory using a function f(i,j) = 2*i + j - 10 + base_address_of_A
2011 Jul 27
3
[LLVMdev] scalar evolution to determine access functions in arays
Hello, How can I compute the functions on the loop iterators used as array indices?  For example: for i = 0, N       for j = 0, M             A[2*i + j - 10] = ...  Can I obtain that this instruction A[2*i + j - 10]= .. always accesses memory using a function       f(i,j)   =   2*i + j - 10 + base_address_of_A If I run the scalar evolution pass on this code I obtain: %arrayidx =
2010 Mar 27
2
need help
Firstly my gateway 217.20.xxx.1 My ip adress 188.72.xxx.189 Sub net 255.255.255.0 this settings works on fedora 12 perfect but on centos ubuntu freebsd or fedora core it is not working but on all this systems i am able to use nat, i have installed linux again and again thousands of time the given result from centos 5.4 Also as you could see there is no gateway of me on the route table
2006 May 16
9
Array in database?
Hello, I wanted to know how to make an aray in the database. I''m making a "backpack" for my game. So i''m gana use it in a array. -- Posted via http://www.ruby-forum.com/.
2003 Sep 30
2
subsetting a matrix
Hi, I'm trying to take a set of rows and columns out of a matrix. I hve been using the index aray approach. My overll matrix is X and is 179 x 65. I want to take out 4 columns and 161 rows. Thus I made a 161 x 2 array I and filled it up with the row,col indices. However doing, X[ I ] gives me a vector of the extracted elements. Is there anyway I can coerce this into a 161 x 4 matrix?
2006 Jul 26
1
List directory names in a dropdown control?
I''ve been trying to find the "right" way to do this and I''m now appealing to the Rails masses. :) I want to list all the directory names in a specific location and have just the directory names appear in a dropdown control for the user. The Dir.entries("somepath") includes the "." and ".." folders plus all files and folders. The
2019 Jan 12
2
Solr -> Xapian ?
THank you Now, for the results I see the member of fts_result is : ARRAY_TYPE(seq_range) definite_uids; I have the UID as a aray of uint32_t * How to put my UIDs into this "definite_uids" ? Obviously this is not a simple array/pointer. How to say someting similar to result->definite_uids[1]=my_uid ? On 2019-01-12 10:25, Timo Sirainen wrote: > On 11 Jan 2019, at 21.23,
2019 Jan 12
2
Solr -> Xapian ?
I somehow fixed the folder issue. (seems some unix rights after too many tests) Getting back on the "fts_results" structure: I am trying: I_ARRAY_INIT(&(RESULT->DEFINITE_UIDS),R->SIZE); I_ARRAY_INIT(&(RESULT->MAYBE_UIDS),0); uint32_t uid; for(i=0;i<r->size;i++) { try {
2006 Jan 25
0
Another crack at age calculations
I cobbled this together based on a few previous posts and some tinkering, nothing fancy (my first bit of Ruby infact) but it seams to work for my purposes. My questions is actually why can I call <%= h(child.age(child.dob)) %> in a view but not <%= h(child.age_year_month(child.dob)) %>? Both work fine in the console. Thanks for any insight, Hugh child.rb class Child < Person
2019 Jan 12
0
Solr -> Xapian ?
additionally, my logic is that the backend stores one databalse per mailox in /xapian-indexes (in the "root" dir of the user), the name od the database is the GUID of the mailbox For INBOX, that works perfectly, and database is properly createdm and backed starts indexing all emails For other folder, somehow, the process can not access that (root) folder. Am I missing something ?
2019 Jan 13
0
Solr -> Xapian ?
I found the solution o this using SEQ_RANGE_ARRAY_ADD(&RESULT->DEFINITE_UIDS, UID); Now, I can see in the logs that several times, the dovecot calls the fts_backend_xapian_update_set_mailbox with box == NULL. WHy so ? THank you On 2019-01-12 21:40, Joan Moreau via dovecot wrote: > I somehow fixed the folder issue. (seems some unix rights after too many tests) > > Getting
2013 Jul 11
5
About NAS versus Samba
Hi there, Has anyone tried to configure a NAS server to authenticate users using a Samba PDC, or even a Samba4 DC (AD-compatible) or an IPA server? I'm evaluating replacing some Linux file server for a NAS product, but all them make me nervous when the vendor talks about "Active Directory support" and nothing else. In theory, many NASes are Linux boxes running samba, so there
2007 Sep 21
1
Weird data from evalJSON
I am trying to have prototype perform a request and return to me a javascript object representing the json string returned by the request. I want to iterate over the contents to print each object in the json string. The value of transport.reponseText in onSuccess is what I would expect. But once I try to perform evalJSON() on this text it gives me a bunch of extra function()s when i try to
2017 Mar 13
1
[ANNOUNCE] intel-gpu-tools 1.18
A new intel-gpu-tools quarterly release is available with the following changes: Library changes: - Various changes to library functions so that they don't assume Intel hardware. (Lyude) - Added helper functions for managing synchronization primitives. (Robert Foss) - Added support for the new generic CRC capture kernel ABI. (Tomeu Vizoso) - Added Geminilake platform support. (Ander
2019 Jan 11
4
Solr -> Xapian ?
The below patch resolves the compilation error $ DIFF -P COMPAT.H COMPAT.H.JOAN *** compat.h 2019-01-11 20:21:00.726625427 +0100 --- compat.h.joan 2019-01-11 20:14:41.729109919 +0100 *************** struct iovec; *** 202,207 **** --- 202,211 ---- ssize_t i_my_writev(int fd, const struct iovec *iov, int iov_len); #endif + #ifdef __cplusplus + extern "C" { + #endif + #if