---

tarfs_util.c

Go to the documentation of this file.

/* ************************************************************************* *
 *                                                                           *
 *   This program is free software; you can redistribute it and/or modify    *
 *   it under the terms of the GNU General Public License as published by    *
 *   the Free Software Foundation; either version 2 of the License, or       *
 *   (at your option) any later version.                                     *
 *                                                                           *
 * ************************************************************************* */

#include "tarfs_util.h"
#include "tarfs_common.h"

unsigned long hcc(unsigned long nom, unsigned long denom)
{
  if (nom == 0) {
    return 0;
  }
  return (nom - 1) / denom + 1;
}

int read_block(struct super_block* s, unsigned long i, void* blok)
{
  struct buffer_head* bh;

  bh = sb_bread(s, i);
  if (!bh) {
    return 0;
  }
  memcpy(blok, (void*) bh->b_data, TARFS_BLKSIZE);
  brelse(bh);
  return 1;
}


int is_nullblock(void *blok, unsigned long size)
{
  unsigned long i;

  if(!blok) {
    return 0;
  }

  for(i = 0;i<size;i++) {
    if(((unsigned char*)blok)[i]) {
      return 0;
    }
  }

  return 1;
}

int name_comparator(void* a, void* b, int first_length)
{
  int i;
  char* aa = a;
  char* bb = b;

  //zacatek porovnani
  for (i = 0; i < first_length; i++) {
    if (aa[i] != bb[i]) {
      //aa nekonci zaroven s bb
      return 0;
    }
    if (aa[i] == 0 || bb[i] == 0) {
      if(!aa[i] && !bb[i]) {
        return 1;
      }
      break;
    }
  }
  if (bb[i] != 0) {
    //aa je vlastni prefix bb
    return 0;
  }
  if (i < first_length) {
    //bb je vlastni prefix bb
    return 0;
  }
  return 1;
}


int name_comparator2(void* a, void* b, unsigned int first_length, unsigned int second_length)
{
  unsigned int i;
  char* aa = a;
  char* bb = b;

  if (first_length < second_length || first_length > second_length + 1) {
    return 0;//osekne vetsinu pripadu
  }

  //porovnam vetsinu
  for(i = 0; i < second_length; i++) {
    if(aa[i] != bb[i]) {
      //ruzne
      return 0;
    }
  }
  //pokud jsou stejne, nebo a=b.'/', kde . je concatenace
  if (i == first_length || aa[first_length - 1] == '/') {
    return 1;
  }
  return 0;
}

int is_right_prefix(char* dname, unsigned int dsize, char* fname, unsigned int fsize)
{
  unsigned int i;

  if (dsize >= fsize) {
    return TARFS_CAN_ADD;
  }

  for (i = 0; i < dsize; i++) {
    if (dname[i] != fname[i]) {
      return TARFS_CAN_ADD;
    }
  }

  //vim, ze dname je predek fname, jestemusim overit, ze to je otec
  for(; i < fsize - 1; i++) {//do fsize-1, protoze, kdyz fname je adresar, pak ma na konci jmena /
    if (fname[i] == '/') {
      return -1;
    }
  }
  return 1;
}

int is_octal(char ch) {
  return(ch - '0' >= 0 && ch - '0' < 8);
}


unsigned long oct_to_dec(void* what, unsigned int length)
{
  unsigned long  sum = 0;
  int i;

  if (length < 1) {
    return TARFS_EVAL;
  }

  for (i = 0; i < length; i++) {
    if (!is_octal(*(char*) what)) {
      return TARFS_EVAL;
    }
    //horner:-)
    sum = sum << 3;
    sum += ((char*)what)[i]-'0';
  }
  return sum;
}

unsigned int short_name_size(char* name)
{
  unsigned int i;

  for (i = 0; i < 100; i++) {
    if(!name[i]) {
      break;
    }
  }

  return i;
}

---