backref.c (48ec47364b6d493f0a9cdc116977bf3f34e5c3ec) backref.c (fae7f21cece9a4c181a8d8131870c7247e153f65)
1/*
2 * Copyright (C) 2011 STRATO. All rights reserved.
3 *
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
7 *
8 * This program is distributed in the hope that it will be useful,

--- 312 unchanged lines hidden (view full) ---

321 ref->root_id, level, ref->count, ret,
322 ref->key_for_search.objectid, ref->key_for_search.type,
323 ref->key_for_search.offset);
324 if (ret < 0)
325 goto out;
326
327 eb = path->nodes[level];
328 while (!eb) {
1/*
2 * Copyright (C) 2011 STRATO. All rights reserved.
3 *
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
7 *
8 * This program is distributed in the hope that it will be useful,

--- 312 unchanged lines hidden (view full) ---

321 ref->root_id, level, ref->count, ret,
322 ref->key_for_search.objectid, ref->key_for_search.type,
323 ref->key_for_search.offset);
324 if (ret < 0)
325 goto out;
326
327 eb = path->nodes[level];
328 while (!eb) {
329 if (!level) {
330 WARN_ON(1);
329 if (WARN_ON(!level)) {
331 ret = 1;
332 goto out;
333 }
334 level--;
335 eb = path->nodes[level];
336 }
337
338 ret = add_all_parents(root, path, parents, level, &ref->key_for_search,

--- 1509 unchanged lines hidden --- 		330 ret = 1;
331 goto out;
332 }
333 level--;
334 eb = path->nodes[level];
335 }
336
337 ret = add_all_parents(root, path, parents, level, &ref->key_for_search,

--- 1509 unchanged lines hidden ---