gcc/params.def

   1 /* params.def - Run-time parameters.
   2    Copyright (C) 2001, 2002, 2004, 2005 Free Software Foundation, Inc.
   3    Written by Mark Mitchell <mark@codesourcery.com>.
   4
   5 This file is part of GCC.
   6
   7 GCC is free software; you can redistribute it and/or modify it under
   8 the terms of the GNU General Public License as published by the Free
   9 Software Foundation; either version 2, or (at your option) any later
  10 version.
  11
  12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
  13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
  14 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  15 for more details.
  16
  17 You should have received a copy of the GNU General Public License
  18 along with GCC; see the file COPYING.  If not, write to the Free
  19 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
  20 02110-1301, USA.
  21
  22 */
  23
  24 /* This file contains definitions for language-independent
  25    parameters.  The DEFPARAM macro takes 6 arguments:
  26
  27      - The enumeral corresponding to this parameter.
  28
  29      - The name that can be used to set this parameter using the
  30        command-line option `--param <name>=<value>'.
  31
  32      - A help string explaining how the parameter is used.
  33
  34      - A default value for the parameter.
  35
  36      - The minimum acceptable value for the parameter.
  37
  38      - The maximum acceptable value for the parameter (if greater than
  39      the minimum).
  40
  41    Be sure to add an entry to invoke.texi summarizing the parameter.  */
  42
  43 /* The maximum number of fields in a variable with only implicit uses
  44    for which structure aliasing will consider trying to track each
  45    field.  The default is 5.  */
  46 DEFPARAM (PARAM_SALIAS_MAX_IMPLICIT_FIELDS,
  47           "salias-max-implicit-fields",
  48           "The maximum number of fields in a structure variable without direct structure accesses that GCC will attempt to track separately",
  49           5, 0, 0)
  50
  51 /* The maximum structure size at which the scalar replacement of
  52    aggregates (SRA) pass will perform block copies.  The default
  53    value, 0, implies that GCC will select the most appropriate size
  54    itself.  */
  55 DEFPARAM (PARAM_SRA_MAX_STRUCTURE_SIZE,
  56           "sra-max-structure-size",
  57           "The maximum structure size (in bytes) for which GCC will "
  58           "use by-element copies",
  59           0, 0, 0)
  60
  61 /* The maximum number of structure fields which the SRA pass will
  62    instantiate to avoid block copies.  The default value, 0, implies
  63    that GCC will select the appropriate value itself.  */
  64 DEFPARAM (PARAM_SRA_MAX_STRUCTURE_COUNT,
  65           "sra-max-structure-count",
  66           "The maximum number of structure fields for which GCC will "
  67           "use by-element copies",
  68           0, 0, 0)
  69
  70 /* The ratio between instantiated fields and the complete structure
  71    size.  We say that if the ratio of the number of bytes in
  72    instantiated fields to the number of bytes in the complete
  73    structure exceeds this parameter, or if the number of instantiated
  74    fields to the total number of fields exceeds this parameter, then
  75    block copies are not used.  The default is 75%.  */
  76 DEFPARAM (PARAM_SRA_FIELD_STRUCTURE_RATIO,
  77           "sra-field-structure-ratio",
  78           "The threshold ratio between instantiated fields and the total structure size",
  79           75, 0, 100)
  80
  81 /* The single function inlining limit. This is the maximum size
  82    of a function counted in internal gcc instructions (not in
  83    real machine instructions) that is eligible for inlining
  84    by the tree inliner.
  85    The default value is 450.
  86    Only functions marked inline (or methods defined in the class
  87    definition for C++) are affected by this.
  88    There are more restrictions to inlining: If inlined functions
  89    call other functions, the already inlined instructions are
  90    counted and once the recursive inline limit (see
  91    "max-inline-insns" parameter) is exceeded, the acceptable size
  92    gets decreased.  */
  93 DEFPARAM (PARAM_MAX_INLINE_INSNS_SINGLE,
  94           "max-inline-insns-single",
  95           "The maximum number of instructions in a single function eligible for inlining",
  96           450, 0, 0)
  97
  98 /* The single function inlining limit for functions that are
  99    inlined by virtue of -finline-functions (-O3).
 100    This limit should be chosen to be below or equal to the limit
 101    that is applied to functions marked inlined (or defined in the
 102    class declaration in C++) given by the "max-inline-insns-single"
 103    parameter.
 104    The default value is 90.  */
 105 DEFPARAM (PARAM_MAX_INLINE_INSNS_AUTO,
 106           "max-inline-insns-auto",
 107           "The maximum number of instructions when automatically inlining",
 108           90, 0, 0)
 109
 110 DEFPARAM (PARAM_MAX_INLINE_INSNS_RECURSIVE,
 111           "max-inline-insns-recursive",
 112           "The maximum number of instructions inline function can grow to via recursive inlining",
 113           450, 0, 0)
 114
 115 DEFPARAM (PARAM_MAX_INLINE_INSNS_RECURSIVE_AUTO,
 116           "max-inline-insns-recursive-auto",
 117           "The maximum number of instructions non-inline function can grow to via recursive inlining",
 118           450, 0, 0)
 119
 120 DEFPARAM (PARAM_MAX_INLINE_RECURSIVE_DEPTH,
 121           "max-inline-recursive-depth",
 122           "The maximum depth of recursive inlining for inline functions",
 123           8, 0, 0)
 124
 125 DEFPARAM (PARAM_MAX_INLINE_RECURSIVE_DEPTH_AUTO,
 126           "max-inline-recursive-depth-auto",
 127           "The maximum depth of recursive inlining for non-inline functions",
 128           8, 0, 0)
 129
 130 DEFPARAM (PARAM_MIN_INLINE_RECURSIVE_PROBABILITY,
 131           "min-inline-recursive-probability",
 132           "Inline recursively only when the probability of call being executed exceeds the parameter",
 133           10, 0, 0)
 134
 135 /* Limit the number of expansions created by the variable expansion
 136    optimization to avoid register pressure.  */
 137 DEFPARAM (PARAM_MAX_VARIABLE_EXPANSIONS,
 138           "max-variable-expansions-in-unroller",
 139           "If -fvariable-expansion-in-unroller is used, the maximum number of \
 140            times that an individual variable will be expanded \
 141            during loop unrolling",
 142           1, 0, 0)
 143
 144 /* The maximum number of instructions to consider when looking for an
 145    instruction to fill a delay slot.  If more than this arbitrary
 146    number of instructions is searched, the time savings from filling
 147    the delay slot will be minimal so stop searching.  Increasing
 148    values mean more aggressive optimization, making the compile time
 149    increase with probably small improvement in executable run time.  */
 150 DEFPARAM (PARAM_MAX_DELAY_SLOT_INSN_SEARCH,
 151           "max-delay-slot-insn-search",
 152           "The maximum number of instructions to consider to fill a delay slot",
 153           100, 0, 0)
 154
 155 /* When trying to fill delay slots, the maximum number of instructions
 156    to consider when searching for a block with valid live register
 157    information.  Increasing this arbitrarily chosen value means more
 158    aggressive optimization, increasing the compile time.  This
 159    parameter should be removed when the delay slot code is rewritten
 160    to maintain the control-flow graph.  */
 161 DEFPARAM(PARAM_MAX_DELAY_SLOT_LIVE_SEARCH,
 162          "max-delay-slot-live-search",
 163          "The maximum number of instructions to consider to find accurate live register information",
 164          333, 0, 0)
 165
 166 /* This parameter limits the number of branch elements that the
 167    scheduler will track anti-dependencies through without resetting
 168    the tracking mechanism.  Large functions with few calls or barriers
 169    can generate lists containing many 1000's of dependencies.  Generally
 170    the compiler either uses all available memory, or runs for far too long.  */
 171 DEFPARAM(PARAM_MAX_PENDING_LIST_LENGTH,
 172          "max-pending-list-length",
 173          "The maximum length of scheduling's pending operations list",
 174          32, 0, 0)
 175
 176 DEFPARAM(PARAM_LARGE_FUNCTION_INSNS,
 177          "large-function-insns",
 178          "The size of function body to be considered large",
 179          2700, 0, 0)
 180 DEFPARAM(PARAM_LARGE_FUNCTION_GROWTH,
 181          "large-function-growth",
 182          "Maximal growth due to inlining of large function (in percent)",
 183          100, 0, 0)
 184 DEFPARAM(PARAM_INLINE_UNIT_GROWTH,
 185          "inline-unit-growth",
 186          "how much can given compilation unit grow because of the inlining (in percent)",
 187          50, 0, 0)
 188 DEFPARAM(PARAM_INLINE_CALL_COST,
 189          "inline-call-cost",
 190          "expense of call operation relative to ordinary arithmetic operations",
 191          16, 0, 0)
 192
 193 /* The GCSE optimization will be disabled if it would require
 194    significantly more memory than this value.  */
 195 DEFPARAM(PARAM_MAX_GCSE_MEMORY,
 196          "max-gcse-memory",
 197          "The maximum amount of memory to be allocated by GCSE",
 198          50 * 1024 * 1024, 0, 0)
 199 /* The number of repetitions of copy/const prop and PRE to run.  */
 200 DEFPARAM(PARAM_MAX_GCSE_PASSES,
 201         "max-gcse-passes",
 202         "The maximum number of passes to make when doing GCSE",
 203         1, 1, 0)
 204 /* This is the threshold ratio when to perform partial redundancy
 205    elimination after reload. We perform partial redundancy elimination
 206    when the following holds:
 207    (Redundant load execution count)
 208    ------------------------------- >= GCSE_AFTER_RELOAD_PARTIAL_FRACTION
 209    (Added loads execution count)                                          */
 210 DEFPARAM(PARAM_GCSE_AFTER_RELOAD_PARTIAL_FRACTION,
 211         "gcse-after-reload-partial-fraction",
 212         "The threshold ratio for performing partial redundancy elimination after reload",
 213         3, 0, 0)
 214 /* This is the threshold ratio of the critical edges execution count compared to
 215    the redundant loads execution count that permits performing the load
 216    redundancy elimination in gcse after reload.  */
 217 DEFPARAM(PARAM_GCSE_AFTER_RELOAD_CRITICAL_FRACTION,
 218         "gcse-after-reload-critical-fraction",
 219         "The threshold ratio of critical edges execution count that permit performing redundancy elimination after reload",
 220         10, 0, 0)
 221 /* This parameter limits the number of insns in a loop that will be unrolled,
 222    and by how much the loop is unrolled.
 223
 224    This limit should be at most half of the peeling limits:  loop unroller
 225    decides to not unroll loops that iterate fewer than 2*number of allowed
 226    unrollings and thus we would have loops that are neither peeled or unrolled
 227    otherwise.  */
 228 DEFPARAM(PARAM_MAX_UNROLLED_INSNS,
 229          "max-unrolled-insns",
 230          "The maximum number of instructions to consider to unroll in a loop",
 231          200, 0, 0)
 232 /* This parameter limits how many times the loop is unrolled depending
 233    on number of insns really executed in each iteration.  */
 234 DEFPARAM(PARAM_MAX_AVERAGE_UNROLLED_INSNS,
 235          "max-average-unrolled-insns",
 236          "The maximum number of instructions to consider to unroll in a loop on average",
 237          80, 0, 0)
 238 /* The maximum number of unrollings of a single loop.  */
 239 DEFPARAM(PARAM_MAX_UNROLL_TIMES,
 240         "max-unroll-times",
 241         "The maximum number of unrollings of a single loop",
 242         8, 0, 0)
 243 /* The maximum number of insns of a peeled loop.  */
 244 DEFPARAM(PARAM_MAX_PEELED_INSNS,
 245         "max-peeled-insns",
 246         "The maximum number of insns of a peeled loop",
 247         400, 0, 0)
 248 /* The maximum number of peelings of a single loop.  */
 249 DEFPARAM(PARAM_MAX_PEEL_TIMES,
 250         "max-peel-times",
 251         "The maximum number of peelings of a single loop",
 252         16, 0, 0)
 253 /* The maximum number of insns of a peeled loop.  */
 254 DEFPARAM(PARAM_MAX_COMPLETELY_PEELED_INSNS,
 255         "max-completely-peeled-insns",
 256         "The maximum number of insns of a completely peeled loop",
 257         400, 0, 0)
 258 /* The maximum number of peelings of a single loop that is peeled completely.  */
 259 DEFPARAM(PARAM_MAX_COMPLETELY_PEEL_TIMES,
 260         "max-completely-peel-times",
 261         "The maximum number of peelings of a single loop that is peeled completely",
 262         16, 0, 0)
 263 /* The maximum number of insns of a peeled loop that rolls only once.  */
 264 DEFPARAM(PARAM_MAX_ONCE_PEELED_INSNS,
 265         "max-once-peeled-insns",
 266         "The maximum number of insns of a peeled loop that rolls only once",
 267         400, 0, 0)
 268
 269 /* The maximum number of insns of an unswitched loop.  */
 270 DEFPARAM(PARAM_MAX_UNSWITCH_INSNS,
 271         "max-unswitch-insns",
 272         "The maximum number of insns of an unswitched loop",
 273         50, 0, 0)
 274 /* The maximum level of recursion in unswitch_single_loop.  */
 275 DEFPARAM(PARAM_MAX_UNSWITCH_LEVEL,
 276         "max-unswitch-level",
 277         "The maximum number of unswitchings in a single loop",
 278         3, 0, 0)
 279
 280 /* The maximum number of iterations of a loop the brute force algorithm
 281    for analysis of # of iterations of the loop tries to evaluate.  */
 282 DEFPARAM(PARAM_MAX_ITERATIONS_TO_TRACK,
 283         "max-iterations-to-track",
 284         "Bound on the number of iterations the brute force # of iterations analysis algorithm evaluates",
 285         1000, 0, 0)
 286
 287 DEFPARAM(PARAM_MAX_SMS_LOOP_NUMBER,
 288          "max-sms-loop-number",
 289          "Maximum number of loops to perform swing modulo scheduling on (mainly for debugging)",
 290          -1, -1, -1)
 291
 292 /* This parameter is used to tune SMS MAX II calculations.  */
 293 DEFPARAM(PARAM_SMS_MAX_II_FACTOR,
 294          "sms-max-ii-factor",
 295          "A factor for tuning the upper bound that swing modulo scheduler uses for scheduling a loop",
 296          100, 0, 0)
 297 DEFPARAM(PARAM_SMS_DFA_HISTORY,
 298          "sms-dfa-history",
 299          "The number of cycles the swing modulo scheduler considers when \
 300           checking conflicts using DFA",
 301          0, 0, 0)
 302 DEFPARAM(PARAM_SMS_LOOP_AVERAGE_COUNT_THRESHOLD,
 303          "sms-loop-average-count-threshold",
 304          "A threshold on the average loop count considered by the swing modulo scheduler",
 305          0, 0, 0)
 306
 307 DEFPARAM(HOT_BB_COUNT_FRACTION,
 308          "hot-bb-count-fraction",
 309          "Select fraction of the maximal count of repetitions of basic block in program given basic block needs to have to be considered hot",
 310          10000, 0, 0)
 311 DEFPARAM(HOT_BB_FREQUENCY_FRACTION,
 312          "hot-bb-frequency-fraction",
 313          "Select fraction of the maximal frequency of executions of basic block in function given basic block needs to have to be considered hot",
 314          1000, 0, 0)
 315 DEFPARAM(TRACER_DYNAMIC_COVERAGE_FEEDBACK,
 316          "tracer-dynamic-coverage-feedback",
 317          "The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is available",
 318          95, 0, 100)
 319 DEFPARAM(TRACER_DYNAMIC_COVERAGE,
 320          "tracer-dynamic-coverage",
 321          "The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is not available",
 322          75, 0, 100)
 323 DEFPARAM(TRACER_MAX_CODE_GROWTH,
 324          "tracer-max-code-growth",
 325          "Maximal code growth caused by tail duplication (in percent)",
 326          100, 0, 0)
 327 DEFPARAM(TRACER_MIN_BRANCH_RATIO,
 328          "tracer-min-branch-ratio",
 329          "Stop reverse growth if the reverse probability of best edge is less than this threshold (in percent)",
 330          10, 0, 100)
 331 DEFPARAM(TRACER_MIN_BRANCH_PROBABILITY_FEEDBACK,
 332          "tracer-min-branch-probability-feedback",
 333          "Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is available",
 334          80, 0, 100)
 335 DEFPARAM(TRACER_MIN_BRANCH_PROBABILITY,
 336          "tracer-min-branch-probability",
 337          "Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is not available",
 338          50, 0, 100)
 339
 340 /* The maximum number of incoming edges to consider for crossjumping.  */
 341 DEFPARAM(PARAM_MAX_CROSSJUMP_EDGES,
 342          "max-crossjump-edges",
 343          "The maximum number of incoming edges to consider for crossjumping",
 344          100, 0, 0)
 345
 346 /* The minimum number of matching instructions to consider for crossjumping.  */
 347 DEFPARAM(PARAM_MIN_CROSSJUMP_INSNS,
 348      "min-crossjump-insns",
 349      "The minimum number of matching instructions to consider for crossjumping",
 350      5, 0, 0)
 351
 352 /* The maximum number of insns to duplicate when unfactoring computed gotos.  */
 353 DEFPARAM(PARAM_MAX_GOTO_DUPLICATION_INSNS,
 354      "max-goto-duplication-insns",
 355      "The maximum number of insns to duplicate when unfactoring computed gotos",
 356      8, 0, 0)
 357
 358 /* The maximum length of path considered in cse.  */
 359 DEFPARAM(PARAM_MAX_CSE_PATH_LENGTH,
 360          "max-cse-path-length",
 361          "The maximum length of path considered in cse",
 362          10, 0, 0)
 363
 364 /* The cost of expression in loop invariant motion that is considered
 365    expensive.  */
 366 DEFPARAM(PARAM_LIM_EXPENSIVE,
 367          "lim-expensive",
 368          "The minimum cost of an expensive expression in the loop invariant motion",
 369          20, 0, 0)
 370
 371 /* Bound on number of candidates for induction variables below that
 372    all candidates are considered for each use in induction variable
 373    optimizations.  */
 374
 375 DEFPARAM(PARAM_IV_CONSIDER_ALL_CANDIDATES_BOUND,
 376          "iv-consider-all-candidates-bound",
 377          "Bound on number of candidates below that all candidates are considered in iv optimizations",
 378          30, 0, 0)
 379
 380 /* The induction variable optimizations give up on loops that contain more
 381    induction variable uses.  */
 382
 383 DEFPARAM(PARAM_IV_MAX_CONSIDERED_USES,
 384          "iv-max-considered-uses",
 385          "Bound on number of iv uses in loop optimized in iv optimizations",
 386          250, 0, 0)
 387
 388 /* If there are at most this number of ivs in the set, try removing unnecessary
 389    ivs from the set always.  */
 390
 391 DEFPARAM(PARAM_IV_ALWAYS_PRUNE_CAND_SET_BOUND,
 392          "iv-always-prune-cand-set-bound",
 393          "If number of candidates in the set is smaller, we always try to remove unused ivs during its optimization",
 394          10, 0, 0)
 395
 396 DEFPARAM(PARAM_SCEV_MAX_EXPR_SIZE,
 397          "scev-max-expr-size",
 398          "Bound on size of expressions used in the scalar evolutions analyzer",
 399          20, 0, 0)
 400
 401 /* The product of the next two is used to decide whether or not to
 402    use .GLOBAL_VAR.  See tree-dfa.c.  */
 403 DEFPARAM(PARAM_GLOBAL_VAR_THRESHOLD,
 404         "global-var-threshold",
 405         "Given N calls and V call-clobbered vars in a function.  Use .GLOBAL_VAR if NxV is larger than this limit",
 406         500000, 0, 0)
 407
 408 DEFPARAM(PARAM_MAX_CSELIB_MEMORY_LOCATIONS,
 409          "max-cselib-memory-locations",
 410          "The maximum memory locations recorded by cselib",
 411          500, 0, 0)
 412
 413 #ifdef ENABLE_GC_ALWAYS_COLLECT
 414 # define GGC_MIN_EXPAND_DEFAULT 0
 415 # define GGC_MIN_HEAPSIZE_DEFAULT 0
 416 #else
 417 # define GGC_MIN_EXPAND_DEFAULT 30
 418 # define GGC_MIN_HEAPSIZE_DEFAULT 4096
 419 #endif
 420
 421 DEFPARAM(GGC_MIN_EXPAND,
 422          "ggc-min-expand",
 423          "Minimum heap expansion to trigger garbage collection, as a percentage of the total size of the heap",
 424          GGC_MIN_EXPAND_DEFAULT, 0, 0)
 425
 426 DEFPARAM(GGC_MIN_HEAPSIZE,
 427          "ggc-min-heapsize",
 428          "Minimum heap size before we start collecting garbage, in kilobytes",
 429          GGC_MIN_HEAPSIZE_DEFAULT, 0, 0)
 430
 431 #undef GGC_MIN_EXPAND_DEFAULT
 432 #undef GGC_MIN_HEAPSIZE_DEFAULT
 433
 434 DEFPARAM(PARAM_MAX_RELOAD_SEARCH_INSNS,
 435          "max-reload-search-insns",
 436          "The maximum number of instructions to search backward when looking for equivalent reload",
 437          100, 0, 0)
 438
 439 DEFPARAM(PARAM_MAX_ALIASED_VOPS,
 440          "max-aliased-vops",
 441          "The maximum number of virtual operands allowed to represent aliases before triggering alias grouping",
 442          500, 0, 0)
 443
 444 DEFPARAM(PARAM_MAX_SCHED_REGION_BLOCKS,
 445          "max-sched-region-blocks",
 446          "The maximum number of blocks in a region to be considered for interblock scheduling",
 447          10, 0, 0)
 448
 449 DEFPARAM(PARAM_MAX_SCHED_REGION_INSNS,
 450          "max-sched-region-insns",
 451          "The maximum number of insns in a region to be considered for interblock scheduling",
 452          100, 0, 0)
 453
 454 DEFPARAM(PARAM_MIN_SPEC_PROB,
 455          "min-spec-prob",
 456          "The minimum probability of reaching a source block for interblock speculative scheduling",
 457          40, 0, 0)
 458
 459 DEFPARAM(PARAM_MAX_LAST_VALUE_RTL,
 460          "max-last-value-rtl",
 461          "The maximum number of RTL nodes that can be recorded as combiner's last value",
 462          10000, 0, 0)
 463
 464 /* INTEGER_CST nodes are shared for values [{-1,0} .. N) for
 465    {signed,unsigned} integral types.  This determines N.
 466    Experimentation shows 256 to be a good value.  */
 467 DEFPARAM (PARAM_INTEGER_SHARE_LIMIT,
 468           "integer-share-limit",
 469           "The upper bound for sharing integer constants",
 470           256, 2, 2)
 471
 472 /* Incremental SSA updates for virtual operands may be very slow if
 473    there is a large number of mappings to process.  In those cases, it
 474    is faster to rewrite the virtual symbols from scratch as if they
 475    had been recently introduced.  This heuristic cannot be applied to
 476    SSA mappings for real SSA names, only symbols kept in FUD chains.
 477
 478    PARAM_MIN_VIRTUAL_MAPPINGS specifies the minimum number of virtual
 479    mappings that should be registered to trigger the heuristic.
 480
 481    PARAM_VIRTUAL_MAPPINGS_TO_SYMS_RATIO specifies the ratio between
 482    mappings and symbols.  If the number of virtual mappings is
 483    PARAM_VIRTUAL_MAPPINGS_TO_SYMS_RATIO bigger than the number of
 484    virtual symbols to be updated, then the updater switches to a full
 485    update for those symbols.  */
 486 DEFPARAM (PARAM_MIN_VIRTUAL_MAPPINGS,
 487           "min-virtual-mappings",
 488           "Minimum number of virtual mappings to consider switching to full virtual renames",
 489           100, 0, 0)
 490
 491 DEFPARAM (PARAM_VIRTUAL_MAPPINGS_TO_SYMS_RATIO,
 492           "virtual-mappings-ratio",
 493           "Ratio between virtual mappings and virtual symbols to do full virtual renames",
 494           3, 0, 0)
 495
 496 DEFPARAM (PARAM_SSP_BUFFER_SIZE,
 497           "ssp-buffer-size",
 498           "The lower bound for a buffer to be considered for stack smashing protection",
 499           8, 1, 0)
 500
 501 /*
 502 Local variables:
 503 mode:c
 504 End: */