pacemaker  1.1.18-1a4ef7d180
Scalable High-Availability cluster resource manager
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 Lesser 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 Lesser 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 # include <crm/pengine/remote.h>
22 
23 # define pe_rsc_info(rsc, fmt, args...) crm_log_tag(LOG_INFO, rsc ? rsc->id : "<NULL>", fmt, ##args)
24 # define pe_rsc_debug(rsc, fmt, args...) crm_log_tag(LOG_DEBUG, rsc ? rsc->id : "<NULL>", fmt, ##args)
25 # define pe_rsc_trace(rsc, fmt, args...) crm_log_tag(LOG_TRACE, rsc ? rsc->id : "<NULL>", fmt, ##args)
26 
27 # define pe_err(fmt...) { was_processing_error = TRUE; crm_config_error = TRUE; crm_err(fmt); }
28 # define pe_warn(fmt...) { was_processing_warning = TRUE; crm_config_warning = TRUE; crm_warn(fmt); }
29 # define pe_proc_err(fmt...) { was_processing_error = TRUE; crm_err(fmt); }
30 # define pe_proc_warn(fmt...) { was_processing_warning = TRUE; crm_warn(fmt); }
31 # define pe_set_action_bit(action, bit) action->flags = crm_set_bit(__FUNCTION__, __LINE__, action->uuid, action->flags, bit)
32 # define pe_clear_action_bit(action, bit) action->flags = crm_clear_bit(__FUNCTION__, __LINE__, action->uuid, action->flags, bit)
33 
34 typedef struct notify_data_s {
35  GHashTable *keys;
36 
37  const char *action;
38 
43 
44  GListPtr active; /* notify_entry_t* */
45  GListPtr inactive; /* notify_entry_t* */
46  GListPtr start; /* notify_entry_t* */
47  GListPtr stop; /* notify_entry_t* */
48  GListPtr demote; /* notify_entry_t* */
49  GListPtr promote; /* notify_entry_t* */
50  GListPtr master; /* notify_entry_t* */
51  GListPtr slave; /* notify_entry_t* */
52  GHashTable *allowed_nodes;
53 
55 
56 bool pe_can_fence(pe_working_set_t *data_set, node_t *node);
57 
58 int merge_weights(int w1, int w2);
59 void add_hash_param(GHashTable * hash, const char *name, const char *value);
60 void append_hashtable(gpointer key, gpointer value, gpointer user_data);
61 
62 char *native_parameter(resource_t * rsc, node_t * node, gboolean create, const char *name,
63  pe_working_set_t * data_set);
64 node_t *native_location(resource_t * rsc, GListPtr * list, gboolean current);
65 
66 void pe_metadata(void);
67 void verify_pe_options(GHashTable * options);
68 
69 void common_update_score(resource_t * rsc, const char *id, int score);
70 void native_add_running(resource_t * rsc, node_t * node, pe_working_set_t * data_set);
71 node_t *rsc_known_on(resource_t * rsc, GListPtr * list);
72 
73 gboolean native_unpack(resource_t * rsc, pe_working_set_t * data_set);
74 gboolean group_unpack(resource_t * rsc, pe_working_set_t * data_set);
75 gboolean clone_unpack(resource_t * rsc, pe_working_set_t * data_set);
76 gboolean master_unpack(resource_t * rsc, pe_working_set_t * data_set);
77 gboolean container_unpack(resource_t * rsc, pe_working_set_t * data_set);
78 
79 resource_t *native_find_rsc(resource_t * rsc, const char *id, node_t * node, int flags);
80 
81 gboolean native_active(resource_t * rsc, gboolean all);
82 gboolean group_active(resource_t * rsc, gboolean all);
83 gboolean clone_active(resource_t * rsc, gboolean all);
84 gboolean master_active(resource_t * rsc, gboolean all);
85 gboolean container_active(resource_t * rsc, gboolean all);
86 
87 void native_print(resource_t * rsc, const char *pre_text, long options, void *print_data);
88 void group_print(resource_t * rsc, const char *pre_text, long options, void *print_data);
89 void clone_print(resource_t * rsc, const char *pre_text, long options, void *print_data);
90 void master_print(resource_t * rsc, const char *pre_text, long options, void *print_data);
91 void container_print(resource_t * rsc, const char *pre_text, long options, void *print_data);
92 
93 void native_free(resource_t * rsc);
94 void group_free(resource_t * rsc);
95 void clone_free(resource_t * rsc);
96 void master_free(resource_t * rsc);
97 void container_free(resource_t * rsc);
98 
99 enum rsc_role_e native_resource_state(const resource_t * rsc, gboolean current);
100 enum rsc_role_e group_resource_state(const resource_t * rsc, gboolean current);
101 enum rsc_role_e clone_resource_state(const resource_t * rsc, gboolean current);
102 enum rsc_role_e master_resource_state(const resource_t * rsc, gboolean current);
103 enum rsc_role_e container_resource_state(const resource_t * rsc, gboolean current);
104 
105 gboolean common_unpack(xmlNode * xml_obj, resource_t ** rsc, resource_t * parent,
106  pe_working_set_t * data_set);
107 void common_free(resource_t * rsc);
108 
110 
111 extern node_t *node_copy(const node_t *this_node);
112 extern time_t get_effective_time(pe_working_set_t * data_set);
113 
114 /* Failure handling utilities (from failcounts.c) */
115 
116 // bit flags for fail count handling options
119  pe_fc_effective = 0x01, // don't count expired failures
120  pe_fc_fillers = 0x02, // if container, include filler failures in count
121 };
122 
123 int pe_get_failcount(node_t *node, resource_t *rsc, time_t *last_failure,
124  uint32_t flags, xmlNode *xml_op,
125  pe_working_set_t *data_set);
126 
127 /* Binary like operators for lists of nodes */
128 extern void node_list_exclude(GHashTable * list, GListPtr list2, gboolean merge_scores);
129 extern GListPtr node_list_dup(GListPtr list, gboolean reset, gboolean filter);
130 extern GListPtr node_list_from_hash(GHashTable * hash, gboolean reset, gboolean filter);
131 
132 extern GHashTable *node_hash_from_list(GListPtr list);
133 static inline gpointer
134 pe_hash_table_lookup(GHashTable * hash, gconstpointer key)
135 {
136  if (hash) {
137  return g_hash_table_lookup(hash, key);
138  }
139  return NULL;
140 }
141 
142 extern action_t *get_pseudo_op(const char *name, pe_working_set_t * data_set);
143 extern gboolean order_actions(action_t * lh_action, action_t * rh_action, enum pe_ordering order);
144 
145 GHashTable *node_hash_dup(GHashTable * hash);
146 extern GListPtr node_list_and(GListPtr list1, GListPtr list2, gboolean filter);
147 
148 extern GListPtr node_list_xor(GListPtr list1, GListPtr list2, gboolean filter);
149 
150 extern GListPtr node_list_minus(GListPtr list1, GListPtr list2, gboolean filter);
151 
152 extern void pe_free_shallow(GListPtr alist);
153 extern void pe_free_shallow_adv(GListPtr alist, gboolean with_data);
154 
155 /* Printing functions for debug */
156 extern void print_node(const char *pre_text, node_t * node, gboolean details);
157 
158 extern void print_resource(int log_level, const char *pre_text, resource_t * rsc, gboolean details);
159 
160 extern void dump_node_scores_worker(int level, const char *file, const char *function, int line,
161  resource_t * rsc, const char *comment, GHashTable * nodes);
162 
163 extern void dump_node_capacity(int level, const char *comment, node_t * node);
164 extern void dump_rsc_utilization(int level, const char *comment, resource_t * rsc, node_t * node);
165 
166 # define dump_node_scores(level, rsc, text, nodes) do { \
167  dump_node_scores_worker(level, __FILE__, __FUNCTION__, __LINE__, rsc, text, nodes); \
168  } while(0)
169 
170 /* Sorting functions */
171 extern gint sort_rsc_priority(gconstpointer a, gconstpointer b);
172 extern gint sort_rsc_index(gconstpointer a, gconstpointer b);
173 
174 extern xmlNode *find_rsc_op_entry(resource_t * rsc, const char *key);
175 
176 extern action_t *custom_action(resource_t * rsc, char *key, const char *task, node_t * on_node,
177  gboolean optional, gboolean foo, pe_working_set_t * data_set);
178 
179 # define delete_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_DELETE, 0)
180 # define delete_action(rsc, node, optional) custom_action( \
181  rsc, delete_key(rsc), CRMD_ACTION_DELETE, node, \
182  optional, TRUE, data_set);
183 
184 # define stopped_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_STOPPED, 0)
185 # define stopped_action(rsc, node, optional) custom_action( \
186  rsc, stopped_key(rsc), CRMD_ACTION_STOPPED, node, \
187  optional, TRUE, data_set);
188 
189 # define stop_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_STOP, 0)
190 # define stop_action(rsc, node, optional) custom_action( \
191  rsc, stop_key(rsc), CRMD_ACTION_STOP, node, \
192  optional, TRUE, data_set);
193 
194 # define reload_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_RELOAD, 0)
195 # define start_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_START, 0)
196 # define start_action(rsc, node, optional) custom_action( \
197  rsc, start_key(rsc), CRMD_ACTION_START, node, \
198  optional, TRUE, data_set)
199 
200 # define started_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_STARTED, 0)
201 # define started_action(rsc, node, optional) custom_action( \
202  rsc, started_key(rsc), CRMD_ACTION_STARTED, node, \
203  optional, TRUE, data_set)
204 
205 # define promote_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_PROMOTE, 0)
206 # define promote_action(rsc, node, optional) custom_action( \
207  rsc, promote_key(rsc), CRMD_ACTION_PROMOTE, node, \
208  optional, TRUE, data_set)
209 
210 # define promoted_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_PROMOTED, 0)
211 # define promoted_action(rsc, node, optional) custom_action( \
212  rsc, promoted_key(rsc), CRMD_ACTION_PROMOTED, node, \
213  optional, TRUE, data_set)
214 
215 # define demote_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_DEMOTE, 0)
216 # define demote_action(rsc, node, optional) custom_action( \
217  rsc, demote_key(rsc), CRMD_ACTION_DEMOTE, node, \
218  optional, TRUE, data_set)
219 
220 # define demoted_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_DEMOTED, 0)
221 # define demoted_action(rsc, node, optional) custom_action( \
222  rsc, demoted_key(rsc), CRMD_ACTION_DEMOTED, node, \
223  optional, TRUE, data_set)
224 
225 extern int pe_get_configured_timeout(resource_t *rsc, const char *action,
226  pe_working_set_t *data_set);
227 
228 extern action_t *find_first_action(GListPtr input, const char *uuid, const char *task,
229  node_t * on_node);
230 extern enum action_tasks get_complex_task(resource_t * rsc, const char *name,
231  gboolean allow_non_atomic);
232 
233 extern GListPtr find_actions(GListPtr input, const char *key, const node_t *on_node);
234 extern GListPtr find_actions_exact(GListPtr input, const char *key, node_t * on_node);
235 extern GListPtr find_recurring_actions(GListPtr input, node_t * not_on_node);
236 
237 extern void pe_free_action(action_t * action);
238 
239 extern void resource_location(resource_t * rsc, node_t * node, int score, const char *tag,
240  pe_working_set_t * data_set);
241 
242 extern gint sort_op_by_callid(gconstpointer a, gconstpointer b);
243 extern gboolean get_target_role(resource_t * rsc, enum rsc_role_e *role);
244 
245 extern resource_t *find_clone_instance(resource_t * rsc, const char *sub_id,
246  pe_working_set_t * data_set);
247 
248 extern void destroy_ticket(gpointer data);
249 extern ticket_t *ticket_new(const char *ticket_id, pe_working_set_t * data_set);
250 
251 char *clone_strip(const char *last_rsc_id);
252 char *clone_zero(const char *last_rsc_id);
253 
254 int get_target_rc(xmlNode * xml_op);
255 
256 gint sort_node_uname(gconstpointer a, gconstpointer b);
257 bool is_set_recursive(resource_t * rsc, long long flag, bool any);
258 
269 };
270 
271 typedef struct op_digest_cache_s {
273  xmlNode *params_all;
274  xmlNode *params_secure;
275  xmlNode *params_restart;
280 
281 op_digest_cache_t *rsc_action_digest_cmp(resource_t * rsc, xmlNode * xml_op, node_t * node,
282  pe_working_set_t * data_set);
283 
284 action_t *pe_fence_op(node_t * node, const char *op, bool optional, const char *reason, pe_working_set_t * data_set);
285 void trigger_unfencing(
286  resource_t * rsc, node_t *node, const char *reason, action_t *dependency, pe_working_set_t * data_set);
287 
288 void pe_action_set_reason(pe_action_t *action, const char *reason, bool overwrite);
289 void pe_action_set_flag_reason(const char *function, long line, pe_action_t *action, pe_action_t *reason, const char *text, enum pe_action_flags flags, bool overwrite);
290 
291 #define pe_action_required(action, reason, text) pe_action_set_flag_reason(__FUNCTION__, __LINE__, action, reason, text, pe_action_optional, FALSE)
292 #define pe_action_implies(action, reason, flag) pe_action_set_flag_reason(__FUNCTION__, __LINE__, action, reason, NULL, flag, FALSE)
293 
294 void set_bit_recursive(resource_t * rsc, unsigned long long flag);
295 void clear_bit_recursive(resource_t * rsc, unsigned long long flag);
296 
297 gboolean add_tag_ref(GHashTable * tags, const char * tag_name, const char * obj_ref);
298 
299 void print_rscs_brief(GListPtr rsc_list, const char * pre_text, long options,
300  void * print_data, gboolean print_all);
301 void pe_fence_node(pe_working_set_t * data_set, node_t * node, const char *reason);
302 
303 node_t *pe_create_node(const char *id, const char *uname, const char *type,
304  const char *score, pe_working_set_t * data_set);
305 bool remote_id_conflict(const char *remote_name, pe_working_set_t *data);
306 void common_print(resource_t * rsc, const char *pre_text, const char *name, node_t *node, long options, void *print_data);
307 resource_t *find_container_child(const char *stem, resource_t * rsc, node_t *node);
309 const char *container_fix_remote_addr_in(resource_t *rsc, xmlNode *xml, const char *field);
310 const char *pe_node_attribute_calculated(pe_node_t *node, const char *name, resource_t *rsc);
311 const char *pe_node_attribute_raw(pe_node_t *node, const char *name);
312 
313 #endif
bool remote_id_conflict(const char *remote_name, pe_working_set_t *data)
Definition: unpack.c:418
void verify_pe_options(GHashTable *options)
Definition: common.c:184
void container_free(resource_t *rsc)
Definition: container.c:1401
void clone_print(resource_t *rsc, const char *pre_text, long options, void *print_data)
Definition: clone.c:401
action_t * pre_done
Definition: internal.h:41
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:343
gint sort_rsc_priority(gconstpointer a, gconstpointer b)
Definition: utils.c:392
gint sort_rsc_index(gconstpointer a, gconstpointer b)
Definition: utils.c:365
gboolean get_target_role(resource_t *rsc, enum rsc_role_e *role)
Definition: utils.c:1690
void pe_metadata(void)
Definition: common.c:175
node_t * node_copy(const node_t *this_node)
Definition: utils.c:127
action_t * post_done
Definition: internal.h:42
GListPtr node_list_dup(GListPtr list, gboolean reset, gboolean filter)
Definition: utils.c:199
GHashTable * allowed_nodes
Definition: internal.h:52
action_t * post
Definition: internal.h:40
node_t * pe_create_node(const char *id, const char *uname, const char *type, const char *score, pe_working_set_t *data_set)
Definition: unpack.c:356
bool pe_can_fence(pe_working_set_t *data_set, node_t *node)
Definition: utils.c:100
bool container_fix_remote_addr(resource_t *rsc)
Definition: container.c:753
enum action_tasks get_complex_task(resource_t *rsc, const char *name, gboolean allow_non_atomic)
Definition: utils.c:1361
struct op_digest_cache_s op_digest_cache_t
enum rsc_role_e master_resource_state(const resource_t *rsc, gboolean current)
action_t * pe_fence_op(node_t *node, const char *op, bool optional, const char *reason, pe_working_set_t *data_set)
Definition: utils.c:2138
GListPtr slave
Definition: internal.h:51
char * native_parameter(resource_t *rsc, node_t *node, gboolean create, const char *name, pe_working_set_t *data_set)
Definition: native.c:236
GListPtr find_actions_exact(GListPtr input, const char *key, node_t *on_node)
Definition: utils.c:1455
GHashTable * keys
Definition: internal.h:35
GListPtr find_actions(GListPtr input, const char *key, const node_t *on_node)
Definition: utils.c:1415
gboolean common_unpack(xmlNode *xml_obj, resource_t **rsc, resource_t *parent, pe_working_set_t *data_set)
Definition: complex.c:465
void common_update_score(resource_t *rsc, const char *id, int score)
Definition: complex.c:858
void common_free(resource_t *rsc)
Definition: complex.c:911
void pe_action_set_flag_reason(const char *function, long line, pe_action_t *action, pe_action_t *reason, const char *text, enum pe_action_flags flags, bool overwrite)
Definition: utils.c:2290
void print_node(const char *pre_text, node_t *node, gboolean details)
Definition: utils.c:1240
gint sort_op_by_callid(gconstpointer a, gconstpointer b)
Definition: utils.c:1560
time_t get_effective_time(pe_working_set_t *data_set)
Definition: utils.c:1675
GListPtr node_list_and(GListPtr list1, GListPtr list2, gboolean filter)
gboolean master_active(resource_t *rsc, gboolean all)
xmlNode * params_restart
Definition: internal.h:275
void set_bit_recursive(resource_t *rsc, unsigned long long flag)
Definition: utils.c:2104
action_t * get_pseudo_op(const char *name, pe_working_set_t *data_set)
Definition: utils.c:1778
int get_target_rc(xmlNode *xml_op)
Definition: unpack.c:2974
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:721
void print_rscs_brief(GListPtr rsc_list, const char *pre_text, long options, void *print_data, gboolean print_all)
Definition: native.c:877
GListPtr find_recurring_actions(GListPtr input, node_t *not_on_node)
Definition: utils.c:1327
void clone_free(resource_t *rsc)
Definition: clone.c:603
enum rsc_role_e group_resource_state(const resource_t *rsc, gboolean current)
Definition: group.c:218
pe_action_flags
Definition: status.h:229
gboolean container_unpack(resource_t *rsc, pe_working_set_t *data_set)
Definition: container.c:827
char uname[MAX_NAME]
Definition: internal.h:53
resource_t * find_container_child(const char *stem, resource_t *rsc, node_t *node)
Definition: container.c:1170
void pe_action_set_reason(pe_action_t *action, const char *reason, bool overwrite)
Definition: utils.c:2349
void master_free(resource_t *rsc)
GListPtr stop
Definition: internal.h:47
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)
char * digest_all_calc
Definition: internal.h:276
char * clone_strip(const char *last_rsc_id)
Definition: unpack.c:1561
pe_working_set_t * pe_dataset
Definition: utils.c:31
action_t * find_first_action(GListPtr input, const char *uuid, const char *task, node_t *on_node)
Definition: utils.c:1385
GListPtr master
Definition: internal.h:50
char * digest_secure_calc
Definition: internal.h:277
void pe_fence_node(pe_working_set_t *data_set, node_t *node, const char *reason)
Schedule a fence action for a node.
Definition: unpack.c:77
const char * container_fix_remote_addr_in(resource_t *rsc, xmlNode *xml, const char *field)
Definition: container.c:789
gboolean add_tag_ref(GHashTable *tags, const char *tag_name, const char *obj_ref)
Definition: utils.c:2254
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:419
void pe_free_shallow_adv(GListPtr alist, gboolean with_data)
const char * pe_node_attribute_raw(pe_node_t *node, const char *name)
Definition: common.c:478
enum rsc_role_e native_resource_state(const resource_t *rsc, gboolean current)
Definition: native.c:745
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:1234
gboolean native_active(resource_t *rsc, gboolean all)
Definition: native.c:279
GHashTable * node_hash_dup(GHashTable *hash)
node_t * native_location(resource_t *rsc, GListPtr *list, gboolean current)
Definition: native.c:757
GListPtr node_list_from_hash(GHashTable *hash, gboolean reset, gboolean filter)
xmlNode * params_all
Definition: internal.h:273
GListPtr active
Definition: internal.h:44
enum rsc_role_e clone_resource_state(const resource_t *rsc, gboolean current)
Definition: clone.c:638
GListPtr node_list_minus(GListPtr list1, GListPtr list2, gboolean filter)
void common_print(resource_t *rsc, const char *pre_text, const char *name, node_t *node, long options, void *print_data)
Definition: native.c:473
const char * pe_node_attribute_calculated(pe_node_t *node, const char *name, resource_t *rsc)
Definition: common.c:440
pe_ordering
Definition: status.h:414
GHashTable * node_hash_from_list(GListPtr list)
Definition: utils.c:183
gboolean clone_active(resource_t *rsc, gboolean all)
Definition: clone.c:268
void add_hash_param(GHashTable *hash, const char *name, const char *value)
Definition: common.c:423
GListPtr demote
Definition: internal.h:48
void resource_location(resource_t *rsc, node_t *node, int score, const char *tag, pe_working_set_t *data_set)
Definition: utils.c:1516
int pe_get_configured_timeout(resource_t *rsc, const char *action, pe_working_set_t *data_set)
Definition: utils.c:845
void node_list_exclude(GHashTable *list, GListPtr list2, gboolean merge_scores)
Definition: utils.c:148
ticket_t * ticket_new(const char *ticket_id, pe_working_set_t *data_set)
Definition: utils.c:1807
gboolean group_active(resource_t *rsc, gboolean all)
Definition: group.c:101
enum rsc_role_e container_resource_state(const resource_t *rsc, gboolean current)
Definition: container.c:1434
char * clone_zero(const char *last_rsc_id)
Definition: unpack.c:1600
GListPtr inactive
Definition: internal.h:45
xmlNode * params_secure
Definition: internal.h:274
void dump_node_capacity(int level, const char *comment, node_t *node)
Definition: utils.c:322
int merge_weights(int w1, int w2)
Definition: common.c:386
#define uint32_t
Definition: stdint.in.h:158
char data[0]
Definition: internal.h:58
action_t * pre
Definition: internal.h:39
int pe_get_failcount(node_t *node, resource_t *rsc, time_t *last_failure, uint32_t flags, xmlNode *xml_op, pe_working_set_t *data_set)
Definition: failcounts.c:237
void container_print(resource_t *rsc, const char *pre_text, long options, void *print_data)
Definition: container.c:1301
rsc_role_e
Definition: common.h:81
gboolean container_active(resource_t *rsc, gboolean all)
Definition: container.c:1131
void native_free(resource_t *rsc)
Definition: native.c:738
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:234
gboolean native_unpack(resource_t *rsc, pe_working_set_t *data_set)
Definition: native.c:127
void pe_free_action(action_t *action)
Definition: utils.c:1300
void clear_bit_recursive(resource_t *rsc, unsigned long long flag)
Definition: utils.c:2091
void destroy_ticket(gpointer data)
Definition: utils.c:1795
void pe_free_shallow(GListPtr alist)
Definition: status.h:173
GListPtr promote
Definition: internal.h:49
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:1284
GListPtr start
Definition: internal.h:46
gboolean order_actions(action_t *lh_action, action_t *rh_action, enum pe_ordering order)
Definition: utils.c:1726
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:1980
const char * action
Definition: internal.h:37
pe_fc_flags_e
Definition: internal.h:117
resource_t * find_clone_instance(resource_t *rsc, const char *sub_id, pe_working_set_t *data_set)
Definition: clone.c:66
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:225
GList * GListPtr
Definition: crm.h:218
bool is_set_recursive(resource_t *rsc, long long flag, bool any)
Definition: clone.c:370
char * digest_restart_calc
Definition: internal.h:278
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:2220
resource_t * native_find_rsc(resource_t *rsc, const char *id, node_t *node, int flags)
Definition: native.c:162
uint64_t flags
Definition: remote.c:156
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:259
enum crm_ais_msg_types type
Definition: internal.h:51
gboolean clone_unpack(resource_t *rsc, pe_working_set_t *data_set)
Definition: clone.c:153
gboolean master_unpack(resource_t *rsc, pe_working_set_t *data_set)
Definition: clone.c:135