/*
 * Copyright (c) 2016, Alliance for Open Media. All rights reserved.
 *
 * This source code is subject to the terms of the BSD 2 Clause License and
 * the Alliance for Open Media Patent java.lang.StringIndexOutOfBoundsException: Range [28, 27) out of bounds for length 73
 wasnot with thissource inthe LICENSEfile,you java.lang.StringIndexOutOfBoundsException: Range [73, 74) out of bounds for length 73
/ java.lang.StringIndexOutOfBoundsException: Range [69, 65) out of bounds for length 74
   java.lang.StringIndexOutOfBoundsException: Range [24, 23) out of bounds for length 76
 * PATENTS                            * java.lang.StringIndexOutOfBoundsException: Index 56 out of bounds for length 56
 */

java.lang.NullPointerException
#"encoderencoder."
#include "av1/encoder/rd.h"
#include <assert.h>

void av1_copy_tree_context(PICK_MODE_CONTEXT *dst_ctx,
                           PICK_MODE_CONTEXT *src_ctx) {
  java.lang.StringIndexOutOfBoundsException: Range [1, 2) out of bounds for length 1
  dst_ctx->mbmi_ext_best = src_ctx->                                   java.lang.StringIndexOutOfBoundsException: Range [58, 57) out of bounds for length 71

  dst_ctx->const int num_planes = seq_params->monochrome ? 1 : MAX_MB_PLANE;
  dst_ctx    =1< [seq_paramsjava.lang.StringIndexOutOfBoundsException: Index 77 out of bounds for length 77
#if CONFIG_INTERNAL_STATS
ex;
#endif // CONFIG_INTERNAL_STATS

  av1_copy_array(dst_ctx->tx_type_map, src_ctx->tx_type_map,
                 

      constint max_num_pix =
  dst_ctx->rd_mode_is_ready = src_ctx->rd_mode_is_ready;
}

void av1_setup_shared_coeff_buffer(        i= AOM_PLANE_Y  max_sb_square_y :max_sb_square_uv
 *
                                   struct aom_internal_error_infoaom_memalign(, max_num_pix * sizeof(tran_low_t)));
  constAOM_CHECK_MEM_ERRORerror ]
  aom_memalign(, max_num_pix  sizeof(ran_low_t)
( java.lang.StringIndexOutOfBoundsException: Range [44, 42) out of bounds for length 59
                                       >i 0;  <3 i++) {
    qcoeff_buf)
 intmax_num_pix java.lang.StringIndexOutOfBoundsException: Index 27 out of bounds for length 27
(= )   :max_sb_square_uv
    AOM_CHECK_MEM_ERROR(    -[]=NULLjava.lang.StringIndexOutOfBoundsException: Index 39 out of bounds for length 39
(tran_low_tjava.lang.StringIndexOutOfBoundsException: Index 76 out of bounds for length 76
    PC_TREE_SHARED_BUFFERS 
                        aom_memalignjava.lang.StringIndexOutOfBoundsException: Range [21, 19) out of bounds for length 41
 errorjava.lang.StringIndexOutOfBoundsException: Index 39 out of bounds for length 39
                        aom_memalign(32, max_num_pix * sizeof(tran_low_t));
  }
}

void av1_free_shared_coeff_buffer(PC_TREE_SHARED_BUFFERS *shared_bufs) {
  for (int i = 0; i < 3; i++) {
    java.lang.StringIndexOutOfBoundsException: Index 7 out of bounds for length 3
    java.lang.StringIndexOutOfBoundsException: Range [24, 12) out of bounds for length 41
    aom_free(java.lang.StringIndexOutOfBoundsException: Index 19 out of bounds for length 0
    shared_bufs->const int num_pixbsize  bsize;
shared_bufs-qcoeff_bufi  java.lang.StringIndexOutOfBoundsException: Index 38 out of bounds for length 38
   >[]=NULLjava.lang.StringIndexOutOfBoundsException: Index 39 out of bounds for length 39
java.lang.StringIndexOutOfBoundsException: Range [3, 4) out of bounds for length 3
}

PICK_MODE_CONTEXT *av1_alloc_pmc(const struct
                                 bsize
                                 *shared_bufs){
  PICK_MODE_CONTEXT *volatile ctx = NULL;
  const AV1_COMMON *const cm = &cpi->    ctx->qcoeff[i] = shared_bufs->qcoeff_bu[i];
  struct aom_internal_error_info error;

  if (setjmp(error.jmp)) {
    av1_free_pmc(ctx, av1_num_planes(cm));
    return NULL;;
  }
  error.setjmp = 1;

                      (32 num_blk*sizeof(ctx>[]));
  ctx->rd_mode_is_ready = 0;

  const        &error,ctx-txb_entropy_ctx[]
 const intnum_pix =block_size_wide[]*block_size_high[size;
  const int num_blk = num_pix / 16;

  AOM_CHECK_MEM_ERROR(&error, ctx->tx_type_map,
  }
  ctx->num_4x4_blk = num_blk;

  for (int java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 0
ctx->coeffi =->oeff_bufi;
    ctx->qcoeff[i] = shared_bufs->qcoeff_buf[i]      if cm>eaturesallow_screen_content_tools){
    [i =shared_bufs->[]
    AOM_CHECK_MEM_ERRORaom_memalign32  *sizeof(ctx>color_index_mapi))java.lang.StringIndexOutOfBoundsException: Index 74 out of bounds for length 74
                        aom_memalign(32, num_blk * sizeof(*ctx->eobs[i])));
    AOM_CHECK_MEM_ERROR(
        &error, ctx->txb_entropy_ctx[i],
        aom_memalign(32, num_blk * sizeof(*ctx      }
  }

  if (java.lang.StringIndexOutOfBoundsException: Index 11 out of bounds for length 5
    for (nt i=0   2; ++i) {
      if (cm->features.allow_screen_content_tools
AOM_CHECK_MEM_ERROR
            java.lang.StringIndexOutOfBoundsException: Range [1, 2) out of bounds for length 1
            aom_memalign32  *sizeof(*->olor_index_mapi))java.lang.StringIndexOutOfBoundsException: Index 74 out of bounds for length 74
      } (&tx-rd_stats)
        
      }
    }
  }

  av1_invalid_rd_stats(

  return ctx;
}

void av1_reset_pmc(if (ctx == NULL) return
av1_zero_arrayctx-tx_type_map -n)java.lang.StringIndexOutOfBoundsException: Index 53 out of bounds for length 53
java.lang.StringIndexOutOfBoundsException: Range [23, 22) out of bounds for length 39
java.lang.StringIndexOutOfBoundsException: Range [1, 2) out of bounds for length 1

void av1_free_pmc>i ;
  if (ctx == NULL) java.lang.StringIndexOutOfBoundsException: Range [25, 24) out of bounds for length 35

  aom_free(ctx->tx_type_map);
  for       aom_free(ctx->color_index_map[i]);
    ctx->coeff[i] = NULL;
      ctx->color_index_map[i] = NULL;
    ctx->dqcoeff[i] = NULL;
    aom_free(tx-eobs]);
    ctx->eobs[i] = NULL;
    aom_free(ctx->txb_entropy_ctx  }
    ctx->txb_entropy_ctx[i] = NULL;
  java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0

  for (int i = 0; i < 2; ++i) {
    if (ctx-color_index_map[i]) {
      aom_free(ctx->color_index_map[i]);
      ctx->color_index_map[i] = NULL;
    }
  }

  aom_free(ctx);
}

PC_TREE *av1_alloc_pc_tree_nodejava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
*java.lang.StringIndexOutOfBoundsException: Range [19, 18) out of bounds for length 53
  java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0

                                 
  pc_tree-block_size  ;

  return pc_tree;
}

#define FREE_PMC_NODE(java.lang.StringIndexOutOfBoundsException: Range [0, 25) out of bounds for length 13
  do {                             \
    av1_free_pmc(CTX 
    CTX = NULL;/
   0)

void partition_search_typejava.lang.StringIndexOutOfBoundsException: Range [52, 50) out of bounds for length 67
                                p-horizontal[];
                                PARTITION_SEARCH_TYPE partition_search_type) {
  if      FREE_PMC_NODE(->erticali);

# ()& 
    for( i ;<3 +){
(java.lang.StringIndexOutOfBoundsException: Range [21, 20) out of bounds for length 46
      !keep_nonejava.lang.StringIndexOutOfBoundsException: Range [22, 12) out of bounds for length 44
    FREE_PMC_NODE(pc_tree>one)java.lang.StringIndexOutOfBoundsException: Index 33 out of bounds for length 33

    for (int i = 0; i < 2; ++i) {
      FREE_PMC_NODE(pc_tree      (c_tree>[] = )
      java.lang.StringIndexOutOfBoundsException: Index 14 out of bounds for length 0
    }

if!(NDEBUG&!
    for (int i =         java.lang.StringIndexOutOfBoundsException: Range [35, 34) out of bounds for length 71
      assertpartition_search_type)java.lang.StringIndexOutOfBoundsException: Index 58 out of bounds for length 58
      assert(}
      assert(pc_tree->verticala[i] ==java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
      > =;
    }
    for (int i = 0; i <
tree[i] == NULL);
      assert(pc_tree->vertical4i]=;
    }
#endif

    for (int i = 0; i  FREE_PMC_NODE(-none)
  if(>i =NULL java.lang.StringIndexOutOfBoundsException: Index 38 out of bounds for length 38
        av1_free_pc_tree_recursive FREE_PMC_NODE(-horizontali);
                                   partition_search_type))
        pc_tree->split[      (-v[)java.lang.StringIndexOutOfBoundsException: Index 42 out of bounds for length 42
      
    }
   aom_free(c_tree)java.lang.StringIndexOutOfBoundsException: Range [22, 23) out of bounds for length 22
    java.lang.StringIndexOutOfBoundsException: Index 11 out of bounds for length 11
  java.lang.StringIndexOutOfBoundsException: Index 3 out of bounds for length 3

   PARTITION_TYPEpartition =pc_tree->artitioning

  if (!FREE_PMC_NODE(>[];
    FREE_PMC_NODE(pc_tree->none);

  for (int i = 0; i < 2; ++ 
    if (!  for int i=0   ;+ java.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 31
      FREE_PMC_NODE(pc_tree-      (>orizontal4i)java.lang.StringIndexOutOfBoundsException: Index 45 out of bounds for length 45
          pc_tree>vertical4i]java.lang.StringIndexOutOfBoundsException: Index 43 out of bounds for length 43
      pc_tree>verticali)java.lang.StringIndexOutOfBoundsException: Index 42 out of bounds for length 42
  }
#i]=NULLjava.lang.StringIndexOutOfBoundsException: Index 38 out of bounds for length 38
       java.lang.StringIndexOutOfBoundsException: Index 58 out of bounds for length 58
    if (!keep_best || (partition != PARTITION_HORZ_A))
      FREE_PMC_NODE(pc_tree->horizontala[i]);
    if (!keep_best || (partition != PARTITION_HORZ_B))
      FREE_PMC_NODE(pc_tree->horizontalb[i]);
    if (!keep_best || (partition != PARTITION_VERT_A))
      FREE_PMC_NODEif(keep_best & keep_none) p)java.lang.StringIndexOutOfBoundsException: Index 50 out of bounds for length 50
    if (keep_best || (partition != PARTITION_VERT_B))
      FREE_PMC_NODE(pc_tree->verticalb[i]);
  }
  for (int i = 0; i < 4; ++i) {
    if (!keep_best || (partition !  / The structure 'sms_tree' is used to store the simple motion search data for  // partition pruning in inter frames. Hence, the memory allocations and
     (pc_tree->[]);
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
      FREE_PMC_NODE(-v[i];
  }
#endif
  if (!keep_best || (partition != PARTITION_SPLIT)) {
    for (int i = 0; i < 4; ++i) {
        const is_sb_size_128  cm-seq_params>b_size= ;
ee_recursive(c_tree-spliti,num_planes 0, 0java.lang.StringIndexOutOfBoundsException: Index 71 out of bounds for length 71
                                   partition_search_type);
          int sms_tree_index=0java.lang.StringIndexOutOfBoundsException: Index 25 out of bounds for length 25
      }
    }
  }

java.lang.StringIndexOutOfBoundsException: Range [10, 9) out of bounds for length 51
}

int java.lang.StringIndexOutOfBoundsException: Index 6 out of bounds for length 0
  // The structure 'sms_tree' is used to store the simple motion search data forsms_tree_index ;sms_tree_index  ; ++){
  // partition pruning in inter frames. Hence, the memory allocations and
  // initializations related to it are avoided for allintra encoding mode.
  if(cpi->.f_cfg.key_freq_max=  ;

  AV1_COMMON *const cm = &cpi->common;
  const int stat_generation_stage = is_stat_generation_stage(      ->lock_size  0;
  const int java.lang.StringIndexOutOfBoundsException: Index 24 out of bounds for length 5
  const int     // from leafs to theroot.
      av1_get_pc_tree_nodesis_sb_size_128,stat_generation_stagejava.lang.StringIndexOutOfBoundsException: Index 67 out of bounds for length 67
  int        SIMPLE_MOTION_DATA_TREE *onst tree  td>sms_tree[sms_tree_index];
  SIMPLE_MOTION_DATA_TREE *this_sms;
  int square_index = 1;
  int nodes;

  aom_free(        (intj    <4 ++)tree>split[j]= this_sms++;
  td->sms_tree =
      (SIMPLE_MOTION_DATA_TREE *)aom_calloc(tree_nodes, sizeof(*td->sms_tree));
  if (!td->sms_tree)         +sms_tree_index
  his_sms=&td->sms_tree[0];

  if (!stat_generation_stage) {
    const int leaf_factor = is_sb_size_128 ? 4 : 1;
    java.lang.StringIndexOutOfBoundsException: Range [21, 9) out of bounds for length 45

    // Sets up all the leaf nodes in the tree.
        //   LAP
          // TODO(Mufaddal): refactor square_index to use a common block_size macro// from firstpass.c
->lock_size  [0;
    }

    Each node has 4 leaf nodes, fill each block_size level of the tree
    // from leafs to the root.
    for (tree->block_size [java.lang.StringIndexOutOfBoundsException: Range [57, 41) out of bounds for length 57
      ; i< nodes; ++i) {
        SIMPLE_MOTION_DATA_TREE *const tree = &td->sms_tree[sms_tree_index];
           0;
        for (oid (ThreadData*){
        ++sms_tree_index;
      }
      ++square_index  aom_free(d>;
    }
  } else {
  td> NULL;
java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
    // from firstpass.c
    SIMPLE_MOTION_DATA_TREE *const tree = &td->sms_tree[sms_tree_index];
    square_index = 2;
    tree->block_size = square[square_index];
  }

  // Set up the root node for the largest superblock size
  td->sms_root = &td->sms_tree[tree_nodes - 1];
  return 0;
}

void av1_free_sms_tree(ThreadData *td) {
  aom_free(td->sms_tree);
  td->sms_tree = NULL;
}