This document is the System Administrator's Guide for Red Hat Enterprise Linux 7. It was written by 17 authors from Red Hat and covers topics such as basic system configuration, managing subscriptions and support, installing and managing software, and infrastructure services. The guide includes chapters on configuring the system locale and keyboard, managing users and groups, installing and updating packages with Yum, and services like OpenSSH and TigerVNC. It is intended for system administrators with basic Linux knowledge.
This document is the user's guide for Wireshark version 1.7, an open source network protocol analyzer. It describes what Wireshark is, its features, system requirements, how to obtain, build and install it. It provides details on using the user interface and menus, capturing live network data, opening and saving capture files, filtering packets, advanced functions, and statistics. The guide is written by Ulf Lamping, Richard Sharpe, and Ed Warnicke.
This document provides an overview of the Arduino Uno board and other Arduino boards. It discusses the origins of Arduino and its emphasis on learning by doing through practices like patching, hacking, and circuit bending. It also covers the main components of the Arduino Uno, including the microcontroller, pins, power sources, and reset button. Finally, it discusses other Arduino boards and where to purchase components, such as the Arduino store, Adafruit, SparkFun, and electronics distributors.
Red Hat Enterprise Linux 4 System Administration Guide provides documentation on installation, configuration, and administration of Red Hat Enterprise Linux 4 systems. Key topics covered include kickstart installations, Logical Volume Manager (LVM), Software RAID, package management, network configuration, firewall configuration, NFS, Samba, DHCP, Apache, authentication, console access, users/groups, printers, and more. The guide is intended to help system administrators manage and maintain Red Hat Enterprise Linux servers.
This document is the Asterisk Administrator Guide, which provides information on installing, configuring, and managing the Asterisk PBX system. It covers topics such as installing Asterisk from packages or source code, configuring channels and drivers, creating dialplans, and using the Asterisk Extension Language (AEL) for advanced dialplan functionality. The guide is intended for system administrators tasked with deploying and maintaining Asterisk installations.
This document provides an overview of developing solutions with the EPiServer content management system:
- EPiServer uses ASP.NET Web Forms to provide an event-driven interface similar to Windows Forms, allowing server-side events to update the user interface.
- Content is managed through EPiServer in three modes: Admin, Edit, and Visitor. Admin mode is for administration tasks, Edit mode is for editing content, and Visitor mode displays published content to site visitors.
- When a page is requested, EPiServer retrieves the corresponding content object from the database, runs any business logic code, and renders the final HTML page by merging the content with a page template. This allows maintaining a separation
This document describes the design of a Hangman game application for Android mobile devices. It includes use cases, UI mockups, class diagrams, and other design documents. The application allows users to play the classic Hangman game on their Android device by guessing letters to solve a mystery word. Key features include starting new games, continuing incomplete games, playing with touch, keys, or navigation buttons, getting hints, and adjusting settings like enabling music. Storyboards and screenshots demonstrate example user flows through the app. The technical documentation provides details on app architecture, components, and development strategy.
This document is a manual for Cinelerra CV, an open source non-linear video editor for Linux. It discusses installing and configuring Cinelerra CV, including hardware and software requirements and instructions for different Linux distributions. It also covers compiling Cinelerra from source, configuring audio and video drivers, and playback settings. The manual is distributed under the GNU GPL license.
This document is the user guide for Apache Maven, an open source project management and comprehension tool. It provides an overview of Maven, descriptions of its key features, and detailed documentation on using Maven for build automation and management of Java projects. The guide covers topics such as the basic concepts of Maven, how to configure and run Maven builds, how to use Maven plugins and repositories, best practices for project structure and dependency management, and how to contribute to the Maven project.
Cisco routers for the small business a practical guide for it professionals...Mark Smith
This document provides a guide for configuring Cisco routers for small businesses. It discusses connecting to the router through the console port and navigating the command line interface. It then covers configuring the router by setting the hostname, IP addresses for LAN and WAN interfaces, enabling DHCP services, and setting security parameters like passwords. The goal is to provide IT professionals with the knowledge needed to get a Cisco router up and running for a small business network.
BCs thesis for Universitat Rovira i Virgili related to monitoring of sensoring systems by using ZigBee mesh technologies in a healthcare environment. Developed with Matlab.
This document is the user's manual for sqlmap, an open source penetration testing tool that automates the process of detecting and exploiting SQL injection flaws and taking over database servers. The manual provides information on installing and using sqlmap, including requirements, basic usage, supported features, techniques, and numerous configuration options for optimization, injection, detection, enumeration and brute forcing capabilities.
The document discusses the Linux virtual memory manager in detail across multiple chapters. It begins with an introduction and discusses code management practices. It then covers various topics related to virtual memory management like describing physical memory, page table management, process address spaces, physical page allocation, high memory management, page frame reclamation, swap management, and out of memory handling. Diagrams and code flow charts are provided to illustrate key data structures and functions involved.
TortoiseSVN is a Windows client for Subversion version control. It provides features for importing and exporting files to a repository, checking out working copies, committing changes, updating working copies, and viewing project history. The document discusses TortoiseSVN's installation, basic version control concepts, repository creation and management, daily use features like committing and updating, and resolving conflicts. It is intended as a user guide for getting started with and using TortoiseSVN for source control management.
This document provides notes from a Linux system administration course. It covers topics like installing Red Hat Linux, configuring XFree86 for graphics, managing software packages, understanding the boot sequence, basic network concepts, kernel functions, configuring services, managing users and groups, working with filesystems, and basic security measures. The document contains detailed sections on partitioning and formatting disks, mounting filesystems, and using common Linux administration tools.
Selenium jupiter j-unit 5 extension for selenium and appiumViliamtrobich
This document describes Selenium-Jupiter, a JUnit 5 extension that provides integration of Selenium and Appium testing frameworks. It allows injecting WebDriver instances like ChromeDriver and FirefoxDriver into JUnit 5 tests. Selenium-Jupiter is open source and hosted on GitHub. It supports local and remote browser testing, mobile testing with Appium, and integrates with tools like Jenkins.
Red hat storage-3-administration_guide-en-usTommy Lee
This document is the Red Hat Storage 3 Administration Guide. It describes how to configure and manage Red Hat Storage Server for on-premise and public cloud installations. The guide covers topics such as Red Hat Storage architecture, key features, managing storage pools and volumes, performance optimization, geo-replication, snapshots, monitoring and more. It provides administrators with information needed to setup and maintain Red Hat Storage environments.
This document provides an overview and instructions for using the DX Series Client application software. It describes the key features and interface elements of the client, including how to connect to a site, navigate live and recorded video, customize views, and perform other basic operations. The client allows users to remotely view live and recorded surveillance video from multiple cameras across a network.
This document provides instructions for installing and configuring OpenStack. It describes the OpenStack architecture and services, how to set up the necessary infrastructure components like networking, databases and message queues, and how to deploy the core OpenStack services. It also provides steps for launching a test instance and interacting with basic OpenStack features like networks, block storage and orchestration.
Despite its striking ability to avoid congestive losses in the absence of competition, TCP Vegas encounters
a potentially serious fairness problem when competing with TCP Reno, at least for the case when queue
capacity exceeds or is close to the transit capacity (19.7 TCP and Bottleneck Link Utilization). TCP Vegas
will try to minimize its queue use, while TCP Reno happily fills the queue. And whoever has more packets
in the queue has a proportionally greater share of bandwidth.
To make this precise, suppose we have two TCP connections sharing a bottleneck router R, the first using
TCP Vegas and the second using TCP Reno. Suppose further that both connections have a path transit
capacity of 10 packets, and R’s queue capacity is 40 packets. If 𝛼=3 and 𝛽=5, TCP Vegas might keep an
average of four packets in the queue. Unfortunately, TCP Reno then gobbles up most of the rest of the
queue space, as follows. There are 40-4 = 36 spaces left in the queue after TCP Vegas takes its quota, and
10 in the TCP Reno connection’s path, for a total of 46. This represents the TCP Reno connection’s network
ceiling, and is the point at which TCP Reno halves cwnd; therefore cwnd will vary from 23 to 46 with an
average of about 34. Of these 34 packets, if 10 are in transit then 24 are in R’s queue. If on average R has 24
packets from the Reno connection and 4 from the Vegas connection, then the bandwidth available to these
connections will also be in this same 6:1 proportion. The TCP Vegas connection will get 1/7 the bandwidth,
because it occupies 1/7 the queue, and the TCP Reno connection will take the other 6/7.
To put it another way, TCP Vegas is potentially too “civil” to compete with TCP Reno.
Even worse, Reno’s aggressive queue filling will eventually force the TCP Vegas cwnd to decrease; see
Exercise 4.0 below.
This Vegas-Reno fairness problem is most significant when the queue size is an appreciable fraction of the
path transit capacity. During periods when the queue is empty, TCPs Vegas and Reno increase cwnd at the
same rate, so when the queue size is small compared to the path capacity, TCP Vegas and TCP Reno are
much closer to being fair.
In 31.5 TCP Reno versus TCP Vegas we compare TCP Vegas with TCP Reno in simulation. With a transit
capacity of 220 packets and a queue capacity of 10 packets, TCPs Vegas and Reno receive almost exactly
the same bandwidth.
TCP Reno’s advantage here assumes a router with a single FIFO queue. That advantage can disappear
if a different queuing discipline is in effect. For example, if the bottleneck router used fair queuing (to
be introduced in 23.5 Fair Queuing) on a per-connection basis, then the TCP Reno connection’s queue
greediness would not be of any benefit, and both connections would get similar shares of bandwidth with
the TCP Vegas connection experiencing lower delay. See 23.6.1 Fair Queuing and Bufferbloat.
Let us next consider how TCP Vegas behaves when there is an increase in RTT due to the kind of cross
traff
This document provides an overview of Linux performance and tuning guidelines. It discusses Linux processes, memory, file systems, I/O subsystems, networking, and performance monitoring tools. The document is intended to help readers understand how Linux works and how to optimize system performance.
This document is the master's thesis of Remy Spaan from May 2016. The thesis identifies current security shortcomings in automotive systems based on previous studies of vehicle hacking. It then provides a model and proof-of-concept implementation to secure part of the update system for a widely used electronic control unit (ECU) in cars. The system aims to provide confidentiality, authenticity and integrity for software updates while preventing common attacks, using cryptographic techniques designed for resource-constrained ECUs. While not covering all aspects of the update process, the work takes steps toward more secure over-the-air firmware updates for vehicle systems.
This document is a Python tutorial that provides an overview of the Python programming language. It covers topics like using the Python interpreter, basic syntax, data structures, modules, input/output, exceptions, classes and inheritance, and the standard library. The tutorial is intended for new Python programmers to help them learn the essential aspects of the language.
This is the printout version of my lecture slides for the OS course. It includes more details (quations from books, references, etc.) than the slides version.
This document provides an unofficial reference manual for LaTeX version 2e from March 2018. It was originally translated from help manuals for earlier LaTeX versions. The document contains detailed information about LaTeX commands, environments, document structure, fonts, layout, sectioning, cross-references and more. Permission is granted to distribute copies of the manual provided the copyright information is preserved.
This document provides instructions for installing and administering R on various operating systems. It covers obtaining R sources, installing on Unix-like systems, Windows, and OS X. It also discusses installing add-on packages, internationalization, choosing 32- vs 64-bit builds, and using the standalone Rmath library. The document is intended as a manual for installing and managing R versions 3.0.2 or higher.
This document provides information about login scripts in Novell, including:
- Where login scripts should be located and common login script commands
- Examples of sample login scripts for containers, profiles, users, and default scripts
- Descriptions of specific login script commands and variables like MAP, IF/THEN, and INCLUDE
This document is the user manual for FLACS v9.0, a computational fluid dynamics (CFD) software for modeling fluid flow and chemical reactions. It describes the capabilities and proper use of FLACS, its preprocessor CASD, and postprocessor Flowvis. The manual provides guidance on installation, running simulations, working with files, and best practices for applications such as gas dispersion, explosions, fires, and more.
This document is a product manual for the Seagate Cheetah 15K.5 SCSI hard disk drive. It provides detailed specifications on the drive's performance, reliability, physical characteristics, and environmental limits. The manual describes the drive's standard features, capacities, interfaces, error rates, warranty and compliance with various industry standards.
The document evaluates five implementations of the SPARQL query language for the Semantic Web. It first provides background on the Semantic Web and SPARQL, including the data model and query language specifications. It then describes the methodology for testing each implementation using a dataset from DBpedia.org and sample queries. Each implementation - OpenRDF Sesame, OpenLink Virtuoso, Jena, Pyrrho DBMS, and AllegroGraph - is installed and evaluated based on documentation, loading data efficiently, and computing query results in a reasonable time. The conclusion finds that while some implementations are advanced, they still have problems processing basic SPARQL queries as specified.
This document provides an introduction to Java web programming. It covers topics like HTML, HTTP protocol, servlets, JavaServer Pages (JSP), tag libraries, and best practices. The document is divided into 8 chapters that progress from basic concepts to more advanced topics such as session management, building web applications, and custom tag libraries. It includes examples and lab activities to help readers learn Java web development.
This document specifies the devicetree format. It defines the structure and conventions for representing hardware resources and connections in a device tree. This includes node names, properties, memory map representation, interrupt mapping, and the flattened device tree binary format. The goal is to provide a standardized representation of platform hardware across embedded and mobile systems.
The paperback version is available on lulu.com there http://goo.gl/fraa8o
This is the first volume of the postgresql database administration book. The book covers the steps for installing, configuring and administering a PostgreSQL 9.3 on Linux debian. The book covers the logical and physical aspect of PostgreSQL. Two chapters are dedicated to the backup/restore topic.
This document is a user's guide for GNU PSPP statistical analysis software. It provides instructions on how to invoke and use PSPP, including preparing data files, performing statistical tests and analyses, and the PSPP scripting language. The guide covers topics such as data screening, hypothesis testing, variables, file formats, mathematical expressions and functions, and input/output of data.
This document is the Akka Java documentation for release 2.3.9 from Typesafe Inc. It provides an introduction to Akka, which is a toolkit for building scalable, resilient applications using the actor model. Akka aims to make writing concurrent, fault-tolerant and scalable applications easier by providing higher-level abstractions and tools based on the actor model. The documentation covers concepts like actors, actor systems, fault tolerance, and provides examples of using Akka for common patterns like scheduling periodic messages.
This document is a draft of a book on mathematics for programmers. It covers various topics in mathematics including prime numbers, modular arithmetic, probability, combinatorics, Galois fields, and logarithms. The document provides explanations, examples, and applications of these mathematical concepts for use in computer programming. It is intended to help programmers understand and apply core mathematical principles in their work.
This document is a user's guide for GNU PSPP statistical analysis software version 0.8.4. It provides information on invoking and using PSPP, including preparing data files, performing statistical tests and analyses, and the PSPP command language. The authors thank Network Theory Ltd for financial support in producing this manual.
This document provides a tutorial on pointers and arrays in C. It begins by explaining that a pointer is a variable that holds the address of another variable. This allows a pointer variable to indirectly "point to" another variable in memory. The document covers various uses of pointers, including with arrays, strings, structures, dynamic memory allocation, and functions. It provides many code examples to demonstrate how pointers work in practice.
The document summarizes the M-tree, a new access method for organizing and searching large datasets in metric spaces. The M-tree is a balanced tree that partitions objects based on their relative distances as measured by a distance function, with objects stored in fixed-size nodes. It can index objects using arbitrary distance functions as long as they satisfy the metric properties. The M-tree aims to reduce both the number of accessed nodes and distance computations needed for similarity queries, improving performance for CPU-intensive distance functions. Algorithms for range and k-nearest neighbor queries are described that leverage distance information stored in the M-tree to prune search spaces.
The document proposes an extension to the M-tree family of index structures called M*-tree. M*-tree improves upon M-tree by maintaining a nearest-neighbor graph within each node. The nearest-neighbor graph stores, for each entry in a node, a reference and distance to its nearest neighbor among the other entries in that node. This additional structure allows for more efficient filtering of non-relevant subtrees during search queries through the use of "sacrifice pivots". The experiments showed that M*-tree can perform searches significantly faster than M-tree while keeping construction costs low.
The document describes the PM-tree, a new metric access method that combines the M-tree with pivot-based approaches to improve efficiency of similarity search in multimedia databases. The PM-tree enhances M-tree routing and ground entries by including pivot-based information like hyper-ring regions defined by pivot objects and distances. This reduces the volume of metric regions described by entries, tightly bounding indexed objects and improving retrieval performance. Algorithms for building and querying the PM-tree are presented, showing how pivot distances are used to prune irrelevant regions during search.
c language faq's contains the frequently asked questions in c language and useful for all c programmers. This is an pdf document of Sterve_summit who is one of the best writer for c language
The document defines the User Datagram Protocol (UDP) which provides a minimal datagram mode of communication using the Internet Protocol and allows applications to send messages with minimal overhead, though delivery is not guaranteed like with TCP. UDP uses port numbers and IP addresses in packet headers and optional checksums to provide some protection against misrouted packets. Major applications that use UDP include the Internet Name Server and Trivial File Transfer.
The document provides an overview of the Stream Control Transmission Protocol (SCTP). SCTP is a connection-oriented transport layer protocol that offers reliable data transfer over IP networks. It supports features like multihoming for network fault tolerance, multi-streaming to minimize delay, and congestion control. The document discusses SCTP's architecture, features, security mechanisms, and error handling. It is intended to help application developers write programs using SCTP socket APIs.
This ppt is html for beginners and html made easy for them to get the basic idea of html.
Html for beginners. A basic information of html for beginners. A more depth coverage of html and css will be covered in the future presentations. visit my sites http://technoexplore.blogspot.com and http://hotjobstuff.blogspot.com for some other important presentations.
Here are some interview tips for cracking the interview. During this recession period it is very important.
visit my sites http://technoexplore.blogspot.com and http://hotjobstuff.blogspot.com for some other important presentations.
queue datastructure made easy and datastructure explained in java. visit http://technoexplore.blogspot.com and http://hotjobstuff.blogspot.com for some other important presentations.
Html for beginners. A basic information of html for beginners. A more depth coverage of html and css will be covered in the future presentations. visit my sites http://technoexplore.blogspot.com and http://hotjobstuff.blogspot.com for some other important presentations.
This document introduces binary trees and provides a series of practice problems of increasing difficulty related to binary trees. It begins with an introduction to binary tree structure and terminology. It then provides 14 binary tree problems with descriptions and hints for solving each problem. The problems involve tasks like counting nodes, finding minimum/maximum values, printing trees in different orders, checking for paths with a given sum, and printing all root-to-leaf paths. Sample solutions are provided in subsequent sections in C/C++ and Java languages.
Prim's algorithm is a greedy algorithm used to find minimum spanning trees for weighted undirected graphs. It operates by building the spanning tree one vertex at a time, from an arbitrary starting vertex, at each step adding the minimum weight edge that connects the growing spanning tree to a vertex not yet included in the tree. The algorithm repeats until all vertices are added.
This document provides an introduction and 18 problems related to linked lists of increasing difficulty. It begins with a review of basic linked list code techniques, such as iterating through a list and adding/removing nodes. The problems cover a wide range of skills with pointers and complex algorithms. Though linked lists are not commonly used today, they are excellent for developing skills with complex pointer-based data structures and algorithms. The document provides solutions to all problems to help readers practice and learn.
The server containing programming assignments is located at 10.203.161.7 under the ~/CPP/ directory. The document outlines various C++ programming assignments divided across multiple sessions, including writing classes, operator overloading, inheritance, polymorphism, and more. Assignments involve concepts such as memory management, pass by reference, constructors/destructors, friend functions, and virtual functions.
Details of description part II: Describing images in practice - Tech Forum 2024BookNet Canada
This presentation explores the practical application of image description techniques. Familiar guidelines will be demonstrated in practice, and descriptions will be developed “live”! If you have learned a lot about the theory of image description techniques but want to feel more confident putting them into practice, this is the presentation for you. There will be useful, actionable information for everyone, whether you are working with authors, colleagues, alone, or leveraging AI as a collaborator.
Link to presentation recording and transcript: https://bnctechforum.ca/sessions/details-of-description-part-ii-describing-images-in-practice/
Presented by BookNet Canada on June 25, 2024, with support from the Department of Canadian Heritage.
Paradigm Shifts in User Modeling: A Journey from Historical Foundations to Em...Erasmo Purificato
Slide of the tutorial entitled "Paradigm Shifts in User Modeling: A Journey from Historical Foundations to Emerging Trends" held at UMAP'24: 32nd ACM Conference on User Modeling, Adaptation and Personalization (July 1, 2024 | Cagliari, Italy)
INDIAN AIR FORCE FIGHTER PLANES LIST.pdfjackson110191
These fighter aircraft have uses outside of traditional combat situations. They are essential in defending India's territorial integrity, averting dangers, and delivering aid to those in need during natural calamities. Additionally, the IAF improves its interoperability and fortifies international military alliances by working together and conducting joint exercises with other air forces.
Fluttercon 2024: Showing that you care about security - OpenSSF Scorecards fo...Chris Swan
Have you noticed the OpenSSF Scorecard badges on the official Dart and Flutter repos? It's Google's way of showing that they care about security. Practices such as pinning dependencies, branch protection, required reviews, continuous integration tests etc. are measured to provide a score and accompanying badge.
You can do the same for your projects, and this presentation will show you how, with an emphasis on the unique challenges that come up when working with Dart and Flutter.
The session will provide a walkthrough of the steps involved in securing a first repository, and then what it takes to repeat that process across an organization with multiple repos. It will also look at the ongoing maintenance involved once scorecards have been implemented, and how aspects of that maintenance can be better automated to minimize toil.
What Not to Document and Why_ (North Bay Python 2024)Margaret Fero
We’re hopefully all on board with writing documentation for our projects. However, especially with the rise of supply-chain attacks, there are some aspects of our projects that we really shouldn’t document, and should instead remediate as vulnerabilities. If we do document these aspects of a project, it may help someone compromise the project itself or our users. In this talk, you will learn why some aspects of documentation may help attackers more than users, how to recognize those aspects in your own projects, and what to do when you encounter such an issue.
These are slides as presented at North Bay Python 2024, with one minor modification to add the URL of a tweet screenshotted in the presentation.
MYIR Product Brochure - A Global Provider of Embedded SOMs & SolutionsLinda Zhang
This brochure gives introduction of MYIR Electronics company and MYIR's products and services.
MYIR Electronics Limited (MYIR for short), established in 2011, is a global provider of embedded System-On-Modules (SOMs) and
comprehensive solutions based on various architectures such as ARM, FPGA, RISC-V, and AI. We cater to customers' needs for large-scale production, offering customized design, industry-specific application solutions, and one-stop OEM services.
MYIR, recognized as a national high-tech enterprise, is also listed among the "Specialized
and Special new" Enterprises in Shenzhen, China. Our core belief is that "Our success stems from our customers' success" and embraces the philosophy
of "Make Your Idea Real, then My Idea Realizing!"
Transcript: Details of description part II: Describing images in practice - T...BookNet Canada
This presentation explores the practical application of image description techniques. Familiar guidelines will be demonstrated in practice, and descriptions will be developed “live”! If you have learned a lot about the theory of image description techniques but want to feel more confident putting them into practice, this is the presentation for you. There will be useful, actionable information for everyone, whether you are working with authors, colleagues, alone, or leveraging AI as a collaborator.
Link to presentation recording and slides: https://bnctechforum.ca/sessions/details-of-description-part-ii-describing-images-in-practice/
Presented by BookNet Canada on June 25, 2024, with support from the Department of Canadian Heritage.
How Netflix Builds High Performance Applications at Global ScaleScyllaDB
We all want to build applications that are blazingly fast. We also want to scale them to users all over the world. Can the two happen together? Can users in the slowest of environments also get a fast experience? Learn how we do this at Netflix: how we understand every user's needs and preferences and build high performance applications that work for every user, every time.
For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2024/07/intels-approach-to-operationalizing-ai-in-the-manufacturing-sector-a-presentation-from-intel/
Tara Thimmanaik, AI Systems and Solutions Architect at Intel, presents the “Intel’s Approach to Operationalizing AI in the Manufacturing Sector,” tutorial at the May 2024 Embedded Vision Summit.
AI at the edge is powering a revolution in industrial IoT, from real-time processing and analytics that drive greater efficiency and learning to predictive maintenance. Intel is focused on developing tools and assets to help domain experts operationalize AI-based solutions in their fields of expertise.
In this talk, Thimmanaik explains how Intel’s software platforms simplify labor-intensive data upload, labeling, training, model optimization and retraining tasks. She shows how domain experts can quickly build vision models for a wide range of processes—detecting defective parts on a production line, reducing downtime on the factory floor, automating inventory management and other digitization and automation projects. And she introduces Intel-provided edge computing assets that empower faster localized insights and decisions, improving labor productivity through easy-to-use AI tools that democratize AI.
Hire a private investigator to get cell phone recordsHackersList
Learn what private investigators can legally do to obtain cell phone records and track phones, plus ethical considerations and alternatives for addressing privacy concerns.
Interaction Latency: Square's User-Centric Mobile Performance MetricScyllaDB
Mobile performance metrics often take inspiration from the backend world and measure resource usage (CPU usage, memory usage, etc) and workload durations (how long a piece of code takes to run).
However, mobile apps are used by humans and the app performance directly impacts their experience, so we should primarily track user-centric mobile performance metrics. Following the lead of tech giants, the mobile industry at large is now adopting the tracking of app launch time and smoothness (jank during motion).
At Square, our customers spend most of their time in the app long after it's launched, and they don't scroll much, so app launch time and smoothness aren't critical metrics. What should we track instead?
This talk will introduce you to Interaction Latency, a user-centric mobile performance metric inspired from the Web Vital metric Interaction to Next Paint"" (web.dev/inp). We'll go over why apps need to track this, how to properly implement its tracking (it's tricky!), how to aggregate this metric and what thresholds you should target.
Performance Budgets for the Real World by Tammy EvertsScyllaDB
Performance budgets have been around for more than ten years. Over those years, we’ve learned a lot about what works, what doesn’t, and what we need to improve. In this session, Tammy revisits old assumptions about performance budgets and offers some new best practices. Topics include:
• Understanding performance budgets vs. performance goals
• Aligning budgets with user experience
• Pros and cons of Core Web Vitals
• How to stay on top of your budgets to fight regressions
Quantum Communications Q&A with Gemini LLM. These are based on Shannon's Noisy channel Theorem and offers how the classical theory applies to the quantum world.
Implementations of Fused Deposition Modeling in real worldEmerging Tech
The presentation showcases the diverse real-world applications of Fused Deposition Modeling (FDM) across multiple industries:
1. **Manufacturing**: FDM is utilized in manufacturing for rapid prototyping, creating custom tools and fixtures, and producing functional end-use parts. Companies leverage its cost-effectiveness and flexibility to streamline production processes.
2. **Medical**: In the medical field, FDM is used to create patient-specific anatomical models, surgical guides, and prosthetics. Its ability to produce precise and biocompatible parts supports advancements in personalized healthcare solutions.
3. **Education**: FDM plays a crucial role in education by enabling students to learn about design and engineering through hands-on 3D printing projects. It promotes innovation and practical skill development in STEM disciplines.
4. **Science**: Researchers use FDM to prototype equipment for scientific experiments, build custom laboratory tools, and create models for visualization and testing purposes. It facilitates rapid iteration and customization in scientific endeavors.
5. **Automotive**: Automotive manufacturers employ FDM for prototyping vehicle components, tooling for assembly lines, and customized parts. It speeds up the design validation process and enhances efficiency in automotive engineering.
6. **Consumer Electronics**: FDM is utilized in consumer electronics for designing and prototyping product enclosures, casings, and internal components. It enables rapid iteration and customization to meet evolving consumer demands.
7. **Robotics**: Robotics engineers leverage FDM to prototype robot parts, create lightweight and durable components, and customize robot designs for specific applications. It supports innovation and optimization in robotic systems.
8. **Aerospace**: In aerospace, FDM is used to manufacture lightweight parts, complex geometries, and prototypes of aircraft components. It contributes to cost reduction, faster production cycles, and weight savings in aerospace engineering.
9. **Architecture**: Architects utilize FDM for creating detailed architectural models, prototypes of building components, and intricate designs. It aids in visualizing concepts, testing structural integrity, and communicating design ideas effectively.
Each industry example demonstrates how FDM enhances innovation, accelerates product development, and addresses specific challenges through advanced manufacturing capabilities.
4. 1
Beej’s Guide to Network Programming Using Internet Sockets
1. Intro
Hey! Socket programming got you down? Is this stuff just a little too difficult to figure out
from the man pages? You want to do cool Internet programming, but you don’t have time to wade
through a gob of structs trying to figure out if you have to call bind() before you connect(),
etc., etc.
Well, guess what! I’ve already done this nasty business, and I’m dying to share the information
with everyone! You’ve come to the right place. This document should give the average competent
C programmer the edge s/he needs to get a grip on this networking noise.
1.1. Audience
This document has been written as a tutorial, not a reference. It is probably at its best when read
by individuals who are just starting out with socket programming and are looking for a foothold.
It is certainly not the complete guide to sockets programming, by any means.
Hopefully, though, it’ll be just enough for those man pages to start making sense... :-)
1.2. Platform and Compiler
The code contained within this document was compiled on a Linux PC using Gnu’s gcc
compiler. It should, however, build on just about any platform that uses gcc. Naturally, this doesn’t
apply if you’re programming for Windows–see the section on Windows programming, below.
1.3. Official Homepage
This official location of this document is http://beej.us/guide/bgnet/.
1.4. Note for Solaris/SunOS Programmers
When compiling for Solaris or SunOS, you need to specify some extra command-line switches
for linking in the proper libraries. In order to do this, simply add “-lnsl -lsocket -lresolv”
to the end of the compile command, like so:
$ cc -o server server.c -lnsl -lsocket -lresolv
If you still get errors, you could try further adding a “-lxnet” to the end of that command
line. I don’t know what that does, exactly, but some people seem to need it.
Another place that you might find problems is in the call to setsockopt(). The prototype
differs from that on my Linux box, so instead of:
int yes=1;
enter this:
char yes=’1’;
As I don’t have a Sun box, I haven’t tested any of the above information–it’s just what people
have told me through email.
1.5. Note for Windows Programmers
I have a particular dislike for Windows, and encourage you to try Linux, BSD, or Unix instead.
That being said, you can still use this stuff under Windows.
5. 2
Beej’s Guide to Network Programming Using Internet Sockets
First, ignore pretty much all of the system header files I mention in here. All you need to
include is:
#include <winsock.h>
Wait! You also have to make a call to WSAStartup() before doing anything else with the
sockets library. The code to do that looks something like this:
#include <winsock.h>
{
WSADATA wsaData; // if this doesn’t work
//WSAData wsaData; // then try this instead
if (WSAStartup(MAKEWORD(1, 1), &wsaData) != 0) {
fprintf(stderr, quot;WSAStartup failed.nquot;);
exit(1);
}
You also have to tell your compiler to link in the Winsock library, usually called wsock32.lib
or winsock32.lib or somesuch. Under VC++, this can be done through the Project menu, under
Settings.... Click the Link tab, and look for the box titled “Object/library modules”. Add
“wsock32.lib” to that list.
Or so I hear.
Finally, you need to call WSACleanup() when you’re all through with the sockets library. See
your online help for details.
Once you do that, the rest of the examples in this tutorial should generally apply, with a few ex-
ceptions. For one thing, you can’t use close() to close a socket–you need to use closesocket(),
instead. Also, select() only works with socket descriptors, not file descriptors (like 0 for stdin).
There is also a socket class that you can use, CSocket. Check your compilers help pages for
more information.
To get more information about Winsock, read the Winsock FAQ1 and go from there.
Finally, I hear that Windows has no fork() system call which is, unfortunately, used in some
of my examples. Maybe you have to link in a POSIX library or something to get it to work, or
you can use CreateProcess() instead. fork() takes no arguments, and CreateProcess()
takes about 48 billion arguments. If you’re not up to that, the CreateThread() is a little easier
to digest...unfortunately a discussion about multithreading is beyond the scope of this document. I
can only talk about so much, you know!
1.6. Email Policy
I’m generally available to help out with email questions so feel free to write in, but I can’t
guarantee a response. I lead a pretty busy life and there are times when I just can’t answer a
question you have. When that’s the case, I usually just delete the message. It’s nothing personal; I
just won’t ever have the time to give the detailed answer you require.
As a rule, the more complex the question, the less likely I am to respond. If you can narrow
down your question before mailing it and be sure to include any pertinent information (like platform,
compiler, error messages you’re getting, and anything else you think might help me troubleshoot),
you’re much more likely to get a response. For more pointers, read ESR’s document, How To Ask
Questions The Smart Way2.
1
http://tangentsoft.net/wskfaq/
2
http://www.catb.org/~esr/faqs/smart-questions.html
7. 4
Beej’s Guide to Network Programming Using Internet Sockets
2. What is a socket?
You hear talk of “sockets” all the time, and perhaps you are wondering just what they are
exactly. Well, they’re this: a way to speak to other programs using standard Unix file descriptors.
What?
Ok–you may have heard some Unix hacker state, “Jeez, everything in Unix is a file!” What
that person may have been talking about is the fact that when Unix programs do any sort of I/O,
they do it by reading or writing to a file descriptor. A file descriptor is simply an integer associated
with an open file. But (and here’s the catch), that file can be a network connection, a FIFO, a pipe,
a terminal, a real on-the-disk file, or just about anything else. Everything in Unix is a file! So when
you want to communicate with another program over the Internet you’re gonna do it through a file
descriptor, you’d better believe it.
“Where do I get this file descriptor for network communication, Mr. Smarty-Pants?” is
probably the last question on your mind right now, but I’m going to answer it anyway: You make
a call to the socket() system routine. It returns the socket descriptor, and you communicate
through it using the specialized send() and recv() (man send3, man recv4) socket calls.
“But, hey!” you might be exclaiming right about now. “If it’s a file descriptor, why in the
name of Neptune can’t I just use the normal read() and write() calls to communicate through
the socket?” The short answer is, “You can!” The longer answer is, “You can, but send() and
recv() offer much greater control over your data transmission.”
What next? How about this: there are all kinds of sockets. There are DARPA Internet
addresses (Internet Sockets), path names on a local node (Unix Sockets), CCITT X.25 addresses
(X.25 Sockets that you can safely ignore), and probably many others depending on which Unix
flavor you run. This document deals only with the first: Internet Sockets.
2.1. Two Types of Internet Sockets
What’s this? There are two types of Internet sockets? Yes. Well, no. I’m lying. There are
more, but I didn’t want to scare you. I’m only going to talk about two types here. Except for this
sentence, where I’m going to tell you that “Raw Sockets” are also very powerful and you should
look them up.
All right, already. What are the two types? One is “Stream Sockets”; the other is “Datagram
Sockets”, which may hereafter be referred to as “SOCK_STREAM” and “SOCK_DGRAM”, respec-
tively. Datagram sockets are sometimes called “connectionless sockets”. (Though they can be
connect()’d if you really want. See connect(), below.)
Stream sockets are reliable two-way connected communication streams. If you output two
items into the socket in the order “1, 2”, they will arrive in the order “1, 2” at the opposite end.
They will also be error free. Any errors you do encounter are figments of your own deranged mind,
and are not to be discussed here.
What uses stream sockets? Well, you may have heard of the telnet application, yes? It uses
stream sockets. All the characters you type need to arrive in the same order you type them, right?
Also, web browsers use the HTTP protocol which uses stream sockets to get pages. Indeed, if you
telnet to a web site on port 80, and type “GET / HTTP/1.0” and hit RETURN twice, it’ll dump
the HTML back at you!
3
http://man.linuxquestions.org/index.php?query=send§ion=2&type=2
4
http://man.linuxquestions.org/index.php?query=recv§ion=2&type=2
8. 5
Beej’s Guide to Network Programming Using Internet Sockets
How do stream sockets achieve this high level of data transmission quality? They use a
protocol called “The Transmission Control Protocol”, otherwise known as “TCP” (see RFC-7935
for extremely detailed info on TCP.) TCP makes sure your data arrives sequentially and error-free.
You may have heard “TCP” before as the better half of “TCP/IP” where “IP” stands for “Internet
Protocol” (see RFC-7916.) IP deals primarily with Internet routing and is not generally responsible
for data integrity.
Cool. What about Datagram sockets? Why are they called connectionless? What is the deal,
here, anyway? Why are they unreliable? Well, here are some facts: if you send a datagram, it may
arrive. It may arrive out of order. If it arrives, the data within the packet will be error-free.
Datagram sockets also use IP for routing, but they don’t use TCP; they use the “User Datagram
Protocol”, or “UDP” (see RFC-7687.)
Why are they connectionless? Well, basically, it’s because you don’t have to maintain an
open connection as you do with stream sockets. You just build a packet, slap an IP header on it
with destination information, and send it out. No connection needed. They are generally used for
packet-by-packet transfers of information. Sample applications: tftp, bootp, etc.
“Enough!” you may scream. “How do these programs even work if datagrams might get
lost?!” Well, my human friend, each has it’s own protocol on top of UDP. For example, the tftp
protocol says that for each packet that gets sent, the recipient has to send back a packet that says, “I
got it!” (an “ACK” packet.) If the sender of the original packet gets no reply in, say, five seconds,
he’ll re-transmit the packet until he finally gets an ACK. This acknowledgment procedure is very
important when implementing SOCK_DGRAM applications.
2.2. Low level Nonsense and Network Theory
Since I just mentioned layering of protocols, it’s time to talk about how networks really work,
and to show some examples of how SOCK_DGRAM packets are built. Practically, you can probably
skip this section. It’s good background, however.
Data Encapsulation.
Hey, kids, it’s time to learn about Data Encapsulation! This is very very important. It’s so
important that you might just learn about it if you take the networks course here at Chico State ;-).
Basically, it says this: a packet is born, the packet is wrapped (“encapsulated”) in a header (and
rarely a footer) by the first protocol (say, the TFTP protocol), then the whole thing (TFTP header
included) is encapsulated again by the next protocol (say, UDP), then again by the next (IP), then
again by the final protocol on the hardware (physical) layer (say, Ethernet).
When another computer receives the packet, the hardware strips the Ethernet header, the kernel
strips the IP and UDP headers, the TFTP program strips the TFTP header, and it finally has the
data.
5
http://www.rfc-editor.org/rfc/rfc793.txt
6
http://www.rfc-editor.org/rfc/rfc791.txt
7
http://www.rfc-editor.org/rfc/rfc768.txt
9. 6
Beej’s Guide to Network Programming Using Internet Sockets
Now I can finally talk about the infamous Layered Network Model. This Network Model
describes a system of network functionality that has many advantages over other models. For
instance, you can write sockets programs that are exactly the same without caring how the data is
physically transmitted (serial, thin Ethernet, AUI, whatever) because programs on lower levels deal
with it for you. The actual network hardware and topology is transparent to the socket programmer.
Without any further ado, I’ll present the layers of the full-blown model. Remember this for
network class exams:
• Application
• Presentation
• Session
• Transport
• Network
• Data Link
• Physical
The Physical Layer is the hardware (serial, Ethernet, etc.). The Application Layer is just
about as far from the physical layer as you can imagine–it’s the place where users interact with the
network.
Now, this model is so general you could probably use it as an automobile repair guide if you
really wanted to. A layered model more consistent with Unix might be:
• Application Layer (telnet, ftp, etc.)
• Host-to-Host Transport Layer (TCP, UDP)
• Internet Layer (IP and routing)
• Network Access Layer (Ethernet, ATM, or whatever)
At this point in time, you can probably see how these layers correspond to the encapsulation
of the original data.
See how much work there is in building a simple packet? Jeez! And you have to type in the
packet headers yourself using “cat”! Just kidding. All you have to do for stream sockets is send()
the data out. All you have to do for datagram sockets is encapsulate the packet in the method of
your choosing and sendto() it out. The kernel builds the Transport Layer and Internet Layer on
for you and the hardware does the Network Access Layer. Ah, modern technology.
So ends our brief foray into network theory. Oh yes, I forgot to tell you everything I wanted
to say about routing: nothing! That’s right, I’m not going to talk about it at all. The router strips
the packet to the IP header, consults its routing table, blah blah blah. Check out the IP RFC8 if you
really really care. If you never learn about it, well, you’ll live.
8
http://www.rfc-editor.org/rfc/rfc791.txt
10. 7
Beej’s Guide to Network Programming Using Internet Sockets
3. structs and Data Handling
Well, we’re finally here. It’s time to talk about programming. In this section, I’ll cover various
data types used by the sockets interface, since some of them are a real bear to figure out.
First the easy one: a socket descriptor. A socket descriptor is the following type:
int
Just a regular int.
Things get weird from here, so just read through and bear with me. Know this: there are two
byte orderings: most significant byte (sometimes called an “octet”) first, or least significant byte
first. The former is called “Network Byte Order”. Some machines store their numbers internally
in Network Byte Order, some don’t. When I say something has to be in Network Byte Order, you
have to call a function (such as htons()) to change it from “Host Byte Order”. If I don’t say
“Network Byte Order”, then you must leave the value in Host Byte Order.
(For the curious, “Network Byte Order” is also known as “Big-Endian Byte Order”.)
My First StructTM–struct sockaddr. This structure holds socket address information for
many types of sockets:
struct sockaddr {
unsigned short sa_family; // address family, AF_xxx
char sa_data[14]; // 14 bytes of protocol address
};
sa_family can be a variety of things, but it’ll be AF_INET for everything we do in this
document. sa_data contains a destination address and port number for the socket. This is rather
unwieldy since you don’t want to tediously pack the address in the sa_data by hand.
To deal with struct sockaddr, programmers created a parallel structure: struct sock-
addr_in (“in” for “Internet”.)
struct sockaddr_in {
short int sin_family; // Address family
unsigned short int sin_port; // Port number
struct in_addr sin_addr; // Internet address
unsigned char sin_zero[8]; // Same size as struct sockaddr
};
This structure makes it easy to reference elements of the socket address. Note that sin_zero
(which is included to pad the structure to the length of a struct sockaddr) should be set to
all zeros with the function memset(). Also, and this is the important bit, a pointer to a struct
sockaddr_in can be cast to a pointer to a struct sockaddr and vice-versa. So even though
connect() wants a struct sockaddr*, you can still use a struct sockaddr_in and cast it at
the last minute! Also, notice that sin_family corresponds to sa_family in a struct sockaddr
and should be set to “AF_INET”. Finally, the sin_port and sin_addr must be in Network Byte
Order!
“But,” you object, “how can the entire structure, struct in_addr sin_addr, be in Network
Byte Order?” This question requires careful examination of the structure struct in_addr, one
of the worst unions alive:
// Internet address (a structure for historical reasons)
11. 8
Beej’s Guide to Network Programming Using Internet Sockets
struct in_addr {
unsigned long s_addr; // that’s a 32-bit long, or 4 bytes
};
Well, it used to be a union, but now those days seem to be gone. Good riddance. So if you have
declared ina to be of type struct sockaddr_in, then ina.sin_addr.s_addr references the
4-byte IP address (in Network Byte Order). Note that even if your system still uses the God-awful
union for struct in_addr, you can still reference the 4-byte IP address in exactly the same way
as I did above (this due to #defines.)
3.1. Convert the Natives!
We’ve now been lead right into the next section. There’s been too much talk about this Network
to Host Byte Order conversion–now is the time for action!
All righty. There are two types that you can convert: short (two bytes) and long (four bytes).
These functions work for the unsigned variations as well. Say you want to convert a short from
Host Byte Order to Network Byte Order. Start with “h” for “host”, follow it with “to”, then “n” for
“network”, and “s” for “short”: h-to-n-s, or htons() (read: “Host to Network Short”).
It’s almost too easy...
You can use every combination of “n”, “h”, “s”, and “l” you want, not counting the really
stupid ones. For example, there is NOT a stolh() (“Short to Long Host”) function–not at this
party, anyway. But there are:
• htons() – “Host to Network Short”
• htonl() – “Host to Network Long”
• ntohs() – “Network to Host Short”
• ntohl() – “Network to Host Long”
Now, you may think you’re wising up to this. You might think, “What do I do if I have to
change byte order on a char?” Then you might think, “Uh, never mind.” You might also think
that since your 68000 machine already uses network byte order, you don’t have to call htonl()
on your IP addresses. You would be right, BUT if you try to port to a machine that has reverse
network byte order, your program will fail. Be portable! This is a Unix world! (As much as Bill
Gates would like to think otherwise.) Remember: put your bytes in Network Byte Order before
you put them on the network.
A final point: why do sin_addr and sin_port need to be in Network Byte Order in a
struct sockaddr_in, but sin_family does not? The answer: sin_addr and sin_port get
encapsulated in the packet at the IP and UDP layers, respectively. Thus, they must be in Network
Byte Order. However, the sin_family field is only used by the kernel to determine what type of
address the structure contains, so it must be in Host Byte Order. Also, since sin_family does not
get sent out on the network, it can be in Host Byte Order.
3.2. IP Addresses and How to Deal With Them
Fortunately for you, there are a bunch of functions that allow you to manipulate IP addresses.
No need to figure them out by hand and stuff them in a long with the << operator.
First, let’s say you have a struct sockaddr_in ina, and you have an IP address
“10.12.110.57” that you want to store into it. The function you want to use, inet_addr(),
12. 9
Beej’s Guide to Network Programming Using Internet Sockets
converts an IP address in numbers-and-dots notation into an unsigned long. The assignment can
be made as follows:
ina.sin_addr.s_addr = inet_addr(quot;10.12.110.57quot;);
Notice that inet_addr() returns the address in Network Byte Order already–you don’t have
to call htonl(). Swell!
Now, the above code snippet isn’t very robust because there is no error checking. See,
inet_addr() returns -1 on error. Remember binary numbers? (unsigned)-1 just happens
to correspond to the IP address 255.255.255.255! That’s the broadcast address! Wrongo.
Remember to do your error checking properly.
Actually, there’s a cleaner interface you can use instead of inet_addr(): it’s called
inet_aton() (“aton” means “ascii to network”):
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
int inet_aton(const char *cp, struct in_addr *inp);
And here’s a sample usage, while packing a struct sockaddr_in (this example will make
more sense to you when you get to the sections on bind() and connect().)
struct sockaddr_in my_addr;
my_addr.sin_family = AF_INET; // host byte order
my_addr.sin_port = htons(MYPORT); // short, network byte order
inet_aton(quot;10.12.110.57quot;, &(my_addr.sin_addr));
memset(&(my_addr.sin_zero), ’0’, 8); // zero the rest of the struct
inet_aton(), unlike practically every other socket-related function, returns non-zero on
success, and zero on failure. And the address is passed back in inp.
Unfortunately, not all platforms implement inet_aton() so, although its use is preferred, the
older more common inet_addr() is used in this guide.
All right, now you can convert string IP addresses to their binary representations. What about
the other way around? What if you have a struct in_addr and you want to print it in numbers-
and-dots notation? In this case, you’ll want to use the function inet_ntoa() (“ntoa” means
“network to ascii”) like this:
printf(quot;%squot;, inet_ntoa(ina.sin_addr));
That will print the IP address. Note that inet_ntoa() takes a struct in_addr as an
argument, not a long. Also notice that it returns a pointer to a char. This points to a statically
stored char array within inet_ntoa() so that each time you call inet_ntoa() it will overwrite
the last IP address you asked for. For example:
char *a1, *a2;
13. 10
Beej’s Guide to Network Programming Using Internet Sockets
a1 = inet_ntoa(ina1.sin_addr); // this is 192.168.4.14
a2 = inet_ntoa(ina2.sin_addr); // this is 10.12.110.57
printf(quot;address 1: %snquot;,a1);
printf(quot;address 2: %snquot;,a2);
will print:
address 1: 10.12.110.57
address 2: 10.12.110.57
If you need to save the address, strcpy() it to your own character array.
That’s all on this topic for now. Later, you’ll learn to convert a string like “whitehouse.gov”
into its corresponding IP address (see DNS, below.)
3.2.1: Private (Or Disconnected) Networks
Lots of places have a firewall that hides the network from the rest of the world for their
own protection. And often times, the firewall translates “internal” IP addresses to “external” (that
everyone else in the world knows) IP addresses using a process called Network Address Translation,
or NAT.
Are you getting nervous yet? “Where’s he going with all this weird stuff?”
Well, relax and buy yourself a drink, because as a beginner, you don’t even have to worry
about NAT, since it’s done for you transparently. But I wanted to talk about the network behind the
firewall in case you started getting confused by the network numbers you were seeing.
For instance, I have a firewall at home. I have two static IP addresses allocated to me by
the DSL company, and yet I have seven computers on the network. How is this possible? Two
computers can’t share the same IP address, or else the data wouldn’t know which one to go to!
The answer is: they don’t share the same IP addresses. They are on a private network with 24
million IP addresses allocated to it. They are all just for me. Well, all for me as far as anyone else
is concerned. Here’s what’s happening:
If I log into a remote computer, it tells me I’m logged in from 64.81.52.10 (not my real IP).
But if I ask my local computer what it’s IP address is, it says 10.0.0.5. Who is translating the IP
address from one to the other? That’s right, the firewall! It’s doing NAT!
10.x.x.x is one of a few reserved networks that are only to be used either on fully disconnected
networks, or on networks that are behind firewalls. The details of which private network numbers
are available for you to use are outlined in RFC 19189, but some common ones you’ll see are
10.x.x.x and 192.168.x.x, where x is 0-255, generally. Less common is 172.y.x.x, where y goes
between 16 and 31.
Networks behind a NATing firewall don’t need to be on one of these reserved networks, but
they commonly are.
9
ftp://ftp.rfc-editor.org/in-notes/rfc1918.txt
14. 11
Beej’s Guide to Network Programming Using Internet Sockets
4. System Calls or Bust
This is the section where we get into the system calls that allow you to access the network
functionality of a Unix box. When you call one of these functions, the kernel takes over and does
all the work for you automagically.
The place most people get stuck around here is what order to call these things in. In that, the
man pages are no use, as you’ve probably discovered. Well, to help with that dreadful situation,
I’ve tried to lay out the system calls in the following sections in exactly (approximately) the same
order that you’ll need to call them in your programs.
That, coupled with a few pieces of sample code here and there, some milk and cookies (which
I fear you will have to supply yourself), and some raw guts and courage, and you’ll be beaming
data around the Internet like the Son of Jon Postel!
4.1. socket()–Get the File Descriptor!
I guess I can put it off no longer–I have to talk about the socket() system call. Here’s the
breakdown:
#include <sys/types.h>
#include <sys/socket.h>
int socket(int domain, int type, int protocol);
But what are these arguments? First, domain should be set to “PF_INET”. Next, the type
argument tells the kernel what kind of socket this is: SOCK_STREAM or SOCK_DGRAM. Finally, just
set protocol to “0” to have socket() choose the correct protocol based on the type. (Notes:
there are many more domains than I’ve listed. There are many more types than I’ve listed. See
the socket() man page. Also, there’s a “better” way to get the protocol, but specifying 0 works
in 99.9% of all cases. See the getprotobyname() man page if you’re curious.)
socket() simply returns to you a socket descriptor that you can use in later system calls, or
-1 on error. The global variable errno is set to the error’s value (see the perror() man page.)
(This PF_INET thing is a close relative of the AF_INET that you used when initializing the
sin_family field in your struct sockaddr_in. In fact, they’re so closely related that they
actually have the same value, and many programmers will call socket() and pass AF_INET as
the first argument instead of PF_INET. Now, get some milk and cookies, because it’s times for
a story. Once upon a time, a long time ago, it was thought that maybe a address family (what
the “AF” in “AF_INET” stands for) might support several protocols that were referred to by their
protocol family (what the “PF” in “PF_INET” stands for). That didn’t happen. And they all lived
happily ever after, The End. So the most correct thing to do is to use AF_INET in your struct
sockaddr_in and PF_INET in your call to socket().)
Fine, fine, fine, but what good is this socket? The answer is that it’s really no good by itself,
and you need to read on and make more system calls for it to make any sense.
4.2. bind()–What port am I on?
Once you have a socket, you might have to associate that socket with a port on your local
machine. (This is commonly done if you’re going to listen() for incoming connections on a
specific port–MUDs do this when they tell you to “telnet to x.y.z port 6969”.) The port number is
15. 12
Beej’s Guide to Network Programming Using Internet Sockets
used by the kernel to match an incoming packet to a certain process’s socket descriptor. If you’re
going to only be doing a connect(), this may be unnecessary. Read it anyway, just for kicks.
Here is the synopsis for the bind() system call:
#include <sys/types.h>
#include <sys/socket.h>
int bind(int sockfd, struct sockaddr *my_addr, int addrlen);
sockfd is the socket file descriptor returned by socket(). my_addr is a pointer to a struct
sockaddr that contains information about your address, namely, port and IP address. addrlen
can be set to sizeof(struct sockaddr).
Whew. That’s a bit to absorb in one chunk. Let’s have an example:
#include <string.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#define MYPORT 3490
main()
{
int sockfd;
struct sockaddr_in my_addr;
sockfd = socket(PF_INET, SOCK_STREAM, 0); // do some error checking!
my_addr.sin_family = AF_INET; // host byte order
my_addr.sin_port = htons(MYPORT); // short, network byte order
my_addr.sin_addr.s_addr = inet_addr(quot;10.12.110.57quot;);
memset(&(my_addr.sin_zero), ’0’, 8); // zero the rest of the struct
// don’t forget your error checking for bind():
bind(sockfd, (struct sockaddr *)&my_addr, sizeof(struct sockaddr));
.
.
There are a few things to notice here: my_addr.sin_port is in Network Byte Order. So is
my_addr.sin_addr.s_addr. Another thing to watch out for is that the header files might differ
from system to system. To be sure, you should check your local man pages.
Lastly, on the topic of bind(), I should mention that some of the process of getting your own
IP address and/or port can be automated:
my_addr.sin_port = 0; // choose an unused port at random
my_addr.sin_addr.s_addr = INADDR_ANY; // use my IP address
See, by setting my_addr.sin_port to zero, you are telling bind() to choose the port for
you. Likewise, by setting my_addr.sin_addr.s_addr to INADDR_ANY, you are telling it to
automatically fill in the IP address of the machine the process is running on.
If you are into noticing little things, you might have seen that I didn’t put INADDR_ANY into
Network Byte Order! Naughty me. However, I have inside info: INADDR_ANY is really zero! Zero
still has zero on bits even if you rearrange the bytes. However, purists will point out that there
could be a parallel dimension where INADDR_ANY is, say, 12 and that my code won’t work there.
That’s ok with me:
my_addr.sin_port = htons(0); // choose an unused port at random
16. 13
Beej’s Guide to Network Programming Using Internet Sockets
my_addr.sin_addr.s_addr = htonl(INADDR_ANY); // use my IP address
Now we’re so portable you probably wouldn’t believe it. I just wanted to point that out, since
most of the code you come across won’t bother running INADDR_ANY through htonl().
bind() also returns -1 on error and sets errno to the error’s value.
Another thing to watch out for when calling bind(): don’t go underboard with your port
numbers. All ports below 1024 are RESERVED (unless you’re the superuser)! You can have any
port number above that, right up to 65535 (provided they aren’t already being used by another
program.)
Sometimes, you might notice, you try to rerun a server and bind() fails, claiming “Address
already in use.” What does that mean? Well, a little bit of a socket that was connected is still
hanging around in the kernel, and it’s hogging the port. You can either wait for it to clear (a minute
or so), or add code to your program allowing it to reuse the port, like this:
int yes=1;
//char yes=’1’; // Solaris people use this
// lose the pesky quot;Address already in usequot; error message
if (setsockopt(listener,SOL_SOCKET,SO_REUSEADDR,&yes,sizeof(int)) == -1) {
perror(quot;setsockoptquot;);
exit(1);
}
One small extra final note about bind(): there are times when you won’t absolutely have to
call it. If you are connect()ing to a remote machine and you don’t care what your local port is (as
is the case with telnet where you only care about the remote port), you can simply call connect(),
it’ll check to see if the socket is unbound, and will bind() it to an unused local port if necessary.
4.3. connect()–Hey, you!
Let’s just pretend for a few minutes that you’re a telnet application. Your user commands you
(just like in the movie TRON) to get a socket file descriptor. You comply and call socket(). Next,
the user tells you to connect to “10.12.110.57” on port “23” (the standard telnet port.) Yow!
What do you do now?
Lucky for you, program, you’re now perusing the section on connect()–how to connect to a
remote host. So read furiously onward! No time to lose!
The connect() call is as follows:
#include <sys/types.h>
#include <sys/socket.h>
int connect(int sockfd, struct sockaddr *serv_addr, int addrlen);
sockfd is our friendly neighborhood socket file descriptor, as returned by the socket() call,
serv_addr is a struct sockaddr containing the destination port and IP address, and addrlen
can be set to sizeof(struct sockaddr).
Isn’t this starting to make more sense? Let’s have an example:
#include <string.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
17. 14
Beej’s Guide to Network Programming Using Internet Sockets
#define DEST_IP quot;10.12.110.57quot;
#define DEST_PORT 23
main()
{
int sockfd;
struct sockaddr_in dest_addr; // will hold the destination addr
sockfd = socket(PF_INET, SOCK_STREAM, 0); // do some error checking!
dest_addr.sin_family = AF_INET; // host byte order
dest_addr.sin_port = htons(DEST_PORT); // short, network byte order
dest_addr.sin_addr.s_addr = inet_addr(DEST_IP);
memset(&(dest_addr.sin_zero), ’0’, 8); // zero the rest of the struct
// don’t forget to error check the connect()!
connect(sockfd, (struct sockaddr *)&dest_addr, sizeof(struct sockaddr));
.
.
Again, be sure to check the return value from connect()–it’ll return -1 on error and set the
variable errno.
Also, notice that we didn’t call bind(). Basically, we don’t care about our local port number;
we only care where we’re going (the remote port). The kernel will choose a local port for us, and
the site we connect to will automatically get this information from us. No worries.
4.4. listen()–Will somebody please call me?
Ok, time for a change of pace. What if you don’t want to connect to a remote host. Say, just for
kicks, that you want to wait for incoming connections and handle them in some way. The process
is two step: first you listen(), then you accept() (see below.)
The listen call is fairly simple, but requires a bit of explanation:
int listen(int sockfd, int backlog);
sockfd is the usual socket file descriptor from the socket() system call. backlog is the
number of connections allowed on the incoming queue. What does that mean? Well, incoming
connections are going to wait in this queue until you accept() them (see below) and this is the
limit on how many can queue up. Most systems silently limit this number to about 20; you can
probably get away with setting it to 5 or 10.
Again, as per usual, listen() returns -1 and sets errno on error.
Well, as you can probably imagine, we need to call bind() before we call listen() or the
kernel will have us listening on a random port. Bleah! So if you’re going to be listening for
incoming connections, the sequence of system calls you’ll make is:
socket();
bind();
listen();
/* accept() goes here */
I’ll just leave that in the place of sample code, since it’s fairly self-explanatory. (The code in
the accept() section, below, is more complete.) The really tricky part of this whole sha-bang is
the call to accept().
4.5. accept()–“Thank you for calling port 3490.”
Get ready–the accept() call is kinda weird! What’s going to happen is this: someone far
far away will try to connect() to your machine on a port that you are listen()ing on. Their
18. 15
Beej’s Guide to Network Programming Using Internet Sockets
connection will be queued up waiting to be accept()ed. You call accept() and you tell it to get
the pending connection. It’ll return to you a brand new socket file descriptor to use for this single
connection! That’s right, suddenly you have two socket file descriptors for the price of one! The
original one is still listening on your port and the newly created one is finally ready to send() and
recv(). We’re there!
The call is as follows:
#include <sys/types.h>
#include <sys/socket.h>
int accept(int sockfd, struct sockaddr *addr, socklen_t *addrlen);
sockfd is the listen()ing socket descriptor. Easy enough. addr will usually be a pointer to
a local struct sockaddr_in. This is where the information about the incoming connection will
go (and with it you can determine which host is calling you from which port). addrlen is a local
integer variable that should be set to sizeof(struct sockaddr_in) before its address is passed
to accept(). Accept will not put more than that many bytes into addr. If it puts fewer in, it’ll
change the value of addrlen to reflect that.
Guess what? accept() returns -1 and sets errno if an error occurs. Betcha didn’t figure that.
Like before, this is a bunch to absorb in one chunk, so here’s a sample code fragment for your
perusal:
#include <string.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#define MYPORT 3490 // the port users will be connecting to
#define BACKLOG 10 // how many pending connections queue will hold
main()
{
int sockfd, new_fd; // listen on sock_fd, new connection on new_fd
struct sockaddr_in my_addr; // my address information
struct sockaddr_in their_addr; // connector’s address information
int sin_size;
sockfd = socket(PF_INET, SOCK_STREAM, 0); // do some error checking!
my_addr.sin_family = AF_INET; // host byte order
my_addr.sin_port = htons(MYPORT); // short, network byte order
my_addr.sin_addr.s_addr = INADDR_ANY; // auto-fill with my IP
memset(&(my_addr.sin_zero), ’0’, 8); // zero the rest of the struct
// don’t forget your error checking for these calls:
bind(sockfd, (struct sockaddr *)&my_addr, sizeof(struct sockaddr));
listen(sockfd, BACKLOG);
sin_size = sizeof(struct sockaddr_in);
new_fd = accept(sockfd, (struct sockaddr *)&their_addr, &sin_size);
.
19. 16
Beej’s Guide to Network Programming Using Internet Sockets
.
Again, note that we will use the socket descriptor new_fd for all send() and recv() calls. If
you’re only getting one single connection ever, you can close() the listening sockfd in order to
prevent more incoming connections on the same port, if you so desire.
4.6. send() and recv()–Talk to me, baby!
These two functions are for communicating over stream sockets or connected datagram sockets.
If you want to use regular unconnected datagram sockets, you’ll need to see the section on sendto()
and recvfrom(), below.
The send() call:
int send(int sockfd, const void *msg, int len, int flags);
sockfd is the socket descriptor you want to send data to (whether it’s the one returned by
socket() or the one you got with accept().) msg is a pointer to the data you want to send, and
len is the length of that data in bytes. Just set flags to 0. (See the send() man page for more
information concerning flags.)
Some sample code might be:
char *msg = quot;Beej was here!quot;;
int len, bytes_sent;
.
.
len = strlen(msg);
bytes_sent = send(sockfd, msg, len, 0);
.
send() returns the number of bytes actually sent out–this might be less than the number you
told it to send! See, sometimes you tell it to send a whole gob of data and it just can’t handle it.
It’ll fire off as much of the data as it can, and trust you to send the rest later. Remember, if the value
returned by send() doesn’t match the value in len, it’s up to you to send the rest of the string.
The good news is this: if the packet is small (less than 1K or so) it will probably manage to send
the whole thing all in one go. Again, -1 is returned on error, and errno is set to the error number.
The recv() call is similar in many respects:
int recv(int sockfd, void *buf, int len, unsigned int flags);
sockfd is the socket descriptor to read from, buf is the buffer to read the information into,
len is the maximum length of the buffer, and flags can again be set to 0. (See the recv() man
page for flag information.)
recv() returns the number of bytes actually read into the buffer, or -1 on error (with errno
set, accordingly.)
Wait! recv() can return 0. This can mean only one thing: the remote side has closed the
connection on you! A return value of 0 is recv()’s way of letting you know this has occurred.
There, that was easy, wasn’t it? You can now pass data back and forth on stream sockets!
Whee! You’re a Unix Network Programmer!
4.7. sendto() and recvfrom()–Talk to me, DGRAM-style
“This is all fine and dandy,” I hear you saying, “but where does this leave me with unconnected
datagram sockets?” No problemo, amigo. We have just the thing.
20. 17
Beej’s Guide to Network Programming Using Internet Sockets
Since datagram sockets aren’t connected to a remote host, guess which piece of information
we need to give before we send a packet? That’s right! The destination address! Here’s the scoop:
int sendto(int sockfd, const void *msg, int len, unsigned int flags,
const struct sockaddr *to, socklen_t tolen);
As you can see, this call is basically the same as the call to send() with the addition of two
other pieces of information. to is a pointer to a struct sockaddr (which you’ll probably have as
a struct sockaddr_in and cast it at the last minute) which contains the destination IP address
and port. tolen, an int deep-down, can simply be set to sizeof(struct sockaddr).
Just like with send(), sendto() returns the number of bytes actually sent (which, again,
might be less than the number of bytes you told it to send!), or -1 on error.
Equally similar are recv() and recvfrom(). The synopsis of recvfrom() is:
int recvfrom(int sockfd, void *buf, int len, unsigned int flags,
struct sockaddr *from, int *fromlen);
Again, this is just like recv() with the addition of a couple fields. from is a pointer to a
local struct sockaddr that will be filled with the IP address and port of the originating machine.
fromlen is a pointer to a local int that should be initialized to sizeof(struct sockaddr).
When the function returns, fromlen will contain the length of the address actually stored in from.
recvfrom() returns the number of bytes received, or -1 on error (with errno set accordingly.)
Remember, if you connect() a datagram socket, you can then simply use send() and recv()
for all your transactions. The socket itself is still a datagram socket and the packets still use UDP,
but the socket interface will automatically add the destination and source information for you.
4.8. close() and shutdown()–Get outta my face!
Whew! You’ve been send()ing and recv()ing data all day long, and you’ve had it. You’re
ready to close the connection on your socket descriptor. This is easy. You can just use the regular
Unix file descriptor close() function:
close(sockfd);
This will prevent any more reads and writes to the socket. Anyone attempting to read or write
the socket on the remote end will receive an error.
Just in case you want a little more control over how the socket closes, you can use the
shutdown() function. It allows you to cut off communication in a certain direction, or both ways
(just like close() does.) Synopsis:
int shutdown(int sockfd, int how);
sockfd is the socket file descriptor you want to shutdown, and how is one of the following:
• 0 – Further receives are disallowed
• 1 – Further sends are disallowed
• 2 – Further sends and receives are disallowed (like close())
21. 18
Beej’s Guide to Network Programming Using Internet Sockets
shutdown() returns 0 on success, and -1 on error (with errno set accordingly.)
If you deign to use shutdown() on unconnected datagram sockets, it will simply make the
socket unavailable for further send() and recv() calls (remember that you can use these if you
connect() your datagram socket.)
It’s important to note that shutdown() doesn’t actually close the file descriptor–it just changes
its usability. To free a socket descriptor, you need to use close().
Nothing to it.
4.9. getpeername()–Who are you?
This function is so easy.
It’s so easy, I almost didn’t give it it’s own section. But here it is anyway.
The function getpeername() will tell you who is at the other end of a connected stream
socket. The synopsis:
#include <sys/socket.h>
int getpeername(int sockfd, struct sockaddr *addr, int *addrlen);
sockfd is the descriptor of the connected stream socket, addr is a pointer to a struct
sockaddr (or a struct sockaddr_in) that will hold the information about the other side of the
connection, and addrlen is a pointer to an int, that should be initialized to sizeof(struct
sockaddr).
The function returns -1 on error and sets errno accordingly.
Once you have their address, you can use inet_ntoa() or gethostbyaddr() to print or get
more information. No, you can’t get their login name. (Ok, ok. If the other computer is running
an ident daemon, this is possible. This, however, is beyond the scope of this document. Check out
RFC-141310 for more info.)
4.10. gethostname()–Who am I?
Even easier than getpeername() is the function gethostname(). It returns the name of the
computer that your program is running on. The name can then be used by gethostbyname(),
below, to determine the IP address of your local machine.
What could be more fun? I could think of a few things, but they don’t pertain to socket
programming. Anyway, here’s the breakdown:
#include <unistd.h>
int gethostname(char *hostname, size_t size);
The arguments are simple: hostname is a pointer to an array of chars that will contain the
hostname upon the function’s return, and size is the length in bytes of the hostname array.
The function returns 0 on successful completion, and -1 on error, setting errno as usual.
4.11. DNS–You say “whitehouse.gov”, I say “63.161.169.137”
In case you don’t know what DNS is, it stands for “Domain Name Service”. In a nutshell, you
tell it what the human-readable address is for a site, and it’ll give you the IP address (so you can use
10
http://www.rfc-editor.org/rfc/rfc1413.txt
22. 19
Beej’s Guide to Network Programming Using Internet Sockets
it with bind(), connect(), sendto(), or whatever you need it for.) This way, when someone
enters:
$ telnet whitehouse.gov
telnet can find out that it needs to connect() to “63.161.169.137”.
But how does it work? You’ll be using the function gethostbyname():
#include <netdb.h>
struct hostent *gethostbyname(const char *name);
As you see, it returns a pointer to a struct hostent, the layout of which is as follows:
struct hostent {
char *h_name;
char **h_aliases;
int h_addrtype;
int h_length;
char **h_addr_list;
};
#define h_addr h_addr_list[0]
And here are the descriptions of the fields in the struct hostent:
• h_name – Official name of the host.
• h_aliases – A NULL-terminated array of alternate names for the host.
• h_addrtype – The type of address being returned; usually AF_INET.
• h_length – The length of the address in bytes.
• h_addr_list – A zero-terminated array of network addresses for the host. Host addresses
are in Network Byte Order.
• h_addr – The first address in h_addr_list.
gethostbyname() returns a pointer to the filled struct hostent, or NULL on error. (But
errno is not set–h_errno is set instead. See herror(), below.)
But how is it used? Sometimes (as we find from reading computer manuals), just spewing the
information at the reader is not enough. This function is certainly easier to use than it looks.
Here’s an example program11:
/*
** getip.c -- a hostname lookup demo
*/
#include <stdio.h>
#include <stdlib.h>
#include <errno.h>
#include <netdb.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
int main(int argc, char *argv[])
{
struct hostent *h;
11
http://beej.us/guide/bgnet/examples/getip.c
23. 20
Beej’s Guide to Network Programming Using Internet Sockets
if (argc != 2) { // error check the command line
fprintf(stderr,quot;usage: getip addressnquot;);
exit(1);
}
if ((h=gethostbyname(argv[1])) == NULL) { // get the host info
herror(quot;gethostbynamequot;);
exit(1);
}
printf(quot;Host name : %snquot;, h->h_name);
printf(quot;IP Address : %snquot;, inet_ntoa(*((struct in_addr *)h->h_addr)));
return 0;
}
With gethostbyname(), you can’t use perror() to print error message (since errno is not
used). Instead, call herror().
It’s pretty straightforward. You simply pass the string that contains the machine name (“white-
house.gov”) to gethostbyname(), and then grab the information out of the returned struct
hostent.
The only possible weirdness might be in the printing of the IP address, above. h->h_addr
is a char*, but inet_ntoa() wants a struct in_addr passed to it. So I cast h->h_addr to a
struct in_addr*, then dereference it to get at the data.
24. 21
Beej’s Guide to Network Programming Using Internet Sockets
5. Client-Server Background
It’s a client-server world, baby. Just about everything on the network deals with client processes
talking to server processes and vice-versa. Take telnet, for instance. When you connect to a remote
host on port 23 with telnet (the client), a program on that host (called telnetd, the server) springs
to life. It handles the incoming telnet connection, sets you up with a login prompt, etc.
Client-Server Interaction.
The exchange of information between client and server is summarized in Figure 2.
Note that the client-server pair can speak SOCK_STREAM, SOCK_DGRAM, or anything else (as long
as they’re speaking the same thing.) Some good examples of client-server pairs are telnet/telnetd,
ftp/ftpd, or bootp/bootpd. Every time you use ftp, there’s a remote program, ftpd, that serves
you.
Often, there will only be one server on a machine, and that server will handle multiple clients
using fork(). The basic routine is: server will wait for a connection, accept() it, and fork() a
child process to handle it. This is what our sample server does in the next section.
5.1. A Simple Stream Server
All this server does is send the string “Hello, World!n” out over a stream connection. All
you need to do to test this server is run it in one window, and telnet to it from another with:
$ telnet remotehostname 3490
where remotehostname is the name of the machine you’re running it on.
The server code12: (Note: a trailing backslash on a line means that the line is continued on the
next.)
/*
** server.c -- a stream socket server demo
*/
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <errno.h>
#include <string.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <sys/wait.h>
#include <signal.h>
12
http://beej.us/guide/bgnet/examples/server.c
25. 22
Beej’s Guide to Network Programming Using Internet Sockets
#define MYPORT 3490 // the port users will be connecting to
#define BACKLOG 10 // how many pending connections queue will hold
void sigchld_handler(int s)
{
while(waitpid(-1, NULL, WNOHANG) > 0);
}
int main(void)
{
int sockfd, new_fd; // listen on sock_fd, new connection on new_fd
struct sockaddr_in my_addr; // my address information
struct sockaddr_in their_addr; // connector’s address information
socklen_t sin_size;
struct sigaction sa;
int yes=1;
if ((sockfd = socket(PF_INET, SOCK_STREAM, 0)) == -1) {
perror(quot;socketquot;);
exit(1);
}
if (setsockopt(sockfd,SOL_SOCKET,SO_REUSEADDR,&yes,sizeof(int)) == -1) {
perror(quot;setsockoptquot;);
exit(1);
}
my_addr.sin_family = AF_INET; // host byte order
my_addr.sin_port = htons(MYPORT); // short, network byte order
my_addr.sin_addr.s_addr = INADDR_ANY; // automatically fill with my IP
memset(&(my_addr.sin_zero), ’0’, 8); // zero the rest of the struct
if (bind(sockfd, (struct sockaddr *)&my_addr, sizeof(struct sockaddr))
== -1) {
perror(quot;bindquot;);
exit(1);
}
if (listen(sockfd, BACKLOG) == -1) {
perror(quot;listenquot;);
exit(1);
}
sa.sa_handler = sigchld_handler; // reap all dead processes
sigemptyset(&sa.sa_mask);
sa.sa_flags = SA_RESTART;
if (sigaction(SIGCHLD, &sa, NULL) == -1) {
perror(quot;sigactionquot;);
exit(1);
}
while(1) { // main accept() loop
sin_size = sizeof(struct sockaddr_in);
if ((new_fd = accept(sockfd, (struct sockaddr *)&their_addr,
&sin_size)) == -1) {
perror(quot;acceptquot;);
continue;
}
printf(quot;server: got connection from %snquot;,
inet_ntoa(their_addr.sin_addr));
if (!fork()) { // this is the child process
close(sockfd); // child doesn’t need the listener
if (send(new_fd, quot;Hello, world!nquot;, 14, 0) == -1)
perror(quot;sendquot;);
close(new_fd);
26. 23
Beej’s Guide to Network Programming Using Internet Sockets
exit(0);
}
close(new_fd); // parent doesn’t need this
}
return 0;
}
In case you’re curious, I have the code in one big main() function for (I feel) syntactic clarity.
Feel free to split it into smaller functions if it makes you feel better.
(Also, this whole sigaction() thing might be new to you–that’s ok. The code that’s there is
responsible for reaping zombie processes that appear as the fork()ed child processes exit. If you
make lots of zombies and don’t reap them, your system administrator will become agitated.)
You can get the data from this server by using the client listed in the next section.
5.2. A Simple Stream Client
This guy’s even easier than the server. All this client does is connect to the host you specify
on the command line, port 3490. It gets the string that the server sends.
The client source13:
/*
** client.c -- a stream socket client demo
*/
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <errno.h>
#include <string.h>
#include <netdb.h>
#include <sys/types.h>
#include <netinet/in.h>
#include <sys/socket.h>
#define PORT 3490 // the port client will be connecting to
#define MAXDATASIZE 100 // max number of bytes we can get at once
int main(int argc, char *argv[])
{
int sockfd, numbytes;
char buf[MAXDATASIZE];
struct hostent *he;
struct sockaddr_in their_addr; // connector’s address information
if (argc != 2) {
fprintf(stderr,quot;usage: client hostnamenquot;);
exit(1);
}
if ((he=gethostbyname(argv[1])) == NULL) { // get the host info
herror(quot;gethostbynamequot;);
exit(1);
}
if ((sockfd = socket(PF_INET, SOCK_STREAM, 0)) == -1) {
perror(quot;socketquot;);
exit(1);
}
13
http://beej.us/guide/bgnet/examples/client.c
27. 24
Beej’s Guide to Network Programming Using Internet Sockets
their_addr.sin_family = AF_INET; // host byte order
their_addr.sin_port = htons(PORT); // short, network byte order
their_addr.sin_addr = *((struct in_addr *)he->h_addr);
memset(&(their_addr.sin_zero), ’0’, 8); // zero the rest of the struct
if (connect(sockfd, (struct sockaddr *)&their_addr,
sizeof(struct sockaddr)) == -1) {
perror(quot;connectquot;);
exit(1);
}
if ((numbytes=recv(sockfd, buf, MAXDATASIZE-1, 0)) == -1) {
perror(quot;recvquot;);
exit(1);
}
buf[numbytes] = ’0’;
printf(quot;Received: %squot;,buf);
close(sockfd);
return 0;
}
Notice that if you don’t run the server before you run the client, connect() returns “Connection
refused”. Very useful.
5.3. Datagram Sockets
I really don’t have that much to talk about here, so I’ll just present a couple of sample programs:
talker.c and listener.c.
listener sits on a machine waiting for an incoming packet on port 4950. talker sends a packet
to that port, on the specified machine, that contains whatever the user enters on the command line.
Here is the source for listener.c14:
/*
** listener.c -- a datagram sockets quot;serverquot; demo
*/
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <errno.h>
#include <string.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#define MYPORT 4950 // the port users will be connecting to
#define MAXBUFLEN 100
int main(void)
{
int sockfd;
struct sockaddr_in my_addr; // my address information
struct sockaddr_in their_addr; // connector’s address information
socklen_t addr_len;
int numbytes;
char buf[MAXBUFLEN];
14
http://beej.us/guide/bgnet/examples/listener.c
28. 25
Beej’s Guide to Network Programming Using Internet Sockets
if ((sockfd = socket(PF_INET, SOCK_DGRAM, 0)) == -1) {
perror(quot;socketquot;);
exit(1);
}
my_addr.sin_family = AF_INET; // host byte order
my_addr.sin_port = htons(MYPORT); // short, network byte order
my_addr.sin_addr.s_addr = INADDR_ANY; // automatically fill with my IP
memset(&(my_addr.sin_zero), ’0’, 8); // zero the rest of the struct
if (bind(sockfd, (struct sockaddr *)&my_addr,
sizeof(struct sockaddr)) == -1) {
perror(quot;bindquot;);
exit(1);
}
addr_len = sizeof(struct sockaddr);
if ((numbytes=recvfrom(sockfd, buf, MAXBUFLEN-1 , 0,
(struct sockaddr *)&their_addr, &addr_len)) == -1) {
perror(quot;recvfromquot;);
exit(1);
}
printf(quot;got packet from %snquot;,inet_ntoa(their_addr.sin_addr));
printf(quot;packet is %d bytes longnquot;,numbytes);
buf[numbytes] = ’0’;
printf(quot;packet contains quot;%squot;nquot;,buf);
close(sockfd);
return 0;
}
Notice that in our call to socket() we’re finally using SOCK_DGRAM. Also, note that there’s no
need to listen() or accept(). This is one of the perks of using unconnected datagram sockets!
Next comes the source for talker.c15:
/*
** talker.c -- a datagram quot;clientquot; demo
*/
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <errno.h>
#include <string.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <netdb.h>
#define SERVERPORT 4950 // the port users will be connecting to
int main(int argc, char *argv[])
{
int sockfd;
struct sockaddr_in their_addr; // connector’s address information
struct hostent *he;
int numbytes;
if (argc != 3) {
fprintf(stderr,quot;usage: talker hostname messagenquot;);
exit(1);
15
http://beej.us/guide/bgnet/examples/talker.c
29. 26
Beej’s Guide to Network Programming Using Internet Sockets
}
if ((he=gethostbyname(argv[1])) == NULL) { // get the host info
perror(quot;gethostbynamequot;);
exit(1);
}
if ((sockfd = socket(AF_INET, SOCK_DGRAM, 0)) == -1) {
perror(quot;socketquot;);
exit(1);
}
their_addr.sin_family = AF_INET; // host byte order
their_addr.sin_port = htons(SERVERPORT); // short, network byte order
their_addr.sin_addr = *((struct in_addr *)he->h_addr);
memset(&(their_addr.sin_zero), ’0’, 8); // zero the rest of the struct
if ((numbytes = sendto(sockfd, argv[2], strlen(argv[2]), 0,
(struct sockaddr *)&their_addr, sizeof(struct sockaddr))) == -1) {
perror(quot;sendtoquot;);
exit(1);
}
printf(quot;sent %d bytes to %snquot;, numbytes, inet_ntoa(their_addr.sin_addr));
close(sockfd);
return 0;
}
And that’s all there is to it! Run listener on some machine, then run talker on another. Watch
them communicate! Fun G-rated excitement for the entire nuclear family!
Except for one more tiny detail that I’ve mentioned many times in the past: connected datagram
sockets. I need to talk about this here, since we’re in the datagram section of the document. Let’s
say that talker calls connect() and specifies the listener’s address. From that point on, talker
may only sent to and receive from the address specified by connect(). For this reason, you don’t
have to use sendto() and recvfrom(); you can simply use send() and recv().
30. 27
Beej’s Guide to Network Programming Using Internet Sockets
6. Slightly Advanced Techniques
These aren’t really advanced, but they’re getting out of the more basic levels we’ve already
covered. In fact, if you’ve gotten this far, you should consider yourself fairly accomplished in the
basics of Unix network programming! Congratulations!
So here we go into the brave new world of some of the more esoteric things you might want to
learn about sockets. Have at it!
6.1. Blocking
Blocking. You’ve heard about it–now what the heck is it? In a nutshell, “block” is techie jargon
for “sleep”. You probably noticed that when you run listener, above, it just sits there until a packet
arrives. What happened is that it called recvfrom(), there was no data, and so recvfrom() is
said to “block” (that is, sleep there) until some data arrives.
Lots of functions block. accept() blocks. All the recv() functions block. The reason
they can do this is because they’re allowed to. When you first create the socket descriptor with
socket(), the kernel sets it to blocking. If you don’t want a socket to be blocking, you have to
make a call to fcntl():
#include <unistd.h>
#include <fcntl.h>
.
.
sockfd = socket(PF_INET, SOCK_STREAM, 0);
fcntl(sockfd, F_SETFL, O_NONBLOCK);
.
By setting a socket to non-blocking, you can effectively “poll” the socket for information. If
you try to read from a non-blocking socket and there’s no data there, it’s not allowed to block–it
will return -1 and errno will be set to EWOULDBLOCK.
Generally speaking, however, this type of polling is a bad idea. If you put your program in a
busy-wait looking for data on the socket, you’ll suck up CPU time like it was going out of style. A
more elegant solution for checking to see if there’s data waiting to be read comes in the following
section on select().
6.2. select()–Synchronous I/O Multiplexing
This function is somewhat strange, but it’s very useful. Take the following situation: you are a
server and you want to listen for incoming connections as well as keep reading from the connections
you already have.
No problem, you say, just an accept() and a couple of recv()s. Not so fast, buster! What if
you’re blocking on an accept() call? How are you going to recv() data at the same time? “Use
non-blocking sockets!” No way! You don’t want to be a CPU hog. What, then?
select() gives you the power to monitor several sockets at the same time. It’ll tell you which
ones are ready for reading, which are ready for writing, and which sockets have raised exceptions,
if you really want to know that.
Without any further ado, I’ll offer the synopsis of select():
#include <sys/time.h>
#include <sys/types.h>
#include <unistd.h>
31. 28
Beej’s Guide to Network Programming Using Internet Sockets
int select(int numfds, fd_set *readfds, fd_set *writefds,
fd_set *exceptfds, struct timeval *timeout);
The function monitors “sets” of file descriptors; in particular readfds, writefds, and ex-
ceptfds. If you want to see if you can read from standard input and some socket descriptor,
sockfd, just add the file descriptors 0 and sockfd to the set readfds. The parameter numfds
should be set to the values of the highest file descriptor plus one. In this example, it should be set
to sockfd+1, since it is assuredly higher than standard input (0).
When select() returns, readfds will be modified to reflect which of the file descriptors you
selected which is ready for reading. You can test them with the macro FD_ISSET(), below.
Before progressing much further, I’ll talk about how to manipulate these sets. Each set is of
the type fd_set. The following macros operate on this type:
• FD_ZERO(fd_set *set) – clears a file descriptor set
• FD_SET(int fd, fd_set *set) – adds fd to the set
• FD_CLR(int fd, fd_set *set) – removes fd from the set
• FD_ISSET(int fd, fd_set *set) – tests to see if fd is in the set
Finally, what is this weirded out struct timeval? Well, sometimes you don’t want to wait
forever for someone to send you some data. Maybe every 96 seconds you want to print “Still
Going...” to the terminal even though nothing has happened. This time structure allows you to
specify a timeout period. If the time is exceeded and select() still hasn’t found any ready file
descriptors, it’ll return so you can continue processing.
The struct timeval has the follow fields:
struct timeval {
int tv_sec; // seconds
int tv_usec; // microseconds
};
Just set tv_sec to the number of seconds to wait, and set tv_usec to the number of mi-
croseconds to wait. Yes, that’s microseconds, not milliseconds. There are 1,000 microseconds in
a millisecond, and 1,000 milliseconds in a second. Thus, there are 1,000,000 microseconds in a
second. Why is it “usec”? The “u” is supposed to look like the Greek letter µ (Mu) that we use
for “micro”. Also, when the function returns, timeout might be updated to show the time still
remaining. This depends on what flavor of Unix you’re running.
Yay! We have a microsecond resolution timer! Well, don’t count on it. Standard Unix timeslice
is around 100 milliseconds, so you might have to wait that long no matter how small you set your
struct timeval.
Other things of interest: If you set the fields in your struct timeval to 0, select() will
timeout immediately, effectively polling all the file descriptors in your sets. If you set the parameter
timeout to NULL, it will never timeout, and will wait until the first file descriptor is ready. Finally,
if you don’t care about waiting for a certain set, you can just set it to NULL in the call to select().
The following code snippet16 waits 2.5 seconds for something to appear on standard input:
/*
** select.c -- a select() demo
*/
16
http://beej.us/guide/bgnet/examples/select.c
32. 29
Beej’s Guide to Network Programming Using Internet Sockets
#include <stdio.h>
#include <sys/time.h>
#include <sys/types.h>
#include <unistd.h>
#define STDIN 0 // file descriptor for standard input
int main(void)
{
struct timeval tv;
fd_set readfds;
tv.tv_sec = 2;
tv.tv_usec = 500000;
FD_ZERO(&readfds);
FD_SET(STDIN, &readfds);
// don’t care about writefds and exceptfds:
select(STDIN+1, &readfds, NULL, NULL, &tv);
if (FD_ISSET(STDIN, &readfds))
printf(quot;A key was pressed!nquot;);
else
printf(quot;Timed out.nquot;);
return 0;
}
If you’re on a line buffered terminal, the key you hit should be RETURN or it will time out
anyway.
Now, some of you might think this is a great way to wait for data on a datagram socket–and
you are right: it might be. Some Unices can use select in this manner, and some can’t. You should
see what your local man page says on the matter if you want to attempt it.
Some Unices update the time in your struct timeval to reflect the amount of time still
remaining before a timeout. But others do not. Don’t rely on that occurring if you want to be
portable. (Use gettimeofday() if you need to track time elapsed. It’s a bummer, I know, but
that’s the way it is.)
What happens if a socket in the read set closes the connection? Well, in that case, select()
returns with that socket descriptor set as “ready to read”. When you actually do recv() from it,
recv() will return 0. That’s how you know the client has closed the connection.
One more note of interest about select(): if you have a socket that is listen()ing, you can
check to see if there is a new connection by putting that socket’s file descriptor in the readfds set.
And that, my friends, is a quick overview of the almighty select() function.
But, by popular demand, here is an in-depth example. Unfortunately, the difference between
the dirt-simple example, above, and this one here is significant. But have a look, then read the
description that follows it.
This program17 acts like a simple multi-user chat server. Start it running in one window, then
telnet to it (“telnet hostname 9034”) from multiple other windows. When you type something in
one telnet session, it should appear in all the others.
/*
** selectserver.c -- a cheezy multiperson chat server
*/
17
http://beej.us/guide/bgnet/examples/selectserver.c
33. 30
Beej’s Guide to Network Programming Using Internet Sockets
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#define PORT 9034 // port we’re listening on
int main(void)
{
fd_set master; // master file descriptor list
fd_set read_fds; // temp file descriptor list for select()
struct sockaddr_in myaddr; // server address
struct sockaddr_in remoteaddr; // client address
int fdmax; // maximum file descriptor number
int listener; // listening socket descriptor
int newfd; // newly accept()ed socket descriptor
char buf[256]; // buffer for client data
int nbytes;
int yes=1; // for setsockopt() SO_REUSEADDR, below
socklen_t addrlen;
int i, j;
FD_ZERO(&master); // clear the master and temp sets
FD_ZERO(&read_fds);
// get the listener
if ((listener = socket(PF_INET, SOCK_STREAM, 0)) == -1) {
perror(quot;socketquot;);
exit(1);
}
// lose the pesky quot;address already in usequot; error message
if (setsockopt(listener, SOL_SOCKET, SO_REUSEADDR, &yes,
sizeof(int)) == -1) {
perror(quot;setsockoptquot;);
exit(1);
}
// bind
myaddr.sin_family = AF_INET;
myaddr.sin_addr.s_addr = INADDR_ANY;
myaddr.sin_port = htons(PORT);
memset(&(myaddr.sin_zero), ’0’, 8);
if (bind(listener, (struct sockaddr *)&myaddr, sizeof(myaddr)) == -1) {
perror(quot;bindquot;);
exit(1);
}
// listen
if (listen(listener, 10) == -1) {
perror(quot;listenquot;);
exit(1);
}
// add the listener to the master set
FD_SET(listener, &master);
// keep track of the biggest file descriptor
fdmax = listener; // so far, it’s this one
// main loop
for(;;) {
read_fds = master; // copy it
34. 31
Beej’s Guide to Network Programming Using Internet Sockets
if (select(fdmax+1, &read_fds, NULL, NULL, NULL) == -1) {
perror(quot;selectquot;);
exit(1);
}
// run through the existing connections looking for data to read
for(i = 0; i <= fdmax; i++) {
if (FD_ISSET(i, &read_fds)) { // we got one!!
if (i == listener) {
// handle new connections
addrlen = sizeof(remoteaddr);
if ((newfd = accept(listener, (struct sockaddr *)&remoteaddr,
&addrlen)) == -1) {
perror(quot;acceptquot;);
} else {
FD_SET(newfd, &master); // add to master set
if (newfd > fdmax) { // keep track of the maximum
fdmax = newfd;
}
printf(quot;selectserver: new connection from %s on quot;
quot;socket %dnquot;, inet_ntoa(remoteaddr.sin_addr), newfd);
}
} else {
// handle data from a client
if ((nbytes = recv(i, buf, sizeof(buf), 0)) <= 0) {
// got error or connection closed by client
if (nbytes == 0) {
// connection closed
printf(quot;selectserver: socket %d hung upnquot;, i);
} else {
perror(quot;recvquot;);
}
close(i); // bye!
FD_CLR(i, &master); // remove from master set
} else {
// we got some data from a client
for(j = 0; j <= fdmax; j++) {
// send to everyone!
if (FD_ISSET(j, &master)) {
// except the listener and ourselves
if (j != listener && j != i) {
if (send(j, buf, nbytes, 0) == -1) {
perror(quot;sendquot;);
}
}
}
}
}
} // it’s SO UGLY!
}
}
}
return 0;
}
Notice I have two file descriptor sets in the code: master and read_fds. The first, master,
holds all the socket descriptors that are currently connected, as well as the socket descriptor that is
listening for new connections.
The reason I have the master set is that select() actually changes the set you pass into it to
reflect which sockets are ready to read. Since I have to keep track of the connections from one call
of select() to the next, I must store these safely away somewhere. At the last minute, I copy the
master into the read_fds, and then call select().
35. 32
Beej’s Guide to Network Programming Using Internet Sockets
But doesn’t this mean that every time I get a new connection, I have to add it to the master
set? Yup! And every time a connection closes, I have to remove it from the master set? Yes, it
does.
Notice I check to see when the listener socket is ready to read. When it is, it means I have a
new connection pending, and I accept() it and add it to the master set. Similarly, when a client
connection is ready to read, and recv() returns 0, I know the client has closed the connection, and
I must remove it from the master set.
If the client recv() returns non-zero, though, I know some data has been received. So I get it,
and then go through the master list and send that data to all the rest of the connected clients.
And that, my friends, is a less-than-simple overview of the almighty select() function.
6.3. Handling Partial send()s
Remember back in the section about send(), above, when I said that send() might not send
all the bytes you asked it to? That is, you want it to send 512 bytes, but it returns 412. What
happened to the remaining 100 bytes?
Well, they’re still in your little buffer waiting to be sent out. Due to circumstances beyond your
control, the kernel decided not to send all the data out in one chunk, and now, my friend, it’s up to
you to get the data out there.
You could write a function like this to do it, too:
#include <sys/types.h>
#include <sys/socket.h>
int sendall(int s, char *buf, int *len)
{
int total = 0; // how many bytes we’ve sent
int bytesleft = *len; // how many we have left to send
int n;
while(total < *len) {
n = send(s, buf+total, bytesleft, 0);
if (n == -1) { break; }
total += n;
bytesleft -= n;
}
*len = total; // return number actually sent here
return n==-1?-1:0; // return -1 on failure, 0 on success
}
In this example, s is the socket you want to send the data to, buf is the buffer containing the
data, and len is a pointer to an int containing the number of bytes in the buffer.
The function returns -1 on error (and errno is still set from the call to send().) Also, the
number of bytes actually sent is returned in len. This will be the same number of bytes you asked
it to send, unless there was an error. sendall() will do it’s best, huffing and puffing, to send the
data out, but if there’s an error, it gets back to you right away.
For completeness, here’s a sample call to the function:
char buf[10] = quot;Beej!quot;;
int len;