PostgreSQL Source Code  git master
pgstat_shmem.c
Go to the documentation of this file.
1 /* -------------------------------------------------------------------------
2  *
3  * pgstat_shmem.c
4  * Storage of stats entries in shared memory
5  *
6  * Copyright (c) 2001-2022, PostgreSQL Global Development Group
7  *
8  * IDENTIFICATION
9  * src/backend/utils/activity/pgstat_shmem.c
10  * -------------------------------------------------------------------------
11  */
12 
13 #include "postgres.h"
14 
15 #include "pgstat.h"
16 #include "storage/shmem.h"
17 #include "utils/memutils.h"
18 #include "utils/pgstat_internal.h"
19 
20 
21 #define PGSTAT_ENTRY_REF_HASH_SIZE 128
22 
23 /* hash table entry for finding the PgStat_EntryRef for a key */
25 {
26  PgStat_HashKey key; /* hash key */
27  char status; /* for simplehash use */
30 
31 
32 /* for references to shared statistics entries */
33 #define SH_PREFIX pgstat_entry_ref_hash
34 #define SH_ELEMENT_TYPE PgStat_EntryRefHashEntry
35 #define SH_KEY_TYPE PgStat_HashKey
36 #define SH_KEY key
37 #define SH_HASH_KEY(tb, key) \
38  pgstat_hash_hash_key(&key, sizeof(PgStat_HashKey), NULL)
39 #define SH_EQUAL(tb, a, b) \
40  pgstat_cmp_hash_key(&a, &b, sizeof(PgStat_HashKey), NULL) == 0
41 #define SH_SCOPE static inline
42 #define SH_DEFINE
43 #define SH_DECLARE
44 #include "lib/simplehash.h"
45 
46 
47 static void pgstat_drop_database_and_contents(Oid dboid);
48 
50 
51 static void pgstat_release_entry_ref(PgStat_HashKey key, PgStat_EntryRef *entry_ref, bool discard_pending);
52 static bool pgstat_need_entry_refs_gc(void);
53 static void pgstat_gc_entry_refs(void);
54 static void pgstat_release_all_entry_refs(bool discard_pending);
56 static void pgstat_release_matching_entry_refs(bool discard_pending, ReleaseMatchCB match, Datum match_data);
57 
58 static void pgstat_setup_memcxt(void);
59 
60 
61 /* parameter for the shared hash */
62 static const dshash_parameters dsh_params = {
63  sizeof(PgStat_HashKey),
64  sizeof(PgStatShared_HashEntry),
68 };
69 
70 
71 /*
72  * Backend local references to shared stats entries. If there are pending
73  * updates to a stats entry, the PgStat_EntryRef is added to the pgStatPending
74  * list.
75  *
76  * When a stats entry is dropped each backend needs to release its reference
77  * to it before the memory can be released. To trigger that
78  * pgStatLocal.shmem->gc_request_count is incremented - which each backend
79  * compares to their copy of pgStatSharedRefAge on a regular basis.
80  */
81 static pgstat_entry_ref_hash_hash *pgStatEntryRefHash = NULL;
82 static int pgStatSharedRefAge = 0; /* cache age of pgStatShmLookupCache */
83 
84 /*
85  * Memory contexts containing the pgStatEntryRefHash table and the
86  * pgStatSharedRef entries respectively. Kept separate to make it easier to
87  * track / attribute memory usage.
88  */
91 
92 
93 /* ------------------------------------------------------------
94  * Public functions called from postmaster follow
95  * ------------------------------------------------------------
96  */
97 
98 /*
99  * The size of the shared memory allocation for stats stored in the shared
100  * stats hash table. This allocation will be done as part of the main shared
101  * memory, rather than dynamic shared memory, allowing it to be initialized in
102  * postmaster.
103  */
104 static Size
106 {
107  Size sz;
108 
109  /*
110  * The dshash header / initial buckets array needs to fit into "plain"
111  * shared memory, but it's beneficial to not need dsm segments
112  * immediately. A size of 256kB seems works well and is not
113  * disproportional compared to other constant sized shared memory
114  * allocations. NB: To avoid DSMs further, the user can configure
115  * min_dynamic_shared_memory.
116  */
117  sz = 256 * 1024;
118  Assert(dsa_minimum_size() <= sz);
119  return MAXALIGN(sz);
120 }
121 
122 /*
123  * Compute shared memory space needed for cumulative statistics
124  */
125 Size
127 {
128  Size sz;
129 
130  sz = MAXALIGN(sizeof(PgStat_ShmemControl));
131  sz = add_size(sz, pgstat_dsa_init_size());
132 
133  return sz;
134 }
135 
136 /*
137  * Initialize cumulative statistics system during startup
138  */
139 void
141 {
142  bool found;
143  Size sz;
144 
145  sz = StatsShmemSize();
147  ShmemInitStruct("Shared Memory Stats", sz, &found);
148 
149  if (!IsUnderPostmaster)
150  {
151  dsa_area *dsa;
152  dshash_table *dsh;
154  char *p = (char *) ctl;
155 
156  Assert(!found);
157 
158  /* the allocation of pgStatLocal.shmem itself */
159  p += MAXALIGN(sizeof(PgStat_ShmemControl));
160 
161  /*
162  * Create a small dsa allocation in plain shared memory. This is
163  * required because postmaster cannot use dsm segments. It also
164  * provides a small efficiency win.
165  */
166  ctl->raw_dsa_area = p;
171  dsa_pin(dsa);
172 
173  /*
174  * To ensure dshash is created in "plain" shared memory, temporarily
175  * limit size of dsa to the initial size of the dsa.
176  */
178 
179  /*
180  * With the limit in place, create the dshash table. XXX: It'd be nice
181  * if there were dshash_create_in_place().
182  */
183  dsh = dshash_create(dsa, &dsh_params, 0);
185 
186  /* lift limit set above */
187  dsa_set_size_limit(dsa, -1);
188 
189  /*
190  * Postmaster will never access these again, thus free the local
191  * dsa/dshash references.
192  */
193  dshash_detach(dsh);
194  dsa_detach(dsa);
195 
197 
198 
199  /* initialize fixed-numbered stats */
205  }
206  else
207  {
208  Assert(found);
209  }
210 }
211 
212 void
214 {
215  MemoryContext oldcontext;
216 
217  Assert(pgStatLocal.dsa == NULL);
218 
219  /* stats shared memory persists for the backend lifetime */
221 
223  NULL);
225 
228 
229  MemoryContextSwitchTo(oldcontext);
230 }
231 
232 void
234 {
236 
237  /* we shouldn't leave references to shared stats */
239 
241  pgStatLocal.shared_hash = NULL;
242 
244  pgStatLocal.dsa = NULL;
245 }
246 
247 
248 /* ------------------------------------------------------------
249  * Maintenance of shared memory stats entries
250  * ------------------------------------------------------------
251  */
252 
255  PgStatShared_HashEntry *shhashent)
256 {
257  /* Create new stats entry. */
258  dsa_pointer chunk;
259  PgStatShared_Common *shheader;
260 
261  /*
262  * Initialize refcount to 1, marking it as valid / not dropped. The entry
263  * can't be freed before the initialization because it can't be found as
264  * long as we hold the dshash partition lock. Caller needs to increase
265  * further if a longer lived reference is needed.
266  */
267  pg_atomic_init_u32(&shhashent->refcount, 1);
268  shhashent->dropped = false;
269 
270  chunk = dsa_allocate0(pgStatLocal.dsa, pgstat_get_kind_info(kind)->shared_size);
271  shheader = dsa_get_address(pgStatLocal.dsa, chunk);
272  shheader->magic = 0xdeadbeef;
273 
274  /* Link the new entry from the hash entry. */
275  shhashent->body = chunk;
276 
278 
279  return shheader;
280 }
281 
282 static PgStatShared_Common *
284 {
285  PgStatShared_Common *shheader;
286 
287  shheader = dsa_get_address(pgStatLocal.dsa, shhashent->body);
288 
289  /* mark as not dropped anymore */
290  pg_atomic_fetch_add_u32(&shhashent->refcount, 1);
291  shhashent->dropped = false;
292 
293  /* reinitialize content */
294  Assert(shheader->magic == 0xdeadbeef);
295  memset(pgstat_get_entry_data(kind, shheader), 0,
296  pgstat_get_entry_len(kind));
297 
298  return shheader;
299 }
300 
301 static void
303 {
304  if (likely(pgStatEntryRefHash != NULL))
305  return;
306 
308  pgstat_entry_ref_hash_create(pgStatEntryRefHashContext,
312 }
313 
314 /*
315  * Helper function for pgstat_get_entry_ref().
316  */
317 static void
319  PgStatShared_HashEntry *shhashent,
320  PgStatShared_Common *shheader)
321 {
322  Assert(shheader->magic == 0xdeadbeef);
323  Assert(pg_atomic_read_u32(&shhashent->refcount) > 0);
324 
325  pg_atomic_fetch_add_u32(&shhashent->refcount, 1);
326 
328 
329  entry_ref->shared_stats = shheader;
330  entry_ref->shared_entry = shhashent;
331 }
332 
333 /*
334  * Helper function for pgstat_get_entry_ref().
335  */
336 static bool
338 {
339  bool found;
340  PgStat_EntryRefHashEntry *cache_entry;
341 
342  /*
343  * We immediately insert a cache entry, because it avoids 1) multiple
344  * hashtable lookups in case of a cache miss 2) having to deal with
345  * out-of-memory errors after incrementing PgStatShared_Common->refcount.
346  */
347 
348  cache_entry = pgstat_entry_ref_hash_insert(pgStatEntryRefHash, key, &found);
349 
350  if (!found || !cache_entry->entry_ref)
351  {
352  PgStat_EntryRef *entry_ref;
353 
354  cache_entry->entry_ref = entry_ref =
356  sizeof(PgStat_EntryRef));
357  entry_ref->shared_stats = NULL;
358  entry_ref->shared_entry = NULL;
359  entry_ref->pending = NULL;
360 
361  found = false;
362  }
363  else if (cache_entry->entry_ref->shared_stats == NULL)
364  {
365  Assert(cache_entry->entry_ref->pending == NULL);
366  found = false;
367  }
368  else
369  {
371 
372  entry_ref = cache_entry->entry_ref;
373  Assert(entry_ref->shared_entry != NULL);
374  Assert(entry_ref->shared_stats != NULL);
375 
376  Assert(entry_ref->shared_stats->magic == 0xdeadbeef);
377  /* should have at least our reference */
378  Assert(pg_atomic_read_u32(&entry_ref->shared_entry->refcount) > 0);
379  }
380 
381  *entry_ref_p = cache_entry->entry_ref;
382  return found;
383 }
384 
385 /*
386  * Get a shared stats reference. If create is true, the shared stats object is
387  * created if it does not exist.
388  *
389  * When create is true, and created_entry is non-NULL, it'll be set to true
390  * if the entry is newly created, false otherwise.
391  */
393 pgstat_get_entry_ref(PgStat_Kind kind, Oid dboid, Oid objoid, bool create,
394  bool *created_entry)
395 {
396  PgStat_HashKey key = {.kind = kind,.dboid = dboid,.objoid = objoid};
397  PgStatShared_HashEntry *shhashent;
398  PgStatShared_Common *shheader = NULL;
399  PgStat_EntryRef *entry_ref;
400 
401  /*
402  * passing in created_entry only makes sense if we possibly could create
403  * entry.
404  */
405  AssertArg(create || created_entry == NULL);
407  Assert(pgStatLocal.shared_hash != NULL);
409 
412 
413  if (created_entry != NULL)
414  *created_entry = false;
415 
416  /*
417  * Check if other backends dropped stats that could not be deleted because
418  * somebody held references to it. If so, check this backend's references.
419  * This is not expected to happen often. The location of the check is a
420  * bit random, but this is a relatively frequently called path, so better
421  * than most.
422  */
425 
426  /*
427  * First check the lookup cache hashtable in local memory. If we find a
428  * match here we can avoid taking locks / causing contention.
429  */
430  if (pgstat_get_entry_ref_cached(key, &entry_ref))
431  return entry_ref;
432 
433  Assert(entry_ref != NULL);
434 
435  /*
436  * Do a lookup in the hash table first - it's quite likely that the entry
437  * already exists, and that way we only need a shared lock.
438  */
439  shhashent = dshash_find(pgStatLocal.shared_hash, &key, false);
440 
441  if (create && !shhashent)
442  {
443  bool shfound;
444 
445  /*
446  * It's possible that somebody created the entry since the above
447  * lookup. If so, fall through to the same path as if we'd have if it
448  * already had been created before the dshash_find() calls.
449  */
450  shhashent = dshash_find_or_insert(pgStatLocal.shared_hash, &key, &shfound);
451  if (!shfound)
452  {
453  shheader = pgstat_init_entry(kind, shhashent);
454  pgstat_acquire_entry_ref(entry_ref, shhashent, shheader);
455 
456  if (created_entry != NULL)
457  *created_entry = true;
458 
459  return entry_ref;
460  }
461  }
462 
463  if (!shhashent)
464  {
465  /*
466  * If we're not creating, delete the reference again. In all
467  * likelihood it's just a stats lookup - no point wasting memory for a
468  * shared ref to nothing...
469  */
470  pgstat_release_entry_ref(key, entry_ref, false);
471 
472  return NULL;
473  }
474  else
475  {
476  /*
477  * Can get here either because dshash_find() found a match, or if
478  * dshash_find_or_insert() found a concurrently inserted entry.
479  */
480 
481  if (shhashent->dropped && create)
482  {
483  /*
484  * There are legitimate cases where the old stats entry might not
485  * yet have been dropped by the time it's reused. The most obvious
486  * case are replication slot stats, where a new slot can be
487  * created with the same index just after dropping. But oid
488  * wraparound can lead to other cases as well. We just reset the
489  * stats to their plain state.
490  */
491  shheader = pgstat_reinit_entry(kind, shhashent);
492  pgstat_acquire_entry_ref(entry_ref, shhashent, shheader);
493 
494  if (created_entry != NULL)
495  *created_entry = true;
496 
497  return entry_ref;
498  }
499  else if (shhashent->dropped)
500  {
502  pgstat_release_entry_ref(key, entry_ref, false);
503 
504  return NULL;
505  }
506  else
507  {
508  shheader = dsa_get_address(pgStatLocal.dsa, shhashent->body);
509  pgstat_acquire_entry_ref(entry_ref, shhashent, shheader);
510 
511  return entry_ref;
512  }
513  }
514 }
515 
516 static void
518  bool discard_pending)
519 {
520  if (entry_ref && entry_ref->pending)
521  {
522  if (discard_pending)
523  pgstat_delete_pending_entry(entry_ref);
524  else
525  elog(ERROR, "releasing ref with pending data");
526  }
527 
528  if (entry_ref && entry_ref->shared_stats)
529  {
530  Assert(entry_ref->shared_stats->magic == 0xdeadbeef);
531  Assert(entry_ref->pending == NULL);
532 
533  /*
534  * This can't race with another backend looking up the stats entry and
535  * increasing the refcount because it is not "legal" to create
536  * additional references to dropped entries.
537  */
538  if (pg_atomic_fetch_sub_u32(&entry_ref->shared_entry->refcount, 1) == 1)
539  {
540  PgStatShared_HashEntry *shent;
541 
542  /*
543  * We're the last referrer to this entry, try to drop the shared
544  * entry.
545  */
546 
547  /* only dropped entries can reach a 0 refcount */
548  Assert(entry_ref->shared_entry->dropped);
549 
551  &entry_ref->shared_entry->key,
552  true);
553  if (!shent)
554  elog(ERROR, "could not find just referenced shared stats entry");
555 
556  Assert(pg_atomic_read_u32(&entry_ref->shared_entry->refcount) == 0);
557  Assert(entry_ref->shared_entry == shent);
558 
559  pgstat_free_entry(shent, NULL);
560  }
561  }
562 
563  if (!pgstat_entry_ref_hash_delete(pgStatEntryRefHash, key))
564  elog(ERROR, "entry ref vanished before deletion");
565 
566  if (entry_ref)
567  pfree(entry_ref);
568 }
569 
570 bool
571 pgstat_lock_entry(PgStat_EntryRef *entry_ref, bool nowait)
572 {
573  LWLock *lock = &entry_ref->shared_stats->lock;
574 
575  if (nowait)
577 
579  return true;
580 }
581 
582 void
584 {
585  LWLockRelease(&entry_ref->shared_stats->lock);
586 }
587 
588 /*
589  * Helper function to fetch and lock shared stats.
590  */
593  bool nowait)
594 {
595  PgStat_EntryRef *entry_ref;
596 
597  /* find shared table stats entry corresponding to the local entry */
598  entry_ref = pgstat_get_entry_ref(kind, dboid, objoid, true, NULL);
599 
600  /* lock the shared entry to protect the content, skip if failed */
601  if (!pgstat_lock_entry(entry_ref, nowait))
602  return NULL;
603 
604  return entry_ref;
605 }
606 
607 void
609 {
611 }
612 
613 static bool
615 {
616  uint64 curage;
617 
618  if (!pgStatEntryRefHash)
619  return false;
620 
621  /* should have been initialized when creating pgStatEntryRefHash */
623 
625 
626  return pgStatSharedRefAge != curage;
627 }
628 
629 static void
631 {
632  pgstat_entry_ref_hash_iterator i;
634  uint64 curage;
635 
637  Assert(curage != 0);
638 
639  /*
640  * Some entries have been dropped. Invalidate cache pointer to them.
641  */
642  pgstat_entry_ref_hash_start_iterate(pgStatEntryRefHash, &i);
643  while ((ent = pgstat_entry_ref_hash_iterate(pgStatEntryRefHash, &i)) != NULL)
644  {
645  PgStat_EntryRef *entry_ref = ent->entry_ref;
646 
647  Assert(!entry_ref->shared_stats ||
648  entry_ref->shared_stats->magic == 0xdeadbeef);
649 
650  if (!entry_ref->shared_entry->dropped)
651  continue;
652 
653  /* cannot gc shared ref that has pending data */
654  if (entry_ref->pending != NULL)
655  continue;
656 
657  pgstat_release_entry_ref(ent->key, entry_ref, false);
658  }
659 
660  pgStatSharedRefAge = curage;
661 }
662 
663 static void
665  Datum match_data)
666 {
667  pgstat_entry_ref_hash_iterator i;
669 
670  if (pgStatEntryRefHash == NULL)
671  return;
672 
673  pgstat_entry_ref_hash_start_iterate(pgStatEntryRefHash, &i);
674 
675  while ((ent = pgstat_entry_ref_hash_iterate(pgStatEntryRefHash, &i))
676  != NULL)
677  {
678  Assert(ent->entry_ref != NULL);
679 
680  if (match && !match(ent, match_data))
681  continue;
682 
683  pgstat_release_entry_ref(ent->key, ent->entry_ref, discard_pending);
684  }
685 }
686 
687 /*
688  * Release all local references to shared stats entries.
689  *
690  * When a process exits it cannot do so while still holding references onto
691  * stats entries, otherwise the shared stats entries could never be freed.
692  */
693 static void
694 pgstat_release_all_entry_refs(bool discard_pending)
695 {
696  if (pgStatEntryRefHash == NULL)
697  return;
698 
699  pgstat_release_matching_entry_refs(discard_pending, NULL, 0);
700  Assert(pgStatEntryRefHash->members == 0);
701  pgstat_entry_ref_hash_destroy(pgStatEntryRefHash);
702  pgStatEntryRefHash = NULL;
703 }
704 
705 static bool
707 {
708  Oid dboid = DatumGetObjectId(match_data);
709 
710  return ent->key.dboid == dboid;
711 }
712 
713 static void
715 {
716  pgstat_release_matching_entry_refs( /* discard pending = */ true,
717  match_db,
718  ObjectIdGetDatum(dboid));
719 }
720 
721 
722 /* ------------------------------------------------------------
723  * Dropping and resetting of stats entries
724  * ------------------------------------------------------------
725  */
726 
727 static void
729 {
730  dsa_pointer pdsa;
731 
732  /*
733  * Fetch dsa pointer before deleting entry - that way we can free the
734  * memory after releasing the lock.
735  */
736  pdsa = shent->body;
737 
738  if (!hstat)
740  else
741  dshash_delete_current(hstat);
742 
743  dsa_free(pgStatLocal.dsa, pdsa);
744 }
745 
746 /*
747  * Helper for both pgstat_drop_database_and_contents() and
748  * pgstat_drop_entry(). If hstat is non-null delete the shared entry using
749  * dshash_delete_current(), otherwise use dshash_delete_entry(). In either
750  * case the entry needs to be already locked.
751  */
752 static bool
754  dshash_seq_status *hstat)
755 {
756  Assert(shent->body != InvalidDsaPointer);
757 
758  /* should already have released local reference */
759  if (pgStatEntryRefHash)
760  Assert(!pgstat_entry_ref_hash_lookup(pgStatEntryRefHash, shent->key));
761 
762  /*
763  * Signal that the entry is dropped - this will eventually cause other
764  * backends to release their references.
765  */
766  if (shent->dropped)
767  elog(ERROR, "can only drop stats once");
768  shent->dropped = true;
769 
770  /* release refcount marking entry as not dropped */
771  if (pg_atomic_sub_fetch_u32(&shent->refcount, 1) == 0)
772  {
773  pgstat_free_entry(shent, hstat);
774  return true;
775  }
776  else
777  {
778  if (!hstat)
780  return false;
781  }
782 }
783 
784 /*
785  * Drop stats for the database and all the objects inside that database.
786  */
787 static void
789 {
790  dshash_seq_status hstat;
792  uint64 not_freed_count = 0;
793 
794  Assert(OidIsValid(dboid));
795 
796  Assert(pgStatLocal.shared_hash != NULL);
797 
798  /*
799  * This backend might very well be the only backend holding a reference to
800  * about-to-be-dropped entries. Ensure that we're not preventing it from
801  * being cleaned up till later.
802  *
803  * Doing this separately from the dshash iteration below avoids having to
804  * do so while holding a partition lock on the shared hashtable.
805  */
807 
808  /* some of the dshash entries are to be removed, take exclusive lock. */
809  dshash_seq_init(&hstat, pgStatLocal.shared_hash, true);
810  while ((p = dshash_seq_next(&hstat)) != NULL)
811  {
812  if (p->dropped)
813  continue;
814 
815  if (p->key.dboid != dboid)
816  continue;
817 
818  if (!pgstat_drop_entry_internal(p, &hstat))
819  {
820  /*
821  * Even statistics for a dropped database might currently be
822  * accessed (consider e.g. database stats for pg_stat_database).
823  */
824  not_freed_count++;
825  }
826  }
827  dshash_seq_term(&hstat);
828 
829  /*
830  * If some of the stats data could not be freed, signal the reference
831  * holders to run garbage collection of their cached pgStatShmLookupCache.
832  */
833  if (not_freed_count > 0)
835 }
836 
837 bool
838 pgstat_drop_entry(PgStat_Kind kind, Oid dboid, Oid objoid)
839 {
840  PgStat_HashKey key = {.kind = kind,.dboid = dboid,.objoid = objoid};
841  PgStatShared_HashEntry *shent;
842  bool freed = true;
843 
844  /* delete local reference */
845  if (pgStatEntryRefHash)
846  {
847  PgStat_EntryRefHashEntry *lohashent =
848  pgstat_entry_ref_hash_lookup(pgStatEntryRefHash, key);
849 
850  if (lohashent)
851  pgstat_release_entry_ref(lohashent->key, lohashent->entry_ref,
852  true);
853  }
854 
855  /* mark entry in shared hashtable as deleted, drop if possible */
856  shent = dshash_find(pgStatLocal.shared_hash, &key, true);
857  if (shent)
858  {
859  freed = pgstat_drop_entry_internal(shent, NULL);
860 
861  /*
862  * Database stats contain other stats. Drop those as well when
863  * dropping the database. XXX: Perhaps this should be done in a
864  * slightly more principled way? But not obvious what that'd look
865  * like, and so far this is the only case...
866  */
867  if (key.kind == PGSTAT_KIND_DATABASE)
869  }
870 
871  return freed;
872 }
873 
874 void
876 {
877  dshash_seq_status hstat;
879  uint64 not_freed_count = 0;
880 
881  dshash_seq_init(&hstat, pgStatLocal.shared_hash, true);
882  while ((ps = dshash_seq_next(&hstat)) != NULL)
883  {
884  if (ps->dropped)
885  continue;
886 
887  if (!pgstat_drop_entry_internal(ps, &hstat))
888  not_freed_count++;
889  }
890  dshash_seq_term(&hstat);
891 
892  if (not_freed_count > 0)
894 }
895 
896 static void
898  TimestampTz ts)
899 {
900  const PgStat_KindInfo *kind_info = pgstat_get_kind_info(kind);
901 
902  memset(pgstat_get_entry_data(kind, header), 0,
903  pgstat_get_entry_len(kind));
904 
905  if (kind_info->reset_timestamp_cb)
906  kind_info->reset_timestamp_cb(header, ts);
907 }
908 
909 /*
910  * Reset one variable-numbered stats entry.
911  */
912 void
914 {
915  PgStat_EntryRef *entry_ref;
916 
917  Assert(!pgstat_get_kind_info(kind)->fixed_amount);
918 
919  entry_ref = pgstat_get_entry_ref(kind, dboid, objoid, false, NULL);
920  if (!entry_ref || entry_ref->shared_entry->dropped)
921  return;
922 
923  (void) pgstat_lock_entry(entry_ref, false);
924  shared_stat_reset_contents(kind, entry_ref->shared_stats, ts);
925  pgstat_unlock_entry(entry_ref);
926 }
927 
928 /*
929  * Scan through the shared hashtable of stats, resetting statistics if
930  * approved by the provided do_reset() function.
931  */
932 void
934  Datum match_data, TimestampTz ts)
935 {
936  dshash_seq_status hstat;
938 
939  /* dshash entry is not modified, take shared lock */
940  dshash_seq_init(&hstat, pgStatLocal.shared_hash, false);
941  while ((p = dshash_seq_next(&hstat)) != NULL)
942  {
944 
945  if (p->dropped)
946  continue;
947 
948  if (!do_reset(p, match_data))
949  continue;
950 
952 
954 
956 
957  LWLockRelease(&header->lock);
958  }
959  dshash_seq_term(&hstat);
960 }
961 
962 static bool
964 {
965  return p->key.kind == DatumGetInt32(match_data);
966 }
967 
968 void
970 {
972 }
973 
974 static void
976 {
980  "PgStat Shared Ref",
985  "PgStat Shared Ref Hash",
987 }
static uint32 pg_atomic_sub_fetch_u32(volatile pg_atomic_uint32 *ptr, int32 sub_)
Definition: atomics.h:401
static uint32 pg_atomic_fetch_sub_u32(volatile pg_atomic_uint32 *ptr, int32 sub_)
Definition: atomics.h:343
static void pg_atomic_init_u32(volatile pg_atomic_uint32 *ptr, uint32 val)
Definition: atomics.h:223
static uint32 pg_atomic_fetch_add_u32(volatile pg_atomic_uint32 *ptr, int32 add_)
Definition: atomics.h:328
static uint64 pg_atomic_fetch_add_u64(volatile pg_atomic_uint64 *ptr, int64 add_)
Definition: atomics.h:467
static uint32 pg_atomic_read_u32(volatile pg_atomic_uint32 *ptr)
Definition: atomics.h:241
static void pg_atomic_init_u64(volatile pg_atomic_uint64 *ptr, uint64 val)
Definition: atomics.h:415
static uint64 pg_atomic_read_u64(volatile pg_atomic_uint64 *ptr)
Definition: atomics.h:429
#define likely(x)
Definition: c.h:272
#define MAXALIGN(LEN)
Definition: c.h:757
unsigned char bool
Definition: c.h:391
#define unlikely(x)
Definition: c.h:273
#define PG_USED_FOR_ASSERTS_ONLY
Definition: c.h:155
#define OidIsValid(objectId)
Definition: c.h:710
size_t Size
Definition: c.h:540
#define AssertArg(condition)
Definition: c.h:806
int64 TimestampTz
Definition: timestamp.h:39
dsa_area * dsa_create_in_place(void *place, size_t size, int tranche_id, dsm_segment *segment)
Definition: dsa.c:469
void * dsa_get_address(dsa_area *area, dsa_pointer dp)
Definition: dsa.c:932
void dsa_set_size_limit(dsa_area *area, size_t limit)
Definition: dsa.c:1008
void dsa_pin_mapping(dsa_area *area)
Definition: dsa.c:631
void dsa_detach(dsa_area *area)
Definition: dsa.c:1910
dsa_area * dsa_attach_in_place(void *place, dsm_segment *segment)
Definition: dsa.c:541
void dsa_free(dsa_area *area, dsa_pointer dp)
Definition: dsa.c:820
size_t dsa_minimum_size(void)
Definition: dsa.c:1169
void dsa_pin(dsa_area *area)
Definition: dsa.c:965
#define dsa_allocate0(area, size)
Definition: dsa.h:88
uint64 dsa_pointer
Definition: dsa.h:62
#define InvalidDsaPointer
Definition: dsa.h:78
void dshash_delete_entry(dshash_table *hash_table, void *entry)
Definition: dshash.c:548
void dshash_release_lock(dshash_table *hash_table, void *entry)
Definition: dshash.c:569
void dshash_detach(dshash_table *hash_table)
Definition: dshash.c:310
void dshash_seq_init(dshash_seq_status *status, dshash_table *hash_table, bool exclusive)
Definition: dshash.c:612
void * dshash_find(dshash_table *hash_table, const void *key, bool exclusive)
Definition: dshash.c:393
dshash_table_handle dshash_get_hash_table_handle(dshash_table *hash_table)
Definition: dshash.c:370
void dshash_seq_term(dshash_seq_status *status)
Definition: dshash.c:723
void * dshash_find_or_insert(dshash_table *hash_table, const void *key, bool *found)
Definition: dshash.c:438
dshash_table * dshash_attach(dsa_area *area, const dshash_parameters *params, dshash_table_handle handle, void *arg)
Definition: dshash.c:271
dshash_table * dshash_create(dsa_area *area, const dshash_parameters *params, void *arg)
Definition: dshash.c:204
void * dshash_seq_next(dshash_seq_status *status)
Definition: dshash.c:631
void dshash_delete_current(dshash_seq_status *status)
Definition: dshash.c:736
#define ERROR
Definition: elog.h:33
#define elog(elevel,...)
Definition: elog.h:218
bool IsUnderPostmaster
Definition: globals.c:113
int i
Definition: isn.c:73
Assert(fmt[strlen(fmt) - 1] !='\n')
bool LWLockAcquire(LWLock *lock, LWLockMode mode)
Definition: lwlock.c:1196
void LWLockRelease(LWLock *lock)
Definition: lwlock.c:1800
void LWLockInitialize(LWLock *lock, int tranche_id)
Definition: lwlock.c:734
bool LWLockConditionalAcquire(LWLock *lock, LWLockMode mode)
Definition: lwlock.c:1367
@ LWTRANCHE_PGSTATS_HASH
Definition: lwlock.h:194
@ LWTRANCHE_PGSTATS_DSA
Definition: lwlock.h:193
@ LWTRANCHE_PGSTATS_DATA
Definition: lwlock.h:195
@ LW_EXCLUSIVE
Definition: lwlock.h:104
void pfree(void *pointer)
Definition: mcxt.c:1175
MemoryContext TopMemoryContext
Definition: mcxt.c:48
void * MemoryContextAlloc(MemoryContext context, Size size)
Definition: mcxt.c:863
MemoryContext CacheMemoryContext
Definition: mcxt.c:51
#define AllocSetContextCreate
Definition: memutils.h:173
#define ALLOCSET_SMALL_SIZES
Definition: memutils.h:207
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
const void * data
static void header(const char *fmt,...) pg_attribute_printf(1
Definition: pg_regress.c:212
const PgStat_KindInfo * pgstat_get_kind_info(PgStat_Kind kind)
Definition: pgstat.c:1211
void pgstat_delete_pending_entry(PgStat_EntryRef *entry_ref)
Definition: pgstat.c:1104
PgStat_LocalState pgStatLocal
Definition: pgstat.c:195
PgStat_Kind
Definition: pgstat.h:36
@ PGSTAT_KIND_DATABASE
Definition: pgstat.h:41
static uint32 pgstat_hash_hash_key(const void *d, size_t size, void *arg)
static int pgstat_cmp_hash_key(const void *a, const void *b, size_t size, void *arg)
static void * pgstat_get_entry_data(PgStat_Kind kind, PgStatShared_Common *entry)
#define pgstat_assert_is_up()
struct PgStat_HashKey PgStat_HashKey
static size_t pgstat_get_entry_len(PgStat_Kind kind)
static bool match_db(PgStat_EntryRefHashEntry *ent, Datum match_data)
Definition: pgstat_shmem.c:706
static void pgstat_setup_memcxt(void)
Definition: pgstat_shmem.c:975
void pgstat_reset_entries_of_kind(PgStat_Kind kind, TimestampTz ts)
Definition: pgstat_shmem.c:969
void pgstat_request_entry_refs_gc(void)
Definition: pgstat_shmem.c:608
static void pgstat_release_db_entry_refs(Oid dboid)
Definition: pgstat_shmem.c:714
PgStatShared_Common * pgstat_init_entry(PgStat_Kind kind, PgStatShared_HashEntry *shhashent)
Definition: pgstat_shmem.c:254
static Size pgstat_dsa_init_size(void)
Definition: pgstat_shmem.c:105
static bool match_kind(PgStatShared_HashEntry *p, Datum match_data)
Definition: pgstat_shmem.c:963
static MemoryContext pgStatEntryRefHashContext
Definition: pgstat_shmem.c:90
void StatsShmemInit(void)
Definition: pgstat_shmem.c:140
void pgstat_attach_shmem(void)
Definition: pgstat_shmem.c:213
static void pgstat_free_entry(PgStatShared_HashEntry *shent, dshash_seq_status *hstat)
Definition: pgstat_shmem.c:728
static int pgStatSharedRefAge
Definition: pgstat_shmem.c:82
#define PGSTAT_ENTRY_REF_HASH_SIZE
Definition: pgstat_shmem.c:21
static void shared_stat_reset_contents(PgStat_Kind kind, PgStatShared_Common *header, TimestampTz ts)
Definition: pgstat_shmem.c:897
static void pgstat_setup_shared_refs(void)
Definition: pgstat_shmem.c:302
static void pgstat_release_entry_ref(PgStat_HashKey key, PgStat_EntryRef *entry_ref, bool discard_pending)
Definition: pgstat_shmem.c:517
static void pgstat_drop_database_and_contents(Oid dboid)
Definition: pgstat_shmem.c:788
static PgStatShared_Common * pgstat_reinit_entry(PgStat_Kind kind, PgStatShared_HashEntry *shhashent)
Definition: pgstat_shmem.c:283
static pgstat_entry_ref_hash_hash * pgStatEntryRefHash
Definition: pgstat_shmem.c:81
void pgstat_reset_entry(PgStat_Kind kind, Oid dboid, Oid objoid, TimestampTz ts)
Definition: pgstat_shmem.c:913
Size StatsShmemSize(void)
Definition: pgstat_shmem.c:126
static void pgstat_acquire_entry_ref(PgStat_EntryRef *entry_ref, PgStatShared_HashEntry *shhashent, PgStatShared_Common *shheader)
Definition: pgstat_shmem.c:318
static MemoryContext pgStatSharedRefContext
Definition: pgstat_shmem.c:89
void pgstat_reset_matching_entries(bool(*do_reset)(PgStatShared_HashEntry *, Datum), Datum match_data, TimestampTz ts)
Definition: pgstat_shmem.c:933
void pgstat_drop_all_entries(void)
Definition: pgstat_shmem.c:875
static const dshash_parameters dsh_params
Definition: pgstat_shmem.c:62
PgStat_EntryRef * pgstat_get_entry_ref(PgStat_Kind kind, Oid dboid, Oid objoid, bool create, bool *created_entry)
Definition: pgstat_shmem.c:393
static bool pgstat_get_entry_ref_cached(PgStat_HashKey key, PgStat_EntryRef **entry_ref_p)
Definition: pgstat_shmem.c:337
void pgstat_unlock_entry(PgStat_EntryRef *entry_ref)
Definition: pgstat_shmem.c:583
static void pgstat_release_all_entry_refs(bool discard_pending)
Definition: pgstat_shmem.c:694
struct PgStat_EntryRefHashEntry PgStat_EntryRefHashEntry
static void pgstat_release_matching_entry_refs(bool discard_pending, ReleaseMatchCB match, Datum match_data)
Definition: pgstat_shmem.c:664
bool(* ReleaseMatchCB)(PgStat_EntryRefHashEntry *, Datum data)
Definition: pgstat_shmem.c:55
bool pgstat_drop_entry(PgStat_Kind kind, Oid dboid, Oid objoid)
Definition: pgstat_shmem.c:838
bool pgstat_lock_entry(PgStat_EntryRef *entry_ref, bool nowait)
Definition: pgstat_shmem.c:571
static void pgstat_gc_entry_refs(void)
Definition: pgstat_shmem.c:630
static bool pgstat_need_entry_refs_gc(void)
Definition: pgstat_shmem.c:614
static bool pgstat_drop_entry_internal(PgStatShared_HashEntry *shent, dshash_seq_status *hstat)
Definition: pgstat_shmem.c:753
void pgstat_detach_shmem(void)
Definition: pgstat_shmem.c:233
PgStat_EntryRef * pgstat_get_entry_ref_locked(PgStat_Kind kind, Oid dboid, Oid objoid, bool nowait)
Definition: pgstat_shmem.c:592
#define DatumGetObjectId(X)
Definition: postgres.h:544
uintptr_t Datum
Definition: postgres.h:411
#define ObjectIdGetDatum(X)
Definition: postgres.h:551
#define DatumGetInt32(X)
Definition: postgres.h:516
#define Int32GetDatum(X)
Definition: postgres.h:523
unsigned int Oid
Definition: postgres_ext.h:31
Size add_size(Size s1, Size s2)
Definition: shmem.c:502
void * ShmemInitStruct(const char *name, Size size, bool *foundPtr)
Definition: shmem.c:396
Definition: lwlock.h:32
pg_atomic_uint32 refcount
PgStat_EntryRef * entry_ref
Definition: pgstat_shmem.c:28
PgStatShared_Common * shared_stats
PgStatShared_HashEntry * shared_entry
PgStat_Kind kind
void(* reset_timestamp_cb)(PgStatShared_Common *header, TimestampTz ts)
dshash_table * shared_hash
PgStat_ShmemControl * shmem
dshash_table_handle hash_handle
PgStatShared_SLRU slru
pg_atomic_uint64 gc_request_count
PgStatShared_Wal wal
PgStatShared_Archiver archiver
PgStatShared_Checkpointer checkpointer
PgStatShared_BgWriter bgwriter
Definition: dsa.c:355