similar to: Coding style. VariableNames, not variableNames?

TL;DR: change the rule for variable names from UpperCamelCase to lowerCamelCase. Just to get wider visibility on this, I'm raising this again as an RFC, as suggested by Roman Lebedev. My original post from last week is here and gives a rationale: http://lists.llvm.org/pipermail/llvm-dev/2019-February/129854.html. There seemed to be general agreement that the status quo is not ideal.

The coding style I use for compiz is very similar to what's used in the xserver. This was the best I could get out of GNU indent. indent -psl -saf -sai -saw -sob -i4 -bbo -bls -lp -di1 -pcs -bs -cs -bl -bli0 -cdb -sc -bad -bap -l78 The style in compiz is slightly different though. Function parameters are aligned and I usually align function parameter names and variable names too. I also

Hi I am trying to add density lines to multiple histograms created using R. I have managed to get all 18 lines on the last histogram in the series, however, i cannot figure out how to get each line appear on the correct histogram plot. I know in Matlab there is a hold function, is there something similar in R? the following is the code i have used to get mutiple plots and then add all the

When I run lighttpd 1.4.10 [on Mac OS X] the socket file is called ''fcgi.socket-'', versus ''fcgi.socket-0'' that I get under 1.4.8. Further, when the FCGI daemon quits, the file does not get deleted, and I cannot restart my Rails app until I manually remove it. Can anyone confirm before I raise a bug at lighttpd.net?

I would assume that the proper name in this case is constantExpr, and not CE. This is not really an acronym, but rather a shortcut taken for some unclear reason. > On 12. Feb 2019, at 13:02, Björn Pettersson A via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > (Sorry if this subject already has been discussed, but I could not find any clear rules/recommendations.) > >

I've got a question. When do i have to use this for aFunctionName() and when do i have to use this for a_function_name() ? Cedric

Hi everyone! I have 2 hosts + 1 ISCSI device. I want to create a shared storage repository and both hosts use together. I wont use NFS. prepared sr: xe sr-create host-uuid=xxx content-type=user name-label=NAS1 shared=true type=iscsi device-config:target=xxxx device-config:targetIQN=xxxx hosts see the iscsi device: scsi4 : iSCSI Initiator over TCP/IP scsi 4:0:0:0: Direct-Access NAS

Hi, Hexagon has a MIR pass for detecting loops that map onto hardware support. I think a similar approach would be viable for my target but am put off by the complexity of determining whether a given loop is legal to transform. Instead, I would like to pass the responsibility for determining legality onto the C programmer who is assumed sufficiently familiar with the architecture. I think this

It very much depends on what is following the code snippit. If the second "if" is guarding a substantial block of code, "constantExpr" might very well be a good name. Otherwise something like "cExpr" or "constExpr" might be fine. In the past when I have seen things like "CE" in the code, it's not always immediately clear to me what it is. I

What should a well behaved back end do with a load or store with alignment less than the natural alignment of the type? I believe C++ considers such access to be UB. I'm not sure what the IR semantics are. I think my options are: - Delete the operation / use undef - Lower as if it is naturally aligned - Lower via inefficient code that assumes align 1 Thanks, Jon -------------- next part

Hi,All, I wang to use AGI in asterisk1.4. AGI file / myperl.agi #!/usr/bin/perl use strict; ...... print STDERR "7. Testing GET VARIABLE..."; print "GET VARIABLE EXTEN \"\"\n"; my $result = <STDIN>; &checkresult($result); ...... when the agi execute; asterisk conosle show that : AGI Rx << GET VARIABLE EXTEN "" AGI Tx >>

There was talk a few weeks ago about the possibility of a Tk-based user management tool that never happened. I'm planning on trying to do this myself. What features were to be in the one that never materialized? What features might people want in it? To begin, the program will only be able to do things that can be done straight through the existing command line tools (net, smbpasswd,

Taking the address of a function inhibits optimisations for that function. Essentially any ABI changes are unavailable if we can't adjust the call site to match. The case of interest here is when a given function is called directly and indirectly, and we don't want the latter to impose a cost on the former. One approach to avoid the ABI constraint cost is to extract/outline the body of an

Hello everyone, I'm working on a package using S4 classes and methods and I ran into the following "problem" when I tried to create an "apply" method for objects of one of my new classes. I've found a way around the problem but I wonder if I did not paint myself into the corner. I'd like your opinion about that. So I have an object "myObj" of class

Video of the Chicago RailsConf keynotes are now online. At least two of them, anyway. So far Martin Fowler''s (Chief Scientist from ThoughWorks) and Dave Thomas'' (author of Pragmattic Programmer and Programming Ruby among others) can be found at blog.scribestudio.com . You can find the general release schedule of the other speakers here:

SelectionDAG's computeKnownBits has no case for ConstantFP, e.g. Known.ones = cast <ConstantFPSDNode>(Op)->getValueAFP ().bitcastToAPInt (); I can't easily override this in target specific code. Can anyone see an issue with submitting the patch to upstream? Suggestions for an in tree target that could trigger this would be very welcome. Cheers -------------- next part

For example, truncating store of an i32 to i6. My assumption was that this should write the low six bits of the i32 to somewhere in memory. Should the top 24 bits of a corresponding 32 bit region of memory be unchanged, zero, undefined? Should the two bits that would round the i6 up to a byte be preserved, zero, undefined? I can't write six bits directly so am trying to determine what set

I would like to specialise build_vector for the case when one of the operands is undefined. How do I describe this? This is looking for an analog of specialisations like: def : Pat <v2i32 (build_vector i32:$x, (i32 0)),...>; but for an undefined, rather than zero, value. I can work around my ignorance in performDAGCombine but would prefer to add to the existing pattern matching. Thanks,

OK, I'm clear on scalars. Data races are thankfully OK in this context. Densely packing vectors sounds efficient and is clear in the case where lanes * width is a multiple of 8 bits. I don't think I understand how it works in other cases. If we could take store <4 x i8> truncating to <4 x i7> as an example. This can be converted into four scalar i8 -> i7 stores with

There was a GSoC project in 2016, final report at https://docs.google.com/document/d/1v-R7gB7Or4bPn0LW7d-yb1yla8jK3DVmTJNFVNYNu6k Google doesn't show a lot of activity since. Has anyone taken this work further / put it near production? I'm interested in removing register spills around functions that are known to not clobber said registers. Thanks! Jon -------------- next part