dtinfo: Fix coverity warning related to using delete not delete []
This commit is contained in:
@@ -57,14 +57,14 @@ void BitVector::setAllBitsTo(unsigned int initValue)
|
||||
|
||||
BitVector::~BitVector()
|
||||
{
|
||||
delete f_array;
|
||||
delete [] f_array;
|
||||
delete f_positionArray;
|
||||
}
|
||||
|
||||
void BitVector::setTo(BitVector& v)
|
||||
{
|
||||
if ( f_words != v.f_words ) {
|
||||
delete f_array;
|
||||
delete [] f_array;
|
||||
f_array = new unsigned int[v.f_words];
|
||||
}
|
||||
f_bits = v.f_bits;
|
||||
|
||||
@@ -532,7 +532,7 @@ FeatureValueString::operator+(const FeatureValue& x) const
|
||||
newString[len1+len2] = 0;
|
||||
|
||||
FeatureValueString *z = new FeatureValueString(newString);
|
||||
delete newString;
|
||||
delete [] newString;
|
||||
|
||||
return z;
|
||||
}
|
||||
|
||||
@@ -215,8 +215,8 @@ f_bad_info_base_names(0), f_bad_info_base_paths(0), f_descriptor(des)
|
||||
memcpy(y, f_bad_info_base_paths, sizeof(charPtr)*f_bad_base_array_size);
|
||||
f_bad_base_array_size *= 2;
|
||||
|
||||
delete f_bad_info_base_names;
|
||||
delete f_bad_info_base_paths;
|
||||
delete [] f_bad_info_base_names;
|
||||
delete [] f_bad_info_base_paths;
|
||||
|
||||
f_bad_info_base_names = x;
|
||||
f_bad_info_base_paths = y;
|
||||
|
||||
@@ -44,7 +44,7 @@ public: // functions
|
||||
f_string = NULL;
|
||||
}
|
||||
|
||||
virtual ~CC_String () { delete f_string; }
|
||||
virtual ~CC_String () { delete [] f_string; }
|
||||
|
||||
CC_Boolean isNull() const {
|
||||
return( f_string[0] == '\0' );
|
||||
|
||||
@@ -40,7 +40,7 @@ private:
|
||||
|
||||
public:
|
||||
CC_Tokenizer(const CC_String & );
|
||||
~CC_Tokenizer() { delete str_; }
|
||||
~CC_Tokenizer() { delete [] str_; }
|
||||
|
||||
|
||||
/* Here is an example to use the code
|
||||
|
||||
@@ -100,8 +100,8 @@ imp_die::~imp_die()
|
||||
x = y ;
|
||||
}
|
||||
|
||||
delete hash_table;
|
||||
delete bucket_array ;
|
||||
delete [] hash_table;
|
||||
delete [] bucket_array ;
|
||||
}
|
||||
|
||||
//**********************************************************
|
||||
@@ -113,14 +113,14 @@ void imp_die::alloc_table(int new_H)
|
||||
{
|
||||
if ( bucket_array ) {
|
||||
for ( int i = 0; i<B; delete bucket_array[i++] );
|
||||
delete bucket_array ;
|
||||
delete [] bucket_array ;
|
||||
}
|
||||
|
||||
B = new_H/2;
|
||||
bucket_array = new imp_bucketPtr[B];
|
||||
|
||||
if ( hash_table ) {
|
||||
delete hash_table;
|
||||
delete [] hash_table;
|
||||
}
|
||||
|
||||
hash_table = new data_tPtr[new_H];
|
||||
|
||||
@@ -171,7 +171,7 @@ buckets::~buckets()
|
||||
for ( int i=0; i<v_no_buckets; i++ )
|
||||
delete v_bucket_array[i];
|
||||
|
||||
delete v_bucket_array;
|
||||
delete [] v_bucket_array;
|
||||
}
|
||||
|
||||
void buckets::set_control_bit(int cb)
|
||||
@@ -284,10 +284,10 @@ void buckets::sort_by_size()
|
||||
|
||||
for ( ; j<v_no_buckets; new_bkt_array[j++] = 0 );
|
||||
|
||||
delete sizes;
|
||||
delete links;
|
||||
delete [] sizes;
|
||||
delete [] links;
|
||||
|
||||
delete v_bucket_array;
|
||||
delete [] v_bucket_array;
|
||||
v_bucket_array = new_bkt_array;
|
||||
}
|
||||
|
||||
|
||||
@@ -254,7 +254,7 @@ int write_spec(buckets& bs, params& pms, buffer& mphf_buffer)
|
||||
mphf_buffer.set_content_sz(fout_len);
|
||||
memcpy(mphf_buffer.get_base(), fout.str().c_str(), fout_len);
|
||||
|
||||
delete c_array;
|
||||
delete [] c_array;
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -350,7 +350,7 @@ debug(cerr, k+1);
|
||||
cerr << "=======\n";
|
||||
*/
|
||||
|
||||
delete y;
|
||||
delete [] y;
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
||||
@@ -64,9 +64,9 @@ v_no_slots(params_ptr.v_n), v_num_filled_slots(0)
|
||||
|
||||
mphf_hash_table::~mphf_hash_table()
|
||||
{
|
||||
delete v_rep ;
|
||||
delete v_random_table ;
|
||||
delete v_map_table ;
|
||||
delete [] v_rep ;
|
||||
delete [] v_random_table ;
|
||||
delete [] v_map_table ;
|
||||
}
|
||||
|
||||
void mphf_hash_table::clear()
|
||||
|
||||
@@ -58,7 +58,7 @@ int_pattern::int_pattern(int i): v_rep_size(i), v_count(0)
|
||||
|
||||
int_pattern::~int_pattern()
|
||||
{
|
||||
delete v_rep;
|
||||
delete [] v_rep;
|
||||
}
|
||||
|
||||
int int_pattern::duplicate()
|
||||
|
||||
@@ -111,7 +111,7 @@ sorter::~sorter()
|
||||
delete v_bucket_array;
|
||||
|
||||
for ( i=0; i<v_no_unique_keys; delete v_unique_keys[i++] );
|
||||
delete v_unique_keys;
|
||||
delete [] v_unique_keys;
|
||||
}
|
||||
|
||||
void sorter::filter_by_hash()
|
||||
@@ -137,10 +137,10 @@ void sorter::filter_by_hash()
|
||||
filter_a_bucket(v_bucket_array[i]);
|
||||
}
|
||||
|
||||
delete v_map_table;
|
||||
delete v_check_table;
|
||||
delete v_index_table;
|
||||
delete v_dup_table;
|
||||
delete [] v_map_table;
|
||||
delete [] v_check_table;
|
||||
delete [] v_index_table;
|
||||
delete [] v_dup_table;
|
||||
}
|
||||
|
||||
void sorter::filter_a_bucket(bucketPtr bkt)
|
||||
|
||||
@@ -138,7 +138,7 @@ void oid_list::init_data_member(int leng)
|
||||
//debug(cerr, (void*)this);
|
||||
//debug(cerr, (void*)list_ptr.p);
|
||||
|
||||
delete ptr;
|
||||
delete [] ptr;
|
||||
v_sz = leng;
|
||||
set_mode(UPDATE, true);
|
||||
}
|
||||
@@ -188,7 +188,7 @@ debug(cerr, int(&list_ptr.loc));
|
||||
storage_ptr -> appendString(list_ptr.loc, ptr, total_char_leng);
|
||||
}
|
||||
|
||||
delete ptr;
|
||||
delete [] ptr;
|
||||
|
||||
ok = true;
|
||||
|
||||
|
||||
@@ -139,7 +139,7 @@ DtMmdbGetBookCaseByLocs(int infolib_descriptor, const char** locators,
|
||||
for ( int i=0; i<count; i++ )
|
||||
ds[i] = bases[i] -> index_id();
|
||||
|
||||
delete bases;
|
||||
delete [] bases;
|
||||
|
||||
if (count_ptr) *count_ptr = count;
|
||||
|
||||
|
||||
@@ -72,8 +72,8 @@ OLIAS_DB::~OLIAS_DB()
|
||||
delete x;
|
||||
}
|
||||
|
||||
delete info_base_set_names;
|
||||
delete info_base_list_names;
|
||||
delete [] info_base_set_names;
|
||||
delete [] info_base_list_names;
|
||||
}
|
||||
|
||||
int OLIAS_DB::validInfoLibPath(const char* path)
|
||||
|
||||
@@ -192,7 +192,7 @@ user_base::checking_status_t user_base::check_lock()
|
||||
) {
|
||||
if ( ai_info ) {
|
||||
debug(cerr, ai_info);
|
||||
delete ai_info;
|
||||
delete [] ai_info;
|
||||
}
|
||||
return user_base::RLOCK_FAIL;
|
||||
} else
|
||||
@@ -220,7 +220,7 @@ user_base::checking_status_t user_base::check_lock()
|
||||
// return ok;
|
||||
// }
|
||||
|
||||
delete ai_info;
|
||||
delete [] ai_info;
|
||||
}
|
||||
return user_base::WLOCK_FAIL;
|
||||
} else {
|
||||
|
||||
@@ -215,7 +215,7 @@ container_desc::init_index_array(object_dict& dict,
|
||||
index_array[pos] = tmp_index_array[ind];
|
||||
}
|
||||
|
||||
delete tmp_index_array;
|
||||
delete [] tmp_index_array;
|
||||
}
|
||||
|
||||
//////////////////////////////////////////////////////////////////////
|
||||
|
||||
@@ -156,7 +156,7 @@ desc* object_dict::init_a_base(char* db_path, char* db_name)
|
||||
////////////////
|
||||
x = parse(orig);
|
||||
|
||||
delete buf;
|
||||
delete [] buf;
|
||||
|
||||
}
|
||||
|
||||
@@ -268,7 +268,7 @@ desc* object_dict::init_a_base(char* define_desc_path, char* db_path,
|
||||
|
||||
out.close();
|
||||
|
||||
delete schema_buf;
|
||||
delete [] schema_buf;
|
||||
|
||||
|
||||
return x;
|
||||
|
||||
@@ -64,12 +64,12 @@ stored_object_desc::stored_object_desc(int class_code, const char* _type)
|
||||
|
||||
stored_object_desc::~stored_object_desc()
|
||||
{
|
||||
delete store_nm;
|
||||
free(store_nm);
|
||||
}
|
||||
|
||||
void stored_object_desc::set_store_nm(const char* str)
|
||||
{
|
||||
delete store_nm;
|
||||
free(store_nm);
|
||||
store_nm = strdup(str);
|
||||
}
|
||||
|
||||
|
||||
@@ -118,7 +118,7 @@ debug(cerr, vector[i] -> str_offset);
|
||||
|
||||
|
||||
binary_insert(vector, 0, vector_sz-1);
|
||||
delete vector;
|
||||
delete [] vector;
|
||||
}
|
||||
|
||||
chunks_index::~chunks_index()
|
||||
|
||||
@@ -93,7 +93,7 @@ void quit_store(page_storage** st, unsigned int ct)
|
||||
for ( unsigned int i=0; i<ct; i++) {
|
||||
delete st[i];
|
||||
}
|
||||
delete st;
|
||||
delete [] st;
|
||||
}
|
||||
|
||||
int page_cache_test_1(int argc, char** argv)
|
||||
|
||||
@@ -134,7 +134,7 @@ Boolean ostring::expand(const int new_alloc_sz, Boolean pre_zero)
|
||||
|
||||
if ( v_p ) {
|
||||
memcpy(new_p, v_p, v_sz);
|
||||
delete v_p;
|
||||
delete [] v_p;
|
||||
}
|
||||
|
||||
v_p = new_p;
|
||||
|
||||
@@ -54,7 +54,7 @@ public:
|
||||
ostring(const int chunk_size);
|
||||
ostring(char* str, const int str_sz = -1); // -1 means take strlen(str)
|
||||
ostring(const ostring&);
|
||||
virtual ~ostring() { delete v_p; };
|
||||
virtual ~ostring() { delete [] v_p; };
|
||||
|
||||
// length of the string
|
||||
int size() const { return v_sz; };
|
||||
|
||||
@@ -53,5 +53,5 @@ void randomize::restore(buffer& scrambled)
|
||||
char_swap(buf[i], buf[pos[i]]);
|
||||
}
|
||||
|
||||
delete pos;
|
||||
delete [] pos;
|
||||
}
|
||||
|
||||
@@ -234,7 +234,7 @@ Boolean write_lock(char* lock_file_path,
|
||||
|
||||
if ( ok == true ) {
|
||||
|
||||
delete ai_info;
|
||||
delete [] ai_info;
|
||||
/////////////////////////////////////////
|
||||
// create the access info file
|
||||
/////////////////////////////////////////
|
||||
|
||||
Reference in New Issue
Block a user