fRoot
const entry_ref fRoot;
AVLTreeNode* fRoot;
return LeftMost(fRoot);
return RightMost(fRoot);
inline AVLTreeNode* Root() const { return fRoot; }
if (Definition::Compare(key, fRoot) != 0)
Node* node = fRoot;
Link* rootLink = Definition::GetLink(fRoot);
fRoot = rootLink->right;
fRoot = rootLink->left;
Definition::GetLink(fRoot)->right = temp;
if (node != fRoot)
Link* rootLink = Definition::GetLink(fRoot);
fRoot = rootLink->right;
fRoot = rootLink->left;
Definition::GetLink(fRoot)->right = temp;
if (fRoot == NULL)
Node* node = fRoot;
if (fRoot == NULL)
Node* node = fRoot;
if (fRoot == NULL)
return Definition::Compare(key, fRoot) == 0 ? fRoot : NULL;
return fRoot;
return fRoot == NULL;
Node* node = fRoot;
if (fRoot == NULL)
Node* node = fRoot;
fRoot = other.fRoot;
Node* t = fRoot;
fRoot = t;
Node* fRoot;
fRoot(NULL)
if (fRoot == NULL) {
fRoot = node;
int c = Definition::Compare(key, fRoot);
Link* rootLink = Definition::GetLink(fRoot);
nodeLink->right = fRoot;
nodeLink->left = fRoot;
fRoot = node;
if (fRoot == NULL)
fs->fRoot = rootInode;
if (!fRoot->ProbeMigration())
status_t result = fRoot->GetLocations(&values);
fRoot(NULL),
xprintf("\tRootInode at %p\n", fRoot);
RootInode* fRoot;
return fRoot;
fRoot(NULL)
ServerNode* node = fRoot;
ServerNode* current = fRoot;
fRoot = NULL;
ServerNode* current = fRoot;
fRoot = node;
ServerNode* fRoot;
fRoot(NULL),
for (int i = fRoot->NumRecords() - 1; i >= 0; i--) {
int level = fRoot->Levels() - 1;
fRoot = new(std::nothrow) BlockInDataFork;
if (fRoot == NULL) {
uint16 levelsInTree = fRoot->Levels();
memcpy((void*)fRoot,
delete fRoot;
BlockInDataFork* fRoot;
fRoot(NULL),
if (fRoot == NULL) {
fRoot = (FRACTAL*)calloc(1, sizeof(FRACTAL));
if (fRoot == NULL)
Fractal = fRoot;
if (fRoot != NULL) {
_FreeIFS(fRoot);
free((void*)fRoot);
if (fRoot == NULL)
F = fRoot;
if (fRoot && speed > 0 && speed <= 12)
fRoot->Speed = speed;
FRACTAL* F = fRoot;
FRACTAL* fRoot;
fRoot(NULL),
fRoot = new(std::nothrow) WatchedEntry(fRoster, fMessenger, &ref);
delete fRoot;
fRoot->EntryCreated(&ref);
fRoot->EntryRemoved(node);
WatchedEntry * fRoot;
_StopWatchingAncestors(fRoot, false);
_StartWatchingAncestors(fRoot, false);
Ancestor* fRoot;
fRoot(NULL),
fStatus = _StartWatchingAncestors(fRoot, false);
while (fRoot != NULL) {
Ancestor* nextAncestor = fRoot->Child();
delete fRoot;
fRoot = nextAncestor;
if (fRoot == NULL)
fRoot = ancestor;
Info* info = new(std::nothrow) Info(fRoot, this, path,
RootInfo* fRoot;
fRoot(root),
return fRoot;
if (Volume* volume = fRoot->GetVolume(repository.Location())) {
Volume* volume = fRoot->GetVolume(transaction.Repository().Location());
Volume* volume = fRoot->GetVolume(transaction.Repository().Location());
fRoot(root),
Root* fRoot;
fRoot(root),
fRoot->_CommitTransaction(fVolume, fMessage.Get());
Root* fRoot;
bool sendNotification = fRoot->IsSystemRoot();
fRoot(NULL),
{ return fRoot; }
{ fRoot = root; }
Root* fRoot;
err = UpdateEntry(&fRoot);
fRoot(root ? *root : entry_ref()),
const entry_ref fRoot;
fRoot(NULL)
fRoot = new(nothrow) Directory(*this, fRootNode);
delete fRoot;
if (fRoot != NULL)
Directory *Root() { return fRoot; }
Directory *fRoot;
fRoot = new(nothrow) Directory(*this, 0, fRootDirCluster, "/");
delete fRoot;
if (fRoot == NULL)
Directory *Root() { return fRoot; }
Directory *fRoot;
AVLTreeNode* node = fRoot;
AVLTreeNode* node = fRoot;
AVLTreeNode* node = fRoot;
_CheckTree(NULL, fRoot, nodeCount);
AVLTreeNode** node = &fRoot;
: fRoot(NULL),
= (parent ? (isLeft ? &parent->left : &parent->right) : &fRoot);
nodeP = (parent ? (isLeft ? &parent->left : &parent->right) : &fRoot);
fRoot = NULL;