PostgreSQL Source Code git master
Loading...
Searching...
No Matches
buffile.c
Go to the documentation of this file.
1/*-------------------------------------------------------------------------
2 *
3 * buffile.c
4 * Management of large buffered temporary files.
5 *
6 * Portions Copyright (c) 1996-2026, PostgreSQL Global Development Group
7 * Portions Copyright (c) 1994, Regents of the University of California
8 *
9 * IDENTIFICATION
10 * src/backend/storage/file/buffile.c
11 *
12 * NOTES:
13 *
14 * BufFiles provide a very incomplete emulation of stdio atop virtual Files
15 * (as managed by fd.c). Currently, we only support the buffered-I/O
16 * aspect of stdio: a read or write of the low-level File occurs only
17 * when the buffer is filled or emptied. This is an even bigger win
18 * for virtual Files than for ordinary kernel files, since reducing the
19 * frequency with which a virtual File is touched reduces "thrashing"
20 * of opening/closing file descriptors.
21 *
22 * Note that BufFile structs are allocated with palloc(), and therefore
23 * will go away automatically at query/transaction end. Since the underlying
24 * virtual Files are made with OpenTemporaryFile, all resources for
25 * the file are certain to be cleaned up even if processing is aborted
26 * by ereport(ERROR). The data structures required are made in the
27 * palloc context that was current when the BufFile was created, and
28 * any external resources such as temp files are owned by the ResourceOwner
29 * that was current at that time.
30 *
31 * BufFile also supports temporary files that exceed the OS file size limit
32 * (by opening multiple fd.c temporary files). This is an essential feature
33 * for sorts and hashjoins on large amounts of data.
34 *
35 * BufFile supports temporary files that can be shared with other backends, as
36 * infrastructure for parallel execution. Such files need to be created as a
37 * member of a SharedFileSet that all participants are attached to.
38 *
39 * BufFile also supports temporary files that can be used by the single backend
40 * when the corresponding files need to be survived across the transaction and
41 * need to be opened and closed multiple times. Such files need to be created
42 * as a member of a FileSet.
43 *-------------------------------------------------------------------------
44 */
45
46#include "postgres.h"
47
48#include "commands/tablespace.h"
49#include "executor/instrument.h"
50#include "miscadmin.h"
51#include "pgstat.h"
52#include "storage/buffile.h"
53#include "storage/bufmgr.h"
54#include "storage/fd.h"
55#include "utils/resowner.h"
56#include "utils/wait_event.h"
57
58/*
59 * We break BufFiles into gigabyte-sized segments, regardless of RELSEG_SIZE.
60 * The reason is that we'd like large BufFiles to be spread across multiple
61 * tablespaces when available.
62 */
63#define MAX_PHYSICAL_FILESIZE 0x40000000
64#define BUFFILE_SEG_SIZE (MAX_PHYSICAL_FILESIZE / BLCKSZ)
65
66/*
67 * This data structure represents a buffered file that consists of one or
68 * more physical files (each accessed through a virtual file descriptor
69 * managed by fd.c).
70 */
71struct BufFile
72{
73 int numFiles; /* number of physical files in set */
74 /* all files except the last have length exactly MAX_PHYSICAL_FILESIZE */
75 File *files; /* palloc'd array with numFiles entries */
76
77 bool isInterXact; /* keep open over transactions? */
78 bool dirty; /* does buffer need to be written? */
79 bool readOnly; /* has the file been set to read only? */
80
81 FileSet *fileset; /* space for fileset based segment files */
82 const char *name; /* name of fileset based BufFile */
83
84 /*
85 * resowner is the ResourceOwner to use for underlying temp files. (We
86 * don't need to remember the memory context we're using explicitly,
87 * because after creation we only repalloc our arrays larger.)
88 */
90
91 /*
92 * "current pos" is position of start of buffer within the logical file.
93 * Position as seen by user of BufFile is (curFile, curOffset + pos).
94 */
95 int curFile; /* file index (0..n) part of current pos */
96 pgoff_t curOffset; /* offset part of current pos */
97 int64 pos; /* next read/write position in buffer */
98 int64 nbytes; /* total # of valid bytes in buffer */
99
100 /*
101 * XXX Should ideally use PGIOAlignedBlock, but might need a way to avoid
102 * wasting per-file alignment padding when some users create many files.
103 */
105};
106
107static BufFile *makeBufFileCommon(int nfiles);
109static void extendBufFile(BufFile *file);
110static void BufFileLoadBuffer(BufFile *file);
111static void BufFileDumpBuffer(BufFile *file);
112static void BufFileFlush(BufFile *file);
113static File MakeNewFileSetSegment(BufFile *buffile, int segment);
114
115/*
116 * Create BufFile and perform the common initialization.
117 */
118static BufFile *
120{
122
123 file->numFiles = nfiles;
124 file->isInterXact = false;
125 file->dirty = false;
127 file->curFile = 0;
128 file->curOffset = 0;
129 file->pos = 0;
130 file->nbytes = 0;
131
132 return file;
133}
134
135/*
136 * Create a BufFile given the first underlying physical file.
137 * NOTE: caller must set isInterXact if appropriate.
138 */
139static BufFile *
141{
142 BufFile *file = makeBufFileCommon(1);
143
144 file->files = palloc_object(File);
145 file->files[0] = firstfile;
146 file->readOnly = false;
147 file->fileset = NULL;
148 file->name = NULL;
149
150 return file;
151}
152
153/*
154 * Add another component temp file.
155 */
156static void
158{
159 File pfile;
160 ResourceOwner oldowner;
161
162 /* Be sure to associate the file with the BufFile's resource owner */
163 oldowner = CurrentResourceOwner;
165
166 if (file->fileset == NULL)
167 pfile = OpenTemporaryFile(file->isInterXact);
168 else
169 pfile = MakeNewFileSetSegment(file, file->numFiles);
170
171 Assert(pfile >= 0);
172
173 CurrentResourceOwner = oldowner;
174
175 file->files = (File *) repalloc(file->files,
176 (file->numFiles + 1) * sizeof(File));
177 file->files[file->numFiles] = pfile;
178 file->numFiles++;
179}
180
181/*
182 * Create a BufFile for a new temporary file (which will expand to become
183 * multiple temporary files if more than MAX_PHYSICAL_FILESIZE bytes are
184 * written to it).
185 *
186 * If interXact is true, the temp file will not be automatically deleted
187 * at end of transaction.
188 *
189 * Note: if interXact is true, the caller had better be calling us in a
190 * memory context, and with a resource owner, that will survive across
191 * transaction boundaries.
192 */
193BufFile *
194BufFileCreateTemp(bool interXact)
195{
196 BufFile *file;
197 File pfile;
198
199 /*
200 * Ensure that temp tablespaces are set up for OpenTemporaryFile to use.
201 * Possibly the caller will have done this already, but it seems useful to
202 * double-check here. Failure to do this at all would result in the temp
203 * files always getting placed in the default tablespace, which is a
204 * pretty hard-to-detect bug. Callers may prefer to do it earlier if they
205 * want to be sure that any required catalog access is done in some other
206 * resource context.
207 */
209
210 pfile = OpenTemporaryFile(interXact);
211 Assert(pfile >= 0);
212
213 file = makeBufFile(pfile);
214 file->isInterXact = interXact;
215
216 return file;
217}
218
219/*
220 * Build the name for a given segment of a given BufFile.
221 */
222static void
223FileSetSegmentName(char *name, const char *buffile_name, int segment)
224{
225 snprintf(name, MAXPGPATH, "%s.%d", buffile_name, segment);
226}
227
228/*
229 * Create a new segment file backing a fileset based BufFile.
230 */
231static File
232MakeNewFileSetSegment(BufFile *buffile, int segment)
233{
234 char name[MAXPGPATH];
235 File file;
236
237 /*
238 * It is possible that there are files left over from before a crash
239 * restart with the same name. In order for BufFileOpenFileSet() not to
240 * get confused about how many segments there are, we'll unlink the next
241 * segment number if it already exists.
242 */
243 FileSetSegmentName(name, buffile->name, segment + 1);
244 FileSetDelete(buffile->fileset, name, true);
245
246 /* Create the new segment. */
247 FileSetSegmentName(name, buffile->name, segment);
248 file = FileSetCreate(buffile->fileset, name);
249
250 /* FileSetCreate would've errored out */
251 Assert(file > 0);
252
253 return file;
254}
255
256/*
257 * Create a BufFile that can be discovered and opened read-only by other
258 * backends that are attached to the same SharedFileSet using the same name.
259 *
260 * The naming scheme for fileset based BufFiles is left up to the calling code.
261 * The name will appear as part of one or more filenames on disk, and might
262 * provide clues to administrators about which subsystem is generating
263 * temporary file data. Since each SharedFileSet object is backed by one or
264 * more uniquely named temporary directory, names don't conflict with
265 * unrelated SharedFileSet objects.
266 */
267BufFile *
268BufFileCreateFileSet(FileSet *fileset, const char *name)
269{
270 BufFile *file;
271
272 file = makeBufFileCommon(1);
273 file->fileset = fileset;
274 file->name = pstrdup(name);
275 file->files = palloc_object(File);
276 file->files[0] = MakeNewFileSetSegment(file, 0);
277 file->readOnly = false;
278
279 return file;
280}
281
282/*
283 * Open a file that was previously created in another backend (or this one)
284 * with BufFileCreateFileSet in the same FileSet using the same name.
285 * The backend that created the file must have called BufFileClose() or
286 * BufFileExportFileSet() to make sure that it is ready to be opened by other
287 * backends and render it read-only. If missing_ok is true, which indicates
288 * that missing files can be safely ignored, then return NULL if the BufFile
289 * with the given name is not found, otherwise, throw an error.
290 */
291BufFile *
292BufFileOpenFileSet(FileSet *fileset, const char *name, int mode,
293 bool missing_ok)
294{
295 BufFile *file;
297 Size capacity = 16;
298 File *files;
299 int nfiles = 0;
300
301 files = palloc_array(File, capacity);
302
303 /*
304 * We don't know how many segments there are, so we'll probe the
305 * filesystem to find out.
306 */
307 for (;;)
308 {
309 /* See if we need to expand our file segment array. */
310 if (nfiles + 1 > capacity)
311 {
312 capacity *= 2;
313 files = repalloc_array(files, File, capacity);
314 }
315 /* Try to load a segment. */
317 files[nfiles] = FileSetOpen(fileset, segment_name, mode);
318 if (files[nfiles] <= 0)
319 break;
320 ++nfiles;
321
323 }
324
325 /*
326 * If we didn't find any files at all, then no BufFile exists with this
327 * name.
328 */
329 if (nfiles == 0)
330 {
331 /* free the memory */
332 pfree(files);
333
334 if (missing_ok)
335 return NULL;
336
339 errmsg("could not open temporary file \"%s\" from BufFile \"%s\": %m",
340 segment_name, name)));
341 }
342
344 file->files = files;
345 file->readOnly = (mode == O_RDONLY);
346 file->fileset = fileset;
347 file->name = pstrdup(name);
348
349 return file;
350}
351
352/*
353 * Delete a BufFile that was created by BufFileCreateFileSet in the given
354 * FileSet using the given name.
355 *
356 * It is not necessary to delete files explicitly with this function. It is
357 * provided only as a way to delete files proactively, rather than waiting for
358 * the FileSet to be cleaned up.
359 *
360 * Only one backend should attempt to delete a given name, and should know
361 * that it exists and has been exported or closed otherwise missing_ok should
362 * be passed true.
363 */
364void
365BufFileDeleteFileSet(FileSet *fileset, const char *name, bool missing_ok)
366{
368 int segment = 0;
369 bool found = false;
370
371 /*
372 * We don't know how many segments the file has. We'll keep deleting
373 * until we run out. If we don't manage to find even an initial segment,
374 * raise an error.
375 */
376 for (;;)
377 {
379 if (!FileSetDelete(fileset, segment_name, true))
380 break;
381 found = true;
382 ++segment;
383
385 }
386
387 if (!found && !missing_ok)
388 elog(ERROR, "could not delete unknown BufFile \"%s\"", name);
389}
390
391/*
392 * BufFileExportFileSet --- flush and make read-only, in preparation for sharing.
393 */
394void
396{
397 /* Must be a file belonging to a FileSet. */
398 Assert(file->fileset != NULL);
399
400 /* It's probably a bug if someone calls this twice. */
401 Assert(!file->readOnly);
402
403 BufFileFlush(file);
404 file->readOnly = true;
405}
406
407/*
408 * Close a BufFile
409 *
410 * Like fclose(), this also implicitly FileCloses the underlying File.
411 */
412void
414{
415 int i;
416
417 /* flush any unwritten data */
418 BufFileFlush(file);
419 /* close and delete the underlying file(s) */
420 for (i = 0; i < file->numFiles; i++)
421 FileClose(file->files[i]);
422 /* release the buffer space */
423 pfree(file->files);
424 pfree(file);
425}
426
427/*
428 * BufFileLoadBuffer
429 *
430 * Load some data into buffer, if possible, starting from curOffset.
431 * At call, must have dirty = false, pos and nbytes = 0.
432 * On exit, nbytes is number of bytes loaded.
433 */
434static void
436{
440
441 /*
442 * Advance to next component file if necessary and possible.
443 */
444 if (file->curOffset >= MAX_PHYSICAL_FILESIZE &&
445 file->curFile + 1 < file->numFiles)
446 {
447 file->curFile++;
448 file->curOffset = 0;
449 }
450
451 thisfile = file->files[file->curFile];
452
453 if (track_io_timing)
455 else
457
458 /*
459 * Read whatever we can get, up to a full bufferload.
460 */
461 file->nbytes = FileRead(thisfile,
462 file->buffer.data,
463 sizeof(file->buffer.data),
464 file->curOffset,
466 if (file->nbytes < 0)
467 {
468 file->nbytes = 0;
471 errmsg("could not read file \"%s\": %m",
473 }
474
475 if (track_io_timing)
476 {
479 }
480
481 /* we choose not to advance curOffset here */
482
483 if (file->nbytes > 0)
485}
486
487/*
488 * BufFileDumpBuffer
489 *
490 * Dump buffer contents starting at curOffset.
491 * At call, should have dirty = true, nbytes > 0.
492 * On exit, dirty is cleared if successful write, and curOffset is advanced.
493 */
494static void
496{
497 int64 wpos = 0;
500
501 /*
502 * Unlike BufFileLoadBuffer, we must dump the whole buffer even if it
503 * crosses a component-file boundary; so we need a loop.
504 */
505 while (wpos < file->nbytes)
506 {
510
511 /*
512 * Advance to next component file if necessary and possible.
513 */
514 if (file->curOffset >= MAX_PHYSICAL_FILESIZE)
515 {
516 while (file->curFile + 1 >= file->numFiles)
517 extendBufFile(file);
518 file->curFile++;
519 file->curOffset = 0;
520 }
521
522 /*
523 * Determine how much we need to write into this file.
524 */
525 bytestowrite = file->nbytes - wpos;
527
530
531 thisfile = file->files[file->curFile];
532
533 if (track_io_timing)
535 else
537
539 file->buffer.data + wpos,
541 file->curOffset,
543 if (bytestowrite <= 0)
546 errmsg("could not write to file \"%s\": %m",
548
549 if (track_io_timing)
550 {
553 }
554
555 file->curOffset += bytestowrite;
557
559 }
560 file->dirty = false;
561
562 /*
563 * At this point, curOffset has been advanced to the end of the buffer,
564 * ie, its original value + nbytes. We need to make it point to the
565 * logical file position, ie, original value + pos, in case that is less
566 * (as could happen due to a small backwards seek in a dirty buffer!)
567 */
568 file->curOffset -= (file->nbytes - file->pos);
569 if (file->curOffset < 0) /* handle possible segment crossing */
570 {
571 file->curFile--;
572 Assert(file->curFile >= 0);
574 }
575
576 /*
577 * Now we can set the buffer empty without changing the logical position
578 */
579 file->pos = 0;
580 file->nbytes = 0;
581}
582
583/*
584 * BufFileRead variants
585 *
586 * Like fread() except we assume 1-byte element size and report I/O errors via
587 * ereport().
588 *
589 * If 'exact' is true, then an error is also raised if the number of bytes
590 * read is not exactly 'size' (no short reads). If 'exact' and 'eofOK' are
591 * true, then reading zero bytes is ok.
592 */
593static size_t
594BufFileReadCommon(BufFile *file, void *ptr, size_t size, bool exact, bool eofOK)
595{
596 size_t start_size = size;
597 size_t nread = 0;
598 size_t nthistime;
599
600 BufFileFlush(file);
601
602 while (size > 0)
603 {
604 if (file->pos >= file->nbytes)
605 {
606 /* Try to load more data into buffer. */
607 file->curOffset += file->pos;
608 file->pos = 0;
609 file->nbytes = 0;
610 BufFileLoadBuffer(file);
611 if (file->nbytes <= 0)
612 break; /* no more data available */
613 }
614
615 nthistime = file->nbytes - file->pos;
616 if (nthistime > size)
617 nthistime = size;
618 Assert(nthistime > 0);
619
620 memcpy(ptr, file->buffer.data + file->pos, nthistime);
621
622 file->pos += nthistime;
623 ptr = (char *) ptr + nthistime;
624 size -= nthistime;
625 nread += nthistime;
626 }
627
628 if (exact &&
629 (nread != start_size && !(nread == 0 && eofOK)))
632 file->name ?
633 errmsg("could not read from file set \"%s\": read only %zu of %zu bytes",
634 file->name, nread, start_size) :
635 errmsg("could not read from temporary file: read only %zu of %zu bytes",
636 nread, start_size));
637
638 return nread;
639}
640
641/*
642 * Legacy interface where the caller needs to check for end of file or short
643 * reads.
644 */
645size_t
646BufFileRead(BufFile *file, void *ptr, size_t size)
647{
648 return BufFileReadCommon(file, ptr, size, false, false);
649}
650
651/*
652 * Require read of exactly the specified size.
653 */
654void
655BufFileReadExact(BufFile *file, void *ptr, size_t size)
656{
657 BufFileReadCommon(file, ptr, size, true, false);
658}
659
660/*
661 * Require read of exactly the specified size, but optionally allow end of
662 * file (in which case 0 is returned).
663 */
664size_t
665BufFileReadMaybeEOF(BufFile *file, void *ptr, size_t size, bool eofOK)
666{
667 return BufFileReadCommon(file, ptr, size, true, eofOK);
668}
669
670/*
671 * BufFileWrite
672 *
673 * Like fwrite() except we assume 1-byte element size and report errors via
674 * ereport().
675 */
676void
677BufFileWrite(BufFile *file, const void *ptr, size_t size)
678{
679 size_t nthistime;
680
681 Assert(!file->readOnly);
682
683 while (size > 0)
684 {
685 if (file->pos >= BLCKSZ)
686 {
687 /* Buffer full, dump it out */
688 if (file->dirty)
689 BufFileDumpBuffer(file);
690 else
691 {
692 /* Hmm, went directly from reading to writing? */
693 file->curOffset += file->pos;
694 file->pos = 0;
695 file->nbytes = 0;
696 }
697 }
698
699 nthistime = BLCKSZ - file->pos;
700 if (nthistime > size)
701 nthistime = size;
702 Assert(nthistime > 0);
703
704 memcpy(file->buffer.data + file->pos, ptr, nthistime);
705
706 file->dirty = true;
707 file->pos += nthistime;
708 if (file->nbytes < file->pos)
709 file->nbytes = file->pos;
710 ptr = (const char *) ptr + nthistime;
711 size -= nthistime;
712 }
713}
714
715/*
716 * BufFileFlush
717 *
718 * Like fflush(), except that I/O errors are reported with ereport().
719 */
720static void
722{
723 if (file->dirty)
724 BufFileDumpBuffer(file);
725
726 Assert(!file->dirty);
727}
728
729/*
730 * BufFileSeek
731 *
732 * Like fseek(), except that target position needs two values in order to
733 * work when logical filesize exceeds maximum value representable by pgoff_t.
734 * We do not support relative seeks across more than that, however.
735 * I/O errors are reported by ereport().
736 *
737 * Result is 0 if OK, EOF if not. Logical position is not moved if an
738 * impossible seek is attempted.
739 */
740int
741BufFileSeek(BufFile *file, int fileno, pgoff_t offset, int whence)
742{
743 int newFile;
745
746 switch (whence)
747 {
748 case SEEK_SET:
749 if (fileno < 0)
750 return EOF;
751 newFile = fileno;
752 newOffset = offset;
753 break;
754 case SEEK_CUR:
755
756 /*
757 * Relative seek considers only the signed offset, ignoring
758 * fileno.
759 */
760 newFile = file->curFile;
761 newOffset = (file->curOffset + file->pos) + offset;
762 break;
763 case SEEK_END:
764
765 /*
766 * The file size of the last file gives us the end offset of that
767 * file.
768 */
769 newFile = file->numFiles - 1;
770 newOffset = FileSize(file->files[file->numFiles - 1]);
771 if (newOffset < 0)
774 errmsg("could not determine size of temporary file \"%s\" from BufFile \"%s\": %m",
775 FilePathName(file->files[file->numFiles - 1]),
776 file->name)));
777 break;
778 default:
779 elog(ERROR, "invalid whence: %d", whence);
780 return EOF;
781 }
782 while (newOffset < 0)
783 {
784 if (--newFile < 0)
785 return EOF;
787 }
788 if (newFile == file->curFile &&
789 newOffset >= file->curOffset &&
790 newOffset <= file->curOffset + file->nbytes)
791 {
792 /*
793 * Seek is to a point within existing buffer; we can just adjust
794 * pos-within-buffer, without flushing buffer. Note this is OK
795 * whether reading or writing, but buffer remains dirty if we were
796 * writing.
797 */
798 file->pos = (int64) (newOffset - file->curOffset);
799 return 0;
800 }
801 /* Otherwise, must reposition buffer, so flush any dirty data */
802 BufFileFlush(file);
803
804 /*
805 * At this point and no sooner, check for seek past last segment. The
806 * above flush could have created a new segment, so checking sooner would
807 * not work (at least not with this code).
808 */
809
810 /* convert seek to "start of next seg" to "end of last seg" */
811 if (newFile == file->numFiles && newOffset == 0)
812 {
813 newFile--;
815 }
817 {
818 if (++newFile >= file->numFiles)
819 return EOF;
821 }
822 if (newFile >= file->numFiles)
823 return EOF;
824 /* Seek is OK! */
825 file->curFile = newFile;
826 file->curOffset = newOffset;
827 file->pos = 0;
828 file->nbytes = 0;
829 return 0;
830}
831
832void
833BufFileTell(BufFile *file, int *fileno, pgoff_t *offset)
834{
835 *fileno = file->curFile;
836 *offset = file->curOffset + file->pos;
837}
838
839/*
840 * BufFileSeekBlock --- block-oriented seek
841 *
842 * Performs absolute seek to the start of the n'th BLCKSZ-sized block of
843 * the file. Note that users of this interface will fail if their files
844 * exceed BLCKSZ * PG_INT64_MAX bytes, but that is quite a lot; we don't
845 * work with tables bigger than that, either...
846 *
847 * Result is 0 if OK, EOF if not. Logical position is not moved if an
848 * impossible seek is attempted.
849 */
850int
852{
853 return BufFileSeek(file,
854 (int) (blknum / BUFFILE_SEG_SIZE),
856 SEEK_SET);
857}
858
859/*
860 * Returns the amount of data in the given BufFile, in bytes.
861 *
862 * Returned value includes the size of any holes left behind by BufFileAppend.
863 * ereport()s on failure.
864 */
865int64
867{
869
870 /* Get the size of the last physical file. */
871 lastFileSize = FileSize(file->files[file->numFiles - 1]);
872 if (lastFileSize < 0)
875 errmsg("could not determine size of temporary file \"%s\" from BufFile \"%s\": %m",
876 FilePathName(file->files[file->numFiles - 1]),
877 file->name)));
878
879 return ((file->numFiles - 1) * (int64) MAX_PHYSICAL_FILESIZE) +
881}
882
883/*
884 * Append the contents of the source file to the end of the target file.
885 *
886 * Note that operation subsumes ownership of underlying resources from
887 * "source". Caller should never call BufFileClose against source having
888 * called here first. Resource owners for source and target must match,
889 * too.
890 *
891 * This operation works by manipulating lists of segment files, so the
892 * file content is always appended at a MAX_PHYSICAL_FILESIZE-aligned
893 * boundary, typically creating empty holes before the boundary. These
894 * areas do not contain any interesting data, and cannot be read from by
895 * caller.
896 *
897 * Returns the block number within target where the contents of source
898 * begins. Caller should apply this as an offset when working off block
899 * positions that are in terms of the original BufFile space.
900 */
901int64
903{
905 int newNumFiles = target->numFiles + source->numFiles;
906 int i;
907
908 Assert(source->readOnly);
909 Assert(!source->dirty);
910
911 if (target->resowner != source->resowner)
912 elog(ERROR, "could not append BufFile with non-matching resource owner");
913
914 target->files = (File *)
915 repalloc(target->files, sizeof(File) * newNumFiles);
916 for (i = target->numFiles; i < newNumFiles; i++)
917 target->files[i] = source->files[i - target->numFiles];
918 target->numFiles = newNumFiles;
919
920 return startBlock;
921}
922
923/*
924 * Truncate a BufFile created by BufFileCreateFileSet up to the given fileno
925 * and the offset.
926 */
927void
928BufFileTruncateFileSet(BufFile *file, int fileno, pgoff_t offset)
929{
930 int numFiles = file->numFiles;
931 int newFile = fileno;
934 int i;
935
936 /*
937 * Loop over all the files up to the given fileno and remove the files
938 * that are greater than the fileno and truncate the given file up to the
939 * offset. Note that we also remove the given fileno if the offset is 0
940 * provided it is not the first file in which we truncate it.
941 */
942 for (i = file->numFiles - 1; i >= fileno; i--)
943 {
944 if ((i != fileno || offset == 0) && i != 0)
945 {
947 FileClose(file->files[i]);
948 if (!FileSetDelete(file->fileset, segment_name, true))
951 errmsg("could not delete fileset \"%s\": %m",
952 segment_name)));
953 numFiles--;
955
956 /*
957 * This is required to indicate that we have deleted the given
958 * fileno.
959 */
960 if (i == fileno)
961 newFile--;
962 }
963 else
964 {
965 if (FileTruncate(file->files[i], offset,
969 errmsg("could not truncate file \"%s\": %m",
970 FilePathName(file->files[i]))));
971 newOffset = offset;
972 }
973 }
974
975 file->numFiles = numFiles;
976
977 /*
978 * If the truncate point is within existing buffer then we can just adjust
979 * pos within buffer.
980 */
981 if (newFile == file->curFile &&
982 newOffset >= file->curOffset &&
983 newOffset <= file->curOffset + file->nbytes)
984 {
985 /* No need to reset the current pos if the new pos is greater. */
986 if (newOffset <= file->curOffset + file->pos)
987 file->pos = (int64) newOffset - file->curOffset;
988
989 /* Adjust the nbytes for the current buffer. */
990 file->nbytes = (int64) newOffset - file->curOffset;
991 }
992 else if (newFile == file->curFile &&
993 newOffset < file->curOffset)
994 {
995 /*
996 * The truncate point is within the existing file but prior to the
997 * current position, so we can forget the current buffer and reset the
998 * current position.
999 */
1000 file->curOffset = newOffset;
1001 file->pos = 0;
1002 file->nbytes = 0;
1003 }
1004 else if (newFile < file->curFile)
1005 {
1006 /*
1007 * The truncate point is prior to the current file, so need to reset
1008 * the current position accordingly.
1009 */
1010 file->curFile = newFile;
1011 file->curOffset = newOffset;
1012 file->pos = 0;
1013 file->nbytes = 0;
1014 }
1015 /* Nothing to do, if the truncate point is beyond current file. */
1016}
void PrepareTempTablespaces(void)
BufFile * BufFileOpenFileSet(FileSet *fileset, const char *name, int mode, bool missing_ok)
Definition buffile.c:292
int BufFileSeekBlock(BufFile *file, int64 blknum)
Definition buffile.c:851
void BufFileExportFileSet(BufFile *file)
Definition buffile.c:395
size_t BufFileRead(BufFile *file, void *ptr, size_t size)
Definition buffile.c:646
void BufFileReadExact(BufFile *file, void *ptr, size_t size)
Definition buffile.c:655
static void FileSetSegmentName(char *name, const char *buffile_name, int segment)
Definition buffile.c:223
static BufFile * makeBufFileCommon(int nfiles)
Definition buffile.c:119
BufFile * BufFileCreateTemp(bool interXact)
Definition buffile.c:194
#define BUFFILE_SEG_SIZE
Definition buffile.c:64
static void BufFileLoadBuffer(BufFile *file)
Definition buffile.c:435
static File MakeNewFileSetSegment(BufFile *buffile, int segment)
Definition buffile.c:232
static void extendBufFile(BufFile *file)
Definition buffile.c:157
#define MAX_PHYSICAL_FILESIZE
Definition buffile.c:63
static void BufFileFlush(BufFile *file)
Definition buffile.c:721
int BufFileSeek(BufFile *file, int fileno, pgoff_t offset, int whence)
Definition buffile.c:741
void BufFileWrite(BufFile *file, const void *ptr, size_t size)
Definition buffile.c:677
size_t BufFileReadMaybeEOF(BufFile *file, void *ptr, size_t size, bool eofOK)
Definition buffile.c:665
BufFile * BufFileCreateFileSet(FileSet *fileset, const char *name)
Definition buffile.c:268
void BufFileTruncateFileSet(BufFile *file, int fileno, pgoff_t offset)
Definition buffile.c:928
void BufFileTell(BufFile *file, int *fileno, pgoff_t *offset)
Definition buffile.c:833
int64 BufFileSize(BufFile *file)
Definition buffile.c:866
static BufFile * makeBufFile(File firstfile)
Definition buffile.c:140
static size_t BufFileReadCommon(BufFile *file, void *ptr, size_t size, bool exact, bool eofOK)
Definition buffile.c:594
void BufFileClose(BufFile *file)
Definition buffile.c:413
int64 BufFileAppend(BufFile *target, BufFile *source)
Definition buffile.c:902
void BufFileDeleteFileSet(FileSet *fileset, const char *name, bool missing_ok)
Definition buffile.c:365
static void BufFileDumpBuffer(BufFile *file)
Definition buffile.c:495
bool track_io_timing
Definition bufmgr.c:192
#define Assert(condition)
Definition c.h:945
int64_t int64
Definition c.h:615
size_t Size
Definition c.h:691
int errcode_for_file_access(void)
Definition elog.c:897
#define ERROR
Definition elog.h:39
#define elog(elevel,...)
Definition elog.h:226
#define ereport(elevel,...)
Definition elog.h:150
char * FilePathName(File file)
Definition fd.c:2500
pgoff_t FileSize(File file)
Definition fd.c:2448
void FileClose(File file)
Definition fd.c:1966
int FileTruncate(File file, pgoff_t offset, uint32 wait_event_info)
Definition fd.c:2465
File OpenTemporaryFile(bool interXact)
Definition fd.c:1712
static ssize_t FileRead(File file, void *buffer, size_t amount, pgoff_t offset, uint32 wait_event_info)
Definition fd.h:225
static ssize_t FileWrite(File file, const void *buffer, size_t amount, pgoff_t offset, uint32 wait_event_info)
Definition fd.h:237
int File
Definition fd.h:51
#define palloc_object(type)
Definition fe_memutils.h:74
#define repalloc_array(pointer, type, count)
Definition fe_memutils.h:78
#define palloc_array(type, count)
Definition fe_memutils.h:76
File FileSetOpen(FileSet *fileset, const char *name, int mode)
Definition fileset.c:120
bool FileSetDelete(FileSet *fileset, const char *name, bool error_on_failure)
Definition fileset.c:137
File FileSetCreate(FileSet *fileset, const char *name)
Definition fileset.c:92
#define INSTR_TIME_SET_CURRENT(t)
Definition instr_time.h:122
#define INSTR_TIME_SET_ZERO(t)
Definition instr_time.h:171
#define INSTR_TIME_ACCUM_DIFF(x, y, z)
Definition instr_time.h:180
BufferUsage pgBufferUsage
Definition instrument.c:20
int i
Definition isn.c:77
char * pstrdup(const char *in)
Definition mcxt.c:1781
void * repalloc(void *pointer, Size size)
Definition mcxt.c:1632
void pfree(void *pointer)
Definition mcxt.c:1616
#define CHECK_FOR_INTERRUPTS()
Definition miscadmin.h:123
static char * errmsg
static PgChecksumMode mode
#define MAXPGPATH
static rewind_source * source
Definition pg_rewind.c:89
#define snprintf
Definition port.h:260
off_t pgoff_t
Definition port.h:421
static int fb(int x)
ResourceOwner CurrentResourceOwner
Definition resowner.c:173
PGAlignedBlock buffer
Definition buffile.c:104
int64 nbytes
Definition buffile.c:98
int numFiles
Definition buffile.c:73
bool dirty
Definition buffile.c:78
FileSet * fileset
Definition buffile.c:81
File * files
Definition buffile.c:75
ResourceOwner resowner
Definition buffile.c:89
pgoff_t curOffset
Definition buffile.c:96
bool isInterXact
Definition buffile.c:77
bool readOnly
Definition buffile.c:79
int curFile
Definition buffile.c:95
int64 pos
Definition buffile.c:97
const char * name
Definition buffile.c:82
instr_time temp_blk_write_time
Definition instrument.h:41
instr_time temp_blk_read_time
Definition instrument.h:40
int64 temp_blks_read
Definition instrument.h:34
int64 temp_blks_written
Definition instrument.h:35
char data[BLCKSZ]
Definition c.h:1206
#define wpos(wep)
Definition tsrank.c:27
const char * name