Loris/Tissino /La/Mia/Cassetta/Degli/Attrezzi/Linux

Total Page：16

File Type：pdf, Size：1020Kb

/loris/tissino /la/mia/cassetta/degli/attrezzi/linux www.tissino.it/docs/linux Indice 1 Introduzione 17 1.1 Questa cassetta . 17 1.1.1 A chi èrivolta . 17 1.1.2 Formati e diffusione . 17 1.1.3 Errori . 17 1.1.4 Licenza . 17 1.2 Bibliografia e documentazione . 17 1.2.1 PDF . 17 1.2.2 Libri . 18 1.2.3 Siti web . 18 1.2.4 Man . 18 1.2.5 Whatis . 18 1.2.6 Apropos . 19 1.2.7 Info . 19 1.2.8 —help . 19 1.2.9 /usr/share/doc . 19 1.2.10 HOWTO e WWW . 19 1.3 Il concetto di software libero . 20 1.3.1 Il software . 20 1.3.2 Programma . 20 1.3.3 Applicazione . 20 1.3.4 Sistema operativo . 20 1.3.5 Programma sorgente ed eseguibile . 20 1.3.6 Free Software Foundation . 21 1.3.7 Copyright e Copyleft . 21 1.3.8 Licenze . 21 1.3.9 Open Source . 21 1.3.10 Altri tipi di licenza . 22 1.4 Differenze tra Windows e GNU/Linux . 22 1.4.1 Differenze tra Microsoft Windows e GNU/Linux . 22 1.4.2 Sicurezza . 22 1.4.3 Disponibilitàdi software . 22 1.4.4 i18n e l10n . 22 1.4.5 Gestione del software . 23 1.4.6 File system . 23 1.4.7 Nomi di file e directory . 23 1.4.8 Estensioni . 23 1.4.9 Permessi su file e directory . 23 1.4.10 File nascosti e attributi . 23 1.4.11 File binari . 23 1.4.12 Flessibilitànell’uso dell’interfaccia grafica . 24 1.4.13 Interfaccia a riga di comando . 24 2 1.4.14 Multiutenza . 24 1.4.15 Gestione dei processi . 24 1.4.16 Sistemi di autenticazione . 24 1.4.17 Lettere accentate . 24 1.4.18 Altre differenze . 24 2 Linux e scuola 24 2.1 Software libero e scuola . 24 2.1.1 Software libero e scuola . 24 2.1.2 Il sito web linuxdidattica.org . 25 2.1.3 Dossier Scuola . 25 2.1.4 WiildSs . 25 2.1.5 Software utile . 25 2.2 iTALC . 25 2.2.1 iTALC . 25 2.2.2 Postazione del docente . 25 2.2.3 Postazione dell’allievo . 26 2.2.4 Gestione . 26 3 Interfaccia a linea di comando e comandi basilari 26 3.1 Introduzione alla Bash . 26 3.1.1 Tips and tricks . 26 3.1.2 Struttura dei comandi . 27 3.1.3 Pagine man ............................................ 27 3.1.4 I/O standard . 27 3.1.5 Pipeline .............................................. 27 3.1.6 Filtri . 28 3.1.7 Comandi interattivi . 28 3.1.8 Funzionamento alternativo . 28 3.1.9 StdIn e StdOut come file binari . 28 3.1.10 Attenzione ai nomi . 28 3.1.11 Unione dell’output di piùprogrammi . 29 3.1.12 Il comando tee .......................................... 29 3.1.13 Esercizi . 29 3.2 Gestione di file e directory . 29 3.2.1 Il filesystem ............................................ 29 3.2.2 Directory principali . 29 3.2.3 Utenti . 30 3.2.4 File per la gestione degli utenti . 30 3.2.5 Elenco dei file in una directory . 30 3.2.6 Creazione e rimozione di una directory . 30 3.2.7 Gestione di file . 30 3.2.8 Espansione dei nomi . 31 3.2.9 Comandi come parametri . 31 3 3.2.10 Operazioni su molti file/directory contemporaneamente . 31 3.2.11 I nodi indice e altre amenità . 32 3.2.12 Permessi su file e directory.

