Commit dee52730 authored by Kir Kolyshkin's avatar Kir Kolyshkin Committed by Pavel Emelyanov

criu/*c: fix typos

In comments:
 cant -> can't
 irrelevent -> irrelevant
 sucess -> success
 prepartion -> preparation
 recepient -> recipient
 lenght -> length
 hexidecimal -> hexadecimal
 becuase -> because
 responce -> response
 controll -> control
 existance -> existence
 alltogether -> altogether
 comparision -> comparison
 immediatly -> immediately
 happenned -> happened
 allready -> already
 simplier -> simpler
 succesfully -> successfully
 absense -> absence

In debug messages:
 Transfering -> Transferring

In error messages:
 reponse -> response
Signed-off-by: 's avatarKir Kolyshkin <kir@openvz.org>
Signed-off-by: 's avatarPavel Emelyanov <xemul@virtuozzo.com>
parent ffed8bb7
...@@ -2610,7 +2610,7 @@ rst_prep_creds_args(CredsEntry *ce, unsigned long *prev_pos) ...@@ -2610,7 +2610,7 @@ rst_prep_creds_args(CredsEntry *ce, unsigned long *prev_pos)
} }
/* /*
* Zap fields which we cant use. * Zap fields which we can't use.
*/ */
args->creds.cap_inh = NULL; args->creds.cap_inh = NULL;
args->creds.cap_eff = NULL; args->creds.cap_eff = NULL;
...@@ -2757,7 +2757,7 @@ static int sigreturn_restore(pid_t pid, struct task_restore_args *task_args, uns ...@@ -2757,7 +2757,7 @@ static int sigreturn_restore(pid_t pid, struct task_restore_args *task_args, uns
/* /*
* We're about to search for free VM area and inject the restorer blob * We're about to search for free VM area and inject the restorer blob
* into it. No irrelevent mmaps/mremaps beyond this point, otherwise * into it. No irrelevant mmaps/mremaps beyond this point, otherwise
* this unwanted mapping might get overlapped by the restorer. * this unwanted mapping might get overlapped by the restorer.
*/ */
......
...@@ -778,7 +778,7 @@ static int chk_keepopen_req(CriuReq *msg) ...@@ -778,7 +778,7 @@ static int chk_keepopen_req(CriuReq *msg)
/* /*
* Generic function to handle CRIU_REQ_TYPE__FEATURE_CHECK. * Generic function to handle CRIU_REQ_TYPE__FEATURE_CHECK.
* *
* The function will have resp.sucess = true for most cases * The function will have resp.success = true for most cases
* and the actual result will be in resp.features. * and the actual result will be in resp.features.
* *
* For each feature which has been requested in msg->features * For each feature which has been requested in msg->features
......
...@@ -447,7 +447,7 @@ out: ...@@ -447,7 +447,7 @@ out:
return ret; return ret;
} }
/* We separate the prepartion of PROCFS remaps because they allocate pstree /* We separate the preparation of PROCFS remaps because they allocate pstree
* items, which need to be seen by the root task. We can't do all remaps here, * items, which need to be seen by the root task. We can't do all remaps here,
* because the files haven't been loaded yet. * because the files haven't been loaded yet.
*/ */
......
...@@ -153,7 +153,7 @@ out: ...@@ -153,7 +153,7 @@ out:
* 2. Open step. * 2. Open step.
* The one who creates the file (the 'master') creates one, * The one who creates the file (the 'master') creates one,
* then creates one more unix socket (transport) and sends the * then creates one more unix socket (transport) and sends the
* created file over this socket to the other recepients. * created file over this socket to the other recipients.
* 3. Receive step. * 3. Receive step.
* Those, who wait for the file to appear, receive one via * Those, who wait for the file to appear, receive one via
* the transport socket, then close the socket and dup() the * the transport socket, then close the socket and dup() the
......
...@@ -540,7 +540,7 @@ static inline int path_length(char *path) ...@@ -540,7 +540,7 @@ static inline int path_length(char *path)
off = strlen(path); off = strlen(path);
/* /*
* If we're pure / then set lenght to zero so that adding this * If we're pure / then set length to zero so that adding this
* value as sub-path offset would produce the correct result. * value as sub-path offset would produce the correct result.
* E.g. the tail path of the "/foo/bar" relative to the "/foo" * E.g. the tail path of the "/foo/bar" relative to the "/foo"
* will be the "/foo/bar" + len("/foo") == "/bar", while the * will be the "/foo/bar" + len("/foo") == "/bar", while the
...@@ -1455,7 +1455,7 @@ static int make_bfmtm_magic_str(char *buf, BinfmtMiscEntry *bme) ...@@ -1455,7 +1455,7 @@ static int make_bfmtm_magic_str(char *buf, BinfmtMiscEntry *bme)
/* /*
* Format is ":name:type(M):offset:magic:mask:interpreter:flags". * Format is ":name:type(M):offset:magic:mask:interpreter:flags".
* Magic and mask are special fields. Kernel outputs them as * Magic and mask are special fields. Kernel outputs them as
* a sequence of hexidecimal numbers (abc -> 616263), and we * a sequence of hexadecimal numbers (abc -> 616263), and we
* dump them without changes. But for registering a new entry * dump them without changes. But for registering a new entry
* it expects every byte is prepended with \x, i.e. \x61\x62\x63. * it expects every byte is prepended with \x, i.e. \x61\x62\x63.
*/ */
...@@ -3267,7 +3267,7 @@ static int __depopulate_roots_yard(void) ...@@ -3267,7 +3267,7 @@ static int __depopulate_roots_yard(void)
ret = 1; ret = 1;
} }
/* /*
* Don't exit after a first error, becuase this function * Don't exit after a first error, because this function
* can be used to rollback in a error case. * can be used to rollback in a error case.
* Don't worry about MNT_DETACH, because files are restored after this * Don't worry about MNT_DETACH, because files are restored after this
* and nobody will not be restored from a wrong mount namespace. * and nobody will not be restored from a wrong mount namespace.
......
...@@ -1095,7 +1095,7 @@ struct unsc_msg { ...@@ -1095,7 +1095,7 @@ struct unsc_msg {
/* /*
* 0th is the call address * 0th is the call address
* 1st is the flags * 1st is the flags
* 2nd is the optional (NULL in responce) arguments * 2nd is the optional (NULL in response) arguments
*/ */
struct iovec iov[3]; struct iovec iov[3];
char c[CMSG_SPACE(sizeof(struct ucred)) + CMSG_SPACE(sizeof(int))]; char c[CMSG_SPACE(sizeof(struct ucred)) + CMSG_SPACE(sizeof(int))];
...@@ -1275,10 +1275,10 @@ int __userns_call(const char *func_name, uns_call_t call, int flags, ...@@ -1275,10 +1275,10 @@ int __userns_call(const char *func_name, uns_call_t call, int flags,
/* /*
* Why don't we lock for async requests? Because * Why don't we lock for async requests? Because
* they just put the request in the daemon's * they just put the request in the daemon's
* queue and do not wait for the responce. Thus * queue and do not wait for the response. Thus
* when daemon responce there's only one client * when daemon response there's only one client
* waiting for it in recvmsg below, so he * waiting for it in recvmsg below, so he
* responces to proper caller. * responses to proper caller.
*/ */
mutex_lock(&task_entries->userns_sync_lock); mutex_lock(&task_entries->userns_sync_lock);
else else
...@@ -1344,7 +1344,7 @@ static int start_usernsd(void) ...@@ -1344,7 +1344,7 @@ static int start_usernsd(void)
* b) Make callers note the damon death by seeing the * b) Make callers note the damon death by seeing the
* disconnected socket. In case of dgram socket * disconnected socket. In case of dgram socket
* callers would just get stuck in receiving the * callers would just get stuck in receiving the
* responce. * response.
*/ */
if (socketpair(PF_UNIX, SOCK_SEQPACKET, 0, sk)) { if (socketpair(PF_UNIX, SOCK_SEQPACKET, 0, sk)) {
......
...@@ -1018,7 +1018,7 @@ static int restore_links(int pid, NetnsEntry **netns) ...@@ -1018,7 +1018,7 @@ static int restore_links(int pid, NetnsEntry **netns)
/* /*
* optimize restore of devices configuration except lo * optimize restore of devices configuration except lo
* lo is created with namespace and before default is set * lo is created with namespace and before default is set
* so we cant optimize its restore * so we can't optimize its restore
*/ */
if (nde->type == ND_TYPE__LOOPBACK) if (nde->type == ND_TYPE__LOOPBACK)
def_netns = NULL; def_netns = NULL;
......
...@@ -365,7 +365,7 @@ int page_xfer_dump_pages(struct page_xfer *xfer, struct page_pipe *pp, ...@@ -365,7 +365,7 @@ int page_xfer_dump_pages(struct page_xfer *xfer, struct page_pipe *pp,
unsigned int cur_hole = 0; unsigned int cur_hole = 0;
int ret; int ret;
pr_debug("Transfering pages:\n"); pr_debug("Transferring pages:\n");
list_for_each_entry(ppb, &pp->bufs, l) { list_for_each_entry(ppb, &pp->bufs, l) {
unsigned int i; unsigned int i;
...@@ -436,7 +436,7 @@ static int page_server_check_parent(int sk, struct page_server_iov *pi) ...@@ -436,7 +436,7 @@ static int page_server_check_parent(int sk, struct page_server_iov *pi)
return -1; return -1;
if (write(sk, &ret, sizeof(ret)) != sizeof(ret)) { if (write(sk, &ret, sizeof(ret)) != sizeof(ret)) {
pr_perror("Unable to send reponse"); pr_perror("Unable to send response");
return -1; return -1;
} }
...@@ -511,7 +511,7 @@ static int page_server_open(int sk, struct page_server_iov *pi) ...@@ -511,7 +511,7 @@ static int page_server_open(int sk, struct page_server_iov *pi)
char has_parent = !!cxfer.loc_xfer.parent; char has_parent = !!cxfer.loc_xfer.parent;
if (write(sk, &has_parent, 1) != 1) { if (write(sk, &has_parent, 1) != 1) {
pr_perror("Unable to send reponse"); pr_perror("Unable to send response");
close_page_xfer(&cxfer.loc_xfer); close_page_xfer(&cxfer.loc_xfer);
return -1; return -1;
} }
......
...@@ -886,7 +886,7 @@ static void *bootstrap_start; ...@@ -886,7 +886,7 @@ static void *bootstrap_start;
static unsigned int bootstrap_len; static unsigned int bootstrap_len;
/* /*
* sys_munmap must not return here. The controll process must * sys_munmap must not return here. The control process must
* trap us on the exit from sys_munmap. * trap us on the exit from sys_munmap.
*/ */
#ifdef CONFIG_VDSO #ifdef CONFIG_VDSO
......
...@@ -147,7 +147,7 @@ int recv_fds(int sock, int *fds, int nr_fds, struct fd_opts *opts) ...@@ -147,7 +147,7 @@ int recv_fds(int sock, int *fds, int nr_fds, struct fd_opts *opts)
min_fd = (cmsg->cmsg_len - sizeof(struct cmsghdr)) / sizeof(int); min_fd = (cmsg->cmsg_len - sizeof(struct cmsghdr)) / sizeof(int);
/* /*
* In case if kernel screwed the recepient, most probably * In case if kernel screwed the recipient, most probably
* the caller stack frame will be overwriten, just scream * the caller stack frame will be overwriten, just scream
* and exit. * and exit.
* *
......
...@@ -307,7 +307,7 @@ static int vma_get_mapfile(char *fname, struct vma_area *vma, DIR *mfd, ...@@ -307,7 +307,7 @@ static int vma_get_mapfile(char *fname, struct vma_area *vma, DIR *mfd,
/* /*
* Another bad thing is that kernel first checks * Another bad thing is that kernel first checks
* for permission access to ANY map_files link, * for permission access to ANY map_files link,
* then checks for its existance. So we have to * then checks for its existence. So we have to
* check for file path being empty to "emulate" * check for file path being empty to "emulate"
* the ENOENT case. * the ENOENT case.
*/ */
...@@ -436,7 +436,7 @@ int parse_self_maps_lite(struct vm_area_list *vms) ...@@ -436,7 +436,7 @@ int parse_self_maps_lite(struct vm_area_list *vms)
/* /*
* This list is needed for one thing only -- to * This list is needed for one thing only -- to
* get the idea of what parts of current address * get the idea of what parts of current address
* space are busy. So merge them alltogether. * space are busy. So merge them altogether.
*/ */
prev->e->end = e; prev->e->end = e;
else { else {
...@@ -2505,11 +2505,11 @@ bool proc_status_creds_dumpable(struct proc_status_creds *parent, ...@@ -2505,11 +2505,11 @@ bool proc_status_creds_dumpable(struct proc_status_creds *parent,
offsetof(struct proc_status_creds, cap_inh); offsetof(struct proc_status_creds, cap_inh);
/* /*
* The comparision rules are the following * The comparison rules are the following
* *
* - CAPs can be different * - CAPs can be different
* - seccomp filters should be passed via * - seccomp filters should be passed via
* semantic comparision (FIXME) but for * semantic comparison (FIXME) but for
* now we require them to be exactly * now we require them to be exactly
* identical * identical
* - the rest of members must match * - the rest of members must match
......
...@@ -111,7 +111,7 @@ static int skip_sigstop(int pid, int nr_signals) ...@@ -111,7 +111,7 @@ static int skip_sigstop(int pid, int nr_signals)
* SGISTOP can't be blocked, so we need to wait when the kernel * SGISTOP can't be blocked, so we need to wait when the kernel
* handles this signal. * handles this signal.
* *
* Otherwise the process will be stopped immediatly after * Otherwise the process will be stopped immediately after
* starting it. * starting it.
* *
* 2) A seized task was stopped: * 2) A seized task was stopped:
......
...@@ -214,7 +214,7 @@ static int rst_mem_remap_one(struct rst_mem_type_s *t, void *to) ...@@ -214,7 +214,7 @@ static int rst_mem_remap_one(struct rst_mem_type_s *t, void *to)
if (!t->buf) if (!t->buf)
/* /*
* No allocations happenned from this buffer. * No allocations happened from this buffer.
* It's safe just to do nothing. * It's safe just to do nothing.
*/ */
return 0; return 0;
......
...@@ -605,7 +605,7 @@ static int collect_threads(struct pstree_item *item) ...@@ -605,7 +605,7 @@ static int collect_threads(struct pstree_item *item)
goto err; goto err;
} }
/* The number of threads can't be less than allready frozen */ /* The number of threads can't be less than already frozen */
item->threads = xrealloc(item->threads, nr_threads * sizeof(struct pid)); item->threads = xrealloc(item->threads, nr_threads * sizeof(struct pid));
if (item->threads == NULL) if (item->threads == NULL)
return -1; return -1;
......
...@@ -451,7 +451,7 @@ static struct file_desc *pty_alloc_reg(struct tty_info *info, bool add) ...@@ -451,7 +451,7 @@ static struct file_desc *pty_alloc_reg(struct tty_info *info, bool add)
* @info as a template we generate that named 'inverted-path'. * @info as a template we generate that named 'inverted-path'.
* *
* For example if the master peer was /dev/pts/ptmx with index 1, * For example if the master peer was /dev/pts/ptmx with index 1,
* the inverted path is /dev/pts/1, for inverted slaves it's simplier * the inverted path is /dev/pts/1, for inverted slaves it's simpler
* we just add 'ptmx' postfix. * we just add 'ptmx' postfix.
*/ */
static struct reg_file_info *pty_alloc_fake_reg(struct tty_info *info, int subtype) static struct reg_file_info *pty_alloc_fake_reg(struct tty_info *info, int subtype)
...@@ -1964,7 +1964,7 @@ static void tty_dinfo_free(struct tty_dump_info *dinfo) ...@@ -1964,7 +1964,7 @@ static void tty_dinfo_free(struct tty_dump_info *dinfo)
* Dumping queued data must be done at the very end of the * Dumping queued data must be done at the very end of the
* checkpoint procedure -- it's tail optimization, we trying * checkpoint procedure -- it's tail optimization, we trying
* to defer this procedure until everything else passed * to defer this procedure until everything else passed
* succesfully because in real it is time consuming on * successfully because in real it is time consuming on
* its own which might require writting data back to the * its own which might require writting data back to the
* former peers if case something go wrong. * former peers if case something go wrong.
* *
......
...@@ -35,7 +35,7 @@ ...@@ -35,7 +35,7 @@
#endif #endif
/* /*
* Absense of the 1st ioctl means we cannot restore tun link. But * Absence of the 1st ioctl means we cannot restore tun link. But
* since the 2nd one appeared at the same time, we'll "check" this * since the 2nd one appeared at the same time, we'll "check" this
* by trying to dump filter and abort dump if it's not there. * by trying to dump filter and abort dump if it's not there.
*/ */
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment