-
Notifications
You must be signed in to change notification settings - Fork 8
/
Copy pathccnxSimpleFileTransfer_FileIO.c
186 lines (153 loc) · 7.28 KB
/
ccnxSimpleFileTransfer_FileIO.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
/*
* Copyright (c) 2014-2015, Xerox Corporation (Xerox) and Palo Alto Research Center, Inc (PARC)
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * 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 COPYRIGHT HOLDERS AND CONTRIBUTORS "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 XEROX OR PARC 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.
*
* ################################################################################
* #
* # PATENT NOTICE
* #
* # This software is distributed under the BSD 2-clause License (see LICENSE
* # file). This BSD License does not make any patent claims and as such, does
* # not act as a patent grant. The purpose of this section is for each contributor
* # to define their intentions with respect to intellectual property.
* #
* # Each contributor to this source code is encouraged to state their patent
* # claims and licensing mechanisms for any contributions made. At the end of
* # this section contributors may each make their own statements. Contributor's
* # claims and grants only apply to the pieces (source code, programs, text,
* # media, etc) that they have contributed directly to this software.
* #
* # There is no guarantee that this section is complete, up to date or accurate. It
* # is up to the contributors to maintain their portion of this section and up to
* # the user of the software to verify any claims herein.
* #
* # Do not remove this header notification. The contents of this section must be
* # present in all distributions of the software. You may only modify your own
* # intellectual property statements. Please provide contact information.
*
* - Palo Alto Research Center, Inc
* This software distribution does not grant any rights to patents owned by Palo
* Alto Research Center, Inc (PARC). Rights to these patents are available via
* various mechanisms. As of January 2016 PARC has committed to FRAND licensing any
* intellectual property used by its contributions to this software. You may
* contact PARC at [email protected] for more information or visit http://www.ccnx.org
*/
/**
* @author Alan Walendowski, Palo Alto Research Center (Xerox PARC)
* @copyright (c) 2014-2015, Xerox Corporation (Xerox) and Palo Alto Research Center, Inc (PARC). All rights reserved.
*/
#include <stdio.h>
#include <dirent.h>
#include <unistd.h>
#include <LongBow/runtime.h>
#include <parc/algol/parc_Memory.h>
#include <parc/algol/parc_BufferComposer.h>
#include "ccnxSimpleFileTransfer_FileIO.h"
PARCBuffer *
ccnxSimpleFileTransferFileIO_GetFileChunk(const char *fileName, size_t chunkSize, uint64_t chunkNum)
{
FILE *file = fopen(fileName, "r");
// NOTE: Opening and seeking in the file for each chunk is NOT a very efficient way to
// retrieve chunks. Consider keeping the file open, or caching in memory, or...
assertNotNull(file, "Could not open file '%s' - stopping.", fileName);
// Seek to the location of the desired chunk in the file.
assertTrue(fseek(file, chunkSize * chunkNum, SEEK_SET) == 0, "Could not seek to desired chunk");
// If we're here, we were able to seek to the start of the desired chunk
PARCBuffer *result = parcBuffer_Allocate(chunkSize);
size_t numberOfBytesNeeded = chunkSize;
size_t numberOfBytesRead = 0; // # bytes read in each read.
size_t totalNumberOfBytesRead = 0; // Overall # of bytes read
// Read until we get the required number of bytes.
while (numberOfBytesNeeded > 0
&& (numberOfBytesRead = fread(parcBuffer_Overlay(result, 0), 1, numberOfBytesNeeded, file)) > 0) {
numberOfBytesNeeded -= numberOfBytesRead;
parcBuffer_SetPosition(result, parcBuffer_Position(result) + numberOfBytesRead);
totalNumberOfBytesRead += numberOfBytesRead;
}
parcBuffer_SetLimit(result, totalNumberOfBytesRead);
parcBuffer_Flip(result);
fclose(file);
return result;
}
bool
ccnxSimpleFileTransferFileIO_IsFileAvailable(const char *filePath)
{
return (access(filePath, F_OK | R_OK) == 0);
}
size_t
ccnxSimpleFileTransferFileIO_GetFileSize(const char *filePath)
{
size_t fileSize = 0;
FILE *fp = fopen(filePath, "r");
assertNotNull(fp, "Could not open file '%s' to get size.", filePath);
if (NULL != fp) {
fseek(fp, 0, SEEK_END);
fileSize = ftell(fp);
fclose(fp);
}
return fileSize;
}
PARCBuffer *
ccnxSimpleFileTransferFileIO_CreateDirectoryListing(const char *directoryName)
{
DIR *directory = opendir(directoryName);
assertNotNull(directory, "Couldn't open directory '%s' for reading.", directoryName);
PARCBufferComposer *directoryListing = parcBufferComposer_Create();
struct dirent *entry;
while ((entry = readdir(directory)) != NULL) {
switch (entry->d_type) {
case DT_REG: {
// a regular file
// We need the full file path to check its size.
PARCBufferComposer *fullFilePath = parcBufferComposer_Create();
parcBufferComposer_Format(fullFilePath, "%s/%s", directoryName, entry->d_name);
PARCBuffer *fileNameBuffer = parcBufferComposer_ProduceBuffer(fullFilePath);
char *fullFilePathString = parcBuffer_ToString(fileNameBuffer);
parcBuffer_Release(&fileNameBuffer);
if (ccnxSimpleFileTransferFileIO_IsFileAvailable(fullFilePathString)) {
parcBufferComposer_Format(directoryListing, " %s (%zu bytes)\n",
entry->d_name, ccnxSimpleFileTransferFileIO_GetFileSize(fullFilePathString));
}
parcBufferComposer_Release(&fullFilePath);
parcMemory_Deallocate((void **) &fullFilePathString);
break;
}
case DT_LNK:
case DT_DIR:
default:
// ignore everything but regular files
break;
}
}
closedir(directory);
PARCBuffer *result = parcBufferComposer_ProduceBuffer(directoryListing);
parcBufferComposer_Release(&directoryListing);
return result;
}
bool
ccnxSimpleFileTransferFileIO_DeleteFile(const char *fileName)
{
// Unlink the file. Return true if succesful, false if not.
// False could mean the file didn't originally exist.
return (unlink(fileName) == 0);
}