it's ==> its & its ==> it's as needed.

svn path=/trunk/; revision=47896

epan/guid-utils.c

@@ -42,7 +42,7 @@ static emem_tree_t *guid_to_name_tree = NULL;
 
 
 #ifdef _WIN32
-/* try to resolve an DCE/RPC interface name to it's name using the Windows registry entries */
+/* try to resolve an DCE/RPC interface name to its name using the Windows registry entries */
 /* XXX - might be better to fill all interfaces into our database at startup instead of searching each time */
 int
 ResolveWin32UUID(e_guid_t if_id, char *uuid_name, int uuid_name_max_len)

epan/prefs.c

@@ -715,7 +715,7 @@ register_preference(module_t *module, const char *name, const char *title,
         g_error("Preference %s has already been registered", name);
 
     if ((type != PREF_OBSOLETE) &&
-        /* Don't compare if its a subtree */
+        /* Don't compare if it's a subtree */
         (module->name != NULL)) {
         /*
          * Make sure the preference name doesn't begin with the
@@ -4322,7 +4322,7 @@ write_pref(gpointer data, gpointer user_data)
     if (pref->type != PREF_CUSTOM || pref->custom_cbs.type_name_cb() != NULL) {
         /*
          * The prefix will either be the module name or the parent
-         * name if its a subtree
+         * name if it's a subtree
          */
         const char *name_prefix = (arg->module->name != NULL) ? arg->module->name : arg->module->parent->name;
         char *type_desc, *pref_text;
@@ -4442,7 +4442,7 @@ write_prefs(char **pf_path_return)
         "# changed from their default value.\n", pf);
 
   /*
-   * For "backwards compatibility" the GUI module is written first as its
+   * For "backwards compatibility" the GUI module is written first as it's
    * at the top of the file.  This is followed by all modules that can't
    * fit into the preferences read/write API.  Finally the remaining modules
    * are written in alphabetical order (including of course the protocol preferences)

epan/proto.h

@@ -740,7 +740,7 @@ extern proto_tree* proto_tree_get_root(proto_tree *tree);
 
 /** Move an existing item behind another existing item.
  @param tree the tree to which both items belong
- @param fixed_item the item which keeps it's position
+ @param fixed_item the item which keeps its position
  @param item_to_move the item which will be moved */
 extern void proto_tree_move_item(proto_tree *tree, proto_item *fixed_item, proto_item *item_to_move);
 
@@ -1646,9 +1646,9 @@ proto_mark_private(const int proto_id);
 extern gboolean
 proto_is_private(const int proto_id);
 
-/** This is the type of function can be registered to get called whenever
-    a given field was not found but a its prefix is matched
-	it can be used to procrastinate the hf array registration
+/** This type of function can be registered to get called whenever
+    a given field was not found but a its prefix is matched;
+    It can be used to procrastinate the hf array registration.
    @param match  what's being matched */
 typedef void (*prefix_initializer_t)(const char* match);
 
@@ -1775,7 +1775,7 @@ extern const char *proto_get_protocol_long_name(const protocol_t *protocol);
  @return TRUE if decoding is enabled, FALSE if not */
 extern gboolean proto_is_protocol_enabled(const protocol_t *protocol);
 
-/** Get a protocol's filter name by it's item number.
+/** Get a protocol's filter name by its item number.
  @param proto_id protocol id (0-indexed)
  @return its filter name. */
 extern const char *proto_get_protocol_filter_name(const int proto_id);

epan/stats_tree.c

@@ -446,7 +446,7 @@ stats_tree_presentation(void (*registry_iterator)(gpointer,gpointer,gpointer),
 /* creates a stat_tree node
 *    name: the name of the stats_tree node
 *    parent_name: the name of the ALREADY REGISTERED parent
-*    with_hash: whether or not it should keep a hash with it's children names
+*    with_hash: whether or not it should keep a hash with its children names
 *    as_named_node: whether or not it has to be registered in the root namespace
 */
 static stat_node*

epan/stats_tree.h

@@ -113,7 +113,7 @@ extern int stats_tree_create_node(stats_tree *st,
 				  int parent_id,
 				  gboolean with_children);
 
-/* creates a node using it's parent's tree name */
+/* creates a node using its parent's tree name */
 extern int stats_tree_create_node_by_pname(stats_tree *st,
 					   const gchar *name,
 					   const gchar *parent_name,