mirror of
https://github.com/freebsd/freebsd-src.git
synced 2024-11-28 09:02:44 +00:00
159 lines
3.9 KiB
C
159 lines
3.9 KiB
C
|
/*-
|
||
|
* Copyright (c) 2003-2007 Tim Kientzle
|
||
|
* All rights reserved.
|
||
|
*
|
||
|
* Redistribution and use in source and binary forms, with or without
|
||
|
* modification, are permitted provided that the following conditions
|
||
|
* are met:
|
||
|
* 1. Redistributions of source code must retain the above copyright
|
||
|
* notice, this list of conditions and the following disclaimer.
|
||
|
* 2. Redistributions in binary form must reproduce the above copyright
|
||
|
* notice, this list of conditions and the following disclaimer in the
|
||
|
* documentation and/or other materials provided with the distribution.
|
||
|
*
|
||
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) ``AS IS'' AND ANY EXPRESS OR
|
||
|
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
||
|
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
||
|
* IN NO EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
||
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
||
|
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
*/
|
||
|
|
||
|
#include "archive_platform.h"
|
||
|
__FBSDID("$FreeBSD$");
|
||
|
|
||
|
#ifdef HAVE_SYS_STAT_H
|
||
|
#include <sys/stat.h>
|
||
|
#endif
|
||
|
#ifdef HAVE_SYS_TYPES_H
|
||
|
#include <sys/types.h>
|
||
|
#endif
|
||
|
#ifdef HAVE_LIMITS_H
|
||
|
#include <limits.h>
|
||
|
#endif
|
||
|
#ifdef HAVE_LINUX_FS_H
|
||
|
#include <linux/fs.h> /* for Linux file flags */
|
||
|
#endif
|
||
|
/*
|
||
|
* Some Linux distributions have both linux/ext2_fs.h and ext2fs/ext2_fs.h.
|
||
|
* As the include guards don't agree, the order of include is important.
|
||
|
*/
|
||
|
#ifdef HAVE_LINUX_EXT2_FS_H
|
||
|
#include <linux/ext2_fs.h> /* for Linux file flags */
|
||
|
#endif
|
||
|
#if defined(HAVE_EXT2FS_EXT2_FS_H) && !defined(__CYGWIN__)
|
||
|
#include <ext2fs/ext2_fs.h> /* for Linux file flags */
|
||
|
#endif
|
||
|
#include <stddef.h>
|
||
|
#include <stdio.h>
|
||
|
#ifdef HAVE_STDLIB_H
|
||
|
#include <stdlib.h>
|
||
|
#endif
|
||
|
#ifdef HAVE_STRING_H
|
||
|
#include <string.h>
|
||
|
#endif
|
||
|
#ifdef HAVE_WCHAR_H
|
||
|
#include <wchar.h>
|
||
|
#endif
|
||
|
|
||
|
#include "archive.h"
|
||
|
#include "archive_entry.h"
|
||
|
#include "archive_private.h"
|
||
|
#include "archive_entry_private.h"
|
||
|
|
||
|
/*
|
||
|
* extended attribute handling
|
||
|
*/
|
||
|
|
||
|
void
|
||
|
archive_entry_xattr_clear(struct archive_entry *entry)
|
||
|
{
|
||
|
struct ae_xattr *xp;
|
||
|
|
||
|
while (entry->xattr_head != NULL) {
|
||
|
xp = entry->xattr_head->next;
|
||
|
free(entry->xattr_head->name);
|
||
|
free(entry->xattr_head->value);
|
||
|
free(entry->xattr_head);
|
||
|
entry->xattr_head = xp;
|
||
|
}
|
||
|
|
||
|
entry->xattr_head = NULL;
|
||
|
}
|
||
|
|
||
|
void
|
||
|
archive_entry_xattr_add_entry(struct archive_entry *entry,
|
||
|
const char *name, const void *value, size_t size)
|
||
|
{
|
||
|
struct ae_xattr *xp;
|
||
|
|
||
|
for (xp = entry->xattr_head; xp != NULL; xp = xp->next)
|
||
|
;
|
||
|
|
||
|
if ((xp = (struct ae_xattr *)malloc(sizeof(struct ae_xattr))) == NULL)
|
||
|
/* XXX Error XXX */
|
||
|
return;
|
||
|
|
||
|
xp->name = strdup(name);
|
||
|
if ((xp->value = malloc(size)) != NULL) {
|
||
|
memcpy(xp->value, value, size);
|
||
|
xp->size = size;
|
||
|
} else
|
||
|
xp->size = 0;
|
||
|
|
||
|
xp->next = entry->xattr_head;
|
||
|
entry->xattr_head = xp;
|
||
|
}
|
||
|
|
||
|
|
||
|
/*
|
||
|
* returns number of the extended attribute entries
|
||
|
*/
|
||
|
int
|
||
|
archive_entry_xattr_count(struct archive_entry *entry)
|
||
|
{
|
||
|
struct ae_xattr *xp;
|
||
|
int count = 0;
|
||
|
|
||
|
for (xp = entry->xattr_head; xp != NULL; xp = xp->next)
|
||
|
count++;
|
||
|
|
||
|
return count;
|
||
|
}
|
||
|
|
||
|
int
|
||
|
archive_entry_xattr_reset(struct archive_entry * entry)
|
||
|
{
|
||
|
entry->xattr_p = entry->xattr_head;
|
||
|
|
||
|
return archive_entry_xattr_count(entry);
|
||
|
}
|
||
|
|
||
|
int
|
||
|
archive_entry_xattr_next(struct archive_entry * entry,
|
||
|
const char **name, const void **value, size_t *size)
|
||
|
{
|
||
|
if (entry->xattr_p) {
|
||
|
*name = entry->xattr_p->name;
|
||
|
*value = entry->xattr_p->value;
|
||
|
*size = entry->xattr_p->size;
|
||
|
|
||
|
entry->xattr_p = entry->xattr_p->next;
|
||
|
|
||
|
return (ARCHIVE_OK);
|
||
|
} else {
|
||
|
*name = NULL;
|
||
|
*value = NULL;
|
||
|
*size = (size_t)0;
|
||
|
return (ARCHIVE_WARN);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* end of xattr handling
|
||
|
*/
|