How to find all aliases? Search program needed

Whenever I try to browse certain types of Web sites with Firefox - and I'm not sure what the common denominator is, but it might be Javascript - the OS tries to connect to an AFP share point on another machine. There's no good reason for it to do this.
This is apparently a common problem. Google for "AFP Connection Status" and you'll see a lot of reports of "stale" AFP pointers being generated by various Mac programs, which cause this sort of behavior ever after. Solutions invariably involve looking in directories associated with the application, like "Plugins", for stale link alias files.
I've looked in the obvious places and I can't find it. Now, what I need to do is find (or write) a program which lists ALL the alias files in the system, or, preferably, all the aliases which point to an AFP share point. Because there SHOULDN'T BE ANY. Aliases are, these days, zero-length files with structured information in the resource fork containing the actual information about the file being pointed at.
Can anyone help by pointing out such a program? The BSD "find" command hasn't been extended (yet) to search file metatdata, it seems, at least not according to the man page. I am no stranger to the Terminal, being an old FreeBSD hand, so UNIX-style solutions are welcome.
Mac Pro (4-core) Mac OS X (10.4.9)

Had to solve this one on my own. Hopefully people will see this when they Google for it, but this is a general solution to the problem of persistent "AFP Connection Status" popups that won't go away.
The problem, as others have stated, is that there is an alias somewhere on the system that points to the missing share. The share won't be mentioned in a regular file; the share point's information is located in the resource fork of the alias. What's needed is a way to search the entire file system for any resource fork that mentions the share.
Here is how to do that:
# find / -type f -exec grep funkyshare '{}'/rsrc \; -print
When this command finds the aliases - and there may be more than one - you can delete them.

Similar Messages

How to find all z-programs in system using spars field in select ???

hi all,
i have to make change in all program in my system in which spars field is used in select statement. how to fin all those z-programs
points will be awarded for all useful answers.
Regards
Deepak Kumar

run the report RPR_ABAP_SOURCE_SCAN, give 'z*' in "Program name" field, and 'SPRAS' in "Find string" field, u'll get to know the places where SPRAS is used, modify those programs accordingly....
Reward points if useful, get back in case of query...
Cheers!!!

How to find all JMX ports on a server?

How to find all jmx ports on particular server (say localhost) on windows
I have multiple JVM's running on my local server, and there is extensive use of JXM mbeans by the applications running on each server. So I want to connect to all these JMX servers and to instrument the MBeans using Jconsole(Jconsole localhost:<port>). But I don't know the port numbers, and its not logged by the application.
How do I find all the ports jmx servers connected?
Note : In my case I can not instrument using the PID.
thanks,
bala K

Hi kajbj,
I tried stop/start the application, but couldn't find any difference in the netstat command. I know it should show the JMX port (I am able to see on a test application), but this application's JMX port usage is missing.
netstat -ano --> Do i need to use any other commands?
I just injected few lines of code ( to list the MBeanServers programatically), to this application (did some usual tweaks to let this code execute at some time) and its listing couple of MBeanServers and lot of MBeans.
MBeanServerFactory.findMBeanServer(null); and so on.....
Is there a way to get the port using the Management API's?
thanks,
bala K

How to find out Which SAP programs are affecting Which Z programs?

Do we have a program/tool that can tell us the following:
How to find out Which SAP programs are affecting Which Z programs in the entire development server?
We have a list of SAP programs and a list of custom u2018zu2019 programs, which ones impact each other?   I know we have a u201Cwhere usedu201D functionality, however that is at the object by object level.
We need are looking for something a little larger u2013
thanks in advance
Vishnu

Do we have a program/tool that can tell us the following:
How to find out Which SAP programs are affecting Which Z programs in the entire development server?
We have a list of SAP programs and a list of custom u2018zu2019 programs, which ones impact each other?   I know we have a u201Cwhere usedu201D functionality, however that is at the object by object level.
We need are looking for something a little larger u2013
thanks in advance
Vishnu

How to find all solutions for reordering of vector

