<?xml version='1.0' encoding='UTF-8' standalone='no'?> <doxygen xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:noNamespaceSchemaLocation="compound.xsd" version="1.8.16"> <compounddef id="ubixfs_8cpp" kind="file" language="C++"> <compoundname>ubixfs.cpp</compoundname> <briefdescription> </briefdescription> <detaileddescription> </detaileddescription> <programlisting> <codeline lineno="1"><highlight class="comment">/*#include<sp/><stddef.h></highlight></codeline> <codeline lineno="2"><highlight class="comment">#include<sp/><stdlib.h></highlight></codeline> <codeline lineno="3"><highlight class="comment">#include<sp/><unistd.h></highlight></codeline> <codeline lineno="4"><highlight class="comment">#include<sp/><string.h></highlight></codeline> <codeline lineno="5"><highlight class="comment">#include<sp/><assert.h></highlight></codeline> <codeline lineno="6"><highlight class="comment">#include<sp/><iostream></highlight></codeline> <codeline lineno="7"><highlight class="comment"></highlight></codeline> <codeline lineno="8"><highlight class="comment">#include<sp/>"ubixfs.h"</highlight></codeline> <codeline lineno="9"><highlight class="comment">#include<sp/>"btree.h"</highlight></codeline> <codeline lineno="10"><highlight class="comment"></highlight></codeline> <codeline lineno="11"><highlight class="comment">using<sp/>namespace<sp/>std;</highlight></codeline> <codeline lineno="12"><highlight class="comment"></highlight></codeline> <codeline lineno="13"><highlight class="comment">UbixFS::UbixFS(void)<sp/>{<sp/></highlight></codeline> <codeline lineno="14"><highlight class="comment"><sp/><sp/>device<sp/>=<sp/>NULL;</highlight></codeline> <codeline lineno="15"><highlight class="comment"><sp/><sp/>freeBlockList<sp/>=<sp/>NULL;</highlight></codeline> <codeline lineno="16"><highlight class="comment"><sp/><sp/>superBlock<sp/>=<sp/>NULL;</highlight></codeline> <codeline lineno="17"><highlight class="comment"><sp/><sp/>root<sp/>=<sp/>NULL;</highlight></codeline> <codeline lineno="18"><highlight class="comment">}<sp/>//<sp/>UbixFS::UbixFS</highlight></codeline> <codeline lineno="19"><highlight class="comment"></highlight></codeline> <codeline lineno="20"><highlight class="comment"></highlight></codeline> <codeline lineno="21"><highlight class="comment">UbixFS::UbixFS(device_t<sp/>*<sp/>dev)<sp/>{</highlight></codeline> <codeline lineno="22"><highlight class="comment"><sp/><sp/>device<sp/>=<sp/>dev;</highlight></codeline> <codeline lineno="23"><highlight class="comment"><sp/><sp/>freeBlockList<sp/>=<sp/>NULL;</highlight></codeline> <codeline lineno="24"><highlight class="comment"><sp/><sp/>superBlock<sp/>=<sp/>NULL;</highlight></codeline> <codeline lineno="25"><highlight class="comment"><sp/><sp/>root<sp/>=<sp/>NULL;</highlight></codeline> <codeline lineno="26"><highlight class="comment">}<sp/>//<sp/>UbixFS::UbixFS</highlight></codeline> <codeline lineno="27"><highlight class="comment"></highlight></codeline> <codeline lineno="28"><highlight class="comment">void</highlight></codeline> <codeline lineno="29"><highlight class="comment">UbixFS::printSuperBlock(void)<sp/>{</highlight></codeline> <codeline lineno="30"><highlight class="comment"><sp/><sp/>printf("superBlock->name...........<sp/>%s\n",<sp/>superBlock->name);</highlight></codeline> <codeline lineno="31"><highlight class="comment"><sp/><sp/>printf("superBlock->magic1.........<sp/>%X\n",<sp/>superBlock->magic1);</highlight></codeline> <codeline lineno="32"><highlight class="comment"><sp/><sp/>printf("superBlock->fsByteOrder....<sp/>%d\n",<sp/>superBlock->fsByteOrder);</highlight></codeline> <codeline lineno="33"><highlight class="comment"><sp/><sp/>printf("superBlock->blockSize......<sp/>%d\n",<sp/>superBlock->blockSize);</highlight></codeline> <codeline lineno="34"><highlight class="comment"><sp/><sp/>printf("superBlock->blockShift.....<sp/>%d\n",<sp/>superBlock->blockShift);</highlight></codeline> <codeline lineno="35"><highlight class="comment"><sp/><sp/>printf("superBlock->numBlocks......<sp/>%lld\n",<sp/>superBlock->numBlocks);</highlight></codeline> <codeline lineno="36"><highlight class="comment"><sp/><sp/>printf("superBlock->usedBlocks.....<sp/>%lld\n",<sp/>superBlock->usedBlocks);</highlight></codeline> <codeline lineno="37"><highlight class="comment"><sp/><sp/>printf("superBlock->batSectors.....<sp/>%d\n",<sp/>superBlock->batSectors);</highlight></codeline> <codeline lineno="38"><highlight class="comment"><sp/><sp/>printf("superBlock->inodeCount.....<sp/>%d\n",<sp/>superBlock->inodeCount);</highlight></codeline> <codeline lineno="39"><highlight class="comment"><sp/><sp/>printf("superBlock->magic2.........<sp/>%X\n",<sp/>superBlock->magic2);</highlight></codeline> <codeline lineno="40"><highlight class="comment"><sp/><sp/>printf("superBlock->blocksPerAG....<sp/>%d\n",<sp/>superBlock->blocksPerAG);</highlight></codeline> <codeline lineno="41"><highlight class="comment"><sp/><sp/>printf("superBlock->AGShift........<sp/>%d\n",<sp/>superBlock->AGShift);</highlight></codeline> <codeline lineno="42"><highlight class="comment"><sp/><sp/>printf("superBlock->numAGs.........<sp/>%d\n",<sp/>superBlock->numAGs);</highlight></codeline> <codeline lineno="43"><highlight class="comment"><sp/><sp/>printf("superBlock->lastUsedAG.....<sp/>%d\n",<sp/>superBlock->lastUsedAG);</highlight></codeline> <codeline lineno="44"><highlight class="comment"><sp/><sp/>printf("superBlock->flags..........<sp/>%X\n",<sp/>superBlock->flags);</highlight></codeline> <codeline lineno="45"><highlight class="comment"><sp/><sp/>printf("superBlock->magic3.........<sp/>%X\n",<sp/>superBlock->magic3);</highlight></codeline> <codeline lineno="46"><highlight class="comment"><sp/><sp/>return;</highlight></codeline> <codeline lineno="47"><highlight class="comment">}<sp/>//<sp/>UbixFS::printSuperBlock</highlight></codeline> <codeline lineno="48"><highlight class="comment"></highlight></codeline> <codeline lineno="49"><highlight class="comment">int<sp/></highlight></codeline> <codeline lineno="50"><highlight class="comment">UbixFS::vfs_init(void)<sp/>{</highlight></codeline> <codeline lineno="51"><highlight class="comment">assert(device);</highlight></codeline> <codeline lineno="52"><highlight class="comment"><sp/><sp/>size_t<sp/>result;</highlight></codeline> <codeline lineno="53"><highlight class="comment"><sp/><sp/>cout<sp/><<<sp/>"vfs_init()"<sp/><<<sp/>endl;</highlight></codeline> <codeline lineno="54"><highlight class="comment"><sp/><sp/>assert(device);</highlight></codeline> <codeline lineno="55"><highlight class="comment"></highlight></codeline> <codeline lineno="56"><highlight class="comment"><sp/><sp/>if<sp/>(device<sp/>==<sp/>NULL)<sp/>return<sp/>-1;</highlight></codeline> <codeline lineno="57"><highlight class="comment"><sp/><sp/>if<sp/>(superBlock<sp/>!=<sp/>NULL)<sp/>delete<sp/>superBlock;</highlight></codeline> <codeline lineno="58"><highlight class="comment"><sp/><sp/>superBlock<sp/>=<sp/>new<sp/>diskSuperBlock;</highlight></codeline> <codeline lineno="59"><highlight class="comment">assert(superBlock);</highlight></codeline> <codeline lineno="60"><highlight class="comment"><sp/><sp/>if<sp/>(superBlock<sp/>==<sp/>NULL)<sp/>return<sp/>-1;</highlight></codeline> <codeline lineno="61"><highlight class="comment"></highlight></codeline> <codeline lineno="62"><highlight class="comment"><sp/><sp/>//<sp/>read<sp/>in<sp/>the<sp/>superBlock.<sp/>It's<sp/>always<sp/>the<sp/>last<sp/>block<sp/>on<sp/>the<sp/>partition<sp/></highlight></codeline> <codeline lineno="63"><highlight class="comment">cout<sp/><<<sp/>"reading<sp/>in<sp/>superBlock"<sp/><<<sp/>endl;</highlight></codeline> <codeline lineno="64"><highlight class="comment"><sp/><sp/>device->read(device,<sp/>superBlock,<sp/>device->sectors-1,<sp/>1);</highlight></codeline> <codeline lineno="65"><highlight class="comment">cout<sp/><<<sp/>"done"<sp/><<<sp/>endl;</highlight></codeline> <codeline lineno="66"><highlight class="comment"></highlight></codeline> <codeline lineno="67"><highlight class="comment"><sp/><sp/>assert(superBlock->magic1<sp/>==<sp/>UBIXFS_MAGIC1);</highlight></codeline> <codeline lineno="68"><highlight class="comment"><sp/><sp/>assert(superBlock->magic2<sp/>==<sp/>UBIXFS_MAGIC2);</highlight></codeline> <codeline lineno="69"><highlight class="comment"><sp/><sp/>assert(superBlock->magic3<sp/>==<sp/>UBIXFS_MAGIC3);</highlight></codeline> <codeline lineno="70"><highlight class="comment"><sp/><sp/>assert(strcmp(superBlock->name,<sp/>"UbixFS")<sp/>==<sp/>0);</highlight></codeline> <codeline lineno="71"><highlight class="comment"><sp/><sp/>assert((1<sp/><<<sp/>superBlock->blockShift)<sp/>==<sp/>superBlock->blockSize);</highlight></codeline> <codeline lineno="72"><highlight class="comment"><sp/><sp/>assert((unsigned)(1<sp/><<<sp/>superBlock->AGShift)<sp/>==<sp/>superBlock->blocksPerAG);</highlight></codeline> <codeline lineno="73"><highlight class="comment"><sp/><sp/>assert(superBlock->flags<sp/>==<sp/>UBIXFS_CLEAN);</highlight></codeline> <codeline lineno="74"><highlight class="comment"></highlight></codeline> <codeline lineno="75"><highlight class="comment"><sp/><sp/>if<sp/>(freeBlockList<sp/>!=<sp/>NULL)<sp/>delete<sp/>[]<sp/>freeBlockList;</highlight></codeline> <codeline lineno="76"><highlight class="comment"><sp/><sp/>freeBlockList<sp/>=<sp/>new<sp/>signed<sp/>char[superBlock->batSectors*512];</highlight></codeline> <codeline lineno="77"><highlight class="comment">assert(freeBlockList);</highlight></codeline> <codeline lineno="78"><highlight class="comment"><sp/><sp/>memset(freeBlockList,<sp/>0,<sp/>superBlock->batSectors*512);</highlight></codeline> <codeline lineno="79"><highlight class="comment"></highlight></codeline> <codeline lineno="80"><highlight class="comment"><sp/><sp/>device->read(device,<sp/></highlight></codeline> <codeline lineno="81"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>freeBlockList,<sp/></highlight></codeline> <codeline lineno="82"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>device->sectors<sp/>-<sp/>superBlock->batSectors-1,</highlight></codeline> <codeline lineno="83"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>superBlock->batSectors</highlight></codeline> <codeline lineno="84"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>);<sp/>//<sp/>device->read()</highlight></codeline> <codeline lineno="85"><highlight class="comment"></highlight></codeline> <codeline lineno="86"><highlight class="comment"><sp/><sp/>root<sp/>=<sp/>new<sp/>fileDescriptor;</highlight></codeline> <codeline lineno="87"><highlight class="comment"><sp/><sp/>assert(root);</highlight></codeline> <codeline lineno="88"><highlight class="comment"><sp/><sp/>memset(root,<sp/>0,<sp/>sizeof(fileDescriptor));</highlight></codeline> <codeline lineno="89"><highlight class="comment">cout<sp/><<<sp/>"allocating<sp/>root<sp/>dir<sp/>inode"<sp/><<<sp/>endl;</highlight></codeline> <codeline lineno="90"><highlight class="comment"><sp/><sp/>root->inode<sp/>=<sp/>new<sp/>ubixfsInode;</highlight></codeline> <codeline lineno="91"><highlight class="comment"><sp/><sp/>memset(root->inode,<sp/>0,<sp/>sizeof(ubixfsInode));</highlight></codeline> <codeline lineno="92"><highlight class="comment">cout<sp/><<<sp/>"root<sp/>dir<sp/>inode<sp/>starting<sp/>sector:<sp/>"<sp/><<<sp/></highlight></codeline> <codeline lineno="93"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>((superBlock->rootDir.AG<sp/><<<sp/>superBlock->AGShift)<sp/></highlight></codeline> <codeline lineno="94"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>+<sp/>superBlock->rootDir.start)<sp/>*<sp/>(superBlock->blockSize<sp/>/<sp/>512)</highlight></codeline> <codeline lineno="95"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><<<sp/>endl;</highlight></codeline> <codeline lineno="96"><highlight class="comment"></highlight></codeline> <codeline lineno="97"><highlight class="comment">cout<sp/><<<sp/>"reading<sp/>in<sp/>root<sp/>dir<sp/>inode"<sp/><<<sp/>endl;</highlight></codeline> <codeline lineno="98"><highlight class="comment"><sp/><sp/></highlight></codeline> <codeline lineno="99"><highlight class="comment"><sp/><sp/>device->read(device,</highlight></codeline> <codeline lineno="100"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>root->inode,</highlight></codeline> <codeline lineno="101"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>((superBlock->rootDir.AG<sp/><<<sp/>superBlock->AGShift)<sp/></highlight></codeline> <codeline lineno="102"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>+<sp/>superBlock->rootDir.start)<sp/>*<sp/>(superBlock->blockSize<sp/>/<sp/>512),</highlight></codeline> <codeline lineno="103"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>sizeof(ubixfsInode)<sp/>/<sp/>512</highlight></codeline> <codeline lineno="104"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>);</highlight></codeline> <codeline lineno="105"><highlight class="comment">cout<sp/><<<sp/>"done"<sp/><<<sp/>endl;</highlight></codeline> <codeline lineno="106"><highlight class="comment"><sp/><sp/>ubixfsInode<sp/>*<sp/>rootInode<sp/>=<sp/>static_cast<ubixfsInode<sp/>*>(root->inode);</highlight></codeline> <codeline lineno="107"><highlight class="comment"><sp/><sp/>assert(rootInode);</highlight></codeline> <codeline lineno="108"><highlight class="comment"></highlight></codeline> <codeline lineno="109"><highlight class="comment"><sp/><sp/>//the<sp/>bTree<sp/>constructor<sp/>now<sp/>loads<sp/>in<sp/>the<sp/>header</highlight></codeline> <codeline lineno="110"><highlight class="comment"></highlight></codeline> <codeline lineno="111"><highlight class="comment"><sp/><sp/>rootInode->data.btPtr<sp/>=<sp/>new<sp/>bTree(this,<sp/>root);</highlight></codeline> <codeline lineno="112"><highlight class="comment"><sp/><sp/>rootInode->data.btPtr->Info();</highlight></codeline> <codeline lineno="113"><highlight class="comment"><sp/><sp/>printSuperBlock();</highlight></codeline> <codeline lineno="114"><highlight class="comment"><sp/><sp/>return<sp/>0;</highlight></codeline> <codeline lineno="115"><highlight class="comment">}<sp/>//<sp/>UbixFS::init</highlight></codeline> <codeline lineno="116"><highlight class="comment"></highlight></codeline> <codeline lineno="117"><highlight class="comment">int</highlight></codeline> <codeline lineno="118"><highlight class="comment">UbixFS::vfs_format(device_t<sp/>*<sp/>dev)<sp/>{</highlight></codeline> <codeline lineno="119"><highlight class="comment"><sp/><sp/>cout<sp/><<<sp/>"vfs_format()"<sp/><<<sp/>endl;</highlight></codeline> <codeline lineno="120"><highlight class="comment"><sp/><sp/>char<sp/>sector[512];</highlight></codeline> <codeline lineno="121"><highlight class="comment"><sp/><sp/>uInt32<sp/>blocks,<sp/>batSect,<sp/>batSize;</highlight></codeline> <codeline lineno="122"><highlight class="comment"><sp/><sp/>if<sp/>(dev<sp/>==<sp/>NULL)<sp/>return<sp/>-1;<sp/></highlight></codeline> <codeline lineno="123"><highlight class="comment"></highlight></codeline> <codeline lineno="124"><highlight class="comment"><sp/><sp/>//<sp/>zero<sp/>out<sp/>the<sp/>sector</highlight></codeline> <codeline lineno="125"><highlight class="comment"><sp/><sp/>memset(&sector,<sp/>0x0,<sp/>sizeof(sector));</highlight></codeline> <codeline lineno="126"><highlight class="comment"><sp/></highlight></codeline> <codeline lineno="127"><highlight class="comment"><sp/><sp/>//<sp/>fill<sp/>the<sp/>drive<sp/>in<sp/>with<sp/>zeroed<sp/>out<sp/>sectors</highlight></codeline> <codeline lineno="128"><highlight class="comment"><sp/><sp/>cout<sp/><<<sp/>"dev->sectors:<sp/>"<sp/><<<sp/>dev->sectors<sp/><<<sp/>endl;</highlight></codeline> <codeline lineno="129"><highlight class="comment"><sp/><sp/>cout<sp/><<<sp/>"clearing<sp/>device...";</highlight></codeline> <codeline lineno="130"><highlight class="comment"></highlight></codeline> <codeline lineno="131"><highlight class="comment"><sp/><sp/>for<sp/>(unsigned<sp/>int<sp/>i<sp/>=<sp/>0;<sp/>i<sp/><<sp/>dev->sectors;<sp/>i++)<sp/>{</highlight></codeline> <codeline lineno="132"><highlight class="comment"><sp/><sp/><sp/><sp/>dev->write(dev,<sp/>&sector,<sp/>i,<sp/>1);</highlight></codeline> <codeline lineno="133"><highlight class="comment"><sp/><sp/>}<sp/>//<sp/>for<sp/>i</highlight></codeline> <codeline lineno="134"><highlight class="comment"></highlight></codeline> <codeline lineno="135"><highlight class="comment"><sp/><sp/>cout<sp/><<<sp/>"done"<sp/><<<sp/>endl;</highlight></codeline> <codeline lineno="136"><highlight class="comment"></highlight></codeline> <codeline lineno="137"><highlight class="comment"><sp/><sp/>//<sp/>allocate<sp/>a<sp/>new<sp/>superBlock<sp/>and<sp/>clear<sp/>it</highlight></codeline> <codeline lineno="138"><highlight class="comment"></highlight></codeline> <codeline lineno="139"><highlight class="comment"><sp/><sp/>diskSuperBlock<sp/>*sb<sp/>=<sp/>new<sp/>diskSuperBlock;</highlight></codeline> <codeline lineno="140"><highlight class="comment"><sp/><sp/>if<sp/>(sb<sp/>==<sp/>NULL)<sp/>return<sp/>-1;</highlight></codeline> <codeline lineno="141"><highlight class="comment"><sp/><sp/>memset(sb,<sp/>0,<sp/>sizeof(diskSuperBlock));</highlight></codeline> <codeline lineno="142"><highlight class="comment"></highlight></codeline> <codeline lineno="143"><highlight class="comment"><sp/><sp/>//<sp/>dev->sectors<sp/>is<sp/>the<sp/>number<sp/>of<sp/>512<sp/>byte<sp/>sectors</highlight></codeline> <codeline lineno="144"><highlight class="comment"></highlight></codeline> <codeline lineno="145"><highlight class="comment"><sp/><sp/>blocks<sp/>=<sp/>(dev->sectors-1)<sp/>/<sp/>8;<sp/><sp/><sp/><sp/><sp/>//<sp/>4k<sp/>blocks</highlight></codeline> <codeline lineno="146"><highlight class="comment"><sp/><sp/>batSize<sp/>=<sp/>(dev->sectors-1)<sp/>%<sp/>8;<sp/><sp/><sp/><sp/>//<sp/>remainder</highlight></codeline> <codeline lineno="147"><highlight class="comment"><sp/><sp/></highlight></codeline> <codeline lineno="148"><highlight class="comment"><sp/><sp/>//<sp/>compute<sp/>the<sp/>BAT<sp/>size</highlight></codeline> <codeline lineno="149"><highlight class="comment"></highlight></codeline> <codeline lineno="150"><highlight class="comment"><sp/><sp/>while<sp/>((batSize<sp/>*<sp/>4096)<sp/><<sp/>blocks)<sp/>{</highlight></codeline> <codeline lineno="151"><highlight class="comment"><sp/><sp/><sp/><sp/>batSize<sp/>+=<sp/>8;</highlight></codeline> <codeline lineno="152"><highlight class="comment"><sp/><sp/><sp/><sp/>--blocks;</highlight></codeline> <codeline lineno="153"><highlight class="comment"><sp/><sp/>}<sp/>//<sp/>while</highlight></codeline> <codeline lineno="154"><highlight class="comment"><sp/></highlight></codeline> <codeline lineno="155"><highlight class="comment"><sp/><sp/>//<sp/>batSize<sp/>is<sp/>in<sp/>sectors</highlight></codeline> <codeline lineno="156"><highlight class="comment"><sp/><sp/>batSect<sp/>=<sp/>blocks<sp/>*<sp/>8;</highlight></codeline> <codeline lineno="157"><highlight class="comment"></highlight></codeline> <codeline lineno="158"><highlight class="comment"><sp/><sp/>strcpy(sb->name,<sp/>"UbixFS");</highlight></codeline> <codeline lineno="159"><highlight class="comment"><sp/><sp/>sb->magic1<sp/>=<sp/>UBIXFS_MAGIC1;</highlight></codeline> <codeline lineno="160"><highlight class="comment"><sp/><sp/>sb->fsByteOrder<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="161"><highlight class="comment"><sp/><sp/>sb->blockSize<sp/>=<sp/>4096;</highlight></codeline> <codeline lineno="162"><highlight class="comment"><sp/><sp/>sb->blockShift<sp/>=<sp/>12;</highlight></codeline> <codeline lineno="163"><highlight class="comment"><sp/><sp/>sb->numBlocks<sp/>=<sp/>blocks;</highlight></codeline> <codeline lineno="164"><highlight class="comment"><sp/><sp/>sb->usedBlocks<sp/>=<sp/>2;<sp/><sp/>//<sp/>root<sp/>dir<sp/>takes<sp/>two<sp/>blocks<sp/>(inode<sp/>+<sp/>bTree<sp/>header)</highlight></codeline> <codeline lineno="165"><highlight class="comment"><sp/><sp/>sb->inodeCount<sp/>=<sp/>1;</highlight></codeline> <codeline lineno="166"><highlight class="comment"><sp/><sp/>sb->inodeSize<sp/>=<sp/>4096;</highlight></codeline> <codeline lineno="167"><highlight class="comment"><sp/><sp/>sb->magic2<sp/>=<sp/>UBIXFS_MAGIC2;</highlight></codeline> <codeline lineno="168"><highlight class="comment"><sp/><sp/>sb->blocksPerAG<sp/>=<sp/>2048;</highlight></codeline> <codeline lineno="169"><highlight class="comment"><sp/><sp/>sb->AGShift<sp/>=<sp/>11;</highlight></codeline> <codeline lineno="170"><highlight class="comment"><sp/><sp/>sb->numAGs<sp/>=<sp/>(sb->numBlocks+2047)<sp/>/<sp/>2048;</highlight></codeline> <codeline lineno="171"><highlight class="comment"><sp/><sp/>sb->lastUsedAG<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="172"><highlight class="comment"></highlight></codeline> <codeline lineno="173"><highlight class="comment"><sp/><sp/>//<sp/>the<sp/>BAT<sp/>exists<sp/>outside<sp/>our<sp/>official<sp/>block<sp/>count,<sp/>so<sp/>no<sp/></highlight></codeline> <codeline lineno="174"><highlight class="comment"><sp/><sp/>//<sp/>entries<sp/>in<sp/>the<sp/>BAT<sp/>need<sp/>to<sp/>be<sp/>set<sp/>for<sp/>it</highlight></codeline> <codeline lineno="175"><highlight class="comment"><sp/><sp/>sb->batSectors<sp/>=<sp/>batSize;</highlight></codeline> <codeline lineno="176"><highlight class="comment"></highlight></codeline> <codeline lineno="177"><highlight class="comment"><sp/><sp/>sb->flags<sp/>=<sp/>0x434C454E;<sp/>//<sp/>CLEN</highlight></codeline> <codeline lineno="178"><highlight class="comment"><sp/><sp/>sb->logBlocks.AG<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="179"><highlight class="comment"><sp/><sp/>sb->logBlocks.start<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="180"><highlight class="comment"><sp/><sp/>sb->logBlocks.len<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="181"><highlight class="comment"><sp/><sp/>sb->logStart<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="182"><highlight class="comment"><sp/><sp/>sb->logEnd<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="183"><highlight class="comment"><sp/><sp/>sb->magic3<sp/>=<sp/>UBIXFS_MAGIC3;</highlight></codeline> <codeline lineno="184"><highlight class="comment"><sp/><sp/>sb->indicies.AG<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="185"><highlight class="comment"><sp/><sp/>sb->indicies.start<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="186"><highlight class="comment"><sp/><sp/>sb->indicies.len<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="187"><highlight class="comment"></highlight></codeline> <codeline lineno="188"><highlight class="comment"><sp/><sp/>sb->rootDir.AG<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="189"><highlight class="comment"><sp/><sp/>sb->rootDir.start<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="190"><highlight class="comment"><sp/><sp/>sb->rootDir.len<sp/>=<sp/>1;</highlight></codeline> <codeline lineno="191"><highlight class="comment"></highlight></codeline> <codeline lineno="192"><highlight class="comment"><sp/><sp/>//<sp/>write<sp/>out<sp/>the<sp/>superBlock</highlight></codeline> <codeline lineno="193"><highlight class="comment"></highlight></codeline> <codeline lineno="194"><highlight class="comment"><sp/><sp/>dev->write(dev,<sp/>sb,<sp/>dev->sectors-1,<sp/>1);</highlight></codeline> <codeline lineno="195"><highlight class="comment"></highlight></codeline> <codeline lineno="196"><highlight class="comment"><sp/><sp/>//<sp/>mark<sp/>the<sp/>first<sp/>two<sp/>4k<sp/>blocks<sp/>used</highlight></codeline> <codeline lineno="197"><highlight class="comment"><sp/><sp/>memset(&sector,<sp/>0,<sp/>sizeof(sector));</highlight></codeline> <codeline lineno="198"><highlight class="comment"><sp/><sp/>sector[0]<sp/>=<sp/>(1<sp/><<<sp/>7)<sp/>|<sp/>(1<sp/><<<sp/>6);</highlight></codeline> <codeline lineno="199"><highlight class="comment"></highlight></codeline> <codeline lineno="200"><highlight class="comment"><sp/><sp/>//<sp/>write<sp/>out<sp/>the<sp/>first<sp/>sector<sp/>of<sp/>the<sp/>BAT<sp/></highlight></codeline> <codeline lineno="201"><highlight class="comment"></highlight></codeline> <codeline lineno="202"><highlight class="comment"><sp/><sp/>dev->write(dev,<sp/>&sector,<sp/>batSect,<sp/>1);</highlight></codeline> <codeline lineno="203"><highlight class="comment"><sp/><sp/>//<sp/>clear<sp/>the<sp/>rest</highlight></codeline> <codeline lineno="204"><highlight class="comment"><sp/><sp/>sector[0]<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="205"><highlight class="comment"></highlight></codeline> <codeline lineno="206"><highlight class="comment"><sp/><sp/>//<sp/>write<sp/>out<sp/>the<sp/>rest<sp/>of<sp/>the<sp/>BAT</highlight></codeline> <codeline lineno="207"><highlight class="comment"></highlight></codeline> <codeline lineno="208"><highlight class="comment"><sp/><sp/>for<sp/>(unsigned<sp/>int<sp/>i<sp/>=<sp/>1;<sp/>i<sp/><<sp/>batSize;<sp/>i++)<sp/>{</highlight></codeline> <codeline lineno="209"><highlight class="comment"><sp/><sp/><sp/><sp/>dev->write(dev,<sp/>&sector,<sp/>(batSect)+i,<sp/>1);</highlight></codeline> <codeline lineno="210"><highlight class="comment"><sp/><sp/>}<sp/>//<sp/>for<sp/>i</highlight></codeline> <codeline lineno="211"><highlight class="comment"></highlight></codeline> <codeline lineno="212"><highlight class="comment"><sp/><sp/>//<sp/>allocate<sp/>part<sp/>of<sp/>the<sp/>root<sp/>dir</highlight></codeline> <codeline lineno="213"><highlight class="comment"></highlight></codeline> <codeline lineno="214"><highlight class="comment"><sp/><sp/>//<sp/>sanity<sp/>checks</highlight></codeline> <codeline lineno="215"><highlight class="comment"><sp/><sp/>assert(sb->blockSize);</highlight></codeline> <codeline lineno="216"><highlight class="comment"><sp/><sp/>assert((unsigned)sb->blockSize<sp/>>=<sp/>sizeof(bTreeHeader));</highlight></codeline> <codeline lineno="217"><highlight class="comment"></highlight></codeline> <codeline lineno="218"><highlight class="comment"><sp/><sp/>bTreeHeader<sp/>*<sp/>bth<sp/>=<sp/>new<sp/>bTreeHeader;</highlight></codeline> <codeline lineno="219"><highlight class="comment"><sp/><sp/>assert(bth);</highlight></codeline> <codeline lineno="220"><highlight class="comment"><sp/><sp/>memset(bth,<sp/>0,<sp/>sizeof(bTreeHeader));</highlight></codeline> <codeline lineno="221"><highlight class="comment"></highlight></codeline> <codeline lineno="222"><highlight class="comment"><sp/><sp/>bth->firstDeleted<sp/>=<sp/>-1;</highlight></codeline> <codeline lineno="223"><highlight class="comment"><sp/><sp/>bth->firstNodeOffset<sp/>=<sp/>-1;</highlight></codeline> <codeline lineno="224"><highlight class="comment"><sp/><sp/>bth->treeDepth<sp/>=<sp/>1;</highlight></codeline> <codeline lineno="225"><highlight class="comment"><sp/><sp/>bth->treeWidth<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="226"><highlight class="comment"><sp/><sp/>bth->treeLeafCount<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="227"><highlight class="comment"></highlight></codeline> <codeline lineno="228"><highlight class="comment"><sp/><sp/>//<sp/>create<sp/>the<sp/>root<sp/>dir<sp/>inode<sp/>here</highlight></codeline> <codeline lineno="229"><highlight class="comment"></highlight></codeline> <codeline lineno="230"><highlight class="comment"><sp/><sp/>ubixfsInode<sp/>*<sp/>inode<sp/>=<sp/>new<sp/>ubixfsInode;</highlight></codeline> <codeline lineno="231"><highlight class="comment"><sp/><sp/>assert(inode);</highlight></codeline> <codeline lineno="232"><highlight class="comment"><sp/><sp/>if<sp/>(inode<sp/>==<sp/>NULL)<sp/>return<sp/>-1;</highlight></codeline> <codeline lineno="233"><highlight class="comment"><sp/><sp/>memset(inode,<sp/>0,<sp/>sizeof(ubixfsInode));</highlight></codeline> <codeline lineno="234"><highlight class="comment"></highlight></codeline> <codeline lineno="235"><highlight class="comment"><sp/><sp/>inode->magic1<sp/>=<sp/>UBIXFS_INODE_MAGIC;</highlight></codeline> <codeline lineno="236"><highlight class="comment"></highlight></codeline> <codeline lineno="237"><highlight class="comment"><sp/><sp/>//<sp/>inodes<sp/>point<sp/>to<sp/>themselves</highlight></codeline> <codeline lineno="238"><highlight class="comment"><sp/><sp/>inode->inodeNum.AG<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="239"><highlight class="comment"><sp/><sp/>inode->inodeNum.start<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="240"><highlight class="comment"><sp/><sp/>inode->inodeNum.len<sp/>=<sp/>1;</highlight></codeline> <codeline lineno="241"><highlight class="comment"></highlight></codeline> <codeline lineno="242"><highlight class="comment"><sp/><sp/>//<sp/>root<sp/>dir<sp/>has<sp/>no<sp/>parent<sp/>directory</highlight></codeline> <codeline lineno="243"><highlight class="comment"><sp/><sp/>inode->parent.iAddr.AG<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="244"><highlight class="comment"><sp/><sp/>inode->parent.iAddr.start<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="245"><highlight class="comment"><sp/><sp/>inode->parent.iAddr.len<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="246"><highlight class="comment"></highlight></codeline> <codeline lineno="247"><highlight class="comment"><sp/><sp/>//<sp/>this<sp/>is<sp/>part<sp/>of<sp/>the<sp/>root<sp/>dir<sp/>structure<sp/>(the<sp/>bTreeHeader)</highlight></codeline> <codeline lineno="248"><highlight class="comment"><sp/><sp/>inode->blocks.direct[0].AG<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="249"><highlight class="comment"><sp/><sp/>inode->blocks.direct[0].start<sp/>=<sp/>1;</highlight></codeline> <codeline lineno="250"><highlight class="comment"><sp/><sp/>inode->blocks.direct[0].len<sp/>=<sp/>1;</highlight></codeline> <codeline lineno="251"><highlight class="comment"><sp/><sp/><sp/></highlight></codeline> <codeline lineno="252"><highlight class="comment"><sp/><sp/>inode->blocks.maxDirectRange<sp/>=<sp/>sizeof(bTreeHeader);</highlight></codeline> <codeline lineno="253"><highlight class="comment"><sp/><sp/>inode->blocks.size<sp/>=<sp/>sizeof(bTreeHeader);</highlight></codeline> <codeline lineno="254"><highlight class="comment"></highlight></codeline> <codeline lineno="255"><highlight class="comment"><sp/><sp/>strcpy(inode->name,<sp/>"/");</highlight></codeline> <codeline lineno="256"><highlight class="comment"><sp/><sp/>inode->uid<sp/>=<sp/>getuid();</highlight></codeline> <codeline lineno="257"><highlight class="comment"><sp/><sp/>inode->gid<sp/>=<sp/>getgid();</highlight></codeline> <codeline lineno="258"><highlight class="comment"><sp/><sp/>//<sp/>inode->mode</highlight></codeline> <codeline lineno="259"><highlight class="comment"><sp/><sp/>inode->flags<sp/>=<sp/>INODE_DIRECTORY;</highlight></codeline> <codeline lineno="260"><highlight class="comment"><sp/><sp/>//<sp/>inode->createTime</highlight></codeline> <codeline lineno="261"><highlight class="comment"><sp/><sp/>//<sp/>inode->lastModifiedTime</highlight></codeline> <codeline lineno="262"><highlight class="comment"><sp/><sp/>//<sp/>inode->type</highlight></codeline> <codeline lineno="263"><highlight class="comment"></highlight></codeline> <codeline lineno="264"><highlight class="comment"><sp/><sp/>inode->attributes.AG<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="265"><highlight class="comment"><sp/><sp/>inode->attributes.start<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="266"><highlight class="comment"><sp/><sp/>inode->attributes.len<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="267"><highlight class="comment"></highlight></codeline> <codeline lineno="268"><highlight class="comment"><sp/><sp/>inode->inodeSize<sp/>=<sp/>sb->inodeSize;</highlight></codeline> <codeline lineno="269"><highlight class="comment"></highlight></codeline> <codeline lineno="270"><highlight class="comment"><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="271"><highlight class="comment"><sp/><sp/><sp/>*<sp/>next<sp/>and<sp/>prev<sp/>are<sp/>used<sp/>in<sp/>memory<sp/>to<sp/>hold<sp/>pointers<sp/>to<sp/>the<sp/>next/prev</highlight></codeline> <codeline lineno="272"><highlight class="comment"><sp/><sp/><sp/>*<sp/>inodes<sp/>in<sp/>this<sp/>dir.<sp/><sp/>On<sp/>disk<sp/>they<sp/>may<sp/>have<sp/>another<sp/>value,<sp/>but<sp/>for</highlight></codeline> <codeline lineno="273"><highlight class="comment"><sp/><sp/><sp/>*<sp/>now<sp/>they<sp/>should<sp/>be<sp/>set<sp/>to<sp/>null.</highlight></codeline> <codeline lineno="274"><highlight class="comment"><sp/><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="275"><highlight class="comment"></highlight></codeline> <codeline lineno="276"><highlight class="comment"><sp/><sp/>inode->next.offset<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="277"><highlight class="comment"><sp/><sp/>inode->prev.offset<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="278"><highlight class="comment"></highlight></codeline> <codeline lineno="279"><highlight class="comment"><sp/><sp/>//<sp/>write<sp/>out<sp/>the<sp/>"root"<sp/>dir<sp/>inode</highlight></codeline> <codeline lineno="280"><highlight class="comment"></highlight></codeline> <codeline lineno="281"><highlight class="comment"><sp/><sp/>dev->write(dev,<sp/></highlight></codeline> <codeline lineno="282"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>inode,<sp/></highlight></codeline> <codeline lineno="283"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>((inode->inodeNum.AG<sp/><<<sp/>sb->AGShift)<sp/>+</highlight></codeline> <codeline lineno="284"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>inode->inodeNum.start)<sp/>*<sp/>(sb->blockSize<sp/>/<sp/>512),</highlight></codeline> <codeline lineno="285"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>sb->inodeSize<sp/>/<sp/>512</highlight></codeline> <codeline lineno="286"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>);<sp/>//<sp/>dev->write</highlight></codeline> <codeline lineno="287"><highlight class="comment"></highlight></codeline> <codeline lineno="288"><highlight class="comment"><sp/><sp/>//<sp/>write<sp/>out<sp/>the<sp/>"root"<sp/>dir</highlight></codeline> <codeline lineno="289"><highlight class="comment"></highlight></codeline> <codeline lineno="290"><highlight class="comment"><sp/><sp/>dev->write(dev,<sp/></highlight></codeline> <codeline lineno="291"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>bth,<sp/></highlight></codeline> <codeline lineno="292"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>((inode->blocks.direct[0].AG<sp/><<<sp/>sb->AGShift)<sp/>+<sp/></highlight></codeline> <codeline lineno="293"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>inode->blocks.direct[0].start)<sp/>*<sp/>(sb->blockSize<sp/>/<sp/>512),</highlight></codeline> <codeline lineno="294"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>sb->blockSize<sp/>/<sp/>512</highlight></codeline> <codeline lineno="295"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>);<sp/>//<sp/>dev->write</highlight></codeline> <codeline lineno="296"><highlight class="comment"></highlight></codeline> <codeline lineno="297"><highlight class="comment"><sp/><sp/>delete<sp/>inode;</highlight></codeline> <codeline lineno="298"><highlight class="comment"><sp/><sp/>delete<sp/>bth;</highlight></codeline> <codeline lineno="299"><highlight class="comment"><sp/><sp/>delete<sp/>sb;</highlight></codeline> <codeline lineno="300"><highlight class="comment"><sp/><sp/>cout<sp/><<<sp/>"format<sp/>complete"<sp/><<<sp/>endl;</highlight></codeline> <codeline lineno="301"><highlight class="comment"><sp/><sp/>return<sp/>0;</highlight></codeline> <codeline lineno="302"><highlight class="comment">}<sp/>//<sp/>UbixFS::vfs_format</highlight></codeline> <codeline lineno="303"><highlight class="comment"></highlight></codeline> <codeline lineno="304"><highlight class="comment">void<sp/>*</highlight></codeline> <codeline lineno="305"><highlight class="comment">UbixFS::vfs_mknod(const<sp/>char<sp/>*path,<sp/>mode_t<sp/>mode)<sp/>{</highlight></codeline> <codeline lineno="306"><highlight class="comment"><sp/><sp/>return<sp/>mknod(path,<sp/>0,<sp/>mode);<sp/><sp/>//<sp/><-<sp/>this<sp/>probably<sp/>isn't<sp/>correct</highlight></codeline> <codeline lineno="307"><highlight class="comment">}<sp/>//<sp/>UbixFS::vfs_mknod</highlight></codeline> <codeline lineno="308"><highlight class="comment"></highlight></codeline> <codeline lineno="309"><highlight class="comment">int</highlight></codeline> <codeline lineno="310"><highlight class="comment">UbixFS::vfs_open(const<sp/>char<sp/>*<sp/>filename,<sp/>fileDescriptor<sp/>*<sp/>fd,<sp/>int<sp/>flags,<sp/>...)<sp/>{</highlight></codeline> <codeline lineno="311"><highlight class="comment"><sp/><sp/>if<sp/>(filename<sp/>==<sp/>NULL<sp/>||<sp/>fd<sp/>==<sp/>NULL)<sp/>return<sp/>-1;</highlight></codeline> <codeline lineno="312"><highlight class="comment"><sp/><sp/>flags<sp/>=<sp/>flags;</highlight></codeline> <codeline lineno="313"><highlight class="comment"><sp/><sp/>fd->inode<sp/>=<sp/>NULL;</highlight></codeline> <codeline lineno="314"><highlight class="comment"><sp/><sp/>fd->offset<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="315"><highlight class="comment"><sp/><sp/>fd->size<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="316"><highlight class="comment"><sp/><sp/>//<sp/>look<sp/>up<sp/>the<sp/>file<sp/>here</highlight></codeline> <codeline lineno="317"><highlight class="comment"><sp/><sp/>return<sp/>0;</highlight></codeline> <codeline lineno="318"><highlight class="comment">}<sp/>//<sp/>UbixFS::vfs_open</highlight></codeline> <codeline lineno="319"><highlight class="comment"></highlight></codeline> <codeline lineno="320"><highlight class="comment">size_t</highlight></codeline> <codeline lineno="321"><highlight class="comment">UbixFS::vfs_read(fileDescriptor<sp/>*<sp/>fd,<sp/>void<sp/>*<sp/>data,<sp/>off_t<sp/>offset,<sp/>size_t<sp/>size)<sp/>{</highlight></codeline> <codeline lineno="322"><highlight class="comment"><sp/><sp/></highlight></codeline> <codeline lineno="323"><highlight class="comment"><sp/><sp/>unsigned<sp/>int<sp/>i;</highlight></codeline> <codeline lineno="324"><highlight class="comment"><sp/><sp/>off_t<sp/>sum,<sp/>startingBlock;</highlight></codeline> <codeline lineno="325"><highlight class="comment"><sp/><sp/>size_t<sp/>runSize,<sp/>sectorCount,<sp/>totalSize,<sp/>bSize;<sp/>//<sp/>blockSize</highlight></codeline> <codeline lineno="326"><highlight class="comment"><sp/><sp/>ubixfsInode<sp/>*<sp/>inode<sp/>=<sp/>NULL;</highlight></codeline> <codeline lineno="327"><highlight class="comment"></highlight></codeline> <codeline lineno="328"><highlight class="comment"><sp/><sp/>if<sp/>(fd<sp/>==<sp/>NULL<sp/>||<sp/>data<sp/>==<sp/>NULL)<sp/>return<sp/>~0;</highlight></codeline> <codeline lineno="329"><highlight class="comment"></highlight></codeline> <codeline lineno="330"><highlight class="comment"><sp/><sp/>if<sp/>(size<sp/>==<sp/>0)<sp/>return<sp/>0;<sp/>//<sp/>don't<sp/>fail<sp/>if<sp/>size<sp/>is<sp/>0?</highlight></codeline> <codeline lineno="331"><highlight class="comment"><sp/><sp/><sp/></highlight></codeline> <codeline lineno="332"><highlight class="comment"><sp/><sp/>assert(device);</highlight></codeline> <codeline lineno="333"><highlight class="comment"><sp/><sp/>assert(superBlock);</highlight></codeline> <codeline lineno="334"><highlight class="comment"></highlight></codeline> <codeline lineno="335"><highlight class="comment"><sp/><sp/>inode<sp/>=<sp/>static_cast<ubixfsInode<sp/>*>(fd->inode);</highlight></codeline> <codeline lineno="336"><highlight class="comment"></highlight></codeline> <codeline lineno="337"><highlight class="comment"><sp/><sp/>assert(inode);</highlight></codeline> <codeline lineno="338"><highlight class="comment"></highlight></codeline> <codeline lineno="339"><highlight class="comment"><sp/><sp/>bSize<sp/>=<sp/>superBlock->blockSize;</highlight></codeline> <codeline lineno="340"><highlight class="comment"></highlight></codeline> <codeline lineno="341"><highlight class="comment"><sp/><sp/>totalSize<sp/>=<sp/>sum<sp/>=<sp/>i<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="342"><highlight class="comment"><sp/><sp/></highlight></codeline> <codeline lineno="343"><highlight class="comment"><sp/><sp/>while<sp/>(size<sp/>><sp/>0)<sp/>{</highlight></codeline> <codeline lineno="344"><highlight class="comment"></highlight></codeline> <codeline lineno="345"><highlight class="comment"><sp/><sp/><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="346"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>place<sp/>check<sp/>here<sp/>to<sp/>see<sp/>which<sp/>set<sp/>of<sp/>blocks<sp/>we're<sp/>looking<sp/>through</highlight></codeline> <codeline lineno="347"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="348"><highlight class="comment"></highlight></codeline> <codeline lineno="349"><highlight class="comment"><sp/><sp/><sp/><sp/>//<sp/>scan<sp/>through<sp/>direct<sp/>blocks</highlight></codeline> <codeline lineno="350"><highlight class="comment"><sp/><sp/><sp/><sp/>do<sp/>{</highlight></codeline> <codeline lineno="351"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>if<sp/>(offset<sp/>>=<sp/>sum<sp/>&&<sp/>offset<sp/><<sp/>sum<sp/>+<sp/>inode->blocks.direct[i].len<sp/>*<sp/>bSize)<sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>break;</highlight></codeline> <codeline lineno="352"><highlight class="comment"></highlight></codeline> <codeline lineno="353"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>sum<sp/>+=<sp/>inode->blocks.direct[i++].len<sp/>*<sp/>bSize;</highlight></codeline> <codeline lineno="354"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/></highlight></codeline> <codeline lineno="355"><highlight class="comment"><sp/><sp/><sp/><sp/>}<sp/>while<sp/>(i<sp/><<sp/>NUM_DIRECT_BLOCKS);</highlight></codeline> <codeline lineno="356"><highlight class="comment"></highlight></codeline> <codeline lineno="357"><highlight class="comment"><sp/><sp/><sp/><sp/>startingBlock<sp/>=<sp/>(inode->blocks.direct[i].AG<sp/><<<sp/>superBlock->AGShift)<sp/>+<sp/></highlight></codeline> <codeline lineno="358"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>inode->blocks.direct[i].start<sp/>+<sp/>((offset<sp/>-<sp/>sum)<sp/>/<sp/>bSize);</highlight></codeline> <codeline lineno="359"><highlight class="comment"></highlight></codeline> <codeline lineno="360"><highlight class="comment"><sp/><sp/><sp/><sp/>runSize<sp/>=<sp/>inode->blocks.direct[i].len<sp/>*<sp/>bSize;</highlight></codeline> <codeline lineno="361"><highlight class="comment"></highlight></codeline> <codeline lineno="362"><highlight class="comment"><sp/><sp/><sp/><sp/>//<sp/>startingBlock<sp/>is<sp/>in<sp/>4k<sp/>blocks</highlight></codeline> <codeline lineno="363"><highlight class="comment"><sp/><sp/><sp/><sp/>startingBlock<sp/>*=<sp/>(bSize<sp/>/<sp/>512);</highlight></codeline> <codeline lineno="364"><highlight class="comment"><sp/><sp/><sp/><sp/>//<sp/>startingBlock<sp/>is<sp/>now<sp/>in<sp/>sectors</highlight></codeline> <codeline lineno="365"><highlight class="comment"></highlight></codeline> <codeline lineno="366"><highlight class="comment"><sp/><sp/><sp/><sp/>if<sp/>(runSize<sp/>>=<sp/>size)<sp/>{</highlight></codeline> <codeline lineno="367"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>runSize<sp/>=<sp/>size;</highlight></codeline> <codeline lineno="368"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>size<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="369"><highlight class="comment"><sp/><sp/><sp/><sp/>}<sp/>else<sp/>{<sp/></highlight></codeline> <codeline lineno="370"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>size<sp/>-=<sp/>runSize;</highlight></codeline> <codeline lineno="371"><highlight class="comment"><sp/><sp/><sp/><sp/>}<sp/>//<sp/>else</highlight></codeline> <codeline lineno="372"><highlight class="comment"></highlight></codeline> <codeline lineno="373"><highlight class="comment"><sp/><sp/><sp/><sp/>sectorCount<sp/>=<sp/>runSize<sp/>/<sp/>512;</highlight></codeline> <codeline lineno="374"><highlight class="comment"><sp/><sp/></highlight></codeline> <codeline lineno="375"><highlight class="comment"><sp/><sp/><sp/><sp/>cout<sp/><<<sp/>"device->read(device,<sp/>data,<sp/>"<sp/><<<sp/>startingBlock<sp/><<<sp/>",<sp/>";</highlight></codeline> <codeline lineno="376"><highlight class="comment"><sp/><sp/><sp/><sp/>cout<sp/><<<sp/>sectorCount<sp/><<<sp/>");"<sp/><<<sp/>endl;<sp/></highlight></codeline> <codeline lineno="377"><highlight class="comment"></highlight></codeline> <codeline lineno="378"><highlight class="comment"><sp/><sp/><sp/><sp/>device->read(device,<sp/>data,<sp/>startingBlock,<sp/>sectorCount);</highlight></codeline> <codeline lineno="379"><highlight class="comment"></highlight></codeline> <codeline lineno="380"><highlight class="comment"><sp/><sp/><sp/><sp/>(uInt8<sp/>*)data<sp/>+=<sp/>runSize;</highlight></codeline> <codeline lineno="381"><highlight class="comment"><sp/><sp/><sp/><sp/>totalSize<sp/>+=<sp/>runSize;</highlight></codeline> <codeline lineno="382"><highlight class="comment"><sp/><sp/>}<sp/>//<sp/>while<sp/><sp/></highlight></codeline> <codeline lineno="383"><highlight class="comment"><sp/><sp/>return<sp/>totalSize;</highlight></codeline> <codeline lineno="384"><highlight class="comment">}<sp/>//<sp/>UbixFS::vfs_read</highlight></codeline> <codeline lineno="385"><highlight class="comment"></highlight></codeline> <codeline lineno="386"><highlight class="comment">size_t</highlight></codeline> <codeline lineno="387"><highlight class="comment">UbixFS::vfs_write(fileDescriptor<sp/>*<sp/>fd,<sp/>void<sp/>*<sp/>data,<sp/>off_t<sp/>offset,<sp/>size_t<sp/>size)<sp/>{</highlight></codeline> <codeline lineno="388"><highlight class="comment"><sp/><sp/>//<sp/>char<sp/>*<sp/>sector[512];<sp/><sp/>//<sp/>used<sp/>to<sp/>pad</highlight></codeline> <codeline lineno="389"><highlight class="comment"><sp/><sp/>unsigned<sp/>int<sp/>i,<sp/>whichBlocks;</highlight></codeline> <codeline lineno="390"><highlight class="comment"><sp/><sp/>off_t<sp/>sum,<sp/>startingBlock,<sp/>EORPos,<sp/>maxRange;</highlight></codeline> <codeline lineno="391"><highlight class="comment"><sp/><sp/>size_t<sp/>runSize,<sp/>runRemainder,<sp/>sectorCount,<sp/>totalSize,<sp/>bSize;<sp/>//<sp/>blockSize</highlight></codeline> <codeline lineno="392"><highlight class="comment"><sp/><sp/>ubixfsInode<sp/>*<sp/>inode<sp/>=<sp/>NULL;</highlight></codeline> <codeline lineno="393"><highlight class="comment"><sp/><sp/>blockRun<sp/>br;</highlight></codeline> <codeline lineno="394"><highlight class="comment"></highlight></codeline> <codeline lineno="395"><highlight class="comment"><sp/><sp/>if<sp/>(fd<sp/>==<sp/>NULL<sp/>||<sp/>data<sp/>==<sp/>NULL)<sp/>return<sp/>~0;</highlight></codeline> <codeline lineno="396"><highlight class="comment"></highlight></codeline> <codeline lineno="397"><highlight class="comment"><sp/><sp/>if<sp/>(size<sp/>==<sp/>0)<sp/>return<sp/>0;<sp/>//<sp/>don't<sp/>fail<sp/>if<sp/>size<sp/>is<sp/>0?</highlight></codeline> <codeline lineno="398"><highlight class="comment"></highlight></codeline> <codeline lineno="399"><highlight class="comment"><sp/><sp/>assert(device);</highlight></codeline> <codeline lineno="400"><highlight class="comment"><sp/><sp/>assert(superBlock);</highlight></codeline> <codeline lineno="401"><highlight class="comment"></highlight></codeline> <codeline lineno="402"><highlight class="comment"><sp/><sp/>inode<sp/>=<sp/>static_cast<ubixfsInode<sp/>*>(fd->inode);</highlight></codeline> <codeline lineno="403"><highlight class="comment"></highlight></codeline> <codeline lineno="404"><highlight class="comment"><sp/><sp/>assert(inode);</highlight></codeline> <codeline lineno="405"><highlight class="comment"></highlight></codeline> <codeline lineno="406"><highlight class="comment"><sp/><sp/>bSize<sp/>=<sp/>superBlock->blockSize;</highlight></codeline> <codeline lineno="407"><highlight class="comment"><sp/><sp/>assert(bSize<sp/>!=<sp/>0);</highlight></codeline> <codeline lineno="408"><highlight class="comment"></highlight></codeline> <codeline lineno="409"><highlight class="comment"><sp/><sp/>totalSize<sp/>=<sp/>sum<sp/>=<sp/>i<sp/>=<sp/>whichBlocks<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="410"><highlight class="comment"></highlight></codeline> <codeline lineno="411"><highlight class="comment"><sp/><sp/>EORPos<sp/>=<sp/>offset<sp/>+<sp/>size;<sp/><sp/>//<sp/>compute<sp/>End<sp/>Of<sp/>Run<sp/>Position</highlight></codeline> <codeline lineno="412"><highlight class="comment"><sp/><sp/>maxRange<sp/>=<sp/>inode->blocks.maxDirectRange;</highlight></codeline> <codeline lineno="413"><highlight class="comment"></highlight></codeline> <codeline lineno="414"><highlight class="comment"><sp/><sp/>if<sp/>(inode->blocks.maxIndirectRange<sp/>><sp/>maxRange)<sp/>{</highlight></codeline> <codeline lineno="415"><highlight class="comment"><sp/><sp/><sp/><sp/>maxRange<sp/>=<sp/>inode->blocks.maxIndirectRange;</highlight></codeline> <codeline lineno="416"><highlight class="comment"><sp/><sp/><sp/><sp/>whichBlocks<sp/>=<sp/>1;</highlight></codeline> <codeline lineno="417"><highlight class="comment"><sp/><sp/>}</highlight></codeline> <codeline lineno="418"><highlight class="comment"></highlight></codeline> <codeline lineno="419"><highlight class="comment"><sp/><sp/>if<sp/>(inode->blocks.maxDoubleIndirectRange<sp/>><sp/>maxRange)<sp/>{</highlight></codeline> <codeline lineno="420"><highlight class="comment"><sp/><sp/><sp/><sp/>maxRange<sp/>=<sp/>inode->blocks.maxDoubleIndirectRange;</highlight></codeline> <codeline lineno="421"><highlight class="comment"><sp/><sp/><sp/><sp/>whichBlocks<sp/>=<sp/>2;</highlight></codeline> <codeline lineno="422"><highlight class="comment"><sp/><sp/>}<sp/></highlight></codeline> <codeline lineno="423"><highlight class="comment"><sp/><sp/></highlight></codeline> <codeline lineno="424"><highlight class="comment"><sp/><sp/>if<sp/>(EORPos<sp/>><sp/>maxRange)<sp/>{</highlight></codeline> <codeline lineno="425"><highlight class="comment"><sp/><sp/><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="426"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>The<sp/>offset+size<sp/>is<sp/>greater<sp/>than<sp/>the<sp/>size<sp/>of<sp/>the<sp/>file,<sp/>so<sp/>we<sp/>need<sp/>to</highlight></codeline> <codeline lineno="427"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>extend<sp/>out<sp/>the<sp/>file.<sp/>Scan<sp/>through<sp/>the<sp/>direct<sp/>blocks<sp/>(FIX<sp/>LATER)</highlight></codeline> <codeline lineno="428"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>to<sp/>find<sp/>out<sp/>where<sp/>we<sp/>need<sp/>to<sp/>extend</highlight></codeline> <codeline lineno="429"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="430"><highlight class="comment"><sp/><sp/><sp/><sp/>switch<sp/>(whichBlocks)<sp/>{</highlight></codeline> <codeline lineno="431"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>case<sp/>0:</highlight></codeline> <codeline lineno="432"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>while<sp/>(i<sp/><<sp/>NUM_DIRECT_BLOCKS<sp/>&&<sp/>inode->blocks.direct[i].len<sp/>!=<sp/>0)<sp/>++i;</highlight></codeline> <codeline lineno="433"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>//<sp/>i<sp/>holds<sp/>which<sp/>direct<sp/>block<sp/>we're<sp/>going<sp/>to<sp/>add<sp/>to</highlight></codeline> <codeline lineno="434"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>break;</highlight></codeline> <codeline lineno="435"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>case<sp/>1:</highlight></codeline> <codeline lineno="436"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>case<sp/>2:</highlight></codeline> <codeline lineno="437"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>assert(false);<sp/><sp/>//<sp/>UNFINISHED</highlight></codeline> <codeline lineno="438"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>break;</highlight></codeline> <codeline lineno="439"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>default:</highlight></codeline> <codeline lineno="440"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>assert(false);<sp/><sp/>//<sp/>sanity<sp/>check</highlight></codeline> <codeline lineno="441"><highlight class="comment"><sp/><sp/><sp/><sp/>}<sp/>//<sp/>switch</highlight></codeline> <codeline lineno="442"><highlight class="comment"></highlight></codeline> <codeline lineno="443"><highlight class="comment"><sp/><sp/><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="444"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>NOTE:<sp/>it's<sp/>possible<sp/>that<sp/>if<sp/>we<sp/>scan<sp/>through<sp/>to<sp/>find<sp/>where<sp/>the</highlight></codeline> <codeline lineno="445"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>run<sp/>goes,<sp/>we<sp/>might<sp/>be<sp/>able<sp/>to<sp/>extend<sp/>the<sp/>previous<sp/>block<sp/>extent.</highlight></codeline> <codeline lineno="446"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>This<sp/>will<sp/>require<sp/>that<sp/>we<sp/>set<sp/>up<sp/>br.start<sp/>to<sp/>be<sp/>where<sp/>we'd<sp/>like<sp/>to</highlight></codeline> <codeline lineno="447"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>start<sp/>looking<sp/>through<sp/>the<sp/>free<sp/>block<sp/>list,<sp/>and<sp/>then<sp/>modifying</highlight></codeline> <codeline lineno="448"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>getFreeBlock()<sp/>to<sp/>honour<sp/>that.</highlight></codeline> <codeline lineno="449"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="450"><highlight class="comment"></highlight></codeline> <codeline lineno="451"><highlight class="comment"><sp/><sp/><sp/><sp/>br.AG<sp/>=<sp/>inode->inodeNum.AG;<sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>//<sp/>request<sp/>a<sp/>sane<sp/>allocation<sp/>group</highlight></codeline> <codeline lineno="452"><highlight class="comment"><sp/><sp/><sp/><sp/>br.start<sp/>=<sp/>0;<sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>//<sp/>getFreeBlock()<sp/>will<sp/>ignore<sp/>this</highlight></codeline> <codeline lineno="453"><highlight class="comment"></highlight></codeline> <codeline lineno="454"><highlight class="comment"><sp/><sp/><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="455"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>The<sp/>length<sp/>that<sp/>we<sp/>need<sp/>is<sp/>determined<sp/>by<sp/>how<sp/>much<sp/>extra<sp/>slack<sp/>we<sp/></highlight></codeline> <codeline lineno="456"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>already<sp/>have<sp/>in<sp/>the<sp/>pre-allocated<sp/>blocks.</highlight></codeline> <codeline lineno="457"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>e.g.<sp/>(assumes<sp/>4k<sp/>blocks)</highlight></codeline> <codeline lineno="458"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>bSize<sp/>=<sp/>4096</highlight></codeline> <codeline lineno="459"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>maxRange<sp/>=<sp/>4096</highlight></codeline> <codeline lineno="460"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>size<sp/>=<sp/>3000</highlight></codeline> <codeline lineno="461"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>offset<sp/>=<sp/>3000</highlight></codeline> <codeline lineno="462"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>size<sp/>=<sp/>4000</highlight></codeline> <codeline lineno="463"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>[---<sp/>data<sp/>block<sp/>---][---<sp/>data<sp/>block<sp/>---]<sp/><sp/><----<sp/>blocks<sp/>on<sp/>disk</highlight></codeline> <codeline lineno="464"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/><-file<sp/>data-><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><----<sp/>actual<sp/>file<sp/>size</highlight></codeline> <codeline lineno="465"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><-----><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><----<sp/>slack</highlight></codeline> <codeline lineno="466"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>[<sp/><sp/>data<sp/>block<sp/>size<sp/>]<sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><----<sp/>maxRange</highlight></codeline> <codeline lineno="467"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>|<sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><----<sp/>offset</highlight></codeline> <codeline lineno="468"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>*****************<sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><----<sp/>new<sp/>data</highlight></codeline> <codeline lineno="469"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*</highlight></codeline> <codeline lineno="470"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>In<sp/>the<sp/>above<sp/>example,<sp/>you'd<sp/>need<sp/>at<sp/>least<sp/>one<sp/>more<sp/>block<sp/>to<sp/>write</highlight></codeline> <codeline lineno="471"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>out<sp/>the<sp/>data.<sp/><sp/></highlight></codeline> <codeline lineno="472"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>((offset<sp/>+<sp/>size)<sp/>-<sp/>maxRange<sp/>+<sp/>(bSize-1))<sp/>/<sp/>bSize</highlight></codeline> <codeline lineno="473"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>((3000<sp/>+<sp/>4000)<sp/>-<sp/>4096<sp/>+<sp/>(4095))<sp/>/<sp/>4096<sp/>==<sp/>1<sp/>(rounded<sp/>down)</highlight></codeline> <codeline lineno="474"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>And<sp/>then<sp/>we<sp/>expand<sp/>it<sp/>by<sp/>a<sp/>little<sp/>extra<sp/>so<sp/>we<sp/>don't<sp/>have<sp/>to<sp/>keep<sp/></highlight></codeline> <codeline lineno="475"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*<sp/>looking<sp/>for<sp/>more<sp/>blocks.<sp/>Currently<sp/>we<sp/>use<sp/>32k<sp/>of<sp/>slack<sp/>(or<sp/>8<sp/>blocks)</highlight></codeline> <codeline lineno="476"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="477"><highlight class="comment"></highlight></codeline> <codeline lineno="478"><highlight class="comment"><sp/><sp/><sp/><sp/>br.len<sp/>=<sp/>((EORPos<sp/>-<sp/>maxRange<sp/>+<sp/>(bSize-1))<sp/>/<sp/>bSize);</highlight></codeline> <codeline lineno="479"><highlight class="comment"></highlight></codeline> <codeline lineno="480"><highlight class="comment"><sp/><sp/><sp/><sp/>if<sp/>(br.len<sp/><<sp/>8)<sp/>br.len<sp/>=<sp/>8;<sp/><sp/>//<sp/>we<sp/>allocate<sp/>32k<sp/>if<sp/>the<sp/>file<sp/>needs<sp/>to<sp/>grow</highlight></codeline> <codeline lineno="481"><highlight class="comment"></highlight></codeline> <codeline lineno="482"><highlight class="comment"><sp/><sp/><sp/><sp/>br<sp/>=<sp/>getFreeBlock(br);</highlight></codeline> <codeline lineno="483"><highlight class="comment"><sp/><sp/><sp/><sp/>assert(br.len<sp/>><sp/>0);</highlight></codeline> <codeline lineno="484"><highlight class="comment"><sp/><sp/><sp/><sp/>switch<sp/>(whichBlocks)<sp/>{</highlight></codeline> <codeline lineno="485"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>case<sp/>0:</highlight></codeline> <codeline lineno="486"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>inode->blocks.direct[i]<sp/>=<sp/>br;</highlight></codeline> <codeline lineno="487"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>inode->blocks.maxDirectRange<sp/>+=<sp/>br.len<sp/>*<sp/>bSize;</highlight></codeline> <codeline lineno="488"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>break;</highlight></codeline> <codeline lineno="489"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>case<sp/>1:</highlight></codeline> <codeline lineno="490"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>assert(false);<sp/>//<sp/>UNFINISHED</highlight></codeline> <codeline lineno="491"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>inode->blocks.maxIndirectRange<sp/>+=<sp/>br.len<sp/>*<sp/>bSize;</highlight></codeline> <codeline lineno="492"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>break;</highlight></codeline> <codeline lineno="493"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>case<sp/>2:</highlight></codeline> <codeline lineno="494"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>assert(false);<sp/>//<sp/>UNFINISHED</highlight></codeline> <codeline lineno="495"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>inode->blocks.maxDoubleIndirectRange<sp/>+=<sp/>br.len<sp/>*<sp/>bSize;</highlight></codeline> <codeline lineno="496"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>break;</highlight></codeline> <codeline lineno="497"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>default:<sp/><sp/><sp/></highlight></codeline> <codeline lineno="498"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>assert(false);<sp/>//<sp/>sanity<sp/>check</highlight></codeline> <codeline lineno="499"><highlight class="comment"><sp/><sp/><sp/><sp/>}<sp/>//<sp/>switch</highlight></codeline> <codeline lineno="500"><highlight class="comment"></highlight></codeline> <codeline lineno="501"><highlight class="comment"><sp/><sp/><sp/><sp/>inode->blocks.size<sp/>=<sp/>EORPos;</highlight></codeline> <codeline lineno="502"><highlight class="comment"><sp/><sp/>}<sp/>//<sp/>if</highlight></codeline> <codeline lineno="503"><highlight class="comment"></highlight></codeline> <codeline lineno="504"><highlight class="comment"></highlight></codeline> <codeline lineno="505"><highlight class="comment"><sp/><sp/>runRemainder<sp/>=<sp/>size<sp/>%<sp/>512;</highlight></codeline> <codeline lineno="506"><highlight class="comment"><sp/><sp/>size<sp/>-=<sp/>runRemainder;</highlight></codeline> <codeline lineno="507"><highlight class="comment"></highlight></codeline> <codeline lineno="508"><highlight class="comment"><sp/><sp/>totalSize<sp/>=<sp/>sum<sp/>=<sp/>i<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="509"><highlight class="comment"></highlight></codeline> <codeline lineno="510"><highlight class="comment"><sp/><sp/>while<sp/>(size<sp/>><sp/>0)<sp/>{</highlight></codeline> <codeline lineno="511"><highlight class="comment"></highlight></codeline> <codeline lineno="512"><highlight class="comment"><sp/><sp/><sp/><sp/>/<sp/>place<sp/>check<sp/>here<sp/>to<sp/>see<sp/>which<sp/>set<sp/>of<sp/>blocks<sp/>we're<sp/>looking<sp/>through</highlight></codeline> <codeline lineno="513"><highlight class="comment"></highlight></codeline> <codeline lineno="514"><highlight class="comment"></highlight></codeline> <codeline lineno="515"><highlight class="comment"><sp/><sp/><sp/><sp/>//<sp/>scan<sp/>through<sp/>direct<sp/>blocks</highlight></codeline> <codeline lineno="516"><highlight class="comment"><sp/><sp/><sp/><sp/>do<sp/>{</highlight></codeline> <codeline lineno="517"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>if<sp/>(offset<sp/>>=<sp/>sum<sp/>&&<sp/>offset<sp/><<sp/>sum<sp/>+<sp/>inode->blocks.direct[i].len<sp/>*<sp/>bSize)</highlight></codeline> <codeline lineno="518"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>break;</highlight></codeline> <codeline lineno="519"><highlight class="comment"></highlight></codeline> <codeline lineno="520"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>sum<sp/>+=<sp/>inode->blocks.direct[i++].len<sp/>*<sp/>bSize;</highlight></codeline> <codeline lineno="521"><highlight class="comment"></highlight></codeline> <codeline lineno="522"><highlight class="comment"><sp/><sp/><sp/><sp/>}<sp/>while<sp/>(i<sp/><<sp/>NUM_DIRECT_BLOCKS);</highlight></codeline> <codeline lineno="523"><highlight class="comment"></highlight></codeline> <codeline lineno="524"><highlight class="comment"><sp/><sp/><sp/><sp/>startingBlock<sp/>=<sp/>(inode->blocks.direct[i].AG<sp/><<<sp/>superBlock->AGShift)<sp/>+</highlight></codeline> <codeline lineno="525"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>inode->blocks.direct[i].start<sp/>+<sp/>((offset<sp/>-<sp/>sum)<sp/>/<sp/>bSize);</highlight></codeline> <codeline lineno="526"><highlight class="comment"></highlight></codeline> <codeline lineno="527"><highlight class="comment"><sp/><sp/><sp/><sp/>runSize<sp/>=<sp/>inode->blocks.direct[i].len<sp/>*<sp/>bSize;</highlight></codeline> <codeline lineno="528"><highlight class="comment"></highlight></codeline> <codeline lineno="529"><highlight class="comment"><sp/><sp/><sp/><sp/>//<sp/>startingBlock<sp/>is<sp/>in<sp/>4k<sp/>blocks</highlight></codeline> <codeline lineno="530"><highlight class="comment"><sp/><sp/><sp/><sp/>startingBlock<sp/>*=<sp/>(bSize<sp/>/<sp/>512);</highlight></codeline> <codeline lineno="531"><highlight class="comment"><sp/><sp/><sp/><sp/>//<sp/>startingBlock<sp/>is<sp/>now<sp/>in<sp/>sectors</highlight></codeline> <codeline lineno="532"><highlight class="comment"></highlight></codeline> <codeline lineno="533"><highlight class="comment"><sp/><sp/><sp/><sp/>if<sp/>(runSize<sp/>>=<sp/>size)<sp/>{</highlight></codeline> <codeline lineno="534"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>runSize<sp/>=<sp/>size;</highlight></codeline> <codeline lineno="535"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>size<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="536"><highlight class="comment"><sp/><sp/><sp/><sp/>}<sp/>else<sp/>{</highlight></codeline> <codeline lineno="537"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>size<sp/>-=<sp/>runSize;</highlight></codeline> <codeline lineno="538"><highlight class="comment"><sp/><sp/><sp/><sp/>}<sp/>//<sp/>else</highlight></codeline> <codeline lineno="539"><highlight class="comment"></highlight></codeline> <codeline lineno="540"><highlight class="comment"><sp/><sp/><sp/><sp/>sectorCount<sp/>=<sp/>runSize<sp/>/<sp/>512;</highlight></codeline> <codeline lineno="541"><highlight class="comment"></highlight></codeline> <codeline lineno="542"><highlight class="comment"><sp/><sp/><sp/><sp/>cout<sp/><<<sp/>"device->write(device,<sp/>data,<sp/>"<sp/><<<sp/>startingBlock<sp/><<<sp/>",<sp/>";</highlight></codeline> <codeline lineno="543"><highlight class="comment"><sp/><sp/><sp/><sp/>cout<sp/><<<sp/>sectorCount<sp/><<<sp/>");"<sp/><<<sp/>endl;</highlight></codeline> <codeline lineno="544"><highlight class="comment"></highlight></codeline> <codeline lineno="545"><highlight class="comment"><sp/><sp/><sp/><sp/>device->write(device,<sp/>data,<sp/>startingBlock,<sp/>sectorCount);</highlight></codeline> <codeline lineno="546"><highlight class="comment"></highlight></codeline> <codeline lineno="547"><highlight class="comment"><sp/><sp/><sp/><sp/>(uInt8<sp/>*)data<sp/>+=<sp/>runSize;</highlight></codeline> <codeline lineno="548"><highlight class="comment"><sp/><sp/><sp/><sp/>totalSize<sp/>+=<sp/>runSize;</highlight></codeline> <codeline lineno="549"><highlight class="comment"><sp/><sp/>}<sp/>//<sp/>while</highlight></codeline> <codeline lineno="550"><highlight class="comment"></highlight></codeline> <codeline lineno="551"><highlight class="comment"><sp/><sp/>assert(runRemainder<sp/>!=<sp/>0);<sp/><sp/>//<sp/>UNFINISHED</highlight></codeline> <codeline lineno="552"><highlight class="comment"><sp/><sp/>return<sp/>totalSize;</highlight></codeline> <codeline lineno="553"><highlight class="comment">}<sp/>//<sp/>UbixFS::vfs_write</highlight></codeline> <codeline lineno="554"><highlight class="comment"></highlight></codeline> <codeline lineno="555"><highlight class="comment">int</highlight></codeline> <codeline lineno="556"><highlight class="comment">UbixFS::vfs_stop(void)<sp/>{</highlight></codeline> <codeline lineno="557"><highlight class="comment"><sp/><sp/>if<sp/>(vfs_sync()<sp/>!=<sp/>0)<sp/>return<sp/>-1;</highlight></codeline> <codeline lineno="558"><highlight class="comment"></highlight></codeline> <codeline lineno="559"><highlight class="comment"><sp/><sp/>//<sp/>you<sp/>must<sp/>delete<sp/>the<sp/>root<sp/>dir<sp/>first,<sp/>in<sp/>case<sp/>it<sp/>needs<sp/>to</highlight></codeline> <codeline lineno="560"><highlight class="comment"><sp/><sp/>//<sp/>still<sp/>write<sp/>anything<sp/>out</highlight></codeline> <codeline lineno="561"><highlight class="comment"></highlight></codeline> <codeline lineno="562"><highlight class="comment"><sp/><sp/>if<sp/>(root<sp/>!=<sp/>NULL)<sp/>{</highlight></codeline> <codeline lineno="563"><highlight class="comment"><sp/><sp/><sp/><sp/>ubixfsInode<sp/>*<sp/>rootInode<sp/>=<sp/>static_cast<ubixfsInode<sp/>*>(root->inode);</highlight></codeline> <codeline lineno="564"><highlight class="comment"><sp/><sp/><sp/><sp/>delete<sp/>rootInode->data.btPtr;<sp/></highlight></codeline> <codeline lineno="565"><highlight class="comment"><sp/><sp/><sp/><sp/>delete<sp/>rootInode;</highlight></codeline> <codeline lineno="566"><highlight class="comment"><sp/><sp/><sp/><sp/>root->inode<sp/>=<sp/>NULL;</highlight></codeline> <codeline lineno="567"><highlight class="comment"><sp/><sp/><sp/><sp/></highlight></codeline> <codeline lineno="568"><highlight class="comment"><sp/><sp/>}<sp/>//<sp/>if</highlight></codeline> <codeline lineno="569"><highlight class="comment"></highlight></codeline> <codeline lineno="570"><highlight class="comment"><sp/><sp/>delete<sp/>root;</highlight></codeline> <codeline lineno="571"><highlight class="comment"><sp/><sp/>delete<sp/>[]<sp/>freeBlockList;</highlight></codeline> <codeline lineno="572"><highlight class="comment"><sp/><sp/>delete<sp/>superBlock;</highlight></codeline> <codeline lineno="573"><highlight class="comment"></highlight></codeline> <codeline lineno="574"><highlight class="comment"><sp/><sp/>freeBlockList<sp/>=<sp/>NULL;</highlight></codeline> <codeline lineno="575"><highlight class="comment"><sp/><sp/>superBlock<sp/>=<sp/>NULL;<sp/></highlight></codeline> <codeline lineno="576"><highlight class="comment"><sp/><sp/>root<sp/>=<sp/>NULL;</highlight></codeline> <codeline lineno="577"><highlight class="comment"></highlight></codeline> <codeline lineno="578"><highlight class="comment"><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="579"><highlight class="comment"><sp/><sp/><sp/>*<sp/>The<sp/>device<sp/>isn't<sp/>null<sp/>at<sp/>this<sp/>point,<sp/>allowing<sp/>for<sp/>people<sp/>to<sp/>restart</highlight></codeline> <codeline lineno="580"><highlight class="comment"><sp/><sp/><sp/>*<sp/>the<sp/>mount<sp/>point.<sp/>Or,<sp/>alternatively,<sp/>to<sp/>blow<sp/>things<sp/>up.</highlight></codeline> <codeline lineno="581"><highlight class="comment"><sp/><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="582"><highlight class="comment"><sp/><sp/></highlight></codeline> <codeline lineno="583"><highlight class="comment"><sp/><sp/>return<sp/>0;</highlight></codeline> <codeline lineno="584"><highlight class="comment">}<sp/>//<sp/>UbixFS::vfs_stop</highlight></codeline> <codeline lineno="585"><highlight class="comment"></highlight></codeline> <codeline lineno="586"><highlight class="comment">int</highlight></codeline> <codeline lineno="587"><highlight class="comment">UbixFS::vfs_sync(void)<sp/>{</highlight></codeline> <codeline lineno="588"><highlight class="comment"><sp/><sp/>if<sp/>(device<sp/>==<sp/>NULL<sp/>||<sp/>superBlock<sp/>==<sp/>NULL<sp/>||<sp/>freeBlockList<sp/>==<sp/>NULL)<sp/>return<sp/>-1;</highlight></codeline> <codeline lineno="589"><highlight class="comment"><sp/><sp/>device->write(device,<sp/></highlight></codeline> <codeline lineno="590"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>freeBlockList,<sp/></highlight></codeline> <codeline lineno="591"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>device->sectors<sp/>-<sp/>superBlock->batSectors<sp/>-<sp/>1,<sp/></highlight></codeline> <codeline lineno="592"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>superBlock->batSectors</highlight></codeline> <codeline lineno="593"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>);</highlight></codeline> <codeline lineno="594"><highlight class="comment"><sp/><sp/>device->write(device,<sp/>superBlock,<sp/>device->sectors-1,<sp/>1);</highlight></codeline> <codeline lineno="595"><highlight class="comment"><sp/><sp/>return<sp/>0;</highlight></codeline> <codeline lineno="596"><highlight class="comment">}<sp/>//<sp/>UbixFS::vfs_sync</highlight></codeline> <codeline lineno="597"><highlight class="comment"></highlight></codeline> <codeline lineno="598"><highlight class="comment">void</highlight></codeline> <codeline lineno="599"><highlight class="comment">UbixFS::setFreeBlock(blockRun<sp/>ibr)<sp/>{</highlight></codeline> <codeline lineno="600"><highlight class="comment"><sp/><sp/>signed<sp/>char<sp/>*<sp/>ptr;</highlight></codeline> <codeline lineno="601"><highlight class="comment"><sp/><sp/></highlight></codeline> <codeline lineno="602"><highlight class="comment"><sp/><sp/>if<sp/>(superBlock<sp/>==<sp/>NULL<sp/>||<sp/>freeBlockList<sp/>==<sp/>NULL)<sp/>return;</highlight></codeline> <codeline lineno="603"><highlight class="comment"><sp/><sp/>if<sp/>(ibr.len<sp/>==<sp/>0)<sp/>return;</highlight></codeline> <codeline lineno="604"><highlight class="comment"><sp/><sp/>ptr<sp/>=<sp/>freeBlockList<sp/>+<sp/>((ibr.AG<sp/><<<sp/>superBlock->AGShift)<sp/>>><sp/>3);</highlight></codeline> <codeline lineno="605"><highlight class="comment"><sp/><sp/>ptr<sp/>+=<sp/>ibr.start<sp/>>><sp/>3;</highlight></codeline> <codeline lineno="606"><highlight class="comment"></highlight></codeline> <codeline lineno="607"><highlight class="comment"><sp/><sp/>if<sp/>(ibr.start<sp/>%<sp/>8<sp/>!=<sp/>0)<sp/>{</highlight></codeline> <codeline lineno="608"><highlight class="comment"><sp/><sp/><sp/><sp/></highlight></codeline> <codeline lineno="609"><highlight class="comment"><sp/><sp/><sp/><sp/>ibr.len<sp/>-=<sp/>ibr.start<sp/>%<sp/>8;</highlight></codeline> <codeline lineno="610"><highlight class="comment"><sp/><sp/>}<sp/>//<sp/>if</highlight></codeline> <codeline lineno="611"><highlight class="comment"></highlight></codeline> <codeline lineno="612"><highlight class="comment">}<sp/>//<sp/>UbixFS::setFreeBlock</highlight></codeline> <codeline lineno="613"><highlight class="comment"></highlight></codeline> <codeline lineno="614"><highlight class="comment">blockRun</highlight></codeline> <codeline lineno="615"><highlight class="comment">UbixFS::getFreeBlock(blockRun<sp/>ibr)<sp/>{</highlight></codeline> <codeline lineno="616"><highlight class="comment"><sp/><sp/>signed<sp/>char<sp/>*<sp/>ptr;</highlight></codeline> <codeline lineno="617"><highlight class="comment"><sp/><sp/>signed<sp/>char<sp/>*<sp/>holdPtr;</highlight></codeline> <codeline lineno="618"><highlight class="comment"><sp/><sp/>int32<sp/>count,<sp/>holdCount;</highlight></codeline> <codeline lineno="619"><highlight class="comment"></highlight></codeline> <codeline lineno="620"><highlight class="comment"><sp/><sp/>blockRun<sp/>obr<sp/>=<sp/>{0,<sp/>0,<sp/>0};<sp/><sp/>//<sp/>output<sp/>block<sp/>run</highlight></codeline> <codeline lineno="621"><highlight class="comment"></highlight></codeline> <codeline lineno="622"><highlight class="comment"><sp/><sp/>//<sp/>Check<sp/>to<sp/>make<sp/>sure<sp/>none<sp/>of<sp/>these<sp/>are<sp/>null</highlight></codeline> <codeline lineno="623"><highlight class="comment"><sp/><sp/>if<sp/>(device<sp/>==<sp/>NULL<sp/>||<sp/>freeBlockList<sp/>==<sp/>NULL<sp/>||<sp/>superBlock<sp/>==<sp/>NULL)<sp/>return<sp/>obr;</highlight></codeline> <codeline lineno="624"><highlight class="comment"></highlight></codeline> <codeline lineno="625"><highlight class="comment"><sp/><sp/>if<sp/>(ibr.len<sp/>==<sp/>0)<sp/>return<sp/>obr;</highlight></codeline> <codeline lineno="626"><highlight class="comment"></highlight></codeline> <codeline lineno="627"><highlight class="comment"><sp/><sp/>if<sp/>(ibr.len<sp/>><sp/>superBlock->numBlocks)<sp/>return<sp/>obr;</highlight></codeline> <codeline lineno="628"><highlight class="comment"></highlight></codeline> <codeline lineno="629"><highlight class="comment"><sp/><sp/>if<sp/>(ibr.len<sp/>==<sp/>1)<sp/>return<sp/>getFreeBlock(ibr.AG);</highlight></codeline> <codeline lineno="630"><highlight class="comment"><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="631"><highlight class="comment"><sp/><sp/><sp/>*<sp/>count<sp/>is<sp/>the<sp/>block<sp/>from<sp/>the<sp/>base<sp/>of<sp/>the<sp/>list.</highlight></codeline> <codeline lineno="632"><highlight class="comment"><sp/><sp/><sp/>*<sp/>Since<sp/>we're<sp/>given<sp/>a<sp/>specific<sp/>AG<sp/>to<sp/>look<sp/>through,<sp/>we<sp/>start<sp/>the<sp/>count<sp/>at</highlight></codeline> <codeline lineno="633"><highlight class="comment"><sp/><sp/><sp/>*<sp/>AG<sp/><<<sp/>AGShift,<sp/>where<sp/>AGShift<sp/>is<sp/>the<sp/>shift<sp/>value<sp/>of<sp/>the<sp/>number<sp/>of<sp/>blocks</highlight></codeline> <codeline lineno="634"><highlight class="comment"><sp/><sp/><sp/>*<sp/>in<sp/>an<sp/>AG</highlight></codeline> <codeline lineno="635"><highlight class="comment"><sp/><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="636"><highlight class="comment"></highlight></codeline> <codeline lineno="637"><highlight class="comment"><sp/><sp/>count<sp/>=<sp/>(ibr.AG<sp/><<<sp/>superBlock->AGShift);</highlight></codeline> <codeline lineno="638"><highlight class="comment"></highlight></codeline> <codeline lineno="639"><highlight class="comment"><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="640"><highlight class="comment"><sp/><sp/><sp/>*<sp/>The<sp/>freeBlockList<sp/>is<sp/>a<sp/>bit<sp/>map<sp/>of<sp/>the<sp/>free/used<sp/>blocks.</highlight></codeline> <codeline lineno="641"><highlight class="comment"><sp/><sp/><sp/>*<sp/>Used<sp/>=<sp/>on<sp/>bit</highlight></codeline> <codeline lineno="642"><highlight class="comment"><sp/><sp/><sp/>*<sp/>Unused<sp/>=<sp/>off<sp/>bit</highlight></codeline> <codeline lineno="643"><highlight class="comment"><sp/><sp/><sp/>*<sp/>There<sp/>are<sp/>8<sp/>bits<sp/>per<sp/>byte<sp/>(hopefully)<sp/>and<sp/>so<sp/>we<sp/>have<sp/>to<sp/>divide<sp/>the<sp/>count</highlight></codeline> <codeline lineno="644"><highlight class="comment"><sp/><sp/><sp/>*<sp/>by<sp/>8<sp/>to<sp/>get<sp/>our<sp/>starting<sp/>byte<sp/>offset<sp/>to<sp/>look<sp/>from</highlight></codeline> <codeline lineno="645"><highlight class="comment"><sp/><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="646"><highlight class="comment"></highlight></codeline> <codeline lineno="647"><highlight class="comment"><sp/><sp/>ptr<sp/>=<sp/>freeBlockList<sp/>+<sp/>(count<sp/>>><sp/>3);</highlight></codeline> <codeline lineno="648"><highlight class="comment"></highlight></codeline> <codeline lineno="649"><highlight class="comment">rescan:</highlight></codeline> <codeline lineno="650"><highlight class="comment"><sp/><sp/>//<sp/>look<sp/>for<sp/>the<sp/>first<sp/>free<sp/>8<sp/>blocks<sp/>(this<sp/>may<sp/>create<sp/>holes)</highlight></codeline> <codeline lineno="651"><highlight class="comment"><sp/><sp/>while<sp/>(*ptr<sp/>!=<sp/>0)<sp/>{</highlight></codeline> <codeline lineno="652"><highlight class="comment"><sp/><sp/><sp/><sp/>++ptr;</highlight></codeline> <codeline lineno="653"><highlight class="comment"><sp/><sp/><sp/><sp/>count<sp/>+=<sp/>8;</highlight></codeline> <codeline lineno="654"><highlight class="comment"><sp/><sp/><sp/><sp/>if<sp/>(count+8<sp/>><sp/>superBlock->numBlocks)<sp/>{</highlight></codeline> <codeline lineno="655"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>ptr<sp/>=<sp/>freeBlockList;</highlight></codeline> <codeline lineno="656"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>count<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="657"><highlight class="comment"><sp/><sp/><sp/><sp/>}<sp/>//<sp/>if<sp/></highlight></codeline> <codeline lineno="658"><highlight class="comment"><sp/><sp/>}<sp/>//<sp/>while<sp/>*ptr<sp/>!=<sp/>0</highlight></codeline> <codeline lineno="659"><highlight class="comment"></highlight></codeline> <codeline lineno="660"><highlight class="comment"><sp/><sp/>holdPtr<sp/>=<sp/>ptr;</highlight></codeline> <codeline lineno="661"><highlight class="comment"><sp/><sp/>holdCount<sp/>=<sp/>count;</highlight></codeline> <codeline lineno="662"><highlight class="comment"></highlight></codeline> <codeline lineno="663"><highlight class="comment"><sp/><sp/>for<sp/>(unsigned<sp/>short<sp/>i<sp/>=<sp/>0;<sp/>i<sp/><<sp/>((ibr.len+7)<sp/>/<sp/>8);<sp/>i++)<sp/>{</highlight></codeline> <codeline lineno="664"><highlight class="comment"><sp/><sp/><sp/><sp/>++ptr;</highlight></codeline> <codeline lineno="665"><highlight class="comment"><sp/><sp/><sp/><sp/>count<sp/>+=<sp/>8;</highlight></codeline> <codeline lineno="666"><highlight class="comment"><sp/><sp/><sp/><sp/>if<sp/>(count+8<sp/>><sp/>superBlock->numBlocks)<sp/>{</highlight></codeline> <codeline lineno="667"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>ptr<sp/>=<sp/>freeBlockList;</highlight></codeline> <codeline lineno="668"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>count<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="669"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>goto<sp/>rescan;</highlight></codeline> <codeline lineno="670"><highlight class="comment"><sp/><sp/><sp/><sp/>}<sp/>//<sp/>if</highlight></codeline> <codeline lineno="671"><highlight class="comment"><sp/><sp/><sp/><sp/>if<sp/>(*ptr<sp/>!=<sp/>0)<sp/>goto<sp/>rescan;</highlight></codeline> <codeline lineno="672"><highlight class="comment"><sp/><sp/>}<sp/>//<sp/>for<sp/>i</highlight></codeline> <codeline lineno="673"><highlight class="comment"></highlight></codeline> <codeline lineno="674"><highlight class="comment"><sp/><sp/>//<sp/>we<sp/>have<sp/>found<sp/>a<sp/>range<sp/>of<sp/>blocks<sp/>that<sp/>work<sp/>for<sp/>us</highlight></codeline> <codeline lineno="675"><highlight class="comment"></highlight></codeline> <codeline lineno="676"><highlight class="comment"><sp/><sp/>obr.AG<sp/>=<sp/>holdCount<sp/>/<sp/>superBlock->blocksPerAG;</highlight></codeline> <codeline lineno="677"><highlight class="comment"><sp/><sp/>obr.start<sp/>=<sp/>holdCount<sp/>%<sp/>superBlock->blocksPerAG;</highlight></codeline> <codeline lineno="678"><highlight class="comment"><sp/><sp/>obr.len<sp/>=<sp/>ibr.len;</highlight></codeline> <codeline lineno="679"><highlight class="comment"></highlight></codeline> <codeline lineno="680"><highlight class="comment"><sp/><sp/>for<sp/>(unsigned<sp/>short<sp/>i<sp/>=<sp/>0;<sp/>i<sp/><<sp/>(ibr.len<sp/>/<sp/>8);<sp/>i++)<sp/>{</highlight></codeline> <codeline lineno="681"><highlight class="comment"><sp/><sp/><sp/><sp/>*holdPtr<sp/>=<sp/>-1;</highlight></codeline> <codeline lineno="682"><highlight class="comment"><sp/><sp/><sp/><sp/>++holdPtr;</highlight></codeline> <codeline lineno="683"><highlight class="comment"><sp/><sp/>}<sp/>//<sp/>for</highlight></codeline> <codeline lineno="684"><highlight class="comment"></highlight></codeline> <codeline lineno="685"><highlight class="comment"><sp/><sp/>if<sp/>(ibr.len<sp/>%<sp/>8<sp/>!=<sp/>0)<sp/>*holdPtr<sp/>=<sp/>(-1<sp/><<<sp/>(8-(ibr.len<sp/>%<sp/>8)));</highlight></codeline> <codeline lineno="686"><highlight class="comment"></highlight></codeline> <codeline lineno="687"><highlight class="comment"><sp/><sp/>superBlock->usedBlocks<sp/>+=<sp/>ibr.len;<sp/><sp/><sp/>//<sp/>increment<sp/>the<sp/>number<sp/>of<sp/>used<sp/>blocks</highlight></codeline> <codeline lineno="688"><highlight class="comment"><sp/><sp/>return<sp/>obr;</highlight></codeline> <codeline lineno="689"><highlight class="comment">}<sp/>//<sp/>UbixFS::getFreeBlock</highlight></codeline> <codeline lineno="690"><highlight class="comment"></highlight></codeline> <codeline lineno="691"><highlight class="comment">blockRun</highlight></codeline> <codeline lineno="692"><highlight class="comment">UbixFS::getFreeBlock(uInt32<sp/>AG)<sp/>{</highlight></codeline> <codeline lineno="693"><highlight class="comment"><sp/><sp/>//<sp/>AG<sp/>==<sp/>AllocationGroup</highlight></codeline> <codeline lineno="694"><highlight class="comment"><sp/><sp/>blockRun<sp/>br;</highlight></codeline> <codeline lineno="695"><highlight class="comment"><sp/><sp/>signed<sp/>char<sp/>*<sp/>ptr;</highlight></codeline> <codeline lineno="696"><highlight class="comment"><sp/><sp/>int32<sp/>count;</highlight></codeline> <codeline lineno="697"><highlight class="comment"><sp/><sp/>int32<sp/>subCount<sp/>=<sp/>128;</highlight></codeline> <codeline lineno="698"><highlight class="comment"></highlight></codeline> <codeline lineno="699"><highlight class="comment"><sp/><sp/>br.AG<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="700"><highlight class="comment"><sp/><sp/>br.start<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="701"><highlight class="comment"><sp/><sp/>br.len<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="702"><highlight class="comment"><sp/><sp/>//<sp/>Check<sp/>to<sp/>make<sp/>sure<sp/>neither<sp/>of<sp/>these<sp/>are<sp/>null</highlight></codeline> <codeline lineno="703"><highlight class="comment"><sp/><sp/>if<sp/>(device<sp/>==<sp/>NULL<sp/>||<sp/>freeBlockList<sp/>==<sp/>NULL<sp/>||<sp/>superBlock<sp/>==<sp/>NULL)<sp/>return<sp/>br;</highlight></codeline> <codeline lineno="704"><highlight class="comment"></highlight></codeline> <codeline lineno="705"><highlight class="comment"><sp/><sp/>//<sp/>Are<sp/>there<sp/>any<sp/>blocks<sp/>available?</highlight></codeline> <codeline lineno="706"><highlight class="comment"><sp/><sp/>if<sp/>(superBlock->numBlocks<sp/>==<sp/>superBlock->usedBlocks)<sp/>return<sp/>br;</highlight></codeline> <codeline lineno="707"><highlight class="comment"></highlight></codeline> <codeline lineno="708"><highlight class="comment"><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="709"><highlight class="comment"><sp/><sp/><sp/>*<sp/>count<sp/>is<sp/>the<sp/>block<sp/>from<sp/>the<sp/>base<sp/>of<sp/>the<sp/>list.</highlight></codeline> <codeline lineno="710"><highlight class="comment"><sp/><sp/><sp/>*<sp/>Since<sp/>we're<sp/>given<sp/>a<sp/>specific<sp/>AG<sp/>to<sp/>look<sp/>through,<sp/>we<sp/>start<sp/>the<sp/>count<sp/>at</highlight></codeline> <codeline lineno="711"><highlight class="comment"><sp/><sp/><sp/>*<sp/>AG<sp/><<<sp/>AGShift,<sp/>where<sp/>AGShift<sp/>is<sp/>the<sp/>shift<sp/>value<sp/>of<sp/>the<sp/>number<sp/>of<sp/>blocks</highlight></codeline> <codeline lineno="712"><highlight class="comment"><sp/><sp/><sp/>*<sp/>in<sp/>an<sp/>AG<sp/></highlight></codeline> <codeline lineno="713"><highlight class="comment"><sp/><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="714"><highlight class="comment"></highlight></codeline> <codeline lineno="715"><highlight class="comment"><sp/><sp/>count<sp/>=<sp/>(AG<sp/><<<sp/>superBlock->AGShift);</highlight></codeline> <codeline lineno="716"><highlight class="comment"></highlight></codeline> <codeline lineno="717"><highlight class="comment"><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="718"><highlight class="comment"><sp/><sp/><sp/>*<sp/>The<sp/>freeBlockList<sp/>is<sp/>a<sp/>bit<sp/>map<sp/>of<sp/>the<sp/>free/used<sp/>blocks.<sp/></highlight></codeline> <codeline lineno="719"><highlight class="comment"><sp/><sp/><sp/>*<sp/>Used<sp/>=<sp/>on<sp/>bit</highlight></codeline> <codeline lineno="720"><highlight class="comment"><sp/><sp/><sp/>*<sp/>Unused<sp/>=<sp/>off<sp/>bit</highlight></codeline> <codeline lineno="721"><highlight class="comment"><sp/><sp/><sp/>*<sp/>There<sp/>are<sp/>8<sp/>bits<sp/>per<sp/>byte<sp/>(hopefully)<sp/>and<sp/>so<sp/>we<sp/>have<sp/>to<sp/>divide<sp/>the<sp/>count</highlight></codeline> <codeline lineno="722"><highlight class="comment"><sp/><sp/><sp/>*<sp/>by<sp/>8<sp/>to<sp/>get<sp/>our<sp/>starting<sp/>byte<sp/>offset<sp/>to<sp/>look<sp/>from</highlight></codeline> <codeline lineno="723"><highlight class="comment"><sp/><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="724"><highlight class="comment"></highlight></codeline> <codeline lineno="725"><highlight class="comment"><sp/><sp/>ptr<sp/>=<sp/>freeBlockList<sp/>+<sp/>(count<sp/>>><sp/>3);</highlight></codeline> <codeline lineno="726"><highlight class="comment"></highlight></codeline> <codeline lineno="727"><highlight class="comment"><sp/><sp/>//<sp/>Scan<sp/>through<sp/>the<sp/>freeBlockList<sp/></highlight></codeline> <codeline lineno="728"><highlight class="comment"></highlight></codeline> <codeline lineno="729"><highlight class="comment">rescan:</highlight></codeline> <codeline lineno="730"><highlight class="comment"><sp/><sp/>while<sp/>(*ptr<sp/>==<sp/>-1)<sp/>{<sp/></highlight></codeline> <codeline lineno="731"><highlight class="comment"><sp/><sp/><sp/><sp/>++ptr;</highlight></codeline> <codeline lineno="732"><highlight class="comment"><sp/><sp/><sp/><sp/>count<sp/>+=<sp/>8;</highlight></codeline> <codeline lineno="733"><highlight class="comment"><sp/><sp/><sp/><sp/>if<sp/>(count+8<sp/>><sp/>superBlock->numBlocks)<sp/>break;</highlight></codeline> <codeline lineno="734"><highlight class="comment"><sp/><sp/>}<sp/>//<sp/>while<sp/>*ptr<sp/>==<sp/>-1</highlight></codeline> <codeline lineno="735"><highlight class="comment"></highlight></codeline> <codeline lineno="736"><highlight class="comment"><sp/><sp/>subCount<sp/>=<sp/>128;</highlight></codeline> <codeline lineno="737"><highlight class="comment"></highlight></codeline> <codeline lineno="738"><highlight class="comment"><sp/><sp/>do<sp/>{</highlight></codeline> <codeline lineno="739"><highlight class="comment"><sp/><sp/><sp/><sp/>if<sp/>((*ptr<sp/>&<sp/>subCount)<sp/>==<sp/>0)<sp/>break;</highlight></codeline> <codeline lineno="740"><highlight class="comment"><sp/><sp/><sp/><sp/>subCount<sp/>>>=<sp/>1;</highlight></codeline> <codeline lineno="741"><highlight class="comment"><sp/><sp/><sp/><sp/>++count;</highlight></codeline> <codeline lineno="742"><highlight class="comment"><sp/><sp/><sp/><sp/>if<sp/>(count<sp/>==<sp/>superBlock->numBlocks)<sp/>{</highlight></codeline> <codeline lineno="743"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>count<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="744"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>ptr<sp/>=<sp/>freeBlockList;</highlight></codeline> <codeline lineno="745"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>goto<sp/>rescan;</highlight></codeline> <codeline lineno="746"><highlight class="comment"><sp/><sp/><sp/><sp/>}<sp/>//<sp/>if</highlight></codeline> <codeline lineno="747"><highlight class="comment"><sp/><sp/>}<sp/>while(subCount<sp/>><sp/>1);</highlight></codeline> <codeline lineno="748"><highlight class="comment"></highlight></codeline> <codeline lineno="749"><highlight class="comment"><sp/><sp/>*ptr<sp/>|=<sp/>subCount;<sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>//<sp/>mark<sp/>this<sp/>block<sp/>as<sp/>used</highlight></codeline> <codeline lineno="750"><highlight class="comment"><sp/><sp/>++superBlock->usedBlocks;<sp/><sp/><sp/>//<sp/>increment<sp/>the<sp/>number<sp/>of<sp/>used<sp/>blocks</highlight></codeline> <codeline lineno="751"><highlight class="comment"></highlight></codeline> <codeline lineno="752"><highlight class="comment"><sp/><sp/>br.AG<sp/>=<sp/>count<sp/>/<sp/>superBlock->blocksPerAG;<sp/></highlight></codeline> <codeline lineno="753"><highlight class="comment"><sp/><sp/>br.start<sp/>=<sp/>count<sp/>%<sp/>superBlock->blocksPerAG;</highlight></codeline> <codeline lineno="754"><highlight class="comment"><sp/><sp/>br.len<sp/>=<sp/>1;</highlight></codeline> <codeline lineno="755"><highlight class="comment"><sp/><sp/>return<sp/>br;<sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>//<sp/>return<sp/>the<sp/>allocated<sp/>block<sp/>number</highlight></codeline> <codeline lineno="756"><highlight class="comment">}<sp/>//<sp/>Ubixfs::getFreeBlock</highlight></codeline> <codeline lineno="757"><highlight class="comment"></highlight></codeline> <codeline lineno="758"><highlight class="comment">uInt32</highlight></codeline> <codeline lineno="759"><highlight class="comment">UbixFS::getNextAG(void)<sp/>{</highlight></codeline> <codeline lineno="760"><highlight class="comment"></highlight></codeline> <codeline lineno="761"><highlight class="comment"><sp/><sp/>if<sp/>(superBlock->lastUsedAG<sp/>==<sp/>superBlock->numAGs)<sp/></highlight></codeline> <codeline lineno="762"><highlight class="comment"><sp/><sp/><sp/><sp/>superBlock->lastUsedAG<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="763"><highlight class="comment"><sp/><sp/>else</highlight></codeline> <codeline lineno="764"><highlight class="comment"><sp/><sp/><sp/><sp/>superBlock->lastUsedAG++;</highlight></codeline> <codeline lineno="765"><highlight class="comment"><sp/><sp/>return<sp/>superBlock->lastUsedAG;</highlight></codeline> <codeline lineno="766"><highlight class="comment"></highlight></codeline> <codeline lineno="767"><highlight class="comment">}<sp/>//<sp/>UbixFS::getNextAG</highlight></codeline> <codeline lineno="768"><highlight class="comment"></highlight></codeline> <codeline lineno="769"><highlight class="comment">*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="770"><highlight class="comment"><sp/>*<sp/>UbixFS::getFreeBlock(void)</highlight></codeline> <codeline lineno="771"><highlight class="comment"><sp/>*<sp/>upon<sp/>success<sp/>returns<sp/>a<sp/>free<sp/>block<sp/>based<sp/>on<sp/>the<sp/>next<sp/>AG<sp/>after<sp/>the<sp/>lastUsedAG</highlight></codeline> <codeline lineno="772"><highlight class="comment"><sp/>*<sp/>failure<sp/>returns<sp/>-1</highlight></codeline> <codeline lineno="773"><highlight class="comment"><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="774"><highlight class="comment"></highlight></codeline> <codeline lineno="775"><highlight class="comment">blockRun</highlight></codeline> <codeline lineno="776"><highlight class="comment">UbixFS::getFreeBlock(void)<sp/>{</highlight></codeline> <codeline lineno="777"><highlight class="comment"><sp/><sp/>return<sp/>getFreeBlock(getNextAG());</highlight></codeline> <codeline lineno="778"><highlight class="comment">}<sp/>//<sp/>UbixFS::getFreeBlock</highlight></codeline> <codeline lineno="779"><highlight class="comment"></highlight></codeline> <codeline lineno="780"><highlight class="comment">blockRun</highlight></codeline> <codeline lineno="781"><highlight class="comment">UbixFS::get8FreeBlocks(uInt32<sp/>AG)<sp/>{</highlight></codeline> <codeline lineno="782"><highlight class="comment"><sp/><sp/>//<sp/>AG<sp/>==<sp/>AllocationGroup</highlight></codeline> <codeline lineno="783"><highlight class="comment"><sp/><sp/>blockRun<sp/>br;</highlight></codeline> <codeline lineno="784"><highlight class="comment"><sp/><sp/>signed<sp/>char<sp/>*<sp/>ptr;</highlight></codeline> <codeline lineno="785"><highlight class="comment"><sp/><sp/>signed<sp/>char<sp/>*<sp/>endPtr;</highlight></codeline> <codeline lineno="786"><highlight class="comment"><sp/><sp/>int32<sp/>count;</highlight></codeline> <codeline lineno="787"><highlight class="comment"></highlight></codeline> <codeline lineno="788"><highlight class="comment"><sp/><sp/>br.AG<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="789"><highlight class="comment"><sp/><sp/>br.start<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="790"><highlight class="comment"><sp/><sp/>br.len<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="791"><highlight class="comment"></highlight></codeline> <codeline lineno="792"><highlight class="comment"><sp/><sp/>if<sp/>(device<sp/>==<sp/>NULL<sp/>||<sp/>freeBlockList<sp/>==<sp/>NULL<sp/>||<sp/>superBlock<sp/>==<sp/>NULL)<sp/>return<sp/>br;</highlight></codeline> <codeline lineno="793"><highlight class="comment"></highlight></codeline> <codeline lineno="794"><highlight class="comment"><sp/><sp/>//<sp/>Are<sp/>there<sp/>any<sp/>blocks<sp/>available?</highlight></codeline> <codeline lineno="795"><highlight class="comment"><sp/><sp/>if<sp/>(superBlock->usedBlocks+8<sp/>><sp/>superBlock->numBlocks)<sp/>return<sp/>br;</highlight></codeline> <codeline lineno="796"><highlight class="comment"></highlight></codeline> <codeline lineno="797"><highlight class="comment"><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="798"><highlight class="comment"><sp/><sp/><sp/>*<sp/>count<sp/>is<sp/>the<sp/>block<sp/>from<sp/>the<sp/>base<sp/>of<sp/>the<sp/>list.</highlight></codeline> <codeline lineno="799"><highlight class="comment"><sp/><sp/><sp/>*<sp/>Since<sp/>we're<sp/>given<sp/>a<sp/>specific<sp/>AG<sp/>to<sp/>look<sp/>through,<sp/>we<sp/>start<sp/>the<sp/>count<sp/>at</highlight></codeline> <codeline lineno="800"><highlight class="comment"><sp/><sp/><sp/>*<sp/>AG<sp/><<<sp/>AGShift,<sp/>where<sp/>AGShift<sp/>is<sp/>the<sp/>shift<sp/>value<sp/>of<sp/>the<sp/>number<sp/>of<sp/>blocks</highlight></codeline> <codeline lineno="801"><highlight class="comment"><sp/><sp/><sp/>*<sp/>in<sp/>an<sp/>AG</highlight></codeline> <codeline lineno="802"><highlight class="comment"><sp/><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="803"><highlight class="comment"></highlight></codeline> <codeline lineno="804"><highlight class="comment"><sp/><sp/>count<sp/>=<sp/>(AG<sp/><<<sp/>superBlock->AGShift);</highlight></codeline> <codeline lineno="805"><highlight class="comment"></highlight></codeline> <codeline lineno="806"><highlight class="comment"><sp/><sp/>ptr<sp/>=<sp/>freeBlockList<sp/>+<sp/>(count<sp/>>><sp/>3);</highlight></codeline> <codeline lineno="807"><highlight class="comment"><sp/><sp/></highlight></codeline> <codeline lineno="808"><highlight class="comment"><sp/><sp/>endPtr<sp/>=<sp/>freeBlockList<sp/>+<sp/>(superBlock->numBlocks<sp/>>><sp/>3);</highlight></codeline> <codeline lineno="809"><highlight class="comment"></highlight></codeline> <codeline lineno="810"><highlight class="comment"><sp/><sp/>bool<sp/>secondTime<sp/>=<sp/>false;</highlight></codeline> <codeline lineno="811"><highlight class="comment"><sp/><sp/>while<sp/>(*ptr<sp/>!=<sp/>0)<sp/>{</highlight></codeline> <codeline lineno="812"><highlight class="comment"><sp/><sp/><sp/><sp/>++ptr;</highlight></codeline> <codeline lineno="813"><highlight class="comment"><sp/><sp/><sp/><sp/>count<sp/>+=<sp/>8;</highlight></codeline> <codeline lineno="814"><highlight class="comment"><sp/><sp/><sp/><sp/>if<sp/>(ptr<sp/>==<sp/>endPtr)<sp/>{</highlight></codeline> <codeline lineno="815"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>if<sp/>(secondTime)<sp/></highlight></codeline> <codeline lineno="816"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>return<sp/>br;<sp/></highlight></codeline> <codeline lineno="817"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>else<sp/></highlight></codeline> <codeline lineno="818"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>secondTime<sp/>=<sp/>true;</highlight></codeline> <codeline lineno="819"><highlight class="comment"></highlight></codeline> <codeline lineno="820"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>count<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="821"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>ptr<sp/>=<sp/>freeBlockList;<sp/><sp/><sp/><sp/><sp/><sp/></highlight></codeline> <codeline lineno="822"><highlight class="comment"><sp/><sp/><sp/><sp/>}<sp/>//<sp/>if</highlight></codeline> <codeline lineno="823"><highlight class="comment"><sp/><sp/>}<sp/>//<sp/>while<sp/></highlight></codeline> <codeline lineno="824"><highlight class="comment"></highlight></codeline> <codeline lineno="825"><highlight class="comment"><sp/><sp/>*ptr<sp/>=<sp/>-1;<sp/><sp/><sp/>//<sp/>mark<sp/>8<sp/>blocks<sp/>as<sp/>taken</highlight></codeline> <codeline lineno="826"><highlight class="comment"></highlight></codeline> <codeline lineno="827"><highlight class="comment"><sp/><sp/>br.AG<sp/>=<sp/>count<sp/>/<sp/>superBlock->blocksPerAG;</highlight></codeline> <codeline lineno="828"><highlight class="comment"><sp/><sp/>br.start<sp/>=<sp/>count<sp/>%<sp/>superBlock->blocksPerAG;</highlight></codeline> <codeline lineno="829"><highlight class="comment"><sp/><sp/>br.len<sp/>=<sp/>8;</highlight></codeline> <codeline lineno="830"><highlight class="comment"><sp/><sp/>return<sp/>br;</highlight></codeline> <codeline lineno="831"><highlight class="comment">}<sp/>//<sp/>UbixFS::get8FreeBlocks</highlight></codeline> <codeline lineno="832"><highlight class="comment"></highlight></codeline> <codeline lineno="833"><highlight class="comment">void<sp/>*</highlight></codeline> <codeline lineno="834"><highlight class="comment">UbixFS::mknod(const<sp/>char<sp/>*filename,<sp/>ubixfsInode<sp/>*<sp/>parent,<sp/>mode_t<sp/>mode)<sp/>{</highlight></codeline> <codeline lineno="835"><highlight class="comment"><sp/><sp/>ubixfsInode<sp/>*<sp/>inode<sp/>=<sp/>NULL;</highlight></codeline> <codeline lineno="836"><highlight class="comment"></highlight></codeline> <codeline lineno="837"><highlight class="comment"><sp/><sp/>inode<sp/>=<sp/>new<sp/>ubixfsInode;</highlight></codeline> <codeline lineno="838"><highlight class="comment"><sp/><sp/>assert(inode);</highlight></codeline> <codeline lineno="839"><highlight class="comment"><sp/><sp/>if<sp/>(inode<sp/>==<sp/>NULL)<sp/>return<sp/>NULL;</highlight></codeline> <codeline lineno="840"><highlight class="comment"><sp/><sp/>memset(inode,<sp/>0,<sp/>sizeof(ubixfsInode));</highlight></codeline> <codeline lineno="841"><highlight class="comment"></highlight></codeline> <codeline lineno="842"><highlight class="comment"><sp/><sp/>inode->magic1<sp/>=<sp/>UBIXFS_INODE_MAGIC;</highlight></codeline> <codeline lineno="843"><highlight class="comment"></highlight></codeline> <codeline lineno="844"><highlight class="comment"><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="845"><highlight class="comment"><sp/><sp/><sp/>*<sp/>in<sp/>retrospect..<sp/>I'm<sp/>not<sp/>sure<sp/>why<sp/>parent<sp/>would<sp/>be<sp/>null..<sp/>only<sp/>the</highlight></codeline> <codeline lineno="846"><highlight class="comment"><sp/><sp/><sp/>*<sp/>root<sp/>directory<sp/>would<sp/>have<sp/>a<sp/>null<sp/>parent,<sp/>but<sp/>that's<sp/>manually<sp/>allocated</highlight></codeline> <codeline lineno="847"><highlight class="comment"><sp/><sp/><sp/>*<sp/>in<sp/>vfs_format()</highlight></codeline> <codeline lineno="848"><highlight class="comment"><sp/><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="849"><highlight class="comment"></highlight></codeline> <codeline lineno="850"><highlight class="comment"><sp/><sp/>if<sp/>(parent<sp/>==<sp/>NULL)<sp/>{</highlight></codeline> <codeline lineno="851"><highlight class="comment"><sp/><sp/><sp/><sp/>inode->inodeNum<sp/>=<sp/>getFreeBlock();</highlight></codeline> <codeline lineno="852"><highlight class="comment"><sp/><sp/><sp/><sp/>inode->parent.iAddr.AG<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="853"><highlight class="comment"><sp/><sp/><sp/><sp/>inode->parent.iAddr.start<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="854"><highlight class="comment"><sp/><sp/><sp/><sp/>inode->parent.iAddr.len<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="855"><highlight class="comment"><sp/><sp/>}<sp/>else<sp/>{</highlight></codeline> <codeline lineno="856"><highlight class="comment"><sp/><sp/><sp/><sp/>inode->inodeNum<sp/>=<sp/>getFreeBlock(parent->inodeNum.AG);</highlight></codeline> <codeline lineno="857"><highlight class="comment"><sp/><sp/><sp/><sp/>inode->parent.iAddr<sp/>=<sp/>parent->inodeNum;</highlight></codeline> <codeline lineno="858"><highlight class="comment"><sp/><sp/>}<sp/>//<sp/>else</highlight></codeline> <codeline lineno="859"><highlight class="comment"><sp/><sp/><sp/></highlight></codeline> <codeline lineno="860"><highlight class="comment"><sp/><sp/>strncpy(inode->name,<sp/>filename,<sp/>MAX_FILENAME_LENGTH);</highlight></codeline> <codeline lineno="861"><highlight class="comment"></highlight></codeline> <codeline lineno="862"><highlight class="comment"><sp/><sp/>inode->uid<sp/>=<sp/>getuid();</highlight></codeline> <codeline lineno="863"><highlight class="comment"><sp/><sp/>inode->gid<sp/>=<sp/>getgid();</highlight></codeline> <codeline lineno="864"><highlight class="comment"><sp/><sp/>//<sp/>inode->mode</highlight></codeline> <codeline lineno="865"><highlight class="comment"><sp/><sp/>inode->flags<sp/>=<sp/>mode;</highlight></codeline> <codeline lineno="866"><highlight class="comment"><sp/><sp/>//<sp/>inode->createTime</highlight></codeline> <codeline lineno="867"><highlight class="comment"><sp/><sp/>//<sp/>inode->lastModifiedTime</highlight></codeline> <codeline lineno="868"><highlight class="comment"><sp/><sp/>inode->inodeSize<sp/>=<sp/>superBlock->inodeSize;</highlight></codeline> <codeline lineno="869"><highlight class="comment"></highlight></codeline> <codeline lineno="870"><highlight class="comment"><sp/><sp/>inode->attributes.AG<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="871"><highlight class="comment"><sp/><sp/>inode->attributes.start<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="872"><highlight class="comment"><sp/><sp/>inode->attributes.len<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="873"><highlight class="comment"></highlight></codeline> <codeline lineno="874"><highlight class="comment"><sp/><sp/>//<sp/>inode->type<sp/></highlight></codeline> <codeline lineno="875"><highlight class="comment"></highlight></codeline> <codeline lineno="876"><highlight class="comment"><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="877"><highlight class="comment"><sp/><sp/><sp/>*<sp/>next<sp/>and<sp/>prev<sp/>are<sp/>used<sp/>in<sp/>memory<sp/>to<sp/>hold<sp/>pointers<sp/>to<sp/>the<sp/>next/prev</highlight></codeline> <codeline lineno="878"><highlight class="comment"><sp/><sp/><sp/>*<sp/>inodes<sp/>in<sp/>this<sp/>dir.<sp/><sp/>On<sp/>disk<sp/>they<sp/>may<sp/>have<sp/>another<sp/>value,<sp/>but<sp/>for</highlight></codeline> <codeline lineno="879"><highlight class="comment"><sp/><sp/><sp/>*<sp/>now<sp/>they<sp/>should<sp/>be<sp/>set<sp/>to<sp/>null.</highlight></codeline> <codeline lineno="880"><highlight class="comment"><sp/><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="881"><highlight class="comment"></highlight></codeline> <codeline lineno="882"><highlight class="comment"><sp/><sp/>inode->next.offset<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="883"><highlight class="comment"><sp/><sp/>inode->prev.offset<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="884"><highlight class="comment"><sp/><sp/>inode->refCount<sp/>=<sp/>0;</highlight></codeline> <codeline lineno="885"><highlight class="comment"><sp/><sp/>++superBlock->inodeCount;</highlight></codeline> <codeline lineno="886"><highlight class="comment"><sp/><sp/>return<sp/>inode;</highlight></codeline> <codeline lineno="887"><highlight class="comment">}<sp/>//<sp/>UbixFS::mknod</highlight></codeline> <codeline lineno="888"><highlight class="comment"></highlight></codeline> <codeline lineno="889"><highlight class="comment">int</highlight></codeline> <codeline lineno="890"><highlight class="comment">UbixFS::vfs_mkdir(const<sp/>char<sp/>*<sp/>path,<sp/>mode_t<sp/>mode)<sp/>{</highlight></codeline> <codeline lineno="891"><highlight class="comment"><sp/><sp/>char<sp/>name[MAX_FILENAME_LENGTH];</highlight></codeline> <codeline lineno="892"><highlight class="comment"><sp/><sp/>unsigned<sp/>int<sp/>start,<sp/>end,<sp/>len,<sp/>nameStart;</highlight></codeline> <codeline lineno="893"><highlight class="comment"><sp/><sp/>ubixfsInode<sp/>*<sp/>dir<sp/>=<sp/>static_cast<ubixfsInode<sp/>*>(root->inode);</highlight></codeline> <codeline lineno="894"><highlight class="comment"><sp/><sp/>ubixfsInode<sp/>*<sp/>inode<sp/>=<sp/>NULL;</highlight></codeline> <codeline lineno="895"><highlight class="comment"></highlight></codeline> <codeline lineno="896"><highlight class="comment"><sp/><sp/>assert(path);<sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>//<sp/>bad<sp/>input:<sp/>vfs_mkdir(NULL);</highlight></codeline> <codeline lineno="897"><highlight class="comment"><sp/><sp/>assert(*path);<sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>//<sp/>bad<sp/>input:<sp/>vfs_mkdir("");</highlight></codeline> <codeline lineno="898"><highlight class="comment"></highlight></codeline> <codeline lineno="899"><highlight class="comment"><sp/><sp/>memset(&name,<sp/>0,<sp/>sizeof(name));</highlight></codeline> <codeline lineno="900"><highlight class="comment"><sp/><sp/>//<sp/>find<sp/>the<sp/>dir<sp/>name</highlight></codeline> <codeline lineno="901"><highlight class="comment"><sp/><sp/>len<sp/>=<sp/>strlen(path);</highlight></codeline> <codeline lineno="902"><highlight class="comment"></highlight></codeline> <codeline lineno="903"><highlight class="comment"><sp/><sp/>assert(path[0]<sp/>==<sp/>'/');<sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>//<sp/>bad<sp/>input:<sp/>vfs<sp/>isn't<sp/>doing<sp/>its<sp/>job</highlight></codeline> <codeline lineno="904"><highlight class="comment"><sp/><sp/>assert(len<sp/>><sp/>1);<sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>//<sp/>bad<sp/>input:<sp/>mkdir<sp/>/</highlight></codeline> <codeline lineno="905"><highlight class="comment"></highlight></codeline> <codeline lineno="906"><highlight class="comment"><sp/><sp/>//<sp/>remove<sp/>trailing<sp/>"/"<sp/>if<sp/>present</highlight></codeline> <codeline lineno="907"><highlight class="comment"><sp/><sp/>if<sp/>(path[len-1]<sp/>==<sp/>'/')<sp/>--len;</highlight></codeline> <codeline lineno="908"><highlight class="comment"></highlight></codeline> <codeline lineno="909"><highlight class="comment"><sp/><sp/>assert(len<sp/>><sp/>1);<sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>//<sp/>bad<sp/>input:<sp/>mkdir<sp/>//</highlight></codeline> <codeline lineno="910"><highlight class="comment"></highlight></codeline> <codeline lineno="911"><highlight class="comment"><sp/><sp/>nameStart<sp/>=<sp/>len-1;</highlight></codeline> <codeline lineno="912"><highlight class="comment"></highlight></codeline> <codeline lineno="913"><highlight class="comment"><sp/><sp/>assert(path[nameStart]<sp/>!=<sp/>'/');<sp/><sp/><sp/>//<sp/>bad<sp/>input:<sp/>mkdir<sp/>/a//</highlight></codeline> <codeline lineno="914"><highlight class="comment"></highlight></codeline> <codeline lineno="915"><highlight class="comment"><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="916"><highlight class="comment"><sp/><sp/><sp/>*<sp/>we're<sp/>guaranteed<sp/>by<sp/>the<sp/>assert()<sp/>above<sp/>that<sp/>there<sp/>is<sp/></highlight></codeline> <codeline lineno="917"><highlight class="comment"><sp/><sp/><sp/>*<sp/>at<sp/>least<sp/>one<sp/>"/"<sp/>before<sp/>our<sp/>location.<sp/>If<sp/>you<sp/>remove<sp/>the<sp/>assert<sp/></highlight></codeline> <codeline lineno="918"><highlight class="comment"><sp/><sp/><sp/>*<sp/>you<sp/>might<sp/>need<sp/>to<sp/>make<sp/>sure<sp/>nameStart<sp/>stays<sp/>above<sp/>0<sp/>in<sp/>the<sp/>following</highlight></codeline> <codeline lineno="919"><highlight class="comment"><sp/><sp/><sp/>*<sp/>while</highlight></codeline> <codeline lineno="920"><highlight class="comment"><sp/><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="921"><highlight class="comment"></highlight></codeline> <codeline lineno="922"><highlight class="comment"><sp/><sp/>while<sp/>(path[nameStart]<sp/>!=<sp/>'/')<sp/>--nameStart;</highlight></codeline> <codeline lineno="923"><highlight class="comment"><sp/><sp/>++nameStart;</highlight></codeline> <codeline lineno="924"><highlight class="comment"><sp/><sp/>assert(len<sp/>-<sp/>nameStart<sp/>><sp/>0);</highlight></codeline> <codeline lineno="925"><highlight class="comment"></highlight></codeline> <codeline lineno="926"><highlight class="comment"><sp/><sp/>*/</highlight><highlight class="comment">/*<sp/>e.g.</highlight></codeline> <codeline lineno="927"><highlight class="comment"><sp/><sp/><sp/>*<sp/><sp/><sp/>v---------------------<sp/>start</highlight></codeline> <codeline lineno="928"><highlight class="comment"><sp/><sp/><sp/>*<sp/><sp/><sp/><sp/><sp/><sp/>v------------------<sp/>end</highlight></codeline> <codeline lineno="929"><highlight class="comment"><sp/><sp/><sp/>*<sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>v------<sp/>nameStart</highlight></codeline> <codeline lineno="930"><highlight class="comment"><sp/><sp/><sp/>*<sp/><sp/>/usr/local/data/dirname/<sp/><sp/><---<sp/>ignores<sp/>trailing<sp/>/</highlight></codeline> <codeline lineno="931"><highlight class="comment"><sp/><sp/><sp/>*<sp/><sp/><---------23----------><sp/>len</highlight></codeline> <codeline lineno="932"><highlight class="comment"><sp/><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="933"><highlight class="comment"></highlight></codeline> <codeline lineno="934"><highlight class="comment"><sp/><sp/>start<sp/>=<sp/>end<sp/>=<sp/>1;<sp/><sp/><sp/>//<sp/>skip<sp/>leading<sp/>/</highlight></codeline> <codeline lineno="935"><highlight class="comment"><sp/><sp/>while<sp/>(end<sp/><<sp/>nameStart)<sp/>{</highlight></codeline> <codeline lineno="936"><highlight class="comment"><sp/><sp/><sp/><sp/>do<sp/>{<sp/>++end;<sp/>}<sp/>while(path[end]<sp/>!=<sp/>'/');</highlight></codeline> <codeline lineno="937"><highlight class="comment"></highlight></codeline> <codeline lineno="938"><highlight class="comment"><sp/><sp/><sp/><sp/>assert(end-start+1<sp/><<sp/>sizeof(name));</highlight></codeline> <codeline lineno="939"><highlight class="comment"><sp/><sp/><sp/><sp/>//<sp/>this<sp/>is<sp/>probably<sp/>wrong:</highlight></codeline> <codeline lineno="940"><highlight class="comment"><sp/><sp/><sp/><sp/>strncpy(name,<sp/>&path[start],<sp/>end-start+1);</highlight></codeline> <codeline lineno="941"><highlight class="comment"><sp/><sp/><sp/><sp/>cout<sp/><<<sp/>name<sp/><<<sp/>endl;</highlight></codeline> <codeline lineno="942"><highlight class="comment"><sp/><sp/><sp/><sp/>dir<sp/>=<sp/>dir->data.btPtr->Find(name);</highlight></codeline> <codeline lineno="943"><highlight class="comment"><sp/><sp/><sp/><sp/>assert(dir);</highlight></codeline> <codeline lineno="944"><highlight class="comment"><sp/><sp/><sp/><sp/>assert(dir->flags<sp/>&<sp/>INODE_DIRECTORY<sp/>==<sp/>INODE_DIRECTORY);</highlight></codeline> <codeline lineno="945"><highlight class="comment"><sp/><sp/><sp/><sp/>start<sp/>=<sp/>++end;</highlight></codeline> <codeline lineno="946"><highlight class="comment"><sp/><sp/>}</highlight></codeline> <codeline lineno="947"><highlight class="comment"></highlight></codeline> <codeline lineno="948"><highlight class="comment"><sp/><sp/>strncpy(name,<sp/>&path[nameStart],<sp/>len<sp/>-<sp/>nameStart);</highlight></codeline> <codeline lineno="949"><highlight class="comment"><sp/><sp/>inode<sp/>=<sp/>(ubixfsInode<sp/>*)mknod(name,<sp/>dir,<sp/>mode<sp/>|<sp/>INODE_DIRECTORY);</highlight></codeline> <codeline lineno="950"><highlight class="comment"></highlight></codeline> <codeline lineno="951"><highlight class="comment"><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="952"><highlight class="comment"><sp/><sp/><sp/>*<sp/>keep<sp/>in<sp/>mind<sp/>that<sp/>the<sp/>reason<sp/>for<sp/>passing<sp/>in<sp/>the<sp/>name<sp/>is<sp/>because</highlight></codeline> <codeline lineno="953"><highlight class="comment"><sp/><sp/><sp/>*<sp/>we<sp/>thought<sp/>about<sp/>allowing<sp/>key<sp/>names<sp/>to<sp/>be<sp/>different<sp/>from<sp/>inode<sp/></highlight></codeline> <codeline lineno="954"><highlight class="comment"><sp/><sp/><sp/>*<sp/>names.<sp/>In<sp/>retrospect,<sp/>I<sp/>don't<sp/>think<sp/>that's<sp/>a<sp/>good<sp/>idea<sp/>since<sp/>a<sp/>dir</highlight></codeline> <codeline lineno="955"><highlight class="comment"><sp/><sp/><sp/>*<sp/>listing<sp/>will<sp/>print<sp/>the<sp/>actual<sp/>dir<sp/>name<sp/>instead<sp/>of<sp/>.<sp/>and<sp/>..</highlight></codeline> <codeline lineno="956"><highlight class="comment"><sp/><sp/><sp/>*<sp/>Thus:<sp/>the<sp/>first<sp/>parameter<sp/>of<sp/>btPtr->Insert()<sp/>may<sp/>go<sp/>away.</highlight></codeline> <codeline lineno="957"><highlight class="comment"><sp/><sp/><sp/>*/</highlight><highlight class="comment">/*</highlight></codeline> <codeline lineno="958"><highlight class="comment"></highlight></codeline> <codeline lineno="959"><highlight class="comment"><sp/><sp/>assert(dir->data.btPtr->Insert(inode->name,<sp/>inode));</highlight></codeline> <codeline lineno="960"><highlight class="comment"></highlight></codeline> <codeline lineno="961"><highlight class="comment"><sp/><sp/>return<sp/>0;</highlight></codeline> <codeline lineno="962"><highlight class="comment">}<sp/>//<sp/>UbixFS::vfs_mkdir</highlight></codeline> <codeline lineno="963"><highlight class="comment"></highlight></codeline> <codeline lineno="964"><highlight class="comment">void<sp/></highlight></codeline> <codeline lineno="965"><highlight class="comment">UbixFS::printFreeBlockList(uInt32<sp/>AG)<sp/>{</highlight></codeline> <codeline lineno="966"><highlight class="comment"><sp/><sp/>unsigned<sp/>int<sp/>j;</highlight></codeline> <codeline lineno="967"><highlight class="comment"><sp/><sp/>if<sp/>(superBlock<sp/>==<sp/>NULL<sp/>||<sp/>freeBlockList<sp/>==<sp/>NULL)<sp/>return;</highlight></codeline> <codeline lineno="968"><highlight class="comment"><sp/><sp/>printf("AG<sp/>=<sp/>%d\n",<sp/>AG);</highlight></codeline> <codeline lineno="969"><highlight class="comment"><sp/><sp/>for<sp/>(unsigned<sp/>int<sp/>i<sp/>=<sp/>0;<sp/>i<sp/><<sp/>superBlock->blocksPerAG<sp/>/<sp/>8;<sp/>i++)<sp/>{</highlight></codeline> <codeline lineno="970"><highlight class="comment"><sp/><sp/><sp/><sp/>j<sp/>=<sp/>128;</highlight></codeline> <codeline lineno="971"><highlight class="comment"><sp/><sp/><sp/><sp/>signed<sp/>char<sp/>foo<sp/>=<sp/>freeBlockList[(AG<sp/><<<sp/>superBlock->AGShift)+i];</highlight></codeline> <codeline lineno="972"><highlight class="comment"><sp/><sp/><sp/><sp/>while<sp/>(j<sp/>><sp/>0)<sp/>{</highlight></codeline> <codeline lineno="973"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>if<sp/>((foo<sp/>&<sp/>j)<sp/>==<sp/>j)<sp/></highlight></codeline> <codeline lineno="974"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>printf("1");</highlight></codeline> <codeline lineno="975"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>else</highlight></codeline> <codeline lineno="976"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>printf("0");<sp/><sp/><sp/><sp/></highlight></codeline> <codeline lineno="977"><highlight class="comment"><sp/><sp/><sp/><sp/><sp/><sp/>j<sp/>>>=<sp/>1;</highlight></codeline> <codeline lineno="978"><highlight class="comment"><sp/></highlight></codeline> <codeline lineno="979"><highlight class="comment"><sp/><sp/><sp/><sp/>}</highlight></codeline> <codeline lineno="980"><highlight class="comment"><sp/><sp/>}<sp/>//<sp/>for<sp/>i</highlight></codeline> <codeline lineno="981"><highlight class="comment"><sp/><sp/>printf("\n");</highlight></codeline> <codeline lineno="982"><highlight class="comment"><sp/><sp/>return;</highlight></codeline> <codeline lineno="983"><highlight class="comment">}<sp/>//<sp/>UbixFS::printFreeBlockList</highlight></codeline> <codeline lineno="984"><highlight class="comment"></highlight></codeline> <codeline lineno="985"><highlight class="comment">UbixFS::~UbixFS(void)<sp/>{</highlight></codeline> <codeline lineno="986"><highlight class="comment"><sp/><sp/>delete<sp/>[]<sp/>freeBlockList;</highlight></codeline> <codeline lineno="987"><highlight class="comment"><sp/><sp/>return;</highlight></codeline> <codeline lineno="988"><highlight class="comment">}</highlight></codeline> <codeline lineno="989"><highlight class="comment">*/</highlight><highlight class="normal"></highlight></codeline> </programlisting> <location file="C:/Dev/git/UbixOS/sys/fs/ubixfsv2/ubixfs.cpp"/> </compounddef> </doxygen>