bsd/hfs/hfs_vfsops.c

5044 	struct BTreeIterator *iterator;       /* Shared read/write iterator, hfs_reclaim_file/xattr()
5048 	struct FSBufferDescriptor btdata;     /* Shared btdata for reading/writing extent record, same as iterator above */
5140 	struct BTreeIterator iterator;
5259 		 * iterator information from the shared extent_info structure
5261 		error = BTReplaceRecord(extent_info->fcb, extent_info->iterator,
5287 	/* Initialize iterator to search the next record */
5288 	bzero(&iterator, sizeof(iterator));
5290 		/* Copy the key from the iterator that was used to update the modified attribute record. */
5291 		xattr_key = (HFSPlusAttrKey *)&(iterator.key);
5292 		bcopy((HFSPlusAttrKey *)&(extent_info->iterator->key), xattr_key, sizeof(HFSPlusAttrKey));
5307 		extents_key = (HFSPlusExtentKey *) &(iterator.key);
5363 		error = BTSearchRecord(extent_info->fcb, &iterator, &btdata, &reclen, &iterator);
5371 			 * btree key in the iterator any longer.  This will be initialized
5474 			error = BTDeleteRecord(extent_info->fcb, &iterator);
5485 		bzero(&iterator.hint, sizeof(iterator.hint));
5491 		error = BTInsertRecord(extent_info->fcb, &iterator, &btdata, reclen);
5767 		error = BTReplaceRecord(extent_info->fcb, extent_info->iterator,
6043 	MALLOC(extent_info->iterator, struct BTreeIterator *, sizeof(struct BTreeIterator), M_TEMP, M_WAITOK);
6044 	if (extent_info->iterator == NULL) {
6048 	bzero(extent_info->iterator, sizeof(struct BTreeIterator));
6049 	key = (HFSPlusExtentKey *) &(extent_info->iterator->key);
6063 	error = BTSearchRecord(extent_info->fcb, extent_info->iterator,
6065 			extent_info->iterator);
6086 				extent_info->iterator, &(extent_info->btdata),
6111 	if (extent_info->iterator) {
6112 		FREE(extent_info->iterator, M_TEMP);
6666 	/* Initialize iterator from the extent_info structure */
6667 	MALLOC(extent_info->iterator, struct BTreeIterator *,
6669 	if (extent_info->iterator == NULL) {
6673 	bzero(extent_info->iterator, sizeof(struct BTreeIterator));
6676 	key = (HFSPlusAttrKey *)&(extent_info->iterator->key);
6706 	 * will place the iterator before the first matching record.
6709 	error = BTSearchRecord(extent_info->fcb, extent_info->iterator,
6711 			extent_info->iterator);
6725 				extent_info->iterator, &(extent_info->btdata),
6771 	if (extent_info->iterator) {
6772 		FREE(extent_info->iterator, M_TEMP);
6805 	struct BTreeIterator *iterator = NULL;
6822 	if (kmem_alloc(kernel_map, (vm_offset_t *)&iterator, sizeof(*iterator))) {
6825 	bzero(iterator, sizeof(*iterator));
6826 	key = (HFSPlusAttrKey *)&iterator->key;
6836 		error = BTIterateRecord(fcb, btree_operation, iterator, &btdata, NULL);
6914 	kmem_free(kernel_map, (vm_offset_t)iterator, sizeof(*iterator));
6934 	struct BTreeIterator *iterator = NULL;
6949 	if (kmem_alloc(kernel_map, (vm_offset_t *)&iterator, sizeof(*iterator))) {
6972 	bzero(iterator, sizeof(*iterator));
6981 		error = BTIterateRecord(fcb, btree_operation, iterator, &btdata, NULL);
7065 	if (iterator) {
7066 		kmem_free(kernel_map, (vm_offset_t)iterator, sizeof(*iterator));
7216 	struct BTreeIterator * iterator = NULL;
7258 	if (kmem_alloc(kernel_map, (vm_offset_t *)&iterator, sizeof(*iterator))) {
7261 	bzero(iterator, sizeof(*iterator));
7262 	extkeyptr = (HFSPlusExtentKey *)&iterator->key;
7276 	/* This will position the iterator just before the first overflow
7280 	error = BTSearchRecord(fcb, iterator, &btdata, NULL, iterator);
7288 	error = BTIterateRecord(fcb, kBTreeNextRecord, iterator, &btdata, NULL);
7306 		error = BTIterateRecord(fcb, kBTreeNextRecord, iterator, &btdata, NULL);
7313 	if (iterator) {
7314 		kmem_free(kernel_map, (vm_offset_t)iterator, sizeof(*iterator));