pacemaker  2.0.1-9e909a5bdd
Scalable High-Availability cluster resource manager
internal.h
Go to the documentation of this file.
1 /*
2  * Copyright 2004-2019 Andrew Beekhof <andrew@beekhof.net>
3  *
4  * This source code is licensed under the GNU Lesser General Public License
5  * version 2.1 or later (LGPLv2.1+) WITHOUT ANY WARRANTY.
6  */
7 
8 #ifndef PE_INTERNAL__H
9 # define PE_INTERNAL__H
10 # include <string.h>
11 # include <crm/pengine/status.h>
12 # include <crm/pengine/remote.h>
13 
14 # define pe_rsc_info(rsc, fmt, args...) crm_log_tag(LOG_INFO, rsc ? rsc->id : "<NULL>", fmt, ##args)
15 # define pe_rsc_debug(rsc, fmt, args...) crm_log_tag(LOG_DEBUG, rsc ? rsc->id : "<NULL>", fmt, ##args)
16 # define pe_rsc_trace(rsc, fmt, args...) crm_log_tag(LOG_TRACE, rsc ? rsc->id : "<NULL>", fmt, ##args)
17 
18 # define pe_err(fmt...) { was_processing_error = TRUE; crm_config_error = TRUE; crm_err(fmt); }
19 # define pe_warn(fmt...) { was_processing_warning = TRUE; crm_config_warning = TRUE; crm_warn(fmt); }
20 # define pe_proc_err(fmt...) { was_processing_error = TRUE; crm_err(fmt); }
21 # define pe_proc_warn(fmt...) { was_processing_warning = TRUE; crm_warn(fmt); }
22 # define pe_set_action_bit(action, bit) action->flags = crm_set_bit(__FUNCTION__, __LINE__, action->uuid, action->flags, bit)
23 # define pe_clear_action_bit(action, bit) action->flags = crm_clear_bit(__FUNCTION__, __LINE__, action->uuid, action->flags, bit)
24 
25 typedef struct pe__location_constraint_s {
26  char *id; // Constraint XML ID
27  pe_resource_t *rsc_lh; // Resource being located
28  enum rsc_role_e role_filter; // Role to locate
29  enum pe_discover_e discover_mode; // Resource discovery
30  GListPtr node_list_rh; // List of pe_node_t*
32 
33 typedef struct pe__order_constraint_s {
34  int id;
35  enum pe_ordering type;
36 
37  void *lh_opaque;
41 
42  void *rh_opaque;
47 
48 typedef struct notify_data_s {
49  GSList *keys; // Environment variable name/value pairs
50 
51  const char *action;
52 
57 
58  GListPtr active; /* notify_entry_t* */
59  GListPtr inactive; /* notify_entry_t* */
60  GListPtr start; /* notify_entry_t* */
61  GListPtr stop; /* notify_entry_t* */
62  GListPtr demote; /* notify_entry_t* */
63  GListPtr promote; /* notify_entry_t* */
64  GListPtr master; /* notify_entry_t* */
65  GListPtr slave; /* notify_entry_t* */
66  GHashTable *allowed_nodes;
67 
69 
70 bool pe_can_fence(pe_working_set_t *data_set, node_t *node);
71 
72 int merge_weights(int w1, int w2);
73 void add_hash_param(GHashTable * hash, const char *name, const char *value);
74 
75 char *native_parameter(resource_t * rsc, node_t * node, gboolean create, const char *name,
76  pe_working_set_t * data_set);
77 pe_node_t *native_location(const pe_resource_t *rsc, GList **list, int current);
78 
79 void pe_metadata(void);
80 void verify_pe_options(GHashTable * options);
81 
82 void common_update_score(resource_t * rsc, const char *id, int score);
83 void native_add_running(resource_t * rsc, node_t * node, pe_working_set_t * data_set);
84 
85 gboolean native_unpack(resource_t * rsc, pe_working_set_t * data_set);
86 gboolean group_unpack(resource_t * rsc, pe_working_set_t * data_set);
87 gboolean clone_unpack(resource_t * rsc, pe_working_set_t * data_set);
88 gboolean container_unpack(resource_t * rsc, pe_working_set_t * data_set);
89 
90 resource_t *native_find_rsc(resource_t *rsc, const char *id, const node_t *node,
91  int flags);
92 
93 gboolean native_active(resource_t * rsc, gboolean all);
94 gboolean group_active(resource_t * rsc, gboolean all);
95 gboolean clone_active(resource_t * rsc, gboolean all);
96 gboolean container_active(resource_t * rsc, gboolean all);
97 
98 void native_print(resource_t * rsc, const char *pre_text, long options, void *print_data);
99 void group_print(resource_t * rsc, const char *pre_text, long options, void *print_data);
100 void clone_print(resource_t * rsc, const char *pre_text, long options, void *print_data);
101 void container_print(resource_t * rsc, const char *pre_text, long options, void *print_data);
102 
103 void native_free(resource_t * rsc);
104 void group_free(resource_t * rsc);
105 void clone_free(resource_t * rsc);
106 void container_free(resource_t * rsc);
107 
108 enum rsc_role_e native_resource_state(const resource_t * rsc, gboolean current);
109 enum rsc_role_e group_resource_state(const resource_t * rsc, gboolean current);
110 enum rsc_role_e clone_resource_state(const resource_t * rsc, gboolean current);
111 enum rsc_role_e container_resource_state(const resource_t * rsc, gboolean current);
112 
113 gboolean common_unpack(xmlNode * xml_obj, resource_t ** rsc, resource_t * parent,
114  pe_working_set_t * data_set);
115 void common_free(resource_t * rsc);
116 
117 extern node_t *node_copy(const node_t *this_node);
118 extern time_t get_effective_time(pe_working_set_t * data_set);
119 
120 /* Failure handling utilities (from failcounts.c) */
121 
122 // bit flags for fail count handling options
125  pe_fc_effective = 0x01, // don't count expired failures
126  pe_fc_fillers = 0x02, // if container, include filler failures in count
127 };
128 
129 int pe_get_failcount(node_t *node, resource_t *rsc, time_t *last_failure,
130  uint32_t flags, xmlNode *xml_op,
131  pe_working_set_t *data_set);
132 
134  const char *reason,
135  pe_working_set_t *data_set);
136 
137 /* Functions for finding/counting a resource's active nodes */
138 
140  unsigned int *count_all,
141  unsigned int *count_clean);
143  unsigned int *count);
144 
145 static inline pe_node_t *
146 pe__current_node(const pe_resource_t *rsc)
147 {
148  return pe__find_active_on(rsc, NULL, NULL);
149 }
150 
151 
152 /* Binary like operators for lists of nodes */
153 extern void node_list_exclude(GHashTable * list, GListPtr list2, gboolean merge_scores);
154 extern GListPtr node_list_dup(GListPtr list, gboolean reset, gboolean filter);
155 
156 extern GHashTable *node_hash_from_list(GListPtr list);
157 static inline gpointer
158 pe_hash_table_lookup(GHashTable * hash, gconstpointer key)
159 {
160  if (hash) {
161  return g_hash_table_lookup(hash, key);
162  }
163  return NULL;
164 }
165 
166 extern action_t *get_pseudo_op(const char *name, pe_working_set_t * data_set);
167 extern gboolean order_actions(action_t * lh_action, action_t * rh_action, enum pe_ordering order);
168 
169 GHashTable *node_hash_dup(GHashTable * hash);
170 
171 /* Printing functions for debug */
172 extern void print_node(const char *pre_text, node_t * node, gboolean details);
173 
174 extern void print_resource(int log_level, const char *pre_text, resource_t * rsc, gboolean details);
175 
176 extern void dump_node_scores_worker(int level, const char *file, const char *function, int line,
177  resource_t * rsc, const char *comment, GHashTable * nodes);
178 
179 extern void dump_node_capacity(int level, const char *comment, node_t * node);
180 extern void dump_rsc_utilization(int level, const char *comment, resource_t * rsc, node_t * node);
181 
182 # define dump_node_scores(level, rsc, text, nodes) do { \
183  dump_node_scores_worker(level, __FILE__, __FUNCTION__, __LINE__, rsc, text, nodes); \
184  } while(0)
185 
186 /* Sorting functions */
187 extern gint sort_rsc_priority(gconstpointer a, gconstpointer b);
188 extern gint sort_rsc_index(gconstpointer a, gconstpointer b);
189 
190 extern xmlNode *find_rsc_op_entry(resource_t * rsc, const char *key);
191 
192 extern action_t *custom_action(resource_t * rsc, char *key, const char *task, node_t * on_node,
193  gboolean optional, gboolean foo, pe_working_set_t * data_set);
194 
195 # define delete_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_DELETE, 0)
196 # define delete_action(rsc, node, optional) custom_action( \
197  rsc, delete_key(rsc), CRMD_ACTION_DELETE, node, \
198  optional, TRUE, data_set);
199 
200 # define stopped_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_STOPPED, 0)
201 # define stopped_action(rsc, node, optional) custom_action( \
202  rsc, stopped_key(rsc), CRMD_ACTION_STOPPED, node, \
203  optional, TRUE, data_set);
204 
205 # define stop_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_STOP, 0)
206 # define stop_action(rsc, node, optional) custom_action( \
207  rsc, stop_key(rsc), CRMD_ACTION_STOP, node, \
208  optional, TRUE, data_set);
209 
210 # define reload_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_RELOAD, 0)
211 # define start_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_START, 0)
212 # define start_action(rsc, node, optional) custom_action( \
213  rsc, start_key(rsc), CRMD_ACTION_START, node, \
214  optional, TRUE, data_set)
215 
216 # define started_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_STARTED, 0)
217 # define started_action(rsc, node, optional) custom_action( \
218  rsc, started_key(rsc), CRMD_ACTION_STARTED, node, \
219  optional, TRUE, data_set)
220 
221 # define promote_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_PROMOTE, 0)
222 # define promote_action(rsc, node, optional) custom_action( \
223  rsc, promote_key(rsc), CRMD_ACTION_PROMOTE, node, \
224  optional, TRUE, data_set)
225 
226 # define promoted_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_PROMOTED, 0)
227 # define promoted_action(rsc, node, optional) custom_action( \
228  rsc, promoted_key(rsc), CRMD_ACTION_PROMOTED, node, \
229  optional, TRUE, data_set)
230 
231 # define demote_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_DEMOTE, 0)
232 # define demote_action(rsc, node, optional) custom_action( \
233  rsc, demote_key(rsc), CRMD_ACTION_DEMOTE, node, \
234  optional, TRUE, data_set)
235 
236 # define demoted_key(rsc) generate_op_key(rsc->id, CRMD_ACTION_DEMOTED, 0)
237 # define demoted_action(rsc, node, optional) custom_action( \
238  rsc, demoted_key(rsc), CRMD_ACTION_DEMOTED, node, \
239  optional, TRUE, data_set)
240 
241 extern int pe_get_configured_timeout(resource_t *rsc, const char *action,
242  pe_working_set_t *data_set);
243 
244 extern action_t *find_first_action(GListPtr input, const char *uuid, const char *task,
245  node_t * on_node);
246 extern enum action_tasks get_complex_task(resource_t * rsc, const char *name,
247  gboolean allow_non_atomic);
248 
249 extern GListPtr find_actions(GListPtr input, const char *key, const node_t *on_node);
250 extern GListPtr find_actions_exact(GListPtr input, const char *key, node_t * on_node);
251 extern GListPtr find_recurring_actions(GListPtr input, node_t * not_on_node);
252 
253 extern void pe_free_action(action_t * action);
254 
255 extern void resource_location(resource_t * rsc, node_t * node, int score, const char *tag,
256  pe_working_set_t * data_set);
257 
258 extern gint sort_op_by_callid(gconstpointer a, gconstpointer b);
259 extern gboolean get_target_role(resource_t * rsc, enum rsc_role_e *role);
260 
261 extern resource_t *find_clone_instance(resource_t * rsc, const char *sub_id,
262  pe_working_set_t * data_set);
263 
264 extern void destroy_ticket(gpointer data);
265 extern ticket_t *ticket_new(const char *ticket_id, pe_working_set_t * data_set);
266 
267 // Resources for manipulating resource names
268 const char *pe_base_name_end(const char *id);
269 char *clone_strip(const char *last_rsc_id);
270 char *clone_zero(const char *last_rsc_id);
271 
272 static inline bool
273 pe_base_name_eq(resource_t *rsc, const char *id)
274 {
275  if (id && rsc && rsc->id) {
276  // Number of characters in rsc->id before any clone suffix
277  size_t base_len = pe_base_name_end(rsc->id) - rsc->id + 1;
278 
279  return (strlen(id) == base_len) && !strncmp(id, rsc->id, base_len);
280  }
281  return FALSE;
282 }
283 
284 int get_target_rc(xmlNode * xml_op);
285 
286 gint sort_node_uname(gconstpointer a, gconstpointer b);
287 bool is_set_recursive(resource_t * rsc, long long flag, bool any);
288 
299 };
300 
301 typedef struct op_digest_cache_s {
302  enum rsc_digest_cmp_val rc;
303  xmlNode *params_all;
304  xmlNode *params_secure;
305  xmlNode *params_restart;
310 
311 op_digest_cache_t *rsc_action_digest_cmp(resource_t * rsc, xmlNode * xml_op, node_t * node,
312  pe_working_set_t * data_set);
313 
314 action_t *pe_fence_op(node_t * node, const char *op, bool optional, const char *reason, pe_working_set_t * data_set);
315 void trigger_unfencing(
316  resource_t * rsc, node_t *node, const char *reason, action_t *dependency, pe_working_set_t * data_set);
317 
318 void pe_action_set_reason(pe_action_t *action, const char *reason, bool overwrite);
319 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);
320 
321 #define pe_action_required(action, reason, text) pe_action_set_flag_reason(__FUNCTION__, __LINE__, action, reason, text, pe_action_optional, FALSE)
322 #define pe_action_implies(action, reason, flag) pe_action_set_flag_reason(__FUNCTION__, __LINE__, action, reason, NULL, flag, FALSE)
323 
324 void set_bit_recursive(resource_t * rsc, unsigned long long flag);
325 void clear_bit_recursive(resource_t * rsc, unsigned long long flag);
326 
327 gboolean add_tag_ref(GHashTable * tags, const char * tag_name, const char * obj_ref);
328 
329 void print_rscs_brief(GListPtr rsc_list, const char * pre_text, long options,
330  void * print_data, gboolean print_all);
331 void pe_fence_node(pe_working_set_t * data_set, node_t * node, const char *reason);
332 
333 node_t *pe_create_node(const char *id, const char *uname, const char *type,
334  const char *score, pe_working_set_t * data_set);
335 bool remote_id_conflict(const char *remote_name, pe_working_set_t *data);
336 void common_print(resource_t * rsc, const char *pre_text, const char *name, node_t *node, long options, void *print_data);
337 resource_t *find_container_child(const resource_t *bundle, const node_t *node);
339 const char *container_fix_remote_addr_in(resource_t *rsc, xmlNode *xml, const char *field);
340 const char *pe_node_attribute_calculated(const pe_node_t *node,
341  const char *name,
342  const resource_t *rsc);
343 const char *pe_node_attribute_raw(pe_node_t *node, const char *name);
345  pe_working_set_t *data_set);
346 void pe__add_param_check(xmlNode *rsc_op, pe_resource_t *rsc, pe_node_t *node,
347  enum pe_check_parameters, pe_working_set_t *data_set);
349  void (*cb)(pe_resource_t*, pe_node_t*, xmlNode*,
350  enum pe_check_parameters,
351  pe_working_set_t*));
353 #endif
get_target_role
gboolean get_target_role(resource_t *rsc, enum rsc_role_e *role)
Definition: utils.c:1709
pe_base_name_end
const char * pe_base_name_end(const char *id)
Definition: unpack.c:1459
RSC_DIGEST_RESTART
@ RSC_DIGEST_RESTART
Definition: internal.h:293
GListPtr
GList * GListPtr
Definition: crm.h:190
order_actions
gboolean order_actions(action_t *lh_action, action_t *rh_action, enum pe_ordering order)
Definition: utils.c:1745
native_resource_state
enum rsc_role_e native_resource_state(const resource_t *rsc, gboolean current)
Definition: native.c:778
rsc_digest_cmp_val
rsc_digest_cmp_val
Definition: internal.h:289
pe_fc_default
@ pe_fc_default
Definition: internal.h:124
find_rsc_op_entry
xmlNode * find_rsc_op_entry(resource_t *rsc, const char *key)
Definition: utils.c:1245
container_unpack
gboolean container_unpack(resource_t *rsc, pe_working_set_t *data_set)
Definition: container.c:984
pe__location_constraint_s::rsc_lh
pe_resource_t * rsc_lh
Definition: internal.h:27
group_active
gboolean group_active(resource_t *rsc, gboolean all)
Definition: group.c:90
op_digest_cache_s::rc
enum rsc_digest_cmp_val rc
Definition: internal.h:302
remote.h
op_digest_cache_s::digest_secure_calc
char * digest_secure_calc
Definition: internal.h:307
notify_data_s::action
const char * action
Definition: internal.h:51
flags
uint64_t flags
Definition: remote.c:3
dump_node_capacity
void dump_node_capacity(int level, const char *comment, node_t *node)
Definition: utils.c:351
data
char data[0]
Definition: internal.h:10
common_update_score
void common_update_score(resource_t *rsc, const char *id, int score)
Definition: complex.c:705
common_free
void common_free(resource_t *rsc)
Definition: complex.c:758
pe_check_parameters
pe_check_parameters
Definition: status.h:140
pe__location_t
struct pe__location_constraint_s pe__location_t
clone_resource_state
enum rsc_role_e clone_resource_state(const resource_t *rsc, gboolean current)
Definition: clone.c:607
sort_rsc_index
gint sort_rsc_index(gconstpointer a, gconstpointer b)
Definition: utils.c:385
native_unpack
gboolean native_unpack(resource_t *rsc, pe_working_set_t *data_set)
Definition: native.c:143
notify_data_s::pre
action_t * pre
Definition: internal.h:53
pe_resource_s::id
char * id
Definition: status.h:259
op_digest_cache_s::params_secure
xmlNode * params_secure
Definition: internal.h:304
pe__order_constraint_s::rh_opaque
void * rh_opaque
Definition: internal.h:42
pe_fc_fillers
@ pe_fc_fillers
Definition: internal.h:126
pe_action_flags
pe_action_flags
Definition: status.h:233
rsc_role_e
rsc_role_e
Definition: common.h:86
native_find_rsc
resource_t * native_find_rsc(resource_t *rsc, const char *id, const node_t *node, int flags)
Definition: native.c:212
pe__location_constraint_s::id
char * id
Definition: internal.h:26
pe__order_constraint_s::lh_action
action_t * lh_action
Definition: internal.h:39
sort_rsc_priority
gint sort_rsc_priority(gconstpointer a, gconstpointer b)
Definition: utils.c:412
pe_fc_effective
@ pe_fc_effective
Definition: internal.h:125
print_rscs_brief
void print_rscs_brief(GListPtr rsc_list, const char *pre_text, long options, void *print_data, gboolean print_all)
Definition: native.c:927
get_complex_task
enum action_tasks get_complex_task(resource_t *rsc, const char *name, gboolean allow_non_atomic)
Definition: utils.c:1372
custom_action
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:439
notify_data_s::master
GListPtr master
Definition: internal.h:64
pe_ordering
pe_ordering
Definition: status.h:412
find_clone_instance
resource_t * find_clone_instance(resource_t *rsc, const char *sub_id, pe_working_set_t *data_set)
Definition: clone.c:40
type
enum crm_ais_msg_types type
Definition: internal.h:3
pe_can_fence
bool pe_can_fence(pe_working_set_t *data_set, node_t *node)
Definition: utils.c:89
pe_get_configured_timeout
int pe_get_configured_timeout(resource_t *rsc, const char *action, pe_working_set_t *data_set)
Definition: utils.c:823
find_actions_exact
GListPtr find_actions_exact(GListPtr input, const char *key, node_t *on_node)
Definition: utils.c:1466
RSC_DIGEST_MATCH
@ RSC_DIGEST_MATCH
Definition: internal.h:291
native_location
pe_node_t * native_location(const pe_resource_t *rsc, GList **list, int current)
Definition: native.c:800
container_resource_state
enum rsc_role_e container_resource_state(const resource_t *rsc, gboolean current)
Definition: container.c:1604
pe_ticket_s
Definition: status.h:386
notify_data_s::active
GListPtr active
Definition: internal.h:58
pe__order_constraint_s::rh_action
action_t * rh_action
Definition: internal.h:44
trigger_unfencing
void trigger_unfencing(resource_t *rsc, node_t *node, const char *reason, action_t *dependency, pe_working_set_t *data_set)
Definition: utils.c:2242
pe_action_set_flag_reason
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:2312
op_digest_cache_s::params_all
xmlNode * params_all
Definition: internal.h:303
common_unpack
gboolean common_unpack(xmlNode *xml_obj, resource_t **rsc, resource_t *parent, pe_working_set_t *data_set)
Definition: complex.c:358
pe_get_failcount
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:251
container_print
void container_print(resource_t *rsc, const char *pre_text, long options, void *print_data)
Definition: container.c:1471
native_free
void native_free(resource_t *rsc)
Definition: native.c:771
clone_print
void clone_print(resource_t *rsc, const char *pre_text, long options, void *print_data)
Definition: clone.c:369
common_print
void common_print(resource_t *rsc, const char *pre_text, const char *name, node_t *node, long options, void *print_data)
Definition: native.c:502
print_node
void print_node(const char *pre_text, node_t *node, gboolean details)
Definition: utils.c:1251
get_pseudo_op
action_t * get_pseudo_op(const char *name, pe_working_set_t *data_set)
Definition: utils.c:1797
set_bit_recursive
void set_bit_recursive(resource_t *rsc, unsigned long long flag)
Definition: utils.c:2127
pe_fence_node
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:68
node_list_dup
GListPtr node_list_dup(GListPtr list, gboolean reset, gboolean filter)
Definition: utils.c:189
pe_action_s
Definition: status.h:336
rsc_action_digest_cmp
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:2001
notify_data_s::inactive
GListPtr inactive
Definition: internal.h:59
pe_fc_flags_e
pe_fc_flags_e
Definition: internal.h:123
pe__order_constraint_s::id
int id
Definition: internal.h:34
pe__order_constraint_s::rh_action_task
char * rh_action_task
Definition: internal.h:45
pe__location_constraint_s::role_filter
enum rsc_role_e role_filter
Definition: internal.h:28
clone_free
void clone_free(resource_t *rsc)
Definition: clone.c:573
group_print
void group_print(resource_t *rsc, const char *pre_text, long options, void *print_data)
Definition: group.c:135
is_set_recursive
bool is_set_recursive(resource_t *rsc, long long flag, bool any)
Definition: clone.c:338
uint32_t
#define uint32_t
Definition: stdint.in.h:156
notify_data_s::start
GListPtr start
Definition: internal.h:60
uname
char uname[MAX_NAME]
Definition: internal.h:5
pe__order_constraint_s::rh_rsc
resource_t * rh_rsc
Definition: internal.h:43
notify_data_s::post
action_t * post
Definition: internal.h:54
pe_action_set_reason
void pe_action_set_reason(pe_action_t *action, const char *reason, bool overwrite)
Definition: utils.c:2370
op_digest_cache_s::digest_all_calc
char * digest_all_calc
Definition: internal.h:306
op_digest_cache_s::params_restart
xmlNode * params_restart
Definition: internal.h:305
clone_unpack
gboolean clone_unpack(resource_t *rsc, pe_working_set_t *data_set)
Definition: clone.c:111
pe_node_attribute_calculated
const char * pe_node_attribute_calculated(const pe_node_t *node, const char *name, const resource_t *rsc)
Definition: common.c:423
notify_data_s::promote
GListPtr promote
Definition: internal.h:63
pe__foreach_param_check
void pe__foreach_param_check(pe_working_set_t *data_set, void(*cb)(pe_resource_t *, pe_node_t *, xmlNode *, enum pe_check_parameters, pe_working_set_t *))
Definition: remote.c:229
native_add_running
void native_add_running(resource_t *rsc, node_t *node, pe_working_set_t *data_set)
Definition: native.c:37
sort_op_by_callid
gint sort_op_by_callid(gconstpointer a, gconstpointer b)
Definition: utils.c:1579
pe__order_constraint_s::lh_action_task
char * lh_action_task
Definition: internal.h:40
notify_data_t
struct notify_data_s notify_data_t
get_effective_time
time_t get_effective_time(pe_working_set_t *data_set)
Definition: utils.c:1694
pe__location_constraint_s::discover_mode
enum pe_discover_e discover_mode
Definition: internal.h:29
clone_strip
char * clone_strip(const char *last_rsc_id)
Definition: unpack.c:1499
pe_working_set_s
Definition: status.h:87
pe_metadata
void pe_metadata(void)
Definition: common.c:166
node_copy
node_t * node_copy(const node_t *this_node)
Definition: utils.c:116
container_fix_remote_addr_in
const char * container_fix_remote_addr_in(resource_t *rsc, xmlNode *xml, const char *field)
Definition: container.c:945
RSC_DIGEST_ALL
@ RSC_DIGEST_ALL
Definition: internal.h:295
pe__find_active_on
pe_node_t * pe__find_active_on(const pe_resource_t *rsc, unsigned int *count_all, unsigned int *count_clean)
Definition: complex.c:840
node_hash_from_list
GHashTable * node_hash_from_list(GListPtr list)
Definition: utils.c:172
clone_active
gboolean clone_active(resource_t *rsc, gboolean all)
Definition: clone.c:237
op_digest_cache_s::digest_restart_calc
char * digest_restart_calc
Definition: internal.h:308
pe_create_node
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:331
sort_node_uname
gint sort_node_uname(gconstpointer a, gconstpointer b)
Definition: utils.c:215
pe_discover_e
pe_discover_e
Definition: status.h:405
ticket_new
ticket_t * ticket_new(const char *ticket_id, pe_working_set_t *data_set)
Definition: utils.c:1826
add_hash_param
void add_hash_param(GHashTable *hash, const char *name, const char *value)
Definition: common.c:406
pe__order_constraint_s::lh_rsc
resource_t * lh_rsc
Definition: internal.h:38
add_tag_ref
gboolean add_tag_ref(GHashTable *tags, const char *tag_name, const char *obj_ref)
Definition: utils.c:2276
find_container_child
resource_t * find_container_child(const resource_t *bundle, const node_t *node)
Definition: container.c:1351
pe__location_constraint_s::node_list_rh
GListPtr node_list_rh
Definition: internal.h:30
pe_fence_op
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:2161
node_hash_dup
GHashTable * node_hash_dup(GHashTable *hash)
resource_location
void resource_location(resource_t *rsc, node_t *node, int score, const char *tag, pe_working_set_t *data_set)
Definition: utils.c:1535
pe__ordering_t
struct pe__order_constraint_s pe__ordering_t
native_parameter
char * native_parameter(resource_t *rsc, node_t *node, gboolean create, const char *name, pe_working_set_t *data_set)
Definition: native.c:267
find_actions
GListPtr find_actions(GListPtr input, const char *key, const node_t *on_node)
Definition: utils.c:1426
remote_id_conflict
bool remote_id_conflict(const char *remote_name, pe_working_set_t *data)
Definition: unpack.c:392
verify_pe_options
void verify_pe_options(GHashTable *options)
Definition: common.c:175
container_active
gboolean container_active(resource_t *rsc, gboolean all)
Definition: container.c:1303
notify_data_s::slave
GListPtr slave
Definition: internal.h:65
dump_node_scores_worker
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:267
notify_data_s::allowed_nodes
GHashTable * allowed_nodes
Definition: internal.h:66
group_free
void group_free(resource_t *rsc)
Definition: group.c:184
dump_rsc_utilization
void dump_rsc_utilization(int level, const char *comment, resource_t *rsc, node_t *node)
Definition: utils.c:368
notify_data_s::post_done
action_t * post_done
Definition: internal.h:56
pe__free_param_checks
void pe__free_param_checks(pe_working_set_t *data_set)
Definition: remote.c:244
notify_data_s::stop
GListPtr stop
Definition: internal.h:61
get_target_rc
int get_target_rc(xmlNode *xml_op)
Definition: unpack.c:2979
pe__order_constraint_s::lh_opaque
void * lh_opaque
Definition: internal.h:37
pe__add_param_check
void pe__add_param_check(xmlNode *rsc_op, pe_resource_t *rsc, pe_node_t *node, enum pe_check_parameters, pe_working_set_t *data_set)
Definition: remote.c:203
native_print
void native_print(resource_t *rsc, const char *pre_text, long options, void *print_data)
Definition: native.c:750
pe__clear_failcount
pe_action_t * pe__clear_failcount(pe_resource_t *rsc, pe_node_t *node, const char *reason, pe_working_set_t *data_set)
Schedule a controller operation to clear a fail count.
Definition: failcounts.c:360
group_resource_state
enum rsc_role_e group_resource_state(const resource_t *rsc, gboolean current)
Definition: group.c:205
pe__find_active_requires
pe_node_t * pe__find_active_requires(const pe_resource_t *rsc, unsigned int *count)
Definition: complex.c:920
node_list_exclude
void node_list_exclude(GHashTable *list, GListPtr list2, gboolean merge_scores)
Definition: utils.c:137
container_fix_remote_addr
bool container_fix_remote_addr(resource_t *rsc)
Definition: container.c:910
pe_node_attribute_raw
const char * pe_node_attribute_raw(pe_node_t *node, const char *name)
Definition: common.c:462
group_unpack
gboolean group_unpack(resource_t *rsc, pe_working_set_t *data_set)
Definition: group.c:20
RSC_DIGEST_UNKNOWN
@ RSC_DIGEST_UNKNOWN
Definition: internal.h:298
notify_data_s::pre_done
action_t * pre_done
Definition: internal.h:55
op_digest_cache_t
struct op_digest_cache_s op_digest_cache_t
merge_weights
int merge_weights(int w1, int w2)
Definition: common.c:369
pe_resource_s
Definition: status.h:258
notify_data_s::demote
GListPtr demote
Definition: internal.h:62
pe__location_constraint_s
Definition: internal.h:25
native_active
gboolean native_active(resource_t *rsc, gboolean all)
Definition: native.c:312
clone_zero
char * clone_zero(const char *last_rsc_id)
Definition: unpack.c:1521
pe__order_constraint_s
Definition: internal.h:33
container_free
void container_free(resource_t *rsc)
Definition: container.c:1571
pe_free_action
void pe_free_action(action_t *action)
Definition: utils.c:1311
clear_bit_recursive
void clear_bit_recursive(resource_t *rsc, unsigned long long flag)
Definition: utils.c:2114
destroy_ticket
void destroy_ticket(gpointer data)
Definition: utils.c:1814
notify_data_s::keys
GSList * keys
Definition: internal.h:49
notify_data_s
Definition: internal.h:48
action_tasks
action_tasks
Definition: common.h:57
pe_node_s
Definition: status.h:184
pe__order_constraint_s::type
enum pe_ordering type
Definition: internal.h:35
pe__is_universal_clone
bool pe__is_universal_clone(pe_resource_t *rsc, pe_working_set_t *data_set)
Definition: clone.c:633
status.h
Cluster status and scheduling.
print_resource
void print_resource(int log_level, const char *pre_text, resource_t *rsc, gboolean details)
Definition: utils.c:1295
find_recurring_actions
GListPtr find_recurring_actions(GListPtr input, node_t *not_on_node)
Definition: utils.c:1338
find_first_action
action_t * find_first_action(GListPtr input, const char *uuid, const char *task, node_t *on_node)
Definition: utils.c:1396
op_digest_cache_s
Definition: internal.h:301