Linux websever 5.15.0-153-generic #163-Ubuntu SMP Thu Aug 7 16:37:18 UTC 2025 x86_64
Apache/2.4.52 (Ubuntu)
: 192.168.3.70 | : 192.168.1.99
Cant Read [ /etc/named.conf ]
8.1.2-1ubuntu2.23
urlab
www.github.com/MadExploits
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
CPANEL RESET
CREATE WP USER
README
+ Create Folder
+ Create File
/
opt /
miniconda3 /
python /
include /
solv /
[ HOME SHELL ]
Name
Size
Permission
Action
bitmap.h
1.52
KB
-rw-rw-r--
chksum.h
1.16
KB
-rw-rw-r--
conda.h
638
B
-rw-rw-r--
dataiterator.h
4.99
KB
-rw-rw-r--
dirpool.h
1.67
KB
-rw-rw-r--
evr.h
815
B
-rw-rw-r--
hash.h
1.57
KB
-rw-rw-r--
knownid.h
13.69
KB
-rw-rw-r--
policy.h
1.7
KB
-rw-rw-r--
pool.h
13.77
KB
-rw-rw-r--
poolarch.h
1.21
KB
-rw-rw-r--
poolid.h
1.16
KB
-rw-rw-r--
pooltypes.h
1.06
KB
-rw-rw-r--
poolvendor.h
499
B
-rw-rw-r--
problems.h
2.65
KB
-rw-rw-r--
queue.h
2.41
KB
-rw-rw-r--
repo.h
7.85
KB
-rw-rw-r--
repo_conda.h
491
B
-rw-rw-r--
repo_solv.h
557
B
-rw-rw-r--
repo_write.h
1.93
KB
-rw-rw-r--
repodata.h
11.93
KB
-rw-rw-r--
rules.h
6.43
KB
-rw-rw-r--
selection.h
2.55
KB
-rw-rw-r--
solv_xfopen.h
553
B
-rw-rw-r--
solvable.h
3.87
KB
-rw-rw-r--
solver.h
17.66
KB
-rw-rw-r--
solverdebug.h
1.24
KB
-rw-rw-r--
solvversion.h
1.61
KB
-rw-rw-r--
strpool.h
1.44
KB
-rw-rw-r--
testcase.h
2.11
KB
-rw-rw-r--
tools_util.h
1.6
KB
-rw-rw-r--
transaction.h
4.75
KB
-rw-rw-r--
util.h
3.07
KB
-rw-rw-r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : queue.h
/* * Copyright (c) 2007, Novell Inc. * * This program is licensed under the BSD license, read LICENSE.BSD * for further information */ /* * queue.h * */ #ifndef LIBSOLV_QUEUE_H #define LIBSOLV_QUEUE_H #include "pooltypes.h" #ifdef __cplusplus extern "C" { #endif typedef struct s_Queue { Id *elements; /* pointer to elements */ int count; /* current number of elements in queue */ Id *alloc; /* this is whats actually allocated, elements > alloc if shifted */ int left; /* space left in alloc *after* elements+count */ } Queue; extern void queue_alloc_one(Queue *q); /* internal */ extern void queue_alloc_one_head(Queue *q); /* internal */ /* clear queue */ static inline void queue_empty(Queue *q) { if (q->alloc) { q->left += (q->elements - q->alloc) + q->count; q->elements = q->alloc; } else q->left += q->count; q->count = 0; } static inline Id queue_shift(Queue *q) { if (!q->count) return 0; q->count--; return *q->elements++; } static inline Id queue_pop(Queue *q) { if (!q->count) return 0; q->left++; return q->elements[--q->count]; } static inline void queue_unshift(Queue *q, Id id) { if (!q->alloc || q->alloc == q->elements) queue_alloc_one_head(q); *--q->elements = id; q->count++; } static inline void queue_push(Queue *q, Id id) { if (!q->left) queue_alloc_one(q); q->elements[q->count++] = id; q->left--; } static inline void queue_pushunique(Queue *q, Id id) { int i; for (i = q->count; i > 0; ) if (q->elements[--i] == id) return; queue_push(q, id); } static inline void queue_push2(Queue *q, Id id1, Id id2) { queue_push(q, id1); queue_push(q, id2); } static inline void queue_truncate(Queue *q, int n) { if (q->count > n) { q->left += q->count - n; q->count = n; } } extern void queue_init(Queue *q); extern void queue_init_buffer(Queue *q, Id *buf, int size); extern void queue_init_clone(Queue *target, const Queue *source); extern void queue_free(Queue *q); extern void queue_insert(Queue *q, int pos, Id id); extern void queue_insert2(Queue *q, int pos, Id id1, Id id2); extern void queue_insertn(Queue *q, int pos, int n, const Id *elements); extern void queue_delete(Queue *q, int pos); extern void queue_delete2(Queue *q, int pos); extern void queue_deleten(Queue *q, int pos, int n); extern void queue_prealloc(Queue *q, int n); #ifdef __cplusplus } #endif #endif /* LIBSOLV_QUEUE_H */
Close
