[std] Introduce the label 'term.padding.bits'

Author: jensmaurer

source/atomics.tex

@@ -1918,7 +1918,7 @@
 \begin{note}
 For example, the effect of
 \tcode{compare_exchange_strong}
-on objects without padding bits\iref{basic.types} is
+on objects without padding bits\iref{term.padding.bits} is
 \begin{codeblock}
 if (memcmp(this, &expected, sizeof(*this)) == 0)
   memcpy(this, &desired, sizeof(*this));

source/basic.tex

@@ -4603,6 +4603,7 @@
 The \defnx{value representation}{representation!value}
 of an object of type \tcode{T} is the set of bits
 that participate in representing a value of type \tcode{T}.
+\label{term.padding.bits}%
 Bits in the object representation that are not part of the value representation
 are \defn{padding bits}.
 For trivially copyable types, the value representation is

source/classes.tex

@@ -2823,7 +2823,7 @@
 If the width of a bit-field is larger than
 the width of the bit-field's type
 (or, in case of an enumeration type, of its underlying type),
-the extra bits are padding bits\iref{basic.types}.
+the extra bits are padding bits\iref{term.padding.bits}.
 \indextext{allocation!implementation-defined bit-field}%
 Allocation of bit-fields within a class object is
 \impldef{allocation of bit-fields within a class object}.

source/declarations.tex

@@ -4383,7 +4383,7 @@
 if
 \tcode{T}
 is a (possibly cv-qualified) non-union class type,
-its padding bits\iref{basic.types} are initialized to zero bits and
+its padding bits\iref{term.padding.bits} are initialized to zero bits and
 each non-static data member,
 each non-virtual base class subobject, and,
 if the object is not a base class subobject,
@@ -4394,7 +4394,7 @@
 if
 \tcode{T}
 is a (possibly cv-qualified) union type,
-its padding bits\iref{basic.types} are initialized to zero bits and
+its padding bits\iref{term.padding.bits} are initialized to zero bits and
 the
 object's first non-static named
 data member