#-----------------------------------------------------------------------------
## This script converts an Ada file (and its dependency files) to Html.
-## Keywords, comments and strings are color-highlighted. If the cross-referencing
-## information provided by Gnat (when not using the -gnatx switch) is found,
-## the html files will also have some cross-referencing features, i.e. if you
-## click on a type, its declaration will be displayed.
+## Keywords, comments and strings are color-highlighted. If the
+## cross-referencing information provided by Gnat (when not using the -gnatx
+## switch) is found, the html files will also have some cross-referencing
+## features, i.e. if you click on a type, its declaration will be displayed.
##
## To find more about the switches provided by this script, please use the
## following command :
false, true, true, ATTRS, false, \
flag_openacc)
/* Set NONANSI_P = false to enable the builtins also with -fno-nonansi-builtins,
- esp. as -std=c++../c.. imply that flag and -fopenacc should be orthogonal. */
+ esp. as -std=c++../c.. imply that flag and -fopenacc should be
+ orthogonal. */
#undef DEF_GOACC_BUILTIN_COMPILER
#define DEF_GOACC_BUILTIN_COMPILER(ENUM, NAME, TYPE, ATTRS) \
DEF_BUILTIN (ENUM, "__builtin_" NAME, BUILT_IN_NORMAL, TYPE, TYPE, \
a @code{CHARACTER (KIND=4)} string. The length of the string is then returned
in @code{opt_dst_charlen} (also for string arrays).
@item @var{dst_data} @tab intent(inout) A pointer to the address the data is
-stored. To prevent copying of data into an output buffer the address to the live
-data is returned here. When a descriptor is provided also its data-member is
-set to that address. When @var{may_realloc_dst} is set, then the memory may be
-reallocated by the remote function, which needs to be replicated by this
+stored. To prevent copying of data into an output buffer the address to the
+live data is returned here. When a descriptor is provided also its data-member
+is set to that address. When @var{may_realloc_dst} is set, then the memory may
+be reallocated by the remote function, which needs to be replicated by this
function.
@item @var{opt_dst_charlen} @tab intent(inout) When a char array is returned,
this parameter is set to the length where applicable. The value can also be
graphite_copy_stmts_from_block (basic_block bb, basic_block new_bb,
vec<tree> iv_map)
{
- /* Iterator pointing to the place where new statement (s) will be inserted. */
+ /* Iterator pointing to the place where new statement (s) will be
+ inserted. */
gimple_stmt_iterator gsi_tgt = gsi_last_bb (new_bb);
for (gimple_stmt_iterator gsi = gsi_start_bb (bb); !gsi_end_p (gsi);
/* Apply all changes in location cache. Add locations into linemap and patch
trees. */
bool apply_location_cache ();
- /* Tree merging did not succeed; mark all changes in the cache as accepted. */
+ /* Tree merging did not succeed; mark all changes in the cache as
+ accepted. */
void accept_location_cache ();
/* Tree merging did succeed; throw away recent changes. */
void revert_location_cache ();
The union of near/far is essentially a short-vector optimization, switching
to a heap-allocated vector when necessary. This happens relatively rarely
- (usually maxes out at 1-2%), and the vertices that have more than 2 successors
- also tend to have more than 4. The root vertex tends to use the dynamic
- vector because the subpaths are recorded as the successors of the root.
+ (usually maxes out at 1-2%), and the vertices that have more than 2
+ successors also tend to have more than 4. The root vertex tends to use the
+ dynamic vector because the subpaths are recorded as the successors of the
+ root.
Conceptually, this is a small map from vertex-id -> index and the API is
modelled as such. The insert and search functions are unrolled by hand when
- using the small vector. This has a noticeable performance impact on insert in
- particular, and is not too complex since we know we are limited to 2
+ using the small vector. This has a noticeable performance impact on insert
+ in particular, and is not too complex since we know we are limited to 2
elements.
Vertices are tagged with endofpath and inserted. If endofpath is set, the
HSA_AGENT_INFO_DEFAULT_FLOAT_ROUNDING_MODE = 5,
/**
* @deprecated Query ::HSA_ISA_INFO_BASE_PROFILE_DEFAULT_FLOAT_ROUNDING_MODES
- * for a given instruction set architecture supported by the agent instead. If
- * more than one ISA is supported by the agent, the returned value corresponds
- * to the first ISA enumerated by ::hsa_agent_iterate_isas.
+ * for a given instruction set architecture supported by the agent instead.
+ * If more than one ISA is supported by the agent, the returned value
+ * corresponds to the first ISA enumerated by ::hsa_agent_iterate_isas.
*
* A bit-mask of ::hsa_default_float_rounding_mode_t values, representing the
* default floating-point rounding modes supported by the agent in the Base
The libgcobol is intended for use entirely and solely by executables created
from COBOL source code by the GCOBOL "COBOL for GCC" front end.
-libgcobol.a can be statically linked in, but it makes for very large binaries. We
-tend to use that for debugging the GCOBOL compiler, and not much else
+libgcobol.a can be statically linked in, but it makes for very large binaries.
+We tend to use that for debugging the GCOBOL compiler, and not much else
Many of the functions in the library are called by the executable code generated
by the GCOBOL compiler through GIMPLE tags, and thus prototypes -- which are
unsigned int i;
/* Write the section header for the wrapper. */
- /* Account for any initial alignment - which becomes the alignment for this
- created section. */
+ /* Account for any initial alignment - which becomes the alignment for
+ this created section. */
secsize = (offset - index[0]);
if (!simple_object_mach_o_write_section_header (sobj, descriptor,
* @param __first An input iterator.
* @param __last An input iterator.
* @param __pred A predicate.
- * @return True if the range @p [__first,__last) is partitioned by @p __pred,
- * i.e. if all elements that satisfy @p __pred appear before those that
- * do not.
+ * @return True if the range @p [__first,__last) is partitioned by @p
+ * __pred, i.e. if all elements that satisfy @p __pred appear before those
+ * that do not.
*/
template<typename _InputIterator, typename _Predicate>
_GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
projects / thirdparty / gcc.git / commitdiff
