unsigned long flags;
state = kmem_cache_alloc(extent_state_cache, mask);
- if (!state || IS_ERR(state))
+ if (!state)
return state;
state->state = 0;
state->private = 0;
* our range starts.
*/
node = tree_search(tree, start);
- if (!node || IS_ERR(node)) {
+ if (!node) {
goto out;
}
* our range starts.
*/
node = tree_search(tree, start);
- if (!node || IS_ERR(node)) {
+ if (!node) {
goto out;
}
*/
search_again:
node = tree_search(tree, cur_start);
- if (!node || IS_ERR(node)) {
+ if (!node) {
*end = (u64)-1;
goto out;
}
* our range starts.
*/
node = tree_search(tree, cur_start);
- if (!node || IS_ERR(node)) {
+ if (!node) {
goto out;
}
* our range starts.
*/
node = tree_search(tree, start);
- if (!node || IS_ERR(node)) {
+ if (!node) {
ret = -ENOENT;
goto out;
}
* our range starts.
*/
node = tree_search(tree, start);
- if (!node || IS_ERR(node)) {
+ if (!node) {
ret = -ENOENT;
goto out;
}
int uptodate = 1;
eb = __alloc_extent_buffer(tree, start, len, mask);
- if (!eb || IS_ERR(eb))
+ if (!eb)
return NULL;
if (eb->flags & EXTENT_BUFFER_FILLED)
int uptodate = 1;
eb = __alloc_extent_buffer(tree, start, len, mask);
- if (!eb || IS_ERR(eb))
+ if (!eb)
return NULL;
if (eb->flags & EXTENT_BUFFER_FILLED)