search for: paend

...struct vhost_iotlb *iotlb) 218 { 219 struct vhost_iotlb_map *map; 220 unsigned long lgcd = 0; 221 int log_entity_size; 222 unsigned long size; 223 u64 start = 0; 224 int err; 225 struct page *pg; 226 unsigned int nsg; 227 int sglen; 228 u64 pa; 229 u64 paend; 230 struct scatterlist *sg; 231 struct device *dma = mvdev->mdev->device; 232 int ret; 233 234 for (map = vhost_iotlb_itree_first(iotlb, mr->start, mr->end - 1); 235 map; map = vhost_iotlb_itree_next(map, start, mr->end - 1)) { 236 size = maplen(map...

Thanks for the example code. Its gives a good idea how the shadow stack works. But I have another question. Using the shadow stack is a nice and simple way to implement GC, but it might have a large runtime overhead per function call. Is there another way to preserve garbage specific information (gcroots) through the llvm optimizer and native code generator? This information could be used to

Hello, I want to add garbage collection support to a compiler with a llvm backend, using the shadow-stack compiler plugin. I read the GC tutorial in the LLVM documentation, and the paper about shadow-stacks. Im currently adding intrinsics to my generated llvm code, and trying to write code to connected it to my (existing) garbage collector library. Im not sure yet how everything fits together.