node_fn_boolean_math.cc

Go to the documentation of this file.

/* SPDX-FileCopyrightText: 2023 Blender Authors
 *
 * SPDX-License-Identifier: GPL-2.0-or-later */
 
#include "BLI_listbase.h"
#include "BLI_string_utf8.h"
 
#include "RNA_enum_types.hh"
 
#include "UI_interface_layout.hh"
#include "UI_resources.hh"
 
#include "NOD_inverse_eval_params.hh"
#include "NOD_socket_search_link.hh"
#include "NOD_value_elem_eval.hh"
 
#include "NOD_rna_define.hh"
 
#include "node_function_util.hh"
 
namespace blender::nodes::node_fn_boolean_math_cc {
 
static void node_declare(NodeDeclarationBuilder &b)
{
  b.is_function_node();
  b.add_input<decl::Bool>("Boolean", "Boolean");
  b.add_input<decl::Bool>("Boolean", "Boolean_001");
  b.add_output<decl::Bool>("Boolean");
}
 
static void node_layout(uiLayout *layout, bContext * /*C*/, PointerRNA *ptr)
{
  layout->prop(ptr, "operation", UI_ITEM_NONE, "", ICON_NONE);
}
 
static void node_update(bNodeTree *ntree, bNode *node)
{
  bNodeSocket *sockB = (bNodeSocket *)BLI_findlink(&node->inputs, 1);
 
  bke::node_set_socket_availability(*ntree, *sockB, !ELEM(node->custom1, NODE_BOOLEAN_MATH_NOT));
}
 
static void node_label(const bNodeTree * /*tree*/,
                       const bNode *node,
                       char *label,
                       int label_maxncpy)
{
  const char *name;
  bool enum_label = RNA_enum_name(rna_enum_node_boolean_math_items, node->custom1, &name);
  if (!enum_label) {
    name = N_("Unknown");
  }
  BLI_strncpy_utf8(label, IFACE_(name), label_maxncpy);
}
 
static void node_gather_link_searches(GatherLinkSearchOpParams &params)
{
  if (!params.node_tree().typeinfo->validate_link(eNodeSocketDatatype(params.other_socket().type),
                                                  SOCK_BOOLEAN))
  {
    return;
  }
 
  for (const EnumPropertyItem *item = rna_enum_node_boolean_math_items;
       item->identifier != nullptr;
       item++)
  {
    if (item->name != nullptr && item->identifier[0] != '\0') {
      NodeBooleanMathOperation operation = static_cast<NodeBooleanMathOperation>(item->value);
      params.add_item(IFACE_(item->name), [operation](LinkSearchOpParams &params) {
        bNode &node = params.add_node("FunctionNodeBooleanMath");
        node.custom1 = operation;
        params.update_and_connect_available_socket(node, "Boolean");
      });
    }
  }
}
 
static const mf::MultiFunction *get_multi_function(const bNode &bnode)
{
  static auto exec_preset = mf::build::exec_presets::AllSpanOrSingle();
  static auto and_fn = mf::build::SI2_SO<bool, bool, bool>(
      "And", [](bool a, bool b) { return a && b; }, exec_preset);
  static auto or_fn = mf::build::SI2_SO<bool, bool, bool>(
      "Or", [](bool a, bool b) { return a || b; }, exec_preset);
  static auto not_fn = mf::build::SI1_SO<bool, bool>(
      "Not", [](bool a) { return !a; }, exec_preset);
  static auto nand_fn = mf::build::SI2_SO<bool, bool, bool>(
      "Not And", [](bool a, bool b) { return !(a && b); }, exec_preset);
  static auto nor_fn = mf::build::SI2_SO<bool, bool, bool>(
      "Nor", [](bool a, bool b) { return !(a || b); }, exec_preset);
  static auto xnor_fn = mf::build::SI2_SO<bool, bool, bool>(
      "Equal", [](bool a, bool b) { return a == b; }, exec_preset);
  static auto xor_fn = mf::build::SI2_SO<bool, bool, bool>(
      "Not Equal", [](bool a, bool b) { return a != b; }, exec_preset);
  static auto imply_fn = mf::build::SI2_SO<bool, bool, bool>(
      "Imply", [](bool a, bool b) { return !a || b; }, exec_preset);
  static auto nimply_fn = mf::build::SI2_SO<bool, bool, bool>(
      "Subtract", [](bool a, bool b) { return a && !b; }, exec_preset);
 
  switch (bnode.custom1) {
    case NODE_BOOLEAN_MATH_AND:
      return &and_fn;
    case NODE_BOOLEAN_MATH_OR:
      return &or_fn;
    case NODE_BOOLEAN_MATH_NOT:
      return &not_fn;
    case NODE_BOOLEAN_MATH_NAND:
      return &nand_fn;
    case NODE_BOOLEAN_MATH_NOR:
      return &nor_fn;
    case NODE_BOOLEAN_MATH_XNOR:
      return &xnor_fn;
    case NODE_BOOLEAN_MATH_XOR:
      return &xor_fn;
    case NODE_BOOLEAN_MATH_IMPLY:
      return &imply_fn;
    case NODE_BOOLEAN_MATH_NIMPLY:
      return &nimply_fn;
  }
 
  BLI_assert_unreachable();
  return nullptr;
}
 
static void node_build_multi_function(NodeMultiFunctionBuilder &builder)
{
  const mf::MultiFunction *fn = get_multi_function(builder.node());
  builder.set_matching_fn(fn);
}
 
static void node_eval_elem(value_elem::ElemEvalParams &params)
{
  using namespace value_elem;
  const NodeBooleanMathOperation op = NodeBooleanMathOperation(params.node.custom1);
  switch (op) {
    case NODE_BOOLEAN_MATH_NOT: {
      params.set_output_elem("Boolean", params.get_input_elem<BoolElem>("Boolean"));
      break;
    }
    default: {
      break;
    }
  }
}
 
static void node_eval_inverse_elem(value_elem::InverseElemEvalParams &params)
{
  using namespace value_elem;
  const NodeBooleanMathOperation op = NodeBooleanMathOperation(params.node.custom1);
  switch (op) {
    case NODE_BOOLEAN_MATH_NOT: {
      params.set_input_elem("Boolean", params.get_output_elem<BoolElem>("Boolean"));
      break;
    }
    default: {
      break;
    }
  }
}
 
static void node_eval_inverse(inverse_eval::InverseEvalParams &params)
{
  const NodeBooleanMathOperation op = NodeBooleanMathOperation(params.node.custom1);
  const StringRef first_input_id = "Boolean";
  const StringRef output_id = "Boolean";
  switch (op) {
    case NODE_BOOLEAN_MATH_NOT: {
      params.set_input(first_input_id, !params.get_output<bool>(output_id));
      break;
    }
    default: {
      break;
    }
  }
}
 
static void node_rna(StructRNA *srna)
{
  RNA_def_node_enum(srna,
                    "operation",
                    "Operation",
                    "",
                    rna_enum_node_boolean_math_items,
                    NOD_inline_enum_accessors(custom1));
}
 
static void node_register()
{
  static blender::bke::bNodeType ntype;
 
  fn_node_type_base(&ntype, "FunctionNodeBooleanMath", FN_NODE_BOOLEAN_MATH);
  ntype.ui_name = "Boolean Math";
  ntype.ui_description = "Perform a logical operation on the given boolean inputs";
  ntype.enum_name_legacy = "BOOLEAN_MATH";
  ntype.nclass = NODE_CLASS_CONVERTER;
  ntype.declare = node_declare;
  ntype.labelfunc = node_label;
  ntype.updatefunc = node_update;
  ntype.build_multi_function = node_build_multi_function;
  ntype.draw_buttons = node_layout;
  ntype.gather_link_search_ops = node_gather_link_searches;
  ntype.eval_elem = node_eval_elem;
  ntype.eval_inverse_elem = node_eval_inverse_elem;
  ntype.eval_inverse = node_eval_inverse;
  blender::bke::node_register_type(ntype);
 
  node_rna(ntype.rna_ext.srna);
}
NOD_REGISTER_NODE(node_register)
 
}  // namespace blender::nodes::node_fn_boolean_math_cc