hello everyone
-I have problem in finding all possible solutions for reordering of vector.
-I have vector named (vect_temp) and I want to find all possible reordering of this vector.
-I have function named Min_diff(vect_temp,next_point) works as follows : I should gave it an element (next_point) in the vector (vect_temp) and it must generate the vector (vect_diff) that contains all possible elements next elements.
-The function nex_min(vect_temp,next_point) works as follows : I should gave it an element (next_point) in the vector (vect_temp) and it must generate the vector (vect_min) that contains all possible elements next elements.
-reordering critriea:
-Min_diff(vect_temp,next_point) and nex_min(vect_temp,next_point) and (next_point) in this first iteration is equal to any selected element in the (vect_temp). after calling the functions, if element in the (vect_diff) is equal to the element in ( vect_min) then add this element into the ordered set [ vec_ordering] and call functions Min_diff(vect_temp,next_point) and nex_min(vect_temp,next_point) again , next_point now is the equal to the element that we have been added in the previous step into the ordered set [ vec_ordering] and repeat this process until all elements in (vect_temp) are ordered according to this criteria.
- I'm able to do reordering according to the cirtira above and find one solution. but the problem is that if (vect_diff) contains many elements that equal to many elements in ( vect_min), in this case I need to do reordering for the first equal element and this will be one solution and then find reordering for the next equal element and so on.
let's consider this example:
- let (vect_temp) contains element [5,9,7,3,1]
- for the firs iteration let the next_point equal to 7
- after calling function Min_diff(vect_temp,next_point), then (vect_diff) will contain [ 5,9,3]
- after calling function nex_min(vect_temp,next_point), then ( vect_min) will contain [ 5,9]
so for now (vect_diff) and ( vect_min) will have two equal elements.
- the first solution must be that fist take the first equal element and do reordering such that ordered set [ vec_ordering] will equal to [7,5] then call functions Min_diff(vect_temp,next_point), and nex_min(vect_temp,next_point) again. the( next_point) in this iteration is qual to 5, these funtions will find next elements, let's consider that (vect_diff) and ( vect_min) will have equal element [3] then add this element to the ordered set [ vec_ordering] and repeat calling functions util all elments in (vect_temp) are added to the ordered set [ vec_ordering]. This will be one solution. now the second solution will be is to take second equal elment [9] instead of [5] and continue calling functions and finding ordered list.
so that each time vect_diff and vect_min will have many equal elements, then do reordering for first equal element this is one solution and then do reordering for the second equal element and so on.
-my code that can only find one solution that takes only first equal element in (vect_diff) and ( vect_min) and continue ordering is below
for (int y = 0; y < vect_temp.size(); y++) {
     Min_diff(vect_temp);
     nex_min(vect_temp, next_point);
    for (int i = 0; i < vect_diff.size(); i++) {
     String element_min = vect_diff.get(i).toString();
     if (vect_min.contains(element_min)) {
       vec_ordering.add(element_min);
     _2nd_min_element = element_min;
      vec_temp.removeElement(next_point);
      next_point = _2nd_min_element;
      i = vect_diff.size();
     }// end if condition
    } // end for (i)loop
}// end for (y) loop
I hope that someone can answer me how to find all posssible reordering set it is urgent pleasssssse

