82 	struct rlock *rl;  in rangelock_free()  local
88 	while ((rl = TAILQ_FIRST(&rls->rls_locks)) != NULL) {  in rangelock_free()
89 		TAILQ_REMOVE(&rls->rls_locks, rl, rl_next);  in rangelock_free()
90 		free(rl);  in rangelock_free()
98 	struct rlock *rl;  in rangelock_add()  local
102 	rl = malloc(sizeof(*rl));  in rangelock_add()
103 	if (rl == NULL)  in rangelock_add()
105 	rl->rl_start = offset;  in rangelock_add()
106 	rl->rl_end = offset + length;  in rangelock_add()
107 	TAILQ_INSERT_TAIL(&rls->rls_locks, rl, rl_next);  in rangelock_add()
114 	struct rlock *rl;  in rangelock_del()  local
118 	TAILQ_FOREACH(rl, &rls->rls_locks, rl_next) {  in rangelock_del()
119 		if (rl->rl_start == offset && rl->rl_end == offset + length)  in rangelock_del()
122 	PJDLOG_ASSERT(rl != NULL);  in rangelock_del()
123 	TAILQ_REMOVE(&rls->rls_locks, rl, rl_next);  in rangelock_del()
124 	free(rl);  in rangelock_del()
130 	struct rlock *rl;  in rangelock_islocked()  local
136 	TAILQ_FOREACH(rl, &rls->rls_locks, rl_next) {  in rangelock_islocked()
137 		if (rl->rl_start < end && rl->rl_end > offset)  in rangelock_islocked()
140 	return (rl != NULL);  in rangelock_islocked()