From patchwork Sun Oct 25 09:36:47 2020 Content-Type: text/plain; charset="utf-8" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit X-Patchwork-Submitter: Alejandro Colomar X-Patchwork-Id: 40860 Return-Path: X-Original-To: patchwork@sourceware.org Delivered-To: patchwork@sourceware.org Received: from server2.sourceware.org (localhost [IPv6:::1]) by sourceware.org (Postfix) with ESMTP id 3532E3877021; Sun, 25 Oct 2020 09:37:20 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 3532E3877021 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=sourceware.org; s=default; t=1603618640; bh=7YzaZ8g+9Me2W3OhhJNjRksjTTLuR4CJc0EX3VfDJFA=; h=To:Subject:Date:In-Reply-To:References:List-Id:List-Unsubscribe: List-Archive:List-Post:List-Help:List-Subscribe:From:Reply-To:Cc: From; b=t+UbpRyifggZp9jB1vPAbMhOr1qpy3px502ei9i9BrZpQdsLFzxg/KUocmDNZtNTY omjG5P32/v5L/fvDFNu1hn5R0MJYWjjGSh9H6/pywrQNqmCO9nHdyUIZ4Kv1GMGllv bVP8crtrKJECsogTUJhaN0jxLUy2KIez3gZrwfyE= X-Original-To: libc-alpha@sourceware.org Delivered-To: libc-alpha@sourceware.org Received: from mail-wm1-x332.google.com (mail-wm1-x332.google.com [IPv6:2a00:1450:4864:20::332]) by sourceware.org (Postfix) with ESMTPS id 00C9A383F86C for ; Sun, 25 Oct 2020 09:37:17 +0000 (GMT) DMARC-Filter: OpenDMARC Filter v1.3.2 sourceware.org 00C9A383F86C Received: by mail-wm1-x332.google.com with SMTP id c16so9072854wmd.2 for ; Sun, 25 Oct 2020 02:37:17 -0700 (PDT) X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:from:to:cc:subject:date:message-id:in-reply-to :references:mime-version:content-transfer-encoding; bh=7YzaZ8g+9Me2W3OhhJNjRksjTTLuR4CJc0EX3VfDJFA=; b=bqx+rVsA6db9b765rT6SkjP9DH7VxnEAbuZZCpoTjICkmSTUoB3a7OFEQ/LjkUi7tv RqaRtHx56pzV/uIoB0z1o3C8eHPOsdkQ0ycQYVQ1QIeaDBujFIvd6T2rpchzjfuhb7fk 0pxaHVnCZ6pvPQbCuZms2L6PNqlnB90f0c7eabHEQNIOcIl+Hd+DKW46XByEA/D0pWLB nQZxnkJGBfD0cTocNjd6WahnKgefK4zXs0zbWV3mGYd48zByKljsemlfMyCkjmZ7vvG5 Mh0a+EheXgJg8tcQLgn0rHPd4eszU1Jr+9lhnvKzXm0Bz2cpG7mpdMyndCh6zb4s9ErW Qdlw== X-Gm-Message-State: AOAM5311AlX3uJP2pfnAMJFz4SZnwAyePtfJooyQYQSNtlhN1UNLqWXX 9jqOCjYL3KovHWKjF2EV7D8xfPJJs7I= X-Google-Smtp-Source: ABdhPJxahUAdeqUDV8pzfhBzWMCYVTCYNrsOly29sHuNfgdt5/FnvTfgvqnT+lawLjulv9PgRm1WMA== X-Received: by 2002:a7b:c113:: with SMTP id w19mr11322785wmi.25.1603618637055; Sun, 25 Oct 2020 02:37:17 -0700 (PDT) Received: from localhost.localdomain ([170.253.60.68]) by smtp.googlemail.com with ESMTPSA id m8sm15776446wrw.17.2020.10.25.02.37.15 (version=TLS1_3 cipher=TLS_AES_256_GCM_SHA384 bits=256/256); Sun, 25 Oct 2020 02:37:16 -0700 (PDT) To: mtk.manpages@gmail.com Subject: [PATCH 05/10] queue.3, tailq.3: EXAMPLES: Move code from queue.3 to tailq.3 Date: Sun, 25 Oct 2020 10:36:47 +0100 Message-Id: <20201025093651.4616-6-colomar.6.4.3@gmail.com> X-Mailer: git-send-email 2.28.0 In-Reply-To: <20201025093651.4616-1-colomar.6.4.3@gmail.com> References: <20201025093651.4616-1-colomar.6.4.3@gmail.com> MIME-Version: 1.0 X-Spam-Status: No, score=-11.3 required=5.0 tests=BAYES_00, DKIM_SIGNED, DKIM_VALID, DKIM_VALID_AU, DKIM_VALID_EF, FREEMAIL_ENVFROM_END_DIGIT, FREEMAIL_FROM, GIT_PATCH_0, KAM_NUMSUBJECT, RCVD_IN_DNSWL_NONE, SPF_HELO_NONE, SPF_PASS, TXREP autolearn=ham autolearn_force=no version=3.4.2 X-Spam-Checker-Version: SpamAssassin 3.4.2 (2018-09-13) on server2.sourceware.org X-BeenThere: libc-alpha@sourceware.org X-Mailman-Version: 2.1.29 Precedence: list List-Id: Libc-alpha mailing list List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-Patchwork-Original-From: Alejandro Colomar via Libc-alpha From: Alejandro Colomar Reply-To: Alejandro Colomar Cc: Alejandro Colomar , linux-man@vger.kernel.org, libc-alpha@sourceware.org Errors-To: libc-alpha-bounces@sourceware.org Sender: "Libc-alpha" Signed-off-by: Alejandro Colomar --- man3/queue.3 | 56 ---------------------------------------------------- man3/tailq.3 | 56 ++++++++++++++++++++++++++++++++++++++++++++++++++++ 2 files changed, 56 insertions(+), 56 deletions(-) diff --git a/man3/queue.3 b/man3/queue.3 index f6e3b9369..4c597e123 100644 --- a/man3/queue.3 +++ b/man3/queue.3 @@ -170,62 +170,6 @@ The termination condition for traversal is more complex. Code size is about 40% greater and operations run about 45% slower than lists. .El .Sh EXAMPLES -.Ss Tail queue example -.Bd -literal -#include -#include -#include -#include - -struct entry { - int data; - TAILQ_ENTRY(entry) entries; /* Tail queue. */ -}; - -TAILQ_HEAD(tailhead, entry); - -int -main(void) -{ - struct entry *n1, *n2, *n3, *np; - struct tailhead head; /* Tail queue head. */ - int i; - - TAILQ_INIT(&head); /* Initialize the queue. */ - - n1 = malloc(sizeof(struct entry)); /* Insert at the head. */ - TAILQ_INSERT_HEAD(&head, n1, entries); - - n1 = malloc(sizeof(struct entry)); /* Insert at the tail. */ - TAILQ_INSERT_TAIL(&head, n1, entries); - - n2 = malloc(sizeof(struct entry)); /* Insert after. */ - TAILQ_INSERT_AFTER(&head, n1, n2, entries); - - n3 = malloc(sizeof(struct entry)); /* Insert before. */ - TAILQ_INSERT_BEFORE(n2, n3, entries); - - TAILQ_REMOVE(&head, n2, entries); /* Deletion. */ - free(n2); - /* Forward traversal. */ - i = 0; - TAILQ_FOREACH(np, &head, entries) - np->data = i++; - /* Reverse traversal. */ - TAILQ_FOREACH_REVERSE(np, &head, tailhead, entries) - printf("%i\en", np->data); - /* TailQ Deletion. */ - n1 = TAILQ_FIRST(&head); - while (n1 != NULL) { - n2 = TAILQ_NEXT(n1, entries); - free(n1); - n1 = n2; - } - TAILQ_INIT(&head); - - exit(EXIT_SUCCESS); -} -.Ed .Sh CONFORMING TO Not in POSIX.1, POSIX.1-2001 or POSIX.1-2008. Present on the BSDs. diff --git a/man3/tailq.3 b/man3/tailq.3 index 144a86f3f..28a7ac509 100644 --- a/man3/tailq.3 +++ b/man3/tailq.3 @@ -323,4 +323,60 @@ See the EXAMPLES section below for an example program using a tail queue. .SH CONFORMING TO .SH BUGS .SH EXAMPLES +.Ss Tail queue example +.Bd -literal +#include +#include +#include +#include + +struct entry { + int data; + TAILQ_ENTRY(entry) entries; /* Tail queue. */ +}; + +TAILQ_HEAD(tailhead, entry); + +int +main(void) +{ + struct entry *n1, *n2, *n3, *np; + struct tailhead head; /* Tail queue head. */ + int i; + + TAILQ_INIT(&head); /* Initialize the queue. */ + + n1 = malloc(sizeof(struct entry)); /* Insert at the head. */ + TAILQ_INSERT_HEAD(&head, n1, entries); + + n1 = malloc(sizeof(struct entry)); /* Insert at the tail. */ + TAILQ_INSERT_TAIL(&head, n1, entries); + + n2 = malloc(sizeof(struct entry)); /* Insert after. */ + TAILQ_INSERT_AFTER(&head, n1, n2, entries); + + n3 = malloc(sizeof(struct entry)); /* Insert before. */ + TAILQ_INSERT_BEFORE(n2, n3, entries); + + TAILQ_REMOVE(&head, n2, entries); /* Deletion. */ + free(n2); + /* Forward traversal. */ + i = 0; + TAILQ_FOREACH(np, &head, entries) + np->data = i++; + /* Reverse traversal. */ + TAILQ_FOREACH_REVERSE(np, &head, tailhead, entries) + printf("%i\en", np->data); + /* TailQ Deletion. */ + n1 = TAILQ_FIRST(&head); + while (n1 != NULL) { + n2 = TAILQ_NEXT(n1, entries); + free(n1); + n1 = n2; + } + TAILQ_INIT(&head); + + exit(EXIT_SUCCESS); +} +.Ed .SH SEE ALSO