DarrylBurke wrote:
Two months on and you still haven't done your own homework?
[http://forums.sun.com/thread.jspa?threadID=5423090]
dbWell, nobody has given the answer yet, so how can (s)he?

How to find an existing search help?

Hi Friends,
How to find an existing search help for some certain fields? for example search help "H_TVKO" is for "Help view for Sales Organizations"[for the field VKORG], and search help "MAT1" is for "Find Material Number"[for the field MATNR]...... but how to find these search helps for a certain field?
Thanks a lot!!

Hello Qiwei,
You can find the search help using their table and fields name.
simply you have to point the cursor on same field for which you want to see search help in SE11.and then in same window search help tab available click on this..
It will show all search help which is having same field.
Have a Nice Day.
Regards,
Sujeet
Edited by: Sujeet on Jan 14, 2009 10:41 AM

How to find hardcoded in ABAP programs

Dear Experts,
Please tell me how to find hardcoded in ABAP programs.

Hi Sam,
Generally in Abap program hardcoded strings are declared in single quotes ' .
for ex :
write : 'Report heading'. " search for ' in the entire program.
press FIND button in menu bar and type single quote ' . and select radio button ' IN MAIN PROGRAM '
Regards,
Aby.

How to find Latch and what actions need to be taken when there is a latch

Hi
Can you please tell me how to find Latch and what actions need to be taken when there is a latch?
Thanks
Regards,
RJ.

1. What is a latch?
Latches are low level serialization mechanisms used to protect shared
data structures in the SGA. The implementation of latches is operating
system dependent, particularly in regard to whether a process will wait
for a latch and for how long.
A latch is a type of a lock that can be very quickly acquired and freed.
Latches are typically used to prevent more than one process from
executing the same piece of code at a given time. Associated with each
latch is a cleanup procedure that will be called if a process dies while
holding the latch. Latches have an associated level that is used to
prevent deadlocks. Once a process acquires a latch at a certain level it
cannot subsequently acquire a latch at a level that is equal to or less
than that level (unless it acquires it nowait).
2. Latches vs Enqueues
Enqueues are another type of locking mechanism used in Oracle.
An enqueue is a more sophisticated mechanism which permits several concurrent
processes to have varying degree of sharing of "known" resources. Any object
which can be concurrently used, can be protected with enqueues. A good example
is of locks on tables. We allow varying levels of sharing on tables e.g.
two processes can lock a table in share mode or in share update mode etc.
One difference is that the enqueue is obtained using an OS specific
locking mechanism. An enqueue allows the user to store a value in the lock,
i.e the mode in which we are requesting it. The OS lock manager keeps track
of the resources locked. If a process cannot be granted the lock because it
is incompatible with the mode requested and the lock is requested with wait,
the OS puts the requesting process on a wait queue which is serviced in FIFO.
Another difference between latches and enqueues is that
in latches there is no ordered queue of waiters like in enqueues. Latch
waiters may either use timers to wakeup and retry or spin (only in
multiprocessors). Since all waiters are concurrently retrying (depending on
the scheduler), anyone might get the latch and conceivably the first one to
try might be the last one to get.
3. When do we need to obtain a latch?
A process acquires a latch when working with a structure in the SGA
(System Global Area). It continues to hold the latch for the period
of time it works with the structure. The latch is dropped when the
process is finished with the structure. Each latch protects a different
set of data, identified by the name of the latch.
Oracle uses atomic instructions like "test and set" for operating on latches.
Processes waiting to execute a part of code for which a latch has
already been obtained by some other process will wait until the
latch is released. Examples are redo allocation latches, copy
latches, archive control latch etc. The basic idea is to block concurrent
access to shared data structures. Since the instructions to
set and free latches are atomic, the OS guarantees that only one process gets
it. Since it is only one instruction, it is quite fast. Latches are held
for short periods of time and provide a mechanism for cleanup in case
a holder dies abnormally while holding it. This cleaning is done using
the services of PMON.
4. Latches request modes?
Latches request can be made in two modes: "willing-to-wait" or "no wait". Normally,
latches will be requested in "willing-to-wait" mode. A request in "willing-to-wait" mode
will loop, wait, and request again until the latch is obtained. In "no wait" mode the process
request the latch. If one is not available, instead of waiting, another one is requested. Only
when all fail does the server process have to wait.
Examples of "willing-to-wait" latches are: shared pool and library cache latches
A example of "no wait" latches is the redo copy latch.
5. What causes latch contention?
If a required latch is busy, the process requesting it spins, tries again
and if still not available, spins again. The loop is repeated up to a maximum
number of times determined by the initialization parameter SPINCOUNT.
If after this entire loop, the latch is still not available, the process must yield
the CPU and go to sleep. Initially is sleeps for one centisecond. This time is
doubled in every subsequent sleep.
This causes a slowdown to occur and results in additional CPU usage,
until a latch is available. The CPU usage is a consequence of the
"spinning" of the process. "Spinning" means that the process continues to
look for the availability of the latch after certain intervals of time,
during which it sleeps.
6. How to identify contention for internal latches?
Relevant data dictionary views to query
V$LATCH
V$LATCHHOLDER
V$LATCHNAME
Each row in the V$LATCH table contains statistics for a different type
of latch. The columns of the table reflect activity for different types
of latch requests. The distinction between these types of requests is
whether the requesting process continues to request a latch if it
is unavailable:
willing-to-wait If the latch requested with a willing-to-wait
request is not available, the requesting process
waits a short time and requests the latch again.
The process continues waiting and requesting until
the latch is available.
no wait If the latch requested with an immediate request is
not available, the requesting process does not
wait, but continues processing.
V$LATCHNAME key information:
GETS Number of successful willing-to-wait requests for
a latch.
MISSES Number of times an initial willing-to-wait request
was unsuccessful.
SLEEPS Number of times a process waited a requested a latch
after an initial wiling-to-wait request.
IMMEDIATE_GETS Number of successful immediate requests for each latch.
IMMEDIATE_MISSES Number of unsuccessful immediate requests for each latch.
Calculating latch hit ratio
To get the Hit ratio for latches apply the following formula:
"willing-to-wait" Hit Ratio=(GETS-MISSES)/GETS
"no wait" Hit Ratio=(IMMEDIATE_GETS-IMMEDIATE_MISSES)/IMMEDIATE_GETS
This number should be close to 1. If not, tune according to the latch name
7. Useful SQL scripts to get latch information
** Display System-wide latch statistics.
column name format A32 truncate heading "LATCH NAME"
column pid heading "HOLDER PID"
select c.name,a.addr,a.gets,a.misses,a.sleeps,
a.immediate_gets,a.immediate_misses,b.pid
from v$latch a, v$latchholder b, v$latchname c
where a.addr = b.laddr(+)
and a.latch# = c.latch#
order by a.latch#;
** Given a latch address, find out the latch name.
column name format a64 heading 'Name'
select a.name from v$latchname a, v$latch b
where b.addr = '&addr'
and b.latch#=a.latch#;
** Display latch statistics by latch name.
column name format a32 heading 'LATCH NAME'
column pid heading 'HOLDER PID'
select c.name,a.addr,a.gets,a.misses,a.sleeps,
a.immediate_gets,a.immediate_misses,b.pid
from v$latch a, v$latchholder b, v$latchname c
where a.addr = b.laddr(+) and a.latch# = c.latch#
and c.name like '&latch_name%' order by a.latch#;
8. List of all the latches
Oracle versions might differ in the latch# assigned to the existing latches.
The following query will help you to identify all latches and the number assigned.
column name format a40 heading 'LATCH NAME'
select latch#, name from v$latchname;

How to find all open POs and there SUM

How to find all open POs and there SUM
Please help.
Thanks,
vihar9

Have you tried looking at the tables, standard reports, or the PO display transaction? Have you asked your functional analyst or development team lead? This is not a forum to post a requirement and get your job done for you...

How to find who has deleted program

Hi,
Some one has delete a report from the system.How can I find the user who has deleted?
thanks

Hi ,
Please refer the threads,
How to find who deleted my program?
How to find deleted program
Best Regards.
Reward points if it is helpful.

How to find out the Trigeering program of an IDOC

How to find out the Trigeering program of an IDOC ?
Thank U

sse the FUnction module ..MASTER_IDOC_DISTRIBUTE..if it is used zreport or program
that means the message type used in the program are manually triggered.
Prabhudas

How to find out the source program file in Proposal in Sales Online in CRM

How to find out the source program file in Proposal in Sales Online in CRM

You can find it in the oracle->apps->prp directory.
It is the $JAVA_HOME

How to find all the tables associated for a particular transaction

Hi-
May I know how to find all the tables, related(foreign key) tables for a transaction within SAP GUI?
Up to my technical knowledge, this can be achieved by looking database diagrams from DB level. But that would be for entire database as a whole. What I'm expecting is to see transaction level relative tables that too from SAP GUI. Please share the possibilities if any.
Regards
Sekhar

Dear Micky Oestreich
May be we possess expertise or high level experience, it should not show up in our way of communication. Every professional starts with the basic stuff to learn. When the question is raised in such minimum polite way, the same level of courtesy is expected in return. If you felt my question was basic, you might have refused it gently. If you are in good mood or bad mood it doesn't matters.
Hi Vengal Rao
Thanks for your response. It helped me.
Regards
Sekhar

User being removed from Domain Admins...how to find all servers his account is being used.

We have a user that is being removed from IT (more like being forcefully demoted) and our owner still finds him valuable in other departments. My challenge is to find all servers that he may be using his account locally on (as a service or added to a local
admin group). It hasn't happened yet, but we need to be prepared to say we know all the servers his account is on when the owner demotes him.
I'm hoping someone has an approach to this that doesn't include going through tons of Event Viewer Security logs. We do have System Center Configuration Manager and Operations Manager 2012 w/ SP1, but the guy that is responsible for those is the guy we are removing
and none of us are aware on how to use the possible tools that those have. If you feel that those would do the trick then please point me to a "how to" and I'll try to learn on the fly. Otherwise I'll take any other suggestions.
~Rick

Hi Rick,
Based on my research, you can filter events logs based on user name and event ID:
Advanced XML filtering in the Windows Event Viewer
http://blogs.technet.com/b/askds/archive/2011/09/26/advanced-xml-filtering-in-the-windows-event-viewer.aspx
Best Regards,
Amy

How to find all the user exits includes ,

Hi All ,
I need to find all the includes which are created for purpose of implementing user exits , I know they all start with ZX* but where to get the list .
THank you all
Vinay Kolla

Hi Vinay....
Just excute following program in your ABAP Edter....
( Input parameters: T'CODE and User exit type.)
>TABLES: MODSAP, MODACT, TSTC.
>
>PARAMETERS: INPUT1 LIKE TSTC-TCODE DEFAULT ' ',
>           INPUT2 LIKE MODSAP-TYP DEFAULT ' '.
>
>DATA: SEARCH1(6),
>      SEARCH2(3),
>      SEARCH3 LIKE MODSAP-MEMBER.
>DATA : FIRST_ROW VALUE 'Y'.
>
>CONCATENATE: '%' INPUT1 '%' INTO SEARCH1,
>             '%' INPUT2     INTO SEARCH2.
>
>SELECT * FROM TSTC WHERE TCODE LIKE SEARCH1.
> FIRST_ROW = 'Y'.
> CHECK TSTC-PGMNA NE SPACE.
> CONCATENATE '%' TSTC-PGMNA '%' INTO SEARCH3.
> SELECT * FROM MODSAP WHERE TYP LIKE SEARCH2
>                       AND MEMBER LIKE SEARCH3.
>    SELECT SINGLE * FROM MODACT WHERE MEMBER = MODSAP-NAME.
>    IF FIRST_ROW EQ 'Y'.
>      WRITE: /0 TSTC-TCODE, 6 TSTC-PGMNA, 16 MODSAP-NAME, 32 MODSAP-TYP,
>                                       45 MODSAP-MEMBER, 70 MODACT-NAME.
>      FIRST_ROW = 'N'.
>    ELSE.
>WRITE: /16 MODSAP-NAME, 32 MODSAP-TYP, 45 MODSAP-MEMBER, 70 MODACT-NAME.
>    ENDIF.
>    CLEAR : MODSAP, MODACT.
> ENDSELECT.
> IF SY-SUBRC NE 0.
>    WRITE : /0 TSTC-TCODE, 6 TSTC-PGMNA, 30 'No exits found'.
> ENDIF.
> CLEAR TSTC.
>ENDSELECT.
>
>END-OF-SELECTION.
> CLEAR: SEARCH1, SEARCH2, SEARCH3.
Thanks,
Naveen Inuganti.

How to find all aliases? Search program needed

Similar Messages

Maybe you are looking for