@@ -322,8 +322,8 @@ static std::unique_ptr<string_builtin_functiont> to_string_builtin_function(
322
322
return {};
323
323
}
324
324
325
- string_dependencest ::string_nodet &
326
- string_dependencest ::get_node (const array_string_exprt &e)
325
+ string_dependenciest ::string_nodet &
326
+ string_dependenciest ::get_node (const array_string_exprt &e)
327
327
{
328
328
auto entry_inserted = node_index_pool.emplace (e, string_nodes.size ());
329
329
if (!entry_inserted.second )
@@ -333,7 +333,7 @@ string_dependencest::get_node(const array_string_exprt &e)
333
333
return string_nodes.back ();
334
334
}
335
335
336
- string_dependencest ::builtin_function_nodet string_dependencest ::make_node (
336
+ string_dependenciest ::builtin_function_nodet string_dependenciest ::make_node (
337
337
std::unique_ptr<string_builtin_functiont> &builtin_function)
338
338
{
339
339
const builtin_function_nodet builtin_function_node (
@@ -343,36 +343,36 @@ string_dependencest::builtin_function_nodet string_dependencest::make_node(
343
343
return builtin_function_node;
344
344
}
345
345
346
- const string_builtin_functiont &string_dependencest ::get_builtin_function (
346
+ const string_builtin_functiont &string_dependenciest ::get_builtin_function (
347
347
const builtin_function_nodet &node) const
348
348
{
349
349
PRECONDITION (node.index < builtin_function_nodes.size ());
350
350
return *(builtin_function_nodes[node.index ]);
351
351
}
352
352
353
- const std::vector<string_dependencest ::builtin_function_nodet> &
354
- string_dependencest ::dependencies (
355
- const string_dependencest ::string_nodet &node) const
353
+ const std::vector<string_dependenciest ::builtin_function_nodet> &
354
+ string_dependenciest ::dependencies (
355
+ const string_dependenciest ::string_nodet &node) const
356
356
{
357
357
return node.dependencies ;
358
358
}
359
359
360
- void string_dependencest ::add_dependency (
360
+ void string_dependenciest ::add_dependency (
361
361
const array_string_exprt &e,
362
362
const builtin_function_nodet &builtin_function_node)
363
363
{
364
364
string_nodet &string_node = get_node (e);
365
365
string_node.dependencies .push_back (builtin_function_node);
366
366
}
367
367
368
- void string_dependencest ::add_unknown_dependency (const array_string_exprt &e)
368
+ void string_dependenciest ::add_unknown_dependency (const array_string_exprt &e)
369
369
{
370
370
string_nodet &string_node = get_node (e);
371
371
string_node.depends_on_unknown_builtin_function = true ;
372
372
}
373
373
374
374
static void add_unknown_dependency_to_string_subexprs (
375
- string_dependencest &dependencies,
375
+ string_dependenciest &dependencies,
376
376
const function_application_exprt &fun_app,
377
377
array_poolt &array_pool)
378
378
{
@@ -392,9 +392,9 @@ static void add_unknown_dependency_to_string_subexprs(
392
392
}
393
393
394
394
static void add_dependency_to_string_subexprs (
395
- string_dependencest &dependencies,
395
+ string_dependenciest &dependencies,
396
396
const function_application_exprt &fun_app,
397
- const string_dependencest ::builtin_function_nodet &builtin_function_node,
397
+ const string_dependenciest ::builtin_function_nodet &builtin_function_node,
398
398
array_poolt &array_pool)
399
399
{
400
400
PRECONDITION (fun_app.arguments ()[0 ].type ().id () != ID_pointer);
@@ -424,7 +424,7 @@ static void add_dependency_to_string_subexprs(
424
424
}
425
425
}
426
426
427
- string_dependencest ::node_indext string_dependencest ::size () const
427
+ string_dependenciest ::node_indext string_dependenciest ::size () const
428
428
{
429
429
return builtin_function_nodes.size () + string_nodes.size ();
430
430
}
@@ -444,36 +444,36 @@ builtin_function_index_to_node_index(const std::size_t builtin_index)
444
444
return 2 * builtin_index;
445
445
}
446
446
447
- string_dependencest ::node_indext
448
- string_dependencest ::node_index (const builtin_function_nodet &n) const
447
+ string_dependenciest ::node_indext
448
+ string_dependenciest ::node_index (const builtin_function_nodet &n) const
449
449
{
450
450
return builtin_function_index_to_node_index (n.index );
451
451
}
452
452
453
- string_dependencest ::node_indext
454
- string_dependencest ::node_index (const array_string_exprt &s) const
453
+ string_dependenciest ::node_indext
454
+ string_dependenciest ::node_index (const array_string_exprt &s) const
455
455
{
456
456
return string_index_to_node_index (node_index_pool.at (s));
457
457
}
458
458
459
- optionalt<string_dependencest ::builtin_function_nodet>
460
- string_dependencest ::get_builtin_function_node (node_indext i) const
459
+ optionalt<string_dependenciest ::builtin_function_nodet>
460
+ string_dependenciest ::get_builtin_function_node (node_indext i) const
461
461
{
462
462
if (i % 2 == 0 )
463
463
return builtin_function_nodet (i / 2 );
464
464
return {};
465
465
}
466
466
467
- optionalt<string_dependencest ::string_nodet>
468
- string_dependencest ::get_string_node (node_indext i) const
467
+ optionalt<string_dependenciest ::string_nodet>
468
+ string_dependenciest ::get_string_node (node_indext i) const
469
469
{
470
470
if (i % 2 == 1 && i / 2 < string_nodes.size ())
471
471
return string_nodes[i / 2 ];
472
472
return {};
473
473
}
474
474
475
475
bool add_node (
476
- string_dependencest &dependencies,
476
+ string_dependenciest &dependencies,
477
477
const equal_exprt &equation,
478
478
array_poolt &array_pool)
479
479
{
@@ -505,7 +505,7 @@ bool add_node(
505
505
return true ;
506
506
}
507
507
508
- void string_dependencest ::for_each_successor (
508
+ void string_dependenciest ::for_each_successor (
509
509
const std::size_t &i,
510
510
const std::function<void (const std::size_t &)> &f) const
511
511
{
@@ -529,7 +529,7 @@ void string_dependencest::for_each_successor(
529
529
UNREACHABLE;
530
530
}
531
531
532
- void string_dependencest ::output_dot (std::ostream &stream) const
532
+ void string_dependenciest ::output_dot (std::ostream &stream) const
533
533
{
534
534
const auto for_each_node =
535
535
[&](const std::function<void (const std::size_t &)> &f) { // NOLINT
0 commit comments