mirror of
https://github.com/checkpoint-restore/criu
synced 2025-08-22 09:58:09 +00:00
ci: fix new codespell errors
Signed-off-by: Adrian Reber <areber@redhat.com>
This commit is contained in:
parent
727d796505
commit
df7b897a22
@ -1,3 +1,3 @@
|
||||
[codespell]
|
||||
skip = ./.git,./test/pki
|
||||
ignore-words-list = creat,fpr,fle,ue,bord,parms,nd,te,testng
|
||||
ignore-words-list = creat,fpr,fle,ue,bord,parms,nd,te,testng,inh,wronly,renderd,bui,clen
|
||||
|
@ -18,7 +18,7 @@ struct aux_context {
|
||||
struct _aarch64_ctx end;
|
||||
};
|
||||
|
||||
// XXX: the idetifier rt_sigcontext is expected to be struct by the CRIU code
|
||||
// XXX: the identifier rt_sigcontext is expected to be struct by the CRIU code
|
||||
#define rt_sigcontext sigcontext
|
||||
|
||||
#include <compel/sigframe-common.h>
|
||||
|
@ -14,7 +14,7 @@
|
||||
*/
|
||||
#include <signal.h>
|
||||
|
||||
// XXX: the idetifier rt_sigcontext is expected to be struct by the CRIU code
|
||||
// XXX: the identifier rt_sigcontext is expected to be struct by the CRIU code
|
||||
#define rt_sigcontext sigcontext
|
||||
|
||||
#include <compel/sigframe-common.h>
|
||||
|
@ -41,7 +41,7 @@
|
||||
* implementation and it is specific to every kernel version,
|
||||
* its contents should not be dumped ever
|
||||
* - vdso,vvar
|
||||
* the vDSO area, it might reqire additional memory
|
||||
* the vDSO area, it might require additional memory
|
||||
* contents modification especially when tasks are
|
||||
* migrating between different kernel versions
|
||||
* - heap
|
||||
|
@ -161,7 +161,7 @@ static bool is_stack(struct pstree_item *item, unsigned long vaddr)
|
||||
* put the memory into the page-pipe's pipe.
|
||||
*
|
||||
* "Holes" in page-pipe are regions, that should be dumped, but
|
||||
* the memory contents is present in the pagent image set.
|
||||
* the memory contents is present in the parent image set.
|
||||
*/
|
||||
|
||||
static int generate_iovs(struct pstree_item *item, struct vma_area *vma, struct page_pipe *pp, u64 *map, u64 *off,
|
||||
|
@ -2823,7 +2823,7 @@ static LIST_HEAD(mnt_remap_list);
|
||||
static int remap_id;
|
||||
|
||||
struct mnt_remap_entry {
|
||||
struct mount_info *mi; /* child is remaped into the root yards */
|
||||
struct mount_info *mi; /* child is remapped into the root yards */
|
||||
struct mount_info *parent; /* the origin parent for the child*/
|
||||
struct list_head node;
|
||||
};
|
||||
|
@ -1454,7 +1454,7 @@ int start_unix_cred_daemon(pid_t *pid, int (*daemon_func)(int sk))
|
||||
* each other easily. Stream socket require manual
|
||||
* messages boundaries.
|
||||
*
|
||||
* b) Make callers note the damon death by seeing the
|
||||
* b) Make callers note the daemon death by seeing the
|
||||
* disconnected socket. In case of dgram socket
|
||||
* callers would just get stuck in receiving the
|
||||
* response.
|
||||
|
@ -3433,7 +3433,7 @@ struct ns_id *net_get_root_ns(void)
|
||||
|
||||
/*
|
||||
* socket_diag doesn't report unbound and unconnected sockets,
|
||||
* so we have to get their network namesapces explicitly
|
||||
* so we have to get their network namespaces explicitly
|
||||
*/
|
||||
struct ns_id *get_socket_ns(int lfd)
|
||||
{
|
||||
|
@ -1068,7 +1068,7 @@ static int vma_remap(VmaEntry *vma_entry, int uffd)
|
||||
* |G|----tgt----| |
|
||||
*
|
||||
* 3. remap src to any other place.
|
||||
* G prevents src from being remaped on tgt again
|
||||
* G prevents src from being remapped on tgt again
|
||||
* | |-------------| -> |+++++src+++++|
|
||||
* |G|---tgt-----| |
|
||||
*
|
||||
|
@ -11,7 +11,7 @@
|
||||
* Because of kernel doing kmalloc for user data passed
|
||||
* in SCM messages, and there is kernel's SCM_MAX_FD as a limit
|
||||
* for descriptors passed at once we're trying to reduce
|
||||
* the pressue on kernel memory manager and use predefined
|
||||
* the pressure on kernel memory manager and use predefined
|
||||
* known to work well size of the message buffer.
|
||||
*/
|
||||
#define CR_SCM_MSG_SIZE (1024)
|
||||
|
@ -263,7 +263,7 @@ ROCm | Radeon Open Compute Platform
|
||||
Thunk | User-mode API interface to interact with amdgpu.ko
|
||||
KFD | AMD Kernel Fusion Driver
|
||||
Mesa | Open source OpenGL implementation
|
||||
GTT | Graphis Translation Table, also used to denote kernel-managed system memory for GPU access
|
||||
GTT | Graphics Translation Table, also used to denote kernel-managed system memory for GPU access
|
||||
VRAM | Video RAM
|
||||
BO | Buffer Object
|
||||
HMM | Heterogeneous Memory Management
|
||||
|
@ -1241,7 +1241,7 @@ static bool map_devices(struct tp_system *src_sys, struct tp_system *dest_sys, s
|
||||
return true;
|
||||
} else {
|
||||
/* We could not map remaining nodes in the list. Add dest node back
|
||||
* to list and try to map next dest ndoe in list to current src
|
||||
* to list and try to map next dest node in list to current src
|
||||
* node.
|
||||
*/
|
||||
pr_debug("Nodes after [0x%04X -> 0x%04X] did not match, "
|
||||
|
@ -462,7 +462,7 @@ fail_desc = {
|
||||
|
||||
|
||||
def chk_real_state(st):
|
||||
# Before enything else -- check that we still have
|
||||
# Before anything else -- check that we still have
|
||||
# all the sockets at hands
|
||||
for sk in st.sockets:
|
||||
if not sk.visible:
|
||||
|
@ -18,7 +18,7 @@ setsid java HelloWorld &
|
||||
|
||||
pid=${!}
|
||||
|
||||
echo Lanuched java application with pid $pid in background
|
||||
echo Launched java application with pid $pid in background
|
||||
|
||||
${criu} dump -D dump -o dump.log -v4 --shell-job -t ${pid} || {
|
||||
echo "Dump failed"
|
||||
|
@ -28,7 +28,7 @@ setsid make -j4 &
|
||||
|
||||
pid=${!}
|
||||
|
||||
echo Lanuched make in $pid background
|
||||
echo Launched make in $pid background
|
||||
sleep 2
|
||||
|
||||
${criu} dump --shell-job -D dump -o dump.log -v4 -t ${pid} || {
|
||||
|
@ -10,7 +10,7 @@
|
||||
#include "zdtmtst.h"
|
||||
|
||||
const char *test_doc = "Check that tree prior to files opening";
|
||||
const char *test_author = "Stanislav Kinsbursky <skinsbursky@paralles.com";
|
||||
const char *test_author = "Stanislav Kinsbursky <skinsbursky@parallels.com>";
|
||||
|
||||
int main(int argc, char **argv)
|
||||
{
|
||||
|
@ -137,7 +137,7 @@ static int check_map(struct map *map)
|
||||
}
|
||||
/* prot |= PROT_READ// need barrier before this line,
|
||||
because compiler change order commands.
|
||||
I finded one method: look at next lines*/
|
||||
I found one method: look at next lines*/
|
||||
} else
|
||||
prot &= PROT_WRITE | !PROT_READ | PROT_EXEC;
|
||||
|
||||
|
@ -71,7 +71,7 @@ int main(int argc, char **argv)
|
||||
task_waiter_wait4(&t, 2);
|
||||
|
||||
if (access(bspath, F_OK)) {
|
||||
fail("%s isn't accessiable", bspath);
|
||||
fail("%s isn't accessible", bspath);
|
||||
return 1;
|
||||
}
|
||||
|
||||
|
@ -65,7 +65,7 @@ int main(int argc, char **argv)
|
||||
}
|
||||
|
||||
if (WIFSTOPPED(status))
|
||||
test_msg("The procces stopped\n");
|
||||
test_msg("The process stopped\n");
|
||||
else {
|
||||
fail("The process doesn't stopped");
|
||||
goto out;
|
||||
|
@ -178,7 +178,7 @@ int main(int argc, char **argv)
|
||||
pr_perror("Child 2 was killed");
|
||||
} else if (WEXITSTATUS(ret)) {
|
||||
fail_count++;
|
||||
pr_perror("Child 2 couldn't inititalise");
|
||||
pr_perror("Child 2 couldn't initialise");
|
||||
}
|
||||
out_child:
|
||||
kill(pid1, SIGTERM);
|
||||
@ -188,7 +188,7 @@ out_child:
|
||||
pr_perror("Child 1 was killed");
|
||||
} else if (WEXITSTATUS(ret)) {
|
||||
fail_count++;
|
||||
pr_perror("Child 1 couldn't inititalise");
|
||||
pr_perror("Child 1 couldn't initialise");
|
||||
}
|
||||
out_shdt:
|
||||
shmdt(mem);
|
||||
|
@ -25,7 +25,7 @@ int main(int argc, char **argv)
|
||||
|
||||
test_init(argc, argv);
|
||||
|
||||
/* we presume that malloc returns not page aliged address */
|
||||
/* we presume that malloc returns not page aligned address */
|
||||
mem = malloc(PAGE_SIZE * N_PAGES);
|
||||
org = malloc(PAGE_SIZE);
|
||||
if (!mem || !org) {
|
||||
|
Loading…
x
Reference in New Issue
Block a user