Skip to content
Snippets Groups Projects
Commit 14943cd8 authored by Eric Vidal's avatar Eric Vidal :speech_balloon:
Browse files

typo and minor fix

parent 1385e40d
No related branches found
No related tags found
No related merge requests found
......@@ -179,7 +179,6 @@ int ssexec_signal(int argc, char const *const *argv, ssexec_t *info)
r = svc_launch(apids, napid, what, &graph, ares, areslen, info, updown, opt_updown, reloadmsg, data, propagate) ;
graph_free_all(&graph) ;
service_resolve_array_free(ares, areslen) ;
return r ;
......
......@@ -182,7 +182,6 @@ int ssexec_stop(int argc, char const *const *argv, ssexec_t *info)
svc_unsupervise(flist, fnservice, &graph, ares, areslen, info) ;
service_resolve_array_free(ares, areslen) ;
graph_free_all(&graph) ;
return e ;
......
......@@ -696,7 +696,7 @@ static int async(pidtree_t *apidt, unsigned int i, unsigned int what, ssexec_t *
char *name = graph->data.s + genalloc_s(graph_hash_t,&graph->hash)[apidt[i].vertex].vertex ;
log_trace("beginning of the process of: ", name) ;
log_trace("beginning of the process of tree: ", name) ;
if (FLAGS_ISSET(apidt[i].state, (!what ? FLAGS_DOWN : FLAGS_UP)) ||
/** force to pass through unsupersive process even
......
......@@ -34,7 +34,6 @@ void graph_compute_visit(resolve_service_t *ares, unsigned int aresid, unsigned
visit[idx] = 1 ;
}
/** find dependencies of the service from the graph, do it recursively */
c = graph_matrix_get_edge_g_list(l, graph, ares[aresid].sa.s + ares[aresid].name, requiredby, 1) ;
......
......@@ -97,7 +97,6 @@ int svc_compute_ns(resolve_service_t *sares, unsigned int sareslen, unsigned int
r = svc_launch(apids, napid, what, &graph, ares, areslen, info, updown, opt_updown, reloadmsg, data, propagate) ;
graph_free_all(&graph) ;
service_resolve_array_free(ares, areslen) ;
return r ;
......
......@@ -22,6 +22,7 @@
#include <oblibs/log.h>
#include <oblibs/string.h>
#include <oblibs/types.h>
#include <oblibs/environ.h>
#include <skalibs/types.h>
#include <skalibs/tai.h>
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment