|
@@ -123,7 +123,7 @@ static int fd_alloc(struct dfs_fdtable *fdt, int startfd)
|
|
|
int idx;
|
|
|
|
|
|
/* find an empty fd entry */
|
|
|
- for (idx = startfd; idx < fdt->maxfd; idx++)
|
|
|
+ for (idx = startfd; idx < (int)fdt->maxfd; idx++)
|
|
|
{
|
|
|
if (fdt->fds[idx] == RT_NULL)
|
|
|
break;
|
|
@@ -155,7 +155,7 @@ static int fd_alloc(struct dfs_fdtable *fdt, int startfd)
|
|
|
}
|
|
|
|
|
|
/* allocate 'struct dfs_fd' */
|
|
|
- if (idx < fdt->maxfd &&fdt->fds[idx] == RT_NULL)
|
|
|
+ if (idx < (int)fdt->maxfd && fdt->fds[idx] == RT_NULL)
|
|
|
{
|
|
|
fdt->fds[idx] = rt_calloc(1, sizeof(struct dfs_fd));
|
|
|
if (fdt->fds[idx] == RT_NULL)
|
|
@@ -223,7 +223,7 @@ struct dfs_fd *fd_get(int fd)
|
|
|
|
|
|
fdt = dfs_fdtable_get();
|
|
|
fd = fd - DFS_FD_OFFSET;
|
|
|
- if (fd < 0 || fd >= fdt->maxfd)
|
|
|
+ if (fd < 0 || fd >= (int)fdt->maxfd)
|
|
|
return NULL;
|
|
|
|
|
|
dfs_lock();
|
|
@@ -263,7 +263,7 @@ void fd_put(struct dfs_fd *fd)
|
|
|
struct dfs_fdtable *fdt;
|
|
|
|
|
|
fdt = dfs_fdtable_get();
|
|
|
- for (index = 0; index < fdt->maxfd; index ++)
|
|
|
+ for (index = 0; index < (int)fdt->maxfd; index ++)
|
|
|
{
|
|
|
if (fdt->fds[index] == fd)
|
|
|
{
|
|
@@ -531,7 +531,7 @@ int list_fd(void)
|
|
|
|
|
|
rt_kprintf("fd type ref magic path\n");
|
|
|
rt_kprintf("-- ------ --- ----- ------\n");
|
|
|
- for (index = 0; index < fd_table->maxfd; index ++)
|
|
|
+ for (index = 0; index < (int)fd_table->maxfd; index ++)
|
|
|
{
|
|
|
struct dfs_fd *fd = fd_table->fds[index];
|
|
|
|