Commits


wrap overlong lines


add O_CLOEXEC (close-on-exec) to openat(2) calls suggested by millert ok thomas_adam


add O_CLOEXEC (close-on-exec) flag to open(2) calls suggested by millert ok thomas_adam


cache raw objects in order to speed up gotadmin pack


use RB_TREE instead of STAILQ to manage packindex bloom filters; much faster


use a bloom filter to avoid pointless pack index searches


fix pack index cache element rotation; keep often used entries near the front


display the requested object type when an object could not be found ok millert@


make got_repo_match_object_id() filter tags by the requested object type Potentially this function could return objects of a type that was not requested. Problem found by code inspection. This change does not affect any of our existing tests.


indentation fixes


provide separate send {} and fetch {} configuration blocks in got.conf Feature requested by naddy. ok naddy, who also suggested some tweaks that will arrive shortly


handle pack index files which lack a corresponding pack file ok millert


make got_packidx_get_packfile_path() usable for callers who only have a path


Update a code comment regarding support of the preciousObjects extension.


add support for the preciousObjects Git extension to 'gotadmin cleanup'


switch from SIMPLEQ to equivalent STAILQ macros The singly-linked tail queue macros were added to OpenBSD 6.9 and are more widely available on other systems. ok stsp


check for close(2) error in got_repo_close() and propagate errors up ok tracey


close all opened repo->gitdir_fd's and set open_repo static. ok naddy (with static change)


avoid uninitialized error being returned from got_repo_get_packfile_info()


remove unused worktree-related includes from lib/repository.c


introduce 'gotadmin info'


cap pack file cache size at 1/8 of the current open file desciptor limit


fix off-by-one in got_repo_cache_pack()


make close(2) failure checks consistent; check 'close() == -1' everywhere ok millert, naddy


switch reflist to TAILQ; insert elements more efficiently for sorted input ok naddy