search for: aap

Hi all, We wish to submit our latest AAP implementation as an experimental backend into LLVM. We need community feedback and reviewers for patches which we will submit soon. AAP was designed in early 2015 and aims to advance compiler development for small deeply embedded Harvard architectures, which are widely used commercially. AAP is f...

Hi Renato, Currently I am building a set of patches which will add AAP piece-wise. I'm following the approach that AVR (and now RISC-V), and the patches I plan on adding are as follows: * Target triple * ELF definition * Basic skeleton with the required build system changes (targetinfo + target machine) * Instruction + Register tablegen * MC layer support * AsmPa...

The initial proposal to include AAP in LLVM met with some concern that it would be actively maintained (thread from http://lists.llvm.org/pipermail/llvm-dev/2016-August/103807.html ), and after some review activity seemingly went quiet (although review code has been updated quite recently). Is AAP likely to land any time soon? Also...

...looking for reviewers, if anyone is interested. Thank you, Edward Jones On 15/09/16 17:12, Ed Jones wrote: > I have now posted the final two patches for the backend to add > Disassembler support, ISel and CodeGen. The full list of patches is now: > > https://reviews.llvm.org/D23664 - AAP triple and target > https://reviews.llvm.org/D23665 - ELF definitions > https://reviews.llvm.org/D23667 - Stub backend > https://reviews.llvm.org/D23770 - InstrInfo, RegInfo Tablegen > https://reviews.llvm.org/D23771 - MC layer support > https://reviews.llvm.org/D23772 - AsmParser &g...

...target's maintenance. > > So, concretely, can you quantify the active customers for this target? > > Alex > > On Aug 18, 2016, at 12:34 AM, Ed Jones via llvm-dev <llvm-dev at lists.llvm.org> wrote: > >> Hi all, >> >> We wish to submit our latest AAP implementation as an experimental >> backend into LLVM. We need community feedback and reviewers for patches >> which we will submit soon. >> >> AAP was designed in early 2015 and aims to advance compiler development >> for small deeply embedded Harvard architectures,...

...It seems likely the hurt side would not be a problem, even if the current maintainers rotate out for whatever reason then Google seems likely to rotate in somebody else to take their place. That capacity would seem to make it less necessary to identify an end-user community of its own. Regarding AAP, we've got a few target-maintainers, who say they do have target-users who could benefit. Alex asked if the maintainers could better quantify their user base, which seems like a reasonable question. Who is on the "help" side? Would they be able to take over from the initial target-...

On 26 August 2016 at 16:36, Mehdi Amini via llvm-dev <llvm-dev at lists.llvm.org> wrote: > I think Alex’s point is that there needs to be a sufficient user base or a sufficient commitment of maintenance to warrant the burden of the backend on the community. I don't think there is. Can you quantify Lanai's customers? Is there a community behind it? Last I check it was only

On 26 August 2016 at 17:45, Mehdi Amini <mehdi.amini at apple.com> wrote: > “Major corporation” does not mean size to me, I read it as “having a major involvement in the project”. Still, you're rejecting new developers because they haven't contributed much before. But if their back-end is upstream, than they'll contribute code upstream for their changes on their back-end.

Dear list, I would like to study the dynamics of functions using R (instead of mathematica e.g.), i.e. the behavior of points under iteration of a function. So I tried (in vain) writing a function myfunction <- function(f,n,x){...} in order to compute f^{n}(x), f^{n}(x) being the function f composed with itself n-1 times. n is a natural number, and the argument x is the abscissa of the point I

On 26 August 2016 at 16:58, Mehdi Amini <mehdi.amini at apple.com> wrote: > This was addressed in Alex’s email: " In the past, the only exception I can think of is the Lanai backend, but in that case we have a strong commitment of multiple employees at a major corporation committed to that target's maintenance.”. So, are we picking features based on company size, now? That

Hi, I''ve run into two small problems with acts_as_paranoid and wondered if anyone else has experienced them as well (and if yes, if they have any solutions). 1. When using has_many :through, AAP doesn''t seem to take into account the fact that your join model might also be paranoid. My solution to this at the moment is to add an explicit conditions clause to the has_many :through statement, i.e. "join_model.deleted_at IS NULL" - is there a better way of getting the same r...

Here''s the full error: 1) Error: test_add_message_to_existing_ticket(TicketTest): ArgumentError: Unknown key(s): group /usr/lib/ruby/gems/1.8/gems/activesupport-1.2.4/lib/active_support/core_ext/hash/keys.rb:48:in `assert_valid_keys'' /usr/lib/ruby/gems/1.8/gems/acts_as_paranoid-0.2/lib/acts_as_paranoid.rb:125:in `validate_find_options''

