search for: element_types

First, BRAVO for this wonderful plugin: has_many_polymorphs ! Now my problem: 4 models : Collection, Page, Fragment, Belonging (which is the join table): 1 class Collection < ActiveRecord::Base 2 has_many_polymorphs :elements, 3 :through => :belongings, 4 :from => [:pages, :fragments, :collections], 5 :as => :collector, 6 :parent_order =>

Hello, I''m just starting out with some Rails development and have the following table structure. I understand how to do a two table has many join but I actually need to relate a third table. Here is my structure: components id name updated_at elements id name updated_at element_types id name updated_at components_elements component_id element_id element_type_id updated_at My Component model has the following: class Component < ActiveRecord::Base has_and_belongs_to_many :elements end I haven''t actually added anything to my Element model but suspec...

This might be a very beginner question, but I'm looking for an example for something that I have never done. Suppose that I wanted to express actions with respect to lifted semantics of CPU instructions to an intermediate representation, BAP IL or LLVM IR. How might I go about providing a Backus Naur Form specification and then dynamically interpreting those lifted instructions by also

No matter what I try I''ve been unable to work how to get this to work with the cool ActiveRecord helpers. I''m not sure if it''s possible, Josh Susser''s blog suggests it is, but damned if I can work it out... I have: Container which can contain one or more Element. An Element is a polymorph of either a Container or a Chunk. An Element can exist in one or more

Hi Everyone, I just need some further help clarifying a custom rake task I''m building and the logistics of how it should be working. I''ve created a custom rake task in libs/tasks called scraper.rake which so far just contains the following: desc "This task will parse data from ncaa.org and upload the data to our db" task :scraper => :environment do # code goes

Hi everyone, I have an idea that should allow reducing code duplication in Casting.h while making llvm::isa, llvm::cast, llvm::dyn_cast, etc more generic. Since we added unique pointers support for these template functions (see ab480f45cd23c08cb9aa3f427aad072df249135f) I propose to generalize their semantics to deal with any pointer-like type (i.e. dereferenceable and implicitly convertible to

...ng removed for 2.7. I can keep the old functions around, but I'd prefer to keep the API clean. 3. Are there any llvm functionality that you need exposed to ocaml? Right now I plan to expose: add Union to TypeKind.t external union_type: llcontext -> lltype array -> lltype external union_element_types : lltype -> lltype array external build_indirect_br : llvalue -> int -> llbuilder -> llvalue external add_destination: llvalue -> llbasicblock -> unit external build_nsw_add : llvalue -> llvalue -> string -> llbuilder -> llvalue external build_nuw_add : llvalue ->...

Hello, I just discovered, that, when using enable_shared_from_this and inheriting it privately, this fails at runtime. I made a small example: #include <memory> #include <boost/shared_ptr.hpp> #include <boost/make_shared.hpp> #include <boost/enable_shared_from_this.hpp> #ifndef prefix #define prefix std #endif class foo: prefix::enable_shared_from_this<foo> {

Looks pretty reasonable to me - with test cases. (not sure if dereferenced_type should be defined for a type that's not dereferenceable, though?) On Tue, Jan 23, 2018 at 7:02 AM Dmitriy Borisenkov via llvm-dev < llvm-dev at lists.llvm.org> wrote: > Hi everyone, > > I have an idea that should allow reducing code duplication in Casting.h > while making llvm::isa, llvm::cast,

I''m having a little trouble with understanding how to work out the schematic for some of my classes using ActiveRecord when a file is in my lib directory: Brief example: Here''s the outline of the files in use: ....app ........controllers ............application_controller.rb ............rushing_offenses_controller.rb ........models ............rushing_offense.rb ....lib

On 11/08/2011 11:29 PM, Hal Finkel wrote: > On Tue, 2011-11-08 at 20:24 +0100, Tobias Grosser wrote: >> On 11/08/2011 03:36 PM, Hal Finkel wrote: >>> On Tue, 2011-11-08 at 12:12 +0100, Tobias Grosser wrote: >>>> On 11/08/2011 11:45 AM, Hal Finkel wrote: [A lot of performance results skipped] OK. As expected part of the speedup is because of unrolling, however it

On Tue, 2011-11-08 at 20:24 +0100, Tobias Grosser wrote: > On 11/08/2011 03:36 PM, Hal Finkel wrote: > > On Tue, 2011-11-08 at 12:12 +0100, Tobias Grosser wrote: > >> On 11/08/2011 11:45 AM, Hal Finkel wrote: > >>> I've attached the latest version of my autovectorization patch. > >>> > >>> Working through the test suite has proved to be a

...any llvm functionality that you need exposed to ocaml? Nope. The only feature I'd like is exceptions on the OCaml side from LLVM errors. > Right now I plan to expose: > > add Union to TypeKind.t > external union_type: llcontext -> lltype array -> lltype > external union_element_types : lltype -> lltype array > > external build_indirect_br : llvalue -> int -> llbuilder -> llvalue > external add_destination: llvalue -> llbasicblock -> unit > > external build_nsw_add : llvalue -> llvalue -> string -> llbuilder -> > llvalue external b...

Hi, I see many statements like the one following, with casts to a 0-sized array. %10 = getelementptr inbounds [0 x %struct.Link]* bitcast ([497 x %struct.Link]* @link_array to [0 x %struct.Link]*), i64 0, i64 %9 ; <%struct.Link*> [#uses=1] Why does this happen, and which transform causes this? Arushi -------------- next part -------------- An HTML attachment was scrubbed... URL:

On May 11, 2008, at 07:36, Mahadevan R wrote: > Hi Gordon, > > Thanks for your comments. >> No problem. >> :) Type handles in particular are very important. You can't form a >> recursive type without using them, so you can't build any sort of >> data structure. > > On it already. BTW, where can I find a good example of how to use it? To close

...but > I'd prefer to keep the API clean. Knock yourself out. > 3. Are there any llvm functionality that you need exposed to ocaml? > Right now I plan to expose: > > add Union to TypeKind.t > external union_type: llcontext -> lltype array -> lltype > external union_element_types : lltype -> lltype array > > external build_indirect_br : llvalue -> int -> llbuilder -> llvalue > external add_destination: llvalue -> llbasicblock -> unit > > external build_nsw_add : llvalue -> llvalue -> string -> llbuilder -> llvalue > external...

Hi, I'm part of an engineering team doing research on persistent memory support and we have stumbled upon an interesting problem. The issue is, we would like to be able to use the standard library containers in a persistent memory context (think NVDIMM-N). What I mean is that you allocate a container from said memory, use it like you normally would. After the application terminates, expectedly

Hi, Is there a rule or guideline about what Python versions must be supported for scripts in the LLVM tree? I am working on some patches to some scripts in LLVM to use features in Python 2.7, so that these scripts can run under Python 2.7 and Python 3.x Is that OK? For example, here is a patch to use print as a function, so that the scripts can work in Python 2.7 and Python 3.x -- Craig

On 11/08/2011 03:36 PM, Hal Finkel wrote: > On Tue, 2011-11-08 at 12:12 +0100, Tobias Grosser wrote: >> On 11/08/2011 11:45 AM, Hal Finkel wrote: >>> I've attached the latest version of my autovectorization patch. >>> >>> Working through the test suite has proved to be a productive >>> experience ;) -- And almost all of the bugs that it revealed

Hi Gordon, Thanks for your comments. > > Constant.string(value, dont_null_terminate) -- value is a string > > Constant.struct(consts, packed) -- a struct, consts is a list of > > other constants, packed is boolean > > I did this in Ocaml initially, but found the boolean constants pretty > confusing to read in code. I kept asking "What's that random true