ceed-operator.c (57af422ce4fd2bed083e8288205852f8262d25d3) ceed-operator.c (df1daa628943f4e245c41a90ef855a29606b49ff)
1// Copyright (c) 2017-2025, Lawrence Livermore National Security, LLC and other CEED contributors.
2// All Rights Reserved. See the top-level LICENSE and NOTICE files for details.
3//
4// SPDX-License-Identifier: BSD-2-Clause
5//
6// This file is part of CEED: http://github.com/ceed
7
8#include <ceed-impl.h>

--- 1608 unchanged lines hidden (view full) ---

1617 CeedCall(CeedCalloc(tab_width * (num_tabs + is_composite) + 1, &tabs));
1618 for (CeedInt i = 0; i < tab_width * num_tabs; i++) tabs[i] = ' ';
1619 if (is_composite) {
1620 CeedInt num_suboperators;
1621 CeedOperator *sub_operators;
1622
1623 CeedCall(CeedOperatorCompositeGetNumSub(op, &num_suboperators));
1624 CeedCall(CeedOperatorCompositeGetSubList(op, &sub_operators));
1// Copyright (c) 2017-2025, Lawrence Livermore National Security, LLC and other CEED contributors.
2// All Rights Reserved. See the top-level LICENSE and NOTICE files for details.
3//
4// SPDX-License-Identifier: BSD-2-Clause
5//
6// This file is part of CEED: http://github.com/ceed
7
8#include <ceed-impl.h>

--- 1608 unchanged lines hidden (view full) ---

1617 CeedCall(CeedCalloc(tab_width * (num_tabs + is_composite) + 1, &tabs));
1618 for (CeedInt i = 0; i < tab_width * num_tabs; i++) tabs[i] = ' ';
1619 if (is_composite) {
1620 CeedInt num_suboperators;
1621 CeedOperator *sub_operators;
1622
1623 CeedCall(CeedOperatorCompositeGetNumSub(op, &num_suboperators));
1624 CeedCall(CeedOperatorCompositeGetSubList(op, &sub_operators));
1625 fprintf(stream, tabs);
1625 fprintf(stream, "%s", tabs);
1626 fprintf(stream, "Composite CeedOperator%s%s\n", has_name ? " - " : "", has_name ? name : "");
1627 for (CeedInt i = 0; i < tab_width; i++) tabs[tab_width * num_tabs + i] = ' ';
1628 for (CeedInt i = 0; i < num_suboperators; i++) {
1629 has_name = sub_operators[i]->name;
1626 fprintf(stream, "Composite CeedOperator%s%s\n", has_name ? " - " : "", has_name ? name : "");
1627 for (CeedInt i = 0; i < tab_width; i++) tabs[tab_width * num_tabs + i] = ' ';
1628 for (CeedInt i = 0; i < num_suboperators; i++) {
1629 has_name = sub_operators[i]->name;
1630 fprintf(stream, tabs);
1630 fprintf(stream, "%s", tabs);
1631 fprintf(stream, "SubOperator%s %" CeedInt_FMT "%s%s%s\n", is_at_points ? " AtPoints" : "", i, has_name ? " - " : "",
1632 has_name ? sub_operators[i]->name : "", is_full ? ":" : "");
1633 if (is_full) CeedCall(CeedOperatorSingleView(sub_operators[i], tabs, stream));
1634 }
1635 } else {
1631 fprintf(stream, "SubOperator%s %" CeedInt_FMT "%s%s%s\n", is_at_points ? " AtPoints" : "", i, has_name ? " - " : "",
1632 has_name ? sub_operators[i]->name : "", is_full ? ":" : "");
1633 if (is_full) CeedCall(CeedOperatorSingleView(sub_operators[i], tabs, stream));
1634 }
1635 } else {
1636 fprintf(stream, tabs);
1636 fprintf(stream, "%s", tabs);
1637 fprintf(stream, "CeedOperator%s%s%s\n", is_at_points ? " AtPoints" : "", has_name ? " - " : "", has_name ? name : "");
1638 if (is_full) CeedCall(CeedOperatorSingleView(op, tabs, stream));
1639 }
1640 CeedCall(CeedFree(&tabs));
1641 return CEED_ERROR_SUCCESS;
1642}
1643
1644/**

--- 801 unchanged lines hidden --- 		1637 fprintf(stream, "CeedOperator%s%s%s\n", is_at_points ? " AtPoints" : "", has_name ? " - " : "", has_name ? name : "");
1638 if (is_full) CeedCall(CeedOperatorSingleView(op, tabs, stream));
1639 }
1640 CeedCall(CeedFree(&tabs));
1641 return CEED_ERROR_SUCCESS;
1642}
1643
1644/**

--- 801 unchanged lines hidden ---