Hi, I want to retrieve the set of key & values which returns from a stored procedure : connection.select_all "exec common.dbo.scr_lookupric ''AAP.N'' ". The results i want to display in a view screen call result.rhtml. Please help me out ASAP. Thanks in advance. joshua... -- Posted via http://www.ruby-forum.com/.

...3 38.2 35.1 19.2 32.7 ... $ X3.month.average.daily.volume: num 154 7862250 16330 205784 14697 ... $ X50.day.moving.average.price : num 41.8 36.3 30.5 15.2 29.9 ... > str(top1000) 'data.frame': 1000 obs. of 1 variable: $ V1: Factor w/ 1000 levels "AA","AAI","AAP",..: 146 96 341 814 382 977 66 1 737 595 ... I want to split ysmd into two new data frames: ysmd.top1000 and ysmd.rest so that ysmd.top1000$X.stock only contains factors from top1000$V1 and ysmd.rest$X.stock contains all the other factors. I should be able to just write ysmd.top1000 <- y...

..., each of them financial statement data from quantmod (although I don't think that knowledge of quantmod is necessary to help with this problem). > str(listfinobj) chr [1:4815] "A.f" "AA.f" "AACC.f" "AAME.f" "AAN.f" "AAON.f" "AAP.f" "AAPL.f" "AAT.f" "AATI.f" "AAU.f" ... I can easily pick out the 3rd object in this list. > listfinobj[[3]] [1] "AACC.f" Each of the .f objects has a mildly complicated structure (partial results shown below). > str(AACC.f) List of 3...

Does anyone else here think that it might be a good idea to shift wxruby to use rake (http://rubyforge.org/projects/rake/) or perhaps one of the other "modern" build systems? One example of a task that would be trivial with rake, but seem to be really painful with make: Define a tclean target that deletes all the .h and .cpp files that are built from .t files. I''m not sure

Hi, I'm try to compute the minimum sample size needed to have at least an 80% of power, with alpha=0.05. The problem is that empirical proportions are really small: 0.00154 in one case and 0.00234. These are the estimated failure proportion of two medical treatments. Thomas and Conlon (1992) suggested Fisher's exact test and proposed a computational method, which according to their table

...;1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "11", "12", "13", "14", "15", "16", "17", "18"), c("AAA", "AAp", "AA", "AAm", "Ap", "A", "Am", "BBBp", "BBB", "BBBm", "BBp", "BB", "BBm", "Bp", "B", "Bm", "CCC.to.C", "D"))) ------ BEGIN PASTE --...

I have a vague recollection of seeing a R-function that will output a table or matix in a format suitable for the tabular enviroment in LaTeX. But I cannot find it. Any hints? Bendix ---------------------- Bendix Carstensen Senior Statistician Steno Diabetes Centre Niels Steensens Vej 2 DK-2820 Gentofte Denmark tel: +45 44 43 87 38 mob: +45 28 25 87 38 fax: +45 44 43 73 13 bxc at novo.dk

Hi, I'm with a team using 16-bit bytes for an out-of-tree target. The AsmPrinter framework's implementation of the DWARF debugging format is not very good at distinguishing between target-sized bytes (which is the more common use) and 8-bit-bytes. The DWARF standard itself seems not very good in this regard, actually. So we have had to hack our way around this. I.e., at some call-sites of