<commit_before>/*
 * Project:     libFIRM
 * File name:   ir/ana/irloop_t.h
 * Purpose:     Loop datastructure and access functions -- private stuff.
 * Author:      <NAME>
 * Modified by:
 * Created:     7.2002
 * CVS-ID:      $Id$
 * Copyright:   (c) 2002-2003 Universitt Karlsruhe
 * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
 */

/**
 * @file irloop_t.h
 * Loop datastructure and access functions -- private stuff.
 *
 * @author <NAME>
 */

#include "firm_common.h"
#include "irgraph_t.h"
#include "irloop.h"

#ifndef _IRLOOP_T_H_
#define _IRLOOP_T_H_

/**
 * Possible loop flags, can be or'ed.
 */
typedef enum loop_flags {
  loop_is_count_loop = 0x00000001,  /**< if set it's a counting loop */
  loop_downto_loop   = 0x00000002,  /**< if set, it's a downto loop, else an upto loop */
  loop_is_endless    = 0x00000004,  /**< if set, this is an endless loop */
  loop_is_dead       = 0x00000008,  /**< if set, it's a dead loop ie will never be entered */
  loop_wrap_around   = 0x00000010,  /**< this loop is NOT endless, because of wrap around */
  loop_end_false     = 0x00000020,  /**< this loop end can't be computed "from compute_loop_info.c" */
  do_loop            = 0x00000040,  /**< this is a do loop */
  once               = 0x00000080,  /**< this is a do loop, with a false condition.It itarate once */
} loop_flags_t;

/** The loops datastructure. */
struct ir_loop {
  firm_kind kind;		    /**< A type tag, set to k_ir_loop. */

  struct ir_loop *outer_loop;       /**< The outer loop */
  loop_element   *children;         /**< Mixed array: Contains sons and loop_nodes */
  int depth;                        /**< Nesting depth */
  int n_sons;                       /**< Number of ir_nodes in array "children" */
  int n_nodes;                      /**< Number of loop_nodes in array "children" */
  unsigned flags;                   /**< a set of loop_flags_t */
  tarval  *loop_iter_start;         /**< counting loop: the start value */
  tarval  *loop_iter_end;           /**< counting loop: the last value reached */
  tarval  *loop_iter_increment;     /**< counting loop: the increment */
  ir_node *loop_iter_variable;      /**< The iteration variable of counting loop.*/

  /*
  struct state_entry *mem_phis;
  struct state_entry *states;

  struct obset **oval;
  struct loop_node *link;
  */
#ifdef DEBUG_libfirm
  int loop_nr;             /**< a unique node number for each loop node to make output
			      readable. */
  void *link;              /**< GL @@@ For debugging the analyses. */
#endif
};


/** Add a son loop to a father loop. */
void add_loop_son(ir_loop *loop, ir_loop *son);

/** Add a node to a loop. */<commit_msg>fixed the type of the loop number<commit_after>/*
 * Project:     libFIRM
 * File name:   ir/ana/irloop_t.h
 * Purpose:     Loop datastructure and access functions -- private stuff.
 * Author:      <NAME>
 * Modified by:
 * Created:     7.2002
 * CVS-ID:      $Id$
 * Copyright:   (c) 2002-2003 Universitt Karlsruhe
 * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
 */

/**
 * @file irloop_t.h
 * Loop datastructure and access functions -- private stuff.
 *
 * @author <NAME>
 */

#include "firm_common.h"
#include "irgraph_t.h"
#include "irloop.h"

#ifndef _IRLOOP_T_H_
#define _IRLOOP_T_H_

/**
 * Possible loop flags, can be or'ed.
 */
typedef enum loop_flags {
  loop_is_count_loop = 0x00000001,  /**< if set it's a counting loop */
  loop_downto_loop   = 0x00000002,  /**< if set, it's a downto loop, else an upto loop */
  loop_is_endless    = 0x00000004,  /**< if set, this is an endless loop */
  loop_is_dead       = 0x00000008,  /**< if set, it's a dead loop ie will never be entered */
  loop_wrap_around   = 0x00000010,  /**< this loop is NOT endless, because of wrap around */
  loop_end_false     = 0x00000020,  /**< this loop end can't be computed "from compute_loop_info.c" */
  do_loop            = 0x00000040,  /**< this is a do loop */
  once               = 0x00000080,  /**< this is a do loop, with a false condition.It itarate once */
} loop_flags_t;

/** The loops datastructure. */
struct ir_loop {
  firm_kind kind;		    /**< A type tag, set to k_ir_loop. */

  struct ir_loop *outer_loop;       /**< The outer loop */
  loop_element   *children;         /**< Mixed array: Contains sons and loop_nodes */
  int depth;                        /**< Nesting depth */
  int n_sons;                       /**< Number of ir_nodes in array "children" */
  int n_nodes;                      /**< Number of loop_nodes in array "children" */
  unsigned flags;                   /**< a set of loop_flags_t */
  tarval  *loop_iter_start;         /**< counting loop: the start value */
  tarval  *loop_iter_end;           /**< counting loop: the last value reached */
  tarval  *loop_iter_increment;     /**< counting loop: the increment */
  ir_node *loop_iter_variable;      /**< The iteration variable of counting loop.*/

  /*
  struct state_entry *mem_phis;
  struct state_entry *states;

  struct obset **oval;
  struct loop_node *link;
  */
#ifdef DEBUG_libfirm
  long loop_nr;            /**< a unique node number for each loop node to make output
			      readable. */
  void *link;              /**< GL @@@ For debugging the analyses. */
#endif
};


/** Add a son loop to a father loop. */
void add_loop_son(ir_loop *loop, ir_loop *son);

/** Add a node to a loop. */
{'fraction_non_alphanumeric': 0.11801701812800591, 'fraction_numerical': 0.031446540880503145, 'mean_word_length': 2.4221518987341772, 'pattern_counts': {'":': 0, '<': 49, '<?xml version=': 0, '>': 7, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 8, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '1256251', 'n_tokens_mistral': 1937, 'n_tokens_neox': 1730, 'n_words': 582}