pacemaker  1.1.14-70404b0
Scalable High-Availability cluster resource manager
 All Data Structures Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
internal.h
Go to the documentation of this file.
1 /*
2  * Copyright (C) 2004 Andrew Beekhof <andrew@beekhof.net>
3  *
4  * This program is free software; you can redistribute it and/or
5  * modify it under the terms of the GNU General Public
6  * License as published by the Free Software Foundation; either
7  * version 2 of the License, or (at your option) any later version.
8  *
9  * This software is distributed in the hope that it will be useful,
10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12  * General Public License for more details.
13  *
14  * You should have received a copy of the GNU General Public
15  * License along with this library; if not, write to the Free Software
16  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
17  */
18 #ifndef PE_INTERNAL__H
19 # define PE_INTERNAL__H
20 # include <crm/pengine/status.h>
21 
22 # define pe_rsc_info(rsc, fmt, args...) crm_log_tag(LOG_INFO, rsc ? rsc->id : "<NULL>", fmt, ##args)
23 # define pe_rsc_debug(rsc, fmt, args...) crm_log_tag(LOG_DEBUG, rsc ? rsc->id : "<NULL>", fmt, ##args)
24 # define pe_rsc_trace(rsc, fmt, args...) crm_log_tag(LOG_TRACE, rsc ? rsc->id : "<NULL>", fmt, ##args)
25 
26 # define pe_err(fmt...) { was_processing_error = TRUE; crm_config_error = TRUE; crm_err(fmt); }
27 # define pe_warn(fmt...) { was_processing_warning = TRUE; crm_config_warning = TRUE; crm_warn(fmt); }
28 # define pe_proc_err(fmt...) { was_processing_error = TRUE; crm_err(fmt); }
29 # define pe_proc_warn(fmt...) { was_processing_warning = TRUE; crm_warn(fmt); }
30 # define pe_set_action_bit(action, bit) action->flags = crm_set_bit(__FUNCTION__, action->uuid, action->flags, bit)
31 # define pe_clear_action_bit(action, bit) action->flags = crm_clear_bit(__FUNCTION__, action->uuid, action->flags, bit)
32 
33 typedef struct notify_data_s {
34  GHashTable *keys;
35 
36  const char *action;
37 
42 
43  GListPtr active; /* notify_entry_t* */
44  GListPtr inactive; /* notify_entry_t* */
45  GListPtr start; /* notify_entry_t* */
46  GListPtr stop; /* notify_entry_t* */
47  GListPtr demote; /* notify_entry_t* */
48  GListPtr promote; /* notify_entry_t* */
49  GListPtr master; /* notify_entry_t* */
50  GListPtr slave; /* notify_entry_t* */
51  GHashTable *allowed_nodes;
52 
54 
55 bool pe_can_fence(pe_working_set_t *data_set, node_t *node);
56 
57 int merge_weights(int w1, int w2);
58 void add_hash_param(GHashTable * hash, const char *name, const char *value);
59 void append_hashtable(gpointer key, gpointer value, gpointer user_data);
60 
61 char *native_parameter(resource_t * rsc, node_t * node, gboolean create, const char *name,
62  pe_working_set_t * data_set);
63 node_t *native_location(resource_t * rsc, GListPtr * list, gboolean current);
64 
65 void pe_metadata(void);
66 void verify_pe_options(GHashTable * options);
67 
68 void common_update_score(resource_t * rsc, const char *id, int score);
69 void native_add_running(resource_t * rsc, node_t * node, pe_working_set_t * data_set);
70 node_t *rsc_known_on(resource_t * rsc, GListPtr * list);
71 
72 gboolean native_unpack(resource_t * rsc, pe_working_set_t * data_set);
73 gboolean group_unpack(resource_t * rsc, pe_working_set_t * data_set);
74 gboolean clone_unpack(resource_t * rsc, pe_working_set_t * data_set);
75 gboolean master_unpack(resource_t * rsc, pe_working_set_t * data_set);
76 
77 resource_t *native_find_rsc(resource_t * rsc, const char *id, node_t * node, int flags);
78 
79 gboolean native_active(resource_t * rsc, gboolean all);
80 gboolean group_active(resource_t * rsc, gboolean all);
81 gboolean clone_active(resource_t * rsc, gboolean all);
82 gboolean master_active(resource_t * rsc, gboolean all);
83 
84 void native_print(resource_t * rsc, const char *pre_text, long options, void *print_data);
85 void group_print(resource_t * rsc, const char *pre_text, long options, void *print_data);
86 void clone_print(resource_t * rsc, const char *pre_text, long options, void *print_data);
87 void master_print(resource_t * rsc, const char *pre_text, long options, void *print_data);
88 
89 void native_free(resource_t * rsc);
90 void group_free(resource_t * rsc);
91 void clone_free(resource_t * rsc);
92 void master_free(resource_t * rsc);
93 
94 enum rsc_role_e native_resource_state(const resource_t * rsc, gboolean current);
95 enum rsc_role_e group_resource_state(const resource_t * rsc, gboolean current);
96 enum rsc_role_e clone_resource_state(const resource_t * rsc, gboolean current);
97 enum rsc_role_e master_resource_state(const resource_t * rsc, gboolean current);
98 
99 gboolean common_unpack(xmlNode * xml_obj, resource_t ** rsc, resource_t * parent,
100  pe_working_set_t * data_set);
101 void common_print(resource_t * rsc, const char *pre_text, long options, void *print_data);
102 void common_free(resource_t * rsc);
103 
105 
106 extern node_t *node_copy(node_t * this_node);
107 extern time_t get_effective_time(pe_working_set_t * data_set);
108 extern int get_failcount(node_t * node, resource_t * rsc, time_t *last_failure,
109  pe_working_set_t * data_set);
110 extern int get_failcount_full(node_t * node, resource_t * rsc, time_t *last_failure,
111  bool effective, xmlNode * xml_op, pe_working_set_t * data_set);
112 extern int get_failcount_all(node_t * node, resource_t * rsc, time_t *last_failure,
113  pe_working_set_t * data_set);
114 
115 /* Binary like operators for lists of nodes */
116 extern void node_list_exclude(GHashTable * list, GListPtr list2, gboolean merge_scores);
117 extern GListPtr node_list_dup(GListPtr list, gboolean reset, gboolean filter);
118 extern GListPtr node_list_from_hash(GHashTable * hash, gboolean reset, gboolean filter);
119 
120 extern GHashTable *node_hash_from_list(GListPtr list);
121 static inline gpointer
122 pe_hash_table_lookup(GHashTable * hash, gconstpointer key)
123 {
124  if (hash) {
125  return g_hash_table_lookup(hash, key);
126  }
127  return NULL;
128 }
129 
130 extern action_t *get_pseudo_op(const char *name, pe_working_set_t * data_set);
131 extern gboolean order_actions(action_t * lh_action, action_t * rh_action, enum pe_ordering order);
132 
133 GHashTable *node_hash_dup(GHashTable * hash);
134 extern GListPtr node_list_and(GListPtr list1, GListPtr list2, gboolean filter);
135 
136 extern GListPtr node_list_xor(GListPtr list1, GListPtr list2, gboolean filter);
137 
138 extern GListPtr node_list_minus(GListPtr list1, GListPtr list2, gboolean filter);
139 
140 extern void pe_free_shallow(GListPtr alist);
141 extern void pe_free_shallow_adv(GListPtr alist, gboolean with_data);
142 
143 /* Printing functions for debug */
144 extern void print_node(const char *pre_text, node_t * node, gboolean details);
145 
146 extern void print_resource(int log_level, const char *pre_text, resource_t * rsc, gboolean details);
147 
148 extern void dump_node_scores_worker(int level, const char *file, const char *function, int line,
149  resource_t * rsc, const char *comment, GHashTable * nodes);
150 
151 extern void dump_node_capacity(int level, const char *comment, node_t * node);
152 extern void dump_rsc_utilization(int level, const char *comment, resource_t * rsc, node_t * node);
153 
154 # define dump_node_scores(level, rsc, text, nodes) do { \
155  dump_node_scores_worker(level, __FILE__, __FUNCTION__, __LINE__, rsc, text, nodes); \
156  } while(0)
157 
158 /* Sorting functions */
159 extern gint sort_rsc_priority(gconstpointer a, gconstpointer b);
160 extern gint sort_rsc_index(gconstpointer a, gconstpointer b);
161 
162 extern xmlNode *find_rsc_op_entry(resource_t * rsc, const char *key);
163 
164 extern action_t *custom_action(resource_t * rsc, char *key, const char *task, node_t * on_node,
165  gboolean optional, gboolean foo, pe_working_set_t * data_set);
166 
167 # define delete_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_DELETE, 0)
168 # define delete_action(rsc, node, optional) custom_action( \
169  rsc, delete_key(rsc), CRMD_ACTION_DELETE, node, \
170  optional, TRUE, data_set);
171 
172 # define stopped_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_STOPPED, 0)
173 # define stopped_action(rsc, node, optional) custom_action( \
174  rsc, stopped_key(rsc), CRMD_ACTION_STOPPED, node, \
175  optional, TRUE, data_set);
176 
177 # define stop_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_STOP, 0)
178 # define stop_action(rsc, node, optional) custom_action( \
179  rsc, stop_key(rsc), CRMD_ACTION_STOP, node, \
180  optional, TRUE, data_set);
181 
182 # define start_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_START, 0)
183 # define start_action(rsc, node, optional) custom_action( \
184  rsc, start_key(rsc), CRMD_ACTION_START, node, \
185  optional, TRUE, data_set)
186 
187 # define started_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_STARTED, 0)
188 # define started_action(rsc, node, optional) custom_action( \
189  rsc, started_key(rsc), CRMD_ACTION_STARTED, node, \
190  optional, TRUE, data_set)
191 
192 # define promote_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_PROMOTE, 0)
193 # define promote_action(rsc, node, optional) custom_action( \
194  rsc, promote_key(rsc), CRMD_ACTION_PROMOTE, node, \
195  optional, TRUE, data_set)
196 
197 # define promoted_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_PROMOTED, 0)
198 # define promoted_action(rsc, node, optional) custom_action( \
199  rsc, promoted_key(rsc), CRMD_ACTION_PROMOTED, node, \
200  optional, TRUE, data_set)
201 
202 # define demote_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_DEMOTE, 0)
203 # define demote_action(rsc, node, optional) custom_action( \
204  rsc, demote_key(rsc), CRMD_ACTION_DEMOTE, node, \
205  optional, TRUE, data_set)
206 
207 # define demoted_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_DEMOTED, 0)
208 # define demoted_action(rsc, node, optional) custom_action( \
209  rsc, demoted_key(rsc), CRMD_ACTION_DEMOTED, node, \
210  optional, TRUE, data_set)
211 
212 extern action_t *find_first_action(GListPtr input, const char *uuid, const char *task,
213  node_t * on_node);
214 extern enum action_tasks get_complex_task(resource_t * rsc, const char *name,
215  gboolean allow_non_atomic);
216 
217 extern GListPtr find_actions(GListPtr input, const char *key, node_t * on_node);
218 extern GListPtr find_actions_exact(GListPtr input, const char *key, node_t * on_node);
219 extern GListPtr find_recurring_actions(GListPtr input, node_t * not_on_node);
220 
221 extern void pe_free_action(action_t * action);
222 
223 extern void resource_location(resource_t * rsc, node_t * node, int score, const char *tag,
224  pe_working_set_t * data_set);
225 
226 extern gint sort_op_by_callid(gconstpointer a, gconstpointer b);
227 extern gboolean get_target_role(resource_t * rsc, enum rsc_role_e *role);
228 
229 extern resource_t *find_clone_instance(resource_t * rsc, const char *sub_id,
230  pe_working_set_t * data_set);
231 
232 extern void destroy_ticket(gpointer data);
233 extern ticket_t *ticket_new(const char *ticket_id, pe_working_set_t * data_set);
234 
235 char *clone_strip(const char *last_rsc_id);
236 char *clone_zero(const char *last_rsc_id);
237 
238 int get_target_rc(xmlNode * xml_op);
239 
240 gint sort_node_uname(gconstpointer a, gconstpointer b);
241 bool is_set_recursive(resource_t * rsc, long long flag, bool any);
242 
253 };
254 
255 typedef struct op_digest_cache_s {
257  xmlNode *params_all;
258  xmlNode *params_secure;
259  xmlNode *params_restart;
264 
265 op_digest_cache_t *rsc_action_digest_cmp(resource_t * rsc, xmlNode * xml_op, node_t * node,
266  pe_working_set_t * data_set);
267 
268 action_t *pe_fence_op(node_t * node, const char *op, bool optional, pe_working_set_t * data_set);
269 void trigger_unfencing(
270  resource_t * rsc, node_t *node, const char *reason, action_t *dependency, pe_working_set_t * data_set);
271 
272 void set_bit_recursive(resource_t * rsc, unsigned long long flag);
273 void clear_bit_recursive(resource_t * rsc, unsigned long long flag);
274 gboolean xml_contains_remote_node(xmlNode *xml);
275 gboolean is_baremetal_remote_node(node_t *node);
276 gboolean is_container_remote_node(node_t *node);
277 gboolean is_remote_node(node_t *node);
279 
280 gboolean add_tag_ref(GHashTable * tags, const char * tag_name, const char * obj_ref);
281 
282 void print_rscs_brief(GListPtr rsc_list, const char * pre_text, long options,
283  void * print_data, gboolean print_all);
284 void pe_fence_node(pe_working_set_t * data_set, node_t * node, const char *reason);
285 
286 #endif
void verify_pe_options(GHashTable *options)
Definition: common.c:176
void clone_print(resource_t *rsc, const char *pre_text, long options, void *print_data)
Definition: clone.c:371
action_t * pre_done
Definition: internal.h:40
void group_free(resource_t *rsc)
Definition: group.c:195
void dump_rsc_utilization(int level, const char *comment, resource_t *rsc, node_t *node)
Definition: utils.c:283
gint sort_rsc_priority(gconstpointer a, gconstpointer b)
Definition: utils.c:332
gboolean is_baremetal_remote_node(node_t *node)
Definition: utils.c:2043
gint sort_rsc_index(gconstpointer a, gconstpointer b)
Definition: utils.c:305
gboolean get_target_role(resource_t *rsc, enum rsc_role_e *role)
Definition: utils.c:1729
void pe_metadata(void)
Definition: common.c:167
action_t * post_done
Definition: internal.h:41
GListPtr node_list_dup(GListPtr list, gboolean reset, gboolean filter)
Definition: utils.c:139
GHashTable * allowed_nodes
Definition: internal.h:51
resource_t * rsc_contains_remote_node(pe_working_set_t *data_set, resource_t *rsc)
Definition: utils.c:2070
gboolean is_remote_node(node_t *node)
Definition: utils.c:2061
action_t * post
Definition: internal.h:39
bool pe_can_fence(pe_working_set_t *data_set, node_t *node)
Definition: utils.c:40
enum action_tasks get_complex_task(resource_t *rsc, const char *name, gboolean allow_non_atomic)
Definition: utils.c:1141
struct op_digest_cache_s op_digest_cache_t
enum rsc_role_e master_resource_state(const resource_t *rsc, gboolean current)
GListPtr slave
Definition: internal.h:50
char * native_parameter(resource_t *rsc, node_t *node, gboolean create, const char *name, pe_working_set_t *data_set)
Definition: native.c:230
GListPtr find_actions_exact(GListPtr input, const char *key, node_t *on_node)
Definition: utils.c:1230
GHashTable * keys
Definition: internal.h:34
gboolean common_unpack(xmlNode *xml_obj, resource_t **rsc, resource_t *parent, pe_working_set_t *data_set)
Definition: complex.c:381
void common_print(resource_t *rsc, const char *pre_text, long options, void *print_data)
void common_update_score(resource_t *rsc, const char *id, int score)
Definition: complex.c:741
void common_free(resource_t *rsc)
Definition: complex.c:794
void print_node(const char *pre_text, node_t *node, gboolean details)
Definition: utils.c:1026
gint sort_op_by_callid(gconstpointer a, gconstpointer b)
Definition: utils.c:1328
node_t * node_copy(node_t *this_node)
Definition: utils.c:67
time_t get_effective_time(pe_working_set_t *data_set)
Definition: utils.c:1443
GListPtr node_list_and(GListPtr list1, GListPtr list2, gboolean filter)
gboolean master_active(resource_t *rsc, gboolean all)
xmlNode * params_restart
Definition: internal.h:259
void set_bit_recursive(resource_t *rsc, unsigned long long flag)
Definition: utils.c:2116
action_t * get_pseudo_op(const char *name, pe_working_set_t *data_set)
Definition: utils.c:1817
int get_target_rc(xmlNode *xml_op)
Definition: unpack.c:2904
int get_failcount(node_t *node, resource_t *rsc, time_t *last_failure, pe_working_set_t *data_set)
Definition: utils.c:1497
GListPtr node_list_xor(GListPtr list1, GListPtr list2, gboolean filter)
void native_print(resource_t *rsc, const char *pre_text, long options, void *print_data)
Definition: native.c:436
void print_rscs_brief(GListPtr rsc_list, const char *pre_text, long options, void *print_data, gboolean print_all)
Definition: native.c:814
GListPtr find_recurring_actions(GListPtr input, node_t *not_on_node)
Definition: utils.c:1107
void clone_free(resource_t *rsc)
Definition: clone.c:555
enum rsc_role_e group_resource_state(const resource_t *rsc, gboolean current)
Definition: group.c:218
void master_free(resource_t *rsc)
uint64_t flags
Definition: remote.c:121
GListPtr stop
Definition: internal.h:46
void native_add_running(resource_t *rsc, node_t *node, pe_working_set_t *data_set)
Definition: native.c:32
void append_hashtable(gpointer key, gpointer value, gpointer user_data)
int get_failcount_full(node_t *node, resource_t *rsc, time_t *last_failure, bool effective, xmlNode *xml_op, pe_working_set_t *data_set)
Definition: utils.c:1622
char * digest_all_calc
Definition: internal.h:260
char * clone_strip(const char *last_rsc_id)
Definition: unpack.c:1500
pe_working_set_t * pe_dataset
Definition: utils.c:29
enum rsc_digest_cmp_val rc
Definition: internal.h:256
action_t * find_first_action(GListPtr input, const char *uuid, const char *task, node_t *on_node)
Definition: utils.c:1165
GListPtr master
Definition: internal.h:49
char * digest_secure_calc
Definition: internal.h:261
void pe_fence_node(pe_working_set_t *data_set, node_t *node, const char *reason)
Definition: unpack.c:66
gboolean xml_contains_remote_node(xmlNode *xml)
Definition: utils.c:2090
gboolean add_tag_ref(GHashTable *tags, const char *tag_name, const char *obj_ref)
Definition: utils.c:2198
action_t * custom_action(resource_t *rsc, char *key, const char *task, node_t *on_node, gboolean optional, gboolean foo, pe_working_set_t *data_set)
Definition: utils.c:359
void pe_free_shallow_adv(GListPtr alist, gboolean with_data)
enum rsc_role_e native_resource_state(const resource_t *rsc, gboolean current)
Definition: native.c:682
void group_print(resource_t *rsc, const char *pre_text, long options, void *print_data)
Definition: group.c:146
xmlNode * find_rsc_op_entry(resource_t *rsc, const char *key)
Definition: utils.c:1020
gboolean native_active(resource_t *rsc, gboolean all)
Definition: native.c:274
GHashTable * node_hash_dup(GHashTable *hash)
node_t * native_location(resource_t *rsc, GListPtr *list, gboolean current)
Definition: native.c:694
GListPtr node_list_from_hash(GHashTable *hash, gboolean reset, gboolean filter)
GListPtr find_actions(GListPtr input, const char *key, node_t *on_node)
Definition: utils.c:1195
xmlNode * params_all
Definition: internal.h:257
action_t * pe_fence_op(node_t *node, const char *op, bool optional, pe_working_set_t *data_set)
Definition: utils.c:2129
GListPtr active
Definition: internal.h:43
enum rsc_role_e clone_resource_state(const resource_t *rsc, gboolean current)
Definition: clone.c:590
GListPtr node_list_minus(GListPtr list1, GListPtr list2, gboolean filter)
pe_ordering
Definition: status.h:371
GHashTable * node_hash_from_list(GListPtr list)
Definition: utils.c:123
gboolean clone_active(resource_t *rsc, gboolean all)
Definition: clone.c:270
void add_hash_param(GHashTable *hash, const char *name, const char *value)
Definition: common.c:414
GListPtr demote
Definition: internal.h:47
void resource_location(resource_t *rsc, node_t *node, int score, const char *tag, pe_working_set_t *data_set)
Definition: utils.c:1284
void node_list_exclude(GHashTable *list, GListPtr list2, gboolean merge_scores)
Definition: utils.c:88
int get_failcount_all(node_t *node, resource_t *rsc, time_t *last_failure, pe_working_set_t *data_set)
Definition: utils.c:1696
ticket_t * ticket_new(const char *ticket_id, pe_working_set_t *data_set)
Definition: utils.c:1846
gboolean group_active(resource_t *rsc, gboolean all)
Definition: group.c:101
char * clone_zero(const char *last_rsc_id)
Definition: unpack.c:1539
GListPtr inactive
Definition: internal.h:44
xmlNode * params_secure
Definition: internal.h:258
void dump_node_capacity(int level, const char *comment, node_t *node)
Definition: utils.c:262
int merge_weights(int w1, int w2)
Definition: common.c:377
char data[0]
Definition: internal.h:58
action_t * pre
Definition: internal.h:38
gboolean is_container_remote_node(node_t *node)
Definition: utils.c:2052
rsc_role_e
Definition: common.h:81
void native_free(resource_t *rsc)
Definition: native.c:675
void dump_node_scores_worker(int level, const char *file, const char *function, int line, resource_t *rsc, const char *comment, GHashTable *nodes)
Definition: utils.c:174
gboolean native_unpack(resource_t *rsc, pe_working_set_t *data_set)
Definition: native.c:126
void pe_free_action(action_t *action)
Definition: utils.c:1086
void clear_bit_recursive(resource_t *rsc, unsigned long long flag)
Definition: utils.c:2103
void destroy_ticket(gpointer data)
Definition: utils.c:1834
void pe_free_shallow(GListPtr alist)
Definition: status.h:161
GListPtr promote
Definition: internal.h:48
struct notify_data_s notify_data_t
void print_resource(int log_level, const char *pre_text, resource_t *rsc, gboolean details)
Definition: utils.c:1070
GListPtr start
Definition: internal.h:45
gboolean order_actions(action_t *lh_action, action_t *rh_action, enum pe_ordering order)
Definition: utils.c:1765
op_digest_cache_t * rsc_action_digest_cmp(resource_t *rsc, xmlNode *xml_op, node_t *node, pe_working_set_t *data_set)
Definition: utils.c:1925
const char * action
Definition: internal.h:36
resource_t * find_clone_instance(resource_t *rsc, const char *sub_id, pe_working_set_t *data_set)
Definition: clone.c:68
gboolean group_unpack(resource_t *rsc, pe_working_set_t *data_set)
Definition: group.c:31
gint sort_node_uname(gconstpointer a, gconstpointer b)
Definition: utils.c:165
GList * GListPtr
Definition: crm.h:190
bool is_set_recursive(resource_t *rsc, long long flag, bool any)
Definition: clone.c:340
char * digest_restart_calc
Definition: internal.h:262
node_t * rsc_known_on(resource_t *rsc, GListPtr *list)
void trigger_unfencing(resource_t *rsc, node_t *node, const char *reason, action_t *dependency, pe_working_set_t *data_set)
Definition: utils.c:2163
resource_t * native_find_rsc(resource_t *rsc, const char *id, node_t *node, int flags)
Definition: native.c:161
void master_print(resource_t *rsc, const char *pre_text, long options, void *print_data)
action_tasks
Definition: common.h:52
rsc_digest_cmp_val
Definition: internal.h:243
gboolean clone_unpack(resource_t *rsc, pe_working_set_t *data_set)
Definition: clone.c:155
gboolean master_unpack(resource_t *rsc, pe_working_set_t *data_set)
Definition: clone.c:137