Sponsored Content
Top Forums UNIX for Advanced & Expert Users UNIX/Linux inventory - Open Source Post 303000261 by denisloide on Friday 7th of July 2017 01:44:59 PM
Old 07-07-2017
Quote:
Originally Posted by RudiC
Usually your package manager (e.g. synaptic for Ubuntu) does exactly this, albeit for the node only that it manages.
But I need something that is like zabbix, an agent installed on each node that sends reports to a central node, maybe with synaptic I'll need to check each server manually.
 

3 More Discussions You Might Find Interesting

1. UNIX and Linux Applications

need open source KB software for UNIX

Anyone know of a good open source Knowledge Base software for UNIX that can connect to an Oracle back end? (0 Replies)
Discussion started by: RJ45
0 Replies

2. Linux

Linux open source for admin

Hi, I have created my VM lab on redhat linux, but giving me error after updating new yum repository, its asking me for subscription. I want want switch my redhat linux lab from VM, which linux open source will be best to perform admin commands and tasks?? If possible , please provide iso file... (2 Replies)
Discussion started by: Nats
2 Replies

3. Fedora

Is UNIX an open source OS ?

Hi everyone, I know the following questions are noobish questions but I am asking them because I am confused about the basics of history behind UNIX and LINUX. Ok onto business, my questions are-: Was/Is UNIX ever an open source operating system ? If UNIX was... (21 Replies)
Discussion started by: sreyan32
21 Replies
list(3) 						    InterNetNews Documentation							   list(3)

NAME
list - list routines SYNOPSIS
#include <inn/list.h> struct node { struct node *succ; struct node *pred; }; struct list { struct node *head; struct node *tail; struct node *tailpred; }; void list_new(struct list *list); struct node *list_addhead(struct list *list, struct node *node); struct node *list_addtail(struct list *list, struct node *node); struct node *list_head(struct list *list); struct node *list_tail(struct list *list); struct node *list_succ(struct node *node); struct node *list_pred(struct node *node); struct node *list_remhead(struct list *list); struct node *list_remtail(struct list *list); struct node *list_remove(struct node *node); struct node *list_insert(struct list *list, struct node *node, struct node *pred); bool list_isempty(struct list *list); DESCRIPTION
list_new initialises the list header list so as to create an empty list. list_addhead adds node to the head of list, returning the node just added. list_addtail adds node to the tail of list, returning the node just added. list_head returns a pointer to the the node at the head of list or NULL if the list is empty. list_tail returns a pointer to the the node at the tail of list or NULL if the list is empty. list_succ returns the next (successor) node on the list after node or NULL if node was the final node. list_pred returns the previous (predecessor) node on the list before node or NULL if node was the first node. list_remhead removes the first node from list and returns it to the caller. If the list is empty NULL is returned. list_remtail removes the last node from list and returns it to the caller. If the list is empty NULL is returned. list_remove removes node from the list it is on and returns it to the caller. list_insert inserts node onto list after the node pred. If pred is NULL then node is added to the head of list. HISTORY
Written by Alex Kiernan <alex.kiernan@thus.net> for InterNetNews 2.4.0. $Id: list.pod 7851 2008-05-26 19:33:08Z iulius $ INN 2.5.2 2009-05-21 list(3)
All times are GMT -4. The time now is 12:32 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy