similar to: Help reading csv data in a dynamic arrays w/ loops... =)

Displaying 14 results from an estimated 14 matches similar to: "Help reading csv data in a dynamic arrays w/ loops... =)"

2009 Mar 18
3
[LLVMdev] Status of LLVM's atomic intrinsics
Having implemented a GC for HLVM, I am now turning my attention to implementing a GC that supports parallelism. To do this, I would like to use atomic instructions as well as mutexes. What is the status of LLVM's atomic instrinsics (e.g. CAS)? Is anyone using them in real projects? I realised that an obvious test would be to compile some simple example programs with llvm-g++ instead of
2009 Mar 18
0
[LLVMdev] Status of LLVM's atomic intrinsics
Jon Harrop wrote: > Having implemented a GC for HLVM, I am now turning my attention to > implementing a GC that supports parallelism. To do this, I would like to use > atomic instructions as well as mutexes. What is the status of LLVM's atomic > instrinsics (e.g. CAS)? Is anyone using them in real projects? > > I realised that an obvious test would be to compile some
2006 Feb 19
3
Loops and Variables
I have the following in my dialplan, counts the number of loops and when it hits greater then 5, exit. It works, but errors initially with, "syntax error, unexpected TOK_PLUS, expecting TOK_MINUS or TOK_LP or tolken; Input: +1". Could somebody tell me why? Thanks: ; **************************************** ; Setup a varriable to count the number of ; times the message has been
2020 Jun 17
1
Deduplication and block size
Nothing too interesting here, I was just playing around with the idea of a deduplication allocator for nbdkit (“allocator=dedup”, see https://rwmj.wordpress.com/2020/06/15/compressed-ram-disks/). Before implementing such a thing I wanted to know if there's much duplicated structure in a disk image. It seems to depend very critically on the block size, but also there are no significant
2007 Sep 27
2
[LLVMdev] Lowering operations to 8-bit!
I'm working on version 2.0 The assertion at line 2380 of LegalizeDAG.cpp fails when it is trying to lower the add with i16. assertion reads: assert(MVT::isVector(Node->getValueType(0)) && "Cannot expand this binary operation!"); I am trying to compile a very simple program as follows: short var; void foo(void) { Var++; } The input bytecode, (in addition to the
2007 Sep 28
0
[LLVMdev] Lowering operations to 8-bit!
On Sep 27, 2007, at 4:35 PM, <Alireza.Moshtaghi at microchip.com> <Alireza.Moshtaghi at microchip.com> wrote: > I'm working on version 2.0 > The assertion at line 2380 of LegalizeDAG.cpp fails when it is > trying to > lower the add with i16. > > assertion reads: > assert(MVT::isVector(Node->getValueType(0)) && > "Cannot expand this
2006 Jul 19
2
[PATCH]
This patch makes it possible to use a negative offset to count from the end of a variable. Signed-off-by: Johannes Berg <johannes at sipsolutions.net> --- dovecot-1.0.rc2/doc/variables.txt 2006-04-12 09:39:31.000000000 +0200 +++ dovecot-1.0.rc2.mod/doc/variables.txt 2006-07-19 19:27:15.611041184 +0200 @@ -35,7 +35,10 @@ You can take a substring of the variable by giving optional offset
2007 Sep 27
0
[LLVMdev] Lowering operations to 8-bit!
On Wed, 26 Sep 2007 Alireza.Moshtaghi at microchip.com wrote: > I am trying to lower all llvm operations to 8-bit. So far I was trying > to have llvm do all that for me using things like: ok > setOperationAction(ISD::ADD, MVT::ii,Promote); > setOperationAction(ISD::ADD, MVT::i8,Legal); > setOperationAction(ISD::ADD, MVT::i16,Expand); > setOperationAction(ISD::ADD,
2006 Apr 27
12
how to do a count with a variable...
hi guys, got this problem... in my controller, when i wanna do a @temp.count it fails... then i went to try counter = @temp.count which also failed.. thus, i feel that the count is not available for ActiveRecord::Base..so i went to the Model class eg. user.rb so in user.rb : ... def count_uesr count = 0 self.each do |record| count ++ end return count end then it ended up having
2007 Sep 26
2
[LLVMdev] Lowering operations to 8-bit!
I am trying to lower all llvm operations to 8-bit. So far I was trying to have llvm do all that for me using things like: setOperationAction(ISD::ADD, MVT::ii,Promote); setOperationAction(ISD::ADD, MVT::i8,Legal); setOperationAction(ISD::ADD, MVT::i16,Expand); setOperationAction(ISD::ADD, MVT::i32,Expand); However, I keep getting an assertion failure that operation can not be expanded.
2007 Sep 28
2
[LLVMdev] Lowering operations to 8-bit!
I moved my code to 2.1 but still the same. If I make ADD i16 legal, then it goes through, but it has problem expanding it to i8. Should I go ahead and customize it and do the same for all instructions? Or there is a more general thing that I can do? A. -----Original Message----- From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of Chris Lattner Sent:
2007 Jul 28
3
global variables and updates
Sorry if this appears twice - I originally sent it nearly 18 hours ago and never saw it .. I have a need to have a unique integer number that can be used by a dynamic meetme room (I am wanting to redirect a call into a meeting room, and need a unique number to make sure I don't put two people together !) I was going to use a global variable ${NEXTMEETME}, and add one every time I
2003 Nov 04
0
PATCH: make local IP address available to auth modules
The attached patch makes the local IP address to which the client connected available to the authentication modules; i.e., the local IP address is available for substitution as %i for the mysql and pgsql modules. We needed this feature to support thousands of our legacy accounts which are authenticated by username/local_part (not the full email address) and IP address (one per domain). Timo,
2012 Jul 04
53
[PATCH 00 of 10 v3] Automatic NUMA placement for xl
Hello, Third version of the NUMA placement series Xen 4.2. All the comments received during v2''s review have been addressed (more details in single changelogs). The most notable changes are the following: - the libxl_cpumap --> libxl_bitmap renaming has been rebased on top of the recent patches that allows us to allocate bitmaps of different sizes; - the heuristics for deciding