search for: is_point

...avior. To that end, we provide a function /// which will forcible set the seed to a fixed value. This must be done at the forcible -> forcibly template <typename T> struct is_hashable_data : integral_constant<bool, ((is_integral<T>::value || is_pointer<T>::value) && 64 % sizeof(T) == 0)> {}; Optional: I object to the leading && and propose this reflowed text: template <typename T> struct is_hashable_data : integral_constant<bool, ((is_integral<T&...

...e ref count is 0, it is linked into a list of scheduled deletions. */ typedef struct Header { unsigned flags; /* book-keeping info */ union { unsigned count; struct Header *next; } field; } BlockHeader; /* flag indicates the union contains a pointer */ #define POINTER_FLAG 0x01 #define IS_POINTER(header) (header->flags & POINTER_FLAG) #define SET_POINTER(header) header->flags |= POINTER_FLAG; #define CLEAR_POINTER(header) header->flags &= ~POINTER_FLAG; #define LINK(root, block) \ block->field.next = root;\ root = block; #define UNLINK(entry, prev) \ prev->field.n...

Again, sorry for the delay. :( On Thu, 9 Mar 2006, Sandro Magi wrote: > I've written a reference-counting garbage collector for LLVM, but I'm > still unclear on a few things. Cool! > The following piece of code that appears on > http://llvm.cs.uiuc.edu/docs/GarbageCollection.html is unclear: > > ;; As the pointer goes out of scope, store a null value into > ;;

Thanks for the feedback thus far! I've updated the header file, and enclosed a complete patch against LLVM. This passes all the regtests, and I'll be doing more thorough testing of LLVM itself with the patch. I've included some basic unit tests, but could probably do more here... Not sure it's worth delaying the initial submission though, as the best testing is to use a hash

Hello folks, TL;DR: This is my proposed hashing interface based on a proposed standard hashing interface. It also is implemented with a much faster and higher quality algorithm than the current one. This is an *early draft* of the code, looking for initial feedback. There has been recent interest in improving the quality and consistency of LLVM's approach to hashing. In particular, getting

...} + + string_ref get_name() const { return name; } + string_ref get_base_name() const override { return name; } + + void print_left(stream& s) const override + { + s += name; + } +}; + +class objcproto_name : public node +{ + node* ty; + node* protocol; + bool is_pointer; +public: + objcproto_name(node* ty, node* protocol) : ty(ty), protocol(protocol), is_pointer(false) + { + is_objcproto_name(true); + } + + bool should_set_is_pointer() + { + return ty->is_name_type() && static_cast<name_type*>(ty)->get_name() == &...