Logo Search packages:      
Sourcecode: scanmem version File versions  Download package

target_memory_info_array.h

/*
 target_memory_info_array.h

 Copyright (C) 2009 Eli Dupree  <elidupree(a)charter.net>
 Copyright (C) 2010 WANG Lu  <coolwanglu(a)gmail.com>

 This program is free software; you can redistribute it and/or modify
 it under the terms of the GNU General Public License as published by
 the Free Software Foundation; either version 2 of the License, or
 (at your option) any later version.
 
 This program is distributed in the hope that it will be useful,
 but WITHOUT ANY WARRANTY; without even the implied warranty of
 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 GNU General Public License for more details.
 
 You should have received a copy of the GNU General Public License
 along with this program; if not, write to the Free Software
 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
*/

#ifndef _SEOIGROIYIOOBKOB_INC
#define _SEOIGROIYIOOBKOB_INC            /* include guard */

#include <inttypes.h>

#include "value.h"
#include "maps.h"

/* These two structs are not used; pointers to them are used to refer to arrays containing copied_data_swaths / matches_swaths, in the following ormat:
 - the array begins with the first_byte_in_child pointer; immediately after that is the number_of_bytes, and then the struct's data describing that many bytes. (Note that the number refers to the number of bytes in the child process's memory that are covered, not the number of bytes the struct takes up.)
 - in the first position after each such block is another such block (first byte pointer and number of bytes), or a null pointer and a 0 number of bytes to terminate the data.
 (The first_byte_in_child pointers refer to locations in the child - they cannot be followed except using ptrace())*/

00035 typedef struct {
      uint8_t old_value;
      match_flags match_info;
} old_value_and_match_info;

/*
typedef struct {
      void *first_byte_in_child;
      unsigned long number_of_bytes;
} unknown_type_of_swath;
typedef struct {
      void *first_byte_in_child;
      unsigned long number_of_bytes;
      uint8_t copied_bytes[0];
} copied_data_swath;
typedef struct {
      void *first_byte_in_child;
      unsigned long number_of_bytes;
      match_flags match_info[0];
} matches_swath;
*/
00056 typedef struct {
      void *first_byte_in_child;
      unsigned long number_of_bytes;
      old_value_and_match_info data[0];
} matches_and_old_values_swath;

/*
typedef struct {
      unsigned long bytes_allocated;
      unsigned long max_needed_bytes;
} unknown_type_of_array;
typedef struct {
      unsigned long bytes_allocated;
      unsigned long max_needed_bytes;
      copied_data_swath swaths[0];
} copied_data_array;
typedef struct {
      unsigned long bytes_allocated;
      unsigned long max_needed_bytes;
      matches_swath swaths[0];
} matches_array;
*/
00078 typedef struct {
      unsigned long bytes_allocated;
      unsigned long max_needed_bytes;
      matches_and_old_values_swath swaths[0];
} matches_and_old_values_array;

/*
 * now we use MATCHES_AND_VALUES only
 *
typedef enum {
      MATCHES,
      MATCHES_AND_VALUES,
      VALUES
} data_array_type_t;
*/

00094 typedef struct {
      matches_and_old_values_swath *swath;
      long index;
} match_location;

matches_and_old_values_array * allocate_array(matches_and_old_values_array *array, unsigned long max_bytes);
matches_and_old_values_array * allocate_enough_to_reach(matches_and_old_values_array *array, void *last_byte_to_reach_plus_one, matches_and_old_values_swath **swath_pointer_to_correct);
matches_and_old_values_swath * add_element(matches_and_old_values_array **array, matches_and_old_values_swath *swath, void *remote_address, void *new_element);
matches_and_old_values_array * null_terminate(matches_and_old_values_array *array, matches_and_old_values_swath *swath);

/* only at most sizeof(int64_t) bytes will be readed, if more bytes needed (e.g. bytearray), read it separatedly (for performance) */
value_t data_to_val_aux(matches_and_old_values_swath *swath, long index, long swath_length);
value_t data_to_val(matches_and_old_values_swath *swath, long index);
/* for printable text representation */
void data_to_printable_string(char *buf, int buf_length, matches_and_old_values_swath *swath, long index, int string_length);
/* for bytearray representation */
void data_to_bytearray_text(char *buf, int buf_length,  matches_and_old_values_swath *swath, long index, int bytearray_length);

void * remote_address_of_nth_element(matches_and_old_values_swath *swath, long n);
void * remote_address_of_last_element(matches_and_old_values_swath *swath);
void * local_address_beyond_nth_element(matches_and_old_values_swath *swath, long n);
void * local_address_beyond_last_element(matches_and_old_values_swath *swath);
match_location nth_match(matches_and_old_values_array *matches, unsigned n);
matches_and_old_values_array * delete_by_region(matches_and_old_values_array *array, long *num_matches, region_t *which, bool invert);

#endif

Generated by  Doxygen 1.6.0   Back to index