Re: (Solaris) What does "pargs -x" do?

From: Paul Pluzhnikov (ppluzhnikov-nsp_at_charter.net)
Date: 09/28/04 

Date: 27 Sep 2004 18:24:20 -0700

gazelle@yin.interaccess.com (Kenny McCormack) writes:

> I recently discovered the "pargs" command in Solaris 9.
> What is the "alternate vector"?

It's not "alternate vector", but an "auxiliary vector".

It is an array of values that the kernel passes on to the dynamic
loader (ld.so), in order to make loader's life easier.

Cheers, 

-- 
In order to understand recursion you must first understand recursion.
Remove /-nsp/ for email.

Relevant Pages

  • Re: (Solaris) What does "pargs -x" do?
    ... It is an array of values that the kernel passes on to the dynamic ... loader, in order to make loader's life easier. ... In order to understand recursion you must first understand recursion. ...
    (comp.unix.solaris)
  • Re: dynamic linker problem with libpthread.so.0?
    ... > symbol errno, version GLIBC_PRIVATE not defined in file libc.so.6 with link ... If the kernel on the target is older, ... The output above means that loader will not use it on kernels ... In order to understand recursion you must first understand recursion. ...
    (comp.os.linux.development.system)
  • Re: [PHP] unset in foreach breaks recrusion
    ... but on next recursion when it's not empty - do nothing:) ... Though I found how to cut a few seconds (on very big array), ... (although I've been working with PHP for at least 3 years), ... entry from each parent it can get to and it only can get to few, ...
    (php.general)
  • Re: [PHP] unset in foreach breaks recrusion
    ... $sorted is empty, if it is -> run the foreach and return, ... but on next recursion when it's not empty - do nothing:) ... Though I found how to cut a few seconds (on very big array), ... Now, about your other suggestion, yes, it will work without the reference. ...
    (php.general)
  • Re: counting subsets of S so that sum(S_n) = N
    ... and make my algorithm generate only unique subsets? ... and the array of boolean at one step of the algorithm is ... implementation without needing recursion. ... subsequence in W, process it and return. ...
    (comp.programming)