search for: uninstanti

...shed by name, but references to locals should be hashed by an ordinal number. Instantiated templates are also visited by the hashing visitor. If we did not, we would have false negatives where the code is not conforming due to different points of instantiation in two translation units. We can skip uninstantiated templates since they don’t affect the behaviour of the program, and we need to visit the instantiations regardless. In LLVM IR, create a new named metadata node !llvm.odr_checking which contains a list of <mangled name, hash value> pairs. The names do not necessarily correspond to symbol...

Hi, Is there any tool out there that can help me analyze a coredump? Thanks, David. _______________________________________________ Xen-devel mailing list Xen-devel@lists.xensource.com http://lists.xensource.com/xen-devel

...me, but references to locals should be hashed by an ordinal number. > > Instantiated templates are also visited by the hashing visitor. If we did not, we would have false negatives where the code is not conforming due to different points of instantiation in two translation units. We can skip uninstantiated templates since they don’t affect the behaviour of the program, and we need to visit the instantiations regardless. > > In LLVM IR, create a new named metadata node !llvm.odr_checking which contains a list of <mangled name, hash value> pairs. The names do not necessarily correspond...

...cals should be hashed by an ordinal number. > > > > Instantiated templates are also visited by the hashing visitor. If we > did not, we would have false negatives where the code is not conforming due > to different points of instantiation in two translation units. We can skip > uninstantiated templates since they don’t affect the behaviour of the > program, and we need to visit the instantiations regardless. > > > > In LLVM IR, create a new named metadata node !llvm.odr_checking which > contains a list of <mangled name, hash value> pairs. The names do not &gt...

...ds. If you moved instantiation of anonymous records to the point > where the instances of the class/multiclass that uses them are > generated, that would help a lot.​ That's precisely what I've done, if I understand you correctly. I've added a VarDefInit class which acts as an uninstantiated anonymous record and will "fold" to a DefInit once the template arguments are fully resolved to contain no variable references. Additional benefits of this are that we don't keep partially resolved anonymous records in the RecordKeeper, and anonymous records that are instanti...

...eferences to locals should be hashed by an ordinal number. > > > > Instantiated templates are also visited by the hashing visitor. If we did not, we would have false negatives where the code is not conforming due to different points of instantiation in two translation units. We can skip uninstantiated templates since they don’t affect the behaviour of the program, and we need to visit the instantiations regardless. > > > > In LLVM IR, create a new named metadata node !llvm.odr_checking which contains a list of <mangled name, hash value> pairs. The names do not necessarily c...

...tion of anonymous records to the point > > where the instances of the class/multiclass that uses them are > > generated, that would help a lot.​ > > That's precisely what I've done, if I understand you correctly. > > I've added a VarDefInit class which acts as an uninstantiated anonymous > record and will "fold" to a DefInit once the template arguments are > fully resolved to contain no variable references. > > Additional benefits of this are that we don't keep partially resolved > anonymous records in the RecordKeeper, and anonymous recor...

...d by an ordinal number. >> > >> > Instantiated templates are also visited by the hashing visitor. If we >> did not, we would have false negatives where the code is not conforming due >> to different points of instantiation in two translation units. We can skip >> uninstantiated templates since they don’t affect the behaviour of the >> program, and we need to visit the instantiations regardless. >> > >> > In LLVM IR, create a new named metadata node !llvm.odr_checking which >> contains a list of <mangled name, hash value> pairs. The...

...d by an ordinal number. >> > >> > Instantiated templates are also visited by the hashing visitor. If we >> did not, we would have false negatives where the code is not conforming due >> to different points of instantiation in two translation units. We can skip >> uninstantiated templates since they don’t affect the behaviour of the >> program, and we need to visit the instantiations regardless. >> > >> > In LLVM IR, create a new named metadata node !llvm.odr_checking which >> contains a list of <mangled name, hash value> pairs. The...

...s to locals should be hashed by an ordinal number. >> > >> > Instantiated templates are also visited by the hashing visitor. If we did not, we would have false negatives where the code is not conforming due to different points of instantiation in two translation units. We can skip uninstantiated templates since they don’t affect the behaviour of the program, and we need to visit the instantiations regardless. >> > >> > In LLVM IR, create a new named metadata node !llvm.odr_checking which contains a list of <mangled name, hash value> pairs. The names do not neces...

...er. >>> > >>> > Instantiated templates are also visited by the hashing visitor. If we >>> did not, we would have false negatives where the code is not conforming due >>> to different points of instantiation in two translation units. We can skip >>> uninstantiated templates since they don’t affect the behaviour of the >>> program, and we need to visit the instantiations regardless. >>> > >>> > In LLVM IR, create a new named metadata node !llvm.odr_checking which >>> contains a list of <mangled name, hash value...

...s to locals should be hashed by an ordinal number. >> > >> > Instantiated templates are also visited by the hashing visitor. If we did not, we would have false negatives where the code is not conforming due to different points of instantiation in two translation units. We can skip uninstantiated templates since they don’t affect the behaviour of the program, and we need to visit the instantiations regardless. >> > >> > In LLVM IR, create a new named metadata node !llvm.odr_checking which contains a list of <mangled name, hash value> pairs. The names do not neces...

On Mon, Feb 19, 2018 at 11:26 AM Nicolai Hähnle <nhaehnle at gmail.com> wrote: > Hi all, > > While working on some features for the AMDGPU backend -- specifically, > explicit address components for image intrinsics, which involves > generating both > > (a) a lot of intrinsics with different but somewhat regular parameter > types, and > > (b) the patterns to

Hi all, While working on some features for the AMDGPU backend -- specifically, explicit address components for image intrinsics, which involves generating both (a) a lot of intrinsics with different but somewhat regular parameter types, and (b) the patterns to select instructions for those intrinsics -- I got fed up with a lot of the TableGen bugs and limitations and set out to fix things.

...er. >>> > >>> > Instantiated templates are also visited by the hashing visitor. If we >>> did not, we would have false negatives where the code is not conforming due >>> to different points of instantiation in two translation units. We can skip >>> uninstantiated templates since they don’t affect the behaviour of the >>> program, and we need to visit the instantiations regardless. >>> > >>> > In LLVM IR, create a new named metadata node !llvm.odr_checking which >>> contains a list of <mangled name, hash value...