140

Copy Link

Recommended publications

Happy Birthday Linux
25 Jahre Linux! Am Anfang war der Quellcode Entstehungsgeschichte und Werdegang von Linux Entwicklung und Diversifizierung der Distributionen Der Wert von Linux oder: „Wat nix kost, dat is och nix.“ Andreas Klein ORR 2016 1 Am Anfang war der Quellcode (70er) ● 1969, Ken Thompson u. Dennis Ritchie erstellen die erste Version von Unix in Assembler. ● Von 1969-1971 entwickeln sie gemeinsam die Programmiersprache B. ● Ab 1971 erweiterte in erster Linie Dennis Ritchie B, um weitere Elemente und nannte sie Anfangs NB (new B). ● 1973 waren die Erweiterungen soweit gediehen, das er die stark verbesserte Sprache C nannte (Brian W. Kernighan hat ebenfalls maßgeblich dazu beigetragen). //Unix=25 PCs ● Bis 1974 war das gesamte Betriebssystem UNIX vollständig in C implementiert und wurde mit einem C-Compiler kostenfrei an verschiedene Universitäten verteilt. ● 1978 wurden bereits über 600 Computer mit dem UNIX-Betriebssystemen betrieben. ● Das aufblühende Zeitalter der Computerisierung der 70er Jahre war geprägt vom regen und freien Austausch von Programmen und dessen zugrunde liegenden Ideen. Sinnvoller Weise tauschte man diese als Quellcode untereinander aus. ● 1979 wurde von AT&T die letzte UNIX-Version 7, mit freiem Quellcode veröffentlicht. Andreas Klein ORR 2016 2 Am Anfang war der Quellcode (80er) ● 1980 – 1983 AT&T sowie zahlreiche andere Unternehmen beginnen mit der Kommerzialisierung von UNIX, durch Koppelung an stark beschränkenden Lizenzen und Geheimhaltung des zugrunde liegenden Quelltextes. ● Richard Stallman kündigt am 27. September 1983 in den Newsgroups net.unix-wizards und net.usoft das GNU-Projekt an. ● Am 5. Januar 1984 begann Stallman offiziell mit der Arbeit am GNU-Projekt, nachdem er seine Stelle am MIT gekündigt hatte.
[Show full text]
System Calls & Signals
CS345 OPERATING SYSTEMS System calls & Signals Panagiotis Papadopoulos [email protected] 1 SYSTEM CALL When a program invokes a system call, it is interrupted and the system switches to Kernel space. The Kernel then saves the process execution context (so that it can resume the program later) and determines what is being requested. The Kernel carefully checks that the request is valid and that the process invoking the system call has enough privilege. For instance some system calls can only be called by a user with superuser privilege (often referred to as root). If everything is good, the Kernel processes the request in Kernel Mode and can access the device drivers in charge of controlling the hardware (e.g. reading a character inputted from the keyboard). The Kernel can read and modify the data of the calling process as it has access to memory in User Space (e.g. it can copy the keyboard character into a buffer that the calling process has access to) When the Kernel is done processing the request, it restores the process execution context that was saved when the system call was invoked, and control returns to the calling program which continues executing. 2 SYSTEM CALLS FORK() 3 THE FORK() SYSTEM CALL (1/2) • A process calling fork()spawns a child process. • The child is almost an identical clone of the parent: • Program Text (segment .text) • Stack (ss) • PCB (eg. registers) • Data (segment .data) #include <sys/types.h> #include <unistd.h> pid_t fork(void); 4 THE FORK() SYSTEM CALL (2/2) • The fork()is one of the those system calls, which is called once, but returns twice! Consider a piece of program • After fork()both the parent and the child are ..
[Show full text]
Troubleshoot Zombie/Defunct Processes in UC Servers
Troubleshoot Zombie/Defunct Processes in UC Servers Contents Introduction Prerequisites Requirements Components Used Background Information Check Zombies using UCOS Admin CLI Troubleshoot/Clear the Zombies Manually Restart the Appropriate Service Reboot the Server Kill the Parent Process Verify Introduction This document describes how to work with zombie processes seen on CUCM, IMnP, and other Cisco UC products when logged in using Admin CLI. Prerequisites Requirements Cisco recommends that you have knowledge of using Admin CLI of the UC servers: ● Cisco Unified Communications Manager (CUCM) ● Cisco Unified Instant Messaging and Presence Server (IMnP) ● Cisco Unity Connection Server (CUC) Components Used This document is not restricted to specific software and hardware versions. The information in this document was created from the devices in a specific lab environment. All of the devices used in this document started with a cleared (default) configuration. If your network is live, ensure that you understand the potential impact of any command. Background Information The Unified Communications servers are essentially Linux OS based applications. When a process dies on Linux, it is not all removed from memory immediately, its process descriptor (PID) stays in memory which only takes a tiny amount of memory. This process becomes a defunct process and the process's parent is notified that its child process has died. The parent process is then supposed to read the dead process's exit status and completely remove it from the memory. Once this is done using the wait() system call, the zombie process is eliminated from the process table. This is known as reaping the zombie process.
[Show full text]
Processes in Linux/Unix
Processes in Linux/Unix A program/command when executed, a special instance is provided by the system to the process. This instance consists of all the services/resources that may be utilized by the process under execution. • Whenever a command is issued in unix/linux, it creates/starts a new process. For example, pwd when issued which is used to list the current directory location the user is in, a process starts. • Through a 5 digit ID number unix/linux keeps account of the processes, this number is call process id or pid. Each process in the system has a unique pid. • Used up pid’s can be used in again for a newer process since all the possible combinations are used. • At any point of time, no two processes with the same pid exist in the system because it is the pid that Unix uses to track each process. Initializing a process A process can be run in two ways: 1. Foreground Process : Every process when started runs in foreground by default, receives input from the keyboard and sends output to the screen. When issuing pwd command $ ls pwd Output: $ /home/geeksforgeeks/root When a command/process is running in the foreground and is taking a lot of time, no other processes can be run or started because the prompt would not be available until the program finishes processing and comes out. 2. Backround Process : It runs in the background without keyboard input and waits till keyboard input is required. Thus, other processes can be done in parallel with the process running in background since they do not have to wait for the previous process to be completed.
[Show full text]
CENG251: Assignment #5
Out: March 30, 2021 Due: Wed Apr 14, 2021 There are 30 marks. Please keep and submit a time log to account for what you’ve done. CENG251: Assignment #5 Part I: C Language Features (8 marks) In class we demonstrated re-entrant code by comparing the use of ctime vs ctime_r. We showed that ctime always returned the same memory location and that ctime_r avoided this problem by passing the memory to be filled which was then returned with a different result; Write a single small C program that 1. Demonstrates that getpwuid and getpwnam are not reentrant by calling each of these twice with different valid arguments and displaying the return address and the content of the passwd structure returned. Prepare your output string using fmemopen and then writing the output to a string using a file pointer before writing the string to the terminal. An example of using fmemopen can be found in the example program stringIODemo.c (3) 2. Continue the program and call getpwuid_r and getpwnam_r with correct arguments. Prepare your output string using sprintf and then display the string to the terminal. Examples of long structured format strings can be seen in the example program stringIODemo.c (3) 3. In ctimeDemo.c we demonstrated the use of strdup to preserve the result of ctime from one function call to the next. Use malloc and memcpy to do the same for getpwuid and show that this worked displaying the values from the copy. (2) Part II: Signals (8 marks) The following exercises should be done as a single program.
[Show full text]
Embedded Linux Optimizations
Embedded Linux optimizations Embedded Linux optimizations Size, RAM, speed, power, cost Michael Opdenacker Thomas Petazzoni Free Electrons © Copyright 2004-2009, Free Electrons. Creative Commons BY-SA 3.0 license Latest update: Dec 20, 2010, Document sources, updates and translations: http://free-electrons.com/docs/optimizations Corrections, suggestions, contributions and translations are welcome! 1 Free Electrons. Kernel, drivers and embedded Linux development, consulting, training and support. http//free-electrons.com Penguin weight watchers Make your penguin slimmer, faster, and reduce its consumption of fish! Before 2 weeks after 2 Free Electrons. Kernel, drivers and embedded Linux development, consulting, training and support. http//free-electrons.com CE Linux Forum http://celinuxforum.org/ Non profit organization, whose members are embedded Linux companies and Consumer Electronics (CE) devices makers. Mission: develop the use of Linux in CE devices Hosts many projects to improve the suitability of Linux for CE devices and embedded systems. All patches are meant to be included in the mainline Linux kernel. Most of the ideas introduced in this presentation have been gathered or even implemented by CE Linux Forum projects! 3 Free Electrons. Kernel, drivers and embedded Linux development, consulting, training and support. http//free-electrons.com Contents Ideas for optimizing the Linux kernel and executables Increasing speed Reducing size: disk footprint and RAM Reducing power consumption Global perspective: cost and combined optimization effects The ultimate optimization tool! 4 Free Electrons. Kernel, drivers and embedded Linux development, consulting, training and support. http//free-electrons.com Embedded Linux Optimizations Increasing speed Reducing kernel boot time 5 Free Electrons. Kernel, drivers and embedded Linux development, consulting, training and support.
[Show full text]
A Guide to Inter-Process Communication in Linux
Opensource.com A guide to inter-process communication in Linux Learn how processes synchronize with each other in Linux. By Marty Kalin . A GUIDE TO INTER-PROCESS COMMUNICATION IN LINUX . CC BY-SA 4.0 . OPENSOURCE.COM 1 OPENSOURCE.COM ..................................................................... ABOUT OPENSOURCE.COM What is Opensource.com? publishes stories about creating, OPENSOURCE.COM adopting, and sharing open source solutions. Visit Opensource.com to learn more about how the open source way is improving technologies, education, business, government, health, law, entertainment, humanitarian efforts, and more. Submit a story idea: opensource.com/story Email us: [email protected] . 2 A GUIDE TO INTER-PROCESS COMMUNICATION IN LINUX . CC BY-SA 4.0 . OPENSOURCE.COM . ABOUT THE AUTHOR MARTY KALIN IN COMPUTER SCIENCE (College of Computing and I ’M AN ACADEMIC Digital Media, DePaul University) with wide experience in software development, mostly in production planning and scheduling (steel industry) and product configuration (truck and bus manufacturing). Details on books and other publications are available at: Marty Kalin’s hompage FO OLL W MARTY KALIN T witter: @kalin_martin . A GUIDE TO INTER-PROCESS COMMUNICATION IN LINUX . CC BY-SA 4.0 . OPENSOURCE.COM 3 OPENSOURCE.COM ..................................................................... INTRODUCTION Introduction 5 CHAPTERS Shared storage 6 Using pipes and message queues 12 Sockets and signals 19 Wrapping up this guide 24 GET INVOLVED | ADDITIONAL RESOURCES Write for Us 25 . 4 A GUIDE TO INTER-PROCESS COMMUNICATION IN LINUX . CC BY-SA 4.0 . OPENSOURCE.COM . INTRODUCTION Introduction interprocess communication (ipc) in Linux. The THIS GUIDE IS AboUT guide uses code examples in C to clarify the following IPC mechanisms: • Shared files • Shared memory (with semaphores) • Pipes (named and unnamed) • Message queues • Sockets • Signals I’ll introduce you to some core concepts before moving on to the first two of these mech- anisms: shared files and shared memory.
[Show full text]
Kill a Zombie! a Process Is Called a Zombie Process If the Process Has
Kill a Zombie! A process is called a zombie process if the process has been completed, but its PID and process entry remains in the Linux process table. A process is removed from the process table when the process is completed, and its parent process reads the completed process' exit status by using the wait() system call. If a parent process fails to call wait() for whatever reason, its child process will be left in the process table, becoming a zombie. To find zombie processes on Linux: $ ps axo stat,ppid,pid,comm | grep -w defunct Z 250 10242 fake-prog <defunct> The above command searches for processes with zombie (defunct) state, and displays them in (state, PPID, PID, command-name) format. The sample output shows that there is one zombie process associated with "fake-prog", and it was spawned by a parent process with PID 250. Killing zombie processes is not obvious since zombie processes are already dead. You can try two options to kill a zombie process on Linux as follows. First, you can try sending SIGCHLD signal to the zombie's parent process using the kill command. Note that the above command gives you PPID (PID of parent process) of each zombie. In our example, PPID of the zombie is 250. $ sudo kill -s SIGCHLD 250 If a zombie process still does not go away, you can kill the parent process (e.g., 250) of the zombie. $ sudo kill -9 250 Once its parent process gets killed, the zombie will be adopted by the init process, which is a parent of all processes in Linux.
[Show full text]
Operating Systems Processes and Threads
COS 318: Operating Systems Processes and Threads Prof. Margaret Martonosi Computer Science Department Princeton University http://www.cs.princeton.edu/courses/archive/fall11/cos318 Today’s Topics Processes Concurrency Threads Reminder: Hope you’re all busy implementing your assignment 2 (Traditional) OS Abstractions Processes - thread of control with context Files- In Unix, this is “everything else” Regular file – named, linear stream of data bytes Sockets - endpoints of communication, possible between unrelated processes Pipes - unidirectional I/O stream, can be unnamed Devices Process Most fundamental concept in OS Process: a program in execution one or more threads (units of work) associated system resources Program vs. process program: a passive entity process: an active entity For a program to execute, a process is created for that program Program and Process main() main() { { heap ... ... foo() foo() ... ... } } stack bar() bar() { { registers ... ... PC } } Program Process 5 Process vs. Program Process > program Program is just part of process state Example: many users can run the same program • Each process has its own address space, i.e., even though program has single set of variable names, each process will have different values Process < program A program can invoke more than one process Example: Fork off processes 6 Simplest Process Sequential execution No concurrency inside a process Everything happens sequentially Some coordination may be required Process state Registers Main memory I/O devices • File system • Communication ports … 7 Process Abstraction Unit of scheduling One (or more*) sequential threads of control program counter, register values, call stack Unit of resource allocation address space (code and data), open files sometimes called tasks or jobs Operations on processes: fork (clone-style creation), wait (parent on child), exit (self-termination), signal, kill.
[Show full text]
Gestion De Services Sous Unix
Gestion de services sous Unix Baptiste Daroussin [email protected] [email protected] sysadmin #6 Paris 19 Février 2016 Disclaimer sysadmin#6 Gestion de services sous Unix 2 of 16 L’arlésienne supervisor daemontools procd OpenRC DEMONS Runit Epoch ninit ﬁnitrcNG sinit minitsystemdinitng rc svc perp eINIT SMF SysVinit nosh SystemXVI upstart launchd monit Shepherd relaunchd sparkrc watchmancircus sysadmin#6 Gestion de services sous Unix 3 of 16 I I’m your father(c)(tm) I laisse la main a d’autres pour la gestion des services... presque I /etc/inittab I /etc/ttys I Généralement des scripts shell I SysVinit I rcNG I rc Il était une fois init(8) I petit mais costaud sysadmin#6 Gestion de services sous Unix 4 of 16 I laisse la main a d’autres pour la gestion des services... presque I /etc/inittab I /etc/ttys I Généralement des scripts shell I SysVinit I rcNG I rc Il était une fois init(8) I petit mais costaud I I’m your father(c)(tm) sysadmin#6 Gestion de services sous Unix 4 of 16 presque I /etc/inittab I /etc/ttys I Généralement des scripts shell I SysVinit I rcNG I rc Il était une fois init(8) I petit mais costaud I I’m your father(c)(tm) I laisse la main a d’autres pour la gestion des services... sysadmin#6 Gestion de services sous Unix 4 of 16 I /etc/inittab I /etc/ttys I Généralement des scripts shell I SysVinit I rcNG I rc Il était une fois init(8) I petit mais costaud I I’m your father(c)(tm) I laisse la main a d’autres pour la gestion des services..
[Show full text]
Tutorial 2 : Process Management
Tutorial 2 : Process Management August 20, 2019 Objective : • This assignment is intended to learn how to create, work with and ma- nipulate processes in Linux. You are expected to refer to the text book and references mentioned in the course website befor you start the lab. Some sample codes for process creation using fork system call have been provided for your reference. Instructions • You are expected to run all the sample codes provided in the Helpful Re- sources section. It will help you understand how OS virtualizes CPU and memory. Some of the codes are related to process creation and execution using Unix based system calls such as fork,exit,wait and exec Tutorials 1. Tut1 : Memory Virtualization : Physical memory model presents Memory as an array of bytes. The data stored at an address of memory can be read by providing the address of the location wehere the data resides. Similarly, while writing data to any address of a memory, one needs to specify the address for writing as well as the data to be written to the given address. Memory is accessed all the time when a program is running. A program keeps all of its data structures in memory, and accesses them through various instruction. In- structions themeselves reside in the memory which have to be fetched. Instructions : Execute the code mem.c from the Helpful Resources sec- tion. Make sure to include the common.h ﬁle in the same folder as the mem.c. To execute use the following commands : gcc mem.c ./a.out ox200000 The program does a couple of things.
[Show full text]
16.482/16.561: Computer Architecture
EECE.4810/EECE.5730: Operating Systems Spring 2019 Exam 1 Solution 1. (28 + 8 points) ProcessU management a. (8 points) Explain (i) what a zombie process is, and (ii) why all processes are technically zombie processes for at least a brief time. (Hint: think about which of the five process states zombie processes must exist in.) Solution: (i) A zombie process is a process that has finished executing but has not completely terminated, usually because its exit status has not been collected, so its resources (at a minimum, its process control block) have not been deallocated. (ii) Any process in the terminated state is technically a zombie, since it has finished executing but its resources have not deallocated. 1 Questions 1b, 1c, and 1d refer to the two programs pr1 and pr2 below. Assume pr1 always executes first and is invoked as follows: ./pr1 4810 pr1: pr2: int var1; int main(int argc, char **argv) { pid_t pid; int main(int argc, char **argv) { int var3, var4; int var2 = 5730; char str[15]; printf("P2: %s\n", argv[1]); pid_t pid, pid2; sscanf(argv[1], "%d %d", &var3, &var4); var1 = atoi(argv[1]); var4 = var4 - 920; pid = fork(); (1) pid = fork(); (3) if (pid == 0) { if (pid > 0) { printf("P1 child 1: %d %d\n", wait(NULL); var1, var2); printf("P2 parent: %d %d\n", var1 = var2; var3, var4); } pid2 = fork(); (2) else if (pid == 0) if (pid2 == 0) printf("P2 child: %d %d\n", printf("P1 child 2: %d %d\n", var3, var4); var1, var2); return 0; else if (pid2 > 0) { } wait(NULL); sprintf(str, "%d %d", var1, var2); execlp("./pr2", "pr2", str, NULL); } } else if (pid > 0) { var2 = var1; wait(NULL); printf("P1: %d %d\n", var1, var2); } return 0; } b.
[Show full text]